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

IEEE International Conference on Image Processing

作者： T. Rehr N. Theißing A. Bannat J. Gast D. Arsią F. Wallhoff G. Rigoll C. Mayer B. Radig Department of Electrical Engineering and Information Technologies Technische Universität München Munich Germany Chair for Image Understanding and Knowledge-Based Systems Technische Universität München Munich Germany

In everyday live head gestures such as head shaking or nodding and hand gestures like pointing gestures form important aspects of human-human interaction. Therefore, recent research considers integrating these intuitive communication cues into technical systems for improving and easing human-computer interaction. In this paper we present a vision-based system to recognize head gestures (nodding, shaking, neutral) and dynamic hand gestures (hand moving right/left/up/down, fist moving right/left) in real-time. The gestural input delivers a communication modality for a human-robot interaction scenario situated in an assistive household environment. The use of fast low-level image-feature extraction methods contributes to the real-time capability of the system and advanced classification approaches relying on Graphical Models provide high robustness. Graphical Models offer the possibility to group the input features in several sub-nodes resulting in a better classification than obtained via a traditional Hidden Markov Model classification. The applied grouping can regard interdependencies owing to, either physical constraints (like for the head gestures), or interrelations between shape and motion (like for the hand gestures).

关键词： Hidden Markov models Head Real time systems Feature extraction Graphical models Shape Gesture recognition

来源：评论

学校读者我要写书评

暂无评论

Field test of KOMPSAT-5 Calibration Equipment

Field test of KOMPSAT-5 Calibration Equipment

引用

IEEE International Symposium on Geoscience and Remote Sensing (IGARSS)

作者： Jaemin Shin Kwangjae Lee JinHee Kim Systems Engineering & Integration Department Korea Aerospace Research Institute Daejeon South Korea Satellite Data Application Department Satellite Information Research Institute Korea Aerospace Research Institute Daejeon South Korea

Korea Aerospace Research Institute (KARI) is developing the KOMPSAT-5 (K-5, the fifth of KOrea MultiPurpose SATellite) system of which primary payload is X-band Synthetic Aperture Radar (SAR). K-5 CALVAL (Calibration & Validation) activities must be important tasks for successful operation. The field test of K-5 Calibration Equipments can support a direction of CALVAL activities during not only IOT (In-Orbit Test) phase but also normal operation phase.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Global Top-k Aggregate Queries Based on X-tuple in Uncertain database

Global Top-k Aggregate Queries Based on X-tuple in Uncertain...

引用

International Conference on Advanced information Networking and Applications Workshops (AINAW)

作者： Dexi Liu Changxuan Wan Naixue Xiong Jong Hyuk Park Sang-Soo Yeoe School of Information Technology Jiangxi Key Laboratory of Data and Knowledge Engineering Jiangxi University of Finance and Economics Nanchang China Department of Computer Science Georgia State University Atlanta GA USA Department of Computer Science and Engineering Seoul National University of Technology Seoul South Korea Division of Computer Engineering Mokwon University Daejeon South Korea

ISBN: (纸本)9781424467013;9780769540191

A Top-k aggregate query, which is a powerful technique when dealing with large quantity of data, ranks groups of tuples by their aggregate values and returns k groups with the highest aggregate values. However, compared to Top-k in traditional databases, queries over uncertain database are more complicated because of the existence of exponential possible worlds. As a powerful semantic of Top-k in uncertain database, Global Top-k return k highest-ranked tuples according to their probabilities of being in the Top-k answers in possible worlds. We propose a x-tuple based method to process Global Top-k aggregate queries in uncertain database. Our method has two levels, group state generation and G-x-Top-k query processing. In the former level, group states, which satisfy the properties of x-tuple, are generated one after the other according to their aggregate values, while in the latter level, dynamic programming based Global x-tuple Top-k query processing are employed to return the answers. Comprehensive experiments on different data sets demonstrate the effectiveness of the proposed solutions.

关键词： Aggregates databases knowledge engineering Query processing Computer networks Power engineering computing data engineering Power engineering and energy Dynamic programming Radar imaging

来源：评论

学校读者我要写书评

暂无评论

Two Novel Semantics of Top-k Queries Processing in Uncertain database

Two Novel Semantics of Top-k Queries Processing in Uncertain...

引用

International Conference on Computer and information Technology (CIT)

作者： Dexi Liu Changxuan Wan N. Xiong Laurence T. Yang Lei Chen School of Information Technology Jiangxi Key Laboratory of Data and Knowledge Engineering Jiangxi University of Finance and Economics Nanchang China Department of Computer Science Georgia State University Atlanta GA USA Department of Computer Science Saint Francis Xavier University Antigonish NS Canada Department of Computer Science HK University of Science and Technology Hong Kong China

Top-k query is a powerful technique in uncertain databases because of the existence of exponential possible worlds, and it is necessary to combine score and confidence of tuples to derive top k answers. Different semantics, the combination methods of score and confidence, lead to different results. U-kRanks and Global Top-k are two semantics of Top-k queries in uncertain database, which consider every alternative in x-tuple as single one and return the tuple which has the highest probability appearing at top k or a given rank. However, no matter which alternative (tuple) of an x-tuple appears in a possible world, it undoubtedly believes that this x-tuple appears in the same possible world accordingly. Thus, instead of ranking every individual tuple, we define two novel Top-k queries semantics in uncertain database, Uncertain x-kRanks queries (U-x-kRanks) and Global x-Top-k queries (G-x-Top-k), which return k entities according to the score and the confidence of alternatives in x-tuple, respectively. In order to reduce the search space, we present an efficient algorithm to process U-x-kRanks queries and G-x-Top-k queries. Comprehensive experiments on different data sets demonstrate the effectiveness of the proposed solutions.

关键词： Semantics Upper bound Heuristic algorithms Query processing Equations Artificial neural networks

来源：评论

学校读者我要写书评

暂无评论

Multiple Parallel Vision-Based Recognition in a Real-Time Framework for Human-Robot-Interaction Scenarios

Multiple Parallel Vision-Based Recognition in a Real-Time Fr...

引用

International Conference on Advances in Computer-Human Interaction

作者： Tobias Rehrl Alexander Bannat Jürgen Gast Frank Wallhoff Gerhard Rigoll Christoph Mayer Zadid Riaz Bernd Radig Stefan Sosnowski Kolja Kühnlenz Human-Machine Communication Technische Universität München Munich Germany Chair for Image Understanding and Knowledge-Based Systems Technische Universität München Munich Germany Department of Electrical Engineering and Information Technologies Technische Universität München Munich Germany

ISBN: (纸本)9781424456932;9780769539577

Every day human communication relies on a large number of different communication mechanisms like spoken language, facial expressions, body pose and gestures, allowing humans to pass large amounts of information in short time. In contrast, traditional human-machine communication is often unintuitive and requires specifically trained personal. In this paper, we present a real-time capable framework that recognizes traditional visual human communication signals in order to establish a more intuitive human-machine interaction. Humans rely on the interaction partner's face for identification, which helps them to adapt to the interaction partner and utilize context information. Head gestures (head nodding and head shaking) are a convenient way to show agreement or disagreement. Facial expressions give evidence about the interaction partners' emotional state and hand gestures are a fast way of passing simple commands. The recognition of all interaction queues is performed in parallel, enabled by a shared memory implementation.

关键词： Face recognition Man machine systems Hidden Markov models Image recognition Magnetic heads data mining Human robot interaction Active appearance model Computer vision Concurrent computing

来源：评论

学校读者我要写书评

暂无评论

Approximation algorithm for constructing data aggregation trees for wireless sensor networks

引用

中国高等学校学术文摘·计算机科学 2009年第4期3卷 524-534页

作者： Deying LI Jiannong CAO Qinghua ZHU Key Laboratory of Data Engineering and Knowledge Engineering School of InformationRenmin University of ChinaBeijing 100872China Internet and Mobile Computing Lab Department of ComputingHong Kong Polytechnic UniversityHong KongChina

This paper considers the problem of constructing data aggregation trees in wireless sensor networks (WSNs)for a group of sensor nodes to send collected information to a single sink *** data aggregation tree contains the sink node,all the source nodes,and some other non-source *** goal of constructing such a data aggregation tree is to minimize the number of non-source nodes to be included in the tree so as to save *** prove that the data aggregation tree problem is NP-hard and then propose an approximation algorithm with a performance ratio of four and a greedy *** also give a distributed version of the approximation *** simulations are performed to study the performance of the proposed *** results show that the proposed algorithms can find a tree of a good approximation to the optimal tree and has a high degree of scalability.

关键词： WSNs data aggregation tree approximation algorithm distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

Feature-Oriented Nonfunctional Requirement Analysis for Software Product Line

引用

Journal of Computer Science & Technology 2009年第2期24卷 319-338页

作者：彭鑫 Seok-Won Lee 赵文耘 School of Computer Science Fudan University Knowledge-Intensive Software Engineering Research Group Department of Software and Information Systems College of Computing and Informatics University of North Carolina at Charlotte

Domain analysis in software product line （SPL） development provides a basis for core assets design and imple- mentation by a systematic and comprehensive commonality/variability analysis. In feature-oriented SPL methods, products of the domain analysis are domain feature models and corresponding feature decision models to facilitate application-oriented customization. As in requirement analysis for a single system, the domain analysis in the SPL development should con- sider both flmctional and nonfunctional domain requirements. However, the nonfunctional requirements （NFRs） are often neglected in the existing domain analysis methods. In this paper, we propose a context-based method of the NFR analysis for the SPL development. In the method, NFRs are materialized by connecting nonfunctional goals with real-world context, thus NFR elicitation and variability analysis can be performed by context analysis for the whole domain with the assistance of NFR templates and NFR graphs. After the variability analysis, our method integrates both functional and nonfunc- tional perspectives by incorporating the nonfunctional goals and operationalizations into an initial functional feature model. NFR-related constraints are also elicited and integrated. Finally, a decision model with both functional and nonfunctional perspectives is constructed to facilitate application-oriented feature model customization. A computer-aided grading system （CAGS） product line is employed to demonstrate the method throughout the paper.

关键词： software product line nonfunctional requirement domain analysis feature-oriented method variability analysis

来源：评论

学校读者我要写书评

暂无评论

Reports of the AAAI 2010 conference workshops

Reports of the AAAI 2010 conference workshops

引用

作者： Aha, David W. Boddy, Mark Bulitko, Vadim D'Avila Garcez, Artur S. Doshi, Prashant Edelkamp, Stefan Geib, Christopher Gmytrasiewicz, Piotr Goldman, Robert P. Halevy, Alon Hitzler, Pascal Isbell, Charles Josyula, Darsana Kaelbling, Leslie Pack Kersting, Kristian Kunda, Maithilee Lamb, Luis C. Marthi, Bhaskara McGreggor, Keith Mihalkova, Lilyana Nastase, Vivi Natarajan, Sriraam Provan, Gregory Raja, Anita Ram, Ashwin Riedl, Mark Russell, Stuart Sabharwal, Ashish Smaus, Jan-Georg Sukthankar, Gita Tuyls, Karl Van Der Meyden, Ron Adaptive Systems Section Naval Research Laboratory Washington DC United States Adventium Labs. Minneapolis MN United States Department of Computer Science University of Alberta Canada City University London United Kingdom University of Georgia United States University of Bremen Germany School of Informatics University of Edinburgh United Kingdom University of Illinois Chicago United States Smart Information Flow Technologies LLC Minneapolis MN United States Structured Data Group Google Research United States Department of Computer Science Wright State University Dayton OH United States School of Interactive Computing Georgia Institute of Technology Atlanta GA United States Department of Computer Science Bowie State University United States Department of Computer Science and Engineering Massachusetts Institute of Technology United States Statistical Relational Mining Group Fraunhofer IAIS Germany Department of Computer Science Federal University of Rio Grande Do sul Brazil Willow Garage Inc. CA United States Computer Science Department University of Maryland College Park United States Heidelberg Institute for Theoretical Studies Heidelberg Germany Department of Computer Science University of Wisconsin Madison United States University College Cork Ireland Cork Complex Systems Lab. Ireland Department of Software and Information Systems University of North Carolina Charlotte United States Department of Computer Science and Engineering University of California Berkeley United States Department of Computer Science Cornell University United States Institute for Computational Sustainability United States University of Freiburg Germany School of Electrical Engineering and Computer Science University of Central Florida United States Maastricht University Netherlands University of New South Wales NICTA Australia

The AAAI-10 workshop program was held on July 11-12, 2010, at the Westin Peachtree Plaza in Atlanta, Georgia. The workshop program included 13 workshops covering a wide range of topics in artificial intelligence. There were several presentations on particular formalisms for combining the levels of planning from the perspectives of classical planning, motion planning, POMDPs, search-based planning, and temporal logic-based constraints. Henry Lieberman from Massachusetts Institute of Technology Media Laboratory presented work developing a platform for knowledge acquisition and usage from expert users, built upon experience with eliciting information from nonexperts in a collaborative manner. The objective of the AAAI Workshop on Goal-Directed Autonomy (GDA) was to encourage discussion and novel contributions on intelligent agents that can self-select their goals. Jeremy Baxter from QinetiQ focused on user interaction, while Nick Hawes described a goal-directed reasoning framework for controlling a mobile robot.

关键词： Motion planning

来源：评论

学校读者我要写书评

暂无评论

Addressing sustainability for research initiatives in mobile learning through scalability

Addressing sustainability for research initiatives in mobile...

引用

8th IASTED International Conference on Web-based Education, WBE 2009

作者： Wingkvist, Anna Ericsson, Morgan Center for Learning and Knowledge Technologies Department of Information Systems School of Mathematics and System Engineering Sweden

ISBN: (纸本)9780889867895

Understanding research initiatives in the field of mobile learning involves dealing with complexity. It is important to gather knowledge on how to nurse these attempts. To develop ideas and reach wide deployment of novel mobile learning is of great value. In this paper there is a discussion of the factors that describe attributes of mobile learning research initiatives and an investigation of whether these are sustainable or not, and what this means. Sustainability for mobile learning initiatives is essential for the wide acceptance from both public and academia. The paper also addresses scalability of mobile learning research initiatives. Scalability is a term used to describe how well something can grow to suit an increasing complexity, and is addressed as a possibility to reflect on good ideas. Scalability is important in order to reach sustainability. Finally, this paper introduces a model that illustrates the evolutionary life cycle of a mobile learning research initiative. The model presents four evolution stages and these are: Idea, Experiment, Project, and Release.

关键词： Scalability

来源：评论

学校读者我要写书评

暂无评论

An Adaptive Method for the Efficient Similarity Calculation

An Adaptive Method for the Efficient Similarity Calculation

引用

14th International Conference on database systems for Advanced Applications

作者： Cai, Yuanzhe Liu, Hongyan He, Jun Du, Xiaoyong Jia, Xu Key Labs of Data Engineering and Knowledge Engineering MOE China School of Information Renmin University of China China Department of Management Science and Engineering Tsinghua University China

ISBN: (纸本)9783642008863

SimRank is a well-known algorithm for similarity calculation based on object-to-object relationship. However, it suffers from high computation cost. Inthis paper, we find that the convergence behavior of different object pairs is different when we use SimRank to compute the similarity of objects. Many similarity scores converge fast, while others need more time before convergence. Based on this observation, we propose an adaptive method called Adaptive-SimRank to speed up similarity calculation. Using this method, we don't need to recalculate those converged pairs' similarity. The experiments conducted on web datasets and synthetic dataset show that our new method can reduce the running time by nearly 35%.

关键词： Similarity Calculation Linkage Mining

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：