Some relations between intuitionistic fuzzy negations and intuitionistic fuzzy extended modal operations Falpha,beta and Galpha,beta are studied.
研究了直觉模糊否定与直觉模糊扩展模态运算α， β和α， β的关系。
{"title":"On intuitionistic fuzzy negations and intuitionistic fuzzy extended modal operators. Part 2.","authors":"C. Hinde, K. Atanassov","doi":"10.1109/IS.2008.4670521","DOIUrl":"https://doi.org/10.1109/IS.2008.4670521","url":null,"abstract":"Some relations between intuitionistic fuzzy negations and intuitionistic fuzzy extended modal operations F<sub>alpha,beta</sub> and G<sub>alpha,beta</sub> are studied.","PeriodicalId":305750,"journal":{"name":"2008 4th International IEEE Conference Intelligent Systems","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128868619","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}
This paper shows that combinatorial complexity of fuzzy systems is at least in part caused by redundancy in these systems and presents the algorithm and its implementation for detection and removal of such redundancy for a special class of Mamdani systems. Performance of the simplification algorithm is demonstrated with uniformly impressive results on acknowledged benchmarks coming from different areas of engineering - truck backer-upper control, Mackey-Glass time series prediction and iris data classification.
{"title":"Error-free simplification of transparent Mamdani systems","authors":"A. Riid, K. Saastamoinen, E. Rustern","doi":"10.1109/IS.2008.4670399","DOIUrl":"https://doi.org/10.1109/IS.2008.4670399","url":null,"abstract":"This paper shows that combinatorial complexity of fuzzy systems is at least in part caused by redundancy in these systems and presents the algorithm and its implementation for detection and removal of such redundancy for a special class of Mamdani systems. Performance of the simplification algorithm is demonstrated with uniformly impressive results on acknowledged benchmarks coming from different areas of engineering - truck backer-upper control, Mackey-Glass time series prediction and iris data classification.","PeriodicalId":305750,"journal":{"name":"2008 4th International IEEE Conference Intelligent Systems","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134479212","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}
Data integration can be made scalable, flexible and interoperable if the source descriptions are represented in conceptual model i.e., ontology. Ontology is a shared and common understanding of a domain and can solve the heterogeneity of distributed data sources. The methodology provided in this paper transforms database relations of a local source to OWL based ontology for source descriptions. It minimizes the effort and errors involved in manual ontology building. Compared with existing techniques the distinguished feature of the proposed technique is to build ontology in the absence of necessary metadata from physical or logical models. Results of the proposed methodology are provided to show the transformation is correct (i.e., total, injective).
{"title":"Transforming relational model to source ontology for data integration","authors":"K. Sonia, S. Khan","doi":"10.1109/IS.2008.4670471","DOIUrl":"https://doi.org/10.1109/IS.2008.4670471","url":null,"abstract":"Data integration can be made scalable, flexible and interoperable if the source descriptions are represented in conceptual model i.e., ontology. Ontology is a shared and common understanding of a domain and can solve the heterogeneity of distributed data sources. The methodology provided in this paper transforms database relations of a local source to OWL based ontology for source descriptions. It minimizes the effort and errors involved in manual ontology building. Compared with existing techniques the distinguished feature of the proposed technique is to build ontology in the absence of necessary metadata from physical or logical models. Results of the proposed methodology are provided to show the transformation is correct (i.e., total, injective).","PeriodicalId":305750,"journal":{"name":"2008 4th International IEEE Conference Intelligent Systems","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115532729","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 design an overall architecture for dealing with context-aware applications in ubiquitous intelligent environment. The architecture is composed of middleware, context server, and client. The middleware plays an important role in recognizing a moving node with mobility by using a Bluetooth wireless communication technology as well as in executing an appropriate execution module according to the context acquired from a context server. To develop context-aware applications in an effective manner under this architecture, we propose a new context script language which can be used to represent both various decisions on context-awareness and appropriate procedures according to the decision as a standard syntax. Thus, it is regarded as a general purpose language to provide users with functions to define a given context in a clear and precise way. We also design and implement the processor of our context script language, which can automatically execute a series of involved procedures acquired for context-awareness. To show the usefulness of our context script language, we develop a context-aware application which can provide users with a music playing service in ubiquitous intelligent environment.
{"title":"Design of a context script language for developing context-aware applications in ubiquitous intelligent environment","authors":"Yong-Ki Kim, Jaewoo Chang","doi":"10.1109/IS.2008.4670478","DOIUrl":"https://doi.org/10.1109/IS.2008.4670478","url":null,"abstract":"In this paper, we design an overall architecture for dealing with context-aware applications in ubiquitous intelligent environment. The architecture is composed of middleware, context server, and client. The middleware plays an important role in recognizing a moving node with mobility by using a Bluetooth wireless communication technology as well as in executing an appropriate execution module according to the context acquired from a context server. To develop context-aware applications in an effective manner under this architecture, we propose a new context script language which can be used to represent both various decisions on context-awareness and appropriate procedures according to the decision as a standard syntax. Thus, it is regarded as a general purpose language to provide users with functions to define a given context in a clear and precise way. We also design and implement the processor of our context script language, which can automatically execute a series of involved procedures acquired for context-awareness. To show the usefulness of our context script language, we develop a context-aware application which can provide users with a music playing service in ubiquitous intelligent environment.","PeriodicalId":305750,"journal":{"name":"2008 4th International IEEE Conference Intelligent Systems","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114659062","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}
Different classes of traffic pose different requirements on the underlying network. For example, VoIP traffic has stricter requirements on delay and jitter than background traffic such as file downloads. Ant-routing algorithms store an amount of pheromone proportional to the measured ldquogoodnessrdquo of a link in the network. This approach assumes that a) links have only one dimension of ldquogoodnessrdquo and b) that ldquogoodnessrdquo is equal for all types of traffic. In reality, though, links can have several orthogonal dimensions of ldquogoodnessrdquo. In addition to bandwidth, delay, and jitter wireless links also experience changes of bandwidth over time and varying amounts of packet loss. Therefore, a route in a wireless mesh network may be suitable for one class of traffic but unsuitable for another. The proposed algorithm addresses this problem by introducing ldquocolored pheromonesrdquo which are matched to the traffic classes. Depending on the measurement of the different dimensions of ldquogoodnessrdquo and their match to the traffic classes an ant will deposit an apropriate amount of pheromones in the adequate ldquocolorrdquo in the routing tables. Traffic will then follow the appropriately colored paths.
{"title":"A concept for ant-routing with colored pheromones in wireless mesh networks","authors":"Martina Umlauft","doi":"10.1109/IS.2008.4670498","DOIUrl":"https://doi.org/10.1109/IS.2008.4670498","url":null,"abstract":"Different classes of traffic pose different requirements on the underlying network. For example, VoIP traffic has stricter requirements on delay and jitter than background traffic such as file downloads. Ant-routing algorithms store an amount of pheromone proportional to the measured ldquogoodnessrdquo of a link in the network. This approach assumes that a) links have only one dimension of ldquogoodnessrdquo and b) that ldquogoodnessrdquo is equal for all types of traffic. In reality, though, links can have several orthogonal dimensions of ldquogoodnessrdquo. In addition to bandwidth, delay, and jitter wireless links also experience changes of bandwidth over time and varying amounts of packet loss. Therefore, a route in a wireless mesh network may be suitable for one class of traffic but unsuitable for another. The proposed algorithm addresses this problem by introducing ldquocolored pheromonesrdquo which are matched to the traffic classes. Depending on the measurement of the different dimensions of ldquogoodnessrdquo and their match to the traffic classes an ant will deposit an apropriate amount of pheromones in the adequate ldquocolorrdquo in the routing tables. Traffic will then follow the appropriately colored paths.","PeriodicalId":305750,"journal":{"name":"2008 4th International IEEE Conference Intelligent Systems","volume":"86 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116963292","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 : 2008-11-11DOI: 10.5391/JKIIS.2009.19.4.504
Taebok Yoon, Seunghoon Lee, KwangHo Yoon, Dong-Moon Kim, Jee-Hyong Lee
We propose a music recommendation system which provides personalized services. The system keeps a userpsilas listening list and analyzes it to select pieces of music similar to the userpsilas preference. For analysis, the system extracts properties from the sound wave of music and the time when the user listens to music. Based on the properties, a pieces of music is mapped into a point in the property space and the time is converted into the weight of the point. The more recently the user listens to the music, the more the weight increases. We apply the K-means clustering algorithm to the weighted points. The K-means algorithm is modified so that the number of clusters are dynamically changed. By using our K-means clustering algorithm, we can recommend pieces of music which are close to userpsilas preference even though he likes several genres. We also consider the time when music is released. When recommending, the system selects pieces of music which is close to and released contemporarily with the userpsilas preference. We perform experiments with one hundred pieces of music. In this paper we present and evaluate algorithms to recommend system.
{"title":"A personalized music recommendation system with a time-weighted clustering","authors":"Taebok Yoon, Seunghoon Lee, KwangHo Yoon, Dong-Moon Kim, Jee-Hyong Lee","doi":"10.5391/JKIIS.2009.19.4.504","DOIUrl":"https://doi.org/10.5391/JKIIS.2009.19.4.504","url":null,"abstract":"We propose a music recommendation system which provides personalized services. The system keeps a userpsilas listening list and analyzes it to select pieces of music similar to the userpsilas preference. For analysis, the system extracts properties from the sound wave of music and the time when the user listens to music. Based on the properties, a pieces of music is mapped into a point in the property space and the time is converted into the weight of the point. The more recently the user listens to the music, the more the weight increases. We apply the K-means clustering algorithm to the weighted points. The K-means algorithm is modified so that the number of clusters are dynamically changed. By using our K-means clustering algorithm, we can recommend pieces of music which are close to userpsilas preference even though he likes several genres. We also consider the time when music is released. When recommending, the system selects pieces of music which is close to and released contemporarily with the userpsilas preference. We perform experiments with one hundred pieces of music. In this paper we present and evaluate algorithms to recommend system.","PeriodicalId":305750,"journal":{"name":"2008 4th International IEEE Conference Intelligent Systems","volume":"79 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116034436","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}
Semantic-based information retrieval techniques understand the meanings of the concepts that users specify in their queries. The main drawback of the existing semantic-based information retrieval techniques is that none of them considers the context of the concept(s). We propose a semantic information retrieval framework to improve the precision of search results. In this paper, thematic similarity approach is employed for information retrieval in order to capture the context of particular concept(s). We store metadata information of source(s) in the form of RDF triples. We search userpsilas queries in the existing metadata by matching RDF triples instead of keywords. The results of the experiments performed on our framework showed improvements in precision and recall compared to the existing semantic-based information retrieval techniques.
{"title":"Ontology based semantic information retrieval","authors":"J. Mustafa, S. Khan, K. Latif","doi":"10.1109/IS.2008.4670473","DOIUrl":"https://doi.org/10.1109/IS.2008.4670473","url":null,"abstract":"Semantic-based information retrieval techniques understand the meanings of the concepts that users specify in their queries. The main drawback of the existing semantic-based information retrieval techniques is that none of them considers the context of the concept(s). We propose a semantic information retrieval framework to improve the precision of search results. In this paper, thematic similarity approach is employed for information retrieval in order to capture the context of particular concept(s). We store metadata information of source(s) in the form of RDF triples. We search userpsilas queries in the existing metadata by matching RDF triples instead of keywords. The results of the experiments performed on our framework showed improvements in precision and recall compared to the existing semantic-based information retrieval techniques.","PeriodicalId":305750,"journal":{"name":"2008 4th International IEEE Conference Intelligent Systems","volume":"137 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124611201","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}
This paper presents a correlation of results obtained by the authors in the modeling and simulation of left/right asymmetry (LRA) development in artificial embryology systems with its role in the analysis and modeling of developmental processes, such as in biology. LRA is presented as a different level of developmental stage in reference to the 2 basic types of asymmetry presented by all developing embryos (anterior-posterior and dorsal-ventral). Conclusions are presented on how our results support and help to understand the current research in the field of artificial developmental systems.
{"title":"Artificial modeling of biologically inspired Left/Right Asymmetry for modeling developmental processes","authors":"M. Gongora, M. C. Rodas","doi":"10.1109/IS.2008.4670415","DOIUrl":"https://doi.org/10.1109/IS.2008.4670415","url":null,"abstract":"This paper presents a correlation of results obtained by the authors in the modeling and simulation of left/right asymmetry (LRA) development in artificial embryology systems with its role in the analysis and modeling of developmental processes, such as in biology. LRA is presented as a different level of developmental stage in reference to the 2 basic types of asymmetry presented by all developing embryos (anterior-posterior and dorsal-ventral). Conclusions are presented on how our results support and help to understand the current research in the field of artificial developmental systems.","PeriodicalId":305750,"journal":{"name":"2008 4th International IEEE Conference Intelligent Systems","volume":"62 23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129848200","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}
To control complex dynamical systems, which are frequently coupled with unknown dynamics, modeling errors, nonlinearities, various sorts of disturbances, uncertainties and noise robust or model-free control methods should be employed. The features of a novel dynamical algorithm for robust adaptive learning in fuzzy rule-based neural networks of Takagi-Sugeno-Kang type with sigmoid membership functions and its application to the neuro-fuzzy adaptive nonlinear feedback control of systems with uncertain dynamics are presented. The proposed approach makes direct use of variable structure systems theory and the feedback-error-learning scheme. In the simulations, it has been tested on the control of Duffing oscillator and the analytical claims have been justified under the existence of uncertainty and large nonzero initial errors.
{"title":"A neuro-fuzzy adaptive sliding mode controller: Application to second-order chaotic system","authors":"N. Shakev, A. Topalov, O. Kaynak","doi":"10.1109/IS.2008.4670454","DOIUrl":"https://doi.org/10.1109/IS.2008.4670454","url":null,"abstract":"To control complex dynamical systems, which are frequently coupled with unknown dynamics, modeling errors, nonlinearities, various sorts of disturbances, uncertainties and noise robust or model-free control methods should be employed. The features of a novel dynamical algorithm for robust adaptive learning in fuzzy rule-based neural networks of Takagi-Sugeno-Kang type with sigmoid membership functions and its application to the neuro-fuzzy adaptive nonlinear feedback control of systems with uncertain dynamics are presented. The proposed approach makes direct use of variable structure systems theory and the feedback-error-learning scheme. In the simulations, it has been tested on the control of Duffing oscillator and the analytical claims have been justified under the existence of uncertainty and large nonzero initial errors.","PeriodicalId":305750,"journal":{"name":"2008 4th International IEEE Conference Intelligent Systems","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132509856","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}
This paper proposes an effective parallel algorithm for the cooperative genetic algorithm (CGA) to solve a nurse scheduling problem. The nurse scheduling is very complex task for a clinical director in a general hospital. Even veteran director needs one or two weeks to create the schedule. Besides, we extend the nurse schedule to permit the change of the schedule. This permission has explosively increased computation time for the nurse scheduling. We propose the new parallel algorithm to solve the problem. The parallel CGA has brought surprising effective results.
{"title":"Parallel processing of cooperative genetic algorithm for nurse scheduling","authors":"M. Ohki, S. Uneme, H. Kawano","doi":"10.1109/IS.2008.4670494","DOIUrl":"https://doi.org/10.1109/IS.2008.4670494","url":null,"abstract":"This paper proposes an effective parallel algorithm for the cooperative genetic algorithm (CGA) to solve a nurse scheduling problem. The nurse scheduling is very complex task for a clinical director in a general hospital. Even veteran director needs one or two weeks to create the schedule. Besides, we extend the nurse schedule to permit the change of the schedule. This permission has explosively increased computation time for the nurse scheduling. We propose the new parallel algorithm to solve the problem. The parallel CGA has brought surprising effective results.","PeriodicalId":305750,"journal":{"name":"2008 4th International IEEE Conference Intelligent Systems","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130292753","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
扫码关注我们
求助内容：
应助结果提醒方式：