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

第四届国际仿生工程学术会议

作者： Bo Zhao Hongwei Zhao Pingping Liu Guihe Qin School of Computer Science and Technology Jilin University Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education

We describe a novel mobile visual search system based on the saliency mechanism and sparse coding principle of the human visual system (HVS). In the feature extraction step, we first divide an image into different regions using the saliency extraction algorithm. Then scale-invariant feature transform (SIFT) descriptors in all regions are extracted while regional identities are preserved based on their various saliency levels. According to the sparse coding principle in the HVS, we adopt a local neighbor preserving Hash function to establish the binary sparse expression of the SIFT features. In the searching step,

关键词： mobile vision search, human vision system, saliency, sparse coding, Hash, SIFT descriptor.

来源：评论

学校读者我要写书评

暂无评论

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 novel image retrieval method based on mutual information descriptors

引用

9th International Conference on Intelligent computing, ICIC 2013

作者： Hou, Gang Zhang, Ke Zhang, Xiaoxue Kong, Jun Zhang, Ming College of Communication Engineering Jilin University Changchun China College of Humanities and Sciences Northeast Normal University Changchun China School of Computer Science and Information Technology Northeast Normal University Changchun China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun China

ISBN: (纸本)9783642394812

In this paper, we propose a novel image retrieval method based on mutual information descriptors (MIDs). Under the physiological property of human eyes and human visual perception theory, MIDs are extracted to encode the internal correlation relationship among multiple image feature spaces, characterizing image contents with mutual information features based on the low-level image features, such as color, shape etc., then, the mutual information features fusion strategy is used to imitate the information transfer process in nervous system. When using the MIDs proposed to image retrieval, we can get many advantages such as low dimensionality, a certain robustness of geometric distortions and noise, and describing the human visual retrieval mechanism effectively. Experimental results show that MIDs have high indexing and retrieving performance compared with existing methods for content-based image retrieval (CBIR). © 2013 Springer-Verlag.

关键词： Vision

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

An algorithm on fairness verification of mobile sink routing in wireless sensor network

An algorithm on fairness verification of mobile sink routing...

引用

作者： Xu, Guangquan Li, Weisheng Xu, Rui Xiao, Yingyuan Gao, Honghao Li, Xiaohong Feng, Zhiyong Mei, Jia Institute of Knowledge Science and Engineering School of Computer Science and Technology Tianjin University 92 Weijin Road Nankai District Tianjin 300072 China College of Computer Science and Technology Chongqing University of Posts and Telecommunications Chongqing China Tianjin Key Laboratory of Intelligence Computing and Novel Software Technology Tianjin University of Technology Tianjin China Shanghai Key Laboratory of Computer Software Evaluating and Testing Shanghai University Shanghai 201112 China Guangxi Economic Management Cadre College Guangxi China

Congestion and starvation will occur among some nodes due to the emerging serious unfairness, which is derived from the limited communication capabilities of all nodes and sink or in the case of a mobile sink moving to a new place. The problem to be solved is to balance the network and keep the fairness for all nodes. For this purpose, this paper focuses on verifying the fairness of mobile sink routing based on both state and action, which is realized mainly by composing Labeled Kripke Transition Systems (LKTS). First, an approach is presented by LKTS to model node behaviors. Second, a notion of Fair Computational Tree Logic (CTL) is introduced to describe the fairness formulae in branching time transitions, and four kinds of fairness assumptions are defined for fairness verification. Moreover, in order to avoid the problem of state-space explosion, Bounded model Checking to explore states and transitions on-the-fly until a witness is found, while Strong Connected Components algorithm is used to pick up fair paths under fairness constraints of Fair CTL. The experimental results show the superiority of our method by the savings in memory and time consumptions during the mobile sink routing process. © 2012 Springer-Verlag London Limited.

关键词： Model checking

来源：评论

学校读者我要写书评

暂无评论

L-priorities Bloom Filter: A New Member of the Bloom Filter Family

引用

International Journal of Automation and computing 2012年第2期9卷 171-176页

作者： Huang-Shui Hu Hong-Wei Zhao Fei Mi College of Computer Science and Technology Jilin University Changchun 130012 PRC Key Laboratory of Symbolic Computation and Knowledge Engineering for Ministry of Education Jilin University Changchun 130012 PRC

A Bloom filter is a space-efficient data structure used for concisely representing a set as well as membership queries at the expense of introducing false positive. In this paper, we propose the L-priorities Bloom filter （LPBF） as a new member of the Bloom filter （BF） family, it uses a limited multidimensional bit space matrix to replace the bit vector of standard bloom filters in order to support different priorities for the elements of a set. We demonstrate the time and space complexity, especially the false positive rate of LPBF. Furthermore, we also present a detailed practical evaluation of the false positive rate achieved by LPBF. The results show that LPBF performs better than standard BFs with respect to false positive rate.

关键词： Bloom filter bit space matrix false positive L-priorities time and space complexity.

来源：评论

学校读者我要写书评

暂无评论

A parallel scheduling algorithm for reinforcement learning in large state space

引用

Frontiers of Computer Science 2012年第6期6卷 631-646页

作者： Quan LIU Xudong YANG Ling JING Jin LI Jiao LI Institute of Computer Science and Technology Soochow UniversitySuzhou 215006China Department of Computer Science and Technology Nanjing UniversityNanjing 210093China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin UniversityChangchun 130012China

The main challenge in the area of reinforcement learning is scaling up to larger and more complex problems. Aiming at the scaling problem of reinforcement learning, a scalable reinforcement learning method, DCS-SRL, is proposed on the basis of divide-and-conquer strategy, and its convergence is proved. In this method, the learning problem in large state space or continuous state space is decomposed into multiple smaller subproblems. Given a specific learning algorithm, each subproblem can be solved independently with limited available resources. In the end, component solutions can be recombined to obtain the desired result. To ad- dress the question of prioritizing subproblems in the scheduler, a weighted priority scheduling algorithm is proposed. This scheduling algorithm ensures that computation is focused on regions of the problem space which are expected to be maximally productive. To expedite the learning process, a new parallel method, called DCS-SPRL, is derived from combining DCS-SRL with a parallel scheduling architecture. In the DCS-SPRL method, the subproblems will be distributed among processors that have the capacity to work in parallel. The experimental results show that learning based on DCS-SPRL has fast convergence speed and good scalability.

关键词： divide-and-conquer strategy parallel schedule scalability large state space continuous state space

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：