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

16th international conference on Computer Systems and Technologies, CompSysTech 2015

作者： Nehéz, Martin Bernát, Dušan Klaučo, Martin in Bratislava Bratislava812 37 Slovakia Institute of Computer Systems and Networks Faculty of Informatics and Information Technology SUT in Bratislava Ilkovicova 3 Bratislava842 16 Slovakia

ISBN: (纸本)9781450333573

computation of the minimum dominating set problem is a classical discrete optimization problem in graph theory. Recently, it has found application in the network controlling theory. In this paper, there are compared three approaches of small dominating set computation. the first one is based on the integer linear programming. the second one is the combined hill-climbing algorithm which is based on the randomization and binary searching. Both are compared with a simply greedy algorithm. the experiments were conducted for three different graph classes. the integer linear programming achieved the best performance for the large real-world network's analysis.

关键词： Complex networks

来源：评论

学校读者我要写书评

暂无评论

Improved algorithm for computation of surface potentials in a realistic head shape model

Improved algorithm for computation of surface potentials in ...

引用

Proceedings of the 16th Annual international conference of the IEEE Engineering in Medicine and Biology Society. Part 1 (of 2)

作者： Fletcher, Daniel J. Amir, Avner Abratech Corp Sausalito United States

A new technique for computing the potentials on the surface of a Boundary Element Method (BEM) model, the Lead Field Analysis (LFA) Algorithm, is described. It is based on the Reciprocity theorem and is more computationally efficient, requires less storage space, and yields potentially higher accuracy for surface potential computations than the standard method currently in use.

关键词： algorithms

来源：评论

学校读者我要写书评

暂无评论

Fast and robust computation of the Hausdorff distance between triangle mesh and quad mesh for near-zero cases

引用

COMPUTERS & GRAPHICS-UK 2019年第0期81卷 61-72页

作者： Kang, Yunku Yoon, Seung-Hyun Kyung, Min-Ho Kim, Myung-Soo Seoul Natl Univ Dept Comp Sci & Engn Seoul 08826 South Korea Dongguk Univ Dept Multimedia Engn Seoul 04620 South Korea Ajou Univ Dept Digital Media Suwon 16499 South Korea

We introduce an algorithm for computing the two-sided Hausdorff distance between a triangle mesh and a quad mesh, guaranteed to be within the given error bound, which can be machine precision-level small. the algorithm expands upon a recent breakthrough that only calculates the one-sided Hausdorff distance from the triangle mesh to the quad mesh using what is called "matching" and "upper bounding" of candidate pieces. We complete the algorithm by accomplishing the computation of the one-sided Hausdorff distance in the opposite direction: from the quad mesh to the triangle mesh. We split each quad into two triangular pieces to simplify the breakdown of matching cases and provide additional matching methods for new cases. By fusing the two one-sided computation algorithms, one can compute the two-sided Hausdorff distance that, for instance, can properly evaluate a quad mesh approximation of a triangle mesh. Experimental results show that our algorithm can handle near-zero Hausdorff distance, which has always been known to be a much difficult task, in an interactive time. Moreover, the improvement in efficiency of the two-sided Hausdorff distance computation over the successive execution of the two one-sided computations is addressed. (C) 2019 Elsevier Ltd. All rights reserved.

关键词： Hausdorff distance Shape matching Quad mesh

来源：评论

学校读者我要写书评

暂无评论

Particle computation: complexity, algorithms, and logic

引用

NATURAL COMPUTING 2019年第1期18卷 181-201页

作者： Becker, Aaron T. Demaine, Erik D. Fekete, Sandor P. Lonsford, Jarrett Morris-Wright, Rose Univ Houston Dept Elect & Comp Engn Houston TX USA MIT Comp Sci & Artificial Intelligence Lab 77 Massachusetts Ave Cambridge MA 02139 USA TU Braunschweig Dept Comp Sci Braunschweig ME Germany Brandeis Univ Dept Math Waltham MA 02254 USA

We investigate algorithmic control of a large swarm of mobile particles (such as robots, sensors, or building material) that move in a 2D workspace using a global input signal (such as gravity or a magnetic field). Upon activation of the field, each particle moves maximally in the same direction until forward progress is blocked by a stationary obstacle or another stationary particle. In an open workspace, this system model is of limited use because it has only two controllable degrees of freedom-all particles receive the same inputs and move uniformly. We show that adding a maze of obstacles to the environment can make the system drastically more complex but also more useful. We provide a wide range of results for a wide range of questions. these can be subdivided into external algorithmic problems, in which particle configurations serve as input for computations that are performed elsewhere, and internal logic problems, in which the particle configurations themselves are used for carrying out computations. For external algorithms, we give both negative and positive results. If we are given a set of stationary obstacles, we prove that it is NP-hard to decide whether a given initial configuration of unit-sized particles can be transformed into a desired target configuration. Moreover, we show that finding a control sequence of minimum length is PSPACE-complete. We also work on the inverse problem, providing constructive algorithms to design workspaces that efficiently implement arbitrary permutations between different configurations. For internal logic, we investigate how arbitrary computations can be implemented. We demonstrate how to encode dual-rail logic to build a universal logic gate that concurrently evaluates and, nand, nor, and or operations. Using many of these gates and appropriate interconnects, we can evaluate any logical expression. However, we establish that simulating the full range of complex interactions present in arbitrary digital circuits encoun

关键词： Programmable matter Robot swarms Nano-particles Uniform inputs Parallel motion planning Complexity Array permutations NP-completeness PSPACE-completeness Efficient algorithms Logic gates Universal computation

来源：评论

学校读者我要写书评

暂无评论

theory and algorithms for Parallel computation 16th

Theory and Algorithms for Parallel Computation

引用

16th international Euro-Par conference on Parallel Processing

作者： Kessler, Christoph Rauber, thomas Robert, Yves Scarano, Vittorio Linkoping University Sweden University of Bayreuth Germany Normal Superior School of Lyon France University of Salerno Italy

ISBN: (纸本)9783642152900

Parallelism concerns all levels of current computing systems, from single CPU machines to large server farms. Effective use of parallelism relies crucially on the availability of suitable models of computation for algorithm design and analysis, and of efficient strategies for the solution of key computational problems on prominent classes of platforms, as well as of good models of the way the different components are interconnected. With the advent of multicore parallel machines, new models and paradigms are needed to allow parallel programming to advance into mainstream computing. © 2010, Springer-Verlag Berlin Heidelberg.

关键词： Parallel programming

来源：评论

学校读者我要写书评

暂无评论

SHADE: Secure HAmming DistancE computation from Oblivious Transfer

SHADE: Secure HAmming DistancE Computation from Oblivious Tr...

引用

16th international conference on Financial Cryptography and Data Security

作者： Bringer, Julien Chabanne, Herve Patey, Alain Morpho Tokyo Japan

ISBN: (纸本)9783642413193;9783642413209

We introduce two new schemes for securely computing Hamming distance in the two-party setting. Our first scheme is a very efficient protocol, based solely on 1-out-of-2 Oblivious Transfer, that achieves full security in the semi-honest setting and one-sided security in the malicious setting. Moreover we show that this protocol is significantly more efficient than the previous proposals, that are either based on garbled circuits or on homomorphic encryption. Our second scheme achieves full security against malicious adversaries and is based on Committed Oblivious Transfer. these protocols have direct applications to secure biometric identification.

关键词： Secure Multi-Party computation Hamming Distance Oblivious Transfer Biometric Identification

来源：评论

学校读者我要写书评

暂无评论

Algorithmically Expressive, Always-Terminating Model for Reversible computation 16th

Algorithmically Expressive, Always-Terminating Model for Rev...

引用

16th international conference on Reversible computation (RC)

作者： Palazzo, Matteo Roversi, Luca Univ Torino Dipartimento Informat Turin Italy

ISBN: (纸本)9783031620751;9783031620768

Concerning classical computational models able to express all the Primitive Recursive Functions (PRF), there are interesting results regarding limits on their algorithmic expressiveness, meant as the possibility to naturally express algorithms with minimal computational cost. By introducing the reversible computational model For(est), to our knowledge, we provide a first study of analogous properties, adapted to the context of reversible computational models that can represent all the functions in PRF. Firstly, we show that For(est) extends Matos' linear reversible computational model M-SRL, the very extension being a guaranteed terminating iteration that can be halted by means of logical predicates. the consequence is that For(est) is PRF-complete, because M-SRL is. Secondly, we show that For(est) is strictly algorithmically more expressive than M-SRL: it can encode a reversible algorithm for the minimum between two integers in optimal time, while M-SRL cannot.

关键词： Reversible computation Loop-language Primitive Recursive Functions Algorithmic expressiveness

来源：评论

学校读者我要写书评

暂无评论

Quantum computation and Its Effects in Database Systems 1

引用

24th East-European conference on Advances in Databases and Information Systems/24th international conference on theory and Practice of Digital Libraries/16th Workshop on Business Intelligence and Big Data (ADBIS/TPDL/EDA)

作者： Joczik, Szabolcs Kiss, Attila Eotvos Lorand Univ Fac Informat H-1117 Budapest Hungary

ISBN: (数字)9783030546236

ISBN: (纸本)9783030546229;9783030546236

Classically, searching an unsorted database requires a linear search, which is O(n) in time. Using Grover's quantum search algorithm, it is possible to do it in O(root n) time which is a quadratic speedup compared to its classical counterpart. the aim of this research is to exploit this speedup and find other applications in different algorithms commonly used in database systems.

关键词： Quantum computing Grover's algorithm Database operations

来源：评论

学校读者我要写书评

暂无评论

Revenue-Sharing based computation-Resource Allocation for Mobile Blockchain

Revenue-Sharing based Computation-Resource Allocation for Mo...

引用

39th IEEE international conference on Computer Communications (IEEE INFOCOM)

作者： Wu, Yuan Xu, Xu Qian, Liping Ji, Bo Shi, Zhiguo Jia, Weijia Univ Macau State Key Lab Internet Things Smart City Taipa Macau Peoples R China Zhejiang Univ Technol Coll Informat Engn Hangzhou Peoples R China Temple Univ Dept Comp & Informat Sci Philadelphia PA 19122 USA Zhejiang Univ Coll Informat Sci & Elect Engn Hangzhou Peoples R China

ISBN: (数字)9781728186955

ISBN: (纸本)9781728186955

In this paper, we investigate the revenue-sharing based computation-resource allocation for mobile Blockchain, in which conventional mobile devices (i.e., the edge-computing users, EUs) can acquire computation-resources from the edge-server (ES) for increasing their chances of winning the mining game in Blockchain. Meanwhile, as a compensation to the ES, the EUs adopt the revenue-sharing mechanism by sharing parts of their respective rewards to the ES. We formulate a joint optimization of the ES's computation-resource allocation to the EUs and the EUs' revenue-sharing to the ES, with the objective of maximizing the system-reward of all EUs and the ES. Despite the non-convexity of the joint optimization problem, we propose an algorithm based on the cyclic block coordinate descent (CBCD) to solve the problem. Our algorithm decouples the original problem into two subproblems and alternatively optimizes the EUs' revenue-sharing and ES's computation-resource allocation until reaching convergence. For each subproblem, we also propose an efficient algorithm for solving it. Numerical results are provided to validate the effectiveness and efficiency of our proposed algorithms, as well as the performance advantage of our proposed revenue-sharing based computation-resource allocation for mobile Blockchain.

关键词： Resource management Optimization Games Edge computing computational modeling Linear programming

来源：评论

学校读者我要写书评

暂无评论

ARTful Skyline computation for In-Memory Database Systems 1

引用

作者： Schuele, Maximilian E. Kulikov, Alex Kemper, Alfons Neumann, thomas Tech Univ Munich Munich Germany

ISBN: (数字)9783030546236

ISBN: (纸本)9783030546229;9783030546236

Skyline operators compute the Pareto-optimum on multi-dimensional data inside disk-based database systems. With the arising trend of main-memory database systems, pipelines process tuples in parallel and in-memory index structures, such as the adaptive radix tree, reduce the space consumption and accelerate query execution. We argue that modern database systems are well suited to progressive skyline operators. In addition, space-efficient index structures together with tree-based skyline algorithms improve the overall performance on categorical input data. In this work, we parallelise skyline algorithms, reduce their memory consumption and allow their integration into the main-memory database system HyPer. In our evaluation, we show that our parallelisation techniques scale linearly with every additional worker, and that the adaptive radix tree reduces memory consumption in comparison to existing tree-based approaches for skyline computation.

关键词： Skyline operator In-Memory DBMS Adaptive radix tree

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：