Pub Date : 2008-05-18DOI: 10.1109/INFTECH.2008.4621676
O. Kondratiuk, S. Yudin, V. Krisilov
The article is devoted to investigation of the problem of input attribute space formation for solution of the task of financial time series prediction with application of artificial neural networks. The new approach to solve this task is offered which is based on cluster analyses application. Artificial neural network of Kokhonen is applied as an instrument of cluster analyses. Comparison of the proposed approach with the well-known approaches to solution of this task is represented. Clustering quality coefficients and class recognition reliability are proposed. The efficiency of the offered approach with the financial time series prediction is experimentally proved, and namely, reduction of time for analyses and increase of reliability of the prediction obtained. Prospects for further development of this research trend are defined.
{"title":"Approach to solution of the task of attribute space formation with the time series prediction based on cluster analysis","authors":"O. Kondratiuk, S. Yudin, V. Krisilov","doi":"10.1109/INFTECH.2008.4621676","DOIUrl":"https://doi.org/10.1109/INFTECH.2008.4621676","url":null,"abstract":"The article is devoted to investigation of the problem of input attribute space formation for solution of the task of financial time series prediction with application of artificial neural networks. The new approach to solve this task is offered which is based on cluster analyses application. Artificial neural network of Kokhonen is applied as an instrument of cluster analyses. Comparison of the proposed approach with the well-known approaches to solution of this task is represented. Clustering quality coefficients and class recognition reliability are proposed. The efficiency of the offered approach with the financial time series prediction is experimentally proved, and namely, reduction of time for analyses and increase of reliability of the prediction obtained. Prospects for further development of this research trend are defined.","PeriodicalId":247264,"journal":{"name":"2008 1st International Conference on Information Technology","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115513360","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2008-05-18DOI: 10.1109/INFTECH.2008.4621635
M. Reiter, B. Kostek
The study performed is a part of the project devoted to monitoring of environmental noise. The result of the IMAGINE noise source prediction model implementation based on reference data of that model is presented in this paper together with the main objectives of the realized study. The model implementation outcome is compared with the real-life measurement results and discrepancies between prediction and measurement results are determined. Problems of reference data that are not fully applicable to Polish railway structure are described in details. Moreover, the problem of a proper assignment of the distance between the noise meter location and the track centerline is also discussed. A possibility to apply this method to dynamic noise mapping is covered as well.
{"title":"Monitoring of environmental noise - noise source modeling for polish passenger trains","authors":"M. Reiter, B. Kostek","doi":"10.1109/INFTECH.2008.4621635","DOIUrl":"https://doi.org/10.1109/INFTECH.2008.4621635","url":null,"abstract":"The study performed is a part of the project devoted to monitoring of environmental noise. The result of the IMAGINE noise source prediction model implementation based on reference data of that model is presented in this paper together with the main objectives of the realized study. The model implementation outcome is compared with the real-life measurement results and discrepancies between prediction and measurement results are determined. Problems of reference data that are not fully applicable to Polish railway structure are described in details. Moreover, the problem of a proper assignment of the distance between the noise meter location and the track centerline is also discussed. A possibility to apply this method to dynamic noise mapping is covered as well.","PeriodicalId":247264,"journal":{"name":"2008 1st International Conference on Information Technology","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128986755","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2008-05-18DOI: 10.1109/INFTECH.2008.4621623
M. Gorawski, E. Płuciennik
Distributed computing is nowadays almost ubiquities. So is data mining - time and hardware resources consuming process of building analytical models of data. Authors propose methodology of combining local analytical models (build parallely in nodes of distributed computer system) into a global one without necessary to construct distributed version of data mining algorithm. Basic assumptions for proposed solution is (i) a complete horizontal data fragmentation and (ii) a model form understood for human being. All steps of combining methodology are presented with classification model example in form of a rule set. Authors define and consider problems with combining local classification modelspsila rules into one final set of global model rules encompassing conflicting rules, sub-rules, partial sub-rules and unclassified objects. Algorithms for different combining strategies are also presented as well as their tests results. Tests were conducted with data sets from UCI Machine Learning Repository.
{"title":"Analytical models combining methodology with classification model example","authors":"M. Gorawski, E. Płuciennik","doi":"10.1109/INFTECH.2008.4621623","DOIUrl":"https://doi.org/10.1109/INFTECH.2008.4621623","url":null,"abstract":"Distributed computing is nowadays almost ubiquities. So is data mining - time and hardware resources consuming process of building analytical models of data. Authors propose methodology of combining local analytical models (build parallely in nodes of distributed computer system) into a global one without necessary to construct distributed version of data mining algorithm. Basic assumptions for proposed solution is (i) a complete horizontal data fragmentation and (ii) a model form understood for human being. All steps of combining methodology are presented with classification model example in form of a rule set. Authors define and consider problems with combining local classification modelspsila rules into one final set of global model rules encompassing conflicting rules, sub-rules, partial sub-rules and unclassified objects. Algorithms for different combining strategies are also presented as well as their tests results. Tests were conducted with data sets from UCI Machine Learning Repository.","PeriodicalId":247264,"journal":{"name":"2008 1st International Conference on Information Technology","volume":"87 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129364611","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2008-05-18DOI: 10.1109/INFTECH.2008.4621695
M. Wysota, K. Jagodzińska, M. Walkowiak
An approach of sidelob suppressing in radiation pattern of an unequally spaced array antennas is presented in this paper. The Particle Swarm Optimization (PSO) algorithm in combination with gradient methods was applied to determine elements positions in uniformly excited array. Presented approach is based on a symmetric and ideal arrays of isotropic radiators without mutual coupling. A few results of radiation patterns produced from arrays with even number of elements were presented.
{"title":"Sidelob suppression in unequally spaced antenna arrays","authors":"M. Wysota, K. Jagodzińska, M. Walkowiak","doi":"10.1109/INFTECH.2008.4621695","DOIUrl":"https://doi.org/10.1109/INFTECH.2008.4621695","url":null,"abstract":"An approach of sidelob suppressing in radiation pattern of an unequally spaced array antennas is presented in this paper. The Particle Swarm Optimization (PSO) algorithm in combination with gradient methods was applied to determine elements positions in uniformly excited array. Presented approach is based on a symmetric and ideal arrays of isotropic radiators without mutual coupling. A few results of radiation patterns produced from arrays with even number of elements were presented.","PeriodicalId":247264,"journal":{"name":"2008 1st International Conference on Information Technology","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125495497","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2008-05-18DOI: 10.1109/INFTECH.2008.4621595
Sebastian Serwin
Wireless networks are becoming increasingly popular. These wireless solutions range from personal networks (e.g. Bluetooth), through local (e.g. WiFi) and metropolitan area networks (e.g. WiMax) up to the cellular networks that offer the coverage almost everywhere. As the number of different wireless technologies grows, a unified and standardized mobility support algorithm for heterogeneous networks is needed. The paper evaluates the performance of mobility support mechanisms and algorithms offered by a new IEEE 802.21 standard. The heterogeneous scenario with UMTS and IEEE 802.11 networks is modeled and investigated. The handover in both directions is discussed, taking into account implementation of MIH Link Going Down event for IEEE 802.11 networks, proposed by the authors. This event is used to optimize handover from IEEE 802.11 network to UMTS networks. The new, proposed in the paper solution, makes it possible to support multimedia services during the heterogenous handovers. To verify the proposed algorithm the simulation environment has been defined, based on ns-2 simulator. The number of experiments was performed to evaluate the packets lost ratio and the delays introduced by heterogenous handover.
{"title":"Performance of mobility support mechanisms in a heterogeneous UMTS and IEEE 802.11 network offered under the IEEE 802.21 standard","authors":"Sebastian Serwin","doi":"10.1109/INFTECH.2008.4621595","DOIUrl":"https://doi.org/10.1109/INFTECH.2008.4621595","url":null,"abstract":"Wireless networks are becoming increasingly popular. These wireless solutions range from personal networks (e.g. Bluetooth), through local (e.g. WiFi) and metropolitan area networks (e.g. WiMax) up to the cellular networks that offer the coverage almost everywhere. As the number of different wireless technologies grows, a unified and standardized mobility support algorithm for heterogeneous networks is needed. The paper evaluates the performance of mobility support mechanisms and algorithms offered by a new IEEE 802.21 standard. The heterogeneous scenario with UMTS and IEEE 802.11 networks is modeled and investigated. The handover in both directions is discussed, taking into account implementation of MIH Link Going Down event for IEEE 802.11 networks, proposed by the authors. This event is used to optimize handover from IEEE 802.11 network to UMTS networks. The new, proposed in the paper solution, makes it possible to support multimedia services during the heterogenous handovers. To verify the proposed algorithm the simulation environment has been defined, based on ns-2 simulator. The number of experiments was performed to evaluate the packets lost ratio and the delays introduced by heterogenous handover.","PeriodicalId":247264,"journal":{"name":"2008 1st International Conference on Information Technology","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134519708","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2008-05-18DOI: 10.1109/INFTECH.2008.4621664
I. N. Fovino, Alberto Trombetta
Privacy is one of the most important properties an information system must satisfy. A relatively new trend shows that classical access control techniques are not sufficient to guarantee privacy when datamining techniques are used. Privacy Preserving Data Mining (PPDM) algorithms have been recently introduced with the aim of sanitizing the database in such a way to prevent the discovery of sensible information (e.g. association rules). A drawback of such algorithms is that the introduced sanitization may disrupt the quality of data itself. In this paper we introduce a new methodology and algorithms for performing useful PPDM operations, while preserving the data quality of the underlying database.
{"title":"Information driven association rule hiding algorithms","authors":"I. N. Fovino, Alberto Trombetta","doi":"10.1109/INFTECH.2008.4621664","DOIUrl":"https://doi.org/10.1109/INFTECH.2008.4621664","url":null,"abstract":"Privacy is one of the most important properties an information system must satisfy. A relatively new trend shows that classical access control techniques are not sufficient to guarantee privacy when datamining techniques are used. Privacy Preserving Data Mining (PPDM) algorithms have been recently introduced with the aim of sanitizing the database in such a way to prevent the discovery of sensible information (e.g. association rules). A drawback of such algorithms is that the introduced sanitization may disrupt the quality of data itself. In this paper we introduce a new methodology and algorithms for performing useful PPDM operations, while preserving the data quality of the underlying database.","PeriodicalId":247264,"journal":{"name":"2008 1st International Conference on Information Technology","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134561289","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2008-05-18DOI: 10.1109/INFTECH.2008.4621607
Andrzej Wardzinski
Arguing that an autonomous mobile system is sufficiently safe to operate in presence of other vehicles and objects is an important element in development of such systems. Traditional approach to assure safety is to distinguish between safe and unsafe area and prevent the autonomous vehicle from entering the unsafe area. The paper presents a model of autonomous vehicle control system which uses risk assessment of the current and foreseen situations to plan its movement. The approach is discussed for two examples of simulation scenarios. The problem of risk assessment uncertainty and the need for cooperation between vehicles is addressed.
{"title":"Dynamic risk assessment in autonomous vehicles motion planning","authors":"Andrzej Wardzinski","doi":"10.1109/INFTECH.2008.4621607","DOIUrl":"https://doi.org/10.1109/INFTECH.2008.4621607","url":null,"abstract":"Arguing that an autonomous mobile system is sufficiently safe to operate in presence of other vehicles and objects is an important element in development of such systems. Traditional approach to assure safety is to distinguish between safe and unsafe area and prevent the autonomous vehicle from entering the unsafe area. The paper presents a model of autonomous vehicle control system which uses risk assessment of the current and foreseen situations to plan its movement. The approach is discussed for two examples of simulation scenarios. The problem of risk assessment uncertainty and the need for cooperation between vehicles is addressed.","PeriodicalId":247264,"journal":{"name":"2008 1st International Conference on Information Technology","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132642364","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2008-05-18DOI: 10.1109/INFTECH.2008.4621651
E. Lach
Virtual characters are widely used in many applications, especially in computer games, films and educational systems. Creation of intelligent characters capable of deciding about their actions is currently afield of extensive research. A new behavioural animation framework fACT, described in this paper, is an answer to a problem of finding an application that allows for using unrestricted number of techniques for generation of virtual characters behaviours. fACTs architecture permits easy substitution of one technique by another. It also allows for easy integration with existing tools: applications and libraries. The paper presents framework's modules and how these are integrated. Some programming issues and the main steps of the simulation flow are also analysed.
{"title":"fACT - animation framework for generation of virtual characters behaviours","authors":"E. Lach","doi":"10.1109/INFTECH.2008.4621651","DOIUrl":"https://doi.org/10.1109/INFTECH.2008.4621651","url":null,"abstract":"Virtual characters are widely used in many applications, especially in computer games, films and educational systems. Creation of intelligent characters capable of deciding about their actions is currently afield of extensive research. A new behavioural animation framework fACT, described in this paper, is an answer to a problem of finding an application that allows for using unrestricted number of techniques for generation of virtual characters behaviours. fACTs architecture permits easy substitution of one technique by another. It also allows for easy integration with existing tools: applications and libraries. The paper presents framework's modules and how these are integrated. Some programming issues and the main steps of the simulation flow are also analysed.","PeriodicalId":247264,"journal":{"name":"2008 1st International Conference on Information Technology","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130801485","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2008-05-18DOI: 10.1109/INFTECH.2008.4621600
A. Kornecki, J. Zalewski
In recent decades, multiple application domains emerged that use computational devices embedded in commercial products that are sensitive to safety concerns. They include not only typical areas, such as nuclear technology and aircraft avionics, but also many medical devices, cars, railway transportation, and others. The essential requirements for this kind of products are so strict that they are regulated by respective government agencies, for example FAA and FDA in the U.S. This paper addresses the most important aspects of using software tools for designing complex electronic hardware for such systems and focuses on special assessment criteria for these tools.
{"title":"Safety assurance for safety-critical embedded systems: Qualification of tools for complex electronic hardware","authors":"A. Kornecki, J. Zalewski","doi":"10.1109/INFTECH.2008.4621600","DOIUrl":"https://doi.org/10.1109/INFTECH.2008.4621600","url":null,"abstract":"In recent decades, multiple application domains emerged that use computational devices embedded in commercial products that are sensitive to safety concerns. They include not only typical areas, such as nuclear technology and aircraft avionics, but also many medical devices, cars, railway transportation, and others. The essential requirements for this kind of products are so strict that they are regulated by respective government agencies, for example FAA and FDA in the U.S. This paper addresses the most important aspects of using software tools for designing complex electronic hardware for such systems and focuses on special assessment criteria for these tools.","PeriodicalId":247264,"journal":{"name":"2008 1st International Conference on Information Technology","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130935774","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2008-05-18DOI: 10.1109/INFTECH.2008.4621661
M. Junghans, H. Jentschel
The concept of Bayesian networks (BNs) is an established method to model data fusion in sensor networks of several equal or different sensors. Although the method is powerful, there is a particular need for accurate sensors, the consideration of the affecting external, e.g. environmental conditions, and internal influences, e.g. the physical life of the sensor, in the sensor model and an accurate a-priori knowledge about the underlying process. In this paper an adaptive algorithm for learning BNs is introduced, which is applied to update the time-variant a-priori probabilities in sensor networks. This algorithm makes use of contaminated Dirichlet density functions (CDDFs). The effectiveness of adaptive learning is demonstrated for vehicle classification in traffic surveillance.
{"title":"Adaptive learning of Bayesian Networks for the qualification of traffic data by Contaminated Dirichlet Density Functions","authors":"M. Junghans, H. Jentschel","doi":"10.1109/INFTECH.2008.4621661","DOIUrl":"https://doi.org/10.1109/INFTECH.2008.4621661","url":null,"abstract":"The concept of Bayesian networks (BNs) is an established method to model data fusion in sensor networks of several equal or different sensors. Although the method is powerful, there is a particular need for accurate sensors, the consideration of the affecting external, e.g. environmental conditions, and internal influences, e.g. the physical life of the sensor, in the sensor model and an accurate a-priori knowledge about the underlying process. In this paper an adaptive algorithm for learning BNs is introduced, which is applied to update the time-variant a-priori probabilities in sensor networks. This algorithm makes use of contaminated Dirichlet density functions (CDDFs). The effectiveness of adaptive learning is demonstrated for vehicle classification in traffic surveillance.","PeriodicalId":247264,"journal":{"name":"2008 1st International Conference on Information Technology","volume":"58 31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131154407","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
扫码关注我们
求助内容：
应助结果提醒方式：