Some Results Concerning Hilbert Space

In this research paper to obtained a common unique fixed point theorem for two continuous surjective random operators defined on a non empty closed subset of separable Hilbert space. The corresponding result for non-random case is also obtained. Mathematics subject classification : 47H10, 54H25 Keyboards : Separable Hilbert space, random operators, common random fixed point

Segmentation and Descriptors for Pattern

Image segmentation is an essential preliminary step in most automatic pictorial pattern recognition. The purpose of representation and description is used to be the application of Pattern. In the application of image processing, we have to choose an approach and to do description, just like recognition of the image. Keywords: image processing, Patter

Fixed Points Theorem on A Pair of Random Generalized Non-Linear Contractions

A fixed point theorem for a pair of random generalized non-linear contraction mappings involving four points of the space under consideration is proven. It is shown that this result includes the result of Lee and Padgett [1]. Also an application of the result is given. Key words : Complete probability measure space, d-algebras, Borel subsets, random operator, separable Banach space, upper semi-continuous functions. Bochner integral, Mathematics Subject classification: Primary 60H99, 47H10, and Secondary 60H 20

Exclusive light particle measurements for the system 19^{19}F + 12^{12}C at 96 MeV

Decay sequence of hot {31}^P nucleus has been investigated through exclusive light charged particle measurements in coincidence with individual evaporation residues using the reaction {19}^F (96 MeV) + {12}^C. Information on the sequential decay chain have been extracted by confronting the data with the predictions of the statistical model. It is observed from the present analysis that such exclusive light charged particle data may be used as a powerful tool to probe the decay sequence of the hot light compound systems.Comment: 13 pages, 8 figures, Physical Review C (in press

Objects and Actions in Reliable Distributed Systems

objects are structured entities that can only be manipulated by invoking the procedures associated with them. Programs constructed using abstract objects have a hierarchical structure in that higher level objects are constructed using -- 3 -- lower level objects: making such a program reliable essentially involves making objects reliable (that is ensuring that objects remain consistent in the presence of failures of certain kinds). It is natural to assume that distributed programs will have a similar structure to that discussed above, the only difference being that objects may be distributed over the network. All that is then necessary is to provide network protocols enabling a program to invoke operations of a remote object. Such a protocol should provide the abstraction of invoking a procedure. Hence the term remote procedure call (RPC) is often used to refer to the services provided by the protocol. Our task is thus to investigate reliability techniques for constructing reliable..

A System For Fault-Tolerant Execution of Data and Compute Intensive Programs Over a Network Of Workstations

The bag of tasks structure permits dynamic partitioning for a wide class of parallel applications. This paper describes a fault-tolerant implementation of this structure using atomic actions (atomic transactions) to operate on persistent objects, which are accessed in a distributed setting via a Remote Procedure Call (RPC). The system is suited to parallel execution of data and compute intensive programs that require persistent storage and fault tolerance, and runs on stock hardware and software platforms, unix, C++. Its suitability is examined in the context of the measured performance of three applications; ray tracing, matrix multiplication and Cholesky factorization. 1 Introduction Many computations manipulate very large amounts of data. Matrix calculations represent one example class. In a Massively Parallel Processor (MPP) such a vast data set is typically partitioned statically between the very many distributed processing elements and moved amongst them as necessary to perform ..