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

A multi-tiered data structure and process management system based on ROOT and CouchDB

NUCLEAR INSTRUMENTS & METHODS IN PHYSICS RESEARCH SECTION A-ACCELERATORS SPECTROMETERS DETECTORS AND ASSOCIATED EQUIPMENT 2012年 684卷 63-72页

作者： Cox, G. A. Armengaud, E. Augier, C. Benoit, A. Berge, L. Bergmann, T. Bluemer, J. Bres, G. Broniatowski, A. Brudanin, V. Censier, B. Chapellier, M. Chardin, G. Charlieux, F. Collin, S. Coulter, P. Crauste, O. De Jesus, M. Domange, J. Dumoulin, L. Eitel, K. Filosofov, D. Fourches, N. Gascon, J. Gerbier, G. Gironne, J. Gros, M. Henry, S. Herve, S. Jokisch, S. Juillard, A. Kleifges, M. Kluck, H. Kozlovg, V. Kraus, H. Kudryavtsev, V. A. Loaiza, P. Marnieros, S. Menshikov, A. Navick, X. -F. Nones, C. Olivieri, E. Pari, P. Pattavina, L. Paul, B. Robinson, M. Rodenas, H. Rozov, S. Sanglard, V. Schmidt, B. Semikh, S. Tcherniakhovski, D. Torrento-Coello, A. S. Unrau, M. Vagneron, L. Verdier, M. -A. Walker, R. J. Weber, M. Yakushev, E. Zhang, X. Karlsruhe Inst Technol Inst Expt Kernphys D-76128 Karlsruhe Germany CEA Ctr Etud Saclay IRFU F-91191 Gif Sur Yvette France Univ Lyon 1 IPNL CNRS IN2P3 F-69622 Villeurbanne France CNRS Neel F-38042 Grenoble 9 France Univ Paris 11 CSNSM CNRS IN2P3 F-91405 Orsay France Karlsruhe Inst Technol Inst Prozessdatenverarbeitung & Elekt D-76021 Karlsruhe Germany Karlsruhe Inst Technol Inst Kernphys D-76021 Karlsruhe Germany JINR Lab Nucl Problems Dubna 141980 Moscow Region Russia Univ Sheffield Dept Phys & Astron Sheffield S3 7RH S Yorkshire England Univ Oxford Dept Phys Oxford OX1 3RH England CEA CNRS Lab Souterrain Modane F-73500 Modane France CEA Ctr Etud Saclay F-91191 Gif Sur Yvette France

A multi-tiered data structure, analysis toolkit and data processing management system has been constructed using ROOT and CouchDB. This system is well suited for experiments that acquire many computer files of raw data over the course of months or years, that are distributed to different computing centers and further reduced in size by several steps of data processing. data handling for experiments searching for rare events extracted from digitized pulse traces typically fit this description. An implementation of this system has been constructed for the EDELWEISS-III experiment and is described here in some detail. This solution may also serve as a prototype system for the proposed EURECA experiment. (C) 2012 Elsevier B.V. All rights reserved.

关键词： data structure data management ROOT CouchDB Dark Matter Multi-tier

来源：评论

学校读者我要写书评

暂无评论

A development of data structure and mesh generation algorithm for whole ship analysis modeling system

引用

ADVANCES IN ENGINEERING SOFTWARE 2006年第2期37卷 85-96页

作者： Kim, II Daewoo Shipbldg & Marine Engn Co Ltd Informat Technol R&D Team Geoje Si 656714 Gyeongsangnam D South Korea

In the whole ship structure and vibration analysis, the FEA (finite element analysis) model of whole ship structure is required in the early design stage before the 3D CAD model is defined. Because ship structure has a complex curved surface, and many associated structural members, the whole ship analysis modeling job has become a time consuming job. For the effective support of the whole ship analysis modeling, a method to generate the analysis model using initial design information within the ship design process, hull form offset data and compartment data, is developed. To easily handle initial design information and FE model information, a flexible data structure is proposed. An automatic quadrilateral mesh generation algorithm using initial design information to satisfy the constraints imposed by the ship structure is also proposed. With the proposed data structure and mesh generation algorithm, whole ship analysis modeling job for various ship types can be effectively supported and these results are presented. (C) 2005 Elsevier Ltd. All rights reserved.

关键词： ship structure finite element whole ship analysis mesh generation data structure quadrilateral initial ship design information

来源：评论

学校读者我要写书评

暂无评论

EXACT-DECOUPLED RECTANGULAR-COORDINATES STATE ESTIMATION WITH EFFICIENT data structure MANAGEMENT

引用

IEEE TRANSACTIONS ON POWER SYSTEMS 1992年第1期7卷 45-53页

作者： HABIBALLAH, IO QUINTANA, VH GEORGIA INST TECHNOL ATLANTAGA 30332

This paper deals with the solution of the power system state estimation problems using node voltages in rectangular coordinates. The Jacobian matrix is diagonalized and the mismatching vector modified following the ideas proposed by other investigators for decoupling the Jacobian matrix when using polar coordinates. The proposed method decouples the Jacobian matrix into real- and reactive-power submatrices, which are evaluated only once at the beginning of the process. The paper also presents an efficient data structure management technique to improve the computational process. The performance of these techniques are evaluated using several power system networks. The proposed rectangular-coordinate technique is compared with the Newton-Raphson method and a polar-coordinate method. The proposed data-storing method is compared with a standard technique.

关键词： STATE ESTIMATION DECOUPLING RECTANGULAR COORDINATES data structure

来源：评论

学校读者我要写书评

暂无评论

Shell: A Spatial Decomposition data structure for Ray Traversal on GPU

引用

IEEE TRANSACTIONS ON COMPUTERS 2016年第1期65卷 230-243页

作者： Xiao, Kai Hu, Xiaobo Sharon Zhou, Bo Chen, Danny Ziyi Univ Notre Dame Dept Comp Sci & Engn Notre Dame IN 46556 USA Altera Corp San Jose CA 95134 USA

Shared memory many-core processors such as GPUs have been extensively used in accelerating computation-intensive algorithms and applications. When porting existing algorithms from sequential or other parallel architecture models to shared memory many-core architectures, non-trivial modifications are often needed to match the execution patterns of the target algorithms with the characteristics of many-core architectures. Ray traversal is a fundamental process in many applications, and is commonly accelerated by spatial decomposition schemes captured in hierarchical data structures (e.g., kd-trees). However, ray traversal using hierarchical data structures needs to conduct repeated hierarchical searches. Such search process is time-consuming on shared memory many-core architectures since it incurs considerable amounts of expensive memory accesses and execution divergence. In this paper, we propose a novel spatial decomposition based data structure, called Shell, which completely avoids hierarchical search for ray traversal. In Shell, a structure is built on the boundary of each region in the decomposed space, which allows any ray traversing in a region to find the next neighboring region to traverse using table lookup schemes, without any hierarchical search. While our ray traversal approach works for other spatial decomposition paradigms and many-core processors in higher dimensional scenes, we illustrate it using kd-tree on GPU for 3D scenario and compare with the fastest known kd-tree searching algorithms for ray traversal. Experimental results in graphics ray tracing and radiation dose calculation show that our approach improves the performance by 3.5-5.5x over the fastest known kd-tree based approaches.

关键词： GPU ray traversal data structure spatial decomposition kd-tree

来源：评论

学校读者我要写书评

暂无评论

CROSSING THE LOGARITHMIC BARRIER FOR DYNAMIC BOOLEAN data structure LOWER BOUNDS

引用

SIAM JOURNAL ON COMPUTING 2020年第5期49卷 STOC18-323-STOC18-367页

作者： Larsen, Kasper Green Weinstein, Omri Yu, Huacheng Aarhus Univ Dept Comp Sci DK-8000 Aarhus C Denmark Columbia Univ Dept Comp Sci New York NY 10027 USA Harvard Univ Harvard John A Paulson Sch Engn & Appl Sci Cambridge MA 02140 USA

This paper proves the first superlogarithmic lower bounds on the cell probe complexity of dynamic Boolean (also known as decision) data structure problems, a long-standing milestone in data structure lower bounds. We introduce a new method for proving dynamic cell probe lower bounds and use it to prove an (Omega) over tilde (lg(1.5 )n) lower bound on the operational time of a wide range of Boolean data structure problems, most notably, on the query time of dynamic range counting over F-2 [M. Patrascu, Lower bounds for 2-dimensional range counting, in STOC 2007, ACM, New York, 2007, pp. 40-46]. Proving an omega(lg n) lower bound for this problem was explicitly posed as one of five important open problems in the late Mihai Patrascu's obituary [M. Thorup, Bull. Eur. Assoc. Theor. Comput. Sci., 109 (2013), pp. 7-13]. This result also implies the first omega(lg n) lower bound for the classical 2-dimensional (2D) range counting problem, one of the most fundamental data structure problems in computational geometry and spatial databases. We derive similar lower bounds for Boolean versions of dynamic polynomial evaluation and 2D rectangle stabbing, and for the (non-Boolean) problems of range selection and range median. Our technical centerpiece is a new way of "weakly" simulating dynamic data structures using efficient one-way communication protocols with small advantage over random guessing. This simulation involves a surprising excursion to low-degree (Chebyshev) polynomials which may be of independent interest, and offers an entirely new algorithmic angle on the "cell sampling" method of Panigrahy, Talwar, and Wieder [Lower bounds on near neighbor search via metric expansion, FOCS 2010, IEEE Computer Society, Los Alamitos, CA, 2010, pp. 805-814].

关键词： data structure cell probe complexity lower bounds range searching dynamic problems

来源：评论

学校读者我要写书评

暂无评论

A data structure for efficiently managing a set of energy functions

引用

JOURNAL OF COMBINATORIAL OPTIMIZATION 2022年第4期44卷 2460-2481页

作者： Carlier, Jacques Jouglet, Antoine Pinson, Eric Sahli, Abderrahim Univ Technol Compiegne Sorbonne Univ CNRS UMR 7253 Heudiasyc Compiegne France Univ Catholique Ouest LARIS Angers France Univ Gustave Eiffel CNRS IFSTTAR COSYS Esiee ParisGRETTIA F-77454 Marne La Vallee France

We consider a collection of objects. Each object has an initial energy at the start of the time horizon, and a transition time at which the energy begins to decrease over time. In this paper we describe the Cooling Box, a new data structure for identifying the object with the highest energy at any time t, with values of t increasing over time. The case of decreasing linear functions is considered. Two versions are proposed, for a set of functions with identical and non-identical slopes respectively. Interestingly, we also identify the basic property of decreasing functions that makes this method possible. The data structure is then generalized to decreasing functions that are not linear. For each of these versions we describe an application.

关键词： data structure Monotone functions Complexity

来源：评论

学校读者我要写书评

暂无评论

Neighborhood grid: A novel data structure for fluids animation with GPU computing

引用

JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING 2015年 75卷 20-28页

作者： Joselli, Mark Junior, Jose Ricardo da S. Clua, Esteban W. Montenegro, Anselmo Lage, Marcos Pagliosa, Paulo PUC PR Curitiba Parana Brazil UFF Media Lab Rio De Janeiro Brazil Univ Fed Mato Grosso do Sul FACOM Campo Grande Brazil

This paper introduces a novel and efficient data structure, called neighborhood grid, capable of supporting large number of particle based elements on GPUs (graphics processing units), and is used for optimizing fluid animation with the use or GPU computing. The presented fluid simulation approach is based on SPH (smoothed particle hydrodynamics) and uses a unique algorithm for the neighborhood gathering. The brute force approach to neighborhood gathering of n particles has complexity O(n(2)), since it involves proximity queries of all pairs of fluid particles in order to compute the relevant mutual interactions. Usually, the algorithm is optimized by using spatial data structures which subdivide the environment in cells and then classify the particles among the cells based on their position, which is not efficient when a large number of particles are grouped in the same cell. Instead of using such approach, this work presents a novel and efficient data structure that maintains the particles into another form of proximity data structure, called neighborhood grid. In this structure, each cell contains only one particle and does not directly represent a discrete spatial subdivision. The neighborhood grid does process an approximate spatial neighborhood of the particles, yielding promising results for real time fluid animation, with results that goes up to 9 times speedup, when compared to traditional GPU approaches, and up to 100 times when compared against CPU implementations. (C) 2014 Elsevier Inc. All rights reserved.

关键词： Fluid animation Real-time simulation GPU computing GPGPU data structure Fluid simulation

来源：评论

学校读者我要写书评

暂无评论

FAIR's principles-based, observed and monitored data structure for social media-based digital journalism

JOURNAL OF THE FACULTY OF ENGINEERING AND ARCHITECTURE OF GA...

引用

JOURNAL OF THE FACULTY OF ENGINEERING AND ARCHITECTURE OF GAZI UNIVERSITY 2024年第2期39卷 1153-1166页

作者： Takan, Savas Ergun, Duygu Ankara Univ Fac Engn Dept Artificial Intelligence & Data Engn TR-06100 Ankara Turkiye Atilim Univ Fac Fine Arts Design & Architecture Dept Fine Arts & Elect Courses TR-06830 Ankara Turkiye

The data to be processed by the Tag mechanism is negligible in comparison to the conventional blockchain. Clearly, address sizes are always significantly smaller than the data size of a block. Large amounts of data in the blockchain have a time and space complexity O(n). In contrast, the tag mechanism we developed has a time and space complexity of O (1). The illustration below depicts this circumstance. Figure A compares the search performance of blocks in the blockchain and the recommended tag structure. Due to the link list structure of the blockchain, the search complexity increases linearly with the number of blocks. The search complexity is significantly reduced, however, because the tag structure we propose can accommodate any indexing mechanism, such as B+Tree. This situation is shown in Figure A. Purpose: The most fundamental problem of news sharing in the digital environment is information pollution and news circulating in false or manipulated forms or while in circulation. Our research aims to eliminate such issues in digital journalism through mechanisms of observability and traceability. Theory and Methods: To support an observable and traceable social media environment, a data model must be compatible with graph structures containing large amounts of data. Existing blockchain technologies do not support the graph data structure required by social media networks, despite providing the ability to observe and monitor. In the proposed structure, the model and data are separated, and indexing mechanisms are supported in order to address these issues. Results: The proposed data model was compared to the data model of the blockchain technology, and it was determined that the model we developed for digital journalism was more suitable in terms of time and space complexity, as well as sustainability and maintenance costs than the data model of the blockchain technology. Conclusion: In our research, a new data model was created to address the issues of digital j

关键词： Digital journalism Blockchain data structure FAIR principles Observable and monitorable social media Artificial intelligence

来源：评论

学校读者我要写书评

暂无评论

G-TREE - A NEW data structure FOR ORGANIZING MULTIDIMENSIONAL data

引用

IEEE TRANSACTIONS ON KNOWLEDGE AND data ENGINEERING 1994年第2期6卷 341-347页

作者： KUMAR, A Graduate School of Management Comell University Medical College Ithaca NY USA

This paper describes an efficient data structure called the (G-tree (or grid tree) for organizing multidimensional data. The data structure combines the features of grids and B-trees in a novel manner. It also exploits an ordering property that numbers the partitions in such a way that partitions that are spatially close to one another in a multidimensional space are also close in terms of their partition numbers. This structure adapts well to dynamic data spaces with a high frequency of insertions and deletions, and to nonuniform distributions of data. We demonstrate that it is possible to perform insertion, retrieval, and deletion operations, and to run various range queries efficiently using this structure. A comparision with the BD tree, zkdb tree and the KDB tree is carried out, and the advantages of the G-tree over the other structures are discussed. The simulated bucket utilization rates for the G-tree are also reported.

关键词： data structure MULTIDIMENSIONAL data B-TREE KDB TREE BD TREE GRID FILES G-TREE BUCKET UTILIZATION RANGE QUERIES

来源：评论

学校读者我要写书评

暂无评论

Configurable Open-source data structure for Distributed Conforming Unstructured Homogeneous Meshes with GPU Support

引用

ACM TRANSACTIONS ON MATHEMATICAL SOFTWARE 2022年第3期48卷 1-30页

作者： Klinkovsky, Jakub Oberhuber, Tomas Fucik, Radek Zabka, Vitezslav Czech Tech Univ Fac Nucl Sci & Phys Engn Dept Math Trojanova 13 Prague 12000 2 Czech Republic

A general multi-purpose data structure for an efficient representation of conforming unstructured homogeneous meshes for scientific computations on CPU and GPU-based systems is presented. The data structure is provided as open-source software as part of the TNL library (https://***/). The abstract representation supports almost any cell shape and common 2D quadrilateral, 3D hexahedron and arbitrarily dimensional simplex shapes are currently built into the library. The implementation is highly configurable via templates of the C++ language, which allows avoiding the storage of unnecessary dynamic data. The internal memory layout is based on state-of-the-art sparse matrix storage formats, which are optimized for different hardware architectures in order to provide high-performance computations. The proposed data structure is also suitable for meshes decomposed into several subdomains and distributed computing using the Message Passing Interface (MPI). The efficiency of the implemented data structure on CPU and GPU hardware architectures is demonstrated on several benchmark problems and a comparison with another library. Its applicability to advanced numerical methods is demonstrated with an example problem of two-phase flow in porous media using a numerical scheme based on the mixed-hybrid finite element method (MHFEM). We show GPU speedups that rise above 20 in 2D and 50 in 3D when compared to sequential CPU computations, and above 2 in 2D and 9 in 3D when compared to 12-threaded CPU computations.

关键词： Unstructured mesh data structure GPGPU MPI performance evaluation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：