2011 First International Conference on Informatics and Computational Intelligence最新文献_第2页

Living Internet - Social Objects Powering New Age Cybernetic Networks 生活互联网-社会对象推动新时代的控制论网络

2011 First International Conference on Informatics and Computational Intelligence Pub Date : 2011-12-12 DOI: 10.1109/ICI.2011.61

Dinesh Pothineni, Pratik Mishra

引用次数: 2

A Novel Palmprint Segmentation Technique 一种新的掌纹分割技术

2011 First International Conference on Informatics and Computational Intelligence Pub Date : 2011-12-12 DOI: 10.1109/ICI.2011.45

M. O. Rotinwa-Akinbile, A. Aibinu, M. Salami

引用次数: 4

A Probabilistic Branch-and-Bound Approach for Reconstructing of Haplotype Using SNP-Fragments and Related Genotype 利用snp片段和相关基因型重建单倍型的概率分支结合方法

2011 First International Conference on Informatics and Computational Intelligence Pub Date : 2011-12-12 DOI: 10.1109/ICI.2011.17

Rasoul Taghipour, Naemeh Ganoodi, E. Asgarian

{"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}

引用次数: 0

Pixel Area Based Target Distance Estimating and Corresponding Target Hitting Force Calculating Autonomous Robot Using Single Video Device 基于像素面积的单视频机器人目标距离估计及目标命中力计算

2011 First International Conference on Informatics and Computational Intelligence Pub Date : 2011-12-12 DOI: 10.1109/ICI.2011.34

Astha Jain, Harshul Gandhi, Vikalp Paharia

引用次数: 3

Network Emulation and Simultaneous Monitoring of Web Based Applications Performance Using ScrutiNem 基于Web的应用程序性能的网络仿真和同时监控

2011 First International Conference on Informatics and Computational Intelligence Pub Date : 2011-12-12 DOI: 10.1109/ICI.2011.43

H. Kalita, M. Nambiar, Benny Mathew

引用次数: 3

E-Clean: A Data Cleaning Framework for Patient Data E-Clean:患者数据的数据清理框架

2011 First International Conference on Informatics and Computational Intelligence Pub Date : 2011-12-12 DOI: 10.1109/ICI.2011.21

H. Mohamed, Tee Leong Kheng, C. Collin, Ong Siong Lee

引用次数: 25

Guiding Genetic Algorithm via Viral Trait Spreading for Solving Sudoku Puzzle 基于病毒特征传播的引导遗传算法解数独

2011 First International Conference on Informatics and Computational Intelligence Pub Date : 2011-12-12 DOI: 10.1109/ICI.2011.33

Nico Saputro, V. Moertini

{"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}

引用次数: 0

Action Recognition by Local Space-Time Features and Least Square Twin SVM (LS-TSVM) 局部时空特征与最小二乘双支持向量机(LS-TSVM)动作识别

2011 First International Conference on Informatics and Computational Intelligence Pub Date : 2011-12-12 DOI: 10.1109/ICI.2011.55

K. Mozafari, J. Nasiri, Nasrollah Moghadam Charkari, S. Jalili

引用次数: 7

Economic Sizing of Solar Array for a Photovoltaic Building in Malaysia with Matlab 用Matlab计算马来西亚某光伏建筑太阳能阵列的经济规模

2011 First International Conference on Informatics and Computational Intelligence Pub Date : 2011-12-12 DOI: 10.1109/ICI.2011.57

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}

引用次数: 11

Constructing Continuous-Time Chaos-Generating Templates with Desirably Configured Periodic Orbits 构造具有理想配置周期轨道的连续时间混沌生成模板

2011 First International Conference on Informatics and Computational Intelligence Pub Date : 2011-12-12 DOI: 10.1109/ICI.2011.39

Hidetaka Ito, Tatsuya Furuoka, A. Kumamoto

引用次数: 0