scispace - formally typeset
Search or ask a question
Institution

Eindhoven University of Technology

EducationEindhoven, Noord-Brabant, Netherlands
About: Eindhoven University of Technology is a education organization based out in Eindhoven, Noord-Brabant, Netherlands. It is known for research contribution in the topics: Catalysis & Computer science. The organization has 22309 authors who have published 52936 publications receiving 1584164 citations. The organization is also known as: Technische Hogeschool Eindhoven & TU/e.


Papers
More filters
01 Jan 2002
TL;DR: This paper motivates the need for a new workflow language, specifies the semantics of the language, and shows that soundness can be verified in a compositional way.
Abstract: Based on a rigorous analysis of existing workflow management systems and workflow languages, a new workflow language is proposed: yet another workflow language (YAWL). To identify the differences between the various languages, we have collected a fairly complete set of workflow patterns. Based on these patterns we have evaluated several workflow products and detected considerable differences in their ability to capture control flows for non-trivial workflow processes. Languages based on Petri nets perform better when it comes to state-based workflow patterns. However, some patterns (e.g. involving multiple instances, complex synchronisations or non-local withdrawals) are not easy to map onto (high-level) Petri nets. This inspired us to develop a new language by taking Petri nets as a starting point and adding mechanisms to allow for a more direct and intuitive support of the workflow patterns identified. This paper motivates the need for such a language, specifies the semantics of the language, and shows that soundness can be verified in a compositional way. Although YAWL is intended as a complete workflow language, the focus of this paper is limited to the control-flow perspective.

977 citations

Reference EntryDOI
11 Feb 2014
TL;DR: In this paper, the authors outline the building blocks of the job demands-resources (JD-R) theory, a theory that has been inspired by job design and job stress theories.
Abstract: This chapter outlines the building blocks of the job demands–resources (JD-R) theory, a theory that has been inspired by job design and job stress theories. Whereas job design theories have often ignored the role of job stressors or demands, job stress models have largely ignored the motivating potential of job resources. JD-R theory combines the two research traditions, and explains how job demands and (job and personal) resources have unique and multiplicative effects on job stress and motivation. In addition, JD-R theory proposes reversed causal effects: whereas burned-out employees may create more job demands over time for themselves, engaged workers mobilize their own job resources to stay engaged. The chapter closes with a discussion of possible JD-R interventions.

958 citations

Book ChapterDOI
20 Jun 2005
TL;DR: The ProM framework is introduced and an overview of the plug-ins that have been developed and is flexible with respect to the input and output format, and is also open enough to allow for the easy reuse of code during the implementation of new process mining ideas.
Abstract: Under the umbrella of buzzwords such as “Business Activity Monitoring” (BAM) and “Business Process Intelligence” (BPI) both academic (e.g., EMiT, Little Thumb, InWoLvE, Process Miner, and MinSoN) and commercial tools (e.g., ARIS PPM, HP BPI, and ILOG JViews) have been developed. The goal of these tools is to extract knowledge from event logs (e.g., transaction logs in an ERP system or audit trails in a WFM system), i.e., to do process mining. Unfortunately, tools use different formats for reading/storing log files and present their results in different ways. This makes it difficult to use different tools on the same data set and to compare the mining results. Furthermore, some of these tools implement concepts that can be very useful in the other tools but it is often difficult to combine tools. As a result, researchers working on new process mining techniques are forced to build a mining infrastructure from scratch or test their techniques in an isolated way, disconnected from any practical applications. To overcome these kind of problems, we have developed the ProM framework, i.e., an “pluggable” environment for process mining. The framework is flexible with respect to the input and output format, and is also open enough to allow for the easy reuse of code during the implementation of new process mining ideas. This paper introduces the ProM framework and gives an overview of the plug-ins that have been developed.

958 citations

Journal ArticleDOI
TL;DR: It is proved that no polynomial algorithm can achieve a worst-case ratio less than 3/2 unlessP = NP, and a complexity classification for all special cases with a fixed number of processing times is obtained.
Abstract: We consider the following scheduling problem. There arem parallel machines andn independent jobs. Each job is to be assigned to one of the machines. The processing of jobj on machinei requires timep ij . The objective is to find a schedule that minimizes the makespan. Our main result is a polynomial algorithm which constructs a schedule that is guaranteed to be no longer than twice the optimum. We also present a polynomial approximation scheme for the case that the number of machines is fixed. Both approximation results are corollaries of a theorem about the relationship of a class of integer programming problems and their linear programming relaxations. In particular, we give a polynomial method to round the fractional extreme points of the linear program to integral points that nearly satisfy the constraints. In contrast to our main result, we prove that no polynomial algorithm can achieve a worst-case ratio less than 3/2 unlessP = NP. We finally obtain a complexity classification for all special cases with a fixed number of processing times.

953 citations

Journal ArticleDOI
TL;DR: In this article, the authors argue that a habit seems to be accompanied by an enduring cognitive orientation, which they refer to as "habitual mind-set" that makes an individual less attentive to new information and courses of action, and thus contributes to the maintenance of habits.
Abstract: Habit is often treated as a construct of marginal interest in the literature on attitude–behaviour relations. We argue that this is undeserved, particularly given the current interest in principles of automaticity in social psychology. Basic features of habits, such as goal-directed automaticity, their dependency on situational constancy, and functionality, as well as the measurement of habit strength, are discussed. Research is reviewed that contrasted habit with deliberate action, as approached from the theory of planned behaviour, spontaneous vs. deliberate attitude–behaviour processes, implementation intention theory, and decision-making models. Habits thus appear as boundary conditions of the validity of models of planned behaviour and rational decision-making. A habit seems to be accompanied by an enduring cognitive orientation, which we refer to as “habitual mind-set”, that makes an individual less attentive to new information and courses of action, and thus contributes to the maintenance of habitu...

950 citations


Authors

Showing all 22539 results

NameH-indexPapersCitations
Hans Clevers199793169673
Richard H. Friend1691182140032
J. Fraser Stoddart147123996083
Jean-Luc Brédas134102685803
Ulrich S. Schubert122222985604
Christoph J. Brabec12089668188
Daniel I. Sessler11997360318
Can Li116104960617
Vikram Deshpande11173244038
D. Grahame Hardie10927653856
Wil M. P. van der Aalst10872542429
Jacob A. Moulijn10875447505
Vincent M. Rotello10876652473
Silvia Bordiga10749841413
David N. Reinhoudt107108248814
Network Information
Related Institutions (5)
Delft University of Technology
94.4K papers, 2.7M citations

96% related

Georgia Institute of Technology
119K papers, 4.6M citations

95% related

École Polytechnique Fédérale de Lausanne
98.2K papers, 4.3M citations

95% related

Nanyang Technological University
112.8K papers, 3.2M citations

94% related

Hong Kong University of Science and Technology
52.4K papers, 1.9M citations

93% related

Performance
Metrics
No. of papers from the Institution in previous years
YearPapers
20241
202397
2022345
20212,907
20203,096
20192,584