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

IEEE 11th Conference on Industrial Electronics and Applications (ICIEA)

作者： Li, Baoping Commun Univ China Key Lab Media Audio & Video Minist Educ Beijing Peoples R China Henan Polytech Univ Jiaozuo Peoples R China

ISBN: (纸本)9781467386449

Cost initialization is an important step in both local and global stereo matching algorithms. Different similarity measures may perform differently in a particular location depending on the image structure. Different from the traditional similarity fusion strategies, we present a new fusion strategy which fuses similarity measures adaptively based on their performance on different image regions. The experimental results demonstrate that the proposed adaptive similarity fusion algorithm used in both local and global stereo matching algorithms is capable of providing high-quality disparity maps comparable to other fusion strategies.

关键词： Stereo Matching Adaptive Similarity Fusion local algorithm Global algorithm

来源：评论

学校读者我要写书评

暂无评论

Finding Sparse Cuts locally Using Evolving Sets

Finding Sparse Cuts Locally Using Evolving Sets

引用

41st Annual ACM Symposium on Theory of Computing

作者： Andersen, Reid Peres, Yuval Microsoft Live Labs Redmond WA 98052 USA

ISBN: (纸本)9781605586137

A local graph partitioning algorithm finds a set of vertices with small conductance (i.e. a sparse cut) by adaptively exploring a large graph G, starting from a specified vertex. For the algorithm to he local, its complexity must be bounded in terms of the size of the set it outputs. with at most a, weak dependence on n, the number of vertices in G. Previous local partitioning algorithms find sparse cuts using random walks and personalized PageRank. In this paper, we introduce a randomized local partitioning algorithm that finds a sparse cut by simulating the volume-based evolving set which is a Markov chain oil sets of vertices. We, prove that For any set of vertices A that has conductance Lit most phi, and for at least half of the starting vertices in A our algorithm will output (with probability at least half) a set of conductance O (phi(1/2) log(1/2) n). The complexity of a local partitioning algorithm is measured by, its work/volume ratio, which is the ratio between the computational complexity of the algorithm oil a given run, and the volume of the Set, output. We prove that for our algorithm, the expected value of the work/volume ratio is O(phi(-1/2) polylog(n)). The best previous local partitioning algorithm, due to Andersen, Chung, and Lang, has the same approximation guarantee but, a, larger work/volume ratio of O(phi(-1/2) polylog(n)). As an application of our local partitioning algorithm, we construct a fast algorithm for finding balanced cuts. The resulting algorithm Likes as input a graph and a fixed value of phi, has complexity (m + n phi(-1/2)). O(phi(-1/2) polylog(n)), and returns a cut with conductance O (phi(1/2) log(1/2) n) and volume at least nu(phi)/2, where nu(phi) is the volume of the largest set in the graph with conductance at most phi.

关键词： Evolving Sets Graph Partitioning local algorithm

来源：评论

学校读者我要写书评

暂无评论

Dynamic Representations of Sparse Distributed Networks: A locality-Sensitive Approach 18

Dynamic Representations of Sparse Distributed Networks: A Lo...

引用

30th ACM Symposium on Parallelism in algorithms and Architectures (SPAA)

作者： Kaplan, Haim Solomon, Shay Tel Aviv Univ Tel Aviv Israel IBM Res TJ Watson Res Ctr New York NY USA

ISBN: (纸本)9781450357999

In 1999, Brodal and Fagerberg (BF) gave an algorithm for maintaining a low outdegree orientation of a dynamic uniformly sparse graph. Specifically, for a dynamic graph on n-vertices, with arboricity bounded by alpha at all times, the BF algorithm supports edge updates in O(log n) amortized update time, while keeping the maximum outdegree in the graph bounded by O(alpha). Such an orientation provides a basic data structure for uniformly sparse graphs, which found applications to a plethora of dynamic graph algorithms. A significant weakness of the BF algorithm is the possible temporary blowup of the maximum outdegree, following edge insertions. Although BF eventually reduces all outdegrees to O(alpha), some vertices may reach an outdegree of Omega(n) during the process, hence local memory usage at the vertices-an important quality measure in distributed systems-cannot be bounded. We show how to modify the BF algorithm to guarantee that the outdegrees of all vertices are bounded by O(alpha) at all times, without hurting any of its other properties, and present an efficient distributed implementation of the modified algorithm. This provides the first representation of distributed networks in which the local memory usage at vertices is bounded by the arboricity (which is essentially the average degree of the densest subgraph) rather than the maximum degree. For settings where there is no local memory constraints, one may take the temporary outdegree blowup to the extreme and allow a permanent outdegree blowup. This allows us to address the second significant weakness of the BF algorithm - its inherently global nature: An insertion of an edge (u, v) may trigger changes in the orientations of edges that are arbitrarily far away from u and v. We suggest an alternative local scheme, which does not guarantee any outdegree bound on the vertices, yet is just as efficient as the BF scheme for some applications. For example, we obtain a local dynamic algorithm for maintaining a

关键词： arboricity dynamic network local algorithm local memory

来源：评论

学校读者我要写书评

暂无评论

Constant Round Distributed Domination on Graph Classes with Bounded Expansion 28th

Constant Round Distributed Domination on Graph Classes with ...

引用

28th International Colloquium on Structural Information and Communication Complexity (SIROCCO)

作者： Kublenz, Simeon Siebertz, Sebastian Vigny, Alexandre Univ Bremen Bremen Germany

We show that the dominating set problem admits a constant factor approximation in a constant number of rounds in the local model of distributed computing on graph classes with bounded expansion. This generalizes a res... 详细信息

ISBN: (纸本)9783030795269;9783030795276

关键词： Dominating set local algorithm Bounded expansion graph classes

来源：评论

学校读者我要写书评

暂无评论

local Maximum Lifetime algorithms For Strong k-Barrier Coverage With Cooridnated Sensors

Local Maximum Lifetime Algorithms For Strong k-Barrier Cover...

引用

2011 IEEE 3rd International Conference on Communication Software and Networks(ICCSN 2011)

作者： Yingying Cao Liusheng Huang School of Information Science and Technology Yancheng Teachers University Yancheng,ChinaKai Xing Hao Yang Suzhou Institute for Advanced Study University of Science and Technology of China Suzhou,China

Barrier coverage is known to be an appropriate model of coverage for movement detection and boundary guard,which is achieved by barriers of *** paper focuses on local algorithms for strong k-barrier coverage based on detection coverage *** first formalize a coordinated detection coverage model,where the data fusion rule is described by a general ***,we analyze the influencing factors of barrier coverage lifetime,and tranfer it to a multiobjective optimization ***,we propose a new Divide-and-Conquer *** on it,we design a new local maximal lifetime algorithm and following protocol for strong k-barrier with coordinated sensors. Simulations that the new algorithm provides effective enhancement in network lifetime,it outperforms RIS by up to 4.34 times and surpasses LBCP by 5 time units.

关键词： wireless sensor network barrier coverage local algorithm data fusion detection coverage model

来源：评论

学校读者我要写书评

暂无评论

NIR handheld miniature spectrometer to increase the efficiency of Iberian pig selection schemes based on chemical traits

引用

SPECTROCHIMICA ACTA PART A-MOLECULAR AND BIOMOLECULAR SPECTROSCOPY 2021年 258卷 119865-119865页

作者： Caceres-Nevado, J. M. Garrido-Varo, A. De Pedro-Sanz, E. Perez-Marin, D. C. Univ Cordoba Fac Agr & Forestry Engn Campus Rabanales N-4Km 396 Cordoba 14014 Spain

来源：评论

学校读者我要写书评

暂无评论

Online NIRS analysis for the routine assessment of the nitrate content in spinach plants in the processing industry using linear and non-linear methods

引用

LWT-FOOD SCIENCE AND TECHNOLOGY 2021年 151卷

作者： Vega-Castellote, Miguel Perez-Marin, Dolores Torres, Irina Sanchez, Maria-Teresa Univ Cordoba Dept Bromatol & Food Technol Rabanales Campus Cordoba 14071 Spain Univ Cordoba Dept Anim Prod Rabanales Campus Cordoba 14071 Spain

This study aimed to assess the robustness of the NIRS models developed following different strategies for the routine prediction of nitrate content in spinach plants using an online FT-NIR spectrophotometer. To achieve this, 516 spinach plants from different cultivars, harvest dates, orchards and seasons, were used. Two strategies were followed to make up the calibration and validation sets;the first included in the calibration set those samples belonging to the 2018 and 2019 harvesting seasons, while the second also included in this set part of the population of the 2020 harvesting season. Modified partial least squares quantitative models were initially developed and externally validated. In view of the results and to obtain significant improvements, a non-linear regression technique (the local algorithm) was applied. The models developed using the non-linear regression technique and considering the greatest possible variability in the training set (samples belonging to 2018, 2019 and 2020 harvesting seasons) reported the best prediction results (R-p(2) = 0.60;SEP = 758 mg/kg), which enabled to classify the product in the main categories or classes established by the official regulations, according to its commercial destination.

关键词： Quantitative models MPLS algorithm local algorithm Sample variability

来源：评论

学校读者我要写书评

暂无评论

Cellular Automaton Based localized algorithms for Mobile Sensor Networks

引用

INTERNATIONAL JOURNAL OF UNCONVENTIONAL COMPUTING 2015年第5-6期11卷 417-447页

作者： Choudhury, Salimur Salomaa, Kai Akl, Selim G. Algoma Univ Dept Math & Comp Sci Sault Ste Marie ON Canada Queens Univ Sch Comp Kingston ON Canada

Mobile wireless sensor networks involve many aspects not dealt with in traditional networks, and therefore, can be viewed as an unconventional computational model. We design algorithms for mobile wireless sensor networks based on another unconventional model of computation, namely, the biologically-inspired cellular automaton. The main advantage of using cellular-automaton-based algorithms is that they are strictly local algorithms, and as such are more suitable for sensor networks. We design cellular-automaton-based algorithms for three optimization problems in connection with mobile wireless sensor networks. The first problem involves a set of connected sensors that are deployed randomly in a network. The goal of the algorithm is to gather all the sensors at a single location. In the second problem, we are given a set of sensors which form a chain. All sensors except for the two end points of the chain are connected to their two neighbors, right and left. The two end points are fixed and can directly communicate with only one neighbor. Other sensors can move autonomously. At an initial configuration of the network, the chain can be winding and even overlap with itself. Our goal is to move the sensors so that they can come as close as possible to the direct line between the two end points, and while the sensors move the network should remain connected. In the third problem, a number of mobile sensors and mobile objects are deployed randomly in a dense area of the network and are allowed to move within the network. Our main goal is to monitor the mobile objects by the mobile sensors as long as possible. We show that our algorithms perform better than existing algorithms for all three problems.

关键词： Mobile sensor networks cellular automata local algorithm synchronous gathering chain length object monitoring perfomance evaluation

来源：评论

学校读者我要写书评

暂无评论

Surgical treatment of type A Acute Aortic Dissection based on Geneva algorithm

引用

Journal of Cardiothoracic Surgery 2015年第1期10卷 1-2页

作者： Burak Can Depboylu Leon Finci Patrick O Myers Saziye Karaca Dominique Vala Jalal Jolou Parmeseeven Mootoosamy Afksendiyos Kalangos Mustafa Cikirikcioglu Marck Licker Karim Bendjelid Division of Cardiovascular Surgery Hospitals and Medical Faculty of Geneva Geneva Geneva 1211 Switzerland Division of Anaesthesiology University Hospitals and Medical Faculty of Geneva Geneva Geneva 1211 Switzerland Division of Intensive Care Hospitals and Medical Faculty of Geneva Geneva Geneva 1211 Switzerland

来源：评论

学校读者我要写书评

暂无评论

A geometric routing protocol in disruption tolerant network

引用

INTERNATIONAL JOURNAL OF PARALLEL EMERGENT AND DISTRIBUTED SYSTEMS 2010年第6期25卷 489-508页

作者： Du, Jingzhe Kranakis, Evangelos Nayak, Amiya Carleton Univ Sch Comp Sci Ottawa ON Canada Univ Ottawa Sch Informat Technol & Engn Ottawa ON Canada

We describe a novel geometric localised routing protocol in disruption (delay) tolerant network (DTN). Although DTNs do not guarantee the connectivity of the network all the time, geometric location information could still be used to make routing decisions in a store-and-forward way. Geometric planar spanners, especially local Delaunay triangulation (LDT) can also be used in DTNs to provide a good routing graph with constant stretch factor and shorter paths during communications. In this work, we design local distributed solutions to extract spanning trees from LDT graphs from source to destination. Our protocol resorts to flooding packets along trees with high probability of being delivered without significant delays. Through experimentation, we have shown that the proposed routing protocol achieves higher delivery ratios with lower delays and limited storage requirements than the benchmark epidemic routing protocol.

关键词： routing disruption tolerant network Delaunay triangulation spanner local algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：