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

Algorithmic process synthesis and optimization for multiple time periods including waste treatment: Latest developments in software P-graph Studio 23

学校读者我要写书评

暂无评论

Algorithmic process synthesis and optimization for multiple ...

23rd International Congress of Chemical and Process Engineering, CHISA 2018 and 21st Conference on Process Integration, Modelling and Optimisation for Energy Saving and Pollution Reduction, PRES 2018

作者： Bertok, B. Bartos, A. Univ. of Pannonia Dep. Computer Science Arid Systems Technology Egyetcm u. 10 VeszpremH-8200 Hungary

Modeling biological complexity using Biology System Description Language (BiSDL)

学校读者我要写书评

暂无评论

Modeling biological complexity using Biology System Descript...

2018 IEEE International Conference on Bioinformatics and Biomedicine, BIBM 2018

作者： Muggianu, F. Benso, A. Bardini, R. Hu, E. Politano, G. Carlo, S. Di Control and Computer Eng. Dep. Politecnico di Torino Torino Italy Massachusetts Institute of Technology Boston MA United States

ISBN: (纸本)9781538654880

The Nets-within-Nets formalism (NWN) allows to model complex biological systems expressing hierarchy, encapsulation, selective communication, spatiality, quantitative mechanisms, and stochasticity. To make NWN usable by life science researchers as well as systems biologists, we introduce a new human-readable description language able to express these same NWN model properties, at different levels of abstraction. BiSDL (Biology Systems Description Language) is derived from the VHDL specification, a standard description language for hardware systems. In this paper we chose a simple signaling pathway example to show how BiSDL enables modeling complex biological systems by separating the behavioral model from the architectural details. © 2018 IEEE.

关键词： Modeling languages

NTEP-DB 1.0: A relational database for the national turfgrass evaluation program

学校读者我要写书评

暂无评论

International Turfgrass Society Research Journal

International Turfgrass Society Research Journal 2021年第1期14卷

作者： Yiqun Xie Majid Farhadloo Ning Guo Shashi Shekhar Eric Watkins Len Kne Han Bao Aaron J. Patton Kevin Morris Dep. of Computer Science and Engineering Univ. of Minnesota Minneapolis MN 55455 USA Dep. of Geographical Sciences Univ. of Maryland College Park MD 20740 USA Center for Geospatial Information Science Univ. of Maryland College Park MD 20740 USA Dep. of Horticultural Science Univ. of Minnesota St. Paul MN 55108 USA U-Spatial Univ. of Minnesota Minneapolis MN 55455 USA Dep. of Horticulture and Landscape Architecture Purdue Univ. West Lafayette IN 47907 USA National Turfgrass Evaluation Program Beltsville MD 20705 USA

Given field experiment data collected by the National Turfgrass Evaluation Program (NTEP), we aim to design and create a relational database to store the data and support efficient queries. As one of the most widely-known turfgrass research programs in the world, NTEP has generated large volumes of data on turfgrass cultivars and experimental germplasm since the early 1980s, providing invaluable information for a variety of user groups (e.g., homeowners, seed companies, golf course managers, retailers, turfgrass researchers) to select cultivars that best fit their needs (e.g., winter survival, pest tolerance, turf quality). The datasets have historically been stored in large sets of text files and spreadsheets. Currently, NTEP data are delivered to users through a website ( *** ) as summary reports and it can be extremely tedious (e.g., hundreds of clicks, data merging, jargon) to perform a simple query (e.g., best cultivar selection with typical conditions). This significantly limits the use of NTEP data and hides its value from the public. To address these limitations, we carried out an interdisciplinary effort with horticulture and computer science researchers to design and create the first NTEP database – NTEP-DB 1.0 – to reduce the manual efforts and expert knowledge currently required to extract meaningful information from the data. Experiments confirm that the query results are correct, and that the database can greatly reduce manual efforts. Anticipating next-generation advances, we also recommend incorporating spatial data types and analytical techniques into future designs of the database.

关键词：

Automated Fact Checking in the News Room

学校读者我要写书评

暂无评论

arXiv 2019年

作者： Miranda, Sebastiao Nogueira, David Mendes, Afonso Vlachos, Andreas Secker, Andrew Garrett, Rebecca Mitchel, Jeff Marinho, Zita Priberam Labs Lisbon Portugal Dep. of Computer Science and Technology University of Cambridge Cambridge United Kingdom BBC News Labs London United Kingdom BBC Monitoring London United Kingdom Psychology Dep. University of Bristol Bristol United Kingdom

been highlighted due to recently increased concerns and efforts in combating misinformation. In this paper, we present an automated fact checking platform which given a claim, it retrieves relevant textual evidence from a document collection, predicts whether each piece of evidence supports or refutes the claim, and returns a final verdict. We describe the architecture of the system and the user interface, focusing on the choices made to improve its user friendliness and transparency. We conduct a user study of the factchecking platform in a journalistic setting: We integrated it with a collection of news articles and provide an evaluation of the platform using feedback from journalists in their workflow. We found that the predictions of our platform were correct 58% of the time, and 59% of the returned evidence was relevant. Copyright © 2019, The Authors. All rights reserved.

关键词： User interfaces

A0C: Alpha zero in continuous action space

学校读者我要写书评

暂无评论

arXiv 2018年

作者： Moerland, Thomas M. Broekens, Joost Plaat, Aske Jonker, Catholijn M. Dep. of Computer Science Delft University of Technology Netherlands Dep. of Computer Science Leiden University Netherlands

A core novelty of Alpha Zero is the interleaving of tree search and deep learning, which has proven very successful in board games like Chess, Shogi and Go. These games have a discrete action space. However, many real-world reinforcement learning domains have continuous action spaces, for example in robotic control, navigation and self-driving cars. This paper presents the necessary theoretical extensions of Alpha Zero to deal with continuous action space. We also provide some preliminary experiments on the Pendulum swing-up task, empirically showing the feasibility of our approach. Thereby, this work provides a first step towards the application of iterated search and learning in domains with a continuous action space. Copyright © 2018, The Authors. All rights reserved.

关键词： Reinforcement learning

Monte Carlo tree search for asymmetric trees

学校读者我要写书评

暂无评论

arXiv 2018年

We present an extension of Monte Carlo Tree Search (MCTS) that strongly increases its efficiency for trees with asymmetry and/or loops. Asymmetric termination of search trees introduces a type of uncertainty for which the standard upper confidence bound (UCB) formula does not account. Our first algorithm (MCTS-T), which assumes a non-stochastic environment, backs-up tree structure uncertainty and leverages it for exploration in a modified UCB formula. Results show vastly improved efficiency in a well-known asymmetric domain in which MCTS performs arbitrarily bad. Next, we connect the ideas about asymmetric termination to the presence of loops in the tree, where the same state appears multiple times in a single trace. An extension to our algorithm (MCTS-T+), which in addition to non-stochasticity assumes full state observability, further increases search efficiency for domains with loops as well. Benchmark testing on a set of OpenAI Gym and Atari 2600 games indicates that our algorithms always perform better than or at least equivalent to standard MCTS, and could be first-choice tree search algorithms for non-stochastic, fully-observable environments. Copyright © 2018, The Authors. All rights reserved.

关键词： Trees (mathematics)

Key Frames Extraction Using Spline Curve Fitting for Online Video Summarization

学校读者我要写书评

暂无评论

Key Frames Extraction Using Spline Curve Fitting for Online ...

computer Science and Electronic Engineering Conference (CEEC)

作者： Rana F. Ghani Sawsen A. Mahmood Yaseen Naser Jurn Laith Al-Jobouri Department of Computer Science University of Technology-Iraq Baghdad Iraq College of Education -Computer Science Dep. Al Mustansiriya University Baghdad Iraq College of Engineering University of Information Technology and Communication Baghdad Iraq School of Engineering Art Science and Technology University of Suffolk Ipswich UK

Video summarization methods produce a video abstraction that permits users to obtain an informative video frames with minimum storage space and in less time. The keyframes is significantly characterize the salient contents of the video. This paper presents a design of video summarization framework for Internet videos to provide a quick way to realize, browse and review its contents. The main objective is to determine, extract and collect the most informative frames in the acquired video to formulate a summary video related to the original video. We have suggested a suitable approach for shot boundary detection along video frames. The sudden change benchmark between successive frames has calculated based on spline curve representation of frame data points inspired by capturing the visual difference. As well as, a selection and integration of the key frames from each shot is specified through clustering the higher differences between shot frames, in order to tackle the redundant frames issue and generate the video summary. From the experimental results, the proposed video summary approach is capable of capturing an informative content of video shots and preventing redundancy frames with minimum requirements in terms of storage space.

关键词：

Impact of High Particle Flux in Radiation Ground Tests with Protons

学校读者我要写书评

暂无评论

Impact of High Particle Flux in Radiation Ground Tests with ...

European Conference on Radiation and its Effects on Components and Systems (RADECS)

作者： Mohammadreza Rezaei Pedro Martí n-Holgado Yolanda Morilla Francisco J. Franco Juan Carlos Fabero Hortensia Mecha Helmut Puchner Guillaume Hubert Juan Antonio Clemente Computer Architecture Department Facultad de Inform&#x00E1 tica Universidad Complutense de Madrid (UCM) Madrid Spain Centro Nacional de Aceleradores (Universidad de Sevilla CSIC JA) Sevilla Spain EMFTEL Dep. Institute of Particle and Cosmos Physics (IPARCOS) Fac. de F&#x00ED sica Universidad Complutense de Madrid (UCM) Madrid Spain Cypress Semiconductor Technology R&#x0026 D San Jose CA USA ONERA French Aerospace Laboratory Toulouse France

This abstract presents an experimental study of the impact of using a high flux in radiation ground tests on the measured cross-section of SRAMs. Experimental results obtained with 15 MeV protons will show that using ... 详细信息

ISBN: (数字)9781665412353

ISBN: (纸本)9781665429597

关键词： Protons Sensitivity Atmospheric measurements Europe Neutrons Particle measurements

Optimal explanations of linear models

学校读者我要写书评

暂无评论

arXiv 2019年

作者： Bersimas, Dimitris Jaillet, Patrick Delarue, Arthur Martin, Sebastien Sloan School of Management Massachusetts Institute of Technology CambridgeMA02139 Dep. of Electrical Engineering and Computer Science Massachusetts Institute of Technology CambridgeMA02139 Operations Research Center Massachusetts Institute of Technology CambridgeMA02139

When predictive models are used to support complex and important decisions, the ability to explain a model's reasoning can increase trust, expose hidden biases, and reduce vulnerability to adversarial attacks. However, attempts at interpreting models are often ad hoc and application-specific, and the concept of interpretability itself is not well-defined. We propose a general optimization framework to create explanations for linear models. Our methodology decomposes a linear model into a sequence of models of increasing complexity using coordinate updates on the coefficients. Computing this decomposition optimally is a difficult optimization problem for which we propose exact algorithms and scalable heuristics. By solving this problem, we can derive a parametrized family of interpretability metrics for linear models that generalizes typical proxies, and study the tradeoff between interpretability and predictive accuracy. Copyright © 2019, The Authors. All rights reserved.

关键词： Optimization