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

Secure multiparty quantum computation for summation and data sorting

QUANTUM INFORMATION PROCESSING 2024年第9期23卷 1-26页

作者： Li, Xiaobing Xiong, Yunyan Zhang, Cai South China Agr Univ Coll Math & Informat Guangzhou 510642 Guangdong Peoples R China Guangdong Polytech Ind & Commerce Sch Comp & Informat Engn Guangzhou 510510 Peoples R China

In this paper, we propose a protocol for quantum secure multiparty summation and privacy sorting based on inverse quantum Fourier transform. The protocol allows multiple participants to obtain the summation and sorting of their secrets without revealing their private inputs. Each participant in the protocol encodes his/her own secret input into the phase of the d-level entangled state of n particles by means of a phase transformation operator and an inverse quantum Fourier transform. Finally, all participants perform measurements and jointly calculate the sum of all the secret data, meanwhile deriving their own rankings of the private inputs based on the final results. Compared to the existing similar quantum summation and sorting protocols, this protocol requires only a one-time particle transmission and does not require private key sequences to encrypt secret information, resulting in higher quantum efficiency. The participants can further obtain the ranking of their secret inputs by themselves. The credibility of the protocol is demonstrated in security analysis and simulation.

关键词： Quantum summation data sorting Phase transform Inverse quantum Fourier transform d-level entangled state

来源：评论

学校读者我要写书评

暂无评论

Rocket Queue: New data sorting Architecture for Real-Time Systems 20

Rocket Queue: New Data Sorting Architecture for Real-Time Sy...

引用

20th IEEE International Symposium on Design and Diagnostics of Electronic Circuits and Systems (DDECS)

作者： Kohutka, Lukas Stopjakova, Viera Slovak Univ Technol Bratislava Inst Elect & Photon Bratislava Slovakia

ISBN: (纸本)9781538604724

This paper presents the design of a coprocessor that performs data sorting for minimax queues in real-time systems. The proposed architecture is based on shift registers, systolic arrays and heapsort algorithm. Such an architecture, called Rocket Queue, is able not only to sort items according to their sort values, but it is also possible to remove any item from the structure according to its unique ID, which is important for many various applications. Instructions of the Rocket Queue architecture are performed in two clock cycles regardless of the number of items in the system and regardless the queue capacity. The developed coprocessor is optimized for low chip area costs, which leads to lower energy consumption too. The Rocket Queue architecture has constant time complexity, constant critical path length and it is highly predictable, thus also suitable for real-time applications. The architecture was verified using simplified version of UVM and applying millions of instructions with randomly generated sort values. Achieved synthesis results are presented and discussed. These results are significantly better than the results of systolic arrays. More than 41 % of logic resources can be saved using the Rocket Queue architecture.

关键词： data sorting queue real-time FPGA architecture

来源：评论

学校读者我要写书评

暂无评论

data sorting-based Adaptive Spatial Compression in Wireless Sensor Networks

引用

KSII TRANSACTIONS ON INTERNET AND INFORMATION SYSTEMS 2016年第8期10卷 3641-3655页

作者： Chen, Siguang Liu, Jincheng Wang, Kun Sun, Zhixin Zhao, Xuejian Nanjing Univ Posts & Telecommun Key Lab Broadband Wireless Commun & Sensor Networ Minist Educ Nanjing 210003 Jiangsu Peoples R China

Wireless sensor networks (WSNs) provide a promising approach to monitor the physical environments, to prolong the network lifetime by exploiting the mutual correlation among sensor readings has become a research focus. In this paper, we design a hierarchical network framework which guarantees layered-compression. Meanwhile, a data sorting-based adaptive spatial compression scheme (DS-ASCS) is proposed to explore the spatial correlation among signals. The proposed scheme reduces the amount of data transmissions and alleviates the network congestion. It also obtains high compression performance by sorting original sensor readings and selectively discarding the small coefficients in transformed matrix. Moreover, the compression ratio of this scheme varies according to the correlation among signals and the value of adaptive threshold, so the proposed scheme is adaptive to various deploying environments. Finally, the simulation results show that the energy of sorted data is more concentrated than the unsorted data, and the proposed scheme achieves higher reconstruction precision and compression ratio as compared with other spatial compression schemes.

关键词： Wireless sensor networks spatial correlation hierarchical network data sorting spatial compression

来源：评论

学校读者我要写书评

暂无评论

A General Framework for sorting Large data Sets Using Independent Subarrays of Approximately Equal Length

引用

IEEE ACCESS 2022年 10卷 11584-11607页

作者： Moghaddam, Shahriar Shirvani Moghaddam, Kiaksar Shirvani Shahid Rajaee Teacher Training Univ SRTTU Fac Elect Engn Tehran *** Iran Iran Univ Sci & Technol IUST Sch Comp Engn Tehran *** Iran

Designing an efficient data sorting algorithm that requires less time and space complexity is essential for computer science, different engineering disciplines, data mining systems, wireless networks, and the Internet of things. This paper proposes a general low-complex data sorting framework that distinguishes the sorted or similar data, makes independent subarrays approximately in equal length, and sorts the subarrays' data using one of the popular comparison-based sorting algorithms. Two frameworks, one for serial realization and another for parallel realization, are proposed. The time complexity analyses of the proposed framework demonstrate an improvement compared to the conventional Merge and Quick sorting algorithms. Following complexity analysis, the simulation results indicate slight improvements in the elapsed time and the number of swaps of the proposed serial Merge-based and Quick-based frameworks compared to the conventional ones for low/high variance integer/non-integer data sets, in different data sizes and the number of divisions. It is about (1 - 1.6%) to (3.5 - 4%) and (0.3 - 1.8%) to (2 - 4%) improvements in the elapsed times for 1, 2, 3, and 4 divisions, respectively for small and very large data sets in Merge-based and Quick-based scenarios. Although these improvements in serial realization are minor, making independent low-variance subarrays allows the sorted components to be extracted sequentially and gradually before the end of the sorting process. Also, it proposes a general framework for parallelizing conventional sorting algorithms using non-connected (independent) or connected (dependent) multi-core structures. As the second experiment, the numerical analyses that compare the results of the parallel realization of the proposed framework to the serial one in 1, 2, 3, and 4 divisions, show a speedup factor of (2 - 4) for small to (2 - 16) for very large data sets. The third experiment shows the effectiveness of the proposed parallel framewo

关键词： data sorting Gaussian integer merge multi-core non-integer parallel realization quick Rayleigh time and space complexity uniform

来源：评论

学校读者我要写书评

暂无评论

sorting Algorithm for Medium and Large data Sets Based on Multi-Level Independent Subarrays 10

Sorting Algorithm for Medium and Large Data Sets Based on Mu...

引用

10th IEEE International Conference on Communication, Networks and Satellite (IEEE COMNETSAT)

作者： Moghaddam, Kiaksar Shirvani Moghaddam, Shahriar Shirvani Iran Univ Sci & Technol IUST Sch Comp Engn Tehran Iran Shahid Rajaee Teacher Training Univ SRTTU Fac Elect Engn Tehran Iran

ISBN: (纸本)9781665434348

In this paper, we propose a new low-complex preprocessing that enables conventional data sorting algorithms to be more efficient for medium and large data sets in a serial/parallel realization. First, we divide the main array into independent subarrays by a multi-level mean-based division. It is realized by calculating the mean value of each level as the pivot to divide its elements into two parts, greater and lower than the pivot, almost in the same lengths with a lower randomness rate to the main array. Then, subarrays can be sorted by the conventional sorting algorithms in a sequential serial realization to extract sorted data gradually or parallel realizations by using independent multi-core structures. It also holds the stability and adaptivity features of the sorting algorithm, if any. The effectiveness of the mean-based pivot to the random one is investigated. To show the superiority of the proposed idea, the simulation results are compared in view of the running time and the number of swaps required to the conventional and proposed serial and parallel Insertion-sort in different lengths of data. Finally, the complexity order of the proposed algorithm in serial and parallel implementations is compared to the conventional one.

关键词： data sorting Divide-and-conquer Insertion Running time Swap Mean value

来源：评论

学校读者我要写书评

暂无评论

sorting Matrix Architecture for Continuous data Sequences

引用

IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES 2020年第2期E103A卷 542-546页

作者： Xue, Meiting Zhang, Huan Li, Weijun Yu, Feng Zhejiang Univ Dept Instrument Engn Hangzhou 310027 Peoples R China Hangzhou Dianzi Univ Coll Commun Engn Hangzhou 310018 Peoples R China Zhejiang Univ Ningbo Inst Technol Ningbo 315100 Peoples R China

sorting is one of the most fundamental problems in mathematics and computer science. Because high-throughput and flexible sorting is a key requirement in modern databases, this paper presents efficient techniques for designing a high-throughput sorting matrix that supports continuous data sequences. There have been numerous studies on the optimization of sorting circuits on FPGA (field-programmable gate array) platforms. These studies focused on attaining high throughput for a single command with fixed data width. However, the architectures proposed do not meet the requirement of diversity for database data types. A sorting matrix architecture is thus proposed to overcome this problem. Our design consists of a matrix of identical basic sorting cells. The sorting cells work in a pipeline and in parallel, and the matrix can simultaneously process multiple data streams, which can be combined into a high-width single-channel data stream or low-width multiple-channel data streams. It can handle continuous sequences and allows for sorting variable-length data sequences. Its maximum throughput is approximately 1.4 GB/s for 32-bit sequences and approximately 2.5 GB/s for 64-bit sequences on our platform.

关键词： data sorting variable-width variable-length hardware design pipeline and parallel

来源：评论

学校读者我要写书评

暂无评论

Fusion method for digital twin model of a production line

引用

INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY 2024年第11-12期132卷 6145-6167页

作者： Liu, Xiaojun Wang, Chongxin Huang, Jiasheng Ni, Zhonghua Salam, Musharaf Yan, Yuehui Feng, Jindan Southeast Univ Sch Mech Engn Nanjing 211189 Peoples R China Beijing Inst Space Long March Vehicle Beijing 100076 Peoples R China Southeast Univ Engn Res Ctr New Light Sources Technol & Equipment Minist Educ Nanjing 210018 Peoples R China Beijing Spacecrafts Ltd Co Beijing 100094 Peoples R China

Digital twins have attracted more and more attention in the past few years. To put digital twins into practice, a large number of modeling approaches have been proposed, vast amounts of data have been collected, and their accuracy has been improving. However, current research has paid insufficient attention to the multi-scale features of the shop floor, which hinders the effective application of the digital twin shop floor. To address the problem of how to achieve effective multi-level and multi-dimensional fusion of digital twin models with production process data, this paper first proposes a structured data modeling framework for sorting out all the production process data collected in real-time;and then proposes a multi-level fusion framework for supporting the fusion of real-time data and twin models from the unit level to the system level. The method judges the parsed received data streams through the full-factor semanticization framework, and at the same time fuses the parsed data streams with the constructed full-factor twin model from multiple dimensions and layers, forming a twin model fusion method with real-time data streams as the blood and twin model as the skeleton. Finally, the micro-assembly-based production shop environment is selected as a case study to verify the correctness and feasibility of the proposed data grooming framework, data, and model fusion method.

关键词： Digital twins Twin models data sorting data fusion data driven

来源：评论

学校读者我要写书评

暂无评论

actel: Standardised analysis of acoustic telemetry data from animals moving through receiver arrays

引用

METHODS IN ECOLOGY AND EVOLUTION 2021年第1期12卷 196-203页

作者： Flavio, Hugo Baktoft, Henrik Tech Univ Denmark Freshwater Fisheries & Ecol Silkeborg Denmark

1. Acoustic telemetry data often contain erroneous detections, which need to be addressed before further analysis. It is important that this process is systematic, standardised and reproducible. 2. The R package actel provides a systematic conditional pipeline to filter and analyse acoustic telemetry data in a reproducible fashion, for animals moving between receiver arrays. 3. actel outputs a standardised report containing the main results and the steps taken by the user, in addition to summary information for each animal and other content such as efficiency estimations for each receiver array. 4. actel improves the reproducibility of the acoustic data filtering and analysis, and simplifies the integration of acoustic data sets originating from different studies (in time and/or in space).

关键词： acoustic telemetry array efficiency data sorting migration reproducibility stationary receivers

来源：评论

学校读者我要写书评

暂无评论

A hierarchical adaptive spatio-temporal data compression scheme for wireless sensor networks

引用

WIRELESS NETWORKS 2019年第1期25卷 429-438页

作者： Chen, Siguang Liu, Jincheng Wang, Kun Wu, Meng Nanjing Univ Posts & Telecommun Minist Educ Key Lab Broadband Wireless Commun & Sensor Networ Nanjing Jiangsu Peoples R China

How to reduce the number of transmissions or prolong the lifetime of wireless sensor networks significantly has become a great challenge. Based on the spatio-temporal correlations of sensory data, in this paper, we propose a hierarchical adaptive spatio-temporal data compression (HASDC) scheme to address this issue. The proposed compression scheme explores the temporal correlation of original sensory data by employing the discrete cosine transform and adaptive threshold compression algorithm (ATCA). And then, the cluster head node explores the spatial correlation among the compressed temporal readings by utilizing discrete wavelet transform (DWT) and ATCA. The HASDC scheme obtains better recovery quality and compression ratio by combining data sorting, ATCA and spatio-temporal compression concept. At the same time, according to the correlation of sensory data and the adaptive threshold value, the HASDC scheme can adjust the compression ratio adaptively, thus it's applicable to different physical scenarios. Finally, the simulation results confirm that the transformed coefficients are more concentrated than the ones without introducing DWT, and the proposed scheme outperforms other spatio-temporal schemes in terms of compression and recovery performances.

关键词： Wireless sensor networks Hierarchical network data sorting Spatio-temporal compression Wavelet transform Discrete cosine transform

来源：评论

学校读者我要写书评

暂无评论

Modification of Parallelization of Modified Merge Sort Algorithm 25th

Modification of Parallelization of Modified Merge Sort Algor...

引用

25th International Conference on Information and Software Technologies (ICIST)

作者： Marszalek, Zbigniew Capizzi, Giacomo Silesian Tech Univ Inst Math Ul Kaszubska 23 PL-44100 Gliwice Poland Univ Catania Elect & Informat Engn DIEEI I-95125 Catania Italy

ISBN: (纸本)9783030302757;9783030302740

An important issue in sorting large data sets in the NoSQL databases is the ability to sort process parallelism in order to accelerate the application. The work presents the use of the parallelized method for merging strings in a modified merge sort algorithm. The static tests of the proposed sort algorithm verify the stability and the theoretical time complexity of the method.

关键词： Parallel algorithm data sorting data mining Analysis of computer algorithms

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：