This paper introduces the hardware and software of the warehouse logistics control and management system based on RFID (Radio Frequency Identification), and explains the design scheme and implementation method of the system. The read/write operation is done using the electronic tag through a tag reader. The logistics control is implemented with PLC by communicating with SIEMENS WinCC configuration software and OPC technology. By accessing a SQL Server, functions such as automatic data storing, querying and deleting of goods and warehouse information are realized. Combining the former technique, the operations such as warehousing, warehouse delivery and goods moving are accomplished. This paper provides an application example of the integration of electronic tag technology and logistics control/management.

Decoding motor imagery electroencephalography (MI-EEG) signals presents significant challenges due to the difficulty in capturing the complex functional connectivity between channels and the temporal dependencies of EEG signals across different periods. These challenges are exacerbated by the low spatial resolution and high signal redundancy inherent in EEG signals, which traditional linear models struggle to address. To overcome these issues, we propose a novel dual-branch framework that integrates an adaptive graph convolutional network (Adaptive GCN) and bidirectional gated recurrent units (Bi-GRUs) to enhance the decoding performance of MI-EEG signals by effectively modeling both channel correlations and temporal dependencies. The Chebyshev Type II filter decomposes the signal into multiple sub-bands giving the model frequency domain insights. The Adaptive GCN, specifically designed for the MI-EEG context, captures functional connectivity between channels more effectively than conventional GCN models, enabling accurate spatial–spectral feature extraction. Furthermore, combining Bi-GRU and Multi-Head Attention (MHA) captures the temporal dependencies across different time segments to extract deep time–spectral features. Finally, feature fusion is performed to generate the final prediction results. Experimental results demonstrate that our method achieves an average classification accuracy of 80.38% on the BCI-IV Dataset 2a and 87.49% on the BCI-I Dataset 3a, outperforming other state-of-the-art decoding approaches. This approach lays the foundation for future exploration of personalized and adaptive brain–computer interface (BCI) systems.

Personalized location recommendations aim to recommend places that users want to visit, which can save their decision-making time in daily life. However, the recommending task faces a serious data sparsity problem because users have only visited a small part of total places in a city. This problem directly leads to the difficulty in learning latent representations of users and locations. In order to tackle the data sparsity problem and make better recommendations, users’ app usage records in different locations are introduced to compensated for both users’ interests and locations’ characteristics in this paper. An attributed graph-based representation model is proposed to dig out user–app–location associations with high-order features aggregated. Extensive experiments prove that better representations of users and locations are obtained by our proposed model, thus it greatly improves location recommendation performances compared with the state-of-art methods. For example, our model achieves 13.20%, 10.1%, and 9.44% higher performance than the state-of-art (SOTA) models in $Top3Hitrate$, $Top3Accuracy$, and $nDC{G}_3$, respectively, in the Telecom dataset. In the TalkingData dataset, our model achieves 9.34%, 13.35%, and 8.56% better performance than the SOTA models in $Top2Hitrate$, $Top2Accuracy$, and $nDC{G}_2$, respectively. Furthermore, numerical results demonstrate that our model can effectively alleviate the data sparsity problem in recommendation systems.

With the rapid development of Internet of Vehicles (IoV) technology, massive data are continuously integrated into intelligent transportation systems, making efficient computing resource allocation a critical challenge for enhancing network performance. Due to the dynamic and real-time characteristics of IoV tasks, existing static offloading strategies fail to effectively cope with the complexity caused by network fluctuations and vehicle mobility. To address this issue, this paper proposes a task offloading algorithm based on the dynamic adjustment of the parallel factor in directed acyclic graphs (DAG), referred to as Dynamic adjustment of Parallel Factor (DPF). By leveraging edge computing, the proposed algorithm adaptively adjusts the parallel factor according to the dependency relationships among subtasks in the DAG, thereby optimizing resource utilization and reducing task completion time. In addition, the algorithm continuously monitors network conditions and vehicle states to dynamically schedule and offload tasks according to real-time system requirements. Compared with traditional static strategies, the proposed method not only significantly reduces task delay but also improves task success rates and overall system efficiency. Extensive simulation experiments conducted under three different task load conditions demonstrate the superior performance of the proposed algorithm. In particular, under high-load scenarios, the DPF algorithm achieves markedly better task completion times and resource utilization compared to existing methods.

Decoding motor imagery electroencephalography (MI-EEG) signals presents significant challenges due to the difficulty in capturing the complex functional connectivity between channels and the temporal dependencies of EEG signals across different periods. These challenges are exac- erbated by the low spatial resolution and high signal redundancy inherent in EEG signals, which traditional linear models struggle to address. To overcome these issues, we propose a novel dual- branch framework that integrates an Adaptive Graph Convolutional Network (Adaptive GCN) and Bidirectional Gated Recurrent Units (Bi-GRU) to enhance the decoding performance of MI-EEG sig- nals by effectively modeling both channel correlations and temporal dependencies. The Chebyshev Type Il filter decomposes the signal into multiple sub-bands giving the model frequency domain insights. The Adaptive GCN, specifically designed for the MI-EEG context, captures functional connectivity between channels more effectively than conventional GCN models, enabling accurate spatial-spectral feature extraction. Furthermore, combining Bi-GRU and Multi-Head Attention (MHA) captures the temporal dependencies across different time segments to extract deep time-spectral features. Finally, feature fusion is performed to generate the final prediction results. Experimental results demonstrate that our method achieves an average classification accuracy of 80.38% on the BCI-IV Dataset 2a and 87.49% on the BCI-I Dataset 3a, outperforming other state-of-the-art decoding approaches. This approach lays the foundation for future exploration of personalized and adaptive brain-computer interface (BCI) systems.

With the rapid evolution of Large Language Models (LLMs) in natural language understanding and generation, Relation Extraction (RE) has achieved substantial milestones in low-resource and open-domain scenarios. However, prevailing LLM-based RE methodologies predominantly rely on one-shot prompting or static workflows, which lack autonomous evaluation and iterative optimization mechanisms. Consequently, these approaches are prone to issues such as missing relations, type confusion, and factual hallucinations when navigating complex relational contexts. To address these limitations, this paper proposes DyFIRER (Dynamic Feedback Iterative Relation Extraction Framework), a multi-agent framework characterized by dynamic feedback. By constructing three functionally complementary agents—Extraction, Verification, and Optimization—the framework models the RE task as a closed-loop iterative process consisting of “extraction-verification-feedback-optimization,” thereby enabling dynamic adjustment and continuous refinement of extraction strategies. Experimental results on the DuIE 2.0 open relation extraction extension subset demonstrate that DyFIRER achieves an F1-score of 80.5%, modestly but statistically significantly outperforms GPT-4 (p = 0.014), a result that holds on both the augmented and non-augmented test sets and mainstream static methods (yielding a 10.3% improvement over Qwen-7B). Ablation studies further substantiate the critical role of the dynamic feedback iterative mechanism and the strategy retrieval module in mitigating complex relation omissions and factual hallucinations. The framework requires no additional annotated data or fine-tuning, suggesting potential applicability to low-resource settings, though this was not directly evaluated in the current study.