{"title":"Improving classification accuracy through feature selection","authors":"C. V. Bratu, T. Muresan, R. Potolea","doi":"10.1109/ICCP.2008.4648350","DOIUrl":"https://doi.org/10.1109/ICCP.2008.4648350","url":null,"abstract":"High accuracy is essential to any data mining process. A large part of the factors which influence the success of a data mining problem reside in the quality of the data used. Feature selection represents one of the tools which can refine a dataset before presenting it to a learning scheme. This paper analyzes a wrapper approach for feature selection, with the purpose of boosting the classification accuracy. A wrapper is viewed as a 3-tuple consisting of a generation procedure, an evaluation function and a validation procedure. Experimental evaluations have been performed for several combinations of the three components. The results have shown that feature selection improves the classification accuracy and speeds up the training process. Moreover, two robust combinations are proposed: one that constantly achieves highest accuracy, and one which significantly boosts the initial accuracy of the inducer.","PeriodicalId":169031,"journal":{"name":"2008 4th International Conference on Intelligent Computer Communication and Processing","volume":"82 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132583795","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}
{"title":"Hierarchical cluster kernels for supervised and semi-supervised learning","authors":"Zalán Bodó","doi":"10.1109/ICCP.2008.4648348","DOIUrl":"https://doi.org/10.1109/ICCP.2008.4648348","url":null,"abstract":"Semi-supervised learning became an important subdomain of machine learning in the last years. These methods try to exploit the information provided by the large and easily gathered unlabeled data besides the labeled training set. Analogously, many semi-supervised kernels appeared which determine similarity in feature space considering also the unlabeled data points. In this paper we propose a novel kernel construction algorithm for supervised and semi-supervised learning, which actually constitutes a general frame of semi-supervised kernel construction. The technique is based on the cluster assumption: we cluster the labeled and unlabeled data by an agglomerative clustering technique, and then we use the linkage distances induced by the clustering hierarchy to construct our kernel. The hierarchical cluster kernel is then compared to other existing techniques and evaluated on synthetic and real data sets.","PeriodicalId":169031,"journal":{"name":"2008 4th International Conference on Intelligent Computer Communication and Processing","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133132330","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}
{"title":"Design and implementation of a high quality TRNG in FPGA","authors":"C. Klein, O. Creţ, A. Suciu","doi":"10.1109/ICCP.2008.4648394","DOIUrl":"https://doi.org/10.1109/ICCP.2008.4648394","url":null,"abstract":"This paper focuses on the design and implementation of a high quality true-random number generator (TRNG) in FPGA. Various practical issues which we encountered are highlighted and the influence of the various parameters on the functioning of the TRNG are discussed. We also propose a few values for the parameters which use the minimum amount of the resources but still pass common random number generator test batteries such as DieHard and TestU01.","PeriodicalId":169031,"journal":{"name":"2008 4th International Conference on Intelligent Computer Communication and Processing","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117301309","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}
{"title":"Off-line recognition of handwritten numeral strings composed from two-digits partially overlapped using Convolutional Neural Networks","authors":"D. Ciresan, D. Pescaru","doi":"10.1109/ICCP.2008.4648354","DOIUrl":"https://doi.org/10.1109/ICCP.2008.4648354","url":null,"abstract":"The objective of the present work is to provide an efficient and reliable technique for off-line recognition of handwritten numerals composed from two digits partially overlapped. It can be used in various applications, like postal code recognition or information extraction from fields of different forms. Proposed solution uses convolutional neural networks (CNNs) and rely on very light preprocessing avoiding segmentation. Test results on a comprehensive well-known character database -NIST SD 19- show a high degree of recognition accuracy.","PeriodicalId":169031,"journal":{"name":"2008 4th International Conference on Intelligent Computer Communication and Processing","volume":"156 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116874795","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}
{"title":"Formal verification and implementation of real time operating system based applications","authors":"Tudor Zaharia, Piroska Haller","doi":"10.1109/ICCP.2008.4648391","DOIUrl":"https://doi.org/10.1109/ICCP.2008.4648391","url":null,"abstract":"This paper presents a framework for modeling and verification of mini real-time applications running under a multitasking kernel. The model described as networks of timed automata is mapped to real time operating systemspsila tasks. We focus on cooperative scheduling tasks with different priorities. For the tasks to be as simple as possible, a unified resource access interface is necessary.","PeriodicalId":169031,"journal":{"name":"2008 4th International Conference on Intelligent Computer Communication and Processing","volume":"82 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121581431","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}
{"title":"Periodic real-time data flows over general purpose networks","authors":"Ramona Marfievici, A. Hangan, G. Sebestyen","doi":"10.1109/ICCP.2008.4648374","DOIUrl":"https://doi.org/10.1109/ICCP.2008.4648374","url":null,"abstract":"The increasing popularity of using general purpose networks for real-time communication generates a number of issues which need to be analyzed. This paper has the objective of evaluating some of the solutions proposed in this specific research area and emphasizing their most important advantages and drawbacks. Moreover, a model is proposed as a solution for IP network bandwidth estimation in the case of periodic real-time traffic. We used this model for simulations in purpose of revealing the behavior of periodic real-time traffic on IP networks.","PeriodicalId":169031,"journal":{"name":"2008 4th International Conference on Intelligent Computer Communication and Processing","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124660617","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}
{"title":"Establishing and fixing a freshness flaw in a key-distribution and Authentication Protocol","authors":"R. Dojen, I. Lasc, T. Coffey","doi":"10.1109/ICCP.2008.4648371","DOIUrl":"https://doi.org/10.1109/ICCP.2008.4648371","url":null,"abstract":"The security of electronic networks and information systems is nowadays seen as a critical issue for the growth of information and communication technologies. Cryptographic protocols are used to provide security services such as confidentiality, message integrity, authentication, certified E-mail and non-repudiation. Traditionally, security protocols have been designed and verified using informal techniques. However, the absence of formal verification can lead to security errors remaining undetected. Formal verification techniques provide a systematic way of discovering protocol flaws. This paper establishes a freshness flaw in a key-distribution and authentication protocol using an automated logic-based verification engine. The performed verification reveals a freshness flaw in the protocol that allows an intruder to impersonate legitimate principals. The cause of the freshness flaw is discussed and an amended protocol is proposed. Formal verification of the amended protocol provides confidence in the correctness and effectiveness of the proposed modifications.","PeriodicalId":169031,"journal":{"name":"2008 4th International Conference on Intelligent Computer Communication and Processing","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115000010","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}
{"title":"Self-stabilizing synchronization algorithms on oriented chains","authors":"Doina Bein, A. Datta, L. Larmore","doi":"10.1109/ICCP.2008.4648392","DOIUrl":"https://doi.org/10.1109/ICCP.2008.4648392","url":null,"abstract":"We present a space and (asymptotically) time optimal, uniform, self-stabilizing scheme for a given synchronization problem on asynchronous oriented chains (algorithm SSDS), that works under an unfair distributed daemon. We use this scheme to solve local mutual exclusion and distributed sorting (where each process holds a single value and the values to be sorted are distinct). Algorithm SSDS can be used to obtain optimal space solutions for other problems such as broadcasting, leader election, mutual exclusion.","PeriodicalId":169031,"journal":{"name":"2008 4th International Conference on Intelligent Computer Communication and Processing","volume":"295 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134398672","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}
{"title":"CAPTCHA systems for disabled people","authors":"M. Shirali-Shahreza, S. Shirali-Shahreza","doi":"10.1109/ICCP.2008.4648396","DOIUrl":"https://doi.org/10.1109/ICCP.2008.4648396","url":null,"abstract":"Nowadays the Internet users are from different ages and groups. The disabled people also use the Internet. Some Web sites are especially created for disabled people. Many Internet sites offers services for human users, but unfortunately some computer programs are designed to abuse these services. To solve this problem, some systems named CAPTCHA (completely automated public Turing test to tell computers and human apart) have been introduced to distinguish between human users and computer programs. CAPTCHA methods are mainly based on the weaknesses of OCR systems while using them is undesirable for human users, especially for disabled people. Therefore some CAPTCHA methods are designed especially for disabled people, but there is no method for peoples with more than one disability. In this paper, this problem is examined and some possible solutions are proposed.","PeriodicalId":169031,"journal":{"name":"2008 4th International Conference on Intelligent Computer Communication and Processing","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126103328","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}
{"title":"Adaptive and robust road tracking system based on stereovision and particle filtering","authors":"R. Danescu, S. Nedevschi","doi":"10.1109/ICCP.2008.4648356","DOIUrl":"https://doi.org/10.1109/ICCP.2008.4648356","url":null,"abstract":"In order to achieve robust and accurate lane detection results in difficult scenarios, probabilistic estimation techniques are needed to compensate for the errors in detecting the lane delimiting features. This paper presents a solution for lane estimation in difficult scenarios based on the particle filtering framework. The solution employs a novel technique for pitch detection based on fusion of two stereovision-based cues, a novel method for particle measurement and weighting using multiple lane delimiting cues extracted by grayscale and stereo data processing, and a novel method for deciding upon the validity of the lane estimation results. The working range of the lane detection algorithm is automatically determined based on vehicle speed and the availability of 3D data points. Initialization samples are used for uniform handling of the road discontinuities, eliminating the need for explicit track initialization.","PeriodicalId":169031,"journal":{"name":"2008 4th International Conference on Intelligent Computer Communication and Processing","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128811613","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}