This paper describes a context aware system that shall be able to effectively classify and store context information, and to reason out user behavior according to context information, in order to provide appropriate service. This study uses ontology to build a context model, as ontology has the ability to express abundant information. In addition, case-based reasoning is used for context reasoning, and refers to the user's historical information, the reasoning ability of the system increases and approaches the user as the number of cases increases. When the behavior of the user is known, this study uses personal ontology to express the user's habit and preferences for services, and uses personal ontology to select appropriate services, and finally, the OSGi platform provides services to meet user requirements. The field of this study is the development of an intelligent space system for common families by providing home services, such as lighting, music, air conditioning, IP-Cam, alarms, etc., the system can integrate service information and provide appropriate services for the user at the appropriate time. Fuzzy ontology is based on the concept that each index term or object is related to every other term in the ontology, via sensors of degrees, for all home devices of membership assigned to that relationship and based on fuzzy signature, as introduced by L.T. Koczy (1999).
{"title":"Auto-Plug in of Context-Models is Applied in Intelligent Home Information System","authors":"Chih-Wei Hsu, Sheng-Tzong Cheng, Alan Liu","doi":"10.1109/GCIS.2012.87","DOIUrl":"https://doi.org/10.1109/GCIS.2012.87","url":null,"abstract":"This paper describes a context aware system that shall be able to effectively classify and store context information, and to reason out user behavior according to context information, in order to provide appropriate service. This study uses ontology to build a context model, as ontology has the ability to express abundant information. In addition, case-based reasoning is used for context reasoning, and refers to the user's historical information, the reasoning ability of the system increases and approaches the user as the number of cases increases. When the behavior of the user is known, this study uses personal ontology to express the user's habit and preferences for services, and uses personal ontology to select appropriate services, and finally, the OSGi platform provides services to meet user requirements. The field of this study is the development of an intelligent space system for common families by providing home services, such as lighting, music, air conditioning, IP-Cam, alarms, etc., the system can integrate service information and provide appropriate services for the user at the appropriate time. Fuzzy ontology is based on the concept that each index term or object is related to every other term in the ontology, via sensors of degrees, for all home devices of membership assigned to that relationship and based on fuzzy signature, as introduced by L.T. Koczy (1999).","PeriodicalId":337629,"journal":{"name":"2012 Third Global Congress on Intelligent Systems","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123334065","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}
In this paper we describe how a novel application of Data Mining techniques can be used to provide the engine for a tool which can be used to identify email correspondence which may be an early indication of virtual bullying or harassment. The approach which we have taken makes use of linear discriminant approaches to classify normal, and non-normal, style of email correspondence for each sender. This change in email style could be used to provide an early indication of virtual harassment/bullying.. This approach has great potential for use in large organization where it is often appears to be hard to identify unacceptable information transmission between two colleagues. By identifying indicative behavior it should be possible to instigate company anti bullying processes in a more timely manner. This should ensure a more effective work force in terms of work place efficiency and reduction of stress related absence resulting from harassment or bullying. We show that it is possible to improve the identification of the number of sender signature styles contained within the email pages, irrespective of the number of pages concerned. The implications of the use of SSSs, and ASSSs, for identification of future email interactions are discussed.
{"title":"The Use of Data Mining to Indicate Virtual (Email) Bullying","authors":"K. Burn-Thornton, T. Burman","doi":"10.1109/GCIS.2012.107","DOIUrl":"https://doi.org/10.1109/GCIS.2012.107","url":null,"abstract":"In this paper we describe how a novel application of Data Mining techniques can be used to provide the engine for a tool which can be used to identify email correspondence which may be an early indication of virtual bullying or harassment. The approach which we have taken makes use of linear discriminant approaches to classify normal, and non-normal, style of email correspondence for each sender. This change in email style could be used to provide an early indication of virtual harassment/bullying.. This approach has great potential for use in large organization where it is often appears to be hard to identify unacceptable information transmission between two colleagues. By identifying indicative behavior it should be possible to instigate company anti bullying processes in a more timely manner. This should ensure a more effective work force in terms of work place efficiency and reduction of stress related absence resulting from harassment or bullying. We show that it is possible to improve the identification of the number of sender signature styles contained within the email pages, irrespective of the number of pages concerned. The implications of the use of SSSs, and ASSSs, for identification of future email interactions are discussed.","PeriodicalId":337629,"journal":{"name":"2012 Third Global Congress on Intelligent Systems","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126438211","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}
In this paper we propose a simple, fast and scalable heuristic for solving the Satellite Broadcast Scheduling problem. The satellite broadcast scheduling optimization problem is known to be an NP-complete problem, where the aim of such scheduling problem is to find a valid broadcasting scheduling pattern that maximizes the number of broadcasting's timeslots under certain constraints. Our Problem-specific knowledge heuristic utilizes the information of the problem itself to build a set of priority numbers that determine the order in which terminals are assigned to satellites in each timeslot. The effectiveness and robustness of the proposed algorithm is shown by a thorough comparison with existing techniques for the benchmark problems reported in the literature and for randomly generated test instances with varying sizes. Experimental results show that our proposed algorithms are indeed very effective in finding comparable and even better solutions (i.e. for some benchmarks), and outperform the existing algorithms by finding optimal solutions for almost all tested benchmarks.
{"title":"Problem-Specific Knowledge Based Heuristic Algorithm to Solve Satellite Broadcast Scheduling Problem","authors":"A. Salman, I. Ahmad, M. Omran","doi":"10.1109/GCIS.2012.27","DOIUrl":"https://doi.org/10.1109/GCIS.2012.27","url":null,"abstract":"In this paper we propose a simple, fast and scalable heuristic for solving the Satellite Broadcast Scheduling problem. The satellite broadcast scheduling optimization problem is known to be an NP-complete problem, where the aim of such scheduling problem is to find a valid broadcasting scheduling pattern that maximizes the number of broadcasting's timeslots under certain constraints. Our Problem-specific knowledge heuristic utilizes the information of the problem itself to build a set of priority numbers that determine the order in which terminals are assigned to satellites in each timeslot. The effectiveness and robustness of the proposed algorithm is shown by a thorough comparison with existing techniques for the benchmark problems reported in the literature and for randomly generated test instances with varying sizes. Experimental results show that our proposed algorithms are indeed very effective in finding comparable and even better solutions (i.e. for some benchmarks), and outperform the existing algorithms by finding optimal solutions for almost all tested benchmarks.","PeriodicalId":337629,"journal":{"name":"2012 Third Global Congress on Intelligent Systems","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114219039","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}
Taking local learning strategy as the local member classifier generating means, local performance estimation of classifier as in-depth analysis method of classifier, this paper, systematically investigates dynamic integration method based on local learning strategy and local performance estimation, on the basis of improving the integrated classifier accuracy with efficiency consideration in order to obtain superior performance of the dynamic integration classification algorithm.
{"title":"Research on Dynamic Integration Algorithm Based on Local Learning Strategy","authors":"Yin Junping, Wan Yuan","doi":"10.1109/GCIS.2012.78","DOIUrl":"https://doi.org/10.1109/GCIS.2012.78","url":null,"abstract":"Taking local learning strategy as the local member classifier generating means, local performance estimation of classifier as in-depth analysis method of classifier, this paper, systematically investigates dynamic integration method based on local learning strategy and local performance estimation, on the basis of improving the integrated classifier accuracy with efficiency consideration in order to obtain superior performance of the dynamic integration classification algorithm.","PeriodicalId":337629,"journal":{"name":"2012 Third Global Congress on Intelligent Systems","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116134734","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}
With the characteristics of wide time span, engineer-to-order, advanced technology to be adopted", "etc., Complex product systems (CoPS) innovation becomes a systematic project full of risks. Risk evaluation is the vital role in life-cycle process of the CoPS. Furthermore, the technical risk is major factor leading to cost, time and effectiveness risk. Because of the non-structural features of CoPS, it is difficult to derive quantitative measurements of various technical risk of each stage during the whole life-cycle of the CoPS. To resolve this problem, firstly, the concepts of CoPS were analyzed, including technical risk and the relevant comprehensive integration, and then a qualitative and quantitative evaluation mechanism for technical risk evaluation has been developed. Consequently, the evaluation procedures and a sequence of steps were established. Finally, to clarify the feasibility and effectiveness of the evaluation model, the technical risk was evaluated for a complex product systems example.
{"title":"Meta-Synthesis Technical Risk Evaluation Mechanism of Complex Product Systems","authors":"Sihai Guo, Kaizhi Li, W. Zhou","doi":"10.1109/GCIS.2012.48","DOIUrl":"https://doi.org/10.1109/GCIS.2012.48","url":null,"abstract":"With the characteristics of wide time span, engineer-to-order, advanced technology to be adopted\", \"etc., Complex product systems (CoPS) innovation becomes a systematic project full of risks. Risk evaluation is the vital role in life-cycle process of the CoPS. Furthermore, the technical risk is major factor leading to cost, time and effectiveness risk. Because of the non-structural features of CoPS, it is difficult to derive quantitative measurements of various technical risk of each stage during the whole life-cycle of the CoPS. To resolve this problem, firstly, the concepts of CoPS were analyzed, including technical risk and the relevant comprehensive integration, and then a qualitative and quantitative evaluation mechanism for technical risk evaluation has been developed. Consequently, the evaluation procedures and a sequence of steps were established. Finally, to clarify the feasibility and effectiveness of the evaluation model, the technical risk was evaluated for a complex product systems example.","PeriodicalId":337629,"journal":{"name":"2012 Third Global Congress on Intelligent Systems","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115285335","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}
Tolerances provide a general tool for studying indiscernibility phenomena that are ubiquitous in data analysis and knowledge system. The collections of blocks, classes and point closures form three different coverings closely related to the given tolerance. The structure and property of the induced point closure system are investigated, and axiomizations of three types of covering based rough approximation operators are discussed from the relational viewpoint, in which point closure system plays an important role.
{"title":"On the Point Closure System by Tolerance","authors":"Wanli Chen","doi":"10.1109/GCIS.2012.52","DOIUrl":"https://doi.org/10.1109/GCIS.2012.52","url":null,"abstract":"Tolerances provide a general tool for studying indiscernibility phenomena that are ubiquitous in data analysis and knowledge system. The collections of blocks, classes and point closures form three different coverings closely related to the given tolerance. The structure and property of the induced point closure system are investigated, and axiomizations of three types of covering based rough approximation operators are discussed from the relational viewpoint, in which point closure system plays an important role.","PeriodicalId":337629,"journal":{"name":"2012 Third Global Congress on Intelligent Systems","volume":"103 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121138068","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}
Positioning accuracy, availability and reliability of GPS are dependent on the numbers of visible satellites and geometry structure of satellite constellations. But in poor conditions, it is difficult to satisfy the needs of the precision positioning. In order to improve the validity of the GPS receiver in signal masking occasions, a lot of researchers have proposed a variety of methods. In this paper, the author will analyze the current research status and method of fault-tolerant navigation. Finally, research foreground of fault-tolerant navigation is expected briefly.
{"title":"Survey on Fault-Tolerant Navigation","authors":"Fan Shunxi, Li Ye, Hu Shaolin","doi":"10.1109/GCIS.2012.45","DOIUrl":"https://doi.org/10.1109/GCIS.2012.45","url":null,"abstract":"Positioning accuracy, availability and reliability of GPS are dependent on the numbers of visible satellites and geometry structure of satellite constellations. But in poor conditions, it is difficult to satisfy the needs of the precision positioning. In order to improve the validity of the GPS receiver in signal masking occasions, a lot of researchers have proposed a variety of methods. In this paper, the author will analyze the current research status and method of fault-tolerant navigation. Finally, research foreground of fault-tolerant navigation is expected briefly.","PeriodicalId":337629,"journal":{"name":"2012 Third Global Congress on Intelligent Systems","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133158591","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}
With the rapid economic development, the environmental pollution becomes increasingly serious. Through the analysis of causes and propagation characteristics of urban heavy metals pollution, the location of the various sources of pollution is confirmed. By using the principal component analysis model, the specific distributions of different pollutants in each area are obtained firstly. In order to ascertain the sources of heavy metal pollution, three-dimensional diffusion model between the concentration of heavy metal elements and geographic position of elements is established. With the help of the least squares method solving differential equations, the specific location of the sources of pollution is ascertained ultimately.
{"title":"The Use of Principal Component Analysis and Three-Dimensional Diffusion Model of Urban Heavy Metal Pollution","authors":"Longyan Gong, Juping Zhou, Zhisen Ye, Taigui Qin","doi":"10.1109/GCIS.2012.65","DOIUrl":"https://doi.org/10.1109/GCIS.2012.65","url":null,"abstract":"With the rapid economic development, the environmental pollution becomes increasingly serious. Through the analysis of causes and propagation characteristics of urban heavy metals pollution, the location of the various sources of pollution is confirmed. By using the principal component analysis model, the specific distributions of different pollutants in each area are obtained firstly. In order to ascertain the sources of heavy metal pollution, three-dimensional diffusion model between the concentration of heavy metal elements and geographic position of elements is established. With the help of the least squares method solving differential equations, the specific location of the sources of pollution is ascertained ultimately.","PeriodicalId":337629,"journal":{"name":"2012 Third Global Congress on Intelligent Systems","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124913370","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}
By means of rigid mathematical deductions we prove that weight vectors cannot promote the performance of the optimal classifier, i.e. the Bayesian classifier in terms of the error, F-one score, or breakeven point. The conclusion is important in that people used to promote the performance of a classifier by trying various weight vectors in text classification.
{"title":"Mathematical Analysis on Weight Vectors in Text Classification","authors":"Fengxi Song, Qinglong Chen, Zhongwei Guo, Xiumei Gao","doi":"10.1109/GCIS.2012.14","DOIUrl":"https://doi.org/10.1109/GCIS.2012.14","url":null,"abstract":"By means of rigid mathematical deductions we prove that weight vectors cannot promote the performance of the optimal classifier, i.e. the Bayesian classifier in terms of the error, F-one score, or breakeven point. The conclusion is important in that people used to promote the performance of a classifier by trying various weight vectors in text classification.","PeriodicalId":337629,"journal":{"name":"2012 Third Global Congress on Intelligent Systems","volume":"345 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122852386","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}
Because of the intense bounding and the distance of the query vector to the cluster bounding is closer to the true distance, filtering out irrelevant clusters by the distance of the query vector to the cluster bounding in the process of similarity search has well reduced the I/O complexity. Hence, the "curse of dimensionality" can be well avoided. We propose an improved KNN search algorithm based on adaptive cluster distance bounding for high dimensional indexing by reducing the CPU cost which was achieved by filtering out unnecessary distance calculations number using the triangle inequality, but with the cost of some overhead and pretreatment. Finally, we verify the improved exact KNN search algorithm has a better performance through some experiments based on a real data set.
{"title":"An Improved KNN Algorithm Based on Adaptive Cluster Distance Bounding for High Dimensional Indexing","authors":"Huang Hong, Guo Juan, Wang Ben","doi":"10.1109/GCIS.2012.86","DOIUrl":"https://doi.org/10.1109/GCIS.2012.86","url":null,"abstract":"Because of the intense bounding and the distance of the query vector to the cluster bounding is closer to the true distance, filtering out irrelevant clusters by the distance of the query vector to the cluster bounding in the process of similarity search has well reduced the I/O complexity. Hence, the \"curse of dimensionality\" can be well avoided. We propose an improved KNN search algorithm based on adaptive cluster distance bounding for high dimensional indexing by reducing the CPU cost which was achieved by filtering out unnecessary distance calculations number using the triangle inequality, but with the cost of some overhead and pretreatment. Finally, we verify the improved exact KNN search algorithm has a better performance through some experiments based on a real data set.","PeriodicalId":337629,"journal":{"name":"2012 Third Global Congress on Intelligent Systems","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124174144","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
扫码关注我们
求助内容：
应助结果提醒方式：