In the digital era, time is a precious commodity that equates to money, and parallelization techniques have been pivotal in maximizing time efficiency. This research underscores the critical importance of quick and ef...
详细信息
ISBN:
(纸本)9798350364613;9798350364606
In the digital era, time is a precious commodity that equates to money, and parallelization techniques have been pivotal in maximizing time efficiency. This research underscores the critical importance of quick and effective transcription retrieval from multimedia-rich platforms, leveraging parallel processing and advanced methodologies for significant speed enhancements. The ability to swiftly process vast amounts of data not only streamlines research efforts but also offers extensive benefits for various fields of study. By demonstrating substantial gains in processing speed, this study showcases the revolutionary potential of efficient data handling techniques, marking a significant contribution to the broader research community's ability to analyze digital media's impact on society.
The intricate properties and relevance of graph data make it difficult to collect graph statistics privately via differential privacy (DP). Traditional centralized or local DP on graph data, face challenges like third...
详细信息
ISBN:
(数字)9798331509712
ISBN:
(纸本)9798331509729
The intricate properties and relevance of graph data make it difficult to collect graph statistics privately via differential privacy (DP). Traditional centralized or local DP on graph data, face challenges like third-party threats and low data utility when collecting the clustering coefficient. In this regard, we introduce GCC-SDP, a scheme for collecting distributed Graph Clustering Coefficient with Shuffled DP (SDP). GCC-SDP gathers the local wedge lists of all edges and adjacency bit vectors through SDP and random response for calculating the noisy local triangle counts. It then collects the local degree values of all users by using Laplace mechanism, followed by estimating the global clustering coefficient of the global graph data by data collector. We provide specific steps of GCC-SDP and demonstrate through theoretical analysis that GCC-SDP conforms to various DPs, with unbiased results. Empirical experiments show that GCC-SDP performs better than existing local DP-based techniques across most accuracy metrics.
In recent years, in order to accelerate the construction of new power systems, power companies have carried out a series of information system construction, generating a massive amount of power related business data, ...
详细信息
ISBN:
(数字)9798350349658
ISBN:
(纸本)9798350349665
In recent years, in order to accelerate the construction of new power systems, power companies have carried out a series of information system construction, generating a massive amount of power related business data, which brings problems such as low query efficiency and inaccurate results to the real-time query performance of the system. Therefore, this article proposes a power big data fusion method based on graph convolutional neural networks, using association rule algorithms to horizontally connect various fragmented basic wide tables, indicators, and labels related to the perspective of power business, and aggregate them to form a logical business view. The association integrates more data information of power business objects, providing data support for power big data analysis, mining, and inference.
This paper presents the implementation of an outlier detection method based on the Grubbs test, specifically designed for microcontroller applications. The theoretical background for outlier detection is outlined, and...
详细信息
ISBN:
(数字)9798350352320
ISBN:
(纸本)9798350352337
This paper presents the implementation of an outlier detection method based on the Grubbs test, specifically designed for microcontroller applications. The theoretical background for outlier detection is outlined, and experimental validation is conducted using a direct sensor-to-microcontroller interface circuit. Results demonstrate that this approach improves the accuracy of measurement systems affected by Gaussian noise or other normal-distributed external interference signals.
The pervasiveness of embedded systems across edge and connected devices is challenging their design, as sharing data securely via AES encryption is computationally intensive. This work proposes POCA, an FPGA-accelerat...
详细信息
ISBN:
(数字)9798350364606
ISBN:
(纸本)9798350364613
The pervasiveness of embedded systems across edge and connected devices is challenging their design, as sharing data securely via AES encryption is computationally intensive. This work proposes POCA, an FPGA-accelerated HW/SW library that performs AES cryptographic primitives with different modes and the most used key sizes. The HW/SW approach of POCA showcases the benefits of accelerated cryptographic primitives and the flexibility of a unified platform interface across different embedded systems by exploiting the Python PYNQ framework. POCA matches the multicore ARM crypto extensions on an Ultrascale+ ZU3EG while overwhelming SW performance.
At present, the maneuvering environment is complex and changeable, and unmanned platforms are faced with a variety of uncertain factors when carrying out multiple tasks. In order to improve the efficient and safe mane...
详细信息
ISBN:
(数字)9798350349658
ISBN:
(纸本)9798350349665
At present, the maneuvering environment is complex and changeable, and unmanned platforms are faced with a variety of uncertain factors when carrying out multiple tasks. In order to improve the efficient and safe maneuvering performance of unmanned platforms in complex scenarios, this paper proposed building a maneuvering decision network system by using deep reinforcement learning network DDPG network for guiding agents execute maneuvering decisions according to tasks and environments to achieve the purpose of safe and efficient maneuvering. The paper tested the maneuvering decision performance in dynamic changing scenarios and verified the autonomous intelligent maneuvering performance of network guided agents, which could effectively avoid threats and choose better paths, and had good robustness and generalization.
Strong-motion processing holds paramount importance in earthquake engineering and disaster risk management systems. By leveraging parallel loops and task-parallelism techniques, we address computational challenges pos...
详细信息
ISBN:
(数字)9798350364606
ISBN:
(纸本)9798350364613
Strong-motion processing holds paramount importance in earthquake engineering and disaster risk management systems. By leveraging parallel loops and task-parallelism techniques, we address computational challenges posed by large-scale accelerographic datasets. Through experimentation with more than one million data points from six real-world seismic events, our approach achieved speedups of up to 2.9x, demonstrating the effectiveness of parallel programming in accelerating seismic data processing. Our findings highlight the significance of parallel programming techniques in advancing seismological research and enhancing earthquake mitigation strategies.
A set of mutually distrusting participants that want to agree on a common opinion must solve an instance of a Byzantine agreement problem. These problems have been extensively studied in the literature. However, most ...
详细信息
ISBN:
(纸本)9781665440660
A set of mutually distrusting participants that want to agree on a common opinion must solve an instance of a Byzantine agreement problem. These problems have been extensively studied in the literature. However, most of the existing solutions assume that the participants are aware of n - the total number of participants in the system - and f - an upper bound on the number of Byzantine participants. In this paper, we show that most of the fundamental agreement problems can be solved without affecting resiliency even if the participants do not know the values of (possibly changing) n and f. Specifically, we consider a synchronous system where the participants have unique but not necessarily consecutive identifiers, and give Byzantine agreement algorithms for reliable broadcast, approximate agreement, rotor-coordinator, early terminating consensus and total ordering in static and dynamic systems, all with the optimal resiliency of n > 3f. Moreover, we show that some synchrony is necessary as an agreement with probabilistic termination is impossible in a semi-synchronous or asynchronous system if the participants are unaware of n and f.
Monitoring and analyzing a wide range of I/O activities in an HPC cluster is important in maintaining mission-critical performance in a large-scale, multi-user, parallel storage system. Center-wide I/O traces can prov...
详细信息
ISBN:
(纸本)9781450391993
Monitoring and analyzing a wide range of I/O activities in an HPC cluster is important in maintaining mission-critical performance in a large-scale, multi-user, parallel storage system. Center-wide I/O traces can provide high-level information and fine-grained activities per application or per user running in the system. Studying such large-scale traces can provide helpful insights into the system. It can be used to develop predictive methods for making predictive decisions, adjusting scheduling policies, or providing decisions for the design of next-generation systems. However, sharing real-world I/O traces to expedite such research efforts leaves a few concerns;i) the cost of sharing the large traces is expensive due to this large size, and ii) privacy concern is an issue. We address such issues by building an end-to-end machine learning (ML) workflow that can generate I/O traces for large-scale HPC applications. We leverage ML based feature selection and generative models for I/O trace generation. The generative models are trained on I/O traces collected by the darshan I/O characterization tool over a period of one year. We present a two-step generation process consisting of two deep-learning models, called the feature generator and the trace generator. The combination of two-step generative models provides robustness by reducing the bias of the model and accounting for the stochastic nature of the I/O traces across different runs of an application. We evaluate the performance of the generative models and show that the two-step model can generate time-series I/O traces with less than 20% root mean square error.
暂无评论