Search results for "square"
showing 10 items of 1317 documents
Accommodation in human eye models: a comparison between the optical designs of Navarro, Arizona and Liou-Brennan.
2017
Aim To simulate and compare accommodation in accommodative and non-accommodative human eye models. Methods Ray tracing and optical design program was used. Three eye models were designed and studied: the Navarro, the Arizona and the Liou-Brennan. In order to make the Navarro and Liou-Brennan models to accommodate, specific geometric parameters of the models were altered with values that were chosen from the literature. For the Arizona model, its' mathematical functions for accommodation were used for the same accommodative demands. The simulation included four distances of accommodation for each model: at infinity, 3, 1 and 0.5 m.The results were diffraction images of a "letter F" for graph…
Characterization of estuarine sediments by near infrared diffuse reflectance spectroscopy
2008
It has been developed a partial least squares near infrared (PLS-NIR) method for the determination of estuarine sediment physicochemical parameters. The method was based on the chemometric treatment of first order derivative reflectance spectra obtained from samples previously lyophilized and sieved through a lower than 63 μm grid. Spectra were scanned from 833 to 2976 nm, averaging 36 scans per spectrum at a resolution of 8 cm-1, using chromatographic glass vials of 9.5 mm internal diameter as measurement cells. Models were built using reference data of 31 samples selected through the use of a hierarchical cluster analysis of NIR spectra of sediments obtained from the Ria de Arousa estuary…
An elementary proof of Hilbertʼs theorem on ternary quartics
2012
Abstract In 1888, Hilbert proved that every nonnegative quartic form f = f ( x , y , z ) with real coefficients is a sum of three squares of quadratic forms. His proof was ahead of its time and used advanced methods from topology and algebraic geometry. Up to now, no elementary proof is known. Here we present a completely new approach. Although our proof is not easy, it uses only elementary techniques. As a by-product, it gives information on the number of representations f = p 1 2 + p 2 2 + p 3 2 of f up to orthogonal equivalence. We show that this number is 8 for generically chosen f, and that it is 4 when f is chosen generically with a real zero. Although these facts were known, there wa…
Precise bounds for the sequential order of products of some Fréchet topologies
1998
Abstract The sequential order of a topological space is the least ordinal for which the corresponding iteration of the sequential closure is idempotent. Lower estimates for the sequential order of the product of two regular Frechet topologies and upper estimates for the sequential order of the product of two subtransverse topologies are given in terms of their fascicularity and sagittality. It is shown that for every countable ordinal α, there exists a Lasnev topology such that the sequential order of its square is equal to α.
Generalized Lebesgue points for Sobolev functions
2017
In this article, we show that a function $f\in M^{s,p}(X),$ $0<s\leq 1,$ $0<p<1,$ where $X$ is a doubling metric measure space, has generalized Lebesgue points outside a set of $\mathcal{H}^h$-Hausdorff measure zero for a suitable gauge function $h.$
Uniformly nonsquare Banach spaces have the fixed point property for nonexpansive mappings
2006
Abstract It is shown that if the modulus Γ X of nearly uniform smoothness of a reflexive Banach space satisfies Γ X ′ ( 0 ) 1 , then every bounded closed convex subset of X has the fixed point property for nonexpansive mappings. In particular, uniformly nonsquare Banach spaces have this property since they are properly included in this class of spaces. This answers a long-standing question in the theory.
Identities of *-superalgebras and almost polynomial growth
2015
We study the growth of the codimensions of a *-superalgebra over a field of characteristic zero. We classify the ideals of identities of finite dimensional algebras whose corresponding codimensions are of almost polynomial growth. It turns out that these are the ideals of identities of two algebras with distinct involutions and gradings. Along the way, we also classify the finite dimensional simple *-superalgebras over an algebraically closed field of characteristic zero.
VECTOR MEASURES WITH VARIATION IN A BANACH FUNCTION SPACE
2003
Let E be a Banach function space and X be an arbitrary Banach space. Denote by E(X) the Kothe-Bochner function space defined as the set of measurable functions f : Ω → X such that the nonnegative functions ‖f‖X : Ω → [0,∞) are in the lattice E. The notion of E-variation of a measure —which allows to recover the pvariation (for E = Lp), Φ-variation (for E = LΦ) and the general notion introduced by Gresky and Uhl— is introduced. The space of measures of bounded E-variation VE(X) is then studied. It is shown, among other things and with some restriction of absolute continuity of the norms, that (E(X))∗ = VE′ (X ∗), that VE(X) can be identified with space of cone absolutely summing operators fr…
On the Construction of Classes of Suffix Trees for Square Matrices: Algorithms and Applications
1996
AbstractWe provide a uniform framework for the study of index data structures for a two-dimensional matrixTEXT[1:n, 1:n] whose entries are drawn from an ordered alphabetΣ. An index forTEXTcan be informally seen as the two-dimensional analog of the suffix tree for a string. It allows on-line searches and statistics to be performed onTEXTby representing compactly theΘ(n3) square submatrices ofTEXTin optimalO(n2) space. We identify 4n−1families of indices forTEXT, each containing ∏ni=1(2i−1)! isomorphic data structures. We also develop techniques leading to a single algorithm that efficiently builds any index in any family inO(n2logn) time andO(n2) space. Such an algorithm improves in various …
Relations between structure and estimators in networks of dynamical systems
2011
The article main focus is on the identification of a graphical model from time series data associated with different interconnected entities. The time series are modeled as realizations of stochastic processes (representing nodes of a graph) linked together via transfer functions (representing the edges of the graph). Both the cases of non-causal and causal links are considered. By using only the measurements of the node outputs and without assuming any prior knowledge of the network topology, a method is provided to estimate the graph connectivity. In particular, it is proven that the method determines links to be present only between a node and its “kins”, where kins of a node consist of …