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

IEEE international Symposium on Computational Intelligence for Measurement Systems and Applications

作者： Payeur, P Univ Ottawa Sch Informat Technol & Engn Vis Imaging Video & Audio Res Lab Ottawa ON K1N 6N5 Canada

ISBN: (纸本)0780377834

Autonomous robotic systems require a detailed model of space occupancy to be built from sensory information in order to navigate safely in their environment. Probabilistic occupancy models have been proposed that use conditional probabilities evaluation to merge redundant measurements. These approaches provide meaningful representation of space but require important approximations to remain computationally tractable for high dimensionality, As a result, the strict definition of probability is denatured The present paper proposes an exploration of the fuzzy logic paradigm as a modeling tool for occupancy mapping in the context of work-space representation for robotic applications. A computationally tractable fuzzy logic inference engine is introduced that allows data fusion to construct a robot workspace representation in a more intuitive way while preserving desirable characteristics achieved by probabilistic modeling schemes.

关键词： Fuzzy logic Orbital robotics Robot sensing systems Engines Space technology Robot vision systems Computer vision Layout Merging Navigation

来源：评论

学校读者我要写书评

暂无评论

An abstract concept of optimal implementation

An abstract concept of optimal implementation

引用

WRS 2003, 3rd international workshop on Reduction Strategies in Rewriting and programming - Final Proceedings

作者： Khasidashvili, Zurab Glauert, John Logic and Validation Technology Intel IDC Haifa Israel School of Computing Sciences UEA Norwich NR4 7TJ United Kingdom

In previous works, we introduced Stable Deterministic Residual Structures (SDRSs), Abstract Reduction Systems with an axiomatized residual relation which model orthogonal term and graph rewriting systems, and Deterministic Family Structures (DFSs), which add an axiomatized notion of redex-family to capture known sharing concepts in the lambda-calculus and other orthogonal rewrite systems. In this paper, we introduce and study a concept of implementation of DFSs. We show that for any DFS F, its implementation FI is a non-duplicating DFSs with zig-zag as the family relation, where zig-zag is simply the symmetric and transitive closure of the residual relation on redexes with histories. Further, we show that sharing is compositional: the sharing in a DFS F can be decomposed into a weaker sharing F' (such as zig-zag) and a sharing in the implementation F'I of F' stronger than zig-zag. These results require study of the family relation in non-duplicating SDRSs. We show that zig-zag forms a family-relation in every non-duplicating SDRS, and that it is the only separable family relation in such SDRSs. © 2003 Published by Elsevier Science B.V.

关键词： Computer science

来源：评论

学校读者我要写书评

暂无评论

Transformations of signed-binary number representations for efficient VLSI arithmetic

Transformations of signed-binary number representations for ...

引用

IEEE international workshop on System-on-Chip for Real-Time Applications

作者： B.D. Andreev E.L. Titlebaum E.G. Friedman Department of Electrical and Computer Engineering University of Rochester Rochester NY USA

The VLSI implementation of arithmetic operations may be significantly improved by using non-conventional number representations and transforming intermediate results from one format to another format. For a target function, the objective is to change the number representations of the input and output operands such that a minimum amount of logic circuitry is required to achieve a computation. Redundant arithmetic has received increasing interest in the past decade to reduce or eliminate carry propagation chains. The development of an analytical framework that expands the scope of functions that can be efficiently implemented using signed-binary representation is discussed in this paper. Implementation details are described that demonstrate the application of these results. Particular attention is placed on realizing the (a + b), -(a + b), (a - b), and -(a - b) functions in a complex /spl plusmn/1 multiplier serving as a pseudonoise code scrambler in wireless CDMA transceivers.

关键词： Very large scale integration Digital arithmetic Adders Delay logic circuits Multiaccess communication Transceivers Contracts Degradation Power dissipation

来源：评论

学校读者我要写书评

暂无评论

An ontology-based graphical tool for intelligent instruments

An ontology-based graphical tool for intelligent instruments

引用

IEEE international Conference on Computational Intelligence for Measurement Systems and Applications (CIMSA)

作者： R. Dapoigny P. Barlatier E. Benoit L. Foulloy LISTIC Université de Savoie Annecy-le-vieux France CNAM LYON Lyon France

This paper proposes a structured graphical method which relates both functional and behavioral requirements and software specifications to a detailed software design and implementation of intelligent instruments. The logic-based architecture is especially appropriate during the stage of conceptual design when modeling functional and behavioral specifications of digital instrumentation and control system are under consideration. The graphical representation of physical, functional and behavioral requirements is described through a multilayer hierarchical decomposition resulting from ontological analysis. As a consequence, the clear description of both goals and behavior for intelligent instruments within a single system that are based on first order logic axioms included in the ontology, allows one (with focussing on the teleological aspect of intelligent instruments) to enhance the model quality and to improve behavior reliability for intelligent instruments at run-time. The hierarchical decomposition (i) expresses semantic interrelations between the physical system and the behavioral items (ii) addresses incomplete or inconsistent requirements (iii) provides a structured framework that can serve as a basis for further extent. The system conceptualization is implemented in a new graphical tool resulting from the aggregation of object oriented software modules written in JAVA. The graphical tool is also referenced as Graphical CAPTool (GCAPTool).

关键词： Ontologies Instruments Object oriented modeling Software design Intelligent structures Computer architecture Control system synthesis Digital control Nonhomogeneous media logic

来源：评论

学校读者我要写书评

暂无评论

A robust handshake for asynchronous system

A robust handshake for asynchronous system

引用

IEEE international workshop on System-on-Chip for Real-Time Applications

作者： Kuo-hsing Cheng Wei-Chun Chang Chia-Ming Tu Department of Electrical Engineering Tamkang University Tamsui Taiwan

ISBN: (纸本)076951944X

In this paper, a new handshake methodology to enhance the performance of the asynchronous systems is proposed. The proposed handshake methodology has more flexibility to design an asymmetric asynchronous system. The proposed handshake methodology also has some advantages, like latch free, robust, high throughput, very short pre-charge time, less transistors, and more flexibility in asymmetry data path. A technique that combines a single-rail dynamic circuit with a dual-rail dynamic circuit was proposed and used to design in the data path. In the critical delay data paths, the dual-rail dynamic circuits were used to improve the operating speed. In others the single-rail dynamic circuits were used. It brings some advantages that reduce power consumption and die area while maintaining the calculation speed. Finally, an asynchronous array multiplier was designed and implemented by the new robust handshake methodology. Based on the TSMC 0.35 /spl mu/m CMOS technology, the simulation result of the maximum throughput is about 2.5 ns.

关键词： Robustness Voltage logic circuits Energy consumption Clocks Detectors Quadratic programming Throughput MOS devices CMOS technology

来源：评论

学校读者我要写书评

暂无评论

Utilising the event calculus for policy driven adaptation on mobile systems

Utilising the event calculus for policy driven adaptation on...

引用

3rd international workshop on Policies for Distributed Systems and Networks

作者： Efstratiou, C Friday, A Davies, N Cheverst, K Univ Lancaster Dept Comp Lancaster LA1 4YR England

ISBN: (纸本)0769516122

Adaptation is an important requirement for mobile applications due to the varying levels of resource availability that characterises mobile environments. However without proper control, multiple applications can each adapt independently in response to a range of different adaptive stimuli, causing conflicts or suboptimal performance. In this paper we present a policy driven approach for mobile adaptive systems that can overcome the aforementioned problems. Our system is based on a policy language derived from the Event Calculus logic programming formalism. Important characteristics of our policy language are the support for explicit expressions of time dependencies and the simple and user friendly syntax.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Toward the formal foundation of ant programming 3rd

Toward the formal foundation of ant programming

引用

3rd international workshop on Ant Algorithms, ANTS 2002

作者： Birattari, Mauro Di Caro, Gianni Dorigo, Marco IRIDIA Université Libre de Bruxelles CP 194/6 Av. Franklin D. Roosevelt 50 Brussels1050 Belgium

ISBN: (纸本)9783540457244

This paper develops the formal framework of ant programming with the goal of gaining a deeper understanding on ant colony optimization and, more in general, on the principles underlying the use of an iterated Monte Carlo approach for the multi-stage solution of combinatorial optimization problems. Ant programming searches for the optimal policy of a multi-stage decision problem to which the original combinatorial problem is reduced. In order to describe ant programming we adopt on the one hand concepts of optimal control, and on the other hand the ant metaphor suggested by ant colony optimization. In this context, a critical analysis is given of notions such as state, representation, and sequential decision process under incomplete information. © Springer-Verlag Berlin Heidelberg 2002.

关键词： Ant colony optimization

来源：评论

学校读者我要写书评

暂无评论

A methodology towards automatic implementation of N-body algorithms

A methodology towards automatic implementation of <i>N</i>-b...

引用

3rd PanAmerican workshop on Applied and Computational Mathematics

作者： Pauca, VP Rodriguez, AF Sun, X Trivedi, KS Duke Univ Dept Comp Sci Durham NC 27708 USA Duke Univ Dept Elect & Comp Engn Durham NC 27708 USA IBM Corp ITSO Cary NC 27513 USA

We propose a methodology aimed at automating the software development of fast discrete transforms for N-body problems. The methodology starts with a representation of the transform matrix in compact form. Then, two translation phases are applied. One translates matrix notation to an intermediate form. The other translates the intermediate form to compilable code for a target computing environment. The generated target code employs a library of pre-defined and optimized routines. We apply our methodology systematically to implement the three-dimensional fast multipole method. We demonstrate the efficiency of our code in a molecular dynamics simulation. (C) 2002 IMACS. Published by Elsevier Science B.V. All rights reserved.

关键词： approximation methods discrete transforms programming software

来源：评论

学校读者我要写书评

暂无评论

Specifying coalgebras with modal logic

引用

THEORETICAL COMPUTER SCIENCE 2001年第1-2期260卷 119-138页

作者： Kurz, A CWI Ctr Math & Comp Sci NL-1090 GB Amstelveen Netherlands

We propose to use modal logic as a logic for coalgebras and discuss it in view of the work done on coalgebras as a semantics of object-oriented programming. Two approaches are taken: First, standard concepts of modal logic are applied to coalgebras. For a certain kind of functor it is shown that the logic exactly captures the notion of bisimulation and a complete calculus is given. Examples of verifications of object properties are given. Second, we discuss the relationship of this approach with the coalgebraic logic of Moss (Coalgebraic logic, Ann. pure Appl. logic 96 (1999) 277-317.). (C) 2001 Elsevier Science B.V. All rights reserved.

关键词： coalgebras modal logic object-oriented programming verification specification

来源：评论

学校读者我要写书评

暂无评论

An implementation of narrowing strategies 01

An implementation of narrowing strategies

引用

Proceedings of the 3rd international ACM SIGPLAN Conference on Principles and Practice of Declarative programming (PPDP'00)

作者： Antoy, Sergio Hanus, Michael Massey, Bart Steiner, Frank Department of Computer Science Portland State University P.O. Box 751 Portland OR 97207 United States Institut für Informatik Chrstn.-Albrechts-Univ. Kiel Olshausenstr. 40 D-24098 Kiel Germany

ISBN: (纸本)158113388X

This paper describes an implementation of narrowing, an essential component of implementations of modern functional logic languages. These implementations rely on narrowing, in particular on some optimal narrowing strategies, to execute functional logic programs. We translate functional logic programs into imperative (Java) programs without an intermediate abstract machine. A central idea of our approach is the explicit representation and processing of narrowing computations as data objects. This enables the implementation of operationally complete strategies (i.e., without back-tracking) or techniques for search control (e.g., encapsulated search). Thanks to the use of an intermediate and portable representation of programs, our implementation is general enough to be treed as a common back end for a wide variety of functional logic languages.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：