984 resultados para cantor-type sets


Relevância:

100.00% 100.00%

Publicador:

Resumo:

We start with a generalization of the well-known three-door problem:the n-door problem. The solution of this new problem leads us toa beautiful representation system for real numbers in (0,1] as alternated series, known in the literature as Pierce expansions. A closer look to Pierce expansions will take us to some metrical properties of sets defined through the Pierce expansions of its elements. Finally, these metrical properties will enable us to present 'strange' sets, similar to the classical Cantor set.

Relevância:

80.00% 80.00%

Publicador:

Resumo:

In this thesis I examine a variety of linguistic elements which involve ``alternative'' semantic values---a class arguably including focus, interrogatives, indefinites, and disjunctions---and the connections between these elements. This study focusses on the analysis of such elements in Sinhala, with comparison to Malayalam, Tlingit, and Japanese. The central part of the study concerns the proper syntactic and semantic analysis of Q[uestion]-particles (including Sinhala "da", Malayalam "-oo", Japanese "ka"), which, in many languages, appear not only in interrogatives, but also in the formation of indefinites, disjunctions, and relative clauses. This set of contexts is syntactically-heterogeneous, and so syntax does not offer an explanation for the appearance of Q-particles in this particular set of environments. I propose that these contexts can be united in terms of semantics, as all involving some element which denotes a set of ``alternatives''. Both wh-words and disjunctions can be analysed as creating Hamblin-type sets of ``alternatives''. Q-particles can be treated as uniformly denoting variables over choice functions which apply to the aforementioned Hamblin-type sets, thus ``restoring'' the derivation to normal Montagovian semantics. The treatment of Q-particles as uniformly denoting variables over choice functions provides an explanation for why these particles appear in just this set of contexts: they all include an element with Hamblin-type semantics. However, we also find variation in the use of Q-particles; including, in some languages, the appearance of multiple morphologically-distinct Q-particles in different syntactic contexts. Such variation can be handled largely by positing that Q-particles may vary in their formal syntactic feature specifications, determining which syntactic contexts they are licensed in. The unified analysis of Q-particles as denoting variables over choice functions also raises various questions about the proper analysis of interrogatives, indefinites, and disjunctions, including issues concerning the nature of the semantics of wh-words and the syntactic structure of disjunction. As well, I observe that indefinites involving Q-particles have a crosslinguistic tendency to be epistemic indefinites, i.e. indefinites which explicitly signal ignorance of details regarding who or what satisfies the existential claim. I provide an account of such indefinites which draws on the analysis of Q-particles as variables over choice functions. These pragmatic ``signals of ignorance'' (which I argue to be presuppositions) also have a further role to play in determining the distribution of Q-particles in disjunctions. The final section of this study investigates the historical development of focus constructions and Q-particles in Sinhala. This diachronic study allows us not only to observe the origin and development of such elements, but also serves to delimit the range of possible synchronic analyses, thus providing us with further insights into the formal syntactic and semantic properties of Q-particles. This study highlights both the importance of considering various components of the grammar (e.g. syntax, semantics, pragmatics, morphology) and the use of philology in developing plausible formal analyses of complex linguistic phenomena such as the crosslinguistic distribution of Q-particles.

Relevância:

40.00% 40.00%

Publicador:

Resumo:

Cyclic m-cycle systems of order v are constructed for all m greater than or equal to 3, and all v = 1(mod 2m). This result has been settled previously by several authors. In this paper, we provide a different solution, as a consequence of a more general result, which handles all cases using similar methods and which also allows us to prove necessary and sufficient conditions for the existence of a cyclic m-cycle system of K-v - F for all m greater than or equal to 3, and all v = 2(mod 2m).

Relevância:

40.00% 40.00%

Publicador:

Resumo:

We perform a comparison between the fractional iteration and decomposition methods applied to the wave equation on Cantor set. The operators are taken in the local sense. The results illustrate the significant features of the two methods which are both very effective and straightforward for solving the differential equations with local fractional derivative.

Relevância:

40.00% 40.00%

Publicador:

Resumo:

We present systems of Navier-Stokes equations on Cantor sets, which are described by the local fractional vector calculus. It is shown that the results for Navier-Stokes equations in a fractal bounded domain are efficient and accurate for describing fluid flow in fractal media.

Relevância:

40.00% 40.00%

Publicador:

Resumo:

For bilipschitz images of Cantor sets in Rd we estimate the Lipschitz harmonic capacity and show this capacity is invariant under bilipschitz homeomorphisms.

Relevância:

40.00% 40.00%

Publicador:

Resumo:

"Vegeu el resum a l'inici del document del fitxer adjunt."

Relevância:

40.00% 40.00%

Publicador:

Resumo:

Walker et al. defined two families of binary operations on M (set of functions of [0,1] in [0,1]), and they determined that, under certain conditions, those operations are t-norms (triangular norm) or t-conorms on L (all the normal and convex functions of M). We define binary operations on M, more general than those given by Walker et al., and we study many properties of these general operations that allow us to deduce new t-norms and t-conorms on both L, and M.

Relevância:

40.00% 40.00%

Publicador:

Resumo:

Thesis (Ph.D.)--University of Washington, 2016-06

Relevância:

40.00% 40.00%

Publicador:

Resumo:

We consider the question whether the assumption of convexity of the set involved in Clarke-Ledyaev inequality can be relaxed. In the case when the point is outside the convex hull of the set we show that Clarke-Ledyaev type inequality holds if and only if there is certain geometrical relation between the point and the set.

Relevância:

30.00% 30.00%

Publicador:

Resumo:

We derive an analytic expression for the matric flux potential (M) for van Genuchten-Mualem (VGM) type soils which can also be written in terms of a converging infinite series. Considering the first four terms of this series, the accuracy of the approximation was verified by comparing it to values of M estimated by numerical finite difference integration. Using values of the parameters for three soils from different texture classes, the proposed four-term approximation showed an almost perfect match with the numerical solution, except for effective saturations higher than 0.9. Including more terms reduced the discrepancy but also increased the complexity of the equation. The four-term equation can be used for most applications. Cases with special interest in nearly saturated soils should include more terms from the infinite series. A transpiration reduction function for use with the VGM equations is derived by combining the derived expression for M with a root water extraction model. The shape of the resulting reduction function and its dependency on the derivative of the soil hydraulic diffusivity D with respect to the soil water content theta is discussed. Positive and negative values of dD/d theta yield concave and convex or S-shaped reduction functions, respectively. On the basis of three data sets, the hydraulic properties of virtually all soils yield concave reduction curves. Such curves based solely on soil hydraulic properties do not account for the complex interactions between shoot growth, root growth, and water availability.

Relevância:

30.00% 30.00%

Publicador:

Resumo:

We study partitions of the set of all ((v)(3)) triples chosen from a v-set into pairwise disjoint planes with three points per line. Our partitions may contain copies of PG(2, 2) only (Fano partitions) or copies of AG(2, 3) only (affine partitions) or copies of some planes of each type (mixed partitions). We find necessary conditions for Fano or affine partitions to exist. Such partitions are already known in several cases: Fano partitions for v = 8 and affine partitions for v = 9 or 10. We construct such partitions for several sporadic orders, namely, Fano partitions for v = 14, 16, 22, 23, 28, and an affine partition for v = 18. Using these as starter partitions, we prove that Fano partitions exist for v = 7(n) + 1, 13(n) + 1, 27(n) + 1, and affine partitions for v = 8(n) + 1, 9(n) + 1, 17(n) + 1. In particular, both Fano and affine partitions exist for v = 3(6n) + 1. Using properties of 3-wise balanced designs, we extend these results to show that affine partitions also exist for v = 3(2n). Similarly, mixed partitions are shown to exist for v = 8(n), 9(n), 11(n) + 1.

Relevância:

30.00% 30.00%

Publicador:

Resumo:

Motivation: A major issue in cell biology today is how distinct intracellular regions of the cell, like the Golgi Apparatus, maintain their unique composition of proteins and lipids. The cell differentially separates Golgi resident proteins from proteins that move through the organelle to other subcellular destinations. We set out to determine if we could distinguish these two types of transmembrane proteins using computational approaches. Results: A new method has been developed to predict Golgi membrane proteins based on their transmembrane domains. To establish the prediction procedure, we took the hydrophobicity values and frequencies of different residues within the transmembrane domains into consideration. A simple linear discriminant function was developed with a small number of parameters derived from a dataset of Type II transmembrane proteins of known localization. This can discriminate between proteins destined for Golgi apparatus or other locations (post-Golgi) with a success rate of 89.3% or 85.2%, respectively on our redundancy-reduced data sets.

Relevância:

30.00% 30.00%

Publicador:

Resumo:

Consider the problem of determining a task-toprocessor assignment for a given collection of implicit-deadline sporadic tasks upon a multiprocessor platform in which there are two distinct kinds of processors. We propose a polynomialtime approximation scheme (PTAS) for this problem. It offers the following guarantee: for a given task set and a given platform, if there exists a feasible task-to-processor assignment, then given an input parameter, ϵ, our PTAS succeeds, in polynomial time, in finding such a feasible task-to-processor assignment on a platform in which each processor is 1+3ϵ times faster. In the simulations, our PTAS outperforms the state-of-the-art PTAS [1] and also for the vast majority of task sets, it requires significantly smaller processor speedup than (its upper bound of) 1+3ϵ for successfully determining a feasible task-to-processor assignment.

Relevância:

30.00% 30.00%

Publicador:

Resumo:

Consider the problem of non-migratively scheduling a set of implicit-deadline sporadic tasks to meet all deadlines on a two-type heterogeneous multiprocessor platform. We ask the following question: Does there exist a phase transition behavior for the two-type heterogeneous multiprocessor scheduling problem? We also provide some initial observations via simulations performed on randomly generated task sets.