Position Papers of the 2014 Federated Conference on Computer Science and Information Systems

Abstract

EAR Reader, it is our pleasure to present to you Position Papers of the 2014 Federated Conference on Computer Science and Information Systems (FedCSIS), which took place in Warsaw, Poland, on September 7-10, 2014. This is the second year when position papers have been introduced as a separate category of contributions. They represent emerging research papers and challenge papers. The former present preliminary research results from work-inprogress based on sound scientific approach but presenting work not completely validated as yet. The latter propose and describe research challenges in theory or practice of computer science and information systems. viii HE AAIA'14 will bring researchers, developers, practitioners, and users to present their latest research, results, and ideas in all areas of artificial intelligence. We hope that theory and successful applications presented at the AAIA'14 will be of interest to researchers and practitioners who want to know about both theoretical advances and latest applied developments in Artificial Intelligence. As such AAIA'14 will provide a forum for the exchange of ideas between theoreticians and practitioners to address the important issues.T TOPICS Papers related to theories, methodologies, and applications in science and technology in this theme are especially solicited. Topics covering industrial issues/applications and academic research are included, but not limited to:• Knowledge Management PROFESSOR ZDZISLAW PAWLAK BEST PAPER AWARDS We are proud to announce that we will continue the tradition started during the AAIA'06 Symposium and award two "Professor Zdzislaw Pawlak Best Paper Awards" for contributions which are outstanding in their scientific quality. The two award categories are:• Best Student Paper -for graduate or PhD students. Papers qualifying for this award must be marked as "Student full paper" to be eligible for consideration.• Best Paper Award for the authors of the best paper appearing at the Symposium. Candidates for the awards can come from AAiA and all workshops organized within its framework (i.e. AIMA, ASIR, CEIM, TAIE, WCO)In addition to a certificate, each award carries a prize of 300 EUR provided by the Mazowsze Chapter of the Polish Information Processing Society. Abstract-I will analyze Pawlak's rough sets and extend the usual setting of characterization via an equivalence relation to any arbitrary relation, or a full relation. I extract the specification of rough sets by two operators: probable operator and sure operator. This would provide a general framework to analyze full rough sets and to compare them with Pawlak's rough sets. It also facilitates all the computation and further expansion. This paper extends Pawlak's approximation approach to any arbitrary relations and explicitly defines several computational operators to study the closeness regarding the characterization of operations on sets.