ppxscal/embedding_network huggingface dataset:
A TMS320C25-Based Multirate Filter
Authors: Rulph Chassaing, Wayne A. Peterson, Darrell W. Horning
Venue: IEEE Micro (1990)

A nine-octave multirate filter with one-third-octave band gain control is presented. The filter, developed as a DSP (digital signal processing) application, produces a random-noise spectrum from 10 Hz to 5 kHz with a controllable level in one-third-octave bands. Nine FIR (finite impulse response) bandpass filters processed at different sample rates and eight FIR low-pass interpolation filters provide shaped pseudorandom noise. Equipment includes the TI TMS320C25-based software development system and the TLC32041 analog interface chip. The design offers a significant saving in both data memory storage and processing time. The multirate filter program uses 1368 words of data memory, whereas an equivalent single rate would occupy 41 K words of data memory.
Designing Data Warehouses with OO Conceptual Models
Authors: Juan Trujillo, Manuel Palomar, Jaime Gomez, Il-Yeol Song
Venue: Computer (2001)

The authors propose an approach that provides a theoretical foundation for the use of object-oriented databases and object-relational databases in data warehouse, multidimensional database, and online analytical processing applications. This approach introduces a set of minimal constraints and extensions to the Unified Modeling Language for representing multidimensional modeling properties for these applications. Multidimensional modeling offers two benefits. First, the model closely parallels how data analyzers think and, therefore, helps users understand data. Second, multidimensional modeling helps predict what final users want to do, thereby facilitating performance improvements. The authors are using their approach to create an automatic implementation of a multidimensional model. They plan to integrate commercial online-analytical-processing tool facilities within their GOLD Model Case Tool as well, a task that involves data warehouse prototyping and sample data generation issues.
Forward area light map projection
Authors: Elvis Ko-Yung Jeng, Zhigang Xiang
Venue: Proceedings of the 2nd international conference on Computer graphics, virtual Reality, visualisation and interaction in Africa (2003)

We present a new method for soft shadow visualization. This two-stage approach generates high-quality soft shadow images by projecting sampled surface points, which are kept in a "layered area light map", onto the viewing screen. The layered area light map is created in the preprocessing stage, and is multi-layered in the sense that each map cell keeps the visibility ratio of the area light source with respect to multiple surface points at varying depth. In the forward projection stage, we project the sampled surface points in the layered area light map onto the screen buffer to attenuate a shadowless reference image in order to quickly generate the final image. Dynamic splatting and object surface-based convolution are used in the process to fill "holes" and to smooth out minor artifacts that are caused by insufficient sampling. When a series of images for a given scene are to be produced this forward projection rendering technique is much faster than ray tracing and still results in soft shadows with comparable quality.
Simulation of the influence of via sidewall tapering on step coverage of sputter-deposited barrier layers
Authors: E. Bär, J. Lorenz, H. Ryssel
Venue: Microelectronic Engineering (2002)

Simulation has been used to evaluate the influence of the geometry of etched vias (i.e. of varying aspect ratios and sidewall taper angles) in terms of the step coverage that can be achieved for subsequently sputter-deposited barrier layers. The simulations are based on geometrical parameterization of the etched geometry combined with physical-based simulation of barrier sputter deposition. Significant enhancement of step coverage with increasing tapering of via sidewalls is predicted. The optimum distance between target and wafer for long-throw sputter deposition depends on the aspect ratio and sidewall taper angle of the via.
Pure patterns type systems
Authors: Gilles Barthe, Horatiu Cirstea, Claude Kirchner, Luigi Liquori
Venue: ACM SIGPLAN Notices (2003)

We introduce a new framework of algebraic pure type systems in which we consider rewrite rules as lambda terms with patterns and rewrite rule application as abstraction application with built-in matching facilities. This framework, that we call "Pure Pattern Type Systems", is particularly well-suited for the foundations of programming (meta)languages and proof assistants since it provides in a fully unified setting higher-order capabilities and pattern matching ability together with powerful type systems. We prove some standard properties like confluence and subject reduction for the case of a syntactic theory and under a syntactical restriction over the shape of patterns. We also conjecture the strong normalization of typable terms. This work should be seen as a contribution to a formal connection between logics and rewriting, and a step towards new proof engines based on the Curry-Howard isomorphism.
Composite Arithmetic: Proposal for a New Standard
Authors: W. Neville Holmes
Venue: Computer (1997)

Frustrated by the limitations of integer arithmetic, scientists and engineers developed a floating-point number representation. The subsequent adoption of a binary floating-point standard greatly enhanced scientific computing. But floating-point is too specialized for spreadsheets and inadequate for computer graphics. It also complicates programming. Finally, it does not even yield exact results: One very popular calculator gives the answer -0.000000001 to the calculation ((1 \divide 3) x 3)-1! These circumstances, coupled with developments in circuit technology and computation, have encouraged and made possible a more general arithmetic. In this article I propose what I call composite arithmetic, which combines aspects of traditional integer and floating-point arithmetics with less familiar aspects of rational and logarithmic arithmetics. Composite arithmetic complements the binary floating-point standard and satisfies more diverse computational needs. Successful development of a composite arithmetic standard would be most timely, given the burgeoning ability to manufacture complex processors and the interest in extended forms of arithmetic being shown in the research literature. It would also be highly beneficial in support of better electronic calculator arithmetic and standard operation of generic software packages such as those including spreadsheet capabilities.
An MAP-Based Poisson cluster model for web traffic
Authors: Guy Latouche, Marie-Ange Remiche
Venue: Performance Evaluation (2002)

In our Web traffic model, http session requests occur according to a Poisson process and each request induces multiple transmissions of sub-documents, called objects. We use a transient MAP process to model the epochs at which the transmissions of objects associated to a given document are initiated. The lengths of transmission of the objects are modeled as i.i.d, random variables. We analyze the distribution of the total number of objects being in transmission at any given time and determine its auto-correlation function.
Subcube Fault Tolerance in Hypercube Multiprocessors
Authors: Laxmi N. Bhuyan, Yeimkuan Chang
Venue: IEEE Transactions on Computers (1995)

In this paper, we study the problem of constructing subcubes in faulty hypercubes. First a divide-and-conquer technique is used to form the set of disjoint subcubes in the faulty hypercube. The concept of irregular subcubes is then introduced to take advantage of advanced switching techniques, such as wormhole routing, to increase the sizes of the available subcubes. We present a subcube partitioning technique to form an irregular subcube of maximum size. The n-cube containing two faults is studied first because, in the worst case, two faults are sufficient to destroy all the possible regular (n¿ 1)-cubes. It is shown that the subcube partitioning technique is able to tolerate $\lceil {n \over 2}\rceil$ faults while maintaining a fault-free (n¿ 1)-cube in a faulty n-cube. In general, we show that a fault-free (n¿m¿ 1)-cube is guaranteed when there are $( \lceil {n -m \over 2}\rceil + 1) \times 2^m + 2^{m-1} -1$ or fewer faults. We also develop a two-phase subcube allocation strategy in order to show the average case performance of our subcube construction technique. Extensive simulation is conducted to show the effectiveness of the two-phase subcube allocation strategy.
Design and implementation of multicast operations for ATM-based high performance computing
Authors: Chengchang Huang, Eric P. Kasten, Philip K. McKinley
Venue: Proceedings of the 1994 ACM/IEEE conference on Supercomputing (1994)

This paper presents the results of an investigation into the efficient implementation of multicast operations for cluster-based parallel computing on Asynchronous Transfer Mode (ATM) networks. Both software- and hardware-based multicast operations have been implemented and studied on a three-switch ATM network testbed. Performance measurements are presented that illustrate how software approaches can best take advantage of switch-based network architectures, and what additional advantage can be gained from using underlying hardware support.
KBRA: A New Paradigm for Requirements Engineering
Authors: Andrew J. Czuchry,  Jr., David R. Harris
Venue: IEEE Expert: Intelligent Systems and Their Applications (1988)

The authors present a knowledge-based requirements assistant (KBRA) that is a component of the knowledge-based software assistant (KBSA). The idea behind KBSA is to create a knowledge-based life-cycle paradigm spanning software development from requirements to code and to formalize software practice so that computers can be used as active reasoning agents in developing software. The authors identify knowledge-representation issues associated with requirements acquisition and analysis, and note the three realms in which mechanisms operate to resolve knowledge issues: presentations, structured text, and evolving system description. They describe artificial intelligence techniques used to provide consistent reasoning processes for the intelligent assistant: inheritance of properties from generic object types, automatic classification based on discriminators indicating how to specialize instances, and constraint propagation for processing ramifications of requirements decisions and for supporting retraction when people change their minds.
Threshold Validity for Mutual Neighborhood Clustering
Authors: S. P. Smith
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1993)

Clustering algorithms have the annoying characteristic of finding clusters in random data. A theoretical analysis of the threshold of the mutual neighborhood clustering algorithm (MNCA) under the hypothesis of random data is presented. This yields a theoretical minimum value of this threshold below which even unclustered data are broken into separate clusters. To derive the threshold, a theorem about mutual near neighbors in a Poisson process is stated and proved. Simple experiments demonstrate the usefulness of the theoretical thresholds.
Operator Constructions and Volterra Mappings in Differential Games
Authors: V. V. Ostapenko
Venue: Cybernetics and Systems Analysis (2002)

It is proved that B. N. Pshenichnyi's &epsiv;-strategies and strategies based on Volterra mappings are equivalent. It is shown that Volterra mapping sought for is a boundary for some directednesses of prelimit mappings.
CAREL: Computer Aided Reliability Evaluator for Distributed Computing Networks
Authors: S. Soh, S. Rai
Venue: IEEE Transactions on Parallel and Distributed Systems (1991)

An efficient method to compute the terminal reliability (the probability of communication between a pair of nodes) of a distributed computing system (DCS) is presented. It is assumed that the graph model G(V,E) for DCS is given and that the path and/or cut information for the network G(V,E) is available. Boolean algebraic concepts are used to define four operators: compare, reduce, combine, and generate. The proposed method, called CAREL, uses the four operators to generate exclusive and mutually disjoint events. CAREL has been implemented using bit vector representation on an Encore MULTIMAX 320 system. It is shown that CAREL solves large DCS networks (having a pathset on the order of 780 and a cutset on the order of 7300 or more) with a reasonable memory requirement. A comparison with other algorithms reveals the computational efficiency of the method. The proof of correctness of CAREL is included.
A New Architecture for Integration of CORBA and OODB
Authors: Ruey-Kai Sheu, Kai-Chih Liang, Shyan-Ming Yuan, Win-tsung Lo
Venue: IEEE Transactions on Knowledge and Data Engineering (1999)

Object-oriented database system (OODB) supports an object-oriented data model with the functionality of persistency and transaction semantics. In order to facilitate the use of OODB, the Object Database Management Group (ODMG) defined a standard for object database management system. On the other hand, the Object Management Group (OMG) defined the Common Object Request Broker Architecture (CORBA), which is an emerging standard of distributed object technology providing the interconnection network between distributed objects. For the sake of matching these two object models, taking the advantages of merging both of them, and building a more sophisticated infrastructure, the integration of CORBA and OODB is currently an urgent and important issue in distributed object systems. Instead of using Object Database Adapter (ODA) suggested by the ODMG, in this paper, we provide a novel way of reusing the Object Transaction Service (OTS) and wrapping techniques to introduce OODB into CORBA automatically. Through our design, CORBA clients or OODB object implementers do not need to learn any knowledge of each other. In addition, error recovery is also provided to guarantee the consistency of object states. The whole task for integrating CORBA and OODB is done transparently by our proposed preprocessor, which plays an important role in solving problems encountered by ORB and OODB vendors easily.
An empirical study of industrial security-engineering practices
Authors: Rayford B. Vaughn,  Jr., Ronda Henning, Kevin Fox
Venue: Journal of Systems and Software (2002)

This paper presents lessons learned and observations noted about the state of security-engineering practices by three information security practitioners with different perspectives - two in industry and one in academia. All authors have more than 20-years experience in this field and two were former members of the US National Computer Security Center during the early days of the Trusted Computer System Evaluation Criteria and the strong promotion of trusted operating systems that accompanied the release of that document. In the last 20 years, it has been argued that security-engineering practices have not kept pace with the escalating threats to information systems. Much has occurred since that time - new security paradigms, failure of evaluated products to emerge into common use, new systemic threats, and an increased awareness of the risk faced by information systems. This paper presents an empirical view of lessons learned in security-engineering, experiences in applying the trade, and observations made about the successes and failures of security practices and technology. This work was sponsored in part by NSF Grant.
ADER: Arbitrary High Order Godunov Approach
Authors: V. A. Titarev, E. F. Toro
Venue: Journal of Scientific Computing (2002)

This paper concerns the construction of non-oscillatory schemes of very high order of accuracy in space and time, to solve non-linear hyperbolic conservation laws. The schemes result from extending the ADER approach, which is related to the ENO/WENO methodology. Our schemes are conservative, one-step, explicit and fully discrete, requiring only the computation of the inter-cell fluxes to advance the solution by a full time step; the schemes have optimal stability condition. To compute the intercell flux in one space dimension we solve a generalised Riemann problem by reducing it to the solution a sequence of m conventional Riemann problems for the kth spatial derivatives of the solution, with k&equals;0, 1,&mldr;, m&minus;1, where m is arbitrary and is the order of the accuracy of the resulting scheme. We provide numerical examples using schemes of up to fifth order of accuracy in both time and space.
A Unified Design Methodology for Offline and Online Testing
Authors: Samvel K. Shoukourian
Venue: IEEE Design Test (1998)

A concept of a design through technology both for offline and online testing is described. It can be used for any level of a multilevel hierarchical computer system from a system till a gate level, separately or in possible mixed-level combinations.A technology is based on disjoining of testing algorithms and a test management The management is different for offline and online testing At the same time an algorithm may be the identical for both types of testing.Disjoining is achieved by introducing a unified structure of a test: only standard basic constructions are usedfor its design accordingly to a special order.
User-Level Network Interface Protocols
Authors: Raoul A. F. Bhoedjang, Tim Rühl, Henri E. Bal
Venue: Computer (1998)

Modern high-speed local area net-works offer great potential for communication- intensive applications, but their performance is limited by the use of traditional communication protocols, such as TCP/IP. In most cases, these protocols require that all network access be through the operating system, which adds significant overhead to both the transmission path (typically a system call and data copy) and the receive path (typically an interrupt, a system call, and a data copy). To address this performance problem, several user-level communication architectures have been developed that remove the operating system from the critical communication path. This article describes six important issues to consider in designing communication protocols for user-level architectures. The issues discussed focus on the performance and semantics of a communication system. These issues include data transfer, address translation, protection, and control transfer mechanisms, as well as the issues of reliability and multicast. To provide a basis for analyzing these issues, the authors present a simple network interface protocol for Myricom's Myrinet network, which has a programmable network interface. Researchers can thus explore many protocol design options, and several groups have designed communication systems for Myrinet. In this article, the authors refer to 11 such systems, all of which differ significantly in how they resolve these design issues but all of which aim for high performance and provide a lean, low-level, and more or less generic communication facility.
Validating Metrics for Ensuring Space Shuttle Flight Software Quality
Authors: Norman F. Schneidewind
Venue: Computer (1994)

In this article, we cover the validation of software quality metrics for the Space Shuttle. Experiments with Space Shuttle flight software show that the Boolean OR discriminator function can successfully validate metrics for controlling and predicting quality. Further, we found that statement count and node count are the metrics most closely associated with the discrepancy reports count, and that with data smoothing their critical values can be used as predictors of software quality. We are continuing our research and comparing validated metrics with actual results in an attempt to determine whether the use of additional metrics provides sufficiently greater discriminative power to justify the increased inspection costs.
Constrained Clustering as an Optimization Method
Authors: K. Rose, E. Gurewitz, G. C. Fox
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1993)

A deterministic annealing approach to clustering is derived on the basis of the principle of maximum entropy. This approach is independent of the initial state and produces natural hierarchical clustering solutions by going through a sequence of phase transitions. It is modified for a larger class of optimization problems by adding constraints to the free energy. The concept of constrained clustering is explained, and three examples are are given in which it is used to introduce deterministic annealing. The previous clustering method is improved by adding cluster mass variables and a total mass constraint. The traveling salesman problem is reformulated as constrained clustering, yielding the elastic net (EN) approach to the problem. More insight is gained by identifying a second Lagrange multiplier that is related to the tour length and can also be used to control the annealing process. The open path constraint formulation is shown to relate to dimensionality reduction by self-organization in unsupervised learning. A similar annealing procedure is applicable in this case as well.
A Novel Measure for Quantifying the Topology Preservation of Self-Organizing Feature Maps
Authors: Mu-Chun Su, Hsiao-Te Chang, Chien-Hsing Chou
Venue: Neural Processing Letters (2002)

Recently, feature maps have been applied to various problem domains. The success of some of these applications critically depends on whether feature maps are topologically ordered. In this paper, we propose a novel measure for quantifying the neighborhood preserving property of feature maps. Two data sets were tested to illustrate the performance of the proposed method.
Strongly adjacency-transitive graphs and uniquely shift-transitive graphs
Authors: Tomaz Pisanski, Thomas W. Tucker, Boris Zgrablić
Venue: Discrete Mathematics (2002)

An automorphism σ of a finite simple graph Γ is an adjacency automorphism if for every vertex x ∈ V(Γ), either σx = x or σx is adjacent to x in Γ. An adjacency automorphism fixing no vertices is a shift. A connected graph Γ is strongly adjacency-transitive (respectively, uniquely shift-transitive) if there is, for every pair of adjacent vertices x, y ∈ V(Γ), an adjacency automorphism (respectively, a unique shift) σ ∈ Aut Γ sending x to y. The action graph Γ = ActGrph(G,X,S) of a group G acting on a set X, relative to an inverse-closed nonempty subset S ⊆ G, is defined as follows: the vertex-set of Γ is X, and two different vertices x,y ∈ V(Γ) are adjacent in Γ if and only if y=sx for some s ∈ S. A characterization of strongly adjacency-transitive graphs in terms of action graphs is given. A necessary and sufficient condition for cartesian products of graphs to be uniquely shift-transitive is proposed, and two questions concerning uniquely shift-transitive graphs are raised.
Technology Choices for the JSTOR Online Archive
Authors: Spencer W. Thomas, Ken Alexander, Kevin Guthrie
Venue: Computer (1999)

The rapid pace of technological advance forces system developers to evaluate a constant succession of innovations: What new feature or capability should be integrated into a working system? The ever-increasing power of hardware and software promises a perpetual stream of such decisions, as ever more powerful hardware becomes available. Started as a grant program of The Andrew W. Mellon Foundation, the Foundation's Journal Storage project (JSTOR) investigated the possibility of increasing access to older scholarly materials by converting them to digital media. The authors describe the development of JSTOR and the implementation decisions they made and why they made them. Only by continually updating the technology, while retaining a clear sense of how this technology helps to better serve the core mission of JSTOR, can the resource's value continue.