Jianwen Su
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
Research Subjects
Jianwen Su has a total of 20 co-authors. Here are the top co-authors by number of shared publications:
- Mei Wang
Donghua University
2 shared publications - Oscar H. Ibarra
Department of Computer Science University of California 93106 Santa Barbara CA USA
2 shared publications - Tevfik Bultan
University of California
2 shared publications Xiang Fu
2 shared publications- Bin Lin
University of California
1 shared publication - Constantinos Bartzis
University of California
1 shared publication
Latest Publications
- 9 August 2023
- Published by Springer Nature
- p. 430-441
An Evaluation Metric for Prediction Stability with Imprecise Data
- 9 August 2023
- Published by Springer Nature
- p. 430-441
An Evaluation Metric for Prediction Stability with Imprecise Data
- 29 August 2022
- Published by Elsevier in Artificial Intelligence in Medicine
- Vol. 132, 102373
Predicting disease progress with imprecise lab test results
- 29 August 2022
- Published by Elsevier in Artificial Intelligence in Medicine
- Vol. 132, 102373
Predicting disease progress with imprecise lab test results
- Open Access
- 25 January 2018
- Published by MDPI AG in Information
- Vol. 9 (2) , 25
Querying Workflow Logs
A business process or workflow is an assembly of tasks that accomplishes a business goal. Business process management is the study of the design, configuration/implementation, enactment and monitoring, analysis, and re-design of workflows. The traditional methodology for the re-design and improvement of workflows relies on the well-known sequence of extract, transform, and load (ETL), data/process warehousing, and online analytical processing (OLAP) tools. In this paper, we study the ad hoc queryiny of process enactments for (data-centric) business processes, bypassing the traditional methodology for more flexibility in querying. We develop an algebraic query language based on “incident patterns” with four operators inspired from Business Process Model and Notation (BPMN) representation, allowing the user to formulate ad hoc queries directly over workflow logs. A formal semantics of this query language, a preliminary query evaluation algorithm, and a group of elementary properties of the operators are provided.
- 25 January 2018
- Published by MDPI AG in Information
- Vol. 9 (2) , 25
Open AccessQuerying Workflow Logs
A business process or workflow is an assembly of tasks that accomplishes a business goal. Business process management is the study of the design, configuration/implementation, enactment and monitoring, analysis, and re-design of workflows. The traditional methodology for the re-design and improvement of workflows relies on the well-known sequence of extract, transform, and load (ETL), data/process warehousing, and online analytical processing (OLAP) tools. In this paper, we study the ad hoc queryiny of process enactments for (data-centric) business processes, bypassing the traditional methodology for more flexibility in querying. We develop an algebraic query language based on “incident patterns” with four operators inspired from Business Process Model and Notation (BPMN) representation, allowing the user to formulate ad hoc queries directly over workflow logs. A formal semantics of this query language, a preliminary query evaluation algorithm, and a group of elementary properties of the operators are provided.
- 2 November 2011
- Published by Springer Nature in Service Oriented Computing and Applications
- Vol. 6 (2) , 131-149
Change impact analysis in service-based business processes
- 2 November 2011
- Published by Springer Nature in Service Oriented Computing and Applications
- Vol. 6 (2) , 131-149
Change impact analysis in service-based business processes
- 18 January 2011
- Published by IGI Global Scientific Publishing
Realizability Analysis of Top-Down Web Service Composition Specifications
Realizability Analysis of Top-Down Web Service Composition Specifications: 10.4018/978-1-59904-904-5.ch003: A conversation protocol specifies the desired global behaviors of a Web service composition in a top-down fashion. Before implementing a conversation
- 18 January 2011
- Published by IGI Global Scientific Publishing
Realizability Analysis of Top-Down Web Service Composition Specifications
Realizability Analysis of Top-Down Web Service Composition Specifications: 10.4018/978-1-59904-904-5.ch003: A conversation protocol specifies the desired global behaviors of a Web service composition in a top-down fashion. Before implementing a conversation
- 17 August 2007
- Published by Springer Nature in GeoInformatica
- Vol. 12 (2) , 117-142
One Way Distance: For Shape Based Similarity Search of Moving Object Trajectories
- 17 August 2007
- Published by Springer Nature in GeoInformatica
- Vol. 12 (2) , 117-142
One Way Distance: For Shape Based Similarity Search of Moving Object Trajectories
- 1 October 2005
- Published by IGI Global Scientific Publishing in International Journal of Web Services Research
- Vol. 2 (4) , 68-93
Realizability of Conversation Protocols with Message Contents
A promising way to model the global behavior of a Web Service composition is to characterize the set of conversations among the participating Web Services. A conversation protocol specifies the desired global behaviors of a Web Service composition. The realizability problem is to decide whether, given a conversation protocol, a Web Service composition can be synthesized that generates exactly the same set of conversations specified by the protocol. This is a key problem in the top-down specification of the Web Service compositions. In our earlier work, we developed sufficient conditions for realizability of conversation protocols based on a model that abstracts the contents of the messages. The present paper extends our earlier work by allowing message contents to be used in the realizability analysis. We show that taking the message contents into account yields more accurate analysis. To overcome the state-space explosion caused by the message contents, we propose symbolic analysis techniques for the realizability conditions. In addition, we show that the analysis of one of the realizability conditions — the autonomy condition — can be done using an iterative refinement approach.
- 1 October 2005
- Published by IGI Global Scientific Publishing in International Journal of Web Services Research
- Vol. 2 (4) , 68-93
Realizability of Conversation Protocols with Message Contents
A promising way to model the global behavior of a Web Service composition is to characterize the set of conversations among the participating Web Services. A conversation protocol specifies the desired global behaviors of a Web Service composition. The realizability problem is to decide whether, given a conversation protocol, a Web Service composition can be synthesized that generates exactly the same set of conversations specified by the protocol. This is a key problem in the top-down specification of the Web Service compositions. In our earlier work, we developed sufficient conditions for realizability of conversation protocols based on a model that abstracts the contents of the messages. The present paper extends our earlier work by allowing message contents to be used in the realizability analysis. We show that taking the message contents into account yields more accurate analysis. To overcome the state-space explosion caused by the message contents, we propose symbolic analysis techniques for the realizability conditions. In addition, we show that the analysis of one of the realizability conditions — the autonomy condition — can be done using an iterative refinement approach.
- 23 October 2002
- Published by Elsevier in Theoretical Computer Science
- Vol. 289 (1) , 191-204
Augmenting the discrete timed automaton with other data structures
- 23 October 2002
- Published by Elsevier in Theoretical Computer Science
- Vol. 289 (1) , 191-204
Augmenting the discrete timed automaton with other data structures
- 1 January 2001
- Published by Springer Nature
- p. 127-137
Counter Machines and the Safety and Disjointness Problems for Database Queries with Linear Constraints
- 1 January 2001
- Published by Springer Nature
- p. 127-137
Counter Machines and the Safety and Disjointness Problems for Database Queries with Linear Constraints