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.     

Prediction of mode I fracture toughness of rock using linear multiple regression and gene expression programming

Prediction of mode I fracture toughness (K_IC) of rock is of significant importance in rock engineering analyses. In this study, linear multiple regression (LMR) and gene expression programming (GEP) methods were used to provide a reliable relationship to determine mode I fracture toughness of rock. The presented model was developed based on 60 datasets taken from the previous literature. To predict fracture parameters, three mechanical parameters of rock mass including uniaxial compressive strength (UCS), Brazilian tensile strength (BTS), and elastic modulus (E) have been selected as the input parameters. A cluster of data was collected and divided into two random groups of training and testing datasets. Then, different statistical linear and artificial intelligence based nonlinear analyses were conducted on the training data to provide a reliable prediction model of K_IC. These two predictive methods were then evaluated based on the testing data. To evaluate the efficiency of the proposed models for predicting the mode I fracture toughness of rock, various statistical indices including coefficient of determination (R²), root mean square error (RMSE), and mean absolute error (MAE) were utilized herein. In the case of testing datasets, the values of R², RMSE, and MAE for the GEP model were 0.87, 0.188, and 0.156, respectively, while they were 0.74, 0.473, and 0.223, respectively, for the LMR model. The results indicated that the selected GEP model delivered superior performance with a higher R² value and lower errors.     

Looking ahead: Joint small group detection and tracking in crowd scenes

Small group detection and tracking in crowd scenes are basis for high level crowd analysis tasks. However, it suffers from the ambiguities in generating proper groups and in handling dynamic changes of group configurations. In this paper, we propose a novel delay decision-making based method for addressing the above problems, motivated by the idea that these ambiguities can be solved using rich temporal context. Specifically, given individual detections, small group hypotheses are generated. Then candidate group hypotheses across consecutive frames and their potential associations are built in a tree. By seeking for the best non-conflicting subset from the hypothesis tree, small groups are determined and simultaneously their trajectories are got. So this framework is called joint detection and tracking. This joint framework reduces the ambiguities in small group decision and tracking by looking ahead for several frames. However, it results in the unmanageable solution space because the number of track hypotheses grows exponentially over time. To solve this problem, effective pruning strategies are developed, which can keep the solution space manageable and also improve the credibility of small groups. Experiments on public datasets demonstrate the effectiveness of our method. The method achieves the state-of-the-art performance even in noisy crowd scenes.     

Improved error performance for generalised spatial modulation with enhanced spectral efficiency

The existing analytical average bit error rate (ABER) expression of conventional generalised spatial modulation (CGSM) does not agree well with the Monte Carlo simulation results in the low signal‐to‐noise ratio (SNR) region. Hence, the first contribution of this paper is to derive a new and easy way to evaluate analytical ABER expression that improves the validation of the simulation results at low SNRs. Secondly, a novel system termed CGSM with enhanced spectral efficiency (CGSM‐ESE) is presented. This system is realised by applying a rotation angle to one of the two active transmit antennas. As a result, the overall spectral efficiency is increased by 1 bit/s/Hz when compared with the equivalent CGSM system. In order to validate the simulation results of CGSM‐ESE, the third contribution is to derive an analytical ABER expression. Finally, to improve the ABER performance of CGSM‐ESE, three link adaptation algorithms are developed. By assuming full knowledge of the channel at the receiver, the proposed algorithms select a subset of channel gain vector (CGV) pairs based on the Euclidean distance between all CGV pairs, CGV splitting, CGV amplitudes, or a combination of these.     

一种新的多渐消因子容积卡尔曼滤波

将强跟踪思想引入容积卡尔曼滤波（cubature Kalman filter，CKF），建立强跟踪CKF能有效克服CKF在模型不确定、状态突变等情况下，滤波性能下降的问题。通过分析现有多渐消因子计算方法，发现它们均只利用了协方差矩阵的对角线元素，并没有考虑各个状态之间的相关性，不能充分发挥多渐消因子的优势。为此，本文提出渐消因子矩阵，基于正交原理推导渐消因子矩阵的求解方法，提出多渐消因子强跟踪CKF算法。多渐消因子强跟踪CKF算法突破了传统多渐消因子为向量的限制，也不再要求渐消因子取值要大于1。仿真验证了算法具有更好的滤波精度何鲁棒性，能更好的满足工程应用的要求。     

Bootstrap procedures for detecting multiple persistence shifts in heteroskedastic time series

This article proposes new bootstrap procedures for detecting multiple persistence shifts in a time series driven by non-stationary volatility. The assumed volatility process can accommodate discrete breaks, smooth transition variation as well as trending volatility. We develop wild bootstrap sup-Wald tests of the null hypothesis that the process is either stationary [I(0)] or has a unit root [I(1)] throughout the sample. We also propose a sequential procedure to estimate the number of persistence breaks based on ordering the regime-specific bootstrap p-values. The asymptotic validity of the advocated procedures is established both under the null of stability and a variety of persistence change alternatives. A comparison with existing tests that assume homoskedasticity illustrates the finite sample improvements offered by our methods. An application to OECD inflation rates highlights the empirical relevance of the proposed approach and weakens the case for persistence change relative to existing procedures.     

Utilizing sensor data to model students’ creativity in a digital environment

While creativity is essential for developing students’ broad expertise in Science, Technology, Engineering, and Math (STEM) fields, many students struggle with various aspects of being creative. Digital technologies have the unique opportunity to support the creative process by (1) recognizing elements of students’ creativity, such as when creativity is lacking (modeling step), and (2) providing tailored scaffolding based on that information (intervention step). However, to date little work exists on either of these aspects. Here, we focus on the modeling step. Specifically, we explore the utility of various sensing devices, including an eye tracker, a skin conductance bracelet, and an EEG sensor, for modeling creativity during an educational activity, namely geometry proof generation. We found reliable differences in sensor features characterizing low vs. high creativity students. We then applied machine learning to build classifiers that achieved good accuracy in distinguishing these two student groups, providing evidence that sensor features are valuable for modeling creativity.     

Studying local liquid velocity in liquid–solid packed bed using the newly developed X-ray DIR technique

Combination of X-ray Digital Industrial Radiography (DIR) and Particle Tracking Velocimetry (PTV) techniques for local liquid velocity measurement (V_LL) has been newly developed and successfully applied for trickle bed reactor (TBR). The technique was validated against newly developed fiber optical probe technique. This work attempts to highlight the applicability of this newly developed technique on a liquid–solid packed bed reactor. In this work, liquid was represented by water and solids were represented by EPS beads. The EPS beads were chosen because of its low density property. Three superficial liquid velocities (V_SL) were applied to the system. The experiment was replicated four times. The digital industrial radiography (DIR) consists of a complementary metal oxide semiconductor (CMOS) digital detector and X-ray source. Results of this work suggest that the technique has been successfully applied and comparable with previous work that has been done in the literature. It also suggests that there will be a maximum measurable interstitial liquid velocity when it travel inside the packed bed. The measured V_LL can have a maximum range that is between 4 and 4.7 times that of its V_SL. For V_SL=0.42±±2%, the V_LL-Max is in between 1.7 cm/s and 1.9 cm/s, V_SL=0.84±±2%, the V_LL-Max is in between 3.6 cm/s and 4.0 cm/s, and for V_SL=1.11±±2%, the V_LL-Max is in between 4.3 cm/s and 4.8 cm/s.     

小型机载激光通信系统设计与验证

针对空空宽带高速通信的需求，设计了小型化机载激光通信系统。仿真分析了300 km、2.5 Gb/s无线激光链路性能，并通过运动仿真台模拟机动环境测试了系统的跟踪与通信性能，其中粗跟踪误差为533.2 μrad(1σ)，精跟踪误差为3.6 μrad(1σ)，测试数据传输240 s，通信误码率为2.82×10-9。仿真与实验验证了该系统用于远距离空空无线激光通信的可行性。     

基于分段加权的反向稀疏跟踪算法研究

为提高稀疏表示跟踪模型性能，提出一种分段加权的反向稀疏跟踪算法，将跟踪问题转化为在贝叶斯框架下寻找概率最高的候选对象问题，构造不同的分段权重函数来分别度量候选目标与正负模板的判别特征系数。通过池化来降低跟踪结果的不确定性干扰，选择正负模板加权系数差值最大的候选表示作为跟踪结果。实验表明，在光照变化、遮挡、快速运动、运动模糊情况下，所提出的算法可以确保跟踪结果的准确性和鲁棒性。