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

IEEE International Symposium on Information Theory (ISIT)

作者： Jain, Sarthak Cardone, Martina Mohajer, Soheil Univ Minnesota Minneapolis MN 55455 USA

ISBN: (纸本)9781665421607;9781665421591

This paper considers a distributed computing framework, where the task of T matrix-vector products is distributed among n worker machines. External adversaries have access to a subset L (the cardinality of which is |L|) of these machines, and can maliciously perturb the result of each of their computations with probability alpha. To correctly recover each matrix-vector product, the master has to identify a set (of a fixed cardinality) of 'unattacked' worker machines. Towards this end, this work proposes four schemes that aim at performing such an identification. These schemes are analyzed and compared under different regimes of (|L|;alpha) for the two cases when |L| is (1) known or (2) unknown at the master.

关键词： Reliability theory Task analysis distributed computing Information theory

来源：评论

学校读者我要写书评

暂无评论

Facilitating sensitivity analysis of hydrological models through knowledge-driven configuration and distributed online model services

引用

JOURNAL OF HYDROLOGY 2025年 660卷

作者： Ma, Peilong Chen, Min Zhang, Shuo Zhu, Zhiyi Qian, Zhen Ma, Zaiyang Zhang, Fengyuan Li, Wenwen Yue, Songshan Wen, Yongning Nanjing Normal Univ Key Lab Virtual Geog Environm Minist Educ PRC Nanjing 210023 Jiangsu Peoples R China Jiangsu Ctr Collaborat Innovat Geog Informat Resou Nanjing 210023 Jiangsu Peoples R China State Key Lab Cultivat Base Geog Environm Evolut Nanjing 210023 Jiangsu Peoples R China Tech Univ Munich Sch Engn & Design Earth Syst Modelling D-80333 Munich Germany Potsdam Inst Climate Impact Res D-14473 Brandenburg Germany Nanjing Univ Informat Sci & Technol Sch Geog Sci Nanjing 210044 Jiangsu Peoples R China

Hydrological models (HMs) are essential for understanding the complexities of the water cycle and runoff dynamics. Sensitivity analysis (SA), an essential component of HMs, plays a key role in identifying the parameters that have the greatest impact on model outcomes. It helps to simplify the complexity of hydrological systems and provides a comprehensive understanding of the underlying physical processes. However, the complexity of HMs and the diversity of SA methods pose significant challenges for researchers, making the SA configuration process intricate and requiring substantial computational resources. To address these challenges, we propose a comprehensive strategy that integrates knowledge-driven configuration services with distributed online model services. First, we establish a rule-based knowledge repository and a case-based knowledge repository. These repositories provide general configuration guidance and similar SA case recommendations, respectively, to support decision-making in critical SA steps. This ensures that the configuration of SA is accurate and reliable. Secondly, we encapsulate HMs as web services and leverage distributed computing resources to optimize execution efficiency. Then, we integrate the HM services with the SA modules to achieve a complete SA experiment. Based on this strategy, we finally developed a prototype system that offers a userfriendly tool for conducting SA with enhanced computational performance and streamlined workflow. The watershed-scale HM, SWAT, was used to test the effectiveness of the prototype system. The results demonstrate that this strategy enables more comprehensive analysis and improves decision-making through configuration guidance, and holds promise for enhancing the reliability and efficiency of SA in hydrological modeling.

关键词： Hydrological model Sensitivity analysis Knowledge service Online model service distributed computing

来源：评论

学校读者我要写书评

暂无评论

Test-and-Decode: A Partial Recovery Scheme for Verifiable Coded computing 23rd

Test-and-Decode: A Partial Recovery Scheme for Verifiable Co...

引用

23rd International Conference on Algorithms and Architectures for Parallel Processing (ICA3PP)

作者： Jiang, Wei Wang, Jin Li, Lingzhi Yu, Dongyang Liu, Can Soochow Univ Sch Comp Sci & Technol Suzhou Peoples R China Soochow Univ Sch Future Sci & Engn Suzhou Peoples R China

ISBN: (纸本)9789819708581;9789819708598

Coded computing has proven its efficiency in tolerating stragglers in distributed computing. Workers return the sub-computation results to the master after computing, and the master recovers the final computation result by decoding. However, the workers may provide incorrect results, which leads to wrong final result. Therefore, it is meaningful to improve the resilience of coded computing against errors. Most existing verification schemes only use the workers' fully correct computations to recover the final result, and the defective computations are not considered for decoding. In this paper, we focus on matrix multiplication and design a general Test-and-Decode (TD) scheme to recover the final result efficiently. Furthermore, we divide each sub-computation result into multiple parts and fully use the correct parts for partial recovery, which can improve the tolerance for errors in computations. Decoding is performed only when the verification result satisfies the permission, which avoids repetitive decoding. We conduct extensive simulation experiments to evaluate the probability of successful recovery of the results and the computation time of the TD scheme. We also compare the TD scheme with other verification schemes and the results show that it outperforms the current schemes in terms of efficiency in verifying and recovering computational results.

关键词： Coded computing distributed computing Matrix Multiplication Partial Recovery

来源：评论

学校读者我要写书评

暂无评论

The topology of local computing in networks

引用

Journal of Applied and Computational Topology 2024年第4期8卷 1069-1098页

作者： Fraigniaud, Pierre Paz, Ami Institut de Recherche en Informatique Fondamentale CNRS Université Paris Cité Laboratoire Interdisciplinaire des Sciences du Numérique CNRS Université Paris-Saclay

For more than three decades, distributed systems have been described and analyzed using topological tools, primarily using two techniques: protocol complexes and directed algebraic topology. In both cases, the considered computational model generally assumes communication via shared objects (typically a shared memory consisting of a collection of read-write registers) or message-passing enabling direct communication between any pair of processes. This paper aims to examine the use of protocol complexes in the study of network computing. In this case, processes are located at the network nodes and communicate by exchanging messages only along the network’s edges (i.e., not every pair of processes can directly communicate). There are several reasons why applying the topological approach to network computing can be challenging, and a prominent one is that node identifiers yield protocol complexes whose sizes grow exponentially with the size of the underlying network. However, many of the problems studied in this context are of local nature, and their definitions do not depend on the identifiers or the network size. We leverage this independence to meet the above challenge and present local protocol complexes, whose sizes do not depend on the network size. As an application of the “compacted” protocol complexes, we reformulate the celebrated lower bound of Ω(log^∗n) rounds for 3-coloring the n-node ring in the topological framework. © The Author(s), under exclusive licence to Springer Nature Switzerland AG 2024.

关键词： Combinatorial topology distributed algorithms distributed computing distributed graph algorithms Theory of computation

来源：评论

学校读者我要写书评

暂无评论

Safety and Observibility of distributed Broadcast Algorithms 6

Safety and Observibility of Distributed Broadcast Algorithms

引用

6th European Conference on Electrical Engineering and Computer Science (ELECS)

作者： Karaata, Mehmet Hakan Dabees, Aysha Kuwait Univ Dept Comp Engn Kuwait Kuwait

ISBN: (纸本)9781665497794

In this paper, we first show the condition under which the transient faults are observable and the safety requirements are satisfied for a broadcast algorithm. Then we propose the first safe fault-containing and self-healing broadcast algorithm for locally observable faults in tree networks. A locally observable transient fault refers to a transient fault that perturbs the state of a process such that a faulty state of a process could be distinguished from a non-faulty state by all neighbours of the faulty process, and locally non-observable transient faults, otherwise. Our proposed algorithm contains and self-heals an unlimited number of transient faults in at most O(3) rounds provided that any two faulty processes are separated by two non-faulty processes.

关键词： Fault Tolerance Fault Containment distributed computing Safety Self-Stabilization Self-Healing Wave Algorithms

来源：评论

学校读者我要写书评

暂无评论

DYNAMOS: dynamic microservice composition for data-exchange systems, lessons learned 21

DYNAMOS: dynamic microservice composition for data-exchange ...

引用

21st International Conference on Software Architecture (ICSA)

作者： Stutterheim, Jorrit Mifsud, Aleandro Oprescu, Ana Univ Amsterdam Complex Cyber Infrastruct Amsterdam Netherlands

ISBN: (纸本)9798350366266;9798350366259

Data exchange has become increasingly important in modern business and research. Consequently, many initiatives are being developed worldwide to facilitate open data exchange in secure distributed marketplaces. Ideally, each party maintains control over their data and implements access through legal contracts, in the form of programmable policy. Such policy would express where the data exchange takes place, and who has access to the data. Inspired by how traditional Operating Systems abstract the complexities of computer architectures into standardized core functions, this research focuses on abstracting different data exchange patterns into a unified set of core data exchange microservices that adhere to agreed-upon data exchange policies. DYNAMOS implements a distributed data exchange platform and recreates real-life data exchange use cases. It is designed to be self-adaptive, utilizing extendable algorithms to generate dynamic microservice compositions and dynamically choose archetype patterns, influenced by policy, user input, or system events. In our study, we highlight key insights from our experience with a dynamic microservice platform. Employing sidecars for communication abstraction, protocol buffers for strict interface definition, and ephemeral single-use jobs for improved security emerged as pivotal strategies. However, these approaches do introduce a trade-off between operational speed and especially system complexity.

关键词： Microservices distributed computing Data Exchange Self-Adaptivity MAPE-K

来源：评论

学校读者我要写书评

暂无评论

Methodology of Data Popularity Forecasting in High-Energy Physics Experiments on Unbalanced and Irregular Time-series Data

引用

LOBACHEVSKII JOURNAL OF MATHEMATICS 2024年第7期45卷 3072-3084页

作者： Grigorieva, M. A. Popova, N. N. Vartanov, D. A. Shubin, M. V. Moscow Ctr Fundamental & Appl Math Moscow 119234 Russia Lomonosov Moscow State Univ Moscow 119991 Russia

This study introduces a method to forecast data popularity in high energy physics (HEP) experiments, focusing on unbalanced and irregular time-series data. The goal is to predict the popularity of specific datasets accurately over time, which is crucial for optimizing data replication and placement strategies and enhancing distributed computing efficiency in HEP experiments. The methodology utilizes advanced machine learning techniques and time-series analysis to tackle the challenges posed by the unbalanced nature of the data. The paper outlines the key components of the methodology, including data preprocessing and balancing techniques, filtration, and model selection. To evaluate the effectiveness of the presented approach, the authors conduct experiments on real-world HEP datasets, comparing their predictions against actual data. The findings of this study have important implications for resource management and decision-making in distributed computing of various large-scale scientific projects. By providing forecasts of data popularity, researchers and administrators can efficiently allocate resources, optimize data storage and retrieval mechanisms, and improve overall data processing efficiency.

关键词： data popularity high-energy physics distributed computing machine learning predictive analytics time series analysis

来源：评论

学校读者我要写书评

暂无评论

A review of distributed statistical inference

引用

Statistical Theory and Related Fields 2022年第2期6卷 89-99页

作者： Yuan Gao Weidong Liu Hansheng Wang Xiaozhou Wang Yibo Yan Riquan Zhang School of Statistics and Key Laboratory of Advanced Theory and Application in Statistics and Data Science–MOE East China Normal UniversityShanghaiPeople’s Republic of China School of Mathematical Sciences and Key Lab of Articial Intelligence–MOE Shanghai Jiao Tong UniversityShanghaiPeople’s Republic of China Guanghua School of Management Peking UniversityBeijingPeople’s Republic of China

The rapid emergence of massive datasets in various fields poses a serious challenge to tra-ditional statistical ***,it provides opportunities for researchers to develop novel *** by the idea of divide-and-conquer,various distributed frameworks for statistical estimation and inference have been *** were developed to deal with large-scale statistical optimization *** paper aims to provide a comprehensive review for related *** includes parametric models,nonparametric models,and other frequently used *** key ideas and theoretical properties are *** trade-off between communication cost and estimate precision together with other concerns is discussed.

关键词： distributed computing divide-and-conquer communication-efficiency shrinkage methods nonparametric estimation principal component analysis feature screening bootstrap

来源：评论

学校读者我要写书评

暂无评论

Wrapyfi: A PythonWrapper for Integrating Robots, Sensors, and Applications across Multiple Middleware 24

Wrapyfi: A PythonWrapper for Integrating Robots, Sensors, an...

引用

19th Annual ACM/IEEE International Conference on Human-Robot Interaction (HRI)

作者： Abawi, Fares Allgeuer, Philipp Fu, Di Wermter, Stefan Univ Hamburg Hamburg Germany

ISBN: (数字)9798400703225

ISBN: (纸本)9798400703225

Message oriented and robotics middleware play an important role in facilitating robot control, abstracting complex functionality, and unifying communication patterns between sensors and devices. However, using multiple middleware frameworks presents a challenge in integrating diferent robots within a single system. To address this challenge, we present Wrapyf, a Python wrapper supporting multiple message oriented and robotics middleware, including ZeroMQ, YARP, ROS, and ROS 2. Wrapyf also provides plugins for exchanging deep learning framework data, without additional encoding or preprocessing steps. Using Wrapyf eases the development of scripts that run on multiple machines, thereby enabling cross-platform communication and workload distribution. We fnally present the three communication schemes that form the cornerstone of Wrapyf's communication model, along with examples that demonstrate their applicability.

关键词： Message oriented middleware robotics middleware distributed computing deep learning frameworks human-robot interaction

来源：评论

学校读者我要写书评

暂无评论

Developing a Green AI Platform for SMEs to Analyze Open-source Information with the Approach of Society 5.0

引用

SN Computer Science 2024年第7期5卷 1-26页

作者： Akarslan, Hüseyin Sağiroğlu, Şeref Management Information Systems Graduate School of Informatics Gazi University Türkiye Ankara Turkey Computer Engineering Department Engineering Faculty Gazi University Türkiye Ankara Turkey

Management and information systems are considered two major disciplines that have to be combined to benefit from knowledge for rational decision-making which means strict procedures utilizing objective knowledge and logic for many years. Effective and efficient use of already invested organizational resources is a key subject to gain a competitive advantage by making decisions with the help of AI techniques which benefit from both internal and external knowledge. This paper introduces a new model to get benefits from open-source intelligence (OSINT) in the context of external knowledge with a green computing approach for solving global organizational challenges in the scope of Society 5.0. This research has a dual background, theoretical and practical. Problem defining and hypothesis formulation was carried out by literature review. Then, the application developed according to the proposed model was put into action in some organizations for testing, and feedback from experts who participated in the proof of concept (POC) activities was evaluated and discussed empirically. Finally, the findings of our research, the advantages of our model, and both academic and business future work were summarized. It has been practically determined that the model and application we have developed are largely successful in line with our hypotheses. However, the weaknesses and advantages of our study were also revealed. Our research is the first study that combines Management Information Systems and Open-Source Intelligence disciplines with the approach of Society 5.0 to support SMEs in analyzing open-source information to build better decision-making mechanisms. The developed application in this study can also be applied to solving other green distributed computing needs in different domains. © The Author(s), under exclusive licence to Springer Nature Singapore Pte Ltd. 2024.

关键词： distributed computing External knowledge Green computing Management information systems (MIS) Open-source intelligence (OSINT) Society 5.0

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：