The area of interest for this paper covers pattern recognition method, which can find and classify all useful relations between data entries in the time series. Genetic algorithm has been deployed to prepare and govern a set of independent patterns. For each pattern additional quality value has been added. This value corresponds to the level of certainty and is introduced in the work. Practical application of this solution consists of data fitting and prediction. Analyzed data can be non continuous and incomplete. In uncertain cases algorithm presents either no response at all or more than one answer to processed data. Architecture of the system offers possibility to interleave learning phase with use. Genetic algorithm applied in the method facilitates niche techniques as well as crowd factor and specialized population selection methods. Early testing results, which include prediction and fitting of simple time series with up to 50 percent of missing data, are presented at the end of the paper.
{"title":"Application of genetic algorithm to pattern extraction","authors":"M. Borkowski","doi":"10.1109/ISDA.2005.24","DOIUrl":"https://doi.org/10.1109/ISDA.2005.24","url":null,"abstract":"The area of interest for this paper covers pattern recognition method, which can find and classify all useful relations between data entries in the time series. Genetic algorithm has been deployed to prepare and govern a set of independent patterns. For each pattern additional quality value has been added. This value corresponds to the level of certainty and is introduced in the work. Practical application of this solution consists of data fitting and prediction. Analyzed data can be non continuous and incomplete. In uncertain cases algorithm presents either no response at all or more than one answer to processed data. Architecture of the system offers possibility to interleave learning phase with use. Genetic algorithm applied in the method facilitates niche techniques as well as crowd factor and specialized population selection methods. Early testing results, which include prediction and fitting of simple time series with up to 50 percent of missing data, are presented at the end of the paper.","PeriodicalId":345842,"journal":{"name":"5th International Conference on Intelligent Systems Design and Applications (ISDA'05)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126628291","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 present an approach to sharing a user model among several adaptive hypermedia applications. Current adaptive hypermedia applications often realize the user model as the internal part of the system without any possibility to share this model with other applications. We introduce a Web service called UMoWS (user model Web service). The Web service acts as a store of user characteristics represented in pre-defined ontologies that define semantics of the stored knowledge. Access and corresponding privileges to the Web service is managed by the user through the management interface. The user is also allowed to inspect/modify the state of the user model.
{"title":"Sharing user models for adaptive hypermedia applications","authors":"M. Bieliková, J. Kuruc","doi":"10.1109/ISDA.2005.82","DOIUrl":"https://doi.org/10.1109/ISDA.2005.82","url":null,"abstract":"In this paper we present an approach to sharing a user model among several adaptive hypermedia applications. Current adaptive hypermedia applications often realize the user model as the internal part of the system without any possibility to share this model with other applications. We introduce a Web service called UMoWS (user model Web service). The Web service acts as a store of user characteristics represented in pre-defined ontologies that define semantics of the stored knowledge. Access and corresponding privileges to the Web service is managed by the user through the management interface. The user is also allowed to inspect/modify the state of the user model.","PeriodicalId":345842,"journal":{"name":"5th International Conference on Intelligent Systems Design and Applications (ISDA'05)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122247396","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}
The knowledge of the issues connected with pedestrian can be very helpful in the proper desing of buildings or other facilities. A simulation should take into consideration both, normal as well as evacuation conditions. Over the recent years several models of pedestrian movement have been created. The first part of the article contains a brief review of some available models. Then, the author propose a model of pedestrians group dynamics in normal and evacuation situations. A 2D cellular automata, multi-agent model is created. The model proposed takes into account some strategic abilities of each agent/pedestrian. In the model, all decisions are made by an agent in correlation with other agents.
{"title":"Cellular automata model of pedestrian dynamics for normal and evacuation conditions","authors":"Jarosław Wąs","doi":"10.1109/ISDA.2005.31","DOIUrl":"https://doi.org/10.1109/ISDA.2005.31","url":null,"abstract":"The knowledge of the issues connected with pedestrian can be very helpful in the proper desing of buildings or other facilities. A simulation should take into consideration both, normal as well as evacuation conditions. Over the recent years several models of pedestrian movement have been created. The first part of the article contains a brief review of some available models. Then, the author propose a model of pedestrians group dynamics in normal and evacuation situations. A 2D cellular automata, multi-agent model is created. The model proposed takes into account some strategic abilities of each agent/pedestrian. In the model, all decisions are made by an agent in correlation with other agents.","PeriodicalId":345842,"journal":{"name":"5th International Conference on Intelligent Systems Design and Applications (ISDA'05)","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133512669","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}
Hybrid recommendation enables overcoming disadvantages of the basic recommendation methods: demographic, collaborative and content-based. In this paper the consensus-based hybrid recommendation is presented. Then some examples of its implementation to different Web-based systems are shown.
{"title":"Implementation of consensus-based hybrid recommendation in different Web-based systems","authors":"Janusz Sobecki","doi":"10.1109/ISDA.2005.54","DOIUrl":"https://doi.org/10.1109/ISDA.2005.54","url":null,"abstract":"Hybrid recommendation enables overcoming disadvantages of the basic recommendation methods: demographic, collaborative and content-based. In this paper the consensus-based hybrid recommendation is presented. Then some examples of its implementation to different Web-based systems are shown.","PeriodicalId":345842,"journal":{"name":"5th International Conference on Intelligent Systems Design and Applications (ISDA'05)","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133367509","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}
The paper presents the possibility of the design and application of Takagi-Sugeno fuzzy inference system in predicting of gross domestic product development by designing a prediction models whose accuracy is superior to the models used in praxis.
{"title":"Prediction of gross domestic product development by Takagi-Sugeno fuzzy inference systems","authors":"V. Olej, J. Krupka","doi":"10.1109/ISDA.2005.78","DOIUrl":"https://doi.org/10.1109/ISDA.2005.78","url":null,"abstract":"The paper presents the possibility of the design and application of Takagi-Sugeno fuzzy inference system in predicting of gross domestic product development by designing a prediction models whose accuracy is superior to the models used in praxis.","PeriodicalId":345842,"journal":{"name":"5th International Conference on Intelligent Systems Design and Applications (ISDA'05)","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123932327","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 fields such as bioinformatics, cytometry, geographic information systems, just to name a few, huge amount of data, often multidimensional in nature, has more than ever highlighted the need for new algorithms to reduce the computational requirements needed for data analysis and interpretation. In this study, we present a new unsupervised clustering algorithm /sub e/nsity-based adaptive window clustering algorithm, which reduces the computational load to /spl sim/ O(N) number of computations, making it more attractive and faster than current hierarchical algorithms. This method relies on weighting a dataset to grid points on a mesh, and identifies the density peaks by reducing low density points, ranking and correlation calculation. The adaptive windows used are a modification of the recently proposed k-windows clustering algorithm to shape the desired clusters. The new algorithm makes it easier for users to observe and analyze data for enhanced interpretation and improved real-world applications, especially in clinical practices.
{"title":"A new clustering algorithm of large datasets with O(N) computational complexity","authors":"Nuannuan Zong, Feng Gui, M. Adjouadi","doi":"10.1109/ISDA.2005.12","DOIUrl":"https://doi.org/10.1109/ISDA.2005.12","url":null,"abstract":"In fields such as bioinformatics, cytometry, geographic information systems, just to name a few, huge amount of data, often multidimensional in nature, has more than ever highlighted the need for new algorithms to reduce the computational requirements needed for data analysis and interpretation. In this study, we present a new unsupervised clustering algorithm /sub e/nsity-based adaptive window clustering algorithm, which reduces the computational load to /spl sim/ O(N) number of computations, making it more attractive and faster than current hierarchical algorithms. This method relies on weighting a dataset to grid points on a mesh, and identifies the density peaks by reducing low density points, ranking and correlation calculation. The adaptive windows used are a modification of the recently proposed k-windows clustering algorithm to shape the desired clusters. The new algorithm makes it easier for users to observe and analyze data for enhanced interpretation and improved real-world applications, especially in clinical practices.","PeriodicalId":345842,"journal":{"name":"5th International Conference on Intelligent Systems Design and Applications (ISDA'05)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123988591","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}
Artificial neural networks (ANNs) were inspired by natural neural networks (NNNs) and natural processes of training. The NNNs receive data in time still tuning the inner model of the surrounding world. These valuable features of our brains let us to dynamically accommodate themselves to the changes surround. These features make us possible to forget some irrelevant information, correct our knowledge and meet truth. ANNs usually work on the training data (TD) acquired in the past and totally known at the beginning of the adaptation process. Because of this the adaptation methods of the ANNs can be sometimes more effective than the natural training process observed in the NNNs. This paper discusses the ability of ANNs to adapt more effectively than NNNs do if only the TD is completely given at the beginning of the adaptation process. In this case the adaptation process of ANNs can be divided into two steps: analyze or examining the set of TD and construction of neural network topology and weights computation. Two different applications areas of such approach are presented in the paper.
{"title":"Effectiveness of artificial neural networks adaptation according to time period of training data acquisition","authors":"A. Horzyk, E. Dudek-Dyduch","doi":"10.1109/ISDA.2005.43","DOIUrl":"https://doi.org/10.1109/ISDA.2005.43","url":null,"abstract":"Artificial neural networks (ANNs) were inspired by natural neural networks (NNNs) and natural processes of training. The NNNs receive data in time still tuning the inner model of the surrounding world. These valuable features of our brains let us to dynamically accommodate themselves to the changes surround. These features make us possible to forget some irrelevant information, correct our knowledge and meet truth. ANNs usually work on the training data (TD) acquired in the past and totally known at the beginning of the adaptation process. Because of this the adaptation methods of the ANNs can be sometimes more effective than the natural training process observed in the NNNs. This paper discusses the ability of ANNs to adapt more effectively than NNNs do if only the TD is completely given at the beginning of the adaptation process. In this case the adaptation process of ANNs can be divided into two steps: analyze or examining the set of TD and construction of neural network topology and weights computation. Two different applications areas of such approach are presented in the paper.","PeriodicalId":345842,"journal":{"name":"5th International Conference on Intelligent Systems Design and Applications (ISDA'05)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128267535","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}
Ashwini Raina, S. Patil, V. Muthukumar, A. Abraham
The advent of tiny, inexpensive, low-power, autonomously functioning wireless sensors, has paved a way for high quality research, by posing unique challenges to researchers. Energy, cost and size of such sensors limit their communication and computation capabilities and thus robust and highly energy efficient algorithms need to be incorporated at every layer of the network model, along with an efficient network aware addressing scheme. This paper proposes a 24-bit hierarchical, application-confined unique naming technique (HAUNT-24), which ensures mutual distinctiveness of addresses within an application, with the primary focus on in-network data aggregation. Various issues relating to the proposed addressing scheme are analyzed and its future scope is discussed. The simple aggregate queries such as MIN/MAX and AVG are applied over the proposed HAUNT-24 addressed network and it's shown how it helps in achieving in-network data aggregation.
{"title":"HAUNT-24: 24-bit hierarchical, application-confined unique naming technique","authors":"Ashwini Raina, S. Patil, V. Muthukumar, A. Abraham","doi":"10.1109/ISDA.2005.49","DOIUrl":"https://doi.org/10.1109/ISDA.2005.49","url":null,"abstract":"The advent of tiny, inexpensive, low-power, autonomously functioning wireless sensors, has paved a way for high quality research, by posing unique challenges to researchers. Energy, cost and size of such sensors limit their communication and computation capabilities and thus robust and highly energy efficient algorithms need to be incorporated at every layer of the network model, along with an efficient network aware addressing scheme. This paper proposes a 24-bit hierarchical, application-confined unique naming technique (HAUNT-24), which ensures mutual distinctiveness of addresses within an application, with the primary focus on in-network data aggregation. Various issues relating to the proposed addressing scheme are analyzed and its future scope is discussed. The simple aggregate queries such as MIN/MAX and AVG are applied over the proposed HAUNT-24 addressed network and it's shown how it helps in achieving in-network data aggregation.","PeriodicalId":345842,"journal":{"name":"5th International Conference on Intelligent Systems Design and Applications (ISDA'05)","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114130738","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}
Deep-sub-micron technology (DSM) of 0.18 micron and below enable the integration of logical circuits having more than 10 million gates. In such a DSM technology, layout design has become the dominant design phase. This paper discusses a novel performance-driven placement technique. The proposed algorithm based on genetic algorithms (GA) has a two-level hierarchical structure. For selection control, new objective functions are introduced for improving chip area, interconnect delay and power consumption. In order to reduce run time, the two kind of parallel processing suitable for hierarchical processing is introduced. Experimental results show improvement comparison with commercial EDA tool.
{"title":"A hierarchical parallel placement technique based on genetic algorithm","authors":"M. Yoshikawa, H. Terai","doi":"10.1109/ISDA.2005.7","DOIUrl":"https://doi.org/10.1109/ISDA.2005.7","url":null,"abstract":"Deep-sub-micron technology (DSM) of 0.18 micron and below enable the integration of logical circuits having more than 10 million gates. In such a DSM technology, layout design has become the dominant design phase. This paper discusses a novel performance-driven placement technique. The proposed algorithm based on genetic algorithms (GA) has a two-level hierarchical structure. For selection control, new objective functions are introduced for improving chip area, interconnect delay and power consumption. In order to reduce run time, the two kind of parallel processing suitable for hierarchical processing is introduced. Experimental results show improvement comparison with commercial EDA tool.","PeriodicalId":345842,"journal":{"name":"5th International Conference on Intelligent Systems Design and Applications (ISDA'05)","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126846874","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}
Business success depends on strong relationships with clients. As information technologies keep evolving and people entrust them with more and more every day tasks, e-business is becoming one of the quickest and easiest ways to reach the consumer. As e-business processes are constructed using workflow methods, which usually lack real-world deviation handling capabilities, exception handling is becoming one of the most important aspects of these processes. Of these exceptions, the most dangerous are run-time exceptions and deviations. They are difficult to catch, their impact to the process can be detrimental to achieving the process' goals, and of course they are annoying to users. The purpose of this paper is to discuss an approach for a universal exception handling mechanism, which would help achieve business process transparency and exception handling flexibility.
{"title":"The method for e-business exception handling","authors":"D. Vojevodina, G. Kulvietis, Paul Bindokas","doi":"10.1109/ISDA.2005.92","DOIUrl":"https://doi.org/10.1109/ISDA.2005.92","url":null,"abstract":"Business success depends on strong relationships with clients. As information technologies keep evolving and people entrust them with more and more every day tasks, e-business is becoming one of the quickest and easiest ways to reach the consumer. As e-business processes are constructed using workflow methods, which usually lack real-world deviation handling capabilities, exception handling is becoming one of the most important aspects of these processes. Of these exceptions, the most dangerous are run-time exceptions and deviations. They are difficult to catch, their impact to the process can be detrimental to achieving the process' goals, and of course they are annoying to users. The purpose of this paper is to discuss an approach for a universal exception handling mechanism, which would help achieve business process transparency and exception handling flexibility.","PeriodicalId":345842,"journal":{"name":"5th International Conference on Intelligent Systems Design and Applications (ISDA'05)","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128862250","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
扫码关注我们
求助内容：
应助结果提醒方式：