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

The Computational Complexity of Angry Birds

学校读者我要写书评

暂无评论

arXiv 2018年

作者： Stephenson, Matthew Renz, Jochen Ge, Xiaoyu Department of Data Science and Knowledge Engineering Maastricht University Maastricht Netherlands Research School of Computer Science Australian National University Canberra Australia

The physics-based simulation game Angry Birds has been heavily researched by the AI community over the past five years, and has been the subject of a popular AI competition that is currently held annually as part of a leading AI conference. Developing intelligent agents that can play this game effectively has been an incredibly complex and challenging problem for traditional AI techniques to solve, even though the game is simple enough that any human player could learn and master it within a short time. In this paper we analyse how hard the problem really is, presenting several proofs for the computational complexity of Angry Birds. By using a combination of several gadgets within this game’s environment, we are able to demonstrate that the decision problem of solving general levels for different versions of Angry Birds is either NP-hard, PSPACE-hard, PSPACE-complete or EXPTIME-hard. Proof of NP-hardness is by reduction from 3-SAT, whilst proof of PSPACE-hardness is by reduction from True Quantified Boolean Formula (TQBF). Proof of EXPTIME-hardness is by reduction from G2, a known EXPTIME-complete problem similar to that used for many previous games such as Chess, Go and Checkers. To the best of our knowledge, this is the first time that a single-player game has been proven EXPTIME-hard. This is achieved by using stochastic game engine dynamics to effectively model the real world, or in our case the physics simulator, as the opponent against which we are playing. These proofs can also be extended to other physics-based games with similar mechanics. Copyright © 2018, The Authors. All rights reserved.

关键词： Computational complexity

Target localization intervention and prognosis evaluation for an individual with mild cognitive impairment

学校读者我要写书评

暂无评论

Brain‐X

Brain‐X 2023年第3期1卷

作者： Weiping Wang Haiyan Zhao Chang He Yuanbo Cui Zhen Wang Alexander Hramov Ping Luan Xiong Luo Jipeng Ouyang Kurths Jürgen School of Computer and Communication Engineering University of Science and Technology Beijing Beijing China Shunde Graduate School University of Science and Technology Beijing Foshan Guangdong China Beijing Key Laboratory of Knowledge Engineering for Materials Science Beijing China Contribution: Writing - review & editing Department of Neurology Peking University Third Hospital Beijing China Contribution: Resources Zhen Wang The Center for Optical Imagery Analysis and Learning and School of Mechanical Engineering Northwestern Polytechnical University Xi'an Shaanxi 710072 China. Contribution: Writing - original draft The 6th Research Institute of China Electronics Corporation Beijing China The Center for Optical Imagery Analysis and Learning and School of Mechanical Engineering Northwestern Polytechnical University Xi'an Shaanxi China Chang He School of Computer and Communication Engineering University of Science and Technology Beijing Beijing 100083 China. Contribution: Investigation Center for Technologies in Robotics and Mechatronics Components Innopolis University Innopolis Russia Saratov State Medical University Saratov Russia Contribution: Data curation Guangdong Second Provincial General Hospital & Health Science Center Shenzhen Guangdong China Department of Neurology Shunde Hospital Southern Medical University Foshan Guangdong China Institute of Physics Humboldt-University Berlin Germany Potsdam Institute for Climate Impact Research Potsdam Germany

Currently, no specific treatments are available for Alzheimer's disease (AD). Mild cognitive impairment (MCI), the preclinical stage of AD, has a high possibility of reversing symptoms through neural regulation. A state dynamics model for single brain regions was developed to simulate blood oxygen level-dependent signals in a patient with early mild cognitive impairment. Subsequently, the analysis of functional connections was used to comprehensively consider multiple complex network centralities to locate the intervention targets, and a multiple brain region collaborative control scheme was designed. Finally, the reliability and effectiveness of the intervention were verified at the brain region and subnetwork levels. This technique provides a basis for future clinical diagnosis and treatment of AD and MCI.

关键词： adaptive pinning control Alzheimer's disease BOLD signals computational modeling Sub_network

What does twitter tell us about tourists’ mobility behavior? A case study on tourists in the Netherlands and Belgium 21

学校读者我要写书评

暂无评论

What does twitter tell us about tourists’ mobility behavior...

21st Pacific Asia Conference on Information Systems: Societal Transformation Through IS/IT, PACIS 2017

作者： Habib, Mena B. Krol, Nynke C. Department of Data Science and Knowledge Engineering Maastricht University Netherlands Statistics Netherlands1 Netherlands

Social media has made a big impact on the tourism industry. Tourists are increasingly sharing their personal experiences of a particular touristic site scene using social media. Studying tourists’ movement behavior should support the tourism industry with more statistics and information regarding tourism demand. It would also provide policy makers with another data source on tourists and their movements. In this paper, we propose a set of heuristics to identify tourists on Twitter. We also utilized both textual contents and geolocation information of Tweets posted by tourists visiting The Netherlands and Belgium to provide a near real scenario for the tourists’ travel route made during their stay in The Netherlands and Belgium. Finally, we induce and visualize some useful statistics regarding the tourists’ visiting behavior in The Netherlands and Belgium. © PACIS 2017.

关键词： Social networking (online)

Fully-convolutional intensive feature flow neural network for text recognition

学校读者我要写书评

暂无评论

arXiv 2019年

作者： Zhang, Zhao Tang, Zemin Zhang, Zheng Wang, Yang Qin, Jie Wang, Meng School of Computer Science and Technology Soochow University China Key Laboratory of Knowledge Engineering with Big Data Ministry of Education School of Computer and Information Hefei University of Technology Hefei China Bio-Computing Research Center Harbin Institute of Technology Shenzhen518055 China Inception Institute of Artificial Intelligence Abu Dhabi United Arab Emirates

The Deep Convolutional Neural Networks (CNNs) have obtained a great success for pattern recognition, such as recognizing the texts in images. But existing CNNs based frameworks still have several drawbacks: 1) the traditaional pooling operation may lose important feature information and is unlearnable;2) the traditional convolution operation optimizes slowly and the hierarchical features from different layers are not fully utilized. In this work, we address these problems by developing a novel deep network model called Fully-Convolutional Intensive Feature Flow Neural Network (IntensiveNet). Specifically, we design a further dense block called intensive block to extract the feature information, where the original inputs and two dense blocks are connected tightly. To encode data appropriately, we present the concepts of dense fusion block and further dense fusion operations for our new intensive block. By adding short connections to different layers, the feature flow and coupling between layers are enhanced. We also replace the traditional convolution by depthwise separable convolution to make the operation efficient. To prevent important feature information being lost to a certain extent, we use a convolution operation with stride 2 to replace the original pooling operation in the customary transition layers. The recognition results on large-scale Chinese string and MNIST datasets show that our IntensiveNet can deliver enhanced recognition results, compared with other related deep models. Copyright © 2019, The Authors. All rights reserved.

关键词： Convolution

Advances in Machine Learning for the Behavioral Sciences

学校读者我要写书评

暂无评论

arXiv 2019年

作者： Kliegr, Tomáš Bahník, Štěpán Fürnkranz, Johannes Department of Information and Knowledge Engineering Faculty of Informatics and Statistics University of Economics Prague Czech Republic Department of Management Faculty of Business Administration University of Economics Prague Czech Republic Computational Data Analytics Group Department of Computer Science Johannes Kepler Universität Linz Altenbergerstraße 66B Linz4040 Austria

The areas of machine learning and knowledge discovery in databases have considerably matured in recent years. In this article, we briefly review recent developments as well as classical algorithms that stood the test of time. Our goal is to provide a general introduction into different tasks such as learning from tabular data, behavioral data, or textual data, with a particular focus on actual and potential applications in behavioral sciences. The supplemental appendix to the article also provides practical guidance for using the methods by pointing the reader to proven software implementations. The focus is on R, but we also cover some libraries in other programming languages as well as systems with easy-to-use graphical interfaces. Copyright © 2019, The Authors. All rights reserved.

关键词： data mining

Collaborative interactive learning – A clarification of terms and a differentiation from other research fields

学校读者我要写书评

暂无评论

arXiv 2019年

作者： Hanika, Tom Herde, Marek Kuhn, Jochen Leimeister, Jan Marco Lukowicz, Paul Oeste-Reiß, Sarah Schmidt, Albrecht Sick, Bernhard Stumme, Gerd Tomforde, Sven Zweig, Katharina Anna Knowledge & Data Engineering University of Kassel Germany Intelligent Embedded Systems University of Kassel Germany Didactics of Physics Technical University of Kaiserslautern Germany Information Systems University of Kassel Germany Embedded Intelligence Technical University of Kaiserslautern Germany Human-Computer Interaction Ludwig Maximilian University of Munich Germany Algorithm Accountability Technical University of Kaiserslautern Germany

The field of collaborative interactive learning (CIL) aims at developing and investigating the technological foundations for a new generation of smart systems that support humans in their everyday life. While the concept of CIL has already been carved out in detail (including the fields of dedicated CIL and opportunistic CIL) and many research objectives have been stated, there is still the need to clarify some terms such as information, knowledge, and experience in the context of CIL and to differentiate CIL from recent and ongoing research in related fields such as active learning, collaborative learning, and others. Both aspects are addressed in this paper. Copyright © 2019, The Authors. All rights reserved.

关键词： Intelligent systems

INTRINSIC DIMENSION OF GEOMETRIC data SETS

学校读者我要写书评

暂无评论

arXiv 2018年

作者： Hanika, Tom Schneider, Friedrich Martin Stumme, Gerd Knowledge & Data Engineering Group University of Kassel Kassel34121 Germany Institute of Discrete Mathematics and Algebra TU Bergakademie Freiberg Freiberg 09596 Germany

The curse of dimensionality is a phenomenon frequently observed in machine learning (ML) and knowledge discovery (KD). There is a large body of literature investigating its origin and impact, using methods from mathematics as well as from computer science. Among the mathematical insights into data dimensionality, there is an intimate link between the dimension curse and the phenomenon of measure concentration, which makes the former accessible to methods of geometric analysis. The present work provides a comprehensive study of the intrinsic geometry of a data set, based on Gromov's metric measure geometry and Pestov's axiomatic approach to intrinsic dimension. In detail, we define a concept of geometric data set and introduce a metric as well as a partial order on the set of isomorphism classes of such data sets. Based on these objects, we propose and investigate an axiomatic approach to the intrinsic dimension of geometric data sets and establish a concrete dimension function with the desired properties. Our model for data sets and their intrinsic dimension is computationally feasible and, moreover, adaptable to specific ML/KD-algorithms, as illustrated by various *** Codes 03G10 51F99 68P05 68T01. Copyright © 2018, The Authors. All rights reserved.

关键词： Geometry

An efficient approach for geo-multimedia cross-modal retrieval

学校读者我要写书评

暂无评论

arXiv 2018年

作者： Zhu, Lei Long, Jun Zhang, Chengyuan Chen, Ruipeng Yuan, Xinpan Yang, Zhan School of Information Science and Engineering Central South University China Big Data and Knowledge Engineering Institute Central South University China School of Computer Hunan University of Technology China

Due to the rapid development of mobile Internet techniques, cloud computation and popularity of online social networking and location-based services, massive amount of multimedia data with geographical information is generated and uploaded to the Internet. In this paper, we propose a novel type of cross-modal multimedia retrieval called geo-multimedia cross-modal retrieval which aims to search out a set of geo-multimedia objects based on geographical distance proximity and semantic similarity between different modalities. Previous studies for cross-modal retrieval and spatial keyword search cannot address this problem effectively because they do not consider multimedia data with geo-tags and do not focus on this type of query. In order to address this problem efficiently, we present the deffinition of kNN geo-multimedia cross-modal query at the first time and introduce relevant conceptions such as cross-modal semantic representation space. To bridge the semantic gap between different modalities, we propose a method named cross-modal semantic matching which contains two important component, i.e., CorrProj and LogsTran, which aims to construct a common semantic representation space for cross-modal semantic similarity measurement. Besides, we designed a framework based on deep learning techniques to implement common semantic representation space construction. In addition, a novel hybrid indexing structure named GMR-Tree combining geo-multimedia data and R-Tree is presented and a efficient kNN search algorithm called kGMCMS is designed. Comprehensive experimental evaluation on real and synthetic dataset clearly demonstrates that our solution outperforms the-stateof-the-art methods. Copyright © 2018, The Authors. All rights reserved.

关键词： Location based services

Ontology Driven Semantic Profiling and Retrieval in Medical Information Systems

学校读者我要写书评

暂无评论

SSRN

SSRN 2018年

作者： Bhatt, Mehul Rahayu, Wenny Soni, Sury Prakash Wouters, Carlo Cognitive Systems Lab Universität Bremen Bremen28359 Germany Data Engineering and Knowledge Management Group Department of Computer Science and Computer Engineering La Trobe University Australia

We propose the application of a novel sub-ontology extractionmethodology for achieving interoperability and improving the semantic validity of information retrieval in the medical information systems (MIS) domain. The system offers advanced profiling of a user’s field of specialization by exploiting the concept of sub-ontology extraction, i.e., each sub-ontology may subsequently represent a particular user profile. Semantic profiling of a user’s field of specialization or interest is necessary functionality in any medical domain information retrieval system;this is because the (structural and semantic) extent of information sources is massive and individual users are only likely to be interested in specific parts of the overall knowledge documents on the basis of their area of specialization. The prototypical system, OntoMOVE, has been specifically designed for application in themedical information systems domain. OntoMOVE utilizes semantic web standards like RDF(S) and OWL in addition to medical domain standards and vocabularies encompassed by the UMLS knowledge sources. © 2018, The Authors. All rights reserved.

关键词： Medical information systems