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

54th IEEE Frontiers in Education Conference, FIE 2024

作者： Läufer, Konstantin Mertin, Gunda Thiruvathukal, George K. Loyola University Software and Systems Laboratory Department of Computer Science Chicago United States Institute for Software Engineering and Programming Languages University of Lübeck Germany

ISBN: (纸本)9798350351507

Background: In this Innovative Practice Work in Progress, we present our initial efforts to integrate formal methods, with a focus on model-checking specifications written in Temporal Logic of Actions (TLA+), into computer science education, targeting undergraduate juniors/seniors and graduate students. Many safety-critical systems and services crucially depend on correct and reliable behavior. Formal methods can play a key role in ensuring correct and safe system behavior, yet remain underutilized in educational and industry contexts. Aims: We aim to (1) qualitatively assess the state of formal methods in computer science programs, (2) construct level-appropriate examples that could be included midway into one's undergraduate studies, (3) demonstrate how to address successive 'failuresy' through progressively stringent safety and liveness requirements, and (4) establish an ongoing framework for assessing interest and relevance among students. Methods: We detail our pedagogical strategy for embedding TLA+ into an intermediate course on formal methods at our institution. After starting with a refresher on mathematical logic, students specify the rules of simple puzzles in TLA+ and use its included model checker (known as TLC) to find a solution. We gradually escalate to more complex, dynamic, event-driven systems, such as the control logic of a microwave oven, where students will study safety and liveness requirements. We subsequently discuss explicit concurrency, along with thread safety and deadlock avoidance, by modeling bounded counters and buffers. Results: Our initial findings suggest that through careful curricular design and choice of examples and tools, it is possible to inspire and cultivate a new generation of software engineers proficient in formal methods. Conclusions: Our initial efforts suggest that 84% of our students had a positive experience in our formal methods course. Our future plans include a longitudinal analysis within our own institution and

关键词： Students

来源：评论

学校读者我要写书评

暂无评论

Towards a Unified Flow Description Language for CPPSs: An Example with Material Flows 29

Towards a Unified Flow Description Language for CPPSs: An Ex...

引用

29th IEEE International Conference on Emerging Technologies and Factory Automation, ETFA 2024

作者： Gödeke, Jana Hörstrup, Maximilian Detzner, Peter Fraunhofer Institute for Material Flow and Logistics Department for Ai and Autonomous Systems Dortmund Germany Ruhr University Bochum Faculty of Computer Science Distributed and Networked Systems Group Bochum Germany

ISBN: (纸本)9798350361230

This paper presents a unified approach for repre-senting multiple domains alongside production in cyber-physical production systems (CPPSs) through domain-specific languages (DSLs). The approach is illustrated using material flows (MFs) as an example. The paper identifies requirements for DSLs in CPPSs and MFs, including concurrency, synchronization, constraints, and heterogeneity support. Subsequently, a plugin system is in-troduced for the existing Production Flow Description Language (PFDL), which allows users to incorporate additional domain-specific functionality in the form of plugins. To demonstrate this approach, we present the MF plugin, resulting in the combined PFDLMF. This showcases the reusability of such an approach and the easy integration of new CPPS domains. We envision the convergence of the PFDL with plugins towards a unified flow description language for CPPSs. A practical CPPS use-case demonstrates the expressiveness of the PFDLMF in modeling and executing complex MFs in an agent-based architecture. © 2024 IEEE.

关键词： Reusability

来源：评论

学校读者我要写书评

暂无评论

Database Deadlock Diagnosis for Large-Scale ORM-Based Web Applications 39

Database Deadlock Diagnosis for Large-Scale ORM-Based Web Ap...

引用

39th IEEE International Conference on Data Engineering, ICDE 2023

作者： Dong, Zhiyuan Wang, Zhaoguo Yi, Chuanwei Xu, Xian Zhang, Jinyuan Li, Jinyang Chen, Haibo Shanghai Jiao Tong University Institute of Parallel and Distributed Systems China New York University Department of Computer Science United States

ISBN: (纸本)9798350322279

Today, most database-backed web applications depend on the database to handle deadlocks. At runtime, the database monitors the progress of transaction execution to detect deadlocks and abort affected transactions. However, this common detect-and-recover strategy is costly to performance as aborted transactions waste CPU *** avoid deadlock-induced performance degradation, developers aim to reorganize the application code to remove deadlocks. Unfortunately, doing so is difficult for web applications. Not only do their implementations include hundreds of thousands of LoCs, but they also use third-party object-relational mapping (ORM) frameworks which hide database access details. Consequently, it is hard for developers to accurately diagnose *** propose WeSEER, a deadlock diagnosis tool for web applications. To overcome the opacity of ORMs, WeSEER performs concolic execution on unit tests to extract a web application's transactions as a sequence of template statements with symbolic inputs as well as path conditions that enable the sequence. WeSEER then analyzes the extracted transactions based on fine-grained lock modeling to identify potential deadlocks and report the code locations that cause them. We implement WeSEER for Java-based (OpenJDK) web applications, and use it to analyze two popular open-source e-commerce applications, Broadleaf and Shopizer. WeSEER has successfully identified 18 potential deadlocks in Broadleaf and Shopizer. Eliminating these identified deadlocks can result in up to 39.5× and 4.5× throughput improvement for Broadleaf and Shopizer, respectively. © 2023 IEEE.

关键词： Database systems

来源：评论

学校读者我要写书评

暂无评论

Fine-Grained Re-Execution for Efficient Batched Commit of distributed Transactions 49th

Fine-Grained Re-Execution for Efficient Batched Commit of Di...

引用

49th International Conference on Very Large Data Bases, VLDB 2023

作者： Dong, Zhiyuan Wang, Zhaoguo Zhang, Xiaodong Xu, Xian Zhao, Changgeng Chen, Haibo Panda, Aurojit Li, Jinyang Institute of Parallel and Distributed Systems Shanghai Jiao Tong University China Department of Computer Science New York University United States

distributed transaction systems incur extensive cross-node communication to execute and commit serializable OLTP transactions. As a result, their performance greatly suffers. Caching data at nodes that execute transactions can cut down remote reads. Batching transactions for validation and persistence can amortize the communication cost during committing. However, caching and batching can significantly increase the likelihood of conflicts, causing expensive aborts. In this paper, we develop Hackwrench to address the challenge of caching and batching. Instead of aborting conflicted transactions, Hackwrench tries to repair them using fine-grained re-execution by tracking the dependencies of operations among a batch of transactions. Tracked dependencies allowHackwrench to selectively invalidate and re-execute only those operations necessary to "fix" the conflict, which is cheaper than aborting and executing an entire batch of transactions. Evaluations using TPC-C and other micro-benchmarks show that Hackwrench can outperform existing commercial and research systems including FoundationDB, Calvin,COCO, and Sundial under comparable settings. © 2023, VLDB Endowment. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Proximity-based service discovery for distributed digital twin systems

引用

Discover Internet of Things 2025年第1期5卷 1-24页

作者： Rothermel, Kurt Herzog, Otthein Zhiqiang, Siegfried Wu Institute Of Parallel and Distributed Systems University of Stuttgart Universitaetsstr. 38 Stuttgart70569 Germany College of Architecture and Urban Planning Tongji University 1239 Siping Road Shanghai200092 China Department of Mathematics and Computer Science University of Bremen Bibliothekstrasse 5 Bremen23884 Germany

Over the past decade, there has been a significant increase in interest in digital twin (DT) technology in a variety of domains. While research on DTs of single assets was initially prevalent, there has been a notable shift towards distributed systems of DTs, which connect to each other to collaborate. Typically, collaboration is enabled by DTs providing services that can be consumed by other DTs. In service-oriented systems, a service is typically identified by type information. However, this is not sufficient in distributed DT systems, where DTs associated with different physical entities may provide the same type of service. Consequently, selecting the appropriate service depends not only on the service type, but also on the associated physical entity. However, requiring DTs to know the mapping of services to their physical environment is not feasible for large dynamic systems. This paper presents a novel proximity-based service discovery method that allows DTs to select services based on service type and their proximity to other objects. That is, service specifications are fully abstracted from the mapping of services to physical objects, relieving DTs from maintaining information about this mapping. Furthermore, service discovery is robust to changes in the physical environment and service population. The proposed service discovery method has been implemented on top of a spatial DBMS. We argue that this implementation is optimal in terms of network utilization and latency, and perform comprehensive evaluations to show the performance of discovery queries as a function of their complexity. © The Author(s) 2025.

关键词： Location based services

来源：评论

学校读者我要写书评

暂无评论

A Simulative Approach to AMR Fleet Sizing in Decentralized Multi-Robot Task Allocation 28

A Simulative Approach to AMR Fleet Sizing in Decentralized M...

引用

28th IEEE International Conference on Emerging Technologies and Factory Automation, ETFA 2023

作者： Gödeke, Jana Detzner, Peter Fraunhofer Institute for Material Flow and Logistics Department for AI and Autonomous Systems Dortmund Germany Ruhr University Bochum Faculty of Computer Science Distributed and Networked Systems Group Bochum Germany

ISBN: (纸本)9798350339918

As the Industry 4.0 shifts towards the adoption of autonomous mobile robots (AMRs) in warehouses, decentralized decision-making has become a key design principle. Multi-robot task allocation (MRTA) is a problem that involves assigning tasks to AMRs while optimizing the performance of the system. However, modeling decentralized MRTA applications for optimization without a central instance poses significant challenges due to the autonomy and flexibility of AMRs. In this paper, we propose a simulative approach to address the fleet sizing problem combined with decentralized MRTA applications for AMRs. Based on simulation data, models have been developed that predict key performance indicators (KPIs) for different warehouse layouts and requirements, using techniques from machine learning and mathematical optimization. The model represents KPIs such as constraint satisfaction and utilization rates in a decentralized MRTA scenario including a self-organizing material flow application. Based on this model, we introduce a fleet size selection mechanism. This research contributes to the field of Industry 4.0 by providing a generalizable simulative approach that is adaptable to flexible warehouse environments, allowing for the application of any MRTA algorithm. Moreover, this approach allows the integration of different KPIs, facilitating the adaptation of requirements. © 2023 IEEE.

关键词： Warehouses

来源：评论

学校读者我要写书评

暂无评论

SDKV: A Smart and distributed Key-Value Store for the Edge-Cloud Continuum 23

SDKV: A Smart and Distributed Key-Value Store for the Edge-C...

引用

Proceedings of the IEEE/ACM 16th International Conference on Utility and Cloud Computing

作者： Juan Aznar-Poveda Tobias Pockstaller Thomas Fahringer Stefan Pedratscher Zahra Najafabadi Samani Distributed and Parallel Systems Group Institute of Computer Science University of Innsbruck Innsbruck Austria

ISBN: (纸本)9798400702341

Many time-critical and data-intensive distributed applications for the computing continuum depend on low-latency, scalable, and highly available distributed key value storages. In this paper, we introduce SDKV, a scalable -Smart and distributed Key-Value- store for the Edge-Cloud continuum to automatically place data in close proximity to clients resulting in low response times. The clients of SDKV can influence data availability and access latency by specifying the number of replicas and the desired level of data consistency (strong or eventual) on a per key-value pair basis, which favors the support of a wide range of applications. Results reveal that for different workloads and client access behaviors, SDKV outperforms existing distributed data storages and their data placement algorithms by 12--69% for both consistency models. Moreover, the proposed placement algorithm of SDKV provides fast decision times and scales linearly with the number of keys.

关键词： distributed storage key-value storage data placement replica management edge-cloud continuum

来源：评论

学校读者我要写书评

暂无评论

ARLCL: Anchor-free Ranging-Likelihood-based Cooperative Localization

ARLCL: Anchor-free Ranging-Likelihood-based Cooperative Loca...

引用

IEEE International Symposium on World of Wireless Mobile and Multimedia Networks (WoWMoM)

作者： Dimitris Xenakis Antonio Di Maio Torsten Braun Communication and Distributed Systems Institute of Computer Science University of Bern Switzerland

Positioning estimations of wireless sensors can be enhanced via sensor collaboration. To enable this, various methods have been proposed; yet, most do not leverage the entire collective knowledge, which also involves the estimation’s uncertainty. In this article, we introduce Anchor-free Ranging-Likelihood-based Cooperative Localization (ARLCL); a novel anchor-free and technology-agnostic localization algorithm that utilizes inter-exchanged ranging signals from sensors to enable their simultaneous positioning. Ranging technologies with easy-to-model propagation properties, such as UWB or LiDAR are among the first beneficiaries that ARLCL is targeting. To examine its applicability, however, even to signals that are noisier and often unsuitable for ranging, we assess ARLCL with real-world BLE RSS measurements. At the same time, we consider deployments that typically induce flip-ambiguity, being a major problem in cooperative localization. We provide an extensive comparison against the most widely-adopted optimization method (Mass-Spring) but also against the recent likelihood-based approach (Maximum Likelihood - Particle Swarm Optimization). The results showed that ARLCL outperformed the baselines in almost all scenarios. Our gain in positioning accuracy is also found to be positively correlated to both the swarm’s size and the signal’s quality, reaching an improvement of 40%.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Challenges and Initial Measurements on Communication and Localization for Mountain Bike Safety Applications

Challenges and Initial Measurements on Communication and Loc...

引用

Annual Conference on Wireless On Demand Network systems and Services (WONS)

作者： Michele Zucchelli Marcus Marx Max Hörmann Frank Kargl Michele Segata Department of Information Engineering and Computer Science University of Trento Italy Institute of Distributed Systems Ulm University Germany

ISBN: (数字)9783903176713

ISBN: (纸本)9798331522025

As of today, research in vulnerable road users (VRUs) applications is mainly focused on safety in urban road scenarios. There is little to be found in the literature with respect to VRUs in mountain areas, where mountain biking and hiking also present risks of collision. Here, it is not yet clear whether existing localization and communication technologies would provide sufficient performance in such harsh environments. In this work, we start answering this question by presenting the results of a measurement campaign which took place in a mountain area in Northern Italy during Summer 2024. With respect to localization, we show that global navigation satellite system (GNSS)-based localization alone often provides unreliable results due to vegetation and terrain. Trilateration with Bluetooth Low Energy (BLE) and beacons mounted at fixed positions performs well in some circumstances and can be used to enhance GNSS, however, we also observed many unclear effects that require further investigations. Concerning communication, the results indicate that both direct short range communications (DSRC) and cellular V2X (C-V2X) works fairly well in most cases, but terrain characteristics might induce packet losses or low signal quality, whereas instabilities in GNSS fixes might also cause C-V2X outages.

关键词： Location awareness Wireless communication Global navigation satellite system Roads Vegetation mapping Packet loss Communications technology Safety Bluetooth Low Energy Network systems

来源：评论

学校读者我要写书评

暂无评论

A Provenance Management Framework for Knowledge Graph Generation in a Web Portal

A Provenance Management Framework for Knowledge Graph Genera...

引用

2023 Datenbanksysteme fur Business, Technologie und Web, BTW 2023 - 2023 Database systems for Business, Technology and Web, BTW 2023

作者： Kleinsteuber, Erik Babalou, Samira König-Ries, Birgitta Heinz-Nixdorf Chair for Distributed Information Systems Institute for Computer Science Friedrich Schiller University Jena Germany Halle-Jena Leipzig Germany Michael-Stifel-Center for Data-Driven and Simulation Science Jena Germany

ISBN: (纸本)9783885797258

Knowledge Graphs (KGs) are the semantic backbone for a wide variety of applications in different domains. In recent years, different web portals providing relevant functionalities for managing KGs have been proposed. An important functionality of such portals is provenance data management of the KG generation process. Capturing, storing, and accessing provenance data efficiently are complex problems. Solutions to these problems vary widely depending on many factors like the computational environment, computational methods, desired provenance granularity. In this paper, we present one possible solution: a new framework to capture coarse-grained workflow provenance of KGs during creation in a web portal. We capture the necessary information of the KG generation process and store and retrieve the provenance data using standard functionalities of relational databases. Our captured workflow can be rerun over the same or different input source data. With this, the framework can support four different applications of provenance data: (i) reproduce the KG, (ii) create a new KG with an existing workflow, (iii) undo the executed tools and adapt the provenance data accordingly, and (iv) retrieve the provenance data of a KG. © 2023 Gesellschaft fur Informatik (GI). All rights reserved.

关键词： Knowledge graph

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：