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

Micro-assembly of micro parts using uncalibrated microscopes visual servoing method

Information Technology Journal 2008年第3期7卷 497-503页

作者： Xiangjin, Zeng Xinhan, Huang Min, Wang Key Laboratory of Image Processing and Intelligent Control Department of Control Science and Engineering HUST Wuhan 430074 China

In micromanipulation, the microscope vision servoing can achieve a high performance. In order to avoid the complicated calibration of intrinsic parameter of camera, We apply an improved broyden's method to estimate the image jacobian matrix on line, which employs Chebyshev polynomial to construct a cost function to approximate the optimization value, obtaining a fast convergence for online estimation. Using the estimated jacobian matrix, a PD visual controller is used to make features converge to desired values with satisfactory dynamic performance. The experiments of micro-assembly of micro parts m microscopes confirm that the proposed method is effective and feasible. © 2008 Asian Network for Scientific Information.

关键词： Chebyshev polynomials

来源：评论

学校读者我要写书评

暂无评论

Research of invariant moments and improved support vector machine in micro-targets identification

引用

Journal of Applied Sciences 2008年第21期8卷 3969-3974页

作者： Zeng, Xiangjin Huang, Xinhan Wang, Min Key Laboratory of Image Processing and Intelligent Control Department of Control Science and Engineering Huazhong University of Science and Technology Wuhan 430074 China

In order to identify multi micro objects, an improved support vector machine algorithm is present, which employs invariant moments based edge extraction to obtain feature attribute and then presents a heuristic attribute reduction algorithm based on rough set's discernibility matrix to obtain attribute reduction, with using support vector machine to identify and classify the targets. According to the feature attribute, the effectiveness of identifying multi micro objects using support vector machine is compared with the proposed improved support vector machine classification method. The experiment results under micro vision environment show that the proposed improved support vector machine classification method can meet the system application requirement, with the resolution is 95%. © 2008 Asian Network for Scientific Information.

关键词： Support vector machines

来源：评论

学校读者我要写书评

暂无评论

Directed epileptic network from scalp and intracranial EEG of epileptic patients

Directed epileptic network from scalp and intracranial EEG o...

引用

IEEE Workshop on Machine Learning for Signal processing

作者： L. Amini C. Jutten S. Achard O. David H. Soltanian-Zadeh G.A. Hossein-Zadeh P. Kahane L. Minotti L. Vercueil Grenoble INP GIPSA Laboratory Grenoble France Grenoble INP GIPSA-LAB Grenoble Cedex France Control and Intelligent Processing Center of Excellence (CIPCE) University of Tehran Tehran Tehran Iran CHUG Neurology Department GIN U836 INSERM Grenoble France Neurology Department CHUG Grenoble France Henry Ford Health System Radiology Image Analysis Laboratory Detroit MI USA

We proposed recently the computation of epileptic connectivity graphs based on wavelet correlation coefficients between EEG signals. The suspected epileptiform electrodes are recognized using the clustering of the topological properties of the graph that can be useful for pre-surgical studies. Here, we present a method for comparing epileptic networks estimated from scalp and intracranial EEG (IEEG) in partial epilepsy patients. The results are presented for a patient with left temporal epilepsy. Good spatial correspondence between the IEEG and the scalp EEG epileptic graphs is obtained. These results are consistent with the patient's clinical diagnosis.

关键词： Epilepsy Scalp Electroencephalography Electrodes Surgery Time frequency analysis Indium phosphide Radio control Process control control systems

来源：评论

学校读者我要写书评

暂无评论

Neutrosophic combination rules based on dempster-shafer theory and Dezert-Smarandache theory

引用

Information Technology Journal 2008年第7期7卷 1023-1029页

作者： Gao, Jian Huang, Xinhan Wang, Min Li, Xinde Key Laboratory of Ministry of Education for Image Processing and Intelligent Control Department of CSE HUST Wuhan 430074 China School of Automation Southeast University Nanjing 210096 China

Several neutrosophic combination rules based on the Dempster-Shafer theory (DST) and Dezert-Smarandache theory (DSmT) are presented in this study. The new information fusing approaches proposed the neutrosophic belief assignment to represent the evidences and connect the DST and DSmT with neutrosophic theory. Neutrosophic theory used the components truth, indeterminacy and falsity to represent any idea, which provides a better approach to express the real world. The DST-based and DSmT-based combination rules can fuse information more effectively. The new combination rules utilized the advantages of DST, DSmT and neutrosophic theory. They are more adapted to describing the human mind and helping to make correct decisions. To fuse the information expressed in natural language, the qualitative neutrosophic combination rules of information have been proposed in this study too. Some application examples have been given to support the proposed combination rules. Compared with the original DST-based and DSmT-based combination rules, the neutrosophic combination rules can provide more useful information and have wider application field. © 2008 Asian Network for Scientific Information.

关键词： Information fusion

来源：评论

学校读者我要写书评

暂无评论

On string languages generated by spiking neural P systems with exhaustive use of rules

引用

Natural Computing 2008年第4期7卷 535-549页

作者： Zhang, Xingyi Zeng, Xiangxiang Pan, Linqiang Key Laboratory of Image Processing and Intelligent Control Department of Control Science and Engineering Huazhong University of Science and Technology Wuhan 430074 Hubei China

We continue the study of (extended) spiking neural P systems with exhaustive use of rules by considering these computing devices as language generators. Specifically, a step is associated with a symbol according to the number of spikes emitted by the output neuron and the sequence of these symbols associated with a halting computation constitutes a string. Two cases are considered: one of them interprets a step when no spike is emitted as a specified symbol, the other interprets such a step as the empty string. In both cases, it is proved that finite and recursively enumerable languages are characterized by extended spiking neural P systems working in the exhaustive mode. The relationships with regular languages are also investigated. © Springer Science+Business Media B.V. 2008.

关键词： Membrane computing Register machine SN P systems

来源：评论

学校读者我要写书评

暂无评论

Improved taboo search algorithm for designing DNA sequences

引用

Progress in Natural Science:Materials International 2008年第5期18卷 623-627页

作者： Kai Zhang a, Jin Xu a,b, Xiutang Geng a, Jianhua Xiao a, Linqiang Pana, a The Key laboratory of image processing and intelligent control, Department of control Science and Engineering, Huazhong University of Science and Technology, Wuhan 430074, China b School of Electronic Engineering and Computer Science, Peking University, Beijing 100871, China The Key Laboratory of Image Processing and Intelligent Control Department of Control Science and Engineering Huazhong University of Science and Technology Wuhan 430074 China School of Electronic Engineering and Computer Science Peking University Beijing 100871 China

The design of DNA sequences is one of the most practical and important research topics in DNA computing. We adopt taboo search algorithm and improve the method for the systematic design of equal-length DNA sequences, which can satisfy certain combinatorial and thermodynamic constraints. Using taboo search algorithm, our method can avoid trapping into local optimization and can nd a set of good DNA sequences satisfying required constraints.

关键词： DNA computing Taboo search algorithm DNA sequence design

来源：评论

学校读者我要写书评

暂无评论

Predictive protocol of flocks with small-world connection pattern

引用

Physical Review E 2009年第1期79卷 016113-016113页

作者： Hai-Tao Zhang Michael Z. Q. Chen Tao Zhou The Key Laboratory of Image Processing and Intelligent Control Department of Control Science and Engineering Huazhong University of Science and Technology Wuhan 430074 People's Republic of China Department of Engineering University of Cambridge Cambridge CB2 1PZ United Kingdom Department of Engineering University of Leicester Leicester LE1 7RH United Kingdom Department of Electronic Engineering City University of Hong Kong Kowloon Hong Kong SAR People's Republic of China Department of Modern Physics University of Science and Technology of China Hefei 230026 People’s Republic of China Department of Physics University of Fribourg Chemin du Muse 3 Fribourg CH-1700 Switzerland

By introducing a predictive mechanism with small-world connections, we propose a new motion protocol for self-driven flocks. The small-world connections are implemented by randomly adding long-range interactions from the leader to a few distant agents, namely, pseudoleaders. The leader can directly affect the pseudoleaders, thereby influencing all the other agents through them efficiently. Moreover, these pseudoleaders are able to predict the leader’s motion several steps ahead and use this information in decision making towards coherent flocking with more stable formation. It is shown that drastic improvement can be achieved in terms of both the consensus performance and the communication cost. From the engineering point of view, the current protocol allows for a significant improvement in the cohesion and rigidity of the formation at a fairly low cost of adding a few long-range links embedded with predictive capabilities. Significantly, this work uncovers an important feature of flocks that predictive capability and long-range links can compensate for the insufficiency of each other. These conclusions are valid for both the attractive and repulsive swarm model and the Vicsek model.

关键词： pattern formation protocols random processes 3-DIMENSIONAL LATTICE MODEL DYNAMICAL COMPLEX NETWORKS REPULSIVE INTERACTIONS STABILITY ANALYSIS ATTRACTIVE FORCES SENSOR NETWORKS ANIMAL GROUPS AGENTS TRANSITIONS CONSENSUS

来源：评论

学校读者我要写书评

暂无评论

High performance word level sequential and parallel coding methods and architectures for bit plane coding

引用

Science in China(Series F) 2008年第4期51卷 337-351页

作者： XIONG ChengYi TIAN JinWen LIU Jian College of Electronic Information Engineering South-Central University for Nationalities Wuhan 430074 China Institute of Pattern Recognition & Artificial Intelligence Key Laboratory of Education Ministry for Image Processing and Intelligent Control Huazhong University of Science & Technology Wuhan 430074 China

This paper introduced a novel high performance algorithm and VLSI architectures for achieving bit plane coding （BPC） in word level sequential and parallel mode. The proposed BPC algorithm adopts the techniques of coding pass prediction and parallel ＆ pipeline to reduce the number of accessing memory and to increase the ability of concurrently processing of the system, where all the coefficient bits of a code block could be coded by only one scan. A new parallel bit plane architecture （PA） was proposed to achieve word-level sequential coding. Moreover, an efficient high-speed architecture （HA） was presented to achieve multi-word parallel coding. Compared to the state of the art, the proposed PA could reduce the hardware cost more efficiently, though the throughput retains one coefficient coded per clock. While the proposed HA could perform coding for 4 coefficients belonging to a stripe column at one intra-clock cycle, so that coding for an NxN code-block could be completed in approximate N2/4 intra-clock cycles. Theoretical analysis and experimental results demonstrate that the proposed designs have high throughput rate with good performance in terms of speedup to cost, which can be good alternatives for low power applications.

关键词： bit plane coding high performance word-level sequential multi-word parallel

来源：评论

学校读者我要写书评

暂无评论

Research advances and prospect of spiking neural P systems

引用

Jisuanji Xuebao/Chinese Journal of Computers 2008年第12期31卷 2090-2096页

作者： Pan, Lin-Qiang Zhang, Xing-Yi Zeng, Xiang-Xiang Wang, Jun Key Laboratory of Image Processing and Intelligent Control Department of Control Science and Engineering Huazhong University of Science and Technology Wuhan 430074 China

Spiking neural P systems are a new computing model inspired from the biological phenomena that in the brain the neurons cooperate to deal with spikes by axons. Since it has been shown that they have powerful computational capability and potential capability in solving computationally hard problems, more and more people begin to get interested in this field. This paper firstly introduces the formal definition of standard spiking neural P systems and some notions which are often used in this area;then, several extensions of the original spiking neural P systems are summarized, that are: Extented SN P system;SN P system with exhaustive use of rules;Asynchronous SN P system;Sequential SN P system. Also, the results on the topic of spiking neural P systems are briefly recalled in two aspects: computational completeness and computational efficiency. In the end, two more important future research directions on spiking neural P systems are pointed out. Specifically, one interesting topic is to develop a new computing model which is more "realistic";another topic is to consider how to use these models in biological modeling and simulation.

关键词： Computational efficiency

来源：评论

学校读者我要写书评

暂无评论

Supply chain system complexity analysis

引用

Xitong Gongcheng Lilun yu Shijian/System Engineering Theory and Practice 2008年第SUPPL.期28卷 132-141页

作者： Wang, Hong-Wei Guo, Min Institute of Systems Engineering Key Laboratory of Image Processing and Intelligent Control Huazhong University of Science and Technology Wuhan 430074 China

Supply chain is a complex system. The complexity of supply chain can be categorized into two kinds: the complexity of supply chain components as well as the complexity of the supply chain organizations, and both information uncertainty with system dynamics are the main reasons that lead to supply chain complexity. Concerning supply chain complexity, we review the related researching approaches in the literature from uncertainty, the measure of supply chain complexity as well as the dynamic analysis of the supply chain (including dynamic games), and give suggestions in the future research.

关键词： Supply chains

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：