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

Texture Prediction in Intact Green Asparagus by Near Infrared (NIR) Spectroscopy, Assaying Linear and Non-linear Regression Strategies

引用

FOOD ANALYTICAL METHODS 2014年第3期7卷 606-615页

作者： De la Haba, Maria-Jose Perez-Marin, Dolores Rial-Huerta, Diego Sanchez, Maria-Teresa Univ Cordoba Dept Bromatol & Food Technol E-14071 Cordoba Spain Univ Cordoba Dept Anim Prod E-14071 Cordoba Spain

Texture-related parameters were assessed in intact green asparagus at harvest and during postharvest storage using near-infrared spectroscopy combined with MPLS and local algorithms. Three spectrophotometers were evaluated for this purpose: a monochromator (range, 400-2,500 nm), a diode-array Vis-NIR spectrophotometer (range, 400-1,700 nm), and a handheld micro-electro-mechanical system (MEMS) spectrophotometer (range, 1,600-2,400 nm). Three hundred green asparagus spears (cv. "Grande") were used to obtain calibration models based on reference data and NIR data. Results for maximum shear force showed that local algorithm improved the predictive capacity of models constructed using all three NIRS instruments, increasing r (2) by 24, 16, and 56 % and reducing the SEP(c) values by 11, 8, and 14 %, respectively. For cutting energy, the local also improved the predictive capacity of the models (r (2) increased by 3 % for the monochromator and the diode-array instrument and by 6 % for the MEMS device;and the SEP(c) decreased by 3 % in the three instruments). It is worth noting that while the monochromator and diode-array instruments displayed similar predictive capacity for the parameters tested, the MEMS instrument achieved slightly poorer results but has clear advantages for the measurement of texture in intact asparagus, being economical, portable, and easy to use in situ.

关键词： In situ NIRS sensors MEMS technology Intact green asparagus Texture parameters local algorithm

来源：评论

学校读者我要写书评

暂无评论

Developing universal models for the prediction of physical quality in citrus fruits analysed on-tree using portable NIRS sensors

引用

BIOSYSTEMS ENGINEERING 2017年 153卷 140-148页

作者： Torres, Irina Perez-Marin, Dolores De la Haba, Maria-Jose Sanchez, Maria-Teresa Univ Cordoba Dept Bromathol & Food Technol Campus Rabanales E-14071 Cordoba Spain Univ Cordoba Dept Anim Prod Campus Rabanales E-14071 Cordoba Spain

The citrus sector seeks rapid, economical, environmentally-friendly and non-destructive technologies for monitoring external and internal changes in physical quality taking place in fruit during on-tree growth, thus allowing fruit quality to be evaluated at any stage of fruit development. The use of portable near-infrared spectroscopy (NIRS) sensors based on micro-electro-mechanical system (MEMS) technology, in conjunction with chemometric data treatment models, has already been studied for quality-control purposes in two citrus species: oranges and mandarins. The critical challenge is to develop robust and accurate universal models based on hundreds of highly heterogeneous citrus samples in order to design quality prediction models applicable to all fruits belonging to the genus Citrus, rather than models that can only be applied successfully to a single citrus species. This study evaluated and compared the performance of Modified Partial Least Squares (MPLS) and local regression algorithms for the prediction of major physical-quality parameters in all citrus fruits. Results showed that, while models developed using both linear (MPLS) and non-linear regression techniques (local) yielded promising results for the on-tree quality evaluation of citrus fruits, the local algorithm additionally increased the predictive capacity of models constructed for all the main parameters tested. These findings confirm that NIRS technology, used in conjunction with large databases and local regression strategies, increases the robustness of models for the on-tree prediction of citrus fruit quality;this will undoubtedly be of benefit to the citrus industry. (c) 2016 IAgrE. Published by Elsevier Ltd. All rights reserved.

关键词： NIRS Citrus Physical quality Universal models MPLS regression local algorithm

来源：评论

学校读者我要写书评

暂无评论

Entropy and expansion

引用

ANNALES DE L INSTITUT HENRI POINCARE-PROBABILITES ET STATISTIQUES 2020年第4期56卷 2428-2444页

作者： Csoka, Endre Harangi, Viktor Virag, Balint MTA Alfred Renyi Inst Math Budapest Hungary Univ Toronto Dept Math Toronto ON Canada

Shearer's inequality bounds the sum of joint entropies of random variables in terms of the total joint entropy. We give another lower bound for the same sum in terms of the individual entropies when the variables are functions of independent random seeds. The inequality involves a constant characterizing the expansion properties of the system. Our results generalize to entropy inequalities used in recent work in invariant settings, including the edge-vertex inequality for factor-of-IID processes, Bowen's entropy inequalities, and Bollobas's entropy bounds in random regular graphs. The proof method yields inequalities for other measures of randomness, including covariance. As an application, we give upper bounds for independent sets in both finite and infinite graphs.

关键词： Entropy inequality Expansion Cheeger constant Graph isoperimetry Factor-of-IID local algorithm Independent set

来源：评论

学校读者我要写书评

暂无评论

Fragmentary Structures in Discrete Optimization Problems

引用

CYBERNETICS AND SYSTEMS ANALYSIS 2017年第6期53卷 931-936页

作者： Kozin, I. V. Maksyshko, N. K. Perepelitsa, V. A. Zaporizhzhya Natl Univ Zaporizhzhya Ukraine

The paper considers a combinatorial object (a fragmentary structure) and investigates the properties of this object. It is shown that a number of discrete optimization problems can be considered as optimization problems on a fragmentary structure. Optimization problem reduces to an unconditional combinatorial optimization problem on a set of permutations. Variants of algorithms to find approximate solutions for optimization problems of fragmentary structure are proposed.

关键词： discrete optimization fragmentary structure local algorithm evolutionary algorithm ant algorithm

来源：评论

学校读者我要写书评

暂无评论

Dynamic Representations of Sparse Distributed Networks: A locality-sensitive Approach

引用

ACM TRANSACTIONS ON PARALLEL COMPUTING 2021年第1期8卷 1–26页

作者： Kaplan, Haim Solomon, Shay Tel Aviv Univ IL-69978 Tel Aviv Israel

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 several dynamic graph algorithms, including adjacency queries and labeling schemes, maximal and approximate matching, approximate vertex cover, forest decomposition, and distance oracles. 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, and hence local memory usage at the vertices, which is 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 all 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 strict limitation on the local memory, 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. Such a non-local scheme may be prohibitively expensive in

关键词： arboricity distributed network dynamic graph algorithm edge orientation local algorithm

来源：评论

学校读者我要写书评

暂无评论

BILEVEL OPTIMIZATION PROBLEMS OF DISTRIBUTION OF INTERBUDGETARY TRANSFERS UNDER GIVEN LIMITATIONS

引用

CYBERNETICS AND SYSTEMS ANALYSIS 2019年第6期55卷 905-913页

作者： Sergienko, I. V. Semenova, N. V. Semenov, V. V. Natl Acad Sci Ukraine VM Glushkov Inst Cybernet Kiev Ukraine

The problems of optimal distribution of transfers within given budget limitations are formulated and analyzed. The mathematical model is presented as a bilevel linear optimization problem that contains linear problems of integer optimization at the lower level. Both optimistic and pessimistic versions of the problem are considered. Far the approximate solution of optimistic version, the algorithm of finding local solutions for parametric lower-level integer programming problems on the basis of the method of directing neighborhoods is proposed. The auxiliary integer progrannning problem with Boolean variables of a higher level is solved bused on local algorithms.

关键词： bilevel optimization problem integer optimization parametric programming Boolean variables local algorithm

来源：评论

学校读者我要写书评

暂无评论

Diverse local calibration approaches for chemometric predictive analysis of large near-infrared spectroscopy (NIRS) multi-product datasets

引用

CHEMOMETRICS AND INTELLIGENT LABORATORY SYSTEMS 2024年 251卷

作者： Yang, Xueping Yang, Fuyu Lesnoff, Matthieu Berzaghi, Paolo Ferragina, Alessandro China Agr Univ Coll Grassland Sci & Technol Beijing 100193 Peoples R China Guizhou Univ Coll Anim Sci Guiyang 550025 Peoples R China Univ Padua Dept Anim Med Prod & Hlth I-35020 Legnaro Italy GraiNit Srl I-35020 Padua Italy Univ Montpellier Inst Agro SELMET CIRADINRAe F-34090 Montpellier France CIRAD UMR SELMET F-34090 Montpellier France ChemHouse Res Grp F-34000 Montpellier France Univ Parma Dept Vet Sci I-43126 Parma Italy

This study aimed to assess the predictive accuracy of Near-Infrared Spectroscopy (NIRS) across a large multiproduct library, employing novel local calibration methodologies. Three local strategies were examined: local algorithm, locally Weighted Regression predicted on k-nearest neighbor selection (kNN-LWPLSR), along with a newly proposed algorithm within this study called Hybrid local. These strategies were applied to an extensive multi-product dataset. When compared with Global PLS models, the results exhibited significant reductions in RMSEP values for all local strategies. Particularly, the kNN-LWPLSR demonstrated proficient prediction for the constituents of ADF and DM. The newly proposed method [Hybrid local] exhibits comparable performance to the local algorithm;however, it notably reduces the prediction time by half compared to the latter, representing a significant advancement for the practical implementation of NIRS technology within industrial processing scenarios.

关键词： Near infrared spectroscopy (NIRS) Chemometrics local calibration Large multi -products dataset local algorithm

来源：评论

学校读者我要写书评

暂无评论

A self-adaptive local metric learning method for classification

引用

PATTERN RECOGNITION 2019年 96卷 106994-000页

作者： Taheri, Mahsa Moslehi, Zahra Mirzaei, Abdolreza Safayani, Mehran Isfahan Univ Technol Dept Elect & Comp Engn Esfahan *** Iran

Measuring distance among data point pairs is a necessary step among numerous counts of algorithms in machine learning, pattern recognition and data mining. In the local perspective, the emphasis of all existing supervised metric learning algorithms is to shrink similar data points and to separate dissimilar ones in the local neighborhoods. This provides learning more appropriate distance metric in dealing with the within-class multi modal data. In this article, a new supervised local metric learning method named Self-Adaptive local Metric Learning Method (SA-LM2) has been proposed. The contribution of this method is in five aspects. First, in this method, learning an appropriate metric and defining the radius of local neighborhood are integrated in a joint formulation. Second, unlike the traditional approaches, SA-LM2 learns the parameter of local neighborhood automatically thorough its formulation. As a result, it is a parameter free method, where it does not require any parameters that would need to be tuned. Third, SA-LM2 is formulated as a SemiDefinite Program (SDP) with a global convergence guarantee. Fourth, this method does not need the similar set S, the focus here is on local areas' data points and their separation from dissimilar ones. Finally, results of SA-LM2 are less influenced by noisy input data points than the other compared global and local algorithms. Results obtained from different experiments indicate the outperformance of this algorithm over its counterparts. (C) 2019 Elsevier Ltd. All rights reserved.

关键词： Supervised metric learning Linear metric learning local algorithm Neighborhood learning Multimodal data

来源：评论

学校读者我要写书评

暂无评论

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

引用

Procedia Computer Science 2021年 195卷 108-117页

作者： Lucas Böltz Benjamin Becker Hannes Frey Department of Computer Science University of Koblenz-Landau Koblenz Germany Multimedia Communications Lab Technical University of Darmstadt 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.

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

来源：评论

学校读者我要写书评

暂无评论

Freedom of speech for all critically ill patients: work in progress

引用

CRITICAL CARE 2017年第1期21卷 1-2页

作者： Tuinman, P. R. ten Hoorn, S. VU Univ Med Ctr Amsterdam Dept Intens Care Med & Res VUmc Intens Care REVIV Room ZH-7D-166De Boelelaan 1117POB 7057 NL-1007 MB Amsterdam Netherlands VU Univ Med Ctr Amsterdam Inst Cardiovasc Res VU ICaR VU Amsterdam Netherlands

See related Letter by Sutt et al., https://***/articles/10.1186/s13054-016-1588-7 and related Letter by Egbers et al., https://***/articles/10.1186/s13054-016-1587-8

关键词： local algorithm Speech Enhancement Cuff Deflation Simple Communication Intensive Care Unit Staff

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：