• Aucun résultat trouvé

[PDF] Top 20 Numerical MicroLocal Analysis Revisited

Has 10000 "Numerical MicroLocal Analysis Revisited" found on our website. Below are the top 20 most common "Numerical MicroLocal Analysis Revisited".

Numerical MicroLocal Analysis Revisited

Numerical MicroLocal Analysis Revisited

... and numerical analysis of the stability and accuracy of the NMLA (Numerical MicroLocal Analysis) method [3] and its ...source analysis leads to a modified second order (curvature ... Voir le document complet

63

Numerical MicroLocal Analysis in Time domain

Numerical MicroLocal Analysis in Time domain

... Il faut plutˆot consid´erer notre ´etude d’une part comme un premier pas vers l’´elaboration d’un proc´ed´e robuste et efficace d’analyse microlocale discr`ete et, d’autre part, comme un[r] ... Voir le document complet

87

Janssen's effect in a granular cell revisited by experiments and numerical simulations

Janssen's effect in a granular cell revisited by experiments and numerical simulations

... surface analysis during pouring correlated to the local mechanical state allows to indicate that kinetic energy has an influence on the Janssen effect (Duri et ... Voir le document complet

3

Janssen's effect in a granular cell revisited by experiments and numerical simulations

Janssen's effect in a granular cell revisited by experiments and numerical simulations

... surface analysis during pouring correlated to the local mechanical state allows to indicate that kinetic energy has an influence on the Janssen effect (Duri et ... Voir le document complet

3

Classical and sequential limit analysis revisited

Classical and sequential limit analysis revisited

... • on the other hand, Leblond et al.’s [20] approximate expression of the average value S( r ) was derived, in the absence of an exact solution to the hollow sphere problem for a general, non-hydrostatic loading, by using ... Voir le document complet

15

Combinatorial Bandits Revisited

Combinatorial Bandits Revisited

... [5]. Numerical experiments for some specific combinatorial problems are presented in the supplementary material, and show that ESCB significantly outperforms existing ... Voir le document complet

31

Schwinger mechanism revisited

Schwinger mechanism revisited

... The second family of methods that we have discussed in this review revolves around the worldline formalism, a formulation in which one-loop amplitudes in a background field are expressed as a path integration over all ... Voir le document complet

77

Taylor Series Revisited

Taylor Series Revisited

... 8 Conclusion With a renovated view on Taylor series, we provide an implementation of a genuine full-fledged algebra of such series, in the multivariate case. Even if the work is far from being completed, it has been ... Voir le document complet

19

Broken Triangles Revisited

Broken Triangles Revisited

... 1 Introduction The notion of broken triangle has generated a certain amount of interest in the constraints community: it has led to the definition of novel tractable classes [3, 7], variable elimination rules [1] and ... Voir le document complet

17

Taylor Series Revisited

Taylor Series Revisited

... features. This proved really helpful in designing correct-by-construction code, at least with respect to dimensions and derivation orders, while implementing complex and error-prone numerical computations. Also, ... Voir le document complet

36

Session Types Revisited

Session Types Revisited

... The main differences with respect to our work are: (i) the target language is closer to the session π-calculus having branch and select constructs (instead of having just one variant con[r] ... Voir le document complet

58

Subaltern Urbanization Revisited

Subaltern Urbanization Revisited

... Similarly, on the administrative recognition axis, we posited four types of settlements: (i) invisible, or not recognised as urban by either the census or the state; (ii) denied, or c[r] ... Voir le document complet

16

Clique-decomposition revisited

Clique-decomposition revisited

... In particular, they show that finding a clique-minimal separator in a graph is at least as hard as finding a simplicial vertex, even if a minimal elimination ordering is given as part of[r] ... Voir le document complet

9

Digit permutations revisited

Digit permutations revisited

... 1. Introduction The publication of V. G. Drinfeld’s seminal paper Elliptic modules [7] in 1974 has lead to the emergence of a true “analytic theory of numbers” in- volving analysis in finite characteristic. This ... Voir le document complet

37

Commodity Currencies Revisited

Commodity Currencies Revisited

... Sub-sample Analysis In order to establish that my results are not driven by a spike in correlations during the global …nancial crisis, I divide the sample into two sub-samples around the crisis ... Voir le document complet

63

Backtracking Counterfactuals Revisited

Backtracking Counterfactuals Revisited

... In particular, recall that we predict that (9) is true if its counterfactual time is some late admissible time t at which (by Contingent consequent) its consequent is not J- historically[r] ... Voir le document complet

71

Broken Triangles Revisited

Broken Triangles Revisited

... 1 Introduction The notion of broken triangle has generated a certain amount of interest in the constraints community: it has led to the definition of novel tractable classes [ 3 , 7 ], variable elimination rules [ 1 ] ... Voir le document complet

18

Color realism revisited

Color realism revisited

... In order for experience to represent this, it would have to represent the color properties themselves as having properties (in particular the property of being un- analysable or sui gene[r] ... Voir le document complet

5

Taylor Series Revisited

Taylor Series Revisited

... multivariate numerical expressions, involving elementary functions, inte- grations, partial derivations and arithmetical ...and numerical errors, expressed in any suitable user-provided error domain, such ... Voir le document complet

20

Gödel incompleteness revisited

Gödel incompleteness revisited

... Having a link between consistency (or soundness) and computability (K, Busy beaver functions or Kolmogorov complexity) would make possible an understanding of what prop- erties consisten[r] ... Voir le document complet

17

Show all 10000 documents...