ppxscal/embedding_network huggingface dataset:
Efficient Stack Simulation for Set-Associative Virtual Address Caches With Real Tags
Authors: Yarsun Hsu, C. Eric Wu, Yew-Huey Liu
Venue: IEEE Transactions on Computers (1995)

Stack simulation is a powerful cache analysis approach to generate the number of misses and write backs for various cache configurations in a single run. Unfortunately, none of the previous work on stack simulation has efficient stack algorithm for virtual address caches with real tags (V/R-type caches). In this paper, we devise an efficient stack simulation algorithm for analyzing V/R-type caches. Using markers with a valid range for synonym lines, our algorithm is able to keep track of stack distances for different cache configurations. In addition to cache miss ratios and write back ratios, our approach generates pseudonym frequency for all cache configurations under investigation.
The Post-Game Analysis Framework-Developing Resource Management Strategies for Concurrent Systems
Authors: Y. C. Yan, S. F. Lundstrom
Venue: IEEE Transactions on Knowledge and Data Engineering (1989)

Research has been conducted to determine how distributed computations can be mapped to multiprocessors to minimize execution time. The approach described here, known as post-game analysis, incrementally changes the program partitioning in between program execution time in subsequent runs. Post-game analysis differs from conventional iterative refinement or controlled opportunistic perturbation in that no abstract program models or any single objective function are employed to determine the relative merits of two alternative mappings. Multiple optimization subgoals are formulated, based on actual timing data gathered during program execution. Heuristics, based on various optimization subgoals, are then applied to propose changes to the current mapping. Finally, a mapping generation process which prioritizes and resolves conflicting proposals is applied. Results obtained from simulations show that post-game analysis consistently out-performs random placement, load-balancing, and clustering algorithms by 15%. Few iterations are required for simulations involving more than 200 processes and 64 sites. A rule-based architecture enables incremental strategy refinement, thus making post-game analysis easily tailorable to programs written in many concurrent programming paradigms and multiprocessor architectures.
Further decompositions of complete tripartite graphs into 5-cycles
Authors: N. J. Cavenagh
Venue: Discrete Mathematics (2002)

Let K(r,s,t) denote the complete tripartite graph with partite sets of sizes r, s and t, where r ≤ s ≤ t. Necessary and sufficient conditions are given for decomposability of K(r,s,t) into 5-cycles whenever r,s and t are all even. This extends work done by Mahmoodian and Mirzakhani (Decomposition of complete tripartite graphs into 5-cycles, in: Combinatorics Advances, Kluwer Academic Publishers, Netherlands, 1995, pp. 235-241) and Cavenagh and Billington (J. Combin. 22 (2000) 41).
Darboux Frames, Snakes, and Super-Quadrics: Geometry from the Bottom Up
Authors: F. P. Ferrie, J. Lagarde, P. Whaite
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1993)

A representational and a computational model for deriving 3-D articulated volumetric descriptions of objects from laser rangefinder data is described. This method is purely bottom up: it relies on general assumptions cast in terms of differential geometry. Darboux frames, snakes, and superquadrics form the basis of this representation, and curvature consistency provides the computational framework. The organization is hierarchical. Darboux frames are used to describe the local surface, whereas snakes are used to interpolate between features, particularly those that serve to partition a surface into its constituent parts. Superquadrics are used to characterize the 3-D shape of each surface partition. The result is a set of connected volumetric primitives that serve to describe the overall shape of an object. Examples that show how the approach performs on data acquired with a laser rangefinder are included.
An Experience in Collaborative Software Engineering Education
Authors: Jesús Favela, Feniosky Peña-Mora
Venue: IEEE Software (2001)

Development of large-scale systems often requires interaction among geographically distributed specialists. Highlighting tool use and team integration, the authors describe a project-oriented software development course in which students in two countries collaborate on a software project in an Internet-based groupware environment.
Temporal Relational Data Model
Authors: Abdullah Uz Tansel
Venue: IEEE Transactions on Knowledge and Data Engineering (1997)

This paper incorporates a temporal dimension to nested relations. It combines research in temporal databases and nested relations for managing the temporal data in nontraditional database applications. A temporal data value is represented as a temporal atom; a temporal atom consists of two parts: a temporal set and a value. The temporal atom asserts that the value is valid over the time duration represented by its temporal set. The data model allows relations with arbitrary levels of nesting and can represent the histories of objects and their relationships. Temporal relational algebra and calculus languages are formulated and their equivalence is proved. Temporal relational algebra includes operations to manipulate temporal data and to restructure nested temporal relations. Additionally, we define operations to generate a power set of a relation, a set membership test, and a set inclusion test, which are all derived from the other operations of temporal relational algebra. To obtain a concise representation of temporal data (temporal reduction), collapsed versions of the set-theoretic operations are defined. Procedures to express collapsed operations by the regular operations of temporal relational algebra are included. The paper also develops procedures to completely flatten a nested temporal relation into an equivalent 1NF relation and back to its original form, thus providing a basis for the semantics of the collapsed operations by the traditional operations on 1NF relations.
RNN-based prosodic modeling for mandarin speech and its application to speech-to-text conversion
Authors: Wern-Jun Wang, Yuan-Fu Liao, Sin-Horng Chen
Venue: Speech Communication (2002)

In this paper, a recurrent neural network (RNN) based prosodic modeling method for Mandarin speech-to-text conversion is proposed. The prosodic modeling is performed in the post-processing stage of acoustic decoding and aims at detecting word-boundary cues to assist in linguistic decoding. It employs a simple three-layer RNN to learn the relationship between input prosodic features, extracted from the input utterance with syllable boundaries pre-determined by the preceding acoustic decoder, and output word-boundary information of the associated text. After the RNN prosodic model is properly trained, it can be used to generate word-boundary cues to help the linguistic decoder solving the problem of word-boundary ambiguity. Two schemes of using these word-boundary cues are proposed. Scheme 1 modifies the baseline scheme of the conventional linguistic decoding search by directly taking the RNN outputs as additional scores and adding them to all word-sequence hypotheses to assist in selecting the best recognized word sequence. Scheme 2 is an extended version of Scheme 1 by further using the RNN outputs to drive a finite state machine (FSM) for setting path constraints to restrict the linguistic decoding search. Character accuracy rates of 73.6%, 74.6% and 74.7% were obtained for the systems using the baseline scheme, Schemes 1 and 2, respectively. Besides, a gain of 17% reduction in the computational complexity of the linguistic decoding search was also obtained for Scheme 2. So the proposed prosodic modeling method is promising for Mandarin speech recognition.
Exploitation of Contributions to Information Gain,from Learning Analysis to Architecture Synthesis
Authors: Bertrand Augereau, Thierry Simon, Jacky Bernard
Venue: Neural Processing Letters (1997)

We introduce a new analysis tool able to test the learning distribution inside an MLP network. This tool is based on the exploitation of specific indicators which measure the contribution of any interconnection graph subset to the information gain evolution. We present an application of this method to an efficient architecture synthesis algorithm.
Study of CoSi2 thermal stability improved by interfacial cavities
Authors: A. Alberti, F. La Via, S. Ravesi, S. Pannitteri, C. Bongiorno
Venue: Microelectronic Engineering (2002)

The interfacial properties of 70-nm CoSi2 layers have been modulated by implanting argon or nitrogen after silicide reaction. The effect of the implant has been studied by transmission electron microscopy and sheet resistance analyses. The structural stabilisation of the silicide layer has been attributed to the formation of a band of cavities which have been located at the silicide grain boundaries. They have delayed the occurrence of the grooving process and extended the stability window by 75-100 °C. It has been found that the thermal stability improvement is related to the cavity density and size, and depends on the implanted species. The maximum increment of the thermal budget has been found at a cavity size of 22 nm and a cavity density of 2.5 × 1010/cm2.
An alternative method for metallization by laser and ion beam irradiation
Authors: F. Machalett, K. Edinger, M. Diegel, K. Steenbeck
Venue: Microelectronic Engineering (2002)

A scanning Ar+ laser beam and a focused 30 keV Ga+ ion beam (FIB) have been used to transform an insulating (or high-resistivity semiconducting) noble metal oxide film to a conducting layer, Resulting from these experiments we propose a method for the fast and one-step metallization by laser or ion beam irradiation using platinum oxide thin films, prepared by magnetron sputtering under an argon/oxygen plasma. A maskless patterning of the platinum oxide film is possible by scanned laser and focused ion beam irradiation. Additionally to the scanning methods it is also possible to pattern the PtO2 film by broad ion beam irradiation using masks. For wiring we patterned conducting areas of up to 2 mm width and up to 15 mm length with a broad Ga+ ion beam (energy: 300 keV, dose: 5 × 1015 Ga+/cm2). The laser- and the ion-patterned large areas could be easily bonded with an Al wire to carry out four-point resistance measurements.
Changing Interaction of Compiler and Architecture
Authors: Sarita V. Adve, Doug Burger, Rudolf Eigenmann, Alasdair Rawsthorne, Michael D. Smith, Catherine H. Gebotys, Mahmut T. Kandemir, David J. Lilja, Alok N. Choudhary, Jesse Z. Fang, Pen-Chung Yew
Venue: Computer (1997)

With recent developments in compilation technology and architectural design, the line between traditional hardware and software roles has become increasingly blurred. The compiler can now see the processor's inner structure, which lets architects exploit sophisticated program analysis techniques to hide branch and memory access delays, for example. Processors can now implement register renaming and dynamic instruction-scheduling algorithms directly in the hardware-something that was once exclusively the compiler's job. A similar shift is occurring in optimizing compilers for parallel machines. To parallelize a larger class of applications, compiler writers are moving beyond static transformations and exploring techniques that rely on runtime decisions or hardware support. This increased blurring of compile-time and runtime optimizations opens many new research opportunities, particularly for program optimization-a task typically performed entirely at compile time. This article describes an optimization continuum and shows how different classes of optimizations fall within it.
Developing a High-Level Fault Simulation Standard
Authors: Stanislaw Deniziak, Krzysztof Sapiecha
Venue: Computer (2001)

To reduce manufacturing costs and time to market, we must develop efficient fault detection and location methods.
Testability Features of the AMD-K6 Microprocessor
Authors: R. Scott Fetherston, Imtiaz P. Shaik, Siyad C. Ma
Venue: IEEE Design Test (1998)

This article describes the testability features and test pattern development methodologies for the AMD-K6 Microprocessor. The embedded Design for Testability (DFT) structures and test strategy provide high quality manufacturing tests.
The Scale Space Aspect Graph
Authors: D. W. Eggert, K. W. Bowyer, C. R. Dyer, H. I. Christensen, D. B. Goldgof
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1993)

Currently the aspect graph is computed from the theoretical standpoint of perfect resolution in object shape, the viewpoint and the projected image. This means that the aspect graph may include details that an observer could never see in practice. Introducing the notion of scale into the aspect graph framework provides a mechanism for selecting a level of detail that is "large enough" to merit explicit representation. This effectively allows control over the number of nodes retained in the aspect graph. This paper introduces the concept of the scale space aspect graph, defines three different interpretations of the scale dimension, and presents a detailed example for a simple class of objects, with scale defined in terms of the spatial extent of features in the image.
Traceview: A Trace Visualization Tool
Authors: Allen D. Malony, David H. Hammerslag, David J. Jablonowski
Venue: IEEE Software (1991)

The design, development, and application of Traceview, a general-purpose trace-visualization tool that implements the trace-management and I/O features usually found in special-purpose trace-analysis systems, are described. The aspects of trace visualization that can be incorporated into a reusable tool are identified. The tradeoff in general-purpose design versus semantically based, detailed trace-data analysis is evaluated. Display methods and Traceview applications are discussed.
The Paradyn Parallel Performance Measurement Tool
Authors: Barton P. Miller, Mark D. Callaghan, Jonathan M. Cargille, Jeffrey K. Hollingsworth, R. Bruce Irvin, Karen L. Karavanic, Krishna Kunchithapadam, Tia Newhall
Venue: Computer (1995)

The Paradyn performance-measurement tool uses several novel technologies to scale to long-running programs and large systems and automate much of the search for performance bottlenecks. The tool is based on a dynamic notion of performance instrumentation and measurement. Application programs are placed into execution, and performance instrumentation is inserted into the running programs and modified during execution. The performance consultant module automatically directs instrumentation placement and associates bottlenecks with specific causes and specific program parts. Paradyn controls its instrumentation overhead by monitoring the cost of its data collection and limiting its instrumentation to a user-controllable threshold. Paradyn's instrumentation can be configured to accept new operating systems, hardware, and application-specific performance data. Paradyn also provides an open interface for performance visualization and a simple programming library to interface visualizations. Paradyn can gather and present performance data in terms of high-level parallel languages (such as data-parallel Fortran) and can measure programs on massively parallel computers, workstation clusters, and heterogeneous combinations of these systems. The article presents two examples that illustrate Paradyn's use in finding performance problems in real applications.
Analysis of two competing TCP/IP connections
Authors: E. Altman, T. Jiménez, R. Núñez-Queija
Venue: Performance Evaluation (2002)

Many mathematical models exist for describing the behavior of TCP/IP (TCP: transmission control protocol) under an exogenous loss process that does not depend on the window size. The goal of this paper is to present a mathematical analysis of two asymmetric competing TCP connections where loss probabilities are directly related to their instantaneous window size, and occur when the sum of throughputs attains a given level. We obtain bounds for the stationary throughput of each connection, as well as an exact expression for symmetric connections. This allows us to further study the fairness as a function of the different round trip times. We avoid the simplifying artificial synchronization assumption that has frequently been used in the past to study similar problems, according to which whenever one connection looses a packet, the other one looses a packet as well.
Developing Real-Time Tasks With Predictable Timing
Authors: Gustav Pospischil, Peter Puschner, Alexander Vrchoticky, Ralph Zainlinger
Venue: IEEE Software (1992)

A prototype development environment for the Mars maintainable real-time system is described. The Mars design environment supports the implementation of critical real-time tasks with time editing. It uses an experimental real-time language, Modula-R, which is based on Modula-2. The Mars real-time architecture, which is the target architecture of the Mars environment, is described. To illustrate the environment, the development of a simple real-time algorithm that implements insertion sort for an array is presented.
Collection awareness on the web via livemaps
Authors: Doron Cohen, Michael Jacovi, Yoelle Maarek, Vladimir Soroka
Venue: ACM SIGGROUP Bulletin (2000)

With the increasing proliferation of chat applications on the Web, the old vision of "adding people" to the Web, is becoming a reality. While infrastructure seems to be scalable and stable enough to support collaboration, the user model is not well defined yet. In particular, there seems to be a certain lack of abstraction and granularity in existing solutions. This paper studies the current restrictions of two common concepts in collaboration on the Web, namely "people awareness" and "document awareness", and proposes a more general one that we call "collection awareness", which seems more adequate to the graph structure of the Web. We introduce a new medium for supporting this higher-level awareness: "Livemaps".
Global action rules in distributed knowledge systems
Authors: Zbigniew W. Ras, Shishir Gupta
Venue: Fundamenta Informaticae (2002)

In papers [4,5], query answering system based on distributed knowledge mining was introduced and investigated. In paper by Ras and Wieczorkowska [3], the notion of an action rule was introduced and for its application domain e-business was taken. In this paper, we generalize the notion of action rules in a similar way to handling global queries in [4,5]. Mainly, when values of attributes for a given customer, used in action rules, can not be easily changed by business user, definitions of these attributes are extracted from other sites of a distributed knowledge system. To be more precise, attributes at every site of a distributed knowledge system are divided into two sets: stable and flexible. Values of flexible attributes, for a given consumer, sometime can be changed and this change can be influenced and controlled by a business user. However, some of these changes (for instance to the attribute "profit") can not be done directly to a chosen attribute. In this case, definitions of such an attribute in terms of other attributes have to be learned. These new definitions are used to construct action rules showing what changes in values of flexible attributes, for a given consumer, are needed in order to re-classify this consumer the way business user wants. But, business user may be either unable or unwilling to proceed with actions leading to such changes. In all such cases we may search for definitions of these flexible attributes looking at either local or remote sites for help.
Parallel Optimization of Large Join Queries with Set Operators and Aggregates in a Parallel Environment Supporting Pipeline
Authors: Myra Spiliopoulou, Michael Hatzopoulos, Yannis Cotronis
Venue: IEEE Transactions on Knowledge and Data Engineering (1996)

We propose a parallel optimizer for queries containing a large number of joins, as well as set operators and aggregate functions. The platform of execution is a shared-disk multiprocessor machine supporting bushy parallelism and pipeline. Our model partitions the query into almost independent subtrees that can be optimized simultaneously and applies an enhanced variation of the iterative improvement technique on those of the subtrees, which contain a large number of joins. This technique is parallelized, too. In order to estimate the cost of the states constructed during optimization of join subtrees, cost formulae are developed that estimate the cost of relational algebra operators when executed across coalescing pipes.
Exploring into Programs for the Recovery of Data Dependencies Designed
Authors: Hee Beng Kuan Tan, Tok Wang Ling, Cheng Hian Goh
Venue: IEEE Transactions on Knowledge and Data Engineering (2002)

Data dependencies play an important role in the design of a database. Many legacy database applications have been developed on old generation database management systems and conventional file systems. As a result, most of the data dependencies in legacy databases are not enforced in the database management systems. As such, they are not explicitly defined in database schema and are enforced in the transactions, which update the databases. It is very difficult and time consuming to find out the designed data dependencies manually during the maintenance and reengineering of database applications. In software engineering, program analysis has long been developed and proven as a useful aid in many areas. With the use of program analysis, this paper proposes a novel approach for the recovery of common data dependencies, i.e., functional dependencies, key constraints, inclusion dependencies, referential constraints, and sum dependencies, designed in a database from the behavior of transactions, which update the database. The approach is based on detecting program path patterns for implementing most commonly used methods to enforce these data dependencies.
On the system of fixed points of a collineation in noncommutative projective geometry
Authors: G. Donati
Venue: Discrete Mathematics (2002)

Noncommutativity of the ground field has a deep influence on the geometry of projective spaces, as shown, for instance, by the failure of Pappus' theorem. In this paper we observe that in noncommutative geometry the system of fixed points of a collineation is a particular union of projective subgeometries coordinatized by suitable division subrings. Since the study of fixed points of a collineation leads to consider eigenvalues and eigenvectors of semilinear transformations, we present the theory, which is interesting in itself, of eigenvalues and eigenvectors of semilinear transformations over division rings.
Learning Probabilistic RAM Nets Using VLSI Structures
Authors: T. G. Clarkson, D. Gorse, J. G. Taylor, C. K. Ng
Venue: IEEE Transactions on Computers (1992)

Hardware-realizable learning probabilistic RAMs (pRAMs) which implement local reinforcement rules utilizing synaptic rather than threshold noise in the stochastic search procedure are described. The design allows for both global and local rewards and penalties (in this latter case implementing a modified version of backpropagation). The architecture allows for serial updating of the weights of a pRAM net according to a reward/penalty learning rule. It is possible to generate a new set of pRAM outputs at least every 100 mu s, which is faster than the response time of biological neurons.