Search results for "Crete"
showing 10 items of 2495 documents
Kirjoittamisen arkipäiväistäminen Pentti Saarikosken ja Mirkka Rekolan runoudessa
2014
Writing as Part of the Everyday in Pentti Saarikoski’s and Mirkka Rekola’s Poetry This article examines the processes of writing as part of the everyday in Pentti Saarikoski’s kuljen missa kuljen and Mirkka Rekola’s Ilo ja epasymmetria, both published in 1965. I argue that both collections make this process visible, and both authors thus actively participate in the discussion about poetry in the 1960s through their poetry. While Saarikoski’s poetry was appreciated as communicative, democratic poetry, Rekola’s writing was considered as old-fashioned modernist poetry – a characterization associated at the time also with Finnish-Swedish poetry. In this article, I show that despite the attitude…
Total Variation Based Image Restoration
2004
For the purpose of image restoration the process of image formation can be modeled in a first approximation by the formula [207] $$ {u_d} = Q\{ II(k*u) + n\} , $$ (1.1) where u represents the photonic flux k is the point spread function of the optical-captor joint apparatus П is a sampling operator, i.e., a Dirac comb supported by the centers of the matrix of digital sensors, n represents a random perturbation due to photonic or electronic noise, and Qis a uniform quantization operator mapping ℝ to a discrete interval of values, typically [0, 255].
γ‐Agregation operators and some aspects of generalized aggregation problem
2010
We explore questions related to the aggregation operators and aggregation of fuzzy sets. No preliminary knowledge of the aggregation operators theory and of the fuzzy sets theory are required, because all necessary information is given in Section 2. Later we introduce a new class of γ‐aggregation operators, which “ignore” arguments less than γ. Due to this property γ‐aggregation operators simplify the aggregation process and extend the area of possible applications. The second part of the paper is devoted to the generalized aggregation problem. We use the definition of generalized aggregation operator, introduced by A. Takaci in [7], and study the pointwise extension of a γ‐agop. First publ…
A pointwise selection principle for metric semigroup valued functions
2008
Abstract Let ∅ ≠ T ⊂ R , ( X , d , + ) be an additive commutative semigroup with metric d satisfying d ( x + z , y + z ) = d ( x , y ) for all x , y , z ∈ X , and X T the set of all functions from T into X . If n ∈ N and f , g ∈ X T , we set ν ( n , f , g , T ) = sup ∑ i = 1 n d ( f ( t i ) + g ( s i ) , g ( t i ) + f ( s i ) ) , where the supremum is taken over all numbers s 1 , … , s n , t 1 , … , t n from T such that s 1 ⩽ t 1 ⩽ s 2 ⩽ t 2 ⩽ ⋯ ⩽ s n ⩽ t n . We prove the following pointwise selection theorem: If a sequence of functions { f j } j ∈ N ⊂ X T is such that the closure in X of the set { f j ( t ) } j ∈ N is compact for each t ∈ T , and lim n → ∞ ( 1 n lim N → ∞ sup j , k ⩾ N , j…
The Lie algebra of polynomial vector fields and the Jacobian conjecture
1998
The Jacobian conjecture for polynomial maps ϕ:Kn→Kn is shown to be equivalent to a certain Lie algebra theoretic property of the Lie algebra\(\mathbb{D}\) of formal vector fields inn variables. To be precise, let\(\mathbb{D}_0 \) be the unique subalgebra of codimensionn (consisting of the singular vector fields),H a Cartan subalgebra of\(\mathbb{D}_0 \),Hλ the root spaces corresponding to linear forms λ onH and\(A = \oplus _{\lambda \in {\rm H}^ * } H_\lambda \). Then every polynomial map ϕ:Kn→Kn with invertible Jacobian matrix is an automorphism if and only if every automorphism Φ of\(\mathbb{D}\) with Φ(A)\( \subseteq A\) satisfies Φ(A)=A.
Homomorphisms on spaces of weakly continuous holomorphic functions
1999
Let X be a Banach space and let $X^{\ast }$ be its topological dual space. We study the algebra ${\cal H}_{w^\ast}(X^{\ast})$ of entire functions on $X^{\ast }$ that are weak-star continuous on bounded sets. We prove that every m-homogeneous polynomial of finite type P on $X^*$ that is weak-star continuous on bounded sets can be written in the form $P=\textstyle\sum\limits _{j=1}^q x_{1j}\cdots x_{mj}$ where $x_{ij} \in X$ , for all i,j. As an application, we characterize convolution homomorphisms on ${\cal H}_{w^\ast}(X^{\ast})$ and on the space ${\cal H}_{wu}(X)$ of entire functions on X which are weakly uniformly continuous on bounded subsets of X, assuming that X * has the approximation…
Matroid optimization problems with monotone monomials in the objective
2022
Abstract In this paper we investigate non-linear matroid optimization problems with polynomial objective functions where the monomials satisfy certain monotonicity properties. Indeed, we study problems where the set of non-linear monomials consists of all non-linear monomials that can be built from a given subset of the variables. Linearizing all non-linear monomials we study the respective polytope. We present a complete description of this polytope. Apart from linearization constraints one needs appropriately strengthened rank inequalities. The separation problem for these inequalities reduces to a submodular function minimization problem. These polyhedral results give rise to a new hiera…
Monads in double categories
2010
We extend the basic concepts of Street's formal theory of monads from the setting of 2-categories to that of double categories. In particular, we introduce the double category Mnd(C) of monads in a double category C and define what it means for a double category to admit the construction of free monads. Our main theorem shows that, under some mild conditions, a double category that is a framed bicategory admits the construction of free monads if its horizontal 2-category does. We apply this result to obtain double adjunctions which extend the adjunction between graphs and categories and the adjunction between polynomial endofunctors and polynomial monads.
Exact Voronoi diagram of smooth convex pseudo-circles: General predicates, and implementation for ellipses
2013
International audience; We examine the problem of computing exactly the Voronoi diagram (via the dual Delaunay graph) of a set of, possibly intersecting, smooth convex \pc in the Euclidean plane, given in parametric form. Pseudo-circles are (convex) sites, every pair of which has at most two intersecting points. The Voronoi diagram is constructed incrementally. Our first contribution is to propose robust and efficient algorithms, under the exact computation paradigm, for all required predicates, thus generalizing earlier algorithms for non-intersecting ellipses. Second, we focus on \kcn, which is the hardest predicate, and express it by a simple sparse $5\times 5$ polynomial system, which a…
A study of spalling behaviour of PAN fibre-reinforced concrete by thermal analysis
1993
Comparisons are made between polypropylene (PP) fibres and polyacrylonitrile (PAN) fibres in order to relate the thermal properties of fibres with the respective fibre mortar behaviour under thermal exposure. Thermogravimetry (TG), differential scanning calorimetry (DSC) and thermochromatography (ThGC) are utilized. When a cementitious fibre mortar is being heated, several physical phenomena occur in the temperature range between 100°C and 200°C. There is a significant difference in the thermal behaviour between PP and PAN fibres. PP fibres melt at 160–170°C. The non‐melting behaviour of PAN fibre together with its rapid exothermic degradation reactions at around 300°C may add risk to the s…