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

Stochastic analysis of partitioning algorithms for matching problems

JOURNAL OF APPLIED PROBABILITY 2000年第2期37卷 494-503页

作者： Rüschendorf, L Sachs, G Univ Freiburg Inst Math Stochast D-79104 Freiburg Germany

partitioning algorithms for the Euclidean matching and for the semi-matching problem in the plane are introduced and analysed. The algorithms are analogues of Karp's well-known dissection algorithm for the travelling salesman problem. The algorithms are proved to run in time n log n and to approximate the optimal matching in the probabilistic sense. The analysis is based on the techniques developed in Karp (1977) and on the limit theorem of Redmond and Yukich (1993) for quasiadditive functionals.

关键词： matching problem partitioning algorithm quasiadditive functional

来源：评论

学校读者我要写书评

暂无评论

A Flexible Tool for Evaluating Scheduling, Synchronization and partitioning algorithms on Multiprocessors

A Flexible Tool for Evaluating Scheduling, Synchronization a...

引用

15th IEEE International Conference on Emerging Technologies and Factory Automation (ETFA)

作者： Nemati, Farhang Nolte, Thomas Malardalen Real Time Res Ctr Vasteras Sweden

ISBN: (纸本)9781424468508

Multi-core platforms seem to be the way towards increasing performance of processors. As the multi-cores are becoming the defacto processors, the need for new scheduling and resource sharing protocols has arisen. However, taking such technology to an industrial setting, it needs to be evaluated such that appropriate scheduling, synchronization and partitioning algorithms are selected. In this paper we present our ongoing work on a tool for investigation and evaluation of different approaches to scheduling, synchronization and task allocation on multi-core platforms. Our tool allows for comparison of different approaches with respect to a number of parameters such as number of schedulable systems and number of processors required for scheduling. The output of the tool includes a set of information and graphs to facilitate evaluation and comparison of different approaches.

关键词： flexible tool multicore platform multiprocessor partitioning algorithm processor scheduling protocols resource sharing protocol schedulable system scheduling synchronisation synchronization task allocation

来源：评论

学校读者我要写书评

暂无评论

Multi-Level Refinement algorithm of Weighted Hypergraph partitioning Problem

引用

JOURNAL OF INTELLIGENT SYSTEMS 2017年第3期26卷 407-420页

作者： Leng, Ming Sun, Ling-yu Guo, Kai-qiang Jinggangshan Univ Key Lab Watershed Ecol & Geog Environm Monitoring NASG Jian Jiangxi Peoples R China

The formal description of weighted hypergraph partitioning problem is presented. We describe the solution of the weighted hypergraph partitioning problem based on the multi-level method. We propose the multi-level discrete particle swarm optimization refinement algorithm, whose each particle's position in vertical bar V vertical bar-dimensional can be considered as the corresponded partitioning. During the refinement process of the uncoarsening phase, the algorithm projects successively each particle's corresponded partitioning back to the next-level finer hypergraph, and the degree of particle's freedom increases with the increase in solution space's dimension. The algorithm also regards the gain of vertex as particle information for the heuristic search and successfully searches the solution space based on the intelligent behavior between individuals' collaboration. Furthermore, the improved compressed storage format of weighted hypergraph is presented and the two-dimensional auxiliary array is designed for counting the vertices of each hypergraph in different partitions. The rapid method of calculating the vertex's gain and the cut's size are proposed to avoid traversing each vertex of hyperedge and reduce the algorithm's time complexity and space complexity. Experimental results show that the algorithm not only can find the better partitioning of weighted hypergraph than the move-based method but also can improve the search capability of the refinement algorithm.

关键词： Weighted hypergraph partitioning algorithm multilevel method refinement algorithm

来源：评论

学校读者我要写书评

暂无评论

Two Measurement Set partitioning algorithms for the Extended Target Probability Hypothesis Density Filter

引用

SENSORS 2019年第12期19卷 2665.-2665.页

作者： Han, Yulan Han, Chongzhao Ningxia Univ Sch Phys & Elect Elect Engn Yinchuan 750021 Peoples R China Xi An Jiao Tong Univ Sch Elect & Informat Engn Xian 710049 Peoples R China

The extended target probability hypothesis density (ET-PHD) filter cannot work well if the density of measurements varies from target to target, which is based on the measurement set partitioning algorithms employing the Mahalanobis distance between measurements. To tackle the problem, two measurement set partitioning approaches, the shared nearest neighbors similarity partitioning (SNNSP) and SNN density partitioning (SNNDP), are proposed in this paper. In SNNSP, the shared nearest neighbors (SNN) similarity, which incorporates the neighboring measurement information, is introduced to DP instead of the Mahalanobis distance between measurements. Furthermore, the SNNDP is developed by combining the DBSCAN algorithm with the SNN similarity together to enhance the reliability of partitions. Simulation results show that the ET-PHD filters based on the two proposed partitioning algorithms can achieve better tracking performance with less computation than the compared algorithms.

关键词： multiple extended target filter partitioning algorithm extended target tracking

来源：评论

学校读者我要写书评

暂无评论

Balanced multiple description video coding using optimal partitioning of the DCT coefficients

引用

IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS FOR VIDEO TECHNOLOGY 2005年第7期15卷 928-934页

作者： Matty, KR Kondi, LP SUNY Buffalo Univ Buffalo Dept Elect Engn Buffalo NY 14260 USA

In this paper, we propose a balanced multiple description video coding scheme which is based on the partitioning of the discrete cosine transform (DCT) coefficients. Our scheme splits the single-layered stream generated by a standard coder into two correlated and balanced (virtually identical rates and distortions) substreams. The optimization is in the redundancy-rate-distortion sense using Lagrangian relaxation for optimum allocation of redundancy among the blocks in the frame. A greedy algorithm to meet the equal distortions criterion and an algorithm to optimally achieve equal bit rates for the two descriptions are proposed. Our simulation results substantiate our claim of achieving balanced descriptions at high peak signal-to-noise ratios values for any specified redundancy and any target bit rate. Our design complies with the existing motion-compensated DCT-based standards, i.e., each description can be independently decoded by any standard decoder.

关键词： greedy algorithm H.263 multiple description coding partitioning algorithm rate distortion-theory video coding

来源：评论

学校读者我要写书评

暂无评论

A NEW PER-SAMPLE partitioning FILTER

引用

SIGNAL PROCESSING 1987年第1期12卷 27-47页

作者： LAINIOTIS, DG ANAGNOSTOU, KE Department of Computer Engineering and Informatics School of Engineering University of Patras 26500 Patras Greece

The partitioning approach essentially constitutes an adaptive framework which is a unifying and powerful setting for optimal linear and nonlinear estimation. In particular, for the class of linear estimation problems, model partitioning has yielded [Lainiotis (1971–1979) and Lainiotis and Andrisani (1979, 1983)] two novel and practically useful estimation algorithms. The first algorithm results by partitioning the initial state vector into the sum of two independent random vectors, arbitrarily chosen by the filter designer. Similarly, the second algorithm results by partitioning both the initial state, and the process-noise vectors, respectively, into the sum of two random vectors. These algorithms were shown to posses several computational advantages, and interesting properties. In this paper, based on the above results, a new linear estimation algorithm is obtained. This constitutes a per-sample partitioning version of the above Lainiotis-Andrisani algorithm. Moreover, a computational analysis of the new algorithm is made with respect to computer time and storage requirements. This is compared to the computational requirements of the Kalman filter, and relevant conclusions are drawn. Finally, to demonstrate the practical usefulness of the new algorithm to signal processing, they are applied to the important class of multi-sensor estimation problems, encountered in geophysical data processing, multi-radar problems, etc. Zusammenfassung Das Verfahren der Zerlegung in Teilbereiche steckt einen Rahmen ab, in dem lineare und nichtlineare Schätzungsprobleme in einheitlicher Weise optimal gelöst werden können. Insbesondere für die Klasse der linearen Schätz-probleme hat die Zerlegung des Modells zwei neuartige und in der Praxis nützliche Schätzalgorithmen hervorgebracht [Lainiotis (1971–1979) und Lainiotis und Andrisani (1979, 1983)]. Im ersten algorithmus wird der Eingangs-Zustandsvektor zerlegt in die Summe zweier voneinander unabhängiger Zufalls vektoren, die beim Ent

关键词： Filtering estimation Kalman filter Lainiotis filter partitioning algorithm

来源：评论

学校读者我要写书评

暂无评论

Correlation-aware partitioning for skewed range query optimization

引用

WORLD WIDE WEB-INTERNET AND WEB INFORMATION SYSTEMS 2019年第1期22卷 125-151页

作者： Ge, Wei Li, Xianxian Yuan, Chunfeng Huang, Yihua Nanjing Univ Collaborat Innovat Ctr Novel Software Technol & I Natl Key Lab Novel Software Technol Nanjing Jiangsu Peoples R China Guangxi Normal Univ Guangxi Key Lab Multisource Informat Min & Secur Guilin Peoples R China

Data partitioning is an effective way to reduce cost and improve query performance in large-scale Web data analytical applications. State-of-the-art partitioning approaches on range queries is lacking of considering the correlation of data in a certain access patterns, especially in some skewed patterns. This paper presents a correlation-aware partitioning model for skewed range queries. It formulates partitioning optimization issue on continuous correlated data as a geometrical step curve fitting problem. Then, we prove that the optimal partitioning should split data on range query boundaries. On this basis, Range Boundary Based DP partitioning is designed to induce the optimal partition and significantly reduce the computation cost compared to the baseline dynamic programming algorithm. Local is better than global. For efficiency, Bottom-up Merging partitioning is proposed further to improve partitioning by bottom-up merging instead of searching. To evaluate the proposed approaches, sets of experiments are conducted under skewed range query workloads on skewed and uniform datasets, and show they do optimize the efficiency of data partitioning by hundreds of times.

关键词： Range query Data skew partitioning algorithm Correlation aware

来源：评论

学校读者我要写书评

暂无评论

Dynamical partitioning of directional ocean wave spectra

引用

PROBABILISTIC ENGINEERING MECHANICS 2013年 33卷 95-102页

作者： Ailliot, Pierre Maisondieu, Christophe Monbet, Valerie Univ Brest Brest France Univ Rennes Rennes France

Directional wave spectra generally exhibit several peaks due to the coexistence of wind sea generated by local wind conditions and swells originating from distant weather systems. This paper proposes a new algorithm for partitioning such spectra and retrieving the various systems which compose a complex sea-state. It is based on a sequential Monte-Carlo algorithm which allows to follow the time evolution of the various systems. The proposed methodology is validated on both synthetic and real spectra and the results are compared with a method commonly used in the literature. (c) 2013 Elsevier Ltd. All rights reserved.

关键词： partitioning algorithm Directional wave spectrum Sequential Monte Carlo algorithm

来源：评论

学校读者我要写书评

暂无评论

partitioning colored point sets into monochromatic parts

引用

INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS 2002年第5期12卷 401-412页

作者： Dumitrescu, A Pach, J Univ Wisconsin Milwaukee WI 53211 USA NYU Courant Inst Math Sci New York NY 10012 USA

We show that any two-colored set of n points in general position in the plane can be partitioned into at most [n+1/2] monochromatic subsets, whose convex hulls are pairwise disjoint. This bound cannot be improved in general. We present an O(n log n) time algorithm for constructing a partition into fewer parts, if the coloring is unbalanced, i.e., the sizes of the two color classes differ by more than one. The analogous question for k-colored point sets (k > 2) and its higher dimensional variant are also considered.

关键词： colored point sets partitioning algorithm matching algorithm Davenport-Schinzel sequence

来源：评论

学校读者我要写书评

暂无评论

Parallel Exploration of State Space with Reduced Cross Transitions partitioning

Parallel Exploration of State Space with Reduced Cross Trans...

引用

International Conference on Computer Sciences and Applications (CSA)

作者： Serrano, Eleazar Jimenez Kyushu Univ Grad Sch Integrated Frontier Sci Dept Automot Sci Nishi Ku Fukuoka 8190395 Japan

ISBN: (纸本)9780769551258

We propose a method for conducting parallel state space exploration using grid computing. It is based on a partitioning method for a configuration of multiple hash tables with proven efficiency in reducing the number of address collisions and the amount of required memory. This paper presents the initial results of simulating the method, showing that for specific state spaces, it might be advantageous in reducing cross transitions and consequently reducing exploration time.

关键词： partitioning algorithm Parallel programming Hash tables Distributed-memory State space Grid computing

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：