Academic literature on the topic 'Modèles de calcul non standards'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Modèles de calcul non standards.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Journal articles on the topic "Modèles de calcul non standards":
Boughattas, Sedki. "L'arithmétique ouverte et ses modèles non-standards." Journal of Symbolic Logic 56, no. 2 (June 1991): 700–714. http://dx.doi.org/10.2307/2274712.
Souchon, Y., F. Trocherie, E. Fragnoud, and C. Lacombe. "Les modèles numériques des microhabitats des passons : application et nouveaux développements." Revue des sciences de l'eau 2, no. 4 (April 12, 2005): 807–30. http://dx.doi.org/10.7202/705056ar.
Cléry, Isabelle, and Marc Pierrot-Deseilligny. "Une interface ergonomique de calcul de modèles 3D par photogrammétrie." Revue Française de Photogrammétrie et de Télédétection, no. 196 (April 15, 2014): 40–51. http://dx.doi.org/10.52638/rfpt.2011.36.
Carrive, Laurent. "De la réalité des modèles et des théories." Acta Europeana Systemica 4 (July 14, 2020): 89–98. http://dx.doi.org/10.14428/aes.v4i1.57283.
DUCROCQ, V. "Les techniques d’evaluation génétique des bovins laitiers." INRAE Productions Animales 3, no. 1 (February 3, 1990): 3–16. http://dx.doi.org/10.20870/productions-animales.1990.3.1.4355.
Chanier, Paul. "Le sophisme des n dimensions et son dépistage dans l’analyse économique." Économie appliquée 46, no. 2 (1993): 147–78. http://dx.doi.org/10.3406/ecoap.1993.2332.
Desmorat, Rodrigue. "Positivité de la dissipation intrinsèque d'une classe de modèles d'endommagement anisotropes non standards." Comptes Rendus Mécanique 334, no. 10 (October 2006): 587–92. http://dx.doi.org/10.1016/j.crme.2006.07.015.
Setton, Robin. "Is Non-Intra-IE Interpretation Different?" Meta 38, no. 2 (September 30, 2002): 238–56. http://dx.doi.org/10.7202/004115ar.
Marsault, Xavier, and Hong Minh-Chau Nguyen. "Les GANs : stimulateurs de créativité en phase d’idéation." SHS Web of Conferences 147 (2022): 06003. http://dx.doi.org/10.1051/shsconf/202214706003.
Paquier, A., J. M. Tanguy, S. Haider, and B. Zhang. "Estimation des niveaux d'inondation pour une crue éclair en milieu urbain : comparaison de deux modèles hydrodynamiques sur la crue de Nîmes d'octobre 1988." Revue des sciences de l'eau 16, no. 1 (April 12, 2005): 79–102. http://dx.doi.org/10.7202/705499ar.
Dissertations / Theses on the topic "Modèles de calcul non standards":
Emmanuel, Aurélien. "Courbes d'accumulations des machines à signaux." Electronic Thesis or Diss., Orléans, 2023. http://www.theses.fr/2023ORLE1079.
This thesis studies a geometric computational model: signal machines. We show how to draw function graphs using-binary trees. In the world of cellular automata, we often consider particles or signals: structures that are periodic in time and space, that is, structures that move at constant speed. When several signals meet, a collision occurs, and the incoming signals can continue, disappear, or give rise to new signals, depending on the rules of the cellular automaton. Signal-machines are a computational model that takes these signals as basic building blocks. Visualized in a space-time diagram, with space on the horizontal axis and time running upwards, this model consists of calculating by drawing segments and half-lines. We draw segments upwards until two or more intersect, and then start new segments, according to predefined rules. Compared to cellular automata, signal-machines allow for the emergence of a new phenomenon: the density of signals can be arbitrarily large, even infinite, even when starting from a finite initial configuration. Such points in the space-time diagram, whose neighborhoods contain an infinity of signals, are called accumulation points.This new phenomenon allows us to define new problems geometrically. For example, what are the isolated accumulation points that can be achieved using rational initial positions and rational velocities? Can we make so the set of accumulation points is a segment? A Cantor set? In this thesis, we tackle the problem of characterizing the function graphs that can be drawn using an accumulation set. This work fits into the exploration of the computational power of signal-machines, which in turn fits into the study of the computational power of non-standard models. We show that the functions from a compact segment of the line of Real numbers whose graph coincides with the accumulation set of a signal machine are exactly the continuous functions. More generally, we show how signal machines can draw any lower semicontinuous function. We also study the question under computational constraints, with the following result: if a computable signal-machine diagram coincides with the graph of a Lipschitz-function of sufficiently small Lipschitz coefficient, then that function is the limit of a growing and computable sequence of rational step functions
Pégny, Maël. "Sur les limites empiriques du calcul : calculabilité, complexité et physique." Thesis, Paris 1, 2013. http://www.theses.fr/2013PA010673/document.
Recent years have seen a surge in the interest for non-standard computational models, inspired by physical, biological or chemical phenomena. The exact properties of some of these models have been a topic of somewhat heated discussion: what do they compute? And how fast do they compute? The stakes of these questions were heightened by the claim that these models would violate the accepted limits of computation, by violating the Church-Turing Thesis or the Extended Church-Turing Thesis. To answer these questions, the physical realizability of some of those models - or lack thereof - has often been put at the center of the argument. It thus seems that empirical considerations have been introduced into the very foundations of computability and computational complexity theory, both subjects that would have been previously considered purely a priori parts of logic and computer science. Consequently, this dissertation is dedicated to the following question: do computability and computational complexity theory rest on empirical foundations? If yes, what are these foundations? We will first examine the precise meaning of those limits of computation, and articulate a philosophical conception of computation able to make sense of this variety of models. We then answer the first question by the affirmative, through a careful examination of current debates around non-standard models. We show the various difficulties surrounding the second question, and study how they stem from the complex translation of computational concepts into physical limitations
Bizouard, Vincent. "Calculs de précision dans un modèle supersymétrique non minimal." Thesis, Université Grenoble Alpes (ComUE), 2015. http://www.theses.fr/2015GREAY075/document.
Although the Standard Model has been very successful so far, it presents several limitations showing that it is only an effective low energy theory. For example, the neutrino masses or dark matter are not predicted in this model. Gravity is also not taken into account and we expect that it plays a quantum role at energies around the Planck mass. Moreover, radiative corrections to the Higgs boson mass suffer from quadratic divergences. All these problems underline the fact that new physics should appear, and this has to be described by an extension of the Standard Model. One well-motivated possibility is to add a new space-time symetry, called Supersymmetry, which link bosons and fermions. In its minimal extension, Supersymmetry can already solve the dark matter paradox with a natural candidate, the neutralino, and provide a cancellation of the dangerous quadratic corrections to the Higgs boson mass.In this thesis, we focussed on the Next-to-Minimal SuperSymmetric extension of the Standard Model, the NMSSM. To compare theoretical predictions with experiments, physical observables must be computed precisely. Since these calculations are long and complex, automatisation is desirable. This was done by developping SloopS, a program to compute one-loop decay width and cross-section at one-loop order in Supersymmetry. With this code, we first analysed the decay of the Higgs boson in a photon and a Z boson. This decay mode is induced at the quantum level and thus is an interesting probe of new physics. Its measurement has been started during Run 1 of the LHC and is continued now in Run 2. The possibility of deviation between the measured signal strength and the one predicted by the Standard Model motivates a careful theoretical analysis in beyond Standard Models which we realised within the NMSSM. Our goal was to compute radiative corrections for any process in this model. To cancel the ultraviolet divergences appearing in higher order computations, we had to carry out and implement the renormalisation of the NMSSM in SloopS. Finally, it was possible to use the renormalised model to compute radiatives corrections to masses and decay widths of Higgs bosons and supersymmetric particles in the NMSSM and to compare the results between different renormalisation schemes
Boughattas, Sedki. "L'Arithmétique ouverte et ses modèles non-standards." Paris 7, 1987. http://www.theses.fr/1987PA077044.
Ren, Chengfang. "Caractérisation des performances minimales d'estimation pour des modèles d'observations non-standards." Thesis, Paris 11, 2015. http://www.theses.fr/2015PA112167/document.
In the parametric estimation context, estimators performances can be characterized, inter alia, by the mean square error and the resolution limit. The first quantities the accuracy of estimated values and the second defines the ability of the estimator to allow a correct resolvability. This thesis deals first with the prediction the "optimal" MSE by using lower bounds in the hybrid estimation context (i.e. when the parameter vector contains both random and non-random parameters), second with the extension of Cramér-Rao bounds for non-standard estimation problems and finally to the characterization of estimators resolution. This manuscript is then divided into three parts :First, we fill some lacks of hybrid lower bound on the MSE by using two existing Bayesian lower bounds: the Weiss-Weinstein bound and a particular form of Ziv-Zakai family lower bounds. We show that these extended lower bounds are tighter than the existing hybrid lower bounds in order to predict the optimal MSE.Second, we extend Cramer-Rao lower bounds for uncommon estimation contexts. Precisely: (i) Where the non-random parameters are subject to equality constraints (linear or nonlinear). (ii) For discrete-time filtering problems when the evolution of states are defined by a Markov chain. (iii) When the observation model differs to the real data distribution.Finally, we study the resolution of the estimators when their probability distributions are known. This approach is an extension of the work of Oh and Kashyap and the work of Clark to multi-dimensional parameters estimation problems
Kechid, Mounir. "La programmation dynamique non-serial dans les modèles de calcul parallèle BSP/CGM." Amiens, 2009. http://www.theses.fr/2009AMIE0110.
We attend this decade a trend (migration) of the parallel hardware towards coarse-grain multiprocessor systems. However, the majority of the traditional parallel software is designed for fine-grain system and for shared memory machines. One of the main current challenges of the researchers in design of parallel algorithms is to reduce this incompatibility said “software-hardware gap”. Big interest is so focused on the design of efficient parallel algorithms for coarse-grain multi-processors systems. It's in this context that this thesis contributes. We use the BSP/CGM parallel computing model (Bulk synchronous parallel Coarse Grained Multicomputer) to design solutions for problems using dynamic programming approach. We are interested in a typical sample of the dynamic programming polyadic non-serial which is characterized by a very strong dependence of calculations. It is about an important class of problems widely used in the high-performance applications (MCOP: the matrix chain ordering problem, OBST: the optimal binary search tree problem, CTP: the convex polygons triangulation). We firstly present a detailed study of the design tools, i. E. BSP/CGM model, as well as a proposition of refinement of the BSP cost model to improve its prediction accuracy. We present then a generic BSP/CGM solution for the aforesaid problems class. At the end, after a study of the constraints of the acceleration of this generic solution in BSP/CGM model for the problems MCOP and OBST, two accelerated BSP/CGM algorithms are proposed
Pétrino, Paule. "Mise au point d'une méthode prédictive de calcul des viscosités des mélanges liquides non ioniques." Aix-Marseille 3, 1991. http://www.theses.fr/1991AIX3A004.
Daouia, Abdelaati. "Analyse non-paramétrique des frontières de production et des mesures d'efficacité à l'aide de quantiles conditionnels non-standards." Toulouse 1, 2003. http://www.theses.fr/2003TOU10049.
The present thesis is a part of the literature of nonparametric frontier and efficiency estimation in that we instigate this problem. Chapter 1 introduces a mathematical formulation of the problem of efficiency measurement showing its connection with the problem of estimating the support of a multivariate distribution, and summarizes the contributions of this dissertation
Cois, Olivier. "Systèmes linéaires non entiers et identification par modèle non entier : application en thermique." Bordeaux 1, 2002. http://www.theses.fr/2002BOR12534.
This thesis deals with system representation and identification by fractional models. Chapter 1 recalls the definitions and main properties of the fractional operators. Chapter 2 proposes the study of a continuous MIMO complex-fractional system through a generalized state space representation. A stability theorem is established from the output analytical expression. Chapter 3 deals with the modeling of diffusive processes using fractional differentiation operators. The heat transfer trough 6 different finite and semi-infinite media is studied. Approximations using integer or fractional transfer functions are then established and compared. Chapter 4 is devoted to system identification by fractional model. Equation error methods as well as output error methods are developed. Finally, chapter 5 gives an application of system identification to the solving of a thermal inverse problem. An example, consisting of the estimation of the thermal cut conditions, is given
BERGA, ABDELMAJID. "Calcul elastoplastique des sols a lois non associees par elements finis base sur l'approche des materiaux standards implicites." Compiègne, 1993. http://www.theses.fr/1993COMP595S.
Book chapters on the topic "Modèles de calcul non standards":
BESSON, Jacques. "Méthodes numériques pour la rupture ductile." In Modélisation numérique en mécanique fortement non linéaire, 149–88. ISTE Group, 2023. http://dx.doi.org/10.51926/iste.9081.ch4.