Presentation of the paper:
Role-Activity Diagrams Modeling Based on Workflow Mining
WeiDong Zhao; Weihui Dai; Anhua Wang; Xiaochun Fang
Computer Science and Information Engineering, 2009 WRI World Congress on , vol.4, no., pp.301,305, March 31 2009-April 2 2009
DOI: 10.1109/CSIE.2009.992
The document discusses relational algebra, which is a formal language used to query and manipulate relations in a relational database. It describes the basic operations in relational algebra like selection, projection, join, union, set difference, etc. and provides examples of how to write queries using each of these operations.
Regression analysis is a predictive modeling technique used to investigate relationships between variables. It allows one to estimate the effects of independent variables on a dependent variable. Regression analysis can be used for forecasting, time series modeling, and determining causal relationships. There are different types of regression depending on the number of variables and the shape of the regression line. Linear regression models the linear relationship between two variables using an equation with parameters estimated to minimize error. Correlation and covariance measures the strength and direction of association between variables. Analysis of variance (ANOVA) compares the means of groups within data. Heteroskedasticity refers to unequal variability of a dependent variable across the range of independent variable values.
The document summarizes a lecture on relational algebra and calculus. It defines relational algebra as a theoretical language used to query databases using operations that work on relations. It describes the five fundamental relational algebra operations and additional join, division, and aggregate operations. It then defines relational calculus as specifying what to retrieve from a database rather than how, and describes tuple and domain relational calculus using predicates, quantifiers, and tuple variables.
Mixing functional programming approaches in an object oriented languageMark Needham
The document discusses applying functional programming approaches in object-oriented languages like C#. It starts with examples of filtering arrays using predicates and shows how this can be refactored to be more functional. It introduces interfaces for predicates, delegates for functions, and anonymous methods. Lambdas, type inference, extension methods and LINQ are presented as ways to further improve the functional style. Concerns like performance and side effects are addressed. Overall it promotes embracing functional techniques like passing functions as values to gain abstraction and reduce errors while also discussing where object-oriented approaches are still useful.
The document discusses templates and polymorphism in C++. It introduces function templates as a way to write generic functions that can work on different data types. An example Min() function template is provided. Class templates are also discussed as a way to define generic container classes like vectors. The document explains how templates avoid code duplication. Polymorphic functions and virtual functions are compared, with virtual functions allowing runtime polymorphism through derived classes overriding base class functions. The use of templates and polymorphism in the Standard Template Library is covered.
International Journal of Computational Engineering Research(IJCER)ijceronline
International Journal of Computational Engineering Research(IJCER) is an intentional online Journal in English monthly publishing journal. This Journal publish original research work that contributes significantly to further the scientific knowledge in engineering and Technology.
The document describes a customer ordering system for a restaurant that aims to address problems with the current manual ordering process. It seeks to develop an online ordering and reservation system to allow customers to view menus and place orders online, which would streamline the ordering process for waiters and kitchen staff. The objectives are to develop online and mobile ordering interfaces, provide online menu information, increase sales and productivity, and analyze purchase history and pricing to increase profitability. The project will implement a system development lifecycle approach including planning, analysis, design, and implementation phases to design and build the new customer ordering system.
The document discusses relational algebra, which is a formal language used to query and manipulate relations in a relational database. It describes the basic operations in relational algebra like selection, projection, join, union, set difference, etc. and provides examples of how to write queries using each of these operations.
Regression analysis is a predictive modeling technique used to investigate relationships between variables. It allows one to estimate the effects of independent variables on a dependent variable. Regression analysis can be used for forecasting, time series modeling, and determining causal relationships. There are different types of regression depending on the number of variables and the shape of the regression line. Linear regression models the linear relationship between two variables using an equation with parameters estimated to minimize error. Correlation and covariance measures the strength and direction of association between variables. Analysis of variance (ANOVA) compares the means of groups within data. Heteroskedasticity refers to unequal variability of a dependent variable across the range of independent variable values.
The document summarizes a lecture on relational algebra and calculus. It defines relational algebra as a theoretical language used to query databases using operations that work on relations. It describes the five fundamental relational algebra operations and additional join, division, and aggregate operations. It then defines relational calculus as specifying what to retrieve from a database rather than how, and describes tuple and domain relational calculus using predicates, quantifiers, and tuple variables.
Mixing functional programming approaches in an object oriented languageMark Needham
The document discusses applying functional programming approaches in object-oriented languages like C#. It starts with examples of filtering arrays using predicates and shows how this can be refactored to be more functional. It introduces interfaces for predicates, delegates for functions, and anonymous methods. Lambdas, type inference, extension methods and LINQ are presented as ways to further improve the functional style. Concerns like performance and side effects are addressed. Overall it promotes embracing functional techniques like passing functions as values to gain abstraction and reduce errors while also discussing where object-oriented approaches are still useful.
The document discusses templates and polymorphism in C++. It introduces function templates as a way to write generic functions that can work on different data types. An example Min() function template is provided. Class templates are also discussed as a way to define generic container classes like vectors. The document explains how templates avoid code duplication. Polymorphic functions and virtual functions are compared, with virtual functions allowing runtime polymorphism through derived classes overriding base class functions. The use of templates and polymorphism in the Standard Template Library is covered.
International Journal of Computational Engineering Research(IJCER)ijceronline
International Journal of Computational Engineering Research(IJCER) is an intentional online Journal in English monthly publishing journal. This Journal publish original research work that contributes significantly to further the scientific knowledge in engineering and Technology.
The document describes a customer ordering system for a restaurant that aims to address problems with the current manual ordering process. It seeks to develop an online ordering and reservation system to allow customers to view menus and place orders online, which would streamline the ordering process for waiters and kitchen staff. The objectives are to develop online and mobile ordering interfaces, provide online menu information, increase sales and productivity, and analyze purchase history and pricing to increase profitability. The project will implement a system development lifecycle approach including planning, analysis, design, and implementation phases to design and build the new customer ordering system.
Relational algebra is the basic set of operations for the relational model, including unary operations like selection and projection, binary operations like various join types, and set operations like union and intersection. Relational algebra operations manipulate relations and produce new relations, allowing users to specify database queries. Common operations include selection to filter tuples, projection to select attributes, equijoins to match tuples on equality conditions, and outer joins to retain non-matching tuples.
The document discusses relational algebra and operations that can be performed on relations in a relational database. It describes unary operations like select and project that operate on a single relation, as well as binary operations like join, union, and difference that combine two relations. It also covers additional operations like aggregation, outer joins, and recursive closure that provide more advanced querying capabilities beyond the core relational algebra. The goal of relational algebra is to allow users to use a sequence of algebraic operations to specify database queries and retrieve relation data in a declarative manner.
What is Relational model
Characteristics
Relational constraints
Representation of schemas
characteristics and Constraints of Relational model with proper examples.
Updates and dealing with constraint violations in Relational model
This document discusses using machine learning techniques for learning to rank documents in information retrieval and web search applications. Specifically, it covers:
- Early attempts at using machine learning for ranking that were not very successful due to limited training data and modeling techniques.
- More recent approaches like learning to rank using pairwise preferences and ranking SVMs that directly optimize measures like NDCG and have seen more success by addressing hundreds of ranking features and customizing models for IR problems.
Dbms ii mca-ch5-ch6-relational algebra-2013Prosanta Ghosh
The document discusses relational algebra, which defines a set of operations for the relational model. The relational algebra operations can be divided into two groups: set operations from mathematical set theory including UNION, INTERSECTION, and SET DIFFERENCE; and operations developed specifically for relational databases including SELECT, PROJECT, and JOIN. The six basic relational algebra operators are SELECT, PROJECT, UNION, INTERSECTION, SET DIFFERENCE, and CARTESIAN PRODUCT. RELATIONAL expressions allow sequences of these operations to be combined to retrieve and manipulate data from relations.
This document describes a role-based collaborative process for crowdsourcing systems. It begins by presenting a case study of a crowdsourced road maintenance activity involving five stakeholder categories. It then discusses how each stakeholder has infrastructure mechanisms and functional goals in the system.
The document proposes that a targeted road maintenance activity can be carried out through a process where each stakeholder plays one or more roles to provide precise services. It notes that in such a crowdsourcing system, roles are central to clarify what each actor is expected to provide and expect from the system.
Finally, the document outlines its approach to defining roles and business skills, specifying crowd tasks and crowd roles, defining role interfaces and basic operations on interfaces,
The document discusses the different types of operators in C programming language including arithmetic, assignment, relational, logical, bitwise, conditional (ternary), and increment/decrement operators. It provides examples of how each operator is used in C code and what operation they perform on variables and values.
This document provides an introduction to algorithms and algorithm analysis. It defines an algorithm as a set of unambiguous instructions to solve a problem in a finite amount of time. The most famous early algorithm is Euclid's algorithm for calculating greatest common divisors. Algorithm analysis involves proving an algorithm's correctness and analyzing its running time and space complexity. Common notations for analyzing complexity include Big-O, which provides upper bounds, Big-Omega, which provides lower bounds, and Big-Theta, which provides tight bounds. The goal of analysis is to determine the most efficient algorithm by evaluating performance as problem size increases.
This document discusses functions in C programming. It defines what a function is and explains why we use functions. There are two types of functions - predefined and user-defined. User-defined functions have elements like function declaration, definition, and call. Functions can pass parameters by value or reference. The document also discusses recursion, library functions, and provides examples of calculating sine series using functions.
The document describes the relational model for relational databases. It discusses the structure of relational databases including relations, tuples, attributes, domains, keys and relation schemas. It also describes the relational algebra query language including operators like select, project, join, union and set differences. Examples are provided to illustrate how to write queries using these operators to retrieve and manipulate data from relations that model real-world entities and relationships, like customers, accounts and loans in a banking example.
The document discusses Big O notation, which is used to classify algorithms based on how their running time scales with input size. It provides examples of common Big O notations like O(1), O(log n), O(n), O(n^2), and O(n!). The document also explains that Big O looks only at the fastest growing term as input size increases. Well-chosen data structures can help reduce an algorithm's Big O complexity. For example, searching a sorted list is O(log n) rather than O(n) for an unsorted list.
The document discusses relational algebra and relational calculus. It describes unary and binary relational operations in relational algebra such as select, project, union, intersection, difference. It also covers additional operations like join, division and aggregate functions. The document then discusses tuple relational calculus and domain relational calculus, explaining expressions, quantifiers, and how they are used to form relational queries.
"What does it really mean for your system to be available, or how to define w...Fwdays
We will talk about system monitoring from a few different angles. We will start by covering the basics, then discuss SLOs, how to define them, and why understanding the business well is crucial for success in this exercise.
This talk will cover ScyllaDB Architecture from the cluster-level view and zoom in on data distribution and internal node architecture. In the process, we will learn the secret sauce used to get ScyllaDB's high availability and superior performance. We will also touch on the upcoming changes to ScyllaDB architecture, moving to strongly consistent metadata and tablets.
More Related Content
Similar to Role-Activity Diagrams Modeling Based on Workflow Mining
Relational algebra is the basic set of operations for the relational model, including unary operations like selection and projection, binary operations like various join types, and set operations like union and intersection. Relational algebra operations manipulate relations and produce new relations, allowing users to specify database queries. Common operations include selection to filter tuples, projection to select attributes, equijoins to match tuples on equality conditions, and outer joins to retain non-matching tuples.
The document discusses relational algebra and operations that can be performed on relations in a relational database. It describes unary operations like select and project that operate on a single relation, as well as binary operations like join, union, and difference that combine two relations. It also covers additional operations like aggregation, outer joins, and recursive closure that provide more advanced querying capabilities beyond the core relational algebra. The goal of relational algebra is to allow users to use a sequence of algebraic operations to specify database queries and retrieve relation data in a declarative manner.
What is Relational model
Characteristics
Relational constraints
Representation of schemas
characteristics and Constraints of Relational model with proper examples.
Updates and dealing with constraint violations in Relational model
This document discusses using machine learning techniques for learning to rank documents in information retrieval and web search applications. Specifically, it covers:
- Early attempts at using machine learning for ranking that were not very successful due to limited training data and modeling techniques.
- More recent approaches like learning to rank using pairwise preferences and ranking SVMs that directly optimize measures like NDCG and have seen more success by addressing hundreds of ranking features and customizing models for IR problems.
Dbms ii mca-ch5-ch6-relational algebra-2013Prosanta Ghosh
The document discusses relational algebra, which defines a set of operations for the relational model. The relational algebra operations can be divided into two groups: set operations from mathematical set theory including UNION, INTERSECTION, and SET DIFFERENCE; and operations developed specifically for relational databases including SELECT, PROJECT, and JOIN. The six basic relational algebra operators are SELECT, PROJECT, UNION, INTERSECTION, SET DIFFERENCE, and CARTESIAN PRODUCT. RELATIONAL expressions allow sequences of these operations to be combined to retrieve and manipulate data from relations.
This document describes a role-based collaborative process for crowdsourcing systems. It begins by presenting a case study of a crowdsourced road maintenance activity involving five stakeholder categories. It then discusses how each stakeholder has infrastructure mechanisms and functional goals in the system.
The document proposes that a targeted road maintenance activity can be carried out through a process where each stakeholder plays one or more roles to provide precise services. It notes that in such a crowdsourcing system, roles are central to clarify what each actor is expected to provide and expect from the system.
Finally, the document outlines its approach to defining roles and business skills, specifying crowd tasks and crowd roles, defining role interfaces and basic operations on interfaces,
The document discusses the different types of operators in C programming language including arithmetic, assignment, relational, logical, bitwise, conditional (ternary), and increment/decrement operators. It provides examples of how each operator is used in C code and what operation they perform on variables and values.
This document provides an introduction to algorithms and algorithm analysis. It defines an algorithm as a set of unambiguous instructions to solve a problem in a finite amount of time. The most famous early algorithm is Euclid's algorithm for calculating greatest common divisors. Algorithm analysis involves proving an algorithm's correctness and analyzing its running time and space complexity. Common notations for analyzing complexity include Big-O, which provides upper bounds, Big-Omega, which provides lower bounds, and Big-Theta, which provides tight bounds. The goal of analysis is to determine the most efficient algorithm by evaluating performance as problem size increases.
This document discusses functions in C programming. It defines what a function is and explains why we use functions. There are two types of functions - predefined and user-defined. User-defined functions have elements like function declaration, definition, and call. Functions can pass parameters by value or reference. The document also discusses recursion, library functions, and provides examples of calculating sine series using functions.
The document describes the relational model for relational databases. It discusses the structure of relational databases including relations, tuples, attributes, domains, keys and relation schemas. It also describes the relational algebra query language including operators like select, project, join, union and set differences. Examples are provided to illustrate how to write queries using these operators to retrieve and manipulate data from relations that model real-world entities and relationships, like customers, accounts and loans in a banking example.
The document discusses Big O notation, which is used to classify algorithms based on how their running time scales with input size. It provides examples of common Big O notations like O(1), O(log n), O(n), O(n^2), and O(n!). The document also explains that Big O looks only at the fastest growing term as input size increases. Well-chosen data structures can help reduce an algorithm's Big O complexity. For example, searching a sorted list is O(log n) rather than O(n) for an unsorted list.
The document discusses relational algebra and relational calculus. It describes unary and binary relational operations in relational algebra such as select, project, union, intersection, difference. It also covers additional operations like join, division and aggregate functions. The document then discusses tuple relational calculus and domain relational calculus, explaining expressions, quantifiers, and how they are used to form relational queries.
Similar to Role-Activity Diagrams Modeling Based on Workflow Mining (20)
"What does it really mean for your system to be available, or how to define w...Fwdays
We will talk about system monitoring from a few different angles. We will start by covering the basics, then discuss SLOs, how to define them, and why understanding the business well is crucial for success in this exercise.
This talk will cover ScyllaDB Architecture from the cluster-level view and zoom in on data distribution and internal node architecture. In the process, we will learn the secret sauce used to get ScyllaDB's high availability and superior performance. We will also touch on the upcoming changes to ScyllaDB architecture, moving to strongly consistent metadata and tablets.
Lee Barnes - Path to Becoming an Effective Test Automation Engineer.pdfleebarnesutopia
So… you want to become a Test Automation Engineer (or hire and develop one)? While there’s quite a bit of information available about important technical and tool skills to master, there’s not enough discussion around the path to becoming an effective Test Automation Engineer that knows how to add VALUE. In my experience this had led to a proliferation of engineers who are proficient with tools and building frameworks but have skill and knowledge gaps, especially in software testing, that reduce the value they deliver with test automation.
In this talk, Lee will share his lessons learned from over 30 years of working with, and mentoring, hundreds of Test Automation Engineers. Whether you’re looking to get started in test automation or just want to improve your trade, this talk will give you a solid foundation and roadmap for ensuring your test automation efforts continuously add value. This talk is equally valuable for both aspiring Test Automation Engineers and those managing them! All attendees will take away a set of key foundational knowledge and a high-level learning path for leveling up test automation skills and ensuring they add value to their organizations.
Dandelion Hashtable: beyond billion requests per second on a commodity serverAntonios Katsarakis
This slide deck presents DLHT, a concurrent in-memory hashtable. Despite efforts to optimize hashtables, that go as far as sacrificing core functionality, state-of-the-art designs still incur multiple memory accesses per request and block request processing in three cases. First, most hashtables block while waiting for data to be retrieved from memory. Second, open-addressing designs, which represent the current state-of-the-art, either cannot free index slots on deletes or must block all requests to do so. Third, index resizes block every request until all objects are copied to the new index. Defying folklore wisdom, DLHT forgoes open-addressing and adopts a fully-featured and memory-aware closed-addressing design based on bounded cache-line-chaining. This design offers lock-free index operations and deletes that free slots instantly, (2) completes most requests with a single memory access, (3) utilizes software prefetching to hide memory latencies, and (4) employs a novel non-blocking and parallel resizing. In a commodity server and a memory-resident workload, DLHT surpasses 1.6B requests per second and provides 3.5x (12x) the throughput of the state-of-the-art closed-addressing (open-addressing) resizable hashtable on Gets (Deletes).
Discover the Unseen: Tailored Recommendation of Unwatched ContentScyllaDB
The session shares how JioCinema approaches ""watch discounting."" This capability ensures that if a user watched a certain amount of a show/movie, the platform no longer recommends that particular content to the user. Flawless operation of this feature promotes the discover of new content, improving the overall user experience.
JioCinema is an Indian over-the-top media streaming service owned by Viacom18.
How information systems are built or acquired puts information, which is what they should be about, in a secondary place. Our language adapted accordingly, and we no longer talk about information systems but applications. Applications evolved in a way to break data into diverse fragments, tightly coupled with applications and expensive to integrate. The result is technical debt, which is re-paid by taking even bigger "loans", resulting in an ever-increasing technical debt. Software engineering and procurement practices work in sync with market forces to maintain this trend. This talk demonstrates how natural this situation is. The question is: can something be done to reverse the trend?
The Microsoft 365 Migration Tutorial For Beginner.pptxoperationspcvita
This presentation will help you understand the power of Microsoft 365. However, we have mentioned every productivity app included in Office 365. Additionally, we have suggested the migration situation related to Office 365 and how we can help you.
You can also read: https://www.systoolsgroup.com/updates/office-365-tenant-to-tenant-migration-step-by-step-complete-guide/
Session 1 - Intro to Robotic Process Automation.pdfUiPathCommunity
👉 Check out our full 'Africa Series - Automation Student Developers (EN)' page to register for the full program:
https://bit.ly/Automation_Student_Kickstart
In this session, we shall introduce you to the world of automation, the UiPath Platform, and guide you on how to install and setup UiPath Studio on your Windows PC.
📕 Detailed agenda:
What is RPA? Benefits of RPA?
RPA Applications
The UiPath End-to-End Automation Platform
UiPath Studio CE Installation and Setup
💻 Extra training through UiPath Academy:
Introduction to Automation
UiPath Business Automation Platform
Explore automation development with UiPath Studio
👉 Register here for our upcoming Session 2 on June 20: Introduction to UiPath Studio Fundamentals: https://community.uipath.com/events/details/uipath-lagos-presents-session-2-introduction-to-uipath-studio-fundamentals/
QR Secure: A Hybrid Approach Using Machine Learning and Security Validation F...AlexanderRichford
QR Secure: A Hybrid Approach Using Machine Learning and Security Validation Functions to Prevent Interaction with Malicious QR Codes.
Aim of the Study: The goal of this research was to develop a robust hybrid approach for identifying malicious and insecure URLs derived from QR codes, ensuring safe interactions.
This is achieved through:
Machine Learning Model: Predicts the likelihood of a URL being malicious.
Security Validation Functions: Ensures the derived URL has a valid certificate and proper URL format.
This innovative blend of technology aims to enhance cybersecurity measures and protect users from potential threats hidden within QR codes 🖥 🔒
This study was my first introduction to using ML which has shown me the immense potential of ML in creating more secure digital environments!
From Natural Language to Structured Solr Queries using LLMsSease
This talk draws on experimentation to enable AI applications with Solr. One important use case is to use AI for better accessibility and discoverability of the data: while User eXperience techniques, lexical search improvements, and data harmonization can take organizations to a good level of accessibility, a structural (or “cognitive” gap) remains between the data user needs and the data producer constraints.
That is where AI – and most importantly, Natural Language Processing and Large Language Model techniques – could make a difference. This natural language, conversational engine could facilitate access and usage of the data leveraging the semantics of any data source.
The objective of the presentation is to propose a technical approach and a way forward to achieve this goal.
The key concept is to enable users to express their search queries in natural language, which the LLM then enriches, interprets, and translates into structured queries based on the Solr index’s metadata.
This approach leverages the LLM’s ability to understand the nuances of natural language and the structure of documents within Apache Solr.
The LLM acts as an intermediary agent, offering a transparent experience to users automatically and potentially uncovering relevant documents that conventional search methods might overlook. The presentation will include the results of this experimental work, lessons learned, best practices, and the scope of future work that should improve the approach and make it production-ready.
Northern Engraving | Modern Metal Trim, Nameplates and Appliance PanelsNorthern Engraving
What began over 115 years ago as a supplier of precision gauges to the automotive industry has evolved into being an industry leader in the manufacture of product branding, automotive cockpit trim and decorative appliance trim. Value-added services include in-house Design, Engineering, Program Management, Test Lab and Tool Shops.
What is an RPA CoE? Session 1 – CoE VisionDianaGray10
In the first session, we will review the organization's vision and how this has an impact on the COE Structure.
Topics covered:
• The role of a steering committee
• How do the organization’s priorities determine CoE Structure?
Speaker:
Chris Bolin, Senior Intelligent Automation Architect Anika Systems
In our second session, we shall learn all about the main features and fundamentals of UiPath Studio that enable us to use the building blocks for any automation project.
📕 Detailed agenda:
Variables and Datatypes
Workflow Layouts
Arguments
Control Flows and Loops
Conditional Statements
💻 Extra training through UiPath Academy:
Variables, Constants, and Arguments in Studio
Control Flow in Studio
Getting the Most Out of ScyllaDB Monitoring: ShareChat's TipsScyllaDB
ScyllaDB monitoring provides a lot of useful information. But sometimes it’s not easy to find the root of the problem if something is wrong or even estimate the remaining capacity by the load on the cluster. This talk shares our team's practical tips on: 1) How to find the root of the problem by metrics if ScyllaDB is slow 2) How to interpret the load and plan capacity for the future 3) Compaction strategies and how to choose the right one 4) Important metrics which aren’t available in the default monitoring setup.
AppSec PNW: Android and iOS Application Security with MobSFAjin Abraham
Mobile Security Framework - MobSF is a free and open source automated mobile application security testing environment designed to help security engineers, researchers, developers, and penetration testers to identify security vulnerabilities, malicious behaviours and privacy concerns in mobile applications using static and dynamic analysis. It supports all the popular mobile application binaries and source code formats built for Android and iOS devices. In addition to automated security assessment, it also offers an interactive testing environment to build and execute scenario based test/fuzz cases against the application.
This talk covers:
Using MobSF for static analysis of mobile applications.
Interactive dynamic security assessment of Android and iOS applications.
Solving Mobile app CTF challenges.
Reverse engineering and runtime analysis of Mobile malware.
How to shift left and integrate MobSF/mobsfscan SAST and DAST in your build pipeline.
"NATO Hackathon Winner: AI-Powered Drug Search", Taras KlobaFwdays
This is a session that details how PostgreSQL's features and Azure AI Services can be effectively used to significantly enhance the search functionality in any application.
In this session, we'll share insights on how we used PostgreSQL to facilitate precise searches across multiple fields in our mobile application. The techniques include using LIKE and ILIKE operators and integrating a trigram-based search to handle potential misspellings, thereby increasing the search accuracy.
We'll also discuss how the azure_ai extension on PostgreSQL databases in Azure and Azure AI Services were utilized to create vectors from user input, a feature beneficial when users wish to find specific items based on text prompts. While our application's case study involves a drug search, the techniques and principles shared in this session can be adapted to improve search functionality in a wide range of applications. Join us to learn how PostgreSQL and Azure AI can be harnessed to enhance your application's search capability.
inQuba Webinar Mastering Customer Journey Management with Dr Graham HillLizaNolte
HERE IS YOUR WEBINAR CONTENT! 'Mastering Customer Journey Management with Dr. Graham Hill'. We hope you find the webinar recording both insightful and enjoyable.
In this webinar, we explored essential aspects of Customer Journey Management and personalization. Here’s a summary of the key insights and topics discussed:
Key Takeaways:
Understanding the Customer Journey: Dr. Hill emphasized the importance of mapping and understanding the complete customer journey to identify touchpoints and opportunities for improvement.
Personalization Strategies: We discussed how to leverage data and insights to create personalized experiences that resonate with customers.
Technology Integration: Insights were shared on how inQuba’s advanced technology can streamline customer interactions and drive operational efficiency.
inQuba Webinar Mastering Customer Journey Management with Dr Graham Hill
Role-Activity Diagrams Modeling Based on Workflow Mining
1. Role-activity Diagrams Modeling
Based on Workflow Mining
2009 World Congress on Computer Science and Information Engineering
Weidong Zhao, Anhua Wang, Xiaochun Fang @ Software School, Fudan University, Shanghai, China
Weihui Dai @ Management School, Fudan University, Shanghai, China
Presentation by Onur Yılmaz - onur@onuryilmaz.me
3. Introduction
Role Activity Diagram (RAD) a basic role-oriented process model
Process
Models
Activity-based
Process Models
Role-oriented
Process Models
5. Introduction
Adapted from cross-functional
process models
Using sub-processes to describe
process roles’ responsibility
So as to highlight the interaction
between roles
Role-activity
diagrams (RAD)
6. Introduction
RAD requires a deep knowledge
of processes and organizational
model so as to identify roles.
Role-activity
diagrams (RAD)
7. Introduction
Workflow management systems
produce lots of logs
Process mining can reconstruct
process models from real
workflow logs
Thus workflow mining may be a
more objective method for role
identification
Workflow Mining
8. Introduction
•This paper is based on hypotheses:
• Actors playing the same role have similar duties, abilities and
characteristics
• Activities performed by these actors stand for their work
• So roles can be identified by discovering actors with similar work from
workflow logs
9. Introduction
Existing Methods
α algorithm can mine the WF-net
the dependence between activities
Organizational mining
actors are the center of business processes and social networks can be drawn
out by analyzing business relations among actors
10. Introduction
Existing Methods
Role engineering
the role-mining tool ORCA aggregates permissions bottom-up
into a role hierarchy using clustering analysis interactively
with the aid of business experts
11. Introduction
What is presented?
Workflow mining is used for role identification
taking the work similarity of actors as a criterion
Role mining, the interaction between roles are
analyzed through social network diagrams among
actors, and finally role-activity diagrams is mined.
12. Basic Concepts
Set of all activities in workflow logs
A = {a1, a2,…, am}
m = |A| is the number of activities in workflow logs
13. Basic Concepts
Set of all process actors
P = {p1, p2,…, pn}
where n is the number of actors
14. Basic Concepts
Set of all workflow instances in logs I
and for any workflow instance i ∈ I, i= (a1 a2 … ak),
AS(i) is the set of activities in the instance i
sequence of activities a1 a2 … ak represents the actual
execution ordering.
15. Basic Concepts
Activity b depends on activity a, a>b
If
such that
According to definition, a>b means that activity b is executed after
activity a and there exists no other activities between.
16. Basic Concepts
Activity b depends on activity a directly (direct dependence)
if for each workflow instance i ∈ I, there only exists a>b but not b>a
Dependence between activity a and b is consistent in all workflow
instances. It hints that there exists state transition from activity a to
b.
17. Basic Concepts
Given I, we can find all the activity pairs, which accord with the direct
dependence.
The activity pairs is denoted as DEP
18. Basic Concepts
Clothing production system
a inquiry and quoting
b contract signing
c prototype designing
d fabric requiring
e fabric drawing
f fabric purchasing
g fabric processing
19. Basic Concepts
6 workflow instances
i1 = {abcg},
i2 = {abdecg},
i3 = {abcdeg},
i4= {abdeg},
i5 = {abdceg},
i6 = {abdfecg}
WF-net model using the α algorithm
20. Basic Concepts
DEP of the clothing production
workflow
{(a, b), (a, c), (a, d), (a, e), (a, f), (a, g),
(b, c), (b, d), (b, e), (b, f), (b, g), (c, g),
(d, e), (d, f), (d, g), (e, g),(f, e), (f, g)}
WF-net model using the α algorithm
21. Basic Concepts
Adjacent activity set adjAS
where S and Av are two activity sets
For any activity in adjAS(b), it belongs to Av but not S, and there
exists dependence between the activity and other activities in S
22. Basic Concepts
In this paper, roles are identified by the ratio of the times actors
executing each activity to the total times of these actors executing all
activities
total of pi executing
related activities
times(pi, aj) is the times of
pi executing aj
Tom 100 times in total, in which “Fabric requiring” is executed 30 times, thus
R(Tom, Fabric requiring) = 0.3
23. Basic Concepts
Vector of activity execution in the work of the actor pi
S(pi, Au)=(R(pi, a1), R(pi, a2),…,R(pi, ak))
k-dimension vector of activities the actor pi takes charge of
For example,
R(Tom, fabric requiring)=0.3
R(Tom, fabric checkout) = 0.4
R(Tom, production inspection) = 0.05,
vector of Tom (0.3, 0.4, 0.05)
24. Basic Concepts
Difference degree of activity set Au
average difference of activity execution by the actors.
Larger difference degree means more difference between actors in
their work.
In this paper, the difference degree is used to identify process roles.
29. Role Mining
It is assumed that
Actors who play the same role are responsible for the sub-
process (activity set) whose
difference degree is less than the predefined threshold T
30. Role Mining
Mining the activity set executed by each role
Discover sub-processes in which
activities are executed by actors
playing the same roles
31. Input:
the activity set A,
dependence set DEP
threshold T
Output:
sub-processes
corresponding to
each role
32. If 1 is left
Select the smallest
difference degree
Adjacent activity
set from dependent
ones
Add if not
exceeding the
threshold
33. {a} has the least
dependence degree
D({a}) = 0.046
adjAS(a) = {b}
activity b is added
and D({a, b}) = 0.27
Example
Threshold T= 0.33
the adjacent activity
set of {a, b} {c, d}
D({a, b, c}) = 0.345
D({a, b, d}) = 0.379
Both larger than T.
Roles: {a, b}
34. {d} has the least
dependence degree
D({d}) = 0.051
adjAS(d) = {c, e, f}.
activity c is added
and D({d, c})=0.164
e is added and
D({d, c, e})=0.219
d→f and f→e,
f is added to the
activity set for
principle of order
preserving.
Roles: {a, b}, {d, c, e, f}
Example
Threshold T= 0.33
35. {g} is the only remainder
Roles: {a, b}, {d, c, e, f}, {g}
Example
Threshold T= 0.33
36. Role Mining
Mining the activity set executed by each role
{a,b}
{a,b}
{a,b}
{d,c,e,f}
{d,c,e,f}
{d,c,e,f}
{d,c,e,f}
{g}
{g}
{g}
37. RAD Modeling
Activity set taken by each role makes up sub-processes in
RAD modeling and the sub-processes
Can be identified by presented algorithm
In this paper, the interaction between roles based on social
network analysis is modeled.
38. RAD Modeling
Activity dependence between process actors pi, pj is denoted as
rel(pi, pj) = {(a, b)|i ∈ I, i = (a1a2…a b…ak), pi, pj ∈ P,
a is executed by pi,
b is executed by pj , and a → b.
Interaction between roles based on the activity dependence
between actors.
39. RAD Modeling
If there exists direct dependence between activity a and b, and
in a workflow instance, activity a is executed by the actor pi and
activity b is executed by actor pj, then the activity pair (a, b)
shows that pj depends on pi.
Person pi Role Ri
Role Rj
Activity ap
Activity aq
Assigned
Assigned
Responsible
Responsible
Dependence
(From workflow log)
Person pj
42. RAD Modeling
Threshold Values
By comparison, it seems that we can get better role identification
results when T is set between 0.3 and 0.4
It needs further probative work
43. Conclusion
How to identify roles and their interactions is necessary
for RAD modeling but most of methods for addressing
the issue seem to be subjective
In this paper, workflow mining is used to discover process
roles
44. Conclusion
Future Work
Threshold T is not easy to choose
More research should be done to mine workflow models
with the loop-structure
45. References
[1] Zhao Weidong , Huang Lihua(2004). Role-based multi-agent workflow systems. Chinese Journal of
Management Science, vol7, no2, pp 55-62(in Chinese)
[2] Mentzas G, Christos, Kavadias S(2001). Modeling business process with workflow systems: an evaluation of
alternative approaches. International Journal of Information Management,vol 21,no.2 ,pp123-135
[3] Phalp K T, Henderson P, Walters R J, et al(1998). RolEnact: role-based enactable models of business processes.
Information and Software Technology, vol40,no.3, pp123-133
[4] Ould M. Business Processes: Modeling and analysis for reengineering and improvement, New York:John Wiley
& Sons, 1995
[5] Wil M.P V, Weijters A J(2003). Process mining: a research agenda, Computers in Industry, vol.53, no.3, pp231-244
[6] Wil M.P V, Song M(1998). Discovering models of software processes from event-based data], ACM Transactions
on Software Engineering and Methodology, vol.7,no.3, pp215-249
[7] Wil M.P V, Song M(2004). Mining social networks: Uncovering interaction patterns in business processes, Business
Process Management,pp244-260
[8] Schlegelmich J, Steffens U(2005). Role mining with ORCA. Proceedings of the tenth ACM symposium on Access
control models and technologies. Stockholm, Sweden: SACMAT,pp168-176
[9] Liu D R, Shen M(2003). Workflow modeling for virtual processes: An order-preserving process-view approach.
Information Systems, vol.28,no.6,pp505-532
46. Role-activity Diagrams Modeling
Based on Workflow Mining
2009 World Congress on Computer Science and Information Engineering
Weidong Zhao, Anhua Wang, Xiaochun Fang @ Software School, Fudan University, Shanghai, China
Weihui Dai @ Management School, Fudan University, Shanghai, China
Presentation by Onur Yılmaz - onur@onuryilmaz.me