Recently the classifying uncertain data in spatial database used in data mining attract a main attention by researchers. The main task is to handle the uncertainty of the data in order to classify or cluster it. In order to classify or cluster the valid or certain data, there are various techniques like DTL, Rule based Classification, Naive Bayes Classification and many more techniques. It's easy to classify the certain data but classification of the uncertain data is bit difficult. Generally K-means algorithm is used to make clusters of uncertain of uncertain data but it increases overhead and computation time. Hence to improve the performance of K-means algorithm we are proposing a technique in which K-means is combined with Voronoi clustering but this will increase the prune overhead so to reduce this prune overhead we will add Hash indexing on th uncertain data object. Our technique of combining K-means with hash indexing and Vornoi diagram results better than older technique used for clustering based on K-Means algorithm.
{"title":"An Efficient Approach for Clustering Uncertain Data Mining Based on Hash Indexing and Voronoi Clustering","authors":"Samir N. Ajani, M. Wanjari","doi":"10.1109/CICN.2013.106","DOIUrl":"https://doi.org/10.1109/CICN.2013.106","url":null,"abstract":"Recently the classifying uncertain data in spatial database used in data mining attract a main attention by researchers. The main task is to handle the uncertainty of the data in order to classify or cluster it. In order to classify or cluster the valid or certain data, there are various techniques like DTL, Rule based Classification, Naive Bayes Classification and many more techniques. It's easy to classify the certain data but classification of the uncertain data is bit difficult. Generally K-means algorithm is used to make clusters of uncertain of uncertain data but it increases overhead and computation time. Hence to improve the performance of K-means algorithm we are proposing a technique in which K-means is combined with Voronoi clustering but this will increase the prune overhead so to reduce this prune overhead we will add Hash indexing on th uncertain data object. Our technique of combining K-means with hash indexing and Vornoi diagram results better than older technique used for clustering based on K-Means algorithm.","PeriodicalId":415274,"journal":{"name":"2013 5th International Conference on Computational Intelligence and Communication Networks","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131705100","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 difficulty of the environmental management system is that the monitoring and supervision of the environmental violations, the paper constructs a model of Prisoner's Dilemma Game between regulators and sewage companies. Studies have shown that the regulatory frequency with the increase of penalties can effectively reduce illegal polluting behavior, thus helping to improve the level of government environmental governance.
{"title":"Environmental Violations Monitoring and Analysis Based on Game Theory","authors":"Yong Zhu, Zheng Li","doi":"10.1109/CICN.2013.129","DOIUrl":"https://doi.org/10.1109/CICN.2013.129","url":null,"abstract":"The difficulty of the environmental management system is that the monitoring and supervision of the environmental violations, the paper constructs a model of Prisoner's Dilemma Game between regulators and sewage companies. Studies have shown that the regulatory frequency with the increase of penalties can effectively reduce illegal polluting behavior, thus helping to improve the level of government environmental governance.","PeriodicalId":415274,"journal":{"name":"2013 5th International Conference on Computational Intelligence and Communication Networks","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123038277","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}
At the present time, an alternative multiple access scheme baptized interleave-division multiple access (IDMA) has enticed greatly devotion, in which interleavers are recycled as the only means for user parting. It has been displayed that the IDMA can accomplish near single user presentation in multiuse surroundings with very truncated receiver complexity. In this broadsheet We equate the presentation of interleave division multiple-access (IDMA) technique which deeds the interleaving as resources of user parting instead of by different marks as in a conventional code-division multiple-access (CDMA) pattern and coded IDMA arrangement where we use dissimilar codes to diminish bit error rate(BER). This technique take over many compensations from CDMA, such as diversity against fading and mitigation of the wickedest-case user interference problem. This paper offeringsangeneral idea of IDMA and deliberates the main features and regions of application.
{"title":"Performance Analysis of IDMA and CODED IDMA System","authors":"Anurag Yadav, A. Shukla","doi":"10.1109/CICN.2013.60","DOIUrl":"https://doi.org/10.1109/CICN.2013.60","url":null,"abstract":"At the present time, an alternative multiple access scheme baptized interleave-division multiple access (IDMA) has enticed greatly devotion, in which interleavers are recycled as the only means for user parting. It has been displayed that the IDMA can accomplish near single user presentation in multiuse surroundings with very truncated receiver complexity. In this broadsheet We equate the presentation of interleave division multiple-access (IDMA) technique which deeds the interleaving as resources of user parting instead of by different marks as in a conventional code-division multiple-access (CDMA) pattern and coded IDMA arrangement where we use dissimilar codes to diminish bit error rate(BER). This technique take over many compensations from CDMA, such as diversity against fading and mitigation of the wickedest-case user interference problem. This paper offeringsangeneral idea of IDMA and deliberates the main features and regions of application.","PeriodicalId":415274,"journal":{"name":"2013 5th International Conference on Computational Intelligence and Communication Networks","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116624408","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 the implausible rise in microprocessor technology having high speed processors and enhanced the processor-memory speed gap, the design of on chip memory hierarchy is a momentous concern in embedded systems. This paper describes a simulation based performance evaluation of typical cache vs. scratch-pad memory (SPM) design issues in embedded systems such as associativity and replacement policies. The evaluation in paper is done using Simple Scalar simulation tools. in addition, we propose the use of new cache replacement policy, called tag based dual cache replacement policy in SPM and access the best approach for replacement in SPM for embedded systems. According to our simulation results, proposed replacement approach in SPM effectively decreases the data miss ratio of the cache. Comparisons against a SPM solution using dual replacement policy show remarkable advantage of up to 20% in cache miss rate for designs of the same memory size.
{"title":"A New Efficient Replacement Policy for Scratch Pad Memory","authors":"Shaily Mittal, Nitin","doi":"10.1109/CICN.2013.95","DOIUrl":"https://doi.org/10.1109/CICN.2013.95","url":null,"abstract":"With the implausible rise in microprocessor technology having high speed processors and enhanced the processor-memory speed gap, the design of on chip memory hierarchy is a momentous concern in embedded systems. This paper describes a simulation based performance evaluation of typical cache vs. scratch-pad memory (SPM) design issues in embedded systems such as associativity and replacement policies. The evaluation in paper is done using Simple Scalar simulation tools. in addition, we propose the use of new cache replacement policy, called tag based dual cache replacement policy in SPM and access the best approach for replacement in SPM for embedded systems. According to our simulation results, proposed replacement approach in SPM effectively decreases the data miss ratio of the cache. Comparisons against a SPM solution using dual replacement policy show remarkable advantage of up to 20% in cache miss rate for designs of the same memory size.","PeriodicalId":415274,"journal":{"name":"2013 5th International Conference on Computational Intelligence and Communication Networks","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121438460","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 the rapid development of new economy, China lubricant enterprises urgently need to implement effective Customer Relationship Management (CRM) to win the market. By constructing and applying CRM, lubricant enterprises can keep their old customers and find potential customers, so the profit and core competitive power of lubricant enterprises can all be increased. In this paper we optimized the traditional sales process of China lubricant enterprises, designed a new business process reengineering (BPR) and built a pyramid model of CRM application tactics. The new BPR can be helpful for effectively CRM implementation of China lubricant enterprises.
{"title":"Business Process Reengineering for Better Sale of China Lubricant Enterprises","authors":"Cong Li, Lin Feng, Li Ma","doi":"10.1109/CICN.2013.139","DOIUrl":"https://doi.org/10.1109/CICN.2013.139","url":null,"abstract":"With the rapid development of new economy, China lubricant enterprises urgently need to implement effective Customer Relationship Management (CRM) to win the market. By constructing and applying CRM, lubricant enterprises can keep their old customers and find potential customers, so the profit and core competitive power of lubricant enterprises can all be increased. In this paper we optimized the traditional sales process of China lubricant enterprises, designed a new business process reengineering (BPR) and built a pyramid model of CRM application tactics. The new BPR can be helpful for effectively CRM implementation of China lubricant enterprises.","PeriodicalId":415274,"journal":{"name":"2013 5th International Conference on Computational Intelligence and Communication Networks","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132793597","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}
Mobile Ad-hoc Network (MANET) shows promising applications have now gained significant importance in research as well as in practice, due to their autonomous and self-maintaining nature. From a security design perspective, MANETs have no clear line of defense, i.e. no built-in security. Thus, the wireless channel is accessible to both legitimate network users and malicious attackers. Security is one of the most important issues in current networks. The most common cases of attacks in mobile Ad hoc networks can be drop of routing packages and changes in the incoming packet which aims at disrupting the network routing and overall network reduce performance. We present a AOMDV-IDS protocol for detecting a avoiding the malicious node in MANET.
{"title":"Detecting the DOS Attacks in AOMDV Using AOMDV-IDS Routing","authors":"H. Gupta, Shivshakti Shrivastav, Sanjana Sharma","doi":"10.1109/CICN.2013.84","DOIUrl":"https://doi.org/10.1109/CICN.2013.84","url":null,"abstract":"Mobile Ad-hoc Network (MANET) shows promising applications have now gained significant importance in research as well as in practice, due to their autonomous and self-maintaining nature. From a security design perspective, MANETs have no clear line of defense, i.e. no built-in security. Thus, the wireless channel is accessible to both legitimate network users and malicious attackers. Security is one of the most important issues in current networks. The most common cases of attacks in mobile Ad hoc networks can be drop of routing packages and changes in the incoming packet which aims at disrupting the network routing and overall network reduce performance. We present a AOMDV-IDS protocol for detecting a avoiding the malicious node in MANET.","PeriodicalId":415274,"journal":{"name":"2013 5th International Conference on Computational Intelligence and Communication Networks","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134269569","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}
K. E. Roopak, K. S. S. Rao, S. Ritesh, Satyadhyan Chickerur
In the present day scenario of mobility and objects, the field of object oriented programming is gaining momentum not only in field of gaming, programming but also in area of DBMS. The paper discusses object oriented approach for solving queries. The queries are executed and analyzed specifically on an object oriented database DB4o. The industry is moving with time from basic models of DBMS to one such DBMS discussed in this paper. Experiments have been carried out using both DB4o and MySQL for a huge airport data base. The paper also discusses two factors namely Querying methodology and Performance analysis in comparison with traditional DBMS like MySQL. The proposed approach proves that ODBMS is more efficient compared to RDBMS.
{"title":"Performance Comparison of Relational Database with Object Database (DB4o)","authors":"K. E. Roopak, K. S. S. Rao, S. Ritesh, Satyadhyan Chickerur","doi":"10.1109/CICN.2013.112","DOIUrl":"https://doi.org/10.1109/CICN.2013.112","url":null,"abstract":"In the present day scenario of mobility and objects, the field of object oriented programming is gaining momentum not only in field of gaming, programming but also in area of DBMS. The paper discusses object oriented approach for solving queries. The queries are executed and analyzed specifically on an object oriented database DB4o. The industry is moving with time from basic models of DBMS to one such DBMS discussed in this paper. Experiments have been carried out using both DB4o and MySQL for a huge airport data base. The paper also discusses two factors namely Querying methodology and Performance analysis in comparison with traditional DBMS like MySQL. The proposed approach proves that ODBMS is more efficient compared to RDBMS.","PeriodicalId":415274,"journal":{"name":"2013 5th International Conference on Computational Intelligence and Communication Networks","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133089287","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}
Cloud computing is a business oriented concept to provide online IT resources and IT services on demand using pay per use model where main goal of cloud service provider is to use cloud computing resources efficiently and gain profits marginally. One of the challenging areas in cloud computing is frequent optimization of cloud server. It mainly concerns with the load balancing of cloud data centers to improve efficiency of the host machine and minimize number of active host machine to support green computing concept. To balance the load of entire data center, we need to transfer the virtual machines of the overloaded host to the light weighted host using migration techniques. In this paper, we introduce a threshold based Dynamic compare and balance algorithm (DCABA) for cloud server optimization. Unlike the traditional server optimization strategies which consider only load balancing and scheduling of resources based on the usage of CPU, RAM and BW in physical servers, DCABA also minimizes the number of host machines to be powered on, for reducing the cost of cloud services. Our approach can serve the purpose of service cost reduction in cloud industry with effective utilization of available resources.
{"title":"Cloud Server Optimization with Load Balancing and Green Computing Techniques Using Dynamic Compare and Balance Algorithm","authors":"Yatendra Sahu, R. K. Pateriya, R. Gupta","doi":"10.1109/CICN.2013.114","DOIUrl":"https://doi.org/10.1109/CICN.2013.114","url":null,"abstract":"Cloud computing is a business oriented concept to provide online IT resources and IT services on demand using pay per use model where main goal of cloud service provider is to use cloud computing resources efficiently and gain profits marginally. One of the challenging areas in cloud computing is frequent optimization of cloud server. It mainly concerns with the load balancing of cloud data centers to improve efficiency of the host machine and minimize number of active host machine to support green computing concept. To balance the load of entire data center, we need to transfer the virtual machines of the overloaded host to the light weighted host using migration techniques. In this paper, we introduce a threshold based Dynamic compare and balance algorithm (DCABA) for cloud server optimization. Unlike the traditional server optimization strategies which consider only load balancing and scheduling of resources based on the usage of CPU, RAM and BW in physical servers, DCABA also minimizes the number of host machines to be powered on, for reducing the cost of cloud services. Our approach can serve the purpose of service cost reduction in cloud industry with effective utilization of available resources.","PeriodicalId":415274,"journal":{"name":"2013 5th International Conference on Computational Intelligence and Communication Networks","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114584351","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}
Whole sale price index is a reflection of the government policy, it accounts for all trends in demand and supply and it's truly right when we say it is the index of all the goods which is necessity of life. Research paper mainly concentrates on the secondary data and looking to find out relation between the analyse Wholesale Price Index (Average of Weeks) - Annual Variation and its affect on different sector, overview new model of wpi launch by government of India, analyse role of reserve bank of India and Indian government, to look after the aspects and derive outcome of market and financial indicator and to have special look on the developing economy scenario in terms of the GDP, interest rate and inflation. Beside this objective some derived interpretation has been done based on the resultant. Bar graph and pie chart has been included in order to have quick look on the facts. Certain websites like trading economics can be check for authenticity but in general reserve bank of India can be check out for complete set of data and its relevance. Whole sale price index. It provides wide scope of opportunity to analyse and review whole sale price index and its impact on different sector. I wish to propose special thought on the inflation and to check the impact of the external factor on the different sector. I decide to take all current data and to analyse the factor yearly, monthly and weekly basis.
{"title":"Whole Sale Price Index, Financial Indicators and Its Effect on Market and Different Sectors","authors":"Nandita Mishra, J. Patel, S. S. Sarangdevot","doi":"10.1109/CICN.2013.127","DOIUrl":"https://doi.org/10.1109/CICN.2013.127","url":null,"abstract":"Whole sale price index is a reflection of the government policy, it accounts for all trends in demand and supply and it's truly right when we say it is the index of all the goods which is necessity of life. Research paper mainly concentrates on the secondary data and looking to find out relation between the analyse Wholesale Price Index (Average of Weeks) - Annual Variation and its affect on different sector, overview new model of wpi launch by government of India, analyse role of reserve bank of India and Indian government, to look after the aspects and derive outcome of market and financial indicator and to have special look on the developing economy scenario in terms of the GDP, interest rate and inflation. Beside this objective some derived interpretation has been done based on the resultant. Bar graph and pie chart has been included in order to have quick look on the facts. Certain websites like trading economics can be check for authenticity but in general reserve bank of India can be check out for complete set of data and its relevance. Whole sale price index. It provides wide scope of opportunity to analyse and review whole sale price index and its impact on different sector. I wish to propose special thought on the inflation and to check the impact of the external factor on the different sector. I decide to take all current data and to analyse the factor yearly, monthly and weekly basis.","PeriodicalId":415274,"journal":{"name":"2013 5th International Conference on Computational Intelligence and Communication Networks","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115867226","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
One of the most important problems in controlling robot locomotion, is how to generate an online trajectory for robots with a large number of degrees of freedom. In this paper, we present a biomimetic approach which is based on Central Pattern Generator (CPG) inspired from the lamprey to solve this problem. CPG is a neural network found in animal and has the ability of producing rhythmic pattern without receiving rhythmic input. We used a recurrent neural network(RNN) to model the CPG and proposed the genetic algorithm to train the RNN to follow a predefined oscillatory pattern. It is furthermore demonstrated that recurrent neural networks do indeed exhibit oscillatory behavior and may in this way be used to imitate the function of the CPG responsible for locomotion in animate creatures.
{"title":"A Recurrent Neural Network Model for Lamprey-Like Robot Movement","authors":"Bassam Daya, M. Chahine, R. Awad","doi":"10.1109/CICN.2013.72","DOIUrl":"https://doi.org/10.1109/CICN.2013.72","url":null,"abstract":"One of the most important problems in controlling robot locomotion, is how to generate an online trajectory for robots with a large number of degrees of freedom. In this paper, we present a biomimetic approach which is based on Central Pattern Generator (CPG) inspired from the lamprey to solve this problem. CPG is a neural network found in animal and has the ability of producing rhythmic pattern without receiving rhythmic input. We used a recurrent neural network(RNN) to model the CPG and proposed the genetic algorithm to train the RNN to follow a predefined oscillatory pattern. It is furthermore demonstrated that recurrent neural networks do indeed exhibit oscillatory behavior and may in this way be used to imitate the function of the CPG responsible for locomotion in animate creatures.","PeriodicalId":415274,"journal":{"name":"2013 5th International Conference on Computational Intelligence and Communication Networks","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115882667","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
扫码关注我们
求助内容：
应助结果提醒方式：