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.     

Transmission system restoration with co-optimization of repairs,load pickups,and generation dispatch

This paper studies the restoration of a transmission system after a significant disruption such as a natural disaster. It considers the co-optimization of repairs, load pickups, and generation dispatch to produce a sequencing of the repairs that minimizes the size of the blackout over time. The core of this process is a Restoration Ordering Problem (ROP), a non-convex mixed-integer nonlinear program that is outside the capabilities of existing solver technologies. To address this computational barrier, the paper examines two approximations of the power flow equations: The DC model and the recently proposed LPAC model. Systematic, large-scale testing indicates that the DC model is not sufficiently accurate for solving the ROP. In contrast, the LPAC power flow model, which captures line losses, reactive power, and voltage magnitudes, is sufficiently accurate to obtain restoration plans that can be converted into AC-feasible power flows. An experimental study also suggests that the LPAC model provides a robust and appealing tradeoff between accuracy and computational performance for solving the ROP.     

矿山地质环境恢复治理技术方法研究

自工业革命以来人类社会的发展和经济的建设就离不开对矿产资源的使用。我国自改革开放以来,经济得到了前所未有的飞速发展,人民的生活水平日益提高,但经济高速发展的背后,存在着对矿产资源过度开采和使用的问题。矿产资源的不合理开采和使用对原有的自然环境造成了严重的破坏,为了改善此现状,对矿山地质环境的恢复治理技术的研究就至关重要。本文就矿山地质恢复治理的意义进行阐述,进一步对其方法进行探究,最终提出有关的措施和方法。     

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.     

An interpretative structural modeling based network reconfiguration strategy for power systems

The network reconfiguration is an important stage of restoring a power system after a complete blackout or a local outage. Reasonable planning of the network reconfiguration procedure is essential for rapidly restoring the power system concerned. An approach for evaluating the importance of a line is first proposed based on the line contraction concept. Then, the interpretative structural modeling (ISM) is employed to analyze the relationship among the factors having impacts on the network reconfiguration. The security and speediness of restoring generating units are considered with priority, and a method is next proposed to select the generating unit to be restored by maximizing the restoration benefit with both the generation capacity of the restored generating unit and the importance of the line in the restoration path considered. Both the start-up sequence of generating units and the related restoration paths are optimized together in the proposed method, and in this way the shortcomings of separately solving these two issues in the existing methods are avoided. Finally, the New England 10-unit 39-bus power system and the Guangdong power system in South China are employed to demonstrate the basic features of the proposed method.     

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.     

Efficient Low Dissipative High Order Schemes for Multiscale MHD Flows, II: Minimization of ∇·B Numerical Error

An adaptive numerical dissipation control in a class of high order filter methods for compressible MHD equations is systematically discussed. The filter schemes consist of a divergence-free preserving high order spatial base scheme with a filter approach which can be divergence-free preserving depending on the type of filter operator being used, the method of applying the filter step, and the type of flow problem to be considered. Some of these filter variants provide a natural and efficient way for the minimization of the divergence of the magnetic field (∇·B) numerical error in the sense that commonly used divergence cleaning is not required. Numerical experiments presented emphasize the performance of the ∇·B numerical error. Many levels of grid refinement and detailed comparison of the filter methods with several commonly used compressible MHD shock-capturing schemes will be illustratedA condensed version appears in the Proceedings of the International Conference on High Performance Scientific Computing, March 10-14, 2003, Hanoi, Vietnam. This is a revised version of a longer internal report, Feb. 19, 2004. The longer internal report was published as a RIACS Technical Report TR03.10, July 2003, NASA Ames Research Center     

HFC电缆分配系统的建设与思考

结合沧州市网络的实际情况，主要分析HFC电缆分配系统双向传输改造的建设标准和实施方案。     

没有SDC的(t，n)门限秘密共享方案

利用椭圆曲线离散问题对数问题的难解性,给出了基于椭圆曲线密码体制的(t,n)门限秘密共享方案。基于门限秘密共享方案一般分为需要SDC和不需要SDC两类,在分布式环境下,一个被所有成员信任的SDC并不存在,不需要SDC的门限秘密共享方案的安全性得到很大的提高,该方案中由组成员共同生成群公钥和私有密钥。并给出了当新成员加入时,无SDC下的周期密钥分片的更新方案。还给出了一个本方案数据实例,最后对本方案的安全性进行了分析。