Filters








148,736 Hits in 5.5 sec

A Combination Framework for Exploiting the Symbiotic Aspects of Process and Operational Data in Business Process Optimization [chapter]

Sylvia Radeschütz, Holger Schwarz, Marko Vrhovnik, Bernhard Mitschang
2013 Information Reuse and Integration in Academia and Industry  
A profound analysis of all relevant business data in a company is necessary for optimizing business processes effectively.  ...  We present a new matching framework to (semi-)automatically combine process data models and operational data models for performing such a profound business analysis.  ...  2) is based on all partially-annotated-pairing rules except rule R8 (elimination) and in the last one (3) all partially-annotated-pairing rules are applied.  ... 
doi:10.1007/978-3-7091-1538-1_2 fatcat:2v6k7dlxbrbjvnyva5yysq3q2e

Synthesizing partial component-level behavior models from system specifications

Ivo Krka, Yuriy Brun, George Edwards, Nenad Medvidovic
2009 Proceedings of the 7th joint meeting of the European software engineering conference and the ACM SIGSOFT symposium on The foundations of software engineering on European software engineering conference and foundations of software engineering symposium - ESEC/FSE '09  
We posit that synthesizing partial component-level behavior models from these early specifications can improve software development practices.  ...  Initial system specifications, such as use-case scenarios and properties, only partially specify the future system.  ...  Conversely, we determine the starting state for a scenario based on the SD annotations. Sibay et al.  ... 
doi:10.1145/1595696.1595756 dblp:conf/sigsoft/KrkaBEM09 fatcat:ykun5e23fzcgxfk2i7gfo5lxae

A semantic model of binding times for safe partial evaluation [chapter]

Fritz Henglein, David Sands
1995 Lecture Notes in Computer Science  
safety of a simple but liberal class of monovariant partial evaluators for a higher-order functional language with recursive types, based on annotations justified by the model.  ...  In program optimisation an analysis determines some information about a portion of a program, which is then used to justify certain transformations on the code.  ...  In particular, the partial evaluator we will describe operates on expressions with annotations on the binding occurrences of variables-and these are not proper sub-expressions.  ... 
doi:10.1007/bfb0026827 fatcat:3dljjjasojclleag56dttd2mii

Assessing the Quality of Mappings Between Semantic Resources in Construction [chapter]

Celson Lima, Catarina Ferreira da Silva, João Paulo Pimentão
2006 Lecture Notes in Computer Science  
Need: determine the degree of "confidence" on the mappings (to "calculate" the quality of the mappings) A fuzzy set F defined in a universe of discourse U is characterized by a fuzzy membership function  ...  µ F such that Modelling information for assessing quality of mappings using fuzzy logic Input variables Represent the similarities between two concepts mapped defined based on the objectives and  ...  0.33 Membership functions do not have to overlap But, one of the great strengths of fuzzy logic: "the glass is partially full and partially empty" Conclusions and future work Conclusions Methodology  ... 
doi:10.1007/11888598_38 fatcat:edxdkpidpzhrhos3gzqoeurytm

Managing requirements uncertainty with partial models

Rick Salay, Marsha Chechik, Jennifer Horkoff, Alessio Di Sandro
2013 Requirements Engineering  
In previous work, we developed a general approach for defining partial models and using them to reason about design models containing uncertainty.  ...  Partial models address this by being able to precisely represent uncertainty about model content.  ...  This makes the process of refinement central to partial modeling but not for variability models.  ... 
doi:10.1007/s00766-013-0170-y fatcat:make62csgrbubpdjdef3oyz3se

Managing requirements uncertainty with partial models

Rick Salay, Marsha Chechik, Jennifer Horkoff
2012 2012 20th IEEE International Requirements Engineering Conference (RE)  
In previous work, we developed a general approach for defining partial models and using them to reason about design models containing uncertainty.  ...  Partial models address this by being able to precisely represent uncertainty about model content.  ...  This makes the process of refinement central to partial modeling but not for variability models.  ... 
doi:10.1109/re.2012.6345804 dblp:conf/re/SalayCH12 fatcat:aikv5bzgbvct3lpg3uyvmoioma

Partial Or Complete, That's The Question

Qiang Ning, Hangfeng He, Chuchu Fan, Dan Roth
2019 Proceedings of the 2019 Conference of the North  
learning from complete ones.  ...  Existing annotation schemes usually aim at acquiring completely annotated structures, under the common perception that partial structures are of low quality and could hurt the learning process.  ...  Government is authorized to reproduce and distribute reprints for Government purposes notwithstanding any copyright notation here on.  ... 
doi:10.18653/v1/n19-1227 dblp:conf/naacl/NingHFR19 fatcat:lqepfumgubf45j46rjetuyhjui

Code Annotation for Safe and Efficient Dynamic Object Resolution

Andreas Hartmann, Wolfram Amme, Jeffery von Ronne, Michael Franz
2004 Electronical Notes in Theoretical Computer Science  
Our method performs a partial static escape analysis of each class at compile-time and then annotates the intermediate representation of that class with information which the just-in-time (JIT) compiler  ...  In this paper, we describe work in progress, which provides an annotation technique that reduces the runtime overhead required for performing object resolutions.  ...  While the "implied machine model" of ordinary SSA is one with an unlimited number of registers (=SSA variables), safeTSA uses a model in which there is a separate register plane for every type.  ... 
doi:10.1016/s1571-0661(05)82597-6 fatcat:numuz3yhzrbhhol6mtfkgctkne

Understanding Factuality in Abstractive Summarization with FRANK: A Benchmark for Factuality Metrics [article]

Artidoro Pagnoni, Vidhisha Balachandran, Yulia Tsvetkov
2021 arXiv   pre-print
Through these annotations, we identify the proportion of different categories of factual errors in various summarization models and benchmark factuality metrics, showing their correlation with human judgment  ...  Modern summarization models generate highly fluent but often factually unreliable outputs. This motivated a surge of metrics attempting to measure the factuality of automatically generated summaries.  ...  HR001120C0124, and in part by the National Science Foundation under Grants No. IIS2040926 and No. IIS2007960.  ... 
arXiv:2104.13346v2 fatcat:ffybzhxeezfkdoqcavtiwqvy3q

Neural Network Segmentation of Cell Ultrastructure Using Incomplete Annotation [article]

John Paul Francis, Hongzhi Wang, Kate White, Tanveer Syeda-Mahmood, Raymond Stevens
2020 arXiv   pre-print
The Pancreatic beta cell is an important target in diabetes research.  ...  During the course of the study, both complete and partial ultrastructure annotations were produced manually for different subsets of the data.  ...  θ) (4) In our application, only one partially labeled dataset is available.  ... 
arXiv:2004.09673v1 fatcat:2kxypy6kbrgffcgekklhrqm2de

Error-Correction and Aggregation in Crowd-Sourcing of Geopolitical Incident Information [chapter]

Alexander G. Ororbia, Yang Xu, Vito D'Orazio, David Reitter
2015 Lecture Notes in Computer Science  
The resulting hybrid model outperformed comparable, state-of-the-art aggregation models in both accuracy and computational scalability.  ...  We used a question tree to gather partially redundant data from each crowd worker.  ...  The Horizontal approach consists of a classifier trained on annotated story features as determined by the workers.  ... 
doi:10.1007/978-3-319-16268-3_47 fatcat:6p5hfptsl5bx3c3bupen57p2t4

A Methodology for Verifying Refinements of Partial Models

Rick Salay, Marsha Chechik, Michalis Famelis, Jan Gorzny
2015 Journal of Object Technology  
In our previous work, we have presented a general approach for precisely expressing uncertainty within models.  ...  Models are typically used for expressing information that is known at a particular stage in the software development process.  ...  Assume we determine that it must be in one or the other.  ... 
doi:10.5381/jot.2015.14.3.a3 fatcat:wso4hliccbh4pkuq7rzuj5uqeu

A Generalized Formal Framework for Partial Modeling [chapter]

Rick Salay, Marsha Chechik
2015 Lecture Notes in Computer Science  
In previous work, we have developed a language-independent partial modeling technique called MAVO that allows a software modeler to explicitly express and reason about model uncertainty.  ...  The cost of such a broadly applicable technique was to focus exclusively on the syntactic aspects of models.  ...  Var partiality allows a modeler to express uncertainty about distinctness of individual atoms in the model by annotating an atom to indicate whether it is a "constant" (c) or a "variable" (v).  ... 
doi:10.1007/978-3-662-46675-9_9 fatcat:oxcjokvmwbcgzfdkra46aeraw4

Evaluation of a large-scale biomedical data annotation initiative

Ronilda Lacson, Erik Pitzer, Christian Hinske, Pedro Galante, Lucila Ohno-Machado
2009 BMC Bioinformatics  
There was 89% strict inter-annotator agreement and 92% agreement when using semantic and partial similarity measures.  ...  This study describes a large-scale manual re-annotation of data samples in the Gene Expression Omnibus (GEO), using variables and values derived from the National Cancer Institute thesaurus.  ...  Acknowledgements The authors would like to thank the annotators who worked diligently on this project: Evelyn Pitzer, Pierre Cornell, Karrie Du, Lindy Su and Anthony Villanova.  ... 
doi:10.1186/1471-2105-10-s9-s10 pmid:19761564 pmcid:PMC2745681 fatcat:4ecozwf3sbdozchcrvojus74vi

SIMPL: A DSL for Automatic Specialization of Inference Algorithms [article]

Rohin Shah, Emina Torlak, Rastislav Bodik
2016 arXiv   pre-print
We present SIMPL, a domain specific language for inference algorithms, which uses this idea in order to automatically specialize annotated inference algorithms.  ...  Inference algorithms in probabilistic programming languages (PPLs) can be thought of as interpreters, since an inference algorithm traverses a model given evidence to answer a query.  ...  In the likelihood weighting for the Burglary model, cache determines that the weight depends only on A, leading to a small, compact cache (see Figure 5 ).  ... 
arXiv:1604.04729v1 fatcat:onkpwtvxsbeajkdznvye4dawdq
« Previous Showing results 1 — 15 out of 148,736 results