检索结果-内蒙古大学图书馆

作者： Mohamad, M.S. Omatu, S. Deris, S. Misman, M.F. Department of Computer Science and Intelligent Systems Graduate School of Engineering Osaka Prefecture University Sakai Osaka 599-8531 Japan Department of Software Engineering Faculty of Computer Science and Information Systems Universiti Teknologi Malaysia 81310 Skudai Johore Malaysia

ISBN: (纸本)9784990288020

The development of microarray-based high-throughput gene expression has led to the hope that this technology could provide an efficient cancer diagnosis and classification platform. A major problem in these gene expression data is that the number of genes greatly exceeds the number of tissue samples. Moreover, these data have a noisy nature. It has been shown that selecting a small subset of informative genes can lead to improved classification accuracy. Thus, this paper aims to select a small subset of informative genes that are most relevant for the classification task. To achieve this aim, a hybrid algorithm that combines two hybrid methods has been developed. This algorithm is assessed on two well-known microarray data sets, showing competitive results. ©ISAROB 2008.

关键词： Gene expression

来源：评论

学校读者我要写书评

暂无评论

A model for gene selection and classification of gene expression data

A model for gene selection and classification of gene expres...

引用

作者： Mohamad, M.S. Omatu, S. Deris, S. Hashim, S.Z.M. Department of Computer Science and Intelligent Systems Graduate School of Engineering Osaka Prefecture University Sakai Osaka 599-8531 Japan Department of Software Engineering Faculty of Computer Science and Information Systems Universiti Teknologi Malaysia 81310 Skudai Johore Malaysia

ISBN: (纸本)9784990288020

Gene expression data are expected to be of significant help in the development of efficient cancer diagnosis and classification platforms. One problem arising from these data is how to select a small subset of genes from thousands of genes and a few samples that are inherently noisy. This research aims to select a small subset of informative genes from the gene expression data that will maximise the classification accuracy. A model for gene selection and classification has been developed by using a filter approach together with an improved hybrid of the genetic algorithm and a support vector machine classifier. It is shown that the classification accuracy of the proposed model is useful for the cancer classification of one that widely used gene expression benchmark data set. ©ISAROB 2008.

关键词： Gene expression

来源：评论

学校读者我要写书评

暂无评论

Data mining-driven analysis and decomposition In agent supply chain management networks

Data mining-driven analysis and decomposition In agent suppl...

引用

2008 IEEE/WIC/ACM International Conference on Web Intelligence and intelligent Agent Technology - Workshops, WI-IAT Workshops 2008

作者： Chatzidimitriou, Kyriakos C. Symeonidis, Andreas L. Mitkas, Pericles A. Department of Electrical and Computer Engineering Aristotle University of Thessaloniki GR541 24 Thessaloniki Greece Intelligent Systems and Software Engineering Laboratory Informatics and Telematics Institute CERTH 57001 Thessaloniki Greece

ISBN: (纸本)9780769534961

In complex and dynamic environments where interdependencies cannot monotonously determine causality, data mining techniques may be employed in order to analyze the problem, extract key features and identify pivotal factors. Typical cases of such complexity and dynamicity are supply chain networks, where a number of involved stakeholders struggle towards their own benefit. These stakeholders may be agents with varying degrees of autonomy and intelligence, in a constant effort to establish beneficiary contracts and maximize own revenue. In this paper, we illustrate the benefits of data mining analysis on a well-established agent supply chain management network. We apply data mining techniques, both at a macro and micro level, analyze the results and discuss them in the context of agent performance improvement. © 2008 IEEE.

关键词： Supply chain management

来源：评论

学校读者我要写书评

暂无评论

Network-centric localization in MANETs based on particle swarm optimization

Network-centric localization in MANETs based on particle swa...

引用

2008 IEEE Swarm Intelligence Symposium, SIS 2008

作者： Kulkarni, Raghavendra V. Venayagamoorthy, Ganesh K. Miller, Ann Dagli, Cihan H. Real-Time Power and Intelligent Systems Laboratory Department of Electrical and Computer Engineering Missouri University of Science and Technology Rolla MO United States Department of Electrical and Computer Engineering Missouri University of Science and Technology Rolla MO United States Department of Systems Engineering and Engineering Management Missouri University of Science and Technology Rolla MO United States

ISBN: (纸本)9781424427055

There exist several application scenarios of mobile ad hoc networks (MANET) in which the nodes need to locate a target or surround it. Severe resource constraints in MANETs call for energy efficient target localization and collaborative navigation. Centralized control of MANET nodes is not an attractive solution due to its high network utilization that can result in congestions and delays. In nature, many colonies of biological species (such as a flock of birds) can achieve effective collaborative navigation without any centralized control. Particle swarm optimization (PSO), a popular swarm intelligence approach that models social dynamics of a biological swarm is proposed in this paper for network-centric target localization in MANETs that are enhanced by mobile robots. Simulation study of two application scenarios is conducted. While one scenario focuses on quick target localization, the other alms at convergence of MANET nodes around the target. Reduction of swarm size during PSO search is proposed for accelerated convergence. The results of the study show that the proposed algorithm is effective in network-centric collaborative navigation. Emergence of converging behavior of MANET nodes is observed. ©2008 IEEE.

关键词： Multipurpose robots

来源：评论

学校读者我要写书评

暂无评论

Building classification rules for case-based classifier using fuzzy sets and formal concept analysis 08

Building classification rules for case-based classifier usin...

引用

5th International Conference on Soft Computing As Transdisciplinary science and Technology, CSTST '08

作者： Tadrat, Jirapond Boonjing, Veera Pattaraintakorn, Puntip Software Systems Engineering Laboratory Department of Mathematics and Computer Science King Mongkut's Institute of Technology Ladkrabang Bangkok 10520 Thailand Department of Mathematics and Computer Science Faculty of Science King Mongkut's Institute of Technology Ladkrabang Bangkok 10520 Thailand

ISBN: (纸本)9781605580463

The focus of this paper is a construction of better knowledge base in case-based classifier system. Our knowledge base structure is based on concept lattice where rules are built from its subconcept-superconcept relation. Since the lattice can only be constructed from inputs with binary attributes, descriptive and numeric attributes must be transformed to binary attributes. In this paper, we propose the transformation of numeric attributes to descriptive attributes using fuzzy set theory. We experiment on benchmark data sets, Car and Iris, to determine the performance in term of number of rules used and classification precision. The results show that trend of accuracy is proportional to the size of learning inputs. The number of rules used is relatively small compared with size of training data. Our case-based classifier produces very promising results in practice and can classify the new problem more accurate than traditional classifiers. Copyright 2008 ACM.

关键词： Formal concept analysis

来源：评论

学校读者我要写书评

暂无评论

Solving Sum and Product Riddle via BDD-based model checking

Solving Sum and Product Riddle via BDD-based model checking

引用

2008 IEEE/WIC/ACM International Conference on Web Intelligence and intelligent Agent Technology - Workshops, WI-IAT Workshops 2008

作者： Luo, Xiangyu Su, Kaile Sattar, Abdul Chen, Yan Tsinghua National Laboratory for Information Science and Technology School of Software Tsinghua University Beijing 100084 China Department of Computer Science Guilin University of Electronic Technology Guilin 541004 China School of Electronics Engineering and Computer Science Peking University Beijing 100871 China Institute for Integrated and Intelligent Systems Griffith University Brisbane QLD 4111 Australia

ISBN: (纸本)9780769534961

We model the Sum and Product Riddle inpublic announcement logic, which is interpreted on an epistemic Kripke model. The model is symbolically represented as a finite state program with n agents. A model checking method to the riddle is developed by using the BDD-based symbolic model checking algorithm for logic of knowledge we developed in [7]. The method is implemented by extending the model checker MCTK [7] and then the solution of the riddle is verified successfully. © 2008 IEEE.

关键词： Model checking

来源：评论

学校读者我要写书评

暂无评论

Camera handoff with adaptive resource management for multi-camera multi-target surveillance

Camera handoff with adaptive resource management for multi-c...

引用

IEEE 5th International Conference on Advanced Video and Signal Based Surveillance, AVSS 2008

作者： Chen, Chung-Hao Yi, Yao Page, David Abidi, Besma Koschan, Andreas Abidi, Mongi Imaging Robotics and Intelligent Systems Laboratory Department of Electrical Engineering and Computer Science University of Tennessee Knoxville TN 37996 United States GE Global Research Center Niskayuna NY 12309 United States

ISBN: (纸本)9780769533414

Camera handoff is a crucial step to generate a continuously tracked and consistently labeled trajectory of the object of interest in multi-camera surveillance systems. Most existing camera handoff algorithms concentrate on data association, namely consistent labeling, where images of the same object are matched across different cameras. However, most real-time object tracking systems see a decrease in the system's frame rate as the number of tracked objects increases. To address this issue, we propose to incorporate an adaptive resource management mechanism into camera handoff. In so doing, cameras' resources can be dynamically allocated to multiple objects according to their priorities and hence the required minimum frame rate can be maintained. Experimental results illustrate that the proposed camera handoff algorithm is capable of maintaining a constant frame rate and of achieving a substantially improved handoff success rate by approximately 20% in comparison with the algorithm presented by Khan and Shah. © 2008 IEEE.

关键词： Cameras

来源：评论

学校读者我要写书评

暂无评论

A method for detecting windows rootkits

A method for detecting windows rootkits

引用

23rd International Conference on computers and Their Applications, CATA 2008

作者： Wampler, Douglas R. Graham, James H. Indiana Department of Correction Technical Services Division 302 W. Washington Room E327 Indianapolis IN 46204 United States Computer Engineering and Computer Science Department Intelligent Systems Laboratory University of Louisville Louisville KY 40292 United States

ISBN: (纸本)9781604232356

Rootkits are stealthy, malicious software that allow an attacker to gain and maintain control of a computing system through an attack the operating system core or kernel, attack other computer systems, and destroy evidence of tampering to decrease the chance of detection. Rootkit attacks have expanded greatly since they were initially detected in the early 1990s. Existing detection methods typically rely upon substantial background knowledge about the structure and organization of the operating system prior to any attacks. This paper presents a new approach to rootkit detection using greatly reduced a priori knowledge in the form of statistical knowledge of the operating system and statistical tests for outliers. This new detection approach is discussed in detail, along with experimental results from rootkit detection in Windows operating systems.

关键词： computer control systems

来源：评论

学校读者我要写书评

暂无评论

A distributed routing algorithm for data aggregationin wireless sensor networks

引用

Frontiers of Electrical and Electronic engineering 2008年第1期3卷 34-39页

作者： LUO Hong YANG Fangchun LIU Yonghe Beijing Key Laboratory of Intelligent Telecommunication Software and Multimedia Beijing University of Posts and Telecommunications Department of Computer Science and Engineering University of Texas at Arlington

Considering the impact of aggregation cost on the performance of aggregation routes in wireless sensor networks, an aggregation-decision-based distributed routing algorithm for data aggregation is proposed. When source nodes arrive or leave, the algorithm can calculate the aggregation benefit according to data correlation, aggregation cost and transmission cost. Then the algorithm will adaptively make aggregation and routing decisions based on aggregation benefit. Therefore, it can jointly optimize the aggregation and transmission costs and reduce the energy consumption for data gathering. This distributed algorithm makes all the decisions only relying on the local information. Hence, the routing maintenance cost is limited. Simulation results show that the energy consumption difference between this distributed online algorithm and the previous offline one is within 17% under any network conditions.

关键词： wireless sensor networks data gathering data aggregation routing

来源：评论

学校读者我要写书评

暂无评论

Localization-oriented coverage based on Bayesian estimation in camera sensor networks

Localization-oriented coverage based on Bayesian estimation ...

引用

9th IEEE International Symposium on Wireless, Mobile and Multimedia Networks, WoWMoM 2008

作者： Liu, Liang Zhang, Xi Huadong, Ma. Networking and Information Systems Laboratory Department of Electrical and Computer Engineering Texas A and M University College Station TX 77843 United States Beijing Key Lab. of Intelligent Telecomm Software and Multimedia Beijing University of Posts and Telecommunications Beijing 100876 China

ISBN: (纸本)9781424421008

Target tracking and localization are important applications in camera sensor networks. Although coverage is a very important research topic in wireless sensor networks, and the coverage problem for target detection has been intensively studied, few considers the coverage problem from the perspective of target localization. In this paper, we investigate the coverage problem from the perspective of target localization for camera sensor networks. We first propose a novel localization-oriented sensing model based on the perspective projection of camera. Then, we propose a new notion of Localization-oriented coverage (L-coverage for short). We assume that all camera sensors make the measurements independent of other in the field, and these camera sensors can cooperate to make an accurate estimation for the location of the target. In addition, the relationships among L-coverage, 2-coverage, and the density of camera sensors are also discussed in this paper. The obtained results show that our model can be effectively deployed in many practical scenarios. © 2008 IEEE.

关键词： Target tracking

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：