ppxscal/embedding_network huggingface dataset:
Second-order stochastic fluid models with fluid-dependent flow rates
Authors: Dongyan Chen, Yiguang Hong, Kishor S. Trivedi
Venue: Performance Evaluation (2002)

In this paper, the analysis of second-order stochastic fluid models, where the fluid rate is dependent on the fluid level, is addressed. The boundary conditions are presented for the fluid models under consideration, which have extended previous work with only reflecting barrier assumptions. To obtain the transient solution of the fluid dynamics, a finite difference solution method is presented, which confirms to the boundary conditions and satisfies the normalization condition at the same time. With our approach, the modeling power of second-order fluid models is directly extended to include the case with fluid-dependent rates. As an application example, a statistical multiplexing problem is analyzed with our proposed method.
Chemical mechanical polishing of silver damascene structures
Authors: M. Hauder, J. Gstöttner, L. Gao, D. Schmitt-Landsiedel
Venue: Microelectronic Engineering (2002)

Sub micron silver lines are patterned by applying chemical mechanical polishing (CMP), Dry etched SiO2 trenches are filled with Ag by sputtering before removing surplus Ag by several CMP methods. Techniques using a slurry which focus on mechanical polishing have a problem in achieving planar removal of the metal. But with mainly chemical polishing a homogenous removal with proper embedded lines is possible. Thermally robust and smooth Ag metallization lines are the result of such a process.
Implementation techniques for main memory database systems
Authors: David J DeWitt, Randy H Katz, Frank Olken, Leonard D Shapiro, Michael R Stonebraker, David Wood
Venue: ACM SIGMOD Record (1984)

With the availability of very large, relatively inexpensive main memories, it is becoming possible keep large databases resident in main memory In this paper we consider the changes necessary to permit a relational database system to take advantage of large amounts of main memory We evaluate AVL vs B+-tree access methods for main memory databases, hash-based query processing strategies vs sort-merge, and study recovery issues when most or all of the database fits in main memory As expected, B+-trees are the preferred storage mechanism unless more than 80--90% of the database fits in main memory A somewhat surprising result is that hash based query processing strategies are advantageous for large memory situations
Protocol Wrappers for Layered Network Packet Processing in Reconfigurable Hardware
Authors: Florian Braun, John Lockwood, Marcel Waldvogel
Venue: IEEE Micro (2002)

A network platform called the field-programmable port extender (FPX) streamlines and simplifies network transmission processing directly in hardware.
Anchoring the Software Process
Authors: Barry Boehm
Venue: IEEE Software (1996)

For a few golden moments in the mid-'70s, it appeared that the software field had found a sequence of milestones around which people could plan, organize, monitor, and control their projects. These were the milestones in the waterfall model. They typically included the completion of system requirements, software requirements, preliminary design, detailed design, code, unit test, software acceptance test, and system acceptance test.Unfortunately, just as the waterfall model was becoming fully elaborated, people were finding that its milestones did not fit an increasing number of project situations. The risk-driven content of the three milestones proposed in this article let you tailor them to specific software situations, and at the same time they remain general enough to apply to most software projects.
A Two Priority Queue with Crossover Feedback
Authors: E. M. Jewkes, D. A. Stanford
Venue: Queueing Systems: Theory and Applications (2003)

This paper considers the delay distributions in a two-class non-preemptive priority queue with crossover feedback. Specifically, there are two priority classes, and the Poisson arrival process for each class can be subdivided into two groups: one group which only requires service at the priority level to which it arrives, and another group which requires subsequent service after it feeds back to the other queue. Our main result is the determination of explicit expressions for the distribution of delay until final service commences for each the four types of customers.
A framework for the normative analysis of workflow loops
Authors: Hans Weigand, Aldo de Moor
Venue: ACM SIGGROUP Bulletin (2001)

The goal of this paper is to make the communication norms underlying various LAP (Language/Action Perspective) workflow loop models (DEMO, ActionWorkflow) explicit and to contrast them with auditing norms. The transaction paradigm of DEMO and the customer satisfaction orientation of Action Workflow lead to norms which resemble the ones required by internal control, but there are some important differences. We propose a framework for the normative analysis of communication structures in which customer relations and agency relations are distinguished. Whereas most LAP approaches do not take agency relations explicitly into account, the extended workflow loop model allows us to analyze the effects of delegation on communicative structures.
Flow level performance analysis of a multi-service system supporting elastic and adaptive services
Authors: Sándor Rácz, Balázs Péter Gerö, Gábor Fodor
Venue: Performance Evaluation (2002)

We consider a multi-rate loss system where two types of non-peak allocated traffic flows receive service. Both elastic and adaptive flows are associated with a peak-and a minimum bandwidth requirement and they tolerate bandwidth compression while in service. The holding time of elastic flows depends on their received throughput, while the holding time of the adaptive flows is insensitive to that. Unfortunately, while this system is Markovian under quite non-restrictive assumptions (that are often used in the literature), it is not reversible. We propose a method whereby the approximation of this system by a reversible system is possible. We derive recursive formulas for determining the occupancy distribution and the mean number of flows in the system. By using a continuous approximation of the discrete state space, we also derive an explicit formula for the average throughputs that is independent of the size of the state space. The recursive formulas and the continuous approximation together provide a powerful tool for the performance analysis of this quite general system in the sense that they allow the calculation of the blocking probabilities and the mean throughputs in medium and large systems as well.
A Transition Sequence Generator for RAM Fault Detection
Authors: E. Regener
Venue: IEEE Transactions on Computers (1988)

In verification of n-bit CMOS memories it is usual to supply a test address sequence having n2/sup /n transitions, one for each ordered pair of n-bit words which differ in a single bit. From an inductive definition of a sequence with these properties, a succession of algorithms yielding the logic circuit of a next-state generator for the sequence is developed. Proving these algorithms equivalent demonstrates the correctness of the circuit rigorously.
Combinatorial Information Market Design
Authors: Robin Hanson
Venue: Information Systems Frontiers (2003)

Information markets are markets created to aggregate information. Such markets usually estimate a probability distribution over the values of certain variables, via bets on those values. Combinatorial information markets would aggregate information on the entire joint probability distribution over many variables, by allowing bets on all variable value combinations. To achieve this, we want to overcome the thin market and irrational participation problems that plague standard information markets. Scoring rules avoid these problems, but instead suffer from opinion pooling problems in the thick market case. Market scoring rules avoid all these problems, by becoming automated market makers in the thick market case and simple scoring rules in the thin market case. Logarithmic versions have cost and modularity advantages. After introducing market scoring rules, we consider several design issues, including how to represent variables to support both conditional and unconditional estimates, how to avoid becoming a money pump via errors in calculating probabilities, and how to ensure that users can cover their bets, without needlessly preventing them from using previous bets as collateral for future bets.
System Specification with the SpecCharts Language
Authors: Sanjiv Narayan, Frank Vahid, Daniel D. Gajski
Venue: IEEE Design Test (1992)

The SpecCharts language, which builds on VHDL to meet the unique requirements of system-level specification and design, is described. With an underlying model of behavioral hierarchy, SpecCharts modeling constructs enable designers to capture system specifications simply and precisely. SpecCharts constructs facilitate system-level design tasks by permitting high-level communication, maintaining information, and allowing design modification at an easy-to-comprehend level. The results of system-level design tasks are reflected in a modified SpecCharts, enabling the designer to evaluate the quality of each step. A detailed example demonstrates the use of SpecCharts.
FrontPage 98: Advanced (Windows 95)
Authors: Ziff-Davis Education
Venue:  (1998)

:FrontPage 98: Advanced is a higher level text for individuals who want to learn how to use advanced features of FrontPage to create web sites for the World Wide Web or a corporate intranet. Each topic is introduced with background information, followed by details and procedures in small, easy-to-absorb segments. Believing that people learn better by doing, most of the work consists of guided hands-on activities at the computer.
Knowledge-Based Support for Rapid Software Prototyping
Authors: Luqi
Venue: IEEE Expert: Intelligent Systems and Their Applications (1988)

The authors discusses the computer-aided prototyping system's knowledge base and shows how to apply expert-system technology to the software base management subsystem responsible for finding reusable software components with specified properties. She uses rapid prototyping techniques to allow the detection and correlation of requirement errors early in development. The goal is to automate support for analyzing new problem domains rather than automating the generation of many similar systems in well-understood problem domains. For this reason, the author addresses a general purpose computer-aided prototyping system rather than specialized application generators. The discussion focuses on retrieval strategies, declarative knowledge, and transformations.
Two High-Bandwidth Memory Bus Structures
Authors: Bruce Millar, Peter Gillingham
Venue: IEEE Design Test (1999)

Two approaches for next generation memory bus architecture, SLDRAM and Direct Rambus, are evaluated using a commercial analog circuit simulator to model transmission line behavior. Sources of error that degrade signal integrity, such as pulse amplitude attenuation, pulse width dependent skew or intersymbol interference, crosstalk, and clock to data skew are quantified to determine the operating margin of the two alternatives. Bus power dissipation is also considered. A fully loaded SLDRAM configuration is shown to have more timing margin than Direct Rambus.
The 1990-91 Taulbee Survey Report
Authors: David Gries, Dorothy Marsh
Venue: Computer (1992)

The key findings of the 1990-91 Taulbee Survey Report describing the results of a study of the Forsythe list of computing departments are presented. The Forsythe list enumerates all departments in the US and Canada that grant PhDs in computing, specifically in computer science (CS) and computer engineering (CE). Completed in December 1991, the latest survey concerns the production and employment of PhDs who graduated in 1990-91 and the faculty of PhD-granting computing departments during the 1991-92 academic year. The results indicate that the production of PhDs in CS departments increased significantly; the number of faculty in PhD-granting departments leveled off for the first time in two decades; those departments employed more full professors than assistant professors for another first; and minority figures persisted on the low side.
Applying CMM Project Planning Practices to Diverse Environments
Authors: Donna L. Johnson, Judith G. Brodman
Venue: IEEE Software (2000)

Many organizations today are using the Software Engineering Institute's Capability Maturity Model to develop databases, install commercial-off-the-shelf products, offer services, or perform maintenance. Small organizations or organizations with small projects are also attempting to use it and are experiencing difficulty applying the CMM to their nontraditional development efforts. The authors show how these organizations can improve their project planning process using the CMM by focusing on the intent of the CMM, instead of treating its practices as gospel.
Digital Government Security Infrastructure Design Challenges
Authors: James Joshi, Arif Ghafoor, Walid G. Aref, Eugene H. Spafford
Venue: Computer (2001)

Designing security systems for a digital government's multidomain environment requires balancing between providing convenient access and monitoring permissions. Information Age technologies provide enormous opportunities for a government to transform its functions into the digital arena. The authors view a digital government as an amalgam of heterogeneous information systems that exchange high-volume information among government agencies and public and private sectors engaged in government business. Several US government agencies have adopted information technologies and spear-headed the search for improved services and decision-making processes. These agencies aim to modernize the government's fragmented service-centric information infrastructure. The accumulating evidence indicates that electronically improving information flow and the decision-making process provides increased efficiency, streamlined functionalities, and more effective use of government resources.
Tirage a pile ou face de mots de Fibonacci
Authors: Jean Guy Penaud, Olivier Roques
Venue: Discrete Mathematics (2002)

In this paper, we give a semi-algorithm to sample uniformly at random from the Fibonacci language L = ε + La + Lbb. It needs a uniform bit generator and the average complexity is linear. We show that we can transform this semi-algorithm to a true algorithm still with a linear complexity. Finally, we discuss a generalization to a class of regular languages.
Automating PBX System Testing
Authors: Bertram Weber
Venue: IEEE Design Test (1999)

Private communication networks provide their customers with supplementary services that often have relations or dependencies to old, already-tested services. In the past these services were tested manually on terminal devices. This kind of testing is very time-consuming and ties up a lot of resources, especially if the tests are repeated for new software releases. To overcome these disadvantages, the present system test process of a private communication switch has been modified to reduce the effort involved in executing the system test and to generate more robust system test cases that can survive new software releases. Applying a TTCN-based test method (Tree and Tabular Combined Notation) and building a test tool chain automates a large part of the system test process. This article describes one possibility for automating the system test of a PBX, including a method for specifying functional service tests with TTCN and the test tools used in the test process.
Optimal Granularity and Scheme of Parallel Test Generation in a Distributed System
Authors: Hideo Fujiwara, Tomoo Inoue
Venue: IEEE Transactions on Parallel and Distributed Systems (1995)

A Client-Agent-Server model (CAS model) which can decrease the work load of the client by adding agent processors to the Client-Server model (CS model) is proposed and an approach to parallel test generation for logic circuits on the CAS model is presented. Two problems are considered: optimal granularity problem and optimal scheme problem. First, the problem of parallel test generation on the CAS model is formulated to analyze the effect of the granularity (grain size of target faults allocated to processors) in both cases of static and dynamic task allocation (optimal granularity problem). Then the relationship between the number of processors and the total processing time is analyzed (optimal scheme problem). From the analysis, it is shown that the CAS model can reduce the total processing time over the CS model and that there exists an optimal scheme (an optimal pair of numbers of agent processors and server processors) for the CAS model which minimizes the total processing time for a given number of processors. To corroborate the analysis, the proposed parallel test generation algorithm is implemented on a network of more than 100 workstations and experimental results for the ISCAS benchmark circuits are presented. It is shown that the experimental results are very close to the theoretical results which confirms the existence of optimal granularity and optimal scheme which minimizes the total processing time for the CAS model.
Off-Line Handwritten Word Recognition Using a Hidden Markov Model Type Stochastic Network
Authors: M. Y. Chen, A. Kundu, J. Zhou
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1994)

Because of large variations involved in handwritten words, the recognition problem is very difficult. Hidden Markov models (HMM) have been widely and successfully used in speech processing and recognition. Recently HMM has also been used with some success in recognizing handwritten words with presegmented letters. In this paper, a complete scheme for totally unconstrained handwritten word recognition based on a single contextual hidden Markov model type stochastic network is presented. Our scheme includes a morphology and heuristics based segmentation algorithm, a training algorithm that can adapt itself with the changing dictionary, and a modified Viterbi algorithm which searches for the (l+1)th globally best path based on the previous l best paths. Detailed experiments are carried out and successful recognition results are reported.
A Statistical Method for Estimating the Usefulness of Text Databases
Authors: King-Lup Liu, Clement Yu, Weiyi Meng, Wensheng Wu, Naphtali Rishe
Venue: IEEE Transactions on Knowledge and Data Engineering (2002)

Searching desired data on the Internet is one of the most common ways the Internet is used. No single search engine is capable of searching all data on the Internet. The approach that provides an interface for invoking multiple search engines for each user query has the potential to satisfy more users. When the number of search engines under the interface is large, invoking all search engines for each query is often not cost effective because it creates unnecessary network traffic by sending the query to a large number of useless search engines and searching these useless search engines wastes local resources. The problem can be overcome if the usefulness of every search engine with respect to each query can be predicted. In this paper, we present a statistical method to estimate the usefulness of a search engine for any given query. For a given query, the usefulness of a search engine in this paper is defined to be a combination of the number of documents in the search engine that are sufficiently similar to the query and the average similarity of these documents. Experimental results indicate that our estimation method is much more accurate than existing methods.
An Implementation of Logical Analysis of Data
Authors: Endre Boros, Peter L. Hammer, Toshihide Ibaraki, Alexander Kogan, Eddy Mayoraz, Ilya Muchnik
Venue: IEEE Transactions on Knowledge and Data Engineering (2000)

The paper describes a new, logic-based methodology for analyzing observations. The key features of the Logical Analysis of Data (LAD) are the discovery of minimal sets of features necessary for explaining all observations and the detection of hidden patterns in the data capable of distinguishing observations describing ¿positive¿ outcome events from ¿negative¿ outcome events. Combinations of such patterns are used for developing general classification procedures. An implementation of this methodology is described in the paper along with the results of numerical experiments demonstrating the classification performance of LAD in comparison with the reported results of other procedures. In the final section, we describe three pilot studies on applications of LAD to oil exploration, psychometric testing, and the analysis of developments in the Chinese transitional economy. These pilot studies demonstrate not only the classification power of LAD, but also its flexibility and capability to provide solutions to various case-dependent problems.
A fractal concentration-area method for assigning a color palette for image representation
Authors: Qiuming Cheng, Qingmou Li
Venue: Computers Geosciences (2002)

Displaying the remotely sensed image with a proper color palette is the first task in any kind of image processing and pattern recognition in GIS and image processing environments. The purpose of displaying the image should be not only to provide a visual representation of the variance of the image, although this has been the primary objective of most conventional methods, but also the color palette should reflect real-world features on the ground which must be the primary objective of employing remotely sensed data. Although most conventional methods focus only on the first purpose of image representation, the concentration-area (C-A plot) fractal method proposed in this paper aims to meet both purposes on the basis of pixel values and pixel value frequency distribution as well as spatial and geometrical properties of image patterns. The C-A method can be used to establish power-law relationships between the area A(≤s) with the pixel values greater than s and the pixel value s itself after plotting these values on log-log paper. A number of straight-line segments can be manually or automatically fitted to the points on the log-log paper, each representing a power-law relationship between the area A and the cutoff pixel value for s in a particular range. These straight-line segments can yield a group of cutoff values on the basis of which the image can be classified into discrete classes or zones. These zones usually correspond to the real-world features on the ground. A Windows program has been prepared in ActiveX format for implementing the C-A method and integrating it into other GIS and image processing systems. A case study of Landsat TM band 5 has been used to demonstrate the application of the method and the flexibility of the computer program.
Mating strategies in a Darwinian microworld: simulating the consequences of female reproductive refractoriness
Authors: Harold Pashler, Michael Mozer, Christine R. Harris
Venue: Adaptive Behavior (2001)

Characteristic sex differences in mating strategies (e.g., choosy females, unselective males) have been claimed by Trivers and other theorists to evolve as an automatic consequence of sex differences in minimum parental investment, arising chiefly from greater female reproductive refractoriness. The theory has been supported by correlational evidence and conceptual analogies to economics. A simulated evolution experiment was performed to provide a clearer test of whether female reproductive refractoriness alone can drive the emergence of differences in mating selectivity. A population of male and female replicators initially differed only in that females were unavailable to mate for a fixed period prior to the appearance of offspring. Over succeeding generations, females evolved far greater selectivity than males with respect to the longevity of potential mates. This greater selectivity was relatively robust with respect to population and genetic parameters, but quantitatively unstable with realistic breeding population sizes.