40601169
Performance Modeling and Practical Parallel Algorithms of Cluster Computing with Applications on Distributed Platforms
21956342
Architectural design and implementation of highly available and scalable medical system with IBM Websphere middleware
Medical systems require the end-to-end high availability and scalability. There are many components in a medical system, and each individual component contributes to the overall system availability and scalability. We present the formulas to assess the overall system availability and capacity planning, and we architect approaches and technologies to make all components highly available in all tiers by clustering, workload management, and replication. We discuss how to unify all medical systems and design the uniform framework for different kinds of medical systems to hook up with this framework so that we can maintain a highly available and highly scalable system with ease. We use the n-tier distributed component based architecture and J2EE technologies as well as Web services to interact with .NET and others. We discuss how to program in the framework for high availability and scalability and how to upgrade application software without service interruption to achieve continuous availability. We show how to add or reduce hardware capacity in each tier and how to maintain hardware and software without service interruption as well as how to balance the capacity and availability among tiers.
30738286
The algorithms for dynamic scheduling
1622406
Structure Analysis and SNR-Variance Evolution for Parallel Concatenated Coded IDMA Systems
This paper is concerned with parallel concatenated coded interleave-division multiple-access (IDMA) systems. We briefly present the transmitter/receiver structure of these systems and propose an efficient SNR-variance evolution scheme for bit-error-rate (BER) performance evaluation. The proposed evolution scheme is also useful for system performance optimization. Numerical results show that the BER performance curves obtained by simulation and evolution are quite close when the data length is long enough.
33243327
Certain Predicates Defined by Induction Schemata
It is known that we can introduce in number theory (for example, the system Z of Hilbert-Bernays) by induction schemata certain predicates of natural numbers which cannot be expressed explicitly within the framework of number theory. The question arises how we can define these predicates in some richer system, without employing induction schemata. In this paper a general notion of definability by induction (relative to number theory), which seems to apply to all the known predicates of this kind, is introduced; and it is proved that in a system L 1 which forms an extension of number theory all predicates which are definable by induction (hereafter to be abbreviated d.i.) according to the definition are explicitly expressible. In order to define such predicates and prove theorems answering to their induction schemata, we have to allow certain impredicative classes in L 1 . However, if we want merely to prove that for each constant number the special case of the induction schema for a predicate d.i. is provable, we do not have to assume the existence of impredicative classes. A certain weaker system L 2 , in which only predicative classes of natural numbers are allowed, is sufficient for the purpose. It is noted that a truth definition for number theory can be obtained in L 2 . Consistency proofs for number theory do not seem to be formalizable in L 2 , although they can, it is observed, be formalized in L 1 . In general, given any ordinary formal system (say Zermelo set theory), it is possible to define by induction schemata, in the same manner as in number theory, certain predicates which are not explicitly definable in the system. Here again, by extending the system in an analogous fashion, these predicates become expressible in the resulting system. The crucial predicate instrumental to obtaining a truth definition for a given system is taken as an example.
6016307
Research and Implementation of Knowledge-Enhanced Information Services
Information isolation has been identified as a big challenge in IT Service Management (ITSM). Existing ITSM practices mostly rely on configuration information and are geared towards individual applications and processes. However, information available in complicated IT infrastructure goes beyond data from the configuration management domain. How to efficiently extract and integrate the hidden knowledge from a wide variety of information sources is a major pain point for ITSM. In this paper, a threading strategy (TS) with KPI mark and knowledge-enhanced information services is proposed to improve ITSM quality. The essential contribution of this work is to organize the highly complex IT service information with KPI mark and to build a knowledge repository for accumulateing and reusing experts' knowledge. In addition, a prototype called BIANCHIN is implemented to explore this knowledge-enhanced information services framework. Finally, a real business application of Cisco VoIP system is used as a case study for evaluating the effectiveness and efficiency of the knowledge-enhanced information services framework.
18986616
Verifying Real-Time Systems using Explicit-time Description Methods
Timed model checking has been extensively researched in recent years. Many new formalisms with time extensions and tools based on them have been presented. On the other hand, Explicit-Time Description Methods aim to verify real-time systems with general untimed model checkers. Lamport presented an explicit-time description method using a clock-ticking process (Tick) to simulate the passage of time together with a group of global variables for time requirements. This paper proposes a new explicit-time description method with no reliance on global variables. Instead, it uses rendezvous synchronization steps between the Tick process and each system process to simulate time. This new method achieves better modularity and facilitates usage of more complex timing constraints. The two explicit-time description methods are implemented in DIVINE, a well-known distributed-memory model checker. Preliminary experiment results show that our new method, with better modularity, is comparable to Lamport's method with respect to time and memory efficiency.