Two kinds of average approximation accuracy

Rough set theory places great importance on approximation accuracy, which is used to gauge how well a rough set model describes a target concept. However, traditional approximation accuracy has limitations since it varies with changes in the target concept and cannot evaluate the overall descriptive ability of a rough set model. To overcome this, two types of average approximation accuracy that objectively assess a rough set model’s ability to approximate all information granules is proposed. The first is the relative average approximation accuracy, which is based on all sets in the universe and has several basic properties. The second is the absolute average approximation accuracy, which is based on undefinable sets and has yielded significant conclusions. We also explore the relationship between these two types of average approximation accuracy. Finally, the average approximation accuracy has practical applications in addressing missing attribute values in incomplete information tables

Genetic Evolution and Molecular Selection of the HE Gene of Influenza C Virus

Influenza C virus (ICV) was first identified in humans and swine, but recently also in cattle, indicating a wider host range and potential threat to both the livestock industry and public health than was originally anticipated. The ICV hemagglutinin-esterase (HE) glycoprotein has multiple functions in the viral replication cycle and is the major determinant of antigenicity. Here, we developed a comparative approach integrating genetics, molecular selection analysis, and structural biology to identify the codon usage and adaptive evolution of ICV. We show that ICV can be classified into six lineages, consistent with previous studies. The HE gene has a low codon usage bias, which may facilitate ICV replication by reducing competition during evolution. Natural selection, dinucleotide composition, and mutation pressure shape the codon usage patterns of the ICV HE gene, with natural selection being the most important factor. Codon adaptation index (CAI) and relative codon deoptimization index (RCDI) analysis revealed that the greatest adaption of ICV was to humans, followed by cattle and swine. Additionally, similarity index (SiD) analysis revealed that swine exerted a stronger evolutionary pressure on ICV than humans, which is considered the primary reservoir. Furthermore, a similar tendency was also observed in the M gene. Of note, we found HE residues 176, 194, and 198 to be under positive selection, which may be the result of escape from antibody responses. Our study provides useful information on the genetic evolution of ICV from a new perspective that can help devise prevention and control strategies

Accelerating Globally Optimal Consensus Maximization in Geometric Vision

Branch-and-bound-based consensus maximization stands out due to its important ability of retrieving the globally optimal solution to outlier-affected geometric problems. However, while the discovery of such solutions caries high scientific value, its application in practical scenarios is often prohibited by its computational complexity growing exponentially as a function of the dimensionality of the problem at hand. In this work, we convey a novel, general technique that allows us to branch over an $n-1$ dimensional space for an n-dimensional problem. The remaining degree of freedom can be solved globally optimally within each bound calculation by applying the efficient interval stabbing technique. While each individual bound derivation is harder to compute owing to the additional need for solving a sorting problem, the reduced number of intervals and tighter bounds in practice lead to a significant reduction in the overall number of required iterations. Besides an abstract introduction of the approach, we present applications to three fundamental geometric computer vision problems: camera resectioning, relative camera pose estimation, and point set registration. Through our exhaustive tests, we demonstrate significant speed-up factors at times exceeding two orders of magnitude, thereby increasing the viability of globally optimal consensus maximizers in online application scenarios

Identifying Expressway Accident Black Spots Based on the Secondary Division of Road Units

For the purpose of reducing the harm of expressway traffic accidents and improving the accuracy of traffic accident black spots identification, this paper proposes a method for black spots identification of expressway accidents based on road unit secondary division and empirical Bayes method. Based on the modelling ideas of expressway accident prediction models in HSM (Highway Safety Manual), an expressway accident prediction model is established as a prior distribution and combined with empirical Bayes method safety estimation to obtain a Bayes posterior estimate. The posterior estimated value is substituted into the quality control method to obtain the black spots identification threshold. Finally, combining the Xi\u27an-Baoji expressway related data and using the method proposed in this paper, a case study of Xibao Expressway is carried out, and sections 9, 19, and 25 of Xibao Expressway are identified as black spots. The results show that the method of secondary segmentation based on dynamic clustering can objectively describe the concentration and dispersion of accident spots on the expressway, and the proposed black point recognition method based on empirical Bayes method can accurately identify accident black spots. The research results of this paper can provide a basis for decision-making of expressway management departments, take targeted safety improvement measures

Enhancing Near-Field Sensing and Communications with Sparse Arrays: Potentials, Challenges, and Emerging Trends

As a promising technique, extremely large-scale (XL)-arrays offer potential solutions for overcoming the severe path loss in millimeter-wave (mmWave) and TeraHertz (THz) channels, crucial for enabling 6G. Nevertheless, XL-arrays introduce deviations in electromagnetic propagation compared to traditional arrays, fundamentally challenging the assumption with the planar-wave model. Instead, it ushers in the spherical-wave (SW) model to accurately represent the near-field propagation characteristics, significantly increasing signal processing complexity. Fortunately, the SW model shows remarkable benefits on sensing and communications (S\&C), e.g., improving communication multiplexing capability, spatial resolution, and degrees of freedom. In this context, this article first overviews hardware/algorithm challenges, fundamental potentials, promising applications of near-field S\&C enabled by XL-arrays. To overcome the limitations of existing XL-arrays with dense uniform array layouts and improve S\&C applications, we introduce sparse arrays (SAs). Exploring their potential, we propose XL-SAs for mmWave/THz systems using multi-subarray designs. Finally, several applications, challenges and resarch directions are identified

Optimizing the Age of Information in RIS-aided SWIPT Networks

In this letter, a reconfigurable intelligent surface (RIS)-assisted simultaneous wireless information and power transfer (SWIPT) network is investigated. To quantify the freshness of the data packets at the information receiver, the age of information (AoI) is considered. To minimize the sum AoI of the information users while ensuring that the power transferred to energy harvesting users is greater than the demanded value, we formulate a scheduling scheme, and a joint transmit beamforming and phase shift optimization at the base station (BS) and RIS, respectively. The alternating optimization (AO) algorithm is proposed to handle the coupling between active beamforming and passive RIS phase shifts, and the successive convex approximation (SCA) algorithm is utilized to tackle the non-convexity of the formulated problems. The improvement in terms of AoI provided by the proposed algorithm and the trade-off between the age of information and energy harvesting is quantified by the numerical simulation results

LightVessel: Exploring Lightweight Coronary Artery Vessel Segmentation via Similarity Knowledge Distillation

In recent years, deep convolution neural networks (DCNNs) have achieved great prospects in coronary artery vessel segmentation. However, it is difficult to deploy complicated models in clinical scenarios since high-performance approaches have excessive parameters and high computation costs. To tackle this problem, we propose \textbf{LightVessel}, a Similarity Knowledge Distillation Framework, for lightweight coronary artery vessel segmentation. Primarily, we propose a Feature-wise Similarity Distillation (FSD) module for semantic-shift modeling. Specifically, we calculate the feature similarity between the symmetric layers from the encoder and decoder. Then the similarity is transferred as knowledge from a cumbersome teacher network to a non-trained lightweight student network. Meanwhile, for encouraging the student model to learn more pixel-wise semantic information, we introduce the Adversarial Similarity Distillation (ASD) module. Concretely, the ASD module aims to construct the spatial adversarial correlation between the annotation and prediction from the teacher and student models, respectively. Through the ASD module, the student model obtains fined-grained subtle edge segmented results of the coronary artery vessel. Extensive experiments conducted on Clinical Coronary Artery Vessel Dataset demonstrate that LightVessel outperforms various knowledge distillation counterparts.Comment: 5 pages, 7 figures, conferenc

Flexible Precoding for Multi-User Movable Antenna Communications

This letter rethinks traditional precoding in multi-user wireless communications with movable antennas (MAs). Utilizing MAs for optimal antenna positioning, we introduce a sparse optimization (SO)-based approach focusing on regularized zero-forcing (RZF). This framework targets the optimization of antenna positions and the precoding matrix to minimize inter-user interference and transmit power. We propose an off-grid regularized least squares-based orthogonal matching pursuit (RLS-OMP) method for this purpose. Moreover, we provide deeper insights into antenna position optimization using RLS-OMP, viewed from a subspace projection angle. Overall, our proposed flexible precoding scheme demonstrates a sum rate that exceeds more than twice that of fixed antenna positions

Event-Based Visual Odometry on Non-Holonomic Ground Vehicles

Despite the promise of superior performance under challenging conditions, event-based motion estimation remains a hard problem owing to the difficulty of extracting and tracking stable features from event streams. In order to robustify the estimation, it is generally believed that fusion with other sensors is a requirement. In this work, we demonstrate reliable, purely event-based visual odometry on planar ground vehicles by employing the constrained non-holonomic motion model of Ackermann steering platforms. We extend single feature n-linearities for regular frame-based cameras to the case of quasi time-continuous event-tracks, and achieve a polynomial form via variable degree Taylor expansions. Robust averaging over multiple event tracks is simply achieved via histogram voting. As demonstrated on both simulated and real data, our algorithm achieves accurate and robust estimates of the vehicle's instantaneous rotational velocity, and thus results that are comparable to the delta rotations obtained by frame-based sensors under normal conditions. We furthermore significantly outperform the more traditional alternatives in challenging illumination scenarios. The code is available at \url{https://github.com/gowanting/NHEVO}.Comment: Accepted by 3DV 202