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

arXiv 2024年

作者： Boelts, Jan Deistler, Michael Gloeckler, Manuel Tejero-Cantero, Álvaro Lueckmann, Jan-Matthis Moss, Guy Steinbach, Peter Moreau, Thomas Muratore, Fabio Linhart, Julia Durkan, Conor Vetter, Julius Miller, Benjamin Kurt Herold, Maternus Ziaeemehr, Abolfazl Pals, Matthijs Gruner, Theo Bischoff, Sebastian Krouglova, Anastasia N. Gao, Richard Lappalainen, Janne K. Mucsányi, Bálint Pei, Felix Schulz, Auguste Stefanidi, Zinovia Rodrigues, Pedro L.C. Schröder, Cornelius Zaid, Faried Abu Beck, Jonas Kapoor, Jaivardhan Greenberg, David S. Gonçalves, Pedro J. Macke, Jakob H. Machine Learning in Science University of Tübingen Germany Tübingen AI Center Germany TransferLab AppliedAI Institute for Europe Germany ML Colab Cluster ML in Science University of Tübingen Germany Google Research United States Helmholtz-Zentrum Dresden-Rossendorf Germany Université Paris-Saclay INRIA CEA Palaiseau France Robert Bosch GmbH Germany School of Informatics University of Edinburgh United Kingdom University of Amsterdam Netherlands Research and Innovation Center BMW Group Germany Institute for Applied Mathematics and Scientific Computing University of the Bundeswehr Munich Germany Aix Marseille INSERM INS France TU Darmstadt Hessian.AI Germany University Hospital Tübingen M3 Research Center Germany Faculty of Science KU Leuven B-3000 Belgium Imec Belgium Methods of Machine Learning University of Tübingen Germany Neuroscience Institute Carnegie Mellon University United States Université Grenoble Alpes INRIA CNRS Grenoble INP LJK France Hertie Institute for AI in Brain Health University of Tübingen Germany Institute of Coastal Systems - Analysis and Modeling Helmholtz AI Germany Departments of Computer Science Electrical Engineering KU Leuven Belgium Department Empirical Inference Max Planck Institute for Intelligent Systems Tübingen Germany

Scientists and engineers use simulators to model empirically observed phenomena. However, tuning the parameters of a simulator to ensure its outputs match observed data presents a significant challenge. Simulation-based inference (SBI) addresses this by enabling Bayesian inference for simulators, identifying parameters that match observed data and align with prior knowledge. Unlike traditional Bayesian inference, SBI only needs access to simulations from the model and does not require evaluations of the likelihood-function. In addition, SBI algorithms do not require gradients through the simulator, allow for massive parallelization of simulations, and can perform inference for different observations without further simulations or training, thereby amortizing inference. Over the past years, we have developed, maintained, and extended sbi, a PyTorch-based package4 that implements Bayesian SBI algorithms based on neural networks. The sbi toolkit implements a wide range of inference methods, neural network architectures, sampling methods, and diagnostic tools. In addition, it provides well-tested default settings but also offers flexibility to fully customize every step of the simulation-based inference workflow. Taken together, the sbi toolkit enables scientists and engineers to apply state-of-the-art SBI methods to black-box simulators, opening up new possibilities for aligning simulations with empirically observed data. © 2024, CC BY-SA.

关键词： Neural networks

来源：评论

学校读者我要写书评

暂无评论

Dataset search in biodiversity research: Do metadata in data repositories reflect scholarly information needs?

arXiv

引用

arXiv 2020年

作者： Löffler, Felicitas Wesp, Valentin König-Ries, Birgitta Klan, Friederike Heinz-Nixdorf Chair for Distributed Information Systems Department of Mathematics and Computer Science Friedrich Schiller University Jena Jena Germany Michael-Stifel-Center for Data-Driven and Simulation Science Jena Germany Halle-Jena-Leipzig Germany Citizen Science Group DLR-Institute of Data Science German Aerospace Center Jena Germany

The increasing amount of publicly available research data provides the opportunity to link and integrate data in order to create and prove novel hypotheses, to repeat experiments or to compare recent data to data collected at a different time or place. However, recent studies have shown that retrieving relevant data for data reuse is a time-consuming task in daily research practice. In this study, we explore what hampers dataset retrieval in biodiversity research, a field that produces a large amount of heterogeneous data. We analyze the primary source in dataset search - metadata - and determine if they reflect scholarly search interests. We examine if metadata standards provide elements corresponding to search interests, we inspect if selected data repositories use metadata standards representing scholarly interests, and we determine how many fields of the metadata standards used are filled. To determine search interests in biodiversity research, we gathered 169 questions that researchers aimed to answer with the help of retrieved data, identified biological entities and grouped them into 13 categories. The categories were evaluated with nine biodiversity scholars who assigned one of the types to pre-labeled biological entities in the questions. Our findings indicate that environments, materials and chemicals, species, biological and chemical processes, locations, data parameters and data types are important search interests in biodiversity research. The comparison with existing metadata standards shows that domain-specific standards cover search interests quite well, whereas general standards do not explicitly contain elements that reflect search interests. We inspect metadata from five large data repositories. Our results confirm that metadata currently poorly reflect search interests in biodiversity research. From these findings, we derive recommendations for researchers and data repositories how to bridge the gap between search interest and metadata provided.

关键词： Semantic Web

来源：评论

学校读者我要写书评

暂无评论

Learning distributed Controllers for V-Formation

Learning Distributed Controllers for V-Formation

引用

Autonomic Computing and Self-Organizing systems (ACSOS),International Conference on

作者： Shouvik Roy Usama Mehmood Radu Grosu Scott A. Smolka Scott D. Stoller Ashish Tiwari Department of Computer Science Stony Brook University Stony Brook NY USA Cyber-Physical Systems Group Technische Universitat Wien Wien Austria Microsoft Research San Francisco CA USA

ISBN: (数字)9781728172774

ISBN: (纸本)9781728172781

We show how a high-performing, fully distributed and symmetric neural V-formation controller can be synthesized from a Centralized MPC (Model Predictive Control) controller using Deep Learning. This result is significant as we also establish that under very reasonable conditions, it is impossible to achieve V-formation using a deterministic, distributed, and symmetric controller. The learning process we use for the neural V-formation controller is significantly enhanced by CEGkR, a CounterexampleGuided k-fold Retraining technique we introduce, which extends prior work in this direction in important ways. Our experimental results show that our neural V-formation controller generalizes to a significantly larger number of agents than for which it was trained (from 7 to 15), and exhibits substantial speedup over the MPC-based controller. We use a form of statistical model checking to compute confidence intervals for our neural Vformation controller's convergence rate and time to convergence.

关键词： Cost function Acceleration Training data Convergence Predictive control computer science

来源：评论

学校读者我要写书评

暂无评论

V-formation as model predictive control

arXiv

引用

arXiv 2020年

作者： Grosu, Radu Lukina, Anna Smolka, Scott A. Tiwari, Ashish Varadarajan, Vasudha Wang, Xingfang Cyber-Physical Systems Group Technische Universität Wien Austria Institute of Science and Technology Austria Department of Computer Science Stony Brook University Stony BrookNY United States Microsoft Research United States

We present recent results that demonstrate the power of viewing the problem of V-formation in a flock of birds as one of Model Predictive Control (MPC). The V-formation-MPC marriage can be understood in terms of the problem of synthesizing an optimal plan for a continuous-space and continuous-time Markov decision process (MDP), where the goal is to reach a target state that minimizes a given cost function. First, we consider ARES, an approximation algorithm for generating optimal plans (action sequences) that take an initial state of an MDP to a state whose cost is below a specified (convergence) threshold. ARES uses Particle Swarm Optimization, with adaptive sizing for both the receding horizon and the particle swarm. Inspired by Importance Splitting, the length of the horizon and the number of particles are chosen such that at least one particle reaches a next-level state. ARES can alternatively be viewed as a model-predictive control (MPC) algorithm that utilizes an adaptive receding horizon, aka Adaptive MPC (AMPC). We next present distributed AMPC (DAMPC), a distributed version of AMPC that works with local neighborhoods. We introduce adaptive neighborhood resizing, whereby the neighborhood size is determined by the cost-based Lyapunov function evaluated over a global system state. Our experiments show that DAMPC can perform almost as well as centralized AMPC, while using only local information and a form of distributed consensus in each time step. Finally, inspired by security attacks on cyber-physical systems, we introduce controller-attacker games (CAG), where two players, a controller and an attacker, have antagonistic objectives. We formulate a special case of CAG called V-formation games, where the attacker's goal is to prevent the controller from attaining V-formation. We demonstrate how adaptation in the design of the controller helps in overcoming certain attacks. Copyright © 2020, The Authors. All rights reserved.

关键词： Model predictive control

来源：评论

学校读者我要写书评

暂无评论

Enhancing data harvesting systems: Performance quantification of Cloud-Edge-sensor networks using queueing theory

引用

ICT Express 2025年

作者： Jose Wanderlei Rocha Eder Gomes Vandirleya Barbosa Arthur Sabino Luiz Nelson Lima Gustavo Callou Francisco Airton Silva Eunmi Choi Tuan Anh Nguyen Dugki Min Jae-Woo Lee Laboratory of Applied Research to Distributed Systems (PASID) Federal University of Piaui (UFPI) Picos Piaui R. Cicero Duarte No. 905 - Junco 64607-670 Brazil School of Software College of Computer Science Kookmin University Seoul 02707 South Korea Department of Software Engineering Faculty of Information Technology Ho Chi Minh City University of Industry and Trade (HUIT) Ho Chi Minh City 700000 Viet Nam Department of Artificial Intelligence Graduate School Konkuk University Seoul 05029 South Korea Department of Computer Science and Engineering College of Engineering Konkuk University Seoul 05029 South Korea Department of Aerospace Engineering Konkuk University Seoul 05029 South Korea

This study investigates a Cloud-Edge-sensors infrastructure using M/M/c/K queuing theory to analyze agricultural data systems’ performance. It focuses on optimizing data handling and evaluates the system configuration impacts on performance. The model significantly enhances efficiency and scalability, minimizing the need for extensive physical infrastructure. Analysis shows over 90% utilization in both layers, highlighting the model’s applicability to various IoT applications. The M/M/c/K queuing model addresses scalability and real-time data processing challenges in agricultural cloud–edge-sensor networks, improving over traditional methods lacking dynamic scalability. Designed for optimized resource use and reduced data handling delays, this model proves crucial in precision agriculture, where timely data is essential for decision-making. Its versatility extends to various agricultural applications requiring efficient real-time analysis and resource management.

关键词： Data harvesting Agricultural monitoring system Queuing model Sensors Performance

来源：评论

学校读者我要写书评

暂无评论

Factor Graph Weight Particles aided distributed Underwater Cooperative Positioning Algorithm

Research Square

引用

research Square 2021年

作者： Zhang, Lingling Yu, Baoguo Tang, Chengkai Zhang, Yi Song, Houbing School of Marine Science and Technology Northwestern Polytechnical University Xi’an710072 China The 54th Research Institute of China Electronics Technology Group Corporation Shijiazhuang China School of Electronics and Information Northwestern Polytechnical University Xi’an710072 China Department of Electrical Computer Software and Systems Engineering Embry-Riddle Aeronautical University FL32114 United States

The growing scale of marine exploration requires high-resolution underwater localization, which necessitates cooperation among underwater network nodes, considering the channel complexity and power efficiency. In this paper, we proposed factor graph weight particles aided distributed underwater nodes cooperative positioning algorithm (WP-DUCP). It capitalized on the factor graph and sum-product algorithm to decompose the global optimization to the product of several local optimization functions. Combined with the Gaussian parameters to construct the weighted particles and to realize the belief transfer, it shows low complexity and high efficiency, suitable to the energy-restricted and communication distance-limited underwater networks. In terms of convergence, localization resolution, and computation complexity, we conducted the simulation and real-test with comparison to the existing co-localization methods. The results verified a higher resolution of the proposed method with no extra computation burden. © 2021, CC BY.

关键词： Global optimization

来源：评论

学校读者我要写书评

暂无评论

Coverage probability of distributed irs systems under spatially correlated channels

arXiv

引用

arXiv 2021年

作者： Papazafeiropoulos, Anastasios Pan, Cunhua Elbir, Ahmet Kourtessis, Pandelis Chatzinotas, Symeon John, M. The Communications and Intelligent Systems Research Group University of Hertfordshire HatfieldAL10 9AB United Kingdom SnT The University of Luxembourg Luxembourg The School of Electronic Engineering and Computer Science Queen Mary University of London LondonE1 4NS United Kingdom The EE department of Duzce University Duzce Turkey

This paper suggests the use of multiple distributed intelligent reflecting surfaces (IRSs) towards a smarter control of the propagation environment. Notably, we also take into account the inevitable correlated Rayleigh fading in IRS-assisted systems. In particular, in a single-input and single-output (SISO) system, we consider and compare two insightful scenarios, namely, a finite number of large IRSs and a large number of finite size IRSs to show which implementation method is more advantageous. In this direction, we derive the coverage probability in closed-form for both cases contingent on statistical channel state information (CSI) by using the deterministic equivalent (DE) analysis. Next, we obtain the optimal coverage probability. Among others, numerical results reveal that the addition of more surfaces outperforms the design scheme of adding more elements per surface. Moreover, in the case of uncorrelated Rayleigh fading, statistical CSI-based IRS systems do not allow the optimization of the coverage probability. © 2021, CC BY.

关键词： 5G mobile communication systems

来源：评论

学校读者我要写书评

暂无评论

Learning distributed Controllers for V-Formation

arXiv

引用

arXiv 2020年

作者： Roy, Shouvik Mehmood, Usama Grosu, Radu Smolka, Scott A. Stoller, Scott D. Tiwari, Ashish Department of Computer Science Stony Brook University Stony BrookNY United States Cyber-Physical Systems Group Technische Universitat Wien Wien Austria Microsoft Research San FranciscoCA United States

We show how a high-performing, fully distributed and symmetric neural V-formation controller can be synthesized from a Centralized MPC (Model Predictive Control) controller using Deep Learning. This result is significant as we also establish that under very reasonable conditions, it is impossible to achieve V-formation using a deterministic, distributed, and symmetric controller. The learning process we use for the neural V-formation controller is significantly enhanced by CEGkR, a Counterexample-Guided k-fold Retraining technique we introduce, which extends prior work in this direction in important ways. Our experimental results show that our neural V-formation controller generalizes to a significantly larger number of agents than for which it was trained (from 7 to 15), and exhibits substantial speedup over the MPC-based controller. We use a form of statistical model checking to compute confidence intervals for our neural V-formation controller’s convergence rate and time to convergence. Copyright © 2020, The Authors. All rights reserved.

关键词： Controllers

来源：评论

学校读者我要写书评

暂无评论

Satellite-based InSAR Geodesy and Collocation with GNSS

引用

Procedia computer science 2024年 239卷 2329-2340页

作者： Juraj Papco Matus Bakon Lukas Kubica Gabika Belicova Branislav Droscak Martin Ferianc Martin Rovnak Antonio M. Ruiz Joaquim J. Sousa Department of Theoretical Geodesy and Geoinformatics Faculty of Civil Engineering Slovak University of Technology in Bratislava Radlinskeho 11 813 62 Bratislava Slovakia insar.sk Ltd Konstantinova 3 080 01 Presov Slovakia Department of Finance Accounting and Mathematical Methods Faculty of Management and Business University of Presov Konstantinova 16 080 01 Presov Slovakia Department of Engineering School of Sciences and Technology Universidade de Trás-os-Montes e Alto Douro Quinta de Prados 5000-801 Vila Real Portugal Geodetic and Cartographic Institute Bratislava Chlumeckeho 4 827 45 Bratislava Slovakia Department of Cartographic Geodetic and Photogrammetry Engineering University of Jaén Campus Las Lagunillas s/n 23071 Jaén Spain Center for Advanced Studies in Earth Sciences Energy and Environment (CEACTEMA) University of Jaén Campus Las Lagunillas s/n 23071 Jaén Spain Research Group RNM-282 Microgeodesia Jaén University of Jaén Campus Las Lagunillas s/n 23071 Jaén Spain Institute for Systems and Computer Engineering Technology and Science INESC-TEC 4200-465 Porto Portugal

Satellite radar interferometry (InSAR) enables large-scale monitoring of displacement with precision akin to ground-based methods. Using measurements from Sentinel-1 satellites, persistent scatterer networks cover areas up to hundreds of kilometers in size. One of the current challenges for the InSAR community is to tie these networks into a current and country-specific global terrestrial reference system through collocation with other geodetic techniques, especially Global Navigation Satellite systems (GNSS). In this work, an optimal procedure for assessing a suitable collocation properties for InSAR and GNSS techniques is discussed, along with the proposal for the methodology to determine the spatial relationship between the reference points of both techniques. The study analyzes three collocation stations in Slovakia using their radar backscattering characteristics. InSAR achieves an intrinsic accuracy of up to 1 mm but has uncertainties several orders of magnitude larger in 3D space. A collocation of InSAR measurements with GNSS can tie relative InSAR displacement estimates to an absolute reference frame.

关键词： InSAR geodesy collocation GNSS

来源：评论

学校读者我要写书评

暂无评论

Security in Process: Detecting Attacks in Industrial Process Data

arXiv

引用

arXiv 2019年

作者： Duque Anton, Simon D. Garth, Christoph Lohfink, Anna Pia Schotten, Hans Dieter German Research Center for AI Intelligent Networks Research Group Kaiserslautern Germany University of Kaiserslautern Department of Computer Science Kaiserslautern Germany

Due to the fourth industrial revolution, industrial applications make use of the progress in communication and embedded devices. This allows industrial users to increase efficiency and manageability while reducing cost and effort. Furthermore, the fourth industrial revolution, creating the so-called Industry 4.0, opens a variety of novel use and business cases in the industrial environment. However, this progress comes at the cost of an enlarged attack surface of industrial companies. Operational networks that have previously been phyiscally separated from public networks are now connected in order to make use of new communication capabilites. This motivates the need for industrial intrusion detection solutions that are compatible to the long-term operation machines in industry as well as the heterogeneous and fast-changing networks. In this work, process data is analysed. The data is created and monitored on real-world hardware. After a set up phase, attacks are introduced into the systems that influence the process behaviour. A time series-based anomaly detection approach, the Matrix Profiles, are adapted to the specific needs and applied to the intrusion detection. The results indicate an applicability of these methods to detect attacks in the process behaviour. Furthermore, they are easily integrated into existing process environments. Additionally, one-class classifiers One-Class Support Vector Machines and Isolation Forest are applied to the data without a notion of timing. While Matrix Profiles perform well in terms of creating and visualising results, the one-class classifiers perform poorly. Copyright © 2019, The Authors. All rights reserved.

关键词： Time series

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：