{"title":"A bio inspired algorithm for solving optimization problems","authors":"K. K. Mishra, S. Tiwari, A. Misra","doi":"10.1109/ICCCT.2011.6075211","DOIUrl":"https://doi.org/10.1109/ICCCT.2011.6075211","url":null,"abstract":"Although a number of nature inspired algorithms exist in literature to solve optimization problems, yet there is always a need of new algorithm which can search for optimum solution in minimum time. This paper proposes a new optimization algorithm for solving optimization problems. Proposed algorithm has been compared with existing algorithm like Genetic Algorithm, Particle swarm Optimization on benchmark functions and experiments prove that proposed algorithm is better in many cases.","PeriodicalId":285986,"journal":{"name":"2011 2nd International Conference on Computer and Communication Technology (ICCCT-2011)","volume":"75 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115401505","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":"Leakage power and delay analysis of LECTOR based CMOS circuits","authors":"Preeti Verma, R. Mishra","doi":"10.1109/ICCCT.2011.6075117","DOIUrl":"https://doi.org/10.1109/ICCCT.2011.6075117","url":null,"abstract":"In CMOS circuits, scaling of threshold voltage results in increase of sub-threshold leakage current. According to the International Roadmap of Semiconductor (ITRS), leakage is projected to grow exponentially during the next decade. LECTOR is a technique for designing CMOS gates in order to reduce the leakage current without affecting the dynamic power dissipation. This paper presents the analysis for leakage current and propagation delay of the basic CMOS gates viz. NOT, NAND and NOR gates implementing LECTOR technique.","PeriodicalId":285986,"journal":{"name":"2011 2nd International Conference on Computer and Communication Technology (ICCCT-2011)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127349569","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":"From Internet of Things towards cloud of things","authors":"P. Parwekar","doi":"10.1109/ICCCT.2011.6075156","DOIUrl":"https://doi.org/10.1109/ICCCT.2011.6075156","url":null,"abstract":"Since the late 1980s the world is working towards connectivity and convergence. In the last three decades, the convergence of information resources has happened. However to achieve a true convergence the information assets have to be shared, used and executed fruitfully by the various gadgets which we use in our daily lives. Internet of Things is a concept which leverages on the power of networks to create ubiquitous sensor-actuator networks. With the advent of the cloud technologies, the concept of IOTs can be integrated with even the basic elements having limited computing power. This paper aims to evaluate the possibilities offered by integrating the two concepts of IOTs and Cloud Computing.","PeriodicalId":285986,"journal":{"name":"2011 2nd International Conference on Computer and Communication Technology (ICCCT-2011)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125855929","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":"Particle swarm optimization based fuzzy frequent pattern mining from gene expression data","authors":"Shruti Mishra, Debahuti Mishra, S. Satapathy","doi":"10.1109/ICCCT.2011.6075204","DOIUrl":"https://doi.org/10.1109/ICCCT.2011.6075204","url":null,"abstract":"The FP-growth algorithm is currently one of the fastest approaches to frequent item set mining. Fuzzy logic provides a mathematical framework where the entire range of the data lies in between 0 and 1. The PSO algorithm was developed from observations of the social behavior of animals, including bird flocking and fish schooling. It is easier to implement than evolutionary algorithms because it only involves a single operator for updating solutions. In contrast, evolutionary algorithms require a particular representation and specific methods for cross-over, mutation, and selection. Furthermore, PSO has been found to be very effective in a wide variety of applications, being able to produce good solutions at a very low computational cost. In this paper, we have considered the fuzzified dataset and have implemented various frequent pattern mining techniques. Out of the various frequent pattern mining techniques it was found that Frequent Pattern (FP) growth method yields us better results on a fuzzy dataset. Here, the frequent patterns obtained are considered as the set of initial population. For the selection criteria, we had considered the mean squared residue score rather using the threshold value. It was observed that out of the four fuzzy based frequent mining techniques, the PSO based fuzzy FP growth technique finds the best individual frequent patterns. Also, the run time of the algorithm and the number of frequent patterns generated is far better than the rest of the techniques used.","PeriodicalId":285986,"journal":{"name":"2011 2nd International Conference on Computer and Communication Technology (ICCCT-2011)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125879902","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":"An elitist artificial bee colony algorithm for combined economic emission dispatch incorporating wind power","authors":"H. T. Jadhav, J. Patel, U. Sharma, R. Roy","doi":"10.1109/ICCCT.2011.6075213","DOIUrl":"https://doi.org/10.1109/ICCCT.2011.6075213","url":null,"abstract":"Due to increasing concern over global climate change, renewable energy sources, particularly wind turbine based generation systems are gaining more attention to meet the targets of emissions reduction. Combined economic load dispatch (ELD) and economic emission dispatch (EED) involves the simultaneous optimization of fuel cost and emission (CEED). This bi-objective CEED problem is converted into a single objective function by introducing a price penalty factor (PPF) approach. In this paper, Swarm Intelligence (SI) methods such as particle swarm optimization (PSO), artificial bee colony (ABC) and an elitist's artificial bee colony (EABC) are applied to solve CEED problem. The results are compared by considering ten and forty unit systems having non-linear cost function and valve-point effects. In addition suitable amount of wind power penetration is considered in both cases. It is demonstrated that the results obtained by applying elitist's artificial bee colony (EABC) algorithm are better than other two methods.","PeriodicalId":285986,"journal":{"name":"2011 2nd International Conference on Computer and Communication Technology (ICCCT-2011)","volume":"94 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124172610","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":"An accelerated clustering algorithm for segmentation of grayscale images","authors":"Sitanshu Gupta, V. Srivatava","doi":"10.1109/ICCCT.2011.6075210","DOIUrl":"https://doi.org/10.1109/ICCCT.2011.6075210","url":null,"abstract":"Conventional clustering techniques like FCM, K-Means, Mountain clustering etc. face the main problem of excessive data while dealing with the very big size images. Due to higher order dependency of clustering techniques on the number of data points, time complexity increases excessively while dealing with very large size images. This paper proposes an advanced version of mountain clustering technique, Fast Mountain clustering (FMC), for segmentation of grayscale images whose run time is almost independent of size of image. The proposed approach consists of defining the dataset in another domain which makes the clustering almost independent of size of the data. The obtained results are compared with the widely used techniques like FCM, K-Means, IMC and found out to be better on the basis of cluster validity measures Global silhouette index (GS) and Partition Index (SC).","PeriodicalId":285986,"journal":{"name":"2011 2nd International Conference on Computer and Communication Technology (ICCCT-2011)","volume":"111 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130082222","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":"Simulation and optimization of lightly-doped ultra-thin Triple Metal Double Gate (TM-DG) MOSFET with high-K dielectric for diminished short channel effects","authors":"S. Gupta, A. Baidya, S. Baishya","doi":"10.1109/ICCCT.2011.6075167","DOIUrl":"https://doi.org/10.1109/ICCCT.2011.6075167","url":null,"abstract":"In this paper, we have proposed Lightly-Doped Ultra-Thin Triple Metal Double Gate (TM-DG) MOSFET with High-K Dielectric in the gate oxide to reduce the Short Channel Effects (SCEs). The above device has been optimized with TCAD simulations and it has been found that the TMDG MOSFETs offers better transconductance, subthreshold swing, ON and OFF state currents in nanometer regime than Single Metal DG MOSFETs.","PeriodicalId":285986,"journal":{"name":"2011 2nd International Conference on Computer and Communication Technology (ICCCT-2011)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131594915","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":"High impact event processing using incremetal clustering in unsupervised feature space through genetic algorithm by selective repeat ARQ protocol","authors":"P. Sethi, C. Dash","doi":"10.1109/ICCCT.2011.6075159","DOIUrl":"https://doi.org/10.1109/ICCCT.2011.6075159","url":null,"abstract":"High impact event represents the information which are frequently used. The frequently used information is maintained in different clusters such that it can be accessed quickly without involving much searching time. Clustering methods are one of the key steps that lead to the transformation of data to knowledge. Clustering algorithms aims at partitioning an initial set of objects into disjoint groups (clusters) such that objects in the same subset are more similar to each other than objects in different groups. In this paper we present a generalization of the k-Windows clustering algorithm in metric spaces by following a selective Repeat ARQ protocol having fixed window size for accurate information transmission. The original algorithm was designed to work on data with numerical values. The proposed generalization does not assume anything about the nature of the data, but only considers the distance function over the data set. The efficiency of the proposed approach is demonstrated on msnbc data sets. Genetic algorithm approach is used to detect and predict high-impact events in different areas such as automotive manufacturing, networking for data transmission, etc. While the high-impact events occurs infrequently, they are quite costly, means they have high-impact on the system key performance indicator. This approach is based on mining these types of events and its impact on the total process execution. The classified data are clustered for future implementation which have similar feature. Due to the clustering concept the clustered data can be used for various applications, which makes it robust. The parameters are optimized for best solution. This approach is tested on high impact events that occurs in networking, during transmission and it was found to be robust, highly accurate and with less probability of fault, for prediction of future occurrences of such events.","PeriodicalId":285986,"journal":{"name":"2011 2nd International Conference on Computer and Communication Technology (ICCCT-2011)","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116983483","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":"CTES based secure approach for authentication and authorization of resource and service in clouds","authors":"S. Pippal, Aruna Kumari, D. S. Kushwaha","doi":"10.1109/ICCCT.2011.6075140","DOIUrl":"https://doi.org/10.1109/ICCCT.2011.6075140","url":null,"abstract":"Cloud services are generally deployed in dedicated machines within Data-center. A cloud using distributed services and voluntary resources to build up its data center, where storage and computational resources of participating individual machines are harnessed non-intrusively, providing security to resources, services and users are primary objectives. Authentication and authorization are keys to any security mechanism. In this paper, we have made an attempt to address the associated concerns through an authentication and authorization model for a cloud computing paradigm. The paper also describes an improvement over traditional Kerberos protocol to authenticate the users and to access the services and resources in cloud, such that offsets certain limitations of Kerberos.","PeriodicalId":285986,"journal":{"name":"2011 2nd International Conference on Computer and Communication Technology (ICCCT-2011)","volume":"153 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116393363","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":"Recognition of bangla basic characters using multiple classifiers","authors":"P. Das, Suchandra Paul, R. Ghoshal","doi":"10.1109/ICCCT.2011.6075179","DOIUrl":"https://doi.org/10.1109/ICCCT.2011.6075179","url":null,"abstract":"Character recognition is an important area in image processing and pattern recognition fields. A novel scheme for recognition of offline basic characters of Bangla using multiple classifiers is described here. Compared to English characters, there are different complex shaped characters in Bangla alphabet. Dealing with such a large number of characters with a suitably designed feature set is a challenging problem. Moreover, such a large variety of complex shaped characters, some of which have close resemblance, make the problem more difficult. Considering the complexity of the problem, present approach makes an attempt to identify the basic characters. We have adopted this hybrid approach because it is nearly impossible to find a set of stroke features which are sufficient to classify the characters. A prototype of the system is tested with a data set containing 4423 characters of different font and size. On average, the recognition accuracies for Binary tree based classifier and Multilayer perceptron [with backpropagation for learning] (MLP) are 90% above approximately.","PeriodicalId":285986,"journal":{"name":"2011 2nd International Conference on Computer and Communication Technology (ICCCT-2011)","volume":"368 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120880885","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}