As an essential component of the internet of things, the internet of vehicles (IoV) holds broad application prospects in areas such as safe driving, intelligent transportation, and service reservations. Due to the security and privacy requirements, anonymous authentication schemes are widely used in IoV. However, traditional certificate‐based anonymous authentication schemes suffer from several drawbacks such as poor scalability and high management costs of certificates. Furthermore, centralized authentication architectures are susceptible to a single point of failure. To this end, we propose a blockchain‐based certificateless anonymous cross‐domain authentication (BCACA) scheme for IoV. In this scheme, we adapt a network model with multiple domain managers (DMs) based on blockchain, in which DMs establish distributed trust within the network and act as miners to upload vehicle registration and authentication transactions to the blockchain, assisting in cross‐domain authentication. Based on this framework, a certificateless signature scheme is designed, which supports authentication across different domains without the need for complex certificate exchange mechanisms. In addition, this scheme provides an identity revocation mechanism encompassing both intradomain and cross‐domain scenarios to ensure the security and reliability of the IoV. Security proofs demonstrate that the scheme is provably secure under the random oracle model and exhibits strong resistance against known attacks. Performance analysis indicates that the proposed scheme has lower computational overhead and transmission delay compared to other relevant schemes.

Large language models (LLMs) are highly effective in various natural language processing (NLP) tasks. However, they are susceptible to producing unreliable conjectures in ambiguous contexts called hallucination. This paper presents a new method for evaluating LLM hallucination in Question Answering (QA) based on the unanswerable math word problem (MWP). To support this approach, we innovatively develop a dataset called Unanswerable Math Word Problem (UMWP) which comprises 5200 questions across five categories. We developed an evaluation methodology combining text similarity and mathematical expression detection to determine whether LLM considers the question unanswerable. The results of extensive experiments conducted on 31 LLMs, including GPT-3, InstructGPT, LLaMA, and Claude, demonstrate that in-context learning and reinforcement learning with human feedback (RLHF) training significantly enhance the model’s ability to avoid hallucination. We show that utilizing MWP is a reliable and effective approach to assess hallucination. Our code and data are available at https://github.com/Yuki-Asuuna/UMWP.

In recent years, the data-driven optimization area has seen a shift in the research focus from static batched data environment to dynamic streaming data environment. However, this field is hindered by the lack of a comprehensive and standardized test suite. To fill this gap, we introduce SDDObench, the first benchmark tailored for evaluating and comparing the streaming data-driven evolutionary algorithms (SDDEAs). SDDObench comprises two sets of objective functions combined with five different types of concept drifts, which offer the benefit of being inclusive in generating data streams that mimic various real-world situations, while also facilitating straight-forward description and analysis. As a proof-of-concept study, four well-known algorithms are selected to tackle the problems generated by SDDObench. The experiment results and analysis reveal ongoing challenges in attaining good performance for streaming data-driven optimization. Our SDDObench is open-source and accessible at: https://github.com/LabGong/SDDObench.

This paper presents a bionic foldable wing that imitates the hind wing of ladybirds. Based on the folding mechanism of the hind wing of ladybirds and the theory of origami, the motion model of the bionic foldable wing is established, yield the motion law of the crease angles and the variation relationship between the panels are obtained. Bionic foldable wings utilise shape memory alloy to drive wings to fold, and embedded torsion springs to release energy to realize the function of wing unfolding. In the experiments of the vehicle equipped with foldable wings, the lift and attitude torque of bionic foldable wings are measured by the F/T sensor. The experimental results indicated that its aerodynamic performance is basically close to that of our optimized non-foldable wings. Moreover, the vehicle with foldable wings has been able to overcome gravity to achieve flight, which provides a novel concept for the research on flapping wing.

Metagenomic sequencing analysis (mNGS) has been implemented as an alternative approach for pathogen diagnosis in recent years, which is independent of cultivation and is able to identify all potential antibiotic resistance genes (ARGs). However, current mNGS methods have to deal with low amounts of prokaryotic deoxyribonucleic acid (DNA) and high amounts of host DNA in clinical samples, which significantly decrease the overall microbial detection resolution. The recently released nanopore adaptive sampling (NAS) technology facilitates immediate mapping of individual nucleotides to a given reference as each molecule is sequenced. User-defined thresholds allow for the retention or rejection of specific molecules, informed by the real-time reference mapping results, as they are physically passing through a given sequencing nanopore. We developed a metagenomics workflow for ultra-sensitive diagnosis of bacterial pathogens and ARGs from clinical samples, which is based on the efficient selective 'human host depletion' NAS sequencing, real-time species identification and species-specific resistance gene prediction. Our method increased the microbial sequence yield at least 8-fold in all 21 sequenced clinical Bronchoalveolar Lavage Fluid (BALF) samples (4.5 h from sample to result) and accurately detected the ARGs at species level. The species-level positive percent agreement between metagenomic sequencing and laboratory culturing was 100% (16/16) and negative percent agreement was 100% (5/5) in our approach. Further work is required for a more robust validation of our approach with large sample size to allow its application to other infection types.

Wireless systems such as 5G, beyond 5G and 6G are becoming more heterogeneous with the introduction of low power nodes including femtocells, relays, and distributed antennas. At the same time, various devices access is a promising technology in improving energy efficiency, throughput, delay, as well as spectrum efficiency. The complication of the heterogeneous networks makes the resulting interference more complex and more challenging in both analysis and simulation. Successive interference cancellation (SIC), as an effective interference cancellation technique, is attracting much attention recently. In this paper, we analyze the impact of SIC on the heterogeneous and hybrid network, which consists of multi-tier heterogeneous nodes including the machine type communication (MTC) nodes. For the heterogeneousness of the network, we adopt the stochastic equivalence of aggregate interference to regard the multi-tier network as a single tier, so that we derive the probability of successful transmission with SIC technique for the network. We find that in an open access policy, the conditional success probability for the overall network is irrelevant to any certain tier without or with SIC. In the end, we analyze the impact of the SIC on the success probability of the heterogeneous and hybrid network.

Advances in machine learning (ML) in recent years have enabled a dizzying array of applications such as data analytics, autonomous systems, and security diagnostics. As an important part of the Internet of Things (IoT), wireless sensor networks (WSNs) have been widely used in military, transportation, medical, and household fields. However, in the applications of wireless sensor networks, the adversary can infer the location of a source node and an event by backtracking attacks and traffic analysis. The location privacy leakage of a source node has become one of the most urgent problems to be solved in wireless sensor networks. To solve the problem of source location privacy leakage, in this paper, we first propose a proxy source node selection mechanism by constructing the candidate region. Secondly, based on the residual energy of the node, we propose a shortest routing algorithm to achieve better forwarding efficiency. Finally, by combining the proposed proxy source node selection mechanism with the proposed shortest routing algorithm based on the residual energy, we further propose a new, anonymous communication scheme. Meanwhile, the performance analysis indicates that the anonymous communication scheme can effectively protect the location privacy of the source nodes and reduce the network overhead.

With the development of the technology, the wireless systems are becoming more heterogeneous with the introduction of various power nodes including femtocells, relays, or distributed antennas. Among the research of wireless network performance, the meta distribution of the signal-to-interference ratio (SIR) has attracted significant attention. Compared to the standard success (coverage) probability, the meta distribution provides much more fine-grained information about the network performance. In this paper, we analyze the meta distribution of the SIR in the multi-tier heterogeneous and hybrid networks, where each tier is based on a homogeneous independent Poisson point process model. For the open tiers (the users can associate with any tier) and the closed tiers (the users can only associate with a certain tier), we study the b th moment of the conditional success probability for the typical user and give the beta approximation of the meta distribution from analysis and simulations. Furthermore, we analyze the per-link rate control for open tiers and closed tiers, which answers the question: “how to set the SIR threshold to meet a target reliability?”. We give the approximate value of the SIR threshold to meet a target reliability and show how the value is related to the path loss exponent and densities.