ppxscal/embedding_network huggingface dataset:
Challenges of component-based development
Authors: Ivica Crnkovic, Magnus Larssom
Venue: Journal of Systems and Software (2002)

It is generally understood that building software systems with components has many advantages but the difficulties of this approach should not be ignored. System evolution, maintenance, migration and compatibilities are some of the challenges met with when developing a component-based software system. Since most systems evolve over time, components must be maintained or replaced. The evolution of requirements affects not only specific system functions and particular components but also component-based architecture on all levels. Increased complexity is a consequence of different components and systems having different life cycles. In component-based systems it is easier to replace part of system with a commercial component. This process is however not straightforward and different factors such as requirements management, marketing issues, etc., must be taken into consideration. In this paper we discuss the issues and challenges encountered when developing and using an evolving component-based software system. An industrial control system has been used as a case study.
Toward Multidatabase Mining: Identifying Relevant Databases
Authors: Huan Liu, Hongjun Lu, Jun Yao
Venue: IEEE Transactions on Knowledge and Data Engineering (2001)

Various tools and systems for knowledge discovery and data mining are developed and available for applications. However, when we are immersed in heaps of databases, an immediate question is where we should start mining. It is not true that the more databases, the better for data mining. It is only true when the databases involved are relevant to a task at hand. In this paper, breaking away from the conventional data mining assumption that many databases be joined into one, we argue that the first step for multidatabase mining is to identify databases that are most likely relevant to an application; without doing so, the mining process can be lengthy, aimless, and ineffective. A measure of relevance is thus proposed for mining tasks with an objective of finding patterns or regularities about certain attributes. An efficient algorithm for identifying relevant databases is described. Experiments are conducted to verify the measure's performance and to exemplify its application.
A Fast Heuristic Global Learning Algorithm for Multilayer Neural Networks
Authors: Siu-Yeung Cho, Tommy W. S. Chow
Venue: Neural Processing Letters (1999)

This paper presents a novel Heuristic Global Learning (HER-GBL) algorithm for multilayer neural networks. The algorithm is based upon the least squares method to maintain the fast convergence speed, and the penalized optimization to solve the problem of local minima. The penalty term, defined as a Gaussian-type function of the weight, is to provide an uphill force to escape from local minima. As a result, the training performance is dramatically improved. The proposed HER-GBL algorithm yields excellent results in terms of convergence speed, avoidance of local minima and quality of solution.
Smoothing Newton and Quasi-Newton Methods for Mixed Complementarity Problems
Authors: Donghui Li, Masao Fukushima
Venue: Computational Optimization and Applications (2000)

The mixed complementarity problem can be reformulated as a nonsmooth equation by using the median operator. In this paper, we first study some useful properties of this reformulation and then derive the Chen-Harker-Kanzow-Smale smoothing function for the mixed complementarity problem. On the basis of this smoothing function, we present a smoothing Newton method for solving the mixed complementarity problem. Under suitable conditions, the method exhibits global and quadratic convergence properties. We also present a smoothing Broyden-like method based on the same smoothing function. Under appropriate conditions, the method converges globally and superlinearly.
E-DEVICE: An Extensible Active Knowledge Base System with Multiple Rule Type Support
Authors: Nick Bassiliades, Ioannis Vlahavas, Ahmed K. Elmagarmid
Venue: IEEE Transactions on Knowledge and Data Engineering (2000)

This paper describes E-DEVICE, an extensible active knowledge base system (KBS) that supports the processing of event-driven, production, and deductive rules into the same active OODB system. E-DEVICE provides the infrastructure for the smooth integration of various declarative rule types, such as production and deductive rules, into an active OODB system that supports low-level event-driven rules only by: 1) mapping each declarative rule into one event-driven rule, offering centralized rule selection control for correct run-time behavior and conflict resolution, and 2) using complex events to map the conditions of declarative rules and monitor the database to incrementally match those conditions. E-DEVICE provides the infrastructure for easily extending the system by adding: 1) new rule types as subtypes of existing ones, and 2) transparent optimizations to the rule matching network. The resulting system is a flexible, yet efficient, KBS that gives the user the ability to express knowledge in a variety of high-level forms for advanced problem solving in data intensive applications.
SURF: Rubber-Band Routing System for Multichip Modules
Authors: David Staepelaere, Jeffrey Jue, Tal Dayan, Wayne Wei-Ming Dai
Venue: IEEE Design Test (1993)

Current PCB (printed circuit board)-based routing tools cannot meet the performance and cost constraints presented by today's packaging technologies, including thin-film multichip modules. The authors describe SURF, a routing system designed specifically to meet these challenges. The strength of the SURF system comes from its extremely flexible rubber-band data representation. The rubber-band model is an ideal framework for performance-driven and cost-driven routing and naturally supports rectilinear, octilinear, and all-angle wiring patterns: one-and-a-half-layer routing; even wiring distribution; and powerful manual editing. The integrated spoke-based design-rule-checking/enforcement mechanism supports an incremental design style. As objects are moved or wires are resized, the wires are adjusted incrementally so that they maintain the same wiring topology. By working in the topological domain instead of the geometrical one, the designer can focus on higher-level design issues while the tool handles the precise geometrical details.
Approximating minimum cocolorings
Authors: Fedor V. Fomin, Dieter Kratsch, Jean-Christophe Novelli
Venue: Information Processing Letters (2002)

A cocoloring of a graph G is a partition of the vertex set of G such that each set of the partition is either a clique or an independent set in G. Some special cases of the minimum cocoloring problem are of particular interest.We provide polynomial-time algorithms to approximate a minimum cocoloring on graphs, partially ordered sets and sequences. In particular, we obtain an efficient algorithm to approximate within a factor of 1.71 a minimum partition of a partially ordered set into chains and antichains, and a minimum partition of a sequence into increasing and decreasing subsequences.
Neighborhood Selection for IDDQ Outlier Screening at Wafer Sort
Authors: W. Robert Daasch, James McNames, Robert Madge, Kevin Cota
Venue: IEEE Design Test (2002)

To screen defective dies, IDDQ tests require a reliable estimate of each die's defect-free measurement. The nearest-neighbor residual (NNR) method provides a straightforward, data-driven estimate of test measurements for improved identification of die outliers.
Mentoring Object-Oriented Projects
Authors: Ramkumar Ramaswamy
Venue: IEEE Software (2001)

Mentors are crucial for an organization that is learning object orientation, particularly when much of the learning must occur on live projects. The mentor must be architect, design consultant, and educator on process and language issues. This multifaceted role presents unique challenges. The author describes issues he has faced as a mentor on a number of OO application development projects.
Performance Evaluation of the Slotted Ring Multiprocessor
Authors: Michael Dubois, Luiz André Barroso
Venue: IEEE Transactions on Computers (1995)

As microprocessor speeds continue to improve at a very fast rate the bandwidth requirements for system level interconnections in multiprocessors may eventually rule out the use of shared buses even for small scale multiprocessors. On the other hand high-speed unidirectional links are an emerging technology that has the potential to scale with microprocessor technology and could replace buses as the interconnection fabric for future multiprocessors. In this paper we evaluate the performance of the unidirectional slotted ring interconnection for small to medium scale shared memory systems, using a hybrid methodology of analytical models and trace-driven simulations. We use memory traces from actual execution of parallel programs to drive detailed event-driven simulations of a variety of ring and bus multiprocessors. Snooping and directory coherence protocols for the slotted ring are evaluated in the context of multitasking. Snooping is shown to outperform full-map and linked list directory schemes in the unidirectional slotted ring, and it also compares favorably to high-performance split-transaction bus systems.
Randomized splay trees: theoretical and experimental results
Authors: Susanne Albers, Marek Karpinski
Venue: Information Processing Letters (2002)

Splay trees are self-organizing binary search trees that were introduced by Sleator and Tarjan [J. ACM 32 (1985) 652-686]. In this paper we present a randomized variant of these trees. The new algorithm for reorganizing the tree is both simple and easy to implement. We prove that our randomized splaying scheme has the same asymptotic performance as the original deterministic scheme but improves constants in the expected running time. This is interesting in practice because the search time in splay trees is typically higher than the search time in skip lists and AVL-trees. We present a detailed experimental study of our algorithm. On request sequences generated by fixed probability distributions, we can achieve improvements of up to 25% over deterministic splaying. On request sequences that exhibit high locality of reference, the improvements are minor.
Maintaining Component-Based Systems
Authors: Jeffrey Voas
Venue: IEEE Software (1998)

As we continue to move toward component-based software engineering, software development will become more like traditional manufacturing: developers will code less and design and integrate more. Voas argues that to reap the benefits of component-based development reduced time to market, more user choice, and lower costs we must rethink our software maintenance strategies. He gives a wide-ranging overview of the maintenance challenges raised by component-based development.
An Approach to Designing Very Fast Approximate String Matching Algorithms
Authors: M. -W. Du, S. C. Chang
Venue: IEEE Transactions on Knowledge and Data Engineering (1994)

An approach to designing very fast algorithms for approximate string matching in a dictionary is proposed. Multiple spelling errors corresponding to insert, delete, change, and transpose operations on character strings are considered in the fault model. The design of very fast approximate string matching algorithms through a four-step reduction procedure is described. The final and most effective step uses hashing techniques to avoid comparing the given word with words at large distances. The technique has been applied to a library book catalog textbase. The experiments show that performing approximate string matching for a large dictionary in real-time on an ordinary sequential computer under our multiple fault model is feasible.
Secure Information Flow via Linear Continuations
Authors: Steve Zdancewic, Andrew C. Myers
Venue: Higher-Order and Symbolic Computation (2002)

Security-typed languages enforce secrecy or integrity policies by type-checking. This paper investigates continuation-passing style (CPS) as a means of proving that such languages enforce noninterference and as a first step towards understanding their compilation. We present a low-level, secure calculus with higher-order, imperative features and linear continuations.Linear continuations impose a stack discipline on the control flow of programs. This additional structure in the type system lets us establish a strong information-flow security property called noninterference. We prove that our CPS target language enjoys the noninterference property and we show how to translate secure high-level programs to this low-level language. This noninterference proof is the first of its kind for a language with higher-order functions and state.
The Crash in Competitive Telephony
Authors: Shane Greenstein
Venue: IEEE Micro (2002)

In the latter half of the past decade, the electronics business became a part of the telephone business. Quite unexpectedly, many parts of the electronics industryýparticularly data switch makersýfound their economic welfare tied to four decades of regulatory experimentation.In this experimentation, regulators wanted to develop competitors in various parts of the telephony industry.
Virtual-Memory-Mapped Network Interfaces
Authors: Matthias A. Blumrich, Cezary Dubnicki, Edward W. Felten, Kai Li, Malena R. Mesarina
Venue: IEEE Micro (1995)

In existing multicomputers, software overhead dominates the message-passing latency cost. Our research on the SHRIMP project at Princeton indicates that appropriate network interface support can significantly reduce this software overhead. We have designed two network interfaces for the SHRIMP multicomputer. Both support virtual memory mapped communication allowing user processes to communicate without doing expensive buffer management, and without using system calls to cross the protection boundary separating user processes from the operating system kernel. This paper describes and compares the two network interfaces, and discusses performance tradeoffs between them.
Software-assisted cache replacement mechanisms for embedded systems
Authors: Prabhat Jain, Srinivas Devadas, Daniel Engels, Larry Rudolph
Venue: Proceedings of the 2001 IEEE/ACM international conference on Computer-aided design (2001)

We address the problem of improving cache predictability and performance in embedded systems through the use of software-assisted replacement mechanisms. These mechanisms require additional software controlled state information that affects the cache replacement decision. Software instructions allow a program to kill a particular cache element, i.e., effectively make the element the least recently used element, or keep that cache element, i.e., the element will never be evicted.We prove basic theorems that provide conditions under which kill and keep instructions can be inserted into program code, such that the resulting performance is guaranteed to be as good as or better than the original program run using the standard LRU policy. We developed a compiler algorithm based on the theoretical results that, given an arbitrary program, determines when to perform software-assisted replacement, i.e., when to insert either a kill or keep instruction. Empirical evidence is provided that shows that performance and predictability (worst-case performance) can be improved for many programs.
Aria: An Agent for Annotating and Retrieving Images
Authors: Henry Lieberman, Elizabeth Rozenweig, Push Singh
Venue: Computer (2001)

Although modern photography has come a long way, the process of making and using photographs still requires more effort than it should. Using software agents rather than human labor can help reduce some of this tedium.Aria is an interface agent designed to assist users by proactively looking for opportunities for image annotation and retrieval. Although it doesn't completely automate image annotation and retrieval, Aria dramatically reduces user interface overhead, which can lead to better-annotated image libraries and fewer missed opportunities for image use.The authors designed Aria's interface agent to facilitate--rather than fully automate--the textual annotation and retrieval process. The agent's role lies not so much in automatically performing the annotation and retrieval but in detecting opportunities for performing these functions and alerting the user to those opportunities. The agent can also, when appropriate, help the user complete the operations.Future work will center on taking advantage of more opportunities to use context to determine appropriate situations for image annotation, image library browsing, and retrieval. The authors are often asked how their approach will scale to large image collections. Keywords could relate to ontologies and knowledge bases to do inheritance or simple inference searches. Aria's retrieval technology treats image sets as an unstructured database, but perhaps a better method would be to look at sets of pictures as linked networks. In the long run, the authors seek to capture and use commonsense knowledge about typical picture- taking situations.
A Formalised Proof of the Soundness and Completeness of a Simply Typed Lambda-Calculus with Explicit Substitutions
Authors: Catarina Coquand
Venue: Higher-Order and Symbolic Computation (2002)

We present a simply-typed &lambda;-calculus with explicit substitutions and we give a fully formalised proof of its soundness and completeness with respect to Kripke models. We further give conversion rules for the calculus and show also for them that they are sound and complete with respect to extensional equality in the Kripke model. A decision algorithm for conversion is given and proven correct. We use the technique &ldquo;normalisation by evaluation&rdquo; in order to prove these results. An important aspect of this work is that it is not a formalisation of an existing proof, instead the proof has been done in interaction with the proof system, ALF.
The Age of Software Patents
Authors: Kenneth Nichols
Venue: Computer (1999)

Current law treats software as just another invention. It is not. Software is a new kind of entity, with the ability to transform all other technologies, including the creative arts, politics, and economics. It therefore requires separate treatment. In less than two decades, software development has evolved from being a legally defenseless enterprise to one in which almost every innovation is a candidate for patent protection. This transition occurred with minimal fanfare and little industry awareness¿except in the R&D departments of giant corporations, where most software patents were quietly being obtained. Because the software patent phenomenon is so recent, its long-term effects are still unknown. What is certain is that patents will play a pivotal role in shaping future software products and research. Software patents, now barely noticed by most developers, will soon have a profound effect on R&D, as well as industrial profits. In fact, the correlation between revenue and patents could alter the direction of technology. Every programmer, manager, teacher, and researcher in the software industry should be aware of how patents work. This is especially true for professionals in the commercial software or Internet applications business because patents will influence these segments of the computer industry the most.
Scheduling one-part-type serial manufacturing system under periodic demand: a solvable case
Authors: Konstantin Kogan, Sheldon X. C. Lou
Venue: Computers and Operations Research (2002)

The paper studies one-part type, multiple-stage production system with periodic demands. A buffer of infinite capacity is placed after each machine. Inventory flow through buffers is controlled by machine production rates. The objective is to find a cyclic production rate, which minimizes all inventory-related expenses over an infinite planning horizon. With the aid of the maximum principle, optimal production policies are derived and the continuous-time scheduling problem is reduced to a discrete timing problem. As a result, a polynomial-time algorithm is suggested to calculate the optimal production rate. A numerical example is used to illustrate the algorithm.
Industrial-Strength Management Strategies
Authors: Norm Brown
Venue: IEEE Software (1996)

Software has become a major cost, schedule, and performance driver of virtually all US DoD weapons, command-and-control, and information systems. It has become alarmingly apparent to DoD executives and the US Congress that the software tail wags the system dog. When software delays the fielding of a major system, the costs can become enormous. These problems are not unique to defense systems. The Denver Airport Baggage Handling System and the English Channel Tunnel are just a few of the systems hit with substantial economic consequences attributable to problems in developing large-scale software.Management of system development has been found to be a key determinant of cost. Although this article draws on the author's experiences in the defense industry, it presents a distillation of industry-wide techniques for managing successful large-scale software projects. The practices described are drawn from the crucible of successful real-world projects. They are intended as a set of management practices to prevent high inherent complexity from growing into unmanageable chaos. The nine practices described are not exotic or glamorous. Ironically, the techniques that really seem to work in managing high-tech software are low-tech.
On the Classification of Extremal Even Formally Self-DualCodes
Authors: J. E. Fields, P. Gaborit, W. C. Huffman, V. Pless
Venue: Designs, Codes and Cryptography (1999)

Bachoc bachoc has recently introduced harmonic polynomials for binary codes. Computing these for extremal even formally self-dual codes of length 12, she found intersection numbers for such codes and showed that there are exactly three inequivalent [12,6,4] even formally self-dual codes, exactly one of which is self-dual. We prove a new theorem which gives a generator matrix for formally self-dual codes. Using the Bachoc polynomials we can obtain the intersection numbers for extremal even formally self-dual codes of length 14. These same numbers can also be obtained from the generator matrix. We show that there are precisely ten inequivalent [14,7,4] even formally self-dual codes, only one of which is self-dual.
Manipulating General Vectors on Synchronous Binary N-Cube
Authors: W. Lin
Venue: IEEE Transactions on Computers (1993)

The author describes efficient manipulations of general vectors on the synchronous binary n-cube structure. A general vector is defined as a set of elements stored in consecutive processors with arbitrary length and starting point, and one element per processor. New routing methods for manipulating general vectors are presented. The author focuses on six major vector manipulating functions: merge, split, rotation, reverse, compression, and expansion. They are frequently used to extract and structure data parallelism in image processing and parallel solutions of linear systems. It is observed that varying the dimension order is a key to collision-free vector manipulations. A formal network model is developed for determining when link collisions occur. With the aid of this network model dimension orders yielding collision-free routine for the six manipulating functions are identified. Collision-free routing allows data communication to complete in the optimal time-single network cycle. The dimension orders are easy to encode and decode, and they are feasible for physical implementation.