Drying with Chemical Reaction in Cocoa Beans

Desirable flavor qualities of cocoa are dependent on how the cocoa beans are fermented, dried, and roasted. During fermentation and drying, polyphenols such as leucocyanidin and apecatechin are oxidized by polyphenols oxidase to form o-quinone, which later react nonenzymatically with a hydroquinone in a condensation reaction to form browning products and moisture. The objective of this article is to model the cocoa beans drying together with the browning reaction. A Luikov drying model for the moisture and a simple Fick's law diffusion model combined with first-order reactions for both the enzymatic oxidation and nonenzymatic condensation reactions were constructed. Both models were used to identify moisture diffusivity coefficient and total polyphenols diffusivity in cocoa beans from experimental drying and polyphenols degradation data and published kinetic data of the reactions. The theoretical drying model fitted the experimental cocoa bean drying curves with low mean square of residuals. The polyphenols diffusion and reaction model also fitted the experimental polyphenols degradation curves with minimum mean residual squares. The rate of polyphenols degradation in the cocoa beans increases at higher temperature and higher relative humidity. This is because the increasing reaction rate of polyphenols oxidation reaction as well as higher moisture diffusion at higher relative humidity and temperature. The effective moisture diffusivity in cocoa beans is estimated to be between 8.194 × 10^-9 and 8.542 × 10^-9 m²·s^-1, which is of the same order of magnitude as published data. The effective total polyphenols diffusivity is estimated to be between 8.333 × 10^-12 to 1.000 × 10^-11 m²·s^-1 with minimum mean residual squares. It is three orders of magnitude less than the estimated moisture diffusivity because of the larger polyphenols molecules. The estimated polyphenols diffusivity is very close to those published in the literature for sorption and ultrafiltration processes.     

SiH_4－O_2体系LPCVD SiO_2薄膜的工艺及其应用

本文研究了ＳｉＨ４—Ｏ２体系ＬＰＣＶＤＳｉＯ２的工艺及设备。为了得到厚度均匀性好的薄膜，改进了反应气体的进气方式和装片舟的结构，获得了每炉１００片、直径为１００ｍｍ的硅片的膜厚不均匀性≤士５％的结果。     

火箭弹道附近大气参数辨识系统的研究

研究了利用雷达实测数据对沿火箭飞行弹道的大气参数进行辨识和外推落点的方法，进而提出了一个对效力射诸元进行修正的方法。在此基础上，对软件系统进行了设计。最后通过仿真试验，分析了系统的准确性。     

乳状液膜法制备草酸稀土

系统研究了在乳状液膜内水相直接制备草酸稀土的方法，讨论了内水相草酸浓度、表面活性剂浓度、载体浓度、外水相酸度和外水相稀土浓度对迁移率的影响，找到了制备草酸稀土的最佳条件，草酸稀土经灼烧所得的氧化物含ＲＥ２Ｏ３〉９９．５％，与萃取法相比，此方法具有成本低、能耗少、污染程度低的特点，具有工业化前景。     

筒形件反旋工艺塑性流动刚塑性有限元分析

建立了筒形件反旋工艺平面变形刚塑性有限元分析的力学模型，比较了把反旋工艺视为正挤和本文力学模型条件下的速度场，有限元分析结果与反旋实际条件相符。     

带平衡约束矩形布局优化问题的深度强化学习算法

带平衡约束的矩形布局问题源于卫星舱设备布局设计,属于组合优化问题。深度强化学习利用奖赏机制,通过数据训练实现高性能决策优化。针对布局优化问题,提出一种基于深度强化学习的新算法DAR及其扩展算法IDAR。DAR用指针网络输出定位顺序,再利用定位机制给出布局结果,算法的时间复杂度是O（n³）;IDAR算法在DAR的基础上引入迭代机制,算法时间复杂度是O（n⁴）,但能给出更好的结果。测试表明DAR算法具有较好的学习能力,用小型布局问题进行求解训练所获得的模型,能有效应用在大型问题上。在两个大规模典型算例的对照实验中,提出算法分别超出和接近目前最优解,具有时间和质量上的优势。     

Fracture mechanics of a shaft-loaded blister of thin flexible membrane on rigid substrate

A shaft-loaded blister test has been developed to measure the interfacial energy W of a thin flexible polymeric film adhered to a rigid substrate. A theoretical analysis is given of an axisymmetric debond (blister) in terms of an external applied load P, tensile stretching modulus E and thickness h of the adhering layer. The fracture mechanics model presented considers both elastic and elastoplastic deformations in the thin film. The intrinsic stable interface debonding process provides an attractive alternative to the conventional adhesion measurement techniques.     

多对象同步检测的新型气密测试仪设计

为了解决传统和当前大部分检漏仪一次仅能对一个测试对象进行检测的问题,对一种多对象同步检测的差压式气密测试仪进行了设计;该气密测试仪以基于ARM9的控制系统为主机端,以基于AVR的4个检测系统为采集端,通过独立的RS485串口通讯,完成控制系统与多个检测系统的信息交互;在此基础上,结合Linux操作系统的多线程机制、单片机和Qt/Embedded编程技术,建立完整的仪器检测控制软件系统,实现了多个测试对象进行同步检漏的功能;与普通的检漏仪相比,仪器的泄漏测试效率和自动化程度得到显著地提高,同时具有高精度高稳定性的特点,更适合在批量生产中使用。     

A new look at software piracy: Soft lifting primes an inauthentic sense of self,prompting further unethical behavior

Soft lifting refers to the process whereby a legally licensed software program is installed or copied in violation of its licensing agreement. Previous research on this pervasive kind of unethical computer use has mainly focused on the determinants of this unethical act, which are rooted in personal, economic, technological, cultural, socio-political, or legal domains. However, little is known about the symbolic power that soft lifting has on the sense of self. Based on recent advances in behavioral priming, we hypothesized that soft lifting can influence the signals one sends to oneself; more specifically, soft lifting may prime individuals to experience an inauthentic sense of self, which, in turn, prompts further unethical behavior. In Study 1, we showed that participants, primed with the memory of a recent soft lifting experience, cheated more than participants recalling a recent experience of purchasing authentic software or than control participants. Moreover, feelings of inauthenticity mediated the priming effect of soft lifting on dishonest behavior. In Study 2, participants primed with soft lifting showed a greater willingness to purchase a wide range of counterfeit products over authentic products. Besides those antecedents or correlates of soft lifting already identified in the literature, educators should pay more attention to the negative impact of soft lifting on the self-images of users, which may go beyond computer-related behaviors. Priming may provide a new direction for HCI researchers to examine the impact of computer-use-related factors on users' perceptions, motivations, and behaviors.     

Designing linear distributed algorithms with memory for fast convergence

Motivated by both distributed computation and decentralized control applications, we studied the distributed linear iterative algorithms with memory. Specifically, we showed that the system of linear equations G x = b can be solved through a distributed linear iteration for arbitrary invertible G using only a single memory element at each processor. Further, we demonstrated that the memoried distributed algorithm can be designed to achieve much faster convergence than a memoryless distributed algorithm. Two small simulation examples were included to illustrate the results. Copyright © 2011 John Wiley & Sons, Ltd.