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

IEEE International Workshop on Cellular Nanoscale Networks and their Applications, (CNNA)

作者： Zsolt Voroshazi Andras Kiss Zoltan Nagy Peter Szolgay Department of Image Processing and Neurocomputing University of Pannonia Veszprem Hungary Faculty of Information Technology Pázmáany Péter Catholic University Hungary Cellular Sensory and Wave Computing Laboratory Computer and Automation Research Institute Hungarian Academy of Sciences (ATOMKI) Budapest Hungary

The Falcon emulated-digital CNN-UM (cellular neural/nonlinear networks universal machine) architecture has been extended by an embedded GAPU (global analogic programming unit) using the flexible Xilinx MicroBlaze soft-core processor to take full advantage of the joint computing power of high-speed distributed arithmetics and programmability. The implemented GAPU provides a stand-alone operation, which is capable of controlling complex sophisticated CNN analogic algorithms similar to various visual microprocessors, such as the ACE4k, ACE16k, and Bi-i vision systems. The quality of the embedded GAPU implementation is demonstrated by analogic algorithms, mainly in which sequences of template operations are required.

关键词： Field programmable gate arrays Computer architecture Image processing Mathematical model Organizing Computers Cellular neural networks

来源：评论

学校读者我要写书评

暂无评论

Well limit behaviors of term rewriting systems

引用

中国高等学校学术文摘·计算机科学 2007年第3期1卷 283-296页

作者： MA Shilong SUI Yuefei XU Ke State Key Laboratory of Software Development Environment Beihang UniversityBeijing 100083China Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of SciencesBeijing 100080China

The limit behaviors of computations have not been fully *** is necessary to consider such limit behaviors when we consider the properties of infinite objects in computer science,such as infinite logic programs,the symbolic solutions of infinite polynomial ***,we can use finite objects to approximate infinite objects,and we should know what kinds of infinite objects are approximable and how to approximate them effectively.A sequence {Rκ:κω}of term rewriting systems has the well limit behavior if under the condition that the sequence has the Set-theoretic limit or the distance-based limit,the sequence {Th(Rκ):κ∈ω} of corresponding theoretic closures of Rκ has the set-theoretic or distance-based limit,and limκ→∞ Th(Rκ) is equal to the theoretic closure of the limit of {Rκ:κ∈ω).Two kinds of limits of term rewriting systems are considered:one is based on the set-theoretic limit,the other is on the distance-based *** is proved thatgiven a sequence {Rκ:κ∈ω) of term rewriting systems Rκ,if there is a well-founded ordering (-＜) on terms such that every Rκ is (-＜)-well-founded,and the set-theoretic limit of {Rκ:κ∈ω).exists,then {Rκ:κ∈ω).has the well limit behavior;and if (1) there is a well-founded ordering(-＜)on terms such that every Rκ is(-＜-well-founded,(2) there is a distance d on terms which is closed under substitutions and contexts and (3) {Rκ:κ∈ω).is Cauchy under d then {Rκ:κ∈ω).has the well limit *** results are used to approximate the least Herbrand models of infinite Horn logic programs and real Horn logic programs,and the solutions and Cr(o)bner bases of (infinite) sets of real polynomials by sequences of (finite) sets of rational polynomials.

关键词： term rewriting systems limits Gr(o)bner bases well-foundedness

来源：评论

学校读者我要写书评

暂无评论

Experimental Result on Supersonic Flow Simulation on Emulated Digital CNN-UM

Experimental Result on Supersonic Flow Simulation on Emulate...

引用

IEEE International Workshop on Cellular Nanoscale Networks and their Applications, (CNNA)

作者： Sandor Kocsardi Zoltan Nagy Arpad Csik Peter Szolgay Department of Image Processing and Neurocomputing University of Pannonia Veszprem Hungary Cellular Sensory and Wave Computing Laboratory Computer and Automation Research Institute Hungarian Academy of Sciences (ATOMKI) Budapest Hungary Department of Mathematics and Computational Sciences Széchenyi István University Gyor Hungary Faculty of Information Technology Pázmány Péter Catholic University Budapest Hungary

关键词： Mathematical model Fluids Computer architecture Computational modeling Equations Arrays Atmospheric modeling

来源：评论

学校读者我要写书评

暂无评论

Two-dimensional Compressible Flow Simulation on Emulated Digital CNN-UM

Two-dimensional Compressible Flow Simulation on Emulated Dig...

引用

IEEE International Workshop on Cellular Nanoscale Networks and their Applications, (CNNA)

作者： Sandor Kocsardi Zoltan Nagy Arpad Csik Peter Szolgay Department of Image Processing and Neurocomputing University of Pannonia Veszprem Hungary Cellular Sensory and Wave Computing Laboratory Computer and Automation Research Institute Hungarian Academy of Sciences (ATOMKI) Budapest Hungary Department of Mathematics and Computational Sciences Sźechenyi István University Gyor Hungary Faculty of Information Technology Pázmány Péter Catholic University Budapest Hungary

In the area of mechanical, aerospace, chemical and civil engineering the solution of partial differential equations (PDEs) has been one of the most important problems of mathematics for a long time. In this field, one of the most exciting areas is the simulation of fluid flow, which involves for example problems of air, sea and land vehicle motion. In this paper a CNN-UM based solver of 2D inviscid, adiabatic, compressible fluids will be presented. The governing equations are solved by using first- and second-order numerical methods. Unfortunately the necessity the coupled multi-layered computational structure with non-linear, space-variant templates does not make it possible to utilize the huge computing power of the analog CNN-UM chips. To improve the performance of our solution emulated digital CNN-UM implemented on FPGA has been used. Properties of the implemented specialized architecture is examined in terms of area, speed and accuracy.

关键词： Mathematical model Equations Computer architecture Microprocessors Field programmable gate arrays Computational modeling Magnetic cores

来源：评论

学校读者我要写书评

暂无评论

Fast global motion estimation using threshold method

Fast global motion estimation using threshold method

引用

MIPPR 2007: Medical Imaging, Parallel processing of Images, and Optimization Techniques

作者： Zheng, Jiali Zhang, YongDong Ni, GuangNan Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing 100080 China

ISBN: (纸本)9780819469533

In this paper, a fast global motion estimation method is proposed for video coding. This method can accommodate not only a translational motion model but also a polynomial motion model. It speeds up the procedure of the global motion estimation (GME) by pre-analyzing the characteristics of the block. At the first stage, the smooth region blocks which contribute less to the GME are filtered by using a threshold method based on image intensity. Next, a threshold method based on the discrepancy of the motion vectors is used to exclude the foreground blocks from the GME. From the experimental results, we can conclude that the proposed fast global motion estimation method manages to speed up the processing of estimating the motion vector field while maintaining the coding performance.

关键词： Motion estimation

来源：评论

学校读者我要写书评

暂无评论

A dependency treelet string correspondence model for statistical machine translation 2

A dependency treelet string correspondence model for statist...

引用

2nd Workshop on Statistical Machine Translation, WMT 2007 at the 45th Annual Meeting of the Association of Computational Linguistics, ACL 2007

作者： Xiong, Deyi Liu, Qun Lin, Shouxun Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing100080 China

This paper describes a novel model using dependency structures on the source side for syntax-based statistical machine translation: Dependency Treelet String Correspondence Model (DTSC). The DTSC model maps source dependency structures to target strings. In this model translation pairs of source treelets and target strings with their word alignments are learned automatically from the parsed and aligned corpus. The DTSC model allows source treelets and target strings with variables so that the model can generalize to handle dependency structures with the same head word but with different modifiers and arguments. Additionally, target strings can be also discontinuous by using gaps which are corresponding to the uncovered nodes which are not included in the source treelets. A chart-style decoding algorithm with two basic operations-substituting and attaching-is designed for the DTSC model. We argue that the DTSC model proposed here is capable of lexicalization, generalization, and handling discontinuous phrases which are very desirable for machine translation. We finally evaluate our current implementation of a simplified version of DTSC for statistical machine translation. © 2007 Association for Computational Linguistics

关键词： Machine translation

来源：评论

学校读者我要写书评

暂无评论

Granular computing in the information transformation of patten recognition

Granular computing in the information transformation of patt...

引用

2007 IEEE International Conference on Granular computing, GrC 2007

作者： Hu, Hong Shi, Zhongzhi Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Science Beijing 100080 China

ISBN: (纸本)076953032X

In the past decade, many papers about granular computing(GrC) have been published, but the keypoints about granular computing(GrC) are still unclear. In this paper, we try to find the key points of GrC in the information transformation of the pattern recognition. The information similarity is the main point in the original insight of Granular computing (GrC) proposed by Zadeh(1997[1]). Many GrC researches are based on equivalence relation or more generally tolerance relation, equivalence relation or tolerance relation can be described by some distance functions and GrC can be geometrically defined in a framework of multiscale covering, at other hand, the information transformation in the pattern recognition can be abstracted as a topological transformation in a feature information space, so topological theory can be used to study GrC The key points of GrC are (1) there are two granular computing approaches to change a high dimensional complex distribution domain to a low dimensional and simple domain, (2)these two kind approaches can be used in turn if feature vector itself can be arranged in a granular way. © 2007 IEEE.

关键词： Granular computing

来源：评论

学校读者我要写书评

暂无评论

A Bayesian computational cognitive model

A Bayesian computational cognitive model

引用

3rd International Workshop on Neural-Symbolic Learning and Reasoning, NeSy 2007, Held at IJCAI 2007

作者： Shi, Zhiwei Hu, Hong Shi, Zhongzhi Key Laboratory of Intelligent Information Processing Institute of Computing Technology CAS China Kexueyuan Nanlu #6 Beijing 100080 China

Computational cognitive modeling has recently emerged as one of the hottest issues in the AI area. Both symbolic approaches and connectionist approaches present their merits and demerits. Although Bayesian method is suggested to incorporate advantages of the two kinds of approaches above, there is no feasible Bayesian computational model concerning the entire cognitive process by now. In this paper, we propose a variation of traditional Bayesian network, namely Globally Connected and Locally Autonomic Bayesian Network (GCLABN), to formally describe a plausible cognitive model. The model adopts a unique knowledge representation strategy, which enables it to encode both symbolic concepts and their relationships within a graphical structure, and to generate cognition via a dynamic oscillating process rather than a straightforward reasoning process like traditional approaches. Then a simple simulation is employed to illustrate the properties and dynamic behaviors of the model. All these traits of the model are coincident with the recently discovered properties of the human cognitive process.

关键词： Bayesian networks

来源：评论

学校读者我要写书评

暂无评论

3-D projective moment invariants

引用

Journal of information and Computational Science 2007年第2期4卷 821-828页

作者： Xu, Dong Li, Hua Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Acad. of Sci. Beijing 100080 China Key Laboratory of Computer System and Architecture Institute of Computing Technology Chinese Acad. of Sci. Beijing 100080 China National Research Center for Intelligent Computing Systems Institute of Computing Technology Chinese Acad. of Sci. Beijing 100080 China Graduate University Chinese Acad. of Sci. Beijing 100080 China

2-D projective moment invariants were firstly proposed by Suk and Flusser in [12]. We point out here that there is a useless projective moment invariant which is equivalent to zero in their paper. 3-D projective moment invariants are generated theoretically by investigating the property of signed volume of a tetrahedron. The main part is the selection of permutation invariant cores for multiple integrals to generate independent and nonzero 3-D projective moment invariants. We give the conclusion that projective moment invariants don't exist strictly speaking because of their convergence problem.

关键词： Computer vision

来源：评论

学校读者我要写书评

暂无评论

Ad-hoc network DOA tracking via sequential Monte Carlo filtering

引用

The Journal of China Universities of Posts and Telecommunications 2007年第1期14卷 12-15页

作者： GUO Li GUO Yan LIN Jia-ru LI Ning Key Laboratory of Information Processing and Intelligent Technology BeijingUniversity of Posts and Telecommunications Beijing 100876 China Institute of Science PLA University of Science and TechnologyNanjing 210007 China

A novel sequential Monte Carlo （SMC） algorithm is provided for the multiple maneuvering Ad-hoc network terminals direction of arrival （DOA） tracking. A nonlinear mobility and observation model is adopted, which can describe the motion features of the Ad-hoc network terminal more practically. The algorithm does not need any additional measurement equipment. Simulation result shows its significant tracking accuracy.

关键词： Bayesian inference Ad-hoc network DOA tracking,SMC

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：