In order to improve the robustness and stability as well as the computation efficiency of the video tracker based on particle filtering, an adaptive state evolution equation and an online increment learning observation likelihood model configured by an updatable eigen-basis of the object appearance subspace is combined into the particle filter to cope with the uncertainties during tracking, and the strategy of online self-adjusting the number of particle needed for approximating the state posterior density function is adopted to enhance the computation efficiency. The experimental results show that the approach proposed in this paper can not only track the moving object in the video reliably and effectively, but has nice robustness to the appearance variation caused by illumination, occlusion and pose changes.
{"title":"A Robust Visual Tracking Approach with Adaptive Particle Filtering","authors":"Tao Xi, Shengxiu Zhang, Shiyuan Yan","doi":"10.1109/ICCSN.2010.66","DOIUrl":"https://doi.org/10.1109/ICCSN.2010.66","url":null,"abstract":"In order to improve the robustness and stability as well as the computation efficiency of the video tracker based on particle filtering, an adaptive state evolution equation and an online increment learning observation likelihood model configured by an updatable eigen-basis of the object appearance subspace is combined into the particle filter to cope with the uncertainties during tracking, and the strategy of online self-adjusting the number of particle needed for approximating the state posterior density function is adopted to enhance the computation efficiency. The experimental results show that the approach proposed in this paper can not only track the moving object in the video reliably and effectively, but has nice robustness to the appearance variation caused by illumination, occlusion and pose changes.","PeriodicalId":255246,"journal":{"name":"2010 Second International Conference on Communication Software and Networks","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-02-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121257563","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 need to secure sensitive data and computer systems from intruders, while allowing ease of access for authenticate user is one of the main problems in computer security. Traditionally, passwords have been the usual method for controlling access to computer systems but this approach has many inherent flaws. Keystroke dynamics is a promising biometric technique to recognize an individual based on an analysis of his/her typing patterns. In the experiment, we measure mean, standard deviation and median values of keystroke features such as latency, duration, digraph and their combinations and compare their performance. Particle swarm optimization (PSO), genetic algorithm (GA) and the proposed ant colony optimization (ACO) are used for feature subset selection. Back propagation neural network (BPNN) is used for classification. ACO gives better performance than PSO and GA with regard to feature reduction rate and classification accuracy. Using digraph as the feature for feature subset selection is novel and show good classification performance.
{"title":"Personal Authentication Based on Keystroke Dynamics Using Soft Computing Techniques","authors":"M. Karnan, M. Akila","doi":"10.1109/ICCSN.2010.50","DOIUrl":"https://doi.org/10.1109/ICCSN.2010.50","url":null,"abstract":"The need to secure sensitive data and computer systems from intruders, while allowing ease of access for authenticate user is one of the main problems in computer security. Traditionally, passwords have been the usual method for controlling access to computer systems but this approach has many inherent flaws. Keystroke dynamics is a promising biometric technique to recognize an individual based on an analysis of his/her typing patterns. In the experiment, we measure mean, standard deviation and median values of keystroke features such as latency, duration, digraph and their combinations and compare their performance. Particle swarm optimization (PSO), genetic algorithm (GA) and the proposed ant colony optimization (ACO) are used for feature subset selection. Back propagation neural network (BPNN) is used for classification. ACO gives better performance than PSO and GA with regard to feature reduction rate and classification accuracy. Using digraph as the feature for feature subset selection is novel and show good classification performance.","PeriodicalId":255246,"journal":{"name":"2010 Second International Conference on Communication Software and Networks","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-02-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127040356","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 mainly analysis and describe the design issue of stream ciphers in Network security as the streams are widely used to protecting the privacy of digital information. A variety of attacks against stream cipher exist;(algebraic and so on). These attacks have been very successful against a variety of stream ciphers. So in this paper efforts have been done to design and analyze stream ciphers. The main contribution is to design new stream ciphers through analysis of the algebraic immunity of Boolean functions and S-Boxes. In this paper, the cryptographic properties of non-linear transformation have been used for designing of stream ciphers Many LFSR (Linear feedback Shift Register) based stream ciphers use non-linear Boolean function to destroy the linearity of the LFSR(s) output. Many of these designs have been broken by algebraic attacks. Here we analyze a popular and cryptographically significant class of non-linear Boolean functions for their resistance to algebraic attacks.
{"title":"Design and Analysis of Stream Cipher for Network Security","authors":"Chhattar Singh Lamba","doi":"10.1109/ICCSN.2010.113","DOIUrl":"https://doi.org/10.1109/ICCSN.2010.113","url":null,"abstract":"This paper mainly analysis and describe the design issue of stream ciphers in Network security as the streams are widely used to protecting the privacy of digital information. A variety of attacks against stream cipher exist;(algebraic and so on). These attacks have been very successful against a variety of stream ciphers. So in this paper efforts have been done to design and analyze stream ciphers. The main contribution is to design new stream ciphers through analysis of the algebraic immunity of Boolean functions and S-Boxes. In this paper, the cryptographic properties of non-linear transformation have been used for designing of stream ciphers Many LFSR (Linear feedback Shift Register) based stream ciphers use non-linear Boolean function to destroy the linearity of the LFSR(s) output. Many of these designs have been broken by algebraic attacks. Here we analyze a popular and cryptographically significant class of non-linear Boolean functions for their resistance to algebraic attacks.","PeriodicalId":255246,"journal":{"name":"2010 Second International Conference on Communication Software and Networks","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-02-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126709205","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 Wireless Sensor Networks (WSN) environments are increasingly becoming intelligent with the rapid boost in the capabilities of sensor nodes. The Sun Small Programmable Object Technology (SPOT) platform offers a high-end sensing device in terms of processing, memory and battery configurations compared to other existing in the community. Within the scope of this paper, a health care use case is derived from the concept of service-oriented collector nodes represented by Sun SPOTs. The existing Mobile Web Services (MobWS) framework is ported to Sun SPOT devices that enables domain specific in-network computations enfolding synchronous or asynchronous classes of MobWSs. Based on that, the exemplary requirements of the Web Services (WS) in the health care domain are spotlighted and impressions of a comprehensive prototype, called MEDICARE, are shown.
{"title":"Mobile Web Services in Health Care and Sensor Networks","authors":"Fahad Aijaz, Muzzamil Aziz Chaudhary, B. Walke","doi":"10.1109/ICCSN.2010.42","DOIUrl":"https://doi.org/10.1109/ICCSN.2010.42","url":null,"abstract":"The Wireless Sensor Networks (WSN) environments are increasingly becoming intelligent with the rapid boost in the capabilities of sensor nodes. The Sun Small Programmable Object Technology (SPOT) platform offers a high-end sensing device in terms of processing, memory and battery configurations compared to other existing in the community. Within the scope of this paper, a health care use case is derived from the concept of service-oriented collector nodes represented by Sun SPOTs. The existing Mobile Web Services (MobWS) framework is ported to Sun SPOT devices that enables domain specific in-network computations enfolding synchronous or asynchronous classes of MobWSs. Based on that, the exemplary requirements of the Web Services (WS) in the health care domain are spotlighted and impressions of a comprehensive prototype, called MEDICARE, are shown.","PeriodicalId":255246,"journal":{"name":"2010 Second International Conference on Communication Software and Networks","volume":"295 12","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-02-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114105417","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}
Due to the outstanding progress in computer technology and an ever-rising demand for high-speed processing able to support the distributed mode there is an increasing trend towards the use of parallel and distributed systems. In addition, one of the important stages of any system utilizing parallel computing is the load balancing stage in which the balance of workload among all of the system’s processors is aimed. In this article, load balancing in parallel systems is studied then; a new load balancing algorithm which has new capabilities will be introduced. Among the new capabilities of this algorithm, its independence of a separate route-finder algorithm between the load receiver and sender nodes can be mentioned. Finally the results of the simulation of this algorithm will be presented.
{"title":"A New Load Balancing Algorithm in Parallel Computing","authors":"K. Zamanifar, N. Nematbakhsh, R. S. Sadjady","doi":"10.1109/ICCSN.2010.27","DOIUrl":"https://doi.org/10.1109/ICCSN.2010.27","url":null,"abstract":"Due to the outstanding progress in computer technology and an ever-rising demand for high-speed processing able to support the distributed mode there is an increasing trend towards the use of parallel and distributed systems. In addition, one of the important stages of any system utilizing parallel computing is the load balancing stage in which the balance of workload among all of the system’s processors is aimed. In this article, load balancing in parallel systems is studied then; a new load balancing algorithm which has new capabilities will be introduced. Among the new capabilities of this algorithm, its independence of a separate route-finder algorithm between the load receiver and sender nodes can be mentioned. Finally the results of the simulation of this algorithm will be presented.","PeriodicalId":255246,"journal":{"name":"2010 Second International Conference on Communication Software and Networks","volume":"124 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-02-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124307795","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}
Orthogonal frequency division multiplexing (OFDM) has been used widely in several communication systems. However, OFDM is very sensitive to the radio frequency (RF) impairments. One of the serious major impairments is the IQ imbalance between In-phase (I) and Quadrature (Q) branches. This IQ imbalance can be the mail reason of bit error rate (BER) performance degradation in the high-speed OFDM communication system. In this paper, the closed form of BER of OFDM with IQ imbalance is derived in the Rayleigh fading channel and novelly investigates the effect of transmit and receive diversity on this OFDM communication system with Q imbalance in the Rayleigh fading channel. Via the computer simulation, it is verified that analytical result is very close to simulation result. So, it is very useful and convenient to evaluate the BER performance of multi-input multi-output (MIMO) system with IQ imbalance in the Rayleigh fading environment.
{"title":"Diversity Effect of OFDM Communication with IQ Imbalance in the Rayleigh Fading Channel","authors":"H. Ryu","doi":"10.1109/ICCSN.2010.78","DOIUrl":"https://doi.org/10.1109/ICCSN.2010.78","url":null,"abstract":"Orthogonal frequency division multiplexing (OFDM) has been used widely in several communication systems. However, OFDM is very sensitive to the radio frequency (RF) impairments. One of the serious major impairments is the IQ imbalance between In-phase (I) and Quadrature (Q) branches. This IQ imbalance can be the mail reason of bit error rate (BER) performance degradation in the high-speed OFDM communication system. In this paper, the closed form of BER of OFDM with IQ imbalance is derived in the Rayleigh fading channel and novelly investigates the effect of transmit and receive diversity on this OFDM communication system with Q imbalance in the Rayleigh fading channel. Via the computer simulation, it is verified that analytical result is very close to simulation result. So, it is very useful and convenient to evaluate the BER performance of multi-input multi-output (MIMO) system with IQ imbalance in the Rayleigh fading environment.","PeriodicalId":255246,"journal":{"name":"2010 Second International Conference on Communication Software and Networks","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-02-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115007252","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}
Farzad Kiyani, Hamidreza Tahmasebi Rad, Hadi Chalangari, Sajjad Yari
In this paper, a dynamic clustering for saving energy for wireless sensor network suggested. Our goal is to decrease the probability of missing the target and to increase the tracking exactness. First phase is consisting of selecting cluster head and creating clusters. In the next phase, new creating cluster based on moving targets. So that cluster head calculates the current location of target. In other phase, target tracking in environment be done by routing target among nodes. This cases cause saving energy in total network. We implemented our tracking algorithm in ns-2 simulator. Missing rate in our algorithm is 9%
{"title":"DCSE: A Dynamic Clustering for Saving Energy in Wireless Sensor Network","authors":"Farzad Kiyani, Hamidreza Tahmasebi Rad, Hadi Chalangari, Sajjad Yari","doi":"10.1109/ICCSN.2010.98","DOIUrl":"https://doi.org/10.1109/ICCSN.2010.98","url":null,"abstract":"In this paper, a dynamic clustering for saving energy for wireless sensor network suggested. Our goal is to decrease the probability of missing the target and to increase the tracking exactness. First phase is consisting of selecting cluster head and creating clusters. In the next phase, new creating cluster based on moving targets. So that cluster head calculates the current location of target. In other phase, target tracking in environment be done by routing target among nodes. This cases cause saving energy in total network. We implemented our tracking algorithm in ns-2 simulator. Missing rate in our algorithm is 9%","PeriodicalId":255246,"journal":{"name":"2010 Second International Conference on Communication Software and Networks","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-02-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115430666","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}
with emerging of pervasive computing, computers have increasingly become a part of in our life routines. Ubiquitous computing (also known as pervasive computing) is known as the age of calm technology where technology becomes as necessity and tends to be virtually invisible in our daily life without realizing. Privacy is a major problem in an individual’s daily routine and being a treat in a pervasive computing system. The proposed system to solve individual’s privacy problems is called “User-Centered Context-Sensitive Privacy Model in Pervasive Systems”. Implementation of this system wills emphasize on managing user’s context privacy concern.
{"title":"A User-Centered Context-Sensitive Privacy Model in Pervasive Systems","authors":"Camarasen a/l Sagaran, A. Dehghantanha, R. Ramli","doi":"10.1109/ICCSN.2010.43","DOIUrl":"https://doi.org/10.1109/ICCSN.2010.43","url":null,"abstract":"with emerging of pervasive computing, computers have increasingly become a part of in our life routines. Ubiquitous computing (also known as pervasive computing) is known as the age of calm technology where technology becomes as necessity and tends to be virtually invisible in our daily life without realizing. Privacy is a major problem in an individual’s daily routine and being a treat in a pervasive computing system. The proposed system to solve individual’s privacy problems is called “User-Centered Context-Sensitive Privacy Model in Pervasive Systems”. Implementation of this system wills emphasize on managing user’s context privacy concern.","PeriodicalId":255246,"journal":{"name":"2010 Second International Conference on Communication Software and Networks","volume":"123 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-02-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120891891","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}
an Important Problem in Data Mining in Various Fields like Medicine, Telecommunications and World Wide Web is Discovering Patterns. Frequent patterns mining is the focused research topic in association rule analysis. Apriori algorithm is a classical algorithm of association rule mining. Lots of algorithms for mining association rules and their mutations are proposed on basis of Apriori Algorithm. Most of the previous studies adopt Apriori-like algorithms which generate-and-test candidates and improving algorithm strategy and structure but no one concentrate on the structure of database. A simple approach is if we implement in Transposed database then result is very fast. Recently, different works proposed a new way to mine patterns in transposed databases where a database with thousands of attributes but only tens of objects. In this case, mining the transposed database runs through a smaller search space. In this paper, we systematically explore the search space of frequent patterns mining and represent database in transposed form. We develop an algorithm (termed DFPMT—A Dynamic Approach for Frequent Patterns Mining Using Transposition of Database) for mining frequent patterns which are based on Apriori algorithm and used Dynamic Approach like Longest Common Subsequence. The main distinguishing factors among the proposed schemes is the database stores in transposed form and in each iteration database is filter /reduce by generating LCS of transaction id for each pattern. Our solutions provide faster result. A quantitative exploration of these tradeoffs is conducted through an extensive experimental study on synthetic and real-life data sets.
{"title":"A Dynamic Approach for Frequent Pattern Mining Using Transposition of Database","authors":"Sunil Joshi, R. Jain","doi":"10.1109/ICCSN.2010.15","DOIUrl":"https://doi.org/10.1109/ICCSN.2010.15","url":null,"abstract":"an Important Problem in Data Mining in Various Fields like Medicine, Telecommunications and World Wide Web is Discovering Patterns. Frequent patterns mining is the focused research topic in association rule analysis. Apriori algorithm is a classical algorithm of association rule mining. Lots of algorithms for mining association rules and their mutations are proposed on basis of Apriori Algorithm. Most of the previous studies adopt Apriori-like algorithms which generate-and-test candidates and improving algorithm strategy and structure but no one concentrate on the structure of database. A simple approach is if we implement in Transposed database then result is very fast. Recently, different works proposed a new way to mine patterns in transposed databases where a database with thousands of attributes but only tens of objects. In this case, mining the transposed database runs through a smaller search space. In this paper, we systematically explore the search space of frequent patterns mining and represent database in transposed form. We develop an algorithm (termed DFPMT—A Dynamic Approach for Frequent Patterns Mining Using Transposition of Database) for mining frequent patterns which are based on Apriori algorithm and used Dynamic Approach like Longest Common Subsequence. The main distinguishing factors among the proposed schemes is the database stores in transposed form and in each iteration database is filter /reduce by generating LCS of transaction id for each pattern. Our solutions provide faster result. A quantitative exploration of these tradeoffs is conducted through an extensive experimental study on synthetic and real-life data sets.","PeriodicalId":255246,"journal":{"name":"2010 Second International Conference on Communication Software and Networks","volume":"10 4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-02-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120989990","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}
During the last decade, the use of parallel and distributed systems has become more common. In these systems, a huge chunk of data or computation is distributed among many systems in order to obtain better performance. Dividing data is one of the challenges in this type of systems. Divisible Load Theory (DLT) is proposed method for scheduling data distribution in parallel or distributed systems. In many researches carried out in this field, it was assumed that all processors are reliable for grid system but that is not always true in real systems. Although unreliable processors were investigated in some studies, unreliable or unreliable link connections have not been addressed before this research. Disconnection in network links is a common happening in all network topologies specially in wireless connections. In this investigation, we assume that we have two static parameters for processors in a unreliable system, probability of disconnection in network links and required time for repairing disconnection. Then, we present a closed-form formula for scheduling tasks in this type of systems. Experiments show this scheduling method has better performance than applying the proposed methods for reliable systems on an unreliable system.
{"title":"Scheduling Jobs in a Heterogeneous System with Unreliable Network Links by DLT","authors":"Amin Shokripour, M. Othman","doi":"10.1109/ICCSN.2010.114","DOIUrl":"https://doi.org/10.1109/ICCSN.2010.114","url":null,"abstract":"During the last decade, the use of parallel and distributed systems has become more common. In these systems, a huge chunk of data or computation is distributed among many systems in order to obtain better performance. Dividing data is one of the challenges in this type of systems. Divisible Load Theory (DLT) is proposed method for scheduling data distribution in parallel or distributed systems. In many researches carried out in this field, it was assumed that all processors are reliable for grid system but that is not always true in real systems. Although unreliable processors were investigated in some studies, unreliable or unreliable link connections have not been addressed before this research. Disconnection in network links is a common happening in all network topologies specially in wireless connections. In this investigation, we assume that we have two static parameters for processors in a unreliable system, probability of disconnection in network links and required time for repairing disconnection. Then, we present a closed-form formula for scheduling tasks in this type of systems. Experiments show this scheduling method has better performance than applying the proposed methods for reliable systems on an unreliable system.","PeriodicalId":255246,"journal":{"name":"2010 Second International Conference on Communication Software and Networks","volume":"236 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-02-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121275083","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
扫码关注我们
求助内容：
应助结果提醒方式：