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

Detecting overlapping communities of weighted networks via a local algorithm

PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS 2010年第19期389卷 4177-4187页

作者： Chen, Duanbing Shang, Mingsheng Lv, Zehua Fu, Yan Huazhong Univ Sci & Technol Sch Comp Sci Wuhan 430074 Peoples R China Univ Elect Sci & Technol China Sch Comp Sci Web Sci Ctr Chengdu 611731 Peoples R China

Identification of communities is significant in understanding the structures and functions of networks. Since some nodes naturally belong to several communities, the study of overlapping communities has attracted increasing attention recently, and many algorithms have been designed to detect overlapping communities. In this paper, an overlapping communities detecting algorithm is proposed whose main strategies are finding an initial partial community from a node with maximal node strength and adding tight nodes to expand the partial community. Seven real-world complex networks and one synthetic network are used to evaluate the algorithm. Experimental results demonstrate that the algorithm proposed is efficient for detecting overlapping communities in weighted networks. (C) 2010 Elsevier B.V. All rights reserved.

关键词： Weighted networks Overlapping community local algorithm Node strength

来源：评论

学校读者我要写书评

暂无评论

Implementation of local algorithm with near-infrared spectroscopy for compliance assurance in compound feedingstuffs

引用

APPLIED SPECTROSCOPY 2005年第1期59卷 69-77页

作者： Pérez-Marín, D Garrido-Varo, A Guerrero, JE Univ Cordoba ETSIAM Dept Anim Prod Cordoba Spain

Seven thousand four hundred and twenty-three compound feed samples were used to develop near-infrared (NIR) calibrations for predicting the percentage of each ingredient used in the manufacture of a given compound feedingstuff. Spectra were collected at 2 run increments using a FOSS NIRSystems 5000 monochromator. The reference data used for each ingredient percentage were those declared in the formula for each feedingstuff. Two chemometric tools for developing NIRS prediction models were compared: the so-called GLOBAL MPLS (modified partial least squares), traditionally used in developing NIRS applications, and the more recently developed calibration strategy known as local. The local procedure is designed to select, from a large database, samples with spectra resembling the sample being analyzed. Selected samples are used as calibration sets to develop specific MPLS equations for predicting each unknown sample. For all predicted ingredients, local calibrations resulted in a significant improvement in both standard error of prediction (SEP) and bias values compared with GLOBAL calibrations. Determination coefficient values (r(2)) also improved using the local strategy, exceeding 0.90 for most ingredients. Use of the local algorithm for calibration thus proved valuable in minimizing the errors in NIRS calibration equations for predicting a parameter as complex as the percentage of each ingredient in compound feedingstuffs.

关键词： near-infrared spectroscopy NIR compound feedingstuffs ingredient percentage local algorithm

来源：评论

学校读者我要写书评

暂无评论

A strengthened analysis of a local algorithm for the minimum dominating set problem in planar graphs

引用

INFORMATION PROCESSING LETTERS 2014年第3期114卷 94-98页

作者： Wawrzyniak, Wojciech Adam Mickiewicz Univ Fac Math & Comp Sci Poznan Poland

In recent years growing interest in local distributed algorithms has widely been observed. This results from their high resistance to errors and damage, as well as from their good performance, which is independent of the size of the network. A local deterministic distributed algorithm finding an approximation of a Minimum Dominating Set in planar graphs has been presented by Lenzen et al., and they proved that the algorithm returns a 130-approximation of the Minimum Dominating Set. In this article we will show that the algorithm is two times more effective than was previously assumed, and we prove that the algorithm by Lenzen et al. outputs a 52-approximation to a Minimum Dominating Set. Therefore the gap between the lower bound and the approximation ratio of the best yet local deterministic distributed algorithm is reduced by half. (C) 2013 Published by Elsevier B.V.

关键词： Approximation algorithms Distributed algorithm local algorithm Dominating set Planar graph

来源：评论

学校读者我要写书评

暂无评论

SPOT5 multi-spectral (MS) and panchromatic (PAN) image fusion using an improved wavelet method based on local algorithm

引用

COMPUTERS & GEOSCIENCES 2013年 60卷 134-141页

作者： Dong, Zhangyu Wang, Zongming Liu, Dianwei Zhang, Bai Zhao, Ping Tang, Xuguang Jia, Mingming Chinese Acad Sci Northeast Inst Geog & Agroecol Changchun 130102 Peoples R China Univ Chinese Acad Sci Beijing 100049 Peoples R China Hefei Univ Technol Coll Resources & Environm Engn Hefei 230009 Peoples R China

Remote sensing image fusion is an effective way to extract a large volume of data from multi-source images. However, traditional image fusion methods cannot meet the requirements of applications because they can lose spatial information or distort spectral characteristics. In this paper, a new wavelet method based on a local algorithm is presented. The proposed method fuses multi-spectral (MS) and panchromatic (PAN) images to improve spatial information and preserve spectral characteristics. The main advantage of the new fusion method is the exploitation of the dependency between neighboring pixels. SPOT5 MS and PAN images were employed to execute the fusion methods. To compare with the new method, the principal component analysis (PCA), wavelet transformation, and PCA-based wavelet (PCA-FW) image fusion methods were selected. Qualitative and quantitative analyses and classification accuracy assessment were conducted to evaluate the performance of the fusion methods. The results demonstrate that the new wavelet method based on a local algorithm is better than traditional image fusion methods. The new fusion method can achieve a wide range of balance between high spatial resolution retention and spectral characteristic preservation;thus, the new method is suitable for different applications. Crown Copyright (C) 2013 Published by Elsevier Ltd. All rights reserved.

关键词： Image fusion local algorithm Wavelet transformation Quality assessment SPOTS image

来源：评论

学校读者我要写书评

暂无评论

Phase distribution measurement of light wave by adaptive control of pupil function with local algorithm

引用

OPTICAL REVIEW 2002年第2期9卷 33-36页

作者： Sakakura, M Komatsu, S Waseda Univ Dept Appl Phys Shinjuku Ku Tokyo 1698555 Japan Mat Res Lab Biosci & Photon Shinjuku Ku Tokyo 1698555 Japan

In developing a new method to measure the phase distribution of a light wave utilizing the adaptive control of the pupil function with a liquid crystal panel, the optimization procedure for the adaptive control is shown to improve when a local algorithm is adopted. The feasibility of the proposed system is confirmed by computer simulation as well as by some basic experiments.

关键词： light wave sensing phase distribution measurement adaptive optics liquid crystal panel local algorithm

来源：评论

学校读者我要写书评

暂无评论

A local algorithm for Checking Probabilistic Bisimilarity

A Local Algorithm for Checking Probabilistic Bisimilarity

引用

4th International Conference on Frontier of Computer Science and Technology

作者： Deng, Yuxin Du, Wenjie Shanghai Jiao Tong Univ Shanghai Peoples R China Shanghai Normal Unive Shanghai Peoples R China

ISBN: (纸本)9780769539324

Bisimilarity is one of the most important relations for comparing the behaviour of formal systems in concurrency theory. Decision algorithms for bisimilarity in finite state systems are usually classified into two kinds: global algorithms are generally efficient but require to generate the whole state spaces in advance, and local algorithms combine the verification of a system's behaviour with the generation of the system's state space, which is often more effective to determine that one system fails to be related to another. Although local algorithms are well established in the classical concurrency theory, the study of local algorithms in probabilistic concurrency theory is not mature. In this paper we propose a polynomial time local algorithm for checking probabilistic bisimilarity. With mild modification, the algorithm can be easily adapted to decide probabilistic similarity with the same time complexity.

关键词： concurrency probabilistic bisimilarity local algorithm probabilistic labelled transition systems

来源：评论

学校读者我要写书评

暂无评论

Comparative analysis of the quality of a global algorithm and a local algorithm for alignment of two sequences

引用

algorithmS FOR MOLECULAR BIOLOGY 2011年第1期6卷 25-25页

作者： Polyanovsky, Valery O. Roytberg, Mikhail A. Tumanyan, Vladimir G. RAS VA Engelhardt Mol Biol Inst Moscow 119991 Russia RAS Inst Math Problems Biol Pushchino 142290 Russia

Background: algorithms of sequence alignment are the key instruments for computer-assisted studies of biopolymers. Obviously, it is important to take into account the "quality" of the obtained alignments, i.e. how closely the algorithms manage to restore the "gold standard" alignment (GS-alignment), which superimposes positions originating from the same position in the common ancestor of the compared sequences. As an approximation of the GS-alignment, a 3D-alignment is commonly used not quite reasonably. Among the currently used algorithms of a pair-wise alignment, the best quality is achieved by using the algorithm of optimal alignment based on affine penalties for deletions (the Smith-Waterman algorithm). Nevertheless, the expedience of using local or global versions of the algorithm has not been studied. Results: Using model series of amino acid sequence pairs, we studied the relative "quality" of results produced by local and global alignments versus (1) the relative length of similar parts of the sequences (their "cores") and their nonhomologous parts, and (2) relative positions of the core regions in the compared sequences. We obtained numerical values of the average quality (measured as accuracy and confidence) of the global alignment method and the local alignment method for evolutionary distances between homologous sequence parts from 30 to 240 PAM and for the core length making from 10% to 70% of the total length of the sequences for all possible positions of homologous sequence parts relative to the centers of the sequences. Conclusion: We revealed criteria allowing to specify conditions of preferred applicability for the local and the global alignment algorithms depending on positions and relative lengths of the cores and nonhomologous parts of the sequences to be aligned. It was demonstrated that when the core part of one sequence was positioned above the core of the other sequence, the global algorithm was more stable at longer evolutionary distances a

关键词： Test Sequence Evolutional Distance local algorithm Structural Alignment Global Alignment

来源：评论

学校读者我要写书评

暂无评论

A local approximation algorithm for minimum dominating set problem in anonymous planar networks

引用

DISTRIBUTED COMPUTING 2015年第5期28卷 321-331页

作者： Wawrzyniak, Wojciech Adam Mickiewicz Univ Fac Math & Comp Sci Poznan Poland

A dominating set in a graph is a subset of vertices such that every vertex in V belongs to D or has at least one neighbour in D. In this paper we deal with the problem of finding an approximation of the dominating set of minimum size, i.e., the approximation of the minimum dominating set problem (MDS) in a distributed setting. A distributed algorithm that runs in a constant number of rounds, independent of the size of the network, is called local. In research on distributed local algorithms it is commonly assumed that each vertex has an unique identifier. However, as was shown by Goos et al., for certain classes of graphs (for example, lift-closed bounded degree graphs) identifiers are unnecessary and only a port numbering is needed. We confirm that the same remains true for the MDS up to a constant factor in the class of planar graphs. Namely, we present a local deterministic 694-approximation algorithm for the MDS in planar graphs in a model with a port numbering only. Moreover, our algorithm uses only short messages, i.e., in each round each node can send only a -bit message to each of its neighbours.

关键词： Approximation local algorithm Dominating set Planar graph

来源：评论

学校读者我要写书评

暂无评论

A local approximation algorithm for maximum weight matching

A local approximation algorithm for maximum weight matching

引用

7th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, CTW 2008

作者： Nieberg, Tim Research Institute for Discrete Mathematics University of Bonn Lennéstr. 2 D-53113 Bonn Germany

来源：评论

学校读者我要写书评

暂无评论

local algorithmS FOR INDEPENDENT SETS ARE HALF-OPTIMAL

引用

ANNALS OF PROBABILITY 2017年第3期45卷 1543-1577页

作者： Rahman, Mustazee Virag, Balint Univ Toronto Dept Math 40 St George St Toronto ON M5S 2E4 Canada

We show that the largest density of factor of i.i.d. independent sets in the d-regular tree is asymptotically at most (log d)/d as d -> infinity. This matches the lower bound given by previous constructions. It follows that the largest independent sets given by local algorithms on random d-regular graphs have the same asymptotic density. In contrast, the density of the largest independent sets in these graphs is asymptotically 2(log d)/d. We prove analogous results for Poisson-Galton-Watson trees, which yield bounds for local algorithms on sparse Erdos-Renyi graphs.

关键词： Independent set local algorithm factor of i.i.d. random graphs

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：