Although digital images indexing and querying techniques have extensively been studied for the last years, few systems are dedicated to medical images today while the need for content-based analysis and retrieval tools increases with the growth of digital medical image databases. In this paper, we present a content based medical images indexing and retrieval technique (CBIR) using the 2/spl times/2 discrete cosine transform and information dominance strategy (IDS) compression. The extraction of the feature vectors is based on a 4/spl times/4 DCT model proposed in the literature. These features are directly generated from the 2/spl times/2 DCT coefficients reorganized in subbands and the search process is carried out: by' calculating cosine distance measure between the signatures of the query image and those stored in the database. The developed 2/spl times/2 DCT approach is expected to be very useful for a targeted seeking.
{"title":"Indexing and retrieval medical images based on 2/spl times/2 DCT and IDS compression","authors":"K. A. Saadi, A. Zemouri, Z. Brahimi, H. Meraoubi","doi":"10.1109/ISDA.2005.56","DOIUrl":"https://doi.org/10.1109/ISDA.2005.56","url":null,"abstract":"Although digital images indexing and querying techniques have extensively been studied for the last years, few systems are dedicated to medical images today while the need for content-based analysis and retrieval tools increases with the growth of digital medical image databases. In this paper, we present a content based medical images indexing and retrieval technique (CBIR) using the 2/spl times/2 discrete cosine transform and information dominance strategy (IDS) compression. The extraction of the feature vectors is based on a 4/spl times/4 DCT model proposed in the literature. These features are directly generated from the 2/spl times/2 DCT coefficients reorganized in subbands and the search process is carried out: by' calculating cosine distance measure between the signatures of the query image and those stored in the database. The developed 2/spl times/2 DCT approach is expected to be very useful for a targeted seeking.","PeriodicalId":345842,"journal":{"name":"5th International Conference on Intelligent Systems Design and Applications (ISDA'05)","volume":"338 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":"115461467","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 to the graph coloring problem (GCP) which utilizes information about conflict localization in a given coloring. In this context a partial fitness function (pff) and its usage to specialize genetic operators and phenotypic measure of diversity in population are described. Particular attention is given to the investigation of the influence of the population size and the usage of genetic operators on the character of the evolution, especially influence leading to a premature convergence in the evolution process. Experiments based on benchmark DIMACS graphs are presented.
{"title":"New evolutionary approach to the GCP: a premature convergence and an evolution process character","authors":"P. Myszkowski","doi":"10.1109/ISDA.2005.71","DOIUrl":"https://doi.org/10.1109/ISDA.2005.71","url":null,"abstract":"This paper presents a new approach to the graph coloring problem (GCP) which utilizes information about conflict localization in a given coloring. In this context a partial fitness function (pff) and its usage to specialize genetic operators and phenotypic measure of diversity in population are described. Particular attention is given to the investigation of the influence of the population size and the usage of genetic operators on the character of the evolution, especially influence leading to a premature convergence in the evolution process. Experiments based on benchmark DIMACS graphs are presented.","PeriodicalId":345842,"journal":{"name":"5th International Conference on Intelligent Systems Design and Applications (ISDA'05)","volume":"140 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":"114779191","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}
We investigate a pure exchange economy under uncertainty with emphasis on the logical point of view from data base theory; the traders are assumed to have a multi-modal logic of belief and to make their decision under uncertainty represented by rough sets. We propose a generalized notion of expectations equilibrium for the economy, and we show the fundamental welfare theorem: An allocation in the economy is ex-ante Pareto optimal if and only if it is an expectations equilibrium allocation in belief for some initial endowment with respect to some price system.
{"title":"Welfare economy on belief in data mining - a rough set theoretical approach","authors":"T. Matsuhisa","doi":"10.1109/ISDA.2005.101","DOIUrl":"https://doi.org/10.1109/ISDA.2005.101","url":null,"abstract":"We investigate a pure exchange economy under uncertainty with emphasis on the logical point of view from data base theory; the traders are assumed to have a multi-modal logic of belief and to make their decision under uncertainty represented by rough sets. We propose a generalized notion of expectations equilibrium for the economy, and we show the fundamental welfare theorem: An allocation in the economy is ex-ante Pareto optimal if and only if it is an expectations equilibrium allocation in belief for some initial endowment with respect to some price system.","PeriodicalId":345842,"journal":{"name":"5th International Conference on Intelligent Systems Design and Applications (ISDA'05)","volume":"59 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":"129586835","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}
There are different methods for detecting digital faults in electronic and computer systems. But for analog faults, there are some problems. This kind of faults consists of many different and parametric faults, which can not be detected by digital fault detection methods. One of the proposed methods for analog fault detection is neural networks. Fault detection is actually a pattern recognition task. Faulty and fault free data are different patterns which must be recognized. In this paper we use a probabilistic neural network for fault detection in MEMS. A fuzzy system is used to improve performance of the network. Finally different network results are compared.
{"title":"Using fuzzy probabilistic neural network for fault detection in MEMS","authors":"R. Asgary, K. Mohammadi","doi":"10.1109/ISDA.2005.96","DOIUrl":"https://doi.org/10.1109/ISDA.2005.96","url":null,"abstract":"There are different methods for detecting digital faults in electronic and computer systems. But for analog faults, there are some problems. This kind of faults consists of many different and parametric faults, which can not be detected by digital fault detection methods. One of the proposed methods for analog fault detection is neural networks. Fault detection is actually a pattern recognition task. Faulty and fault free data are different patterns which must be recognized. In this paper we use a probabilistic neural network for fault detection in MEMS. A fuzzy system is used to improve performance of the network. Finally different network results are compared.","PeriodicalId":345842,"journal":{"name":"5th International Conference on Intelligent Systems Design and Applications (ISDA'05)","volume":"260 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":"122684578","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}
Recently, collaborative filtering is proposed as an information gathering technology of the WWW in the network. Collaborative filtering is a technology that recommends information on the Web page for an arbitrary user who wants to acquire recommendation information based on many users' evaluation and retrieval histories. In this paper, the bookmark shared system that filters bookmark information collaboratively is described. Especially, we explain the details of the bookmark shared system using agent systems and it's collaborative filtering on the distributed environment. In a concrete agent modeling, the multiagent does a simple communication to notify the profile update, and the retrieval processing is done by a mobile agent. As a result, the profile management on the distributed environment is facilitated, and it is possible to construct collaborative filtering system that can decrease the communication frequency in the retrieval processing.
{"title":"Bookmark shared system using agent systems","authors":"Y. Nagai, K. Inoue","doi":"10.1109/ISDA.2005.30","DOIUrl":"https://doi.org/10.1109/ISDA.2005.30","url":null,"abstract":"Recently, collaborative filtering is proposed as an information gathering technology of the WWW in the network. Collaborative filtering is a technology that recommends information on the Web page for an arbitrary user who wants to acquire recommendation information based on many users' evaluation and retrieval histories. In this paper, the bookmark shared system that filters bookmark information collaboratively is described. Especially, we explain the details of the bookmark shared system using agent systems and it's collaborative filtering on the distributed environment. In a concrete agent modeling, the multiagent does a simple communication to notify the profile update, and the retrieval processing is done by a mobile agent. As a result, the profile management on the distributed environment is facilitated, and it is possible to construct collaborative filtering system that can decrease the communication frequency in the retrieval processing.","PeriodicalId":345842,"journal":{"name":"5th International Conference on Intelligent Systems Design and Applications (ISDA'05)","volume":"27 31","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120927759","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 the ways of designing simulation models of Web servers. At the beginning queuing network models are introduced, those models are generally known and often used in the initial phase of research on particular technical solutions. Next, an entirely new approach to the issue discussed is presented - neuro-fuzzy models, thanks to which, it is possible to automate the process of designing simulation models. The results of comparative tests of these two models are presented. Based on these results it can be concluded that neuro-fuzzy models are accurate and can be used in simulation research.
{"title":"Proposal of a neuro-fuzzy model of a WWW server","authors":"K. Zatwarnicki","doi":"10.1109/ISDA.2005.79","DOIUrl":"https://doi.org/10.1109/ISDA.2005.79","url":null,"abstract":"This paper presents the ways of designing simulation models of Web servers. At the beginning queuing network models are introduced, those models are generally known and often used in the initial phase of research on particular technical solutions. Next, an entirely new approach to the issue discussed is presented - neuro-fuzzy models, thanks to which, it is possible to automate the process of designing simulation models. The results of comparative tests of these two models are presented. Based on these results it can be concluded that neuro-fuzzy models are accurate and can be used in simulation research.","PeriodicalId":345842,"journal":{"name":"5th International Conference on Intelligent Systems Design and Applications (ISDA'05)","volume":"7 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":"124790447","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}
One of the most important requirements of data warehouses is query response time. Amongst all methods of improving query performance, parallel processing (especially in shared nothing class) is one of the giving practically unlimited system's scaling possibility. The key problem in a parallel data warehouses is data allocation between system nodes. The problem is growing when nodes have different computational characteristics. In this paper we present an algorithm of balancing parallel data warehouse built on mentioned architecture. Balancing is realized by setting dataset size stored in each node. We exploited some well known data allocation schemas using space filling curves: Hilbert and Peano. Our conception is verified by a set of tests and its analysis.
{"title":"Parallel telemetric data warehouse balancing algorithm","authors":"M. Gorawski, Robert Chechelski","doi":"10.1109/ISDA.2005.75","DOIUrl":"https://doi.org/10.1109/ISDA.2005.75","url":null,"abstract":"One of the most important requirements of data warehouses is query response time. Amongst all methods of improving query performance, parallel processing (especially in shared nothing class) is one of the giving practically unlimited system's scaling possibility. The key problem in a parallel data warehouses is data allocation between system nodes. The problem is growing when nodes have different computational characteristics. In this paper we present an algorithm of balancing parallel data warehouse built on mentioned architecture. Balancing is realized by setting dataset size stored in each node. We exploited some well known data allocation schemas using space filling curves: Hilbert and Peano. Our conception is verified by a set of tests and its analysis.","PeriodicalId":345842,"journal":{"name":"5th International Conference on Intelligent Systems Design and Applications (ISDA'05)","volume":"26 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":"123363488","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 examine the use of a matrix factorization technique called singular value decomposition (SVD) in item-based collaborative filtering. After a brief introduction to SVD and some of its previous applications in recommender systems, we proceed with a full description of our algorithm, which uses SVD in order to reduce the dimension of the active item's neighborhood. The experimental part of this work first locates the ideal parameter settings for the algorithm, and concludes by contrasting it with plain item-based filtering which utilizes the original, high dimensional neighborhood. The results show that a reduction in the dimension of the item neighborhood is promising, since it does not only tackle some of the recorded problems of recommender systems, but also assists in increasing the accuracy of systems employing it.
{"title":"Applying SVD on item-based filtering","authors":"M. Vozalis, K. Margaritis","doi":"10.1109/ISDA.2005.25","DOIUrl":"https://doi.org/10.1109/ISDA.2005.25","url":null,"abstract":"In this paper we examine the use of a matrix factorization technique called singular value decomposition (SVD) in item-based collaborative filtering. After a brief introduction to SVD and some of its previous applications in recommender systems, we proceed with a full description of our algorithm, which uses SVD in order to reduce the dimension of the active item's neighborhood. The experimental part of this work first locates the ideal parameter settings for the algorithm, and concludes by contrasting it with plain item-based filtering which utilizes the original, high dimensional neighborhood. The results show that a reduction in the dimension of the item neighborhood is promising, since it does not only tackle some of the recorded problems of recommender systems, but also assists in increasing the accuracy of systems employing it.","PeriodicalId":345842,"journal":{"name":"5th International Conference on Intelligent Systems Design and Applications (ISDA'05)","volume":"25 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":"117293299","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}
Market segmentation is one of the most important area of knowledge-based marketing. In banks, it is really a challenging task as data bases are large and multidimensional. In the paper we consider cluster analysis, which is the methodology, the most often applied in this area. We compare clustering algorithms in cases of high dimensionality with noise. We discuss using three algorithms: density based DBSCAN, k-means and based on it two-phase clustering process. We compare algorithms concerning their effectiveness and scalability. Some experiments with exemplary bank data sets are presented.
{"title":"Clustering algorithms for bank customer segmentation","authors":"D. Zakrzewska, J. Murlewski","doi":"10.1109/ISDA.2005.33","DOIUrl":"https://doi.org/10.1109/ISDA.2005.33","url":null,"abstract":"Market segmentation is one of the most important area of knowledge-based marketing. In banks, it is really a challenging task as data bases are large and multidimensional. In the paper we consider cluster analysis, which is the methodology, the most often applied in this area. We compare clustering algorithms in cases of high dimensionality with noise. We discuss using three algorithms: density based DBSCAN, k-means and based on it two-phase clustering process. We compare algorithms concerning their effectiveness and scalability. Some experiments with exemplary bank data sets are presented.","PeriodicalId":345842,"journal":{"name":"5th International Conference on Intelligent Systems Design and Applications (ISDA'05)","volume":"55 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":"116339204","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 relates to a fuzzy flight control system in spot hovering for a single-rotor helicopter PZL Kania. The model of the fuzzy control system was developed on the basis of computer simulation experiments done by the expert's analysis (pilot's knowledge). The helicopter's mathematical model and its fuzzy flight control system were simulated using Matlab software package. In a series of numerous computer simulations the operation of the fuzzy control system was investigated and the system itself was tuned up. Simulation tests have been performed for the helicopter both in fixed hovering, and in hovering with disturbances. Disturbances were related to a gust of wind or to an accidental motion of one of the rudders. Obtained results give the good promise for building the Web simulator.
{"title":"Fuzzy flight control system for helicopter intelligence in hover","authors":"M. Lower, B. Szlachetko, Dariusz Król","doi":"10.1109/ISDA.2005.48","DOIUrl":"https://doi.org/10.1109/ISDA.2005.48","url":null,"abstract":"This paper relates to a fuzzy flight control system in spot hovering for a single-rotor helicopter PZL Kania. The model of the fuzzy control system was developed on the basis of computer simulation experiments done by the expert's analysis (pilot's knowledge). The helicopter's mathematical model and its fuzzy flight control system were simulated using Matlab software package. In a series of numerous computer simulations the operation of the fuzzy control system was investigated and the system itself was tuned up. Simulation tests have been performed for the helicopter both in fixed hovering, and in hovering with disturbances. Disturbances were related to a gust of wind or to an accidental motion of one of the rudders. Obtained results give the good promise for building the Web simulator.","PeriodicalId":345842,"journal":{"name":"5th International Conference on Intelligent Systems Design and Applications (ISDA'05)","volume":"442 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":"116405048","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
扫码关注我们
求助内容：
应助结果提醒方式：