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

2024 IEEE International Conference on Internet of Things and Intelligence systems, IoTaIS 2024

作者： Pecson, Jeff Nereo G. Tan, Wilson M. Festin, Cedric Angelo M. Dulva, Philip Angelo Y. Networks and Distributed Systems Group Department of Computer Science University of the Philippines - Diliman Metro Manila Philippines

ISBN: (纸本)9798331521219

Current methods in mapping the availability of WiFi networks, such as crowdsourcing platforms (e.g. Project BASS and CoverageMap) and dedicated wardriving, face limitations in terms of data recency, volume, and cost-effectiveness. Due to the downsides of both these methods, opportunistic wardriving is proposed which utilizes public utility vehicles (PUVs). This study investigates the feasibility of PUVs as potential wardriving vehicles for opportunistic coverage mapping. This method is cost-efficient and removes the problem of data recency because of its continuous daily trips. The findings suggest that opportunistic wardriving with PUVs is viable for wardriving with its capability to detect a high volume of access points (APs). Multiple runs within the University of the Philippines Diliman campus showed the PUVs’ effectiveness in detecting a significant number of APs, with higher success rates at closer distances. Comparatively, warwalking detected fewer APs, but there was a significant overlap between the methods. The study also highlighted significant differences in detected AP types, with wardriving finding more mobile hotspots and miscellaneous devices than warwalking. Overall, the results underline the effectiveness of PUVs in providing extensive WiFi coverage data and further enhancements to the detection system could optimize the approach. ©2024 IEEE.

关键词： Wireless local area networks (WLAN)

来源：评论

学校读者我要写书评

暂无评论

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.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Towards Smarter Maritime Security: Apriori Algorithm Optimization in Serverless Environments 16

Towards Smarter Maritime Security: Apriori Algorithm Optimiz...

引用

16th International Conference on Ambient systems, Networks and Technologies Networks, ANT 2025 / 8th International Conference on Emerging Data and Industry 4.0, EDI40 2025

作者： Shahin, Mahtab Rahimpour, Saeed Ghasempouri, Tara Bauk, Sanja Fahringer, Thomas Draheim, Dirk Estonian Maritime Academy Tallinn University of Technology Tallinn Estonia Department of Computer Systems Tallinn University of Technology Tallinn Estonia Distributed and Parallel Systems Group University of Innsbruck Tirol Austria Information Systems Group Tallinn University of Technology Tallinn Estonia

This paper presents an optimized implementation of the Apriori algorithm tailored for large-scale data mining in cloud-native, serverless environments, utilizing real-world fuel datasets. Our approach achieves a 28% reduction in execution time and a 22% decrease in memory consumption compared to traditional distributed Apriori methods. The study leverages high-dimensional fuel datasets, spanning from 2020 to 2050, to evaluate scalability and efficiency in processing energy-related data. By employing advanced synchronization and deferred partitioning strategies, communication overhead is significantly reduced, improving performance while effectively balancing computational loads across distributed nodes. Security measures, including AES-256 encryption and role-based access control (RBAC), are incorporated to safeguard data confidentiality and ensure compliance with regulatory frameworks. The proposed solution scales efficiently for datasets up to 1 million records, demonstrating applicability across domains such as transportation and logistics. Future work will explore adaptive partitioning techniques, hybrid cloud architectures, and AI-driven predictive analytics to further enhance scalability and operational efficiency in serverless multi-cloud systems. © 2025 Elsevier B.V.. All rights reserved.

关键词： distributed cloud

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Unveiling the Black Box: Neural Cryptanalysis with XAI

Unveiling the Black Box: Neural Cryptanalysis with XAI

引用

2024 IEEE International Conference on systems, Man, and Cybernetics, SMC 2024

作者： Goi, Yue-Tian Leong, Shu-Min Phan, Raphael C.-W. Lai, Shangqi Salagean, Ana School of Information Technology Monash University Australia CSIRO's Data61 Distributed Systems Security Group Australia Loughborough University Department of Computer Science United Kingdom

ISBN: (纸本)9781665410205

At CRYPTO'19, Gohr[1] presented ResNet-based neural distinguishers (ND) for the round-reduced SPECK32/64 cipher. However, due to the black-box use of such deep learning models, it is hard for humans to understand why these distinguishers work, impeding advancements in cryptanalytic knowledge. In this work, we aim to effectively adapt eXplainable Artificial Intelligence (XAI) techniques, notably Local Interpretable Model-Agnostic Explanations (LIME) and Shapley Additive Explanations (SHAP), to gain a detailed understanding of the important features useful in Gohr's neural distinguishers. © 2024 IEEE.

关键词： Ciphertext

来源：评论

学校读者我要写书评

暂无评论

Evaluation of Bfloat16, Posit, and Takum Arithmetics in Sparse Linear Solvers

arXiv

引用

arXiv 2024年

作者： Hunhold, Laslo Quinlan, James Parallel and Distributed Systems Group University of Cologne Cologne Germany Department of Computer Science University of Southern Maine Portland ME United States

Solving sparse linear systems lies at the core of numerous computational applications. Consequently, understanding the performance of recently proposed alternatives to the established IEEE 754 floating-point numbers, such as bfloat16 and the tapered-precision posit and takum machine number formats, is of significant interest. This paper examines these formats in the context of widely used solvers, namely LU, QR, and GMRES, with incomplete LU preconditioning and mixed precision iterative refinement (MPIR). This contrasts with the prevailing emphasis on designing specialized algorithms tailored to new arithmetic formats. This paper presents an extensive and unprecedented evaluation based on the SuiteSparse Matrix Collection—a dataset of real-world matrices with diverse sizes and condition numbers. A key contribution is the faithful reproduction of SuiteSparse’s UMFPACK multifrontal LU factorization and SPQR multifrontal QR factorization for machine number formats beyond single and double-precision IEEE 754. Tapered-precision posit and takum formats show better accuracy in direct solvers and reduced iteration counts in indirect solvers. Takum arithmetic, in particular, exhibits exceptional stability, even at low precision. © 2024, CC BY.

关键词： Iterative methods

来源：评论

学校读者我要写书评

暂无评论

Utilization of Database Spatial Queries for Region of Interest Extraction in Stored Images

Utilization of Database Spatial Queries for Region of Intere...

引用

2022 IEEE Region 10 International Conference, TENCON 2022

作者： Valdez, Julian Troy C. Tan, Wilson M. University of the Philippines Diliman Department of Computer Science Networks and Distributed Systems Group Quezon City Philippines

ISBN: (数字)9781665450959

ISBN: (纸本)9781665450959

Image processing, specifically extracting regions of interest, being a costly operation would benefit from a method of storing its output region and input image data in a database for future querying so as to prevent re-execution of the processing operation. This study investigates the performance of using built-in spatial queries found in a couple of modern Database systems to store and retrieve specific regions of image data. After testing two widely used Database software: MongoDB and Postgresql, results have shown that MongoDB performs better in terms of average and tail latency as well as efficiency in disk space consumption. © 2022 IEEE.

关键词： Query processing

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：