Search results for "CONST"
showing 10 items of 7706 documents
On Noncoercive (p, q)-Equations
2021
We consider a nonlinear Dirichlet problem driven by a (p, q)-Laplace differential operator (1 < q < p). The reaction is (p - 1)-linear near +/-infinity and the problem is noncoercive. Using variational tools and truncation and comparison techniques together with critical groups, we produce five nontrivial smooth solutions all with sign information and ordered. In the particular case when q = 2, we produce a second nodal solution for a total of six nontrivial smooth solutions all with sign information.
Les grammaires de construction au service de la morphologie lexicale ? Apports pour la description des noms-termes en allemand
2019
International audience; Contexte Le « goût » de la langue allemande pour la créativité lexicale, en particulier dans le domaine nominal, fait figure de lapalissade. Ceci est particulièrement vrai en discours spécialisés où les besoins en dénomination de nouveaux concepts passent, outre les différentes formes d’emprunts ou de néologismes de forme, par les deux procédés classiques que sont la dérivation et la composition. C’est dans ce contexte que la présente proposition de communication vise à interroger les apports des grammaires de construction appliquées à ces phénomènes – on parlera alors avec Booij (2017) de morphologie constructionnelle – pour une analyse de l’interface syntaxe-séma…
Europe’s Path to Public Reason
2012
Chapter 7 highlights how addressing public issues publicly is a main target of European institutions, considering their commitment to the identification of shared values and the protection of rights. In consideration of this, it is reasonable to ask whether the “Public Reason” set forth by Rawls can be somehow applied to Europe’s current perspective, understanding it to be the ruling criterion governing public issues. A major obstacle is to be found in the anti-pluralistic attitude which is widespread across the European states. However, constitutionalism, which is nowadays widely rooted on a global scale, makes contemporary political communities to characterize by disagreement and by the n…
Using discourse segmentation to account for the polyfunctionality of discourse markers:The case of well
2021
Abstract A large number of studies describe the many different functions of polyfunctional discourse markers like well in different contexts and from different theoretical perspectives. In the current paper, we propose to systematize the many different uses identified based on their position with respect to the discourse units they are associated with. Not only can previous findings on well be integrated into a single coherent representation of its uses and functions, but the positions with respect to the discourse units can also be associated with specific functions, thus shedding light on how the polyfunctionality of well is brought about.
On the symbol homomorphism of a certain Frechet algebra of singular integral operators
1985
We prove the surjectivity of the symbol map of the Frechet algebra obtained by completing an algebra of convolution and multiplication operators in the topology generated by all L2-Sobolev norms. The proof is based on an ℝn of Egorov's theorem valid for non-homogeneous principal symbols, discussed in [5], [6]. We use the hyperbolic equation ∂u/∂t=i|D|ηu, 0<η<1, which has its characteristic flow constant at infinity, so that no differentiability of the symbol is required there.
The overlap algebra of regular opens
2010
Abstract Overlap algebras are complete lattices enriched with an extra primitive relation, called “overlap”. The new notion of overlap relation satisfies a set of axioms intended to capture, in a positive way, the properties which hold for two elements with non-zero infimum. For each set, its powerset is an example of overlap algebra where two subsets overlap each other when their intersection is inhabited. Moreover, atomic overlap algebras are naturally isomorphic to the powerset of the set of their atoms. Overlap algebras can be seen as particular open (or overt) locales and, from a classical point of view, they essentially coincide with complete Boolean algebras. Contrary to the latter, …
Inductive Inference with Procrastination: Back to Definitions
1999
In this paper, we reconsider the definition of procrastinating learning machines. In the original definition of Freivalds and Smith [FS93], constructive ordinals are used to bound mindchanges. We investigate possibility of using arbitrary linearly ordered sets to bound mindchanges in similar way. It turns out that using certain ordered sets it is possible to define inductive inference types different from the previously known ones. We investigate properties of the new inductive inference types and compare them to other types.
An Efficient Algorithm for the Generation of Z-Convex Polyominoes
2014
We present a characterization of Z-convex polyominoes in terms of pairs of suitable integer vectors. This lets us design an algorithm which generates all Z-convex polyominoes of size n in constant amortized time.
A Unifying Approach to Weyl Type Theorems for Banach Space Operators
2013
Weyl type theorems have been proved for a considerably large number of classes of operators. In this paper, by introducing the class of quasi totally hereditarily normaloid operators, we obtain a theoretical and general framework from which Weyl type theorems may be promptly established for many of these classes of operators. This framework also entails Weyl type theorems for perturbations f(T + K), where K is algebraic and commutes with T, and f is an analytic function, defined on an open neighborhood of the spectrum of T + K, such that f is non constant on each of the components of its domain.
Derived sets and inductive inference
1994
The paper deals with using topological concepts in studies of the Gold paradigm of inductive inference. They are — accumulation points, derived sets of order α (α — constructive ordinal) and compactness. Identifiability of a class U of total recursive functions with a bound α on the number of mindchanges implies \(U^{(\alpha + 1)} = \not 0\). This allows to construct counter-examples — recursively enumerable classes of functions showing the proper inclusion between identification types: EXα⊂EXα+1.