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

2015 AAAI Spring Symposium

作者： Sharma, Arpit Vo, Nguyen H. Gaur, Shruti Baral, Chitta School of Computing Informatics and Decision Systems Engineering Arizona State University TempeAZ85281 United States

ISBN: (纸本)9781577357087

The Winograd Schema Challenge has recently been proposed as an alternative to the Turing test. A Winograd Schema consists of a sentence and question pair such that the answer to the question depends on the resolution of a definite pronoun in the sentence. The answer is fairly intuitive for humans but is difficult for machines because it requires commonsense knowledge about words or concepts in the sentence. In this paper we propose a novel technique which semanti-cally parses the text, hunts for the needed commonsense knowledge and uses that knowledge to answer the given question. © Copyright 2015, Association for the Advancement of Artificial Intelligence. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Action language BC+: Preliminary report 29

Action language BC+: Preliminary report

引用

29th AAAI Conference on Artificial Intelligence, AAAI 2015 and the 27th Innovative Applications of Artificial Intelligence Conference, IAAI 2015

作者： Babb, Joseph Lee, Joohyung School of Computing Informatics and Decision Systems Engineering Arizona State University TempeAZ85287 United States

ISBN: (纸本)9781577357001

Action languages are formal models of parts of natural language that are designed to describe effects of actions. Many of these languages can be viewed as high level notations of answer set programs structured to represent transition systems. However, the form of answer set programs considered in the earlier work is quite limited in comparison with the modern Answer Set Programming (ASP) language, which allows several useful constructs for knowledge representation, such as choice rules, aggregates, and abstract constraint atoms. We propose a new action language called BC+, which closes the gap between action languages and the modern ASP language. Language BC+ is defined as a high level notation of propositional formulas under the stable model semantics. Due to the generality of the underlying language, BC+ is expressive enough to encompass many modern ASP language constructs and the best features of several other action languages, such as B, C, C+ and BC. Computational methods available in ASP solvers are readily applicable to compute BC+, which led us to implement the language by extending system CPLUS2ASP. Copyright © 2015, Association for the Advancement of Artificial Intelligence (***). All rights reserved.

关键词： Knowledge representation

来源：评论

学校读者我要写书评

暂无评论

TOPIC: TOward Perfect InfluenCe Graph Summarization

TOPIC: TOward Perfect InfluenCe Graph Summarization

引用

IEEE International Conference on Data engineering

作者： Lei Shi Sibai Sun Yuan Xuan Yue Su Hanghang Tong Shuai Ma Yang Chen SKLCS Institute of Software Chinese Academy of Sciences Institute of Physics Chinese Academy of Sciences School of Computer Science Fudan University School of Computing Informatics and Decision Systems Engineering Arizona State University SKLSDE Beihang University

ISBN: (纸本)9781509020218

Summarizing large influence graphs is crucial for many graph visualization and mining tasks. Classical graph clustering and compression algorithms focus on summarizing the nodes by their structural-level or attribute-level similarities, but usually are not designed to characterize the flow-level pattern which is the centerpiece of influence graphs. On the other hand, the social influence analysis has been intensively studied, but little is done on the summarization problem without an explicit focus on social networks. Building on the recent study of the Influence Graph Summarization (IGS), this paper presents a new perspective of the underlying flow-based heuristic. It establishes a direct linkage between the optimal summarization and the classic eigenvector centrality of the graph nodes. Such a theoretic linkage has important implications on numerous aspects in the pursuit of a perfect influence graph summarization. In particular, it enables us to develop a suite of algorithms that can: 1) achieve a near-optimal IGS objective, 2) support dynamic summarizations balancing the IGS objective and the stability of transition in navigating the summarization, and 3) scale to million-node graphs with a near-linear computational complexity. Both quantitative experiments on real-world citation networks and the user studies on the task analysis experience demonstrate the effectiveness of the proposed summarization algorithms.

关键词： Heuristic algorithms Clustering algorithms Visualization Computational modeling Social network services Couplings Navigation

来源：评论

学校读者我要写书评

暂无评论

Efficient Priority Packet Recovery Based on Network Coding in DVB-IPDC System

引用

China Communications 2015年第7期12卷 167-178页

作者： WANG Lian PENG Daiyuan LIANG Hongbin Provincial Key Laboratory of Information Coding and Transmission School of Information Science and TechnologySouthwest Jiaotong University College of Computing Science and Technology Chongqing University of Posts and Telecommunications School of Transportation and Logistics Southwest Jiaotong University Secure Networking and Computing Institute School of Computing Informatics and Decision Systems EngineeringArizona State University

In DVB-IPDC system, due to the constraints of handheld devices and the broadcast nature of wireless network, packet loss is inevitable. ECDR-NC proposed is a retransmission encoding packet selection algorithm based on the dynamic information updating, which can find the current most effective complete decoding packet. ECDR-NC can not only avoid the redundant encoding packets due to the overlapping among encoding packets, but also reduce the computational complexity compared with the traditional encoding schemes. Furthermore, the retransmission upper bound of ECDR-NC is fully controlled. In time-sensitive applications, to maximize the aggregate number of recovery packets while minimizing the total number of discarded packets due to the time limit according to the priority preference, the adaptive priority scheme EPNC is formulized, and the weighted relation graph is constructed to find the maximum-weighted encoding packets sequence according to the decoding gains. In the same network environment, the performances comparisons between PNC and EPNC show that EPNC is more efficient and more rational, and the average discarded packets ratios ofEPNC can be reduced about 18%~27%. The main contributions of this paper are an effective retransmission encoding packet selection algorithm ECDR-NC proposed, and a new adaptive priority recovery scheme EPNC introduced into DVB-IPDC system.

关键词： digital video broadcasting（DVB） retransmission network coding（NC） longterm evolution（LTE） wireless network

来源：评论

学校读者我要写书评

暂无评论

A simulation based cut generation approach to improve DEO efficiency: The Buffer Allocation case 16

A simulation based cut generation approach to improve DEO ef...

引用

Simulation Winter Conference

作者： Mengyi Zhang Andrea Matta Arianna Alfieri Giulia Pedrielli Department of Industrial Engineering & Management Shanghai Jiao Tong University Shanghai CHINA Department of Management & Production Engineering Politecnico di Torino Torino Italy School of Computing Informatics & Decision Systems Engineering Arizona State University Tempe AZ USA

ISBN: (纸本)9781509044849

The stochastic Buffer Allocation Problem (BAP) is well known in several fields and it has been characterized as NP-Hard. It deals with the optimal allocation of buffer spaces among stages of a system. Simulation Optimization is a possible way to approximately solve the problem. In particular, we refer to the Discrete Event Optimization (DEO). According to this approach, BAP simulation optimization can be modeled as a Mixed Integer Programming model. Despite the advantages deriving from having a single model for both simulation and optimization, its solution can be extremely demanding. In this work, we propose a Benders decomposition approach to efficiently solve large DEO of BAP, in which cuts are generated by simulation. Numerical experiment shows that the computation time can be significantly reduced by using this approach.

关键词： Computational modeling Mathematical model Optimization Numerical models Resource management Stochastic processes

来源：评论

学校读者我要写书评

暂无评论

Locating arrays: A new experimental design for screening complex Engineered systems 8

Locating arrays: A new experimental design for screening com...

引用

8th Workshop on Large-Scale Distributed systems and Middleware, LADIS 2014

作者： Aldaco, Abraham N. Colbourn, Charles J. Syrotiuk, Violet R. School of Computing Informatics and Decision Systems Engineering Arizona State University TempeAZ85287-8809 United States

The purpose of a screening experiment is to identify significant factors and interactions on a response for a system. Engineered systems are complex in part due to their size. To apply traditional experimental designs for screening in complex engineered systems requires either restricting the factors considered, which automatically restricts the interactions to those in the set, or restricting interest to main effects, which fails to consider any possible interactions. To address this problem we propose a locating array (LA) as a screening design. Locating arrays exhibit logarithmic growth in the number of factors because their focus is on identification rather than on measurement. This makes practical the consideration of an order of magnitude more factors in experimentation than traditional screening designs. We present preliminary results applying an LA for screening the response of TCP throughput in a simulation model of a mobile wireless network. The full-factorial design for this system is infeasible (over 10 43 design points!) yet an LA has only 421 design points. We validate the significance of the identified factors and interactions independently using the statistical software JMP. Screening using locating arrays is viable and yields useful models.

关键词： Complex networks

来源：评论

学校读者我要写书评

暂无评论

Hyperbolic space sparse coding with its application on prediction of Alzheimer’s disease in mild cognitive impairment 1st

Hyperbolic space sparse coding with its application on predi...

引用

1st International Workshop on Simulation and Synthesis in Medical Imaging, SASHIMI 2016 held in conjunction with 19th International Conference on Medical Image computing and Computer-Assisted Intervention, MICCAI 2016

作者： Zhang, Jie Shi, Jie Stonnington, Cynthia Li, Qingyang Gutman, Boris A. Chen, Kewei Reiman, Eric M. Caselli, Richard Thompson, Paul M. Ye, Jieping Wang, Yalin School of Computing Informaticsand Decision Systems Engineering Arizona State University TempeAZ United States Department of Psychiatry and Psychology Mayo Clinic Arizona ScottsdaleAZ United States Banner Alzheimer’s Institute and Banner Good Samaritan PET Center PhoenixAZ United States Imaging Genetics Center Institute for Neuroimaging and Informatics University of Southern California Marina del ReyCA United States Department of Computational Medicine and Bioinformatics University of Michigan Ann ArborMI United States

ISBN: (纸本)9783319467191

Mild Cognitive Impairment (MCI) is a transitional stage between normal age-related cognitive decline and Alzheimer’s disease (AD). Here we introduce a hyperbolic space sparse coding method to predict impending decline of MCI patients to dementia using surface measures of ventricular enlargement. First,we compute diffeomorphic mappings between ventricular surfaces using a canonical hyperbolic parameter space with consistent boundary conditions and surface tensorbased morphometry is computed to measure local surface deformations. Second,ring-shaped patches of TBM features are selected according to the geometric structure of the hyperbolic parameter space to initialize a dictionary. Sparse coding is then applied on the patch features to learn sparse codes and update the dictionary. Finally,we adopt max-pooling to reduce the feature dimensions and apply Adaboost to predict AD in MCI patients (N = 133) from the Alzheimer’s Disease Neuroimaging Initiative baseline dataset. Our work achieved an accuracy rate of 96.7% and outperformed some other morphometry measures. The hyperbolic space sparse coding method may offer a more sensitive tool to study AD and its early symptom. © Springer International Publishing AG 2016.

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

On the distribution of the number of internal equilibria in random evolutionary games

arXiv

引用

arXiv 2017年

作者： Duong, Manh Hong Tran, Hoang Minh Han, The Anh Department of Mathematics Imperial College London LondonSW7 2AZ United Kingdom Department of Industrial and Systems Engineering Texas AandM University College StationTX77843 United States School of Applied Mathematics and Informatics Hanoi University of Science and Technology Hanoi Viet Nam School of Computing Media and Art Teeside University TS1 3BX United Kingdom

In this paper, we study the distribution of the number of internal equilibria of a multiplayer two-strategy random evolutionary game. Using techniques from the random polynomial theory, we obtain a closed formula for the probability that the game has a certain number of internal equilibria. In addition, by employing Descartes' rule of signs and combinatorial methods, we provide useful estimates for this probability. Finally, we also compare our analytical results with those obtained from samplings. Copyright © 2017, The Authors. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Individuals, institutions, and innovation in the debates of the French revolution

arXiv

引用

arXiv 2017年

作者： Barron, Alexander T.J. Huang, Jenny Spang, Rebecca L. DeDeo, Simon School of Informatics Computing and Engineering Indiana University 919 E 10th Street BloomingtonIN47408 United States Department of History Indiana University 1020 E Kirkwood Ave BloomingtonIN47405 United States Department of Social and Decision Sciences Carnegie Mellon University 5000 Forbes Avenue BP 208 PittsburghPA15213 United States Santa Fe Institute 1399 Hyde Park Road Santa FeNM87501 United States

The French Revolution brought principles of "liberty, equality, and brotherhood" to bear on the day-to-day challenges of governing what was then the largest country in Europe. Its experiments provided a model for future revolutions and democracies across the globe, but this first modern revolution had no model to follow. Using reconstructed transcripts of debates held in the Revolution's first parliament, we present a quantitative analysis of how this system managed innovation. We use information theory to track the creation, transmission, and destruction of patterns of word-use across over 40,000 speeches and more than one thousand speakers. The parliament as a whole was biased toward the adoption of new patterns, but speakers' individual qualities could break these overall trends. Speakers on the left innovated at higher rates while speakers on the right acted, often successfully, to preserve prior patterns. Key players such as Robespierre (on the left) and Abbé Maury (on the right) played information-processing roles emblematic of their politics. Newly-created organizational functions-such as the Assembly's President and committee chairs-had significant effects on debate outcomes, and a distinct transition appears mid-way through the parliament when committees, external to the debate process, gain new powers to "propose and dispose" to the body as a whole. Taken together, these quantitative results align with existing qualitative interpretations but also reveal crucial information-processing dynamics that have hitherto been overlooked. Great orators had the public's attention, but deputies (mostly on the political left) who mastered the committee system gained new powers to shape revolutionary legislation. Copyright © 2017, The Authors. All rights reserved.

关键词： Information theory

来源：评论

学校读者我要写书评

暂无评论

Story Forms Detection in Text through Concept-Based Co-Clustering

Story Forms Detection in Text through Concept-Based Co-Clust...

引用

IEEE International Conference on Big Data and Cloud computing (BdCloud)

作者： Sultan Alzahrani Betul Ceran Saud Alashri Scott W. Ruston Steven R. Corman Hasan Davulcu Informatics and Decision Systems Engineering Arizona State University Tempe AZ Hugh Downs School of Human Communication Arizona State University Tempe AZ

ISBN: (纸本)9781509039371

A story is defined as actors taking actions that culminate in resolutions. In this paper, we extract subject - verb - object relationships from paragraphs and generalize them into semantic conceptual representations. Overlapping generalized concepts and relationships correspond to archetypes/targets and actions that characterize story forms. We present an analytic framework which implements co-clustering based on generalized conceptual relationships to automatically detect such story forms. Co-clustering can help in identifying similarities that exist in low-dimensional sub-spaces of sparse data such as textual paragraphs. Through co-clustering, we detect not only the clusters themselves but also their characteristic features which can be useful in describing and summarizing their contents. We perform co-clustering of stories using two different types of features: standard unigrams/bigrams and generalized concepts. We show that the residual error of factorization with concept-based features is significantly lower than the error with standard keyword-based features. Qualitative evaluations also suggest that concept-based features yield more coherent, distinctive and interesting story forms compared to those produced by using standard keyword-based features.

关键词： Feature extraction Semantics Matrix decomposition Standards Syntactics Merging Clustering algorithms

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：