In order to characterize that stochastic environment, we consider a class facultative population systems driven by Markov chains and pure-jump stable processes with negative jumps. To begin with, the existence and uniqueness for global positive solution is proved for our model. Then, some sufficient conditions for stationary distribution are provided.

Both Fa-Weyl’s theorem and a-Weyl’s theorem are the variants of Weyl’s theorem. The study of Weyl’s type theorems is very important for spectral theory. By defining a new spectral set in this paper, sufficient and necessary conditions for a bounded linear operator $T $ definded on a Hilbert space to satisfy the Fa-Weyl’s theorem and the a-Weyl’s theorem are established. In addition, we discuss the Fa-Weyl’s theorem and the a-Weyl’s theorem of bounded linear operator $T $ under a finite rank perturbation.

This paper presents a discussion on the long-time dynamical behavior of solutions for the classical reaction-diffusion equation with time-dependent memory kernel when nonlinear term adheres to subcritical growth and the external force term $g(x,t) $ belongs to the space $ L^{2}_{{\mathrm{loc}}}(\mathbb{R};L^{2}(\varOmega)) $ in the time-dependent space $ L^2(\varOmega)\times L_{\mu_{t}}^2(\mathbb{R}_{+}; H_{0}^1(\varOmega)) $. Within the new theorical framework, the well-posedness and the regularity of the solution, as well as the existence of the time-dependent pullback attractors are established. This is achieved by applying the delicate integral estimation method and decomposition techniques.

Third-party software systems play a significant role in modern software development. Software developers build software based on requirements by retrieving appropriate dependency libraries from third-party software repositories, effectively avoiding repetitive wheel-building operations and thus speeding up the development process. However, retrieving third-party dependency libraries can be challenging. Typically, third-party software repositories provide preset tags (categories) for software developers to search. However, when a software’s preset tags are incorrectly labeled, software developers are unable to find the libraries required, and this inevitably affects the development process. This study proposes a software clustering model to address the aforementioned challenges. The model combines method vectors, method importance, and text vectors to categorize unknown categories of software into known categories. In addition, because no publicly available dataset exists for this problem, we built a dataset and made it publicly available. This clustering model was tested on a self-built dataset comprising 30 categories and software systems from the Maven repository. The accuracy of the prediction category was 70% for one candidate (top-1) and 90% for three candidates (top-3). The experimental results show that our model can help software developers find suitable software, can be useful for classifying software systems in open-source repositories, and can assist software developers in quickly locating third-party libraries.

Crop diseases are one of the main factors threatening crop growth. In this regard, machine-learning algorithms can efficiently detect large-scale crop diseases and are beneficial for timely processing and improving crop yield and quality. In large-scale agricultural scenarios, owing to limitations in power supply and other conditions, the power-supply requirements of high-computing-power devices such as servers cannot be fulfilled. Most existing deep-network models require high computing power and cannot be deployed easily on low-power embedded devices, thus hindering the accurate identification and application of large-scale crop diseases. Hence, this paper proposes a lightweight crop-disease-recognition algorithm based on knowledge distillation. A student model based on a residual structure and the attention mechanism is designed and knowledge distillation is applied to complete transfer learning from the ConvNeXt model, thus achieving the lightweight model while maintaining high-precision recognition. The experimental results show that the accuracy of image classification for 39 types of crop diseases is 98.72% under a model size of 2.28 MB, which satisfies the requirement for deployment in embedded devices and indicates a practical and efficient solution for crop-disease recognition.

Monocular three-dimensional (3D) object detection is a fundamental but challenging task in autonomous driving and robotic navigation. Directly predicting object depth from a single image is essentially an ill-posed problem. Geometry projection is a powerful depth estimation method that infers an object’s depth from its physical and projected heights in the image plane. However, height estimation errors are amplified by the depth error. In this study, the physical and projected heights of object surface points (rather than the height of the object itself) were estimated to obtain several depth candidates. In addition, the uncertainties in the heights were estimated and the final object depth was obtained by assembling the depth predictions according to the uncertainties. Experiments demonstrated the effectiveness of the depth estimation method, which achieved state-of-the-art (SOTA) results on a monocular 3D object detection task of the KITTI dataset.

To improve the ability to predict future events and effectively address uncertainty, we propose a network architecture based on graph augmentation and attention mechanisms for uncertainty forecasting in multivariate time series. By introducing an implicit graph structure and integrating graph neural network techniques, we capture the mutual dependencies among sequences to model the interactions between time series. We utilize attention mechanisms to capture temporal patterns within the same sequence for modeling the dynamic evolution patterns of time series. We utilize the Monte Carlo dropout method to approximate model parameters and model the predicted sequences as a stochastic distribution, thus achieving accurate uncertainty forecasting in time series. The experimental results indicate that this approach maintains a high level of prediction precision while providing reliable uncertainty estimation, thus providing confidence for use in decision-making tasks.

The domain knowledge graph exhibits characteristics of incompleteness and semantic complexity, which lead to shortcomings in the extraction and selection of rules, thereby affecting its inferential capabilities. A rule extraction model that integrates relationship and structural encoding is proposed to address this issue. A multidimensional embedding approach is achieved by extracting relational and structural information from the target subgraph and conducting feature encoding. A self-attention mechanism is designed to integrate relational and structural information, enabling the model to capture dependency relationships and local structural information in the input sequence better. This enhancement improves the understanding and expressive capabilities of context of the model, thus addressing the challenges of rule extraction and selection in the complex semantic situations. The experimental results for actual industrial datasets of automotive component failures and public datasets demonstrate improvements in the proposed model for link prediction and rule quality evaluation tasks. When the rule length is 3, an average increase of 7.1 percentage points in the mean reciprocal rank (MRR) and an average increase of 8.6 percentage points in Hits@10 are observed. For a rule length of 2, an average increase of 7.4 percentage points in MRR and an average increase of 3.9 percentage points in Hits@10 are observed. This confirms the effectiveness of relational and structural information in rule extraction and inference.

Based upon path query information, we propose a graph attention model that effectively integrates textual and graph structure information in knowledge graphs, thereby enhancing knowledge graph completion. For textual information, a dual-encoder based on pre-trained language models is utilized to separately obtain embedding representations of entities and path query information. Additionally, an attention mechanism is employed to aggregate path query information, which is used to capture graph structural information and update entity embeddings. The model was trained using contrastive learning and experiments were conducted on multiple knowledge graph datasets, with good results achieved in both transductive and inductive settings. These results demonstrate the advantage of combining pre-trained language models with graph neural networks to effectively capture both textual and graph structural information, thereby enhancing knowledge graph completion.

Online social media are frequently used by people as a way of expressing their thoughts and feelings. Among the vast amounts of online posts, there may be more concerning ones expressing potential grievances and mental illnesses. Identifying these along with potential causes of mental health problems is an important task. Observing these posts, it is found that there is a label co-occurrence phenomenon in contexts, i.e., the semantics of multiple candidate labels appear in the context of one sample, which interferes with the modeling and prediction of label patterns. To mitigate the impact of this phenomenon, we propose a label-aware data augmentation method, which leverages large-scale pre-trained language models with excellent text comprehension capability to identify potential candidate labels, abates the noise from irrelevant co-occurring labels by estimating sample-independent label semantic strengths, and constructs well-performing classifiers with pre-trained language models. Extensive experiments validate the effectiveness of our model on the recent datasets Intent_SDCNL and SAD.

Diffusion models have revolutionized text-to-image synthesis, enabling users to generate high-quality and imaginative artworks from simple natural-language text prompts. Unfortunately, due to the large and unfiltered training dataset, inappropriate content such as nudity and violence can be generated from them. To deploy such models at a higher level of safety, we propose a novel method, directional contrastive language-image pre-training (CLIP) loss-based fine-tuning, dubbed as CLIF. This method utilizes directional CLIP loss to suppress the model’s inappropriate generation ability. CLIF is lightweight and immune to circumvention. To demonstrate the effectiveness of CLIF, we proposed a benchmark called categorized toxic prompts (CTP) to evaluate the ability to generate inappropriate content for text-to-image diffusion models. As shown by our experiments on CTP and common objects in context (COCO) datasets, CLIF is capable of significantly suppressing inappropriate generation while preserving the model’s ability to produce general content.

In response to the existing shortcomings of large computational complexity, poor real-time performance, and deployment difficulties in current algorithms, and to meet the high requirements of real-time performance and accuracy for infrared detection systems, proposes a lightweight algorithm deployed on domestically produced embedded chips, termed YOLOv5-TinyHisi. The YOLOv5-TinyHisi algorithm undertakes lightweight modifications to the backbone network structure based on the characteristics of infrared small targets. Additionally, it utilizes SIoU optimized loss function for boundary error, thereby enhancing the accuracy of infrared small target localization. The YOLOv5-TinyHisi algorithm model is deployed on Hi3531DV200, utilizing the chip-integrated neural network inference engine (NNIE) to accelerate network inference. Experimental results on public datasets demonstrate that the algorithm achieves a 1.52% improvement in average precision (mAP) compared to YOLOv5, while significantly reducing parameter count and model size. On the Hi3531DV200, the inference speed for a single image with a resolution of (1280 × 512) pixels reaches 35 frames per second (FPS), with a recall rate of 95%, meeting the real-time and accuracy requirements of the infrared detection system.