Relevant bibliographies by topics / Process Model Matching

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers
  6. Reports

Academic literature on the topic 'Process Model Matching'

Author: Grafiati
Published: 4 June 2021
Last updated: 30 January 2023

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Process Model Matching.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Process Model Matching"

1

Xue, Xingsi. "Compact memetic algorithm-based process model matching." Soft Computing 23, no. 13 (December 3, 2018): 5249–57. http://dx.doi.org/10.1007/s00500-018-03672-y.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Ali, Muhammad, Khurram Shahzad, Syed Irtaza Muzaffar, and Muhammad Kamran Malik. "Deep Analysis of Process Model Matching Techniques." IEEE Access 8 (2020): 99239–53. http://dx.doi.org/10.1109/access.2020.2997097.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Shahzad, Khurram, Rao Muhammad Adeel Nawab, Adnan Abid, Kareem Sharif, Faizan Ali, Faisal Aslam, and Arslaan Mazhar. "A Process Model Collection and Gold Standard Correspondences for Process Model Matching." IEEE Access 7 (2019): 30708–23. http://dx.doi.org/10.1109/access.2019.2900174.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Pearce, Robert, Peter Ireland, and Eduardo Romero. "Thermal matching using Gaussian process regression." Proceedings of the Institution of Mechanical Engineers, Part G: Journal of Aerospace Engineering 234, no. 6 (January 28, 2020): 1172–80. http://dx.doi.org/10.1177/0954410020901961.

Full text
Abstract:
Thermal matching is a key stage of the development process for a gas turbine engine where component models are verified to ensure the correct metal temperature distribution has been used in life calculations. The thermal match involves adjusting parameters of a thermal model in order to match an experimental temperature distribution, usually obtained from a thermal paint test. Current methodologies involve manually adjusting parameters, which is both time consuming and leads to variation in the matches achieved. This paper presents a new method to conduct thermal matching, where Gaussian process regression is utilised to obtain a surrogate model from which optimal parameters for matching are obtained. This standardised procedure removes subjectivity from the match and gives faster and more consistent matches. The method is introduced and demonstrated for a number of cases involving a leading edge impingement system that has been isolated from a high pressure turbine blade.
APA, Harvard, Vancouver, ISO, and other styles
5

Cahyapratama, Afrianda, Kelly Rosa Sungkono, and Riyanarto Sarno. "Gap analysis business process model by using structural similarity." Indonesian Journal of Electrical Engineering and Computer Science 18, no. 1 (April 1, 2020): 124. http://dx.doi.org/10.11591/ijeecs.v18.i1.pp124-134.

Full text
Abstract:
<span>Gap analysis process model is a study that can help an institution to determine differences between business process models, such as a model of Standard Operating Procedure and a model of activities in an event log. Gap analysis is used for finding incomplete processes and can be obtained by using structural similarity. Structural similarity measures the similarity of activities and relationships depicting in the models. This research introduces a graph-matching algorithm as the structural similarity algorithm and compares it with dice coefficient algorithms. Graph-matching algorithm notices parallel relationships and invisible tasks, on the contrary dice coefficient algorithms only measure closeness between activities and relationships. The evaluation shows that the graph-matching algorithm produces 76.76 percent similarity between an SOP model and a process model generating from an event log; while, dice coefficient algorithms produces 70 percent similarity. The ability in detecting parallel relationships and invisible tasks causes the graph-matching algorithm produces a higher similarity value than dice coefficient algorithms.</span>
APA, Harvard, Vancouver, ISO, and other styles
6

Somogyi, Ferenc Attila, and Mark Asztalos. "Systematic review of matching techniques used in model-driven methodologies." Software and Systems Modeling 19, no. 3 (November 1, 2019): 693–720. http://dx.doi.org/10.1007/s10270-019-00760-x.

Full text
Abstract:
Abstract In model-driven methodologies, model matching is the process of finding a matching pair for every model element between two or more software models. Model matching is an important task as it is often used while differencing and merging models, which are key processes in version control systems. There are a number of different approaches to model matching, with most of them focusing on different goals, i.e., the accuracy of the matching process, or the generality of the algorithm. Moreover, there exist algorithms that use the textual representations of the models during the matching process. We present a systematic literature review that was carried out to obtain the state-of-the-art of model matching techniques. The search process was conducted based on a well-defined methodology. We have identified a total of 3274 non-duplicate studies, out of which 119 have been included as primary studies for this survey. We present the state-of-the-art of model matching, highlighting the differences between different matching techniques, mainly focusing on text-based and graph-based algorithms. Finally, the main open questions, challenges, and possible future directions in the field of model matching are discussed, also including topics like benchmarking, performance and scalability, and conflict handling.
APA, Harvard, Vancouver, ISO, and other styles
7

Xiong, Shiyong, Kaiwen Jiang, and Rongsen Wu. "Research on Rule Matching Model Based on Spark." Journal of Physics: Conference Series 2303, no. 1 (July 1, 2022): 012020. http://dx.doi.org/10.1088/1742-6596/2303/1/012020.

Full text
Abstract:
Abstract Rule engines are widely used in engineering and academic fields because they can flexibly separate facts and rules from the rule matching process. Since the rule matching process is very time-consuming, and the traditional rule matching uses single-computer operation when many facts and rules exceed the computer’s memory and computational capacity limit, it will cause the application to crash and paralyze. To solve the above problems, this paper investigates the Spark framework and Rete algorithm to take advantage of Spark’s in-memory computation to alleviate the time-consuming problem of the traditional rule matching process. A high-performance distributed rule matching model is designed by combining the actual rule matching scenario and the development process. In addition, according to the form of rules and facts in the actual scenario, this paper effectively divides the matching process and improves the scalability of the rule matching model.
APA, Harvard, Vancouver, ISO, and other styles
8

Meilicke, Christian, Henrik Leopold, Elena Kuss, Heiner Stuckenschmidt, and Hajo A. Reijers. "Overcoming individual process model matcher weaknesses using ensemble matching." Decision Support Systems 100 (August 2017): 15–26. http://dx.doi.org/10.1016/j.dss.2017.02.013.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Kuss, Elena, Henrik Leopold, Han van der Aa, Heiner Stuckenschmidt, and Hajo A. Reijers. "A probabilistic evaluation procedure for process model matching techniques." Data & Knowledge Engineering 117 (September 2018): 393–406. http://dx.doi.org/10.1016/j.datak.2018.04.008.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Shahzad, Khurram, Arslaan Mazhar, Ghulam Mustafa, and Faisal Aslam. "Effective Utilization of Supervised Learning Techniques for Process Model Matching." Computing and Informatics 39, no. 3 (2020): 361–84. http://dx.doi.org/10.31577/cai_2020_3_361.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Process Model Matching"

1

Klinkmüller, Christopher. "Adaptive Process Model Matching." Doctoral thesis, Universitätsbibliothek Leipzig, 2017. http://nbn-resolving.de/urn:nbn:de:bsz:15-qucosa-224884.

Full text
Abstract:
Process model matchers automate the detection of activities that represent similar functionality in different models. Thus, they provide support for various tasks related to the management of business processes including model collection management and process design. Yet, prior research primarily demonstrated the matchers’ effectiveness, i.e., the accuracy and the completeness of the results. In this context (i) the size of the empirical data is often small, (ii) all data is used for the matcher development, and (iii) the validity of the design decisions is not studied. As a result, existing matchers yield a varying and typically low effectiveness when applied to different datasets, as among others demonstrated by the process model matching contests in 2013 and 2015. With this in mind, the thesis studies the effectiveness of matchers by separating development from evaluation data and by empirically analyzing the validity and the limitations of design decisions. In particular, the thesis develops matchers that rely on different sources of information. First, the activity labels are considered as natural-language descriptions and the Bag-of-Words Technique is introduced which achieves a high effectiveness in comparison to the state of the art. Second, the Order Preserving Bag-of-Words Technique analyzes temporal dependencies between activities in order to automatically configure the Bag-of-Words Technique and to improve its effectiveness. Third, expert feedback is used to adapt the matchers to the domain characteristics of process model collections. Here, the Adaptive Bag-of-Words Technique is introduced which outperforms the state-of-the-art matchers and the other matchers from this thesis.
APA, Harvard, Vancouver, ISO, and other styles
2

Kuss, Elena [Verfasser], and Heiner [Akademischer Betreuer] Stuckenschmidt. "Evaluation of process model matching techniques / Elena Kuss ; Betreuer: Heiner Stuckenschmidt." Mannheim : Universitätsbibliothek Mannheim, 2019. http://d-nb.info/1183572700/34.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Kuss, Elena Verfasser], and Heiner [Akademischer Betreuer] [Stuckenschmidt. "Evaluation of process model matching techniques / Elena Kuss ; Betreuer: Heiner Stuckenschmidt." Mannheim : Universitätsbibliothek Mannheim, 2019. http://nbn-resolving.de/urn:nbn:de:bsz:180-madoc-492194.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Al, Hajri Abdullah Said Mechanical &amp Manufacturing Engineering Faculty of Engineering UNSW. "Logistics technology transfer model." Publisher:University of New South Wales. Mechanical & Manufacturing Engineering, 2008. http://handle.unsw.edu.au/1959.4/41469.

Full text
Abstract:
A consecutive number of studies on the adoption trend of logistics technology since 1988 revealed that logistics organizations are not in the frontier when it comes to adopting new technology and this delayed adoption creates an information gap. In the advent of supply chain management and the strategic position of logistics, the need for accurate and timely information to accompany the logistics executives became more important than ever before. Given the integrative nature of logistics technology, failure to implement the technology successfully could result in writing off major investments in developing and implementing the technology or even in abandoning the strategic initiatives underpinned by these innovations. Consequently, the need to employ effective strategies and models to cope with these uncertainties is rather crucial. This thesis addresses the aspect of uncertainty in implementation success by process and factor research models. Process research approach focuses on the sequence of events in the technology transfer process that occurs over time. It explains the story that explains the degree of association between these sequences and implementation success. Through content analysis, this research gathers, extracts, and categorizes process data of actual stories of logistics technology adoption and implementations in organizations that are published in literature. The extracted event sequences are then analyzed using optimal matching from natural science and grouped using cluster analysis. Four patterns were revealed that organizations follow to transfer logistics technology namely, formal minimalist, mutual adaptation, development concerned, and organizational roles dispenser. Factors that contribute to successful implementation in each pattern were defined as the crucial and necessary events that characterized and differentiated each pattern from others. The factor approach identifies the potential predictors of successful technology implementation and tests empirical association between predictors and outcomes. This research develops a logistics technology success model. In developing the model, various streams of research were investigated including logistics, information systems, and organizational psychology. The model is tested using a questionnaire survey study. The data were collected from Australian companies which have recently adopted and implemented logistics technology. The results of a partial least squares structured equation modeling provide strong support for the model constructs and valuable insights to logistics/supply chain managers. The last study reports a convergent triangulation study using multiple case study of three Australian companies which have implemented logistics technology. A within and a cross case analysis of the three cases provide cross validation for the results of the other two studies. The results provided high predictive validity for the two models. Furthermore, the case study approach was so beneficial in explaining and contextualizing the linkages of the factor-based model and in confirming the importance of the crucial events in the process-based model. The thesis concludes with a research and managerial implications chapter which is devoted for logistics/supply chain managers and researchers.
APA, Harvard, Vancouver, ISO, and other styles
5

Belhoul, Yacine. "Graph-based Ad Hoc Networks Topologies and Business Process Matching." Thesis, Lyon 1, 2013. http://www.theses.fr/2013LYO10202.

Full text
Abstract:
Un réseau mobile ad hoc (Mobile Ad hoc Network, MANET) est un réseau sans fil, formé dynamiquement par un ensemble d'utilisateurs équipés de terminaux mobiles, sans l'utilisation d'une infrastructure préexistante, ou d'une administration centralisée. Les équipements utilisés dans les MANETs sont limités par la capacité de la batterie, la puissance de calcul et la bande passante. Les utilisateurs des MANETs sont libres de se déplacer, ce qui induit à des topologies dynamiques dans le temps. Toutes ces contraintes ajoutent plus de challenges aux protocoles et services de communications afin de fonctionner dans les MANETs. L'évolution des réseaux de 4ème génération (4G) est appelée à intégrer les MANETs avec les autres types de réseaux afin d'étendre leurs portées. Nous nous sommes intéressés dans la première partie de cette thèse à quelques challenges connus dans les MANETs en proposant des solutions novatrices utilisant des propriétés intéressantes des topologies de graphes. Dans un premier temps, nous avons effectué une étude sur la prédiction de la mobilité afin de maintenir une topologie d'ensemble dominant connecté dans les MANETs. Nous avons proposé dans un autre travail comment construire des topologies de graphes ayant des propriétés globales en se basant seulement sur des informations locales des nœuds mobiles. Ces topologies servent comme overlay aux MANETs. Nous avons proposé des algorithmes distribués pour construire des alliances offensives et défensives globales minimales. Nous avons aussi défini des heuristiques pour ces algorithmes afin de réduire les tailles des alliances obtenues. La première partie de cette thèse est achevée par la proposition d'un framework pour la conception et l'analyse des protocoles de contrôle de topologie dans les MANETs. Nous avons identifié les points communs des algorithmes de contrôle de topologie conçus pour les réseaux mobiles ad hoc et nous avons enrichi le simulateur NS-2 avec un ensemble d'extensions pour supporter le contrôle de topologie
We are interested in this thesis to graph-based approaches to deal with some challenges in networking, namely, graph topologies of mobile ad hoc networks (MANETs) and process model matchmaking in large scale web service. We propose in the first part: (1) a generic mechanism using mobility information of nodes to maintain a graph topology of the network. We show particularly, how to use the prediction of future emplacements of nodes to maintain a connected dominating set of a given MANET. (2) distributed algorithms to construct minimal global offensive alliance and global defensive alliance sets in MANETs. We also introduce several heuristics to get a better approximation of the cardinality of the alliance sets which is a desirable property for practical considerations. (3) a framework to facilitate the design and evaluation of topology control protocols in MANETs. We propose in the framework, a common schema for topology control based on NS-2 simulator and inspired from the commonalities between the components of the topology control algorithms in MANETs. In the second part, we focus on process model matchmaking. We propose two graph-based solutions for process model inexact matching to deal with high computational time of existing work in the literature. In the first solution, we decompose the process models into their possible execution sequences. After, we propose generic graph techniques using string comparator metrics for process model matchmaking based on this decomposition. In order to get better optimization of the execution time and to deal with process model matching in large scale web services, the second solution combines a spectral graph matching with structural and semantic proposed approaches. This solution uses an eigen-decomposition projection technique that makes the runtime faster
APA, Harvard, Vancouver, ISO, and other styles
6

Harding, Bradley. "A Single Process Model of the Same-Different Task." Thesis, Université d'Ottawa / University of Ottawa, 2018. http://hdl.handle.net/10393/38329.

Full text
Abstract:
The Same-Different task has a long and controversial history in cognitive psychology. For over five decades, researchers have had many difficulties modelling the simple task, in which participants must respond as quickly and as accurately as possible whether two stimuli are the “Same” or “Different”. The main difficulty in doing so stems from the fact that “Same” decisions are much faster than can be modelled using a single process model without resorting to post-hoc processes, a finding since coined the fast-same phenomenon. In this thesis, I evaluate the strengths and shortcomings of past modelling endeavours, deconstruct the fast-same phenomenon while exploring the role of priming as its possible mechanism, investigate coactivity as a possible architecture underlying both decision modalities, and present an accumulator model whose assumptions and parameters stem from these results that predicts Same-Different performance (both response times and accuracies) using a single-process, a finding deemed near impossible by Sternberg (1998).
APA, Harvard, Vancouver, ISO, and other styles
7

Klinkmüller, Christopher [Verfasser], André [Akademischer Betreuer] Ludwig, and Stefan [Gutachter] Sackmann. "Adaptive Process Model Matching : Improving the Effectiveness of Label-Based Matching through Automated Configuration and Expert Feedback / Christopher Klinkmüller ; Gutachter: Stefan Sackmann ; Betreuer: André Ludwig." Leipzig : Universitätsbibliothek Leipzig, 2017. http://d-nb.info/1241064075/34.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Kreacic, Eleonora. "Some problems related to the Karp-Sipser algorithm on random graphs." Thesis, University of Oxford, 2017. http://ora.ox.ac.uk/objects/uuid:3b2eb52a-98f5-4af8-9614-e4909b8b9ffa.

Full text
Abstract:
We study certain questions related to the performance of the Karp-Sipser algorithm on the sparse Erdös-Rényi random graph. The Karp-Sipser algorithm, introduced by Karp and Sipser [34] is a greedy algorithm which aims to obtain a near-maximum matching on a given graph. The algorithm evolves through a sequence of steps. In each step, it picks an edge according to a certain rule, adds it to the matching and removes it from the remaining graph. The algorithm stops when the remining graph is empty. In [34], the performance of the Karp-Sipser algorithm on the Erdös-Rényi random graphs G(n,M = [cn/2]) and G(n, p = c/n), c > 0 is studied. It is proved there that the algorithm behaves near-optimally, in the sense that the difference between the size of a matching obtained by the algorithm and a maximum matching is at most o(n), with high probability as n → ∞. The main result of [34] is a law of large numbers for the size of a maximum matching in G(n,M = cn/2) and G(n, p = c/n), c > 0. Aronson, Frieze and Pittel [2] further refine these results. In particular, they prove that for c < e, the Karp-Sipser algorithm obtains a maximum matching, with high probability as n → ∞; for c > e, the difference between the size of a matching obtained by the algorithm and the size of a maximum matching of G(n,M = cn/2) is of order Θlog n(n1/5), with high probability as n → ∞. They further conjecture a central limit theorem for the size of a maximum matching of G(n,M = cn/2) and G(n, p = c/n) for all c > 0. As noted in [2], the central limit theorem for c < 1 is a consequence of the result of Pittel [45]. In this thesis, we prove a central limit theorem for the size of a maximum matching of both G(n,M = cn/2) and G(n, p = c/n) for c > e. (We do not analyse the case 1 ≤ c ≤ e). Our approach is based on the further analysis of the Karp-Sipser algorithm. We use the results from [2] and refine them. For c > e, the difference between the size of a matching obtained by the algorithm and the size of a maximum matching is of order Θlog n(n1/5), with high probability as n → ∞, and the study [2] suggests that this difference is accumulated at the very end of the process. The question how the Karp-Sipser algorithm evolves in its final stages for c > e, motivated us to consider the following problem in this thesis. We study a model for the destruction of a random network by fire. Let us assume that we have a multigraph with minimum degree at least 2 with real-valued edge-lengths. We first choose a uniform random point from along the length and set it alight. The edges burn at speed 1. If the fire reaches a node of degree 2, it is passed on to the neighbouring edge. On the other hand, a node of degree at least 3 passes the fire either to all its neighbours or none, each with probability 1/2. If the fire extinguishes before the graph is burnt, we again pick a uniform point and set it alight. We study this model in the setting of a random multigraph with N nodes of degree 3 and α(N) nodes of degree 4, where α(N)/N → 0 as N → ∞. We assume the edges to have i.i.d. standard exponential lengths. We are interested in the asymptotic behaviour of the number of fires we must set alight in order to burn the whole graph, and the number of points which are burnt from two different directions. Depending on whether α(N) » √N or not, we prove that after the suitable rescaling these quantities converge jointly in distribution to either a pair of constants or to (complicated) functionals of Brownian motion. Our analysis supports the conjecture that the difference between the size of a matching obtained by the Karp-Sipser algorithm and the size of a maximum matching of the Erdös-Rényi random graph G(n,M = cn/2) for c > e, rescaled by n1/5, converges in distribution.
APA, Harvard, Vancouver, ISO, and other styles
9

Logemann, Karsten. "Sensitivity analysis for an assignment incentive pay in the United States Navy enlisted personnel assignment process in a simulation environment." Thesis, Monterey, Calif. : Springfield, Va. : Naval Postgraduate School ; Available from National Technical Information Service, 2004. http://library.nps.navy.mil/uhtbin/hyperion/04Mar%5FLogemann.pdf.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Höffl, Marc. "A new programming model for enterprise software : Allowing for rapid adaption and supporting maintainability at scale." Thesis, KTH, Elkraftteknik, 2017. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-215103.

Full text
Abstract:
Companies are under constant pressure to adapt and improve their processes to staycompetitive. Since most of their processes are handled by software, it also needs toconstantly change. Those improvements and changes add up over time and increase thecomplexity of the system, which in turn prevents the company from further adaption.In order to change and improve existing business processes and their implementation withinsoftware, several stakeholders have to go through a long process. Current IT methodologies arenot suitable for such a dynamic environment. The analysis of this change process shows thatfour software characteristics are important to speed it up. They are: transparency, adaptability,testability and reparability. Transparency refers to the users capability to understand what thesystem is doing, where and why. Adaptability is a mainly technical characteristic that indicatesthe capability of the system to evolve or change. Testability allows automated testing andvalidation for correctness without requiring manual checks. The last characteristic is reparability,which describes the possibility to bring the system back into a consistent and correct state, evenif erroneous software was deployed.An architecture and software development patterns are evaluated to build an overall programmingmodel that provides the software characteristics. The overall architecture is basedon microservices, which facilitates decoupling and maintainability for the software as well asorganizations. Command Query Responsibility Segregation decouples read from write operationsand makes data changes explicit. With Event Sourcing, the system stores not only the currentstate, but all historic events. It provides a built-in audit trail and is able to reproduce differentscenarios for troubleshooting and testing.A demo process is defined and implemented within multiple prototypes. The design of theprototype is based on the programming model. It is built in Javascript and implements Microservices,CQRS and Event Sourcing. The prototypes show and validate how the programmingmodel provides the software characteristics. Software built with the programming model allowscompanies to iterate faster at scale. Since the programming model is suited for complex processes,the main limitation is that the validation is based on a demo process that is simpler and thebenefits are hard to quantify.
ör att fortsatt vara konkurrenskraftiga är företag under konstant press att anpassa ochförbättra sina processer. Eftersom de flesta processer hanteras av programvara, behöveräven de ständigt förändras. Övertiden leder dessa förbättringar och förändringar till ökadsystemkomplexitet, vilket i sin tur hindrar företaget från ytterligare anpassningar. För attförändra och förbättra befintliga affärsprocesser och dess programvara, måste idag typiskt fleraaktörer vara en del av en lång och tidskrävande process. Nuvarande metoder är inte lämpade fören sådan dynamisk miljö. Detta arbete har fokuserat på fyra programvaruegenskaper som ärviktiga för att underlätta förändringsprocesser. Dessa fyra egenskaper är: öppenhet, anpassningsförmåga,testbarhet och reparerbarhet. Öppenhet, hänvisar till förmågan att förstå varför, var ochvad systemet gör. Anpassningsbarhet är huvudsakligen en teknisk egenskap som fokuserar påsystemets förmåga att utvecklas och förändras. Testbarhet strävar efter automatisk testning ochvalidering av korrekthet som kräver ingen eller lite manuell kontroll. Den sista egenskapen ärreparerbarhet, som beskriver möjligheten att återhämta systemet till ett konsekvent och korrekttillstånd, även om felaktig programvara har använts. En programmeringsmodell som rustarprogramvara med de ovan beskrivna programegenskaperna är utvecklad i detta examensarbete.Programmeringsmodellens arkitektur är baserad på diverse micro-tjänster, vilka ger brafrånkopplings- och underhållsförmåga för en programvara, samt användarorganisationerna.Command Query Responsibility Segregation (CQRS) frånkopplar läsoperationer från skrivoperationeroch gör ändringar i data explicita. Med Event Sourcing lagrar systemet inte endastdet nuvarande tillståndet, utan alla historiska händelser. Modellen förser användarna medett inbyggt revisionsspår och kan reproducera olika scenarion för felsökning och testning. Endemoprocess är definierad och implementerad i tre olika prototyper. Designen av prototypernaär baserad på den föreslagna programmeringsmodellen. Vilken är byggd i Javascript och implementerarmicro-tjänster, CQRS och Event Sourcing. Prototyperna visar och validerar hurprogrammeringsmodellen ger programvaran rätt egenskaper. Programvara byggd med dennaprogrammeringsmodell tillåter företag att iterera snabbare. De huvudsakliga begränsningarna iarbetet är att valideringen är baserad på en enklare demoprocess och att dess fördelar är svåraatt kvantifiera.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Process Model Matching"

1

Huda, Ahmed Samei. The Medical Model in Mental Health. Oxford University Press, 2019. http://dx.doi.org/10.1093/med/9780198807254.001.0001.

Full text
Abstract:
The medical model is a biopsychosocial model assessing a patient’s problems and matching them to the diagnostic construct using pattern recognition of clinical features. Diagnostic constructs allow for researching, communicating, teaching, and learning useful clinical information to influence clinical decision-making. They also have social and administrative functions such as access to benefits. They may also help explain why problems occur. Diagnostic constructs are used to describe diseases/syndromes and also other types of conditions such as spectrums of conditions. Treatments in medicine and psychiatry have several treatment objectives including cure or reducing distress and a variety of mechanisms of action apart from reversing disease/cure. Causation of conditions in medicine and psychiatry are often complex. The medical model allows doctors to assess and offer effective treatments to large numbers of patients and provide emergency cover. Diagnostic constructs in psychiatry and general medicine overlap for attributes such as clinical utility (e.g. predicting likely outcomes) and validity (e.g. lack of boundaries between different diagnostic constructs) and importance of social factors. There is an overlap in effectiveness between psychiatric and general medicine treatments and many general medicine medications do not reverse disease processes. Different mental health classifications have particular strengths and weaknesses for clinical, research, and social functions. Mental health research into understanding causes and mechanisms may need other classifications than diagnosis. As doctors in all specialties encounter mental health problems, there will always be psychiatric diagnostic constructs compatible with their training. Mental health research and service provision will always need to address psychosocial issues.
APA, Harvard, Vancouver, ISO, and other styles
2

Rugman, Karin. Contact Unwinding. University of Illinois Press, 2017. http://dx.doi.org/10.5406/illinois/9780252039409.003.0012.

Full text
Abstract:
In this chapter, the author examines kinesthetic correspondence and matching in Contact Unwinding, a Shin Somatics dance process which employs movement-based teaching through touch and is performed in an improvisational dance context. Contact Unwinding invites the inner self to instinctively express itself outwardly in a spontaneous unfolding of intuitive movement or dance, and in the process interweaves dance and somatics, connecting us intimately with our moving or dancing body. The discussion draws on the author’s personal experiences as a somatic educator and as a mover, combined with reflections from undergraduate dance students at Bath Spa University in the UK and students in somatic workshops. She highlights the educational and therapeutic aspects of Contact Unwinding, focusing on how knowledge is obtained through different modes of learning and especially how Contact Unwinding invites us to learn through experiencing, discovering, and communicating.
APA, Harvard, Vancouver, ISO, and other styles
3

Weersing, V. Robin, Araceli Gonzalez, and Michelle Rozenman. Brief Behavioral Therapy for Anxiety and Depression in Youth. Oxford University Press, 2021. http://dx.doi.org/10.1093/med-psych/9780197541470.001.0001.

Full text
Abstract:
Taken together, anxiety and depression are the most common mental health problems across the lifespan, with most adults dating the onset of their struggles to childhood and adolescence. The Brief Behavioral Therapy (BBT) program for youth is a transdiagnostic intervention for anxiety and depression designed to efficiently treat the cluster of internalizing symptoms most commonly seen in childhood and adolescence: feeling stressed, sad, bad, nervous, worried, moody, irritable, or scared. BBT works by targeting core processes implicated in both anxiety and depression. In BBT, youth learn to reduce their avoidance of situations that produce negative feelings and increase their approach toward and engagement with sources of reward and meaning. Of note, the BBT model eliminates cognitive restructuring, a central ingredient in cognitive-behavioral therapies for depression and anxiety. BBT is intended to be briefer and less complex to learn and to teach as compared to alternate transdiagnostic and disorder-specific interventions for pediatric anxiety and depression. This volume is the Therapist Guide, designed to be used in combination with the BBT Workbook for youth and families. Each session in this guide builds on skills taught in the previous session, and each session has matching material in the Workbook. The Therapist Guide also includes supplemental material for working with less common clinical situations and therapist reflection exercises designed to mimic the supervision style of research studies using BBT. Overall, the BBT program has been found to significantly reduce symptoms and improve functioning in daily life for youths with anxiety and depression.
APA, Harvard, Vancouver, ISO, and other styles
4

Stańczykiewicz, Arkadiusz. Prawdopodobieństwo wystąpienia szkód w odnowieniach podokapowych wskutek pozyskiwania drewna oraz model ich szacowania. Publishing House of the University of Agriculture in Krakow, 2018. http://dx.doi.org/10.15576/978-83-66602-34-2.

Full text
Abstract:
An analysis of the existing literature on the issue of damage to regeneration caused by timber harvesting, revealed that a great majority of results reported in those publications was obtained through laborious and time-consuming field research conducted in two stages. Field research methods for gathering data, employed by various authors, differed in terms of the manner of establishing trial plots, the accuracy of counting and evaluating the number of saplings growing on the investigated sites, classification systems used for distinguishing particular groups of regeneration based on quantitative (diameter at breast height, tree height) and qualitative features (biosocial position within the certain layer and the entire stand), classification systems used for identifying types of damage caused by cutting and felling, as well as transporting operations, and finally the duration of observation intervals and time spent on gathering data on the response of damaged saplings from both, the individual and collective perspectives. Obviously, the most reliable manner of gathering such data would be to count all damaged elements of the environment being a subject of interest of particular investigators at the certain point of time. However, due to time and work consumption of this approach, which is besides very costly, any research should be designed in such a manner as to reduce the above-mentioned factors. This paper aimed to (1) analyse the probability of occurrence of damage to regeneration depending on the form of timber assortments dragged from the felling site to the skidding routes, and timber harvesting technology employed in logging works, and (2) identify a method ensuring that gathered data is sufficient for performing reliable evaluation of share of damage to regeneration at acceptable accuracy level, without necessity to establish trial plots before commencing harvesting works. The scope of these studies enclosed a comparison between two motor-manual methods of timber harvesting in thinned stands, with dragging of timber in the first stage of skidding from the stand to landings. According to one of these methods, a classical one, operations of felling and delimbing of trees were carried out by sawmen at the felling site. Timber obtained using different methods was skidded by carters and horses, and operators of a light-duty cable winch, driven by the chainsaw’s engine, as well as operators of cable winches combined with farm tractors. In the latter, alternative method, sawmen performed only cutting and felling of trees. Delimbing and cross-cutting of trunks, dragged from the felling sites, was carried out by operators of processors combined with farm tractors, worked on skidding routes. The research was conducted in the years 2002–2010 in stands within the age classes II–IV mostly, located in the territories of Regional Directorates of State Forests in Krakow and Katowice, and in the Forest Experimental Unit in Krynica-Zdrój. In the course of a preliminary stage of investigations 102 trial plots were established in stands within early and late tinning treatments. As a result of the field research carried out in two stages, more than 3.25 thsd. circular sites were established and marked, on the surface of which over 25 thsd. saplings constituting the regeneration layer were inventoried. Based on the results of investigations and analyses it was revealed that regardless of the category of thinning treatment, the highest probability of occurrence of destroying P(ZN) to regeneration (0.24–0.44) should be expected when the first stage of timber skidding is performed using cable winches. Slightly lower values of probability (0.17–0.33) should be expected in stands where timber is skidded by horses, while in respect to processor-based skidding technology the probability of destroying occurrence oscillates between 0.12 and 0.27, depending on the particular layer of regeneration. P(ZN) values, very close to those of skidding technology engaging processors, were recorded for skidding performed using the light-duty cable winch driven by the chainsaw’s engine (0.16–0.27). The highest probability of damage P(USZK) to regeneration (0.16–0.31) can be expected when processors are used in the first stage of timber skidding. Slightly lower values of probability (0.14–0.23) were obtained when skidding was performed with the use of cable winches, whereas engaging horses for hauling of trunks results in probability of damage occnrrence oscillating between 0.05–0.20, depending on the particular layer of regeneration. With regard to the probability of occurrence of both, destroying and damage P(ZNUSZK) to regeneration (0.33–0.54), the highest values can be expected when cable winches are engaged in the first stage of skidding. Little lower (0.30–0.43) was the probability of their occurrence if processor-based technology of skidding was employed, while in respect to horse skidding these values oscillated between 0.27–0.41, depending on the layer of regeneration. The lowest values of probability of occurrence of damage P(USZK), and destroying and damage treated collectively P(ZNUSZK), within all layers of regeneration, were recorded in stands where thinning treatments were performed using the light-duty cable winch driven by the chainsaw’s engine. The models evaluated and respective equations, developed based on those models, for evaluating the number of destroyed saplings ZNha (tab. 40, 42, 44, 46, 48) could be used for determining the share of damage expressed as a percentage, upon conducting only one field research at the investigated felling sites, once the timber harvesting and skidding would have been completed. As revealed by the results of analyses, evaluation of statistically significant regression models was possible for all layers of regeneration (tab. 39, 41, 43, 45, 47). Nevertheless, the smallest part of these models that could be considered positively verified, were those for the natural young regeneration, although almost a half of them revealed to be significant. Within the medium-sized regeneration over three-fourths of all models could be considered positively verified, four of which explained more than 50% of variability. Within the high-sized regeneration almost two-thirds of evaluated regression models were statistically significant, five of which were verified positively, moreover, one of them explained more than 50% of variability. The most promising results were those obtained for the advance growth. Nearly 90% of the evaluated models revealed to be statistically significant, ten of which could be considered positively verified. Furthermore, four statistically significant models explained over 50% of general variability. With regard to the entire regeneration more than 80% of evaluated models were statistically significant. However, due to insignificant coefficients of regression, eight of them could be considered positively verified. At this point it should be stressed that in respect to logging technology employing the light-duty cable winch FKS it was impossible to evaluate statistically significant models of regression. Whereas, in the case of processor-based logging technology, firstly regarding the advance growth, and then the entire regeneration, all of the evaluated statistically significant models could be considered positively verified, in terms of both, all of the stands, and particular categories of thinning treatments individually. This latter case also revealed the highest degree of matching of evaluated models (R2 popr 0.73–0.76 for advance growth and 0.78–0.94 for the entire regeneration). A significant impact of the kind of form of hauled timber on the probability of damage occurrence P(USZK), mainly in early thinning treatments, could have been reflected in the results obtained for all stands (early and late thinning treated collectively). Moreover, due to an insignificant impact of the form of hauled timber and logging technology employed, on the probability of occurrence of damage in late thinned stands, and a significant impact of the above-mentioned variables on early thinned stands, it should be assumed that for performing an evaluation of destroying and damage caused by timber harvesting the both thinning treatment categories should be analysed separately. Furthermore, when evaluating the probability of occurrence of destroying and damage caused by timber harvesting, the layers of natural young regeneration and advance growth should be analysed separately. As proved by the results presented in this paper, varying values of probability computed for each of the layers of regeneration seem to indicate that when investigating damage to regeneration caused by timber harvesting, it would be reasonable and recommended to perform a separate analysis of damage to the highest saplings as well, namely individuals with diameter at breast height close to 7 cm. In respect to studies on damage to regeneration caused by logging technologies mentioned above, the evaluation of number of destroyed saplings within the advance growth can be carried out using the proportions of damaged and undamaged saplings per 1 ha of the stand. The numbers evaluated in this manner can be used to calculate the damage share expressed in relative values (percentage of damaged saplings compared with the entire number of saplings before commencing the logging works). However, one should keep in mind that this is true only if the field research have been carried out based on the methodology described in this paper.
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Process Model Matching"

1

Leopold, Henrik. "Business Process Model Matching." In Encyclopedia of Big Data Technologies, 1–7. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-63962-8_107-1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Leopold, Henrik. "Business Process Model Matching." In Encyclopedia of Big Data Technologies, 409–15. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-319-77525-8_107.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Tsagkani, Christina. "Graph-Based Process Model Matching." In Business Process Management Workshops, 573–77. Cham: Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-15895-2_50.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Cayoglu, Ugur, Remco Dijkman, Marlon Dumas, Peter Fettke, Luciano García-Bañuelos, Philip Hake, Christopher Klinkmüller, et al. "Report: The Process Model Matching Contest 2013." In Business Process Management Workshops, 442–63. Cham: Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-06257-0_35.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Shahzad, Khurram, Safia Kanwal, and Kamran Malik. "Process Model Matching with Word Embeddings." In Communications in Computer and Information Science, 838–49. Singapore: Springer Singapore, 2019. http://dx.doi.org/10.1007/978-981-13-6052-7_73.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Baumann, Michaela, Michael Heinrich Baumann, Stefan Schönig, and Stefan Jablonski. "Resource-Aware Process Model Similarity Matching." In Service-Oriented Computing - ICSOC 2014 Workshops, 96–107. Cham: Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-22885-3_9.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Castelo Branco, Moisés, Javier Troya, Krzysztof Czarnecki, Jochen Küster, and Hagen Völzer. "Matching Business Process Workflows across Abstraction Levels." In Model Driven Engineering Languages and Systems, 626–41. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-33666-9_40.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Weidlich, Matthias, Tomer Sagi, Henrik Leopold, Avigdor Gal, and Jan Mendling. "Predicting the Quality of Process Model Matching." In Lecture Notes in Computer Science, 203–10. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-40176-3_16.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Baumann, Michael Heinrich, Michaela Baumann, Stefan Schönig, and Stefan Jablonski. "Towards Multi-perspective Process Model Similarity Matching." In Lecture Notes in Business Information Processing, 21–37. Berlin, Heidelberg: Springer Berlin Heidelberg, 2014. http://dx.doi.org/10.1007/978-3-662-44860-1_2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Kuss, Elena, Henrik Leopold, Christian Meilicke, and Heiner Stuckenschmidt. "Ranking-Based Evaluation of Process Model Matching." In On the Move to Meaningful Internet Systems. OTM 2017 Conferences, 298–305. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-69462-7_19.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Process Model Matching"

1

Groner, Raffaela, Sophie Gylstorff, and Matthias Tichy. "A profiler for the matching process of henshin." In MODELS '20: ACM/IEEE 23rd International Conference on Model Driven Engineering Languages and Systems. New York, NY, USA: ACM, 2020. http://dx.doi.org/10.1145/3417990.3422000.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Abdelkader, Mostefai, and Ignacio Garcia Rodriguez De Guzman. "Process model matching using heuristic search." In 2016 IEEE/ACS 13th International Conference of Computer Systems and Applications (AICCSA). IEEE, 2016. http://dx.doi.org/10.1109/aiccsa.2016.8015034.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Assy, Nour, Boudewijn F. van Dongen, and Wil M. P. van der Aalst. "Similarity resonance for improving process model matching accuracy." In SAC 2018: Symposium on Applied Computing. New York, NY, USA: ACM, 2018. http://dx.doi.org/10.1145/3167132.3167138.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Niedermann, Florian, Sylvia Radeschutz, and Bernhard Mitschang. "Design-Time Process Optimization through Optimization Patterns and Process Model Matching." In 2010 IEEE 12th Conference on Commerce and Enterprise Computing (CEC). IEEE, 2010. http://dx.doi.org/10.1109/cec.2010.9.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Al-Turki, Ali, Obai Alnajjar, Majdi Baddourah, and Babatunde Moriwawon. "Compressed Dimension of Reservoir Models Uncertainty Parameters for Optimized Model Calibration and History Matching Process." In SPE Annual Technical Conference and Exhibition. SPE, 2021. http://dx.doi.org/10.2118/206066-ms.

Full text
Abstract:
Abstract The algorithms and workflows have been developed to couple efficient model parameterization with stochastic, global optimization using a Multi-Objective Genetic Algorithm (MOGA) for global history matching, and coupled with an advanced workflow for streamline sensitivity-based inversion for fine-tuning. During parameterization the low-rank subsets of most influencing reservoir parameters are identified and propagated to MOGA to perform the field-level history match. Data misfits between the field historical data and simulation data are calculated with multiple realizations of reservoir models that quantify and capture reservoir uncertainty. Each generation of the optimization algorithms reduces the data misfit relative to the previous iteration. This iterative process continues until a satisfactory field-level history match is reached or there are no further improvements. The fine-tuning process of well-connectivity calibration is then performed with a streamlined sensitivity-based inversion algorithm to locally update the model to reduce well-level mismatch. In this study, an application of the proposed algorithms and workflow is demonstrated for model calibration and history matching. The synthetic reservoir model used in this study is discretized into millions of grid cells with hundreds of producer and injector wells. It is designed to generate several decades of production and injection history to evaluate and demonstrate the workflow. In field-level history matching, reservoir rock properties (e.g., permeability, fault transmissibility, etc.) are parameterized to conduct the global match of pressure and production rates. Grid Connectivity Transform (GCT) was used and assessed to parameterize the reservoir properties. In addition, the convergence rate and history match quality of MOGA was assessed during the field (global) history matching. Also, the effectiveness of the streamline-based inversion was evaluated by quantifying the additional improvement in history matching quality per well. The developed parametrization and optimization algorithms and workflows revealed the unique features of each of the algorithms for model calibration and history matching. This integrated workflow has successfully defined and carried uncertainty throughout the history matching process. Following the successful field-level history match, the well-level history matching was conducted using streamline sensitivity-based inversion, which further improved the history match quality and conditioned the model to historical production and injection data. In general, the workflow results in enhanced history match quality in a shorter turnaround time. The geological realism of the model is retained for robust prediction and development planning.
APA, Harvard, Vancouver, ISO, and other styles
6

Yuen, Bevan, Olugbenga Olukoko, and Joseph Ansah. "Integrating Intelligent Field Data into Simulation Model History Matching Process." In SPE Saudi Arabia Section Technical Symposium and Exhibition. Society of Petroleum Engineers, 2014. http://dx.doi.org/10.2118/172233-ms.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Dillon, Brian, Mohamed Saib, Thiago Figueiro, Paolo Petroni, Chris Progler, and Patrick Schiavone. "Mask process matching using a model based data preparation solution." In SPIE Photomask Technology, edited by Naoya Hayashi and Bryan S. Kasprowicz. SPIE, 2015. http://dx.doi.org/10.1117/12.2199273.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Fauzan, Abd Charis, Riyanarto Sarno, and Nurul Fajrin Ariyani. "Structure-based ontology matching of business process model for fraud detection." In 2017 11th International Conference on Information & Communication Technology and System (ICTS). IEEE, 2017. http://dx.doi.org/10.1109/icts.2017.8265674.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Wen, Rui, Weiqing Tang, and Zhiyong Su. "A 2D Engineering Drawing and 3D Model Matching Algorithm for Process Plant." In 2015 International Conference on Virtual Reality and Visualization (ICVRV). IEEE, 2015. http://dx.doi.org/10.1109/icvrv.2015.13.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Beutel, Markus C., Vasil Borozanov, Sevket Gökay, and Karl-Heinz Krempels. "Semi-automated Business Process Model Matching and Merging Considering Advanced Modeling Constraints." In 19th International Conference on Enterprise Information Systems. SCITEPRESS - Science and Technology Publications, 2017. http://dx.doi.org/10.5220/0006341603240331.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Process Model Matching"

1

McPhedran, R., K. Patel, B. Toombs, P. Menon, M. Patel, J. Disson, K. Porter, A. John, and A. Rayner. Food allergen communication in businesses feasibility trial. Food Standards Agency, March 2021. http://dx.doi.org/10.46756/sci.fsa.tpf160.

Full text
Abstract:
Background: Clear allergen communication in food business operators (FBOs) has been shown to have a positive impact on customers’ perceptions of businesses (Barnett et al., 2013). However, the precise size and nature of this effect is not known: there is a paucity of quantitative evidence in this area, particularly in the form of randomised controlled trials (RCTs). The Food Standards Agency (FSA), in collaboration with Kantar’s Behavioural Practice, conducted a feasibility trial to investigate whether a randomised cluster trial – involving the proactive communication of allergen information at the point of sale in FBOs – is feasible in the United Kingdom (UK). Objectives: The trial sought to establish: ease of recruitments of businesses into trials; customer response rates for in-store outcome surveys; fidelity of intervention delivery by FBO staff; sensitivity of outcome survey measures to change; and appropriateness of the chosen analytical approach. Method: Following a recruitment phase – in which one of fourteen multinational FBOs was successfully recruited – the execution of the feasibility trial involved a quasi-randomised matched-pairs clustered experiment. Each of the FBO’s ten participating branches underwent pair-wise matching, with similarity of branches judged according to four criteria: Food Hygiene Rating Scheme (FHRS) score, average weekly footfall, number of staff and customer satisfaction rating. The allocation ratio for this trial was 1:1: one branch in each pair was assigned to the treatment group by a representative from the FBO, while the other continued to operate in accordance with their standard operating procedure. As a business-based feasibility trial, customers at participating branches throughout the fieldwork period were automatically enrolled in the trial. The trial was single-blind: customers at treatment branches were not aware that they were receiving an intervention. All customers who visited participating branches throughout the fieldwork period were asked to complete a short in-store survey on a tablet affixed in branches. This survey contained four outcome measures which operationalised customers’: perceptions of food safety in the FBO; trust in the FBO; self-reported confidence to ask for allergen information in future visits; and overall satisfaction with their visit. Results: Fieldwork was conducted from the 3 – 20 March 2020, with cessation occurring prematurely due to the closure of outlets following the proliferation of COVID-19. n=177 participants took part in the trial across the ten branches; however, response rates (which ranged between 0.1 - 0.8%) were likely also adversely affected by COVID-19. Intervention fidelity was an issue in this study: while compliance with delivery of the intervention was relatively high in treatment branches (78.9%), erroneous delivery in control branches was also common (46.2%). Survey data were analysed using random-intercept multilevel linear regression models (due to the nesting of customers within branches). Despite the trial’s modest sample size, there was some evidence to suggest that the intervention had a positive effect for those suffering from allergies/intolerances for the ‘trust’ (β = 1.288, p<0.01) and ‘satisfaction’ (β = 0.945, p<0.01) outcome variables. Due to singularity within the fitted linear models, hierarchical Bayes models were used to corroborate the size of these interactions. Conclusions: The results of this trial suggest that a fully powered clustered RCT would likely be feasible in the UK. In this case, the primary challenge in the execution of the trial was the recruitment of FBOs: despite high levels of initial interest from four chains, only one took part. However, it is likely that the proliferation of COVID-19 adversely impacted chain participation – two other FBOs withdrew during branch eligibility assessment and selection, citing COVID-19 as a barrier. COVID-19 also likely lowered the on-site survey response rate: a significant negative Pearson correlation was observed between daily survey completions and COVID-19 cases in the UK, highlighting a likely relationship between the two. Limitations: The trial was quasi-random: selection of branches, pair matching and allocation to treatment/control groups were not systematically conducted. These processes were undertaken by a representative from the FBO’s Safety and Quality Assurance team (with oversight from Kantar representatives on pair matching), as a result of the chain’s internal operational restrictions.
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Process Model Matching' for particular source types:
Journal articles Dissertations / Theses
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography