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

An Ant Colony Optimization Based Dimension Reduction Method for High-Dimensional datasets

Journal of Bionic engineering 2013年第2期10卷 231-241页

作者： Ying Li Gang Wang Huiling Chen Lian Shi Lei Qin College of Computer Science and Technology Jilin University Changchun 130012 P. R. China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun 130012 P. R. China College of Geo Exploration Science and Technology Jilin University Changchun 130026 P. R. China College of physics and electronic information Wenzhou University Wenzhou 325035 P. R. China

In this paper, a bionic optimization algorithm based dimension reduction method named Ant Colony Optimization -Selection （ACO-S） is proposed for high-dimensional datasets. Because microarray datasets comprise tens of thousands of features （genes）, they are usually used to test the dimension reduction techniques. ACO-S consists of two stages in which two well-known ACO algorithms, namely ant system and ant colony system, are utilized to seek for genes, respectively. In the first stage, a modified ant system is used to filter the nonsignificant genes from high-dimensional space, and a number of promising genes are reserved in the next step. In the second stage, an improved ant colony system is applied to gene selection. In order to enhance the search ability of ACOs, we propose a method for calculating priori available heuristic information and design a fuzzy logic controller to dynamically adjust the number of ants in ant colony system. Furthermore, we devise another fuzzy logic controller to tune the parameter （q0） in ant colony system. We evaluate the performance of ACO-S on five microarray datasets, which have dimensions varying from 7129 to 12000. We also compare the performance of ACO-S with the results obtained from four existing well-known bionic optimization algorithms. The comparison results show that ACO-S has a notable ability to＂ generate a gene subset with the smallest size and salient features while yielding high classification accuracy. The comparative results generated by ACO-S adopting different classifiers are also given. The proposed method is shown to be a promising and effective tool for mining high-dimension data and mobile robot navigation.

关键词： gene selection feature selection ant colony optimization high-dimensional data

来源：评论

学校读者我要写书评

暂无评论

A broadcasting multiple blind signature scheme based on quantum GHZ entanglement

引用

International Journal of Modern Physics: Conference Series 2014年第33期ijmpcs卷

作者： Yuan Tian Hong Chen Yan Gao Honglin Zhuang Haigang Lian Zhengping Han Peng Yu Xiangze Kong Xiaojun Wen Key Laboratory of Data Engineering and Knowledge Engineering China (Remin University of China) of Ministry of Education Beijing 100872 China School of Information Renmin University of China Beijing 100872 China China Computer User Association Information Protection Branch Beijing 100089 China School of Computer Science and Engineering Beihang University Beijing 100083 China School of Electronics & Information Engineering Shenzhen Polytechnic Shenzhen 518055 China

Using the correlation of the GHZ triplet states, a broadcasting multiple blind signature scheme is proposed. Different from classical multiple signature and current quantum signature schemes, which could only deliver either multiple signature or unconditional security, our scheme guarantees both by adopting quantum key preparation, quantum encryption algorithm and quantum entanglement. Our proposed scheme has the properties of multiple signature, blindness, non-disavowal, non-forgery and traceability. To the best of our knowledge, we are the first to propose the broadcasting multiple blind signature of quantum cryptography.

关键词： Broadcasting multiple blind signature quantum encryption algorithm quantum entanglement quantum cryptography

来源：评论

学校读者我要写书评

暂无评论

Improving helpful actions for contingent planning with enforced observations

引用

Journal of Computational Information Systems 2013年第7期9卷 2691-2698页

作者： Wei, Wei Ouyang, Dantong Zhao, Xiangfu Zhang, Liming College of Computer Science and Technology Jilin University Changchun 130012 China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Changchun 130012 China College of Mathematics Physics and Information Engineering Zhejiang Normal University Jinhua 321004 China

We tackle the problem of improving the helpful actions technique for contingent planning. A revision of the heuristic computation that rearranges the relaxed planning graph is proposed, where the unreasonable conformant actions can be excluded from the resulting helpful actions collection and replaced with enforced observation to the belief state. Pruning with the improved helpful actions, we consequently cut all the non-branching plans out of the solution space. Experimental results show that our method brings considerable improvements in both of plan quality and runtime efficiency. Copyright © 2013 Binary Information Press.

关键词： Information systems

来源：评论

学校读者我要写书评

暂无评论

Community mining from complex networks based on loop tightness

引用

Jilin Daxue Xuebao (Gongxueban)/Journal of Jilin University (engineering and Technology Edition) 2013年第1期43卷 98-105页

作者： Liu, Da-You Yang, Jian-Ning Yang, Bo Zhao, Xue-Hua Jin, Di College of Computer Science and Technology Jilin University Changchun 130012 China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun 130012 China School of Computer Science and Engineering Tianjin University Tianjin 300072 China

In this paper, a Loop Tightness Algorithm (LTA) is proposed. First, it finds the network loops and calculates it tightness value quickly. Then, it obtains the communities of the networks based on the tightness values. Finally, it reveals the relationship between the network loops and the community structure. The LTA is tested and validated by means of synthetic networks and real networks.

关键词： data mining

来源：评论

学校读者我要写书评

暂无评论

A Sarsa() algorithm based on double-layer fuzzy reasoning

引用

Mathematical Problems in engineering 2013年 2013卷

作者： Liu, Quan Mu, Xiang Huang, Wei Fu, Qiming Zhang, Yonggang School of Computer Science and Technology Soochow University Suzhou Jiangsu 215006 China Key Laboratory of Symbol Computation and Knowledge Engineering Jilin University Ministry of Education Changchun 130012 China

Solving reinforcement learning problems in continuous space with function approximation is currently a research hotspot of machine learning. When dealing with the continuous space problems, the classic Q-iteration algorithms based on lookup table or function approximation converge slowly and are difficult to derive a continuous policy. To overcome the above weaknesses, we propose an algorithm named DFR-Sarsa() based on double-layer fuzzy reasoning and prove its convergence. In this algorithm, the first reasoning layer uses fuzzy sets of state to compute continuous actions;the second reasoning layer uses fuzzy sets of action to compute the components of Q-value. Then, these two fuzzy layers are combined to compute the Q-value function of continuous action space. Besides, this algorithm utilizes the membership degrees of activation rules in the two fuzzy reasoning layers to update the eligibility traces. Applying DFR-Sarsa() to the Mountain Car and Cart-pole Balancing problems, experimental results show that the algorithm not only can be used to get a continuous action policy, but also has a better convergence performance. © 2013 Quan Liu et al.

关键词： Fuzzy sets

来源：评论

学校读者我要写书评

暂无评论

Multiple vehicle-like target tracking based on the velodyne lidar?

Multiple vehicle-like target tracking based on the velodyne ...

引用

8th IFAC Symposium on Intelligent Autonomous Vehicles, IAV 2013

作者： Zhang, Liang Li, Qingquan Li, Ming Mao, Qingzhou Nüchter, Andreas State Key Laboratory of Information Engineering in Surveying Mapping and Remote Sensing Wuhan University Wuhan Hubei 430079 China Shenzhen Key Laboratory of Spatial-temporal Smart Sensing and Services Shenzhen University Shenzhen Guangdong 518052 China Engineering Research Center for Spatio-Temporal Data Smart Acquisition and Application Ministry of Education of China Wuhan University Wuhan Hubei 430079 China Automation and Machine Vision Group Jacobs University Bremen 28759 Germany

ISBN: (纸本)9783902823366

This paper proposes a novel multiple vehicle-like target tracking method based on a Velodyne HDL64E light detection and ranging (LiDAR) system. The proposed method combines multiple hypothesis tracking (MHT) algorithm with dynamic point cloud registration (DPCR), which is able to solve the multiple vehicle-like target tracking in highly dynamic urban environments without any auxiliary information from GPS or IMU. Specifically, to track targets consistently, the DPCR is developed to calculate accurately the pose of the ego-vehicle for the transformation of raw measurements taken in the moving coordinate systems into a static absolute coordinate system;while in turn, MHT helps to improve the performance of DPCR by discriminating and removing the dynamic points from the scene. Furthermore, the proposed MHT method is also able to solve the occlusion problem existing in the point cloud. Experiments on sets of urban environments prove that the presented method is effective and robust, even in highly dynamic environments. © 2013 IFAC.

关键词： Target tracking

来源：评论

学校读者我要写书评

暂无评论

A framework for personalized management of domain ontologies

A framework for personalized management of domain ontologies

引用

2012 IEEE/ACIS 11th International Conference on Computer and Information Science, ICIS 2012

作者： Liu, Runnan Wang, Puwei Zheng, Shixian Key Laboratory of Data Engineering and Knowledge Engineering Renmin University of China Ministry of Education Beijing 100872 China

ISBN: (纸本)9780769546940

As the sharable and reusable domain knowledge, domain ontology increasingly serves as a foundation for semantic Web. Personalized management of domain ontologies is to provide personalized views of domain ontologies to users during run time according to user preferences. It helps that users can focus on their interested parts, instead of the whole. It increases the efficiency of ontology-based application. This paper proposes a framework for personalized management of domain ontologies. In this framework, a user model firstly is introduced to describe user preferences. Secondly, domain ontologies are decomposed into moderate-scale modules with high cohesion and low coupling. During run time, modules that a user is interested in are selected out based on the user's preferences. Finally, the selected modules are combined to construct personalized views of domain ontologies for the user. © 2012 IEEE.

关键词： Ontology

来源：评论

学校读者我要写书评

暂无评论

Field-assisted spin-polarized electron transport through a single quantum well with spin-orbit coupling

引用

Chinese Physics B 2012年第3期21卷 389-394页

作者：丁秀欢张存喜王瑞周运清孔令民 Department of Mathematics Zhejiang Ocean University Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Department of Physics Zhejiang Ocean University

We have investigated theoretically the field-driven electron transport through a single-quantum-well semiconductor heterostructure with spin-orbit coupling. The splitting of the asymmetric Fano-type resonance peaks due to the Dresselhaus spin-orbit coupling is found to be highly sensitive to the direction of the incident electron. The splitting of the Fano-type resonance induces the spin-polarization dependent electron current. The location and the line shape of the Fano-type resonance can be controlled by adjusting the energy and the direction of the incident electron, the oscillation frequency, and the amplitude of the external field. These interesting features may be used to devise tunable spin filters and realize pure spin transmission currents.

关键词： Fano resonance Floquet channel spin-orbit coupling

来源：评论

学校读者我要写书评

暂无评论

Fano resonance and wave transmission through a chain structure with an isolated ring composed of defects

引用

Chinese Physics B 2012年第3期21卷 212-217页

作者：张存喜丁秀欢王瑞周运清孔令民 Department of Physics Zhejiang Ocean University Department of Mathematics Zhejiang Ocean University Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University

We consider a discrete model that describes a linear chain of particles coupled to an isolated ring composed of N defects. This simple system can be regarded as a generalization of the familiar Fano Anderson model. It can be used to model discrete networks of coupled defect modes in photonic crystals and simple waveguide arrays in two-dimensional lattices. The analytical result of the transmission coefficient is obtained, along with the conditions for perfect reflections and transmissions due to either destructive or constructive interferences. Using a simple example, we further investigate the relationship between the resonant frequencies and the number of defects N, and study how to affect the numbers of perfect reflections and transmissions. In addition, we demonstrate how these resonance transmissions and refections can be tuned by one nonlinear defect of the network that possesses a nonlinear Kerr-like response.

关键词： wave transmission Fano resonance defect bistability

来源：评论

学校读者我要写书评

暂无评论

An Improved Algorithm for CART Based on the Rough Set Theory

An Improved Algorithm for CART Based on the Rough Set Theory

引用

GCIS, WRI Global Congress on Intelligent Systems

作者： Weiguang Wang Wanlin Gao Cong Wang Jinbin Li Ministry of Education Key Laboratory of Trustworthy Beijing China College of information and electrical engineering China Agricultural University Beijing China China PLA General Hospital Clinical data center Beijing China

data prediction and classification is a critical method in medical nutrition data analysis area. As for the characteristics of being intuitive, efficient and easy to understand, the decision tree algorithm is widely used in this field. However, the classification rules extracted from the decision tree are not the most simple and efficient. The paper analyzes the classical decision tree algorithm CART, and proposes a new improved algorithm R2-CART. The core idea of the advanced algorithm is, in order to simplify the classification rules and tree, combining CART algorithm with rough set theory to conduct the attribute and rule reduction on the classification rules of decision tree. The experiment, which compares the Original CART algorithm with the improved algorithm, shows that the improved algorithm has much better classification efficiency with achieving a simple and efficient classification rule set at the same time. This improved algorithm has a potential practical value for large-scale medical nutrition data of classification and predictive analysis.

关键词： Classification algorithms Classification tree analysis Algorithm design and analysis Prediction algorithms Hypertension Set theory

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：