Java based replicated server objects and their remote method invocations in a distributed environment

A distributed system is said to be fault‐tolerant if it is able to provide important services despite partial failures of the computers or software objects in the system. These systems are needed to support applications such as remote access and control, virtual mobile offices and wide area collaborative systems where there are chances of failures in the network and software objects. Fault‐tolerance is usually achieved by replicating the objects in the system. Traditional distributed applications constructed using Java RMI (remote method invocation) are not fault‐tolerant because of the lack of support of object replication. The objective of the present work is to design a remote method invocation that supports server object replication. To provide a fault‐tolerant service to the remote client objects, server objects are actively replicated. The problems associated with the method invocation in the context of active server object replication are presented and solutions are discussed and implemented. Copyright © 2001 John Wiley & Sons, Ltd.     

Java-MaC: A Run-Time Assurance Approach for Java Programs

We describe Java-MaC, a prototype implementation of the Monitoring and Checking (MaC) architecture for Java programs. The MaC architecture provides assurance that the target program is running correctly with respect to a formal requirements specification by monitoring and checking the execution of the target program at run-time. MaC bridges the gap between formal verification, which ensures the correctness of a design rather than an implementation, and testing, which does not provide formal guarantees about the correctness of the system.Use of formal requirement specifications in run-time monitoring and checking is the salient aspect of the MaC architecture. MaC is a lightweight formal method solution which works as a viable complement to the current heavyweight formal methods. In addition, analysis processes of the architecture including instrumentation of the target program, monitoring, and checking are performed fully automatically without human direction, which increases the accuracy of the analysis. Another important feature of the architecture is the clear separation between monitoring implementation-dependent low-level behaviors and checking high-level behaviors, which allows the reuse of a high-level requirement specification even when the target program implementation changes. Furthermore, this separation makes the architecture modular and allows the flexibility of incorporating third party tools into the architecture. The paper presents an overview of the MaC architecture and a prototype implementation Java-MaC.     

Comparison of Expedient and Optima Reinforcement Schemes for Learning Systems

Stochastic automata models have been successfully used in the past for modeling learning systems. An automaton model with a variable structure reacts to inputs from a random environment by changing the probabilities of its actions. These changes are carried out using a reinforcement scheme in such a manner that the automaton evolves to a final structure which is satisfactory in some sense. Several reinforcement schemes have been proposed in the literature for updating the structure of automata [1–4]. Most of these are expedient schemes which in the limit yield structures which are better than a device that chooses the actions with equal probabilities irrespective of the environment's response. A few schemes have also been suggested recently which in the limit lead to a continuous selection of a single optimal action as the output of the automaton, when it operates in a stationary environment and are called optimal schemes [5–7]. The question naturally arises as to which of the schemes are to be preferred in practical applications. In view of the anticipated extensive use of learning schemes in multilevel decision-making systems this question of optimality versus expediency takes on particular significance. Consequently, a comparison has to be made not merely of individual automata schemes but also of the effectiveness of such schemes in situations involving several automata (e.g. stochastic games, multilevel systems).     

Mössbauer and XRD studies on the effect of doping iron in KCaY(PO4)2

The effect of doping iron at the yttrium site in hexagonal KCaY(PO₄)₂ is studied for various concentrations ofx (0≤x≤1), of iron using Mössbauer and X-ray diffraction methods. For low iron concentrations, very little changes in structure are seen but atx≈0·1, onset of new peaks in the XRD pattern is observed. The Mössbauer study of the doped samples reveals that iron has a solubility of up to 2·5% in the parent phase with any excess iron precipitating out to form a new and unknown phase. From a detailed analysis of the X-ray diffraction pattern (corresponding tox=1) of the latter phase, it is found that this phase is rhombohedral with the possible space groupR3.     

Sparsity Enforcing Edge Detection Method for Blurred and Noisy Fourier data

We present a new method for estimating the edges in a piecewise smooth function from blurred and noisy Fourier data. The proposed method is constructed by combining the so called concentration factor edge detection method, which uses a finite number of Fourier coefficients to approximate the jump function of a piecewise smooth function, with compressed sensing ideas. Due to the global nature of the concentration factor method, Gibbs oscillations feature prominently near the jump discontinuities. This can cause the misidentification of edges when simple thresholding techniques are used. In fact, the true jump function is sparse, i.e. zero almost everywhere with non-zero values only at the edge locations. Hence we adopt an idea from compressed sensing and propose a method that uses a regularized deconvolution to remove the artifacts. Our new method is fast, in the sense that it only needs the solution of a single l ₁ minimization. Numerical examples demonstrate the accuracy and robustness of the method in the presence of noise and blur.     

Compliant cryptologic protocols

Literally, the word compliance suggests conformity in fulfilling official requirements. This paper presents the results of the analysis and design of a class of protocols called compliant cryptologic protocols (CCPs). The paper presents a notion for compliance in cryptosystems that is conducive as a cryptologic goal. CCPs are employed in security systems used by at least two mutually mistrusting sets of entities. The individuals in the sets of entities only trust the design of the security system and any trusted third party the security system may include. Such a security system can be thought of as a broker between the mistrusting sets of entities. Published online: 15 November 2002     

Energy-Efficient Thermal-Aware Autonomic Management of Virtualized HPC Cloud Infrastructure

Virtualized datacenters and clouds are being increasingly considered for traditional High-Performance Computing (HPC) workloads that have typically targeted Grids and conventional HPC platforms. However, maximizing energy efficiency and utilization of datacenter resources, and minimizing undesired thermal behavior while ensuring application performance and other Quality of Service (QoS) guarantees for HPC applications requires careful consideration of important and extremely challenging tradeoffs. Virtual Machine (VM) migration is one of the most common techniques used to alleviate thermal anomalies (i.e., hotspots) in cloud datacenter servers as it reduces load and, hence, the server utilization. In this article, the benefits of using other techniques such as voltage scaling and pinning (traditionally used for reducing energy consumption) for thermal management over VM migrations are studied in detail. As no single technique is the most efficient to meet temperature/performance optimization goals in all situations, an autonomic approach that performs energy-efficient thermal management while ensuring the QoS delivered to the users is proposed. To address the problem of VM allocation that arises during VM migrations, an innovative application-centric energy-aware strategy for Virtual Machine (VM) allocation is proposed. The proposed strategy ensures high resource utilization and energy efficiency through VM consolidation while satisfying application QoS by exploiting knowledge obtained through application profiling along multiple dimensions (CPU, memory, and network bandwidth utilization). To support our arguments, we present the results obtained from an experimental evaluation on real hardware using HPC workloads under different scenarios.     

Surface studies on activated and hydrided CaNi5 alloy

X-ray photoelectron spectroscopic studies on the activated pure CaNi₅ alloy as well as the hydride formed at 1 atm pressure and room temperature, CaNi₅H_4.8, showed that on activation calcium segregates to the surface and forms the oxide, whereas most of the nickel on the surface is present in the metallic form. This indicates that the coexistance of the oxide phase and the metal phase is essential for the facile hydriding behaviour of CaNi₅.     

On the relationship between the electronic density of states and the superconducting critical temperature of disordered V3Si

The available data on the effect of neutron and α-particle irradiation on the superconducting properties and the low-temperature specific heat capacity of single- and polycrystalline V₃Si were analyzed in a unified manner. It was found that the electron-phonon renormalization parameter λ does not vary simply proportionally to the bare density of electron states at the Fermi level as had been earlier conjectured by Dynes and Varma, nor does it vary in exactly the same manner as found by Fradin and Williamson to hold for a variety of vanadium-based A15 structure compounds and pseudobinary alloys. When the behavior of V₃Si is compared with that of Nb₃Sn, Nb₃Al, and Nb₃Ge, it is seen that the response to disorder of parameters of importance in the superconductivity of these compounds does not follow any simple, universal behavior.