{"title":"Solving Course Timetabling Problem Using Interrelated Approach","authors":"A. Aftab, Zhou-ming Li","doi":"10.1109/GrC.2010.13","DOIUrl":"https://doi.org/10.1109/GrC.2010.13","url":null,"abstract":"","PeriodicalId":126161,"journal":{"name":"IEEE International Conference on Granular Computing","volume":"73 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127374778","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}
Pub Date : 1900-01-01DOI: 10.1109/GrC.2013.6740409
Zhaohui Liu, Z. Zeng
{"title":"Complex scientific management of China's higher education","authors":"Zhaohui Liu, Z. Zeng","doi":"10.1109/GrC.2013.6740409","DOIUrl":"https://doi.org/10.1109/GrC.2013.6740409","url":null,"abstract":"","PeriodicalId":126161,"journal":{"name":"IEEE International Conference on Granular Computing","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125344244","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}
Pub Date : 1900-01-01DOI: 10.1109/GRC.2006.1635819
Jiyi Wang, Renbing Lin
A new concept of knowledge reduction is introduced in inconsistent decision information system. It is described as maximum value distribution reduction, which preserves all maximum decision rules. The maximum value distribution eliminates the harsh requirement of the distribution and overcomes the drawbacks of the maximum distribution that may reduce the reliability of the derived decision rules. The relationships among distribution reduction, maximum value distribution reduction, maximum distribution reduction are examined. A criterion theorem and discriminating matrix with respect to maximum value reductions are obtained, hence a new approach to knowledge reduction in inconsistent information systems is proposed.
{"title":"A new knowledge reduction in inconsistent decision information system","authors":"Jiyi Wang, Renbing Lin","doi":"10.1109/GRC.2006.1635819","DOIUrl":"https://doi.org/10.1109/GRC.2006.1635819","url":null,"abstract":"A new concept of knowledge reduction is introduced in inconsistent decision information system. It is described as maximum value distribution reduction, which preserves all maximum decision rules. The maximum value distribution eliminates the harsh requirement of the distribution and overcomes the drawbacks of the maximum distribution that may reduce the reliability of the derived decision rules. The relationships among distribution reduction, maximum value distribution reduction, maximum distribution reduction are examined. A criterion theorem and discriminating matrix with respect to maximum value reductions are obtained, hence a new approach to knowledge reduction in inconsistent information systems is proposed.","PeriodicalId":126161,"journal":{"name":"IEEE International Conference on Granular Computing","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125417798","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}
aim of granular computing is to obtain feasible approximate solutions satisfied enough with least complexity. The logic reasoning process using extension method actually implies the ideal of granular computing. This paper uses the relation-element as the measure of granulation and applies granular computing to the reasoning process of the extension criminal reconnaissance system to reduce the complexity of the extension inference.
{"title":"Application of Granular Computing in Extension Criminal Reconnaissance System","authors":"Yunhua Chen, Yongquan Yu, Bi Zeng, Minghui Wang","doi":"10.1109/GrC.2007.35","DOIUrl":"https://doi.org/10.1109/GrC.2007.35","url":null,"abstract":"aim of granular computing is to obtain feasible approximate solutions satisfied enough with least complexity. The logic reasoning process using extension method actually implies the ideal of granular computing. This paper uses the relation-element as the measure of granulation and applies granular computing to the reasoning process of the extension criminal reconnaissance system to reduce the complexity of the extension inference.","PeriodicalId":126161,"journal":{"name":"IEEE International Conference on Granular Computing","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114359883","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}
Pub Date : 1900-01-01DOI: 10.1109/GRC.2005.1547327
Yanhua Du, Lifeng Ai, Chunhuang Liu
Petri nets and temporal logic are efficient tools to study concurrent systems, but each has their own shortages. Thus, we introduce temporal Petri nets to model, analyze and verify train safety comprehensive monitoring system. On one hand, we describe frameworks of this system using Petri nets. On the other hand, we use temporal logic to describe temporal relationships of system states. Then, we analyze and verify the properties of model and conclude that the system is reliable and effective.
{"title":"Modeling and verification of train safety comprehensive monitoring system using temporal Petri nets","authors":"Yanhua Du, Lifeng Ai, Chunhuang Liu","doi":"10.1109/GRC.2005.1547327","DOIUrl":"https://doi.org/10.1109/GRC.2005.1547327","url":null,"abstract":"Petri nets and temporal logic are efficient tools to study concurrent systems, but each has their own shortages. Thus, we introduce temporal Petri nets to model, analyze and verify train safety comprehensive monitoring system. On one hand, we describe frameworks of this system using Petri nets. On the other hand, we use temporal logic to describe temporal relationships of system states. Then, we analyze and verify the properties of model and conclude that the system is reliable and effective.","PeriodicalId":126161,"journal":{"name":"IEEE International Conference on Granular Computing","volume":"460 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116233615","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}
Pub Date : 1900-01-01DOI: 10.1109/GrC.2013.6740415
Qiwei Hu, Guangyan Wang, Yongsheng Bai
{"title":"Equipment supportability assessment using matter-element and cloud model integrated method","authors":"Qiwei Hu, Guangyan Wang, Yongsheng Bai","doi":"10.1109/GrC.2013.6740415","DOIUrl":"https://doi.org/10.1109/GrC.2013.6740415","url":null,"abstract":"","PeriodicalId":126161,"journal":{"name":"IEEE International Conference on Granular Computing","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128101604","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}
Pub Date : 1900-01-01DOI: 10.1109/GRC.2011.6122594
Xuedong Gao, Hua Qu
The Purpose of process mining is to discover the actual process of the running system by analyzing its runtime log information. Traditional process mining algorithms are based on hypothesis that the process to be mined is unchangeable, so they can't mine evolving processes correctly. This paper proposes the concept of stable stages analysis, the SP-A stable stage analysis algorithm, and an algorithm based on stable stages analysis for mining evolving processes. It recognize stable stages based on process log, and then continuously mine the process logs of each stage, finding process model according to each stable stage, and to identify the evolving history of evolving processes. By experimental evaluations, the validity of the algorithms is proved.
{"title":"An evolving process mining algorithm based on stable stages analysis","authors":"Xuedong Gao, Hua Qu","doi":"10.1109/GRC.2011.6122594","DOIUrl":"https://doi.org/10.1109/GRC.2011.6122594","url":null,"abstract":"The Purpose of process mining is to discover the actual process of the running system by analyzing its runtime log information. Traditional process mining algorithms are based on hypothesis that the process to be mined is unchangeable, so they can't mine evolving processes correctly. This paper proposes the concept of stable stages analysis, the SP-A stable stage analysis algorithm, and an algorithm based on stable stages analysis for mining evolving processes. It recognize stable stages based on process log, and then continuously mine the process logs of each stage, finding process model according to each stable stage, and to identify the evolving history of evolving processes. By experimental evaluations, the validity of the algorithms is proved.","PeriodicalId":126161,"journal":{"name":"IEEE International Conference on Granular Computing","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114169493","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}
Pub Date : 1900-01-01DOI: 10.1109/GRC.2005.1547282
Ji-guang Wan, Xiaoming Dong, Ling Zhan
As a result of the Internet's rapid growth, there has been a huge increase in the amount of information generated and shared by people all over the world. Demand for large-scale storage system is growing rapidly. Instead of disk arrays, decentralized storage systems that consist of a cluster of nodes with locally attached disks have become a cost effective solution. This paper describes the design and implementation of SMSC (self-managing storage cluster) - a self-managing high-performance PC-based cluster storage system. SMSC virtualizes distributed storage devices as incrementally expandable volumes and automatically manages storage node additions and failures. The cache algorithm aims at multimedia data, which greatly improves the performance of sequential read, which is especially suitable for multimedia applications. This paper presents experimental results to demonstrate features and performance of SMSC using benchmarks.
{"title":"Research and design of a self-managing storage cluster","authors":"Ji-guang Wan, Xiaoming Dong, Ling Zhan","doi":"10.1109/GRC.2005.1547282","DOIUrl":"https://doi.org/10.1109/GRC.2005.1547282","url":null,"abstract":"As a result of the Internet's rapid growth, there has been a huge increase in the amount of information generated and shared by people all over the world. Demand for large-scale storage system is growing rapidly. Instead of disk arrays, decentralized storage systems that consist of a cluster of nodes with locally attached disks have become a cost effective solution. This paper describes the design and implementation of SMSC (self-managing storage cluster) - a self-managing high-performance PC-based cluster storage system. SMSC virtualizes distributed storage devices as incrementally expandable volumes and automatically manages storage node additions and failures. The cache algorithm aims at multimedia data, which greatly improves the performance of sequential read, which is especially suitable for multimedia applications. This paper presents experimental results to demonstrate features and performance of SMSC using benchmarks.","PeriodicalId":126161,"journal":{"name":"IEEE International Conference on Granular Computing","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116250121","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}
Pub Date : 1900-01-01DOI: 10.1109/GRC.2008.4664702
Jian-min Han, Jun Tong, Xi-yu Li
To improve adaptability and flexibility of heterogeneous database integration system, the paper proposed a heterogeneous database integration framework based on Web services composition which is implemented by Web services composition template. The paper also adopted granular computing to optimize Web services composition to improve efficiency and quality of heterogeneous integration systems. The experiments show that the Web service composition techniques based on granular computing can increase the adaptability and flexibility of heterogeneous database integration system.
{"title":"An Adaptive Heterogeneous Database Integration Framework based on Web Service Composition Techniques","authors":"Jian-min Han, Jun Tong, Xi-yu Li","doi":"10.1109/GRC.2008.4664702","DOIUrl":"https://doi.org/10.1109/GRC.2008.4664702","url":null,"abstract":"To improve adaptability and flexibility of heterogeneous database integration system, the paper proposed a heterogeneous database integration framework based on Web services composition which is implemented by Web services composition template. The paper also adopted granular computing to optimize Web services composition to improve efficiency and quality of heterogeneous integration systems. The experiments show that the Web service composition techniques based on granular computing can increase the adaptability and flexibility of heterogeneous database integration system.","PeriodicalId":126161,"journal":{"name":"IEEE International Conference on Granular Computing","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127945160","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：