Breeding schemes with optimum-contribution selection or truncation selection for beef cattle destined for use on dairy females

We tested the hypothesis that the size of a beef cattle population destined for use on dairy females is smaller under optimum-contribution selection (OCS) than under truncation selection (TRS) at the same genetic gain (ΔG) and the same rate of inbreeding (ΔF). We used stochastic simulation to estimate true ΔG realized at a 0.005 ΔF in breeding schemes with OCS or TRS. The schemes for the beef cattle population also differed in the number of purebred offspring per dam and the total number of purebred offspring per generation. Dams of the next generation were exclusively selected among the one-year-old heifers. All dams were donors for embryo transfer and produced a maximum of 5 or 10 offspring. The total number of purebred offspring per generation was: 400, 800, 1,600 or 4,000 calves, and it was used as a measure of population size. Rate of inbreeding was predicted and controlled using pedigree relationships. Each OCS (TRS) scheme was simulated for 10 discrete generations and replicated 100 (200) times. The OCS scheme and the TRS scheme with a maximum of 10 offspring per dam required approximately 783 and 1,257 purebred offspring per generation to realize a true ΔG of €14 and a ΔF of 0.005 per generation. Schemes with a maximum of 5 offspring per dam required more purebred offspring per generation to realize a similar true ΔG and a similar ΔF. Our results show that OCS and multiple ovulation and embryo transfer act on selection intensity through different mechanisms to achieve fewer selection candidates and fewer selected sires and dams than under TRS at the same ΔG and a fixed ΔF. Therefore, we advocate the use of a breeding scheme with OCS and multiple ovulation and embryo transfer for beef cattle destined for use on dairy females because it is favorable both from an economic perspective and a carbon footprint perspective.     

A charge sharing–based switching scheme for SAR ADCs

This paper presents an energy-efficient switching scheme for successive approximation register (SAR) analogue-to-digital converter (ADC). The proposed scheme employs charge recycling method to keep the capacitor arrays free of transitional energy between bit generations except reset phase. In comparison with the conventional switching scheme, the proposed one achieves 100% transitional energy saving without considering reset phase. In addition, configuration of a 10-bit SAR ADC shows that the proposed switching scheme reduces the capacitor area by 25% compared with the conventional switching scheme.     

Reducing numerical dissipation in smoke simulation

Numerical dissipation acts as artificial viscosity to make smoke viscous. Reducing numerical dissipation is able to recover visual details smeared out by the numerical dissipation. Great efforts have been devoted to suppress the numerical dissipation in smoke simulation in the past few years. In this paper we investigate methods of combating the numerical dissipation. We describe visual consequences of the numerical dissipation and explore sources that introduce the numerical dissipation into course of smoke simulation. Methods are investigated from various aspects including grid variation, high-order advection, sub-grid compensation, invariant conservation, and particle-based improvement, followed by discussion and comparison in terms of visual quality, computational overhead, ease of implementation, adaptivity, and scalability, which leads to their different applicability to various application scenarios.     

CSTN-LCD用铬版清洗效果的改善

利用铬版清洗机对CSTN-LCD用铬版进行清洗处理,分析了清洗过程中出现的铬层脱落现象,铬层脱落与轴向喷射压力和水平切力密切相关,通过调整转速和喷射压力探索了安全使用条件:在转速不超过1000r/min,喷射压力低于0.5×105Pa的情况下使用铬版清洗机进行清洗是相对安全的。同时采用预清洗处理的方法满足清洁要求,使换线时间由平均3h缩短到平均1h以内,年产能提高270000片。     

牛奶加工过程中的清洗(二)

五．牛奶厂的清洗。目前，牛奶厂采用的清洗方式主要是CIP清洗(Cleaning in place)，原地清洗或称定置清洗，即在基本不拆卸或挪动机械装置和管线的情况下对生产过程中能与牛奶发生接触的设备表面进行的清洗。其冲刷、清洗、灭菌的整个过程全部实现了自动化因此大大降低了劳动强度。而有一些不     

Nonreactive atom/molecule-surface scattering within the finite basis wave packet method

A quantum wave packet code for studying nonreactive scattering of closed-shell atoms or diatomic molecules from a rigid surface is described. The time evolution relies on the Chebychev propagator. Up to 5 collider degrees of freedom, 3 in translation and 2 in rotation, are treated in a pseudospectral way with the momentum or finite basis representation as the primary space. Potential matrix elements are efficiently evaluated by means of sequential 1D transformations between momentum and coordinate spaces. Fast Fourier transforms are performed for the translational and azimuthal coordinates whereas a Gauss-Legendre transform is used for the polar coordinate. This pseudospectral strategy minimizes memory requirements because no off-diagonal Hamiltonian matrix elements need to be stored. In addition, a wide variety of physical systems can be studied since no particular functional form is imposed for the interaction potential.     

蒸汽减压站自控系统的巧设计

蒸汽是石油化工装置中最重要的物料。随着石油化工工业的迅猛发展 ,蒸汽在其中扮演着越来越重要的多重角色。因此 ,对蒸汽系统的平稳控制 ,对石油化工生产装置平稳、高效地运行是至关重要的。传统的蒸汽减压站自控系统基建投资大 ,紧急情况下靠人工手动操作稳定蒸汽压力系统 ,往往造成生产的波动或大面积的停车。针对传统蒸汽减压站自控系统的弱点 ,提出蒸汽减压站自控系统的优化设计方案 ,该方案得以在大型生产装置成功应用。新方案不但节省了大量的基建投资 ,而且取得了良好的生产效益     

浅析6063铝型材表面“铝丝印”的成因与对策

在介绍“铝丝印”概念的基础上，从金属腐蚀学的观点出发，分析了“铝丝印”形成的电化学腐蚀机理，并提出了具体的解决措施。     

挖金湾矿近距离煤层联合布置开采可行性研究

提出挖金湾矿近距离煤层联合布置开采方案，并对开采方案的技术难点进行了分析，找出了解决方法。     

Efficient similarity-based operations for data integration

Dealing with discrepancies in data is still a big challenge in data integration systems. The problem occurs both during eliminating duplicates from semantic overlapping sources as well as during combining complementary data from different sources. Though using SQL operations like grouping and join seems to be a viable way, they fail if the attribute values of the potential duplicates or related tuples are not equal but only similar by certain criteria. As a solution to this problem, we present in this paper similarity-based variants of grouping and join operators. The extended grouping operator produces groups of similar tuples, the extended join combines tuples satisfying a given similarity condition. We describe the semantics of this operator, discuss efficient implementations for the edit distance similarity and present evaluation results. Finally, we give examples of application from the context of a data reconciliation project for looted art.