This paper introduces an emotion interaction system for a service robot. The purpose of emotion interaction systems in service robots is to make people feel that the robot is not a mere machine, but reliable living as...
详细信息
This paper introduces an emotion interaction system for a service robot. The purpose of emotion interaction systems in service robots is to make people feel that the robot is not a mere machine, but reliable living assistant in the home. The emotion interaction system is composed of the emotion recognition, generation, and expression systems. A user's emotion is recognized by multi-modality, such as voice, dialogue, and touch. The robot's emotion is generated according to a psychological theory about emotion: OCC (Ortony, Clore, and Collins) model, which focuses on the user's emotional state and the information about environment and the robot itself. The generated emotion is expressed by facial expression, gesture, and the musical sound of the robot. Because the proposed system is composed of all the three components that are necessary for a full emotional interaction cycle, it can be implemented in the real robot system and be tested. Even though the multi- modality in emotion recognition and expression is still in its rudimentary stages, the proposed system is shown to be extremely useful in service robot applications. Furthermore, the proposed framework can be a cornerstone for the design of emotion interaction and generation systems for robots.
A node-labeled rooted tree T (with root r) is an all-or-nothing subtree (called AoN-subtree) of a node-labeled rooted tree V if (1) T is a subtree of the tree rooted at some node u (with the same label as r) of V, (2)...
详细信息
ISBN:
(纸本)9783540496946
A node-labeled rooted tree T (with root r) is an all-or-nothing subtree (called AoN-subtree) of a node-labeled rooted tree V if (1) T is a subtree of the tree rooted at some node u (with the same label as r) of V, (2) for each internal node v of T, all the neighbors of v in V are the neighbors of v in T. Tree T' is then called an AoN-supertree of T. Given a set T = {T-1, T-2,...,Tn} of n node-labeled rooted trees, smallest common AoN-supertree problem seeks the smallest possible node-labeled rooted tree (denoted as LCST) such that every tree T-i in T is an AoN-subtree of LCST. It generalizes the smallest superstring problem and it has applications in glycobiology. We present a polynomial-time greedy algorithm with approximation ratio 6.
In this paper, a direct sequence (OS) time hopping (TH) ultra wideband (UWB) communications system, denoted as DS-TH-UWB is introduced and analyzed. This is a hybrid technique combining the conventional time hoping an...
详细信息
ISBN:
(纸本)9783800729616
In this paper, a direct sequence (OS) time hopping (TH) ultra wideband (UWB) communications system, denoted as DS-TH-UWB is introduced and analyzed. This is a hybrid technique combining the conventional time hoping and direct sequence techniques. The system is analyzed in terms of the signal-to-noise plus interference ratio (SNIR) and bit error rate (BER) performance. In particular, we provide analytical expressions for the SNIR and BER as a function of several system parameters. The performance of the proposed system is compared with other techniques. Furthermore, the impact of diversity on the performance is demonstrated. Numerical results indicate that the BER performance of the DS-TH-UWB system is superior to the other techniques and can be improved significantly with the use of diversity.
Wireless distributed, sensor networks are an increasingly important technology for the deployment of robotics in complex distributed environments. The routing strategy for such networks typically involves multiple obj...
详细信息
ISBN:
(纸本)1424400651
Wireless distributed, sensor networks are an increasingly important technology for the deployment of robotics in complex distributed environments. The routing strategy for such networks typically involves multiple objectives including energy, latency, and channel capacity. This paper describes a multiobjective differential evolution (MODE) algorithm that identifies a set of Pareto optimal routings with respect to these multiple objectives for both single and multipath routing problems. The performance of the algorithm is evaluated using simulation studies, and application of the algorithm to distributed underwater networks incorporating both static and mobile (AUV) sensor nodes is being assessed.
Artificial music composition is one of the ever rising problems of computer science. Genetic Algorithm has been one of the most useful means in our hands to solve optimization problems. By use of precise assumptions a...
详细信息
Artificial music composition is one of the ever rising problems of computer science. Genetic Algorithm has been one of the most useful means in our hands to solve optimization problems. By use of precise assumptions and adequate fitness function it is possible to change the music composing into an optimization problem. This paper proposes a new genetic algorithm for composing music. Considering entropy of the notes distribution as a factor of fitness function and developing mutation and crossover functions based on harmonic rules and trying to keep the melodies intact during these processes would result in a musical piece pleasant to human ears and interesting for human mind. This algorithm does not have the constraints of the previous algorithms. Restraining mutation and crossover functions with a goal of producing melodies based on acceptable melodies composed by humans, this algorithm is not bound to any genre, instrument or melody. The experimental results of this approach show that it is near to the human composing and the results produced from it are more acceptable than the ones produced by its predecessors.
A novel application-specific communications scheme for RF-based indoor wireless localization networks is proposed. In such a system wireless badges, attached to people or objects, report positions to wireless router u...
详细信息
ISBN:
(纸本)0819463043
A novel application-specific communications scheme for RF-based indoor wireless localization networks is proposed. In such a system wireless badges, attached to people or objects, report positions to wireless router units. Badges have very limited communication, energy, and processing capabilities. Routers are responsible for propagating collected badge information hop-by-hop toward one central unit of the system and are significantly less constrained by battery than the badges. Each unit can radiate a special sequence of bits at selected frequencies, so that any router in the wireless neighborhood can sense, store, aggregate and forward Received Signal Strength Indicator (RSSI) information. Once the central unit receives RSSI from routers, it calculates the overall relative position of each unit in the system. This new scheme has been developed based on the Chipcon CC1010 Evaluation Module with limited communication capabilities. The implemented protocol rules allow scalability of numerous system parameters. The feasibility of the proposed protocol is simulated on a typical floor - 2-dimensional topology where routers are deployed in a grid fashion. Results show that assuming normal operation and a maximum of thousand badges the system can periodically report about every five seconds. Different scenarios are compared, and the proposed scheme is demonstrated to meet strict reliability requirements while providing energy-efficient badges and an acceptable level of latency.
This paper presents two steganographic methods for JPEG2000 still images which preserve histograms of discrete wavelet transform (DWT) coefficients. The first one is a histogram quasi-preserving method using quantizat...
详细信息
While snapshots have been commonly used in data storages for backup and data protections, little is known in the open literature how such snapshots impact application performance. This paper presents an implementation...
详细信息
While snapshots have been commonly used in data storages for backup and data protections, little is known in the open literature how such snapshots impact application performance. This paper presents an implementation and performance evaluation of two snapshot techniques: copy-on-write snapshot and redirect-on-write snapshot. Our implementation is carried out at block level on a standard iSCSI target. We carry out quantitative performance evaluations and comparisons of the two snapshot implementations using TPC-C, TPC-W, IoMeter, and PostMark benchmarks. Our measurements reveal many interesting observations regarding the performance characteristics of the two snapshot techniques. Depending on the applications and different I/O workloads, the two snapshot techniques perform quite differently. In general, copy-on-write performs well on read-intensive applications while redirect-on-write performs well on write-intensive applications.
The spatio-temporal behaviors of Infra Red(IR) emission images of the sustain discharges were observed in AC PDP with various coplanar-gaps and auxiliary electrode. When the height of barrier rib was fixed, IR intensi...
详细信息
The spatio-temporal behaviors of Infra Red(IR) emission images of the sustain discharges were observed in AC PDP with various coplanar-gaps and auxiliary electrode. When the height of barrier rib was fixed, IR intensity of the sustain discharges in AC PDP did not increase with increase of coplanar-gap. The IR efficiency of sustain discharges showed the similar behavior with the IR intensity. The IR intensity had its maixmum value when the coplanar-gap was 200 μm and the height of barrier rib was 150 μm. It was also found that the auxiliary electrode in the front plate enhanced IR emission during sustain discharge when the pulse was applied to the auxiliary electrode.
暂无评论