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.     

Secure image encryption scheme using 4D-Hyperchaotic systems based reconfigurable pseudo-random number generator and S-Box

This paper introduces the design of a hardware efficient reconfigurable pseudorandom number generator (PRNG) using two different feedback controllers based four-dimensional (4D) hyperchaotic systems i.e. Hyperchaotic-1 and -2 to provide confidentiality for digital images. The parameter's value of these two hyperchaotic systems is set to be a specific value to get the benefits i.e. all the multiplications (except a few multiplications) are performed using hardwired shifting operations rather than the binary multiplications, which doesn't utilize any hardware resource. The ordinary differential equations (ODEs) of these two systems have been exploited to build a generic architecture that fits in a single architecture. The proposed architecture provides an opportunity to switch between two different 4D hyperchaotic systems depending on the required behavior. To ensure the security strength, that can be also used in the encryption process in which encrypt the input data up to two times successively, each time using a different PRNG configuration. The proposed reconfigurable PRNG has been designed using Verilog HDL, synthesized on the Xilinx tool using the Virtex-5 (XC5VLX50T) and Zynq (XC7Z045) FPGA, its analysis has been done using Matlab tool. It has been found that the proposed architecture of PRNG has the best hardware performance and good statistical properties as it passes all fifteen NIST statistical benchmark tests while it can operate at 79.101-MHz or 1898.424-Mbps and utilize only 0.036 %, 0.23 %, and 1.77 % from the Zynq (XC7Z045) FPGA's slice registers, slice LUTs, and DSP blocks respectively. Utilizing these PRNGs, we design two 16 × 16 substitution boxes (S-boxes). The proposed S-boxes fulfill the following criteria: Bijective, Balanced, Non-linearity, Dynamic Distance, Strict Avalanche Criterion (SAC) and BIC non-linearity criterion. To demonstrate these PRNGs and S-boxes, a new three different scheme of image encryption algorithms have been developed: a) Encryption using S-box-1, b) Encryption using S-box-2 and, c) Two times encryption using S-box-1 and S-box-2. To demonstrate that the proposed cryptosystem is highly secure, we perform the security analysis (in terms of the correlation coefficient, key space, NPCR, UACI, information entropy and image encryption quantitatively in terms of (MSE, PSNR and SSIM)).     

基于信息熵抑制的大数据特征隐匿性加密仿真

针对传统大数据特征加密方法中大数据精度较差、加密耗时较长的问题,提出基于信息熵抑制的大数据特征隐匿性加密方法。分析信息熵抑制相关理论,采用信息熵映射函数对大数据分类,将信息熵抑制过程转化为计算2个文件相似性的过程,并根据余弦相似度公式以及Hamming距离值计算数据相似度,完成数据消冗。在完成数据消冗的基础上,分析分组密码方法和ECC加密方法,结合两种方法得到大数据特征隐匿性加密处理计算公式,实现基于信息熵抑制的大数据特征隐匿性加密。实验研究结果表明,所提方法能够有效去除冗余数据,提升大数据精度,加快数据加密的处理速度,高效完成大数据加密过程。     

高效可撤销的身份基在线离线加密方案

身份基加密（IBE）需要提供一种有效的成员撤销机制，然而，现有可撤销成员的IBE方案存在密钥更新和加密运算量过大的问题，可能使执行该操作的设备成为系统的瓶颈。将完全子树方法和在线离线技术相结合，通过修改指数逆类型IBE的密钥生成和加密算法，提出了一种高效可撤销的身份基在线离线加密方案。方案利用完全子树方法生成更新钥，使得撤销用户无法获得更新钥，进而失去解密能力；利用在线离线技术，将大部分加密运算在离线阶段进行预处理，使得在线阶段仅执行少量简单计算即可生成密文。与相关知名方案相比，该方案不仅提高密钥生成中心的密钥更新的效率，而且极大减少了轻量级设备的在线加密工作量，适合于轻量级设备保护用户隐私信息。     

适用于无线体域网的动态口令认证协议

无线体域网中传输的是与生命高度相关的敏感数据，身份认证是信息安全保护的第一道防线。现有的基于人体生物信息的身份认证方案存在信息难提取、偶然性大和误差性大的问题，基于传统密码学的认证方案需较大计算资源和能量消耗，并不适用于无线体域网环境。为此，在动态口令和非对称加密机制基础上，提出一种适用于无线体域网的动态口令双向认证轻量协议，并对其进行形式化分析。通过理论证明、SVO逻辑推理及SPIN模型检测得出：该协议满足双向认证，且能够抵御重放攻击、伪装攻击、拒绝服务器攻击和口令离线攻击，具有较高安全性。     

基于LoRa物联网技术的智能照明控制方案在高速公路上的应用——以北京新机场高速公路(南五环-北京新机场)为例

文章结合北京新机场高速公路照明工程实例,阐述了常规照明控制系统的现状,分析了基于新兴的LoRa物联网技术智能照明控制方案的系统原理和系统构成、系统在高速公路智能照明控制领域的应用以及系统应用能达到的节能和管理效益的提升效果,并对系统的扩展应用前景做了研究分析。     

New version of continuous–discrete cubature Kalman filtering for nonlinear continuous–discrete systems

For nonlinear continuous–discrete systems, this paper elaborates a new accurate implementation of continuous–discrete cubature Kalman filter (CD-CKF). As the main contribution of this work, the new Kalman prediction stage begins by integrating the nonlinear continuous model for all the cubature sample vectors; the prior estimate state and covariance prediction are based on the weighted statistics of these integrated cubature sample vectors and the Gauss–Legendre approximation scheme. The new square root form CD-CKF is also derived and accurately implemented by combining with the modified variable stepsize NIRK. As the advantages of proposed approach, the complicated and error-prone processes of solving covariance differential equation or calculating derivatives are avoided, while the positive semi-definiteness of prior error covariance are numerically guaranteed. Simulations of traffic control scenarios further confirm the new approach’s superior filtering performance in both reliability and accuracy.     

基于ATP-ABE的访问控制方案

对访问控制机制中存在的安全性和有效性的问题进行了研究，提出了基于访问树剪枝的属性加密ATP-ABE（Access Tree Pruning Attribute Based Encryption）的访问控制方案。当ATP-ABE算法需要访问它的树型结构访问策略时，通过剪枝处理访问树结构中包含用户ID属性节点的分支，提高了用户所有者DO（Data Owner）管理和控制属性的效率，更加有效地实现了数据共享。还为访问树结构设计了许可访问属性，使DO仍保留共享数据的关键属性，并且能够完全控制它们的共享数据。基于决策双线性密钥交换算法DBDH（Decisional Bilinear Diffie-Hellman）假设分析了ATP-ABE方案的安全性，研究结果表明与两种经典ABE方案比较，ATP-ABE更加有效地减少了算法的系统设置、私钥生成、密文大小、用户属性撤销以及加解密过程中的计算开销，并给出了定量结论。     

Distribution-free composite Shewhart-GWMA Mann-Whitney charts for monitoring the process location

The Mann-Whitney (MW) statistic is one of the most recommended two-sample statistical tests when the assumption of normality fails to hold due to its robustness and fascinating properties especially when small sample sizes are involved. In order to improve the sensitivity of the generally weighted moving average (GWMA) monitoring scheme toward the detection of large shifts, in this paper, a new distribution-free phase II composite Shewhart-GWMA (CSG) scheme is proposed using the MW U statistic. The performance of the proposed scheme is investigated using the average run-length (ARL) and average extra quadratic loss (AEQL) values through extensive simulations. The performance of this newly proposed monitoring scheme is found to be superior when compared to numerous memory-type MW schemes (some existing and others introduced in this paper) in many situations. An illustrative example is given to demonstrate the implementation of the CSG MW U scheme using real-life data.     

Option pricing under a jump-telegraph diffusion model with jumps of random size

ABSTRACT

We present a finite difference method to solve a system of two Partial-Integro Differential Equations which arise from pricing an option under a Jump-Telegraph Diffusion Model for the underlying asset, considering the risk-neutral valuation formula under an equivalent martingale measure. This system is fully discretized using an Implicit–Explicit two-time level scheme and quadrature formulas. The resulting two tridiagonal algebraic linear systems are solved recursively using the Thomas Algorithm. Some numerical results are presented and the numerical order of convergence for the method is estimated. Finally, the robustness of the method is validated against an exact solution obtained for a perturbed problem.