Crack Development in Individually Quick Frozen Cut and Peel Carrots

ABSTRACT:  Crack development during freezing (CDF) is one of the major challenges in individually quick frozen (IQF) cut and peel carrot processing. The effects of processing and freezer storage on crack development were examined on the cut and peel carrot variety, Sugarsnax. Carrot samples were removed from the major processing steps, the trans-slicer, the shaper, the blancher, and the dryer, and examined for crack development by measuring percentage cracked, crack morphology, total soluble solids, moisture levels, and membrane injury index immediately after processing. These parameters were also examined following 20 wk of standard freezer storage for cut and peels. Approximately 2% of nonprocessed carrots were cracked compared to 45% of carrots after the initial trans-slicing stage. As the processing continued, cracking decreased due to the removal of the outer epidermis to 16% of the finished product. This suggests that CDF was initiated at the 1st processing stage. Crack width and depth were 2.3 and 2.6 mm, respectively, at the trans-slicer stage and decreased to 1.1 and 1.8 mm at the end of the line. It was found that CDF was further exacerbated by freezer storage due to inefficient water removal at the dryer stage. Crack width and depth increased to 1.5 and 3.0 mm after 20 wk for freezer storage. Root size also played a role in CDF, suggesting that larger pieces are more susceptible to crack development. Total soluble solid concentrations did not play a role in crack formation during cut and peel processing.     

Index of critical points in rational l-approximation

This article is concerned with the l²-approximation of a given transfer function f by a rational one whose order is prescribed. We show that the sum of the indices of the critical points of the criterion is generically equal to 1, and in particular does not depend on f.     

Structural reliability optimization using an efficient safety index calculation procedure

The objective of this paper is to conduct reliability-based structural optimization in a multidisciplinary environment. An efficient reliability analysis is developed by expanding the limit functions in terms of intermediate design variables. The design constraints are approximated using multivariate splines in searching for the optimum. The reduction in computational cost realized in safety index calculation and optimization are demonstrated through several structural problems. This paper presents safety index computation, analytical sensitivity analysis of reliability constraints and optimization using truss, frame and plate examples.     

激光探针监测半导体器件内自由载流子浓度调制效应

介绍了基于自由载流子对介质折射率调制作用,而建立的监测半导体器件内自由载流子变化情况的实验装置,该装置能实时反映自由载流子变化情况,且对原电路无任何影响。本方法适用于硅和砷化镓材料的电子和光电子器件,也显示了在测量集成电路内部有源器件特性方面的潜在应用前景。     

分布式协作工作流技术研究

工作流是实现企业业务过程建模、优化、管理、集成和自动化的核心技术．作为分布式的应用平台，工作流管理系统任务处理能力即吞吐能力是一个重要的性能指标．目前，已有的工作流管理系统在这方面存在较大的不足，成为工作流管理系统广泛应用的严重障碍．本文研究了工作流系统的协作方式和负载平衡技术，定义了工作流系统的负载因子，给出了一个分布式协作工作流系统模型，并结合业务流程逻辑，提出了分布式协作工作流系统负载平衡调度算法．实验表明该分布式协作工作流系统有效地扩展了单个工作流系统的吞吐能力。     

依纳Ⅴ型牵伸机构的优化设计

对细纱机依纳Ⅴ型牵伸机构进行了优化设计，通过在后牵伸区增加一附加压力棒，对牵伸效果有了较大幅度的提高，并对其产生的毛羽增多的弊病采取了有效措施。     

迭加与量化水印嵌入方案的比较及量化参数优化

分别研究了迭加法和量化法的隐蔽性和稳健性，并且提出了量化调制水印方案中的参数优化方法。对两类方法的分析比较表明，迭加法适用于在高频分量嵌入水印，而量化法适用于在低频分量嵌入水印。并以实验验证了这一结论。     

生态省生态市及生态县标准研究

生态省、生态市、生态县建设的实质是可持续发展能力建设。其主要内容包括生态经济、生态环境和生态社会三个方面，文章建立的标准基本上反映这三个方面的建设现状和发展潜力。生态省标准由5项基本条件和22项考核指标组成；生态市标准由5顶基本条件和30项考核指标组成；生态县标准由5项基本条件和38项考核指标组成。适用于不同规模、不同区域生态省、市、县建设的标准，同时也可以做为引导生态省、市、县建设的方向和目标。     

马尔柯夫链预测法在证券指数预测中的应用

介绍马尔柯夫链预测法的模糊模型，该模型以集合的模糊划分为依据摒弃了清晰划分的不足．从而保证预测结果的精确性。将该模型应用在证券指数的预测上，取得了绝对误差、相对误差较小的结果。     

Evaluate the performance of a stochastic-flow network with cost attribute in terms of minimal cuts

This paper proposes a performance index to measure the quality level of a stochastic-flow network in which each node has a designated capacity, which will have different lower levels due to various partial and complete failures. The performance index is the probability that the maximum flow of the network equals the demand d without exceeding the budget b. A simple algorithm in terms of minimal cuts is first proposed to generate all upper boundary points for (d, b), and then the probability that the maximum flow is less than or equal to d can be calculated in terms of such points. The upper boundary point for (d, b) is a maximal vector representing the capacity of each arc such that the maximum flow of the network under the budget b is d. The performance index can be calculated by repeating the proposed algorithm to obtain all upper boundary point for (d−1, b). A benchmark example is shown to illustrate the solution procedure.