ppxscal/embedding_network huggingface dataset:
Realizing the V80 and its System Support Functions
Authors: Hiraoki Kaneko, Nariko Suzuki, Hiroshi Wabuka, Koji Maemura
Venue: IEEE Micro (1990)

An overview is given of the architecture of an overall design considerations for the 11-unit, 32-b V80 microprocessor, which includes two 1-kB cache memories and a branch prediction mechanism that is a new feature for microprocessors. The V80's pipeline processing and system support functions for multiprocessor and high-reliability systems are discussed. Using V80 support functions, multiprocessor and high-reliability systems were realized without any performance drop. Cache memories and a branch prediction mechanism were used to improve pipeline processing. Various hardware facilities replaced the usual microprogram to ensure high performance.
Mobility support in unified communication networks
Authors: Helen J. Wang, Randy H. Katz
Venue: Proceedings of the 4th ACM international workshop on Wireless mobile multimedia (2001)

Rapid advances in communication networks and device technologies have enabled people with powerful means of communications. It is common for any individual to be associated with a number of heterogeneous communication devices (such as phones, pagers, PDAs) or a variety of applications (such as e-mail, instant messaging, or chat-rooms). This phenomenon has spurred a great demand for unifie dcommunication [20] services which integrate one's various communication mechanisms in a meaningful and seamless fashion. To meet this demand, the research community and communication industry are experimenting and building Internet-based, unified communication network systems (UCN) in which heterogeneous devices are unified for individuals and access networks are linked together through a core IP network. In this paper, we investigate the mobility issues in UCN systems. We discuss traditional mobility problems such as personal mobility and terminal mobility in the new UCN context, and present our design, analysis, and implementation of a new form of mobility in UCNs, service mobility [12] where active services can be retained across heterogeneous devices and networks.
Retrieving Similar Shapes Effectively and Efficiently
Authors: Kian-Lee Tan, Beng Chin Ooi, Lay Foo Thiang
Venue: Multimedia Tools and Applications (2003)

In this paper, we address the following problem: given a large collection of shapes and a query shape, retrieve all shapes (from the shape database) that are similar to the query shape. A generalized centroid-radii model is used to model all forms of shapes &mdash; convex shapes, concave shapes and shapes with &ldquo;holes&rdquo;. Under the model, a shape is represented by a set of vectors, each obtained from the radii emanating from the centroid of a virtual concentric ring.The model can also facilitate multi-resolution and similarity retrievals. Furthermore, using the model, the shape of an object can be transformed into a point in a high dimensional data space. To speed up the retrieval of similar shapes, we also propose a multi-level R-tree index, called the Nested R-trees (NR-trees). Unlike traditional high-dimensional index structures that index a high-dimensional point as it is (with its full dimension), the NR-trees splits the dimensionality of the point into a set of lower dimensions that are indexed by levels of the NR-trees. We also proposed a quick filtering mechanism to further prune the search space.We implemented a shape retrieval system that employs the generalized centroid-radii model and the NR-trees with the filtering mechanism. Our experimental study shows the effectiveness of the proposed shape model, and the efficiency of the NR-trees. The results also show that the filtering mechanism can significantly reduce the retrieval time.
Learning Subsequential Transducers for Pattern Recognition Interpretation Tasks
Authors: J. Oncina, P. García, E. Vidal
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1993)

A formalization of the transducer learning problem and an effective and efficient method for the inductive learning of an important class of transducers, the class of subsequential transducers, are presented. The capabilities of subsequential transductions are illustrated through a series of experiments that also show the high effectiveness of the proposed learning method in obtaining very accurate and compact transducers for the corresponding tasks.
Internet Pharmacy: Issues of Access, Quality, Costs, and Regulation
Authors: Stephanie Y. Crawford
Venue: Journal of Medical Systems (2003)

Internet pharmacy has been the focus of heightened interest over the past 3 years since the first major Web site was introduced in the United States. This paper addresses issues pertaining to Internet pharmacies that sell prescriptions and other products to consumers at the retail level. The Internet pharmacy industry has shifted rapidly in the short time span. This paper begins with a summary of historical considerations and the shifting organization of Internet pharmacy. The advantages and disadvantages of online pharmacy practice are listed. Issues of access, quality, and cost are described. The challenges in regulation at the state and federal levels are presented. Advice to consumers is offered regarding the use of Internet pharmacy sites for purchasing prescription drug products.
Perfusion MR Imaging with pulsed arterial spin-labeling: basic priciples and applications in functional brain imaging
Authors: Yihong Yang
Venue: Concepts in Magnetic Resonance: an Educational Journal (2002)

Basic principles of the arterial spin-labeling perfusion MRI are described, with focus on a brain perfusion model with pulsed labeling. A multislice perfusion imaging sequence with adiabatic inversion and spiral scanning is illustrated as an example. The mechanism of the perfusion measurement, the quantification of cerebral blood flow, and the suppression of potential artifacts are discussed. Applications of the perfusion imaging in brain activation studies, including simultaneous detection of blood flow and blood oxygenation, are demonstrated. Important issues associated with the applications such as sensitivity, quantification, and temporal resolution are discussed.
A Low-Cost High-Capacity Associative Memory Design Using Cellular Automata
Authors: I. Sen Gupta, D. Roy Chowdhury, P. Pal Chaudhuri
Venue: IEEE Transactions on Computers (1995)

The present paper reports a novel scheme for designing fast retrieval memory system using cellular automata. In essence, the proposed scheme implements the concept of hashing in hardware. This makes possible the design of low-cost high-capacity memory systems with limited content addressability as an option. The efficiency of the scheme has been verified through extensive simulation studies of the hardwired hashing function built around 1D and 2D linear cellular automata (CA).
Hardware Monitoring of a Multiprocessor System
Authors: An-Chi Liu, Ranjani Parthasarathi
Venue: IEEE Micro (1989)

The Testbed for Distributed Processing, or Ted, consists of Intel Corp.'s iSBC 8086 single board computers (SBCs) organized into groups or clusters. Each cluster consists of several SBCs that communicate via a shared memory. Intercluster communication occurs through an Ethernet interface. A hardware monitor designed and implemented to handle the monitoring activities within a cluster in the Ted system is described. By using specified patterns and don't-care masks, the system can detect accesses to selected data, addresses, or blocks of addresses. This function helps monitor events such as the access or usage of a memory location or a group of mailbox addresses. It also determines the amount of time consumed by the performance of specific operations.
Improved Yield Models for Fault-Tolerant Memory Chips
Authors: C. H. Stapper
Venue: IEEE Transactions on Computers (1993)

Several improvements in the method of yield modeling for memory chips with redundancy are described. First, a direct method of translating defect-monitor data to memory-chip fault eliminates the need for yield-model formulas. This makes possible the accurate modeling of the faults that can be fixed with redundant circuits or other fault-tolerance techniques. A second improvement results from the use of separate frequency distributions for different failure mechanisms instead of the multivariate distributions used until now. The yields of array islands with their own redundant word and bit lines are combined using a new yield formula. Examples of the use of this technique for dynamic-random-access-memory (DRAM) chips are given. A simplified pragmatic approximation technique that appears to be in good agreement with experimental data is also discussed.
Parallel performance prediction using lost cycles analysis
Authors: Mark E. Crovella, Thomas J. LeBlanc
Venue: Proceedings of the 1994 ACM/IEEE conference on Supercomputing (1994)

Most performance debugging and tuning of parallel programs is based on the "measure-modify" approach, which is heavily dependent on detailed measurements of programs during execution. This approach is extremely time-consuming and does not lend itself to predicting performance under varying conditions. Analytic modeling and scalability analysis provide predictive power, but are not widely used in practice, due primarily to their emphasis on asymptotic behavior and the difficulty of developing accurate models that work for real-world programs. In this paper we describe a set of tools for performance tuning of parallel programs that bridges this gap between measurement and modeling.Our approach is based on lost cycles analysis, which involves measurement and modeling of all sources of overhead in a parallel program. We first describe a tool for measuring overheads in parallel programs that we have incorporated into the runtime environment for Fortran programs on the Kendall Square KSR1. We then describe a tool that fits these overhead measurements to analytic forms. We illustrate the use of these tools by analyzing the performance tradeoffs among parallel implementations of 2D FFT. These examples show how our tools enable programmers to develop accurate performance models of parallel applications without requiring extensive performance modeling expertise.
Molecular beam epitaxy growth mechanism and wire width control for formation of dense networks of narrow InGaAs quantum wires
Authors: Chao Jiang, Tsutomu Muranaka, Hideki Hasegawa
Venue: Microelectronic Engineering (2002)

Precise wire width control is important in forming dense networks of narrow InGaAs ridge quantum wires (QWRs) by selective MBE growth on patterned InP substrates. In this paper, SEM, TEM, AFM, CL and PL measurements were carried out to clarify the QWR formation mechanism and to establish the method of wire width control. Formation of the arrow-head shaped QWR is due to evolution of (114)A facets caused by instability of (113)A facets during growth of the InAlAs layer. From PL peak energy positions, it has been found that the effective wire width can be controlled by precisely adjusting the growth time, or the grown thickness of the lower InAlAs layer.
Distributed Coordination Models for Client/Server Computing
Authors: Richard M. Adler
Venue: Computer (1995)

Interactions between distributed applications presuppose an underlying control model to coordinate information exchanges and networking software to implement that model. The client/server control model defines distributed interactions in terms of one program requesting and obtaining a service from a second, possibly remote, application. However, this basic model provides inadequate design support when clients need to invoke multiple, independent services, coordinated to reflect how those services interrelate and contribute to the overall application. The author describes extensions to the basic client/ server model that explicitly address one-to-many client/ server interactions by discussing three basic design issues: how multiple services are requested, how those services are managed, and how clients receive responses. The extended coordination models provide support for locating, obtaining, and synchronizing services, as well as for collecting and combining results from multiple servers in a manner that is transparent to clients. Extended models include a scripting engine for managing data and temporal dependencies among services; a basic request broker for mediating client access to distributed services; and extended request broker models that decompose composite services, manage redundant servers, and replicate messages to logical server groups. These coordination models were designed as generic, programmable control services. The control services are interoperable, so they can be combined like building blocks to match application-specific coordination requirements. The one-to-many coordination services are layered on top of an object-oriented, message-passing communication substrate, which transparently manages the complexities of interprogram interactions across networks of heterogeneous computers. This layered architecture lets complex coordination behaviors be modeled and executed external to application elements. It accomplishes this through high-level application programming interface (API) calls. The resulting partitioning of application and generic distributed behaviors yields improved modularity, maintainability, and extensibility of individual clients and servers.
Making Reuse Cost-Effective
Authors: Bruce H. Barnes, Terry B. Bollinger
Venue: IEEE Software (1991)

Until reuse is better understood, significant reductions in the cost of building large systems will not be possible. This assertion is based primarily on the belief that the defining characteristic of good reuse is not the reuse of software per se, but the reuse of human problem solving. Analytical approaches for making good reuse investments are suggested in terms of increasing a quality-of-investment measure, Q, which is simply the ratio of reuse benefits to reuse investments. The first strategy for increasing Q is to increase the level of consumer reuse. The second technique for increasing Q is to reduce the average cost of reusing work products by making them easy and inexpensive to reuse. The third strategy is to reduce investment costs. Reuse strategies, and reuse and parameterizations, are discussed.
Performance Analysis of Distributed Deadlock Detection Algorithms
Authors: Soojung Lee, Junguk L. Kim
Venue: IEEE Transactions on Knowledge and Data Engineering (2001)

This paper presents a probabilistic performance analysis of a deadlock detection algorithm in distributed systems. Although there has been extensive study on deadlock detection algorithms in distributed systems, little attention has been paid to the study of the performance of these algorithms. Most work on performance study has been achieved through simulation but not through an analytic model. Min [14], to the best of our knowledge, made the sole attempt to evaluate the performance of distributed deadlock detection algorithms analytically. Being different from Min's [14], our analytic approach takes the time-dependent behavior of each process into consideration rather than simply taking the mean-value estimation. Furthermore, the relation among the times when deadlocked processes become blocked is studied, which enhances the accuracy of the analysis. We measure performance metrics such as duration of deadlock, the number of algorithm invocations, and the mean waiting time of a blocked process. It is shown that the analytic estimates are nearly consistent with simulation results.
Implementability of Liouville Evolution, Koopman and Banach-Lamperti Theorems in Classical and Quantum Dynamics
Authors: I. Antoniou, W. A. Majewski, Z. Suchanecki
Venue: Open Systems Information Dynamics (2002)

We extend the concept of implementability of semigroups of evolution operators associated with dynamical systems to quantum case. We show that such an extension can be properly formulated in terms of Jordan morphisms and isometries on non-commutative Lp spaces. We focus our attention on a non-commutative analog of the Banach-Lamperti theorem.
A Fourth Order Scheme for Incompressible Boussinesq Equations
Authors: Jian-Guo Liu, Cheng Wang, Hans Johnston
Venue: Journal of Scientific Computing (2003)

A fourth order finite difference method is presented for the 2D unsteady viscous incompressible Boussinesq equations in vorticity-stream function formulation. The method is especially suitable for moderate to large Reynolds number flows. The momentum equation is discretized by a compact fourth order scheme with the no-slip boundary condition enforced using a local vorticity boundary condition. Fourth order long-stencil discretizations are used for the temperature transport equation with one-sided extrapolation applied near the boundary. The time stepping scheme for both equations is classical fourth order Runge&ndash;Kutta. The method is highly efficient. The main computation consists of the solution of two Poisson-like equations at each Runge&ndash;Kutta time stage for which standard FFT based fast Poisson solvers are used. An example of Lorenz flow is presented, in which the full fourth order accuracy is checked. The numerical simulation of a strong shear flow induced by a temperature jump, is resolved by two perfectly matching resolutions. Additionally, we present benchmark quality simulations of a differentially-heated cavity problem. This flow was the focus of a special session at the first MIT conference on Computational Fluid and Solid Mechanics in June 2001.
Graph partition into paths containing specified vertices
Authors: Ken-ichi Kawarabayashi
Venue: Discrete Mathematics (2002)

For a graph G, let σ2(G) denote the minimum degree sum of a pair of nonadjacent vertices. Suppose G is a graph of order n. Enomoto and Ota (J. Graph Theory 34 (2000) 163-169) conjectured that, if a partition n = Σi=1k ai is given and σ2(G) Ge; n + k - 1, then for any k distinct vertices υ1,...,υk, G can be decomposed into vertex-disjoint paths P1..., Pk such that |V(Pi)| = ai and υi is an endvertex of Pi. Enomoto and Ota (J. Graph Theory 34 (2000) 163) verified the conjecture for the case where all ai ≤ 5, and the case where k ≤ 3. In this paper, we prove the following theorem, with a stronger assumption of the conjecture. Suppose G is a graph of order n. If a partition n = Σi=1k ai is given and σ2 (G) ≥ Σi=1k max(?? 4/3ai ??, ai + 1) - 1, then for any k distinct vertices υ1,...,υk G can be decomposed into vertex-disjoint paths p1...,Pk such that |V(Pi)| =ai and υi is an endvertex of Pi for all i. This theorem implies that the conjecture is true for the case where all ai ≤ 5 which was proved in (J. Graph Theory 34 (2000) 163-169).
Concurrency Control in B-Trees with Batch Updates
Authors: Kerttu Pollari-Malmi, Eljas Soisalon-Soininen, Tatu Ylönen
Venue: IEEE Transactions on Knowledge and Data Engineering (1996)

In many applications it is important to be able to insert (or delete) keys into a B-tree as a batch, instead of inserting them one by one. Moreover, it may be necessary to search the B-tree concurrently with the batch update. An example of this is a text database system supporting a newspaper house: All words (keys) of each article obtained from a news agency should be inserted at once, and, at the same time, searches for documents containing certain words should be allowed as efficiently as possible. We have designed two solutions to the problem of concurrent batch update. The first solution¿implemented in our commercial text database system¿optimizes the speed of the batch update, and the second solution optimizes the average search time during the batch update.
A characterization of i-excellent trees
Authors: Teresa W. Haynes, Michael A. Henning
Venue: Discrete Mathematics (2002)

The independent domination number of a graph G, denoted i(G), is the minimum cardinality of a maximal independent set of G. A maximal independent set of cardinality i(G) in G we call an i(G)-set. The graph G is called i-excellent if every vertex of G belongs to some i(G)-set. We provide a constructive characterization of i-excellent trees.
The Macintosh Programmer's Workshop
Authors: Richard J. Meyers, Jeff W. Parrish
Venue: IEEE Software (1988)

The authors discuss the Macintosh Programmer's Workshop (MPW), a Macintosh development environment that includes a comprehensive set of programming tools and handles several languages. It also combines the graphical interface common to all Macintosh applications, a command language similar to the Unix shell languages, and Smalltalk's immediate execution of commands in any window. They focus on the program-development environment rather than on the tools in that environment. They give the history of MPW, and describe its design goals. The bulk of the article is a discussion of MPW's design.
Product-forms from a CAT and DOG
Authors: Peter G. Harrison
Venue: ACM SIGMETRICS Performance Evaluation Review (2002)

The equilibrium state space probabilities of a stationary Markov chain can be obtained immediately from its reversed process. There are two main steps in the derivation of product-form solutions for multi-dimensional Markov chains using this approach. First, the reversed process must be determined. This is achieved for a wide class of cooperating processes using a compound agent theorem (CAT), a compositional result from Markovian Process Algebra (MPA). Secondly, a path to each state must be found from some specified reference state. This is usually obtained in a simple way by considering the components of the state in order of dimension, e.g. in a dimension-ordered graphical (DOG) representation. In this note, the main results for reversing a stationary compound Markov process, under appropriate conditions, are given and applied to deriving product-forms. No balance equations are solved.
Robust estimators of the mode and skewness of continuous data
Authors: David R. Bickel
Venue: Computational Statistics Data Analysis (2002)

Measures of location based on the shortest half sample, including the shorth and the location of the least median of squares, are more robust than the median to outliers, but less robust to contamination near the location. Although such measures can estimate the mode, the proposed estimator of the mode, based on densest half ranges, has a much lower bias while having similar robustness. Like the median, this mode estimator has the highest breakdown point possible: the estimator has meaning if less than half the sample consists of outliers. The mode is more robust than the median in that the mode estimates are unaffected by outliers, whereas the median is influenced by each outlier. Robustness in this sense is quantified by the rejection point, the largest absolute value that is not rejected, which is low for the mode but infinite for the median. Even though the median is changed less by contamination near the location than is the mode, outliers generally pose more of a problem to estimation than contamination near the location, so the mode is more robust for data that may have a large number of outliers. A robust estimator of skewness is based on this mode estimator.