Browsing by Discipline

Now showing items 1-20 of 46

    • Abstract convexity in metric spaces 

      Saha, Tushar Kanti (1985)
      Convexity in metric space is the main topic of discussion in this thesis. To undertake the study we have studied extensively the means introduced by Doss and included the results concerning means derived by Gahier ...

    • Abstract convexity spaces 

      Varma, Ashok K. (1978)
      The principal question discussed in this dissertation is the problem of characterizing the linear and convex functions on generalized line spaces. A linear function is shown to be a convex function. The linear and ...

    • Abstract model for measure and category 

      Ho, S. M. Francis (1975)
      This thesis is an attempt to establish an abstract model for Lebesgue measure and Baire category. In the introduction, we list several similarities between Lebesgue measurable sets and sets having the property of ...

    • Amenable semigroups and ergodicity 

      Chan, Hing-Chiu (1972)

    • Approximate inverse based multigrid solution of large sparse linear systems 

      Banerjee, Rabindra Nath (1988)
      In this thesis we study the approximate inverse based multigrid algorithm FAPIN for the solution of large sparse linear systems of equations. This algorithm, which is closely related to the well known multigrid V-cycle, ...

    • Arguesian lattices of order 3 

      Pickering, Douglas (1981)
      Since the mid 19th century it has been known that every Desarguean projective’ plane is coordinatizable over a division ring. This coordinatization procedure was used by von Neumann [9] to show that every complemented ...

    • Best approximation in L1 [T,...] 

      Mann, Patrick J. (1980)

    • C++ : a concurrent object-oriented programming language 

      Huang, He (1993)
      Developing concurrent object-oriented programming (COOP) languages becomes an attractive research area since COOP languages are more suitable for simulation of real world objects and their interactions. After reviewing ...

    • Characterizations for the existence of a solution to the moment problem on a number of intervals 

      Liu, Xiang (1990)

    • Compact sets in Banach spaces 

      Yu, Ling (1990)
      Connections between several compact spaces are studied in this thesis. Proofs are given when one implies another, and so are counterexamples when one does not. The spaces discussed in this thesis are: uniform Eberlein ...

    • Compiling Prolog to Logic-inference Virtual Machine 

      Wang, Yifei (Fred) (1998)
      The Logic-inference Virtual Machine (LVM) is a new Prolog execution model consisting of a set of high-level instructions and memory architecture for handling control and unification. Different from the well-known Warren's ...

    • Computation using s-programs 

      Wen, Yandan (1987)
      The concepts of S and Sn programs are given by Davis, Weyuker, 1983. Several parts of the complexity theory are carried out directly for S and Sn programs. The concepts of non-deterministic and deterministic computation ...

    • Construction of a local Lie group from its Lie algebra 

      La Haye, Roberta (1992)
      In "Symmetry Groups and Their Applications", by W. Miller [1, p.152-206], Miller discusses local Lie group theory and certain resulting applications in special function theory, in the course of this discussion Miller ...

    • Context sensitive neural network by overlapped systems 

      Mohamed, Atef S. (2006)
      The use of context dependency in neural networks is an important issue in many cognitive situations. In this report we introduce a novel context dependent neural network model based on overlapped multi-neural network ...

    • Differentiable and rough norms 

      McKessock, Douglas J. R. (1970)
      The principal question discussed in this dissertation is the problem of characterizing the existence of admissible Frechet differentiable norms on Banach spaces. In the first chapter the basic concepts of normed linear ...

    • Empirical study of dense schedule performance ratio on open-shop scheduling problem 

      Yan, Qingxiang (2006)
      In this paper, we study properties of dense schedules for the open-shop problems and their average performance ratio. After using two sets of test problems, we show that the average performance ratio of dense schedules ...

    • Error control coding for semiconductor memories 

      Baoming, Hao (1993)
      All modern computers have memories built from VLSI RAM chips. Individually, these devices are highly reliable and any single chip may perform for decades before failing. However, when many of the chips are combined in ...

    • Explicative study and extensions of the Pearson system of frequency curves. 

      Das, Prabhubandhu (1973)

    • Finite element solutions to boundary value problems 

      Chew, Kok-Thai (1977)
      The finite element solution of certain two-point boundary value problems is discussed. In order to obtain more accuracy than the linear finite element method can give, an order-h[superscript 4] global superconvergence ...

    • Higher dimensional numerical quadrature 

      Lim, Thin-Hock (1973)
      This thesis contains a study of higher dimensional numerical quadrature, especially two dimensional Gregory quadrature. In Chapter I, we discuss the problem of approximation and integration, the reasons why numerical ...