Bank ATM Machine Simulation using Multiple Inheritance and Polymorphism in C++

ATM is one of the main sources of withdrawal and/or deposit of money nowadays. In this project, a simulation of a location with multiple ATM Machines (say ATM booth outside the banks) is attempted. The ATM Machine must be capable of servicing different types of account holders (customers) depending on account type and transaction type. A customer can perform four transactions i.e. Withdrawal,Deposit, Transfer and Balance Inquiry. Also, a customer can have two types of Accounts, namely, Personal and Business accounts with four possible subtypes of each. Thus, a three level inheritance model is used. The important technique is to find similar data members among them and use multiple level inheritance to maximize code reuse as well as to use method overriding to implement polymorphism. Multiple inheritance creates a diamond problem, with which, the UML diagram looks like a diamond and the derived class will inherent indirectly multiple copies from the first base class it's protected data members and public methods making them ambiguous, so, they will not get past the compiler; while using overriding technique in polymorphism to use two accessor methods for the hierarchy creates a problem of accessing many Data Types using only these two methods. This project will show the solution of how to solve diamond problem and overriding accessor methods as well as the important components used

Performance of Bursty World Wide Web (WWW) Sources over ABR

We model World Wide Web (WWW) servers and clients running over an ATM network using the ABR (available bit rate) service. The WWW servers are modeled using a variant of the SPECweb96 benchmark, while the WWW clients are based on a model by Mah. The traffic generated by this application is typically bursty, i.e., it has active and idle periods in transmission. A timeout occurs after given amount of idle period. During idle period the underlying TCP congestion windows remain open until a timeout expires. These open windows may be used to send data in a burst when the application becomes active again. This raises the possibility of large switch queues if the source rates are not controlled by ABR. We study this problem and show that ABR scales well with a large number of bursty TCP sources in the system.Comment: Submitted to WebNet `97, Toronto, November 9

Formulating the cognitive design problem of air traffic management

Evolutionary approaches to cognitive design in the air traffic management (ATM) system can be attributed with a history of delayed developments. This issue is well illustrated in the case of the flight progress strip where attempts to design a computer-based system to replace the paper strip have consistently been met with rejection. An alternative approach to cognitive design of air traffic management is needed and this paper proposes an approach centred on the formulation of cognitive design problems. The paper gives an account of how a cognitive design problem was formulated for a simulated ATM task performed by controller subjects in the laboratory. The problem is formulated in terms of two complimentary models. First, a model of the ATM domain describes the cognitive task environment of managing the simulated air traffic. Second, a model of the ATM worksystem describes the abstracted cognitive behaviours of the controllers and their tools in performing the traffic management task. Taken together, the models provide a statement of worksystem performance, and express the cognitive design problem for the simulated system. The use of the problem formulation in supporting cognitive design, including the design of computer-based flight strips, is discussed

Survey of traffic control schemes and error control schemes for ATM networks

Among the techniques proposed for B-ISDN transfer mode, ATM concept is considered to be the most promising transfer technique because of its flexibility and efficiency. This paper surveys and reviews a number of topics related to ATM networks. Those topics cover congestion control, provision of multiple classes of traffic, and error control. Due to the nature of ATM networks, those issues are far more challenging than in conventional networks. Sorne of the more promising solutions to those issues are surveyed, and the corresponding results on performance are summarized. Future research problems in ATM protocol aspect are also presented

Bayesian Gene Set Analysis

Gene expression microarray technologies provide the simultaneous measurements of a large number of genes. Typical analyses of such data focus on the individual genes, but recent work has demonstrated that evaluating changes in expression across predefined sets of genes often increases statistical power and produces more robust results. We introduce a new methodology for identifying gene sets that are differentially expressed under varying experimental conditions. Our approach uses a hierarchical Bayesian framework where a hyperparameter measures the significance of each gene set. Using simulated data, we compare our proposed method to alternative approaches, such as Gene Set Enrichment Analysis (GSEA) and Gene Set Analysis (GSA). Our approach provides the best overall performance. We also discuss the application of our method to experimental data based on p53 mutation status

Revising SA-CCR

From SA-CCR to RSA-CCR: making SA-CCR self-consistent and appropriately risk-sensitive by cashflow decomposition in a 3-Factor Gaussian Market ModelComment: 20 pages, 13 table

Collective traffic-like movement of ants on a trail: dynamical phases and phase transitions

The traffic-like collective movement of ants on a trail can be described by a stochastic cellular automaton model. We have earlier investigated its unusual flow-density relation by using various mean field approximations and computer simulations. In this paper, we study the model following an alternative approach based on the analogy with the zero range process, which is one of the few known exactly solvable stochastic dynamical models. We show that our theory can quantitatively account for the unusual non-monotonic dependence of the average speed of the ants on their density for finite lattices with periodic boundary conditions. Moreover, we argue that the model exhibits a continuous phase transition at the critial density only in a limiting case. Furthermore, we investigate the phase diagram of the model by replacing the periodic boundary conditions by open boundary conditions.Comment: 8 pages, 6 figure