Liang Zhang 0019

dblp:50/6759-19 · DBLP profile ↗
← Back
34ranked-venue papers
0as first author
6since 2021 · last 2025
0000-0002-3886-0351ORCID · conflict

Domains — the database's venue-derived domains; a paper can count in several

Software engineering, systems software and programming languages · 9 · 4 since 2021Databases, data management, data science and information retrieval · 9Artificial intelligence and machine learning · 6Applied, interdisciplinary, general and emerging computing · 6 · 2 since 2021Systems, architecture and hardware · 2Graphics, computer vision, multimedia, augmented reality and games · 2Security and privacy · 1Human-computer interaction and ubiquitous computing · 1
YearPublicationVenuePosition
2025 P-MDP: A Framework to Optimize NFPs of Business Processes in Uncertain Environments
Liang Zhang 0019, Hong Linh Truong 0001
ICSOC (2)3
2022 Improving Business Process Resilience to Long-tailed Business Events via Low-code
abstract
Among different types of changes, a specific type named long-tailed change (LTC), induced by wide-spectrum and sporadic events (hereafter long-tailed business events (LBEs), poses fresh challenges to available change management solutions in business process management. The disorder in economic and social life caused by the competition of COVID-19 epidemics and countermeasures all over the world fully demonstrates the impact of this new change management problem. Based on the principle of separation of concerns, this paper proposes a systematic framework to solve the above problem. The solution consists of a low-code mechanism for process adaptation and business policy conformance. As a result, front-line practitioners can quickly react to changes by using a domain-specific language (DSL) while a corresponding verification of functional and non-functional attributes maintains compliance with business constraints. We validate the solution through a case study of an e-commerce scenario during the COVID-19 pandemic.
Liang Zhang 0019, Hong Linh Truong 0001
ICWS3
2022 Generalizing STNU to Model Non-functional Constraints for Business Processes
abstract
Due to its ease of use, the notion of Simple Temporal Networks with Uncertainty (STNU) has been successfully used in verifying temporal constraints of business processes. Considering the universality of non-functional attributes, it is significant to generalize STNU in characterizing these non-functional constraints, resulting in a better expressiveness to support process modeling and business applications. In this paper, we leverage STNU to such a level by using abstract algebra on STNU. It results in a general non-functional constraint modeling and verification method in business process management (BPM), from the original temporal constraints to broader qualitative and quantitative ones, which is not yet supported with STNU in the BPM. Based on the proposed method, we demonstrate the capability of verifying dynamic controllability (DC) for these non-functional attributes, such as satisfaction, reputation grade, etc.
Liang Zhang 0019
ICSS3
2022 Service-Based Event Penetration from IoT Sensors to Businesses: a Case Study
abstract
By leveraging IoT Big Data, BPM can gain real-time physical world information to make faster and more accurate decisions, but there is a technical gap between IoT sensors and businesses. To bridge the gap, an event penetration mechanism from IoT sensors to business processes is proposed along a practical case study. This paper presents a concrete IoT-BPM application case dealing with seaborne safety ensurance in transporting liquefied natural gas (LNG), analyzes its technical challenges, and examines the feasibility and supposed effects of the BRIBOT approach.
Guiling Wang 0002, Jun Fang 0006, Jing Wang 0002, Jian Yu 0002, Liang Zhang 0019, Yanbo Han
ICSS5
2022 A sound response to long-tailed changes in business process management
Hongmei Cao, Liang Zhang 0019, Tiange Zhang, Xiaochun Xiao
Serv. Oriented Comput. Appl.3
2021 BRIBOT: Towards a Service-Based Methodology for Bridging Business Processes and IoT Big Data
Volker Gruhn, Yanbo Han, Marc Hesenius, Manfred Reichert, Guiling Wang 0002, Jian Yu 0002, Liang Zhang 0019
ICSOC7
2020 Guaranteeing Sound Reactions to Long-Tailed Changes: A Syntax-Directed Annotation Approach
abstract
To cope with the long-tailed changes, an annotation-based BPM approach has been proposed to adapts its behavior in a timely manner. It patches existing business process models rather than rebuilds models from scratch, which saves efforts and reacts to unforeseen changes quickly. However, the original annotation-based approach is at risk of improper annotations added that results in unexpected effects or leads to failure. To remedy this loophole, this paper proposes a syntax-directed annotation approach to guarantee sound reactions. we develop a scheme for designing domain specific languages based on abstract syntax trees and generating a syntax-directed editor automatically. As a result, all patched annotations on the process models are soundness guaranteed in terms of the domain specific language. Case studies demonstrate that proposed approach and tools can help domain experts to tackle long-tailed changes more easily guarantee the correct reactions.
Hongmei Cao, Liang Zhang 0019, Tiange Zhang, Xiaochun Xiao
ICSS3
2020 Fulfilling Functional Demands of BPM in Long-tailed Change Environments
abstract
Enterprises rely on their process-aware information system (PAIS) to conduct business. With the increasingly fierce competition, the operation environment of enterprises is constantly changing due to uncertain factors or emerging opportunities. How to react to the changes in time and make a positive response is fundamental for enterprises to maintain their core competitiveness in the new economic era. Among these changes, a kind of long-tailed change has been omitted by traditional business process management (BPM) because of its wide variety and low frequency. Just as the long-tailed effect reveals, the impact of long-tailed change on PAIS change management will be no less than the impact of high-frequency changes. On the move to digital economy, enterprises can hardly win if they cannot catch the first opportunity and deal the long-tailed changes properly. On the other hand, business process models in PAIS are core assets of an enterprise. The requirement of keeping routine processes running smoothly and reusing these assets smartly in unexpected situations runs through the whole business. To solve this problem, this paper proposes a novel maintenance approach for business process models to cope with long-tailed changes. By decorating existing process models with business-oriented annotations, the PAIS can equip with the mechanism to support original processes while react to long-tailed situations agilely with a reinforced process engine. Several experiments revels the effectiveness and generality of proposed approach for BPM in the digital economy ear.
Hongmei Cao, Liang Zhang 0019
ICSS4
2020 Value Innovation with Crossover Services
abstract
Business process often contain many participants with different value orientations, and the fulfillment of the business value is achieved via cooperation and game among these participants in forms of services. Recently, the conceptual framework of crossover services has been constructed in pursuit of value innovation by breaking the traditional boundary and promoting convergence of service systems. Some value related factors include: 1) KPIs about activities, processes and collaborations; 2) Constraints on activities and resource utilization. The evaluation of these factors are highly dependent on participant's position, time and place of occurrence. However, in practice, such important information is not well-specified in business process models, let alone be evaluated, traced, and improved in applications. In this paper, we propose a temporal-spatial-domain ternary model to specify above information, and develop an annotation approach to attach it to standard BPMN 2.0 processes. We validate their effectiveness through case studies, and the experimental result reveals their potential advantages in pursuit of value innovation with crossover services.
Hongmei Cao, Liang Zhang 0019
SERVICES4
2020 Toward configurable modeling for artifact-centric business processes
abstract
Summary There are usually process model variants for a business as its application and evolution. Configurable process modeling is an effective approach for the design and development of business process models by reuse. However, the existing configurable process modeling approaches focus on traditional activity‐centric business processes, which is unfeasible for the new modeling paradigm of artifact‐centric business processes. To solve the problem, we propose a configurable modeling framework, especially for artifact‐centric business processes. To derive the integrated model for multiple process model variants, we propose a merger operation for artifact‐centric process model variants. We get a configurable artifact‐centric process model by identifying configurable points in the integrated model by common and variable characteristics. Moreover, the associated configuration alternatives are set accordingly for configurable points, in which the property of data privacy is considered. New artifact‐centric process models can be derived by configuration based on the behavior of a configurable model. To facilitate the process configuration, guidelines are analyzed based on the notion of process element relation graph. A case study is conducted to illustrate the effectiveness of our approach with a real‐world business process developed for Real Estate Administration (REA) in Hangzhou, China.
Guosheng Kang, Liqin Yang, Liang Zhang 0019
Concurr. Comput. Pract. Exp.3
2019 On-the-Fly Collaboration for Legacy Business Process Systems in an Open Service Environment
abstract
Dynamic, distributed and open business forces enterprises to support various critical requirements, such as, timely reacting to changes, properly reusing business assets and smoothly collaborating with external partners. Existing approaches focus on mechanisms dealing with heterogeneity, but there is a lack of frameworks enabling legacy business processes performing collaboration in an open service environment. This paper proposes the L2L service framework featuring reactive IoT event messaging and coordinator-based collaborating between autonomous enterprises. Along with the emerging of coordinators, L2L empowers on-the-fly business process collaboration with dynamic changes. We present our experiments with a real-world scenario from the shipping industry of China.
Biqi Zhu, Chenglong Hu, Liang Zhang 0019, Hong Linh Truong 0001
ICWS4
2019 Constructing an Adversary Solver for Equihash
Xiaofei Bai, Chenglong Hu, Liang Zhang 0019
NDSS4
2019 Verification of behavioral soundness for artifact-centric business process model with synchronizations
Guosheng Kang, Liqin Yang, Liang Zhang 0019
Future Gener. Comput. Syst.3
2016 Towards a Scalable Framework for Artifact-Centric Business Process Management Systems
Jiankun Lei, Rufan Bai, Lipeng Guo, Liang Zhang 0019
WISE (2)4
2012 Least squares online linear discriminant analysis
Liang Zhang 0019
Expert Syst. Appl.2
2012 Generalized aggregate Quality of Service computation for composite services
Marlon Dumas, Luciano García-Bañuelos, Artem Polyvyanyy, Liang Zhang 0019
J. Syst. Softw.5
2011 Online Updating the Generalized Inverse of Centered Matrices
abstract
In this paper, we present the exact online updating formulae for the generalized inverse of centered matrices. The computational cost is O(mn) for matrices of size m × n. Experimental results validate the proposed method’s accuracy and efficiency.
Liang Zhang 0019
AAAI2
2011 Time Based QoS Modeling and Prediction for Web Services
Leilei Chen, Jian Yang 0001, Liang Zhang 0019
ICSOC3
2010 Aggregate Quality of Service Computation for Composite Services
Marlon Dumas, Luciano García-Bañuelos, Artem Polyvyanyy, Liang Zhang 0019
ICSOC5
2010 Evaluating the Survivability of SOA Systems Based on HMM
abstract
Survivability is crucial for computer systems that support critical infrastructures of our society. For those in paradigm of SOA where the computing settings are intrinsically open, traditional survivability model and safeguard mechanisms are no longer applicable. To rise to the challenge, we propose a formal definition and a corresponding framework to evaluate the survivability of SOA systems. We treat survivability as a multidimensional QoS property, and then give a holistic evaluation method based on the Hidden Markov Model.
Leilei Chen, Liang Zhang 0019
ICWS4
2010 Ensemble Learning Based on Multi-Task Class Labels
Liang Zhang 0019
PAKDD (2)2
2010 Towards a Formalization of Contracts for Service Substitution
abstract
In a service-oriented system, service substitution can be used to repair faults, improve performance, and/or enhance resilience via graceful degradation. Correct service substitution must preserve the essential properties of the system, particularly the proper termination and/or liveness. However, ensuring correct service substitution poses some challenges. The main obstacle is that, in the general case, the behavior of services is opaque to service designers due to the autonomy of services. While the bulk of prior researches on service substitution assume that services advertise their interaction protocols (e.g., in the form of BPEL), existing services (i.e., in the form of WSDL) rarely do so. In this paper, we study the problem of service substitution under the assumption that services do not expose their interaction protocols. To this end, we characterize the behavior of interacting services by means of contracts consisting purely of input/output messages and message exchange patterns revealed in WSDL interfaces. On the other hand, the behavior of service compositions is assumed to be known to service designers. In this setting, we define notions of compatibility for self-contained systems and for open systems. Based on these notions, we propose a theory of contracts for service substitution. We also study a notion of degraded substitution based on the "may-", "should-" and "must-" testing pre-orders.
Marlon Dumas, Liang Zhang 0019
SERVICES3
2010 Improving Web Service Survivability via Gracefully Degraded Substitution
abstract
The ability to substitute a service for another is one of the features of Service-Oriented Computing (SOC). In this paper, we study the problem of degraded service substitution assuming that services have explicitly-defined interaction protocols, e.g., in the form of WS-BPEL business protocols. To this end, we characterize the behavior of interacting services by means of contracts specifying the allowed sequence of message sending and receiving operations. The contribution of this paper is a theory of contracts for service substitution which improve system survivability by gracefully degraded substitution.
Marlon Dumas, Liang Zhang 0019
Web Intelligence3
2008 MTForest: Ensemble Decision Trees based on Multi-Task Learning
abstract
Many ensemble methods, such as Bagging, Boosting, Random Forest, etc, have been proposed and widely used in real world applications. Some of them are better than others on noise-free data while some of them are better than others on noisy data. But in reality, ensemble methods that can consistently gain good performance in situations with or without noise are more desirable. In this paper, we propose a new method namely MTForest, to ensemble decision tree learning algorihms by enumerating each input attribute as extra task to introduce different additional inductive bias to generate diverse yet accurate component decision tree learning algorithms in the ensemble. The experimental results show that in situations without classification noise, MTForest is comparable to Boosting and Random Forest and significantly better than Bagging, while in situations with classification noise, MTForest is significantly better than Boosting and Random Forest and is slightly better than Bagging. So MTForest is a good choice for ensemble decision tree learning algorithms in situations with or without noise. We conduct the experiments on the basis of 36 widely used UCI data sets that cover a wide range of domains and data characteristics and run all the algorithms within the Weka platform.
Liang Zhang 0019, Mingmin Chi, Jiankui Guo
ECAI2
2006 A Method to Select the Optimum Web Services
Yuliang Shi, Guang'an Huang, Liang Zhang 0019, Baile Shi
APWeb3
2006 Cubic Analysis of Social Bookmarking for Personalized Recommendation
Yanfei Xu, Liang Zhang 0019, Wei Liu 0046
APWeb2
2006 TDWF: A Workflow Model Based on Cooperation of Web Services
abstract
Currently technologies of Web services have greatly developed and provided a new application platform for CSCW. For a business process across enterprises, cooperation of multiple Web services is usually required to achieve the final goal. However, most current Web services choreography proposals, such as BPEL4WS or WSCI, only provide a fixed execution flow, lacking of flexibility and adaptability. In this paper, we propose a flexible workflow model TDWF, which can specify the execution process of Web services according to task dependency information, so that the Web services can be composed dynamically. We also put forward an algorithm to verify the correctness of the composition process. Besides, the proposed compensation mechanism of workflow could properly satisfy the requirements of end users
Yuliang Shi, Liang Zhang 0019, Baile Shi
CSCWD2
2005 Automatic Image Annotation Based on Topic-Based Smoothing
Jianye Ye, Lian Chen, Liang Zhang 0019, Baile Shi
IDEAL4
2005 Web Service Collaboration Analysis via Automata
Yuliang Shi, Liang Zhang 0019, Fangfang Liu 0008, Lili Lin, Baile Shi
WAIM2
2005 A Stratification-Based Approach to Accurate and Fast Image Annotation
Jianye Ye, Jian Pei 0001, Lian Chen, Liang Zhang 0019
WAIM5
2005 Compatibility Analysis of Web Services
abstract
The compatibility analysis is absolutely necessary for guaranteeing the correct composition of Web services, no matter what styles the composition takes, statically or dynamically. In this paper, we provide a formalization of Web services behavior using the approach of automata. With this understanding, we propose a definition of role among Web services interactions. As a result, we can check whether two or more Web services are compatible in collaboration or not.
Yuliang Shi, Liang Zhang 0019, Fangfang Liu 0008, Lili Lin, Baile Shi
Web Intelligence2
2003 An Image Retrieval Method Based on Collaborative Filtering
Qi Zhang 0025, Liang Zhang 0019, Baile Shi
IDEAL3
2003 An Image Retrieval Method Based on Information Filtering of User Relevance Feedback Records
Qi Zhang 0025, Ailin Deng, Liang Zhang 0019, Baile Shi
WAIM5
2003 An image retrieval method based on analysis of feedback sequence log
Qi Zhang 0025, Liang Zhang 0019, Baile Shi
Pattern Recognit. Lett.4