Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Yan Ma has a total of 16 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    TimeWeaver: Time-Aware Sequential Recommender System via Dual-Stream Temporal Network

    by Yang Liu, Tao Wang, Yan Ma

    Recommender systems are data-driven tools designed to assist or automate users’ decision-making. With the growing demand of personalized sequential recommendations in business intelligence or e-commerce, effectively capturing temporal information from massive user-sequence data has become a crucial challenge. State-of-the-art attention-based models often struggle to balance performance with computational cost, while traditional convolutional neural networks suffer from limited receptive fields and rigid architectures that inadequately model dynamic user interests. To address these limitations, this paper proposes TimeWeaver, a time-aware dual-stream network for sequential recommendation, whose core innovations comprise three key components. First, it employs a re-parameterized large-kernel convolution to expand the effective receptive field. Second, we design a Time-Aware Augmentation mechanism that integrates inter-event time-interval information into positional encodings of items. This allows it to perceive the temporal dynamics of user behavior. Finally, we propose a dual-stream architecture to jointly capture dependencies across different time scales. The context stream employs a modern Temporal Convolutional Network (TCN) structure to strengthen the memorization of users’ medium- and long-term interests. In parallel, the dynamic stream leverages an Exponential Moving Average (EMA) mechanism to weight recent behaviors for sensitively capturing users’ immediate interests. This dual-stream design allows TimeWeaver to comprehensively extract both long- and short-term sequential features. Extensive experiments on three public e-commerce datasets demonstrate TimeWeaver’s superiority. Compared to the strongest baseline model, TimeWeaver achieves average relative improvements of 4.62%, 9.59%, and 4.59% across all metrics on the Beauty, Sports, and Toys datasets, respectively.


  • Open Access

    A Stackelberg Trust-Based Human–Robot Collaboration Framework for Warehouse Picking

    by Yang Liu, Fuqiang Guo, Yan Ma

    The warehouse picking process is one of the most critical components of logistics operations. Human–robot collaboration (HRC) is seen as an important trend in warehouse picking, as it combines the strengths of both humans and robots in the picking process. However, in current human–robot collaboration frameworks, there is a lack of effective communication between humans and robots, which results in inefficient task execution during the picking process. To address this, this paper considers trust as a communication bridge between humans and robots and proposes the Stackelberg trust-based human–robot collaboration framework for warehouse picking, aiming to achieve efficient and effective human–robot collaborative picking. In this framework, HRC with trust for warehouse picking is defined as the Partially Observable Stochastic Game (POSG) model. We model human fatigue with the logistic function and incorporate its impact on the efficiency reward function of the POSG. Based on the POSG model, belief space is used to assess human trust, and human strategies are formed. An iterative Stackelberg trust strategy generation (ISTSG) algorithm is designed to achieve the optimal long-term collaboration benefits between humans and robots, which is solved by the Bellman equation. The generated human–robot decision profile is formalized as a Partially Observable Markov Decision Process (POMDP), and the properties of human–robot collaboration are specified as PCTL (probabilistic computation tree logic) with rewards, such as efficiency, accuracy, trust, and human fatigue. The probabilistic model checker PRISM is exploited to verify and analyze the corresponding properties of the POMDP. We take the popular human–robot collaboration robot TORU as a case study. The experimental results show that our framework improves the efficiency of human–robot collaboration for warehouse picking and reduces worker fatigue while ensuring the required accuracy of human–robot collaboration.


  • Open Access

    Automated Runtime Verification of Security for E-Commerce Smart Contracts

    by Yang Liu, Shengjie Zhang, Yan Ma

    As a novel decentralized computing paradigm, blockchain is expected to disrupt the existing e-commerce architecture and process. Secure smart contracts are the crucial foundation for e-commerce based on blockchain. However, vulnerabilities in smart contracts occur from time to time and cause significant financial losses in e-commerce. Some static verification methods have been developed to guarantee security for e-commerce smart contracts at design time, but they cannot support complex scenarios at runtime. As a lightweight verification method, runtime verification is a potential method for secure e-commerce smart contracts. The existing runtime verification methods are based on the manual instrument, which leads to additional overheads and gas consumption. To deal with this, we propose a passive learning-based runtime verification framework for e-commerce smart contracts. Firstly, by exploring the Genetic algorithm to evolve state merging and automaton reorganizing in order to simultaneously split time and gas behaviors, we propose a passive learning method to model runtime information for e-commerce smart contracts (PL4ESC). It directly learns P2TA (priced probabilistic timed automaton) from runtime traces without any prior knowledge. Then, we integrate PL4ESC with the open-source PAT (Process Analysis Toolkit) to automatically verify the security of runtime e-commerce smart contracts. The experiments show that PL4ESC is better at accuracy and precision than state-of-the-art passive learning methods. It improves accuracy by 1 to 4 percent compared to TAG and RTI+. As far as we know, it is not only the first learning method that can learn a P2TA from traces, but it is also the first automated runtime verification framework for e-commerce smart contracts. This will provide security guarantees for blockchain-based e-commerce.


  • Open Access

    Particle Swarm Optimization-Based Model Abstraction and Explanation Generation for a Recurrent Neural Network

    by Yang Liu, Huadong Wang, Yan Ma

    In text classifier models, the complexity of recurrent neural networks (RNNs) is very high because of the vast state space and uncertainty of transitions, which makes the RNN classifier’s explainability insufficient. It is almost impossible to explain the large-scale RNN directly. A feasible method is to generalize the rules undermining it, that is, model abstraction. To deal with the low efficiency and excessive information loss in existing model abstraction for RNNs, this work proposes a PSO (Particle Swarm Optimization)-based model abstraction and explanation generation method for RNNs. Firstly, the k-means clustering is applied to preliminarily partition the RNN decision process state. Secondly, a frequency prefix tree is constructed based on the traces, and a PSO algorithm is designed to implement state merging to address the problem of vast state space. Then, a PFA (probabilistic finite automata) is constructed to explain the RNN structure with preserving the origin RNN information as much as possible. Finally, the quantitative keywords are labeled as an explanation for classification results, which are automatically generated with the abstract model PFA. We demonstrate the feasibility and effectiveness of the proposed method in some cases.


  • Open Access

    DOCS: A Data Ownership Confirmation Scheme for Distributed Data Trading

    by Yang Liu, Yang Zhang, Yongsheng Yang, Yan Ma

    Data assets trading can encourage owners to distribute data and achieve large-scale data aggregation to promote the development of the supply chain system. Blockchain is a promising platform for constructing a decentralized data marketplace. The data may face risks in the marketplace, such as illegal theft, malicious tampering, or illegal distribution in the transactions process. The data ownership confirmation in a blockchain-empowered marketplace has attracted much attention in recent years. However, challenges still remain, including maintaining data integrity, traceability of illegal data, and accountability. In this paper, we propose a new data ownership confirmation scheme (DOCS) in the transaction scenario of blockchain-empowered distributed data assets trading. It integrates smart contracts, data-embedding technology, and data fingerprint to realize ownership confirmation and protection of data assets in transactions. DOCS ensures reliable mapping between on-chain data ownership information and off-chain data entities, which assists with the accurate prosecution of the illegal distribution of data assets. We demonstrate that DOCS can have desirable security properties in multiple attack models.


  • Open Access

    FGAC: A Fine-Grained Access Control Framework for Supply Chain Data Sharing

    by Yang Liu, Xiangyu Li, Yan Ma

    With the rapid development of digital economics, a large number of data have been accumulated in the supply chain system, and data islands have appeared. Data sharing is an imperative way to unlock the data value of a supply chain system. A safe and effective access control mechanism for privacy-sensitive data is key in data sharing. At present, traditional access control mechanisms are static, single-factor control, and prone to a single point of failure. For dealing with these, a fine-grained access control (FGAC) framework for supply chain data sharing is proposed, based on the blockchain Hyperledger Fabric. It augments role-based access control (RBAC) by giving different attribute keywords to different types of users. This framework is implemented in smart contract Chaincodes and quantitatively verified by using the model-checking tool UPPAAL. The experiment results show that the FGAC framework enhances the efficiency and safety in the process of data sharing for the supply chain system, compared with the existing works.


  • Open Access

    Verifying the Smart Contracts of the Port Supply Chain System Based on Probabilistic Model Checking

    by Yang Liu, Ziyu Zhou, Yongsheng Yang, Yan Ma

    Port supply chains play a very important role in the process of economic globalization. Lack of trust of the mechanism is the main factor in restricting the development of port supply chains. Blockchains have great potential to solve the trust problem among all participants using port supply chains, which can reduce costs and improve efficiency. As the bridge between blockchains and port supply chains, smart contracts reconstruct the business process of blockchain-empowered port supply chains. In this article, we present an architecture of a consortium blockchain-empowered port supply chain system, and propose a system verification framework for the smart contracts of port supply chains with probabilistic behaviors. The smart contracts are modeled as DTMCs (Discrete-Time Markov Chains), which are automatically transformed through the BPMN (Business Process Model and Notation) description of the smart contracts. The requirements are specified by PCTL (Probabilistic Computation Tree Logic). Moreover, we implement the customs clearance process of the Shanghai Yangshan Port based on blockchain Hyperledger Fabric, and reconstruct the clearance process with smart contracts. We use it to demonstrate the effectiveness of this framework, and identify the smart contracts that do not meet the expected needs of users.