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

Information, Communication and Energy Systems and Technologies (ICEST), International Scientific Conference on

作者： Miloš Radmanović Faculty of Electronic Engineering University of Niš Niš Serbia

ISBN: (数字)9781728171432

ISBN: (纸本)9781728171449

Bent functions are functions that have the biggest distance from all linear binary functions. Attacks against cryptosystems can be defeated when these systems use bent functions. Generalisation of bent functions is still unknown and when they have many variables, it is very difficult to find them. Therefore, the construction of bent functions is done by using discovery of them within a subset of functions. Thus, this paper describes a method for creating groups of functions in Reed-Muller (RM) domain within which efficient detection of bent functions is performed. As follows, the search space for discovery is limited, and it can be defined for various subsets of Boolean functions. Experimental results confirm that the time required for discovery of bent function when using RM subsets are smaller than when using general random discovery.

关键词： Transforms Cryptography Boolean functions Encoding Computational efficiency C++ languages parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

An exhaustive algorithm based on GPU to process a kNN query

An exhaustive algorithm based on GPU to process a kNN query

引用

Computer Science Society (SCCC) International Conference Chilean FLAGGED

作者： Javier A. Riquelme Ricardo J. Barrientos Ruber Hernández-García Cristóbal A. Navarro Laboratorio LITRP Universidad Católica del Maule Talca Chile Centro de Investigación de Estudios Avanzados del Maule (CIEAM) Universidad Católica del Maule Talca Chile Instituto de Informática Universidad Austral de Chile Valdivia Chile

ISBN: (数字)9781728183282

ISBN: (纸本)9781728183299

The Nearest Neighbors search is a widely used technique with applications on several classification problems. Particularly, the k-nearest neighbor (kNN) algorithm is a well-known method used in modern information retrieval systems aiming to obtain relevant objects based on their similarity to a given query object. Although algorithms based on an exhaustive search have proven to be effective for the kNN classification, their main drawback is their high computational complexity, especially with high-dimensional data. In this work, we present a novel and parallel algorithm to solve kNN queries on a multi-GPU platform. The proposed method is comprised of two stages, which first is based on pivots using the value of K to reduce the search space, and the second one uses a set of heaps to return the final results. Experimental results showed that using between 1-4 GPUs, the proposed algorithm achieves speed-ups of 117x, 224x, 330x, and 389x, respectively. Besides, the obtained results were compared with previous approaches of the state-of-the-art (cp-select and CUB Library), evidencing the superiority of our proposal.

关键词： Graphics processing units Nearest neighbor methods Information retrieval Libraries Classification algorithms Proposals parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

Real time coordinated optimization dispatch model for AC/DC hybrid distribution network 8

Real time coordinated optimization dispatch model for AC/DC ...

引用

8th Renewable Power Generation Conference, RPG 2019

作者： Huang, Yuhui Zhang, Ruifeng Liu, Dong Li, Qingsheng Tang, Xueyong School of Electrical Engineering Shanghai Jiao Tong University Shanghai200240 China Guizhou Electric Power Test Research Institute Guiyang550000 China Guizhou Power Grid Co. Ltd Research Planning Centre Guiyang550002 China

ISBN: (纸本)9781839531255

With the gradual increase of the penetration rate of new energy, the cyber physical system paves a new way for real time dispatch, rational planning and effective utilization of new energy. This paper establishes a dynamic multi-agent real-time coordinated control model for the framework of a typical AC/DC hybrid distribution network and proposes the distributed algorithm. The algorithm includes two parts: optimized dispatch and coordinated control. Firstly, by dispatching and optimizing primary energy, large-scale use and sharing of distributed renewable energy can be realized, energy supply cost can be reduced, and the reliability of energy supply can be improved. Energy Internet provides powerful support for power systems, heating systems, and other major energy networks. Then a coordinated control model based on a dynamic multi-agent system is established to eliminate load fluctuation quickly and efficiently, maintaining the stability of the energy internet. Finally, multi-agent containment control algorithm was applied in the voltage control to guarantee high power quality. According to the actual operation situation of physical devices, the adjustment term serves as a feedback to do real-time correction, in order to make the results satisfy all constraints. Simulation results were presented to demonstrate the effectiveness and robustness of the proposed algorithm. © 2019 Institution of Engineering and Technology. All rights reserved.

关键词： parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

GPU Accelerated Heat Transfer Simulation Supporting Heuristics To Solve The Inverse Heat Conduction Problem

GPU Accelerated Heat Transfer Simulation Supporting Heuristi...

引用

International Symposium on Applied Machine Intelligence and Informatics (SAMI)

作者： Sándor Szénási Zoltán Fried Imre Felde John von Neumann Faculty of Informatics Óbuda University Budapest Hungary

The following topics are dealt with: learning (artificial intelligence); optimisation; feature extraction; genetic algorithms; medical robotics; signal processing; particle swarm optimisation; data acquisition; medica... 详细信息

ISBN: (数字)9781728131498

ISBN: (纸本)9781728131504

关键词： Conductive heat transfer Heat transfer Heuristics Thermal Conductivity simulating parallel algorithms ambient environment thermal characteristics GRAPPER PICK UP Inverse Graphics Processing Unit workpiece

来源：评论

学校读者我要写书评

暂无评论

Uniform linked lists contraction

arXiv

引用

arXiv 2020年

作者： Han, Yijie School of Computing and Engineering University of Missouri at Kansas City Kansas CityMO64110 United States

We present a parallel algorithm (EREW PRAM algorithm) for linked lists contraction. We show that when we contract a linked list from size n to size n/c for a suitable constant c we can pack the linked list into an array of size n/d for a constant 1 (i) n + log i) log log l + log l) time, for an arbitrary constructible integer i, with p processors on the EREW PRAM, where log(1) n = log n and log(t) n = log log(t−1) n and log∗ n = min{i|log(i) n (i) nlog log l + log l). Thus when l = Ω(log(c) n) for any constant c we achieve O(n/p + log l) time. The previous best deterministic EREW PRAM algorithm has time O(n/p+log n) and best CRCW PRAM algorithm has time O(n/p+log n/log log n+log l).MSC Codes 68W10, 68W40 Copyright © 2020, The Authors. All rights reserved.

关键词： parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

Research and Improvement of the SHIFT-AND Pattern Matching Algorithm

Research and Improvement of the SHIFT-AND Pattern Matching A...

引用

IEEE International Conference on Computer and Communication Engineering Technology (CCET)

作者： Yansen Zhou Yitong Cai Department of Information Science and Technology University of International Relations Beijing China

ISBN: (数字)9781728188119

ISBN: (纸本)9781728188126

Time performance improvement of the pattern matching mainly lies in reducing the times of character comparisons in each round of matching and increasing the distance that the text string matching window skips to the right when mismatching happens. Based on the above ideas, an improved algorithm based on the combination of word frequency and SHIFT-AND and BMHS2 is proposed. The improved algorithm first uses word frequency matching in each round of matching to reduce the times of character comparisons in matching window. Then, in order to improve the moving distance of the text string matching window when mismatching happens, the BMHS2 and SHIFT-AND algorithms are introduced. Move the text string matching window to the right by the larger skip distance between the SHIFT-AND and BMHS2 algorithms when characters mismatch. The experimental results show that under the same conditions, compared with the SHIFT-AND and BMHS2 algorithms, the improved pattern matching algorithm I_SHIFT-AND_BMHS2 has a certain improvement in matching time performance.

关键词： Pattern matching Microsoft Windows parallel algorithms Information science International relations Electronic mail

来源：评论

学校读者我要写书评

暂无评论

Asynchronous distributed clustering algorithm for wireless sensor networks 2019

Asynchronous distributed clustering algorithm for wireless s...

引用

4th International Conference on Machine Learning Technologies, ICMLT 2019

作者： Qiao, Cheng Brown, Kenneth N. Insight Centre for Data Analytics Department of Computer Science University College Cork Ireland

ISBN: (纸本)9781450363235

In distributed clustering problems, nodes in a wireless sensor network must learn clusters from the data sensed across the network, without centralising the raw data. This paper presents an asynchronous distributed clustering algorithm for sensors to learn the global clusters, while respecting data privacy, and balancing communication cost and clustering quality. Different clustering algorithms including k-means and Gaussian Mixture Models, and different methods of summarising clusters to exchange between nodes are considered. In experiments on randomly generated network topologies, we demonstrate that methods which do more extensive clustering in each cycle, and which exchange descriptions of cluster shape and density instead of just centroids and data counts, achieve more consistent clustering, in significantly shorter elapsed time. © 2019 ACM.

关键词： parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

Would it be profitable enough to re-Adapt algorithmic thinking for parallelism paradigm 2

Would it be profitable enough to re-Adapt algorithmic thinki...

引用

2nd International Conference on New Trends in Computing Sciences, ICTCS 2019

作者： Eddine Debbi, Aimad Farhat Hamida, Abdelhak Bakhti, Haddi Mohamed Boudhiaf University Dept. of Informatics M'sila Algeria Ferhat Abbas University Dept. of Electronics Setif Algeria

ISBN: (纸本)9781728128825

A lot of progress in computing systems components are devoted today to grant more support for parallelism. This, is likely affording much opportunities for High Performance Computing (HPC) applications developers who become now able to accelerate run-Times progressively. Adapting algorithmic writings for parallelism paradigm likely leads to additional improvement in run-Times. This paper deals with this matter. We carry an empirical measures to assess how interesting is to re-Adapt algorithmic thinking for parallel processing context. We provide thorough comparisons of achievable accelerations among a number of different sorting algorithm kinds. We use a proprietary framework meant previously to serve as a front-end kernel in an automatic parallelization compiler and we populated it with interpolation to make performance predictions in large-scale parallelization. Sequential, semi parallel and parallel algorithms for sorting problem are all involved in the empiric tests considering different distributions for randomized input records. The results let to estimate how much the innovation of specific parallel algorithms could be more profitable than parallelization of serial programs. © 2019 IEEE.

关键词： parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

Pac-Man is Overkill

Pac-Man is Overkill

引用

2020 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS)

作者： Renato Fernando dos Santos Ragesh K. Ramachandran Marcos A. M. Vieira Gaurav S. Sukhatme Instituto Federal de Educação Ciência e Tecnologia de Mato Grosso do Sul Rua Salime Tanure Mato Grosso do Sul Brazil Universidade Federal de Minas Gerais Minas Gerais Brazil Robotic Embedded Systems Laboratory University of Southern California Los Angeles CA

ISBN: (数字)9781728162126

ISBN: (纸本)9781728162133

Pursuit-Evasion Game (PEG) consists of a team of pursuers trying to capture one or more evaders. PEG is important due to its application in surveillance, search and rescue, disaster robotics, boundary defense and so on. In general, PEG requires exponential time to compute the minimum number of pursuers to capture an evader. To mitigate this, we have designed a parallel optimal algorithm to minimize the capture time in PEG. Given a discrete topology, this algorithm also outputs the minimum number of pursuers to capture an evader. A classic example of PEG is the popular arcade game, Pac-Man. Although Pac-Man topology has almost 300 nodes, our algorithm can handle this. We show that Pac-Man is overkill, i.e., given the Pac-Man game topology, Pac-Man game contains more pursuers/ghosts (four) than it is necessary (two) to capture evader/Pac-man. We evaluate the proposed algorithm on many different topologies.

关键词： Surveillance Games Topology parallel algorithms Intelligent robots

来源：评论

学校读者我要写书评

暂无评论

Applying HT-NGH Algorithm On A Shared Memory Architecture For Time Performance Improvement

Research Square

引用

Research Square 2020年

作者： Abu-Hashem, Muhannad A. Department of Geomatics Faculty of Architecture and Planning King Abdulaziz University Jeddah Saudi Arabia

Background: Sequence comparison and alignment plays an important role in computational biology as they allow for rating the similarities between molecular sequences. Pair-wise alignment contributes significantly in calculating the similarity between sequences by constructing the optimal alignment. The Hash Table-N-Gram-Hirschberg (HT-NGH) algorithm, which is an extension to the Hashing-N-Gram-Hirschberg (HNGH) and N-Gram-Hirschberg (NGH) algorithms, represents a pair-wise alignment method that uses the capabilities of the hash table technique for the purpose of building the alignment. Due to the current technology, molecular databases have exponentially grown to highlight the needs for faster and efficient methods that can handle these amounts of data. On the other hand, the present technology provides a verity of high performance architectures and tools. Results: This paper presents a parallel shared memory algorithm for protein pair-wise alignment method, namely, the HT-NGH algorithm in order to enhance the time performance of sequences’ comparisons and alignments. The proposed parallel algorithm targets the transformation phase of the HT-NGH algorithm since it consumes about 10% of alignment’s executional time. Datasets are decomposed up to sequence level for a more efficient utilization of processing units (no idle processing unit). Conclusions: As a result, the proposed algorithm demonstrates a significant improvement in terms of time performance without sacrificing accuracy. The speed up pertaining to the parallel algorithm reaches 2.08, 2.88, and 3.87 when using 2, 3, and 4 cores, respectively. Furthermore, this algorithm gains high efficiency as it reaches 1.04, 0.96, and 0.97 when using 2, 3, and 4 cores, respectively. © 2020, CC BY.

关键词： parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：