ppxscal/embedding_network huggingface dataset:
An evaluation of staged run-time optimizations in DyC
Authors: Brian Grant, Matthai Philipose, Markus Mock, Craig Chambers, Susan J. Eggers
Venue: ACM SIGPLAN Notices (1999)

Previous selective dynamic compilation systems have demonstrated that dynamic compilation can achieve performance improvements at low cost on small kernels, but they have had difficulty scaling to larger programs. To overcome this limitation, we developed DyC, a selective dynamic compilation system that includes more sophisticated and flexible analyses and transformations. DyC is able to achieve good performance improvements on programs that are much larger and more complex than the kernels. We analyze the individual optimizations of DyC and assess their impact on performance collectively and individually.
Distributed Object Based Design: Vertical Fragmentation of Classes
Authors: C. I. Ezeife, Ken Barker
Venue: Distributed and Parallel Databases (1998)

Processing costs in distributed environments is most often dominated by the network communications required for interprocess communication. It is well known from distributed relational database design research that careful placement of data &ldquo;near&rdquo; the users or processors where it is used is mandatory or system performance will suffer greatly. Data placement in relational database systems is comparatively simple because the data is flat, structured, and passive. Objects are characterized by an inheritance hierarchy (other hierarchies could also be considered including, class composition and execution), unstructured (possibly dynamic data), and contain a behavioral component that defines how the &ldquo;data&rdquo; is accessed by encapsulating it within the object per se. Algorithms currently exist for fragmenting relations, but the fragmentation and allocation of objects is still a relatively untouched field of study.Similar to relations, objects can be fragmented both horizontally and vertically. Vertical fragmentation must minimize application execution time by splitting a class so that all class attributes and methods frequently accessed together are grouped together into a single fragment. This paper adopts a classification of classes into four main models, and contributes by proposing algorithms for vertically fragmenting the four realizable class models consisting of simple or complex attributes combined with simple or complex methods. Vertical fragmentation entails splitting classes into a set of &ldquo;smaller&rdquo; equivalent classes (actually fragments of the class&lsquo; extent) that can later be placed precisely where they are used. Our approach consists of grouping into a fragment, all attributes and methods of the class frequently accessed together by applications running on either this class, its subclasses, its containing classes or its complex method classes.
Toward Formally-Based Design of Message Passing Programs
Authors: Sergei Gorlatch
Venue: IEEE Transactions on Software Engineering (2000)

We present a systematic approach to the development of message passing programs. Our programming model is SPMD, with communications restricted to collective operations: scan, reduction, gather, etc. The design process in such an architecture-independent language is based on correctness-preserving transformation rules, provable in a formal functional framework. We develop a set of design rules for composition and decomposition. For example, scan followed by reduction is replaced by a single reduction, and global reduction is decomposed into two faster operations. The impact of the design rules on the target performance is estimated analytically and tested in machine experiments. As a case study, we design two provably correct, efficient programs using the Message Passing Interface (MPI) for the famous maximum segment sum problem, starting from an intuitive, but inefficient, algorithm specification.
Centralization of Stocks: Retailers Vs. Manufacturer
Authors: Ravi Anupindi, Yehuda Bassok
Venue: Management Science (1999)

A well-known result in inventory theory is that physical centralization of stocks in a system with multiple retailers decreases total costs and increases total profits for the retailers. However, does this centralization also benefit the manufacturer, whose goods the retailers stock, when customers unsatisfied at retailers due to stock-outs are considered lost sales? In this paper we consider a model with two retailers and one manufacturer. We then compare two systems: one in which the retailers hold stocks separately and the other in which they cooperate to centralize stocks at a single location. We show that whether or not centralization of stocks by retailers increases profits for the manufacturer depends on the level of "market search" in the supply chain. Market search is measured as the fraction of customers who, unsatisfied at their "local" retailer due to a stock-out, search for the good at the other retailer before leaving the system. Specifically, we show that there exists a threshold level for market search above which the manufacturer loses. Furthermore, for "very high" search levels, even the system profit (sum of manufacturer and retailer profits) may decrease upon centralization. We then compare the performance of the two systems under optimal pricing/subsidy mechanisms and show that often a manufacturer is better off in a decentralized system with high market search. We conclude with a discussion of the role of information systems in the decentralized systems.
Automated Visual Presentation: From Heterogeneous Information to Coherent Visual Discourse
Authors: Michelle X. Zhou, Steven K. Feiner
Venue: Journal of Intelligent Information Systems (1998)

Automated visual presentation systems should be able to design effective presentations for heterogeneous (quantitative and qualitative) information. They should also be able to work in static or interactive environments and capable of employing a wide range of visual media and visual techniques. In this paper, we focus on three tasks in building visual production systems: establishing a thorough understanding of the presentation-related characteristics of domain-specific information; classifying several types of visual information and capturing their distinct syntactic, semantic, and pragmatic features; and formulating a set of design principles.We define a data-analysis taxonomy to characterize heterogeneous information. In addition, we have modeled presentation context information such as audience identity to produce user-centered visual design. To utilize and manipulate visual information, we have classified it into visual objects and visual tools based on its role in the visual production process. To guide the visual design process, we have formulated a set of design principles that ensure the expressiveness and effectiveness of a design. To test and evaluate our work, we have developed a prototype system called IMPROVISE based on the research results. We use examples generated by IMPROVISE to illustrate how it constructs visual presentations.
Verifying large-scale multiprocessors using an abstract verification environment
Authors: Dennis Abts, Mike Roberts
Venue: Proceedings of the 36th annual ACM/IEEE Design Automation Conference (1999)

Due to a patent dispute, full text of this article is not available at this time.
On a Representation of the Matching Polytope Via Semidefinite Liftings
Authors: Tamon Stephen, Levent Tuncel
Venue: Mathematics of Operations Research (1999)

We consider the relaxation of the matching polytope defined by the non-negativity and degree constraints. We prove that given an undirected graph on n nodes and the corresponding relaxation of the matching polytope, [n/2] iterations of the Lovasz-Schrijver semidefinite lifting procedure are needed to obtain the matching polytope, in the worst case. We show that [n/2] iterations of the procedure always suffice.
Requirements engineering for product families
Authors: Juha Kuusela, Juha Savolainen
Venue: Proceedings of the 22nd international conference on Software engineering (2000)

In search for improved software quality and high productivity, software reuse has become a key research area. One of the most promising reuse approaches is product families. However, current practices in requirements engineering do not support product families. This paper describes a definition hierarchy method for requirements capturing, structuring, analysis and documentation. This method helps to identify architectural drivers of the product family and shows how different products in the family vary.
Newton's Method for Discrete Algebraic Riccati Equations when the Closed-Loop Matrix Has Eigenvalues on the Unit Circle
Authors: Chun-Hua Guo
Venue: SIAM Journal on Matrix Analysis and Applications (1999)

When Newton's method is applied to find the maximal symmetric solution of a discrete algebraic Riccati equation (DARE), convergence can be guaranteed under moderate conditions. In particular, the initial guess does not need to be close to the solution. The convergence is quadratic if the Fr&eacute;chet derivative is invertible at the solution. When the closed-loop matrix has eigenvalues on the unit circle, the derivative at the solution is not invertible. The convergence of Newton's method is shown to be either quadratic or linear with the common ratio $\frac{1}{2}$, provided that the eigenvalues on the unit circle are all semisimple. The linear convergence appears to be dominant, and the efficiency of the Newton iteration can be improved significantly by applying a double Newton step at the right time.
Approximation of Liquid Crystal Flows
Authors: Chun Liu, Noel J. Walkington
Venue: SIAM Journal on Numerical Analysis (2000)

The numerical solution of the flow of a liquid crystal governed by a particular instance of the Ericksen--Leslie equations is considered. Convergence of finite element approximations is established under appropriate regularity hypotheses, and numerical experiments exhibiting the interaction of singularities and the coupling of the director and momentum equations are presented.
A formative evaluation of scenario-based tools for learning object-oriented design
Authors: Hope D. Harley, Cheryl D. Seals, Mary Beth Rosson
Venue: Crossroads (1998)

Advances in computing have awakened a century old teaching philosophy: learner-centered education. This philosophy is founded on the premise that people learn best when engrossed in the topic, participating in activities that motivate learning and help them to synthesize their own understanding. We consider how the object-oriented design (OOD) learning tools developed by Rosson and Carroll [5] facilitate active learning of this sort. We observed sixteen students as they worked through a set of user interaction scenarios about a blackjack game. We discuss how the features of these learning tools influenced the students' efforts to learn the basic constructs of OOD.
Rank Modifications of Semidefinite Matrices Associated with a Secant Update Formula
Authors: Moody T. Chu, R. E. Funderlic, Gene H. Golub
Venue: SIAM Journal on Matrix Analysis and Applications (1999)

This paper analyzes rank modification of symmetric positive definite matrices H of the form H-M+P, where H-M denotes a step of reducing H to a lower-rank, symmetric and positive semidefinite matrix and (H-M)+P denotes a step of restoring H-M to a symmetric positive definite matrix. These steps and their generalizations for rectangular matrices are fully characterized. The well-known BFGS and DFP updates used in Hessian and inverse Hessian approximations provided the motivation for the generalizations and are special cases with H and P having rank one.
Visual Recognition and Categorization on the Basis of Similarities to Multiple Class Prototypes
Authors: Sharon Duvdevani-Bar, Shimon Edelman
Venue: International Journal of Computer Vision (1999)

One of the difficulties of object recognition stems from the need to overcome the variability in object appearance caused by pose and other factors, such as illumination. The influence of these factors can be countered by learning to interpolate between stored views of the target object, taken under representative combinations of viewing conditions. Difficulties of another kind arise in daily life situations that require categorization, rather than recognition, of objects. Although categorization cannot rely on interpolation between stored examples, we show that knowledge of several representative members, or prototypes, of each of the categories of interest can provide the necessary computational substrate for the categorization of new instances. We describe a system that represents input shapes by their similarities to several prototypical objects, and show that it can recognize new views of the familiar objects, discriminate among views of previously unseen shapes, and attribute the latter to familiar categories.
Preserving Symmetry in Preconditioned Krylov Subspace Methods
Authors: T. F. Chan, E. Chow, Y. Saad, M. C. Yeung
Venue: SIAM Journal on Scientific Computing (1998)

We consider the problem of solving a linear system A x = b when A is nearly symmetric and when the system is preconditioned by a symmetric positive definite matrix M. In the symmetric case, we can recover symmetry by using M-inner products in the conjugate gradient (CG) algorithm. This idea can also be used in the nonsymmetric case, and near symmetry can be preserved similarly. Like CG, the new algorithms are mathematically equivalent to split preconditioning but do not require M to be factored. Better robustness in a specific sense can also be observed. When combined with truncated versions of iterative methods, tests show that this is more effective than the common practice of forfeiting near-symmetry altogether.
Bringing order to the Web: automatically categorizing search results
Authors: Hao Chen, Susan Dumais
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (2000)

We developed a user interface that organizes Web search results into hierarchical categories. Text classification algorithms were used to automatically classify arbitrary search results into an existing category structure on-the-fly. A user study compared our new category interface with the typical ranked list interface of search results. The study showed that the category interface is superior both in objective and subjective measures. Subjects liked the category interface much better than the list interface, and they were 50% faster at finding information that was organized into categories. Organizing search results allows users to focus on items in categories of interest rather than having to browse through all the results sequentially.
Quantitative Error Control for Finite Element Methods for One-Dimensional Compressible Flow
Authors: Robert Sandboge
Venue: SIAM Journal on Numerical Analysis (1998)

We prove a posteriori $L_{2}(L_{2})$ and $L_{\infty}(H^{-1})$ residual based error estimates. The estimates contain certain strong stability factors or weights related to the solution of a linearized dual problem associated with the Euler equations. We compute the stability factors and weights by solving the dual problem numerically and show that quantitative error control is possible for one-dimensional (1-D) compressible flow.
Object model resurrection &mdash; an object oriented maintenance activity
Authors: Gokul V. Subramaniam
Venue: Proceedings of the 22nd international conference on Software engineering (2000)

This paper addresses the problem of reengineering object-oriented systems that have incurred increased maintenance cost due to long development time-span and project lifecycle. When an Incremental Approach is used to develop an object-oriented system, there is a risk that the class design and the overall object model will deteriorate in quality with each increment. A recent research work suggested a process activity (Class Deterioration Detection and Resurrection - CDDR process activity) and a technique for the detection and resurrection of deteriorated classes [5]. That work focussed on one particular aspect of object-oriented software maintenance - Class Quality Deterioration due to lack of cohesion induced by high coupling. This paper addresses the problem of deteriorating object-oriented design due to code and class growth (increase in the number of classes) within a system. A Code/Class Growth Control process activity (CGC) is suggested to avoid and eliminate Repetitions Code and Classes within the evolving system. The CDDR and CGC process activities are used to build an evolving Maintenance process model for object-oriented systems. The presented maintenance process model is an effective way to periodically assess and resurrect the quality of an object-oriented design during incremental development.
Negotiated learning contracts in team projects
Authors: Malcolm Birtle
Venue: Annals of Software Engineering (1999)

The successful evolution of a negotiated learning practice in software engineering team projects is described. The background to negotiated learning practices is reviewed and it is noted that a concern for process issues might be related to software quality management concerns. Negotiated learning was used to develop learning autonomy and to encourage process improvement. The integration of learning contracts and existing software engineering quality management techniques has produced an approach which has enabled teams of students to effectively define and reflect on systems development and learning processes. Individual assessment was enhanced by including processes for the visibility and traceability of contributions in the negotiation process. The gradual evolution of the practice is described with some detail of the current context provided. Evaluations have indicated that teams can become more actively engaged in learning and develop reflective skills in a structured manner by exploiting mechanisms for negotiation.
An integrated algorithm for combined placement and libraryless technology mapping
Authors: Yanbin Jiang, Sachin S. Sapatnekar
Venue: Proceedings of the 1999 IEEE/ACM international conference on Computer-aided design (1999)

This paper presents a new solution for combining technology mapping with placement, coupling the two into one phase. The original aspects of our work are the use of libraryless mapping and a state space search mechanism that is used to find the best solution. Several heuristics are presented for speeding up the search. Comparisons with a more conventional approach show that these strategies provide improvements of about 20%, with reasonable CPU times, on benchmark circuits.
Using network interface support to avoid asynchronous protocol processing in shared virtual memory systems
Authors: Angelos Bilas, Cheng Liao, Jaswinder Pal Singh
Venue: Proceedings of the 26th annual international symposium on Computer architecture (1999)

The performance of page-based software shared virtual memory (SVM) is still far from that achieved on hardware-coherent distributed shared memory (DSM) systems. The interrupt cost for asynchronous protocol processing has been found to be a key source of performance loss and complexity.This paper shows that by providing simple and general support for asynchronous message handling in a commodity network interface (NI), and by altering SVM protocols appropriately, protocol activity can be decoupled from asynchronous message handling and the need for interrupts or polling can be eliminated. The NI mechanisms needed are generic, not SVM-dependent. They also require neither visibility into the node memory system nor code instrumentation to identify memory operations. We prototype the mechanisms and such a synchronous home-based LRC protocol, called GeNIMA (GEneral-purpose Network Interface support in a shared Memory Abstraction), on a cluster of SMPs with a programmable NI, though the mechanisms are simple and do not require programmability.We find that the performance improvements are substantial, bringing performance on a small-scale SMP cluster much closer to that of hardware-coherent shared memory for many applications, and we show the value of each of the mechanisms in different applications. Application performance improves by about 37% on average for reasonably well performing applications, even on our relatively slow programmable NI, and more for others. We discuss the key remaining bottlenecks at the protocol level and use a firmware performance monitor in the NI to understand the interactions with and the implications for the communication layer.
Consistent Gradient Operators
Authors: Shigeru Ando
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2000)

Fine, accurate gradient information is required in many image-processing algorithms and systems including differential geometric methods, orientation analysis, and integrated vision sensors. In this paper, wepropose optimal gradient operators based on a newly derived consistency criterion. This criterion is based on an orthogonal decomposition of the difference between a continuous gradient and discrete gradients into the intrinsic smoothing effect and the self-inconsistency involved in the operator. We show that consistency assures the exactness of gradient direction of a locally one-dimensional (1D) pattern in spite of its orientation, spectral composition, and subpixel translation. Stressing that inconsistency reduction is of primary importance, we derive an iterative algorithm which leads to accurate gradient operators of arbitrary size. We compute the optimum $3\times 3$, $4\times 4$, and $5\times 5$ operators, compare them with conventional operators and examine the performance for one synthetic and several real images. The results indicate that the proposed operators are superior with respect to accuracy, bandwidth, and isotropy.
Analysis and Compensation of Log-Domain Biquadratic Filter Response Deviations due to Transistor Nonidealities
Authors: Vincent W. Leung, Gordon W. Roberts
Venue: Analog Integrated Circuits and Signal Processing (2000)

A translinear log-domain integrator, the powerhouse of log-domain filtering techniques, is analyzed to determine its deviations due to major time-invariant bipolar transistor imperfections, such as parasitic emitter and base resistances, finite beta, Early effect, and area mismatches. The results are used to predict the transfer function deviations of biquad filters, for both lowpass and bandpass filter responses. It will be shown that the errors can be understood and categorized into integrator scalar and negative feedback errors, and how they can be electronically compensated. SPICE simulations, both large and small-signal analysis, are performed to verify the results.
Profitability and Marketability of the Top 55 U.S. Commercial Banks
Authors: Lawrence M. Seiford, Joe Zhu
Venue: Management Science (1999)

Utilizing recent developments in data envelopment analysis (DEA), this paper examines the performance of the top 55 U.S. commercial banks via a two-stage production process that separates profitability and marketability. Substantial performance inefficiency is uncovered in both dimensions. Relatively large banks exhibit better performance on profitability, whereas smaller banks tend to perform better with respect to marketability. New contextdependent performance measures are defined for profitability and marketability which employ a DEA stratification model and a DEA attractiveness measure. When combined with the original DEA measure, the context-dependent performance measure better characterizes the profitability and marketability of 55 U.S. commercial banks. The new approach identifies areas for improved bank performance over the two-stage production process. The effect of acquisition on efficiency and attractiveness is also examined.