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

arXiv 2017年

作者： Kowalski, Dariusz R. Moses, William K. Vaya, Shailesh Department of Computer Science University of Liverpool Liverpool United Kingdom Department of Computer Science and Engineering Indian Institute of Technology Madras Chennai India Conduent Labs India Bangalore India

For a given network, a backbone is an overlay network consisting of a connected dominating set with additional accessibility properties. Once a backbone is created for a network, it can be utilized for fast communication amongst the nodes of the *** Signal-to-Interference-plus-Noise-Ratio (SINR) model has become the standard for modeling communication among devices in wireless networks. The SINR model takes into consideration the power of all transmitting stations as well as the relative distances between the stations to determine whether a given transmission is successful. It is much closer to the real world and has been established to have lot more *** the SINR model, the community has pondered what the most realistic solutions for communication problems in wireless networks would look like. Such solutions would have the characteristic that they would make the least number of assumptions about the availability of information about the participating nodes. Solving problems when nothing at all is known about the network and having nodes just start participating would be ideal. However, this is quite challenging and most likely not feasible. The pragmatic approach is then to make meaningful assumptions about the available information and present efficient solutions based on this *** present a solution for creation of backbone in the SINR model, when nodes do not have access to their physical coordinates or the coordinates of other nodes in the network. This restriction models the deployment of nodes in various situations for sensing hurricanes, cyclones, and so on, where only information about nodes prior to their deployment may be known but not their actual locations post deployment. We assume that nodes have access to knowledge of their label, the labels of nodes within their neighborhood, the range from which labels are taken [N] and the total number of participating nodes n. We also assume that nodes wake up spontaneously. We pres

关键词： parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

A Framework for Analyzing Resparsification algorithms 17

A Framework for Analyzing Resparsification Algorithms

引用

Annual ACM-Society for Industrial and Applied Mathmatics Symposium on Discrete algorithms

作者： Rasmus Kyng Jakub Pachocki Richard Peng Sushant Sachdeva Yale University Harvard University Georgia Tech Google

ISBN: (纸本)9781510836358

A spectral sparsifier of a graph G is a sparser graph H that approximately preserves the quadratic form of G, i.e., for all vectors x, x~T L_G x ≈ x~T L_H x, where L_G and L_H denote the respective graph Laplacians. Spectral sparsifiers generalize cut sparsifiers, and have found many applications in designing graph algorithms. In recent years, there has been interest in computing spectral sparsifiers in semi-streaming and dynamic settings. Natural algorithms in these settings often involve repeated sparsification of a graph, and in turn accumulation of errors across these steps. We present a framework for analyzing algorithms that perform repeated sparsifications that only incur error corresponding to a single sparsification step, leading to better results for many of these reseparsification based algorithms. As an application, we show how to maintain a spectral sparsifier in the semi-streaming setting: We present a simple algorithm that, for a graph G on n vertices and m edges, computes a spectral sparsifier of G with O(n log n) edges in a single pass over G, using only O(n log n) space, and O(m log~2 n) total time. This improves on previous best semi-streaming algorithms for both spectral and cut sparsifiers by a factor of log n in both space and runtime. The algorithm also extends to semi-streaming row sampling for general PSD matrices. As another application, we use this framework to combine a spectral sparsification algorithm by Koutis with improved spanner constructions to give a parallel algorithm for constructing O(n log~2 n log log n) sized spectral sparsifiers in O(m log~2 n log log n) time. This is the best combinatorial graph sparsification algorithm to date, and the size of the sparsifiers produced is only a factor log n log log n more than ones produced by numerical routines.

关键词： logs logarithm (log) algorithms Line graph Frameworks Graph algorithms Quadratic form parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

A parallelized Method for Continuous-Time Models with Dependence on Calculation Order

引用

IFAC-PapersOnLine 2016年第11期49卷 685-690页

作者： Sata, Kota Azuma, Shun-ichi Ohata, Akira Toyota Motor Corporation Advanced Unit Management System Development Div. Shizuoka Japan Kyoto University Dept. of Systems Science Kyoto Japan Technova Inc. Tokyo Japan

The advancement of the engine control increases the amount of computation. The production ECU (Electronic Control Unit), which is made of single-core architecture, cannot have a higher clock speed. Using multi-/many-core architecture is the only way to decrease execution time. However, when implementing the engine control software, various problems occur in utilization of the multi-/many-core ECU. One of the biggest problems is sequential structure of control software because the software can only execute with one core on the multi-/many-core ECU. The purpose of this paper is to describe the parallelized control design method, which has decomposed sequential structure and decreases execution time in the embedded multi-/many-core production ECU. © 2016

关键词： Control systems Automobile engines Computer architecture Continuous time systems Industrial electronics Internal combustion engines parallel algorithms Servomechanisms Automotive control Continuous time models Control design Control design methods Ecus (electronic control unit) Electronic control units execution times Sequential structure

来源：评论

学校读者我要写书评

暂无评论

COARSE MESH PARTITIONING FOR TREE-BASED AMR

引用

SIAM JOURNAL ON SCIENTIFIC COMPUTING 2017年第5期39卷 C364-C392页

作者： Burstedde, Carsten Holke, Johannes Rhein Friedrich Wilhelms Univ Bonn INS D-53115 Bonn Germany Rhein Friedrich Wilhelms Univ Bonn HCM D-53115 Bonn Germany

In tree-based adaptive mesh refinement, elements are partitioned between processes using a space-filling curve. The curve establishes an ordering between all elements that derive from the same root element, the tree. When representing complex geometries by connecting several trees, the roots of these trees form an unstructured coarse mesh. We present an algorithm to partition the elements of the coarse mesh such that (a) the fine mesh can be load-balanced to equal element counts per process regardless of the element-to-tree map, and (b) each process that holds fine mesh elements has access to the meta data of all relevant trees. As an additional feature, the algorithm partitions the meta data of relevant ghost (halo) trees as well. We develop in detail how each process computes the communication pattern for the partition routine without handshaking and with minimal data movement. We demonstrate the scalability of this approach on up to 917e3 MPI ranks and 371e9 coarse mesh elements, measuring run times of one second or less.

关键词： adaptive mesh refinement coarse mesh mesh partitioning parallel algorithms forest of octrees high-performance computing

来源：评论

学校读者我要写书评

暂无评论

GLOBAL DETERMINISTIC AND STOCHASTIC OPTIMIZATION IN A SERVICE ORIENTED ARCHITECTURE 17

GLOBAL DETERMINISTIC AND STOCHASTIC OPTIMIZATION IN A SERVIC...

引用

Simulation Multiconference

作者： Chaitra Raghunath Tyler H. Chang Mohamed Jrad Rakesh K. Kapania Layne T. Watson Raymond M. Kolonay Dept. of Computer Science Virginia Polytechnic Institute & State University Dept. of Aerospace & Ocean Eng. Virginia Polytechnic Institute & State University Dept. of Computer Science Dept. of Mathematics Dept. of Aerospace & Ocean Eng. Virginia Polytechnic Institute & State University AFRL/RQVC

ISBN: (纸本)9781510838222

Service ORiented Computing EnviRonment (SORCER) is a Java-based network-centric computing platform. SORCER provides a service oriented architecture, which enables the implementation of parallel algorithms in a dynamic distributed computing environment. SORCER is often used for multidisciplinary aircraft design analysis and optimization. However, the current approach often assigns intense optimization algorithms to run entirely on single overloaded nodes, rather than evenly distributing the workload. The goal of this work is to provide lower-level optimization algorithms as integrated SORCER services and study the overhead of doing so. VTDIRECT95, a Fortran 95 implementation of D. R. Jones' algorithm DIRECT, is a highly parallelizable derivative-free deterministic global optimization algorithm. QNSTOP is a parallel quasi-Newton algorithm for stochastic optimization problems. The potential benefit of integrating VTDIRECT95 and QNSTOP into the SORCER framework is to provide dynamic load balancing among computational resources at the optimization level, resulting in a dynamically scalable process.

关键词： Service-oriented computing Deterministic global optimization Stochastic optimization Multi-disciplinary design ARCHITECTURE Legal Services Optimization algorithms Service-oriented architecture Building construction parallel algorithms network-centric computing multidisciplinary information Load balancing QNA

来源：评论

学校读者我要写书评

暂无评论

CES: A System for Community Evaluation

CES: A System for Community Evaluation

引用

International Conference on Advances in Social Network Analysis and Mining, ASONAM

作者： Bin Wu Xuesong Tong Qian Guo Beijing Key Laboratory of Intelligent Telecommunications Software and Multimedia Beijing University of Posts and Telecommunications Beijing China

ISBN: (数字)9781450349932

ISBN: (纸本)9781450349932

With the development of Internet, we are gradually entering the era of big data. The size of network is increasing and the structure of network is becoming more complex. Community is a unique network structure with great research value. The task of community analysis goes through two separate phases: first, detection of meaningful community structure from a network, and second, evaluation of the appropriateness of the detected community structure. With the popularity of network research, many community detection algorithms emerged which can be grouped in categories, based on different criteria. In order to applicate community detection algorithms in real-world network analysis, we need to measure the performance of the algorithm. The performance depends on two points, that is, whether the algorithm can give the result of community division in an acceptable time, and whether the algorithm can reveal the community structure of the network with high quality. In recent years, systems used to analyze network and detect community are mushrooming. However, existing systems rarely have evaluation function, either providing social network analysis or providing data analysis service. We need a tool to evaluate community detection algorithms. In response to the challenge, the Community Evaluation System (CES) is proposed to meet the demands of community detection algorithms' evaluation. CES can evaluate community detection algorithms with multiple metrics. It uses B/S mode, integrates Spark, Yarn and HDFS technology to support the operation of large-scale data, and experiments prove that it is effective.

关键词： Detection algorithms Measurement Heuristic algorithms parallel algorithms Social network services Data mining Task analysis

来源：评论

学校读者我要写书评

暂无评论

Performance comparison between state-of-the-art point-cloud based collision detection approaches on the CPU and GPU

引用

IFAC-PapersOnLine 2016年第30期49卷 54-59页

作者： Schauer, Johannes Bedkowski, Janusz Majek, Karol Nüchter, Andreas Informatics VII: Robotics and Telematics Julius-Maximilians-University Würzburg Am Hubland WürzburgD-97074 Germany Institute of Mathematical Machines ul. Krzywickiego 34 Warsaw02-078 Poland

We present two fundamentally different approaches to detect collisions between two point clouds and compare their performance on multiple datasets. A collision between points happens if they are closer to each other than a given threshold radius. One approach utilizes the main CPU with a k-d tree datastructure to efficiently carry out fixed range searches around points in 3D while the other mainly executes on a GPU using a regular grid decomposition technique implemented in the CUDA framework. We will show how massively parallel 3D range searches on a grid based datastructure on a GPU performs similarly well as a tree based approach on the CPU with orders of magnitude less parallelization. We also show how each method scales with varying input sizes and how they perform differently well depending on the spatial structure of the input data. © 2016

关键词： Three dimensional computer graphics Graphics processing unit parallel algorithms 3D point cloud Collision detection CUDA Decomposition technique K d tree Orders of magnitude Performance comparison Regular grids

来源：评论

学校读者我要写书评

暂无评论

Mathematical Modeling of the Dynamics of Nonequilibrium in Time Convection-Diffusion Processes in Domains with Free Boundaries

引用

CYBERNETICS AND SYSTEMS ANALYSIS 2016年第3期52卷 427-440页

作者： Bulavatsky, V. M. Bogaenko, V. A. Natl Acad Sci Ukraine VM Glushkov Cybernet Inst Kiev Ukraine

A mathematical model is constructed that describes the dynamics of fractional-differential locally nonequilibrium in time convection-diffusion process of soluble substances in plain-vertical established filtration with free boundary. The respective boundary-value problem is formulated and the technique is outlined to derive its approximate solution. parallel algorithms for calculation of cluster systems are developed, the results of testing the response of parallel algorithms for GPU and the results of numerical experiments on simulation of the dynamics of the migration process under study are presented.

关键词： nonclassical diffusion models nonequilibrium in time convection diffusion process plain-vertical filtration in porous medium diffusion equation with delay fractional diffusion equation boundary-value problems approximate solutions parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

A parallel algorithm for determining the communication radius of an automatic light trap based on balltree structure

A parallel algorithm for determining the communication radiu...

引用

8th International Conference on Knowledge and Systems Engineering (KSE)

作者： Giang Nguyen Thi Phuong Huong Hoang Luong Tai Huu Pham Hiep Xuan Huynh Ind Univ Ho Chi Minh City Ho Chi Minh City Vietnam Cantho Univ CUSC Can Tho Vietnam Cantho Univ DREAM CTU IRD CICT Can Tho Vietnam

ISBN: (纸本)9781467389297

Communicating radius of automatic light trap surveillance network characterizes how well an area is monitored or tracked by automatic light traps. Connectivity is an important required that shows how nodes in an automatic BPH light trap surveillance network can eectively communicate. In this paper, we propose a new approach to determine the communication radius of an automatic light trap based on balltree structure. This approach will propose a parallel algorithm for implementing the balltree structure (CudaBalltree) and determining the communication radius of an automatic light trap by using CUDA NVIDA platform.

关键词： Graphics processing units parallel algorithms Temperature sensors Surveillance Cameras parallel algorithms Temperature Sensor Device Component Cameras Traps Graphics Processing Unit AUTOMATIC Radius Radius Light Communication Research

来源：评论

学校读者我要写书评

暂无评论

EFFICIENT algorithms FOR ASSORTATIVE EDGE SWITCH IN LARGE LABELED NETWORKS 17

EFFICIENT ALGORITHMS FOR ASSORTATIVE EDGE SWITCH IN LARGE LA...

引用

Simulation Multiconference

作者： Hasanuzzaman Bhuiyan Maleq Khan Madhav Marathe Department of Computer Science Network Dynamics and Simulation Science Laboratory Biocomplexity Institute of Virginia Tech Department of Electrical Engineering and Computer Science Texas A&M University-Kingsville

ISBN: (纸本)9781510838222

An assortative edge switch is an operation on a labeled network, where two edges are randomly selected and the end vertices are swapped with each other if the labels of the end vertices of the edges remain invariant. Assortative edge switch has important applications in studying the mixing pattern and dynamic behavior of social networks, modeling and analyzing dynamic networks, and generating random networks. In this paper, we present an efficient sequential algorithm and a distributed-memory parallel algorithm for assortative edge switch. To our knowledge, they are the first efficient algorithms for this problem. The dependencies among successive assortative edge switch operations, the requirement of maintaining the assortative coefficient invariant, keeping the network simple, and balancing the computation loads among the processors pose significant challenges in designing a parallel algorithm. Our parallel algorithm achieves a speedup of 68 - 772 with 1024 processors for a wide variety of networks.

关键词： Assortative edge switch Random network generation Network dynamics parallel algorithms parallel algorithms efficient algorithm Switches edges Network PROCESSOR Edge of a figure or solid telecommunication standards cellular radio LARGE gene Speeding

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：