{"title":"The transitive closures of matrices over distributive lattices","authors":"Guilong Liu","doi":"10.1109/GRC.2006.1635759","DOIUrl":"https://doi.org/10.1109/GRC.2006.1635759","url":null,"abstract":"In this paper, we study the transitive closure for any matrix over an arbitrary distributive lattice. It is shown that any matrix over a distributive lattice has a transitive closure. This existential result can be turned into an explicit expression. It is well-known that the Warshall’s algorithm is a more efficient algorithm for computing transitive closure of a relation on a finite universe. In order to give a more efficient algorithm for the transitive closure of a lattice matrix, the Warshall’s algorithm, which is used for computing transitive closure of a matrix over an arbitrary distributive lattice, is established.","PeriodicalId":400997,"journal":{"name":"2006 IEEE International Conference on Granular Computing","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123085631","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A novel neural network model for different information granulation processing","authors":"Zhao Jianmin, Liang Jiuzhen","doi":"10.1109/GRC.2006.1635756","DOIUrl":"https://doi.org/10.1109/GRC.2006.1635756","url":null,"abstract":"This paper presents a neural network model for processing different information granulation. Based on the requirement for processing mass information, different hierarchies of the information granulation are constructed. The basic concepts and researches of information granulation are introduced in this paper. And the model that can accept different inputs of information granulation in different levels is presented. Also this paper offers the deduction of the supervised learning algorithm for the neural network taking the three levels of granulation for instance. An example of college student comprehensive estimation is stimulated by the presented model, and experiment results illustrate that the model is efficient.","PeriodicalId":400997,"journal":{"name":"2006 IEEE International Conference on Granular Computing","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121809476","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Using null data processing to recognize variant computer viruses for rule-based anti-virus systems","authors":"Trương Minh Nhật Quang, H. Kiem, N. Thuy","doi":"10.1109/GRC.2006.1635874","DOIUrl":"https://doi.org/10.1109/GRC.2006.1635874","url":null,"abstract":"MAV-operated algorithm has the same performance as other anti-virus software whose algorithms require bigger viruses signature database.","PeriodicalId":400997,"journal":{"name":"2006 IEEE International Conference on Granular Computing","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115795424","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Some learning paradigms for granular computing","authors":"R. Yager","doi":"10.1109/GRC.2006.1635750","DOIUrl":"https://doi.org/10.1109/GRC.2006.1635750","url":null,"abstract":"I. HIERARCHICAL ARCHITECTURE FOR FUZZY MODELING HE basic approach used in fuzzy logic for the modeling of complex relationships is called fuzzy systems modeling. This approach has been used in many of the successful applications of fuzzy logic [1]. It allows for rapid and inexpensive development of systems by greatly reducing the number of rules needed in the modeling process. It also contributes to reductions in the time consuming task of knowledge engineering by allowing the capturing of expert knowledge in a manner easy for the expert to articulate by providing a bridge between human linguistic expression and the types of formal models needed for computer processing and manipulation. We describe an extension of this basic fuzzy systems model which uses a hierarchical organization of the rules. This framework, called a Hierarchical Prioritized Structure (HPS) [2-9], allows for the modeling of more complex relationships and can be used in the construction of large scale fuzzy systems models. The HPS has a number of features that can further contribute to reduction in the costs associated with the task of knowledge engineering. One feature is its ability to allow the modeling of default rules. There are a number of benefits associated with models that allow for the inclusion of default rules. The use of default rules contribute to affordable systems development by further reducing the number of rules needed. They also give the synthetic entities a robustness to operate in situations in which they have not been explicitly programmed or trained. It allows for modularity by enabling the modeling of common sense. Another important feature of this HPS structure is that it provides a framework in which model adaption can naturally take place by allowing rules and knowledge to move between different levels of the hierarchy. This allows for the inclusion of new knowledge without the complete repudiation of old knowledge by just moving the old knowledge to a lower level. This allows for the modeling of more sophisticated and human-like learning mechanisms.","PeriodicalId":400997,"journal":{"name":"2006 IEEE International Conference on Granular Computing","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117235707","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Semantic integration of web services and peertopeer networks to achieve fault-tolerance","authors":"J. Cardoso","doi":"10.1109/GRC.2006.1635920","DOIUrl":"https://doi.org/10.1109/GRC.2006.1635920","url":null,"abstract":"One fundamental property that critical Web services need to provide is a high level of availability. Along with the development of Web services, considerable technological advances are being made to use the semantic Web to achieve the automated processing and integration of data and applications. This paper describes the implementation of the Whisper architecture. This architecture semantically integrates Web services with a peer-to-peer infrastructure to increase service availability. Whisper achieves transparent fault-tolerance by automatically forwarding Web service requests to semantically equivalent peers that are dynamically located, selected, and invoked.","PeriodicalId":400997,"journal":{"name":"2006 IEEE International Conference on Granular Computing","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124910873","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Dynamic Task Distribution in the Grid for BLAST","authors":"E. Afgan, P. Sathyanarayana, P. Bangalore","doi":"10.1109/GRC.2006.1635863","DOIUrl":"https://doi.org/10.1109/GRC.2006.1635863","url":null,"abstract":"BLAST programs are being widely used as tools for searching protein and DNA databases for sequence similarities. Even though many parallelization approaches have been developed in order to decrease the search time, individual databases are growing at a faster pace making searches longer than ever. Fortunately, Grid middleware is finding its acceptance across many campus Grids which are starting to utilize more and more distributed and smaller resources which would normally sit idle. Dynamic BLAST is an open-source implementation relying on Grid middleware technologies to distribute multiple queries across many, possibly geographically distributed, resources and thus perform searches resulting in shorter turnaround time. All of the intricacies of resource acquisition, data distribution, and job submission are handled by Dynamic BLAST, without any user intervention. We present the architectural and implementation details along with the experimental results to illustrate the scalability and usability of the system in a campus grid.","PeriodicalId":400997,"journal":{"name":"2006 IEEE International Conference on Granular Computing","volume":"80 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126010034","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Artificial general intelligence and classical neural network","authors":"Pei Wang","doi":"10.1109/GRC.2006.1635771","DOIUrl":"https://doi.org/10.1109/GRC.2006.1635771","url":null,"abstract":"The research goal of Artificial General Intelligence (AGI) and the notion of Classical Neural Network (CNN) are specified. With respect to the requirements of AGI, the strength and weakness of CNN are discussed, in the aspects of knowledge representation, learning process, and overall objective of the system. To resolve the issues in CNN in a general and efficient way remains a challenge to future neural network research.","PeriodicalId":400997,"journal":{"name":"2006 IEEE International Conference on Granular Computing","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116555282","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Computing non-redundant bases of if-then rules from data tables with graded attributes","authors":"R. Belohlávek, Vilém Vychodil","doi":"10.1109/GRC.2006.1635784","DOIUrl":"https://doi.org/10.1109/GRC.2006.1635784","url":null,"abstract":"We present a method for computation of non- redundant bases of attribute implications from data tables with fuzzy attributes. Attribute implications are formulas describing particular dependencies of attributes in data. A non-redundant basis is a minimal set of attribute implications such that each attribute implication which is true in a given data (semantically) follows from the basis. Our bases are uniquely given by so-called systems of pseudo-intents. Pseudo-intents are particular granules in data tables. We reduce the problem of computing systems of pseudo-intents to the problem of computing maximal independent sets in certain graphs. We present theoretical foundations, the algorithm, and demonstrating examples.","PeriodicalId":400997,"journal":{"name":"2006 IEEE International Conference on Granular Computing","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114272966","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Hong Lin, J. Rushing, S. Graves, S. Tanner, E. Criswell
{"title":"Real time target tracking with binary sensor networks and parallel computing","authors":"Hong Lin, J. Rushing, S. Graves, S. Tanner, E. Criswell","doi":"10.1109/GRC.2006.1635768","DOIUrl":"https://doi.org/10.1109/GRC.2006.1635768","url":null,"abstract":"A parallel real time data fusion and target tracking algorithm for very large binary sensor networks is presented. A binary sensor can give an on or off signal to indicate the presence or absence of targets within its range, but it cannot tell how many targets are present, where the targets are, how fast they are moving, or which direction they are heading. In order to detect and track targets using these sensors, it is necessary to fuse information from more than one sensor. A parallel data fusion process based on simulated annealing is used to identify and locate targets. Processing is performed on a commodity Linux cluster with communication between nodes facilitated by the Message Passing Interface (MPI). The fusion and tracking algorithm is tested with a wide variety of sensor network parameters using target track data from a theater level air combat simulation. It is demonstrated that very accurate target detection and localization are possible even though the binary sensors themselves provide little information and have high error rates. Real time tracking is performed on a network with 2.5 million sensors on a commodity cluster with only 50 processors.","PeriodicalId":400997,"journal":{"name":"2006 IEEE International Conference on Granular Computing","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129812548","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}