Articoli di riviste: "Process querying"

1

Wang, Jianmin, Tao Jin, Raymond K. Wong e Lijie Wen. "Querying business process model repositories". World Wide Web 17, n. 3 (13 aprile 2013): 427–54. http://dx.doi.org/10.1007/s11280-013-0210-z.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

2

CHANDRA, S., D. I. BLOCKLEY e N. J. WOODMAN. "QUALITATIVE QUERYING OF PHYSICAL PROCESS SIMULATIONS". Civil Engineering Systems 10, n. 3 (luglio 1993): 225–42. http://dx.doi.org/10.1080/02630259308970125.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

3

Kunze, Matthias, Matthias Weidlich e Mathias Weske. "Querying process models by behavior inclusion". Software & Systems Modeling 14, n. 3 (3 dicembre 2013): 1105–25. http://dx.doi.org/10.1007/s10270-013-0389-6.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

4

Ngoc Chan, Nguyen, Nattawat Nonsung e Walid Gaaloul. "Service querying to support process variant development". Journal of Systems and Software 122 (dicembre 2016): 538–52. http://dx.doi.org/10.1016/j.jss.2015.07.050.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

5

Jin, Tao, Jianmin Wang, Marcello La Rosa, Arthur ter Hofstede e Lijie Wen. "Efficient querying of large process model repositories". Computers in Industry 64, n. 1 (gennaio 2013): 41–49. http://dx.doi.org/10.1016/j.compind.2012.09.008.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

6

Polyvyanyy, Artem, Chun Ouyang, Alistair Barros e Wil M. P. van der Aalst. "Process querying: Enabling business intelligence through query-based process analytics". Decision Support Systems 100 (agosto 2017): 41–56. http://dx.doi.org/10.1016/j.dss.2017.04.011.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

7

Merazi, Afaf, e Mimoun Malki. "SQUIREL: Semantic Querying Interlinked OWL-S traveling Process Models". International Journal of Information Technology and Computer Science 7, n. 12 (8 novembre 2015): 30–39. http://dx.doi.org/10.5815/ijitcs.2015.12.04.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

8

P, Ezhumalai, e Ezhilvanji S. "Bandwidth Optimized Resource Allocation Process in Querying Distributed Storage". International Innovative Research Journal of Engineering and Technology 3, n. 3 (31 marzo 2018): 18–21. http://dx.doi.org/10.32595/iirjet.org/v3i3.2018.61.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

9

Cao, Bin, Jiaxing Wang, Jing Fan, Jianwei Yin e Tianyang Dong. "Querying Similar Process Models Based on the Hungarian Algorithm". IEEE Transactions on Services Computing 10, n. 1 (1 gennaio 2017): 121–35. http://dx.doi.org/10.1109/tsc.2016.2597143.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

10

Polyvyanyy, Artem, Anastasiia Pika e Arthur H. M. ter Hofstede. "Scenario-based process querying for compliance, reuse, and standardization". Information Systems 93 (novembre 2020): 101563. http://dx.doi.org/10.1016/j.is.2020.101563.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

11

Wang, Zeyu, Yuanchun Shi, Yuntao Wang, Yuchen Yao, Kun Yan, Yuhan Wang, Lei Ji, Xuhai Xu e Chun Yu. "G-VOILA: Gaze-Facilitated Information Querying in Daily Scenarios". Proceedings of the ACM on Interactive, Mobile, Wearable and Ubiquitous Technologies 8, n. 2 (13 maggio 2024): 1–33. http://dx.doi.org/10.1145/3659623.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Abstract (sommario):

Modern information querying systems are progressively incorporating multimodal inputs like vision and audio. However, the integration of gaze --- a modality deeply linked to user intent and increasingly accessible via gaze-tracking wearables --- remains underexplored. This paper introduces a novel gaze-facilitated information querying paradigm, named G-VOILA, which synergizes users' gaze, visual field, and voice-based natural language queries to facilitate a more intuitive querying process. In a user-enactment study involving 21 participants in 3 daily scenarios (p = 21, scene = 3), we revealed the ambiguity in users' query language and a gaze-voice coordination pattern in users' natural query behaviors with G-VOILA. Based on the quantitative and qualitative findings, we developed a design framework for the G-VOILA paradigm, which effectively integrates the gaze data with the in-situ querying context. Then we implemented a G-VOILA proof-of-concept using cutting-edge deep learning techniques. A follow-up user study (p = 16, scene = 2) demonstrates its effectiveness by achieving both higher objective score and subjective score, compared to a baseline without gaze data. We further conducted interviews and provided insights for future gaze-facilitated information querying systems.

12

Sharma, Dilip Kumar, e A. K. Sharma. "Deep Web Information Retrieval Process". International Journal of Information Technology and Web Engineering 5, n. 1 (gennaio 2010): 1–22. http://dx.doi.org/10.4018/jitwe.2010010101.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Abstract (sommario):

Web crawlers specialize in downloading web content and analyzing and indexing from surface web, consisting of interlinked HTML pages. Web crawlers have limitations if the data is behind the query interface. Response depends on the querying party’s context in order to engage in dialogue and negotiate for the information. In this article, the authors discuss deep web searching techniques. A survey of technical literature on deep web searching contributes to the development of a general framework. Existing frameworks and mechanisms of present web crawlers are taxonomically classified into four steps and analyzed to find limitations in searching the deep web.

13

Sheng, Kai, Zhen Li, Zhi Chao Song e Hong Duan. "Artificial Society-Oriented Large-Scale Road Path Querying Methods". Applied Mechanics and Materials 644-650 (settembre 2014): 2269–75. http://dx.doi.org/10.4028/www.scientific.net/amm.644-650.2269.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Abstract (sommario):

In artificial society simulation, each artificial population needs road path planning in the process of travel. However, because of the large amounts of populations in artificial society, road path planning will cost lots computational resources and time, thus this process has terrible efficiency to the performance of the simulation system. In order to solve this problem, this article firstly makes use of CPU to generate the artificial populations, travel logs, and construct the road network models; then computes the shortest road path between each two environments and load the results in RAM for prepare; lastly, sends the ID and its start point and destination of the population who need road path querying to GPU at current simulation time in the simulation process, and then takes advantages of GPU to query the road path and return the results back. In this way, we can obviously reduce the time costs in the process of road path querying and enormously improve the performance of the whole simulation system.

14

Alhindawi, Nouh Talal, Belal Abu Ata, Lana Mahmoud Obeidat, Mohammad Subhi Al-Batah e Muad Abu-Ata. "A Topic Modeling Based Approach for Enhancing Corpus Querying". International Journal of Open Source Software and Processes 10, n. 3 (luglio 2019): 38–50. http://dx.doi.org/10.4018/ijossp.2019070103.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Abstract (sommario):

In information retrieval, the accuracy of the retrieval process is mainly dependent on query terms selection; therefore, the user must choose the needed terms carefully and selectively. Traditionally, the process of selecting query terms is done manually. However, in the last two decades, a lot of research has been directed towards automating the process of choosing and enhancing query terms. In this article, a new novel approach is presented, which relies on topic modeling in query building and expansion. Two open source systems were selected to perform the experiments, results show that adding the topic's term to the user's query clearly improves its quality and thus, improves the ranking results.

15

Olimjon, Saytiyev, e Ergashev Shokhrukh. "THE ROLE OF INFORMATION COMMUNICATION TECHNOLOGY IN THE PROCESS OF EVALUATING STUDENTS". International Journal of Pedagogics 03, n. 02 (1 febbraio 2023): 1–5. http://dx.doi.org/10.37547/ijp/volume03issue02-01.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Abstract (sommario):

The effectiveness of instructional technology depends on appropriate evaluation of the technology, with special focus on outcomes. Because evaluation assesses how effective the technology is in enabling learners to master a particular subject, what students learn becomes an important criterion for evaluation. But how and when to assess learning and comprehension is an important and continuing problem. This article deals with strategic evaluation, which emphasizes technical accuracy, pedagogical soundness, substantive fidelity, integrative flexibility, and cyclic improvement. Effective strategic evaluation is a continuing process-ranging from querying immediate comprehension, to modifying instruction, to assessing long-term effects.

16

Li, Tingyu, Bai Liu e Jun Zhang. "Quantum Privacy Query Protocol Based on GHZ-like States". Applied Sciences 14, n. 2 (10 gennaio 2024): 608. http://dx.doi.org/10.3390/app14020608.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Abstract (sommario):

The rapid development of telemedicine technology has brought great convenience to people’s lives. Alongside generating great convenience, protecting patients’ privacy has become increasingly important. Therefore, to solve the above problems, this paper proposes a quantum privacy query protocol based on GHZ-like states. The protocol first utilizes existing diagnostic information for classification to encode symptom attributes. Then, the correlation after measurement using GHZ-like entangled states is utilized so that the querying party can only obtain a key message with the assistance of a third party. Through the above operation, the database cannot know the address of the message queried by the querying party, and the querying party is also unable to obtain more information. The protocol not only adds decoy factor detection but also adds the process of authentication while checking for illegal eavesdropping. It makes the protocol sufficiently resistant to joint attacks, participant attacks, and external system credit attacks. This database privacy query protocol ensures that the database service is more effective and its environment is more secure.

17

Sougui, Ines Benali, Minyar Sassi Hidri e Amel Grissa Touzi. "From User Requirements to Querying of Fuzzy Summaries". International Journal of Service Science, Management, Engineering, and Technology 5, n. 1 (gennaio 2014): 84–102. http://dx.doi.org/10.4018/ijssmet.2014010105.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Abstract (sommario):

With the huge amount and the evolution of fuzzy data, the necessity to work with synthetic views became a challenge for many databases (DB) community researchers. Data summarization techniques are now considered as accurate tools to handle huge DB, in particular when precise data are not needed. Formal approaches have been proposed making possible the generation of an hierarchy of summaries from DB. The challenges arise on the question of how querying these fuzzy views according user requirements. In this work, we propose to handle with these challenges by query repairing and substitution. Two process were studied, the first process is used by modifying query while using the best fuzzy summaries which have the most near answers. The second one is applied to generate all substitution queries over the fuzzy summaries' hierarchy. This would be not only expensive but also unjustified for the part of the search hierarchy nodes.

18

Chen, Bo, Huaijie Zhu, Wei Liu, Jian Yin, Wang-Chien Lee e Jianliang Xu. "Querying Optimal Routes for Group Meetup". Data Science and Engineering 6, n. 2 (15 marzo 2021): 180–91. http://dx.doi.org/10.1007/s41019-021-00153-5.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Abstract (sommario):

AbstractMotivated by location-based social networks which allow people to access location-based services as a group, we study a novel variant of optimal sequenced route (OSR) queries, optimal sequenced route for group meetup (OSR-G) queries. OSR-G query aims to find the optimal meeting POI (point of interest) such that the maximum users’ route distance to the meeting POI is minimized after each user visits a number of POIs of specific categories (e.g., gas stations, restaurants, and shopping malls) in a particular order. To process OSR-G queries, we first propose an OSR-Based (OSRB) algorithm as our baseline, which examines every POI in the meeting category and utilizes existing OSR (called E-OSR) algorithm to compute the optimal route for each user to the meeting POI. To address the shortcomings (i.e., requiring to examine every POI in the meeting category) of OSRB, we propose an upper bound based filtering algorithm, called circle filtering (CF) algorithm, which exploits the circle property to filter the unpromising meeting POIs. In addition, we propose a lower bound based pruning (LBP) algorithm, namely LBP-SP which exploits a shortest path lower bound to prune the unqualified meeting POIs to reduce the search space. Furthermore, we develop an approximate algorithm, namely APS, to accelerate OSR-G queries with a good approximation ratio. Finally the experimental results show that both CF and LBP-SP outperform the OSRB algorithm and have high pruning rates. Moreover, the proposed approximate algorithm runs faster than the exact OSR-G algorithms and has a good approximation ratio.

19

Lagos, Nikolaos, Adrian Mos e Jean-Yves Vion-Dury. "Multi-Context Systems for Consistency Validation and Querying of Business Process Models". Procedia Computer Science 112 (2017): 225–34. http://dx.doi.org/10.1016/j.procs.2017.08.101.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

20

Devi, Maharabam Anjali, e Lunghim Rongmei. "Impacts of Sand and Gravel Quarrying on the Stream Channel and Surrounding Environment". Asia Pacific Journal of Energy and Environment 4, n. 1 (30 giugno 2017): 7–12. http://dx.doi.org/10.18034/apjee.v4i1.236.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Abstract (sommario):

The longtime sustainability of river channel in the natural process depends on the gradient, volume of water, sediment supply and deposition in the river. Naturally, rivers maintain balance of river channel in all stage of the cycle of erosion. However, human activity mainly sand and gravel mining frequently disturb the balance that has much impact on the river morphology. The Imphal River between Motbung to Awang Leikinthabi is one of the worse sand and gravel-querying regions in Manipur. Hence, the main aim of this paper is to assess the impacts of querying on riverine landform and surrounding environment by using Remote Sensing and GIS.

21

Kunfang, Song, e Hongwei Lu. "Efficient Querying Distributed Big-XML Data using MapReduce". International Journal of Grid and High Performance Computing 8, n. 3 (luglio 2016): 70–79. http://dx.doi.org/10.4018/ijghpc.2016070105.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Abstract (sommario):

MapReduce is a widely adopted computing framework for data-intensive applications running on clusters. This paper proposed an approach to exploit data parallelisms in XML processing using MapReduce in Hadoop. The authors' solution seamlessly integrates data storage, labeling, indexing, and parallel queries to process a massive amount of XML data. Specifically, the authors introduce an SDN labeling algorithm and a distributed hierarchical index using DHTs. More importantly, an advanced two-phase MapReduce solution are designed that is able to efficiently address the issues of labeling, indexing, and query processing on big XML data. The experimental results show the efficiency and effectiveness of the proposed parallel XML data approach using Hadoop.

22

Bai, Luyi, Nan Li, Lishuang Liu e Xuesong Hao. "Querying multi-source heterogeneous fuzzy spatiotemporal data". Journal of Intelligent & Fuzzy Systems 40, n. 5 (22 aprile 2021): 9843–54. http://dx.doi.org/10.3233/jifs-202357.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Abstract (sommario):

With the rapid development of the environmental, meteorological and marine data management, fuzzy spatiotemporal data has received considerable attention. Even though some achievements in querying aspect have been made, there are still some unsolved problems. Semantic and structural heterogeneity may exist among different data sources, which will lead to incomplete results. In addition, there are ambiguous query intentions and conditions when the user queries the data. This paper proposes a fuzzy spatiotemporal data semantic model. Based on this model, the RDF local semantic models are converted into a RDF global semantic model after mapping relational data and XML data to RDF local semantic models. The existing methods mainly convert relational data to RDF Schema directly. But our approach converts relational data to XML Schema and then converts it to RDF, which utilizes the semi-structured feature of XML schema to solve the structural heterogeneity between different data sources. The integration process enables us to perform global queries against different data sources. In the proposed query algorithms, the query conditions inputted are converted into exact queries before the results are returned. Finally, this paper has carried out extensive experiments, calculated the recall, precision and F-Score of the experimental results, and compared with other state-of-the-art query methods. It shows the importance of the data integration method and the effectiveness of the query method proposed in this paper.

23

Fang, Hong. "pSPARQL: A Querying Language for Probabilistic RDF Data". Complexity 2019 (26 marzo 2019): 1–7. http://dx.doi.org/10.1155/2019/8258197.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Abstract (sommario):

More and more linked data (taken as knowledge) can be automatically generated from nonstructured data such as text and image via learning, which are often uncertain in practice. On the other hand, most of the existing approaches to processing linked data are mainly designed for certain data. It becomes more and more important to process uncertain linked data in theoretical aspect. In this paper, we present a querying language framework for probabilistic RDF data (an important uncertain linked data), where each triple has a probability, called pSRARQL, built on SPARQL, recommended by W3C as a querying language for RDF databases. pSPARQL can support the full SPARQL and satisfies some important properties such as well-definedness, uniqueness, and some equivalences. Finally, we illustrate that pSPARQL is feasible in expressing practical queries in a real world.

24

Zhao, Danfeng, Wei Zhao, Le Sun e Dongmei Huang. "Modeling and Querying Business Data with Artifact Lifecycle". Mathematical Problems in Engineering 2015 (2015): 1–9. http://dx.doi.org/10.1155/2015/506272.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Abstract (sommario):

Business data has been one of the current and future research frontiers, with such big data characteristics as high-volume, high-velocity, high-privacy, and so forth. Most corporations view their business data as a valuable asset and make efforts on the development and optimal utilization on these data. Unfortunately, data management technology at present has been lagging behind the requirements of business big data era. Based on previous business process knowledge, a lifecycle of business data is modeled to achieve consistent description between the data and processes. On this basis, a business data partition method based on user interest is proposed which aims to get minimum number of interferential tuples. Then, to balance data privacy and data transmission cost, our strategy is to explore techniques to execute SQL queries over encrypted business data, split the computations of queries across the server and the client, and optimize the queries with syntax tree. Finally, an instance is provided to verify the usefulness and availability of the proposed method.

25

BRAGA, JOSÉ LUÍS, ALBERTO H. F. LAENDER e CLAUDINEY VANDER RAMOS. "A KNOWLEDGE-BASED APPROACH TO COOPERATIVE RELATIONAL DATABASE QUERYING". International Journal of Pattern Recognition and Artificial Intelligence 14, n. 01 (febbraio 2000): 73–90. http://dx.doi.org/10.1142/s0218001400000076.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Abstract (sommario):

We present in this paper an approach to providing cooperativeness in database querying using artificial intelligence techniques. The main focus is a cooperative interface that assists nonexperienced and casual users in extracting useful answers from a relational database. Our approach relies on an architecture that comprises two knowledge bases which store rules that describe the application domain and guide the process of query formulation and answering. A subset of SQL is used for expressing queries, and the cooperative interface relieves the user from knowing its full syntax and the structure of the database.

26

Meng, Xiangfu, Lin Zhu, Qing Li e Xiaoyan Zhang. "Spatiotemporal RDF Data Query Based on Subgraph Matching". ISPRS International Journal of Geo-Information 10, n. 12 (12 dicembre 2021): 832. http://dx.doi.org/10.3390/ijgi10120832.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Abstract (sommario):

Resource Description Framework (RDF), as a standard metadata description framework proposed by the World Wide Web Consortium (W3C), is suitable for modeling and querying Web data. With the growing importance of RDF data in Web data management, there is an increasing need for modeling and querying RDF data. Previous approaches mainly focus on querying RDF. However, a large amount of RDF data have spatial and temporal features. Therefore, it is important to study spatiotemporal RDF data query approaches. In this paper, firstly, we formally define spatiotemporal RDF data, and construct a spatiotemporal RDF model st-RDF that is used to represent and manipulate spatiotemporal RDF data. Secondly, we present a spatiotemporal RDF query algorithm stQuery based on subgraph matching. This algorithm can quickly determine whether the query result is empty for queries whose temporal or spatial range exceeds a specific range by adopting a preliminary query filtering mechanism in the query process. Thirdly, we propose a sorting strategy that calculates the matching order of query nodes to speed up the subgraph matching. Finally, we conduct experiments in terms of effect and query efficiency. The experimental results show the performance advantages of our approach.

27

Koutsomitropoulos, Dimitrios A., Georgia D. Solomou, Andreas D. Alexopoulos e Theodore S. Papatheodorou. "Semantic Metadata Interoperability and Inference-Based Querying in Digital Repositories". Journal of Information Technology Research 2, n. 4 (ottobre 2009): 36–52. http://dx.doi.org/10.4018/jitr.2009062903.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Abstract (sommario):

Metadata applications have evolved in time into highly structured “islands of information” about digital resources, often bearing a strong semantic interpretation. Scarcely, however, are these semantics being communicated in machine readable and understandable ways. At the same time, the process for transforming the implied metadata knowledge into explicit Semantic Web descriptions can be problematic and is not always evident. In this article we take upon the well-established Dublin Core metadata standard as well as other metadata schemata, which often appear in digital repositories set-ups, and suggest a proper Semantic Web OWL ontology. In this process the authors cope with discrepancies and incompatibilities, indicative of such attempts, in novel ways. Moreover, we show the potential and necessity of this approach by demonstrating inferences on the resulting ontology, instantiated with actual metadata records. The authors conclude by presenting a working prototype that provides for inference-based querying on top of digital repositories.

28

Medvedev, Danny, Uri Shani e Dov Dori. "Gaining Insights into Conceptual Models: A Graph-Theoretic Querying Approach". Applied Sciences 11, n. 2 (14 gennaio 2021): 765. http://dx.doi.org/10.3390/app11020765.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Abstract (sommario):

Modern complex systems include products and services that comprise many interconnected pieces of integrated hardware and software, which are expected to serve humans interacting with them. As technology advances, expectations of a smooth, flawless system operation grow. Model-based systems engineering, an approach based on conceptual models, copes with this challenge. Models help construct formal system representations, visualize them, understand the design, simulate the system, and discover design flaws early on. Modeling tools can benefit tremendously from querying capabilities that enable gaining deep insights into system aspects that direct model observations do not reveal. Querying mechanisms can unveil and explain cause-and-effect phenomena, identify central components, and estimate impacts or risks associated with changes. Being connected networks of system elements, models can be effectively represented as graphs, to which queries are applied. Capitalizing on established graph-theoretic algorithms to solve a large variety of problems can elevate the modeling experience to new levels. To utilize this rich set of capabilities, one must convert the model into a graph and store it in a graph database with no significant loss of information. Applying the appropriate algorithms and translating the query response back to the original intelligible and meaningful diagrammatic and textual model representation is most valuable. We present and demonstrate a querying approach of converting Object-Process Methodology (OPM) ISO 19450 models into graphs, storing them in a Neo4J graph database, and performing queries that answer complex questions on various system aspects, providing key insights into the modeled system or phenomenon and helping to improve the system design.

29

Borthick, A. Faye, e Mary B. Curtis. "Due Diligence on Fast-Fashion Inventory through Data Querying". Journal of Information Systems 22, n. 1 (1 marzo 2008): 77–93. http://dx.doi.org/10.2308/jis.2008.22.1.77.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Abstract (sommario):

In this simulation of a merger and acquisition due diligence engagement for a fast-fashion retailer's inventory account, learners develop IT audit skills by (1) preparing a business process representation, (2) identifying audit objectives for testing management assertions about inventory, (3) designing audit procedures to implement audit objectives, (4) querying data files to execute audit procedures, and (5) communicating results. The simulation develops skills for analyzing data to verify the internal consistency of accounting records and to detect conditions warranting further investigation. The simulation, workable with a database query tool or audit software, is appropriate for students with querying proficiency and audit procedure design capability. The simulation helps bridge the understanding gap between IT auditors and general auditors by enabling novice auditors to experience an auditing situation in which they apply IT audit tools to verify internal consistency of data and detect unusual conditions in an audit of financial statement assertions.

30

Hudec, Miroslav. "An approach to fuzzy database querying, analysis and realization". Computer Science and Information Systems 6, n. 2 (2009): 127–40. http://dx.doi.org/10.2298/csis0902127h.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Abstract (sommario):

Although the Structured Query Language (SQL) is a very powerful tool, it is unable to satisfy needs for data selection based on linguistic expressions and degrees of truth. The goal of the research whose results are presented in the paper is to capture these expressions and make them suitable for queries. For this purpose the fuzzy generalized logical condition for the WHERE part of SQL was developed. In this way, queries based on linguistic expressions are supported and are accessing relational databases in the same way as with the SQL. Fuzzy query is not only a querying tool; it improves the meaning of a query and extracts additional valuable information. Statistical data about districts of the Slovak Republic are used in the case study. Fuzzy approach has some limitations that would appear in a querying process. These limitations and ideas how to solve them are outlined in this paper.

31

Tang, Yan, Weilong Cui e Jianwen Su. "A Query Language for Workflow Logs". ACM Transactions on Management Information Systems 13, n. 2 (30 giugno 2022): 1–28. http://dx.doi.org/10.1145/3482968.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Abstract (sommario):

A business process (workflow) is an assembly of tasks to accomplish a business goal. Real-world workflow models often demanded to change due to new laws and policies, changes in the environment, and so on. To understand the inner workings of a business process to facilitate changes, workflow logs have the potential to enable inspecting, monitoring, diagnosing, analyzing, and improving the design of a complex workflow. Querying workflow logs, however, is still mostly an ad hoc practice by workflow managers. In this article, we focus on the problem of querying workflow log concerning both control flow and dataflow properties. We develop a query language based on “incident patterns” to allow the user to directly query workflow logs instead of having to transform such queries into database operations. We provide the formal semantics and a query evaluation algorithm of our language. By deriving an accurate cost model, we develop an optimization mechanism to accelerate query evaluation. Our experiment results demonstrate the effectiveness of the optimization and achieves up to 50× speedup over an adaption of existing evaluation method.

32

Ali, Dilawar, Thibault Blyau, Nico Van de Weghe e Steven Verstockt. "Context-Aware Querying, Geolocalization, and Rephotography of Historical Newspaper Images". Applied Sciences 12, n. 21 (1 novembre 2022): 11063. http://dx.doi.org/10.3390/app122111063.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Abstract (sommario):

Newspapers contain a wealth of historical information in the form of articles and illustrations. Libraries and cultural heritage institutions have been digitizing their collections for decades to enable web-based access to and retrieval of information. A number of challenges arise when dealing with digitized collections, such as those of KBR, the Royal Library of Brussels (used in this study), which contain only page-level metadata, making it difficult to extract information from specific contexts. A context-aware search relies heavily on metadata enhancement. Therefore, when using metadata at the page level, it is even more challenging to geolocalize less-known landmarks. To overcome this challenge, we have developed a pipeline for geolocalization and visualization of historical photographs. The first step of this pipeline consists of converting page-level metadata to article-level metadata. In the next step, all articles with building images were classified based on image classification algorithms. Moreover, to correctly geolocalize historical photographs, we propose a hybrid approach that uses both textual metadata and image features. We conclude this research paper by addressing the challenge of visualizing historical content in a way that adds value to humanities research. It is noteworthy that a number of historical urban scenes are visualized using rephotography, which is notoriously challenging to get right. This study serves as an important step towards enriching historical metadata and facilitating cross-collection linkages, geolocalization, and the visualization of historical newspaper images. Furthermore, the proposed methodology is generic and can be used to process untagged photographs from social media, including Flickr and Instagram.

33

Ponchateau, Cyrille, Ladjel Bellatreche, Carlos Ordonez e Mickael Baron. "A Mathematical Database to Process Time Series". International Journal of Data Warehousing and Mining 14, n. 3 (luglio 2018): 1–21. http://dx.doi.org/10.4018/ijdwm.2018070101.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Abstract (sommario):

In scientific research, the results of an experiment commonly take the form of a time series, in which such time series consists of measurements collected from a sensor over time. After time series are stored, mathematical models are derived using numerical methods. Even though there exist plenty of tools to store and analyze time series data, there is scarce research aimed at storing and querying derived models, which are the most important mechanism for a scientist to understand data. In this article, the authors propose to help scientists with a flexible database structure to persist and manage mathematical models with a mathematical models store, with extended features, to handle time series. In this article, the authors introduce the concept of a mathematical models store enriched with numerical processing methods to allow queries based on raw time series data. Then they introduce a prototype, that is an implementation of such a data store with PostgreSQL.

34

Shen, Zhihong, Chuan Hu e Zihao Zhao. "Lynx: A Graph Query Framework for Multiple Heterogeneous Data Sources". Proceedings of the VLDB Endowment 16, n. 12 (agosto 2023): 3926–29. http://dx.doi.org/10.14778/3611540.3611587.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Abstract (sommario):

Graph model are increasingly popular among modern applications for its ability to model complex relationships between entities. Users tend to query the data as a graph with graph operations (e.g., graph navigation and exploration). However, a large fraction of the data resides in relational databases or other storage systems. Challenges arise in uniformly querying multiple heterogeneous data sources as a graph. Traditional solutions are limited by time-consuming data integration, expensive development effort, and incomplete query requirements. Thus, we developed Lynx, a general graph query framework, to simplify querying graph data by converting complex statements into basic graph operations. Instead of connecting directly to the data sources, Lynx retrieves data through user-implemented interfaces for those graph operations. We demonstrate Lynx's capabilities through real-world scenarios, showcasing Lynx's ability to process graph queries on multiple heterogeneous data sources and also to be used as a generic graph query engine development framework.

35

Alarabi, Louai, Saleh Basalamah, Abdeltawab Hendawi e Mohammed Abdalla. "TraceAll: A Real-Time Processing for Contact Tracing Using Indoor Trajectories". Information 12, n. 5 (6 maggio 2021): 202. http://dx.doi.org/10.3390/info12050202.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Abstract (sommario):

The rapid spread of infectious diseases is a major public health problem. Recent developments in fighting these diseases have heightened the need for a contact tracing process. Contact tracing can be considered an ideal method for controlling the transmission of infectious diseases. The result of the contact tracing process is performing diagnostic tests, treating for suspected cases or self-isolation, and then treating for infected persons; this eventually results in limiting the spread of diseases. This paper proposes a technique named TraceAll that traces all contacts exposed to the infected patient and produces a list of these contacts to be considered potentially infected patients. Initially, it considers the infected patient as the querying user and starts to fetch the contacts exposed to him. Secondly, it obtains all the trajectories that belong to the objects moved nearby the querying user. Next, it investigates these trajectories by considering the social distance and exposure period to identify if these objects have become infected or not. The experimental evaluation of the proposed technique with real data sets illustrates the effectiveness of this solution. Comparative analysis experiments confirm that TraceAll outperforms baseline methods by 40% regarding the efficiency of answering contact tracing queries.

36

Liu, H., P. Van Oosterom, B. Mao, M. Meijers e R. Thompson. "AN EFFICIENT ND-POINT DATA STRUCTURE FOR QUERYING FLOOD RISK". International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences XLIII-B4-2021 (30 giugno 2021): 367–74. http://dx.doi.org/10.5194/isprs-archives-xliii-b4-2021-367-2021.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Abstract (sommario):

Abstract. Governments use flood maps for city planning and disaster management to protect people and assets. Flood risk mapping projects carried out for these purposes generate a huge amount of modelling results. Previously, data submitted are highly condensed products such as typical flood inundation maps and tables for loss analysis. Original modelling results recording critical flood evolution processes are overlooked due to cumbersome management and analysis. This certainly has drawbacks: the ‘static’ maps impart few details about the flood; also, the data fails to address new requirements. This significantly confines the use of flood maps. Recent development of point cloud databases provides an opportunity to manage the whole set of modelling results. The databases can efficiently support all kinds of flood risk queries at finer scales. Using a case study from China, this paper demonstrates how a novel nD-PointCloud structure, HistSFC, improves flood risk querying. The result indicates that compared with conventional database solutions, HistSFC holds superior performance and better scalability. Besides, the specific optimizations made on HistSFC can facilitate the process further. All these indicate a promising solution for the next generation of flood maps.

37

FREITAS, ANDRÉ, EDWARD CURRY, JOÃO GABRIEL OLIVEIRA e SEÁN O'RIAIN. "A DISTRIBUTIONAL STRUCTURED SEMANTIC SPACE FOR QUERYING RDF GRAPH DATA". International Journal of Semantic Computing 05, n. 04 (dicembre 2011): 433–62. http://dx.doi.org/10.1142/s1793351x1100133x.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Abstract (sommario):

The vision of creating a Linked Data Web brings together the challenge of allowing queries across highly heterogeneous and distributed datasets. In order to query Linked Data on the Web today, end users need to be aware of which datasets potentially contain the data and also which data model describes these datasets. The process of allowing users to expressively query relationships in RDF while abstracting them from the underlying data model represents a fundamental problem for Web-scale Linked Data consumption. This article introduces a distributional structured semantic space which enables data model independent natural language queries over RDF data. The center of the approach relies on the use of a distributional semantic model to address the level of semantic interpretation demanded to build the data model independent approach. The article analyzes the geometric aspects of the proposed space, providing its description as a distributional structured vector space, which is built upon the Generalized Vector Space Model (GVSM). The final semantic space proved to be flexible and precise under real-world query conditions achieving mean reciprocal rank = 0.516, avg. precision = 0.482 and avg. recall = 0.491.

38

Cao, Shu Kun, Li Song, Zhi Ming Sui, Chang Zhong Wu e Jia Jia. "Algorithm Research and System Development on Free-Form Surface CNC Processing Parameters Automatically Determination/Equipment Selection/Process Management". Advanced Materials Research 181-182 (gennaio 2011): 943–48. http://dx.doi.org/10.4028/www.scientific.net/amr.181-182.943.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Abstract (sommario):

In view of the randomness of determining free-form surface machining processing program and the complexity and the unpredictable nature of process, in this paper we proposed automatically determination of free-form surface CNC processing technical parameters, research on processing equipment selection algorithm and system development. The method, firstly determine process parameters on the base of the free-form surface characteristics and the precision requirements, or by calculation methods, or by querying the process repository, and secondly, query the existing equipment and their working status from resources repository on the base of the process parameters to select processing equipment, and then have the free-form surface machining, finally, track the parts processing and the process working conditions of equipment.

39

Iakovou, Georgios, Steven Hayward e Stephen Laycock. "A real-time proximity querying algorithm for haptic-based molecular docking". Faraday Discuss. 169 (2014): 359–77. http://dx.doi.org/10.1039/c3fd00123g.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Abstract (sommario):

Intermolecular binding underlies every metabolic and regulatory processes of the cell, and the therapeutic and pharmacological properties of drugs. Molecular docking systems model and simulate these interactions in silico and allow us to study the binding process. Haptic-based docking provides an immersive virtual docking environment where the user can interact with and guide the molecules to their binding pose. Moreover, it allows human perception, intuition and knowledge to assist and accelerate the docking process, and reduces incorrect binding poses. Crucial for interactive docking is the real-time calculation of interaction forces. For smooth and accurate haptic exploration and manipulation, force-feedback cues have to be updated at a rate of 1 kHz. Hence, force calculations must be performed within 1ms. To achieve this, modern haptic-based docking approaches often utilize pre-computed force grids and linear interpolation. However, such grids are time-consuming to pre-compute (especially for large molecules), memory hungry, can induce rough force transitions at cell boundaries and cannot be applied to flexible docking. Here we propose an efficient proximity querying method for computing intermolecular forces in real time. Our motivation is the eventual development of a haptic-based docking solution that can model molecular flexibility. Uniquely in a haptics application we use octrees to decompose the 3D search space in order to identify the set of interacting atoms within a cut-off distance. Force calculations are then performed on this set in real time. The implementation constructs the trees dynamically, and computes the interaction forces of large molecular structures (i.e. consisting of thousands of atoms) within haptic refresh rates. We have implemented this method in an immersive, haptic-based, rigid-body, molecular docking application called Haptimol_RD. The user can use the haptic device to orientate the molecules in space, sense the interaction forces on the device, and guide the molecules to their binding pose. Haptimol_RD is designed to run on consumer level hardware, i.e. there is no need for specialized/proprietary hardware.

40

Lassoued, Yosra, Lotfi Bouzguenda e Tariq Mahmoud. "Context-Aware Business Process Versions Management". International Journal of e-Collaboration 12, n. 3 (luglio 2016): 7–33. http://dx.doi.org/10.4018/ijec.2016070102.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Abstract (sommario):

This work deals with a very active and promising research area that is the Business Process (BP) flexibility. One possible way to deal with this flexibility is the conjoint use of versioning and contextualization techniques. Versioning permits BP evolution by supporting the alternative use of BP versions. Contextualization ensures the definition of use conditions of BP versions to help the designer choosing a version among several ones. In a previous work, BP flexibility had been addressed using only versioning technique by considering the informational, organizational and process perspectives. In this work, the authors show how they conjointly use both versioning and contextualization techniques to address the BP flexibility. More precisely, they propose an extension of the VBP2M meta-model (Versioned Business Process Meta Model), introduced in their previous work, by adding a contextual perspective that offers two levels of contexts granularity (local and global). This perspective is illustrated using a well-known case study «automatic production process of mineral water bottle ». An extension of the VBPQL language (Versioned Business Process Query Language) is also introduced to allow the definition, manipulating and querying of BP versions' contexts. Furthermore, the authors propose an ontology-based method to select the appropriate BP version. Finally, they present our tool that represents the implementation of the proposed solution.

41

Borthick, A. Faye, Paul L. Bowen e Gregory J. Gerard. "Modeling a Business Process and Querying the Resulting Database: Analyzing RFID Data to Develop Business Intelligence". Journal of Information Systems 22, n. 2 (1 settembre 2008): 331–50. http://dx.doi.org/10.2308/jis.2008.22.2.331.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Abstract (sommario):

ABSTRACT: This case supports the high-level objective of learning to model business situations to design databases and query them to solve business problems. Students analyze Radio Frequency Identification (RFID) and related fulfillment data to develop business intelligence for a grower of bedding plants selling to big-box retailers. Students prepare a business process diagram to understand the business process; identify objectives for detecting and correcting data errors and analyzing business performance; construct a Resource, Event, Agent (REA) diagram to specify a database design; implement the database and query it to satisfy business objectives; communicate results; document data error correction procedures; and prepare adjusting journal entries. The case is appropriate for students with moderate database querying proficiency. The case's managerial and financial accounting and internal control implications make it suitable for courses in Accounting Information Systems (AIS) and database systems for advanced undergraduate students and in AIS, database, and managerial courses for master's students. The data are supplied in Microsoft Access® databases.

42

Vera-Baquero, Alejandro, Ricardo Colomo-Palacios e Owen Molloy. "Measuring and Querying Process Performance in Supply Chains: An Approach for Mining Big-Data Cloud Storages". Procedia Computer Science 64 (2015): 1026–34. http://dx.doi.org/10.1016/j.procs.2015.08.623.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

43

Rajagopalan, Rajalaxmi, Yu-Lin Wei e Romit Roy Choudhury. "Sample-Constrained Black Box Optimization for Audio Personalization". Proceedings of the AAAI Conference on Artificial Intelligence 38, n. 9 (24 marzo 2024): 10164–71. http://dx.doi.org/10.1609/aaai.v38i9.28881.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Abstract (sommario):

We consider the problem of personalizing audio to maximize user experience. Briefly, we aim to find a filter h*, which applied to any music or speech, will maximize the user’s satisfaction. This is a black-box optimization problem since the user’s satisfaction function is unknown. Substantive work has been done on this topic where the key idea is to play audio samples to the user, each shaped by a different filter hi, and query the user for their satisfaction scores f(hi). A family of “surrogate” functions is then designed to fit these scores and the optimization method gradually refines these functions to arrive at the filter ˆh* that maximizes satisfaction. In certain applications, we observe that a second type of querying is possible where users can tell us the individual elements h*[j] of the optimal filter h*. Consider an analogy from cooking where the goal is to cook a recipe that maximizes user satisfaction. A user can be asked to score various cooked recipes (e.g., tofu fried rice) or to score individual ingredients (say, salt, sugar, rice, chicken, etc.). Given a budget of B queries, where a query can be of either type, our goal is to find the recipe that will maximize this user’s satisfaction. Our proposal builds on Sparse Gaussian Process Regression (GPR) and shows how a hybrid approach can outperform any one type of querying. Our results are validated through simulations and real world experiments, where volunteers gave feedback on music/speech audio and were able to achieve high satisfaction levels. We believe this idea of hybrid querying opens new problems in black-box optimization and solutions can benefit other applications beyond audio personalization.

44

PAUL, SANTANU, e ATUL PRAKASH. "SUPPORTING QUERIES ON SOURCE CODE: A FORMAL FRAMEWORK". International Journal of Software Engineering and Knowledge Engineering 04, n. 03 (settembre 1994): 325–48. http://dx.doi.org/10.1142/s0218194094000167.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Abstract (sommario):

Querying source code interactively for information is a critical task in reverse engineering of software. However, current source code query systems succeed in handling only small subsets of the wide range of queries possible on code, trading generality and expressive power for ease of implementation and practicality. We attribute this to the absence of clean formalisms for modeling and querying source code. In this paper, we present an algebraic framework (Source Code Algebra or SCA) that forms the basis of our source code query system. The benefits of using SCA include the integration of structural and flow information into a single source code data model, the ability to process high-level source code queries (command-line, graphical, relational, or pattern-based) by expressing them as equivalent SCA expressions, the use of SCA itself as a powerful low-level source code query language, and opportunities for query optimization. We present the SCA’s data model and operators and show that a variety of source code queries can be easily expressed using them. An algebraic model of source code addresses the issues of conceptual integrity, expressive power, and performance of a source code query system within a unified framework.

45

Dindorf, Carlo, Fabienne Weisenburger, Eva Bartaguiz, Jonas Dully, Luisa Klappenberger, Vanessa Lang, Lisa Zimmermann, Michael Fröhlich e Johann-Nikolaus Seibert. "Exploring Decision-Making Competence in Sugar-Substitute Choices: A Cross-Disciplinary Investigation among Chemistry and Sports and Health Students". Education Sciences 14, n. 5 (14 maggio 2024): 531. http://dx.doi.org/10.3390/educsci14050531.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Abstract (sommario):

Interdisciplinary teaching approaches have gained significant importance in today’s educational landscape. Among these approaches, decision-making competence plays a pivotal role by nurturing critical thinking and problem-solving skills. Focusing on the decision-making process regarding the sensibility of using sugar-substitutes, this study addresses three key questions. (1) Do chemistry and sports and health students differ in evaluation-competence? (2) What criteria do they use in evaluating the decision-making problem? (3) How do they use ChatGPT (OpenAI, San Francisco, CA, USA), an AI tool, in decision-making? Through surveys, the study revealed two evaluation-competence factors, identified decision-making criteria, and analyzed querying behavior using ChatGPT. The results revealed nuanced differences between the two student groups in the factors of evaluation-competence. While both groups showed improvements in recognizing moral dimensions and considering alternatives, chemistry students displayed enhanced abilities in establishing evaluation criteria and empathetic thinking. Furthermore, differences emerged in the criteria selected for decision-making and querying behavior, indicating varying engagement with ChatGPT. This study offers insights into enhancing interdisciplinary education and underscores the need for tailored interventions to address diverse student needs.

46

Lehotay-Kéry, Péter, e Attila Kiss. "Process, Analyze and Visualize Telecommunication Network Configuration Data in Graph Database". Vietnam Journal of Computer Science 07, n. 01 (11 dicembre 2019): 65–76. http://dx.doi.org/10.1142/s2196888820500037.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Abstract (sommario):

In network telemetry systems, nodes produce vast number of configuration files based on how they are configured. Steps were taken to process these files into databases to help the work of the developers, testers and customer support to focus on the development and testing and to be able to give advice to the customers about how to configure the nodes. However, the processing of these data in relational database manager system is slow, hard to query and the storage takes huge disk space. In this paper, we are presenting a way to store the data produced by these nodes in graph database, changing from relational database to NoSQL environment. With our approach, one can easily represent and visualize the network of machines. In the end, we are going to compare the inserting, querying time and storage size in different database manager systems. The results could also be used for other types of configuration data too from other kinds of machines to show the connection between them and query them easily.

47

Ng, Daniel, Dimitri Buzkov, Srivardhan Chimmula e Jamila Gul. "Division of Research Data-on-Demand: The Development Process for a Research Data Warehouse Rapid-Querying Tool". Journal of Patient-Centered Research and Reviews 3, n. 3 (15 agosto 2016): 203. http://dx.doi.org/10.17294/2330-0698.1351.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

48

Huang, Hua, Zhihui Lu, Rong Peng, Zaiwen Feng, Xiaohua Xuan, Patrick C. K. Hung e Shih-Chia Huang. "Efficiently querying large process model repositories in smart city cloud workflow systems based on quantitative ordering relations". Information Sciences 495 (agosto 2019): 100–115. http://dx.doi.org/10.1016/j.ins.2019.04.058.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

49

Parikh, Anish B., Elizabeth Aronson, Amir S. Steinberg e Cardinale B. Smith. "Standardization of the inpatient oncology signout process." Journal of Clinical Oncology 37, n. 27_suppl (20 settembre 2019): 253. http://dx.doi.org/10.1200/jco.2019.37.27_suppl.253.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Abstract (sommario):

253 Background: Provider handoffs are prone to medical errors which in turn impact patient outcomes. Standardized signout tools have helped address this issue, however not in oncology. Methods: A pre-intervention survey (S1) was used to evaluate the current inpatient signout process and identify flaws by querying inpatient hematology/oncology fellows, attendings, nurse practitioners, and physician assistants. This data informed the development of a standardized electronic signout tool which was subsequently piloted on our bone marrow transplant unit. A post-intervention survey (S2) is currently evaluating the impact of this tool. Results: Of S1 respondents (54%, 71/131), 75% felt the signout process needs improvement, largely due to outdated (70%) or incomplete (24%) information and general disorganization (49%). Nearly half felt the signout contains too much (28%) or too little (18%) information. 18% felt that patient care had been compromised or delayed due to poor signout. Items requested for inclusion in the signout tool by more than half of respondents included patient identifiers, health care proxy, code status/goals of care, active issues summary, cancer details and treatment history, and a to-do list. Full S1 results are shown in Table; S2 results are pending. Conclusions: Use of a standardized, electronic signout tool can further enhance the inpatient handoff process in terms of safety and efficiency. [Table: see text]

50

BAŞKARA, Rukiye, e Ahmet COŞKUNÇAY. "Enhancing Software Process Assessment with an Ontology-Based Tool: Integrating CMMI, SPICE, and TMMI Models". Gazi University Journal of Science Part A: Engineering and Innovation 10, n. 4 (31 dicembre 2023): 542–54. http://dx.doi.org/10.54287/gujsa.1384048.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Abstract (sommario):

Software process reference models like Capability Maturity Model Integration (CMMI) and Software Process Improvement and Capability Determination (SPICE) have played a crucial role in evaluating processes for several decades. Their adoption by institutions has become essential for consistently delivering software projects to customers on time and with expected quality. However, conducting software process assessments demands considerable time, effort, and skilled personnel. This research introduces an ontology-based tool that facilitates software process assessment for organizations by integrating widely used process reference models, namely CMMI, SPICE, and Test Maturity Model Integration (TMMI). The development of this tool involves multiple stages: creating ontologies for each process reference model, integrating them into the tool, enabling querying capabilities, and visualizing the ontologies. Through a validation study in a selected organization, two sets of processes were assessed using the Ontology-Based Software Process Assessment Tool (OSPAT). The results demonstrated that organizations can benefit from OSPAT in evaluating their software development processes across diverse reference models, thereby enhancing overall process efficiency and quality.

Articoli di riviste sul tema "Process querying"

Cita una fonte nei formati APA, MLA, Chicago, Harvard e in molti altri stili