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

8th Conference on the Theory of Quantum Computation, Communication and Cryptography, TQC 2013

作者： Klassen, Joel Chen, Jianxin Zeng, Bei Department of Physics University of Guelph 50 Stone Road East GuelphON Canada Institute for Quantum Computing 200 University Avenue West WaterlooON Canada Department of Mathematics and Statistics University of Guelph 50 Stone Road East GuelphON Canada UTS-AMSS Joint Research Laboratory for Quantum Computation and Quantum Information Processing Academy of Mathematics and Systems Science Chinese Academy of Sciences Beijing China

ISBN: (纸本)9783939897552

A universal entangler (UE) is a unitary operation which maps all pure product states to entangled states. It is known that for a bipartite system of particles 1, 2 with a Hilbert space ℂd1ℂd2, a UE exists when min (d1,d2) ≥ 3 and (d1,d2) ≠ (3, 3). It is also known that whenever a UE exists, almost all unitaries are UEs;however to verify whether a given unitary is a UE is very difficult since solving a quadratic system of equations is NP-hard in general. This work examines the existence and construction of UEs of bipartite bosonic/fermionic systems whose wave functions sit in the symmetric/antisymmetric subspace of ℂdℂd. The development of a theory of UEs for these types of systems needs considerably different approaches from that used for UEs of distinguishable systems. This is because the general entanglement of identical particle systems cannot be discussed in the usual way due to the effect of (anti)-symmetrization which introduces "pseudo entanglement" that is inaccessible in practice. We show that, unlike the distinguishable particle case, UEs exist for bosonic/fermionic systems with Hilbert spaces which are symmetric (resp. antisymmetric) subspaces of ℂdℂdif and only if d ≥ 3 (resp. d ≥ 8). To prove this we employ algebraic geometry to reason about the different algebraic structures of the bosonic/fermionic systems. Additionally, due to the relatively simple coherent state form of unentangled bosonic states, we are able to give the explicit constructions of two bosonic UEs. Our investigation provides insight into the entanglement properties of systems of indistinguishable particles, and in particular underscores the difference between the entanglement structures of bosonic, fermionic and distinguishable particle systems. © Jianxin Chen, Joel Klassen, and Bei Zeng;.

关键词： Hilbert spaces

来源：评论

学校读者我要写书评

暂无评论

An empirical analysis of social interaction on tobacco-oriented social networks

An empirical analysis of social interaction on tobacco-orien...

引用

2013 International Conference for Smart Health, ICSH 2013

作者： Liang, Yunji Zheng, Xiaolong Zeng, Daniel Dajun Zhou, Xingshe Leischow, Scott School of Computer Science Northwestern Polytechnical University Xi'an China Department of Management Information System University of Arizona Tucson AZ United States State Key Laboratory of Management and Control for Complex Systems Institute of Automation Chinese Academy of Sciences Beijing China Dongguan Research Institute of CASIA Cloud Computing Center Chinese Academy of Sciences Songshan Lake Dongguan China Mayo Clinic in Arizona Phoenix AZ United States

ISBN: (纸本)9783642398438

Social media is widely utilized in the tobacco control campaigns. It is a great challenge to evaluate the efficiency of tobacco control policies on social network sites and find gaps among tobacco-oriented social networks. In this paper, we construct three tobacco-oriented social networks according to user interaction on Facebook tobacco-related fan pages. We further investigate the interaction patterns including temporal distribution and interaction patterns to reveal the differences of tobacco-oriented social networks. Our empirical analysis demonstrates that: 1) the user interaction on the pro-tobacco fan pages is more active. Fan pages for tobacco promotion are more successful in obtaining more user attention. 2) The gap between tobacco promotion and tobacco control is widening. These empirical results can provide us significant insights into understanding the evolutionary patterns of social interaction in tobacco-oriented social networks and further help the government departments of tobacco control to make reasonable decisions. © 2013 Springer-Verlag.

关键词： Tobacco

来源：评论

学校读者我要写书评

暂无评论

From laptops to supercomputers: a single highly scalable code base for spiking neuronal network simulations

引用

BMC Neuroscience 2013年第1期14卷 1-2页

作者： Susanne Kunkel Abigail Morrison Markus Diesmann Maximilian Schmidt Jochen M Eppler Moritz Helias Hans E Plesser Jun Igarashi Tomoki Fukai Gen Masumoto Shin Ishii Simulation Laboratory Neuroscience - Bernstein Facility Simulation and Database Technology Institute for Advanced Simulation Jülich Aachen Research Alliance Jülich Research Centre Germany Institute of Neuroscience and Medicine (INM-6) and Institute for Advanced Simulation (IAS-6) Jülich Research Centre and JARA Germany Bernstein Center Freiburg Albert-Ludwig University of Freiburg Germany Institute of Cognitive Neuroscience Faculty of Psychology Ruhr-University Bochum Germany Medical Faculty RWTH University Aachen Germany Laboratory for Neural Circuit Theory RIKEN Brain Science Institute Wako Japan Department of Mathematical Sciences and Technology Norwegian University of Life Sciences Aas Norway High-Performance Computing Team RIKEN Computational Science Research Program Kobe Japan Integrated Systems Biology Laboratory Department of Systems Science Graduate School of Informatics Kyoto University Japan

来源：评论

学校读者我要写书评

暂无评论

GPU-accelerated eXtended Classifier System

GPU-accelerated eXtended Classifier System

引用

IEEE Symposium on Computational Intelligence and Data Mining (CIDM)

作者： Mani Abedini Michael Kirley Raymond Chiong Thomas Weise Department of Computing and Information Systems University of Melbourne Parkville VIC Australia The University of Newcastle Callaghan NSW AU Nature Inspired Computation and Applications Laboratory (NICAL) Joint USTC-Birmingham Research Institute in Intelligent Computation and Its Applications University of Science and Technology of China Hefei Anhui China

XCS - the extended Classifier System - combines an evolutionary algorithm with reinforcement learning to evolve a population of condition-action rules (classifiers). Typically, population-based approaches are slow and increasing the problem size (in terms of the number of features/samples) poses a real threat to the suitability of XCS for real-world applications. Thus, reducing the execution time without losing accuracy is highly desirable. Profiling of the execution of off-the-shelf XCS implementations suggests that the rule matching process is the most computational demanding step. A solution to this is parallelization, i.e., using parallel processing techniques to speed up the matching process (and thus the entire XCS learning process). There are many ways to achieve that, using Graphic Processing Units (GPUs) is one option. Originally, GPUs were designed to conduct a sequence of graphics operations in a massively parallel fashion. Today, GPUs can be used for all sorts of general purpose calculations that are normally handled by the CPU. In this paper, we propose a hybrid rule matching process using both CPU and GPU simultaneously for a maximum performance gain. Our experimental results indicate that this approach does speed up the XCS learning process, and that the GPU is the dominant powerful computing resource in the model.

关键词： Graphics processing units Kernel Sociology Statistics Instruction sets Libraries Educational institutions

来源：评论

学校读者我要写书评

暂无评论

Break index labeling of mandarin text via syntactic-to-prosodic tree mapping

Break index labeling of mandarin text via syntactic-to-proso...

引用

International Symposium on Chinese Spoken Language Processing

作者： Xiaotian Zhang Yao Qian Hai Zhao Frank K. Soong Center for Brain-Like Computing and Machine Intelligence Department of Computer Science and Engineering MOE-Microsoft Key Laboratory for Intelligent Computing and Intelligent Systems Shanghai Jiaotong University Shanghai China Microsoft Research Asia Beijing China

In this study, we investigate the break index labeling problem with a syntactic-to-prosodic structure conversion. The statistical relationship between the mapped syntactic tree structure and prosodic tree structure of sentences in the training set is used to generate a Synchronous Tree Substitution Grammar (STSG) which can describe the probabilistic mapping (substitution) rules between them. For a given test sentence and the corresponding parsed syntactic tree structure, thus generated STSG can convert the syntactic tree to a prosodic tree statistically. We compare the labeling results with other approaches and show the probabilistic mapping can indeed benefit break index labeling performance.

关键词： IP networks Biological system modeling Pragmatics Abstracts Syntactics

来源：评论

学校读者我要写书评

暂无评论

Reports of the AAAI 2011 conference workshops

Reports of the AAAI 2011 conference workshops

引用

作者： Agmon, Noa Agrawal, Vikas Aha, David W. Aloimonos, Yiannis Buckley, Donagh Doshi, Prashant Geib, Christopher Grasso, Floriana Green, Nancy Johnston, Benjamin Kaliski, Burt Kiekintveld, Christopher Law, Edith Lieberman, Henry Mengshoel, Ole J. Metzler, Ted Modayil, Joseph Oard, Douglas W. Onder, Nilufer O'Sullivan, Barry Pastra, Katerina Precup, Doina Ramachandran, Sowmya Reed, Chris Sariel-Talay, Sanem Selker, Ted Shastri, Lokendra Singh, Satinder Smith, Stephen F. Srivastava, Siddharth Sukthankar, Gita Uthus, David C. Williams, Mary-Anne Department of Computer Science University of Texas at Austin United States Center for Knowledge Driven Information Systems Infosys Labs India Adaptive Systems Section Naval Research Laboratory Washington DC United States Department of Computer Science University of Maryland College Park United States EMC's Center of Excellence in Ireland Research Europe at EMC Ireland Department of Computer Science University of Georgia United States School of Informatics University of Edinburgh United Kingdom Department of Computer Science University of Liverpool United Kingdom Department of Computer Science University of North Carolina Greensboro United States Faculty of Engineering and Information Technology University of Technology Sydney Australia VeriSign Inc. United States Department of Computer Science University of Texas at El Paso United States Machine Learning Department Carnegie Mellon University United States Massachusetts Institute of Technology Media Laboratory United States Carnegie Mellon University's Silicon Valley Campus United States Darrell W. Hughes Program for Religion and Science Dialogue Oklahoma City University United States Department of Computing Science University of Alberta Canada College of Information Studies Institute for Advanced Computer Studies University of Maryland College Park United States Department of Computer Science Michigan Technological University United States Department of Computer Science University College Cork Ireland Cognitive Systems Research Insitute Athens Greece School of Computer Science McGill University Canada Stottler Henke Inc. United States School of Computing University of Dundee United Kingdom Department of Computer Engineering Istanbul Technical University Turkey Convergence Lab Infosys Technologies Ltd. United States Department of Electrical Engineering and Computer Science University of Michigan Ann Arbor United States Robotics Institute Carnegie Mellon University United States University of Wisconsin

The AAAI-11 workshop program was held Sunday and Monday, August 7-18, 2011, at the Hyatt Regency San Francisco in San Francisco, California USA. The AAAI-11 workshop program included 15 workshops covering a wide range of topics in artificial intelligence. The titles of the workshops were Activity Context Representation: Techniques and Languages;Analyzing Microtext;Applied Adversarial Reasoning and Risk Modeling;Artificial Intelligence and Smarter Living: The Conquest of Complexity;Artifiicial Intelligence for Data Center Management and Cloud computing;Automated Action Planning for Autonomous Mobile Robots;Computational Models of Natural Argument;Generalized Planning;Human Computation;Human-Robot Interaction in Elder Care;Interactive Decision Theory and Game Theory, 2010;Language-Action Tools for Cognitive Artificial Agents: Integrating Vision, Action, and Language;Lifelong Learning from Sensorimotor Experience;Plan, Activity, and Intent Recognition;and Scalable Integration of Analytics and Visualization. This article presents short summaries of those events. Copyright © 2012, Association for the Advancement of Artificial Intelligence. All rights reserved.

关键词： Human robot interaction

来源：评论

学校读者我要写书评

暂无评论

Modeling the correlation between modality semantics and facial expressions

Modeling the correlation between modality semantics and faci...

引用

Asia-Pacific Signal and Information Processing Association Annual Summit and Conference (APSIPA)

作者： Jia Jia Xiaohui Wang Zhiyong Wu Lianhong Cai Helen Meng Key Laboratory of Pervasive Computing Ministry of Education Tsinghua National Laboratory for Information Science and Technology (TNList) Department of Computer Science and Technology Tsinghua University Beijing China Tsinghua-CUHK Joint Research Center for Media Sciences Technologies and Systems Graduate School at Shenzhen Tsinghua University Shenzhen China

Facial expression plays an important role in face-to-face human-computer communication. Although considerable efforts have been made to enable computers to speak like human beings, how to express the rich semantic information through facial expression still remains a challenging problem. In this paper, we use the concept of “modality” to describe the semantic information which is related to the mood, attitude and intention. We propose a novel parametric mapping model to quantitatively characterize the non-verbal modality semantics for facial expression animation. In particular, seven-dimensional semantic parameters (SP) are first defined to describe the modality information. Then, a set of motion patterns represented with Key FAP (KFAP) is used to explore the correlations of MPEG-4 facial animation parameters (FAP). The SP-KFAP mapping model is trained with the linear regression algorithm (AMMSE) and an artificial neural network (ANN) respectively. Empirical analysis on a public facial image dataset verifies the strong correlation between the SP and KFAP. We further apply the mapping model to two different applications: facial expression synthesis and modality semantics detection from facial images. Both objective and subjective experimental results on the public datasets show the effectiveness of the proposed model. The results also indicate that the ANN method can significantly improve the prediction accuracies in both applications.

关键词： Semantics Correlation Computational modeling Mouth Facial animation Eyebrows Mood

来源：评论

学校读者我要写书评

暂无评论

Yield enhancement for 3D-stacked ICs: Recent advances and challenges

Yield enhancement for 3D-stacked ICs: Recent advances and ch...

引用

Asia and South Pacific Design Automation Conference

作者： Qiang Xu Li Jiang Huiyun Li Bill Eklow CUhk REliable Computing Laboratory (CURE) Department of Computer Science & Engineering Chinese University of Hong Kong Hong Kong China Automotive Electronics Research Center Shenzhen Institutes of Advanced Technologies Chinese Academy of Sciences China Cisco Systems Inc. San Jose CA USA

Three-dimensional (3D) integrated circuits (ICs) that stack multiple dies vertically using through-silicon vias (TSVs) have gained wide interests of the semiconductor industry. The shift towards volume production of 3D-stacked ICs, however, requires their manufacturing yield to be commercially viable. Various techniques have been presented in the literature to address this important problem, including pre-bond testing techniques to tackle the “known good die” problem, TSV redundancy designs to provide defect-tolerance, and wafter/die matching solutions to improve the overall stack yield. In this paper, we survey recent advances in this filed and point out challenges to be resolved in the future.

关键词： Through-silicon vias Three dimensional displays Testing Bonding Redundancy Semiconductor device modeling Maintenance engineering

来源：评论

学校读者我要写书评

暂无评论

BioNLP Shared Task 2011: Supporting resources 49

BioNLP Shared Task 2011: Supporting resources

引用

BioNLP Shared Task 2011 Workshop at the 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies, ACL HLT 2011

作者： Stenetorp, Pontus Topić, Goran Pyysalo, Sampo Ohta, Tomoko Kim, Jin-Dong Tsujii, Jun'ichi Tsujii Laboratory Department of Computer Science University of Tokyo Tokyo Japan Aizawa Laboratory Department of Computer Science University of Tokyo Tokyo Japan Database Center for Life Science Research Organization of Information and Systems Tokyo Japan Microsoft Research Asia Beijing China

ISBN: (纸本)9781937284091

This paper describes the supporting resources provided for the BioNLP Shared Task 2011. These resources were constructed with the goal to alleviate some of the burden of system development from the participants and allow them to focus on the novel aspects of constructing their event extraction systems. With the availability of these resources we also seek to enable the evaluation of the applicability of specific tools and representations towards improving the performance of event extraction systems. Additionally we supplied evaluation software and services and constructed a visualisation tool, stav, which visualises event extraction results and annotations. These resources helped the participants make sure that their final submissions and research efforts were on track during the development stages and evaluate their progress throughout the duration of the shared task. The visualisation software was also employed to show the differences between the gold annotations and those of the submitted results, allowing the participants to better understand the performance of their system. The resources, evaluation tools and visualisation tool are provided freely for research purposes and can be found at http://***/site/bionlpst/ © 2011 Association for Computational Linguistics.

关键词： Extraction

来源：评论

学校读者我要写书评

暂无评论

ANCAEE: A Novel Clustering Algorithm for Energy Efficiency in Wireless Sensor Networks

引用

Wireless Sensor Network 2011年第9期3卷 307-312页

作者： A. P. Abidoye N. A. Azeez A. O. Adesina K. K. Agbele Wireless Sensor Networks & Natural Language Research Group Grid Computing & Distributed Systems Laboratory Department of Computer Science University of the Western Cape

One of the major constraints of wireless sensor networks is limited energy available to sensor nodes because of the small size of the batteries they use as source of power. Clustering is one of the routing techniques that have been using to minimize sensor nodes’ energy consumption during operation. In this paper, A Novel Clustering Algorithm for Energy Efficiency in Wireless Sensor Networks (ANCAEE) has been proposed. The algorithm achieves good performance in terms of minimizing energy consumption during data transmission and energy consumptions are distributed uniformly among all nodes. ANCAEE uses a new method of clusters formation and election of cluster heads. The algorithm ensures that a node transmits its data to the cluster head with a single hop transmission and cluster heads forward their data to the base station with multi-hop transmissions. Simulation results show that our approach consumes less energy and effectively extends network utilization.

关键词： Sensor Nodes Clusters Cluster heads Wireless Sensor Networks Base Station Clustering Algorithms Energy Efficiency

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：