In order to execute a userpsilas query in a data integration system, the query execution process needs to be optimized. Before executing a query at real time, relevant and effective data sources must be identified. In this paper we propose an ontology-driven relevance reasoning architecture for future data integration techniques that will improve the response time for queries during the relevance reasoning process. Ontology has played a vital role to develop various component of the architecture. Source descriptions are plotted over the bitmap index in an intelligent and improved manner. Despite taking a lot of time in traversing local ontologies of source descriptions, bitmap index is exploited in relevance reasoning to identify the relevant and most effective data sources for userpsilas query. These identified data sources are ranked based on their relevance to the userpsilas query and then queried accordingly. A distinguished feature of the system is that it facilitates the user to write the query in terms of their local ontology concepts as well as global ontology concepts. A brief discussion is done on the results of the experimental study of proposed methodology for relevance reasoning and improvements are shown as compared to the previous systems.
{"title":"Ontology-driven relevance reasoning architecture for data integration techniques","authors":"M. Bilal, S. Khan","doi":"10.1109/IS.2008.4670472","DOIUrl":"https://doi.org/10.1109/IS.2008.4670472","url":null,"abstract":"In order to execute a userpsilas query in a data integration system, the query execution process needs to be optimized. Before executing a query at real time, relevant and effective data sources must be identified. In this paper we propose an ontology-driven relevance reasoning architecture for future data integration techniques that will improve the response time for queries during the relevance reasoning process. Ontology has played a vital role to develop various component of the architecture. Source descriptions are plotted over the bitmap index in an intelligent and improved manner. Despite taking a lot of time in traversing local ontologies of source descriptions, bitmap index is exploited in relevance reasoning to identify the relevant and most effective data sources for userpsilas query. These identified data sources are ranked based on their relevance to the userpsilas query and then queried accordingly. A distinguished feature of the system is that it facilitates the user to write the query in terms of their local ontology concepts as well as global ontology concepts. A brief discussion is done on the results of the experimental study of proposed methodology for relevance reasoning and improvements are shown as compared to the previous systems.","PeriodicalId":305750,"journal":{"name":"2008 4th International IEEE Conference Intelligent Systems","volume":"18 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":"115121019","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}
A voltage input current output multiplier and a current input voltage output divider circuit to realize the centre of gravity defuzzifier strategy is described in this paper. The proposed circuit has a compact architecture operating at higher speed and higher input voltage range compared to previously presented structures. The transistors operate in the both saturation and ohmic regions. The circuit operates with a single supply voltage of 3.3V in a 0.35 mum CMOS technology. The total harmonic distortion (THD) of multiplier is less than 1.1%, the linearity error is also less than 3%, and -3db frequency is more than 180 MHz with voltage input range of 3Vp-p. Simulation results are given to verify the functionality of the proposed circuits.
本文介绍了一种电压输入电流输出乘法器和电流输入电压输出分压器电路，以实现重心去模糊策略。与先前提出的结构相比，所提出的电路结构紧凑，运行速度更快，输入电压范围更大。晶体管工作在饱和区和欧姆区。该电路采用0.35 μ m CMOS技术，单电源电压为3.3V。乘频器的总谐波失真(THD)小于1.1%，线性误差小于3%，-3db频率大于180 MHz，电压输入范围为3Vp-p。仿真结果验证了所提电路的功能。
{"title":"Implementation of centroid defuzzifier block using CMOS circuits","authors":"M. Mokarram, A. Khoei, K. Hadidi, K. Gheysari","doi":"10.1109/IS.2008.4670402","DOIUrl":"https://doi.org/10.1109/IS.2008.4670402","url":null,"abstract":"A voltage input current output multiplier and a current input voltage output divider circuit to realize the centre of gravity defuzzifier strategy is described in this paper. The proposed circuit has a compact architecture operating at higher speed and higher input voltage range compared to previously presented structures. The transistors operate in the both saturation and ohmic regions. The circuit operates with a single supply voltage of 3.3V in a 0.35 mum CMOS technology. The total harmonic distortion (THD) of multiplier is less than 1.1%, the linearity error is also less than 3%, and -3db frequency is more than 180 MHz with voltage input range of 3Vp-p. Simulation results are given to verify the functionality of the proposed circuits.","PeriodicalId":305750,"journal":{"name":"2008 4th International IEEE Conference Intelligent Systems","volume":"120 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":"115603085","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 new approach for solving the paradoxical Blackmanpsilas association problem. It utilizes the recently defined new class fusion rule based on fuzzy T-conorm/T-norm operators together with Dezert-Smarandache theory based, relative variations of generalized pignistic probabilities measure of correct associations, defined from a partial ordering function of hyper-power set. The ability of this approach to solve the problem against the classical Dempster-Shaferpsilas method, proposed in the literature is proven. It is shown that the approach improves the separation power of the decision process for this association problem.
{"title":"A new class fusion rule for solving Blackman’s Association Problem","authors":"A. Tchamova, J. Dezert, F. Smarandache","doi":"10.1109/IS.2008.4670449","DOIUrl":"https://doi.org/10.1109/IS.2008.4670449","url":null,"abstract":"This paper presents a new approach for solving the paradoxical Blackmanpsilas association problem. It utilizes the recently defined new class fusion rule based on fuzzy T-conorm/T-norm operators together with Dezert-Smarandache theory based, relative variations of generalized pignistic probabilities measure of correct associations, defined from a partial ordering function of hyper-power set. The ability of this approach to solve the problem against the classical Dempster-Shaferpsilas method, proposed in the literature is proven. It is shown that the approach improves the separation power of the decision process for this association problem.","PeriodicalId":305750,"journal":{"name":"2008 4th International IEEE Conference Intelligent Systems","volume":"206 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":"115638673","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}
An approach to finding the supervisor forcing a prescribed collective behaviour to a group of agents in multi agent system (MAS) is presented. The supervisor synthesis is based on the results achieved in the control theory of DES (discrete event systems) modelled by means of place/transition Petri nets (P/T PN). The definition of the PN place invariants (P-invariants) is utilized on this way.
{"title":"Supervisory control of agents cooperation","authors":"F. Capkovic","doi":"10.1109/IS.2008.4670432","DOIUrl":"https://doi.org/10.1109/IS.2008.4670432","url":null,"abstract":"An approach to finding the supervisor forcing a prescribed collective behaviour to a group of agents in multi agent system (MAS) is presented. The supervisor synthesis is based on the results achieved in the control theory of DES (discrete event systems) modelled by means of place/transition Petri nets (P/T PN). The definition of the PN place invariants (P-invariants) is utilized on this way.","PeriodicalId":305750,"journal":{"name":"2008 4th International IEEE Conference Intelligent Systems","volume":"20 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":"116527633","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}
Context awareness in wireless networks with mobile nodes will enable services or applications to adapt their behavior to the network situation by reconfiguring their underlying protocols. We studied whether high-level information, captured in the semantics of the events during emergency and rescue scenario might be exploited to improve network performance by mapping alternative solutions in dependence on the space-time graph specifics. ldquoBinary behavioral templaterdquo - a new functional feature for estimating the network context is suggested. Fuzzy C-mean clustering and fuzzy reasoning for predicting the future state of space-time paths that services and applications will use for reconfiguring their underlying protocols, are proposed. RoboCup rescue scenario is used to evaluate the feasibility of the proposed fuzzy model.
{"title":"Using high level information to make services and applications sparse MANETs aware","authors":"A. Lekova, O. Georgieva","doi":"10.1109/IS.2008.4670411","DOIUrl":"https://doi.org/10.1109/IS.2008.4670411","url":null,"abstract":"Context awareness in wireless networks with mobile nodes will enable services or applications to adapt their behavior to the network situation by reconfiguring their underlying protocols. We studied whether high-level information, captured in the semantics of the events during emergency and rescue scenario might be exploited to improve network performance by mapping alternative solutions in dependence on the space-time graph specifics. ldquoBinary behavioral templaterdquo - a new functional feature for estimating the network context is suggested. Fuzzy C-mean clustering and fuzzy reasoning for predicting the future state of space-time paths that services and applications will use for reconfiguring their underlying protocols, are proposed. RoboCup rescue scenario is used to evaluate the feasibility of the proposed fuzzy model.","PeriodicalId":305750,"journal":{"name":"2008 4th International IEEE Conference Intelligent Systems","volume":"1 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":"122636100","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, using a family of confidence intervals, we construct a triangular shaped fuzzy number as the estimator for mean lifetime as well as the estimator for reliability function of a component. We derive the explicit and unique membership functions of these fuzzy estimators. Our attention is on the case where the lifetime has an exponential distribution. Numerical examples are given to show the performance of the method.
{"title":"Fuzzy reliability:Type II censoring test without replacement","authors":"R. Amirzadeh, A. Parchami, M. Mashinchi","doi":"10.1109/IS.2008.4670410","DOIUrl":"https://doi.org/10.1109/IS.2008.4670410","url":null,"abstract":"In this paper, using a family of confidence intervals, we construct a triangular shaped fuzzy number as the estimator for mean lifetime as well as the estimator for reliability function of a component. We derive the explicit and unique membership functions of these fuzzy estimators. Our attention is on the case where the lifetime has an exponential distribution. Numerical examples are given to show the performance of the method.","PeriodicalId":305750,"journal":{"name":"2008 4th International IEEE Conference Intelligent Systems","volume":"25 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":"129696422","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}
Predictive Toxicology (PT) is one of the newest targets of the Knowledge Discovery in Databases (KDD) domain. Its goal is to describe the relationships between the chemical structure of chemical compounds and biological and toxicological processes. In real PT problems there is a very important topic to be considered: the huge number of the chemical descriptors. Irrelevant, redundant, noisy and unreliable data have a negative impact, therefore one of the main goals in KDD is to detect these undesirable proprieties and to eliminate or correct them. This assumes data cleaning, noise reduction and feature selection because the performance of the applied Machine Learning algorithms is strongly related with the quality of the data used. In this paper, we present some of the issues that can be taken into account for preparing data before the actual knowledge discovery is performed.
预测毒理学(Predictive Toxicology, PT)是数据库知识发现(Knowledge Discovery in Databases, KDD)领域的最新研究目标之一。其目的是描述化合物的化学结构与生物和毒理学过程之间的关系。在实际PT问题中，有一个非常重要的问题需要考虑:大量的化学描述符。不相关的、冗余的、嘈杂的和不可靠的数据具有负面影响，因此KDD的主要目标之一是检测这些不需要的属性并消除或纠正它们。这假设了数据清理、降噪和特征选择，因为应用机器学习算法的性能与所使用数据的质量密切相关。在本文中，我们提出了在执行实际知识发现之前准备数据时可以考虑的一些问题。
{"title":"Pre-processing aspects for complexity reduction of the QSAR problem","authors":"L. Dumitriu, C. Segal, M. Craciun, A. Cocu","doi":"10.1109/IS.2008.4670547","DOIUrl":"https://doi.org/10.1109/IS.2008.4670547","url":null,"abstract":"Predictive Toxicology (PT) is one of the newest targets of the Knowledge Discovery in Databases (KDD) domain. Its goal is to describe the relationships between the chemical structure of chemical compounds and biological and toxicological processes. In real PT problems there is a very important topic to be considered: the huge number of the chemical descriptors. Irrelevant, redundant, noisy and unreliable data have a negative impact, therefore one of the main goals in KDD is to detect these undesirable proprieties and to eliminate or correct them. This assumes data cleaning, noise reduction and feature selection because the performance of the applied Machine Learning algorithms is strongly related with the quality of the data used. In this paper, we present some of the issues that can be taken into account for preparing data before the actual knowledge discovery is performed.","PeriodicalId":305750,"journal":{"name":"2008 4th International IEEE Conference Intelligent Systems","volume":"46 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":"129730579","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}
Course timetabling is the process of allocating, subject to constraints, limited rooms and timeslots for a set of courses to take place. Usually, in addition to constructing a feasible timetable (all constraints satisfied), there are desirable goals like minimising the number of undesirable allocations (e.g. courses timetabled in the last timeslot of the day). The construction of course timetables is regarded as a complex problem common to a wide range of educational institutions. The great deluge algorithm explores neighbouring solutions which are accepted if they are better than the best solution so far or if the detriment in quality is no larger than the current water level. In the original great deluge, the water level decreases steadily in a linear fashion. In this paper, we propose a modified version of the great deluge algorithm in which the decay rate of the water level is non-linear. The proposed method produces new best results in 4 of the 11 course timetabling problem instances used in our experiments.
{"title":"Great deluge with non-linear decay rate for solving course timetabling problems","authors":"Dario Landa-Silva, J. H. Obit","doi":"10.1109/IS.2008.4670447","DOIUrl":"https://doi.org/10.1109/IS.2008.4670447","url":null,"abstract":"Course timetabling is the process of allocating, subject to constraints, limited rooms and timeslots for a set of courses to take place. Usually, in addition to constructing a feasible timetable (all constraints satisfied), there are desirable goals like minimising the number of undesirable allocations (e.g. courses timetabled in the last timeslot of the day). The construction of course timetables is regarded as a complex problem common to a wide range of educational institutions. The great deluge algorithm explores neighbouring solutions which are accepted if they are better than the best solution so far or if the detriment in quality is no larger than the current water level. In the original great deluge, the water level decreases steadily in a linear fashion. In this paper, we propose a modified version of the great deluge algorithm in which the decay rate of the water level is non-linear. The proposed method produces new best results in 4 of the 11 course timetabling problem instances used in our experiments.","PeriodicalId":305750,"journal":{"name":"2008 4th International IEEE Conference Intelligent Systems","volume":"140 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":"116502806","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}
Classical game theory is concerned with how rational players make decisions when they are faced with known payoffs. In the past decade, fuzzy logic has been widely used to manage uncertainties in games. In this paper, we employ fuzzy logic to determine the priority of a payoff to other payoffs. A new term is introduced to measure the preference of one payoff to others. By this means a fuzzy preference relation is constructed and using a least deviation method, the priority of every payoff for each player is calculated and the relation of this value with the degree of being Nash is discussed. In the second part of the paper, games with fuzzy payoffs and fuzzy satisfaction functions (SF), satisfaction degree from each payoff, are considered and a new method for analyzing these games is proposed. In this regard we calculate the similarity between SF and payoffs and make a crisp game from the fuzzy game and apply our mentioned method to analyze that game. Compared to the previous generalization, our method has more sensitivity to the slight alternation of payoffs and yields more realistic results. We also studied the effect of playerspsila greediness, modeled by the SF, on the gamepsilas equilibriums.
{"title":"How can fuzzy logic determine game equilibriums better?","authors":"Alireza Chakeri, Ali Nouri Dariani, C. Lucas","doi":"10.1109/IS.2008.4670407","DOIUrl":"https://doi.org/10.1109/IS.2008.4670407","url":null,"abstract":"Classical game theory is concerned with how rational players make decisions when they are faced with known payoffs. In the past decade, fuzzy logic has been widely used to manage uncertainties in games. In this paper, we employ fuzzy logic to determine the priority of a payoff to other payoffs. A new term is introduced to measure the preference of one payoff to others. By this means a fuzzy preference relation is constructed and using a least deviation method, the priority of every payoff for each player is calculated and the relation of this value with the degree of being Nash is discussed. In the second part of the paper, games with fuzzy payoffs and fuzzy satisfaction functions (SF), satisfaction degree from each payoff, are considered and a new method for analyzing these games is proposed. In this regard we calculate the similarity between SF and payoffs and make a crisp game from the fuzzy game and apply our mentioned method to analyze that game. Compared to the previous generalization, our method has more sensitivity to the slight alternation of payoffs and yields more realistic results. We also studied the effect of playerspsila greediness, modeled by the SF, on the gamepsilas equilibriums.","PeriodicalId":305750,"journal":{"name":"2008 4th International IEEE Conference Intelligent Systems","volume":"58 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":"132157038","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 method of determining the pension in the generation-based funding scheme. In this proposal, we include two types of pensions. One is the payment-amount related pension and the other is the payment-times related pension. We set the ratio of the total amount of payment-amount related pension to the total amount of both pensions (income gap operator), and simulate fiscal changes and income gaps when the proposed method is applied. As a result, we show the possibility of a correcting income gaps, and that intergenerational equity and fiscal sustainability are not affected by nonpayment of the insurance.
{"title":"Public pension planning on the basis of generation-based funding scheme for intra-generational equity","authors":"D. Banjo, H. Tamura, T. Murata","doi":"10.1109/IS.2008.4670446","DOIUrl":"https://doi.org/10.1109/IS.2008.4670446","url":null,"abstract":"In this paper, we propose a method of determining the pension in the generation-based funding scheme. In this proposal, we include two types of pensions. One is the payment-amount related pension and the other is the payment-times related pension. We set the ratio of the total amount of payment-amount related pension to the total amount of both pensions (income gap operator), and simulate fiscal changes and income gaps when the proposed method is applied. As a result, we show the possibility of a correcting income gaps, and that intergenerational equity and fiscal sustainability are not affected by nonpayment of the insurance.","PeriodicalId":305750,"journal":{"name":"2008 4th International IEEE Conference Intelligent Systems","volume":"8 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":"132592322","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
扫码关注我们
求助内容：
应助结果提醒方式：