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

Non-destructive characterization and quality control of intact strawberries based on NIR spectral data

JOURNAL OF FOOD ENGINEERING 2012年第1期110卷 102-108页

作者： Sanchez, Maria-Teresa Jose De la Haba, M. Benitez-Lopez, Miriam Fernandez-Novales, Juan 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

External and internal quality parameters of strawberries (Fragaria x ananassa Duch.) were studied at harvest and during postharvest refrigerated storage using a handheld micro-electro-mechanical system (MEMS) near-infrared spectrophotometer. A total of 189 strawberry punnets were used to develop calibration models using various spectral signal pretreatments and linear and non-linear regression algorithms: the sampling unit for both NIRS analysis and reference methods comprised 5 strawberries from each punnet. Modified partial least squares analysis confirmed the feasibility of NIRS for predicting color-related external quality parameters (L*, a* and C*) as well as firmness, soluble solid content and titratable acidity. For other tested parameters (b*, h* and pH), the results suggested that NIRS prediction was not feasible. However, the application of a local algorithm considerably improved the ability of models to predict all the internal quality parameters studied. Use of the local algorithm proved valuable in minimizing the error in NIRS models for predicting complex internal quality parameters, mainly those related to texture and acidity. Subsequently, the ability of NIR technology to classify individual strawberries as a function of variety was tested using partial least squares discriminant analysis (PLS-DA), which yielded percentages of correctly classified samples (ratio of correctly classified samples to total samples) ranging from 57% for the Camarosa variety to 78% for Antilla Fnm. (C) 2011 Elsevier Ltd. All rights reserved.

关键词： Handheld NIRS instrument MEMS technology Strawberry Variety Quality parameters local algorithm

来源：评论

学校读者我要写书评

暂无评论

Graph Coloring in a Class of Parallel local algorithms

引用

NUMERICAL ANALYSIS AND APPLICATIONS 2011年第3期4卷 189-198页

作者： Evstigneev, V. A. Kyzy, Y. Tursunbay Russian Acad Sci Ershov Inst Informat Syst Siberian Branch Pr Akad Lavrenteva 6 Novosibirsk 630090 Russia

A way of improving the performance of a distributed algorithm is rendering a coloring strategy into an algorithm known as efficient in the nondistributed case. In this paper it is shown that certain sequential coloring algorithm heuristics like largest-first (LF), smallest-last (SL), and saturation largest-first (SLF), as applied to some classes of graphs and to special cases of vertex coloring in distributed algorithms, produce an optimal or near-optimal coloring.

关键词： graph coloring local algorithm distributed algorithm greedy algorithm w-perfect graph T-coloring sum coloring.

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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 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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

An optimal maximal independent set algorithm for bounded-independence graphs

引用

DISTRIBUTED COMPUTING 2010年第5-6期22卷 349-361页

作者： Schneider, Johannes Wattenhofer, Roger Swiss Fed Inst Technol Comp Engn & Networks Lab CH-8092 Zurich Switzerland

We present a novel distributed algorithm for the maximal independent set problem (This is an extended journal version of Schneider and Wattenhofer in Twenty-seventh annual ACM SIGACT-SIGOPS symposium on principles of distributed computing, 2008). On bounded-independence graphs our deterministic algorithm finishes in O(log* n) time, n being the number of nodes. In light of Linial's Omega(log* n) lower bound our algorithm is asymptotically optimal. Furthermore, it solves the connected dominating set problem for unit disk graphs in O(log* n) time, exponentially faster than the state-of-the-art algorithm. With a new extension our algorithm also computes a delta + 1 coloring and a maximal matching in O(log* n) time, where delta is the maximum degree of the graph.

关键词： Ad Hoc network Sensor network Radio network Unit disk graph Growth bounded graph Bounded-independence graph local algorithm Parallel algorithm Maximal independent set Maximal matching Dominating set Connected Dominating Set Coloring Symmetry breaking

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

引用

THEORETICAL COMPUTER SCIENCE 2009年第14期410卷 1388-1400页

作者： 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

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 edge colouring of Yao-like subgraphs of Unit Disk Graphs

引用

14th International Colloquium on Stuctural Information and Communication Complexity

ISBN: (纸本)9783540729181

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

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：