Search

Simple Summary: In the process of calf rearing, it is inevitable to encounter issues of illness and death among calves. Often, due to the inability to detect sicknesses such as diarrhoea in a timely fashion, these sicknesses lead to the calves' demise. This research starts from the practical application needs, and proposes the development of a monitoring system using deep learning technology to monitor the daily standing and lying behaviour of calves to predict their condition and adaptation to the environment. By analysing the standing and lying time of calves, the system can provide early warnings about calves' condition and health status. This research helps to promptly grasp calves' condition and growth status, thereby improving their welfare and management, enhancing the health condition of reared calves, ensuring the quality and safety of meat and milk, and reducing production costs. This research method also offers a new idea for the construction of smart ranches, as the construction of precision and smart ranches is not only a demand of consumers but also an inevitable direction for the development of the breeding industry. Standing and lying are the fundamental behaviours of quadrupedal animals, and the ratio of their durations is a significant indicator of calf health. In this study, we proposed a computer vision method for non-invasively monitoring of calves' behaviours. Cameras were deployed at four viewpoints to monitor six calves on six consecutive days. YOLOv8n was trained to detect standing and lying calves. Daily behavioural budget was then summarised and analysed based on automatic inference on untrained data. The results show a mean average precision of 0.995 and an average inference speed of 333 frames per second. The maximum error in the estimated daily standing and lying time for a total of 8 calf-days is less than 14 min. Calves with diarrhoea had about 2 h more daily lying time (p < 0.002), 2.65 more daily lying bouts (p < 0.049), and 4.3 min less daily lying bout duration (p = 0.5) compared to healthy calves. The proposed method can help in understanding calves' health status based on automatically measured standing and lying time, thereby improving their welfare and management on the farm. [ABSTRACT FROM AUTHOR]

Simple Summary: The monitoring and analysis of sheep behavior can reflect their welfare and health, which is beneficial for grazing management. For automatic classification and the continuous monitoring of grazing sheep behavior, wearable devices based on inertial measurement unit (IMU) sensors are important. The accuracy of different machine learning algorithms was compared, and the best one was used for the continuous monitoring and behavior classification of three grazing sheep on pasture with three different sward surface heights. The results showed that the algorithm automatically monitored the behavior of grazing sheep individuals and quantified the time of each behavior. Behavior classification and recognition of sheep are useful for monitoring their health and productivity. The automatic behavior classification of sheep by using wearable devices based on IMU sensors is becoming more prevalent, but there is little consensus on data processing and classification methods. Most classification accuracy tests are conducted on extracted behavior segments, with only a few trained models applied to continuous behavior segments classification. The aim of this study was to evaluate the performance of multiple combinations of algorithms (extreme learning machine (ELM), AdaBoost, stacking), time windows (3, 5 and 11 s) and sensor data (three-axis accelerometer (T-acc), three-axis gyroscope (T-gyr), and T-acc and T-gyr) for grazing sheep behavior classification on continuous behavior segments. The optimal combination was a stacking model at the 3 s time window using T-acc and T-gyr data, which had an accuracy of 87.8% and a Kappa value of 0.836. It was applied to the behavior classification of three grazing sheep continuously for a total of 67.5 h on pasture with three different sward surface heights (SSH). The results revealed that the three sheep had the longest walking, grazing and resting times on the short, medium and tall SHH, respectively. These findings can be used to support grazing sheep management and the evaluation of production performance. [ABSTRACT FROM AUTHOR]

Model fine-tuning is a widely used transfer learning approach in person Re-identification (ReID) applications, which fine-tuning a pre-trained feature extraction model into the target scenario instead of training a model from scratch. It is challenging due to the significant variations inside the target scenario, e.g., different camera viewpoint, illumination changes, and occlusion. These variations result in a gap between each mini-batch’s distribution and the whole dataset’s distribution when using mini-batch training. In this paper, we study model fine-tuning from the perspective of the aggregation and utilization of the dataset’s global information when using mini-batch training. Specifically, we introduce a novel network structure called Batch-related Convolutional Cell (BConv-Cell), which progressively collects the dataset’s global information into a latent state and uses it to rectify the extracted feature. Based on BConv-Cells, we further proposed the Progressive Transfer Learning (PTL) method to facilitate the model fine-tuning process by jointly optimizing BConv-Cells and the pre-trained ReID model. Empirical experiments show that our proposal can greatly improve the ReID model’s performance on MSMT17, Market-1501, CUHK03, and DukeMTMC-reID datasets. Moreover, we extend our proposal to the general image classification task. The experiments in several image classification benchmark datasets demonstrate that our proposal can significantly improve baseline models’ performance. The code has been released at https://github.com/ZJULearning/PTL [ABSTRACT FROM AUTHOR]

Simple Summary: Traditionally, farmers are unable to pay enough attention to individual livestock. An increasing number of sensors are being used to monitor animal behavior, early disease detection, and evaluation of animal welfare. In this study, we used machine learning algorithms to identify multiple unitary behaviors and movements of dairy cattle recorded by motion sensors. We also investigated the effect of time window on the performance of unitary behaviors classification and discussed the necessity of movement analysis. This study shows a feasible way to explore more detailed movements based on the result of unitary behaviors classification. Low-cost sensors provide remote monitoring of animal behaviors to help producers comprehensively and accurately identify the health status of individual livestock in real-time. The behavior of livestock on farms is the primary representation of animal welfare, health conditions, and social interactions to determine whether they are healthy or not. The objective of this study was to propose a framework based on inertial measurement unit (IMU) data from 10 dairy cows to classify unitary behaviors such as feeding, standing, lying, ruminating-standing, ruminating-lying, and walking, and identify movements during unitary behaviors. Classification performance was investigated for three machine learning algorithms (K-nearest neighbors (KNN), random forest (RF), and extreme boosting algorithm (XGBoost)) in four time windows (5, 10, 30, and 60 s). Furthermore, feed tossing, rolling biting, and chewing in the correctly classified feeding segments were analyzed by the magnitude of the acceleration. The results revealed that the XGBoost had the highest performance in the 60 s time window with an average F1 score of 94% for the six unitary behavior classes. The F1 score of movements is 78% (feed tossing), 87% (rolling biting), and 87% (chewing). This framework offers a possibility to explore more detailed movements based on the unitary behavior classification. [ABSTRACT FROM AUTHOR]

The migration of primary Si grains during the solidification of Al–18 wt%Si alloy under a high-gradient magnetic field has been investigated experimentally. It was found that under a gradient magnetic field, the primary Si grains migrated toward one end of the specimen, forming a Si-rich layer, and the thickness of the Si-rich layer increased with increasing magnetic flux density. No movement of Si grains was apparent under a magnetic field below 2.3 T. For magnetic fields above 6.6 T, however, the thickness of the Si-rich layer was almost constant. It was shown that the static field also played a role in impeding the movement of the grains. The primary Si grains were refined in the Si layer, even though the primary silicon grains were very dense. The effect of the magnetic flux density on the migratory behavior is discussed.

The re-identification (ReID) task has received increasing studies in recent years and its performance has gained significant improvement. The progress mainly comes from searching for new network structures to learn person representations. However, limited efforts have been made to explore the potential performance of existing ReID networks directly by better training scheme, which leaves a large space for ReID research. In this paper, we propose a Self-Inspirited Feature Learning (SIF) method to enhance the performance of given ReID networks from the viewpoint of optimization. We design a simple adversarial learning scheme to encourage a network to learn more discriminative person representation. In our method, an auxiliary branch is added into the network only in the training stage, while the structure of the original network stays unchanged during the testing stage. In summary, SIF has three aspects of advantages: 1) it is designed under general setting; 2) it is compatible with many existing feature learning networks on the ReID task; 3) it is easy to implement and has steady performance. We evaluate the performance of SIF on three public ReID datasets: Market1501, DuckMTMC-reID, and CUHK03(both labeled and detected). The results demonstrate significant improvement in performance brought by SIF. We also apply SIF to obtain state-of-the-art results on all the three datasets. Specifically, mAP / Rank-1 accuracy are: 87.6%/95.2% (without re-rank) on Market1501, 79.4%/89.8% on DuckMTMC-reID, 77.0%/79.5% on CUHK03 (labeled) and 73.9%/76.6% on CUHK03 (detected), respectively. [ABSTRACT FROM AUTHOR]

In this paper, we present novel sharp attention networks by adaptively sampling feature maps from convolutional neural networks for person re-identification (re-ID) problems. Due to the introduction of sampling-based attention models, the proposed approach can adaptively generate sharper attention-aware feature masks. This greatly differs from the gating-based attention mechanism that relies on soft gating functions to select the relevant features for person re-ID. In contrast, the proposed sampling-based attention mechanism allows us to effectively trim irrelevant features by enforcing the resultant feature masks to focus on the most discriminative features. It can produce sharper attentions that is more assertive in localizing subtle features relevant to re-identifying people across cameras. For this purpose, a differentiable Gumbel-Softmax sampler is employed to approximate the Bernoulli sampling to train the sharp attention networks. Extensive experimental evaluations demonstrate the superiority of this new sharp attention model for person re-ID over other related existing, published state-of-the-art works on three challenging benchmarks, including CUHK03, Market-1501, and DukeMTMC-reID. [ABSTRACT FROM AUTHOR]

In this paper, we study Stochastic Composite Optimization (SCO) for sparse learning that aims to learn a sparse solution from a composite function. Most of the recent SCO algorithms have already reached the optimal expected convergence rate \mathcal O(1/\lambda T) , but they often fail to deliver sparse solutions at the end either due to the limited sparsity regularization during stochastic optimization (SO) or due to the limitation in online-to-batch conversion. Even when the objective function is strongly convex, their high probability bounds can only attain \mathcal O(\sqrt\log (1/\delta)/T) with $\delta$ is the failure probability, which is much worse than the expected convergence rate. To address these limitations, we propose a simple yet effective two-phase Stochastic Composite Optimization scheme by adding a novel powerful sparse online-to-batch conversion to the general Stochastic Optimization algorithms. We further develop three concrete algorithms, OptimalSL, LastSL and AverageSL, directly under our scheme to prove the effectiveness of the proposed scheme. Both the theoretical analysis and the experiment results show that our methods can really outperform the existing methods at the ability of sparse learning and at the meantime we can improve the high probability bound to approximately \mathcal {O}(\log (\log (T)/\delta)/\lambda T) . [ABSTRACT FROM AUTHOR]

Recently, the hashing techniques have been widely applied to approximate the nearest neighbor search problem in many real applications. The basic idea of these approaches is to generate binary codes for data points which can preserve the similarity between any two of them. Given a query, instead of performing a linear scan of the entire data base, the hashing method can perform a linear scan of the points whose hamming distance to the query is not greater than rh , where rh is a constant. However, in order to find the true nearest neighbors, both the locating time and the linear scan time are proportional to O(\sumi=0^{rh}{c\choose i}) ( $c$ is the code length), which increase exponentially as rh increases. To address this limitation, we propose a novel algorithm named iterative expanding hashing in this paper, which builds an auxiliary index based on an offline constructed nearest neighbor table to avoid large rh . This auxiliary index can be easily combined with all the traditional hashing methods. Extensive experimental results over various real large-scale datasets demonstrate the superiority of the proposed approach. [ABSTRACT FROM PUBLISHER]

Nearest neighbor search is a fundamental problem in various research fields like machine learning, data mining and pattern recognition. Recently, hashing-based approaches, for example, locality sensitive hashing (LSH), are proved to be effective for scalable high dimensional nearest neighbor search. Many hashing algorithms found their theoretic root in random projection. Since these algorithms generate the hash tables (projections) randomly, a large number of hash tables (i.e., long codewords) are required in order to achieve both high precision and recall. To address this limitation, we propose a novel hashing algorithm called density sensitive hashing (DSH) in this paper. DSH can be regarded as an extension of LSH. By exploring the geometric structure of the data, DSH avoids the purely random projections selection and uses those projective functions which best agree with the distribution of the data. Extensive experimental results on real-world data sets have shown that the proposed method achieves better performance compared to the state-of-the-art hashing approaches. [ABSTRACT FROM PUBLISHER]

Given that xue (study) and Shu (skill) originated from experience and imitation, in ancient China scholars aimed to find out logical cases, while businessmen to make commercial successes. That predicted that scholarship (knowledge/theory) would be separated from practice (application/empiricism) in China's social strata. Furthermore, this historical phenomenon in China found expression in the course of Western history. In other words, scholarship and practice in China would evolve from integration through separation to re-integration. The modern tendency of China's higher education is characterized by the separation of academic school from technological school and the integration of arts and science. The logical origin (academic cognition) and basis for judgment (academic value) in traditional Chinese education focused on practical function. The social intermedium in Western countries for cultural innovation and scientific development was known as salons and cafes, which evolved into the new platforms for modern academic groups and periodicals. The integration of cultural resources for educational innovation, the strengthening of the psychological motivation of academic development, and the cultivation of the physical foundation and intellectual atmosphere of an "invisible college" can serve to make the academic triple function (cognitive innovation, cultural entertainment, and economic utility) become a human need for life, which is the mission of school education in the new era. [ABSTRACT FROM AUTHOR]

Standing and lying are the fundamental behaviours of quadrupedal animals, and the ratio of their durations is a significant indicator of calf health. In this study, we proposed a computer vision method for non-invasively monitoring of calves' behaviours. Cameras were deployed at four viewpoints to monitor six calves on six consecutive days. YOLOv8n was trained to detect standing and lying calves. Daily behavioural budget was then summarised and analysed based on automatic inference on untrained data. The results show a mean average precision of 0.995 and an average inference speed of 333 frames per second. The maximum error in the estimated daily standing and lying time for a total of 8 calf-days is less than 14 min. Calves with diarrhoea had about 2 h more daily lying time ( p < 0.002), 2.65 more daily lying bouts ( p < 0.049), and 4.3 min less daily lying bout duration ( p = 0.5) compared to healthy calves. The proposed method can help in understanding calves' health status based on automatically measured standing and lying time, thereby improving their welfare and management on the farm.

The behavior of livestock on farms is the primary representation of animal welfare, health conditions, and social interactions to determine whether they are healthy or not. The objective of this study was to propose a framework based on inertial measurement unit (IMU) data from 10 dairy cows to classify unitary behaviors such as feeding, standing, lying, ruminating-standing, ruminating-lying, and walking, and identify movements during unitary behaviors. Classification performance was investigated for three machine learning algorithms (K-nearest neighbors (KNN), random forest (RF), and extreme boosting algorithm (XGBoost)) in four time windows (5, 10, 30, and 60 s). Furthermore, feed tossing, rolling biting, and chewing in the correctly classified feeding segments were analyzed by the magnitude of the acceleration. The results revealed that the XGBoost had the highest performance in the 60 s time window with an average F1 score of 94% for the six unitary behavior classes. The F1 score of movements is 78% (feed tossing), 87% (rolling biting), and 87% (chewing). This framework offers a possibility to explore more detailed movements based on the unitary behavior classification.

Aim: An innovative Atg4B inhibitor, S130, exhibited a negative influence on colorectal cancer cells in vitro and in vivo . To assist reliable toxicodynamic and pharmacokinetic evaluation, an LC-MS/MS assay of S130 in rat plasma must be necessary. Results: An LC-MS/MS assay for determination of S130 in rat plasma has been first developed and fully verified whose values met the admissible limits as per the US FDA guidelines. Chromatographic separation was achieved by using an isocratic elution after 3 min. MS was conducted under the ESI + mode fitted with selected reaction monitoring. The calibration curve proved acceptable linearity over 0.50-800 ng/ml. Conclusion: The developed LC-MS/MS assay of S130 in rat plasma is easily applicable in pharmacokinetics study and the further toxicological evaluation.