Filters








280,784 Hits in 7.4 sec

Quality of Service Ranking by Quantifying Partial Compliance of Requirements [chapter]

Agustín Eloy Martinez Suñé, Carlos Gustavo Lopez Pombo
2020 Lecture Notes in Computer Science  
Such a proposal relays on describing QoS contracts as convex specifications, and compliance checking is performed by the application of an analysis algorithm based on state of the art techniques used in  ...  While there is not much discussion on the importance of formally describing and analysing quantitative requirements in the process of software construction; in the paradigm of API-based software systems  ...  The next proposition provides upper bounds for the relative error that do not depend on the exact value v of the volume but on two consecutive approxima- tions: {v k−1 , v k } or {v k , v k+1 }.  ... 
doi:10.1007/978-3-030-50029-0_12 fatcat:qf7hqmagbbcq5dng32cc4oajue

Low-Complexity Image and Video Coding Based on an Approximate Discrete Tchebichef Transform

Paulo A. M. Oliveira, Renato J. Cintra, Fabio M. Bayer, Sunera Kulasekera, Arjuna Madanayake
2017 IEEE transactions on circuits and systems for video technology (Print)  
the 2-D version of the exact DTT.  ...  The DTT transform kernel does not depend on the input data and fast algorithms can be developed to real time applications.  ...  Acknowledgment Arjuna Madanayake thanks the Xilinx University Program (XUP) for the Xilinx Virtex-6 Sx475 FPGA device installed in on the ROACH2 board.  ... 
doi:10.1109/tcsvt.2016.2515378 fatcat:ial2s7rahbewbkyq6vudlfnhb4

Arithmetic with Limited Exponentiation [article]

Dmytro Taranovsky
2016 arXiv   pre-print
The strongest theories include computation corresponding to k-fold exponential (fixed k) time, Weak König's Lemma, and an arbitrary but fixed number of higher level function types with extensionality,  ...  recursive comprehension, and quantifier-free axiom of choice.  ...  complexity of evaluating the corresponding predicate (2) the permitted growth rate.  ... 
arXiv:1612.05941v1 fatcat:e5uceyudnfghvocs3xcydolbgi

Capturing non-Markovian dynamics with the reaction coordinate method [article]

Nicholas Anto-Sztrikacs, Dvira Segal
2021 arXiv   pre-print
We compare the spin dynamics and measures for non-Markovianity from the exact analytical solution to simulations based on the RC method at the level of a second order quantum master equation.  ...  As a case study, we focus on the pure decoherence model of a spin coupled to a harmonic reservoir.  ...  ACKNOWLEDGMENTS DS acknowledges support from an NSERC Discovery Grant and the Canada Research Chair program.  ... 
arXiv:2110.02455v2 fatcat:dhhmbxkv2ragzbdg26vqaualoi

An empirical study of the effect of background data size on the stability of SHapley Additive exPlanations (SHAP) for deep learning models [article]

Han Yuan, Mingxuan Liu, Lican Kang, Chenkui Miao, Ying Wu
2022 arXiv   pre-print
Generally, a background dataset consists of instances randomly sampled from the training dataset. However, the sampling size and its effect on SHAP remain to be unexplored.  ...  Nowadays, the interpretation of why a machine learning (ML) model makes certain inferences is as crucial as the accuracy of such inferences.  ...  Declaration of Competing Interest The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper  ... 
arXiv:2204.11351v2 fatcat:733kzv5srfgnbicl4oncy4yzfa

From Exact Learning to Computing Boolean Functions and Back Again [article]

Sergiu Goschin
2012 arXiv   pre-print
The goal of the paper is to relate complexity measures associated with the evaluation of Boolean functions (certificate complexity, decision tree complexity) and learning dimensions used to characterize  ...  Concretely, the goal is to provide lower and upper bounds of complexity measures for one problem type in terms of the other.  ...  Acknowledgments The author would like to thank Rocco Servedio, Michael Saks and Chris Mesterharm for their valuable comments and feedback.  ... 
arXiv:1205.4349v1 fatcat:g3nb7qevzresdnykgv2vjezxey

Compositional solution space quantification for probabilistic software analysis

Mateus Borges, Antonio Filieri, Marcelo d'Amorim, Corina S. Păsăreanu, Willem Visser
2013 Proceedings of the 35th ACM SIGPLAN Conference on Programming Language Design and Implementation - PLDI '14  
Current approaches rely on symbolic execution to identify the conditions to reach the target event and try to quantify the fraction of the input domain satisfying these conditions.  ...  The approach leverages interval constraint propagation to improve the accuracy of the estimation by focusing the sampling on the regions of the input domain containing the sought solutions.  ...  This independence is straightforwardly 1 As support of this statement, notice that Pr(C i j |v k =v k 1 ) = Pr(C i j |v k = v k 2 ), where v k / ∈Ṽ j andv 1 k andv 2 k are any two valid assignments for  ... 
doi:10.1145/2594291.2594329 dblp:conf/pldi/BorgesFdPV14 fatcat:skdo45flkzeurmxbjh26ehnj7e

On Presburger arithmetic extended with non-unary counting quantifiers [article]

Peter Habermehl
2022 arXiv   pre-print
This latter result almost matches Berman's exact complexity of first-order logic without counting quantifiers.  ...  The move from unary to non-unary quantifiers is non-trivial, since, e.g., the non-unary version of the H\"artig quantifier results in an undecidable theory.  ...  The authors thank Christian Schwarz from TU Ilmenau for proofreading the paper and for correcting two mistakes.  ... 
arXiv:2204.03903v1 fatcat:embmrmipmjdhhec4iebjuulnru

Collisionless gas flows over a flat cryogenic pump plate

Chunpei Cai, Khaleel Khasawneh
2009 Journal of Vacuum Science & Technology. A. Vacuum, Surfaces, and Films  
At any point off the plate, the local velocity distribution function ͑VDF͒ consists of several pieces of Maxwellian VDFs, one is characterized by free stream flow properties and the others by plate surface  ...  We use these solutions to derive several useful expressions, based on special measured flow field properties at specific locations off the plate, to evaluate the pump sticking probability.  ...  The same grids are used for the DSMC simulations and evaluations of the exact solutions.  ... 
doi:10.1116/1.3125266 fatcat:yfsfq6pg6vgjrmeh7uux3xgh2u

The FA Quantifier Fuzzification Mechanism: analysis of convergence and efficient implementations [article]

Félix Díaz-Hermida, Marcos Matabuena, Juan C. Vidal
2019 arXiv   pre-print
In order to prove that this model is not only a theoretical approach, we show exact algorithmic solutions for the most common linguistic quantifiers as well as an approximate implementation by means of  ...  The fuzzy quantification model FA has been identified as one of the best behaved quantification models in several revisions of the field of fuzzy quantification.  ...  ED431C 2018/29) and the European Regional Development Fund (ERDF) and is also supported by the Spanish Ministry of Economy and Competitiveness under the project TIN2015-73566-JIN.  ... 
arXiv:1902.02132v1 fatcat:fnmkhwwpxzaxhhba7xwrdb4mp4

Complexity and scaling in quantum quench in 1+1 dimensional fermionic field theories [article]

Sinong Liu
2019 arXiv   pre-print
We consider the scaling behavior of circuit complexity under quantum quench in an a relativistic fermion field theory on a one dimensional spatial lattice.  ...  We find a variety of scaling behavior as a function of the quench rate, starting with a saturation for quenches at the lattice scale, a "fast quench scaling" at intermediate rate and a Kibble Zurek scaling  ...  The work is partially supported by the National Science Foundation grant NSF-PHY-1521045.  ... 
arXiv:1902.02945v1 fatcat:3uy6uq5nwbg6tprdggn7hptkhy

Approximate Semantic Matching of Events for the Internet of Things

Souleiman Hasan, Edward Curry
2014 ACM Transactions on Internet Technology  
The model is formalized as an ensemble of semantic and top-k matchers along with a probability model for uncertainty management.  ...  In semantically loosely-coupled environments, one approximate subscription can compensate for hundreds of exact subscriptions to cover all possibilities in environments which require complete prior knowledge  ...  Sorting M in Step 3 has a time complexity of O(n.m.log(m) ). Taking the head of the queue in Step 9 k times has an overall complexity of O(k).  ... 
doi:10.1145/2633684 fatcat:vllpzq35zffcrl4jhrvxe53uxu

Oracle Circuits for Branching-Time Model Checking [chapter]

Philippe Schnoebelen
2003 Lecture Notes in Computer Science  
This framework allows us to evaluate the precise computational complexity of model checking for some branching-time logics where it was known that the problem is NP-hard and coNP-hard.  ...  It is shown that they can be evaluated in deterministic polynomial-time with a polylog number of adaptive queries to an NP oracle.  ...  Our formulation quantifies upon indexes l 1 , . . . , l m in the 1, . . . , k range but such a l j is a shorthand for e.g. k bits "l j =1", . . . , "l j =k" among which one and only one will be true.  ... 
doi:10.1007/3-540-45061-0_62 fatcat:eepwu7zhkfcvhm7p5k4fxi3qjy

A methodology for the rigorous verification of Particle-in-Cell simulations

Fabio Riva, Carrie F. Beadle, Paolo Ricci
2017 Physics of Plasmas  
The solution verification consists of quantifying both the statistical and discretization uncertainties.  ...  The solution verification methodology is applied to quantify the numerical uncertainty affecting the two-stream instability growth rate, which is numerically evaluated thanks to a PIC simulation. * Electronic  ...  We apply this procedure for different N , and, for each N , we repeat the process a number of times, changing the pseudorandom number generator seed.  ... 
doi:10.1063/1.4977917 fatcat:ggdgm5dq7zb6fh5quz24j23xju

A general framework for probabilistic approaches to fuzzy quantification

Félix Díaz-Hermida, Alberto Bugarín, Purificación Cariñena, Senén Barro
2001 European Society for Fuzzy Logic and Technology  
This framework allows the description of previous probabilistic models and also the defhtion of new ones, all of them endowed with a semantic interpretation based on a "voter's profile".  ...  The methods within the framework fulfil a number of important and adequate properties of interest for fuzzy quantification and can also deal with very different types of quantifiers, as comparative and  ...  Authors wish to acknowledge the support of the Secretaria Xeral de I+D (Xunta de Galicia) through grant PGIDT99PXI20603A and Spanish Ministry of Education and Culture through grant TIC2000-0873.  ... 
dblp:conf/eusflat/Diaz-HermidaBCB01 fatcat:zjeomlbjebd3vlz5x6zn4l4cme
« Previous Showing results 1 — 15 out of 280,784 results