This paper presents an algorithm to generate a long pseudorandom binary key using a binary file downloaded from the Internet as seed or input. This file can be of any type i.e. video, audio, text, image etc. The output is a long pseudorandom binary key. The generated key can be used to encrypt any type of data file using a stream cipher encryption algorithm. The key files obtained from the algorithm implementation are successfully tested by the well known NIST and ENT test suites for statistical validation.
{"title":"Pseudorandom Binary Key Generation from Binary Files","authors":"R. Nallanthighal, V. Rani","doi":"10.1109/CICN.2011.137","DOIUrl":"https://doi.org/10.1109/CICN.2011.137","url":null,"abstract":"This paper presents an algorithm to generate a long pseudorandom binary key using a binary file downloaded from the Internet as seed or input. This file can be of any type i.e. video, audio, text, image etc. The output is a long pseudorandom binary key. The generated key can be used to encrypt any type of data file using a stream cipher encryption algorithm. The key files obtained from the algorithm implementation are successfully tested by the well known NIST and ENT test suites for statistical validation.","PeriodicalId":292190,"journal":{"name":"2011 International Conference on Computational Intelligence and Communication Networks","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127312565","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}
Document clustering refers to unsupervised classification (categorization) of documents into groups (clusters) in such a way that the documents in a cluster are similar, whereas documents in different clusters are dissimilar. The documents may be web pages, blog posts, news articles, or other text files. This paper presents our experimental work on applying K-means, heuristic K-means and fuzzy C-means algorithms for clustering text documents. We have experimented with different representations (tf, tf.idf & Boolean) and different feature selection schemes (with or without stop word removal & with or without stemming). We ran our implementations on some standard datasets and computed various performance measures for these algorithms. The results indicate that tf.idf representation, and use of stemming obtains better clustering. Moreover, fuzzy clustering produces better results than both K-means and heuristic K-means on almost all datasets, and is a more stable method.
{"title":"Document Clustering Using K-Means, Heuristic K-Means and Fuzzy C-Means","authors":"V. Singh, Nisha Tiwari, Shekhar Garg","doi":"10.1109/CICN.2011.62","DOIUrl":"https://doi.org/10.1109/CICN.2011.62","url":null,"abstract":"Document clustering refers to unsupervised classification (categorization) of documents into groups (clusters) in such a way that the documents in a cluster are similar, whereas documents in different clusters are dissimilar. The documents may be web pages, blog posts, news articles, or other text files. This paper presents our experimental work on applying K-means, heuristic K-means and fuzzy C-means algorithms for clustering text documents. We have experimented with different representations (tf, tf.idf & Boolean) and different feature selection schemes (with or without stop word removal & with or without stemming). We ran our implementations on some standard datasets and computed various performance measures for these algorithms. The results indicate that tf.idf representation, and use of stemming obtains better clustering. Moreover, fuzzy clustering produces better results than both K-means and heuristic K-means on almost all datasets, and is a more stable method.","PeriodicalId":292190,"journal":{"name":"2011 International Conference on Computational Intelligence and Communication Networks","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133636957","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}
On-line condition monitoring and diagnostic system for power transformers, an important component of electric utility, is valuable for preventing damages. The paper focuses on the area of monitoring using wireless condition monitoring systems can be cost effectively implemented in extensive applications that were historically handled by running routes with data collectors. The result would be a lower cost program with more frequent data collection, increased safety, and lower spare parts inventories. Facilities would be able to run leaner because they will have more confidence in their ability to avoid downtime. If we consider the communication range(middle range of 100m or less), data rate (about 100kbps) and power consumption(tens of mA), candidates of wireless communication technologies adequate for power monitoring system narrow down to Bluetooth and Zigbee.
{"title":"Condition Monitoring and Diagnostics of Power Transformers Using WSNs","authors":"Nagpal Tapsi, Singh Yaduvir","doi":"10.1109/CICN.2011.56","DOIUrl":"https://doi.org/10.1109/CICN.2011.56","url":null,"abstract":"On-line condition monitoring and diagnostic system for power transformers, an important component of electric utility, is valuable for preventing damages. The paper focuses on the area of monitoring using wireless condition monitoring systems can be cost effectively implemented in extensive applications that were historically handled by running routes with data collectors. The result would be a lower cost program with more frequent data collection, increased safety, and lower spare parts inventories. Facilities would be able to run leaner because they will have more confidence in their ability to avoid downtime. If we consider the communication range(middle range of 100m or less), data rate (about 100kbps) and power consumption(tens of mA), candidates of wireless communication technologies adequate for power monitoring system narrow down to Bluetooth and Zigbee.","PeriodicalId":292190,"journal":{"name":"2011 International Conference on Computational Intelligence and Communication Networks","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133681975","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In the financial markets, there are different assets, such as stocks, bonds, foreign exchanges, options, commodities, real estates and future contracts, available for trading. The qualities of these assets vary from very good to extremely poor. Usually, it is difficult for investors to find out those good quality assets because of information asymmetry and asset price fluctuations. Therefore, it is not wise to use portfolio theory blindly for optimizing asset allocation among some low quality assets. The suitable way of constructing a portfolio is to select some good quality assets. Markowitz's portfolio theory only provides a solution to asset selection among the pre-determined assets.
{"title":"Design of Genetic Algorithm for Knapsack Problem to Perform Stock Portfolio Selection Using Financial Indicators","authors":"T. Patalia, Dr. G. R. Kulkarni","doi":"10.1109/CICN.2011.60","DOIUrl":"https://doi.org/10.1109/CICN.2011.60","url":null,"abstract":"In the financial markets, there are different assets, such as stocks, bonds, foreign exchanges, options, commodities, real estates and future contracts, available for trading. The qualities of these assets vary from very good to extremely poor. Usually, it is difficult for investors to find out those good quality assets because of information asymmetry and asset price fluctuations. Therefore, it is not wise to use portfolio theory blindly for optimizing asset allocation among some low quality assets. The suitable way of constructing a portfolio is to select some good quality assets. Markowitz's portfolio theory only provides a solution to asset selection among the pre-determined assets.","PeriodicalId":292190,"journal":{"name":"2011 International Conference on Computational Intelligence and Communication Networks","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128128165","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 problem of image restoration in presence of blur and noise has been a very important problem in the domain of digital image processing and computer vision. A quantum inspired back propagation neural network (QBPNN) architecture based on quantum gates (single qubit rotation gates and two qubit controlled-not gates) has been used and its back propagation learning formulae have been proposed in this article for the task of restoration of images from noisy and blurred perspectives. The superiority of the QBPNN architecture is clearly demonstrated in terms of convergence rate and speed as compared to the classical multilayer perceptron (MLP).
{"title":"Image Restoration Using a Multilayered Quantum Backpropagation Neural Network","authors":"S. Mukherjee, Raka Chowdhury, S. Bhattacharyya","doi":"10.1109/CICN.2011.89","DOIUrl":"https://doi.org/10.1109/CICN.2011.89","url":null,"abstract":"The problem of image restoration in presence of blur and noise has been a very important problem in the domain of digital image processing and computer vision. A quantum inspired back propagation neural network (QBPNN) architecture based on quantum gates (single qubit rotation gates and two qubit controlled-not gates) has been used and its back propagation learning formulae have been proposed in this article for the task of restoration of images from noisy and blurred perspectives. The superiority of the QBPNN architecture is clearly demonstrated in terms of convergence rate and speed as compared to the classical multilayer perceptron (MLP).","PeriodicalId":292190,"journal":{"name":"2011 International Conference on Computational Intelligence and Communication Networks","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128188710","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}
Nowadays, health care is one of the most important subjects in our life. Increasing level of patients demand across the world obliges health care services in a more flexible and uniform manner. So that patients can get useful health services in the home environment without going to the health center personally. The e-healthcare is new kinds of health care system and it is very popular at this time. Where patients can exchange their confidential information via internet to the organization and from the organization get the services via internet also. So lots of time will be saved and patient can get services efficiently without unnecessary harassments of travel to the organization. In this system all the transaction of data are processed by Patient Agents (PA), Doctor Agents (DA) and Controller Agent (CA). The user uses the Patient Agent (PA) to connect with the controlling server of the e-health care system. The Controller Agent (CA) is control the demand of the patients as well as activity of the doctors. When the doctor wants to check-up the patient then he/she connects with the Doctor Agent (DA). Using the Doctor Agent (DA), every doctor prescribed some medicine to the patient about the query and if required then refer the patient to another doctor. The Agent computing in a network of workstations is powerful paradigm for building distributed applications. The agent technology is used to enhance the patient's needs which include availability, speedy response time, and efficiency. Agent for e-Health care creates connectivity on an anytime-anywhere-any-device-basis to provide the specific service from the doctor required by the patients.
{"title":"A Small e-Health Care Information System with Agent Technology","authors":"R. Subalakshmi, Arijit Das, N. Iyengar","doi":"10.1109/CICN.2011.14","DOIUrl":"https://doi.org/10.1109/CICN.2011.14","url":null,"abstract":"Nowadays, health care is one of the most important subjects in our life. Increasing level of patients demand across the world obliges health care services in a more flexible and uniform manner. So that patients can get useful health services in the home environment without going to the health center personally. The e-healthcare is new kinds of health care system and it is very popular at this time. Where patients can exchange their confidential information via internet to the organization and from the organization get the services via internet also. So lots of time will be saved and patient can get services efficiently without unnecessary harassments of travel to the organization. In this system all the transaction of data are processed by Patient Agents (PA), Doctor Agents (DA) and Controller Agent (CA). The user uses the Patient Agent (PA) to connect with the controlling server of the e-health care system. The Controller Agent (CA) is control the demand of the patients as well as activity of the doctors. When the doctor wants to check-up the patient then he/she connects with the Doctor Agent (DA). Using the Doctor Agent (DA), every doctor prescribed some medicine to the patient about the query and if required then refer the patient to another doctor. The Agent computing in a network of workstations is powerful paradigm for building distributed applications. The agent technology is used to enhance the patient's needs which include availability, speedy response time, and efficiency. Agent for e-Health care creates connectivity on an anytime-anywhere-any-device-basis to provide the specific service from the doctor required by the patients.","PeriodicalId":292190,"journal":{"name":"2011 International Conference on Computational Intelligence and Communication Networks","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133389037","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In the image retrieval technology, the aim is to retrieve an image based on DCT color coefficients. There were many algorithms based on single feature, presented in past. Those algorithms have lack of speed and require more computational capability. In this algorithm by using DCT, most similar images are retrieved. The idea of DCT was to decouples the color component of image using YCbCr color model and transform these color components into DCT coefficients moreover reduce the number of bits simply dividing of each DCT coefficients with constant quantization matrix and round them into nearest number to calculate features of that image for performing similarity measure.
{"title":"Image Retrieval Algorithm Based on Quantized DCT Coefficients","authors":"Arvind Sharma, Nishchol Mishra, P. Sharma","doi":"10.1109/CICN.2011.90","DOIUrl":"https://doi.org/10.1109/CICN.2011.90","url":null,"abstract":"In the image retrieval technology, the aim is to retrieve an image based on DCT color coefficients. There were many algorithms based on single feature, presented in past. Those algorithms have lack of speed and require more computational capability. In this algorithm by using DCT, most similar images are retrieved. The idea of DCT was to decouples the color component of image using YCbCr color model and transform these color components into DCT coefficients moreover reduce the number of bits simply dividing of each DCT coefficients with constant quantization matrix and round them into nearest number to calculate features of that image for performing similarity measure.","PeriodicalId":292190,"journal":{"name":"2011 International Conference on Computational Intelligence and Communication Networks","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131780406","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}
Wireless medium is more prone to security breaches than wired medium. The issue of security becomes critical in Mobile ad-hoc networks (MANets), due to the mobility of nodes. Node mobility causes frequent change in the radio transmission range thus changing the group membership. Members in a group communicate using the group key. Each time the group change, a new group key is to be computed in a secured manner providing backward and forward secrecy. This paper presents a secured and trusted routing algorithm MPG-STAR. The new group key is computed securely for trustworthy nodes of MPG routing protocol based on the ring based co-operation in Group Diffie-Hellman key exchange to avoid malicious or selfish nodes.
{"title":"MPG-STAR: Mobile Process Groups Based Secured and Trusted Routing for MANets","authors":"A. Aakanksha, Punam Bedi","doi":"10.1109/CICN.2011.118","DOIUrl":"https://doi.org/10.1109/CICN.2011.118","url":null,"abstract":"Wireless medium is more prone to security breaches than wired medium. The issue of security becomes critical in Mobile ad-hoc networks (MANets), due to the mobility of nodes. Node mobility causes frequent change in the radio transmission range thus changing the group membership. Members in a group communicate using the group key. Each time the group change, a new group key is to be computed in a secured manner providing backward and forward secrecy. This paper presents a secured and trusted routing algorithm MPG-STAR. The new group key is computed securely for trustworthy nodes of MPG routing protocol based on the ring based co-operation in Group Diffie-Hellman key exchange to avoid malicious or selfish nodes.","PeriodicalId":292190,"journal":{"name":"2011 International Conference on Computational Intelligence and Communication Networks","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123943068","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}
S. Binzaid, I. Chowdhury, Md. Shoaibur Rahman, S. M. S. Islam
Semiconductor integration has improved over the years by increasing device switching speed and device density, causing increased power consumption and dissipation, therefore, the issues has been considered and improved here. Previously designed VLSI mirror-amplifier had power dissipation of 8.41 mill watts in CMOS 0.5µm process. Latter the technique was re-applied in this work to completed characterization of each pin signal functions with biasing steps to determine accuracy at the low power response of the IC in order to improve the total power consumption. Signal pin orientation in the simulation and choosing the correct biasing point in two steps proved to be correct procedure to improve. Supply voltage was considered as 3V for the MOSIS process technology. Latest MAGIC layout CAD tools were used for design, and PSPICE was used for simulation and electrical characterization with the help of MAGIC layout extraction tool. Keeping the process and scaling unchanged at 0.5µm as the previous design, the new VLSI design yielded the power dissipation of 4.39 nanowatts in 2nd step by reducing the dynamic loss. The electrical characterizations also confirmed that the chip precisely senses ultra-high-Z signals at inputs for this application. Multi-die chip placement is done for fabrication and also made the final product less expensive by the in-house custom designed pad-frame. This paper presents details of the key research works, results, completed chip layout and applications of the chip.
{"title":"Nano-Power Sensor Applications in VLSI Multi-die Tiny Chip","authors":"S. Binzaid, I. Chowdhury, Md. Shoaibur Rahman, S. M. S. Islam","doi":"10.1109/CICN.2011.119","DOIUrl":"https://doi.org/10.1109/CICN.2011.119","url":null,"abstract":"Semiconductor integration has improved over the years by increasing device switching speed and device density, causing increased power consumption and dissipation, therefore, the issues has been considered and improved here. Previously designed VLSI mirror-amplifier had power dissipation of 8.41 mill watts in CMOS 0.5µm process. Latter the technique was re-applied in this work to completed characterization of each pin signal functions with biasing steps to determine accuracy at the low power response of the IC in order to improve the total power consumption. Signal pin orientation in the simulation and choosing the correct biasing point in two steps proved to be correct procedure to improve. Supply voltage was considered as 3V for the MOSIS process technology. Latest MAGIC layout CAD tools were used for design, and PSPICE was used for simulation and electrical characterization with the help of MAGIC layout extraction tool. Keeping the process and scaling unchanged at 0.5µm as the previous design, the new VLSI design yielded the power dissipation of 4.39 nanowatts in 2nd step by reducing the dynamic loss. The electrical characterizations also confirmed that the chip precisely senses ultra-high-Z signals at inputs for this application. Multi-die chip placement is done for fabrication and also made the final product less expensive by the in-house custom designed pad-frame. This paper presents details of the key research works, results, completed chip layout and applications of the chip.","PeriodicalId":292190,"journal":{"name":"2011 International Conference on Computational Intelligence and Communication Networks","volume":"199 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124470526","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}
A mobile ad-hoc network (MANET) can be described as a mobile wireless network, consisting of a collection of communication nodes, which have to interact among themselves without the use of any centralized authority or fixed infrastructure. There are several technical challenges regarding deployment of a MANET, such as network scalability, communication stability, energy consumption, security and quality of services (QoS). Due to vulnerability of wireless links, nodes unstable infrastructure support and highly dynamic network states, MANET security becomes an essential design dimension. initially while designing MANET routing protocols security aspects were not considered, so routing protocols are vulnerable to various types of security attacks such as rushing attack, black hole attack, replay attack, jellyfish attack, wormhole attack, spoofing attack etc. In this paper we have discussed wormhole attack. In this paper, through simulation the effects of wormhole attack on Ad-hoc On Demand Distance Vector Routing (AODV) and Dynamic Source Routing (DSR) protocols have been analyzed and compared.
{"title":"Performance Evaluation and Comparison of AODV and DSR Under Adversarial Environment","authors":"Richa Agrawal, R. Tripathi, S. Tiwari","doi":"10.1109/CICN.2011.129","DOIUrl":"https://doi.org/10.1109/CICN.2011.129","url":null,"abstract":"A mobile ad-hoc network (MANET) can be described as a mobile wireless network, consisting of a collection of communication nodes, which have to interact among themselves without the use of any centralized authority or fixed infrastructure. There are several technical challenges regarding deployment of a MANET, such as network scalability, communication stability, energy consumption, security and quality of services (QoS). Due to vulnerability of wireless links, nodes unstable infrastructure support and highly dynamic network states, MANET security becomes an essential design dimension. initially while designing MANET routing protocols security aspects were not considered, so routing protocols are vulnerable to various types of security attacks such as rushing attack, black hole attack, replay attack, jellyfish attack, wormhole attack, spoofing attack etc. In this paper we have discussed wormhole attack. In this paper, through simulation the effects of wormhole attack on Ad-hoc On Demand Distance Vector Routing (AODV) and Dynamic Source Routing (DSR) protocols have been analyzed and compared.","PeriodicalId":292190,"journal":{"name":"2011 International Conference on Computational Intelligence and Communication Networks","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116885790","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
扫码关注我们
求助内容：
应助结果提醒方式：