ppxscal/embedding_network huggingface dataset:
Using computer algebra systems in the development of scientific computer codes
Authors: Aldo Dall'Osso
Venue: Future Generation Computer Systems (2003)

During the first years of the computer era no tools were available to aid scientists in the development of their computer codes. Code production was a pretty handicraft job. The last years have seen the resurgence of many concepts whose aim is to reduce the man effort in building scientific systems. These ideas spread from the reusable component concept to the multi-purpose problem-solving environment (PSE). This paper presents an approach that takes all the power of computer algebra systems (CASs) to easily specify a scientific problem solver and to automatically generate a computer program in standard language (as Fortran or C) that implements it. An application using a well-known CAS, Mathematica, is presented to show the methodology.
Process Management and Supply-Chain Integration at the Bose Corporation
Authors: Albert H. Segars, Warren J. Harkness, William J. Kettinger
Venue: Interfaces (2001)

The Bose Corporation has developed an approach to quality management that is driving the integration of manufacturing and selling across its supply chain. Instead of designing a path towards integrated process improvement, Bose has evolved through definable stages in achieving its view of processes and business relationships. In the early stages, managers commonly explore and discover process concepts informally. They acquire a sense of urgency, achieve early successes, and develop a leadership coalition. As they better understand quality management in the context of the organization, managers formalize their efforts and share them widely. Credible management communication and top management support are important. Finally, managers link the process thinking created within the organization with process efforts of the business coalition. At this stage, mobilizing a business coalition and creating a compelling business case are important. Bose's experiences provide a guide for process improvement within the organization and across the supply chain.
Architecting durable things
Authors: Kemal A. Delic
Venue: Ubiquity (2002)

Enterprise design should be more like the B-52.
Contouring curved quadratic elements
Authors: D. F. Wiley, H. R. Childs, B. F. Gregorski, B. Hamann, K. I. Joy
Venue: Proceedings of the symposium on Data visualisation 2003 (2003)

We show how to extract a contour line (or isosurface) from quadratic elements---specifically from quadratic triangles and tetrahedra. We also devise how to transform the resulting contour line (or surface) into a quartic curve (or surface) based on a curved-triangle (curved-tetrahedron) mapping. A contour in a bivariate quadratic function defined over a triangle in parameter space is a conic section and can be represented by a rational-quadratic function, while in physical space it is a rational quartic. An isosurface in the trivariate case is represented as a rational-quadratic patch in parameter space and a rational-quartic patch in physical space. The resulting contour surfaces can be rendered efficiently in hardware.
Approximating a minimum Manhattan network
Authors: Joachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan
Venue: Nordic Journal of Computing (2001)

Given a set S of n points in the plane, we define a Manhattan Network on S as a rectilinear network G with the property that for every pair of points in S, the network G contains the shortest rectilinear path between them. A Minimum Manhattan Network on S is a Manhattan network of minimum possible length. A Manhattan network can be thought of as a graph G=(V,E), where the vertex set V corresponds to points from S and a set of Steiner points S', and the edges in E correspond to horizontal or vertical line segments connecting points in S U S'. A Manhattan network can also be thought of as a 1-spanner (for the L1-metric) for the points in S.Let R be an algorithm that produces a rectangulation of a staircase polygon in time R(n) of weight at most r times the optimal. We design an O(n\log n + R(n)) time algorithm which, given a set S of n points in the plane, produces a Manhattan network on S with total weight at most 4r times that of a minimum Manhattan network. Using known rectangulation algorithms, this gives us an O(n3)-time algorithm with approximation factor four, and an O(n \log n)-time algorithm with approximation factor eight.
When do bounds and domain propagation lead to the same search space
Authors: Christian Schulte, Peter J. Stuckey
Venue: Proceedings of the 3rd ACM SIGPLAN international conference on Principles and practice of declarative programming (2001)

This paper explores the question of when two propagation-based constraint systems have the same behaviour, in terms of search space. We categorise the behaviour of domain and bounds propagators for primitive constraints, and provide theorems that allow us to determine propagation behaviours for conjunctions of constraints. We then show how we can use this to analyse CLP(FD) programs to determine when we can safely replace domain propagators by more efficient bounds propagators without increasing search space.
Pareto optimum sensitivity analysis in multicriteria optimization
Authors: W. H. Zhang
Venue: Finite Elements in Analysis and Design (2003)

Multicriteria optimization problems are addressed in this paper. The gradient projection method originally used as a sort of feasible direction method is further developed and extended to the Pareto optimum sensitivity analysis. It is shown that the projected search direction defines the tangent direction of the Pareto optimum curve in the objective space. Since this method is able to identify automatically the variation of the active constraint set due to the perturbation, discontinuous derivative cases can be efficiently dealt with. To validate the method, numerical examples are solved. A comparison of the results with those obtained by the finite difference method and tangent method shows good agreement.
Limit structures over completely distributive lattices
Authors: Yong-Ming Li
Venue: Fuzzy Sets and Systems (2002)

The notion of a limit molecular lattice--a completely distributive lattice with some kinds of convergence of ideals on it--is introduced. It is proved that the category of limit molecular lattices is a cartesian closed category containing the category of topological molecular lattices as a bireflective full subcategory and the category of limit spaces as a reflective and coreflective subcategory, respectively. Noteworthy is the distinctive order property of the convergence of ideals on the limit molecular lattice compared to that of limit spaces. The L-fuzzy version of fuzzy limit space is introduced, and it is proved that the category of L-fuzzy limit spaces is a nonfull coreflective subcategory of the category of limit molecular lattices.
A Formal Approach to MpSoC Performance Verification
Authors: Kai Richter, Marek Jersak, Rolf Ernst
Venue: Computer (2003)

Multiprocessor system on chip designs use complex on-chip networks to integrate different programmable processor cores, specialized memories, and other components on a single chip.MpSoCs have become the architecture of choice in many industries. Their heterogeneity inevitably increases with intellectual-property integration and component specialization. System integration is becoming a major challenge in their design.Simulation is state of the art in MpSoC performance verification, but it has conceptual disadvantages that become disabling as complexity increases. Formal approaches offer a systematic alternative.
New convergence results on the generalized Richardson extrapolation process GREP (1) for logarithmic sequences
Authors: Avram Sidi
Venue: Mathematics of Computation (2002)

Let a(t) ∼ A + φ(t) Σi=0∞ βiti as t → 0+, where a(t) and φ(t) are known for 0 < t ≤ c for some c > 0, but A and the βi are not known. The generalized Richardson extrapolation process GREP(1) is used in obtaining good approximations to A, the limit or antilimit of a(t) as t → 0+. The approximations An(j) to A obtained via GREP(1) are defined by the linear systems a(tl) = An(j) + φ(tl) Σi=0n-1 β'itli, l=j,j+1,...,j + n, where {tl}l=0∞ is a decreasing positive sequence with limit zero. The study of GREP(1) for slowly varying functions a(t) was begun in two recent papers by the author. For such a(t) we have φ(t) ∼ αtδ as t → 0+ with δ possibly complex and δ ≠ 0, -1, -2,.... In the present work we continue to study the convergence and stability of GREP(1) as it is applied to such a(t) with different sets of collocation points tl that have been used in practical situations. In particular, we consider the cases in which (i) tl are arbitrary, (ii) liml→∞ tl+1/tl = 1, (iii) tl ∼ cl-q as l → ∞ for some c,q > 0, (iv) tl+1/tl ≤ ω ∈ (0, 1) for all l, (v) liml → ∞ tl+1/tl = ω ∈ (0, 1), and (vi) tl+1/tl= ω ∈ (0, 1) for all l.
Nursing staff requirements for telemedicine in the neonatal intensive care unit
Authors: Tara Qavi, Lisa Corley, Steve Kay
Venue: Advanced topics in end user computing (2002)

This research gauged nursing staff acceptance of a videoconferencing system within a Neonatal Intensive Care Unit (NICU) and identified a set of recommendations to be integrated into system design to maximize usability of the system by nursing end users. Both qualitative and quantitative data was collected through interview and questionnaire methods, designed to elicit system requirements from the nursing staff perspective. It is argued that videoconferencing should not substitute the physical tradition in which neonatal infants are monitored, nor be seen as a replacement for face-to-face communication. However, videoconferencing may provide a workable alternative when face-to-face communication is not possible. In particular, clinical and medical staff should maintain control over the operation of video links at all times.
A Network Manager on Ethernets for Distributed Multimedia Systems
Authors: V. Balachandran, G. Bhat, S. Chakravarty, Aidong Zhang
Venue: Proceedings of the 22nd Annual IEEE Conference on Local Computer Networks (1997)

Distributed multimedia systems require good quality of service for real-time data transmission. Ethernets, which use a non-deterministic protocol, cannot guarantee the requested bandwidth and there is a large variance in the data rate. A novel approach to supporting multimedia applications over Ethernets, where constant data rates and bandwidth requirements are guaranteed, is proposed. Unlike known solutions, our approach does not require any changes either to the existing software or the Ethernet hardware.
Revealing information while preserving privacy
Authors: Irit Dinur, Kobbi Nissim
Venue: Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems (2003)

We examine the tradeoff between privacy and usability of statistical databases. We model a statistical database by an n-bit string d1,..,dn, with a query being a subset q &sube; [n] to be answered by &Sigma;i&epsilon;q di. Our main result is a polynomial reconstruction algorithm of data from noisy (perturbed) subset sums. Applying this reconstruction algorithm to statistical databases we show that in order to achieve privacy one has to add perturbation of magnitude (&Omega;&radic;n). That is, smaller perturbation always results in a strong violation of privacy. We show that this result is tight by exemplifying access algorithms for statistical databases that preserve privacy while adding perturbation of magnitude &Otilde;(&radic;n).For time-T bounded adversaries we demonstrate a privacypreserving access algorithm whose perturbation magnitude is &asymp; &radic;T.
Antiproton-Hydrogen Atom Collision at Intermediate Energy
Authors: Reiko Suzuki, Hiroshi Sato, Mineo Kimura
Venue: Computing in Science and Engineering (2002)

The authors study ionization processes in antiproton-hydrogen atom collision using a molecular-orbital close-coupling approach within the semiclassical representation. They visually present the results of electron densities' time development during the collision. This approach achieves a more effective understanding of collision dynamics for the antiproton-hydrogen atom system. Visualization of the electron behavior at each time-development during the collision also provides a clear grasp of the underlying physics.
Sustainability and Performance at Interface, Inc.
Authors: Jennifer R. DuBose
Venue: Interfaces (2000)

Interface, Inc., the world's leader in commercial carpet tile, also manufactures and sells 12-foot broadloom carpet, interior fabrics, access flooring, cushion backing, and specialty chemicals. The company has made a strategic commitment to sustainability and integrated this with a monetary incentive plan. The bonus plan gave concrete direction to the company's sustainability mission and sped up the implementation of projects. The company's progress toward becoming a sustainable corporation is due to a number of key factors, including top leadership, administrative direction, training, outside input, and financial scrutiny. Interface's experience shows that a well-designed incentive program can motivate employees to implement sustainability practices.
The equality &#x03B2;2(k+2,S(n))= &#x03B2;2(k+1,S(n))+ &#x03B2;2(k,S(n))
Authors: Xingen Chen
Venue: Smarandache notions (2002)

For any positive integer a, let S(a) be the Smarandache function of a. For any positive integer r and b, let β (r,b) be the last r digits of b. In this paper we determine all positive integer pairs (n,k) for which the title equality holds.
A model of factors affecting an information system's change in state
Authors: Jon Heales
Venue: Journal of Software Maintenance: Research and Practice (2002)

Management are keen to maximize the life span of an information system because of the high cost, organizational disruption, and risk of failure associated with the re-development or replacement of an information system. This research investigates the effects that various factors have on an information system's life span by understanding how the factors affect an information system's stability. The research builds on a previously developed two-stage model of information system change whereby an information system is either in a stable state of evolution in which the information system's functionality is evolving, or in a state of revolution, in which the information system is being replaced because it is not providing the functionality expected by its users.A case study surveyed a number of systems within one organization. The aim was to test whether a relationship existed between the base value of the volatility index (a measure of the stability of an information system) and certain system characteristics. Data relating to some 3000 user change requests covering 40 systems over a 10-year period were obtained. The following factors were hypothesized to have significant associations with the base value of the volatility index: language level (generation of language of construction), system size, system age, and the timing of changes applied to a system. Significant associations were found in the hypothesized directions except that the timing of user changes was not associated with any change in the value of the volatility index.
Some recent advances in projection-type methods for variational inequalities
Authors: Naihua Xiu, Jianzhong Zhang
Venue: Journal of Computational and Applied Mathematics (2003)

Projection-type methods are a class of simple methods for solving variational inequalities, especially for complementarity problems. In this paper we review and summarize recent developments in this class of methods, and focus mainly on some new trends in projection-type methods.
Randomized two-process wait-free test-and-set
Authors: John Tromp, Paul Vitányi
Venue: Distributed Computing (2002)

We present the first explicit, and currently simplest, randomized algorithm for two-process wait-free test-and-set. It is implemented with two 4-valued single writer single reader atomic variables. A test-and-set takes at most 11 expected elementary steps, while a reset takes exactly 1 elementary step. Based on a finite-state analysis, the proofs of correctness and expected length are compressed into one table.
A Unified Approach to Detecting Spatial Outliers
Authors: Shashi Shekhar, Chang-Tien Lu, Pusheng Zhang
Venue: Geoinformatica (2003)

Spatial outliers represent locations which are significantly different from their neighborhoods even though they may not be significantly different from the entire population. Identification of spatial outliers can lead to the discovery of unexpected, interesting, and implicit knowledge, such as local instability. In this paper, we first provide a general definition of S-outliers for spatial outliers. This definition subsumes the traditional definitions of spatial outliers. Second, we characterize the computation structure of spatial outlier detection methods and present scalable algorithms. Third, we provide a cost model of the proposed algorithms. Finally, we experimentally evaluate our algorithms using a Minneapolis-St. Paul (Twin Cities) traffic data set.
Activity rhythm detection and modeling
Authors: Rosco Hill, James Begole
Venue: CHI '03 extended abstracts on Human factors in computing systems (2003)

We present an algorithm for detecting and modeling rhythmic temporal patterns in the record of an individual's computer activity, or online "presence." The model is both predictive and descriptive of temporal features and is constructed with minimal a priori knowledge.
The Tale of One-Way Functions
Authors: L. A. Levin
Venue: Problems of Information Transmission (2003)

The existence of one-way functions (owf) is arguably the most important problem in computer theory. The article discusses and refines a number of concepts relevant to this problem. For instance, it gives the first combinatorial complete owf, i.e., a function which is one-way if any function is. There are surprisingly many subtleties in basic definitions. Some of these subtleties are discussed or hinted at in the literature and some are overlooked. Here, a unified approach is attempted.
INDUCTWISE: inductance-wise interconnect simulator and extractor
Authors: Tsung-Hao Chen, Clement Luk, Hyungsuk Kim, Charlie Chung-Ping Chen
Venue: Proceedings of the 2002 IEEE/ACM international conference on Computer-aided design (2002)

We develop a robust, efficient, and accurate tool, which integrates inductance extraction and simulation, called INDUCTWISE. This paper advances the state-of-the-art inductance extraction and simulation techniques and contains two major parts. In the first part, INDUCTWISE extractor, we discover the recently proposed inductance matrix sparsification algorithm, the K-method[1], albeit its great benefits of efficiency, has a major flaw on the stability. We provide both a counter example and a remedy for it. A window section algorithm is also presented to preserve the accuracy of the sparsification method. The second part, INDUCTWISE simulator, demonstrates great efficiency of integrating the nodal analysis formulation with the improved K-method. Experimental results show that INDUCTWISE has over 250x speedup compared to SPICE3. The proposed sparsification algorithm accelerates the simulator another 175x and speeds up the extractor 23.4x within 0.1% of error. INDUCTWISE can extract and simulate an 118K-conductor RKC circuit within 18 minutes. It has been well tested and released on the web for public usage. (http://vlsi.ece.wisc.edu/Inductwise.htm)
Bounds for the smallest norm in an ideal class
Authors: Ana-Cecilia de la Maza
Venue: Mathematics of Computation (2002)

We develop a method for obtaining upper bounds for the smallest norm among all norms of integral ideals in an ideal class. Applying this to number fields of small degree, we are able to substantially improve on the best previously known bounds.
Synchronization in networks of excitatory and inhibitory Neurons with sparse, random connectivity
Authors: Christoph Börgers, Nancy Kopell
Venue: Neural Computation (2003)

In model networks of E-cells and I-cells (excitatory and inhibitory neurons, respectively), synchronous rhythmic spiking often comes about from the interplay between the two cell groups: the E-cells synchronize the I-cells and vice versa. Under ideal conditions--homogeneity in relevant network parameters and all-to-all connectivity, for instance--this mechanism can yield perfect synchronization. We find that approximate, imperfect synchronization is possible even with very sparse, random connectivity. The crucial quantity is the expected number of inputs per cell. As long as it is large enough (more precisely, as long as the variance of the total number of synaptic inputs per cell is small enough), tight synchronization is possible. The desynchronizing effect of random connectivity can be reduced by strengthening the E → I synapses. More surprising, it cannot be reduced by strengthening the I → E synapses. However, the decay time constant of inhibition plays an important role. Faster decay yields tighter synchrony. In particular, in models in which the inhibitory synapses are assumed to be instantaneous, the effects of sparse, random connectivity cannot be seen.
Management of Multi-Item Retail Inventory Systems with Demand Substitution
Authors: Stephen A. Smith, Narendra Agrawal
Venue: Operations Research (2000)

Customers for retail merchandise can often be satisfied with one of several items. Accounting for demand substitution in defining customer service influences the choice of items to stock and the optimal inventory level for each item stocked. Further, when certain items are not stocked, the resulting substitutions increase the demand for other items, which also affects the optimal stock levels. In this paper, we develop a probabilistic demand model for items in an assortment that captures the effects of substitution and a methodology for selecting item inventory levels so as to maximize total expected profit, subject to given resource constraints. Illustrative examples are solved to provide insights concerning the behavior of the optimal inventory policies, using the negative binomial demand distribution, which has performed well in fitting retail sales data.
How to develop and to reuse the UniPDM framework
Authors: Jeong Ah Kim
Venue: Software&mdash;Practice Experience (2002)

Reuse through frameworks promises improved productivity and reduced learning curves across the enterprise. Although many enterprise framework projects have commenced, few real enterprise frameworks have achieved noteworthy success. Our research with enterprise frameworks focuses on product data management. In this paper we focus on the current state and the findings of our project. Through our efforts we believe we have identified some important lessons for teams involved in enterprise framework development. Our discussion will concentrate on the following: (1) the phases of developing our framework; (2) applying the design pattern; (3) supporting environments for customizing the framework; (4) the problems in developing a framework.
On undetectable faults in partial scan circuits
Authors: Irith Pomeranz, Sudhakar M. Reddy
Venue: Proceedings of the 2002 IEEE/ACM international conference on Computer-aided design (2002)

We provide a definition of undetectable faults in partial scan circuits under a test application scheme where a test consists of primary input vectors applied at-speed between scan operations. We also provide sufficient conditions for a fault to be undetectable under this test application scheme. We present experimental results on finite-state machine benchmarks to demonstrate the effectiveness of these conditions in identifying undetectable faults.