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

20th International Computer Science and Engineering Conference (ICSEC)

作者： Gunawan Ferdinandus, F. X. Setiawan, Esther Irawati Sekolah Tinggi Tekn Surabaya Dept Comp Sci Surabaya Indonesia

ISBN: (纸本)9781509044207

In this research, we have constructed road assets management system for Surabaya, the second biggest city in Indonesia. As reported in this paper, we have managed 607 assets -comprising traffic signs, traffic lights, and road marking-which are spread out at 365 different locations. The availability of mobile apps, which are equipped with camera and Global Positioning System (GPS), allows our proposed system to be implemented for road assets management system in other cities in Indonesia. The overall system we offered has accommodated three main roles of a system: administrator, operator, and client. Administrator acts as an officer or a manager of the city transportation department. A number of operators are in charge of acquiring images and physical locations of road assets using camera and GPS of smart phones. Client has an important role in monitoring and providing valid information of damaged road assets for further follow-up maintenance by the manager. Our research has successfully shown that Geo JavaScript Object Notation or GeoJSON-based Web Service provides several advantages in at least three different aspects. First, GeoJSON allows us to handle hierarchical data structure needed when a location might possibly have more than one road assets. Second, web service is able to support an easy distribution of data between web server and client, desktop applications, as well as various mobile apps. Third, GeoJSON supports geometric types of point and polygon, thus the process of checking point in polygon (PIP) is made possible to validate whether a road asset is indeed located on a certain track.

关键词： Road Assets Geographic Information System GeoJSON hierarchical data structure Point in Polygon

来源：评论

学校读者我要写书评

暂无评论

DomLock: A New Multi-Granularity Locking Technique for Hierarchies 16

DomLock: A New Multi-Granularity Locking Technique for Hiera...

引用

21st ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPoPP)

作者： Kalikar, Saurabh Nasre, Rupesh IIT Madras Madras Tamil Nadu India

ISBN: (纸本)9781450340922

We present efficient locking mechanisms for hierarchical data structures. Several applications work on an abstract hierarchy of objects, and a parallel execution on this hierarchy necessitates synchronization across workers operating on different parts of the hierarchy. Existing synchronization mechanisms are either too coarse, too inefficient, or too ad hoc, resulting in reduced or unpredictable amount of concurrency. We propose a new locking approach based on the structural properties of the underlying hierarchy. We show that the developed techniques are efficient even when the hierarchy is an arbitrary graph, and are applicable even when the hierarchy involves mutation. Theoretically, we present our approach as a locking- cost- minimizing instance of a generic algebraic model of synchronization for hierarchical data structures. Using STMBench7, we illustrate considerable reduction in the locking cost, resulting in an average throughput improvement of 42%.

关键词： hierarchical data structure trees graphs object graphs locking synchronization dominators

来源：评论

学校读者我要写书评

暂无评论

GPU-based Parallel R-tree Construction and Querying 29

GPU-based Parallel R-tree Construction and Querying

引用

29th IEEE International Parallel and Distributed Processing Symposium (IPDPS)

作者： Prasad, Sushil K. McDermott, Michael He, Xi Puri, Satish Georgia State Univ Dept Comp Sci Atlanta GA 30303 USA

ISBN: (纸本)9781467376846

An R-tree is a data structure for organizing and querying multi-dimensional non-uniform and overlapping data. Efficient parallelization of R-tree is an important problem due to societal applications such as geographic information systems (GIS), spatial database management systems, and VLSI layout which employ R-trees for spatial analysis tasks such as mapoverlay. As graphics processing units (GPUs) have emerged as powerful computing platforms, these R-tree related applications demand efficient R-tree construction and search algorithms on GPUs. This problem is hard both due to (i) non-linear tree topology of the data structure itself and (ii) the unconventional single-instruction multiple-thread (SIMT) architecture of modern GPUs requiring careful engineering of a host of issues. Therefore, the current best parallelizations of R-tree on GPU has limited speedup of only about 20-fold. We present a space-efficient data structure design and a non-trivial bottom-up construction algorithm for R-tree on GPUs. This has yielded the first demonstrated 226-fold speedup in parallel construction of an R-tree on a GPU compared to one-core execution on a CPU. We also present innovative R-tree search algorithms that are designed to overcome GPU's architectural and resource limitations. The best of these algorithms gives a speed up of 91-fold to 180-fold on an R-tree with 16384 base objects for query sizes ranging from 2k to 16k.(1)

关键词： R-Tree GPGPU Recursion hierarchical data structure Dynamic Parallelism GIS CUDA

来源：评论

学校读者我要写书评

暂无评论

A Real-Time Motion Detection for Video Surveillance System

A Real-Time Motion Detection for Video Surveillance System

引用

5th IEEE International Workshop on Intelligent data Acquisition and Advanced Computing Systems - Technology and Applications (IDAACS)

作者： Kurylyak, Yuriy Ternopil Natl Econ Univ Res Inst Intelligent Comp Syst Ternopol Ukraine

ISBN: (纸本)9781424448814

This paper describes an approach to moving objects detection in video stream with the usage of improved background subtraction and model updating methods as well as hierarchical data structure. The improved method of background model updating allows to change dynamically the speed of such updating depending on the average change of pixels' values. Applying of the modified algorithm of quadtree creation allows to speed up the performance by comparing not all the pixels, but only the random ones and also to use the quadtree structure created on the previous frame instead of creating from scratch. Experimental results show that proposed method is up to 10% faster than simple difference, up to 45% faster than running average.

关键词： Intelligent Video Surveillance Motion Detection Background Subtraction Background Model Updating hierarchical data structure

来源：评论

学校读者我要写书评

暂无评论

Reimagining the history of GIS

引用

ANNALS OF GIS 2018年第1期24卷 1-8页

作者： Goodchild, Michael F. Univ Calif Santa Barbara Dept Geog Santa Barbara CA 93106 USA

Fifty years after the initial efforts that coalesced as geographic information system (GIS), it is possible to look back and ask whether the decisions made then are still viable. Those decisions were constrained by the computing environment of the time, which was extremely primitive compared to today's. The Canada Geographic Information System is used to illustrate those decisions and their consequences. Today it is possible to imagine a very different birth of GIS, based on globes rather than maps, and with positional uncertainty and spatial resolution addressed at the outset using hierarchical data structures for the globe. These structures also have the advantages of a congruent geography operating at multiple scales. GIS today still reflects in part the constraints of computing in the mid 1960s.

关键词： GIS history digital globe discrete global grid hierarchical data structure

来源：评论

学校读者我要写书评

暂无评论

Network Traffic Load Balancing in hierarchical Peer-To-Peer Systems 10

Network Traffic Load Balancing in Hierarchical Peer-To-Peer ...

引用

10th International Conference on P2P, Parallel, Grid, Cloud and Internet Computing 3PGCIC

作者： Moro, Gianluca Pirini, Tommaso Sartori, Claudio Univ Bologna Dept Comp Sci & Engn I-40126 Bologna Italy

ISBN: (纸本)9781467394734

The management of huge amounts of data distributed across multiple sites has become a necessity more and more demanding. Peer-to-peer systems (P2P) can afford the requirements of managing, indexing, searching and analyzing data with scalability and self-organization. Until now, most efforts have focused primarily on improving the number of hops and structure maintenance messages. However, the non-uniform distribution of data and the hierarchical structures, together with heavy load, can cause unbalanced traffic load. In this paper we improve our previous work on the overlay structure G-Grid, merging it with a Small World network. The Small World networks make a compromise between order and randomness, they are derived from social networks and show an almost uniform traffic distribution. Experiments show how this new hybrid structure obtains the best performance in traffic distribution.

关键词： P2P Systems Multidimensional Indexing Distributed Systems hierarchical data structure Network Load Balancing

来源：评论

学校读者我要写书评

暂无评论

NumLock: Towards Optimal Multi-Granularity Locking in Hierarchies 18

NumLock: Towards Optimal Multi-Granularity Locking in Hierar...

引用

47th International Conference on Parallel Processing (ICPP)

作者： Kalikar, Saurabh Nasre, Rupesh IIT Madras Chennai Tamil Nadu India

ISBN: (纸本)9781450365109

We study multi-granularity locking in hierarchies. Existing popular mechanisms for multi-granularity locking work on two extremes: fine-grained locking which maximizes concurrency, and coarse-grained locking which minimizes the locking cost. Between the two extremes, there exist several pareto-optimal options which provide a trade-off between the concurrency cost and the locking cost. These options are captured under multi-granularity locking (MGL) protocol, but there exists no methodical way to choose a good MGL option. In this work, we present a locking technique, NumLock, which chooses optimal locking combination to serve MGL requests. N urn Lock works in two phases: first, it generates few pareto-optimal MGL options and second, it quickly analyzes these options to report the optimal one. We propose a greedy algorithm to generate a subset of the pareto-optimal options. We further improve the concurrency by abstracting the non-planar hierarchy as logical planar sub-hierarchies using multiple intervals. Our study reveals that the lock manager must explore various MGL options for achieving the best parallel performance, and that the extreme options often used in practice are suboptimal. We validate our claim quantitatively using an XML database as well as STMBench7, and show that the intermediate MGL options perform better compared to the existing state-of-the-art methods. In particular, NumLock achieves 65% reduction in execution time for the XML database, and 25% throughput improvement on STMBench7.

关键词： hierarchical data structure trees graphs object graphs locking synchronization dominators

来源：评论

学校读者我要写书评

暂无评论

A Parallel Direct Solver for a hierarchical H-Adaptive Finite Element Code

A Parallel Direct Solver for a Hierarchical H-Adaptive Finit...

引用

7th International Conference on Engineering Computational Technology

作者： Rodenas, J. J. Corral, C. Mas, J. Olmeda, F. Albelda, J. Univ Politecn Valencia Res Ctr Vehicle Technol E-46022 Valencia Spain Univ Politecn Valencia Inst Multidisciplinary Math E-46022 Valencia Spain

ISBN: (纸本)9781905088416

The hierarchical relations between geometrically similar finite elements (FE) shown in [1] were used in a basic implementation of a hierarchical 2-D linear elasticity h-adaptive FE code, based on element subdivision. Its hierarchical data structure simplified the element refinement process, reduced the computational cost required to create the system of equations and that associated to the evaluation of volume integrals, etc. The data structure was used in [2] and [3] to create a nested domain decomposition that generates stiffness matrices with a nested arrowhead structure. This allowed for the development of domain decomposition direct solvers that improve both, memory requirements and execution times. The performance of the parallel Matlab (R) implementation of the solver shown in [2] will be presented. This shows that the program's data structure is an effective tool for the parallelization of the FE analyses. The importance of the stiffness matrix reordering produced by the hierarchical data structure will also be analyzed.

关键词： parallel direct solver domain decomposition nested domain decomposition h-adaptive refinement hierarchical data structure finite element analysis

来源：评论

学校读者我要写书评

暂无评论

Unstructured Adaptive Grid Refinement for Flow Feature Capture

Unstructured Adaptive Grid Refinement for Flow Feature Captu...

引用

Asia-Pacific International Symposium on Aerospace Technology (APISAT)

作者： Liu Zhou Yang Yunjun Gong Anlong Zhou Weijiang China Acad Aerosp Aerodynam Beijing 100074 Peoples R China

An unstructured grid adaptation technology has been developed for capturing flow features effectively. The face-based hierarchical data structure is used at grid refinement procedure. The difference of suitable flow properties between cell and its neighbors for flow features detection. The results of different simulation cases show the strengths of unstructured grid adaptation technology. The flow features such as shock wave and vortex are resolved better with grids refinement. The grid adaptation also improves the computational accuracy of aerodynamic characteristics and loads. (C) 2015 The Authors. Published by Elsevier Ltd.

关键词： Grid adaptation hierarchical data structure Flow features detection Computational accuracy aerodynamic characteristics

来源：评论

学校读者我要写书评

暂无评论

A Note on Some Applications of Interval Arithmetic in hierarchical Solid Modeling

A Note on Some Applications of Interval Arithmetic in Hierar...

引用

Numerical Validation in Current Hardware Architectures 2008

作者： Dyllong, Eva University of Duisburg-Essen Department of Computer Science and Applied Cognitive Science Lotharstrasse 65 DuisburgD-47057 Germany

Techniques of reliable computing, like interval arithmetic, can be used to guarantee reliable solutions even in the presence of numerical round-off errors. The need to trace bounds for the error function separately can be eliminated using these techniques. In this extended abstract, we focus on presenting how the techniques and algorithms of reliable computing can be applied to the construction and further processing of hierarchical solid representations using the octree model as an example. © Numerical Validation in Current Hardware Architectures *** right reserved.

关键词： Reliable solid modeling hierarchical data structure

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：