893 resultados para fractal sets
Resumo:
We analyze the von Neumann and Morgenstern stable sets for the mixed extension of 2 2 games when only single profitable deviations are allowed. We show that the games without a strict Nash equilibrium have a unique vN&M stable set and otherwise they have infinite sets.
Resumo:
A fractal approach was proposed to investigate the meso structures and size effect of metallic foams: For a series At foams of different relative densities, the information dimension method was applied to measure meso structures. The generalized sierpinski carpet was introduced to map the meso structures of the foam according to specific dimension. The results show that the fractal-based model can not only reveal the variation of yield strength with specimen size, but also bridge the meso structures and mechanical proper-ties of Al foams directly. Key words: metallic foams; fractal; size effect; meso structures
Resumo:
The outputs from the pilot work with CIBT to develop scenario guide based on existing work across European business, adding an education and more specifically IT perspective to generic scenarios.
Resumo:
Sets and catches of Atlantic menhaden, Brevoortia tyrannus, made in 1985-96 by purse-seine vessels from Virginia and North Carolina were studied by digitizing and analyzing Captain's Daily Fishing Reports (CDFR's), daily logs of fishing activities completed by captains of menhaden vessels. 33,674 CDFR's were processed, representing 125,858 purse-seine sets. On average, the fleet made 10,488 sets annually. Virginia vessels made at least one purse-seine set on 67%-83% of available fishing days between May and December. In most years, five was the median number of sets attempted each fishing day. Mean set duration ranged from 34 to 43 minutes, and median catch per set ranged from 15 to 30 metric tons (t). Spotter aircraft assisted in over 83% of sets overall. Average annual catch in Chesapeake Bay (149,500 t) surpassed all other fishing areas, and accounted for 52% of the fleet's catch. Annual catch from North Carolina waters (49,100 t) ranked a distant second. Fishing activity in ocean waters clustered off the Mid-Atlantic states in June-September, and off North Carolina in November-January. Delaware Bay and the New Jersey coast were important alternate fishing grounds during summer. Across all ocean fishing areas, most sets and catch occurred within 3 mi. of shore, but in Chesapeake Bay about half of all fishing activity occurred farther offshore. In Virginia, areas adjacent to fish factories tended to be heavily fished. Recent regulatory initiatives in various coastal states threaten the Atlantic menhaden fleet's access to traditional nearshore fishing grounds. (PDF file contains 26 pages.)
Resumo:
ENGLISH:Length-frequency samples of yellowfin tuna from 276 individual purse-seine sets were examined. Evidence of schooling by size is presented. Yellowfin schooled with skipjack are smaller and more homogeneous in length than are yellowfin from pure schools. Yellowfin in schools associated with porpoise appear to be more variable in size than yellowfin from other types of schools. No relationship was found between the tonnage of yellowfin in a school and the mean length of the yellowfin. Despite the tendency to school by size, the size variation within individual schools was judged to be enough to complicate greatly any program of regulation aimed at maximizing the yield-per-recruit through increasing the minimum size of yellowfin at first capture. SPANISH: Fueron examinadas las muestras frecuencia-longitud de atún aleta amarilla, de 276 lances individuales de redes de cerco. Se presenta la evidencia de agrupación por tamaños. Los atunes aleta amarilla agrupados con barrilete, son más pequeños y más homogéneos en longitud, que los atunes aleta amarilla de cardúmenes puros. El atún aleta amarilla en cardúmenes asociados con delfines parece ser más variable en tamaño, que el atún aleta amarilla proveniente de otros tipos de cardúmenes. No se encontró relac¡'ón entre el tonelaje del atún aleta amarilla en un cardumen y la longitud media de esta especie. A pesar de la tendencia a agruparse por tamaño, se juzgó, que la variación de tamaño en cardúmenes individuales, sería suficiente para complicar grandemente cualquier programa de reglamentación, dirigido a obtener el máximo del rendimiento por recluta a través del incremento del tamaño mínimo del atún aleta amarilla en la primera captura.
Resumo:
ENGLISH: Annual estimates of the number of purse-seine sets made on tunas associated with dolphins are needed to estimate the total number of dolphins killed incidentally by the eastern Pacific tuna fishery. The most complete source of data, the Inter-American Tropical Tuna Commission's logbook data base, was used in this study. In the logbook data base, most sets are identified as being either associated with dolphins or not associated with dolphins. Some sets are not identified in this respect. However, the number of these unidentified sets which were associated with dolphins have been estimated by stratifying the logbook data according to whether or not any tuna were caught, whether or not the nearest identified set was associated with dolphins, and the distance to the nearest identified set. Most of the unidentified sets fell in strata characterized by a proportion of sets on tuna associated with dolphins that was lower than the overall unstratified proportion. Landings data were used to estimate the number of sets on tunas associated with dolphins from fishing trips not included in the logbook data base. SPANISH: Se necesitan las estimaciones anuales de la cantidad de lances realizados sobre atunes asociados con delfines para calcular todo el número de delfines muertos accidentalmente en la pesca atunera del Pacífico oriental. Se empleó en este estudio la fuente más completa-los datos de la Comisión Interamericana del Atún Tropical, proveniente de los cuadernos de bitácora. En éstos, la mayoría de los lances han sido identificados ya sea como asociados o no asociados con delfines. Algunos de los lances no han sido identificados a este respecto. Sin embargo, se ha estimado el número de estos lances asociados con delfines que no se habían identificado, al estratificar los datos de bitácora de acuerdo a si se había o no capturado atún, a si el lance identificado más próximo era o no un lance asociado con delfines y al averiguar la distancia del lance identificado más cercano. La mayoría de los lances sin identificar se colocan en los estratos caracterizados por una proporción de lances sobre atunes asociados con delfines, inferior a la proporción general sin estratificar. Se usaron los datos de los desembarques para calcular la cantidad de lances sobre atunes asociados con delfines en viajes pesqueros que no fueron incluídos en la base de los datos de bitácora. (PDF contains 73 pages.)
Resumo:
The simplest multiplicative systems in which arithmetical ideas can be defined are semigroups. For such systems irreducible (prime) elements can be introduced and conditions under which the fundamental theorem of arithmetic holds have been investigated (Clifford (3)). After identifying associates, the elements of the semigroup form a partially ordered set with respect to the ordinary division relation. This suggests the possibility of an analogous arithmetical result for abstract partially ordered sets. Although nothing corresponding to product exists in a partially ordered set, there is a notion similar to g.c.d. This is the meet operation, defined as greatest lower bound. Thus irreducible elements, namely those elements not expressible as meets of proper divisors can be introduced. The assumption of the ascending chain condition then implies that each element is representable as a reduced meet of irreducibles. The central problem of this thesis is to determine conditions on the structure of the partially ordered set in order that each element have a unique such representation.
Part I contains preliminary results and introduces the principal tools of the investigation. In the second part, basic properties of the lattice of ideals and the connection between its structure and the irreducible decompositions of elements are developed. The proofs of these results are identical with the corresponding ones for the lattice case (Dilworth (2)). The last part contains those results whose proofs are peculiar to partially ordered sets and also contains the proof of the main theorem.
Resumo:
This paper studies the correlation properties of the speckles in the deep Fresnel diffraction region produced by the scattering of rough self-affine fractal surfaces. The autocorrelation function of the speckle intensities is formulated by the combination of the light scattering theory of Kirchhoff approximation and the principles of speckle statistics. We propose a method for extracting the three surface parameters, i.e. the roughness w, the lateral correlation length xi and the roughness exponent alpha, from the autocorrelation functions of speckles. This method is verified by simulating the speckle intensities and calculating the speckle autocorrelation function. We also find the phenomenon that for rough surfaces with alpha = 1, the structure of the speckles resembles that of the surface heights, which results from the effect of the peak and the valley parts of the surface, acting as micro-lenses converging and diverging the light waves.
Resumo:
Based on the rigorous formulation of integral equations for the propagations of light waves at the medium interface, we carry out the numerical solutions of the random light field scattered from self-affine fractal surface samples. The light intensities produced by the same surface samples are also calculated in Kirchhoff's approximation, and their comparisons with the corresponding rigorous results show directly the degree of the accuracy of the approximation. It is indicated that Kirchhoff's approximation is of good accuracy for random surfaces with small roughness value w and large roughness exponent alpha. For random surfaces with larger w and smaller alpha, the approximation results in considerable errors, and detailed calculations show that the inaccuracy comes from the simplification that the transmitted light field is proportional to the incident field and from the neglect of light field derivative at the interface.
Resumo:
This thesis is divided into three chapters. In the first chapter we study the smooth sets with respect to a Borel equivalence realtion E on a Polish space X. The collection of smooth sets forms σ-ideal. We think of smooth sets as analogs of countable sets and we show that an analog of the perfect set theorem for Σ11 sets holds in the context of smooth sets. We also show that the collection of Σ11 smooth sets is ∏11 on the codes. The analogs of thin sets are called sparse sets. We prove that there is a largest ∏11 sparse set and we give a characterization of it. We show that in L there is a ∏11 sparse set which is not smooth. These results are analogs of the results known for the ideal of countable sets, but it remains open to determine if large cardinal axioms imply that ∏11 sparse sets are smooth. Some more specific results are proved for the case of a countable Borel equivalence relation. We also study I(E), the σ-ideal of closed E-smooth sets. Among other things we prove that E is smooth iff I(E) is Borel.
In chapter 2 we study σ-ideals of compact sets. We are interested in the relationship between some descriptive set theoretic properties like thinness, strong calibration and the covering property. We also study products of σ-ideals from the same point of view. In chapter 3 we show that if a σ-ideal I has the covering property (which is an abstract version of the perfect set theorem for Σ11 sets), then there is a largest ∏11 set in Iint (i.e., every closed subset of it is in I). For σ-ideals on 2ω we present a characterization of this set in a similar way as for C1, the largest thin ∏11 set. As a corollary we get that if there are only countable many reals in L, then the covering property holds for Σ12 sets.
Resumo:
Fuzzy sets in the subject space are transformed to fuzzy solid sets in an increased object space on the basis of the development of the local umbra concept. Further, a counting transform is defined for reconstructing the fuzzy sets from the fuzzy solid sets, and the dilation and erosion operators in mathematical morphology are redefined in the fuzzy solid-set space. The algebraic structures of fuzzy solid sets can lead not only to fuzzy logic but also to arithmetic operations. Thus a fuzzy solid-set image algebra of two image transforms and five set operators is defined that can formulate binary and gray-scale morphological image-processing functions consisting of dilation, erosion, intersection, union, complement, addition, subtraction, and reflection in a unified form. A cellular set-logic array architecture is suggested for executing this image algebra. The optical implementation of the architecture, based on area coding of gray-scale values, is demonstrated. (C) 1995 Optical Society of America
Resumo:
Let E be a compact subset of the n-dimensional unit cube, 1n, and let C be a collection of convex bodies, all of positive n-dimensional Lebesgue measure, such that C contains bodies with arbitrarily small measure. The dimension of E with respect to the covering class C is defined to be the number
dC(E) = sup(β:Hβ, C(E) > 0),
where Hβ, C is the outer measure
inf(Ʃm(Ci)β:UCi Ↄ E, Ci ϵ C) .
Only the one and two-dimensional cases are studied. Moreover, the covering classes considered are those consisting of intervals and rectangles, parallel to the coordinate axes, and those closed under translations. A covering class is identified with a set of points in the left-open portion, 1’n, of 1n, whose closure intersects 1n - 1’n. For n = 2, the outer measure Hβ, C is adopted in place of the usual:
Inf(Ʃ(diam. (Ci))β: UCi Ↄ E, Ci ϵ C),
for the purpose of studying the influence of the shape of the covering sets on the dimension dC(E).
If E is a closed set in 11, let M(E) be the class of all non-decreasing functions μ(x), supported on E with μ(x) = 0, x ≤ 0 and μ(x) = 1, x ≥ 1. Define for each μ ϵ M(E),
dC(μ) = lim/c → inf/0 log ∆μ(c)/log c , (c ϵ C)
where ∆μ(c) = v/x (μ(x+c) – μ(x)). It is shown that
dC(E) = sup (dC(μ):μ ϵ M(E)).
This notion of dimension is extended to a certain class Ӻ of sub-additive functions, and the problem of studying the behavior of dC(E) as a function of the covering class C is reduced to the study of dC(f) where f ϵ Ӻ. Specifically, the set of points in 11,
(*) {dB(F), dC(f)): f ϵ Ӻ}
is characterized by a comparison of the relative positions of the points of B and C. A region of the form (*) is always closed and doubly-starred with respect to the points (0, 0) and (1, 1). Conversely, given any closed region in 12, doubly-starred with respect to (0, 0) and (1, 1), there are covering classes B and C such that (*) is exactly that region. All of the results are shown to apply to the dimension of closed sets E. Similar results can be obtained when a finite number of covering classes are considered.
In two dimensions, the notion of dimension is extended to the class M, of functions f(x, y), non-decreasing in x and y, supported on 12 with f(x, y) = 0 for x · y = 0 and f(1, 1) = 1, by the formula
dC(f) = lim/s · t → inf/0 log ∆f(s, t)/log s · t , (s, t) ϵ C
where
∆f(s, t) = V/x, y (f(x+s, y+t) – f(x+s, y) – f(x, y+t) + f(x, t)).
A characterization of the equivalence dC1(f) = dC2(f) for all f ϵ M, is given by comparison of the gaps in the sets of products s · t and quotients s/t, (s, t) ϵ Ci (I = 1, 2).