Recent wireless networks offer more bandwidth than ever. High quality services are developed and provided by the operators, the number of users is constantly increasing. As the transferred data and the number of terminals are growing, the network providers have to face the increasing complexity of the network management and operation tasks. In this paper we observe one of the main problems that arise in a wireless network, the tracking of the users' mobility. We compare in detail the accuracy versus the complexity of mobility models serving for location prediction.
{"title":"Location Prediction Methods with Markovian Approach and Extended Random Walk Model","authors":"P. Fülöp, S. Szabó, T. Szálka","doi":"10.1109/CISIM.2007.45","DOIUrl":"https://doi.org/10.1109/CISIM.2007.45","url":null,"abstract":"Recent wireless networks offer more bandwidth than ever. High quality services are developed and provided by the operators, the number of users is constantly increasing. As the transferred data and the number of terminals are growing, the network providers have to face the increasing complexity of the network management and operation tasks. In this paper we observe one of the main problems that arise in a wireless network, the tracking of the users' mobility. We compare in detail the accuracy versus the complexity of mobility models serving for location prediction.","PeriodicalId":350490,"journal":{"name":"6th International Conference on Computer Information Systems and Industrial Management Applications (CISIM'07)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132988197","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}
Image auto-annotation methods perform the description previously unseen images with a set of words, based on previously shown examples. This is a relatively new paradigm in image processing research domain. Capillaroscopy is a branch of medicine focusing on analysis of vascular changes. Among others, it is a very helpful tool in diagnosis of many rheumatic diseases. The paper presents a preliminary research on usage of image auto-annotation methods for the computer-aided diagnosis from capillaroscopy images.
{"title":"Capillaroscopy Image Analysis as an Automatic Image Annotation Problem","authors":"H. Kwasnicka, M. Paradowski, K. Borysewicz","doi":"10.1109/CISIM.2007.21","DOIUrl":"https://doi.org/10.1109/CISIM.2007.21","url":null,"abstract":"Image auto-annotation methods perform the description previously unseen images with a set of words, based on previously shown examples. This is a relatively new paradigm in image processing research domain. Capillaroscopy is a branch of medicine focusing on analysis of vascular changes. Among others, it is a very helpful tool in diagnosis of many rheumatic diseases. The paper presents a preliminary research on usage of image auto-annotation methods for the computer-aided diagnosis from capillaroscopy images.","PeriodicalId":350490,"journal":{"name":"6th International Conference on Computer Information Systems and Industrial Management Applications (CISIM'07)","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114082647","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 article present outstanding results given by the new application of artificial immune systems in trend change detection in time series. Author's system (GRASICA3), has been evaluated on a financial time series containing daily quotas of the main index of the Warsaw's stock exchange (WIG) and additionally on a synthetic time series generated using the Monte Carlo method. Very good results which have been obtained (>60% of accuracy in trend change signals) are compared to results of other systems known from a bibliography, designed by Gutjahr and Kingdon. In the next stage the author provides a comparison of the GRASICA3 results to results given traditional statistical modeling methods such as, a very popular Box-Jenkins and Arima X-12 algorithms.
{"title":"AIS for Trend Change Detection","authors":"A. Domaradzki","doi":"10.1109/CISIM.2007.10","DOIUrl":"https://doi.org/10.1109/CISIM.2007.10","url":null,"abstract":"This article present outstanding results given by the new application of artificial immune systems in trend change detection in time series. Author's system (GRASICA3), has been evaluated on a financial time series containing daily quotas of the main index of the Warsaw's stock exchange (WIG) and additionally on a synthetic time series generated using the Monte Carlo method. Very good results which have been obtained (>60% of accuracy in trend change signals) are compared to results of other systems known from a bibliography, designed by Gutjahr and Kingdon. In the next stage the author provides a comparison of the GRASICA3 results to results given traditional statistical modeling methods such as, a very popular Box-Jenkins and Arima X-12 algorithms.","PeriodicalId":350490,"journal":{"name":"6th International Conference on Computer Information Systems and Industrial Management Applications (CISIM'07)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134629961","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 investigates mobility management strategies from the point of view of their need of signalling and processing resources on the backbone network and load on the air interface. A method is proposed to model the serving network and mobile node mobility in order to be able to model the different types of mobility management algorithms. To obtain a good description of the network we calculate parameters from given topologies that we think are the most important ones. Mobility approaches derived from existing protocols and other, possible mobility scenarios are analyzed and their performance is numerically compared in various network and mobility scenarios. The aim is to give general designing guidelines for the next generation mobility managements on given network and mobility properties.
{"title":"Enhanced Mobility Management Modelling Framework","authors":"P. Fülöp, Benedek Kovács","doi":"10.1109/CISIM.2007.26","DOIUrl":"https://doi.org/10.1109/CISIM.2007.26","url":null,"abstract":"This paper investigates mobility management strategies from the point of view of their need of signalling and processing resources on the backbone network and load on the air interface. A method is proposed to model the serving network and mobile node mobility in order to be able to model the different types of mobility management algorithms. To obtain a good description of the network we calculate parameters from given topologies that we think are the most important ones. Mobility approaches derived from existing protocols and other, possible mobility scenarios are analyzed and their performance is numerically compared in various network and mobility scenarios. The aim is to give general designing guidelines for the next generation mobility managements on given network and mobility properties.","PeriodicalId":350490,"journal":{"name":"6th International Conference on Computer Information Systems and Industrial Management Applications (CISIM'07)","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133740051","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 recent years, various systems based on electronics, such as cars, computers and robots have been getting into our daily lives. Unfortunately, asymmetrical relationship exists between human and such systems, imposing burdens especially on elderly or handicapped persons. In order to solve various problems for balancing such asymmetrical relationship, humatronics is proposed. Main purpose of humatronics is to establish the symmetric interaction between human and electronic systems by giving the systems the capability of understanding humans. Another important factor for humatronics is computer networks, over which the systems can share knowledge, information, and experiences. This paper introduces the concept of humatronics and key technologies for realizing it. A prototype system that is currently developed based on the concept of humatronics is also introduced.
{"title":"Introduction of Humatronics--Towards Integration of Web Intelligence and Robotics","authors":"Y. Takama","doi":"10.1109/CISIM.2007.43","DOIUrl":"https://doi.org/10.1109/CISIM.2007.43","url":null,"abstract":"In recent years, various systems based on electronics, such as cars, computers and robots have been getting into our daily lives. Unfortunately, asymmetrical relationship exists between human and such systems, imposing burdens especially on elderly or handicapped persons. In order to solve various problems for balancing such asymmetrical relationship, humatronics is proposed. Main purpose of humatronics is to establish the symmetric interaction between human and electronic systems by giving the systems the capability of understanding humans. Another important factor for humatronics is computer networks, over which the systems can share knowledge, information, and experiences. This paper introduces the concept of humatronics and key technologies for realizing it. A prototype system that is currently developed based on the concept of humatronics is also introduced.","PeriodicalId":350490,"journal":{"name":"6th International Conference on Computer Information Systems and Industrial Management Applications (CISIM'07)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129451559","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 maintenance is a promising maintenance strategy. However, existing solutions are isolated from enterprise systems and limited to specific applications. A predictive maintenance framework that integrates the diversity of existing techniques for equipment failure predictions and that incorporates data both from machine level and the upper enterprise level is still missing. We envision the development of a predictive maintenance framework that is characterized by a high degree of automation and the possibility to use state-of-the-art prediction methods. We attempt to create an open architecture that enables third-party suppliers to integrate their specialized prediction components into our framework. In this paper we analyze the requirements and introduce the initial architecture associated with such a predictive maintenance framework, which is being realized in a joint project with SAP Research.
{"title":"Architecture of a Predictive Maintenance Framework","authors":"C. Groba, S. Cech, Frank Rosenthal, A. Gössling","doi":"10.1109/CISIM.2007.14","DOIUrl":"https://doi.org/10.1109/CISIM.2007.14","url":null,"abstract":"Predictive maintenance is a promising maintenance strategy. However, existing solutions are isolated from enterprise systems and limited to specific applications. A predictive maintenance framework that integrates the diversity of existing techniques for equipment failure predictions and that incorporates data both from machine level and the upper enterprise level is still missing. We envision the development of a predictive maintenance framework that is characterized by a high degree of automation and the possibility to use state-of-the-art prediction methods. We attempt to create an open architecture that enables third-party suppliers to integrate their specialized prediction components into our framework. In this paper we analyze the requirements and introduce the initial architecture associated with such a predictive maintenance framework, which is being realized in a joint project with SAP Research.","PeriodicalId":350490,"journal":{"name":"6th International Conference on Computer Information Systems and Industrial Management Applications (CISIM'07)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121417311","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 intriguing applications of immune-inspired negative selection algorithm is anomaly detection in the datasets. Such a detection is based on the self/nonself discrimination and its characteristic feature is the ability of detecting nonself samples (anomalies) by using only information about the self or regular, samples. Thus the problem space (Universe) is splitted into two disjoint subspaces: One of them contains self samples and the second is covered by the samples which activate the detectors generated by the negative selection algorithms. Hence, the efficiency of negative selection algorithms is proportional to the degree of coverage (by the detectors) of nonself subspace. In this paper, we present a simple method of increasing the coverage for real-valued negative selection algorithm.
{"title":"Simple Method of Increasing the Coverage of Nonself Region for Negative Selection Algorithms","authors":"A. Chmielewski, S. Wierzchon","doi":"10.1109/CISIM.2007.60","DOIUrl":"https://doi.org/10.1109/CISIM.2007.60","url":null,"abstract":"One of the intriguing applications of immune-inspired negative selection algorithm is anomaly detection in the datasets. Such a detection is based on the self/nonself discrimination and its characteristic feature is the ability of detecting nonself samples (anomalies) by using only information about the self or regular, samples. Thus the problem space (Universe) is splitted into two disjoint subspaces: One of them contains self samples and the second is covered by the samples which activate the detectors generated by the negative selection algorithms. Hence, the efficiency of negative selection algorithms is proportional to the degree of coverage (by the detectors) of nonself subspace. In this paper, we present a simple method of increasing the coverage for real-valued negative selection algorithm.","PeriodicalId":350490,"journal":{"name":"6th International Conference on Computer Information Systems and Industrial Management Applications (CISIM'07)","volume":"85 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131389693","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}
Clustering or data grouping is a key initial procedure in image processing. This paper deals with the application of standard and genetic k-means clustering algorithms in the area of image segmentation. In order to assess and compare both versions of k-means algorithm and its variants, appropriate procedures and software have been designed and implemented. Experimental results point that genetically optimized k-means algorithms proved their usefulness in the area of image analysis, yielding comparable and even better segmentation results.
{"title":"Standard and Genetic k-means Clustering Techniques in Image Segmentation","authors":"D. Malyszko, S. Wierzchon","doi":"10.1109/CISIM.2007.63","DOIUrl":"https://doi.org/10.1109/CISIM.2007.63","url":null,"abstract":"Clustering or data grouping is a key initial procedure in image processing. This paper deals with the application of standard and genetic k-means clustering algorithms in the area of image segmentation. In order to assess and compare both versions of k-means algorithm and its variants, appropriate procedures and software have been designed and implemented. Experimental results point that genetically optimized k-means algorithms proved their usefulness in the area of image analysis, yielding comparable and even better segmentation results.","PeriodicalId":350490,"journal":{"name":"6th International Conference on Computer Information Systems and Industrial Management Applications (CISIM'07)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121530097","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 hybrid system for word recognition. It is based on a modification to the view-based approach presented in authors' previous works. The algorithm is based on recognizing the whole words without separating them into letters. The characteristic vectors taken from both top and bottom views of the image are processed with the method of Toeplitz matrices. The obtained series of minimal eigenvalues is used for classification. The procedure of classification involves arrays of neural networks. Each network in the array is responsible for detecting one class. The results of the experiments on a set of common English words are presented.
{"title":"Modified Word Recognition System--New Performance","authors":"Marek Tabedzki, K. Saeed","doi":"10.1109/CISIM.2007.49","DOIUrl":"https://doi.org/10.1109/CISIM.2007.49","url":null,"abstract":"This paper presents a hybrid system for word recognition. It is based on a modification to the view-based approach presented in authors' previous works. The algorithm is based on recognizing the whole words without separating them into letters. The characteristic vectors taken from both top and bottom views of the image are processed with the method of Toeplitz matrices. The obtained series of minimal eigenvalues is used for classification. The procedure of classification involves arrays of neural networks. Each network in the array is responsible for detecting one class. The results of the experiments on a set of common English words are presented.","PeriodicalId":350490,"journal":{"name":"6th International Conference on Computer Information Systems and Industrial Management Applications (CISIM'07)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115388871","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}
If we want to break someone else's PIN (personal identification number) of, say, an ATM (automated teller machine), how many trials would be necessary when we want to be efficient? This is a sort of what we call a-needle-in-a-hay-stack problem. In 1987, in their wonderful paper, Hinton & Nowlan proposed a genetic algorithm with a needle being a unique configuration of 20-bit binary string while all other configurations being a haystack. What they proposed was to exploit a lifetime learning of individuals in their genetic algorithm, calling it the Baldwin effect in a computer. Since then there has been a fair amount of exploration of this effect, claiming, "this is a-needle-in-a-hay-stack problem, and we've found a more efficient algorithm than a random search." Some of them, however, were found to be the results of an effect of like-to-hear-what-we-would-like-to- hear. In this talk, we will try a bird's eye view on a few examples we have had so far, and how they were explored, including the approach by means of quantum computation which claims, "The steps to find a needle are O(radicN) while those of exhaustive search by a traditional computer are O(N) where N is the number of search points."
{"title":"Finding a Needle in a Haystack: From Baldwin Effect to Quantum Computation","authors":"A. Imada","doi":"10.1109/CISIM.2007.29","DOIUrl":"https://doi.org/10.1109/CISIM.2007.29","url":null,"abstract":"If we want to break someone else's PIN (personal identification number) of, say, an ATM (automated teller machine), how many trials would be necessary when we want to be efficient? This is a sort of what we call a-needle-in-a-hay-stack problem. In 1987, in their wonderful paper, Hinton & Nowlan proposed a genetic algorithm with a needle being a unique configuration of 20-bit binary string while all other configurations being a haystack. What they proposed was to exploit a lifetime learning of individuals in their genetic algorithm, calling it the Baldwin effect in a computer. Since then there has been a fair amount of exploration of this effect, claiming, \"this is a-needle-in-a-hay-stack problem, and we've found a more efficient algorithm than a random search.\" Some of them, however, were found to be the results of an effect of like-to-hear-what-we-would-like-to- hear. In this talk, we will try a bird's eye view on a few examples we have had so far, and how they were explored, including the approach by means of quantum computation which claims, \"The steps to find a needle are O(radicN) while those of exhaustive search by a traditional computer are O(N) where N is the number of search points.\"","PeriodicalId":350490,"journal":{"name":"6th International Conference on Computer Information Systems and Industrial Management Applications (CISIM'07)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124765526","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
扫码关注我们
求助内容：
应助结果提醒方式：