Готові списки джерел за темами / Argument de point fixe

Добірка наукової літератури з теми "Argument de point fixe"

Автор: Grafiati

Опубліковано: 7 серпня 2022

Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями

Оберіть тип джерела:

Ознайомтеся зі списками актуальних статей, книг, дисертацій, тез та інших наукових джерел на тему "Argument de point fixe".

Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.

Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.

Статті в журналах з теми "Argument de point fixe":

XAVIER, JULIANA. "Handel’s fixed point theorem revisited." Ergodic Theory and Dynamical Systems 33, no. 5 (August 6, 2012): 1584–610. http://dx.doi.org/10.1017/s0143385712000338.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Анотація:

AbstractMichael Handel proved in [A fixed-point theorem for planar homeomorphisms. Topology38 (1999), 235–264] the existence of a fixed point for an orientation-preserving homeomorphism of the open unit disk that can be extended to the closed disk, provided that it has points whose orbits form an oriented cycle of links at infinity. Later, Patrice Le Calvez gave a different proof of this theorem based only on Brouwer theory and plane topology arguments in [Une nouvelle preuve du théorème de point fixe de Handel. Geom. Topol.10(2006), 2299–2349]. These methods improved the result by proving the existence of a simple closed curve of index 1. We give a new, simpler proof of this improved version of the theorem and generalize it to non-oriented cycles of links at infinity.

Gretz, Shai, Roni Friedman, Edo Cohen-Karlik, Assaf Toledo, Dan Lahav, Ranit Aharonov, and Noam Slonim. "A Large-Scale Dataset for Argument Quality Ranking: Construction and Analysis." Proceedings of the AAAI Conference on Artificial Intelligence 34, no. 05 (April 3, 2020): 7805–13. http://dx.doi.org/10.1609/aaai.v34i05.6285.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Анотація:

Identifying the quality of free-text arguments has become an important task in the rapidly expanding field of computational argumentation. In this work, we explore the challenging task of argument quality ranking. To this end, we created a corpus of 30,497 arguments carefully annotated for point-wise quality, released as part of this work. To the best of our knowledge, this is the largest dataset annotated for point-wise argument quality, larger by a factor of five than previously released datasets. Moreover, we address the core issue of inducing a labeled score from crowd annotations by performing a comprehensive evaluation of different approaches to this problem. In addition, we analyze the quality dimensions that characterize this dataset. Finally, we present a neural method for argument quality ranking, which outperforms several baselines on our own dataset, as well as previous methods published for another dataset.

Wreen, Michael J. "The Standing is Slippery." Philosophy 79, no. 4 (October 2004): 553–72. http://dx.doi.org/10.1017/s0031819104000440.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Анотація:

This paper is a critical examination of the so-called slippery slope argument for the conservative position on abortion. The argument was discussed in the philosophic literature some time back, but has since fallen into disfavor.The argument is first exposed and a general objection to it is advanced, then rebutted. Rosalind Hursthouse's more detailed and stronger objection is next aired, but also found less than convincing. In the course of discussing her objection, the correct form of the argument is identified, and it's noted that rejection of the argument requires finding fault with its inductive premise. That, in turn, requires either (a) identifying and defending a cutoff point other than conception, or (b) not identifying a cutoff point but directly attacking the argument's conclusion. As far as (a) is concerned, all except one alternative cutoff point have severe problems that have been well discussed in the literature. The one that doesn't, the appearance of the ‘primitive streak’, is examined in detailed, but ultimately rejected. As for (b), five different grounds for rejecting the conclusion are identified and discussed, but none is found plausible.Variations on the slippery slope argument, concerning different conclusions that it may have, are then distinguished, related to each other, and critically discussed, and the paper ends with some cautionary remarks about the defense of the argument tendered.

Khan, Abdul Qadeer. "Global Dynamics, Bifurcation Analysis, and Chaos in a Discrete Kolmogorov Model with Piecewise-Constant Argument." Mathematical Problems in Engineering 2021 (November 5, 2021): 1–14. http://dx.doi.org/10.1155/2021/5259226.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Анотація:

The local behavior with topological classifications, bifurcation analysis, chaos control, boundedness, and global attractivity of the discrete-time Kolmogorov model with piecewise-constant argument are investigated. It is explored that Kolmogorov model has trivial and two semitrival fixed points for all involved parameters, but it has an interior fixed point under definite parametric condition. Then, by linear stability theory, local dynamics with different topological classifications are investigated around trivial, semitrival, and interior fixed points. Further for the discrete Kolmogorov model, existence of periodic points is also investigated. It is also investigated the occurrence of bifurcations at interior fixed point and proved that at interior fixed point, there exists no bifurcation, except flip bifurcation by bifurcation theory. Next, feedback control method is utilized to stabilize chaos existing in discrete Kolmogorov model. Boundedness and global attractivity of the discrete Kolmogorov model are also investigated. Finally, obtained results are numerically verified.

Došlá, Zuzana, Mauro Marini, and Serena Matucci. "A fixed-point approach for decaying solutions of difference equations." Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences 379, no. 2191 (January 4, 2021): 20190374. http://dx.doi.org/10.1098/rsta.2019.0374.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Анотація:

A boundary value problem associated with the difference equation with advanced argument * Δ ( a n Φ ( Δ x n ) ) + b n Φ ( x n + p ) = 0 , n ≥ 1 is presented, where Φ ( u ) = | u | α sgn u , α > 0, p is a positive integer and the sequences a , b , are positive. We deal with a particular type of decaying solution of (*), that is the so-called intermediate solution (see below for the definition). In particular, we prove the existence of this type of solution for (*) by reducing it to a suitable boundary value problem associated with a difference equation without deviating argument. Our approach is based on a fixed-point result for difference equations, which originates from existing ones stated in the continuous case. Some examples and suggestions for future research complete the paper. This article is part of the theme issue ‘Topological degree and fixed point theories in differential and difference equations’.

Jachymski, Jacek. "Another proof of the Browder–Göhde–Kirk theorem via ordering argument." Bulletin of the Australian Mathematical Society 65, no. 1 (February 2002): 105–7. http://dx.doi.org/10.1017/s0004972700020104.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Анотація:

Using the Zermelo Principle, we establish a common fixed point theorem for two progressive mappings on a partially ordered set. This result yields the Browder–Göhde–Kirk fixed point theorem for nonexpansive mappings.

Aronowicz, Annette. "On Michael Fagenblat's A Covenant of Creatures." AJS Review 35, no. 1 (April 2011): 105–14. http://dx.doi.org/10.1017/s0364009411000092.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Анотація:

Michael Fagenblat's A Covenant of Creatures is a bold and powerful book. Given the nuanced nature of its arguments, no sooner did I think I captured his thought than I discovered that Fagenblat might also have made the opposite point. Nonetheless, a central line of argument does run through the book. My task will be to present it and also to challenge it. The best tribute to this fine work is to engage in vigorous debate about its claims.

O'Regan, Donal. "Existence results for differential equations with reflection of the argument." Journal of the Australian Mathematical Society. Series A. Pure Mathematics and Statistics 57, no. 2 (October 1994): 237–60. http://dx.doi.org/10.1017/s1446788700037538.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Анотація:

AbstractExistence principles are given for systems of differential equations with reflection of the argument. These are derived using fixed point analysis, specifically the Nonlinear Alternative. Then existence results are deduced for certain classes of first and second order equations with reflection of the argument.

Premoselli, Bruno. "A pointwise finite-dimensional reduction method for a fully coupled system of Einstein–Lichnerowicz type." Communications in Contemporary Mathematics 20, no. 06 (August 27, 2018): 1750076. http://dx.doi.org/10.1142/s0219199717500766.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Анотація:

We construct non-compactness examples for the fully coupled Einstein–Lichnerowicz constraint system in the focusing case. The construction is obtained by combining pointwise a priori asymptotic analysis techniques, finite-dimensional reductions and a fixed-point argument. More precisely, we perform a fixed-point procedure on the remainders of the expected blow-up decomposition. The argument consists of an involved finite-dimensional reduction coupled with a ping-pong method. To overcome the non-variational structure of the system, we work with remainders which belong to strong function spaces and not merely to energy spaces. Performing both the ping-pong argument and the finite-dimensional reduction therefore heavily relies on the a priori pointwise asymptotic techniques of the [Formula: see text] theory.

Zhang, Xuemei, and Meiqiang Feng. "Green’s Function and Positive Solutions for a Second-Order Singular Boundary Value Problem with Integral Boundary Conditions and a Delayed Argument." Abstract and Applied Analysis 2014 (2014): 1–9. http://dx.doi.org/10.1155/2014/393187.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Анотація:

This paper investigates the expression and properties of Green’s function for a second-order singular boundary value problem with integral boundary conditions and delayed argument-x′′t-atx′t+btxt=ωtft, xαt, t∈0, 1; x′0=0, x1-∫01htxtdt=0, wherea∈0, 1, 0, +∞, b∈C0, 1, 0, +∞and,ωmay be singular att=0or/and att=1. Furthermore, several new and more general results are obtained for the existence of positive solutions for the above problem by using Krasnosel’skii’s fixed point theorem. We discuss our problems with a delayed argument, which may concern optimization issues of some technical problems. Moreover, the approach to express the integral equation of the above problem is different from earlier approaches. Our results cover a second-order boundary value problem without deviating arguments and are compared with some recent results.

Більше джерел

Дисертації з теми "Argument de point fixe":

Oussaily, Aya. "Étude théorique et numérique des systèmes modélisant la dynamique des densités des dislocations." Thesis, Compiègne, 2021. https://bibliotheque.utc.fr/Default/doc/SYRACUSE/2021COMP2634.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Анотація:

Dans cette thèse, nous nous intéressons à l’analyse théorique et numérique de la dynamique des densités des dislocations. Les dislocations sont des défauts linéaires qui se déplacent dans les cristaux lorsque ceux-ci sont soumis à des contraintes extérieures. D’une manière générale, la dynamique des densités des dislocations est décrite par un système d’équations de transport, où les champs de vitesse dépendent de manière non-locale des densités des dislocations. Au départ, notre travail se focalise sur l’étude d’un système unidimensionnel (2 × 2) de type Hamilton-Jacobi dérivé d’un système bidimensionnel proposé par Groma et Balogh en 1999. Pour ce modèle, nous montrons un résultat d’existence globale et d’unicité. En addition, nous nous intéressons à l’étude numérique de ce problème, complété par des conditions initiales croissantes, en proposant un schéma aux différences finies implicite dont on prouve la convergence. Ensuite, en s’inspirant du travail effectué pour la résolution de la dynamique des densités des dislocations, nous mettons en œuvre une théorie plus générale permettant d’obtenir un résultat similaire d’existence et d’unicité d’une solution dans le cas des systèmes de type eikonal unidimensionnels. En considérant des conditions initiales croissantes, nous faisons une étude numérique pour ce système. Sous certaines conditions de monotonies sur la vitesse, nous proposons un schéma aux différences finies implicite permettant de calculer la solution discrète et simuler ainsi la dynamique des dislocations à travers ce modèle
In this thesis, we are interested in the theoretical and numerical studies of dislocations densities. Dislocations are linear defects that move in crystals when those are subjected to exterior stress. More generally, the dynamics of dislocations densities are described by a system of transport equations where the velocity field depends non locally on the dislocations densities. First, we are interested in the study of a one dimensional submodel of a (2 × 2) Hamilton-Jacobi system introduced by Groma and Balogh in 1999, proposed in the two dimensional case. For this system, we prove global existence and uniqueness results. Adding to that, considering nondecreasing initial data, we study this problem numerically by proposing a finite difference implicit scheme for which we show the convergence. Then, inspired by the first work, we show a more general theory which allows us to get similar results of existence and uniqueness of solution in the case of one dimensional eikonal systems. By considering nondecreasing initial data, we study this problem numerically. Under certain conditions on the velocity, we propose a finite difference implicit scheme allowing us to calculate the discrete solution and simulate then the dislocations dynamics via this model

Vážanová, Gabriela. "Existence a vlastnosti globálních řešení funkcionálních diferenciálních rovnic smíšeného typu." Doctoral thesis, Vysoké učení technické v Brně. Fakulta elektrotechniky a komunikačních technologií, 2020. http://www.nusl.cz/ntk/nusl-433560.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Анотація:

Dizertační práce se věnuje funkcionálním diferenciálním rovnicím smíšeného typu. Poskytuje kritéria pro existenci globálních a semi-globálních řešení diferenciálních systémů smíšeného typu. Metody použité v teto práci spočívají v sestavení vhodných operátorů pro diferenciální rovnice a prokázání existence jejich pevných bodů. Tyto pevné body jsou potom použity ke konstrukci řešení rovnic s předcházením a zpožděním. V důkazech tvrzení jsou použity monotónní iterační metoda a Schauderovy-Tychonovovy věty o existenci pevného bodu. V obou případech jsou uvedeny také odhady řešení. Pokud je použita iterační metoda, lze tyto odhady zlepšit iterováním. Kromě toho jsou odvozena kritéria pro lineární rovnice a systémy a je uvedena řada přikladů. Dosažené výsledky lze aplikovat také pro obyčejné diferenciální rovnice nebo diferenciální rovnice se zpožděním či s předcházením argumentu.

Salloum, Zaynab. "Étude mathématique d’écoulements de fluides viscoélastiques dans des domaines singuliers." Thesis, Paris Est, 2008. http://www.theses.fr/2008PEST0017/document.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Анотація:

Cette thèse est consacrée à l’analyse mathématique de trois problèmes d’écoulements de fluides viscoélastiques de type Oldroyd. Tout d’abord, nous étudions des écoulements stationnaires faiblement compressibles dans un domaine borné avec des conditions au bord de type "rentrante-sortante". Nous étudions aussi le problème d’écoulements stationnaires faiblement compressibles dans un coin convexe. En utilisant une méthode de point fixe (premier et deuxième problèmes) et une décomposition de Helmoltz (deuxième problème), nous montrons des résultats d’existence et d’unicité des solutions. Nous étudions également le cas d’un écoulement non stationnaire. Nous montrons un résultat d’existence locale et un résultat d’existence globale, avec des conditions initiales suffisamment petites, pour des fluides compressibles. Nous démontrons aussi la convergence du modèle d’écoulement viscoélastique compressible à faible nombre de Mach vers le modèle incompressible lorsque les données initiales sont "bien préparées"
In this PHD thesis, we study three problems for viscoelastic flows of Oldroyd type. First, we study steady flows of slightly compressible in a bounded domain with non-zero velocities on the boundary ; the pressure and the extra-stress tensor are prescribed on the part of the boundary corresponding to entering velocity. This causes a weak singularity in the solution at the junction of incoming and outgoing flows. We also study the problem of steady flows of slightly compressible fluids with zero boundary conditions in a domain with an isolated corner point. Using a method of fixed point (first and second problems) and a Helmoltz decomposition (second problem), we show some results of existence and uniqueness of solutions. In the last part, we study the case of a non-steady flow : we show some results of local and of global existence, with sufficiently small initial data, for compressible flows. The zero-Mach number limit is also established

Xavier, Juliana. "Autour du théorème de point fixe de Handel." Paris 13, 2011. http://www.theses.fr/2011PA132033.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Анотація:

Le théorème de point fixe de Handel est un classique en dynamique des surfaces. Il assure l'existence d'un point fixe pour un homéomorphisme préservant l'orientation du disque unité ouvert qui se prolonge au bord et qui possède des orbites qui forment un "cycle orienté d'enlacements à l'infini". Patrice Le Calvez a redemontré ce résultat en utilisant la théorie de Brouwer et des arguments de la topologie du plan. Ces méthodes lui ont permis de raffiner le théorème en montrant l'existence d'une courbe fermée simple d'indice 1. Nous donnons une nouvelle preuve, plus simple, de cette version amélioré du théorème, et nous le généralisons pour des cycles non-orientés d'enlacements à l'infini
Michael Handel proved the existence of a fixed point for an orientation preserving homeomorphism of the open unit disk that can be extended to the closed disk provided that it has points whose orbits form an oriented cycle of links at infinity Later, Patrice Le Calvez gave a different proof of this theorem based only on Brouwer theory and plane topology arguments. These methods permitted to improve the result by proving the existence of a simple closed curve of index 1. We give a new, simpler proof of this improved version of the theorem and generalize it to non-oriented cycles of links at infinity

Corriveau, la Grenade Antoine. "Un théorème de point fixe pour les L-plongements." Thesis, Université Laval, 2013. http://www.theses.ulaval.ca/2013/29516/29516.pdf.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Le, Roux Frédéric. "L'ensemble de rotation autour d'un point fixe d'homéomorphisme de surface." Habilitation à diriger des recherches, Université Paris Sud - Paris XI, 2008. http://tel.archives-ouvertes.fr/tel-00349243.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Анотація:

Etant donné un point fixe pour un homéomorphisme de surface, on peut définir un ensemble de rotation autour du point fixe, qui est un invariant de conjugaison locale. Ce mémoire commence l'étude de cet invariant et de ses liens avec d'autres propriétés dynamiques : en particulier l'existence d'orbites périodiques, la différentiabilité au point fixe, l'indice de Poincaré-Lefschetz lorsque le point fixe est isolé.

Seladgi, Yassamine. "Calcul de point fixe pour la vérification de programmes numériques." Palaiseau, Ecole polytechnique, 2013. http://www.theses.fr/2013EPXX0063.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Gnang, Calvin. "Méthodes de point fixe et calcul de la racine n-ième." Mémoire, Université de Sherbrooke, 2012. http://hdl.handle.net/11143/5766.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Анотація:

Dans la première partie de ce travail, nous parlons de l'accéleration [i.e. accélération] de la convergence de méthodes itératives de point fixe. Nous parlerons particulièrement de l'itération de Newton et de la façon dont on peut augmenter son ordre de convergence. Cette méthode, portant le nom de Isaac Newton, est un algorithme populaire pour approximer le zéro d'une fonction. Nous parlerons donc des conditions sous lesquelles cet algorithme nous procure des résultats valides.Dans la deuxième portion de ce travail, nous appliquerons les résultats de la première partie au problème de la recherche de la n-ième racine d'un nombre. Ceci nous conduira vers des familles d'algorithmes que nous comparerons. Nous présenterons aussi des méthodes associées très spécifiquement au calcul de la n-ième racine d'un nombre que nous généraliserons pour un problème quelconque.

Aimé, Thierry. "Une sémantique par point fixe pour les systèmes de réécriture orthogonaux." Bordeaux 1, 1996. http://www.theses.fr/1996BOR10622.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Анотація:

Les systemes de reecriture comme langage de programmation posent des problemes d'efficacite. Nous proposons une semantique pour les regles de reecriture capable de conduire des optimisations par specialisation. La semantique d'une regle est representee par les classes de comportement qu'elle induit sur ses instances, comportement en terme de sequences de reduction. Alors avec une relation de surreduction contrainte par des problemes d'unification, nous montrons comment exprimer notre semantique sous la forme d'une topdown collecting semantics, permettant a terme une approximation par interpretation abstraite

Hirstoaga, Sever Adrian. "Approximation et résolution de problèmes d'équilibre, de point fixe et d'inclusion monotone." Phd thesis, Université Pierre et Marie Curie - Paris VI, 2006. http://tel.archives-ouvertes.fr/tel-00137228.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Анотація:

Cette thèse est consacrée à la résolution de trois types de problèmes fondamentaux qui apparaissent en analyse fonctionnelle hilbertienne non-linéaire et dans ses applications : les problèmes d'équilibre pour les bifonctions monotones, les problèmes de point fixe pour les contractions, et les problèmes d'inclusion pour les opérateurs monotones. Notre objectif est d'élaborer de nouvelles méthodes d'approximation et de construction de solutions pour ces problèmes et d'étudier leur comportement asymptotique. Dans un premier temps, nous proposons de nouvelles perturbations visqueuses et visco-pénalisées de ces problèmes, et étudions le comportement asymptotique des courbes d'approximation associées quand la perturbation devient évanescente. Nous étudions ensuite les propriétés de divers systèmes dynamiques discrets et continus associés à ces courbes. Cette étude débouche en particulier sur de nouveaux algorithmes, dont la convergence est établie. Des applications numériques à des problèmes de restauration en traitement de l'image sont fournies pour illustrer la mise en œuvre et les performances de certains des algorithmes proposés.

Більше джерел

Книги з теми "Argument de point fixe":

Legendre, Pierre. Le point fixe: Nouvelles conférences. [Paris]: Mille et une nuits, 2010.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Roux, Frédéric Le. L'ensemble de rotation autour d'un point fixe. Paris, France: Société Mathématique de France, 2013.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Fryszkowski, Andrzej. Fixed point theory for decomposable sets. New York: Kluwer Academic Publishers, 2004.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Gilbert, Michael A. How to win an argument: Surefire strategies for getting your point across. 3rd ed. Lanham, Md: University Press of America, 2008.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Berinde, Vasile. Iterative approximation of fixed points. 2nd ed. Berlin: Springer, 2007.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Border, Kim C. Fixed point theorems with applications to economics and game theory. Cambridge [Cambridgeshire]: Cambridge University Press, 1985.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Border, Kim C. Fixed Point Theorems with Applications to Economics and Game Theory. Cambridge, UK: Cambridge University Press, 1999.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Crabb, M. C. Fibrewise homotopy theory. London: Springer, 1998.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Poincaré), Poincaré Seminar (9th 2006 Institut Henri. Gravitation and experiment: Poincare Seminar 2006. Basel, Switzerland: Birkhäuser, 2007.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Poincaré Seminar (9th 2006 Institut Henri Poincaré). Gravitation and experiment: Poincaré Seminar 2006. Edited by Damour Thibault, Duplantier Bertrand, and Rivasseau Vincent 1955-. Basel, Switzerland: Birkhäuser, 2007.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Більше джерел

Частини книг з теми "Argument de point fixe":

Dijkstra, Edsger W., and A. J. M. van Gasteren. "A simple fix-point argument without the restriction to continuity." In Control Flow and Data Flow: Concepts of Distributed Programming, 519–25. Berlin, Heidelberg: Springer Berlin Heidelberg, 1986. http://dx.doi.org/10.1007/978-3-642-82921-5_15.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Le Dret, Hervé. "Théorèmes de point fixe et applications." In Mathématiques et Applications, 41–60. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-36175-3_2.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Henschke, Adam. "Terrorism and the Internet of Things: Cyber-Terrorism as an Emergent Threat." In Advanced Sciences and Technologies for Security Applications, 71–87. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-90221-6_5.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Анотація:

AbstractIn this chapter I present an argument that cyber-terrorism will happen. This argument is premised on the development of a cluster of related technologies that create a direct causal link between the informational realm of cyberspace and the physical realm. These cyber-enabled physical systems fit under the umbrella of the ‘Internet of Things’ (IoT). While this informational/physical connection is a vitally important part of the claim, a more nuanced analysis reveals five further features are central to the IoT enabling cyber-terrorism. These features are that the IoT is radically insecure, that the components of the IoT are in the world, that the sheer numbers of IoT devices mean potential attacks can be intense, that the IoT will likely be powered by a range of Artificial Intelligence aspects, making it inscrutable, and that the IoT is largely invisible. Combining these five factors together, the IoT emerges as a threat vector for cyber-terrorism. The point of the chapter is to go beyond recognising that the IoT is a thing in the world and so can enable physical impacts from cyber-attacks, to offer these five factors to say something more specific about just why the IoT can potentially be used for cyber-terrorism. Having outlined how the IoT can be used for cyber-terrorism, I attend to the question of whether such actions are actually terrorism or not. Ultimately, I argue, as the IoT grows in scope and penetration of our physical worlds and behaviours, it means that cyber-terrorism is not a question of if, but when. This, I suggest, has significant ethical implications as these five features of the IoT mean that we ought to be regulating these technologies.

Sturm, M. "Sur le mouvement d’un corps solide autour d’us point fixe." In Collected Works of Charles François Sturm, 789–802. Basel: Birkhäuser Basel, 2009. http://dx.doi.org/10.1007/978-3-7643-7990-2_47.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Kowalevski, Sophie. "Sur le problème de la rotation d’un corps solide autour d’un point fixe." In The Kowalevski Property, 317–72. Providence, Rhode Island: American Mathematical Society, 2002. http://dx.doi.org/10.1090/crmp/032/18.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Langlois, Michel. "Contribution a L'etude du Mouvement du Corps Rigide a n Dimensions Autour d'un Point Fixe." In Stereodynamics, 81–100. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-10991-1_3.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Loke, Andrew. "Ultimate Design." In The Teleological and Kalam Cosmological Arguments Revisited, 297–332. Cham: Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-030-94403-2_7.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Анотація:

AbstractHypothesis (iv) ‘uncaused universe’ has been refuted in Chap. 10.1007/978-3-030-94403-2_6. Moreover, it does not explain how it could be necessary that subjunctive facts (Lange) or physical entities have stable essences (Ellis) or dispositions (Mumford) that persist throughout time which enable them to behave in ways describable by mathematical laws. The Design hypothesis explains this. I reply to various arguments against the likelihood of Design, for example, Dawkins’ ‘who made God’ objection, Hume’s objection from ‘imperfections’, and Halvorsen’s objection that almost all physically possible universes are lifeless. I conclude that, while the alternatives to design are unlikely, there is no good reason to think that the Design hypothesis is unlikely. Since the list of hypotheses in Chap. 10.1007/978-3-030-94403-2_4 is logically exhaustive, the epistemic probabilities of those five categories must add up to 1. Even if one assigns to each alternative a probability of 0.1% (which is very generous given the arguments in previous chapters), that still leaves Design with a high probability of 99.6%. One can therefore argue for the Design hypothesis by exclusion without having to first assign a prior probability for Design, thus avoiding the objections by critics (e.g. Sober) on this point entirely.

Malaia, Evie, Ronnie B. Wilbur, and Christine Weber-Fox. "Event End-Point Primes the Undergoer Argument: Neurobiological Bases of Event Structure Processing." In Studies in the Composition and Decomposition of Event Predicates, 231–48. Dordrecht: Springer Netherlands, 2013. http://dx.doi.org/10.1007/978-94-007-5983-1_9.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Frers, Lars. "Conclusions: Touching and Being Touched – Experience and Ethical Relations." In IMISCOE Research Series, 85–95. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-67608-7_5.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Анотація:

AbstractSometimes, research can hit you in the stomach, making you angry and upset, possibly sick. With a bit of luck, this can be fine, as discontentment can be a force that propels you to become active and engage yourself. Sometimes, research can resonate in your heart, making you aware and empathetic. Not much luck is needed in these cases, as this will hopefully also stimulate you to get new ideas, a better understanding or hopefully even give you a better foothold for whatever you do in practice. Most of the time, research just passes you by, not leaving much of an impression. We do know that words can make a difference, that words can touch you. They evoke many different thoughts and emotions. It is not a single word alone that does this, it is the flow and rhythm of a text, how it takes the reader along, cognitively but also in space and time and in an embodied manner. To achieve different effects, we place words differently, we craft sentences that appeal to different senses and sensibilities, we use terms or jargon, we write complex sentences that juxtapose hosts of different qualities, as Michel Serres does in in The Five Senses (2008). We present a clear definition, we unfold arguments or put something to the point. Most of the word work we do, we do on our keyboards, sitting at a desk, in a train carriage or lying on a sofa. Thus, this word work happens remote from the site where our study took place, it is definitely not the same as the field work that we do, it is not the same as the numbers and algorithms that make up our data. But done well, it can still evoke the sense of what happens or happened “out there” in the field, the phenomena that the numbers point to, be they the numbers of people crossing a border or the feeling of someone who is lost or maybe even hunted (Guttorm, 2016).

Lee, Eunah. "Race and the Self-Defeating Character of Kant’s Argument in Anthropology from a Pragmatic Point of View." In Natur und Freiheit, edited by Violetta L. Waibel, Margit Ruffing, and David Wagner, 2691–98. Berlin, Boston: De Gruyter, 2018. http://dx.doi.org/10.1515/9783110467888-268.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Тези доповідей конференцій з теми "Argument de point fixe":

DESMARE, Stéphanie, and Pascal LE DU. "Base de données courantométriques au point fixe du SHOM." In Journées Nationales Génie Côtier - Génie Civil. Editions Paralia, 2014. http://dx.doi.org/10.5150/jngcgc.2014.007.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Ding, Qinghua, Kaiwen Zhou, and James Cheng. "Tight Convergence Rate of Gradient Descent for Eigenvalue Computation." In Twenty-Ninth International Joint Conference on Artificial Intelligence and Seventeenth Pacific Rim International Conference on Artificial Intelligence {IJCAI-PRICAI-20}. California: International Joint Conferences on Artificial Intelligence Organization, 2020. http://dx.doi.org/10.24963/ijcai.2020/453.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Анотація:

Riemannian gradient descent (RGD) is a simple, popular and efficient algorithm for leading eigenvector computation [AMS08]. However, the existing analysis of RGD for eigenproblem is still not tight, which is O(log(n/epsilon)/Delta^2) due to [Xu et al., 2018]. In this paper, we show that RGD in fact converges at rate O(log(n/epsilon)/Delta), and give instances to shows the tightness of our result. This improves the best prior analysis by a quadratic factor. Besides, we also give tight convergence analysis of a deterministic variant of Oja's rule due to [Oja, 1982]. We show that it also enjoys fast convergence rate of O(log(n/epsilon)/Delta). Previous papers only gave asymptotic characterizations [Oja, 1982; Oja, 1989; Yi et al., 2005]. Our tools for proving convergence results include an innovative reduction and chaining technique, and a noisy fixed point iteration argument. Besides, we also give empirical justifications of our convergence rates over synthetic and real data.

Reimer, Jan Heinrich, Thi Kim Hanh Luu, Max Henze, and Yamen Ajjour. "Modern Talking in Key Point Analysis: Key Point Matching using Pretrained Encoders." In Proceedings of the 8th Workshop on Argument Mining. Stroudsburg, PA, USA: Association for Computational Linguistics, 2021. http://dx.doi.org/10.18653/v1/2021.argmining-1.18.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Cosenza, Emanuele. "Key Point Matching with Transformers." In Proceedings of the 8th Workshop on Argument Mining. Stroudsburg, PA, USA: Association for Computational Linguistics, 2021. http://dx.doi.org/10.18653/v1/2021.argmining-1.20.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

DeGiorgi, Virginia G., and M. A. Siddiq Qidwai. "An Analysis of Composite Piezoelectric Actuators Incorporating Nonlinear Material Behavior." In ASME 2010 Conference on Smart Materials, Adaptive Structures and Intelligent Systems. ASMEDC, 2010. http://dx.doi.org/10.1115/smasis2010-3628.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Анотація:

Piezoelectric actuators of various composite designs have been proposed during the last few years including extension and shear bimorphs, tubular composites and multilayered actuators. These designs exploit the ability to define the actuation direction by varying the alignment between poling direction and applied electric field. Considerable research effort has been put to accurately model these actuators in order to attain predictive capability. The common factor in almost all of these studies is the assumption that the poled material behaves linearly under applied electric field. However, this assumption may only be accurate for the limited case of a homogenous actuator under relatively unconstrained environment, such as that of simply supported boundary conditions. In the case of composite structures, the actuation can potentially be restricted by non-actuating constituents resulting in multi-dimensional loading states, which may cause domain switching. The same argument can be made for most boundary conditions that are imposed in practical applications, such as when the actuator is clamped or fixed. Another point of concern is the presence of discontinuities and minor defects in the actuator. Both of these would promote non-uniform electric field causing domain switching, and hence, unexpected actuator output. Unless proven otherwise, these concerns directly affect the credibility of life cycle estimates based upon linear models. In this paper linear and nonlinear material models will be used to determine actuator performance using an established constitutive model in a commercial finite element code. Actuator performance for both material cases will be calculated and compared with existing analytical predictions under the same set of boundary conditions.

Potash, Peter, Alexey Romanov, and Anna Rumshisky. "Here's My Point: Joint Pointer Architecture for Argument Mining." In Proceedings of the 2017 Conference on Empirical Methods in Natural Language Processing. Stroudsburg, PA, USA: Association for Computational Linguistics, 2017. http://dx.doi.org/10.18653/v1/d17-1143.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Friedman, Roni, Lena Dankin, Yufang Hou, Ranit Aharonov, Yoav Katz, and Noam Slonim. "Overview of the 2021 Key Point Analysis Shared Task." In Proceedings of the 8th Workshop on Argument Mining. Stroudsburg, PA, USA: Association for Computational Linguistics, 2021. http://dx.doi.org/10.18653/v1/2021.argmining-1.16.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Alshomary, Milad, Timon Gurcke, Shahbaz Syed, Philipp Heinisch, Maximilian Spliethöver, Philipp Cimiano, Martin Potthast, and Henning Wachsmuth. "Key Point Analysis via Contrastive Learning and Extractive Argument Summarization." In Proceedings of the 8th Workshop on Argument Mining. Stroudsburg, PA, USA: Association for Computational Linguistics, 2021. http://dx.doi.org/10.18653/v1/2021.argmining-1.19.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Bar-Haim, Roy, Yoav Kantor, Lilach Eden, Roni Friedman, Dan Lahav, and Noam Slonim. "Quantitative argument summarization and beyond: Cross-domain key point analysis." In Proceedings of the 2020 Conference on Empirical Methods in Natural Language Processing (EMNLP). Stroudsburg, PA, USA: Association for Computational Linguistics, 2020. http://dx.doi.org/10.18653/v1/2020.emnlp-main.3.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Phan, Hoang, Long Nguyen, Long Nguyen, and Khanh Doan. "Matching The Statements: A Simple and Accurate Model for Key Point Analysis." In Proceedings of the 8th Workshop on Argument Mining. Stroudsburg, PA, USA: Association for Computational Linguistics, 2021. http://dx.doi.org/10.18653/v1/2021.argmining-1.17.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Звіти організацій з теми "Argument de point fixe":

Cachalia, Firoz, and Jonathan Klaaren. Digitalisation, the ‘Fourth Industrial Revolution’ and the Constitutional Law of Privacy in South Africa: Towards a public law perspective on constitutional privacy in the era of digitalisation. Digital Pathways at Oxford, July 2021. http://dx.doi.org/10.35489/bsg-dp-wp_2021/04.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Анотація:

In this working paper, our focus is on the constitutional debates and case law regarding the right to privacy, adopting a method that is largely theoretical. In an accompanying separate working paper, A South African Public Law Perspective on Digitalisation in the Health Sector, we employ the analysis developed here and focus on the specific case of digital technologies in the health sector. The topic and task of these papers lie at the confluence of many areas of contemporary society. To demonstrate and apply the argument of this paper, it would be possible and valuable to extend its analysis into any of numerous spheres of social life, from energy to education to policing to child care. In our accompanying separate paper, we focus on only one policy domain – the health sector. Our aim is to demonstrate our argument about the significance of a public law perspective on the constitutional right to privacy in the age of digitalisation, and attend to several issues raised by digitalisation’s impact in the health sector. For the most part, we focus on technologies that have health benefits and privacy costs, but we also recognise that certain technologies have health costs and privacy benefits. We also briefly outline the recent establishment (and subsequent events) in South Africa of a contact tracing database responding to the COVID-19 pandemic – the COVID-19 Tracing Database – a development at the interface of the law enforcement and health sectors. Our main point in this accompanying paper is to demonstrate the value that a constitutional right to privacy can bring to the regulation of digital technologies in a variety of legal frameworks and technological settings – from public to private, and from the law of the constitution to the ‘law’ of computer coding.