9,851 research outputs found

    Introduction to the special section on dependable network computing

    Get PDF
    Dependable network computing is becoming a key part of our daily economic and social life. Every day, millions of users and businesses are utilizing the Internet infrastructure for real-time electronic commerce transactions, scheduling important events, and building relationships. While network traffic and the number of users are rapidly growing, the mean-time between failures (MTTF) is surprisingly short; according to recent studies, in the majority of Internet backbone paths, the MTTF is 28 days. This leads to a strong requirement for highly dependable networks, servers, and software systems. The challenge is to build interconnected systems, based on available technology, that are inexpensive, accessible, scalable, and dependable. This special section provides insights into a number of these exciting challenges

    Distributed simulation with COTS simulation packages: A case study in health care supply chain simulation

    Get PDF
    The UK National Blood Service (NBS) is a public funded body that is responsible for distributing blood and asso-ciated products. A discrete-event simulation of the NBS supply chain in the Southampton area has been built using the commercial off-the-shelf simulation package (CSP) Simul8. This models the relationship in the health care supply chain between the NBS Processing, Testing and Is-suing (PTI) facility and its associated hospitals. However, as the number of hospitals increase simulation run time be-comes inconveniently large. Using distributed simulation to try to solve this problem, researchers have used techniques informed by SISO’s CSPI PDG to create a version of Simul8 compatible with the High Level Architecture (HLA). The NBS supply chain model was subsequently divided into several sub-models, each running in its own copy of Simul8. Experimentation shows that this distri-buted version performs better than its standalone, conven-tional counterpart as the number of hospitals increases

    Fast Approximate Max-n Monte Carlo Tree Search for Ms Pac-Man

    Get PDF
    We present an application of Monte Carlo tree search (MCTS) for the game of Ms Pac-Man. Contrary to most applications of MCTS to date, Ms Pac-Man requires almost real-time decision making and does not have a natural end state. We approached the problem by performing Monte Carlo tree searches on a five player maxn tree representation of the game with limited tree search depth. We performed a number of experiments using both the MCTS game agents (for pacman and ghosts) and agents used in previous work (for ghosts). Performance-wise, our approach gets excellent scores, outperforming previous non-MCTS opponent approaches to the game by up to two orders of magnitude. © 2011 IEEE

    A Memristor as Multi-Bit Memory: Feasibility Analysis

    Get PDF
    The use of emerging memristor materials for advanced electrical devices such as multi-valued logic is expected to outperform today's binary logic digital technologies. We show here an example for such non-binary device with the design of a multi-bit memory. While conventional memory cells can store only 1 bit, memristors-based multi-bit cells can store more information within single device thus increasing the information storage density. Such devices can potentially utilize the non-linear resistance of memristor materials for efficient information storage. We analyze the performance of such memory devices based on their expected variations in order to determine the viability of memristor-based multi-bit memory. A design of read/write scheme and a simple model for this cell, lay grounds for full integration of memristor multi-bit memory cell
    corecore