ppxscal/embedding_network huggingface dataset:
Applying Software Product-Line Architecture
Authors: David Dikel, David Kane, Steve Ornburn, William Loftus, Jim Wilson
Venue: Computer (1997)

Many organizations today are investing in software product-line architecture-for good reason: A well-executed architecture enables organizations to respond quickly to a redefined mission or to new and changing markets. It allows them to accelerate the introduction of new products and improve their quality, to reengineer legacy systems, and to manage and enhance the many product variations needed for international markets. Sharing a common software architecture across a product line brings a core set of knowledge and assets to the development process. Product-line architecture not only reduces the complexity and cost of developing and maintaining code, but also streamlines the production of documentation, training materials, and product literature. However, technically excellent product-line architectures do fail, often because they are not effectively used. Some are developed but never used; others lose value as product teams stop sharing the common architecture; still others achieve initial success, but fail to keep up with a rapidly growing product mix. Sometimes the architecture deterioration is not noticed at first, masked by what appears to be a productivity increase. To learn what factors determine the effective use of software architecture, we looked at Nortel (Northern Telecom), a company with nearly 20 years of experience developing complex software architecture for telecommunications product families. We identified six principles that help reduce the complexity of an evolving family of products and that support and maintain the effective use and integrity of the architecture. Nortel's experience provides compelling evidence of software architecture's benefits and risks and shows the importance of organizational behaviors. We observed, however, that applying a principle without discrimination-too much, too little, or without focus-also caused negative consequences. How does one strike a balance? Our conclusion is that architecture is most effective in delivering value and managing complexity when the six critical organizational principles are applied in concert.
Transfer Function Computation for Multidimensional Systems
Authors: George E. Antoniou
Venue: Multidimensional Systems and Signal Processing (2002)

A theoretically interesting technique is proposed for the determination of the coefficients of the determinantal polynomial and the coefficients of the adjoint polynomial matrix of a given n-D system, described by the Fornasini-Marchesini state space model. The proposed algorithms are based on the discrete Fourier transform (DFT), and easily can be implemented. An example is included to illustrate the application of the algorithm.
Design of a Link Control Protocol for Multimedia Services in Wireless Local Communication
Authors: Anirban Roy, Pallapa Venkataram
Venue: Wireless Personal Communications: An International Journal (2001)

The convergence of wireless systems with multimedia services is the challenge of future generation wireless networks. The large variety of QoS requirements of different media as well as the maintenance of synchronization of the different streams to be presented at receiver, demand from the Data link layer some extra functionalities. In this paper, we present an enhanced approach for the efficient management of multimedia applications in third-generation wireless networks. We advocate the use of multiple connections, one for each traffic component of the application, as the effective solution for the transport of multimedia applications in future-generation wireless networks. The effectiveness of this scheme is guaranteed by providing a new link control technique that works on top of a PRMA-type access protocol which jointly manages different streams of a multimedia application. For this purpose, we propose a two-level priority mechanism (static and dynamic priorities) specified by higher protocol layers for link activation, channel access, and admission control procedures specific to a multimedia application and for optimizing the sharing of radio channel resources and management of the reservation queue at the base station. We expect this priority-based mechanism to perform well, especially during periods in which system traffic load is high, and to react well to the deterioration of multimedia service quality, in terms of both QoS parameters and the synchronization of its traffic components.
The Ramsey size number of dipaths
Authors: David Reimer
Venue: Discrete Mathematics (2002)

Let H be a finite graph. The Ramsey size number of H, r(H,H), is the minimum number of edges required to construct a graph such that when its edges are 2-colored it contains a monochromatic subgraph, H. In this paper we prove that the Ramsey size number of a directed path is quadratic.
System synthesis of synchronous multimedia applications
Authors: Gang Qu, Miodrag Potkonjak
Venue: ACM Transactions on Embedded Computing Systems (TECS) (2003)

Modern system design is being increasingly driven by applications such as multimedia and wireless sensing and communications, which have intrinsic quality of service (QoS) requirements, such as throughput, error-rate, and resolution. One of the most crucial QoS guarantees that the system has to provide is the timing constraint among the interacting media (synchronization) and within each media (latency). We have developed the first framework for system design with timing QoS guarantees. In particular, we address how to design system-on-chip with minimum silicon area to meet both latency and synchronization constraints. The proposed design methodology consists of two phases: hardware configuration selection and on-chip memory/storage minimization. In the first phase, we use silicon area and system performance as criteria to identify all the competitive hardware configurations (i.e., Pareto points) that facilitate the needs of synchronous applications. In the second phase, we determine the minimum on-chip memory requirement to meet the timing constraints for each Pareto point. An overall system evaluation is conducted to select the best system configuration. We have developed optimal algorithms that schedule a priori specified applications to meet their synchronization requirements with the minimum size of memory. We have also implemented on-line heuristics for real-time applications. The effectiveness of our algorithms has been demonstrated on a set of simulated MPEG streams from popular movies.
A multiphase approach to efficient surface simplification
Authors: Michael Garland, Eric Shaffer
Venue: Proceedings of the conference on Visualization '02 (2002)

We present a new multiphase method for efficiently simplifying polygonal surface models of arbitrary size. It operates by combining an initial out-of-core uniform clustering phase with a subsequent in-core iterative edge contraction phase. These two phases are both driven by quadric error metrics, and quadrics are used to pass information about the original surface between phases. The result is a method that produces approximations of a quality comparable to quadric-based iterative edge contraction, but at a fraction of the cost in terms of running time and memory consumption.
The Specification of Edge Penalties for Regular and Irregular Pixel Images
Authors: B. W. Silverman, C. Jennison, J. Stander, T. C. Brown
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1990)

It is shown how some geometrical insights can be used to provide penalties for the various edge configurations in a way that is roughly independent of the pixel discretization. The penalties are consistent over pixels of different sizes, shapes, and orientations, event if these occur in the same pattern. The cases of square, rectangular, hexagonal, and irregular pixels are considered. In an experiment, the penalties perform substantially better than those previously proposed.
Design for Packageability-Early Consideration of Packaging from a VLSI Designer's Viewpoint
Authors: Peyman H. Dehkordi, Donald W. Bouldin
Venue: Computer (1993)

Designing VLSI dies without considering packaging issues may result in a suboptimum system. It is argued that before the design of VLSI dies is completed, packaging issues should be evaluated, since they may affect choices in VLSI circuit design and layout. To illustrate this, the design of an image processing chip-set of three integrated circuits for wire-bond printed circuit board (PCB) and flip-chip multichip module deposited (MCM-D) technologies is reviewed. It is shown that the characteristics of these chips vary, since they are designed with different packaging in mind.
Self-Organizing Dynamic Graphs
Authors: Ezequiel López-Rubio, José Muñoz-Pérez, José Antonio Gómez-Ruiz
Venue: Neural Processing Letters (2002)

We propose a new self-organizing neural model that considers a dynamic topology among neurons. This leads to greater plasticity with respect to the self-organizing neural network (SOFM). Theorems are presented and proved that ensure the stability of the network and its ability to represent the input distribution. Finally, simulation results are shown to demonstrate the performance of the model, with an application to colour image compression.
Mining Sequential Patterns with Regular Expression Constraints
Authors: M. Garofalakis, R. Rastogi, K. Shim
Venue: IEEE Transactions on Knowledge and Data Engineering (2002)

Discovering sequential patterns is an important problem in data mining with a host of application domains including medicine, telecommunications, and the World Wide Web. Conventional sequential pattern mining systems provide users with only a very restricted mechanism (based on minimum support) for specifying patterns of interest. As a consequence, the pattern mining process is typically characterized by lack of focus and users often end up paying inordinate computational costs just to be inundated with an overwhelming number of useless results. In this paper, we propose the use of Regular Expressions (REs) as a flexible constraint specification tool that enables user-controlled focus to be incorporated into the pattern mining process. We develop a family of novel algorithms (termed SPIRIT¿Sequential Pattern mIning with Regular expressIon consTraints) for mining frequent sequential patterns that also satisfy user-specified RE constraints. The main distinguishing factor among the proposed schemes is the degree to which the RE constraints are enforced to prune the search space of patterns during computation. Our solutions provide valuable insights into the trade-offs that arise when constraints that do not subscribe to nice properties (like antimonotonicity) are integrated into the mining process. A quantitative exploration of these trade-offs is conducted through an extensive experimental study on synthetic and real-life data sets. The experimental results clearly validate the effectiveness of our approach, showing that speedups of more than an order of magnitude are possible when RE constraints are pushed deep inside the mining process. Our experimentation with real-life data also illustrates the versatility of REs as a user-level tool for focusing on interesting patterns.
Spatio-Temporal Alignment of Sequences
Authors: Yaron Caspi, Michal Irani
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2002)

This paper studies the problem of sequence-to-sequence alignment, namely, establishing correspondences in time and in space between two different video sequences of the same dynamic scene. The sequences are recorded by uncalibrated video cameras which are either stationary or jointly moving, with fixed (but unknown) internal parameters and relative intercamera external parameters. Temporal variations between image frames (such as moving objects or changes in scene illumination) are powerful cues for alignment, which cannot be exploited by standard image-to-image alignment techniques. We show that, by folding spatial and temporal cues into a single alignment framework, situations which are inherently ambiguous for traditional image-to-image alignment methods, are often uniquely resolved by sequence-to-sequence alignment. Furthermore, the ability to align and integrate information across multiple video sequences both in time and in space gives rise to new video applications that are not possible when only image-to-image alignment is used.
Using Accurate Arithmetics to Improve Numerical Reproducibility and Stability in Parallel Applications
Authors: Yun He, Chris H. Q. Ding
Venue: The Journal of Supercomputing (2001)

Numerical reproducibility and stability of large scale scientific simulations, especially climate modeling, on distributed memory parallel computers are becoming critical issues. In particular, global summation of distributed arrays is most susceptible to rounding errors, and their propagation and accumulation cause uncertainty in final simulation results. We analyzed several accurate summation methods and found that two methods are particularly effective to improve (ensure) reproducibility and stability: Kahan's self-compensated summation and Bailey's double-double precision summation. We provide an MPI operator MPI&lowbar;SUMDD to work with MPI collective operations to ensure a scalable implementation on large number of processors. The final methods are particularly simple to adopt in practical codes: not only global summations, but also vector-vector dot products and matrix-vector or matrix-matrix operations.
Direct Extraction of Topographic Features for Gray Scale Character Recognition
Authors: Seong-Whan Lee, Young Joon Kim
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1995)

Optical character recognition(OCR) traditionally applies to binary-valued imagery although text is always scanned and stored in gray scale. However, binarization of multivalued image may remove important topological information from characters and introduce noise to character background. In order to avoid this problem, it is indispensable to develop a method which can minimize the information loss due to binarization by extracting features directly from gray scale character images.In this paper, we propose a new method for the direct extraction of topographic features from gray scale character images. By comparing the proposed method with Wang and Pavlidis¿ method, we realized that the proposed method enhanced the performance of topographic feature extraction by computing the directions of principal curvature efficiently and prevented the extraction of unnecessary features. We also show that the proposed method is very effective for gray scale skeletonization compared to Levi and Montanari¿s method.
Data-Centric Transformations for Locality Enhancement
Authors: Induprakas Kodukula, Keshav Pingali
Venue: International Journal of Parallel Programming (2001)

On modern computers, the performance of programs is often limited by memory latency rather than by processor cycle time. To reduce the impact of memory latency, the restructuring compiler community has developed locality-enhancing program transformations such as loop permutation and tiling. These transformations work well for perfectly nested loops (loops in which all assignment statements are contained in the innermost loop), but their performance on codes such as matrix factorizations that contain imperfectly nested loops leaves much to be desired. In this paper, we propose an alternative approach called data-centric transformation. Instead of reasoning directly about the control structure of the program, a compiler using the data-centric approach chooses an order for the arrival of data elements in the cache, determines what computations should be performed when that data arrives, and generates the appropriate code. At runtime, program execution will automatically pull data into the cache in an order that corresponds approximately to the order chosen by the compiler; since statements that touch a data structure element are scheduled close together, locality is improved. The idea of data-centric transformation is very general, and in this paper, we discuss a particular transformation called data-shackling. We have implemented shackling in the SGI MIPSPro compiler which already has a sophisticated implementation of control-centric transformations for locality enhancement. We present experimental results on the SGI Octane comparing the performance of the two approaches, and show that for dense numerical linear algebra codes, data-shackling does better by factors of two to five.
Factors controlling generation and propagation of pacemaker potentials in network models of mammalian SA node
Authors: Raimond L. Winslow, Dongming Cai, Ying Cheng Lai
Venue: Proceedings of the 1994 ACM/IEEE conference on Supercomputing (1994)

Large-scale, biophysically detailed network models of the SA node and atrium are developed on the CM-5 parallel supercomputer. The models are used to investigate three factors controlling the site of generation and propagation of the cardiac pacemaker potential: a) magnitude of cell-to-cell gap junction coupling in the SA node; b) spatial variation of membrane current density in SA node; and c) interdigitation of SA node and atrial tissue.
Boundary Scan: The Internet of Test
Authors: Mike Wondolowski, Ben Bennetts, Adam Ley
Venue: IEEE Design Test (1999)

Since the publication of the ANSI/IEEE 1149.1 Boundary Scan standard in 1990, the electronics manufacturing industry has steadily accepted boundary-scan technology. Initially, boundary scan technology focused on the application to board manufacturing test. More recently, in-system programming (ISP) applications of boundary scan have further increased interest in the standard. One of the biggest advantages of using boundary scan is the ability to reuse tests developed at different levels of the design and in different life cycle phases. This facilitation of communication between previously isolated areas results in a network of re-use-the "Internet of Test."
Design of Efficient Error-Correcting Balanced Codes
Authors: S. Al-Bassam, B. Bose
Venue: IEEE Transactions on Computers (1993)

New constructions of t-error correcting balanced codes, for 1>or=t>or=4, are presented. In a balanced code, all the words have an equal number of 1's and 0's. In many cases, the information rates of the new codes are better than the existing codes given in the literature. The proposed codes also have efficient encoding and decoding algorithms.
Optimal Agreement Protocol in Malicious Faulty Processors and Faulty Links
Authors: K. -Q. Yan, Y. H. Chin, S. -C. Wang
Venue: IEEE Transactions on Knowledge and Data Engineering (1992)

Traditionally, the problems of Byzantine agreement, consensus, and interactive consistency are studied in a fully connected network with processors in malicious failure only. Such problems are reexamined with the assumption of malicious faults on both processors and links. The proposed protocols use the minimum number of message exchanges and can tolerate the maximum number of allowable faulty components to make each fault-free processor reach a common agreement for the cases of processor failure, link failure, or processor and link failure.
Inside Microsoft Research
Authors: Scott Hamilton
Venue: Computer (1998)

What are 250 top researchers from academia and industry working on at Microsoft Research? What attracted them to Redmond, Washington, as well as two new facilities in San Francisco and Cambridge, UK? MSR's appeal to its researchers is that their research will likely be "productized" for the mass market. Each of three metagroups have long-term goals but look for ways to incorporate their research into products shipping now. Research is already shipping in some form in nearly every Microsoft product. This article gives an overview of the organization and goals of MSR, established in 1991 to look three to five years out to ensure that Microsoft remains well ahead of the technology curve. As a corporate research lab, MSR is unapologetic about its intentions to identify and fund technologies and new applications that are relevant to Microsoft's corporate strategy. Research is tightly coupled to Microsoft's vision of next-generation systems and software development: PCs that are intuitive to even neophytes, programming paradigms and tools that improve programmer productivity and program maintainability, and next-generation systems for the enterprise. Three metagroups-Advanced Interactivity and Intelligent Systems; Programming Tools and Methodologies; and Systems and Architecture-undertake research in roughly 20 areas, including speech technology, vision, natural language processing, user interface development, and decision theory.
The OPEN Framework for Enhancing Productivity
Authors: Brian Henderson-Sellers
Venue: IEEE Software (2000)

The use of a business-focused development process can greatly facilitate producing and maintaining Cobol programs. The authors outline an OPEN (object-oriented process, environment, and notation) process framework, the most appropriate current process for object-oriented and component-based development in a business environment, in the context of implementations using the Cobol language. Its underpinning meta-model and framework make OPEN valuable for both development and maintenance.
Behavioral Model Synthesis with Cones
Authors: Charles E. Stroud, Ronald R. Munoz, David A. Pierce
Venue: IEEE Design Test (1988)

The Cones synthesis system for automatic generation of VLSI implementations is discussed. Named for the cones in sequential logic, Cones takes behavioral models written in C and produces gate-level implementations in technologies such as standard cells and programmable logic arrays or programmable logic devices. The overall design is produced faster, more efficiently, and with fewer errors. Designers are free to concentrate on functions, instead of on the details of the implementation technology.
Estimating Overcomplete Independent Component Bases for Image Windows
Authors: Aapo Hyvärinen, Mika Inki
Venue: Journal of Mathematical Imaging and Vision (2002)

Estimating overcomplete ICA bases for image windows is a difficult problem. Most algorithms require the estimation of values of the independent components which leads to computationally heavy procedures. Here we first review the existing methods, and then introduce two new algorithms that estimate an approximate overcomplete basis quite fast in a high-dimensional space. The first algorithm is based on the prior assumption that the basis vectors are randomly distributed in the space, and therefore close to orthogonal. The second replaces the conventional orthogonalization procedure by a transformation of the marginal density to gaussian.
Unifying metric approach to the triple parity
Authors: Tony Y. T. Chan
Venue: Artificial Intelligence (2002)

The even-odd parity problem is a tough one for neural networks to handle because they assume a finite dimensional vector space. Typically, the size of the neural network increases as the size of the problem increases. The triple parity problem is even tougher. In this paper, a method is proposed for supervised and unsupervised learning to classify bit strings of arbitrary length in terms of their triple parity: The learner is modeled by two formal concepts, transformation system and stability optimization. Even though a small set of short examples were used in the training stage, all bit strings of any length were classified correctly in the online recognition stage. The proposed learner has successfully learned to devise a way by means of metric calculations to classify bit strings of any length according to their triple parity. The system was able to acquire the concept of counting, dividing, and then taking the remainder, by autonomously evolving a set of string-editing rules along with their appropriate weights to solve the difficult problem.