ppxscal/embedding_network huggingface dataset:
Improving Software Process Improvement
Authors: Reidar Conradi, Alfonso Fuggetta
Venue: IEEE Software (2002)

Several issues and problems exist for software process improvement application. According to the authors' experiences, two dichotomies characterize software process improvement efforts and approaches: disciplined vs. creative work and procurer risks vs. user satisfaction. Based on these perspectives, the authors introduce six theses to illuminate the problems of pursuing software process improvement and discuss possible remedies. Approaches to software process improvement must be substantially extended to take into account organizational, economic, and strategic issues. Researchers must also perform systematic empirical studies around such technologies, by combining methods from software engineering and social sciences, for example.
Global solution of the pressureless gas equation with viscosity
Authors: Azzouz Dermoune, Boualem Djehiche
Venue: Physica D (2002)

We construct a global weak solution to a d-dimensional system of zero-pressure gas dynamics modified by introducing a finite artificial viscosity. We use discrete approximations to the continuous gas and make particles move along trajectories of the normalized simple symmetric random walk with deterministic drift. The interaction of these particles is given by a sticky particle dynamics. We show that a subsequence of these approximations converges to a weak solution of the system of zero-pressure gas dynamics in the sense of distributions. This weak solution is interpreted in terms of a random process solution of a nonlinear stochastic differential equation. We get a weak solution of the inviscid system by tending the viscosity to zero.
Barriers to effective use of knowledge management systems in software engineering
Authors: Kevin C. Desouza
Venue: Communications of the ACM (2003)

An organization must recognize that information technology is only one means to foster knowledge.
Generic Support for Distributed Applications
Authors: Jean Bacon, Ken Moody, John Bates, Richard Hayton, Chaoying Ma, Andrew McNeil, Oliver Seidel, Mark Spiteri
Venue: Computer (2000)

In the late 1980s, software designers introduced middleware platforms to support distributed computing systems. Since then, the rapid evolution of technology has caused an explosion of distributed-processing requirements. Application developers now routinely expect to support multimedia systems and mobile users and computers. Timely response to asynchronous events is crucial to such applications, but current platforms do not adequately meet this need.Another need of existing and emerging applications is the secure interoperability of independent services in large-scale, widely distributed systems. Information systems serving organizations such as universities, hospitals, and government agencies require cross-domain interaction.To meet the needs of these applications, Cambridge University researchers developed middleware extensions that provide a flexible, scalable approach to distributed-application development.This article details the extensions they developed, explaining their distributed software approach and the support it has provided for emerging applications.
Image Processing Using RBF like Neural Networks: A ZISC-036 Based Fully Parallel Implementation Solving Real World and Real Complexity Industrial Problems
Authors: Kurosh Madani, Ghislain De Trémiolles, Pascal Tannhof
Venue: Applied Intelligence (2003)

The present article concerns neural based image processing and solutions developed for industrial problems using the ZISC-036 neuro-processor, an IBM hardware processor which implements the Restricted Coulomb Energy algorithm (RCE) and the K-Nearest Neighbor algorithm (KNN). The developed neural based techniques have been applied for image enhancement in order to restore old movies (noise reduction, focus correction, etc.), to improve digital television images, or to treat images which require adaptive processing (medical images, spatial images, special effects, etc.). We also have developed and implemented on ZISC-036 neuro-processor, a neural network based solution for visual probe mark inspection in VLSI production for the IBM Essonnes plant. The main characteristics of such systems are real-time control and high reliability in detection and classification tasks. Experimental results, validating presented concepts, have been reported showing quantitative and qualitative improvement as well as the efficiency our solutions.
The Rule-Based Approach to Reconfiguration of 2-D Processor Arrays
Authors: J. H. Kim, P. K. Rhee
Venue: IEEE Transactions on Computers (1993)

The authors propose to set up assignment rules based on the available interconnection resources of 2-D processor arrays. The reconfiguration of 2-D processor arrays is guided by the assignment rules, such that logical cells are always connected through the available interconnection resources. The advantage of the proposed approach is the easy adaptation to various system requirements, by adjusting assignment rules. The proposed reconfiguration algorithm can be extended to arrays with clustered faulty cells, overcoming the weakness of fixed domain approaches.
An Optimal Implementation of Broadcasting with Selective Reduction
Authors: L. Fava Lindon, S. G. Akl
Venue: IEEE Transactions on Parallel and Distributed Systems (1993)

A model of parallel computation called broadcasting with selective reduction (BSR) can be viewed as a concurrent-read concurrent-write (CRCW) parallel random access machine (PRAM) with one extension. An additional type of concurrent memory access is permitted in BSR, namely the BROADCAST instruction by means of which all N processors may gain access to all M memory locations simultaneously for the purpose of writing. At each memory location, a subset of the incoming broadcast data is selected and reduced to one value finally stored in that location. For several problems, BSR algorithms are known which require fewer steps than the corresponding best-known PRAM algorithms, using the same number of processors. A circuit is introduced to implement the BSR model, and it is shown that, in size and depth, the circuit presented is of the same order as an optimal circuit implementing the PRAM. Thus, if it is reasonable to assume that CRCW PRAM instructions execute in constant time, the assumption of a constant time BROADCAST instruction is no less reasonable.
Color image segmentation using fuzzy C-means and eigenspace projections
Authors: Jar-Ferr Yang, Shu-Sheng Hao
Venue: Signal Processing (2002)

In this paper, we propose two eigen-based fuzzy C-means (FCM) clustering algorithms to accurately segment the desired images, which have the same color as the pre-selected pixels. From the selected color pixels, we can first divide the color space into principal and residual eigenspaces. Combined eigenspace transform and the FCM method, we can effectively achieve color image segmentation. The separate eigenspace FCM (SEFCM) algorithm independently applies the FCM method to principal and residual projections to obtain two intermediate segmented images and combines them by logically selecting their common pixels. Jointly considering principal and residual eigenspace projections, we then suggest the coupled eigen-based FCM (CEFCM) algorithm by using an eigen-based membership function in clustering procedure. Simulations show that the proposed SEFCM and CEFCM algorithms can successfully segment the desired color image with substantial accuracy.
A visual environment for visual languages
Authors: Roswitha Bardohl
Venue: Science of Computer Programming (2002)

The visual environment GENGED supports the visual definition of visual languages (VLs). Each VL is defined by an alphabet and a grammar. From a specific VL-definition, a VL-specification is generated which is the input of a graphical editor allowing for syntax-directed editing of diagrams over the specified VL. GENGED as well as each VL is based on the well-defined concepts of algebraic graph transformation and graphical constraint solving. The underlying formalism is hidden from the user, but it is essential for a formal presentation and manipulation of graphical structures. In this contribution, the GENGED concepts and environment are briefly proposed and illustrated by the definition of a simple kind of the well-known statechart language.
Information Survivability for Evolvable and Adaptable Real-Time Command and Control Systems
Authors: Bhavani M. Thuraisingham, John A. Maurer
Venue: IEEE Transactions on Knowledge and Data Engineering (1999)

MITRE's Evolvable Real-Time C3 (Command, Control, and Communications) project has developed an approach that would enable current real-time systems to evolve into the systems of the future. This paper first summarizes the design and implementation of an infrastructure for an evolvable real-time C3 system. Then, a detailed discussion of the infrastructure requirements for a survivable real-time C3 system is presented. Finally security issues for survivability, as well as open implementation of the infrastructure, are described. In particular, adaptable middleware for survivable systems is discussed.
An Approach to Computational Complexity: Nondiscrete Biomolecular Computing
Authors: Nikolay G. Rambidi
Venue: Computer (1992)

Discrete molecular computing devices based on digital device simulation and nondiscrete biomolecular computing devices based on the overall principles of information processing that use molecular-level mechanisms to create simple biomolecular systems are described. It is argued that discrete molecular computing only extends the choice of materials available in modern semiconductor device technology, but does not provide an opportunity to use physical mechanisms of information processing different from those available in conventional materials and devices. Nondiscrete biomolecular information processing devices effectively solve some problems with high computational complexity-for example, image processing operations such as contour enhancement and line extraction. The information processing potential of biomolecular systems is reviewed.
Dynamic modification of object Petri nets: an application to modelling protocols with fork-join structures
Authors: Berndt Farwer
Venue: Fundamenta Informaticae (2002)

In this paper we discuss possibilities of modelling protocols by objects in object-based high-level Petri nets. Some advantages of dynamically modifying the structure of token objects are discussed and the need for further investigations into mathematically rigorous foundations of object net formalisms incorporating facilities for such operations on its token nets is emphasised.
Critiquing Software Specifications
Authors: Stephen Fickas, P. Nagarajan
Venue: IEEE Software (1988)

The authors describe how the knowledge of expert-systems analysts is being input to use in an automated critic for specification debugging. They are working on a system, named Kate, that tries to acquire a problem specification that includes a description of the objects, transitions (actions), and constraints of the intended system. They have built a computer-based critic as part of the Kate environment that has its roots in a set of protocols they collected over several analysis sessions. The critic has three major components: a model of the domain, a matcher to connect parts of the model to the specification being analyzed, and a critique to supply the analysis. The model represents a set of policy issues for building systems in a particular domain and a set of relevant problem specification cases to consider for systems in the domain. The critic has been run on a library database problem. The results are presented and compared with a critique by an experienced library analyst.
Homomorphisms to powers of digraphs
Authors: Richard C. Brewster, Pavol Hell
Venue: Discrete Mathematics (2002)

Given a digraph G and a sufficiently long directed path P, a folklore result says that G is homomorphic to P if and only if all cycles in G are balanced (the same number of forward and backward arcs). The purpose of this paper is to study homomorphisms of digraphs G that contain unbalanced cycles. In this case, we may be able to find a homomorphism of G to a power of P. Our main result states that the minimum power of P to which G admits a homomorphism equals the maximum imbalance (ratio of forward and backward arcs) of any cycle in G. The proof also yields a polynomial time algorithm to find this minimum power of P. We identify a larger class of digraphs H for which this minimum power problem can be solved in polynomial time, it includes all oriented paths H. By relating our powers of paths to complete graphs and so-called circular graphs, we are able to deduce a classical result of Minty regarding the chromatic number, as well as its more recent extension, by Goddyn, Tarsi, and Zhang, to the circular chromatic number.
Requirements Engineering as a Success Factor in Software Projects
Authors: Hubert F. Hofmann, Franz Lehner
Venue: IEEE Software (2001)

Requirements engineering might be the single most important part of any software project. Based on their field study of 15 RE teams in nine software organizations, the authors identify the RE practices that clearly contribute to project success, particularly in terms of team knowledge, resource allocation, and process. They then summarize the best practices exhibited by the most successful teams.
Modeling and Simulation of Mixed Queueing and Loss Systems
Authors: Gábor Fodor, Søren Blaabjerg, Allan T. Andersen
Venue: Wireless Personal Communications: An International Journal (1998)

In this paper, we investigate a multi-rate network in which wide-band calls are allowed to wait if insufficient resources are available at the time of the call arrival. On the link level, an analytical model is presented and simulations have been carried out on the network level. The results indicate that allowing a few wide-band calls to queue can give a significant improvement in performance in terms of network revenue , as well as a means to level out the blocking probabilities of the different traffic classes. This improvement becomes significant when the service discipline of the waiting calls (of different bandwidth requirements) is adaptive in the sense that longer queues get served first. This observation motivates the investigation of the impact of various buffer space assignment and queueing disciplines on network revenue and call blocking probabilities. The study of such mixed delay and queueing networks is motivated by its possible applications to traffic problems in future Broadband Integrated Services Digital Networks as well as in multi-rate cellular radio networks.
Design Process: A Primer for Architectural and Interior Design
Authors: Sam F. Miller
Venue:  (1997)

:First, you'll learn how to look at building components and materials inside and out, evaluating: structural materials; heating, electrical, and plumbing systems; aesthetics and light; the site; movement of people and traffic; and ecological considerations. Then, you'll learn why research is important and why you need to be familiar with particular building types - hospitals, museums, manufacturing facilities, airports, libraries, office buildings, and mixed-use structures - before you even think about designing. And you'll take a look at building codes and local zoning ordinances. After a thorough grounding in the physical, you'll meet that all-important client and learn how to find out what they really want as you develop a list of goals, problems to be solved, and design requirements. You'll learn how to brainstorm with the client and discover why it's important to involve the client in the design process from beginning to end. 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
Testing NASA's 3D-Stack MCM Space Flight Computer
Authors: Koppol Sasidhar, Leon Alkalai, Abhijit Chatterjee
Venue: IEEE Design Test (1998)

Advanced packaging technologies such as 3D chip stacking, multichip modules (MCMs), and 3D stacks of MCMs provide opportunities for significant reductions in system mass, volume and power. They also pose major testing challenges that need to be resolved before they are used in mainstream designs. Among these challenges, the problems of achieving acceptable assembly yields and meeting product quality requirements through appropriate test methodologies are very critical. Both these problems can be significantly alleviated by adopting testing approaches which guarantee the integrity and performance of the underlying packaging technologies. In this article, we propose test methodologies for a 3D stack of MCMs used by the flight computer of the NASA New Millennium Program (NMP) Deep-Space mission spacecraft. The test methodologies are based on the IEEE 1149.1 Boundary Scan Standard architecture. Special test chips are used for reliable test and diagnosis of the 3D MCM stack-based flight computer architecture. Also, the range of test options available are evaluated and ranked with respect to test time, test hardware, number of test lines, and test reliability. The test hardware has been fabricated and is scheduled to fly in space in the near future.
On the use of genetic algorithms to solve location problems
Authors: Jorge H. Jaramillo, Joy Bhadury, Rajan Batta
Venue: Computers and Operations Research (2002)

This paper seeks to evaluate the performance of genetic algorithms (GA) as an alternative procedure for generating optimal or near-optimal solutions for location problems. The specific problems considered are the uncapacitated and capacitated fixed charge problems, the maximum covering problem, and competitive location models. We compare the performance of the GA-based heuristics developed against well-known heuristics from the literature, using a test base of publicly available data sets.
On large-sample parametric approaches for interval estimation of the ED90
Authors: Yangxin Huang
Venue: Computational Statistics Data Analysis (2002)

A number of studies have looked at various methods for the interval estimation of the median effective dose for a logistic dose-response curve. There has been comparatively little work done on more extreme effective doses. In many cases a more extreme dose level may be regarded as a more suitable summary of the data. The interval estimation of the 90% effective dose (ED90) will be of principal interest. Five large-sample approaches of constructing confidence intervals for the ED90 are compared and their properties are investigated.
Adaptive Spectral Element Simulations of Thin Premixed Flame Sheet Deformations
Authors: Huiyu Feng, Catherine Mavriplis
Venue: Journal of Scientific Computing (2002)

The high order Spectral Element Method is used to solve the reaction-diffusion-advection problem as described by the premixed flame case. An h&ndash;p adaptive refinement-coarsening algorithm is developed based on a posteriori error estimators. Simulations of the wrinkling of a premixed flame front are used to illustrate how the mesh is adaptively refined. A similar, idealized heat transfer problem is used to show the adaptive refinement and coarsening of the mesh. Adaptivity efficiently provides high resolution in areas of the domain where large or rapidly varying physical changes exist, while saving unnecessary computation where the solution is smooth or physical phenomena have passed by.
Directed t-Packings and Directed t-SteinerSystems
Authors: Rudolf Mathon, Tran Van Trung
Venue: Designs, Codes and Cryptography (1999)

The aim of this paper is an investigation of directed t-packings and in particular of directed t-Steiner systems. A new upper bound on the number of points k for directed t-Steiner systems T(t,k,k) is obtained. We disprove a conjecture of Levenshtein on T(t,k,k) for t\geq 3 by showing that a T(4,6,6) exists. Furthermore, it is proved that the symmetric group S_6 can be partitioned into 30 disjoint T(4,6,6)s. Extensive computer search shows that the tight upper bound for t=4,5 is 6 and for t=6 is 7. The non-existence of further small directed t-Steiner systems is established, and large directed t-packings for t=4,5,6 are constructed.
Cyclic Haar graphs
Authors: Milan Hladnik, Dragan Marusic, Tomaz Pisanski
Venue: Discrete Mathematics (2002)

For a given group Γ with a generating set A, a dipole with |A| parallel arcs (directed edges) labeled by elements of A gives rise to a voltage graph whose covering graph, denoted by H(Γ,A) is a bipartite, regular graph, called a bi-Cayley graph. In the case when Γ is abelian we refer to H(Γ,A) as the Haar graph of Γ with respect to the symbol A. In particular for Γ cyclic the above graph is referred to as a cyclic Haar graph. A basic theory of cyclic Haar graphs is presented.
Constant Weight Codes for Correcting Symmetric Errors and Detecting Unidirectional Errors
Authors: Mao-Chao Lin
Venue: IEEE Transactions on Computers (1993)

Proposes two classes of constant weight codes, which can be used for correcting t symmetric errors and simultaneously detecting all unidirectional errors. Codes in the first class are in quasi-systematic form and codes in the second class are in systematic form. Since each codeword of codes in both classes can be divided into a data part and a parity check part, the proposed codes have the merit of easily mapping messages into codewords.
High-Accuracy Flush-and-Scan Software Diagnostic
Authors: Kevin Stanley
Venue: IEEE Design Test (2001)

This software technique operates over a wide range of defect modes to quickly and accurately diagnose the failing latch in a defective chain without special circuitry or pattern generation.
Tensor field visualisation using adaptive filtering of noise fields combined with glyph rendering
Authors: Andreas Sigfridsson, Tino Ebbers, Einar Heiberg, Lars Wigström
Venue: Proceedings of the conference on Visualization '02 (2002)

While many methods exist for visualising scalar and vector data, visualisation of tensor data is still troublesome. We present a method for visualising second order tensors in three dimensions using a hybrid between direct volume rendering and glyph rendering.An overview scalar field is created by using three-dimensional adaptive filtering of a scalar field containing noise. The filtering process is controlled by the tensor field to be visualised, creating patterns that characterise the tensor field. By combining direct volume rendering of the scalar field with standard glyph rendering methods for detailed tensor visualisation, a hybrid solution is created.A combined volume and glyph renderer was implemented and tested with both synthetic tensors and strain-rate tensors from the human heart muscle, calculated from phase contrast magnetic resonance image data. A comprehensible result could be obtained, giving both an overview of the tensor field as well as detailed information on individual tensors.
Dependency Analysis-A Petri-Net-Based Technique for Synthesizing Large Concurrent Systems
Authors: Y. Chen, W. T. Tsai, D. Chao
Venue: IEEE Transactions on Parallel and Distributed Systems (1993)

Petri nets (PNs) are frequently used in modeling, designing, and analyzing concurrentsystems. A problem with PNs, in the general case, is that they require high computationalcomplexity to analyze their properties, such as reachability, liveness, and boundedness.To avoid this problem, synthesis techniques for constructing large PNs are presented.Using these techniques, the behavior of the constructed PN can be determined by localanalysis that uses known properties of the given nets. Thus, the high computationalcomplexity of global analysis is bypassed. A synthesis technique that exploresdependency relations in PNs is presented. It synthesizes large PNs by combining smallerPNs of arbitrary topology structures, and the combination is verified efficiently bydependency analysis. A large system based on a PN can be built up by repeatedapplications of the technique.