Search results for "Crete"
showing 10 items of 2495 documents
Rolle's Theorem for Polynomials of Degree Four in a Hilbert Space
2002
AbstractIn an infinite-dimensional real Hilbert space, we introduce a class of fourth-degree polynomials which do not satisfy Rolle's Theorem in the unit ball. Extending what happens in the finite-dimensional case, we show that every fourth-degree polynomial defined by a compact operator satisfies Rolle's Theorem.
The Value of Auditor Industry Specialization: Evidence from a Structural Model
2021
ABSTRACT This study investigates the value of auditor industry specialization. In the first step, we use a discrete choice model to derive the first-order demand for auditor industry specialization. Our results reveal that clients have a general preference for auditor industry specialization, relating to both audit firm and audit office specialization. We observe that specializations at the audit firm and audit office level are substitutes. We also find that larger, more complex clients have a stronger demand for industry specialization at the audit office level. In the second step, we use the results from the discrete choice model to quantify the value of auditor industry specialists for c…
Die Ausgießung des zweifachen Geistes. Zwei unikale Szenen in der Soter-Kirche in Kephali auf Kreta
2016
Im venetianisch besetzten Kreta des 14.Jhs. zeigen sich vermehrt westliche Einflüsse in Ikonographie und Stil auf den Wandmalereien der byzantinischen Kirchen. Auch szenische Neuschöpfungen werden vereinzelt in das traditionelle, festgelegte Bildprogramm aufgenommen. So auch in der Soter-Kirche in Kephali auf Kreta (Präfektur Chania, Bezirk Kissamos). Dort gibt es zwei bis heute nicht eindeutig entschlüsselte, enigmatische Szenen. Durch methodische Arbeitsschritte der typologischen Zuordnung und der Eingliederung in das Gefüge der gesamten Bildkomposition lassen sich diese außergewöhlichen bildlichen Darstellungen sinnvoll erklären und thematisch einordnen.
Quantum search of spatial regions
2003
Can Grover's algorithm speed up search of a physical region - for example a 2-D grid of size sqrt(n) by sqrt(n)? The problem is that sqrt(n) time seems to be needed for each query, just to move amplitude across the grid. Here we show that this problem can be surmounted, refuting a claim to the contrary by Benioff. In particular, we show how to search a d-dimensional hypercube in time O(sqrt n) for d at least 3, or O((sqrt n)(log n)^(3/2)) for d=2. More generally, we introduce a model of quantum query complexity on graphs, motivated by fundamental physical limits on information storage, particularly the holographic principle from black hole thermodynamics. Our results in this model include a…
Hopf bifurcation at infinity for planar vector fields
2007
We study, from a new point of view, families of planar vector fields without singularities $ \{ X_{\mu}$  :  $-\varepsilon < \mu < \varepsilon\} $ defined on the complement of an open ball centered at the origin such that, at $\mu=0$, infinity changes from repellor to attractor, or vice versa. We also study a sort of local stability of some $C^1$ planar vector fields around infinity.
Modelling, Identification and Control of a 5-DOF Shotcrete Robot : Development of a Framework for Automatic Application of Shotcrete for AMV 4200H
2019
Master's thesis Mechatronics MAS500 - University of Agder 2019 Today, process automation is the primary area of development in the shotcrete industry. Automaticshotcrete operations can yield an increase in operational efficiency and personnel safety as well asreductions in cost and environmental impact. This thesis develops a framework for automaticapplication of shotcrete using the AMV 4200H and provides an automatic spraying mode usinginteroceptive sensing. The shotcrete vehicle is equipped with a five degrees-of-freedom manipulatorand is currently operated manually. Our contributions include solving the forward kinematicsthrough the Denavit-Hartenberg convention, and the inverse kinemati…
Generalized countable iterated function systems
2011
One of the most common and most general way to generate fractals is by using iterated function systems which consists of a finite or infinitely many maps. Generalized countable iterated function systems (GCIFS) are a generalization of countable iterated function systems by considering contractions from X ? X into X instead of contractions on the metric space X to itself, where (X, d) is a compact metric space. If all contractions of a GCIFS are Lipschitz with respect to a parameter and the supremum of the Lipschitz constants is finite, then the associated attractor depends continuously on the respective parameter.
Iterated function systems and well-posedness
2009
Abstract Fractals and multivalued fractals play an important role in biology, quantum mechanics, computer graphics, dynamical systems, astronomy and astrophysics, geophysics, etc. Especially, there are important consequences of the iterated function (or multifunction) systems in several topics of applied sciences [see for example: El Naschie MS. Iterated function systems and the two-slit experiment of quantum mechanics. Chaos, Solitons & Fractals 1994;4:1965–8; Iovane G. Cantorian spacetime and Hilbert space: Part I-Foundations. Chaos, Solitons & Fractals 2006;28:857–78; Iovane G. Cantorian space-time and Hilbert space: Part II-Relevant consequences. Chaos, Solitons & Fractals 2006;29:1–22;…
In the Shadows of a hypergraph: looking for associated primes of powers of squarefree monomial ideals
2018
The aim of this paper is to study the associated primes of powers of square-free monomial ideals. Each square-free monomial ideal corresponds uniquely to a finite simple hypergraph via the cover ideal construction, and vice versa. Let H be a finite simple hypergraph and J(H) the cover ideal of H. We define the shadows of hypergraph, H, described as a collection of smaller hypergraphs related to H under some conditions. We then investigate how the shadows of H preserve information about the associated primes of the powers of J(H). Finally, we apply our findings on shadows to study the persistence property of square-free monomial ideals and construct some examples exhibiting failure of contai…
An Efficient Algorithm for Helly Property Recognition in a Linear Hypergraph
2001
International audience; In this article we characterize bipartite graphs whose associated neighborhood hypergraphs have the Helly property. We examine incidence graphs both hypergraphs and linear hypergraphs and we give a polynomial algorithm to recognize if a linear hypergraph has the Helly property.