ppxscal/embedding_network huggingface dataset:
Smart Cards: A Specific Application in the Hospital
Authors: İnan Güler, R. Murat Zengin, Mustafa Sönmez
Venue: Journal of Medical Systems (1998)

Computers have the ability to process and access tremendous amounts of information in our daily lives. But, now, individuals have this ability by carrying a smart card in their own wallets. These cards provide us the versatility, power, and security of computers. This study begins with a short description of smart cards and their advantages. Then, an electronic circuit that is designed for healthcare application in hospitals is introduced. This circuit functions as a smart card holder identifier, access controller for hospital doors and also can be used as a smart card reader/writer. Design steps of this electronic circuit, operation principles, serial communication with P.C., and the software are examined. Finally a complete access control network for hospital doors that functions with smart cards is discussed.
Statistical inference of internal network loss and topology
Authors: R. Cáceres, N. G. Duffield, J. Horowitz, F. Lo Presti, D. Towsley
Venue: ACM SIGMETRICS Performance Evaluation Review (1999)

The use of inference from end-to-end multicast measurements has recently been proposed to find the internal characteristics in a network. Here we describe statistically rigorous methods for inferring link loss rates, and their application to identifying the underlying multicast topology.
9th workshop on institutionalizing software reuse (WISR '9) workshop summary
Authors: Jeffrey S. Poulin, Don Batory, Larry Latour
Venue: ACM SIGSOFT Software Engineering Notes (1999)

What has the field of reuse accomplished? Where can we declare success? Where should we take the blame for failure? The invitees to WISR recently met in Austin, Texas to address these questions and to help determine the direction of future reuse research and practice.
Performance evaluation of a new routing strategy for irregular networks with source routing
Authors: J. Flich, M. P. Malumbres, P. López, J. Duato
Venue: Proceedings of the 14th international conference on Supercomputing (2000)

Networks of workstations (NOWs) are becoming increasingly popular as a cost-effective alternative to parallel computers. Typically, these networks connect processors using irregular topologies, providing the wiring flexibility, scalability, and incremental expansion capability required in this environment. In some of these networks, messages are delivered using the up*/down* routing algorithm [9]. However, the up*/down* routing scheme is often non-minimal. Also, some of these networks use source routing [1]. With this technique, the entire path to destination is generated at the source host before the message is sent.In this paper we develop a new mechanism in order to improve the performance of irregular networks with source routing, increasing overall throughput. With this mechanism, messages always use minimal paths. To avoid possible deadlocks, when necessary, routes between a pair of hosts are divided into sub-routes, and a special kind of virtual cut-through is performed at some intermediate hosts. We evaluate the new mechanism by simulation using parameters taken from the Myrinet network. We show that the current routing schemes used in Myrinet can be improved by modifying only the routing software without increasing its overhead significantly and, most importantly, without modifying the network hardware. The benefits of using the new routing scheme are noticeable for networks with 16 or more switches, and increase with network size. For 32 and 64-switch networks, throughput is increased on average by a factor ranging from 1.3 to 3.3.
Minimum power and area n-tier multilevel interconnect architectures using optimal repeater insertion
Authors: Raguraman Venkatesan, Jeffrey A. Davis, Keith A. Bowman, James D. Meindl
Venue: Proceedings of the 2000 international symposium on Low power electronics and design (2000)

Minimum power CMOS ASIC macrocells are designed by minimizing the macrocell area using a new methodology to optimally insert repeaters for n-tier multilevel interconnect architectures. The minimum macrocell area and power dissipation are projected for the 100, 70 and 50 nm technology generations and compared with a n-tier design without using repeaters. Repeater insertion and a novel interconnect geometry scaling technique decrease the power dissipation by 58-68% corresponding to a macrocell area reduction of 70-78% for the global clock frequency designs of these three technology generations.
Matching simulation and experiment (extended abstract): a new simplified model for simulating protein folding
Authors: Jon M. Sorenson, Teresa Head-Gordon
Venue: Proceedings of the fourth annual international conference on Computational molecular biology (2000)

Simulations of simplified protein folding models have provided much insight into solving the protein folding problem. We propose here a new off-lattice bead model, capable of simulating several different fold classes of small proteins. We present the sequence for an &agr;/&bgr; protein resembling the IgG-binding proteins L and G. The thermodynamics of the folding process for this model are characterized using the multiple multi-histogram method combined with constant-temperature Langevin simulations. The folding is shown to be highly cooperative, with chain collapse nearly accompanying folding. Two parallel folding pathways are shown to exist on the folding free energy landscape. One pathway contains an intermediate&mdash;similar to experiments on protein G, and one pathway contains no intermediates&mdash;similar to experiments on protein L. The folding kinetics are characterized by tabulating mean-first passage times, and we show that the onset of glasslike kinetics occurs at much lower temperatures than the folding temperature. This model is expected to be useful in many future contexts; investigating questions of the role of local versus non-local interactions in various fold classes, addressing the effect of sequence mutations affecting secondary structure propensities, and providing a computationally feasible model for studying the role of solvation forces in protein folding.
Developing Knowledge-Based Intelligent Multimedia TutoringSystems Using Semantic Content-Based Modelling
Authors: Harry W. Agius, Marios C. Angelides
Venue: Artificial Intelligence Review (1999)

The complex nature of semantic video and audio content has made multimedia difficult to use within the traditional architecture of a knowledge-based intelligent tutoring system (ITS). This paper investigates how multimedia syntax and semantics may be integrated into the confines of the knowledge-based ITS architecture so as to develop a knowledge-based intelligent multimedia tutoring system (IMTS). The paper contributes a semantic content-based model that can be used for this purpose. Multimedia frames (m-frames) are used as the framework by which the syntactic and semantic information is represented within the model. The paper discusses how IMTSs may be developed using the model, and then demonstrates the use of our approach in the development of ARISTOTLE, an IMTS for teaching young children basic zoology.
Broadcast scheduling optimization for heterogeneous cluster systems
Authors: Pangfeng Liu, Tzu-Hao Sheng
Venue: Proceedings of the twelfth annual ACM symposium on Parallel algorithms and architectures (2000)

Network of workstation (NOW) is a cost-effective alternative to massively parallel supercomputers. As commercially available off-the-shelf processors become cheaper and faster, it is now possible to build a PC or workstation cluster that provides high computing power within a limited budget. However, a cluster may consist of different types of processors and this heterogeneity within a cluster complicates the design of efficient collective communication protocols. This paper shows that a simple heuristic called fastest-node-first (FNF) [3] is very effective in reducing broadcast time for heterogeneous cluster systems. Despite the fact that FNF heuristic fails to give the optimal broadcast time for a general heterogeneous network of workstation, we prove that FNF always gives the optimal broadcast time in several special cases of clusters. Based on these special case results, we show that FNF is an approximation algorithm that guarantees a competitive ratio of 2. From these theoretical results we also derive techniques to speed up the branch-and-bound search for the optimal broadcast schedule in HNOW.
Rational Krylov: A Practical Algorithm for Large Sparse Nonsymmetric Matrix Pencils
Authors: Axel Ruhe
Venue: SIAM Journal on Scientific Computing (1998)

The rational Krylov algorithm computes eigenvalues and eigenvectors of a regular not necessarily symmetric matrix pencil. It is a generalization of the shifted and inverted Arnoldi algorithm, where several factorizations with different shifts are used in one run. It computes an orthogonal basis and a small Hessenberg pencil. The eigensolution of the Hessenberg pencil approximates the solution of the original pencil. Different types of Ritz values and harmonic Ritz values are described and compared. Periodical purging of uninteresting directions reduces the size of the basis and makes it possible to compute many linearly independent eigenvectors and principal vectors of pencils with multiple eigenvalues. Relations to iterative methods are established.Results are reported for two large test examples. One is a symmetric pencil coming from a finite element approximation of a membrane; the other is a nonsymmetric matrix modeling an idealized aircraft stability problem.
A mediation infrastructure for digital library services
Authors: Sergey Melnik, Hector Garcia-Molina, Andreas Paepcke
Venue: Proceedings of the fifth ACM conference on Digital libraries (2000)

Digital library mediators allow interoperation between diverse information services. In this paper we describe a flexible and dynamic mediator infrastructure that allows mediators to be composed from a set of modules (``blades''). Each module implements a particular mediation function, such as protocol translation, query translation, or result merging. All the information used by the mediator, including the mediator logic itself, is represented by an RDF graph.We illustrate our approach using a mediation scenario involving a Dienst and a Z39.50 server, and we discuss the potential advantages and weaknesses of our framework.
Data access (tutorial session)
Authors: José A. Blakeley, Anand Deshpande
Venue: ACM SIGMOD Record (2000)

With an explosion of data on the web, consistent data access to diverse data sources has become a challenging task. In this tutorial will present topics of interest to database researchers and developers building: interoperable middle-ware, gateways, distributed heterogeneous query processors, federated databases, data source wrappers, mediators, and DBMS extensions. All of these require access to diverse information through common data access abstractions, powerful APIs, and common data exchange formats. With the emergence of the web, database applications are being run over the intranet and the extranet. This tutorial presents an overview of existing and emerging data access technologies. We will concentrate on some of the technical challenges that have to be addressed to enable uniform data access across various platforms and some of the issues that went into the design of these data access strategies.
A Value-Driven System for Autonomous Information Gathering
Authors: Joshua Grass, Shlomo Zilberstein
Venue: Journal of Intelligent Information Systems (2000)

This paper presents a system for autonomous information gathering in an information rich domain under time and monetary resource restrictions. The system gathers information using an explicit representation of the user's decision model and a database of information sources. Information gathering is performed by repeatedly selecting the query with the highest marginal value. This value is determined by the value of the information with respect to the decision being made, the responsiveness of the information source, and a given resource cost function. Finally, we compare the value-driven approach to several base-line techniques and show that the overhead of the meta-level control is made up for by the increased decision quality.
Database updates in logic programming
Authors: Shamim Naqvi, Ravi Krishnamurthy
Venue: Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems (1988)

The need for control in logic programs is now being recognized. This is particularly evident when one focuses on allowing updates in logic programs. In this paper we propose a language DatalogA which is an extension of Datalog with updates to base relations. We define some procedural constructs to allow update programs to be written in an easy manner. The (W,p) scheme of Dynamic Logic fits nicely into the semantics of DatalogA programs in which W is taken to be the set of all possible states of the program and p is the accessibility relation between states. We give declarative semantics and equivalent constructed model semantics for DatalogA programs. We show that in the absence of updates our semantics reduce to the classical semantics of Datalog. Finally, we show some examples of non-stratified programs expressed in DatalogA.
How to verify concurrent Ada programs: the application of model checking
Authors: A. Burns, A. J. Wellings
Venue: Proceedings of the ninth international workshop on Real-time Ada (1999)

Ada 95 is an expressive concurrent programming language with which it is possible to build complex multi-tasking applications. Much of the complexity of these applications stem from the interactions between the tasks. This paper argues that model checking tools are now mature enough that they can be used by engineers to verify the logical correctness of their tasking algorithms. The paper illustrates the approach by showing the correctness of an Ada implementation of the atomic action protocol.
Power optimization of system-level address buses based on software profiling
Authors: W. Fornaciari, M. Polentarutti, D. Sciuto, C. Silvano
Venue: Proceedings of the eighth international workshop on Hardware/software codesign (2000)

The paper aims at defining a methodology for the optimization of the switching power related to the processor-to memory communication on system-level buses. First, a methodology to profile the switching activity related to system-level buses has been defined, based on the tracing of benchmark programs running on the Sun SPARC V8 architecture. The bus traces have been analyzed to identify temporal correlations between consecutive patterns. Second, a framework has been set up for the design of high-performance encoder/decoder architectures to reduce the transition activity of the system-level buses. Novel bus encoding schemes have been proposed, whose performance has been compared with the most widely adopted power-oriented encodings. The experimental results have shown that the proposed encoding techniques provide an average reduction in transition activity up to 74.11% over binary encoding for instruction address streams. The results indicate the suitability of the proposed techniques for high-capacitance wide buses, for which the power saving due to the transition activity reduction is not offset by the extra power dissipation introduced in the system by the encoding/decoding logic.
Behaviour in 0 of the Neural Networks Training Cost
Authors: Cyril Goutte
Venue: Neural Processing Letters (1998)

We study the behaviour in zero of the derivatives of the cost function used when training non-linear neural networks. It is shown that a fair number of first, second and higher order derivatives vanish in zero, validating the belief that 0 is a peculiar and potentially harmful location. These calculations are related to practical and theoretical aspects of neural networks training.
A Finite Element Analysis of Optimal Variable Thickness Sheets
Authors: Joakim Petersson
Venue: SIAM Journal on Numerical Analysis (1999)

A quasi-mixed finite element (FE) method for maximum stiffness of variable thickness sheets is analyzed. The displacement is approximated with nine node Lagrange quadrilateral elements, and the thickness is approximated as elementwise constant. One is guaranteed that the FE displacement solutions will converge in $\HH$, but in an example it is shown that, in general, one cannot expect any subsequence of the FE thickness solutions to converge in any $L^p (\Omega)$-norm. However, under a regularity and biaxiality assumption on the optimal stress field, uniqueness of the optimal thickness function as well as convergence in $L^p (\Omega)$ $(1\leq p
Performance evaluation of the IBM SP and the Compaq AlphaServer SC
Authors: Patrick H. Worley
Venue: Proceedings of the 14th international conference on Supercomputing (2000)

Oak Ridge National Laboratory (ORNL) has recently installed both a Compaq AlphaServer SC and an IBM SP, each with 4-way SMP nodes, allowing a direct comparison of the two architectures. In this paper, we describe our initial evaluation. The evaluation looks at both kernel and application performance for a spectral atmospheric general circulation model, an important application for the ORNL systems.
Integrated floorplanning and interconnect planning
Authors: Hung-Ming Chen, Hai Zhou, F. Y. YOung, D. F. Wong, Hannah H. Yang, Naveed Sherwani
Venue: Proceedings of the 1999 IEEE/ACM international conference on Computer-aided design (1999)

The VLSI fabrication has entered the deep sub-micron era and communication between different components has significantly increased. Interconnect delay has become the dominant factor in total circuit delay. As a result, it is necessary to start interconnect planning as early as possible. In this paper, we propose a method to combine interconnect planning with floorplanning. Our approach is based on the Wong-Liu floorplanning algorithm. When the positions, orientations, and shapes of the cells are decided, the pin positions and routing of the interconnects are decided as well. We use a multi-stage simulated annealing approach in which different interconnect planning methods are used in different ranges of temperatures to reduce running time. A temperature adjustment scheme is designed to give smooth transitions between different stages of simulated annealing. Experimental results show that our approach performs well.
Computational Complexity of Lyapunov Stability Analysis Problems for a Class of Nonlinear Systems
Authors: Marc W. McConley, Brent D. Appleby, Munther A. Dahleh, Eric Feron
Venue: SIAM Journal on Control and Optimization (1998)

Nonlinear control systems can be stabilized by constructing control Lyapunov functions and computing the regions of state space over which such functions decrease along trajectories of the closed-loop system under an appropriate control law. This paper analyzes the computational complexity of these procedures for two classes of control Lyapunov functions. The systems considered are those which are nonlinear in only a few state variables and which may be affected by control constraints and bounded disturbances. This paper extends previous work by the authors, which develops a procedure for stability analysis for these systems whose computational complexity is exponential only in the dimension of the "nonlinear" states and polynomial in the dimension of the remaining states. The main results are illustrated by a numerical example for the case of purely quadratic control Lyapunov functions.
Diversity reception in a multihop packet radio network
Authors: Victor Wong, Cyril Leung
Venue: Mobile Networks and Applications (2000)

The performance improvement which results from the use of multiple antennas at each node in a multihop packet radio network is examined. Four transmission strategies based on three previously proposed routing schemes and one new routing scheme, MTP, are studied. It is found that the use of two antennas can improve the performance of all four transmission strategies by about 25% in a Rayleigh fading environment. The transmission strategy based on the MTP routing scheme is shown to be generally superior to those based on the other three routing schemes.
Fast Connected Components Algorithms for the EREW PRAM
Authors: David R. Karger, Noam Nisan, Michal Parnas
Venue: SIAM Journal on Computing (1999)

We present fast and efficient parallel algorithms for finding the connected components of an undirected graph. These algorithms run on the exclusive-read, exclusive-write (EREW) PRAM. On a graph with n vertices and m edges, our randomized algorithm runs in O(log n) time using $(m+n^{1+\epsilon})/\log n$ EREW processors (for any fixed $\epsilon>0$). A variant uses (m+n)/log n processors and runs in O(log n log log n) time. A deterministic version of the algorithm runs in $O(\log^{1.5}n)$ time using m+n EREW processors.
The Relationship Between Business Process Re-engineering and Internet Usage: Survey of Acute Care Hospitals in the United States
Authors: Myron Hatcher
Venue: Journal of Medical Systems (1999)

The data from a national survey of acute care hospitals was used for analysis. Hatcher discusses the complete questionnaire, data collection procedure, and sample selection.(1) The relationship between business process Re-engineering, total quality management, innovation system approaches, and internet usage and potential usage will be reported and discussed.
Injecting RBAC to secure a Web-based workflow system
Authors: Gail-Joon Ahn, Ravi Sandhu, Myong Kang, Joon Park
Venue: Proceedings of the fifth ACM workshop on Role-based access control (2000)

Web-based workflow systems have recently received much attention because they can support dynamic business processes over heterogeneous computing systems. Most existing web-based workflow systems, however, provide minimal security services such as authentication of users and network security. In this paper we describes an experiment in injecting role-based access control (RBAC) into an existing web-based workflow system. Specifically, we ensure that each task can only be executed by users belonging to a specific role. In order to achieve this, we define a simplified RBAC model to meet our needs and describe the security architecture to be applied to an existing web-based workflow system. We describe our implementation using commercial off-the-shelf (COTS) technology to demonstrate the feasibility of this approach. Our implementation uses X.509v3 certificates with role attribute, and employs a user-pull style where the client requests a client certificate from the role-server and presents it to the workflow system. A major goal of our implementation is to have minimal changes to the existing web server and no changes to the browser. We also discuss alternative architecture such as server-pull with LDAP (Lightweight Directory Access Protocol).
A methodology for performance evaluation of systems with large emulation code
Authors: Humayun Khalid
Venue: ACM SIGARCH Computer Architecture News (1999)

Emulation affects accurate performance evaluation of applications running on the present generation of computing machines. The emulation code from present generation of machines is often passed onto the traces which when used for the trace-driven performance evaluation of the next generation of architectures results in highly incorrect evaluations. The scenario captured by the trace may be real. However, one major problem associated with such a reality is that if such traces are used for future systems design, the underlying Implicit assumption will be that the emulation problem will persist with the same degree of impact. This novel paper presents the performance evaluation problem and solutions associated with a lot of computer systems executing relatively large amount of emulation code. As a case study, we have looked at the 68k emulation code problem on Apple's Macintosh computers for today's benchmarks. We have also attempted to explore the impact of the problem and alleviate it using novel techniques.