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

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

来源：评论

学校读者我要写书评

暂无评论

Finding optimal Stackelberg production strategies: How to produce in times of war?

arXiv

引用

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

来源：评论

学校读者我要写书评

暂无评论

"Did You Hear That?" Learning to Play Video Games from Audio Cues

arXiv

引用

arXiv 2019年

作者： Gaina, Raluca D. Stephenson, Matthew Game AI Research Group Queen Mary University of London United Kingdom Department of Data Science Knowledge Engineering Maasricht University Netherlands

Game-playing AI research has focused for a long time on learning to play video games from visual input or symbolic information. However, humans benefit from a wider array of sensors which we utilise in order to navigate the world around us. In particular, sounds and music are key to how many of us perceive the world and influence the decisions we make. In this paper, we present initial experiments on game-playing agents learning to play video games solely from audio cues. We expand the Video Game Description Language to allow for audio specification, and the General Video Game AI framework to provide new audio games and an API for learning agents to make use of audio observations. We analyse the games and the audio game design process, include initial results with simple Q-Learning agents, and encourage further research in this area. Copyright © 2019, The Authors. All rights reserved.

关键词： Human computer interaction

来源：评论

学校读者我要写书评

暂无评论

Exploring Social Media data for MOOC Recommendation

Exploring Social Media Data for MOOC Recommendation

引用

International Conference on Systems of Collaboration (SysCo)

作者： Sara Assami Najima Daoudi Rachida Ajhoun Department of Computer Science Smart Systems Laboratory Mohammed Vth University Rabat Morocco Department of Data and Knowledge Engineering Information Sciences School (ESI) Rabat Morocco

ISBN: (数字)9781728142166

ISBN: (纸本)9781728142173

MOOCs (Massive Open Online Courses) are a key tool for open education stakeholders and high-level universities to face the problem of limited resources and make education accessible worldwide. Our study relies on the hypothesis of the influence of learning adaptation on the learners' lack of motivation in MOOCs. In this sense, a recommendation approach could stimulate the learner's interest in specific MOOCs. In previous research, we have identified the recommendation criteria to recommend MOOCs adapted to the learner's needs and motivations. Then, we modeled the ontology of the learning actors' profiles for the matching of the characteristics of learners with adapted MOOCs. Afterward, we designed the functional architecture and use cases of a semantic recommendation system to stimulate learners' interest in MOOCs. However, the recommendation process is still hindered by the learner profile on these platforms that doesn't represent the learner's interests and motivations. Yet, social media profiles extraction can be an external data source for learners' profile enrichment. So, the purpose of this research is to use social media mining for the acquisition of personal and professional data about learners. Therefore, we apply the first phases of data mining on a social media dataset to explore the potentially meaningful data for MOOC recommendation.

关键词： Social networking (online) data mining Educational courses Recommender systems Computer aided instruction

来源：评论

学校读者我要写书评

暂无评论

Myocardial Ischemia Diagnosis Using a Reduced Lead System 40

Myocardial Ischemia Diagnosis Using a Reduced Lead System

引用

40th Annual International Conference of the IEEE engineering in Medicine and Biology Society, EMBC 2018

作者： Aranda Hernandez, A. Bonizzi, P. Karel, J. Peeters, R. Department of Research and Technology Bakken Research Center Medtronic Maastricht Netherlands Department of Data Science and Knowledge Engineering Maastricht University Maastricht Netherlands

ISBN: (纸本)9781538636466

This research presents a novel statistical model for diagnosing acute myocardial infarction (AMI). The model is based on features extracted from a reduced lead system consisting of a subset of three leads from the standard 12-lead ECG. We selected a set of relevant parameters commonly used in the clinical practice for ECG-based AMI diagnosis, namely ST elevation and T-wave maximum. We also selectedfeatures, not used in clinical practice, that were derived from vectorcardiography and computed on the reduced three-lead system (pseudo-VCG parameters). To validate the model, we used 104 patients coming from the Physionet STAFF III database which contains 12-lead ECG recordings at baseline and in coronary artery occlusion condition during angioplasty (PTCA). Results show that pseudo-VCG features are able to diagnose AMI slightly better than ST elevation and T-wave maximum features together (area under the ROC curve (AUC) 0.87 vs AUC 0.85). When combining pseudo-VCG features together with ST elevation, and T-wave maximum, the performance improved significantly (AUC 0.95, sensitivity 89.6% and specificity 82.7%). Results indicate a potential for diagnosing AMI using the proposed reduced lead system and the selected set of features. We suggest its possible use for diagnosing AMI in long-term, ambulatory and home monitoring situations, allowing an earlier and faster diagnosis. © 2018 IEEE.

关键词： Electrocardiography Feature extraction Heart Myocardium databases Lead Standards

来源：评论

学校读者我要写书评

暂无评论

Self-concordant analysis of frank-wolfe algorithms

arXiv

引用

arXiv 2020年

作者： Dvurechensky, Pavel Shtern, Shimrit Staudigl, Mathias Ostroukhov, Petr Safin, Kamil Weierstrass Institute for Applied Analysis and Stochastics Mohrenstr. 39 Berlin10117 Germany Faculty of Industrial Engineering and Management Technion - Israel Institute of Technology Haifa Israel Department of Data Science and Knowledge Engineering Maastricht University P.O. Box 616 MaastrichtNL-6200 MD Netherlands Moscow Institute of Physics and Technology Dolgoprudny Russia

Projection-free optimization via different variants of the Frank-Wolfe (FW) method has become one of the cornerstones in optimization for machine learning since in many cases the linear minimization oracle is much cheaper to implement than projections and some sparsity needs to be preserved. In a number of applications, e.g. Poisson inverse problems or quantum state tomography, the loss is given by a self-concordant (SC) function having unbounded curvature, implying absence of theoretical guarantees for the existing FW methods. We use the theory of SC functions to provide a new adaptive step size for FW methods and prove global convergence rate O(1/k), k being the iteration counter. If the problem can be represented by a local linear minimization oracle, we are the first to propose a FW method with linear convergence rate without assuming neither strong convexity nor a Lipschitz continuous *** Codes 65K05, 90C25, Copyright © 2020, The Authors. All rights reserved.

关键词： Inverse problems

来源：评论

学校读者我要写书评

暂无评论

Retrospective motion correction of MR images using prior-assisted deep learning

arXiv

引用

arXiv 2020年

作者： Chatterjee, Soumick Sciarra, Alessandro Dünnwald, Max Oeltze-Jafra, Steffen Nürnberger, Andreas Speck, Oliver Department of Biomedical Magnetic Resonance Data and Knowledge Engineering Group Faculty of Computer Science Otto-von-Guericke Univeristy Magdeburg Germany MedDigit Department of Neurology Medical Faculty University Hopspital Department of Biomedical Magnetic Resonance Otto-von-Guericke Univeristy Magdeburg Germany MedDigit Department of Neurology Medical Faculty University Hopspital Faculty of Computer Science Otto-von-Guericke Univeristy Magdeburg Germany MedDigit Department of Neurology Medical Faculty University Hopspital German Centre for Neurodegenerative Diseases Center for Behavioral Brain Sciences Magdeburg Germany Data and Knowledge Engineering Group Faculty of Computer Science Otto-von-Guericke Univeristy Center for Behavioral Brain Sciences Magdeburg Germany Department of Biomedical Magnetic Resonance Otto-von-Guericke Univeristy German Centre for Neurodegenerative Diseases Leibniz Institute for Neurobiology Center for Behavioral Brain Sciences Magdeburg Germany

In MRI, motion artefacts are among the most common types of artefacts. They can degrade images and render them unusable for accurate diagnosis. Traditional methods, such as prospective or retrospective motion correction, have been proposed to avoid or alleviate motion artefacts. Recently, several other methods based on deep learning approaches have been proposed to solve this problem. This work proposes to enhance the performance of existing deep learning models by the inclusion of additional information present as image priors. The proposed approach has shown promising results and will be further investigated for clinical validity. Copyright © 2020, The Authors. All rights reserved.

关键词： Magnetic resonance imaging

来源：评论

学校读者我要写书评

暂无评论

Ludii and XCSP: Playing and solving logic puzzles

arXiv

引用

arXiv 2019年

作者： Piette, Cedric Piette, Eric Stephenson, Matthew Soemers, Dennis J.N.J. Browne, Cameron Centre de Recherche en Informatique de Lens Universite d'Artois Lens France Department of Data Science and Knowledge Engineering Maastricht University Maastricht

Many of the famous single-player games, commonly called puzzles, can be shown to be NP-Complete. Indeed, this class of complexity contains hundreds of puzzles, since people particularly appreciate completing an intractable puzzle, such as Sudoku, but also enjoy the ability to check their solution easily once it's done. For this reason, using constraint programming is naturally suited to solve them. In this paper, we focus on logic puzzles described in the Ludii general game system and we propose using the XCSP formalism in order to solve them with any CSP solver. Copyright © 2019, The Authors. All rights reserved.

关键词： knowledge representation

来源：评论

学校读者我要写书评

暂无评论

Treewidth of display graphs: Bounds, brambles and applications

引用

Journal of Graph Algorithms and Applications 2019年第4期23卷 715-743页

作者： Janssen, Remie Jones, Mark Kelk, Steven Stamoulis, Georgios Wu, Taoyang Delft Institute for Applied Mathematics Delft University of Technology Netherlands Department of Data Science and Knowledge Engineering Maastricht University Netherlands School of Computing Sciences University of East Anglia United Kingdom

Phylogenetic trees and networks are leaf-labelled graphs used to model evolution. Display graphs are created by identifying common leaf labels in two or more phylogenetic trees or networks. The treewidth of such graphs is bounded as a function of many common dissimilarity measures between phylogenetic trees and this has been leveraged in fixed param- eter tractability results. Here we further elucidate the properties of dis- play graphs and their interaction with treewidth. We show that it is NP-hard to recognize display graphs, but that display graphs of bounded treewidth can be recognized in linear time. Next we show that if a phyloge- netic network displays (i.e. topologically embeds) a phylogenetic tree, the treewidth of their display graph is bounded by a function of the treewidth of the original network (and also by various other parameters). In fact, us- ing a bramble argument we show that this treewidth bound is sharp up to an additive term of 1. We leverage this bound to give an FPT algorithm, parameterized by treewidth, for determining whether a network displays a tree, which is an intensively-studied problem in the field. We conclude with a discussion on the future use of display graphs and treewidth in phylogenetics. © 2019, Brown University. All rights reserved.

关键词： Graphic methods

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：