ppxscal/embedding_network huggingface dataset:
What It Will Take to Create New Internet Initiatives in Health Care
Authors: Rosemary Walker, Michael Dieter, Walter Panko, Annette Valenta
Venue: Journal of Medical Systems (2003)

Today's Internet cannot fulfill the anticipated future needs of health care organizations. To address growing administrative, clinical, and research communication networking requirements and to serve as a test bed for future technology, two separate initiatives, the Next Generation Internet (NGI&mdash;federally funded by the NIH/NLM) and Internet2 (a consortium of academic partners), are establishing project partnerships that will create new and improved opportunities for health care applications and interactions such as telemedicine, medical imaging, virtual medicine, home health care, public health, consumer medicine, medical education, and medical research, among other uses. In addition to creating and improving large-scale health care networking, it is also expected that much of the technology developed and tested for NGI/Internet2 will filter down to improve the mainstream Internet.
Design of Handover Procedures for Mobile Cellular Systems through Performance Charts
Authors: M. Ruggieri, D. Giancristofaro, F. Graziosi, F. Santucci
Venue: Wireless Personal Communications: An International Journal (1997)

The paper proposes a design approach of handover procedures for mobile cellular systems. Performance charts, where the parameters of interest in the handover procedure design are linked to system requirements, are utilized to describe and apply the proposed design methodology. The design moves from a flexible system description. The paper describes the design technique together with the underlying system model. Design examples are provided and the design effectiveness is validated through an overall system simulator.The design approach is particularly advantageous as it joins flexibility to low complexity and satisfactory design accuracy. The results that have been achieved in the validation campaign confirm the effectiveness and usefulness of the approach.
A Case Study in Embedded-System Design: The VuMan 2 Wearable Computer
Authors: Asim Smailagic, Daniel P. Siewiorek
Venue: IEEE Design Test (1993)

The development of an embedded-computer system with a visual interface is described. The authors detail the use of a target system simulator and a prototype printed circuit board (PCB), which facilitated a concurrent approach to the design of the hardware, software, and housing. They outline this codesign process and illustrate its effects with comparative data from the earlier VuMan 1 project.
Blind decision feedback equalisers, how to avoid degenerative solutions
Authors: Leszek L. Szczeciński, Ado Gei
Venue: Signal Processing (2002)

Decision feedback equalisers offer a good compromise between complexity and performance for channels with strong intersymbol interference. However, their blind or decision-directed adaptation may converge to degenerative solutions for which signal at the equaliser's output is independent of its input. The known algorithms proposed to solve this problem, are evaluated in this paper. It is shown that their main defect is a lack of well-defined criteria allowing the detection of degenerative solutions, so this paper introduces a criterion proved to be sufficient for reliable detection of such solutions. Using the new criterion, an algorithm of blind decision feedback equalisation, based on constrained optimisation, is proposed. The new algorithm does not admit degenerative solutions therefore should be preferred among the analysed algorithms. Also, the problem of false phase lock, characteristic of some modulations, is addressed and a solution to it is proposed. The results of the study are presented using the experimental data and simulation.
On the Relationship Between the Support Vector Machine for Classification and Sparsified Fisher&lsquo;s Linear Discriminant
Authors: Amnon Shashua
Venue: Neural Processing Letters (1999)

We show that the orientation and location of the separating hyperplane for 2-class supervised pattern classification obtained by the Support Vector Machine (SVM) proposed by Vapnik and his colleagues, is equivalent to the solution obtained by Fisher&lsquo;s Linear Discriminant on the set of Support Vectors. In other words, SVM can be seen as a way to &rsquo;sparsify&lsquo; Fisher&lsquo;s Linear Discriminant in order to obtain the most generalizing classification from the training set.
A complex-valued version of Nagumo--Sato model of a single neuron and its behavior
Authors: Iku Nemoto, Kei Saito
Venue: Neural Networks (2002)

The Nagumo-Sato model of a single neuron was extended so that it can handle complex numbers and the behavior of the complex-valued model was investigated. The model neuron receives its past outputs through a complex-valued weight and fires when the absolute value of the membrane potential exceeds a threshold. Some of the basic features of the model, such as associated with fixed points and period-two orbits, were derived. The main purpose of the paper is to show the model's chaotic behavior which is the result of the extension to the complex numbers and different from that of the original real-valued model. The apparently chaotic orbits were numerically shown to have positive Lyapunov exponents and high sensitivity to the initial conditions. Some of the chaotic orbits seem to be related to the saddles of period-two and their associated stable and unstable manifolds.
RPM: A Rapid Prototyping Engine for Multiprocessor Systems
Authors: Luiz André Barroso, Sasan Iman, Jaeheon Jeong, Koray Öner, Michel Dubois, Krishnan Ramamurthy
Venue: Computer (1995)

In multiprocessor systems, processing nodes contain a processor, some cache memory, and a share of the system memory, and connect through a scalable interconnection. The system memory partitions may be shared or disjoint (message passing). Within each class of systems, many architectural variations are possible. Fair comparisons among systems are difficult without a common hardware platform to implement the different architectures. RPM (Rapid Prototyping engine for Multiprocessors), a hardware emulator for the rapid prototyping of various multiprocessor architectures, provides this platform. The authors describe its architecture, performance, and prototyping methodology. Reprogrammable controllers implemented with field-programmable gate arrays emulate the target machine's hardware. The processors, memories, and interconnections are off the shelf, and their relative speeds can be modified to emulate various component technologies. The authors also compare RPM with other rapid prototyping approaches. Because emulation is orders-of-magnitude faster than simulation, an emulator can run problems with large data sets more representative of the workloads for which the target machine is designed. An emulator can also accomplish more reliable performance evaluation and design. Finally, because an emulator is a real computer with its own I/O, every emulation is an actual incarnation of the target and can run several different workloads.
The P1073 Medical Information Bus
Authors: David F. Franklin, David V. Ostler
Venue: IEEE Micro (1989)

The P1073 medical information bus (MIB) family of three proposed IEEE standards, which provide vendor-independent interconnection and interoperability of medical devices and computer systems, is described. The MIB uses a layered network architecture that is compatible with International Standards Organization/Open Systems Interconnection (ISO/OSI) specifications. The standards primarily focus on the acute care environment at the patient's bedside, particularly when this environment is in the intensive care area of the hospital. However, the MIB is suitable for use in other areas such as the operating room or the general ward. The bus can also interface to any general clinical equipment for simple data communication and control purposes.
Dismountable Media Management in Tertiary Storage Systems
Authors: Daniel A. Ford
Venue: IEEE Transactions on Knowledge and Data Engineering (1997)

We describe an adaptive algorithm for tertiary storage media mount management. This predictive longest next reference (LNR) mount management algorithm attempts to approximate the optimal page replacement policy, OPT [1], [2].
Improved CSG rendering using overlap graph subtraction sequences
Authors: Nigel Stewart, Geoff Leach, Sabu John
Venue: Proceedings of the 1st international conference on Computer graphics and interactive techniques in Australasia and South East Asia (2003)

The Sequenced Convex Subtraction (SCS) algorithm for Constructive Solid Geometry (CSG) sequentially subtracts convex volumes from the z-buffer. The performance of the algorithm is determined by the length of the subtraction sequence used. View-independent subtraction sequences are O(n2) in length. These can be reduced to O(kn) if the maximum depth complexity k, which ranges between 1 and n, is known or can be determined.We present an improvement to subtraction sequence generation which uses object space overlap information to give O(n) length sequences in the best case and (unchanged) O(n2) sequences in the worst case. The approach is based on what we term an overlap graph. We also discuss a unifying approach combining overlap graph based processing with the Sequenced Convex Subtraction (SCS) CSG rendering algorithm. Finally, we present experimental results which show performance improvements, depending on the spatial arrangements of objects.
A form of the Zermelo---von Neumann theorem under minimal assumptions
Authors: B. Csákány
Venue: Acta Cybernetica (2002)

A simple and general version of the classical result in the title is formulated and proved in the form of a proposition concerning formal languages.
Scheduler Modeling Based on the Controller Synthesis Paradigm
Authors: K. Altisen, G. Gössler, J. Sifakis
Venue: Real-Time Systems (2002)

The controller synthesis paradigm provides a general framework for scheduling real-time applications. Schedulers can be considered as controllers of the applications; they restrict their behavior so that given scheduling requirements are met. We study a modeling methodology based on the controller synthesis paradigm. The methodology allows to get a correctly scheduled system from timed models of its processes in an incremental manner, by application of composability results which simplify schedulability analysis. It consists in restricting successively the system to be scheduled by application of constraints defined from scheduling requirements. The latter are a conjunction of schedulability requirements that express timing properties of the processes and policy requirements about resource management. The presented methodology allows a unified view of scheduling theory and approaches based on timing analysis of models of real-time applications.
QUEL as a data type
Authors: Michael Stonebraker, Erika Anderson, Eric Hanson, Brad Rubenstein
Venue: ACM SIGMOD Record (1984)

This paper explores the use of commands in a query language as an abstract data type (ADT) in data base management systems Basically, an ADT facility allows new data types, such as polygons, lines, money, time, arrays of floating point numbers, bit vectors, etc, to supplement the built-in data types in a data base system. In this paper we demonstrate the power of adding a data type corresponding to commands in a query language We also propose three extensions to the query language QUEL to enhance its power in this augmented environment.
Dynamically Negotiated Resource Management for Data Intensive Application Suites
Authors: Gary J. Nutt, Scott Brandt, Adam J. Griff, Sam Siewert, Marty Humphrey, Toby Berk
Venue: IEEE Transactions on Knowledge and Data Engineering (2000)

In contemporary computers and networks of computers, various application domains are making increasing demands on the system to move data from one place to another, particularly under some form of soft real-time constraint. A brute force technique for implementing applications in this type of domain demands excessive system resources, even though the actual requirements by different parts of the application vary according to the way it is being used at the moment. A more sophisticated approach is to provide applications with the ability to dynamically adjust resource requirements according to their precise needs, as well as the availability of system resources. This paper describes a set of principles for designing systems to provide support for soft real-time applications using dynamic negotiation. Next, the execution level abstraction is introduced as a specific mechanism for implementing the principles. The utility of the principles and the execution level abstraction is then shown in the design of three resource managers that facilitate dynamic application adaptation: Gryphon, EPA/RT-PCIP, and the DQM architectures.
Satellite Image Deblurring Using Complex Wavelet Packets
Authors: André Jalobeanu, Laure Blanc-Féraud, Josiane Zerubia
Venue: International Journal of Computer Vision (2003)

The deconvolution of blurred and noisy satellite images is an ill-posed inverse problem. Direct inversion leads to unacceptable noise amplification. Usually the problem is regularized during the inversion process. Recently, new approaches have been proposed, in which a rough deconvolution is followed by noise filtering in the wavelet transform domain. Herein, we have developed this second solution, by thresholding the coefficients of a new complex wavelet packet transform&semi; all the parameters are automatically estimated. The use of complex wavelet packets enables translational invariance and improves directional selectivity, while remaining of complexity O(N). A new hybrid thresholding technique leads to high quality results, which exhibit both correctly restored textures and a high SNR in homogeneous areas. Compared to previous algorithms, the proposed method is faster, rotationally invariant and better takes into account the directions of the details and textures of the image, improving restoration. The images deconvolved in this way can be used as they are (the restoration step proposed here can be inserted directly in the acquisition chain), and they can also provide a starting point for an adaptive regularization method, enabling one to obtain sharper edges.
Real-time gaseous phenomena: a phenomenological approach to interactive smoke and steam
Authors: Thorsten Holtkämper
Venue: Proceedings of the 2nd international conference on Computer graphics, virtual Reality, visualisation and interaction in Africa (2003)

In this paper we present a novel approach to the simulation of interactive gaseous phenomena. Our main emphasis is put on real-time simulation and the visual correct interaction of the gas with inserted objects. In contrast to methods based on the numerical solution of physics-based models, such as Navier Stokes or Euler equations, we propose a phenomenological approach in which we combine the speed and flexibility of particle simulations with the visual quality of stochastic fractals. This approach especially meets the requirements of interactive simulations as they are found in virtual reality environments.
A Pipeline N-Way Join Algorithm Based on the 2-Way Semijoin Program
Authors: N. Roussopoulos, H. Kang
Venue: IEEE Transactions on Knowledge and Data Engineering (1991)

The semijoin has been used as an effective operator in reducing data transmission and processing over a network that allows forward size reduction of relations and intermediate results generated during the processing of a distributed query. The authors propose a relational operator, two-way semijoin, which enhanced the semijoin with backward size reduction capability for more cost-effective query processing. A pipeline N-way join algorithm for joining the reduced relations residing on N sites is introduced. The main advantage of this algorithm is that it eliminates the need for transferring and storing intermediate results among the sites. A set of experiments showing that the proposed algorithm outperforms all known conventional join algorithms that generate intermediate results is included.
Dependability and Performance Measures for the Database Practitioner
Authors: Toby J. Teorey, Wee Teck Ng
Venue: IEEE Transactions on Knowledge and Data Engineering (1998)

We estimate the availability, reliability, and mean transaction time (response time) for repairable database configurations, centralized or distributed, in which each service component is continuously available for repair. Reliability, the probability that the entire transaction can execute properly without failure, is computed as a function of mean time to failure (MTTF) and mean time to repair (MTTR). Mean transaction time in the system is a function of the mean service delay time for the transaction over all components, plus restart delays due to component failures, plus queuing delays for contention. These estimates are potentially applicable to more generalized distributed systems.
Extending Unix for Scalable Computing
Authors: E. P. DeBenedictis, S. C. Johnson
Venue: Computer (1993)

Because it retrieves all instructions and data from a single memory, the von Neumann computer architecture has a fundamental speed limit. The scalable multicomputer architecture, which uses many microprocessors together to solve a single problem and can run at teraflop speeds, may be a solution. While teraflop processor technology is known, the scalable operating and I/O system technology necessary for those speeds are not known. The authors describe how Unix can be extended to scalable computing, permitting teraflop speeds and offering parallel computing to users unfamiliar with parallel programming. They designed this technology into the system software of the Ncube-2, the predecessor to Ncube's announced teraflop parallel computer. The authors describe the system in detail and provide some performance results.
Temporal Reference Algorithms versus Spatial Reference Algorithms forSmart Antennas
Authors: Josef Fuhl, Ernst Bonek
Venue: Wireless Personal Communications: An International Journal (1999)

This paper compares algorithms from three different classes of adaptation schemes for smart antennas &ndash; the switched beam approach, a Temporal-Reference (TR) technique based on Direct Matrix Inversion or Least Squares adaptation, and a Spatial-Reference (SR) technique with direction finding by Unitary ESPRIT.The simulations are based on a channel model including directions of arrival (DOA) and flat Rayleigh fading. The fading signal is spread out in angle over several degrees dependent on the distance of the mobile from the base station. The results indicate that, in the uplink, TR algorithms and SR algorithms perform equally well, given perfect synchronization and successful user identification (for SR algorithms). TR algorithms are the most robust against close-by interference. For a Uniform Linear Array (ULA) with M=8 elements and an element spacing ofd equal to half a wavelength, they are able to separate two co-channel users that are as close as 5 degrees in angle. For an angular threshold as low as 10&deg; an 8-element ULA is also sufficient to obtain nearly the same BER performance as for a single user.As concerns SR algorithms, we demonstrate their applicability to situations where no discrete DOAs exist, as it is the case in mobile communications. Mutual coupling of individual antenna elements increases the BER by an order of magnitude for the switched beam approach and for SR algorithms, in contrast to TR algorithms, where the influence of mutual coupling on the BER is negligible.
Selection of Indexes to Memory-Resident Entities for Semantic Data
Authors: G. E. Weddell
Venue: IEEE Transactions on Knowledge and Data Engineering (1989)

A variation of the index selection problem for an extended relational model when all encoding of information is memory resident is discussed. The data model is the relational model extended in two ways that are common with semantic data models. One consequence of memory residence is that the search space of possible indexes is enlarged to the extent that previous methods requiring some consideration of each possibility are no longer possible. An instance of the index selection problem that includes a set of partial match queries in addition to the input schema is given. It is assumed that the set is determined by an initial phase of query optimization when applied to a fixed set of more general forms of queries that characterize the way in which information is accessed for an application. An initial choice of indexes is made, only considering their suitability for answering the partial match queries.
Developing the WTL3170/3171 Sparc Floating-Point Coprocessors
Authors: Mark Birman, Allen Samuels, George Chu, Ting Chuk, Larry Hu, John McLeod, John Barnes
Venue: IEEE Micro (1990)

The development of the first two members in a family of scalable-processor-architecture (Sparc)-compatible parts is described. With varying frequency and latency performance, the chips work with the first two integer unit (IU) implementations from other Sparc vendors. These are the first Sparc chips to integrate all floating-point controller functions, floating-point register files, and 64-b ALU (arithmetic and logic unit), multiplier, and divide/square-root units in one die. A strong relationship with original equipment manufacturers in system behavioral-level modeling and a short time to production were key factors in the product development plan. Implementation goals, bus organization, overall processor operation, and the operation of the ALU, multiplier, and divide/square-root units are discussed.
Protecting and Managing Electronic Content with a Digital Battery
Authors: Timothy A. Budd
Venue: Computer (2001)

The traditional system of rights, royalties, and limits on reproduction of intellectual property has worked for books, records, motion pictures, and other physical media largely because of the difficulty and expense that reproducing them entailed. Currently, Napster, Gnutella, and other peer-to-peer sharing services have stretched if not broken this model, posing such a dire financial threat to content providers that the Recording Industry Association of America and five recording companies recently brought suit against Napster. If a consumer can duplicate a digital artifact and share it with a friend, the producer loses any profit from the duplicated artifact and any way to measure the duplicated item's relative popularity. Without a revenue stream or a means for measuring popularity, a producer cannot offer artists appropriate remuneration. Without payment, artists have little incentive for creating new work. Fortunately, technology--which helped create this problem--can also provide its solution. A digital library can protect intellectual properties by making unauthorized duplication impossible or at least extremely difficult, tracking each use of a given work while ensuring the user's anonymity, and allowing itself to be implemented inexpensively while remaining transparent to the consumer. The digital battery's best chance for success stems from its theoretical ease of use, ubiquity, and low cost. As Napster has shown, consumers have few qualms about using pirated artifacts. Nor does guilt over the economic plight of artists appear to create a compelling obstacle to unauthorized copying. If, however, systems that incorporate digital batteries can provide consumers with access to items they desire, and do so in a way that's not overly intrusive, there may yet be hope for rescuing industries that depend on digital content.