<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta />
    <article-meta>
      <title-group>
        <article-title>About New Version of RSDS System</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Zbigniew Suraj</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Piotr Grochowalski</string-name>
          <email>piotrgg@ur.edu.pl</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Institute of Computer Science University of Rzeszow</institution>
          ,
          <addr-line>Rzeszow</addr-line>
          ,
          <country country="PL">Poland</country>
        </aff>
      </contrib-group>
      <fpage>398</fpage>
      <lpage>408</lpage>
      <abstract>
        <p>The aim of this paper is to present a new version of a bibliographic database system - Rough Set Database System (RSDS). The RSDS system, among others, includes bibliographic descriptions of publications on rough set theory and its applications. This system is also an experimental environment for research related to the processing of bibliographic data using the domain knowledge and the related information retrieval.</p>
      </abstract>
      <kwd-group>
        <kwd>rough sets</kwd>
        <kwd>data mining</kwd>
        <kwd>knowledge discovery</kwd>
        <kwd>pattern recognition</kwd>
        <kwd>database systems</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>Introduction</title>
      <p>The presented RSDS system is a bibliographic system that includes
bibliographical references aimed at disseminating information on publications on rough set
theory and its applications [4{8]. The system is available for free at http://rsds.
univ.rzeszow.pl. Currently about 4000 bibliographical descriptions of
publications are collected in its database.</p>
      <p>The RSDS system is also an experimental environment for carrying out research
related to the broadly de ned information processing based on the methods and
techniques in the eld of ontology and rough sets. In addition, it enables one
to analyze the data contained in the database by using the advanced statistical
and graphical methods and techniques.</p>
      <p>Apart from the bibliographical descriptions, it contains additionally:
{ information on software related to the theory and applications of rough sets,
{ bibliographies of people who render outstanding services to the development
of rough set theory and its applications,
{ personal details about the authors of publications whose descriptions are
included in the database of this system.</p>
      <p>The system was developed in the client-server technology, i.e., the data for
the system and mechanisms for handling such data are running on the server
and the user with the help of the web browser is able to access the resources.</p>
      <p>
        The work on the system began in 2002 and it is continued. During the works
there were developed two versions of the system that have been made available
for users [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ]-[
        <xref ref-type="bibr" rid="ref11">11</xref>
        ],[
        <xref ref-type="bibr" rid="ref14">14</xref>
        ]-[
        <xref ref-type="bibr" rid="ref15">15</xref>
        ],[
        <xref ref-type="bibr" rid="ref19">19</xref>
        ]. In March 2013, the third version of the system
was released. It has been completely rebuilt, allowing the introduction of larger
number of facilities for users of the system with the use of modern technology.
      </p>
      <p>In the current version the following changes was introduced:
{ exchange and reorganization of the engine of the system (CMS - Drupal),
{ rebuilding the website design,
{ rebuilding and upgrading the functionalities of the system,
{ increasing the role of the administrator(s) of the system - admin panel,
{ larger number of facilities for registered users - user panel,
{ introduction of the status of data and the possibility of its modi cation,
{ system-to-user communication via e-mail (on important issues).</p>
      <p>The rest of the paper is organized as follows. Section 2 describes the logical
structure of the RSDS system. Functionalities of the system are presented in
Section 3. Section 4 provides description of data for the system. Section 5 gives
the system requirements. The future plans for the RSDS system are discussed
in section 6.
2</p>
    </sec>
    <sec id="sec-2">
      <title>The Logical Structure of the System</title>
      <p>The RSDS system structure can be divided into four functional layers. Each of
these layers includes modules and with the help of these modules the layers meet
speci ed tasks (see Figure 2):
{ The presentation layer with the graphical interface module.
{ The application layer with the modules of login, add/edit, search, graph and
statistical, download, auxiliary (biographies of people, software, maps).
{ The communication layer with the module of communication with the database.
{ The physical layer containing the database.</p>
      <p>The purpose of the modules from the presentation layer is to communicate
with the user with the usage of created interface.</p>
      <p>In the application layer there are the modules implementing the main
functionalities of the system. The login module is responsible for the correct handling
of the login/logo process of the users and storing information about the users
logged in the system. The add and edit module supports the process of
implementing the new data into the system or editing already existing ones. It
will ensure the correctness of the input data and its correct assignment to the
user-owner. The search module performs the search process of the publications
descriptions meeting the criteria set by the user. The operation of this module
has been improved by implementing the results of the research connected with
the information retrieval in it. The graphic and statistical module is designed not
only for the analysis of data in the system but also for the analysis of the activity
of the users. The analysis is carried out in various aspects, such as publications,
the authors of the publication and the relationships between them. The purpose
of this module is the presentation of the results of these analyzes. The download
module provides the users with di erent options of retrieving data from the
system in the form of prepared bibliography. Auxiliary modules extend the basic
functionality of the system to the biographies of people who render
outstanding services to the development of rough set theory and its applications, and
descriptions of available software related to the theory of rough sets and also a
world map showing where the given problem is growing solved.</p>
      <p>The communication layer possesses a module that is responsible for the
proper communication with the database, which stores the data for the system.</p>
      <p>The physical layer includes a relational database in which the data are stored
and presented in the system.</p>
    </sec>
    <sec id="sec-3">
      <title>System Functionalities</title>
      <p>The basic functionalities of the RSDS system include:
{ Adding new data.
{ Editing existing data.
{ Data search.
{ Registration of users in the system.
{ Saving data to a le.
{ Sending data les to the administrator.
{ Service of user comments.
{ Statistics, analysis of statistical graphs, determining the Pawlak number of
the rst and second kind, classi er of publications.
{ Help.</p>
      <p>Capabilities and the content of the RSDS system are constantly extended.</p>
      <p>
        In order to store the held information in the simplest form and to exclude
redundancy (redundancy of data), the data for the RSDS system are stored in a
relational database. The database structure is based on the BibTeX format [
        <xref ref-type="bibr" rid="ref22">22</xref>
        ].
Well de ned and uniform structures of the description decided about its choice.
Additionally, the possibility of getting the bibliographical descriptions in the
BibTeX format included in the system, allowing one to automatically generate
bibliographies and attach them to the prepared publication, has been added to
the system.
      </p>
      <p>To share data, the system should be rst equipped with it. Data entry and
other operations allowing a modi cation of data, require user authentication by
logging on to the system. New users, in order to get access to the full
functionality of the system, need to register.</p>
      <p>Data entry can be performed by two independent pathways:
{ by prede ned forms;
{ with the usage of software able to read the les in the BibTeX format and
storing information in the system in the appropriate way.</p>
      <p>The usage of prede ned forms allows registered users to introduce new data into
the system individually. If one does not want to do this action individually or
intends to enter a large number of new data, he or she can send the data to
the system administrator and then administrator with the use of appropriate
software will enter the received data into the system. The advantage of the
individual data input by users is that they are assigned to them. In such case the
users are authorized to edit the data in the future. This possibility is available
only for registered users, in order to avoid entering incorrect information into
the system. System with published descriptions (data) provides various options
of searching.</p>
      <p>Searching for information on the RSDS system was implemented so far in
two main ways:
{ Alphabetical search by certain keywords, such as titles of publications, their
authors, editors, conference names, magazines, or year;
{ Advanced search based on speci ed criteria, which sought description of
publication has to ful ll.</p>
      <p>Each of the currently available options of nding information in the RSDS
system has both positive and negative aspects. Alphabetical search works when
you know for example: the author of sought publication, the name of the journal
in which the publication was published, who published a publication, or when
one knows the year of the publication. The weaker part of this search method,
however, is that in the absence of precise information about sought publication
the system provides the large number of publication descriptions meeting the
search criteria, which often have to be further analyzed by a painstaking selection
process. However, during advanced search, the user de nes the criteria which
have to be ful lled for the sought publication and, depending on the accuracy
of the selection of these criteria, he or she obtains more or less adequate results.
The problem of the further selection of obtained results still exists in many
cases. This process involves directing a user's query to the database system to
nd the matching (appropriate) data (publication) for your search pattern. This
matching is based on the nding of exact pattern in the data in the database.
If the matching to the pattern data is found, it will be annexed to the result.
This is repeated for all data located in the database. Then the edited result set
(publication) is sent to the user (see Figure 3).</p>
      <p>Finding information in the system process supplemented with the additional
knowledge (using ontology and methods of rough set theory) is presented in the
general form shown in Figure 4. This process in comparison with the mapping
speci ed search pattern is di erent in this that the system after receiving the
user's query accede to its confrontation with the information included in the
system [1{3, 17, 21]. This is done as follows: from the resources of the system
are retrieved the speci c ontologies for publication and they are veri ed for
their belonging to the inner circle of the sought information in the domain of
general ontology (taking into account the relationships between di erent types of
concept). In the case of positive veri cation the approximations are appointed for
a speci c publication. They are then aggregated into a single value representing
the total adjustment to the published information. When appointed value is
greater than the threshold value, the given publication will be included in the
result set. This process is repeated for all the data (publications). Next, after
the result set processing (division of publication into groups) it is sent to the
user. The developed methodology has been implemented in the system and made
available to the users in the ontological search section. In order to streamline
the process of building queries, for the system has been prepared the editor to
assist the creation of query-by-user. The functionalities of this editor are: auto
completion of entered concepts, de ned relational operators such as AND, OR,
NOT, and taking into account the priority of the process by using parentheses.</p>
      <p>In order to minimize the time complexity of the process, the determining of
the detailed ontology is carried out once. Determination of the detailed ontology
is a part of the process relying on the preparation for the implementation of the
system of bibliographic information for retrieval based on domain knowledge.
This process can be carried out in several steps, which also has been shown
(see Figure 5). The rst step is to develop the general ontology by the domain
expert. Then, on the basis of the system resources, supported by the domain
knowledge (general ontology) the detailed ontologies are determined. In the
process of the detailed ontology generation new concepts or relationships between
concepts can occur. In that case the system in cooperation with the domain
expert is able to include such concepts in the general ontology, thus creating
extended domain ontology. The nal step in this process is to determine the
degrees of bibliographical descriptions match to the elementary concepts from
the general ontology. This is done because of the minimization of time required
for determining the response to a query from user.</p>
      <p>
        The system, in addition to bibliographical data (represented in the form of
descriptive or BibTeX format) provides a fairly wide range of di erent statistics
and the results of the analyzes of the data [
        <xref ref-type="bibr" rid="ref12 ref13 ref16 ref18">12, 13, 16, 18</xref>
        ].
      </p>
      <p>In the carried out research the data collected from the year 1981 to the
present are taken into account. They are analyzed in two ways: statistical and
graphic. In relation to statistic data are processed in di erent compartments of
time:</p>
      <p>In terms of graphic analysis it is made on the basis of the de ned cooperation
CG graph. The graph vertices are the authors of the publications included in the
bibliographic system. Two vertices are connected by the edge when two authors
have written at least one common publication.</p>
      <p>In statistical analysis were determined the following values characterizing
the examined data set, i.e., the number of authors in respect to the number of
written publication, various kinds of means, standard deviations associated with
a particular medium, the number of works in respect to the number of authors
creating them.</p>
      <p>Graph analysis of the de ned CG graph lies in its overall analysis that is the
appointment of the average degree of vertex, of isolated vertices, etc. CG graph
after the rejection of isolated vertices has been further analyzed. It was based on
the determination of the components of the graph and the analysis of the largest
component. Determination of components allowed on determining the groups of
authors writing joint publications - the cooperating authors. These groups are
re ected in reality. The analyzed parameters of the largest component allows for
its accurate interpretation.</p>
      <p>
        Additionally, the system allows users to read the Pawlak number of the rst
and second kind, which values indicate the strength of the proximity of
publishing author's work with prof. Z. Pawlak, i.e., the less value of the Pawlak
number represents the stronger relation between the author of published work
and Professor Pawlak [
        <xref ref-type="bibr" rid="ref18 ref20">18, 20</xref>
        ].
      </p>
      <p>All analyzes are performed dynamically, i.e., the calculation of parameters is
taking into account any change in the data collected in system.
4</p>
    </sec>
    <sec id="sec-4">
      <title>Input-output Data</title>
      <p>
        Bibliographical descriptions are described in the system according to speci
cations of BibTeX [
        <xref ref-type="bibr" rid="ref22">22</xref>
        ]. This means that the description of each publication is
divided into elements de ned by BibTeX, such as title, publisher, year of
publication, the keywords, abstract, etc. The prepared descriptions are placed in
a relational database. Each component is stored in the database structure
dened as a string, the importance of which, unfortunately, neither database nor
database languages can understand. An example of a bibliographic description
located in the system is presented in Table 1. Descriptions of publications are
formulated in English.
      </p>
    </sec>
    <sec id="sec-5">
      <title>System Requirements</title>
      <p>The RSDS system can be run on any computer that is connected to the Internet.
The computer must have an operating system equipped with web browser. The
presented above requirements must be met, as the RSDS system is an online
system and requires a permanent connection to the Internet. In addition, a web
browser, in which the system will be running, must support JavaScript scripting
language, CSS style sheets and cookies. The system has been tested with the
following browsers: Internet Explorer 9, Mozilla Firefox 17, and Chrome 23.
6</p>
    </sec>
    <sec id="sec-6">
      <title>Plans for the Future</title>
      <p>The directions of further research and work related to the system will be:
{ development of a method for the formal veri cation of the correctness of the
de ned relations in the general ontology,
{ increase of the degree of e ciency of information retrieval,
{ automation of the process of processing of the owned information,
{ attempt to improve the quality of semantic analysis,
{ development of new functionalities of the system increasing its features such
as: automatic discovery of scienti c user pro le, nding new data from
Internet resources, extending the analysis of owned data, etc.</p>
      <p>Acknowledgment. We would like to thank everyone who contributed to the
creation and development of the RSDS system, in particular to Grzegorz Swistak
and Przemyslaw Wanat.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Grochowalski</surname>
            <given-names>P.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Pancerz</surname>
            <given-names>K.</given-names>
          </string-name>
          ,
          <article-title>The outline of an ontology for the rough set theory and its applications</article-title>
          . In Czaja L.,
          <string-name>
            <surname>Penczek</surname>
            <given-names>W.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Salwicki</surname>
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Schlinglo</surname>
            <given-names>H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Skowron</surname>
            <given-names>A.</given-names>
          </string-name>
          , Suraj
          <string-name>
            <given-names>Z.</given-names>
            ,
            <surname>Lindemann</surname>
          </string-name>
          <string-name>
            <given-names>G.</given-names>
            ,
            <surname>Burkhard H.-D.</surname>
          </string-name>
          (Eds.),
          <source>Proceedings of the Workshop on Concurrency, Speci cation and Programming</source>
          ,
          <source>CS&amp;P2008</source>
          ,
          <string-name>
            <surname>Gross-Vater</surname>
            <given-names>See</given-names>
          </string-name>
          , Berlin, 29 September - 1
          <string-name>
            <surname>October</surname>
          </string-name>
          ,
          <year>2008</year>
          , vol.
          <volume>1</volume>
          -
          <issue>3</issue>
          , pp.
          <volume>192</volume>
          {
          <fpage>204</fpage>
          .
          <string-name>
            <surname>InformatikBerichte</surname>
          </string-name>
          ,
          <year>2008</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Grochowalski</surname>
            <given-names>P.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Pancerz</surname>
            <given-names>K.</given-names>
          </string-name>
          ,
          <article-title>The outline of an ontology for the rough set theory and its applications</article-title>
          .
          <source>Fundamenta Informaticae</source>
          ,
          <volume>93</volume>
          (
          <issue>1-3</issue>
          ):
          <volume>143</volume>
          {
          <fpage>154</fpage>
          ,
          <year>2009</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Pancerz</surname>
            <given-names>K.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Grochowalski</surname>
            <given-names>P.</given-names>
          </string-name>
          ,
          <article-title>Matching Ontological Subgraphs to Concepts: a Preliminary Rough Set Approach</article-title>
          .
          <source>In Proceedings of the 10th International Conference on Intelligent Systems Design and Applications</source>
          (ISDA'
          <year>2010</year>
          ), Cairo, Egypt,
          <source>November 29 - December 1</source>
          ,
          <year>2010</year>
          , pp.
          <volume>1394</volume>
          {
          <issue>1399</issue>
          ,
          <string-name>
            <given-names>IEEE</given-names>
            <surname>Xplore</surname>
          </string-name>
          ,
          <year>2010</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4. Pawlak
          <string-name>
            <surname>Z.</surname>
          </string-name>
          , Rough Sets.
          <source>International Journal of Computer and Information Sciences</source>
          ,
          <volume>11</volume>
          :
          <fpage>341</fpage>
          {
          <fpage>356</fpage>
          ,
          <year>1982</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5. Pawlak
          <string-name>
            <given-names>Z.</given-names>
            ,
            <surname>Grzymala-Busse</surname>
          </string-name>
          <string-name>
            <given-names>J.W.</given-names>
            ,
            <surname>Slowinski</surname>
          </string-name>
          <string-name>
            <given-names>R.</given-names>
            , and
            <surname>Ziarko</surname>
          </string-name>
          <string-name>
            <surname>W.</surname>
          </string-name>
          , Rough Sets.
          <source>Communications of the ACM</source>
          ,
          <volume>38</volume>
          (
          <issue>11</issue>
          ):
          <volume>88</volume>
          {
          <fpage>95</fpage>
          ,
          <string-name>
            <surname>November</surname>
          </string-name>
          <year>1995</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6. Pawlak
          <string-name>
            <given-names>Z.</given-names>
            and
            <surname>Skowron</surname>
          </string-name>
          <string-name>
            <surname>A.</surname>
          </string-name>
          ,
          <source>Rough Sets and Boolean Reasoning. Information Sciences</source>
          ,
          <volume>177</volume>
          (
          <issue>1</issue>
          ):
          <volume>41</volume>
          {
          <fpage>73</fpage>
          ,
          <year>2007</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>Polkowski L.T.</surname>
          </string-name>
          ,
          <source>Rough Sets. Mathematical Foundations. Advances in Soft Computing</source>
          . Physica-Verlag, Heidelberg,
          <year>2002</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Skowron</surname>
            <given-names>A.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Pal S</surname>
          </string-name>
          .K. (Eds.), Special Volume:
          <article-title>Rough Sets, Pattern Recognition and Data Mining</article-title>
          , vol.
          <volume>24</volume>
          (
          <issue>6</issue>
          ), Pattern Recognition Letters. North Holland,
          <year>2003</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9. Suraj
          <string-name>
            <given-names>Z.</given-names>
            and
            <surname>Grochowalski</surname>
          </string-name>
          <string-name>
            <surname>P.</surname>
          </string-name>
          ,
          <article-title>The Rough Sets Database System: An Overview</article-title>
          . In Komorowski J.,
          <string-name>
            <surname>Grzymala-Busse</surname>
            <given-names>J.W.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Tsumoto</surname>
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Slowinski</surname>
            <given-names>R</given-names>
          </string-name>
          . (Eds.),
          <source>Proceedings of the 4th International Conference on Rough Sets and Current Trends in Computing, RSCTC</source>
          <year>2004</year>
          , Uppsala, Sweden,
          <year>June 2004</year>
          , vol.
          <volume>3066</volume>
          ,
          <string-name>
            <surname>Lecture</surname>
            <given-names>Notes</given-names>
          </string-name>
          <source>in Arti cial Intelligent</source>
          , pp.
          <volume>841</volume>
          {
          <issue>849</issue>
          , Springer-Verlag,
          <year>2004</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10. Suraj
          <string-name>
            <given-names>Z.</given-names>
            and
            <surname>Grochowalski</surname>
          </string-name>
          <string-name>
            <surname>P.</surname>
          </string-name>
          ,
          <source>The Rough Set Database System: An Overview. Transactions on Rough Sets III, Lecture Notes of Computer Sciences</source>
          , vol.
          <volume>3400</volume>
          , Springer-Verlag, Berlin, pp.
          <volume>190</volume>
          {
          <issue>201</issue>
          ,
          <year>2005</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11. Suraj
          <string-name>
            <given-names>Z.</given-names>
            and
            <surname>Grochowalski</surname>
          </string-name>
          <string-name>
            <surname>P.</surname>
          </string-name>
          ,
          <article-title>Functional extension of the RSDS system</article-title>
          . In Hirano S.,
          <string-name>
            <surname>Inuiguchi</surname>
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Miyamoto</surname>
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Nguyen</surname>
            <given-names>H.S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Slowinski</surname>
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Greco</surname>
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hata</surname>
            <given-names>Y</given-names>
          </string-name>
          . (Eds.),
          <source>Proceedings of the 5th International Conference on Rough Sets and Current Trends in Computing, RSCTC</source>
          <year>2006</year>
          , Kobe, Japan,
          <year>November 2006</year>
          , vol.
          <volume>4259</volume>
          ,
          <string-name>
            <surname>Lecture</surname>
            <given-names>Notes</given-names>
          </string-name>
          <source>in Arti cial Intelligent</source>
          , pp.
          <volume>786</volume>
          {
          <fpage>795</fpage>
          . Springer-Verlag,
          <year>2006</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12. Suraj
          <string-name>
            <given-names>Z.</given-names>
            and
            <surname>Grochowalski</surname>
          </string-name>
          <string-name>
            <surname>P.</surname>
          </string-name>
          ,
          <article-title>Patterns of collaborations in rough set research</article-title>
          . In Gomez V.,
          <string-name>
            <surname>Bello</surname>
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Falcon</surname>
            <given-names>R</given-names>
          </string-name>
          . (Eds.),
          <source>Proceedings of the International Symposium on Fuzzy and Rough Sets</source>
          ,
          <string-name>
            <surname>ISFUROS</surname>
          </string-name>
          <year>2006</year>
          ,
          <string-name>
            <given-names>Santa</given-names>
            <surname>Clara</surname>
          </string-name>
          , Cuba, December 5-
          <issue>8</issue>
          ,
          <year>2006</year>
          , pp.
          <volume>1</volume>
          {
          <fpage>7</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13. Suraj
          <string-name>
            <given-names>Z.</given-names>
            and
            <surname>Grochowalski</surname>
          </string-name>
          <string-name>
            <given-names>P.</given-names>
            , Patterns of Collaborations in Rough Set Research. In Bello R.,
            <surname>Falcon</surname>
          </string-name>
          <string-name>
            <given-names>R.</given-names>
            ,
            <surname>Pedrycz</surname>
          </string-name>
          <string-name>
            <given-names>W.</given-names>
            ,
            <surname>Kacprzyk</surname>
          </string-name>
          <string-name>
            <surname>J</surname>
          </string-name>
          . (Eds.),
          <article-title>Granular Computing: at the Junction of Fuzzy Sets and Rough Sets, Studies in Fuzziness and Soft Computing</article-title>
          , vol.
          <volume>224</volume>
          , Springer-Verlag,
          <year>2008</year>
          , pp.
          <volume>79</volume>
          {
          <fpage>92</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          14. Suraj
          <string-name>
            <given-names>Z.</given-names>
            and
            <surname>Grochowalski</surname>
          </string-name>
          <string-name>
            <surname>P.</surname>
          </string-name>
          ,
          <source>The Rough Set Database System. Transactions on Rough Sets VIII, Lecture Notes of Computer Sciences</source>
          , vol.
          <volume>3400</volume>
          , Springer-Verlag, pp.
          <volume>307</volume>
          {
          <issue>331</issue>
          ,
          <year>2008</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          15. Suraj
          <string-name>
            <given-names>Z.</given-names>
            ,
            <surname>Grochowalski</surname>
          </string-name>
          <string-name>
            <given-names>P.</given-names>
            ,
            <surname>Garwol</surname>
          </string-name>
          <string-name>
            <given-names>K.</given-names>
            , and
            <surname>Pancerz</surname>
          </string-name>
          <string-name>
            <surname>K.</surname>
          </string-name>
          ,
          <article-title>Toward intelligent searching the rough set database system: an ontological approach</article-title>
          . In Szczuka M.,
          <string-name>
            <surname>Czaja</surname>
            <given-names>L</given-names>
          </string-name>
          . (Eds.),
          <source>Proceedings of the CS&amp;P'2009 Workshop</source>
          , Krakow-Przegorzaly,
          <fpage>28</fpage>
          -
          <lpage>30</lpage>
          September,
          <year>2009</year>
          , vol.
          <volume>1</volume>
          -
          <issue>2</issue>
          , pp.
          <volume>574</volume>
          {
          <issue>582</issue>
          , Warsaw University,
          <year>2009</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          16. Suraj
          <string-name>
            <given-names>Z.</given-names>
            and
            <surname>Grochowalski</surname>
          </string-name>
          <string-name>
            <surname>P.</surname>
          </string-name>
          ,
          <article-title>Some Comparative Analyses of Data in the RSDS System</article-title>
          . In Yu J.,
          <string-name>
            <surname>Greco</surname>
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lingras</surname>
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Wang</surname>
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Skowron</surname>
            <given-names>A</given-names>
          </string-name>
          . (Eds.),
          <source>Proceedings of the 5th International Conference on Rough Sets and Knowledge Technology, RSKT</source>
          <year>2010</year>
          , Beijing, China,
          <source>October 15-17</source>
          ,
          <year>2010</year>
          ,
          <source>Lecture Notes in Arti cial Intelligence</source>
          , vol.
          <volume>6401</volume>
          , Springer-Verlag, pp.
          <volume>8</volume>
          {
          <issue>15</issue>
          ,
          <year>2010</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          17. Suraj
          <string-name>
            <given-names>Z.</given-names>
            and
            <surname>Grochowalski</surname>
          </string-name>
          <string-name>
            <surname>P.</surname>
          </string-name>
          ,
          <article-title>Toward intelligent searching the Rough Set Database System (RSDS): an ontological approach</article-title>
          .
          <source>Fundamenta Informaticae</source>
          ,
          <volume>101</volume>
          (
          <issue>1-2</issue>
          ):
          <volume>115</volume>
          {
          <fpage>123</fpage>
          ,
          <year>2010</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          18. Suraj
          <string-name>
            <given-names>Z.</given-names>
            ,
            <surname>Grochowalski</surname>
          </string-name>
          <string-name>
            <given-names>P.</given-names>
            , and Lew L.,
            <surname>Pawlak Collaboration</surname>
          </string-name>
          Graph and
          <string-name>
            <given-names>Its</given-names>
            <surname>Properties</surname>
          </string-name>
          .
          <source>Proceedings of the 13th International Conference on Rough Sets</source>
          ,
          <article-title>Fuzzy Sets, Data Mining and Granular Computing (RSFDGrC'</article-title>
          <year>2011</year>
          ), Moscow, Russia, June 27-30,
          <year>2011</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          19. Suraj
          <string-name>
            <given-names>Z.</given-names>
            and
            <surname>Grochowalski</surname>
          </string-name>
          <string-name>
            <surname>P.</surname>
          </string-name>
          ,
          <article-title>RoSetOn: The Open Project for Ontology of Rough Sets and Related Fields</article-title>
          . In J.T. Yao et al. (Eds.),
          <source>Proceedings of the 6th International Conference on Rough Sets and Knowledge Technology, RSKT</source>
          <year>2011</year>
          , Ban , Canada, October 9-
          <issue>12</issue>
          ,
          <year>2011</year>
          , Lecture Notes in Computer Science, vol.
          <volume>6954</volume>
          , Springer-Verlag, pp.
          <volume>414</volume>
          {
          <issue>419</issue>
          ,
          <year>2011</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          20. Suraj
          <string-name>
            <given-names>Z.</given-names>
            ,
            <surname>Grochowalski</surname>
          </string-name>
          <string-name>
            <given-names>P.</given-names>
            , and
            <surname>Lew</surname>
          </string-name>
          <string-name>
            <surname>L</surname>
          </string-name>
          ,
          <article-title>Discovering Patterns of Collaboration in Rough Set Research: Statistical and Graph-Theoretical Approach</article-title>
          . In J.T. Yao et al. (Eds.),
          <source>Proceedings of the 6th International Conference on Rough Sets and Knowledge Technology, RSKT</source>
          <year>2011</year>
          , Ban , Canada, October 9-
          <issue>12</issue>
          ,
          <year>2011</year>
          , Lecture Notes in Computer Science, vol.
          <volume>6954</volume>
          , Springer-Verlag, pp.
          <volume>238</volume>
          {
          <issue>247</issue>
          ,
          <year>2011</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          21. Suraj
          <string-name>
            <given-names>Z.</given-names>
            ,
            <surname>Grochowalski</surname>
          </string-name>
          <string-name>
            <given-names>P</given-names>
            , and
            <surname>Pancerz</surname>
          </string-name>
          <string-name>
            <surname>K.</surname>
          </string-name>
          ,
          <article-title>Knowledge Representation and Automated Methods of Searching for Information in Bibliographical Data Bases: A Rough Set Approach</article-title>
          . In Skowron A., Suraj
          <string-name>
            <surname>Z</surname>
          </string-name>
          . (Eds.),
          <source>Rough Sets and Intelligent Systems - Professor Zdzislaw Pawlak In Memoriam, Intelligent Systems Reference Library</source>
          , vol.
          <volume>43</volume>
          , pp.
          <volume>515</volume>
          {
          <issue>538</issue>
          ,
          <year>2012</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>22. BibTeX. Available: http://www.bibtex.org/</mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>