Chinese word segmentation is the first step in any Chinese NLP system. This paper presents a new algorithm for segmenting Chinese texts without making use of any lexicon and hand-crafted linguistic resource. The stati...
详细信息
A new paradigm of event-based robotic and telerobotic control, referred to as the reference adaptive impedance control, is presented for partially constrained robotic and telerobotic tasks under uncertain or unknown e...
详细信息
ISBN:
(纸本)0780344650
A new paradigm of event-based robotic and telerobotic control, referred to as the reference adaptive impedance control, is presented for partially constrained robotic and telerobotic tasks under uncertain or unknown environmental constraints. The reference adaptive impedance control determines the desired next state adaptively to follow the optimal path from the current state, where the optimal path is generated with the environmental constraints updated through time. The embedded impedance control provides a mechanism for collecting more complete information on the environment. The reference adaptive impedance control also serves as a powerful tool for implementing shared control in teleoperation. A case study of robotic and telerobotic soil trenching is given with peg-hole insertion experiment.
The reduce algorithm eliminates irrelevant terms in learning tasks. in this case study, the authors use reduce to preprocess data for a hybrid genetic algorithm RLl-ICET.
The reduce algorithm eliminates irrelevant terms in learning tasks. in this case study, the authors use reduce to preprocess data for a hybrid genetic algorithm RLl-ICET.
We describe the autonomous robot ARBIB, which uses biologically-motivated forms of learning to adapt to its environment. The "nervous system" of ARBIB has a nonhomogeneous population of spiking neurons, and ...
详细信息
We describe the autonomous robot ARBIB, which uses biologically-motivated forms of learning to adapt to its environment. The "nervous system" of ARBIB has a nonhomogeneous population of spiking neurons, and uses both nonassociative (habituation, sensitization) and associative (classical conditioning) forms of learning to modify pre-existing ("hard-wired") reflexes. As a result of interaction with its environment, interesting and "intelligent" light-seeking and collision-avoidance behaviors emerge which were not pre-programmed into the robot-or "animat". These behaviors are similar to those described by other workers who have generally used behaviorally-motivated reinforcement learning rather than biologically-based associative learning. The complexity of observed behavior is remarkable given the extreme simplicity of ARBIB's "nervous system", having just 33 neurons. It does not even have a brain! We take this to indicate that great potential exists to explore further "the animat path to AI".
We have developed a new parallel processor system specific for the MC analysis, to dramatically reduce the calculation time. Our parallel processor system is based on ring bus architecture. The RISC micro processor ch...
详细信息
We have developed a new parallel processor system specific for the MC analysis, to dramatically reduce the calculation time. Our parallel processor system is based on ring bus architecture. The RISC micro processor chip, which contains a ring bus interface unit (RBIU), a floating point arithmetic unit (FAU) and so on, was also developed for our system. Speed up ratio compared with a single processor reached to 13.5 at 23 PEs.
A generic set of behaviors is described for devices so that they can be reliably andreadily used as subsystems in an automated systems environment. The automated systemsdiscussed here are constructed of multiple funct...
This paper describes an efficient and simple construction of a universal coding scheme for a noiseless channel with unequal symbol costs, and clarifies its asymptotic performance with respect to stationary sources or ...
详细信息
Examines and details the motivations and design of a constraint specification language (CSL) for user-defined constraints. Many approaches to constraint programming are based on, as well as extended from, the logic pr...
详细信息
Examines and details the motivations and design of a constraint specification language (CSL) for user-defined constraints. Many approaches to constraint programming are based on, as well as extended from, the logic programming paradigm. Some of the better-known constraint logic programming languages and systems are CLP, PROLOG III and CHIP. In these languages, unification in conventional logic programming is replaced by constraint satisfaction. Numerical constraints are usually focused on. The technique of constraint satisfaction is therefore hidden from the user. The motivation for developing CSL is not in adding to the myriad of available constraint programming languages, neither is CSL a complete stand-alone package for solving constraint satisfaction problems (CSPs), though it has a mode that allows it to do so. Its main purpose is simpler: CSL serves to enhance the constraint satisfaction aspect of these languages by providing an expressive algebra for describing current definitions of general CSPs as well as extended versions. The descriptions specified in the CSL syntax are efficiently compiled into data structures that are transparently accessed by algorithms normally only associated with binary CSPs.
Part I (see ibid., pp. 414-421) provided a rigorous definition of the CSL (constraint specification language) algebra as a language to model the general n-ary logical constraint satisfaction problem (LCSP). In this pa...
详细信息
Part I (see ibid., pp. 414-421) provided a rigorous definition of the CSL (constraint specification language) algebra as a language to model the general n-ary logical constraint satisfaction problem (LCSP). In this paper, the majority of our discussions focus on design and implementational issues that arose while building software for compiling the language into executable data structures. The primary objective of the CSL compiler is to efficiently compile a CSL program (for a user-defined LCSP) into a form that can be solved by binary constraint satisfaction problem (CSP) algorithms.
暂无评论