نتایج جستجو برای: grid partitioning

تعداد نتایج: 119272  

Journal: :مهندسی بیوسیستم ایران 0
امین نصیری دانشجوی دکتری، دانشکدۀ مهندسی و فناوری کشاورزی، دانشگاه تهران حسین مبلی استاد، دانشکدۀ مهندسی و فناوری کشاورزی، دانشگاه تهران شاهین رفیعی استاد، دانشکدۀ مهندسی و فناوری کشاورزی، دانشگاه تهران کرامت اله رضائی تیره شبانکاره استاد، دانشکدۀ مهندسی و فناوری کشاورزی، دانشگاه تهران

rating medicinal plants based on the total number of drug shows that the mint plant species, withgeneral name mentha, among the most consumption herbs that are used in various industries such aspharmaceutical, food, cosmetics and health. drying process, in order to maintain the quality andquantity of essential oil extraction have a great role in the processing medicinal plants. importantaspects...

2014
Kasper Mullesgaard Jens Laurits Pederseny Hua Lu Yongluan Zhou

Skyline queries are useful for finding interesting tuples from a large data set according to multiple criteria. The sizes of data sets are constantly increasing and the architecture of back-ends are switching from single-node environments to non-conventional paradigms like MapReduce. Despite the usefulness of skyline queries, existing works on skyline computation in MapReduce do not take full a...

2003
Xiaolin Li Manish Parashar

This paper presents the design and experimental evaluation of two dynamic load partitioning and balancing strategies for parallel Structured Adaptive Mesh Refinement (SAMR) applications: the Level-based Partitioning Algorithm (LPA) and the Hierarchical Partitioning Algorithm (HPA). These techniques specifically address the computational and communication heterogeneity across refinement levels o...

2015
Vasco Costa João M. Pereira Joaquim A. Jorge

Grid space partitioning is a technique to speed up queries to graphics databases. We present a parallel grid construction algorithm which can efficiently construct a structured grid on GPU hardware. Our approach is substantially faster than existing uniform grid construction algorithms, especially on nonhomogeneous scenes. Indeed, it can populate a grid in real-time (at rates over 25 Hz), for a...

1998
William F. Mitchell

Dynamic load balancing is considered in the context of adaptive multilevel methods for partial diierential equations on networks of workstations or PCs. An approach that periodically repartitions the grid is taken. A partitioning algorithm based on the reenement tree of the adaptive grid is presented and analyzed in terms of the most important properties of grid partitioners.

2014
Anuradha Aggarwal

Grid computing is the collection of computer resources from multiple locations to reach a common goal. The grid is a special type of distributed system with non-interactive workloads that involve a large number of files. Partitioning of the application program/ software into a number of small groups of modules among dissimilar processors is an important parameter to determine the efficient util...

2009
Chung-I Chang Nancy P. Lin Nien-Yi Jan

These spatial clustering methods can be classified into four categories: partitioning method, hierarchical method, density-based method and grid-based method. The grid-based clustering algorithm, which partitions the data space into a finite number of cells to form a grid structure and then performs all clustering operations to group similar spatial objects into classes on this obtained grid st...

2004
Tae-Wan Kim Hak-Cheol Kim Ki-Joune Li

Given d-dimensional N data items and a maximum branching factor Bfmax, packing is partitioning Bfmax amount of data and storing it in a disk page. The range query performance of packing is highly dependent on the methods by which data is partitioned. Thus, partitioning data is the main problem tackled in our work. We suggest two extreme cases of partitioning methods: grid-like balanced and onio...

Journal: :Proceedings of the ... AAAI Conference on Artificial Intelligence 2023

DBSCAN is widely used in various fields, but it requires computational costs similar to those of re-clustering from scratch update clusters when new data inserted. To solve this, we propose an incremental density-based clustering method that rapidly updates by identifying advance regions where cluster will occur. Also, through extensive experiments, show our provides results DBSCAN.

2010
Phil Ridley

Unstrucutured grids are used frequently in finite element or finite volume analysis. Unlike structured grids which are mostly applicable to finite difference schemes, unstructured grids require a list of the connectivity which specifies the way that a given set of vertices form the individual elements. To implement models that use an unstructured numerical decomposition on a distributed memory ...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید