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

A New Procedure for Optimal Design of District Metered Areas Based on the Multilevel Balancing and refinement algorithm

引用

WATER RESOURCES MANAGEMENT 2015年第12期29卷 4397-4409页

作者： Alvisi, S. Univ Ferrara Dept Engn I-44122 Ferrara Italy

A procedure for optimal design of District Metered Areas (DMAs) within a water distribution network based on a multilevel balancing and refinement algorithm to partition the network and determine the optimal meter positions, coupled with a pressure driven hydraulic simulator to quantify the hydraulic performance of the districtualized system, is presented. Unlike other procedures based on graph partitioning techniques proposed in the scientific literature, the two main issues involved in the design of the DMAs, namely a) how to partition the nodes into the required number of districts, and b) which pipes linking districts to leave open, and fitted with an assigned number of flow meters, and which to close, are simultaneously resolved. The application of this procedure to a real case shows that this approach provides design solutions well adapted to different numbers of measuring points, yielding superior performance indicator values to similar procedures reported in the literature and used here for comparative purposes.

关键词： District metered area Water distribution system Multilevel balancing refinement algorithm

来源：评论

学校读者我要写书评

暂无评论

Accuracy refinement algorithm for mobile target location tracking by radio signal strength indication approach

引用

IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES 2008年第7期E91A卷 1659-1665页

作者： Lau, Erin-Ee-Lin Chung, Wan-Young Dongseo Univ Grad Sch Design & IT Dept Ubiquitous IT Pusan 617716 South Korea Dongseo Univ Div Comp & Informat Engn Pusan 617716 South Korea

A novel RSSI (Received Signal Strength Indication) refinement algorithm is proposed to enhance the resolution for indoor and outdoor real-time location tracking system. The proposed refinement algorithm is implemented in two separate phases. During the first phase, called the pre-processing step, RSSI values at different static locations are collected and processed to build a calibrated model for each reference node. Different measurement campaigns pertinent to each parameter in the model are implemented to analyze the sensitivity of RSSI. The propagation models constructed for each reference nodes are needed by the second phase. During the next phase, called the runtime process, real-time tracking is performed. Smoothing algorithm is proposed to minimize the dynamic fluctuation of radio signal received from each reference node when the mobile target is moving. Filtered RSSI values are converted to distances using formula calibrated in the first phase. Finally, an iterative trilateration algorithm is used for position estimation. Experiments relevant to the optimization algorithm are carried out in both indoor and outdoor environments and the results validated the feasibility of proposed algorithm in reducing the dynamic fluctuation for more accurate position estimation.

关键词： Received Signal Strength Indication (RSSI) refinement algorithm location tracking smoothing algorithm position estimation

来源：评论

学校读者我要写书评

暂无评论

An iterative initial-points refinement algorithm for categorical data clustering

引用

PATTERN RECOGNITION LETTERS 2002年第7期23卷 875-884页

作者： Sun, Y Zhu, QM Chen, ZX Univ Nebraska Dept Comp Sci Digital Imaging & Comp Vis Lab Omaha NE 68182 USA

The original k-means clustering algorithm is designed to work primarily on numeric data sets. This prohibits the algorithm from being directly applied to categorical data clustering in many data mining applications. The k-modes algorithm [Z. Huang, Clustering large data sets with mixed numeric and categorical value, in: Proceedings of the First Pacific Asia Knowledge Discovery and Data Mining Conference. World Scientific, Singapore, 1997, pp. 21-34] extended the k-means paradigm to cluster categorical data by using a frequency-based method to update the cluster modes versus the k-means fashion of minimizing a numerically valued cost. However, as is the case with most data clustering algorithms, the algorithm requires a pre-setting or random selection of initial points (modes) of the clusters. The differences on the initial points often lead to considerable distinct cluster results. In this paper we present an experimental study on applying Bradley and Fayyad's iterative initial-point refinement algorithm to the k-modes clustering to improve the accurate and repetitiveness of the clustering results [cf. P. Bradley, U. Fayyad, Refining initial points for k-mean clustering, in: Proceedings of the 15th International Conference on Machine Learning, Morgan Kaufmann, Los Altos, CA, 1998]. Experiments show that the k-modes clustering algorithm using refined initial points leads to higher precision results much more reliably than the random selection method without refinement, thus making the refinement process applicable to many data mining applications with categorical data. (C) 2002 Elsevier Science B.V. All rights reserved.

关键词： data clustering pattern classification refinement algorithm data mining

来源：评论

学校读者我要写书评

暂无评论

The refinement algorithm Consideration in Text Clustering Scheme Based on Multilevel Graph

引用

Wuhan University Journal of Natural Sciences 2004年第5期9卷 671-675页

作者： CHENJian-bin DONGXiang-jun SONGHan-tao SchoolofInformationScienceandTechnology.BeijingInstituteofTechnology.Beijing100081 China DepartmentotComputerScienceandTechnology ShandongInstituteofLightIndustryJinan250100ShandongChina

To construct a high efficient text clustering algorithm the multilevel graph model and the refinement algorithm used in the uncoarsening phase is discussed. The model is applied to text clustering. The performance of clustering algorithm has to be improved with the refinement algorithm application. The experiment result demonstrated that the multilevel graph text clustering algorithm is available. Key words text clustering - multilevel coarsen graph model - refinement algorithm - high-dimensional clustering CLC number TP301 Foundation item: Supported by the National Natural Science Foundation of China (60173051) Biography: CHEN Jian-bin(1970-), male, Associate professor, Ph. D., research direction: data mining.

关键词： text clustering multilevel coarsen graph model refinement algorithm high-dimensional clustering

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Research on Statistical algorithm of Multi-region Medicine Bags Based on refinement algorithm

Research on Statistical Algorithm of Multi-region Medicine B...

引用

作者： Chukun Luo Shaozhong Cao Changbo Xu Ning Zhao Beijing Institute of Graphic Communication

Aiming at the problem of inaccurate number of bagged medicines in the packing boxes of the medicine production line, a method for counting medicine bags based on machine vision is *** method firstly performs grayscale, image scaling, cropping,threshold segmentation and other operations on the Medicine bags images, and retains the part of the image that can effectively detect the number of pill bags, and then performs image refinement processing on it to extract the pill bag skeleton in the image. Through the feature analysis of the refined images, a multi-region target statistical counting method is proposed, and finally the number of medicine bags in the medicine box image is detected. Experimental results show that this design has high accuracy and speed for detecting the number of medicine bags in the medicine box, so this design is feasible.

关键词： Machine vision refinement algorithm Statistical algorithm of multi-region medicine bags

来源：评论

学校读者我要写书评

暂无评论

The refinement algorithm Consideration in Text Clustering Scheme Based on Multilevel Graph

The Refinement Algorithm Consideration in Text Clustering Sc...

引用

The First Conference on Web Information System and Applications

作者： CHEN Jian-bin,DONG Xiang-jun, SONG Han-tao School of Information Science and Technology, Beijing Institute of Technology,Beijing 100081, China Modern Education Technology and Information Center, North China University of Science and Technology, Taiyuan 030051, Shanxi,China Department of Computer Science and Technology, Shandong Institute of Light Industry, Jinan 250100, Shandong, China

To construct a high efficient text clustering algorithm, the multilevel graph model and the refinement algorithm used in the uncoarscning phase is discussed. The model is applied to text clustering. The performance of clustering algorithm has to he improved with the refinement algorithm application. The experiment result demonstrated that the multilevel graph text clustering algorithm is available.

关键词： text clustering multilevel coarsen graph model refinement algorithm high-dimensional clustering

来源：评论

学校读者我要写书评

暂无评论

The refinement algorithm Consideration in Text Clustering Scheme Based on Multilevel Graph

The Refinement Algorithm Consideration in Text Clustering Sc...

引用

The First Conference on Web Information System and Applications(WISA 2004)

作者： CHEN Jian-bin~(1,2), DONG Xiang-jun~(1,3), SONG Han-tao~1 1. School of Information Science and Technology, Beijing Institute of Technology, Beijing 100081, China 2. Modern Education Technology and Information Center, North China University of Science and Technology, Taiyuan 030051, Shanxi, China 3. Department of Computer Science and Technology, Shandong Institute of Light Industry, Jinan 250100, Shandong, China

To construct a high efficient text clustering algorithm, the multilevel graph model and the refinement algorithm used in the uncoarsening phase is discussed. The model is applied to text clustering. The performance of clustering algorithm has to be improved with the refinement algorithm application. The experiment result demonstrated that the multilevel graph text clustering algorithm is available.

关键词： text clustering multilevel coarsen graph model refinement algorithm high-dimensional clustering

来源：评论

学校读者我要写书评

暂无评论

Lepp-bisection algorithms, applications and mathematical properties

引用

APPLIED NUMERICAL MATHEMATICS 2009年第9期59卷 2218-2235页

作者： Rivara, Maria-Cecilia Univ Chile Dept Comp Sci Santiago Chile

Longest edge (nested) algorithms for triangulation refinement in two dimensions are able to produce hierarchies of quality and nested irregular triangulations as needed both for adaptive finite element methods and for multigrid methods for PDEs. In addition, right-triangle bintree triangulations are multiresolution algorithms used for terrain modeling and real time visualization of terrain applications. These algorithms are based on the properties of the consecutive bisection of a triangle by the median of the longest edge, and can be formulated in terms of the longest edge propagation path (Lepp) and terminal edge concepts, which implies the use of very local refinement operations over fully conforming meshes (where the intersection of pairs of neighbor triangles is either a common edge or a common vertex). In this paper we review the Lepp-bisection algorithms, their properties and applications. To the end we use recent simpler and stronger results on the complexity aspects of the bisection method and its geometrical properties. We discuss and analyze the computational costs of the algorithms. The generalization of the algorithms to 3-dimensions is also discussed. Applications of these methods are presented: for serial and parallel view dependent level of detail terrain rendering, and for the parallel refinement of tetrahedral meshes. (C) 2008 IMACS. Published by Elsevier B.V. All rights reserved.

关键词： Bisection method Longest edge bisection Triangulation refinement algorithm Finite element method Right-triangle bintree triangulation

来源：评论

学校读者我要写书评

暂无评论

Convergence analysis of subdivision processes on the sphere

引用

IMA JOURNAL OF NUMERICAL ANALYSIS 2022年第1期42卷 698-711页

作者： Huening, Svenja Wallner, Johannes Graz Univ Technol Inst Geometrie Kopernikusgasse 24 A-8010 Graz Austria

We analyse the convergence of nonlinear Riemannian analogues of linear subdivision processes operating on data in the sphere. We show how for curve subdivision rules we can derive bounds guaranteeing convergence if the density of input data is below that threshold. Previous results only yield thresholds that are several magnitudes smaller and are thus useless for a priori checking of convergence. It is the first time that such a result has been shown for a geometry with positive curvature and for subdivision rules not enjoying any special properties like being interpolatory or having non-negative mask.

关键词： refinement algorithm approximation theory differential geometry

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：