ppxscal/embedding_network huggingface dataset:
A trajectory piecewise-linear approach to model order reduction and fast simulation of nonlinear circuits and micromachined devices
Authors: Michał Rewieński, Jacob White
Venue: Proceedings of the 2001 IEEE/ACM international conference on Computer-aided design (2001)

In this paper we present an approach to the nonlinear model reduction based on representing the nonlinear system with a piecewise-linear system and then reducing each of the pieces with a Krylov projection. However, rather than approximating the individual components as piecewise-linear and then composing hundreds of components to make a system with exponentially many different linear regions, we instead generate a small set of linearizations about the state trajectory which is the response to a 'training input'. Computational results and performance data are presented for a nonlinear circuit and a micromachined fixed-fixed beam example. These examples demonstrate that the macromodels obtained with the proposed reduction algorithm are significantly more accurate than models obtained with linear or the recently developed quadratic reduction techniques. Finally, it is shown that the proposed technique is computationally inexpensive, and that the models can be constructed 'on-the-fly', to accelerate simulation of the system response.
Using outside consultants to improve user services
Authors: John Beidler
Venue: Proceedings of the 7th annual ACM SIGUCCS conference on User services (1979)

Through an NSF CAUSE grant, the University of Scranton is expanding and improving its computing support to faculty. As part of this grant three faculty members from other schools visit our institution as consultants. They see our resourses, evaluate our approach, and talk to our faculty in order to get a feeling for the good and bad points of our user services operation. Although these consultants were brought in through the NSF CAUSE grant, the cost of bringing them in was quite small and, therefore, we believe this is an approach towards evaluating user services that is available to everyone.
A Nonblocking Transaction Data Flow Graph Based Protocol For Replicated Databases
Authors: P. Krishna Reddy, Subhash Bhalla
Venue: IEEE Transactions on Knowledge and Data Engineering (1995)

Replicated data management systems adopt the 1-copy serializability criteria for processing transactions. In order to achieve this goal, many approaches rely on obtaining votes from other sites for processing update requests. In the proposed approach, a technique for generation of precedence graphs for each transaction execution is analyzed. The transaction data flow graph approach is a fully distributed approach. The proposed technique, is free from deadlocks, and avoids resubmission of transactions.
Sea of images
Authors: Daniel G. Aliaga, Thomas Funkhouser, Dimah Yanovsky, Ingrid Carlbom
Venue: Proceedings of the conference on Visualization '02 (2002)

A long-standing research problem in computer graphics is to reproduce the visual experience of walking through a large photorealistic environment interactively. On one hand, traditional geometry-based rendering systems fall short of simulating the visual realism of a complex environment. On the other hand, image-based rendering systems have to date been unable to capture and store a sampled representation of a large environment with complex lighting and visibility effects.In this paper, we present a "Sea of Images," a practical approach to dense sampling, storage, and reconstruction of the plenoptic function in large, complex indoor environments. We use a motorized cart to capture omnidirectional images every few inches on a eye-height plane throughout an environment. The captured images are compressed and stored in a multiresolution hierarchy suitable for real-time prefetching during an interactive walkthrough. Later, novel images are reconstructed for a simulated observer by resampling nearby captured images.Our system acquires 15,254 images over 1,050 square feet at an average image spacing of 1.5 inches. The average capture and processing time is 7 hours. We demonstrate realistic walkthroughs of real-world environments reproducing specular reflections and occlusion effects while rendering 15-25 frames per second.
Thermodynamic studies of binary and ternary aqueous polymer solutions
Authors: A. Eliassi, H. Modarress, M. Nekoomanesh
Venue: Iranian Journal of Science and Technology (2002)

The vapor-pressure osmometry (VPO) method was used to measure activities of water for aqueous polymer solutions. The effects of temperature, molecular weight of polymers and their concentrations on the measured activity of water were considered. Using the experimental results, Flory-Huggins interaction parameters for solvent-polymer and polymer-polymer, and the solubility parameters of the used polymers were determined. A simple method was also utilized for determining the Flory-Huggins interaction parameter for solvent in the mixtures of two polymers, polymer(a) and polymer(b). For each case, the mean relative absolute error between calculated and experimental data are reported and it is shown that at studied concentration ranges, the calculated interaction parameter values for calculating thermodynamic properties, are appropriate.
An Early Use of Continuations and Partial Evaluation for Compiling Rules Written in First-Order Predicate Calculus
Authors: Erik Sandewall
Venue: Higher-Order and Symbolic Computation (1999)

This brief historical note describes research done in the period 1970-1973, and where continuations were introduced in a fairly pragmatic way together with partial evaluation in order to compile &ldquo;rules&rdquo; expressed as statements in first-order predicate calculus. Although the methods used at that time were quite straightforward, this work may shed some light on the early history of the concept of continuations. In particular, unlike other early contributions that addressed issues in mainstream programming languages, the present approach initially addressed implementation techniques for special-purpose languages.
A Heuristic for Moment-Matching Scenario Generation
Authors: Kjetil Høyland, Michal Kaut, Stein W. Wallace
Venue: Computational Optimization and Applications (2003)

In stochastic programming models we always face the problem of how to represent the random variables. This is particularly difficult with multidimensional distributions. We present an algorithm that produces a discrete joint distribution consistent with specified values of the first four marginal moments and correlations. The joint distribution is constructed by decomposing the multivariate problem into univariate ones, and using an iterative procedure that combines simulation, Cholesky decomposition and various transformations to achieve the correct correlations without changing the marginal moments.With the algorithm, we can generate 1000 one-period scenarios for 12 random variables in 16 seconds, and for 20 random variables in 48 seconds, on a Pentium III machine.
Computation of Determinants, Adjoint Matrices, and Characteristic Polynomials without Division
Authors: T. R. Seifullin
Venue: Cybernetics and Systems Analysis (2002)

Algorithms are proposed for computing the characteristic polynomial, determinant, and adjoint matrix for a n \times n matrix and for solving a system of n-1 linear homogeneous equations in n variables by Cramer's rule using O(n^{4}) ring operations (without the division operation) over an arbitrary commutative ring. The exponent in the estimate of the computation time can be additionally reduced if an algorithm of asymptotically fast matrix multiplication is used.
Exception handling with workflow evolution in ADOME-WFMS: a taxonomy and resolution techniques
Authors: Dickson K. W. Chiu, Qing Li, Kamalakar Karlapalem
Venue: ACM SIGGROUP Bulletin (1999)

Handling in workflow management systems (WFMSs) is very important since it is not possible to specify all possible outcomes and alternatives beforehand. In this regard, we have been developing ADOME-WFMS to address the problem of workflow exception handling. ADOME is an active OODBMS extended with role facilities for supporting the dynamic features required for online exception handling. Our WFMS features advanced modeling, integrated environment, and effective coordination of human resources [1].
Inferring Correlation Between Database Queries: Analysis of Protein Sequence Patterns
Authors: R. Guigó, T. F. Smith
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1993)

Given a subset P of a database, the problem of finding the query phi in a given database attribute having the closest extension to P is addressed. In the particular case that is outlined, P is the set of protein sequences in a protein sequence database matching a given protein sequence pattern, whereas phi is a query in the annotation of the database. Ideally, phi is the description of a biological function. If the extension of phi is very similar to P, an association between the pattern and the biological function described by the query may be inferred. An algorithm that efficiently searches the query space when negation is not considered is developed. Since the query language is a first-order language, the query space may be mapped into a set algebra in which a measure of stochastic dependence-an asymptotic approximation of the correlation coefficient-is used as a measure of set similarity. The algorithm uses the algebraic properties of such a measure to reduce the time required to search the query space. A prototype implementation of the algorithm has been tested in different collections of protein sequence patterns.
Object-Oriented Real-Time Systems: Concepts and Examples
Authors: Thomas E. Bihari, Prabha Gopinath
Venue: Computer (1992)

The problems associated with developing real-time software systems, including ensuring predictable real-time behavior under both normal and abnormal operating conditions, are outlined. The management of temporal complexity, structuring of dynamic real-time applications, object-oriented models, object-oriented real-time languages, and the requirements for real-time object-oriented models are discussed. Chaos, an object-based language and programming/execution paradigm designed for dynamic real-time applications, is described.
Adaptive routing protocols for hypercube interconnection networks
Authors: Patrick T. Gaughan, Sudhakar Yalamanchili
Venue: Computer (1993)

A taxonomy for characterizing adaptive routing protocols for hypercube interconnection networks (HINs) is presented. The taxonomy is based on classes of routing decisions common to any HIN. This taxonomy is used to discuss existing and proposed protocols. Rather than an exhaustive enumeration of related research, the protocols selected for discussion are intended to be representative of the classes defined by the taxonomy. These protocols are candidates for use in massively parallel architectures configured with HINs. To provide some insight into their behavior in very large HINs, results of simulation studies of representative protocols are presented.
A G-Net Model for Knowledge Representation and Reasoning
Authors: Y. Deng, S. -K. Chang
Venue: IEEE Transactions on Knowledge and Data Engineering (1990)

The G-net model for G-type knowledge representation is introduced. It is capable of modeling both static semantic knowledge and dynamic control knowledge, combining them into a loosely coupled, mixed-type knowledge hierarchy. Four reasoning algorithms for the G-net model are proposed: inheritance reasoning and recognition reasoning for semantic knowledge, event-driven reasoning for dynamic knowledge, and control table reasoning for coordination and control in a mixed-type knowledge hierarchy. Based on the knowledge-table representation, the G-net model expresses the constraints and relationships among knowledge objects explicitly so that reasoning algorithms can be implemented efficiently. Applications to information systems prototyping are discussed.
Service curve assurances versus uplink throughput in CDMA networks
Authors: Lun Tong, Parameswaran Ramanathan, Akbar Sayeed
Venue: Proceedings of the 4th ACM international workshop on Wireless mobile multimedia (2001)

The scheme proposed in this paper balances the partly conflicting objectives of meeting the diverse quality of service (QoS) needs of mobile hosts (MHs) and achieving high uplink throughput in a Direct Sequence Code Division Multiple Access (DS-CDMA) based cellular network. The QoS needs of the MHs are modeled using the notion of a service curve, which is a function characterizing the minimum number of bits a MH must transmit in any given time interval in order to meet its QoS requirement. Each MH is also assumed to have a specified bound on the acceptable bit error rate.The technique proposed in this paper maximizes the uplink throughput subject to the service curve constraints by jointly adapting the transmitted power and the number of spreading codes used by each MH in relaying its data bits. During this joint adaptation, the technique also imposes specified bounds on the transmitted power and the number of spreading codes that a MH can handle. The proposed technique is evaluated using a discrete-event simulation. The evaluation shows that the proposed scheme can effectively balance the two above-mentioned objectives.
Digital image watermarking based on discrete wavelet transform
Authors: Ding Wei, Yan Weiqi, Qi Dongxu
Venue: Journal of Computer Science and Technology (2002)

This paper aims at digital watermark which is a new popular research topic recently, presents some methods to embed digital watermark based on modifying frequency coefficients in discrete wavelet transform (DWT) domain. First, the present progress of digital watermark is briefly introduced; after that, starting from Pitas's method and discarding his pseudo random number method, the authors use a digital image scrambling technology as preprocessing for digital watermarking. Then the authors discuss how to embed a l-bit digital image as watermark in frequency domain. Finally another digital watermarking method is given in which 3-D DWT is used to transform a given digital image. Based on the experimental results, it is shown that the proposed methods are robust to a large extent.
Some Constructions of Conflict-Avoiding Codes
Authors: B. S. Tsybakov, A. R. Rubinov
Venue: Problems of Information Transmission (2002)

Constructions of conflict-avoiding codes are presented. These codes can be used as protocol sequences for successful packet transmission over a collision channel without feedback. We give a relation between codes that avoid conflicts of different numbers of colliding users. Upper bounds on the maximum code size and three particular code constructions are presented.
Design of cosine-modulated filterbanks for partial spectrum reconstruction
Authors: Fabrizio Argenti
Venue: Signal Processing (2002)

In this paper, we present a new technique to design filterbanks that allows the partial reconstruction of the spectrum of a signal. In several applications, there is the need of either decreasing the sampling rate of a signal preserving part of its spectrum or increasing the sampling rate with minimum spectrum degradation. In this paper, we will develop a method based on cosine-modulated filterbanks to accomplish this task. An analysis filterbank is used to divide the spectrum into subbands. Another filterbank, with a different number of channels, is used to reconstruct the spectrum contained in part of (or all) the subbands. The ratio between the input and output sampling rates is equal to the ratio between the analysis downsampling and synthesis upsampling factors. The problem becomes that of designing the prototypes of the analysis and synthesis filterbanks. Several numerical examples of filterbanks design are presented.
The i486 CPU: Executing Instructions in one Clock Cycle
Authors: Stephen C. Johnson
Venue: IEEE Micro (1990)

The author discusses the design goals of the i486 development program, which were to ensure binary compatibility with the 386 microprocessor and the 387 math coprocessor, increase performance by two to three times over a 386/387 processor system at the same clock rate, and extend the IBM PC standard architecture of the 386 CPU with features suitable for minicomputers. A cache integrated into the instruction pipeline lets this 386-compatible processor achieve minicomputer performance levels. The design and performance of the on-chip cache and the instruction pipeline are examined in detail.
Scenario evolution in requirements elicitation processes: scenario pattern and framework approach
Authors: Kenji Watahiki, Motoshi Saeki
Venue: Proceedings of the 4th International Workshop on Principles of Software Evolution (2001)

Scenario-based approach is one of the promising techniques not only to elicit requirements from stakeholders, but also to achieve user-participatory development. The techniques to construct scenarios of high quality with less efforts are necessary. In addition, since during developing a system its requirements are frequently changed by customers and/or users, the techniques to manage the changes to the scenarios and to handle the change propagations on the scenarios are also crucial ones. This paper proposes a solution to the above issues based on reusable pattern techniques and case grammar of natural-language processing techniques. Since scenarios are frequently written in natural language, we abstract case frames as reusable primitive parts to write sentences in a scenario and patterns to combine the case frames so that we can get consistent scenario episodes. These patterns include dependency relationships on the case frames to maintain semantic consistency of the scenarios that have been constructed with the patterns. As a result we can consistently evolve and/or change the existing scenarios to the new ones. We have applied our technique to an application in a rental business domain and assessed that we could construct a consistent scenario efficiently.
Description and comparison of geologic maps with FRAGSTATS: a spatial statistics program
Authors: Gary L. Raines
Venue: Computers Geosciences (2002)

FRAGSTATS is a public-domain GIS implementation of a set of spatial statistics that address a fundamental problem in GIS applications, description and comparison of maps. The spatial statistics from the 1 : 2,500,000-scale United States geologic map of Nevada, the central United States, and the northeastern United States quantify the differences in complexity and variability between these three geologic terranes. Nevada is defined by a large number of patches of small size and low size variability, whereas the Central area has a small number of patches with smaller relative size variability. All three areas have similar map-unit shape complexity with Nevada having the lowest. Based on the density of edges, the areas can be ranked from highest to lowest, as Nevada, Central, and Northeast. The Shannon diversity index ranks the areas from highest to lowest, as Northeast, Nevada, and Central, but the Shannon evenness index ranks them from highest to lowest, as Northeast, Central, and Nevada. These rankings may reflect the influence of folding in the Northeast and Central areas as opposed to basin and range extension in Nevada. The core areas statistic ranks the areas for spatial accuracy from highest to lowest, as Central, Northeast, and Nevada, with Northeast and Nevada being similar.For a scale comparison, the FRAGSTATS statistics quantify the increased complexity and spatial accuracy that is inherent in going from small- to larger-scale maps. For example for 1 : 2,500,000-1 : 500,000-scale maps of Nevada, respectively, the area weighted fractal dimension increases from 1.1 to 1.18, and the total core areas index almost doubles from 39.09 to 63.38. In addition, the fractal dimensions discriminate gross lithology and tectonic terranes.
Beware the Lure of Software Slogans
Authors: John Palmer
Venue: IEEE Software (1996)

A forum for exchanging ideas, philosophy, and experience.I recently spoke with a publisher about how many copies of a new book would be printed. He claimed it would sell well and longer than most because its subject matter wouldn't go stale. Later, when I was looking through the computer-science section of a bookstore, I realized that not all books have such a shelf life ¿ and that many still lining the shelves had already gone stale. Like books, slogans are continually created to address new products and problems. But slogans, too, can grow stale. John Palmer proposes that slogans be "freshness dated."¿Tomoo Matsubara The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Processor and Memory-Based Checkpoint and Rollback Recovery
Authors: Nicholas S. Bowen, Dhiraj K. Pradhan
Venue: Computer (1993)

Several hardware-based techniques that support checkpoint and rollback recovery are presented. The focus is on hardware schemes for uniprocessors, shared-memory multiprocessors, and distributed virtual-memory systems. A taxonomy for processor and memory techniques based on the memory hierarchy is presented. This provides a basis for understanding subtle differences among the various schemes. Processor-based schemes that handle transient faults by using processor-based transparent rollback techniques and memory-based schemes that roll back data instead of instructions and can be integrated with the processor techniques or can be exploited by higher levels of software are discussed.
The Transputer T414 Instruction Set
Authors: Jean-Daniel Nicoud, Andrew Martin Tyrrell
Venue: IEEE Micro (1989)

Describes the instruction set of the T414 transputer. Assembly-language notations that are more familiar to microprocessor-system designers than the Inmos documentation are included. The discussion covers transputer types, registers, memory, communication, addressing modes, data types, programming philosophy, concurrent processes, and the instruction set.
Computing phase noise eigenfunctions directly from steady-state Jacobian matrices
Authors: Alper Demir, David Long, Jaijeet Roychowdhury
Venue: Proceedings of the 2000 IEEE/ACM international conference on Computer-aided design (2000)

The main effort in oscillator phase noise calculation lies in computing a vector function called the Perturbation Projection Vector (PPV). Current techniques for PPV calculation use time domain numerics to generate the system's monodromy matrix, followed by full or partial eigenanalysis. We present a superior method that finds the PPV using only a single linear solution of the oscillator's time- or frequency-domain steady-state Jacobian matrix. The new method is better suited for existing tools with fast harmonic balance or shooting capabilities, and also more accurate than explicit eigenanalysis. A key advantage is that it dispenses with the need to select the correct one-eigenfunction from amongst a potentially large set of choices, an issue that explicit eigencalculation based methods have to face.