ppxscal/embedding_network huggingface dataset:
Our Worst Current Development Practices
Authors: Capers Jones
Venue: IEEE Software (1996)

How to get people and technology to work together.There's an old saying that goes: "There are two kinds of failures: those who thought and never did and those who did and never thought." In the software business, our worst failures tend to fall into the second category. Too often we plunge into a major project, without considering the factors that have the strongest bearing on success or failure. Even worse, many software managers refuse to learn from failure, repeating the same destructive behavior project after project, then wondering why Mylanta has become one of their major food groups.This issue, Capers Jones talks about failed projects and the practices that lead to them. Throughout his career, Jones has studied thousands of software projects. His strength lies in his ability to analyze the critical software metrics and extract pragmatic advice for real managers on real projects. Heeding his message may help you to think first, then do.¿Roger Pressman The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Estimation of atmospheric boundary layer using Kalman filter technique
Authors: Abhik Mukherjee, Partha Pratim Adhikari, P. K. Nandi, Pinakpani Pal, J. Das
Venue: Signal Processing (2002)

Sodar provides round-the-clock information about the atmospheric boundary layer (ABL). However, computer-based extraction of relevant ABL information from sodar data calls for techniques of image processing to remove the inherent noise. Kalman filter is employed as an alternative methodology to extract the ABL. Thus, it becomes possible to bypass the time-consuming image processing steps, making it faster for real time interpretation of atmospheric conditions from ABL. The technique compares well with the performance of the image processing technique.
Scoring the Data Using Association Rules
Authors: Bing Liu, Yiming Ma, Ching Kian Wong, Philip S. Yu
Venue: Applied Intelligence (2003)

In many data mining applications, the objective is to select data cases of a target class. For example, in direct marketing, marketers want to select likely buyers of a particular product for promotion. In such applications, it is often too difficult to predict who will definitely be in the target class (e.g., the buyer class) because the data used for modeling is often very noisy and has a highly imbalanced class distribution. Traditionally, classification systems are used to solve this problem. Instead of classifying each data case to a definite class (e.g., buyer or non-buyer), a classification system is modified to produce a class probability estimate (or a score) for the data case to indicate the likelihood that the data case belongs to the target class (e.g., the buyer class). However, existing classification systems only aim to find a subset of the regularities or rules that exist in data. This subset of rules only gives a partial picture of the domain. In this paper, we show that the target selection problem can be mapped to association rule mining to provide a more powerful solution to the problem. Since association rule mining aims to find all rules in data, it is thus able to give a complete picture of the underlying relationships in the domain. The complete set of rules enables us to assign a more accurate class probability estimate to each data case. This paper proposes an effective and efficient technique to compute class probability estimates using association rules. Experiment results using public domain data and real-life application data show that in general the new technique performs markedly better than the state-of-the-art classification system C4.5, boosted C4.5, and the Na&iuml;ve Bayesian system.
Some blow-up results for a generalized Ginzburg-Landau equation
Authors: M. Aassila
Venue: Zeitschrift f&uuml;r Angewandte Mathematik und Physik (ZAMP) (2002)

We investigate the blow-up of the solution to a complex Ginzburg-Landau like equation in u coupled with a Poisson equation in φ defined on the whole space Rn, n = 1 or 2.
NETRA: A Hierarchical and Partitionable Architecture for Computer Vision Systems
Authors: A. N. Choudhary, J. H. Patel, N. Ahuja
Venue: IEEE Transactions on Parallel and Distributed Systems (1993)

Computer vision is regarded as one of the most complex and computationally intensiveproblems. In general, a Computer Vision System (CVS) attempts to relate scene(s) interms of model(s). A typical CVS employs algorithms from a very broad spectrum such as numerical, image processing, graph algorithms, symbolic processing, and artificialintelligence. The authors present a multiprocessor architecture, called "NETRA," forcomputer vision systems. NETRA is a highly flexible architecture. The topology of NETRA is recursively defined, and hence, is easily scalable from small to large systems. It is a hierarchical architecture with a tree-type control hierarchy. Its leaf nodes consists of a cluster of processors connected with a programmable crossbar with selective broadcast capability to provide the desired flexibility. The processors in clusters can operate in SIMD-, MIMD- or Systolic-like modes. Other features of the architecture include integration of limited data-driven computation within a primarily control flow mechanism, block-level control and data flow, decentralization of memory management functions, and hierarchical load balancing and scheduling capabilities. The paper also presents a qualitative evaluation and preliminary performance results of a cluster of NETRA.
Efficient Differential Timeslice Computation
Authors: Kristian Torp, Leo Mark, Christian S. Jensen
Venue: IEEE Transactions on Knowledge and Data Engineering (1998)

Transaction-time databases support access to not only the current database state, but also previous database states. Supporting access to previous database states requires large quantities of data and necessitates efficient temporal query processing techniques. In previous work, we have presented a log-based storage structure and algorithms for the differential computation of previous database states. Timeslices¿i.e., previous database states¿are computed by traversing a log of database changes, using previously computed and cached timeslices as outsets. When computing a new timeslice, the cache will contain two candidate outsets: an earlier outset and a later outset. The new timeslice can be computed by either incrementally updating the earlier outset or decrementally "downdating" the later outset using the log. The cost of this computation is determined by the size of the log between the outset and the new timeslice. This paper proposes an efficient algorithm that identifies the cheaper outset for the differential computation. The basic idea is to compute the sizes of the two pieces of the log by maintaining and using a tree structure on the timestamps of the database changes in the log. The lack of a homogeneous node structure, a controllable and high fill-factor for nodes, and of appropriate node allocation in existing tree structures (e.g., B+-trees, Monotonic B+-trees, and Append-only trees) render existing tree structures unsuited for our use. Consequently, a specialized tree structure, the Pointer-less Insertion tree, is developed to support the algorithm. As a proof of concept, we have implemented a main memory version of the algorithm and its tree structure.
Industrial BIST of Embedded RAMs
Authors: Paolo Camurati, Paolo Prinetto, Matteo Sonza Reorda, Stefano Barbagallo, Andrea Burri, Davide Medina
Venue: IEEE Design Test (1995)

High-quality memory testing is increasingly important, especially when RAMs and ROMs are deeply embedded in bigger systems, as the techniques based on control and observation points fail. Adopting a built-in self-test scheme for deeply embedded memories seems advantageous and industrial experience at Italtel, a telecom company, confirms it. The scheme implements in hardware the test pattern generation algorithm proposed by R. Nair, S.M. Thatte, and J.A. Abraham \cite{NTAb78}, extending it to word-based memories. Area overhead, performance degradation, additional pins, and test time are minimal, whereas we guarantee high fault coverage for the significant failure modes and full testability of the BIST hardware, as the experimental results confirm.
Pipeline optimization for asynchronous circuits: complexity analysis and an efficient optimal algorithm
Authors: Sangyun Kim, Peter A. Beerel
Venue: Proceedings of the 2000 IEEE/ACM international conference on Computer-aided design (2000)

This paper addresses the problem of identifying the minimal pipelining needed in an asynchronous circuit (e.g., number/size of pipeline stages/latches required) to satisfy a given performance constraint, thereby implicitly minimizing area and power for a given performance. In contrast to the somewhat analogous problem of retiming in the synchronous domain, we first show that the basic pipeline optimization problem for asynchronous circuits is NP-complete. This paper then presents an efficient branch and bound algorithm that can find the optimal pipeline configuration for moderately-sized problems. Our experimental results on a few scalable system models demonstrate that our novel branch and bound solver can find the optimal pipeline configuration for models that have up to 235 possible pipeline configurations.
A Sliding Memory Plane Array Processor
Authors: M. H. Sunwoo, J. K. Aggarwal
Venue: IEEE Transactions on Parallel and Distributed Systems (1993)

A mesh-connected single-input multiple-data (SIMD) architecture called a sliding memory plane (SliM) array processor is proposed. Differing from existing mesh-connected SIMD architectures, SliM has several salient features such as a sliding memory plane that provides inter-PE communication during computation. Two I/O planes provide an I/O overlapping capability. Thus, inter-PE communication and I/O overhead can be overlapped with computation. Inter-PE communication time is invisible in most image processing tasks because the computation time is larger than the communication time on SliM. The ability to overlap inter-PE communication with computation, regardless of window size and shape and without using a coprocessor or an on-chip DMA controller is unique to SliM.
The NUMA with Clusters of Processors for Parallel Join
Authors: Sakti Pramanik, Walid R. Tout
Venue: IEEE Transactions on Knowledge and Data Engineering (1997)

Recently, a number of hybrid systems have been proposed to combine the advantages of shared nothing and shared everything concepts for computing relational join operations. Most of these proposed systems, however, presented a few analytical results and have produced limited or no implementations on actual multiprocessors. In this paper, we present a parallel join algorithm with load-balancing for a hybrid system that combines both shared-nothing and shared-everything architectures. We derive an analytical model for the join algorithm on this architecture and validate it using both hardware/software simulations and actual experimentations. We study the performance of the join on the hybrid system for a wide range of system parameter values. We conclude that the hybrid system outperforms both shared-nothing and shared-everything architectures.
Transformation-Invariant Clustering Using the EM Algorithm
Authors: Brendan J. Frey, Nebojsa Jojic
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2003)

Clustering is a simple, effective way to derive useful representations of data, such as images and videos. Clustering explains the input as one of several prototypes, plus noise. In situations where each input has been randomly transformed (e.g., by translation, rotation, and shearing in images and videos), clustering techniques tend to extract cluster centers that account for variations in the input due to transformations, instead of more interesting and potentially useful structure. For example, if images from a video sequence of a person walking across a cluttered background are clustered, it would be more useful for the different clusters to represent different poses and expressions, instead of different positions of the person and different configurations of the background clutter. We describe a way to add transformation invariance to mixture models, by approximating the nonlinear transformation manifold by a discrete set of points. We show how the expectation maximization algorithm can be used to jointly learn clusters, while at the same time inferring the transformation associated with each input. We compare this technique with other methods for filtering noisy images obtained from a scanning electron microscope, clustering images from videos of faces into different categories of identification and pose and removing foreground obstructions from video. We also demonstrate that the new technique is quite insensitive to initial conditions and works better than standard techniques, even when the standard techniques are provided with extra data.
After Accolade: Time for New Laws?
Venue: IEEE Software (1992)

The debate concerning reverse engineering, decompilation and intermediate copying of software is reviewed. The effects of the Sega Enterprises vs. Accolade court case on this debate are discussed. It is argued that if computer professionals want to ensure that they will be able to continue to work in an environment that promotes innovation and the sharing of ideas, they must demand clear and well-thought-out intellectual-property laws for software and a judicial system capable of handling complex technical cases. They must also take an active role in the development of the laws under which they must work. Representative arguments from both side of the issue are presented in the form of selected quotes.
Managing Risk in Software Maintenance
Authors: Robert N. Charette, Kevin Macg. Adams, Mary B. White
Venue: IEEE Software (1997)

Risk management in maintenance differs in major ways from risk management in development. Risk opportunities are more frequent, risks come from more diverse sources, and projects have less freedom to act on them. The authors describe how they dealt with these differences in a large US Navy software maintenance organization.
State/Driving-Variable Representation of 2D Systems
Authors: Isabel Brás, Paula Rocha
Venue: Multidimensional Systems and Signal Processing (2002)

We characterize the discrete 2D systems with kernel representation that admit a state/driving-variable (SDV) representation. This characterization is based on the possibility of decomposing a behaviour {\cal B} as the sum of its controllable part with a suitable autonomous part (controllable-autonomous decomposition). We show that {\cal B} has a SDV representation if and only if it allows for a controllable-autonomous decomposition where the autonomous part is SDV representable. This means that {\cal B} has a kernel representation matrix which can be decomposed as the product of two 2D L-polynomial matrices such that the left factor is factor left prime and the right factor is square and properly invertible.
Profile-Driven Behavioral Synthesis for Low-Power VLSI Systems
Authors: Nand Kumar, Srinivas Katkoori, Leo Rader, Ranga Vemuri
Venue: IEEE Design Test (1995)

We present a profile-driven approach to behavior level synthesis. In this approach, event activities related to various operations and carriers in the behavioral specification are measured by simulating the description using user-supplied profiling stimuli. These event activities are then used during the synthesis process to estimate the switching activity in the design being synthesized. Overall switching activity estimation is based on modulating the average intrinsic switching activities of the synthesis library modules using the event activities. This estimate is used to select a module set and a schedule which, besides meeting the area and clock-speed constraints, would minimize the switching activity in the design. Experimental results for a number of examples show that the switching activity estimated during synthesis deviates by less than 10% on the average from the actual switching activity measured after completing synthesis.The same profile-driven approach is applied to estimate the total amount of capacitance that would switch in the design when the given stimuli is applied. Again, experimental results show that, on the average, the estimated switched capacitance deviates from the actual measured value by about 12%.
Determining Possible Event Orders by Analyzing Sequential Traces
Authors: D. P. Helmbold, C. E. McDowell, J. Z. Wang
Venue: IEEE Transactions on Parallel and Distributed Systems (1993)

One of the fundamental problems encountered when debugging a parallel program isdetermining the possible orders in which events could have occurred. Various problems,such as data races and intermittent deadlock, arise when there is insufficientsynchronization between the tasks in a parallel program. A sequential trace of anexecution can be misleading, as it implies additional event orderings, distorting theconcurrent nature of the computation. Algorithms to generate, from the trace of anexecution, those event orderings that can be relied on by the programmer are described.By its very nature, the information in an execution trace pertains only to that executionof the program, and may not generalize to other executions. This difficulty is mitigated by defining an inferred program based on the trace and original program, analyzing thisinferred program, and showing how the inferred program relates to the original. Theresults of the algorithms can be used by other automated tools such as a data racedetector or constraint checker.
Legacy Integration-Changing Perspectives
Authors: Frank P. Coyle
Venue: IEEE Software (2000)

The term legacy has taken on new meaning with the Web's broad success and the demand to bring existing systems quickly into the Internet fold. Cobol programs and data are being viewed in a new positive light with options for interconnection and integration for both code and data.
High Defect Coverage with Low-Power Test Sequences in a BIST Environment
Authors: Patrick Girard, Christian Landrault, Serge Pravossoudovitch, Arnaud Virazel, Hans-Joachim Wunderlich
Venue: IEEE Design Test (2002)

A new technique, random single-input change (RSIC) test generation, generates low-power test patterns that provide a high level of defect coverage during low-power BIST of digitalcircuits. The authors propose a parallel BIST implementation of the RSIC generator and analyze its area-overhead impact.
Expert System Benchmarks
Authors: Larry Press
Venue: IEEE Expert: Intelligent Systems and Their Applications (1989)

Benchmarks for use with expert system shells are considered. Two approaches are pursued: running a shell with a real knowledge base on different machines, and running an artificial, stylized benchmark knowledge base with different shells on the same machine. The realistic benchmark uses PC Plus, a Lisp-based shell and development environment with an inference engine that uses backward chaining (forward chaining is also possible). Stylized knowledge bases have been used with different shells to compare loading and execution time, file size, and memory requirements. Some stylized-benchmark results are given.
Improving Memory Hierarchy Performance for Irregular Applications Using Data and Computation Reorderings
Authors: John Mellor-Crummey, David Whalley, Ken Kennedy
Venue: International Journal of Parallel Programming (2001)

The performance of irregular applications on modern computer systems is hurt by the wide gap between CPU and memory speeds because these applications typically under-utilize multi-level memory hierarchies, which help hide this gap. This paper investigates using data and computation reorderings to improve memory hierarchy utilization for irregular applications. We evaluate the impact of reordering on data reuse at different levels in the memory hierarchy. We focus on coordinated data and computation reordering based on space-filling curves and we introduce a new architecture-independent multi-level blocking strategy for irregular applications. For two particle codes we studied, the most effective reorderings reduced overall execution time by a factor of two and four, respectively. Preliminary experience with a scatter benchmark derived from a large unstructured mesh application showed that careful data and computation ordering reduced primary cache misses by a factor of two compared to a random ordering.
C49-C54 phase transition in nanometric titanium disilicide nanograins
Authors: M. S. Alessandrino, M. G. Grimaldi, F. La Via
Venue: Microelectronic Engineering (2002)

The first order C49-C54 phase transition was studied in single TiSi2 grains embedded in a Si matrix by transmission electron microscopy and X-ray diffraction. The fraction of material transformed into C54 was determined at different times during the annealing in the 700-1100 °C temperature range. The fraction of C54 increases with temperature and the steady state value is reached in times of ∼ 60 s. The data are interpreted in terms of heterogeneous nucleation at the silicide-silicon interface.
Odd subgraphs and matchings
Authors: M. Kano, Gyula Y. Katona
Venue: Discrete Mathematics (2002)

Let G be a graph and f : V(G) → {1, 3, 5,...}. Then a subgraph H of G is called a (1, f)-odd subgraph if degH(x) ∈ {1,3, ..., f(x)} for all x ∈ V(H). If f(x) = 1 for all x ∈ V(G), then a (1,f)-odd subgraph is nothing but a matching. A (1,f)-odd subgraph H of G is said to be maximum if G has no (1,f)-odd subgraph K such that |K| > |H|. We show that (1,f)-odd subgraphs have some properties similar to those of matchings, in particular, we give a formula for the order of a maximum (1,f)-odd subgraph, which is similar to that for the order of a maximum matching.
An Empirical Study of Multipopulation Genetic Programming
Authors: Francisco Fernández, Marco Tomassini, Leonardo Vanneschi
Venue: Genetic Programming and Evolvable Machines (2003)

This paper presents an experimental study of distributed multipopulation genetic programming. Using three well-known benchmark problems and one real-life problem, we discuss the role of the parameters that characterize the evolutionary process of standard panmictic and parallel genetic programming. We find that distributing individuals between subpopulations offers in all cases studied here an advantage both in terms of the quality of solutions and of the computational effort spent, when compared to single populations. We also study the influence of communication patterns such as the communication topology, the number of individuals exchanged and the frequency of exchange on the evolutionary process. We empirically show that the topology does not have a marked influence on the results for the test cases studied here, while the frequency and number of individuals exchanged are related and there exists a suitable range for those parameters which is consistently similar for all the problems studied.
Low temperature conductance fluctuations in double-dot system
Authors: N. Aoki, D. Oonishi, Y. Iwase, K. Ishibashi, Y. Aoyagi, Y. Ochiai
Venue: Microelectronic Engineering (2002)

We have studied the low temperature conductance fluctuations in double-dot systems. The electron wave coupling between ballistic quantum dots has been investigated in a pair of coupled quantum dots defined by several independently-tunable quantum-point-contacts (QPCs). Reproducible conductance fluctuations are observed in the low temperature magneto-conductance at low magnetic fields and a clear difference between weak and strong couplings has been identified as the gap of the QPC corresponding to the inter-dot coupling is varied. This suggests clear evidence for a specific spread of the coupling orbit over the whole dot region.