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

HRI evaluation of a healthcare service robot 1

4th International Conference on Social Robotics, ICSR 2012

作者： Kuo, I-Han Jayawardena, Chandimal Broadbent, Elizabeth Stafford, Rebecca Q. MacDonald, Bruce A. Electrical and Computer Engineering University of Auckland New Zealand Department of Computing Unitec Institute of Technology New Zealand Psychological Medicine University of Auckland New Zealand

ISBN: (数字)9783642341038

ISBN: (纸本)9783642341021

This paper presents the evaluation of a healthcare service robot system with vital signs measurement and medication reminders. The design followed the methodology proposed in [7]. This study is a first step to evaluate the methodology by measuring the effectiveness of the interaction patterns designed. The results show that the interaction design patterns could be validated and improved. One can easily reuse these patterns for another service application. This indicates the usefulness of the methodology in: (a) fostering research and development for creating interactive service robots;and (b) helping HRI designers further improve robots' interactivity, for perceiving and expressing interaction/social cues. Overall, the robot system performed robustly for about six hours every day for over two weeks. Videos of the users' approaching behaviours (use cases) were also analysed for future improvements on robot's interactivity to engage potential users in a public space. © 2012 Springer-Verlag.

关键词： Face recognition

来源：评论

学校读者我要写书评

暂无评论

Multi(Uni)cast DCCP for live content distribution with P2P support

Multi(Uni)cast DCCP for live content distribution with P2P s...

引用

2012 IEEE Wireless Communications and Networking Conference, WCNC 2012

作者： De Sales, Leandro Melo De Amorim Silva, Rafael Almeida, Hyggo O. Perkusich, Angelo Computing Institute - IC Maceió Alagoas 57.051-330 Brazil Aeronautics Institute of Technology Department of Electronics Engineering Brazil Center of Electrical Engineering and Computer Science Campina Grande Paraíba 58.429-140 Brazil

ISBN: (纸本)9781467304375

Real time multimedia content transmission on the Internet is essential for the most current applications such as voice over IP, video conference, games and web TV. The most popular Internet transport protocols - TCP and UDP - do not suffice when one needs to transmit data from these applications. As a consequence, IETF has been working in new transport protocols that enhance the quality of these multimedia applications. Among all these protocols, DCCP (RFC 4340) is the most effective for multimedia content transmission on the Internet. However, DCCP is not effective in scenarios with many receivers nodes and one sender node. Therefore, this work proposes the Mult(Uni)cast DCCP, a DCCP variant that enables the multimedia data transmission from one to various nodes and supporting non-reliable traffic congestion control. The MU-DCCP uses either multicast or unicast flows according to the network support and data sharing among receiver nodes. The obtained results show that the usage of the MU-DCCP significantly reduces the data congestion in the network while improving the application scalability in terms of the number of receiver nodes. © 2012 IEEE.

关键词： Traffic congestion

来源：评论

学校读者我要写书评

暂无评论

E2LP: A Unified Embedded engineering Learning Platform

E2LP: A Unified Embedded Engineering Learning Platform

引用

Euromicro Symposium on Digital System Design

作者： Miodrag Temerinac Ivan Kastelan Karolj Skala Branka Medved Rogina Leonhard Reindl Florent Souvestre Margarita Anastassova Roman Szewczyk Jan Piwinski Jorge R. Lopez Benito Enara Artetxe Gonzalez Nikola Teslic Vlado Sruk Moshe Barak Faculty of Technical Sciences University of Novi Sad Novi Sad Serbia Rudjer Boskovic Institute Zagreb Croatia Department of Microsystems Engineering University of Freiburg Freiburg Germany LIST Sensory and Ambient Interfaces Laboratory CEA Gif-sur-Yvette France Industrial Research Institute for Automation and Measurements Warsaw Poland CreativiTIC INNOVA S.L. Logrono Spain RT-RK Institute for Computer Based Systems LLC Novi Sad Serbia Faculty of Electrical Engineering and Computing University of Zagreb Zagreb Croatia Ben-Gurion University of the Negev Beersheba Israel

The main idea behind this project is to provide a unified platform which will cover a complete process for embedded systems learning. A modular approach is considered for skills practice through supporting individualization in learning. This platform shall facilitate a novel development of universal approach in creative learning environment and knowledge management that encourage use of ICT. New learning model is challenging the education of engineers in embedded systems design through real-time experiments that stimulate curiosity with ultimate goal to support students to understand and construct their personal conceptual knowledge based on experiments. In addition to the technological approach, the use of cognitive theories on how people learn will help students to achieve a stronger and smarter adaptation of the subject. Applied methodology will be evaluated from the scientific point of view in parallel with the implementation in order to feedback results to the R&D.

关键词： Laboratories Embedded systems computers Educational institutions Field programmable gate arrays Taxonomy

来源：评论

学校读者我要写书评

暂无评论

Recovery of sparse probability measures via convex programming

Recovery of sparse probability measures via convex programmi...

引用

26th Annual Conference on Neural Information Processing Systems 2012, NIPS 2012

作者： Pilanci, Mert El Ghaoui, Laurent Chandrasekaran, Venkat Electrical Engineering and Computer Science University of California Berkeley Berkeley CA 94720 United States Department of Computing and Mathematical Sciences California Institute of Technology Pasadena CA 91125 United States

ISBN: (纸本)9781627480031

We consider the problem of cardinality penalized optimization of a convex function over the probability simplex with additional convex constraints. The classical 1 regularizer fails to promote sparsity on the probability simplex since 1 norm on the probability simplex is trivially constant. We propose a direct relaxation of the minimum cardinality problem and show that it can be efficiently solved using convex programming. As a first application we consider recovering a sparse probability measure given moment constraints, in which our formulation becomes linear programming, hence can be solved very efficiently. A sufficient condition for exact recovery of the minimum cardinality solution is derived for arbitrary affine constraints. We then develop a penalized version for the noisy setting which can be solved using second order cone programs. The proposed method outperforms known rescaling heuristics based on 1 norm. As a second application we consider convex clustering using a sparse Gaussian mixture and compare our results with the well known soft k-means algorithm.

关键词： Probability

来源：评论

学校读者我要写书评

暂无评论

Preface

引用

Journal of computer Science & Technology 2013年第3期28卷 401-402页

作者： Yi-Qing Zhou Yang Yang Shao-Dan Ma Institute of Computing Technology Chinese Academy of Sciences Shanghai Research Center for Wireless Communications Shanghai Institute of Microsystem and Information Technology Chinese Academy of Sciences Department of Electrical and Computer Engineering University of Macao

With the rapid development of computing technologies and broadband wireless communications, mobile computing and networking has been a hot research area recently. This special section focuses on the most recent advances in the frontier research of mobile computing and networking, which is the output of the cooperation between JCST and CHINACOM2012. CHINACOM2012 is the 7th International Conference on Communications and Networking in China, which was held successfully in Kunming, China in August 2012.

关键词： MIMO GPP Preface LTE

来源：评论

学校读者我要写书评

暂无评论

Balls into Bins via Local Search 13

Balls into Bins via Local Search

引用

Symposium on Discrete Algorithms

作者： Paul Bogdan Thomas Sauerwald Alexandre Stauffer He Sun Department of Electrical and Computer Engineering Carnegie Mellon University Pittsburgh PA USA Max Planck Institute for Informatics Saarbrücken Germany and Cluster of Excellence "Multimodal Computing and Interaction" Universit?t des Saarlandes Saarbrücken Germany. Part of this work was done while visiting Microsoft Research Redmond Microsoft Research Redmond WA USA. Part of this work was done while visiting Max Planck Institute for Informatics Saarbrücken Germany. Max Planck Institute for Informatics Saarbrücken Germany and Institute of Modern Mathematics and Physics Fudan University Shanghai China.

ISBN: (纸本)9781627484855

We propose a natural process for allocating n balls into n bins that are organized as the vertices of an undirected graph G. Each ball first chooses a vertex u in G uniformly at random. Then the ball performs a local search in G starting from u until it reaches a vertex with local minimum load, where the ball is finally placed on. In our main result, we prove that this process yields a maximum load of only Θ (log log n) on expander graphs. In addition, we show that for d-dimensional grids the maximum load is Θ((log n/log log n)~(1/d+1)). Finally, for almost regular graphs with minimum degree Θ (logn), we prove that the maximum load is constant and also reveal a fundamental difference between random and arbitrary tie-breaking rules.

关键词： Balls into a maximum load fundamental difference Ball Device Component maximum loads Bins vertex head natural processes logs logarithm (log) undirected graph corners

来源：评论

学校读者我要写书评

暂无评论

Speeding up optimum-path forest training by path-cost propagation

Speeding up optimum-path forest training by path-cost propag...

引用

21st International Conference on Pattern Recognition, ICPR 2012

作者： Iwashita, Adriana S. Papa, Joao P. Falcao, Alexandre X. Lotufo, Roberto A. De Araujo Oliveira, Victor M. De Albuquerque, Victor H. Costa Tavares, Joao Manuel R. S. São Paulo State University Department of Computing Bauru Brazil University of Campinas Institute of Computing Campinas Brazil University of Campinas School of Electrical and Computer Engineering Campinas Brazil Center of Technological Sciences University of Fortaleza Fortaleza Brazil Faculty of Engineering University of Porto Porto Portugal

ISBN: (纸本)9784990644109

In this paper we present an optimization of the Optimum-Path Forest classifier training procedure, which is based on a theoretical relationship between minimum spanning forest and optimum-path forest for a specific path-cost function. Experiments on public datasets have shown that the proposed approach can obtain similar accuracy to the traditional one but with faster data training. © 2012 ICPR Org Committee.

关键词： Pattern recognition

来源：评论

学校读者我要写书评

暂无评论

Design issues in ZigBee-based sensor network for healthcare applications

Design issues in ZigBee-based sensor network for healthcare ...

引用

2012 9th IEEE International Conference on Networking, Sensing and Control, ICNSC 2012

作者： Choi, Jin Soo Zhou, MengChu Department of Electrical and Computer Engineering New Jersey Institute of Technology Newark NJ 07102 United States Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai 200092 China

ISBN: (纸本)9781467303880

IEEE 802.15.4/ZigBee sensor networks support small power consumption and node expansion compared to other network standards for WSN. Body sensor networks (BSN) require a number of sensors for sensing medical information from human body, and low power consumption to monitor a patient's status for a long time. However, ZigBee has limited bandwidth and is thus hard to support real time data transmission because of the adoption of CSMA-CA as its medium access control (MAC) protocol. In this paper, we will analyze the reasonable number of nodes, size of payload and packet interval for best QoS for such network. It is found that an appropriate MAC parameters setting can improve the QoS compared to the default setting in IEEE 802.15.4 specification. The effective data rate, average end-to-end delay and packet delivery ratio are found via simulation for various network settings. The results are useful for the construction of ZigBee networks for patient monitoring and care. © 2012 IEEE.

关键词： Medium access control

来源：评论

学校读者我要写书评

暂无评论

Parallel Approximation of Min-max Problems with Applications to Classical and quantum Zero-Sum Games

Parallel Approximation of Min-max Problems with Applications...

引用

Annual IEEE Conference on Computational Complexity

作者： Gus Gutoski Xiaodi Wu Institute for Quantum Computing and School of Computer Science University of Waterloo Waterloo ONT Canada Department of Electrical Engineering and Computer Science University of Michigan Ann Arbor MI USA

This paper presents an efficient parallel algorithm for a new class of min-max problems based on the matrix multiplicative weights update method. Our algorithm can be used to find near-optimal strategies for competitive two-player classical or quantum games in which a referee exchanges any number of messages with one player followed by any number of additional messages with the other. This algorithm considerably extends the class of games which admit parallel solutions, demonstrating for the first time the existence of a parallel algorithm for a game in which one player reacts adaptively to the other. As a consequence, we prove that several competing-provers complexity classes collapse to PSPACE such as QRG(2), SQG and two new classes called DIP and DQIP. A special case of our result is a parallel approximation scheme for a new class of semi definite programs whose feasible region consists of lists of semi definite matrices that satisfy a ``transcript-like'' consistency condition. Applied to this special case, our algorithm yields a direct polynomial-space simulation of multi-message quantum interactive proofs resulting in a first-principles proof of QIP=PSPACE.

关键词： Registers Games Parallel algorithms Bismuth Complexity theory Approximation methods Game theory

来源：评论

学校读者我要写书评

暂无评论

Guest editorial integrated circuit and system security

引用

IEEE Transactions on Information Forensics and Security 2012年第1 PART 1期7卷 1-2页

作者： Potkonjak, Miodrag Karri, Ramesh Verbauwhede, Ingrid Itoh, Kouichi Computer Science Department UCLA Los Angeles CA 90095-1596 United States Department of Electrical and Computer Engineering Polytechnic Institute of New York University Brooklyn NY 11201 United States COSIC/ESAT K.U. Leuven Heverlee B-3001 Belgium Secure Computing Laboratories Fujitsu Laboratories Ltd. Kawasaki Kanagawa 211-8588 Japan

The Guest Editors' primary objective in organizing this Special Issue was to provide additional impetus for research in hardware security. Currently, the field is heavily dominated by testing, CAD, and IC researchers. They hope that researchers from other security fields will find the problems and the proposed solutions published here both interesting and important. Ten Special Issue papers are represented in this collection.

关键词： Special issues and sections Integrated circuits Hardware

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：