Refine
Year of publication
- 2024 (127)
- 2023 (256)
- 2022 (301)
- 2021 (293)
- 2020 (241)
- 2019 (378)
- 2018 (259)
- 2017 (259)
- 2016 (277)
- 2015 (301)
- 2014 (301)
- 2013 (301)
- 2012 (332)
- 2011 (328)
- 2010 (342)
- 2009 (369)
- 2008 (311)
- 2007 (312)
- 2006 (330)
- 2005 (303)
- 2004 (323)
- 2003 (254)
- 2002 (250)
- 2001 (221)
- 2000 (245)
- 1999 (236)
- 1998 (242)
- 1997 (220)
- 1996 (202)
- 1995 (192)
- 1994 (174)
- 1993 (154)
- 1992 (144)
- 1991 (100)
- 1990 (108)
- 1989 (111)
- 1988 (104)
- 1987 (105)
- 1986 (81)
- 1985 (84)
- 1984 (75)
- 1983 (70)
- 1982 (57)
- 1981 (54)
- 1980 (61)
- 1979 (58)
- 1978 (52)
- 1977 (32)
- 1976 (30)
- 1975 (28)
- 1974 (17)
- 1973 (12)
- 1972 (17)
- 1971 (11)
- 1970 (2)
- 1969 (2)
- 1968 (2)
- 1967 (1)
- 1963 (1)
- 1925 (1)
Institute
- Fachbereich Medizintechnik und Technomathematik (2074)
- Fachbereich Elektrotechnik und Informationstechnik (1184)
- Fachbereich Wirtschaftswissenschaften (1158)
- Fachbereich Energietechnik (1115)
- Fachbereich Chemie und Biotechnologie (912)
- Fachbereich Maschinenbau und Mechatronik (868)
- Fachbereich Luft- und Raumfahrttechnik (798)
- Fachbereich Bauingenieurwesen (711)
- IfB - Institut für Bioengineering (690)
- INB - Institut für Nano- und Biotechnologien (615)
Language
- German (5114)
- English (4909)
- Russian (14)
- Portuguese (6)
- Multiple languages (5)
- Spanish (3)
- Dutch (2)
- Italian (1)
Document Type
- Article (5646)
- Conference Proceeding (1639)
- Book (1079)
- Part of a Book (559)
- Bachelor Thesis (327)
- Patent (174)
- Report (101)
- Doctoral Thesis (79)
- Other (76)
- Administrative publication (76)
Keywords
- Amtliche Mitteilung (71)
- Bachelor (33)
- Aachen University of Applied Sciences (31)
- Master (31)
- Prüfungsordnung (31)
- Bauingenieurwesen (30)
- Lesbare Fassung (28)
- Biosensor (25)
- Fachhochschule Aachen (23)
- Illustration (23)
Zugriffsart
- campus (2147)
- weltweit (1860)
- bezahl (766)
- fachbereichsweit (FB4) (34)
With a steady increase of regulatory requirements for business processes, automation support of compliance management is a field garnering increasing attention in Information Systems research. Several approaches have been developed to support compliance checking of process models. One major challenge for such approaches is their ability to handle different modeling techniques and compliance rules in order to enable widespread adoption and application. Applying a structured literature search strategy, we reflect and discuss compliance-checking approaches in order to provide an insight into their generalizability and evaluation. The results imply that current approaches mainly focus on special modeling techniques and/or a restricted set of types of compliance rules. Most approaches abstain from real-world evaluation which raises the question of their practical applicability. Referring to the search results, we propose a roadmap for further research in model-based business process compliance checking.
Given the strong increase in regulatory requirements for business processes the management of business process compliance becomes a more and more regarded field in IS research. Several methods have been developed to support compliance checking of conceptual models. However, their focus on distinct modeling languages and mostly linear (i.e., predecessor-successor related) compliance rules may hinder widespread adoption and application in practice. Furthermore, hardly any of them has been evaluated in a real-world setting. We address this issue by applying a generic pattern matching approach for conceptual models to business process compliance checking in the financial sector. It consists of a model query language, a search algorithm and a corresponding modelling tool prototype. It is (1) applicable for all graph-based conceptual modeling languages and (2) for different kinds of compliance rules. Furthermore, based on an applicability check, we (3) evaluate the approach in a financial industry project setting against its relevance for decision support of audit and compliance management tasks.
We prove characterizations of the existence of perfect ƒ-matchings in uniform mengerian and perfect hypergraphs. Moreover, we investigate the ƒ-factor problem in balanced hypergraphs. For uniform balanced hypergraphs we prove two existence theorems with purely combinatorial arguments, whereas for non-uniform balanced hypergraphs we show that the ƒ-factor problem is NP-hard.
Most drugs are no longer produced in their own countries by the pharmaceutical companies, but by contract manufacturers or at manufacturing sites in countries that can produce more cheaply. This not only makes it difficult to trace them back but also leaves room for criminal organizations to fake them unnoticed. For these reasons, it is becoming increasingly difficult to determine the exact origin of drugs. The goal of this work was to investigate how exactly this is possible by using different spectroscopic methods like nuclear magnetic resonance and near- and mid-infrared spectroscopy in combination with multivariate data analysis. As an example, 56 out of 64 different paracetamol preparations, collected from 19 countries around the world, were chosen to investigate whether it is possible to determine the pharmaceutical company, manufacturing site, or country of origin. By means of suitable pre-processing of the spectra and the different information contained in each method, principal component analysis was able to evaluate manufacturing relationships between individual companies and to differentiate between production sites or formulations. Linear discriminant analysis showed different results depending on the spectral method and purpose. For all spectroscopic methods, it was found that the classification of the preparations to their manufacturer achieves better results than the classification to their pharmaceutical company. The best results were obtained with nuclear magnetic resonance and near-infrared data, with 94.6%/99.6% and 98.7/100% of the spectra of the preparations correctly assigned to their pharmaceutical company or manufacturer.