2003-09-24 - WOFEX 03’ Using Modified Concept Lattices for Organizational Structure Modeling and Analysis Ivo Vondrak Jan Kozusznik Dept. of Computer Science.

Slides:



Advertisements
Similar presentations
Charting the Potential of Description Logic for the Generation of Referring Expression SELLC, Guangzhou, Dec Yuan Ren, Kees van Deemter and Jeff.
Advertisements

More on Decoders and Muxes
Lecture 24 MAS 714 Hartmut Klauck
Λ14 Διαδικτυακά Κοινωνικά Δίκτυα και Μέσα Positive and Negative Relationships Chapter 5, from D. Easley and J. Kleinberg book.
Key Stage 3 National Strategy Scientific enquiry Science.
Knowledge Representation
Petr Gajdoš _ VŠB-TU Ostrava _ 2004Page - 1 Concepts Valuation by Conjugate Möebius Function Background Context, Concept and Concept Lattice Diversity.
The University of Georgia Department of Computer Science Department of Computer Science Introducing Parallelism through Sorting Integrating Concepts from.
RBM in the context of Operations and Programme and Project Management Material of the Technical Assistance Unit (TAU)
Soft computing Lecture 6 Introduction to neural networks.
Boolean Algebra Applications1 BOOLEAN ALGEBRA APPLICATIONS RELIABILITY OF CIRCUITS.
Planning Value of Planning What to consider when planning a lesson Learning Performance Structure of a Lesson Plan.
CAD/CAM Design Process and the role of CAD. Design Process Engineering and manufacturing together form largest single economic activity of western civilization.
THIS IS THE TITLE OF MY POSTER. THIS IS THE TITLE OF MY POSTER NAMES, NAMES, & NAMES This is my abstract. This is my abstract. This is my abstract. This.
1 Ivan Lanese Computer Science Department University of Bologna Italy Concurrent and located synchronizations in π-calculus.
Embedded Systems Laboratory Department of Computer and Information Science Linköping University Sweden Formal Verification and Model Checking Traian Pop.
1 Foundations of Interval Computation Trong Wu Phone: Department of Computer Science Southern Illinois University Edwardsville.
Network Formation Games. Netwok Formation Games NFGs model distinct ways in which selfish agents might create and evaluate networks We’ll see two models:
CSC 3130: Automata theory and formal languages Andrej Bogdanov The Chinese University of Hong Kong DFA minimization.
Guidelines for Best Practices in Educational Use of Virtual Instrumentation Presentation created by Adina Glava Babeş – Bolyai University of Cluj-Napoca,
Science and Engineering Practices
Graphs, relations and matrices
Exponents 3² Mrs. 3 × Mrs. 3 3 × 3 3².
Public Budgeting and Finance. Donald Kettl: Decision about how much of society’s resources we want to take from the private sector to use for problems.
Copyright © Cengage Learning. All rights reserved. CHAPTER 11 ANALYSIS OF ALGORITHM EFFICIENCY ANALYSIS OF ALGORITHM EFFICIENCY.
{ Senate Hearing Project Kathryn Gustafson Farmington High School.
Teaching Teaching Discrete Mathematics and Algorithms & Data Structures Online G.MirkowskaPJIIT.
General Considerations for Implementation
Bell ringer What is your study plan for midterms on Monday and Tuesday?
The Data Attribution Abdul Saboor PhD Research Student Model Base Development and Software Quality Assurance Research Group Freie.
1 Plaxton Routing. 2 Introduction Plaxton routing is a scalable mechanism for accessing nearby copies of objects. Plaxton mesh is a data structure that.
INFORMATION LITERACY Definition and Importance. The American Library Association  The American Library Association gives the following definition for.
Lots of Squares: An Example from the Digital Library Sean Nank, PhD Tiffany Obrien Del Lago Academy October 25, 2014.
RELATIONAL FAULT TOLERANT INTERFACE TO HETEROGENEOUS DISTRIBUTED DATABASES Prof. Osama Abulnaja Afraa Khalifah
© Ronaldo Menezes, Florida Tech Fundamentals of Algorithmic Problem Solving  Algorithms are not answers to problems  They are specific instructions for.
ARTIFICIAL INTELLIGENCE [INTELLIGENT AGENTS PARADIGM] Professor Janis Grundspenkis Riga Technical University Faculty of Computer Science and Information.
Software Engineering Prof. Ing. Ivo Vondrak, CSc. Dept. of Computer Science Technical University of Ostrava
CIS 540 Principles of Embedded Computation Spring Instructor: Rajeev Alur
7 th Workshop on Intelligent and Knowledge Oriented Technologies Smolenice WIKT 2012 Reduction of Computation Times of GOSCL Algorithm Using.
Mentoring Mentoring embraces a philosophy about people and how important they are to educational institutions.
1 Capturing Requirements As Use Cases To be discussed –Artifacts created in the requirements workflow –Workers participating in the requirements workflow.
Propositional Calculus CS 270: Mathematical Foundations of Computer Science Jeremy Johnson.
9 th International Workshop on Intuitionistic Fuzzy Sets and Generalized Nets, 8 October 2010, Warsaw, Poland Utilizing the Model Graphic Structures when.
Theory of Computation, Feodor F. Dragan, Kent State University 1 TheoryofComputation Spring, 2015 (Feodor F. Dragan) Department of Computer Science Kent.
Common Core Reading Standards for Science. CCSS.ELA-Literacy.RST CITE specific textual evidence to support analysis of science and technical texts,
On the Relation between SAT and BDDs for Equivalence Checking Sherief Reda Rolf Drechsler Alex Orailoglu Computer Science & Engineering Dept. University.
Emerging Trend Detection Shenzhi Li. Introduction What is an Emerging Trend? –An Emerging Trend is a topic area for which one can trace the growth of.
1 / 48 Formal a Language Theory and Describing Semantics Principles of Programming Languages 4.
Relations. Important Definitions We covered all of these definitions on the board on Monday, November 7 th. Definition 1 Definition 2 Definition 3 Definition.
1 Organizations as Rational Systems I. Introducing Rationality (1) The machine analogy –essential parts which are well designed into a functional whole.
Christopher M. Bishop, Pattern Recognition and Machine Learning 1.
Quantified Data Automata on Skinny Trees: an Abstract Domain for Lists Pranav Garg 1, P. Madhusudan 1 and Gennaro Parlato 2 1 University of Illinois at.
Concepts/ definitions/ meanings of program plan, program scheme, program development, concept paper Program plan is a systematic arrangement of elements.
Great Theoretical Ideas in Computer Science for Some.
Presented by Kyumars Sheykh Esmaili Description Logics for Data Bases (DLHB,Chapter 16) Semantic Web Seminar.
1 CPSC 320: Intermediate Algorithm Design and Analysis July 14, 2014.
Instance Discovery and Schema Matching With Applications to Biological Deep Web Data Integration Tantan Liu, Fan Wang, Gagan Agrawal {liut, wangfa,
Computationally speaking, we can partition problems into two categories. Easy Problems and Hard Problems We can say that easy problem ( or in some languages.
Definition and Technologies Knowledge Representation.
1 St. Joseph School District Paul Numedahl September 29, 2010· St. Joseph MO.
A Solution to the Recall Problem using Rough Set Theory Professor Djamel Bouchaffra (Advisor) Tarek Dakhlallah (Ph.D. Student) Computer Science & Engineering.
Mohammed I DAABO COURSE CODE: CSC 355 COURSE TITLE: Data Structures.
Mentoring Mentoring embraces a philosophy about people and how important they are to educational institutions.
Instructor: Rajeev Alur
Current Issues or Challenges in Visual Analytics
Associative Query Answering via Query Feature Similarity
Introduction Artificial Intelligent.
Jianping Fan Dept of Computer Science UNC-Charlotte
First and last name D E P T O F L First and last name A B R Y M
Introduction to the PRISM Framework
Presentation transcript:

WOFEX 03’ Using Modified Concept Lattices for Organizational Structure Modeling and Analysis Ivo Vondrak Jan Kozusznik Dept. of Computer Science VSB-Technical University of Ostrava Czech Republic

WOFEX 03’ Business Modeling Business Process Modeling Data/Object Modeling Organizational Structure Modeling – There is no view capturing organization structure of roles implemented by human resources participating in processes being modeled.

WOFEX 03’ Business Processes

WOFEX 03’ Table of Responsibilities RegClassChck.iChck.hPhonDecPaySend Manager X X XX Claim handler XXXX Accountant XXXXX Assistant XXX Secretary XXXX

WOFEX 03’ Organizational structure creating Re g ClassChck.iChck.hPhoneDe c PaySendManager X X XX Claim handler XXXX Accountant XXXXX Assistant XXX Secretary XXXX

WOFEX 03’ Concept Analysis Concept analysis theory can be used for grouping of objects that have common attributes. Context is a binary relation T between a set of objects O and set of attributes A. It means that T  O  A For any set of objects O  O, their set of common attributes is defined as  (O) = { a  A |  o  O : (o,a)  T } For any set of attributes A  A, their set of common objects is defined as  (A) = { o  O |  a  A : (o,a)  T } A pair (O,A) is called a concept if A =  (O) and in the same time O =  (A).

WOFEX 03’ Informal Description RegClassChck.iChck.hPhonDecPaySen d Manager X X XX Claim handler XXXX Accountant XXXXX Assistant XXX Secretary XXXX Concepts Context The tables of competencies correspond with Boolean tables(context). Objects of the relation are substituted by roles and attributes of objects are substituted by activities that the roles are responsible for.

WOFEX 03’ Concept Lattice  The very important property is that all concepts of a given table form a partial order via (O 1,A 1 )  (O 2,A 2 )  O 1  O 2 (equivalent to A 1  A 2 )  It was proven that such set of concepts constitutes a complete lattice called concept lattice L(T)  Visualization of concept lattice –Graph nodes represent concepts and arcs their ordering –The top-most node is a concept with the biggest number of objects (roles) –Concept node is labeled with an activity if it is the largest concept that contains this activity –Concept node is labeled with role if it is the smallest concept that contains this role

WOFEX 03’ Visualization concept lattice provides alternate views on the information contained in the above-described table - it enables to visualize the structure “hidden” in the binary relation. Obviously, the more complex is the table of responsibilities the more difficult is to understand who is responsible for what.

WOFEX 03’ Roles Related to the Activity In concept lattice we can find who can be responsible for selected activity.

WOFEX 03’ Activities Related to the Role we can easy find what activities is selected role responsible for.

WOFEX 03’ The question is how to evaluate identified concept from point of view if they should or should not be the source of organizational units? Is it appropriate to put together these roles with the common set of activities or not? Organizational Units The nodes of concept lattice can be considered as a potential source of how the organizational units can be defined. An unit related to administrative operations

WOFEX 03’ Let’s introduce the new notion of Knowledge Diversity that reflects the width of knowledge required by the concept Knowledge Sharing and Diversity Knowledge sharing - K share : A  A -> K share (a i, a j ) = 1 for activities a i and a j that share the same common knowledge, K share (a i, a j ) = 0 if no knowledge is shared. K share (a i, a j ) = 1 for i=j. Knowledge diversity – K div : {(O,A)} -> where K div (O,A) = 1 -  K share (a i, a j )/ | A | 2. a  A we would like to have in one organizational unit activities that have something in common - we would call it Knowledge Sharing

WOFEX 03’ Reg. Clas.Chck.i.Chck.h. Phone.Dec.Pay.Send. Reg. 11 Clas. 11 Chck.i. 11 Chck.h 11 Phone. 111 Dec. 11 Pay. 11 Send. 111 Based on Knowledge sharing definition a Table of the knowledge sharing among activities can be defined. K share definition

WOFEX 03’ Visualization of K div Concept of Low Knowledge Diversity Concept of High Knowledge Diversity The higher is the knowledge diversity the darker is the node representing the concept.

WOFEX 03’ Organizational structure construction

WOFEX 03’ Result organizational structure

WOFEX 03’ Conclusion Presented method of concept analysis provides exact and formally well defined way how the organizational structure can be analyzed and constructed future research: – searching for easy and precision way of knowledge sharing definition – searching for some better visualisation of concept lattice – define exact strategy for organize structure construction from concept lattice