Yuyue Du

Yuyue Du

Auto-generated profile, based on publicly available information

Yuyue Du

College of Computer Science and Engineering, Shandong University of Science and Technology, Qingdao 266590, China

Research Focus & Metrics

Academic Career Length

23Years (2004-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
30 September 2013 in IEEE Transactions on Systems, Man, and Cybernetics: Systems
Verified
Journal Article
Closed access
YDYuYue Du
YuYue Du
LQLiang Qi
Liang Qi
Mengchu ZhouMengchu Zhou
Mengchu Zhou
Logical Petri Nets (LPNs) can well describe and analyze batch processing functions and passing value indeterminacy in cooperative systems. Their structures are simpler than the equivalent inhibition Petri nets. To analyze them, a vector matching method has been given. In this paper a subclass of LPNs is proposed and its properties are analyzed. It can be used to model and simulate e-commerce systems well. Its special structures and relationships among its logical transitions are discussed. Based on them, a reachability tree is constructed and the state equations are used to analyze its properties, that is, reachability, liveness, conservativeness, and reversibility. The proposed analysis method significantly lowers the computational efforts in comparison with the existing method for LPNs.

3 March 2020 in IEEE Access
Verified
Journal Article
Open access
XWXiaoliang Wang
Xiaoliang Wang
PZPeng Zhang
Peng Zhang
YDYuyue Du
Yuyue Du
MQMei Qi
Mei Qi
The trust-based routing mechanisms are proposed to enhance the security of the mobile ad hoc network (MANET), which use the performance metrics of a node to evaluate the trust value of the node. However, some performance metrics are fuzzy, which are easier to be described qualitatively than to be expressed quantitatively. Therefore, the inability to quantitatively express these performance metrics leads to the inaccuracy in the calculation of the trust values of nodes. Meanwhile, some routing mechanisms add the path with the highest credibility to routing table without considering the hop counts of the route in route selection, which reduces quality of service (QoS) of the routing. Aiming at the above problems, firstly, we use cloud model to deal with the fuzziness of performance metrics. Specifically, a trust reasoning model based on cloud model and fuzzy Petri net (FPN) is presented to evaluate the credibility of nodes. Then we propose a routing algorithm based on trust entropy. Routes with the minimum trust entropy are selected to add to routing table. This routing algorithm can reflect the comprehensive effect of route hops and the trust values of nodes on routing selection, thus improving QoS in MANET. Finally, the TUE-OLSR protocol is established based on the trust entropy routing algorithm and the optimized link state routing (OLSR) protocol. What’s more, the effectiveness of TUE-OLSR protocol is verified by simulation experiments, which illustrate that TUE-OLSR protocol performs better than existing trust-based OLSR protocols in terms of packet delivery ratio and average latency.

5 September 2019 in IEEE/CAA Journal of Automatica Sinica
Verified
Journal Article
Closed access
JSJing Sha
Jing Sha
YDYuyue Du
Yuyue Du
LQLiang Qi
Liang Qi
In recent years, the number of Web services has increased significantly. Web service discovery has drawn much attention with the development of Web service applications and big data analysis. Under this circumstance, traditional Web service discovery strategies cannot adequately meet high user requirements due to the efficiency and precision of service discovery is low. In order to improve the accuracy and efficiency of service discovery, a user requirement oriented Web service discovery approach based on Petri nets is proposed in this study. A data preprocessing strategy of Web service is first designed. Then, a service clustering method is proposed based on Petri nets, which can conduct service cluster head generation, service cluster composition, and service discovery. The proposed method utilizes a superior data preprocessing method. Using simulation experiments, the efficiency and precision of Web service discovery are illustrated. Finally, the application value of the approach on real Web service is discussed.

22 May 2019 in IEEE Transactions on Intelligent Transportation Systems
Verified
Journal Article
Closed access
FZFuxin Zhang
Fuxin Zhang
Mengchu ZhouMengchu Zhou
Mengchu Zhou
LQLiang Qi
Liang Qi
YDYuyue Du
Yuyue Du
HSHaichun Sun
Haichun Sun
Fairness and efficiency are two key requirements that have to be guaranteed in channel resource allocation in cooperative vehicle safety systems. Existing channel access control strategies, however, rely on each individual node to adjust networking parameters independently according to its locally measured state information, thus leading to unfairness. Although some coordinated strategies have been proposed to resolve this issue, they pay little attention to the efficiency. In order to achieve the tradeoff between fairness and efficiency, in this paper, we propose a utility function in terms of inter-packet reception time required to capture the performance of consecutive successful packets' reception under various vehicle densities. A channel access control problem among vehicles is then formulated as a non-cooperation game model. This model utilizes a punishment function to penalize a node that monopolizes the channel resources and hence can enable nodes to coordinate with each other to achieve desired fairness and efficiency. Next, a distributed decision-making scheme for channel access control is designed. It adjusts transmission rate in a coordinated manner and can guide each node to reach a Pareto-optimal Nash equilibrium point. The experimental results validate that the proposed strategy can result in fair channel resource allocation and ensure high-tracking accuracy for each vehicle under dynamic traffic conditions.

28 December 2018 in IEEE Access
Verified
Journal Article
Open access
YTYuanxiu Teng
Yuanxiu Teng
YDYuyue Du
Yuyue Du
LQLiang Qi
Liang Qi
WLWenjing Luan
Wenjing Luan
Business processes are usually described and verified by process models before they are implemented in information systems. However, there exist deviations between the activities of a process model and those in event logs generated from the information systems. To replay the activities in the logs, the existing model needs to be repaired. By the current repair methods, the models with concurrent blocks cannot be simply repaired. Therefore, this paper proposes a new model repair approach based on logic Petri nets. Concurrent transition pairs and choice transition pairs are constructed based on process trees. By traversing optimal alignments, the transitions between head and tail of concurrent blocks are determined, deviations are used to judge whether activities in a process model and event logs have concurrent transition pairs or choice transition pairs, and the model is then repaired via logic Petri nets. Finally, the correctness and effectiveness of the proposed model repair method are illustrated by experiments.

8 November 2019 in IEEE/CAA Journal of Automatica Sinica
Verified
Journal Article
Closed access
LWLu Wang
Lu Wang
YDYuyue Du
Yuyue Du
LQLiang Qi
Liang Qi
Business processes described by formal or semi-formal models are realized via information systems. Event logs generated from these systems are probably not consistent with the existing models due to insufficient design of the information system or the system upgrade. By comparing an existing process model with event logs, we can detect inconsistencies called deviations, verify and extend the business process model, and accordingly improve the business process. In this paper, some abnormal activities in business processes are formally defined based on Petri nets. An efficient approach to detect deviations between the process model and event logs is proposed. Then, business process models are revised when abnormal activities exist. A clinical process in a healthcare information system is used as a case study to illustrate our work. Experimental results show the effectiveness and efficiency of the proposed approach.