ppxscal/embedding_network huggingface dataset:
Rate-based versus queue-based models of congestion control
Authors: Supratim Deb, R. Srikant
Venue: Proceedings of the joint international conference on Measurement and modeling of computer systems (2004)

Mathematical models of congestion control capture the congestion indication mechanism at the router in two different ways: rate-based models, where the queue-length at the router does not explicitly appear in the model, and queue-based models, where the queue length at the router is explicitly a part of the model. Even though most congestion indication mechanisms use the queue length to compute the packet marking or dropping probability to indicate congestion, we argue that, depending upon the choice of the parameters of the AQM scheme, one would obtain a rate-based model or a rate-and-queue-based model as the deterministic limit of a stochastic system with a large number of users. We also consider the impact of implementing AQM schemes in the real queue or a virtual queue. If an AQM scheme is implemented in a real queue, we show that, to ensure that the queuing delays are negligible compared to RTTs, one is forced to choose the parameters of a AQM scheme in a manner which yields a rate-based deterministic model. On the other hand, if the AQM scheme is implemented in a virtual queue, small-queue operation is achieved independent of the choice of the parameters, thus showing a robustness property of virtual queue-based schemes.
Ternary Galois Field Expansions for Reversible Logic and Kronecker Decision Diagrams for Ternary GFSOP Minimization
Venue: Proceedings of the 34th International Symposium on Multiple-Valued Logic (2004)

Ternary Galois Field Sum of Products(TGFSOP) expressions are found to be good choicefor ternary reversible, and especially quantum, logicdesign. In this paper, we propose 16 Ternary GaloisField Expansions (TGFE) and introduce threeTernary Galois Field Decision Diagrams (TGFDD)using the proposed TGFEs, which are useful forreversible and quantum logic design. We alsopropose a heuristic for creating TGFDDs and amethod for flattening the TGFDDs for determiningTGFSOP expressions. We provide experimentalresults to show the effectiveness of the developedmethods.
A case study on applying formal methods to medical devices: computer-aided resuscitation algorithm
Authors: Raoul Praful Jetley, Cohan Carlos, S. Purushothaman Iyer
Venue: International Journal on Software Tools for Technology Transfer (STTT) (2004)

The design and functional complexity of medical devices have increased during the past 50 years, evolving from the use of a metronome circuit for the initial cardiac pacemaker to functions that include electrocardiogram analysis, laser surgery, and intravenous delivery systems that adjust dosage based on patient feedback. As device functionality becomes more intricate, concerns arise regarding efficacy, safety, and reliability. It thus becomes imperative to adopt a standard or methodology to ensure that the possibility of any defect or malfunction in these devices is minimized. It is with these facts in view that regulatory bodies are interested in investigating mechanisms to certify safety-crictical medical devices. These organizations advocate the use of formal methods techniques to evaluate safety-critical medical systems. However, the use of formal methods is keenly debated, with most manufacturers claiming that they are arduous and time consuming.In this paper we describe our experience in analyzing the requirements documents for the computer-aided resuscitation algorithm (CARA) designed by the Resuscitative Unit of the Walter Reed Army Institute of Research (WRAIR). We present our observations from two different angles &#x2013; that of a nonbeliever in formal methods and that of a practitioner of formal methods. For the former we catalog the effort required by a novice user of formal methods tools to carry out an analysis of the requirements documents. For the latter we address issues related to choice of designs, errors in discovered requirements, and the tool support available for analyzing requirements .
Interesting Applications of Atmel AVR Microcontrollers
Authors: Stanislav Korbel, Vlastimil Janes
Venue: Proceedings of the Digital System Design, EUROMICRO Systems (2004)

The paper describes a design of a microcode-controlled state machine and its software implementation in the Atmel AVR microcontrollers. In particular, the microcontrollers ATmega103 and ATmega128 are used. This design is closely related to a software implementation of a simulator in AVR microcontrollers. This simulator communicates with the designed state machine and presents a complete design environment for microcode development and debugging. Both of these devices can be interconnected by a flat cable and linked to a computer through a serial or USB interface. Both devices share the control software that allows us to create and edit microprograms and to control the whole state machine. It is possible to start, cancel or step through the execution of microprograms. The operator can observe the current state of the state machine, too. The second part of the control software enables the operator to create and compile simulating programs. The control software communicates with both devices using commands. All the results of this communication are well arranged in dialog boxes and windows.
A formal model for reasoning about adaptive QoS-enabled middleware
Authors: Nalini Venkatasubramanian, Carolyn Talcott, Gul A. Agha
Venue: ACM Transactions on Software Engineering and Methodology (TOSEM) (2004)

Systems that provide distributed multimedia services are subject to constant evolution; customizable middleware is required to effectively manage this change. Middleware services for resource management execute concurrently with each other, and with application activities, and can, therefore, potentially interfere with each other. To ensure cost-effective QoS in distributed multimedia systems, safe composability of resource management services is essential. In this article, we present a meta-architectural framework, the Two-Level Actor Model (TLAM) for customizable QoS-based middleware, based on the actor model of concurrent active objects. Using TLAM, a semantic model for specifying and reasoning about components of open distributed systems, we show how a QoS brokerage service can be used to coordinate multimedia resource management services in a safe, flexible, and efficient manner. In particular, we show a system in which the multimedia actor behaviors satisfy the specified requirements and provide the required multimedia service. The behavior specification leaves open the possibility of a variety of algorithms for resource management. Furthermore, constraints are identified that are sufficient to guarantee noninterference among the multiple broker resource management services, as well as providing guidelines for the safe composition of additional services.
On the mean value of m-th power free numbers
Authors: Yao Weili
Venue: Smarandache Notions Journal (2004)

A positive integer n is called m-th power free number if it can not be divided by m-th power of each prime. The main purpose of this paper is to give a k-th power mean value formula for the m-th power free numbers.
On the 57-th Smarandache's problem
Authors: Liu Huaning, Zhang Wenpeng
Venue: Smarandache Notions Journal (2004)

For any positive integer n, let r be the positive integer such that: the set {1, 2, ..., r} can be partitioned into n classes such that no class contains integers x, y, z with xy = z. In this paper, we use the elementary methods to give a sharp lower bound estimate for r.
Fast algorithms for time series with applications to finance, physics, music, biology, and other suspects
Authors: Alberto Lerner, Dennis Shasha, Zhihua Wang, Xiaojian Zhao, Yunyue Zhu
Venue: Proceedings of the 2004 ACM SIGMOD international conference on Management of data (2004)

Financial time series streams are watched closely by millions of traders. What exactly do they look for and how can we help them do it faster? Physicists study the time series emerging from their sensors. The same question holds for them. Musicians produce time series. Consumers may want to compare them. This tutorial presents techniques and case studies for four problems:1. Finding sliding window correlations in financial, physical, and other applications.2. Discovering bursts in large sensor data of gamma rays.3. Matching hums to recorded music, even when people don't hum well.4. Maintaining and manipulating time-ordered data in a database setting.This tutorial draws mostly from the book High Performance Discovery in Time Series: techniques and case studies, Springer-Verlag 2004. You can find the power point slides for this tutorial at http://cs.nyu.edu/cs/faculty/shasha/papers/sigmod04.ppt.The tutorial is aimed at researchers in streams, data mining, and scientific computing. Its applications should interest anyone who works with scientists or financial "quants." The emphasis will be on recent results and open problems. This is a ripe area for further advance.
A Survey on Software Components Search and Retrieval
Authors: Daniel Lucredio, Antonio Francisco do Prado, Eduardo Santana de Almeida
Venue: Proceedings of the 30th EUROMICRO Conference (2004)

In the literature, several works that explore component search may be found, since the decade of 90 until today. Current research on component-based software engineering (CBSE) point to the creation of component markets, which allow reuse to occur at large scale. Although search mechanisms play a very important role in such markets, the literature is quite poor in putting these two concerns together. This paper presents a survey about the main research on component search, and discusses how should be a mechanism to efficiently search components, in order to offer support for future component markets.
DCAS is not a silver bullet for nonblocking algorithm design
Authors: Simon Doherty, David L. Detlefs, Lindsay Groves, Christine H. Flood, Victor Luchangco, Paul A. Martin, Mark Moir, Nir Shavit, Guy L. Steele,  Jr.
Venue: Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures (2004)

Despite years of research, the design of efficient nonblocking algorithms remains difficult. A key reason is that current shared-memory multiprocessor architectures support only single-location synchronisation primitives such as compare-and-swap (CAS) and load-linked/store-conditional (LL/SC). Recently researchers have investigated the utility of double-compare-and-swap (DCAS)--a generalisation of CAS that supports atomic access to two memory locations -- in overcoming these problems. We summarise recent research in this direction and present a detailed case study concerning a previously published nonblocking DCAS-based double-ended queue implementation. Our summary and case study clearly show that DCAS does not provide a silver bullet for nonblocking synchronisation. That is, it does not make the design and verification of even mundane nonblocking data structures with desirable properties easy. Therefore, our position is that while slightly more powerful synchronisation primitives can ave a profound effect on ease of algorithm design and verification, DCAS does not provide sufficient additional power over CAS to justify supporting it in hardware.
Partially effective randomization in simulations between arbitrary and common PRAMs
Authors: Toshiyuki Fujiwara, Kazuo Iwama, Chuzo Iwamoto
Venue: Journal of Parallel and Distributed Computing (2004)

It is known that Θ(log n/log log n) steps are needed to simulate one step of ARBITRARY CRCW PRAMs by COMMON CRCW PRAMs, but it was open whether there is a faster simulation when randomization is allowed. This paper gives both positive and negative answers. (i) It is shown that one step of ARBITRARY can be simulated by O(log m/k(log log m-log k) + log log n) steps on randomized COMMON with error-rate n-c, where m = n/k is the number of different memory cells into which at least one processor of the simulated PRAM attempts to write. The deterministic Θ(log n/log log n)-step simulation does not become faster for smaller m, while our randomized simulation becomes O(log log n) when m≤n log log n/log n. (ii) It is shown that when m = n, Ω(log n/log log n) steps are needed to simulate one step of ARBITRARY by COMMON even if randomization is allowed. This lower-bound result needs some assumption on processor communication but it strongly suggests randomization does not help when m is small.
Structured modeling group support systems: a product design theory
Authors: Kenneth R. Walsh, Michael H. Dickey
Venue: Information and Management (2004)

Structured modeling is critical to the design, development, and implementation of many systems including computer software, business processes, and data networks. Since the creation of structured models relies on the knowledge of many organizational stakeholders, groups often accomplish this task. Group support systems (GSS) focus on the support of group processes and would appear to be useful for structured modeling; however, GSS usually only provide textual or decision related output rather than the structured models needed for many design processes. This paper proposes a class of systems, structured modeling GSS (smGSS), which adds support for the development of structured models to standard GSS. Since past research has shown that research results may be difficult to compare across studies when the system under investigation is not well defined, this paper develops a product design theory that defines the required characteristics of and testable design propositions for an smGSS as derived from existing theory and empirical investigations.
Language-specific models in multilingual topic tracking
Authors: Leah S. Larkey, Fangfang Feng, Margaret Connell, Victor Lavrenko
Venue: Proceedings of the 27th annual international ACM SIGIR conference on Research and development in information retrieval (2004)

Topic tracking is complicated when the stories in the stream occur in multiple languages. Typically, researchers have trained only English topic models because the training stories have been provided in English. In tracking, non-English test stories are then machine translated into English to compare them with the topic models. We propose a native language hypothesis stating that comparisons would be more effective in the original language of the story. We first test and support the hypothesis for story link detection. For topic tracking the hypothesis implies that it should be preferable to build separate language-specific topic models for each language in the stream. We compare different methods of incrementally building such native language topic models.
The development of an efficient checkpointing facility exploiting operating systems services of the GENESIS cluster operating system
Authors: J. T. Rough, A. M. Goscinski
Venue: Future Generation Computer Systems (2004)

Recent research efforts of parallel processing on non-dedicated clusters have focused on high execution performance, parallelism management, transparent access to resources, and making clusters easy to use. However, as a collection of independent computers used by multiple users, clusters are susceptible to failure. This paper shows the development of a coordinated checkpointing facility for the GENESIS cluster operating system. This facility was developed by exploiting existing operating system services. High performance and low overheads are achieved by allowing the processes of a parallel application to continue executing during the creation of checkpoints, while maintaining low demands on cluster resources by using coordinated checkpointing.
Geometric Control of Rational Cubic Curve
Authors: Azhar Ahmad, Jamaludin Md. Al
Venue: Proceedings of the International Conference on Computer Graphics, Imaging and Visualization (2004)

Geometrical control of curves is discussed in this paper. The curve representation considered was a rational Bezier like cubic curve. The rational cubic curve is characterized by two end points, two end slopes, a shoulder point and a shoulder line in the case of inflection. A method is introduced in which the convexity and inflecting curve is preserved more intuitively. The paper also shows that the end weights play a significant role in controlling the shape of the curve segment constrained by a shoulder point and a shoulder line.
Writing with a joystick: a comparison of date stamp, selection keyboard, and EdgeWrite
Authors: Jacob O. Wobbrock, Brad A. Myers, Htet Htet Aung
Venue: Proceedings of Graphics Interface 2004 (2004)

A joystick text entry method for game controllers and mobile phones would be valuable, since these devices often have joysticks but no conventional keyboards. But prevalent joystick text entry methods are slow because they are selection-based. EdgeWrite, a new joystick text entry method, is not based on selection but on gestures from a unistroke alphabet. Our experiment shows that this new method is faster, leaves fewer errors, and is more satisfying than date stamp and selection keyboard (two prevalent selection-based methods) for novices after minimal practice. For more practiced users, our results show that EdgeWrite is at least 1.5 times faster than selection keyboard, and 2.4 times faster than date stamp.
Java technologies for games
Authors: Doug Twilleager Jeff Kesselman Athomas Goldberg Daniel Petersen Juan Carlos Soto Chris Melissinos
Venue: Computers in Entertainment (CIE) (2004)

Network games are the fastest growing segment of the games market. The technologies required to build these massively networked games is evolving at a rapid pace. There are many components to these technologies. There are server, desktop client, and mobile client technologies which enable these connected games. This article provides on overview of the server, desktop, and mobile technologies that are available to build a networked game with Java technology.
Enhancing Locality in Structured Peer-to-Peer Networks
Authors: Ronaldo A. Ferreira, Suresh Jagannathan, Ananth Grama
Venue: Proceedings of the Parallel and Distributed Systems, Tenth International Conference (2004)

Distributed hash tables (DHTs), used in a numberof structured peer-to-peer systems, provide efficientmechanisms for resource location. A key distinguishingfeature of current DHT systems such as Chord, Pastry,and Tapestry is the way they handle locality in the underlyingnetwork. Topology-based node identifier assignment,proximity routing, and proximity neighbor selectionare examples of heuristics used to minimize message delaysin the underlying network. While these heuristicsare sometimes effective, they rely on a single global overlaythat may install the key of a popular object at anode far from most of the nodes accessing it. Furthermore,a response to a lookup does not contain any localityinformation about the nodes holding a copy of the object.We address these issues by proposing a novel two-leveloverlay peer-to-peer architecture. In our architecture, localoverlays act as locality-aware caches for the globaloverlay, grouping nodes close together in the underlyingnetwork. Local overlays are constructed by exploitingthe structure of the Internet as Autonomous Systems.We present detailed experimental results demonstratingthe practicality of the system, and showing performancegains in response time of up to 60% comparedto a single global overlay with state-of-the-art localizationschemes. We also present efficient distributed algorithmsfor maintaining local overlays in the presence ofnode arrivals and departures.
From Stack Inspection to Access Control: A Security Analysis for Libraries
Authors: Frederic Besson, Tomasz Blanc, Cedric Fournet, Andrew D. Gordon
Venue: Proceedings of the 17th IEEE workshop on Computer Security Foundations (2004)

We present a new static analysis for reviewing the securityof libraries for systems, such as JVMs or the CLR,that rely on stack inspection for access control. We describeits implementation for the CLR. Our tool inputs a set of librariesplus a description of the permissions granted to unknown,potentially hostile code. It constructs a permission-sensitivecall graph, which can be queried to identify potentialsecurity defects. It has been applied to large pre-existinglibraries.We also develop a new formal model of the essentials ofaccess control in the CLR (types, classes and inheritance,access modifiers, permissions, and stack inspection). In thismodel, we state and prove the correctness of the analysis.
The Medical Privacy Rule: Can Hospitals Comply Using Current Health Information Systems?
Authors: Reeva Lederman
Venue: Proceedings of the 17th IEEE Symposium on Computer-Based Medical Systems (2004)

This research provides an analysis of the implementation of the "standards for the privacyof individually identifiable health information" (Medical Privacy Rule) published in August14, 2002 by the Department of Health and Human Services (HHS) following the issuing of aprivacy rule by the Clinton administration in December 2000 and later support by the Bushadministration. The privacy rule went into effect April 14, 2001, with compliance requiredby April 2003 for most health providing entities. The resulting legislation is designed toensure that the business activity of health providers is subject to privacy regulation. In thisresearch we examine the ability of health organisations to respond to the requirements ofthis legislation and illustrate that this ability is affected by the quality of their patient dataand the structure and security of their databases. This paper suggests that compliance withthe legislative provisions creates implications for information systems development anddesign which large public hospitals have so far failed to consider or act upon.
People and Policies: Transforming the Human-Computer Partnership
Venue: Proceedings of the Fifth IEEE International Workshop on Policies for Distributed Systems and Networks (2004)

Policy-driven systems represent a significantchange in the human-computer partnership assubstantial responsibility is shifted from people tosystems. In fact, the shift to policy-driven systems maybe understood as a set of specific, distinctive changesin this partnership. This paper describes six suchdistinctive features of mature policy-driven systemsfrom the human viewpoint and discusses theimplications of these for the development of policiesand the operation of policy-driven systems.
GaP: a factor model for discrete data
Authors: John Canny
Venue: Proceedings of the 27th annual international ACM SIGIR conference on Research and development in information retrieval (2004)

We present a probabilistic model for a document corpus that combines many of the desirable features of previous models. The model is called "GaP" for Gamma-Poisson, the distributions of the first and last random variable. GaP is a factor model, that is it gives an approximate factorization of the document-term matrix into a product of matrices Λ and X. These factors have strictly non-negative terms. GaP is a generative probabilistic model that assigns finite probabilities to documents in a corpus. It can be computed with an efficient and simple EM recurrence. For a suitable choice of parameters, the GaP factorization maximizes independence between the factors. So it can be used as an independent-component algorithm adapted to document data. The form of the GaP model is empirically as well as analytically motivated. It gives very accurate results as a probabilistic model (measured via perplexity) and as a retrieval model. The GaP model projects documents and terms into a low-dimensional space of "themes," and models texts as "passages" of terms on the same theme.