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

Testing of a local approach for the prediction of quality parameters in intact nectarines using a portable NIRS instrument

引用

POSTHARVEST BIOLOGY AND TECHNOLOGY 2011年第2期60卷 130-135页

作者： Sanchez, Maria-Teresa De la Haba, Maria-Jose Guerrero, Jose-Emilio Garrido-Varo, Ana Perez-Marin, Dolores Univ Cordoba Dept Bromatol & Food Technol E-14071 Cordoba Spain Univ Cordoba Dept Anim Prod E-14071 Cordoba Spain

The nectarine sector requires rapid, economical and non-destructive methods for monitoring physical-chemical quality changes taking place not only during fruit development and at harvest, but also postharvest, thus allowing fruit quality to be evaluated at any stage in the commercial chain from grower to consumer. The use of sensors based on Near Infrared Spectroscopy (NIRS) technology, in conjunction with chemometric data treatment models, has already been studied for this quality-control purpose in nectarines. The critical challenge is to develop robust and accurate mathematic models based on hundreds of highly heterogeneous nectarine samples in order to represent the large natural variability of the fruit. This paper evaluates and compares the performance of MPLS regression and a local regression method for the prediction of major quality parameters including size (weight and diameter), flesh firmness and soluble solids content (SSC), in nectarines representing different harvests and crop practices. The results showed that the local algorithm offered no advantages over MPLS regression for the prediction of SSC and diameter, and only slight benefits in weight determination. For firmness evaluation, however, application of the local algorithm yielded a major improvement, reducing the standard error of prediction (SEP) by 27%, increasing the coefficient of determination (r(2)) by 44% (from 0.47 to 0.68), and reducing bias by 88.5% (from 6.95 N to 0.80 N). Thus, use of the local algorithm proved to be valuable in minimizing the error in NIRS models for predicting a parameter as complex as firmness. (C) 2010 Elsevier B.V. All rights reserved.

关键词： NIR spectroscopy Nectarine Portable sensor Quality parameters local algorithm

来源：评论

学校读者我要写书评

暂无评论

local and Parallel Finite Element algorithms for Eigenvalue Problems

引用

Acta Mathematicae Applicatae Sinica 2002年第2期18卷 185-200页

作者： Jinchao Xu Center for Computational Mathematics and Applications and Department of Mathematics Pennsylvania State UniversityUniversity ParkPennsylvania 16802USA

Some new local and parallel finite element algorithms are proposed and analyzed in this paper for eigenvalue problems. With these algorithms, the solution of an eigenvalue problem on a fine grid is reduced to the solution of an eigenvalue problem on a relatively coarse grid together with solutions of some linear algebraic systems on fine grid by using some local and parallel procedure. A theoretical tool for analyzing these algorithms is some local error estimate that is also obtained in this paper for finite element approximations of eigenvectors on general shape-regular grids.

关键词： Eigenvalue finite element local algorithm parallel algorithm

来源：评论

学校读者我要写书评

暂无评论

local Stereo Matching Based on the Improved Matching Cost Function and the Adaptive Window 8

Local Stereo Matching Based on the Improved Matching Cost Fu...

引用

Proceedings 2015 8 International Congress on Image and Signal Processing (CISP)

作者： Liu, Jiling Zhang, Yong Dong, Xueguang Beijing Univ Aeronaut & Astronaut Sch Instrument Sci & Optoelect Engn Beijing Peoples R China

ISBN: (纸本)9781467390989

this paper presents a stereo matching algorithm based on the improved matching cost function and the adaptive window. First of all, AD, Census and gradient gap of left and right images are calculated. Joint bilateral filter is used for calculating weights of pixels, thereby constructing a matching cost function. Then, different aggregation window construction strategies are used for aggregating matching costs through pixel classification. One judgment of disparity computation validness is increased on the basis of using Winner-Takes-All strategy. Finally, disparity map is refined through regional voting, joint image inpainting and other optimization steps. Middlebury data sets are adopted for the experiment. The result shows that algorithm proposed in the paper has good processing result.

关键词： binocular stereo matching local algorithm matching cost function construction classification window

来源：评论

学校读者我要写书评

暂无评论

Short Paper: Structural Network Properties for local Planarization of Wireless Sensor Networks 15th

Short Paper: Structural Network Properties for Local Planari...

引用

15th International Conference on Ad-Hoc Networks and Wireless (ADHOC-NOW)

作者： Neumann, Florentin Estevao, Daniel Vivas Ockenfeld, Frank Radak, Jovan Frey, Hannes Univ Koblenz Landau Inst Comp Sci Koblenz Germany

ISBN: (纸本)9783319405094;9783319405087

Network graphs satisfying redundancy and coexistence can be planarized by means of local algorithms without making assumptions on the nodes' communication ranges. We generalize these properties to k-weak and k-strong coexistence and redundancy. Subsequently, we give empirical evidence that these properties are present in simulated wireless sensor networks as well as in actual testbed deployments, especially if looking at the graph's c-hop clustered overlay representations, for c <= 2.

关键词： WSN Planarization local algorithm Geometric graph Redundancy Coexistence Log normal shadowing Testbed measurements

来源：评论

学校读者我要写书评

暂无评论

local Approximation of the Maximum Cut in Regular Graphs 1

引用

45th International Workshop on Graph-Theoretic Concepts in Computer Science (WG)

作者： Bamas, Etienne Esperet, Louis Ecole Polytech Fed Lausanne Sch Comp & Commun Sci Lausanne Switzerland Univ Grenoble Alpes Lab G SCOP CNRS Grenoble France

ISBN: (数字)9783030307868

ISBN: (纸本)9783030307868;9783030307851

This paper is devoted to the distributed complexity of finding an approximation of the maximum cut in graphs. A classical algorithm consists in letting each vertex choose its side of the cut uniformly at random. This does not require any communication and achieves an approximation ratio of at least 1 2 in average. When the graph is d-regular and triangle-free, a slightly better approximation ratio can be achieved with a randomized algorithm running in a single round. Here, we investigate the round complexity of deterministic distributed algorithms for MAXCUT in regular graphs. We first prove that if G is d-regular, with d even and fixed, no deterministic algorithm running in a constant number of rounds can achieve a constant approximation ratio. We then give a simple one-round deterministic algorithm achieving an approximation ratio of 1/d for d-regular graphs with d odd. We show that this is best possible in several ways, and in particular no deterministic algorithm with approximation ratio 1/d + epsilon (with epsilon > 0) can run in a constant number of rounds. We also prove results of a similar flavour for the MAXDI-CUT problem in regular oriented graphs, where we want to maximize the number of arcs oriented from the left part to the right part of the cut.

关键词： Maximum cut Distributed approximation local algorithm

来源：评论

学校读者我要写书评

暂无评论

local edge colouring of Yao-like subgraphs of Unit Disk Graphs

引用

14th International Colloquium on Stuctural Information and Communication Complexity

作者： Czyzowicz, J. Dobrev, S. Kranakis, E. Opatrny, J. Urrutia, J. Carleton Univ Sch Comp Sci Ottawa ON K1S 5B6 Canada Univ Quebec Outaouais Dept Informat Gatineau PQ J8X 3X7 Canada Univ Ottawa Sch Informat Technol & Engn Ottawa ON K1N 6N5 Canada Concordia Univ Dept Comp Sci Montreal PQ H3G 1M8 Canada Univ Nacl Autonoma Mexico Inst Matemat Area Invest Cientifica Mexico City 04510 DF Mexico

ISBN: (纸本)9783540729181

The focus of the present paper is on providing a local deterministic algorithm for colouring the edges of Yao-like subgraphs of Unit Disk Graphs. These are geometric graphs such that for some positive integers l, k the following property holds at each node nu: if we partition the unit circle centered at nu into 2k equally sized wedges then each wedge can contain at most I points different from nu. We assume that the nodes are location aware, i.e. they know their Cartesian coordinates in the plane. The algorithm presented is local in the sense that each node can receive information emanating only from nodes which are at most a constant (depending on k and l, but not on the size of the graph) number of hops (measured in the original underlying Unit Disk Graph) away from it, and hence the algorithm terminates in a constant number of steps. The number of colours used is 2kl + 1 and this is optimal for local algorithms (since the maximal degree is 2kl and a colouring with 2kl colours can only be constructed by a global algorithm), thus showing that in this class of graphs the price for locality is only one additional colour. (C) 2008 Elsevier B.V. All rights reserved.

关键词： Edge colouring Geometric graphs Unit Disk Graphs local algorithm Location awareness Wedge Wireless network

来源：评论

学校读者我要写书评

暂无评论

local Construction of Connected Plane Subgraphs in Graphs Satisfying Redundancy and Coexistence 11

Local Construction of Connected Plane Subgraphs in Graphs Sa...

引用

11th Latin and American algorithms, Graphs and Optimization Symposium (LAGOS)

作者： Boeltz, Lucas Becker, Benjamin Frey, Hannes Univ Koblenz Landau Dept Comp Sci Koblenz Germany Tech Univ Darmstadt Multimedia Commun Lab Darmstadt Germany

Connected plane graphs enable many local algorithmic solutions for data communication, task coordination and network maintenance in wireless sensor networks, sensor-actuator networks and distributed robotics. We study construction of such graphs by removing edges from a given network graph. We assume redundancy and coexistence, a graph structure which holds in realistic wireless network models with high probability and which assures that a connected plane graph can always be constructed with local edge removal rules. We present a local algorithm to construct such a connected plane graph. We prove algorithm correctness under redundancy and coexistence assumption. Furthermore, we discuss how far redundancy and coexistence could be weakened while still assuring correctness of the algorithm. (C) 2021 The Authors. Published by Elsevier B.V.

关键词： Plane spanning subgraph local algorithm Redundancy Coexistence Correctness analysis

来源：评论

学校读者我要写书评

暂无评论

On a local Heuristic for a Reverse Multicast Forwarding Game

On a Local Heuristic for a Reverse Multicast Forwarding Game

引用

1st International Conference on Networks and Communications

作者： Varatharajan, Sarvesh Ercal-Ozkaya, Gunes Univ Kansas Lawrence KS 66045 USA

ISBN: (纸本)9781424453641

We consider the problem of incentive compatible topology control for selfish all-to-one (reverse multicast) routing as modeled by a locally minimum cost forwarding game in [4], with new focus in this work on efficient local implementability in the absence of complete global information for realistic scenarios. In this work we consider a new locally computable heuristic "recommendation algorithm", which we refer to as localHeur for convenience. localHeur lies within the class of location based routing methods with particular similarity to the Nearest Forward Progress algorithm [7] though from the perspective of game-theoretic reverse multicast routing. We find that localHeur actually outperforms DeltaHeur of [4] in terms of global optimality in random Euclidean power instances which model wireless networks, though at the expense of loosening the Nash equilibrium condition. Nonetheless, we find that the relaxation of the Nash condition is strongly bounded in multiple ways, with high probability: The vast majority of players are provably playing a best response, while simulation results demonstrate that the average deviation ratio from a best response is within a decimal point of 1. Furthermore, the player deviating most from his best response is provably still within O(log n) of the cost of his best response, while simulation results support a much smaller maximum deviation from the best response.

关键词： sensor networks incentive compatible topology control game theory heuristics for NP-Hard problems location based routing local algorithm random Euclidean power graphs

来源：评论

学校读者我要写书评

暂无评论

local Construction of Connected and Plane Spanning Subgraphs under Acyclic Redundancy 18

Local Construction of Connected and Plane Spanning Subgraphs...

引用

18th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOPT)

作者： Boehmer, Steffen Boeltz, Lucas Frey, Hannes Univ Koblenz Landau Dept Comp Sci Koblenz Germany

ISBN: (纸本)9783903176294

Plane graphs play a major role for local routing and some other local network protocols in wireless communication. With such local algorithms each node requires information about its neighborhood only. It is assumed that nodes are deployed on the plane and each node knows its position in a given coordinate system. An arbitrary graph drawn on the plane can be transformed into a plane spanning subgraph by deleting edges. However, to assure connectivity at the same time some additional structural graph properties are required. Current graph classes that assure the existence of connected plane spanning subgraphs require assumptions, that are not very likely to hold for wireless network structures. In this work we develop the acyclic redundancy condition. This is a novel graph class with only one property that assures the existence of a connected plane spanning subgraph. Furthermore, we describe local algorithms that construct a connected plane spanning subgraph for graphs satisfying the acyclic redundancy condition. With numerical studies we confirm that the acyclic redundancy condition is a more realistic condition than existing graph classes that were required so far to construct connected plane spanning subgraphs.

关键词： plane subgraph local algorithm log-normal-shadowing stochastic analysis numerical evaluation

来源：评论

学校读者我要写书评

暂无评论

Thresholding random geometric graph properties motivated by ad hoc sensor networks

引用

JOURNAL OF COMPUTER AND SYSTEM SCIENCES 2010年第7期76卷 686-696页

作者： Muthukrishnan, S. Pandurangan, Gopal Purdue Univ Dept Comp Sci W Lafayette IN 47907 USA Rutgers State Univ Dept Comp Sci Piscataway NJ 08854 USA

We study the emerging phenomenon of ad hoc, sensor-based communication networks. The communication is modeled by the random geometric graph model G(n, r, l) where n points randomly placed within [0, l](d) form the nodes, and any two nodes that correspond to points at most distance r away from each other are connected. We study fundamental properties of G(n, r, l) of interest: connectivity, coverage, and routing-stretch. We use a technique that we call bin-covering that we apply uniformly to get (asymptotically) tight thresholds for each of these properties. Typically, in the past, random geometric graph analyses involved sophisticated methods from continuum percolation theory;on contrast, our bin-covering approach is discrete and very simple, yet it gives us tight threshold bounds. The technique also yields algorithmic benefits as illustrated by a simple local routing algorithm for finding paths with low stretch. Our specific results should also prove interesting to the sensor networking community that has seen a recent increase in the study of random geometric graphs motivated by engineering ad hoc networks. (C) 2010 Elsevier Inc. All rights reserved.

关键词： Random geometric graphs Thresholds Sensor network models local algorithm Coverage Stretch Connectivity

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：