{"title":"Living Internet - Social Objects Powering New Age Cybernetic Networks","authors":"Dinesh Pothineni, Pratik Mishra","doi":"10.1109/ICI.2011.61","DOIUrl":"https://doi.org/10.1109/ICI.2011.61","url":null,"abstract":"Be it a blog post, photo or a You Tube video, social objects are responsible for interactions between people, attributing to notion that 'People don't just speak, rather discuss around these objects'. Such crucial objects are often left out of network analysis, concentrating more on node-node connections. Activities around social objects across the web, reflects synaptic changes of the physical world. When modelled in cybernetics fashion, they can generate actionable feedback for system specific goals, which aids in constructing rich interest graphs, multi-faceted reputation system and better functioning groups. This paper proposes a system to read user interactions in digestible feedback form and presents a solution of similar deployment in a network citing the complexities involved in storing smart data. Modelling feedback networks in reverse fashion will give rise to plug gable smart web, where people can make better sense of their actions by peeking into communication flow on the web.","PeriodicalId":146712,"journal":{"name":"2011 First International Conference on Informatics and Computational Intelligence","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114870856","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":"A Novel Palmprint Segmentation Technique","authors":"M. O. Rotinwa-Akinbile, A. Aibinu, M. Salami","doi":"10.1109/ICI.2011.45","DOIUrl":"https://doi.org/10.1109/ICI.2011.45","url":null,"abstract":"Recent paradigm shift from the conventional contact based palmprint recognition to contactless based systems (CBS) has necessitated the development of a variety of these systems. A major challenge of these systems is it robustness to illumination variation in unconstrained environment, thus making segmentation difficult. In this paper, the acquired image undergoes color space conversion and the output is filtered using coefficients obtained from the training of an artificial neural network (ANN) based model coefficient determination technique. Performance analysis of the proposed technique shows better performance in term of mean square error, true positive rate and accuracy when compared with two other techniques. Furthermore, it has also been observed that the proposed method is illumination invariant hence its suitability for deployment in contactless palmprint recognition systems.","PeriodicalId":146712,"journal":{"name":"2011 First International Conference on Informatics and Computational Intelligence","volume":"99 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115151676","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":"A Probabilistic Branch-and-Bound Approach for Reconstructing of Haplotype Using SNP-Fragments and Related Genotype","authors":"Rasoul Taghipour, Naemeh Ganoodi, E. Asgarian","doi":"10.1109/ICI.2011.17","DOIUrl":"https://doi.org/10.1109/ICI.2011.17","url":null,"abstract":"Most positions of the human genome are typically invariant (99%) and only some positions (1%) are commonly invariant which are associated with complex genetic diseases. Haplotype reconstruction problem divide aligned single nucleotide polymorphism (SNP) fragments into two classes and infer a pair of haplotypes from them. An important computational model of this problem is minimum error correction (MEC) but it is only effective when the error rate of the fragments is low. MEC/GI as an extension to MEC employs the compatible genotype information besides the SNP fragments and so results in a more accurate inference. The haplotyping problems, due to its NP-hardness, several computational and heuristic methods have addressed the problem seeking feasible answers. In this paper, we develop a new branch-and-bound algorithm with running time O([(n-h)/k]2ˆh x nm) in which m is maximum length of SNP fragments where SNP sites are heterozygous, n is the number of fragments and h is depth of our exploration in binary tree. Since h (h?n) is small in real biological applications, our proposed algorithm is practical and efficient.","PeriodicalId":146712,"journal":{"name":"2011 First International Conference on Informatics and Computational Intelligence","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125550148","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":"Pixel Area Based Target Distance Estimating and Corresponding Target Hitting Force Calculating Autonomous Robot Using Single Video Device","authors":"Astha Jain, Harshul Gandhi, Vikalp Paharia","doi":"10.1109/ICI.2011.34","DOIUrl":"https://doi.org/10.1109/ICI.2011.34","url":null,"abstract":"Precision in practical life plays an important role in smooth functioning of all the developed integrated systems. Moving towards the intelligent robotics, accuracy of the results and simplicity of the design proves the efficiency and the applicability of proposed models and algorithms applied. This developed robot works on a much simpler algorithm to estimate the distance of an object by using one camera. This is achieved by calculating the pixel area of the target object (pole in this case) using MATLAB® and hits the target object by Pulse Width Modulation, according to the distance. The precise pulse width is obtained by the graphs plotted on practical data through multiple input/output values.","PeriodicalId":146712,"journal":{"name":"2011 First International Conference on Informatics and Computational Intelligence","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128393388","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":"Network Emulation and Simultaneous Monitoring of Web Based Applications Performance Using ScrutiNem","authors":"H. Kalita, M. Nambiar, Benny Mathew","doi":"10.1109/ICI.2011.43","DOIUrl":"https://doi.org/10.1109/ICI.2011.43","url":null,"abstract":"Performance testing of a multi-tiered Web application in real WAN is not a trivial job. In this circumstance a tool which brings WAN cloud to a local area network makes the life of a developer/tester easier. However, mere emulation of WAN inside a LAN does not help a tester, unless he gets to know the performance of the applications in some numbers. Therefore, he needs to put a monitoring tool in the network too. This means a lot of manual handling of operations such as routing, emulating, port mirroring of switch and measuring the performance of applications simultaneously. We can well understand that this is a huge job for a tester. Can we bring network emulation and application performance monitoring tool together in a single box? This would become a great help for a developer/tester, because in that case he just needs only one machine to configure for the same. This paper investigates this problem and gives a solution thereafter.","PeriodicalId":146712,"journal":{"name":"2011 First International Conference on Informatics and Computational Intelligence","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129931913","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}
H. Mohamed, Tee Leong Kheng, C. Collin, Ong Siong Lee
{"title":"E-Clean: A Data Cleaning Framework for Patient Data","authors":"H. Mohamed, Tee Leong Kheng, C. Collin, Ong Siong Lee","doi":"10.1109/ICI.2011.21","DOIUrl":"https://doi.org/10.1109/ICI.2011.21","url":null,"abstract":"We need to prepare quality data by pre-processing the raw data. Data cleaning, also called data cleansing or scrubbing, deals with detecting and removing errors and inconsistencies from data in order to improve the quality of data. Data cleaning system are needed to support any changes in the structure, representation or content of data. There are three parts in the cleaning process, i.e. extract the invalid value, matching attributes with valid values and data cleaning algorithm. Our system uses the extract, transform and load model as the system main process model to serve as a guideline for the implementation of the system. Besides that, parsing techniques is also use for the identification of dirty data. The method that we choose for matching attributes is regular expression. Among those data cleaning algorithms, k-Nearest Neighbor algorithm is selected for the data cleaning part of this project because it is simple to understand and easy to implement.","PeriodicalId":146712,"journal":{"name":"2011 First International Conference on Informatics and Computational Intelligence","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128607237","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":"Guiding Genetic Algorithm via Viral Trait Spreading for Solving Sudoku Puzzle","authors":"Nico Saputro, V. Moertini","doi":"10.1109/ICI.2011.33","DOIUrl":"https://doi.org/10.1109/ICI.2011.33","url":null,"abstract":"Genetic Algorithms work iteratively from generation to generation to find the optimal solution of optimization problems. However, due to the probabilistic operations of Genetic Algorithms (GAs), the performance of GAs search is unpredictable. Even worst, GAs may not be able to find the optimal solution after very long iteration. We propose a solution that incorporates a human intervention to guide GA achieving a better performance. We adopt the Viral Trait Spreading Framework for human intervention in the GA operations. Firstly, we classify GAs operation and then put each group of operation in the Framework. Most of all genetic algorithm operations fall into the Trait Adoption component. We optimized the design of genetic representation and genetic operators to tackle the fixed element constraint and row permutation constraint of Sudoku puzzle. Then, we implemented our approach in net logo, a multiagent programmable modeling environment. Experiment results showed that GA is capable of finding the optimal solution and the human intervention through Viral Trait Spreading Framework guides the GA in searching processes in the narrower search space.","PeriodicalId":146712,"journal":{"name":"2011 First International Conference on Informatics and Computational Intelligence","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134295638","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. Mozafari, J. Nasiri, Nasrollah Moghadam Charkari, S. Jalili
{"title":"Action Recognition by Local Space-Time Features and Least Square Twin SVM (LS-TSVM)","authors":"K. Mozafari, J. Nasiri, Nasrollah Moghadam Charkari, S. Jalili","doi":"10.1109/ICI.2011.55","DOIUrl":"https://doi.org/10.1109/ICI.2011.55","url":null,"abstract":"In this research a new approach ffor human action recognition is proposed. At first, local spaace-time features extracted which recently becomes a popular video representation. Feature extraction is done wwith use of Harris detector algorithm and Histogram of Optiical Flow (HOF) descriptor. Then we apply a new extendedd SVM classifier called least square Twin SVM (LS-TSVM)). LS-TSVM is a binary classifier that does classification by use of two non¬parallel hyperplanes and it is four times faster than the classical SVM while the precision is better. WWe investigate the performance of LS-TSVM method on a totall of 25 persons on KTH dataset. Our experiments on the standdard KTH action dataset shown that our method improvees state-of-the-art results by achieving 95.8%, 96.3% and 97.2%% accuracy in case of 1-fold , 5-fold and 10-fold cross validation.","PeriodicalId":146712,"journal":{"name":"2011 First International Conference on Informatics and Computational Intelligence","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133374112","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}
H. N. Afrouzi, Saeed Vahabi Mashak, A. Dastgheib, J. Tavalaei
{"title":"Economic Sizing of Solar Array for a Photovoltaic Building in Malaysia with Matlab","authors":"H. N. Afrouzi, Saeed Vahabi Mashak, A. Dastgheib, J. Tavalaei","doi":"10.1109/ICI.2011.57","DOIUrl":"https://doi.org/10.1109/ICI.2011.57","url":null,"abstract":"This article illustrates a simulation method to find a sizing and economic of a required photovoltaic array for a photovoltaic building in Malaysia. This paper represents the result using by Matlab software and also mathematic equation. It is known that the important factor for photovoltaic system is cost of a system, and because of several kinds of the photovoltaic array we have the right to select the best array with the best efficiency and best price. The popular types of materials are crystalline and thin films, which have differences in terms of light absorption efficiency, energy conversion efficiency, manufacturing technology and cost of production. Different kinds of crystalline materials like a mono-crystalline, polycrystalline are available. In this paper, the generated current and generated power by the photovoltaic array is calculated according to daily solar irradiation when the case study is Malaysia. Think over generated power of each array's and also according to required energy for a typically building, the number of photovoltaic array is estimated then the cost of the solar array is calculated. System is simulated by Matlab software, and the results are discussed. The simulation is about sizing and economic in order to select the best array for photovoltaic system to have a optimize system according to size and price of the system.","PeriodicalId":146712,"journal":{"name":"2011 First International Conference on Informatics and Computational Intelligence","volume":"99 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131814520","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":"Constructing Continuous-Time Chaos-Generating Templates with Desirably Configured Periodic Orbits","authors":"Hidetaka Ito, Tatsuya Furuoka, A. Kumamoto","doi":"10.1109/ICI.2011.39","DOIUrl":"https://doi.org/10.1109/ICI.2011.39","url":null,"abstract":"Towards extending the methodology for developing flexible pattern generators and controllers that can exploit various nonlinear phenomena, this paper proposes a framework for constructing continuous-time dynamical systems that bind desired unstable periodic orbits into a chaotic attractor. Our strategy is comprised of the following three stages: constructing an interim \"chaos-generating template\", deforming the template according to the desired configuration of periodic orbits, and performing appropriate function approximation to obtain the dynamical system.","PeriodicalId":146712,"journal":{"name":"2011 First International Conference on Informatics and Computational Intelligence","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130304396","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}