The integration of EEG signals and deep learning methods is emerging as an effective approach for brain fatigue detection, particularly utilizing Graph Neural Networks(GNNs) that excel in capturing complex electrode relationships. A significant challenge within GNNs is the construction of an effective adjacency matrix that enhances spatial information learning. Concurrently, electrode aggregation in EEG has emerged as a pivotal area of research. However, conventional partitioning methods depend on task-specific prior knowledge, limiting their generalizability across diverse tasks. To Address this issue, we propose a novel mesoscopic region division approach for EEG-based driver fatigue detection, leveraging inherent data characteristics and functional connectivity-based GNN. This method adopts a two-stage approach: initially, micro-electrodes exhibiting similar functional connectivity relationships are grouped as "mesoscopic region"; subsequently, all micro-electrodes in the same group are aggregated into virtual meso-electrodes, and the fatigue state classification is subsequently based on the functional connectivity between them. Applied to a public driver fatigue detection dataset, our approach surpasses existing state-of-the-art methods in performance. Additionally, interpretive analysis provides micro and mesoscopic insights into brain regions and neuronal connections associated with alert and fatigued states.

In order to solve the problem that driving style has not taken into account in the existing following models of human driving vehicles (HDV) and the random variation of HDV model parameters is rarely considered in mixed platoon control studies, an HDV model considering driver's style is first established, and the style parameters and response delay with large fluctuations are modeled as uncertain parameters. A mixed platoon system based on uncertain HDV model is established. Secondly, a robust controller based on Lyapunov-Krasovskii stability theorem is designed to eliminate the effects of parameter uncertainty, external interference, delay and data loss on the stability of the mixed platoon. Finally, simulation results show that the modeling method and control strategy can effectively achieve the stability of uncertain mixed platoon system.

Abstract With the continuous development of blockchain technology, blockchain gradually becomes to play an important role in the fields of finance, medicine, and new energy. In the certification of the membership of the blockchain, a third‐party certificate authority (CA) is used for certification. Considering the centralized structure of CA, and it is difficult for users to evaluate the credibility of CA. A decentralized blockchain membership authentication scheme and a key agreement protocol based on the elliptic curve are proposed by us. The protocol effectively addresses the credibility and single point of failure problems of centralized CAs in the traditional model. Through analysis, our scheme can effectively perform user registration and membership authentication instead of CAs. The security and correctness of the protocol was also analyzed using the formal protocol analysis tool ProVerif and the Ck model. The key authentication protocol we proposed can resist a variety of attacks, and the computational time consumption and Communication costs are relatively low.

Concurrent token ring (CTR), a multiple-access protocol for ring-type area networks, is proposed. In CTR, message frames are partially removed by the destination node. A truncated portion of the frame, which contains the source and destination addresses, is configured by the destination into a conditional token which is allowed to circulate back to the source for removal. The conditional token informs 'downstream' nodes of busy data paths and allows them to establish concurrent message transmission if resources are free. Simulation results indicate that the CTR protocol has a higher throughput and shorter transmission delay than the IEEE 802.5 token ring.>

A novel destination partial removal protocol, DRUID (destination removal without intermediate node delay) ring, is proposed for ring-type networks. In the DRUID ring, a node may initiate message transmission if its output link is free. Every node will relay the message immediately if it is idle when the message arrives. At the same time, the node also receives and buffers all incoming messages. Upon decoding the destination address, the destination node will truncate the message frame to a cut frame by eliminating the information field. This cut frame will continue to circulate around the ring until it arrives at a busy node where it is buffered, identified, and removed. The message frame will be completely removed by the destination node if it is busy when the message arrives. The protocol supports high concurrency while the loop latency is minimized.>