ppxscal/embedding_network huggingface dataset:
COTS-based software development: processes and open issues
Authors: M. Morisio, C. B. Seaman, V. R. Basili, A. T. Parra, S. E. Kraft, S. E. Condon
Venue: Journal of Systems and Software (2002)

The work described in this paper is an investigation of the COTS-based software development within a particular NASA environment, with an emphasis on the processes used. Fifteen projects using a COTS-based approach were studied and their actual process was documented. This process is evaluated to identify essential differences in comparison to traditional software development. The main differences, and the activities for which projects require more guidance, are requirements definition and COTS selection, high level design, integration and testing. Starting from these empirical observations, a new process and set of guidelines for COTS-based development are developed and briefly presented.
A Simple Least-Squares Design of M-D IIR Filterswith Fixed Separable Denominator Based on Multivariate DivisionAlgorithm
Authors: Hiroshi Hasegawa, Isao Yamada, Kohichi Sakaniwa
Venue: Multidimensional Systems and Signal Processing (2000)

In this paper, we propose a simple algorithmic solution to the best approximation problem of finding the nearest multivariate rational function, with a fixed separable denominator polynomial, from a given multivariate polynomial, where the numerator polynomial is desired to minimize the integral of the squared error over the distinguished boundary of the unit polydisc. The proposed algorithm does not require any numerical integration or numerical root finding technique because this is realized based on the standard multivariate division algorithm. A simple observation of the proposed algorithm leads to an ideal membership problem characterizing the solution to the problem. A relation of this characterization and a multivariate generalization of the Walsh's Theorem is also discussed with another ideal membership problem derived by applying a corollary of the Hilbert Nullstellensatz to the Walsh's Theorem. Although the discussion to derive the latter ideal membership problem seems to be roundabout, such a characterization would be useful for further generalization, for example to some weighted least-squares approximation. Numerical examples demonstrate the practical applicability of the proposed method to design problems of multidimensional IIR filters.
Accelerated meshfree method for metal forming simulation
Authors: Sangpil Yoon, Jiun-Shyan Chen
Venue: Finite Elements in Analysis and Design (2002)

An accelerated meshfree method based on a stabilized conforming nodal integration method is developed for elastoplastic contact analysis of metal forming processes. In this approach, strain smoothing stabilization is introduced to eliminate spatial instability in Galerkin meshfree methods when the weak form is integrated by a nodal integration. The gradient matrix associated with strain smoothing satisfies the integration constraint for linear exactness in the Galerkin approximation. Strain smoothing formulation and numerical procedures for path-dependent problems are introduced. Applications to metal forming analysis are presented, with results demonstrating a significant improvement in computational efficiency without loss of accuracy.
Chain polynomials and Tutte polynomials
Authors: Lorenzo Traldi
Venue: Discrete Mathematics (2002)

The recently introduced chain and sheaf polynomials of a graph are shown to be essentially equivalent to a weighted version of the Tutte polynomial.
Fault-Tolerant Algorithms for Fair Interprocess Synchronization
Authors: Y. K. Tsay, R. L. Bagrodia
Venue: IEEE Transactions on Parallel and Distributed Systems (1994)

The implementation of nondeterministic pairwise synchronous communication among a set of asynchronous processes is modeled as the binary interaction problem. The paperdescribes an algorithm for this problem that satisfies a strong fairness property thatguarantees freedom from process starvation. This is the first algorithm for binaryinteractions with strong fairness whose message cost and response time are independentof the total number of processes in the system. The paper also describes how the fairalgorithm may be extended to tolerate detectable fail-stop failures. Finally, we show howany solution to the dining philosophers problem can be embedded to design a fairalgorithm for binary interactions. In particular, this embedding is used to derive a fairalgorithm that can cope with undetectable fail-stop failures.
Amalthaea: An Evolving Multi-Agent Information Filtering and Discovery System for the WWW
Authors: Alexandros Moukas, Pattie Maes
Venue: Autonomous Agents and Multi-Agent Systems (1998)

Amalthaea is an evolving, multi-agent ecosystem for personalized filtering, discovery, and monitoring of information sites. Amalthaea's primary application domain is the World Wide Web and its main purpose is to assist its users in finding interesting information. Two different categories of agents are introduced in the system: filtering agents that model and monitor the interests of the user and discovery agents that model the information sources.A market-like ecosystem where the agents evolve, compete, and collaborate is presented: agents that are useful to the user or other agents reproduce, while low-performing agents are destroyed. Results from various experiments with different system configurations and varying ratios of user interests versus agents in the system are presented. Finally issues like fine-tuning the initial parameters of the system and establishing and maintaining equilibria in the ecosystem are discussed.
Organizational Factors and Reuse
Authors: Danielle Fafchamps
Venue: IEEE Software (1994)

Reuse is not just a technical issue. Hewlett-Packard studied why people sometimes resist reuse and which organizational models appear to encourage reuse more than others. The study found that successful reuse programs must be integrated within the culture of a company's existing organizational structure. One crucial organizational factor is the relationship between producers and consumers of reuse components and services. What are these relationships and how well do they work? To answer this question, I conducted an empirical study of 10 engineering sites at Hewlett-Packard engaged in systematic reuse. From this reuse experience, I identified four models of producer-consumer relationships; evaluated the models in terms of their organizational structures, advantages, and disadvantages; and identified goals for management to enable a successful implementation. The four models are: lone producer, nested producer, pool producer and team producer. Two or more models may occur within a given reuse program. Recommendations to management are based on both current successful practices and interviewees' suggestions. I also include some tentative guidelines on which environments are best suited to each model.
Multicode: A Truly Multilingual Approach to Text Encoding
Authors: Muhammad F. Mudawwar
Venue: Computer (1997)

The global market for software written in native languages has spurred the interest in multilingual text encoding. Although ASCII is the accepted standard and works well for English, its 7-bit structure provides codes for only 128 characters, a number insufficient to represent some languages. The limited number of character codes also presents problems when you want to mix languages. Unicode is one proposed solution. A consortium met in 1991 to develop and promote Unicode. They chose a 16-bit structure and, for simplicity, did not include information on what language the code represents. Although this does provide a general, comprehensive encoding structure, Unicode's attempt to unify the character representation for all languages can lead to unwieldy files and more work for programmers. Because of these problems, the author created Multicode in 1996. Its most important feature is the use of multiple character sets, each of which can represent a particular language. Multicode allows 8-bit representations-adequate for most languages-as well as the 16-bit representations required for languages with more characters, such as Japanese, Chinese, and Korean. Through switch characters, Multicode can support files that incorporate more than one language.
A Nonintegrable Sub-Riemannian Geodesic Flow on a Carnot Group
Authors: R. Montgomery, M. Shapiro, A. Stolin
Venue: Journal of Dynamical and Control Systems (1997)

Graded nilpotent Lie groups, or Carnot groups, are to sub-Riemannian geometry as Euclidean spaces are to Riemannian geometry. They are the metric tangent cones for this geometry. Hoping that the analogy between sub-Riemannian and Riemannian geometry is a strong one, one might conjecture that the sub-Riemannian geodesic flow on any Carnot group is completely integrable. We prove this conjecture to be false by showing that the sub-Riemannian geodesic flow is not algebraically completely integrable in the case of the group whose Lie algebra consists of 4 by 4 upper triangular matrices. As a corollary, we prove that the centralizer for the corresponding quadratic &ldquo;quantum&rdquo; Hamiltonian in the universal enveloping algebra of this Lie algebra is &ldquo;as small as possible.&rdquo;
Scheduling Precedence Constrained Task Graphs with Non-Negligible Intertask Communication onto Multiprocessors
Authors: C. Selvakumar, C. Siva Ram Murthy
Venue: IEEE Transactions on Parallel and Distributed Systems (1994)

The multiprocessor scheduling problem is the problem of scheduling the tasks of aprecedence constrained task graph (representing a parallel program) onto the processorsof a multiprocessor in a way that minimizes the completion time. Since this problem isknown to be NP-hard in the strong sense in all but a few very restricted eases, heuristicalgorithms are being developed which obtain near optimal schedules in a reasonableamount of computation time. We present an efficient heuristic algorithm for schedulingprecedence constrained task graphs with nonnegligible intertask communication ontomultiprocessors taking contention in the communication channels into consideration. Ouralgorithm for obtaining satisfactory suboptimal schedules is based on the classical listscheduling strategy. It simultaneously exploits the schedule-holes generated in theprocessors and in the communication channels during the scheduling process in order toproduce better schedules. We demonstrate the effectiveness of our algorithm bycomparing with two competing heuristic algorithms available in the literature.
Towards the inverse of a word
Authors: Bob Clarke
Venue: Discrete Mathematics (2002)

Let w be a word, i.e., a permutation with repetitions. We present a construction for the inverse of w in the case where w has at most three distinct letters, and indicate steps towards the construction in the general case.
Heterogeneous Databases: Proliferations, Issues, and Solutions
Authors: D. K. Hsiao, M. N. Kamel
Venue: IEEE Transactions on Knowledge and Data Engineering (1989)

The authors characterize the notion of heterogeneous databases as the inevitable consequence of replacing the traditional data processing practice with modern database management. They articulate the current problems and future issues connected with the great proliferation and overwhelming use of heterogeneous databases and their DBMS (database management systems). They survey available DBMS solutions to these problems and issues. The limitations and advantages of various DBMS solutions are examined. To this end, a taxonomy of DBMS solutions to the problems and issues of heterogeneous databases is presented. Some of the current research and proposals on the heterogeneous-database solutions are discussed in the context of the taxonomy.
A new evolutionary approach to cutting stock problems with and without contiguity
Authors: Ko-Hsin Liang, Xin Yao, Charles Newton, David Hoffman
Venue: Computers and Operations Research (2002)

Evolutionary algorithms (EAs) have been applied to many optimization problems successfully in recent years. The genetic algorithm (GAs) and evolutionary programming (EP) are two different types of EAs. GAs use crossover as the primary search operator and mutation as a background operator, while EP uses mutation as the primary search operator and does not employ any crossover. This paper proposes a novel EP algorithm for cutting stock problems with and without contiguity. Two new mutation operators are proposed. Experimental studies have been carried out to examine the effectiveness of the EP algorithm. They show that EP can provide a simple yet more effective alternative to GAs in solving cutting stock problems with and without contiguity. The solutions found by EP are significantly better (in most cases) than or comparable to those found by GAs.
Discovering affine equalities using random interpretation
Authors: Sumit Gulwani, George C. Necula
Venue: ACM SIGPLAN Notices (2003)

We present a new polynomial-time randomized algorithm for discovering affine equalities involving variables in a program. The key idea of the algorithm is to execute a code fragment on a few random inputs, but in such a way that all paths are covered on each run. This makes it possible to rule out invalid relationships even with very few runs.The algorithm is based on two main techniques. First, both branches of a conditional are executed on each run and at joint points we perform an affine combination of the joining states. Secondly, in the branches of an equality conditional we adjust the data values on the fly to reflect the truth value of the guarding boolean expression. This increases the number of affine equalities that the analysis discovers.The algorithm is simpler to implement than alternative deterministic versions, has better computational complexity, and has an extremely small probability of error for even a small number of runs. This algorithm is an example of how randomization can provide a trade-off between the cost and complexity of program analysis, and a small probability of unsoundness.
.NET Is Coming
Authors: Bertrand Meyer
Venue: Computer (2001)

.NET, an open language enterprise and Web development platform, has the potential to dominate the computing industry for years to come.
Traversal times and charge confinement for spatially dependent effective masses within semiconductor heterostructures: the quantum potential approach
Authors: John R. Barker, Jeremy R. Watling
Venue: Microelectronic Engineering (2002)

The classical traversal time is a well-defined functional of the carrier trajectory and in graded heterosructures acquires significant corrections due to the position-dependent effective mass. The quantum potential corrections for pure states and the corrections to quantum Monte Carlo for mixed states are derived using the Wigner formalism. Application to graded SiGe shows additional transport corrections, including enhanced charge confinement, which are of the same order as the conventional constant mass density gradient corrections.
Image coding using transform vector quantization with training set synthesis
Authors: Dorin Comaniciu, Richard Grisel
Venue: Signal Processing (2002)

A new paradigm that combines data modeling and vector quantization in an effective coding technique is presented. We fit a statistical model to the input data and use the best fit parameters to synthesize training vector sets with statistics similar to the input. By knowing the best-fit parameters, the decoder can synthesize the same training sets, while identical codebooks are obtained at both encoder and decoder based on the same codebook generation procedure. As a result, complete codebook adaptation is achieved with a very small increase in the bit rate. The implementation of the new technique in the transform domain produced competitive results when compared to other methods relying on vector quantization and transform coding. In particular, the image Lena was coded at 0.28 bits/pixel with a peak signal-to-noise ratio of 32.51 dB.
Self-assembly patterning of epitaxial CoSi2 nano-structures
Authors: Q. T. Zhao, P. Kluth, S. Winnerl, S. Lenk, S. Mantl
Venue: Microelectronic Engineering (2002)

A self-assembly nanopatterning method for epitaxial-CoSi2 layers has been developed and investigated. It is based on anisotropic diffusion of Co/Si atoms in a stress field during rapid thermal oxidation. The stress field is generated by a patterned trench mask consisting of 20 nm SiO2 and 300 nm Si3N4. Single-crystalline CoSi2 layers with a thickness of 20 nm grown by molecular beam allotaxy (MBA) on Si(100) substrates were patterned using this technique. Uniform gaps or uniform CoSi2 wires with a feature size of 80 nm have been fabricated by using different stress fields which are created by different trench widths.
Simulation-Based Verification for High-Level Synthesis
Authors: Rolf Ernst, Jayaram Bhasker
Venue: IEEE Design Test (1991)

The verification problem is described, and a way to verify a high-level synthesis system automatically is presented. The system, called Satya, maps an algorithmic description to a logic circuit description and compares descriptions to detect semantic errors and identify the cause of those errors. Satya has been used to verify the Bridge synthesis system, which accepts a subset of C as input, but the simulation-based approach underlying Satya is suitable for verifying synthesis systems that use other high-level languages, such as VHDL. The verification results are discussed, and some of the problems that arise in debugging and regression testing are considered.
Communication styles for parallel systems
Authors: Thomas Gross, Susan Hinrichs, David R. O'Hallaron, Thomas Stricker, Atsushi Hasegawa
Venue: Computer (1994)

Distributed-memory parallel systems rely on explicit message exchange for communication, but the communication operations they support can differ in many aspects. One key difference is the way messages are generated or consumed. With systolic communication, a message is transmitted as it is generated. For example, the result computed by the multiplier is sent directly to the communication subsystem for transmission to another node. With memory communication, the complete message is generated and stored in memory, and then transmitted to its destination. Since sender and receiver nodes are individually controlled, they can use different communication styles. One example of memory communication is message passing: both the sender and receiver buffer the message in memory. These two communication styles place different demands on processor design. This article illustrates each style's effect on processor resources for some key application kernels. We are targeting the iWarp system because it supports both communication styles. Two parallel-program generators, one for each communication style, automatically map the sample programs.
Spoken language resources for Cantonese speech processing
Authors: Tan Lee, W. K. Lo, P. C. Ching, Helen Meng
Venue: Speech Communication (2002)

This paper describes the development of CU Corpora, a series of large-scale speech corpora for Cantonese. Cantonese is the most commonly spoken Chinese dialect in Southern China and Hong Kong. CU Corpora are the first of their kind and intended to serve as an important infrastructure for the advancement of speech recognition and synthesis technologies for this widely used Chinese dialect. They contain a large amomat of speech data that cover various linguistic units of spoken Cantonese, including isolated syllables, polysyllabic words and continuous sentences. While some of the corpora are created for specific applications of common interest, the others are designed with emphasis on the coverage and distributions of different phonetic units, including the contextual ones. The speech data are annotated manually so as to provide sufficient orthographic and phonetic information for the development of different applications. Statistical analysis of the annotated data shows that CU Corpora contain rich and balanced phonetic content. The usefulness of the corpora is also demonstrated with a number of speech recognition and speech synthesis applications.
A formal awareness model for 3D web-based collaborative environments
Authors: Pilar Herrero, Angélica de Antonio
Venue: ACM SIGGROUP Bulletin (2000)

The importance of an awareness model for a Virtual Environment has been underwritten by many studies and very interesting research has been undertaken in this CSCW research area.In this paper, we give a new interpretation of the set of key concepts and ideas, which have been used to define conventional awareness models in CVE's, for the purpose of building a formal model of awareness for 3D Web-based Collaborative Environments.At the same time, we will point out some limitations of current awareness models and we will propose some extensions, like Visual Acuity and Internal Filters. We will also provide an interpretation for these concepts in the context of Web applications.
An Empirical Comparison of Seven Programming Languages
Authors: Lutz Prechelt
Venue: Computer (2000)

Often heated, debates regarding different programming languages' effectiveness remain inconclusive because of scarce data and a lack of direct comparisons. The author addresses that challenge, comparatively analyzing 80 implementations of the phonecode program in seven different languages (C, C++, Java, Perl, Python, Rexx, and Tcl). Further, for each language, the author analyzes several separate implementations by different programmers. The comparison investigates several aspects of each language, including program length, programming effort, run-time efficiency, memory consumption, and reliability. The author uses comparisons to present insight into program language performance. For example, the study indicates that Java's memory overhead is still huge compared to C or C++, but its runtime efficiency has become quite acceptable. The scripting languages, however, offer reasonable alternatives to C and C++, even for tasks that must handle fair amounts of computation and data.
Syntactic Segmentation and Labeling of Digitized Pages from Technical Journals
Authors: M. Krishnamoorthy, G. Nagy, S. Seth, M. Viswanathan
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1993)

A method for extracting alternating horizontal and vertical projection profiles are from nested sub-blocks of scanned page images of technical documents is discussed. The thresholded profile strings are parsed using the compiler utilities Lex and Yacc. The significant document components are demarcated and identified by the recursive application of block grammars. Backtracking for error recovery and branch and bound for maximum-area labeling are implemented with Unix Shell programs. Results of the segmentation and labeling process are stored in a labeled x-y tree. It is shown that families of technical documents that share the same layout conventions can be readily analyzed. Results from experiments in which more than 20 types of document entities were identified in sample pages from two journals are presented.
Nanoscale phase separation in Ag-Ge-Se glasses
Authors: M. N. Kozicki, M. Mitkova, J. Zhu, M. Park
Venue: Microelectronic Engineering (2002)

We have investigated the materials formed by Ag photodiffusion in Se-rich Ge-Se thin glass films. The amount of Ag that can be incorporated by this method saturates at a level dependent on the quantity of Se in the starting glass. The photodiffused Ag reacts with the Se to form distinct Ag2Se and Ge-rich backbone phases as determined by Raman and XRD analyses. The conducting Ag2Se phases exist as nano-crystals with a size in the order of 2 nm in the backbone structure.