نتایج جستجو برای: static approximation
تعداد نتایج: 301849 فیلتر نتایج به سال:
Deptartament d’Estructura i Constituents de la Matèria, Universitat de Barcelona Diagonal 647, 08028 Barcelona, Catalonia, Spain Abstract We point out that, due to the use of static nucleon propagators in Heavy Baryon Chiral Perturbation Theory, the current calculations of the nucleon-nucleon potential miss certain contributions starting at two loops. These contributions give rise to contact in...
In this paper we propose a new technique for the identification of NARX Hammerstein systems. The new technique is based on the theory of Least Squares Support Vector Machines function-approximation and allows to determine the memoryless static nonlinearity as well as the linear model parameters. As the technique is non-parametric by nature, no assumptions about the static nonlinearity need to b...
Path reduction is a well-known technique to alleviate the state-explosion problem incurred by explicit-state model checking, its key idea being to store states only at predetermined breaking points. This paper presents an adaptation of this technique which detects breaking points on-the-fly during state-space generation. This method is especially suitable for the detection of breaking points in...
In this paper, we revisit the view based security framework for XML without imposing any of the previously considered restrictions on the class of queries, the class of DTDs, and the type of annotations used to define the view. First, we show that the full class of Regular XPath queries is closed under query rewriting. Next, we address the problem of constructing a DTD that describes the view s...
BioAmbients is a derivative of mobile ambients that has shown promise of describing interesting features of the behaviour of biological systems. As for other ambient calculi static program analysis can be used to compute safe approximations of the behaviour of system models. We use these tools to model and analyse the production of cholesterol in living cells and show that we are able to pinpoi...
When designing a publicly available Web service, a service designer has to take care of costs and revenue caused by this services. In the very beginning possible partners might only be vaguely known, or the service behavior contains arbitrary repetitions. Then the estimation of costs for running this service is difficult and decisions based on them can hardly be made. We propose a static analys...
This paper shows how to construct static analyzers using tree automata and rewriting techniques. Starting from a term rewriting system representing the operational semantics of the target programming language and given a program to analyze, we automatically construct an over-approximation of the set of reachable terms, i.e. of the program states that can be reached. The approach enables fast pr...
Among Many fundamental communication primitives in wireless ad hoc network, flooding in wireless ad hoc network reduces the number of transmission in network and it plays a significant role in which every node transmits the message after receiving it for the first time. To successfully reducing the number of transmissions of broadcast that are required to achieve full delivery and constant appr...
We extend the 0-approximation of sensing actions and incomplete information in (Son and Baral 2001) to action theories with static causal laws and prove its soundness with respect to the possible world semantics. We also show that the conditional planning problem with respect to this approximation is NP-complete. We then present an answer set programming based conditional planner, called ASCP, ...
Post-Newtonian expansions of the Brill-Lindquist and Misner-Lindquist solutions of the timesymmetric two-black-hole initial value problem are derived. The static Hamiltonians related to the expanded solutions, after identifying the bare masses in both solutions, are found to differ from each other at the third post-Newtonian approximation. By shifting the position variables of the black holes t...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید