Induction motors are the most numerous and significant dynamic loads in power systems. In transient voltage stability analysis, dynamic equivalent models are commonly used to simplify the representation of a group of induction motors. This paper presents an method for the grouping and aggregation of induction motors at a common bus. Firstly, grouping rules were provided for clustering induction motors into several subgroups based on the mechanical principles of rotor force and motion, and Aggregation Rules were provided for aggregating a motor subgroup into a single-unit model based on the relationship between voltage drop and power transmission in distribution networks. Secondly, guided by the grouping rules, high-speed remaining electromagnetic torque and low-speed remaining electromagnetic torque were defined as new clustering indicators, and an adaptive K-means clustering method using silhouette coefficient verification was provided to obtain the optimal motor subgroups. Thirdly, guided by the Aggregation Rules, a dynamic equivalent method was further provided to obtain the equivalent single-unit model from a motor subgroup. Lastly, a transient voltage stability simulation in a typical distribution network was presented to illustrate that the proposed clustering and equivalent methods are more reasonable, accurate, and effective than traditional methods, as the obtained model has better dynamic characteristics and can more accurately reproduce the process of voltage collapse.

In the last two decades, there have been massive advancements in high throughput technologies, which resulted in the exponential growth of public repositories of gene expression datasets for various phenotypes. It is possible to unravel biomarkers by comparing the gene expression levels under different conditions, such as disease vs. control, treated vs. not treated, drug A vs. drug B, etc. This problem refers to a well-studied problem in the machine learning domain, i.e., the feature selection problem. In biological data analysis, most of the computational feature selection methodologies were taken from other fields, without considering the nature of the biological data. For gene expression data analysis, most of the existing feature selection methods rely on expression values alone to select the genes; and biological knowledge is integrated at the end of the analysis in order to gain biological insights or to support the initial findings. Thus, integrative approaches that utilize the biological knowledge while performing feature selection are necessary for this kind of data. The main idea behind the integrative gene selection process is to generate a ranked list of genes considering both the statistical metrics that are applied to the gene expression data, and the biological background information which is provided as external datasets. Since the integrative approach attracted attention in the gene expression domain, lately the gene selection process shifted from being purely data-centric to more incorporative analysis with additional biological knowledge.

This study investigated the effects of icon familiarity on visual search performance. An equal number of familiar and unfamiliar icons were selected as background icons. These background icons were randomly arranged, and a visual search experiment was conducted to locate the target icon. The results showed no significant difference in the time required to find the target icon, regardless of whether the target icon was familiar or unfamiliar. This finding contrasts with previous studies that have suggested a positive effect of target icon familiarity on visual search performance, indicating that the influence of target icon familiarity may not always be consistent and could depend on the characteristics of the background icons. However, when background icons were grouped based on their familiarity, the time taken to locate the target icon was significantly reduced compared to when the icons were randomly arranged. To understand the underlying mechanism of this effect, participants' gaze fixation times were observed. The results revealed that participants spent more time fixating on areas where the target icon was located, rather than on areas without the target icon, suggesting a more efficient visual search process. Moreover, the shorter the visual search time, the higher the proportion of time spent fixating on the area containing the target icon. Additionally, this study examined the contrast ratio between the color of the background space and the dominant color of the target icon, comparing it with the visual search time. The findings indicated that as the contrast ratio increased, the visual search time decreased.

In view of the Practical Byzantine Fault Tolerance (PBFT) consensus algorithm all nodes participate in the consensus, the three-stage process has problems such as large communication overhead, random selection of master nodes and lack of reward and punishment mechanism. A Speculative Practical Byzantine Fault Tolerance (SP-PBFT) is proposed. Firstly, the consensus protocol was optimized, and a timeout mechanism was proposed to divide the consensus process into optimistic mode and pessimistic mode, which reduced the communication overhead under the premise of resisting Byzantine node attacks .Secondly, a node evaluation mechanism was proposed to calculate the node reputation value according to the node's historical behavior and give the corresponding reward or punishment, which reduced the possibility of malicious nodes participating in the consensus process. Finally, the Fibonacci grouping mechanism was used to reduce the number of nodes participating in the consensus process, fundamentally improving the consensus efficiency, avoiding the problem of centralization of the consensus process caused by the cumulative reputation value of nodes, and improving the enthusiasm of consensus nodes. Simulation experiments using Docker containers to simulate multiple nodes show that the SP-PBFT consensus algorithm proposed in this paper has better performance than PBFT consensus algorithm and other improved algorithms in terms of consensus delay, throughput, fault tolerance and communication complexity.

3D point cloud classification tasks have been a hot topic in recent years. Most existing point cloud processing frameworks lack context-aware features due to the deficiency of sufficient local feature extraction information. Therefore, we design an augmented sampling and grouping (ASG) module to efficiently obtain fine-grained features from the original point cloud. In particular, this method strengthens the domain near each centroid and makes reasonable use of the local mean and global standard deviation to mine point cloud’s local and global features. In addition to this, inspired by the transformer structure UFO-ViT in 2D vision tasks, we first try to use a linearly-normalized attention mechanism in point cloud processing tasks, investigating a novel transformer-based point cloud classification architecture UFO-Net. An effective local feature learning module is adopted as a bridging technique to connect different feature extraction modules. Importantly, UFO-Net employs multiple stacked blocks to better capture feature representation of the point cloud. Extensive ablation experiments on public datasets show that our method outperforms other state-of-the-art methods. For instance, our network performed with 93.7% overall accuracy on the ModelNet40 dataset, which was 0.5% higher than PCT. Our network also archived 83.8% overall accuracy on the ScanObjectNN dataset, which is 3.8% better than PCT.

With the development of hyperspectral technology, to establish an effective spectral data compressive reconstruction method that can improving data storage, transmission and maintaining spectral information is critical for quantitative remote sensing research and application in vegetation. By introducing the idea of compressive sensing in compressed reconstruction, the spectral adaptive grouping distributed compressive sensing algorithm is proposed, which enables a distributed compressed sensing reconstruction of plant hyperspectral data. The experimental results showed that comparing with orthogonal matching pursuit(OMP) and gradient projection reconstruction(GPSR), the proposed algorithm can significantly improve the visual effect of image reconstruction in the spatial domain. The PSNR in low sampling rate(sampling rate is lower than 0.2) increases by 13.72dB than OMP and 1.66dB than GPSR. In the spectral domain, the average normalized root mean square error、the mean absolute percentage error and the mean absolute error of the proposed algorithm is35.38%，31.83% and 33.33% lower than GPSR respectively.. Therefore, the proposed algorithm can achieve relatively high reconstructed efficiency.

The skyrocketing growth in the number of Internet of Things (IoT) devices will certainly pose a huge traffic demand for fifth-generation (5G) wireless networks and beyond. In-band full-duplex (IBFD), which is theoretically expected to double the spectral efficiency of a half-duplex (HD) wireless channel and to connect more devices, has been considered as a promising technology to accelerate the development of IoT. To exploit the full potential of IBFD, the key challenge is how to handle network interference (including self-interference, co-channel interference and multiuser interference) more effectively. In this paper, we propose a simple yet efficient user grouping method, where a base station (BS) serves strong downlink users and weak uplink users and vice versa in different frequency bands, mitigating severe network interference. We aim to maximize a minimum rate among all users subject to bandwidth and power constraints, which is formulated as a highly nonconvex optimization problem. By leveraging inner approximation framework, we develop a very efficient iterative algorithm to solve this problem, which guarantees at least a local optimal solution. Numerical results are provided to show not only the benefit of using full-duplex raido at BS, but also the advantage of the proposed user grouping method.