نتایج جستجو برای: weak and strong convergence
تعداد نتایج: 16888504 فیلتر نتایج به سال:
Bu makalede, ilk olarak toplanabilme teknikleri ve iterasyon yöntemleri araştırılmıştır. Ayrıca, bazı için Cesàro anlamında tekniğine bağlı ergodik teori üzerine yapılan çalışmalar incelenmiştir. Son asimptotik genişlemeyen dönüşümler Halpren iterasyonu ile ortalamasının güçlü yakınsaklığı bir çalışma irdelenmiştir.
This paper has examined the phenomenon of convergence of per capita out put levels across the IC countries for the 1960-1998 periods. Three concepts of convergence, i.e., sigma beta and relative beta, have been used. The estimated beta values reveals only a very weak convergence (?=.0014) across IC for 1960-1998 period. But when a more homogeneous group of countries were selected, the results s...
We prove that in a rosy theory, the n-uniqueness of a strong type p implies the strong n-uniqueness of p. In addition we study some of the boundary properties of p. In [5], given a strong type p = tp(c/A) in a stable theory T , if T has (≤ n)-uniqueness while p does not have (n + 1)-uniqueness then, over an infinite Morley sequence of the type of some finite tuple c′ ∈ acl(cA) over A witnessing...
In this paper, we will obtain the strong type and weak type estimates for vector-valued analogs of intrinsic square functions in the generalized weighted Morrey spacesM w (l2). We study the boundedness of intrinsic square functions including the Lusin area integral, the Littlewood-Paley g-function and gλ -function, and their multilinear commutators on vector-valued generalized weighted Morrey s...
We discuss the properties of strictly typed languages on the one hand and soft typing of the other and identify disadvantages of these approaches to type checking in the context of powerful type languages. To overcome the problems we develop an approach that combines ideas of strict and soft typing. This approach is based on the concept of complete typing that is guaranteed to accept every well...
When using existing ACL2 datatype frameworks, many theorems require type hypotheses. These hypotheses slow down the theorem prover, are tedious to write, and are easy to forget. We describe a principled approach to types that provides strong type safety and execution efficiency while avoiding type hypotheses, and we present a library that automates this approach. Using this approach, types help...
In this paper, we present our approach to introduce dynamism support to simulation environments, which adopts a Discrete Event System Specification (DEVS)-based modeling and simulation approach and builds upon previous work on Simulation Modeling Architecture (SiMA), a DEVS-based simulation framework developed at TUBITAK UEKAE. In the relevant literature there are already proposed solutions to ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید