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

arXiv 2020年

作者： Schlicher, Loe Musegaas, Marieke Blok, Herman School of Industrial Engineering Eindhoven University of Technology P.O. Box 513 Eindhoven5600 MB Netherlands Department of Data Science and Knowledge Engineering Maastricht University P.O. Box 616 Maastricht6200 MD Netherlands Department of Mathematics Vrije Universiteit Amsterdam De Boelelaan 1081a Amsterdam1081 HV Netherlands

Inspired by a military context, we study a Stackelberg production game where a country’s government, the leader, wants to maximize the production of military assets. The leader does so by allocating his resources among a set of production facilities. His opponent, the follower, observes this allocation and tries to destroy the associated production as much as possible by allocating his destructive resources, for example bombs, among these facilities. In this paper, we identify a follower’s optimal strategy. For the leader, we show that an optimal production strategy can be found in the class of so-called seried-balanced strategies. We present a linear time algorithm that finds an optimal strategy in this class. Copyright © 2020, The Authors. All rights reserved.

关键词： Clustering algorithms

来源：评论

学校读者我要写书评

暂无评论

Applications of Game Theory in Vehicular Networks: A Survey

arXiv

引用

arXiv 2021年

作者： Sun, Zemin Liu, Yanheng Wang, Jian Li, Guofa Anil, Carie Li, Keqiang Guo, Xinyu Sun, Geng Tian, Daxin Cao, Dongpu College of Computer Science and Technology Jilin University Changchun130012 China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun130012 China Institute of Human Factors and Ergonomics College of Mechatronics and Control Engineering Shenzhen University Guangdong Shenzhen518060 China School of Computer Science and Engineering VIT-AP Andhra Pradesh Amaravati522237 India College of Engineering Nanjing Agricultural University Nanjing210031 China State Key Laboratory of Automotive Safety and Energy Department of Automotive Engineering Tsinghua University Beijing100084 China Beijing Advanced Innovation Center for Big Data and Brain Computing Beijing Key Laboratory for Cooperative Vehicle Infrastructure Systems and Safety Control School of Transportation Science and Engineering Beihang University Beijing100191 China Waterloo Cognitive Autonomous Driving Lab University of Waterloo N2L 3G1 Canada

In the Internet of things (IoT) era, vehicles and other intelligent components in an intelligent transportation system (ITS) are connected, forming vehicular networks (VNs) that provide efficient and safe traffic and ubiquitous access to various applications. However, as the number of nodes in an ITS increases, it is challenging to satisfy a varied and large number of service requests with different quality of service (QoS) and security requirements in highly dynamic VNs. Intelligent nodes in VNs can compete or cooperate for limited network resources to achieve the objective for either an individual or a group. Game theory (GT), a theoretical framework designed for strategic interactions among rational decision makers sharing scarce resources, can be used to model and analyze individual or group behaviors of communicating entities in VNs. This paper primarily surveys the recent developments of GT in solving various challenges of VNs. This survey starts with an introduction to the background of VNs. A review of GT models studied in the VNs is then introduced, including the basic concepts, classifications, and applicable vehicular issues. After discussing the requirements of VNs and the motivation of using GT, a comprehensive literature review on GT applications in dealing with the challenges of current VNs is provided. Furthermore, recent contributions of GT to VNs that are integrated with diverse emerging 5G technologies are surveyed. Finally, the lessons learned are given, and several key research challenges and possible solutions of applying GT in VNs are outlined. Copyright © 2021, The Authors. All rights reserved.

关键词： Quality of service

来源：评论

学校读者我要写书评

暂无评论

Heterogeneous-length text topic modeling for reader-Aware multi-document summarization

引用

ACM Transactions on knowledge Discovery from data 2019年第4期13卷 1–21页

作者： Qiang, Jipeng Chen, Ping Ding, Wei Wang, Tong Xie, Fei Wu, Xindong Department of Computer Science Yangzhou University China Department of Computer Science University of Massachusetts Boston United States Department of Computer Science and Technology Hefei Normal University China Key Laboratory of Knowledge Engineering with Big Data Hefei University of Technology Ministry of Education Hefei China Mininglamp Academy of Sciences Minininglamp Beijing 100084 China

More and more user comments like Tweets are available, which often contain user concerns. In order to meet the demands of users, a good summary generating from multiple documents should consider reader interests as reflected in reader comments. In this article, we focus on how to generate a summary from multi-document documents by considering reader comments, named as reader-Aware multi-document summarization (RA-MDS).We present an innovative topic-based method for RA-MDA, which exploits latent topics to obtain the most salient and lessen redundancy summary from multiple documents. Since finding latent topics for RA-MDS is a crucial step, we also present a Heterogeneous-length Text Topic Modeling (HTTM) to extract topics from the corpus that includes both news reports and user comments, denoted as heterogeneous-length texts. In this case, the latent topics extract by HTTM cover not only important aspects of the event, but also aspects that attract reader interests. Comparisons on summary benchmark datasets also confirm that the proposed RA-MDS method is effective in improving the quality of extracted summaries. In addition, experimental results demonstrate that the proposed topic modeling method outperforms existing topic modeling algorithms. © 2019 Association for Computing Machinery. All rights reserved.

关键词： heterogeneous-length text LDA multi-document summarization Topic modeling

来源：评论

学校读者我要写书评

暂无评论

Using restart heuristics to improve agent performance in angry birds

arXiv

引用

arXiv 2019年

作者： Liu, Tommy Renz, Jochen Zhang, Peng Stephenson, Matthew Research School of Computer Science Australian National University CanberraACT Australia Department of Data Science and Knowledge Engineering Maastricht University Maastricht Netherlands

Over the past few years the Angry Birds AI competition has been held in an attempt to develop intelligent agents that can successfully and efficiently solve levels for the video game Angry Birds. Many different agents and strategies have been developed to solve the complex and challenging physical reasoning problems associated with such a game. However none of these agents attempt one of the key strategies which humans employ to solve Angry Birds levels, which is restarting levels. Restarting is important in Angry Birds because sometimes the level is no longer solvable or some given shot made has little to no benefit towards the ultimate goal of the game. This paper proposes a framework and experimental evaluation for when to restart levels in Angry Birds. We demonstrate that restarting is a viable strategy to improve agent performance in many cases. Copyright © 2019, The Authors. All rights reserved.

关键词： Birds

来源：评论

学校读者我要写书评

暂无评论

Co-training Based on Semi-Supervised Ensemble Classification Approach for Multi-label data Stream

Co-training Based on Semi-Supervised Ensemble Classification...

引用

IEEE International Conference on Big knowledge (ICBK)

作者： Zhe Chu Peipei Li Xuegang Hu Key Laboratory of Knowledge Engineering with Big Data (Hefei University of Technology) Ministry of Education AnHui China School of Computer Science and Information Engineering Hefei University of Technology AnHui China

A large amount of data streams in the form of texts and images has been emerging in many real-world applications. These data streams often present the characteristics such as multi-labels, label missing and new class emerging, which makes the existing data stream classification algorithm face the challenges in precision space and time performance. This is because, on the one hand, it is known that data stream classification algorithms are mostly trained on all labeled single-class data, while there are a large amount of unlabeled data and few labeled data due to it is difficult to obtain labels in the real world. On the other hand, many of existing multi-label data stream classification algorithms mostly focused on the classification with all labeled data and without emerging new classes, and there are few semi-supervised methods. Therefore, this paper proposes a semi-supervised ensemble classification algorithm for multi-label data streams based on co-training. Firstly, the algorithm uses the sliding window mechanism to partition the data stream into data chunks. On the former w data chucks, the multi-label semi-supervised classification algorithm COINS based on co-training is used to training a base classifier on each chunk, and then an ensemble model with w COINS classifiers is generated ensemble model to adapt to the environment of data stream with a large number of unlabeled data. Meanwhile, a new class emerging detection mechanism is introduced, and the w+1 data chunk is predicted by the ensemble model to detect whether there is a new class emerging. When a new label is detected, the classifier is retrained on the current data chunk, and the ensemble model is updated. Finally, experimental results on five real data sets show that: as compared with the classical algorithms, the proposed approach can improve the classification accuracy of multi-label data streams with a large number of missing labels and new labels emerging.

关键词： data models Training Streaming media Adaptation models Partitioning algorithms Correlation knowledge engineering

来源：评论

学校读者我要写书评

暂无评论

ARCH-COMP20 category report: Continuous and hybrid systems with nonlinear dynamics 7th

ARCH-COMP20 category report: Continuous and hybrid systems w...

引用

7th International Workshop on Applied Verification of Continuous and Hybrid Systems, ARCH 2020

作者： Geretti, Luca Dit Sandretto, Julien Alexandre Althoff, Matthias Benet, Luis Chapoutot, Alexandre Chen, Xin Collins, Pieter Forets, Marcelo Freire, Daniel Immler, Fabian Kochdumper, Niklas Sanders, David P. Schilling, Christian Department of Computer Science University of Verona Verona Italy ENSTA Paris Institut Polytechnique de Paris Palaiseau France Technische Universität München Munich Germany Mexico University of Dayton DaytonOH United States Department of Data Science and Knowledge Engineering Maastricht University Maastricht Netherlands Universidad de la República Montevideo Uruguay Computer Science Department Carnegie Mellon University United States Mexico City Mexico Department of Mathematics Massachusetts Institute of Technology CambridgeMA United States IST Austria Klosterneuburg Austria

We present the results of a friendly competition for formal verification of continuous and hybrid systems with nonlinear continuous dynamics. The friendly competition took place as part of the workshop Applied Verification for Continuous and Hybrid Systems (ARCH) in 2020. This year, 6 tools Ariadne, CORA, DynIbex, Flow*, Isabelle/HOL, and JuliaReach (in alphabetic order) participated. These tools are applied to solve reachability analysis problems on six benchmark problems, two of them featuring hybrid dynamics. We do not rank the tools based on the results, but show the current status and discover the potential advantages of different tools. © 2020 EasyChair. All rights reserved.

关键词： Hybrid systems

来源：评论

学校读者我要写书评

暂无评论

Forest fire area estimation using support vector machine as an approximator 10th

Forest fire area estimation using support vector machine as ...

引用

10th International Joint Conference on Computational Intelligence, IJCCI 2018

作者： Kerdprasop, Nittaya Poomka, Pumrapee Chuaybamroong, Paradee Kerdprasop, Kittisak Data and Knowledge Engineering Research Unit School of Computer Engineering Suranaree University of Technology Nakhon Ratchasima Thailand Department of Environmental Science Thammasat University Thailand

ISBN: (纸本)9789897583278

Forest fire is critical environmental issue that can cause severe damage. Fast detection and accurate estimation of forest fire burned area can help firefighters to effectively control damage. Thus, the purpose of this paper is to apply state of the art data modeling method to estimate the area of forest fire burning using support vector machine (SVM) algorithm as a tool for area approximation. The dataset is real forest fires data from the Montesinho natural park in the northeast region of Portugal. The original dataset comprises of 517 records with 13 attributes. We randomly sample the data 10 times to obtain 10 data-subsets for building estimation models using two kinds of SVM kernel: radial basis function and polynomial function. The obtained models are compared against other proposed techniques to assess performances based on the two measurement metrics: mean absolute error (MAE) and root mean square error (RMSE). The experimental results show that our SVM predictor using polynomial kernel function can precisely estimate forest fire damage area with the MAE and RMSE as low as 6.48 and 7.65, respectively. These errors are less than other techniques reported in the literature. Copyright © 2018 by SCITEPRESS – Science and Technology Publications, Lda. All rights reserved.

关键词： Fires

来源：评论

学校读者我要写书评

暂无评论

Modeling method for temperature anomaly analysis 10th

Modeling method for temperature anomaly analysis

引用

10th International Joint Conference on Computational Intelligence, IJCCI 2018

作者： Kerdprasop, Kittisak Chuaybamroong, Paradee Kerdprasop, Nittaya Data and Knowledge Engineering Research Unit School of Computer Engineering Suranaree University of Technology Nakhon Ratchasima Thailand Department of Environmental Science Thammasat University Thailand

ISBN: (纸本)9789897583278

This study applies intelligent analytical methods to analyze temperature anomaly events during the past seven centuries of countries in the Southeast Asia including Thailand, Malaysia, Myanmar, and Cambodia. The temperature reconstruction during the years 1300 to 1999 were used as data source for anomaly analysis. In the analytical process, correlation analysis was applied to initially investigate the temperature variability concordance among the Southeast Asian countries. The results are that temperature variability patterns in Thailand, Myanmar, and Cambodia are moderately correlated to each other. On the contrary, the temperature variation patterns of Malaysia do not correlate to other countries in the same region. The further in-depth analysis focuses on the temperature anomaly of Thailand that shows high variability from the 14th to 16th centuries. Several machine learning algorithms had been applied to estimate the temperature anomaly of Thailand based on the anomaly events among the neighbors. The learned models reveal that Myanmar temperature anomaly most associate to the Thailand’s temperature variation. The performance of each model had been assessed and the results reveal that the chi-squared automatic interaction detection, or CHAID, is the best one with 0.624 correlation coefficient and relative error around 0.611. Copyright © 2018 by SCITEPRESS – Science and Technology Publications, Lda. All rights reserved.

关键词： Machine learning

来源：评论

学校读者我要写书评

暂无评论

Machine Memory Intelligence: Inspired by Human Memory Mechanisms

引用

engineering 2025年

作者： Qinghua Zheng Huan Liu Xiaoqing Zhang Caixia Yan Xiangyong Cao Tieliang Gong Yong-Jin Liu Bin Shi Zhen Peng Xiaocen Fan Ying Cai Jun Liu School of Computer Science and Technology Xi’an Jiaotong University Xi’an 710049 China Shaanxi Provincial Key Laboratory of Big Data Knowledge Engineering Xi’an Jiaotong University Xi’an 710049 China Translational Research Institute of Brain and Brain-Like Intelligence Shanghai Fourth People’s Hospital Shanghai 200434 China School of Medicine Tongji University Shanghai 200092 China Department of Computer Science and Technology Tsinghua University Beijing 100084 China Department of Computer Science Iowa State University Ames IA 50011 USA

Large models, exemplified by ChatGPT, have reached the pinnacle of contemporary artificial intelligence (AI). However, they are plagued by three inherent drawbacks: excessive training data and computing power consumption, susceptibility to catastrophic forgetting, and a deficiency in logical reasoning capabilities within black-box models. To address these challenges, we draw insights from human memory mechanisms to introduce “machine memory,” which we define as a storage structure formed by encoding external information into a machine-representable and computable format. Centered on machine memory, we propose the brand-new machine memory intelligence (M 2 I) framework, which encompasses representation, learning, and reasoning modules and loops. We explore the key issues and recent advances in the four core aspects of M 2 I, including neural mechanisms, associative representation, continual learning, and collaborative reasoning within machine memory. M 2 I aims to liberate machine intelligence from the confines of data-centric neural networks and fundamentally break through the limitations of existing large models, driving a qualitative leap from weak to strong AI.

关键词： Machine memory intelligence Neural mechanism Associative representation Continual learning Collaborative reasoning

来源：评论

学校读者我要写书评

暂无评论

Nonlinear Cross-Domain Feature Representation Learning Method Based on Dual Constraints

Nonlinear Cross-Domain Feature Representation Learning Metho...

引用

IEEE International Conference on Big knowledge (ICBK)

作者： Han Ding Yuhong Zhang Shuai Yang Yaojin Lin Key Laboratory of Knowledge Engineering with Big Data (Hefei University of Technology) Ministry of Education School of Computer Science and Information Engineering Hefei University of Technology Hefei China Key Laboratory of Data Science and Intelligence Application Fujian Province University Zhangzhou China

Feature representation learning is a research focus in domain adaptation. Recently, due to the fast training speed, the marginalized Denoising Autoencoder (mDA) as a standing deep learning model has been widely utilized for feature representation learning. However, the training of mDA suffers from the lack of nonlinear relationship and does not explicitly consider the distribution discrepancy between domains. To address these problems, this paper proposes a novel method for feature representation learning, namely Nonlinear cross-domain Feature learning based Dual Constraints (NFDC), which consists of kernelization and dual constraints. Firstly, we introduce kernelization to effectively extract nonlinear relationship in feature representation learning. Secondly, we design dual constraints including Maximum Mean Discrepancy (MMD) and Manifold Regularization (MR) in order to minimize distribution discrepancy during the training process. Experimental results show that our approach is superior to several state-of-the-art methods in domain adaptation tasks.

关键词： Noise reduction Manifolds Training Adaptation models Kernel Deep learning Feature extraction

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：