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

World Congress on intelligent Control and Automation (WCICA)

作者： Yan Li Hu Sheng YangQuan Chen School of Control Science and Engineering Shandong University Jinan China Department of Electronic Engineering Dalian University of Technology Dalian China Center for Self-Organizing and Intelligent Systems (CSOIS) Department of Electrical and Computer Engineering Utah State University Logan UT USA

In this paper, we derive the impulse response of a generalized commensurate fractional-order filter of the form (s 2α +as α +b) -γ , where a, b ≥ 0, α ∈ (0, 1] and γ ∈ (0, 1). The asymptotic properties of the impulse responses are obtained. Moreover, based on the derived analytical impulse response, we show how to perform the discretization of the above fractional-order filter. Finally, a number of illustrated examples in time and frequency domains are provided as proofs of concepts.

关键词： Laplace equations Fractional calculus Frequency response Equations Time frequency analysis Time domain analysis

来源：评论

学校读者我要写书评

暂无评论

Universal Approximation of TS Fuzzy systems Constructed Dynamically-MISO Cases

Universal Approximation of TS Fuzzy Systems Constructed Dyna...

引用

American Control Conference

作者： ShiYu Yan ZengQi Sun Zhe Li State Key Laboratory on Intelligent Technology and Systems Tsinghua National Laboratory for Information Science and Technology Department of Computer Science and Technology Tsinghua University Beijing 100084 P.R. China Central University of Finance and Economics Beijing 100081 P.R. China

ISBN: (纸本)9781424474264

Study on approximation capabilities of fuzzy systems has been an important and hot issue for many years. Many existing studies on fuzzy systems based on standard affine TS fuzzy models suffer seriously from curse of dimensionality though such models are relatively simple to construct;whereas other investigations based on hierarchical fuzzy models have to face the difficulty of relatively more complexity. Through utilizing the dynamic partition along all dimensions, this paper proposes a novel dynamically constructive method in MISO cases to construct fuzzy systems based on standard affine TS fuzzy models, which have simple structures and also can ease the serious curse of dimensionality greatly. Correspondingly, new sufficient conditions for a affine TS fuzzy system as an universal approximator are obtained. The situation in 2ISO cases is derived first which is then extended to general MISO cases. Theoretical analyses comparing to some typical methods and several numerical examples all confirm that the dynamic method in this paper can reduce the fuzzy rules number dramatically and therefore can ease the serious curse of dimensionality to some extent. Some conclusions and discussions on further work are also given.

关键词： Fuzzy systems Curse of Dimensionality transport stream Fuzzy simple structures dynamic method Affine In-law

来源：评论

学校读者我要写书评

暂无评论

WANN-Tagger: A weightless artificial neural network tagger for the portuguese language

WANN-Tagger: A weightless artificial neural network tagger f...

引用

作者： Carneiro, Hugo C. C. França, Felipe M. G. Lima, Priscila M. V. Systems Engineering and Computer Science Program/COPPE Universidade Federal do Rio de Janeiro Caixa Postal 68511 21941-972 Rio de Janeiro RJ Brazil Department of Mathematics Universidade Federal Rural do Rio de Janeiro Km 47 Campus Universitário BR-465 23890-000 Seropédica RJ Brazil

ISBN: (纸本)9789898425324

Weightless Artificial Neural Networks have proved to be a promising paradigm for classification tasks. This work introduces the WANN-Tagger, which makes use of weightless artificial neural networks for labelling Portuguese sentences, tagging each of its terms with its respective part-of-speech. A first experimental evaluation using the CETENFolha corpus indicates the usefulness of this paradigm and shows that it outperforms traditional feedforward neural networks in both accuracy and training time, and also that it is competitive in accuracy with the Hidden Markov Model in some cases. Additionally, WANN-Tagger shows itself capable of incrementally learning new tagged sentences during runtime.

关键词： Feedforward neural networks

来源：评论

学校读者我要写书评

暂无评论

On convergence and optimality of genetic algorithms

On convergence and optimality of genetic algorithms

引用

Congress on Evolutionary Computation

作者： Witold Kosiński Stefan Kotowski Zbyszek Michalewicz Faculty of Mathematics Physics and Technology Kazimierz Wielki University Bydgoszcz Poland Faculty of Computer Science Polish-Japanese Institute of Information Technology Warsaw Poland Faculty of Computer Science Division of Intelligent Systems Polish Japanese Institute of Information Technology Warsaw Poland School of Computer Science University of Adelaide Adelaide SA Australia Institute of Fundamental Technological Research Warsaw Poland Department of Computer Sciences Polish Academy of Sciences Warsaw Poland

An action of genetic algorithm could be represented in the search space as a random Markovian process. The question concerning its asymptotic stability properties is discussed. Conditions under which genetic algorithm is convergent, are formulated. Then the existence of an operator to which infinite long iterations of the genetic algorithms tend, is shown. This operator describes optimal genetic algorithm in probabilistic sense.

关键词： Biological cells Markov processes Probabilistic logic Convergence Probability distribution computer science

来源：评论

学校读者我要写书评

暂无评论

Multi-cue pedestrian classification with partial occlusion handling

Multi-cue pedestrian classification with partial occlusion h...

引用

Conference on computer Vision and Pattern Recognition (CVPR)

作者： Markus Enzweiler Angela Eigenstetter Bernt Schiele Dariu M. Gavrila Image & Pattern Analysis Group University of Heidelberg Germany Computer Science Department Technical University of Darmstadt Germany Intelligent Autonomous Systems Group University of Amsterdam Netherlands Environment Perception Group Research Daimler Benz Aerospace Ulm Germany

This paper presents a novel mixture-of-experts framework for pedestrian classification with partial occlusion handling. The framework involves a set of component-based expert classifiers trained on features derived from intensity, depth and motion. To handle partial occlusion, we compute expert weights that are related to the degree of visibility of the associated component. This degree of visibility is determined by examining occlusion boundaries, i.e. discontinuities in depth and motion. Occlusion-dependent component weights allow to focus the combined decision of the mixture-of-experts classifier on the unoccluded body parts. In experiments on extensive real-world data sets, with both partially occluded and non-occluded pedestrians, we obtain significant performance boosts over state-of-the-art approaches by up to a factor of four in reduction of false positives at constant detection rates. The dataset is made public for benchmarking purposes.

关键词： Focusing Image segmentation Image motion analysis Cameras Pattern analysis computer science Informatics intelligent systems Surveillance intelligent vehicles

来源：评论

学校读者我要写书评

暂无评论

Quantum State Reduction for Universal Measurement Based Computation

引用

Physical Review Letters 2010年第2期105卷 020502-020502页

作者： Xie Chen Runyao Duan Zhengfeng Ji Bei Zeng Department of Physics Massachusetts Institute of Technology Cambridge Massachusetts USA Centre for Quantum Computation and Intelligent Systems (QCIS) Faculty of Engineering and Information Technology University of Technology Sydney NSW Australia Department of Computer Science and Technology Tsinghua National Laboratory for Information Science and Technology Tsinghua University Beijing China Perimeter Institute for Theoretical Physics Waterloo Ontario Canada State Key Laboratory of Computer Science Institute of Software Chinese Academy of Sciences Beijing China Institute for Quantum Computing University of Waterloo Waterloo Ontario Canada Department of Combinatorics and Optimization University of Waterloo Waterloo Ontario Canada

Measurement based quantum computation, which requires only single particle measurements on a universal resource state to achieve the full power of quantum computing, has been recognized as one of the most promising models for the physical realization of quantum computers. Despite considerable progress in the past decade, it remains a great challenge to search for new universal resource states with naturally occurring Hamiltonians and to better understand the entanglement structure of these kinds of states. Here we show that most of the resource states currently known can be reduced to the cluster state, the first known universal resource state, via adaptive local measurements at a constant cost. This new quantum state reduction scheme provides simpler proofs of universality of resource states and opens up plenty of space to the search of new resource states.

关键词： Quantum computers

来源：评论

学校读者我要写书评

暂无评论

Tensor Rank and Stochastic Entanglement Catalysis for Multipartite Pure States

引用

Physical Review Letters 2010年第20期105卷 200501-200501页

作者： Lin Chen Eric Chitambar Runyao Duan Zhengfeng Ji Andreas Winter Centre for Quantum Technologies National University of Singapore 3 Science Drive 2 Singapore 117542* Physics Department University of Michigan 450 Church Street Ann Arbor Michigan 48109-1040 USA Centre for Quantum Computation and Intelligent Systems (QCIS) Faculty of Engineering and Information Technology University of Technology Sydney New South Wales 2007 Australia State Key Laboratory of Intelligent Technology and Systems Tsinghua National Laboratory for Information Science and Technology Department of Computer Science and Technology Tsinghua University Beijing 100084 China Perimeter Institute for Theoretical Physics Waterloo Ontario N2L 2Y5 Canada Department of Mathematics University of Bristol Bristol BS8 1TW United Kingdom

The tensor rank (also known as generalized Schmidt rank) of multipartite pure states plays an important role in the study of entanglement classifications and transformations. We employ powerful tools from the theory of homogeneous polynomials to investigate the tensor rank of symmetric states such as the tripartite state |W3⟩=13(|100⟩+|010⟩+|001⟩) and its N-partite generalization |WN⟩. Previous tensor rank estimates are dramatically improved and we show that (i) three copies of |W3⟩ have a rank of either 15 or 16, (ii) two copies of |WN⟩ have a rank of 3N−2, and (iii) n copies of |WN⟩ have a rank of O(N). A remarkable consequence of these results is that certain multipartite transformations, impossible even probabilistically, can become possible when performed in multiple-copy bunches or when assisted by some catalyzing state. This effect is impossible for bipartite pure states.

关键词： Tensors

来源：评论

学校读者我要写书评

暂无评论

Multi-error-correcting amplitude damping codes

Multi-error-correcting amplitude damping codes

引用

IEEE International Symposium on Information Theory

作者： Runyao Duan Markus Grassl Zhengfeng Ji Bei Zeng State Key Laboratory of Intelligent Technology and Systems Tsinghua National Laboratory for Information Science and Technology Department of Computer Science and Technology Tsinghua University Beijing China Centre for Quantum Computation and Intelligent Systems (QCIS) Faculty of Engineering and Information Technology University of Technology Sydney NSW Australia Centre for Quantum Technologies National University of Singapore Singapore Perimeter Institute of Theoretical Physics Waterloo ONT Canada State Key Laboratory of Computer Science Institute of Software Chinese Academy and Sciences Beijing China Institute for Quantum Computing and the Department of Combinatorics and Optimization University of Waterloo Waterloo ONT Canada

ISBN: (纸本)9781424478903

We construct new families of multi-error-correcting quantum codes for the amplitude damping channel. Our key observation is that, with proper encoding, two uses of the amplitude damping channel simulate a quantum erasure channel. This allows us to use concatenated codes with quantum erasure-correcting codes as outer codes for correcting multiple amplitude damping errors. Our new codes are degenerate stabilizer codes and have parameters which are better than the amplitude damping codes obtained by any previously known construction.

关键词： Damping Quantum mechanics Quantum computing Error correction codes Noise level Laboratories Phase noise Physics computing intelligent systems computer science

来源：评论

学校读者我要写书评

暂无评论

Structured Local Binary Haar pattern for graphics retrieval

Structured Local Binary Haar pattern for graphics retrieval

引用

IEEE International Conference on intelligent Computing and intelligent systems (ICIS)

作者： Song-Zhi Su Shu-Yuan Chen Shang-An Li Shao-Zi Li Der-Jyh Duh Cognitive Science Department of Xiamen University Fujian Key Laboratory of the Brain-like Intelligent Systems (Xiamen University) Xiamen China Yuan-Ze University Taiwan Xiamen University Xiamen China Department of Computer Engineering and Science of Yuan-Ze University Taiwan Xiamen University Xiamen Fujian CN Ching-Yun University Taiwan

Feature extraction is an important issue in graphics retrieval. Local feature based descriptors are currently the predominate method used in image retrieval and object recognition. Inspired by the success of Haar feature and Local Binary Pattern (LBP), a novel feature named structured local binary Haar pattern (SLBHP) is proposed for graphics retrieval in this paper. SLBHP encodes the polarity instead of the magnitude of the difference between accumulated gray values of adjacent rectangles. Experimental results on graphics retrieval show that the discriminative power of SLBHP is better than those of using edge points (EP), Haar feature, and LBP even in noisy condition.

关键词： Image recognition

来源：评论

学校读者我要写书评

暂无评论

Accelerating the Shuffled Frog Leaping algorithm by parallel implementations in FPGAs

Accelerating the Shuffled Frog Leaping algorithm by parallel...

引用

International Conference on Bio-Inspired Computing: Theories and Applications, BICTA

作者： Daniel M. Muñoz Carlos H. Llanos Leandro dos S. Coelho Mauricio Ayala-Rincón Department of Mechanical Engineering University of Brasilia Brasilia D.F Brazil Industrial and Systems Engineering Graduate Program Pontifical Catholic University of Parana Curitiba Parana Brazil Department of Computer Science and Mathematics University of Brasilia Brasilia D.F Brazil

Meta-heuristics are efficient techniques for solving large scale optimization problems in which traditional mathematical techniques are impractical or provide suboptimal solutions. The Shuffled Frog Leaping algorithm (SFLA) is a stochastic iterative method, bio-inspired on the memetic evolution of a group of frogs when seeking for food, which combines the social behavior-based of the particle swarm optimization technique (PSO) and the global information exchange of memetic algorithms. However, the SFLA algorithm suffers on large execution times, being this problem clearly evident when solving complex optimization problems for embedded applications. This drawback can be overcome by exploiting the parallel capabilities of the SFLA. This paper proposes a hardware parallel implementation of the SFLA algorithm (HPSFLA) using FPGAs (Field programmable gate Arrays) and the efficient floating-point arithmetic. The proposed architecture allows the SFLA to improve the functionality of the algorithm as well as to decrease the execution times by implementing parallel frogs and parallel memeplexes. Three well-known benchmark problems have been used to validate the implemented algorithm and simulation results demonstrate that the HPSFLA speeds-up by factors of 362, 727 and 211 a C-code implementation using an embedded microprocessor for the Sphere, Rastrigin and Rosenbrock benchmarks problems, respectively. Synthesis, simulation and execution time results demonstrate the effectiveness of the proposed HPSFLA architecture for embedded optimization systems.

关键词： Mathematics Field programmable gate arrays Table lookup

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：