Auswahl der wissenschaftlichen Literatur zum Thema „Process querying“
Geben Sie eine Quelle nach APA, MLA, Chicago, Harvard und anderen Zitierweisen an
Inhaltsverzeichnis
Machen Sie sich mit den Listen der aktuellen Artikel, Bücher, Dissertationen, Berichten und anderer wissenschaftlichen Quellen zum Thema "Process querying" bekannt.
Neben jedem Werk im Literaturverzeichnis ist die Option "Zur Bibliographie hinzufügen" verfügbar. Nutzen Sie sie, wird Ihre bibliographische Angabe des gewählten Werkes nach der nötigen Zitierweise (APA, MLA, Harvard, Chicago, Vancouver usw.) automatisch gestaltet.
Sie können auch den vollen Text der wissenschaftlichen Publikation im PDF-Format herunterladen und eine Online-Annotation der Arbeit lesen, wenn die relevanten Parameter in den Metadaten verfügbar sind.
Zeitschriftenartikel zum Thema "Process querying"
Wang, Jianmin, Tao Jin, Raymond K. Wong und Lijie Wen. „Querying business process model repositories“. World Wide Web 17, Nr. 3 (13.04.2013): 427–54. http://dx.doi.org/10.1007/s11280-013-0210-z.
Der volle Inhalt der QuelleCHANDRA, S., D. I. BLOCKLEY und N. J. WOODMAN. „QUALITATIVE QUERYING OF PHYSICAL PROCESS SIMULATIONS“. Civil Engineering Systems 10, Nr. 3 (Juli 1993): 225–42. http://dx.doi.org/10.1080/02630259308970125.
Der volle Inhalt der QuelleKunze, Matthias, Matthias Weidlich und Mathias Weske. „Querying process models by behavior inclusion“. Software & Systems Modeling 14, Nr. 3 (03.12.2013): 1105–25. http://dx.doi.org/10.1007/s10270-013-0389-6.
Der volle Inhalt der QuelleNgoc Chan, Nguyen, Nattawat Nonsung und Walid Gaaloul. „Service querying to support process variant development“. Journal of Systems and Software 122 (Dezember 2016): 538–52. http://dx.doi.org/10.1016/j.jss.2015.07.050.
Der volle Inhalt der QuelleJin, Tao, Jianmin Wang, Marcello La Rosa, Arthur ter Hofstede und Lijie Wen. „Efficient querying of large process model repositories“. Computers in Industry 64, Nr. 1 (Januar 2013): 41–49. http://dx.doi.org/10.1016/j.compind.2012.09.008.
Der volle Inhalt der QuellePolyvyanyy, Artem, Chun Ouyang, Alistair Barros und Wil M. P. van der Aalst. „Process querying: Enabling business intelligence through query-based process analytics“. Decision Support Systems 100 (August 2017): 41–56. http://dx.doi.org/10.1016/j.dss.2017.04.011.
Der volle Inhalt der QuelleMerazi, Afaf, und Mimoun Malki. „SQUIREL: Semantic Querying Interlinked OWL-S traveling Process Models“. International Journal of Information Technology and Computer Science 7, Nr. 12 (08.11.2015): 30–39. http://dx.doi.org/10.5815/ijitcs.2015.12.04.
Der volle Inhalt der QuelleP, Ezhumalai, und Ezhilvanji S. „Bandwidth Optimized Resource Allocation Process in Querying Distributed Storage“. International Innovative Research Journal of Engineering and Technology 3, Nr. 3 (31.03.2018): 18–21. http://dx.doi.org/10.32595/iirjet.org/v3i3.2018.61.
Der volle Inhalt der QuelleCao, Bin, Jiaxing Wang, Jing Fan, Jianwei Yin und Tianyang Dong. „Querying Similar Process Models Based on the Hungarian Algorithm“. IEEE Transactions on Services Computing 10, Nr. 1 (01.01.2017): 121–35. http://dx.doi.org/10.1109/tsc.2016.2597143.
Der volle Inhalt der QuellePolyvyanyy, Artem, Anastasiia Pika und Arthur H. M. ter Hofstede. „Scenario-based process querying for compliance, reuse, and standardization“. Information Systems 93 (November 2020): 101563. http://dx.doi.org/10.1016/j.is.2020.101563.
Der volle Inhalt der QuelleDissertationen zum Thema "Process querying"
Kunze, Matthias. „Searching business process models by example“. Phd thesis, Universität Potsdam, 2013. http://opus.kobv.de/ubp/volltexte/2013/6884/.
Der volle Inhalt der QuelleGeschäftsprozesse bilden die Grundlage eines jeden Unternehmens, da jedes Produkt und jede Dienstleistung das Ergebnis einer Reihe von Arbeitsschritten sind, deren Ablauf einen Geschäftsprozess darstellen. Das Geschäftsprozessmanagement rückt diese Prozesse ins Zentrum der Betrachtung und stellt Methoden bereit, um Prozesse umzusetzen, abzuwickeln und, basierend auf einer Auswertung ihrer Ausführung, zu verbessern. Zu diesem Zweck werden Geschäftsprozesse in Form von Prozessmodellen dokumentiert, welche die auszuführenden Arbeitsschritte und ihre Ausführungsbeziehungen erfassen und damit eine wesentliche Grundlage des Geschäftsprozessmanagements bilden. Um dieses Wissen verwerten zu können, muss es gut organisiert und leicht auffindbar sein – eine schwierige Aufgabe angesichts hunderter bzw. tausender Prozessmodelle, welche moderne Unternehmen unterhalten. In der Praxis haben sich bisher lediglich einfache Suchmethoden etabliert, zum Beispiel Freitextsuche in Prozessbeschreibungen. Wissenschaftliche Ansätze hingegen betrachten Ähnlichkeitsmaße und Anfragesprachen für Prozessmodelle, vernachlässigen dabei aber Maßnahmen zur effizienten Suche, sowie die verständliche Wiedergabe eines Suchergebnisses und Hilfestellungen für dessen Verwendung. Diese Dissertation stellt einen neuen Ansatz für die Prozessmodellsuche vor, wobei statt einer Anfragesprache Prozessmodelle zur Formulierung einer Anfrage verwendet werden, welche exemplarisch das Verhalten der gesuchten Prozesse beschreiben. Dieser Ansatz fußt auf einem formalen Framework, welches ein konzeptionelles Distanzmaß zur Bewertung gemeinsamen Verhaltens zweier Geschäftsprozesse definiert und die Grundlage zur Suche bildet. Darauf aufbauend werden Qualitätsmaße vorgestellt, die einem Benutzer bei der Bewertung von Suchergebnissen behilflich sind. Verhaltensausschnitte, die zur Aufnahme in das Suchergebnis geführt haben, können im Prozessmodell hervorgehoben werden. Die Arbeit führt zwei Suchtechniken ein, die konkrete Distanzmaße einsetzen, um Prozesse zu suchen, die das Verhalten einer Anfrage exakt enthalten (Querying), oder diesem in Bezug auf das Verhalten ähnlich sind (Similarity Search). Für beide Techniken werden Indexstrukturen vorgestellt, die effizientes Suchen ermöglichen. Abschließend werden allgemeine Methoden zur Evaluierung von Prozessmodellsuchansätzen vorgestellt, mit welchen die genannten Suchtechniken überprüft werden. Im Ergebnis zeigen diese eine hohe Qualität der Suchergebnisse hinsichtlich einer Vergleichsstudie mit Prozessexperten, sowie gute Skalierbarkeit für große Prozessmodellsammlungen.
Kobeissi, Meriana. „A conversational AI Framework for Cognitive Process Analysis“. Electronic Thesis or Diss., Institut polytechnique de Paris, 2023. http://www.theses.fr/2023IPPAS025.
Der volle Inhalt der QuelleBusiness processes (BP) are the foundational pillars of organizations, encapsulating a range of structured activities aimed at fulfilling distinct organizational objectives. These processes, characterized by a plethora of tasks, interactions, and workflows, offer a structured methodology for overseeing crucial operations across diverse sectors. A pivotal insight for organizations has been the discernment of the profound value inherent in the data produced during these processes. Process analysis, a specialized discipline, ventures into these data logs, facilitating a deeper comprehension and enhancement of BPs. This analysis can be categorized into two perspectives: instance-level, which focuses on individual process executions, and process-level, which examines the overarching process.However, applying process analysis in practice poses challenges for users, involving the need to access data, navigate low-level APIs, and employ tool-dependent methods. Real-world application often encounters complexities and user-centric obstacles.Specifically, instance-level analysis demands users to access stored process execution data, a task that can be intricate for business professionals due to the requirement of mastering complex query languages like SQL and CYPHER. Conversely, process-level analysis of process data involves the utilization of methods and algorithms that harness process execution data extracted from information systems. These methodologies collectively fall under the umbrella of process mining techniques. The application of process mining confronts analysts with the intricate task of method selection, which involves sifting through unstructured method descriptions. Additionally, the application of process mining methods depends on specific tools and necessitates a certain level of technical expertise.To address these challenges, this thesis introduces AI-driven solutions, with a focus on integrating cognitive capabilities into process analysis to facilitate analysis tasks at both the instance level and the process level for all users. The primary objectives are twofold: Firstly, to enhance the accessibility of process execution data by creating an interface capable of automatically constructing the corresponding database query from natural language. This is complemented by proposing a suitable storage technique and query language that the interface should be designed around. In this regard, we introduce a graph metamodel based on Labeled Property Graph (LPG) for efficient data storage. Secondly, to streamline the discovery and accessibility of process mining techniques, we present a service-oriented architecture. This architecture comprises three core components: an LPG meta-model detailing process mining methods, a service-oriented REST API design tailored for these methods, and a component adept at matching user requirements expressed in natural language with appropriate services.For the validation of our graph metamodel, we utilized two publicly accessible process datasets available in both CSV and OCEL formats. These datasets were instrumental in evaluating the performance of our NL querying pipeline. We gathered NL queries from external users and produced additional ones through paraphrasing tools. Our service-oriented framework underwent an assessment using NL queries specifically designed for process mining service descriptions. Additionally, we carried out a use case study with external participants to evaluate user experience and to gather feedback. We publically provide the evaluation results to ensure reproducibility in the studied area
Cruz, Lívia Almada. „Consultas kNN em redes dependentes do tempo“. reponame:Repositório Institucional da UFC, 2013. http://www.repositorio.ufc.br/handle/riufc/18495.
Der volle Inhalt der QuelleSubmitted by Elineudson Ribeiro (elineudsonr@gmail.com) on 2016-07-11T18:24:05Z No. of bitstreams: 1 2013_dis_lacruz.pdf: 6954650 bytes, checksum: fbf7280f2f781976bae6e4474c2c16c6 (MD5)
Approved for entry into archive by Rocilda Sales (rocilda@ufc.br) on 2016-07-20T11:52:58Z (GMT) No. of bitstreams: 1 2013_dis_lacruz.pdf: 6954650 bytes, checksum: fbf7280f2f781976bae6e4474c2c16c6 (MD5)
Made available in DSpace on 2016-07-20T11:52:58Z (GMT). No. of bitstreams: 1 2013_dis_lacruz.pdf: 6954650 bytes, checksum: fbf7280f2f781976bae6e4474c2c16c6 (MD5) Previous issue date: 2013
In this dissertation we study the problem of processing k-nearest neighbours (kNN)queries in road networks considering the history of traffic conditions, in particular the case where the speed of moving objects is time-dependent. For instance, given that the user is at a given location at a certain time, the query returns the k points of interest (e.g., gas stations) that can be reached in the minimum amount of time. Previous solutions to answer kNN queries and others common queries in road networks do not work when the moving speed in each road is not constant. Building efficient and correct approaches and algorithms and storage and access schemes for processing these queries is a challenge because graph properties considered in static networks do not hold in the time dependent case. Our approach uses the well-known A∗ search algorithm by applying incremental network expansion and pruning unpromising vertices. The goal is reduce the percentage of network assessed in the search. To support the algorithm execution, we propose a storage and access method for time-dependent networks. We discuss the design and correctness of our algorithm and present experimental results that show the efficiency and effectiveness of our solution.
Nesta dissertação foi estudado o problema de processar consultas kNN em redes de rodovias considerando o histórico das condições de tráfego, em particular o caso onde a velocidade dos objetos móveis depende do tempo. Dado que um usuário está em uma dada localização e em um determinado instante de tempo, a consulta retorna os k pontos de interesse (por exemplo, postos de gasolina) que podem ser alcançados em uma quantidade de tempo mínima considerando condições históricas de tráfego. Soluções anteriores para consultas kNN e outras consultas comuns em redes de rodovia estáticas não funcionam quando o custo das arestas (tempo de viagem) é dependente do tempo. A construção de estratégias e algoritmos eficientes e corretos, e métodos de armazenamento e acesso para o processamento destas consultas é um desafio desde que algumas das propriedades de grafos comumente supostas em estratégias para redes estáticas não se mantêm para redes dependentes do tempo. O método proposto aplica uma busca A∗ à medida que vai, de maneira incremental, explorando a rede. O objetivo do método é reduzir o percentual da rede avaliado na busca. Para dar suporte à execução do algoritmo, foi também proposto um método para armazenamento e acesso para redes dependentes do tempo. A construção e a corretude do algoritmo são discutidas e são apresentados resultados experimentais com dados reais e sintéticos que mostram a eficiência da solução.
Cruz, LÃvia Almada. „Consultas kNN em redes dependentes do tempo“. Universidade Federal do CearÃ, 2013. http://www.teses.ufc.br/tde_busca/arquivo.php?codArquivo=10343.
Der volle Inhalt der QuelleNesta dissertaÃÃo foi estudado o problema de processar consultas kNN em redes de rodovias considerando o histÃrico das condiÃÃes de trÃfego, em particular o caso onde a velocidade dos objetos mÃveis depende do tempo. Dado que um usuÃrio està em uma dada localizaÃÃo e em um determinado instante de tempo, a consulta retorna os k pontos de interesse (por exemplo, postos de gasolina) que podem ser alcanÃados em uma quantidade de tempo mÃnima considerando condiÃÃes histÃricas de trÃfego. SoluÃÃes anteriores para consultas kNN e outras consultas comuns em redes de rodovia estÃticas nÃo funcionam quando o custo das arestas (tempo de viagem) à dependente do tempo. A construÃÃo de estratÃgias e algoritmos eficientes e corretos, e mÃtodos de armazenamento e acesso para o processamento destas consultas à um desafio desde que algumas das propriedades de grafos comumente supostas em estratÃgias para redes estÃticas nÃo se mantÃm para redes dependentes do tempo. O mÃtodo proposto aplica uma busca A∗ à medida que vai, de maneira incremental, explorando a rede. O objetivo do mÃtodo à reduzir o percentual da rede avaliado na busca. Para dar suporte à execuÃÃo do algoritmo, foi tambÃm proposto um mÃtodo para armazenamento e acesso para redes dependentes do tempo. A construÃÃo e a corretude do algoritmo sÃo discutidas e sÃo apresentados resultados experimentais com dados reais e sintÃticos que mostram a eficiÃncia da soluÃÃo.
In this dissertation we study the problem of processing k-nearest neighbours (kNN)queries in road networks considering the history of traffic conditions, in particular the case where the speed of moving objects is time-dependent. For instance, given that the user is at a given location at a certain time, the query returns the k points of interest (e.g., gas stations) that can be reached in the minimum amount of time. Previous solutions to answer kNN queries and others common queries in road networks do not work when the moving speed in each road is not constant. Building efficient and correct approaches and algorithms and storage and access schemes for processing these queries is a challenge because graph properties considered in static networks do not hold in the time dependent case. Our approach uses the well-known A∗ search algorithm by applying incremental network expansion and pruning unpromising vertices. The goal is reduce the percentage of network assessed in the search. To support the algorithm execution, we propose a storage and access method for time-dependent networks. We discuss the design and correctness of our algorithm and present experimental results that show the efficiency and effectiveness of our solution.
Baraldi, Andrea. „Pre-processing, classification and semantic querying of large-scale Earth observation spaceborne/airborne/terrestrial image databases: Process and product innovations“. Tesi di dottorato, 2017. http://www.fedoa.unina.it/11724/1/TesiDottorato_Unina_XXIX_AB_EO-IU4SQ_v4_RGB_10April2017.pdf.
Der volle Inhalt der Quelle„Querying early product chemistry in a complex process: A cold molecular beam approach for triglyceride pyrolysis: Cold molecular beam study of Triglycerides pyrolysis chemistry“. Tulane University, 2020.
Den vollen Inhalt der Quelle findenA cold molecular beam approach has been pioneered to investigate the pyrolysis reactions of triglycerides (TGs) as a function of temperature. Traditionally, an established repertoire of laser techniques is utilized for multiple species present, which has been extensively used for a detailed study of specifically targeted species that are often novel and reactive. Instead, we have applied these methods for the mass characterization of numerous product species as they appeared. Unlike traditional batch reactor studies of pyrolysis, where terminal products are identified and characterized generally using GC/MS methods, herein, product analysis was conducted in real time. Experiments were performed by recording mass spectra as a function of increasing sample temperature. For clearer results and interpretation, most studies employed model TGs containing a single fatty acid, such as oleic or stearic acid. Soft photoionization was conducted using 118 and 266 nm laser-based pulses. Time-of-flight mass spectroscopy (TOF-MS) was conducted after each photoionization pulse. Several novel direct observations include 1) the observation of initial cracking temperatures and the formation of non-aromatic and aromatic products; 2) the determination of key factors for pyrolysis—fatty acid detachment from the glycerol backbone and subsequent fatty acid pyrolysis; 3) the growth of C6 and C7 fragments as an important precursor for following association reactions. The use of 266 nm pulses exclusively facilitated the sensitive and selective photoionization of aromatic products and, thus, the thorough examination of the evolving aromatic products. Unlike the batch reactor studies of terminal products, the molecular beam studies of aromatic products revealed the evolution to a small number of selective and relatively massive polycyclic aromatic hydrocarbons (PAH). It is deduced that in a batch reactor, these undetected products ultimately lead to solids and tars that are difficult to analyze. Our investigation revealed that hydrogen addition showed some effectiveness in inhibiting formation of large
1
Ibrahi M. Alhroob
Fellmann, Michael. „Semantic Process Engineering – Konzeption und Realisierung eines Werkzeugs zur semantischen Prozessmodellierung“. Doctoral thesis, 2013. https://repositorium.ub.uni-osnabrueck.de/handle/urn:nbn:de:gbv:700-2013102311711.
Der volle Inhalt der QuelleBücher zum Thema "Process querying"
Polyvyanyy, Artem, Hrsg. Process Querying Methods. Cham: Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-030-92875-9.
Der volle Inhalt der QuelleKnowledge discovery process and methods to enhance organizational performance. Boca Raton, FL: CRC Press, Taylor & Francis Group, 2015.
Den vollen Inhalt der Quelle findenPolyvyanyy, Artem. Process Querying Methods. Springer International Publishing AG, 2022.
Den vollen Inhalt der Quelle findenBenatallah, Boualem, Seyed-Mehdi-Reza Beheshti, Sherif Sakr, Daniela Grigori, Hamid Reza Motahari-Nezhad, Moshe Chai Barukh, Ahmed Gater und Seung Hwan Ryu. Process Analytics: Concepts and Techniques for Querying and Analyzing Process Data. Springer, 2016.
Den vollen Inhalt der Quelle findenBenatallah, Boualem, Seyed-Mehdi-Reza Beheshti, Sherif Sakr, Daniela Grigori, Hamid Reza Motahari-Nezhad, Moshe Chai Barukh, Ahmed Gater und Seung Hwan Ryu. Process Analytics: Concepts and Techniques for Querying and Analyzing Process Data. Springer, 2018.
Den vollen Inhalt der Quelle findenBenatallah, Boualem, Seyed-Mehdi-Reza Beheshti, Sherif Sakr, Daniela Grigori und Hamid Reza Motahari-Nezhad. Process Analytics: Concepts and Techniques for Querying and Analyzing Process Data. Springer London, Limited, 2016.
Den vollen Inhalt der Quelle findenOsei-Bryson, Kweku-Muata, und Corlane Barclay. Knowledge Discovery Process and Methods to Enhance Organizational Performance. Taylor & Francis Group, 2023.
Den vollen Inhalt der Quelle findenBuchteile zum Thema "Process querying"
Schoknecht, Andreas, Tom Thaler, Ralf Laue, Peter Fettke und Andreas Oberweis. „Process Model Similarity Techniques for Process Querying“. In Process Querying Methods, 459–78. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-92875-9_16.
Der volle Inhalt der QuellePolyvyanyy, Artem. „Process Query Language“. In Process Querying Methods, 313–41. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-92875-9_11.
Der volle Inhalt der QuellePolyvyanyy, Artem. „Process Query Language“. In Process Querying Methods, 313–41. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-92875-9_11.
Der volle Inhalt der QuelleÁlvarez, Jose Miguel Pérez, Antonio Cancela Díaz, Luisa Parody, Antonia M. Reina Quintero und María Teresa Gómez-López. „Process Instance Query Language and the Process Querying Framework“. In Process Querying Methods, 85–111. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-92875-9_4.
Der volle Inhalt der QuelleÁlvarez, Jose Miguel Pérez, Antonio Cancela Díaz, Luisa Parody, Antonia M. Reina Quintero und María Teresa Gómez-López. „Process Instance Query Language and the Process Querying Framework“. In Process Querying Methods, 85–111. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-92875-9_4.
Der volle Inhalt der QuelleVogelgesang, Thomas, Jessica Ambrosy, David Becher, Robert Seilbeck, Jerome Geyer-Klingeberg und Martin Klenk. „Celonis PQL: A Query Language for Process Mining“. In Process Querying Methods, 377–408. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-92875-9_13.
Der volle Inhalt der QuelleDi Francescomarino, Chiara, und Paolo Tonella. „The BPMN Visual Query Language and Process Querying Framework“. In Process Querying Methods, 181–218. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-92875-9_7.
Der volle Inhalt der QuelleVogelgesang, Thomas, Jessica Ambrosy, David Becher, Robert Seilbeck, Jerome Geyer-Klingeberg und Martin Klenk. „Celonis PQL: A Query Language for Process Mining“. In Process Querying Methods, 377–408. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-92875-9_13.
Der volle Inhalt der QuelleDi Francescomarino, Chiara, und Paolo Tonella. „The BPMN Visual Query Language and Process Querying Framework“. In Process Querying Methods, 181–218. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-92875-9_7.
Der volle Inhalt der QuelleDelfmann, Patrick, Dennis M. Riehle, Steffen Höhenberger, Carl Corea und Christoph Drodt. „The Diagramed Model Query Language 2.0: Design, Implementation, and Evaluation“. In Process Querying Methods, 115–48. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-92875-9_5.
Der volle Inhalt der QuelleKonferenzberichte zum Thema "Process querying"
Awad, Ahmed, Artem Polyvyanyy und Mathias Weske. „Semantic Querying of Business Process Models“. In 2008 12th International IEEE Enterprise Distributed Object Computing Conference (EDOC). IEEE, 2008. http://dx.doi.org/10.1109/edoc.2008.11.
Der volle Inhalt der QuelleStörrle, Harald, und Vlad Acretoaie. „Querying business process models with VMQL“. In the 5th ACM SIGCHI Annual International Workshop. New York, New York, USA: ACM Press, 2013. http://dx.doi.org/10.1145/2492437.2492441.
Der volle Inhalt der QuelleYongsiriwit, Karn, Nguyen Ngoc Chan und Walid Gaaloul. „Log-Based Process Fragment Querying to Support Process Design“. In 2015 48th Hawaii International Conference on System Sciences (HICSS). IEEE, 2015. http://dx.doi.org/10.1109/hicss.2015.493.
Der volle Inhalt der QuelleStanchev, Lubomir. „Querying Incomplete Information Using Bag Relational Algebra“. In 2010 Second International Conference on Information, Process, and Knowledge Management (eKNOW). IEEE, 2010. http://dx.doi.org/10.1109/eknow.2010.9.
Der volle Inhalt der QuelleAndriamarozakaniaina, Tahiry, Véronique Gaildrat und Matthieu Pouget. „Process of indexing and querying for theatrical texts“. In the 2008 International Conference in Advances. New York, New York, USA: ACM Press, 2008. http://dx.doi.org/10.1145/1501750.1501870.
Der volle Inhalt der QuelleHan, Xue, Lianxue Hu, Jaydeep Sen, Yabin Dang, Buyu Gao, Vatche Isahagian, Chuan Lei et al. „Bootstrapping Natural Language Querying on Process Automation Data“. In 2020 IEEE International Conference on Services Computing (SCC). IEEE, 2020. http://dx.doi.org/10.1109/scc49832.2020.00030.
Der volle Inhalt der QuelleKobeissi, Meriana, Nour Assy, Walid Gaaloul, Bruno Defude und Bassem Haidar. „An Intent-Based Natural Language Interface for Querying Process Execution Data“. In 2021 3rd International Conference on Process Mining (ICPM). IEEE, 2021. http://dx.doi.org/10.1109/icpm53251.2021.9576850.
Der volle Inhalt der QuelleSakr, Sherif, und Ahmed Awad. „A framework for querying graph-based business process models“. In the 19th international conference. New York, New York, USA: ACM Press, 2010. http://dx.doi.org/10.1145/1772690.1772906.
Der volle Inhalt der QuelleKammerer, Klaus, Rudiger Pryss und Manfred Reichert. „Context-Aware Querying and Injection of Process Fragments in Process-Aware Information Systems“. In 2020 IEEE 24th International Enterprise Distributed Object Computing Conference (EDOC). IEEE, 2020. http://dx.doi.org/10.1109/edoc49727.2020.00022.
Der volle Inhalt der QuelleSong, Liang, Jianmin Wang, Lijie Wen, Wenxing Wang, Shijie Tan und Hui Kong. „Querying Process Models Based on the Temporal Relations between Tasks“. In 2011 15th IEEE International Enterprise Distributed Object Computing Conference Workshops (EDOCW). IEEE, 2011. http://dx.doi.org/10.1109/edocw.2011.12.
Der volle Inhalt der QuelleBerichte der Organisationen zum Thema "Process querying"
Bourgaux, Camille, und Anni-Yasmin Turhan. Temporal Query Answering in DL-Lite over Inconsistent Data. Technische Universität Dresden, 2017. http://dx.doi.org/10.25368/2022.236.
Der volle Inhalt der QuelleBond, W., Maria Seale und Jeffrey Hensley. A dynamic hyperbolic surface model for responsive data mining. Engineer Research and Development Center (U.S.), April 2022. http://dx.doi.org/10.21079/11681/43886.
Der volle Inhalt der QuelleKoopmann, Patrick. Ontology-Mediated Query Answering for Probabilistic Temporal Data with EL Ontologies (Extended Version). Technische Universität Dresden, 2018. http://dx.doi.org/10.25368/2022.242.
Der volle Inhalt der Quelle