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

1st ACM International Workshop on Multimedia Analysis for Ecological Data, MAED 2012, Held within ACM Multimedia 2012

作者： Cannavò, Flavio Nunnari, Giuseppe Kale, Izzet Tek, F. Boray Istituto Nazionale di Geofisica e Vulcanologia Piazza Roma 2 95123 Catania Italy Dipartimento di Ingegneria Elettrica Elettronica e Informatica Università di Catania Viale A. Doria 6 95125 Catania Italy Department of Electronic Systems University of Westminster 115 New Cavendish Street London W1W 6UW United Kingdom Department of Computer Science and Engineering Isik University Sile Istanbul 34980 Turkey

ISBN: (纸本)9781450315883

This paper describes a visual processing technique for automatic frog (Xenopus Laevis sp.) localization and identification. The problem of frog identification is to process and classify an unknown frog image to determine the identity which is recorded previously on an image database. The frog skin pattern (i.e. texture) provides a unique feature for identification. Hence, the study investigates three different kind of features (i.e. Gabor filters, granulometry, threshold set compactness) to extract texture information. The classifier is built on nearest neighbor principle;it assigns the query feature to the database feature which has the minimum distance. Hence, the study investigates different distance measures and compares their performance. The detailed results show that the most successful feature and distance measure is granulometry and weighted L1 norm for the frog identification using skin texture features. Copyright 2012 ACM.

关键词： Gabor filters

来源：评论

学校读者我要写书评

暂无评论

Serendipitous Exploration of Large-scale Product Catalogs

Serendipitous Exploration of Large-scale Product Catalogs

引用

IEEE International Conference on E-Commerce Technology Workshops

作者： Marc von Wyl Birgit Hofreiter Stéphane Marchand-Maillet Department of Computer Science University of Geneva Carouge Switzerland Institute for Software Technology and Interactive Systems e-Commerce Group Informatics Innovation Center (i2c) Vienna University of Technology Vienna Austria

Online shopping has developed to a stage where catalogs have become very large and diverse. Thus, it is a challenge to present relevant items to potential customers within a very few interactions. This is even more so when users have no defined shopping objectives but operate in an opportunistic mindset. This problem is often tackled by recommender systems. However, these systems rely on consistent user interaction patterns to predict items of interest. In contrast, we propose to adapt the classical information retrieval (IR) paradigm for the purpose of accessing catalog items in a context of un-predictable user interaction. Accordingly, we present a novel information access strategy based on the notion of interest rather than relevance. We detail the design of a scalable browsing system including learning capabilities joint with a limited-memory model. Our approach enables locating interesting items within a few steps while not requiring good quality descriptions. Our system allows customer to seamlessly change browsing objectives without having to start explicitly a new session. An evaluation of our approach based on both artificial and real-life datasets demonstrates its efficiency in learning and adaptation.

关键词： Adaptation models Catalogs Navigation History Context Measurement Recommender systems

来源：评论

学校读者我要写书评

暂无评论

Should empathic social robots have interiority? 1

引用

4th International Conference on Social Robotics, ICSR 2012

作者： Damiano, Luisa Dumouchel, Paul Lehmann, Hagen Epistemology of the Sciences of the Artificial Research Group Department of Human and Social Sciences University of Bergamo P.le S.Agostino 2 Bergamo 24129 Italy Graduate School of Core Ethics and Frontier Sciences Ritsumeikan University 56-1 Kitamachi Toji-in Kita-ku Kyoto 603-8577 Japan Adaptive Systems Research Group School of Computer Science and STCA University of Hertfordshire College Lane Hatfield United Kingdom

ISBN: (数字)9783642341038

ISBN: (纸本)9783642341021

In this article we discuss whether robots need "interiority" in order to competently participate in emotional and empathic dynamics with human partners. We draw on original research on emotions, mind, neurophysiological mechanisms of social interaction and HRI to contest the common sense thesis according to which robots without "interiority" can only simulate emotions and empathy, to the extent that the affective (emotional and empathic) relationships between them and humans would not be authentic. The main thesis of our article is that empathic social robots do not need "interiority", but the ability of dynamical coordination with their social partners and the surrounding environment(s), since this ability (and not "interiority") is at the basis of human cognitive and affective (emotional and empathic) activity. © 2012 Springer-Verlag.

关键词： Autonomous agents

来源：评论

学校读者我要写书评

暂无评论

Comparative analysis of dynamic task mapping heuristics in heterogeneous NoC-based MPSoCs

Comparative analysis of dynamic task mapping heuristics in h...

引用

IEEE International Symposium on System-on-Chip

作者： Leandro Möller Leandro Soares Indrusiak Luciano Ost Fernando Moraes Manfred Glesner Institute of Microelectronic Systems Darmstadt University of Technology Darmstadt Germany Department of Computer Science University of York UK LIRMM University of Montpellier 2 France Faculty of Informatics Catholic University of Rio Grande do Sul Porto Alegre Brazil

Dynamic mapping heuristics can cope with dynamic application scenarios by allocating tasks to cores of an MPSoC during runtime. In this paper, we compare eight heuristics in terms of the response time of application tasks - that is, the time between the issuing of a task and the time when it completes executing and communicating. By taking into account the task execution, communication and waiting times, we could better evaluate the quality of the different heuristics and show that there is room for improvement when it comes to heterogeneous platforms under high utilization.

关键词： Heuristic algorithms Artificial neural networks Time factors IP networks Computational modeling Clustering algorithms Timing

来源：评论

学校读者我要写书评

暂无评论

ESTIMATION OF FLUX BETWEEN INTERACTING NODES ON HUGE INTER-FIRM NETWORKS

引用

International Journal of Modern Physics: Conference Series 2012年第16期ijmpcs卷 93-104页

作者： KOUTAROU TAMURA WATARU MIURA MISAKO TAKAYASU HIDEKI TAKAYASU SATOSHI KITAJIMA HAYATO GOTO Department of Computational Intelligence and Systems Science Interdisciplinary Graduate School of Science and Engineering Tokyo Institute of Technology 4229 Nagatsuta-cho Midori-ku Yokohama 226-8502 Japan Sony Computer Science Laboratories 3-14-13 Higashi-Gotanda Shinagawa-ku Tokyo141-0022 Japan SPECIA Team Industrial Survey Department TEIKOKU DATABANK LTD. 2-5-20 Minami Aoyama Minato-ku Tokyo 107-8680 Japan

We analyze Japanese inter-firm network data showing scale-free properties as an example of a real complex network. The data contains information on money flow (annual transaction volume) between about 7000 pairs of firms. We focus on this money-flow data and investigate the correlation between various quantities such as sales or link numbers. We find that the flux from a buyer to a supplier is given by the product of the fractional powers of both sales with different exponents. This result indicates that the principle of detailed balance does not hold in the real transport of money; therefore, random walk type transport models such as PageRank are not suitable.

关键词： Complex network non-linear interaction scale free

来源：评论

学校读者我要写书评

暂无评论

Lecture Notes in computer science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics): Preface

Lecture Notes in Computer Science (including subseries Lectu...

引用

Lecture Notes in computer science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 2012年 7129 LNCS卷 VI页

作者： Bononi, Luciano Datta, Ajoy K. Devismes, Stéphane Misra, Archan University of Bologna Department of Computer Science Mura Anteo Zamboni 7 40127 Bologna Italy University of Nevada School of Computer Science Las Vegas NV 89154-4019 United States Université Joseph Fourier de Grenoble Laboratoire VERIMAG Centre Equation 2 Avenue de Vignate 38610 Gières France Singapore Management University School of Information Systems 80 Stamford Road Singapore 178902 Singapore

来源：评论

学校读者我要写书评

暂无评论

A New Multiword Expression Metric and Its Applications

引用

Journal of computer science & Technology 2011年第1期26卷 3-13页

作者：布凡朱小燕李明 State Key Laboratory of Intelligent Technology and Systems Tsinghua National Laboratory for Information Science and TechnologyDepartment of Computer Science and TechnologyTsinghua University David R.Cheriton School of Computer Science University of WaterlooWaterloo N2L 3G1Canada

Multiword Expressions （MWEs） appear frequently and ungrammatically in natural languages. Identifying MWEs in free texts is a very challenging problem. This paper proposes a knowledge-free, unsupervised, and languageindependent Multiword Expression Distance （MED）. The new metric is derived from an accepted physical principle, measures the distance from an n-gram to its semantics, and outperforms other state-of-the-art methods on MWEs in two applications： question answering and named entity extraction.

关键词： multiword expressions information distance question answering named entity extraction

来源：评论

学校读者我要写书评

暂无评论

Evading Quantum Mechanics: Engineering a Classical Subsystem within a Quantum Environment

引用

Physical Review X 2012年第3期2卷 031016-031016页

作者： Mankei Tsang Carlton M. Caves Department of Electrical and Computer Engineering National University of Singapore 4 Engineering Drive 3 Singapore 117583 Department of Physics National University of Singapore 2 Science Drive 3 Singapore 117551 Center for Quantum Information and Control University of New Mexico MSC07-4220 Albuquerque New Mexico 87131-0001 USA Centre for Engineered Quantum Systems School of Mathematics and Physics The University of Queensland St. Lucia Brisbane 4072 Australia

Quantum mechanics is potentially advantageous for certain information-processing tasks, but its probabilistic nature and requirement of measurement backaction often limit the precision of conventional classical information-processing devices, such as sensors and atomic clocks. Here we show that, by engineering the dynamics of coupled quantum systems, it is possible to construct a subsystem that evades the measurement backaction of quantum mechanics, at all times of interest, and obeys any classical dynamics, linear or nonlinear, that we choose. We call such a system a quantum-mechanics-free subsystem (QMFS). All of the observables of a QMFS are quantum-nondemolition (QND) observables; moreover, they are dynamical QND observables, thus demolishing the widely held belief that QND observables are constants of motion. QMFSs point to a new strategy for designing classical information-processing devices in regimes where quantum noise is detrimental, unifying previous approaches that employ QND observables, backaction evasion, and quantum noise cancellation. Potential applications include gravitational-wave detection, optomechanical-force sensing, atomic magnetometry, and classical computing. Demonstrations of dynamical QMFSs include the generation of broadband squeezed light for use in interferometric gravitational-wave detection, experiments using entangled atomic-spin ensembles, and implementations of the quantum Toffoli gate.

关键词： Quantum noise

来源：评论

学校读者我要写书评

暂无评论

Lecture Notes in computer science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics): Preface

Lecture Notes in Computer Science (including subseries Lectu...

引用

Lecture Notes in computer science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 2012年 7191 LNCS卷 V-VII页

作者： Cichocki, Andrzej Theis, Fabian Yeredor, Arie Zibulevsky, Michael Helmholtz Center Munich Institute of Bioinformatics and Systems Biology Ingolstädter Landstr. 1 85764 Neuherberg Germany Riken Brain Science Institute Laboratory for Advanced Brain Signal Processing 2-1 Hirosawa Wako-shi 351-0198 Saitama Japan Tel-Aviv University School of Electrical Engineering Tel-Aviv 69978 Israel Technion - Israel Institute of Technology Department of Computer Science Haifa 32000 Israel

来源：评论

学校读者我要写书评

暂无评论

Accurate Evaluation of a Distance Function for Optimization-based Motion Planning

Accurate Evaluation of a Distance Function for Optimization-...

引用

IEEE/RSJ International Conference on Intelligent Robotics and systems

作者： Youngeun Lee Sébastien Lengagne Abderrahmane Kheddar Young J. Kim Department of Computer Science and Engineering at Ewha Womans University in Seoul Korea Karlsruhe Institute of Technology Institute for Anthropomatics Humanoids and Intelligence Systems Lab Adenauerring 2 76131 Karlsruhe Germany CNRS-AIST Joint Robotics Laboratory (JRL) UMI3218/CRT Tsukuba Japan and also with the CNRS-UM2 LIRMM Interactive Digital Human group Montpellier France.

ISBN: (纸本)9781467317375

We propose three novel methods to evaluate a distance function for robotic motion planning based on semi-infinite programming (SIP) framework;these methods include golden section search (GSS), conservative advancement (CA) and a hybrid of GSS and CA. The distance function can have a positive and a negative value, each of which corresponds to the Euclidean distance and penetration depth, respectively. In our approach, each robot's link is approximated and bounded by a capsule shape, and the distance between some selected link pairs is continuously evaluated along the joint's trajectory, provided by the SIP solver, and the global minimum distance is found. This distance is fed into the SIP solver, which subsequently suggests a new trajectory. This process is iterated until no negative distance is found anywhere in the links of the robot. We have implemented the three distance evaluation methods, and experimentally validated that the proposed methods effectively and accurately find the global minimum distances to generate a self-collision-free motion for the HRP-2 humanoid robot. Moreover, we demonstrate that the hybrid method outperforms other two methods in terms of computational speed and reliability.

关键词： Motion Planning GSS SIP motion planning distance function Aerospace ground services PRNP gene STATE IMPLEMENTATION PLANS TSACC gene Global Minimum Robot Euclidean distance

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：