ppxscal/embedding_network huggingface dataset:
Open Source Software Development: An Overview
Authors: Ming-Wei Wu, Ying-Dar Lin
Venue: Computer (2001)

Although some challenge the value of open source software development, its popularity is undisputed. This overview of open source licensing and development models describes the movement's main principles. Whereas proprietary vendors use a closed-source model to develop their software, release it to the public, and anticipate a profit, the open source movement-- although still profitable-- relies on different practices. Open source projects invite everyone capable of writing code to join in, leading to robust software and diverse business models. However, having multiple participants requires extensive coordination, ranging from standardizing software to offering other benefits. Inexpensive even when packaged and sold by a third-party vendor, open source software frees developers and hardware manufacturers from following a closed-source software vendor's specifications. Open source software has also proven highly reliable as well, thanks to the continuing efforts of the programming community that develops it. Although free software provides unprecedented flexibility, stability, and freedom of choice, various distributions tend to compete and imitate one another. This fragmentation will likely be the most prominent hurdle facing open source software's future.
Correlation between microstructure control, density and diffusion barrier properties of TiN(O) films
Authors: A. Alberti, S. Molinaro, F. La Via, C. Bongiorno, G. Ceriola, S. Ravesi
Venue: Microelectronic Engineering (2002)

TiN layers have been used as diffusion barriers to prevent intermixing of aluminium and silicon. During TiN deposition on Ti by reactive sputtering, oxygen has been introduced in-situ into the barrier. Depending on the oxygen flow, a different content of oxygen has been incorporated into the TiN layer during the growth. The layer composition, resistivity and stress are very sensitive to this content. To improve the effectiveness of the barrier, the microstructure of the TiN(O) layer has been optimised on blanket films. Nevertheless, on devices, depletion of nitrogen has been found at the bottom of the contact hole due to geometrical flux variation. This deficiency, that causes the aluminium to spike into the barrier, has been balanced by increasing the nitrogen flow during deposition. In this way, A1 penetration towards the silicon substrate has been prevented and the base current of npn transistors do not increase when annealing up to 480°C 1 h.
Symbolic Interpretation of Artificial Neural Networks
Authors: Ismail A. Taha, Joydeep Ghosh
Venue: IEEE Transactions on Knowledge and Data Engineering (1999)

Hybrid Intelligent Systems that combine knowledge-based and artificial neural network systems typically have four phases involving domain knowledge representation, mapping of this knowledge into an initial connectionist architecture, network training, and rule extraction, respectively. The final phase is important because it can provide a trained connectionist architecture with explanation power and validate its output decisions. Moreover, it can be used to refine and maintain the initial knowledge acquired from domain experts. In this paper, we present three rule-extraction techniques. The first technique extracts a set of binary rules from any type of neural network. The other two techniques are specific to feedforward networks, with a single hidden layer of sigmoidal units. Technique 2 extracts partial rules that represent the most important embedded knowledge with an adjustable level of detail, while the third technique provides a more comprehensive and universal approach. A rule-evaluation technique, which orders extracted rules based on three performance measures, is then proposed. The three techniques area applied to the iris and breast cancer data sets. The extracted rules are evaluated qualitatively and quantitatively, and are compared with those obtained by other approaches.
Case study: visualizing ocean flow vertical motions using Lagrangian-Eulerian time surfaces
Authors: Josh Grant, Gordon Erlebacher, James O'Brien
Venue: Proceedings of the conference on Visualization '02 (2002)

Ocean model simulations commonly assume the ocean is hydrostatic, resulting in near zero vertical motion. The vertical motion found is typically associated with the variations of the thermocline depth over time, which are mainly a result of the development and movement of ocean fronts, eddies, and internal waves. A new technique, extended from Lagrangian-Eulerian Advection, is presented to help understand the variation of vertical motion associated with the change in thermocline depth over time. A time surface is correctly deformed in a single direction according to the flow. The evolution of the time surface is computed via a mixture of Eulerian and Lagrangian techniques. The dominant horizontal motion is textured onto the surface using texture advection, while both the horizontal and vertical motions are used to displace the surface. The resulting surface is shaded for enhanced contrast. Timings indicate that the overhead over standard 2D texture advection is no more than 12%.
The Linux Operating System
Authors: Shahid H. Bokhari
Venue: Computer (1995)

The enormous consumer market for IBM PCs and compatibles has made them affordable. Now, with a free operating system called Linux, these inexpensive machines can be converted into powerful workstations for teaching, research, and software development. Linux is a full-fledged operating system that provides all the capabilities normally associated with commercial Unix systems and has excellent compilers for C, C++, Pascal, Modula-2 and -3, Oberon, Smalltalk, and Fortran. For professionals who use Unix-based workstations at work, Linux permits virtually identical working environments on their personal home machines. For cost-conscious educational institutions--especially in developing nations--Linux can create world-class computing environments from inexpensive, easily maintained PC clones. And, for university students--especially in science and engineering--Linux provides an essentially cost-free path into Unix and X Windows. Until recently, most information about Linux was found only on the Internet. This article attempts to remedy that situation by describing how to obtain, install, and use Linux, as well as the hardware requirements to run it. In addition to providing a survey of pertinent literature, the article describes several public-domain applications that the author has found useful.
Extensions to Query Languages for Graph Traversal Problems
Authors: M. V. Mannino, L. D. Shapiro
Venue: IEEE Transactions on Knowledge and Data Engineering (1990)

Extensions to database query languages for retrievals that involve inferencing on the nodes and edges of a graph are surveyed. Common types of inferencing are to find paths between two nodes, compute a value for a path such as a distance or an elapsed time, and to choose among alternative paths. The survey is based on the data model (relational or functional), method of extension (iteration, recursion, or special operators), interface style (string or tabular), and restrictions (data- and problem-oriented). The Quel, objected-oriented functional data, G-Whin, and Alpha languages are examined in detail with different values for these properties. The characteristics of other languages are summarized in several tables. The results of the survey indicate the diversity of language extensions and the need to provide data-model and query-language features to address such problems.
A VHDL Standard Package for Logic Modeling
Authors: David R. Coelho
Venue: IEEE Design Test (1990)

A package facility that enables designers to write models intuitively, without being forced to work with the underlying complexity and verboseness of the base VHDL (VHSIC hardware description language), is described. The VHDL environment handles all technology-dependent calculations automatically and drops in the lookup tables and utility function code as appropriate. In addition, the VHDL package facility automatically inserts the bus-resolution function where required, avoiding any need for the hardware designer to code or see this complex function. The package conforms strictly to the IEEE 1076-1987 specification and is therefore portable to a wide range of VHDL environments.
Partial cell suppression: A new methodology for statistical disclosure control
Authors: Matteo Fischetti, Juan-José Salazar-González
Venue: Statistics and Computing (2003)

In this paper we address the problem of protecting confidentiality in statistical tables containing sensitive information that cannot be disseminated. This is an issue of primary importance in practice. Cell Suppression is a widely-used technique for avoiding disclosure of sensitive information, which consists in suppressing all sensitive table entries along with a certain number of other entries, called complementary suppressions. Determining a pattern of complementary suppressions that minimizes the overall loss of information results into a difficult (i.e., \cal{NP}-hard) optimization problem known as the Cell Suppression Problem. We propose here a different protection methodology consisting of replacing some table entries by appropriate intervals containing the actual value of the unpublished cells. We call this methodology Partial Cell Suppression, as opposed to the classical &ldquo;complete&rdquo; cell suppression. Partial cell suppression has the important advantage of reducing the overall information loss needed to protect the sensitive information. Also, the new method provides automatically auditing ranges for each unpublished cell, thus saving an often time-consuming task to the statistical office while increasing the information explicitly provided with the table. Moreover, we propose an efficient (i.e., polynomial-time) algorithm to find an optimal partial suppression solution. A preliminary computational comparison between partial and complete suppression methologies is reported, showing the advantages of the new approach. Finally, we address possible extensions leading to a unified complete/partial cell suppression framework.
The Role of Process in a Software Start-up
Authors: Stanley M. Sutton
Venue: IEEE Software (2000)

This article discusses the role of process in commercial software start-ups. After identifying the features of a start-up and the differences between a start-up and an established company, the author reaches the conclusion that start-ups should indeed care about process, although for reasons and in ways that differ from those of more established companies. The article offers ways in which a start-up can approach and improve process within its organization.
Intelligent Query Answering by Knowledge Discovery Techniques
Authors: Jiawei Han, Yue Huang, Nick Cercone, Yongjian Fu
Venue: IEEE Transactions on Knowledge and Data Engineering (1996)

Knowledge discovery facilitates querying database knowledge and intelligent query answering in database systems. In this paper, we investigate the application of discovered knowledge, concept hierarchies, and knowledge discovery tools for intelligent query answering in database systems. A knowledge-rich data model is constructed to incorporate discovered knowledge and knowledge discovery tools. Queries are classified into data queries and knowledge queries. Both types of queries can be answered directly by simple retrieval or intelligently by analyzing the intent of query and providing generalized, neighborhood or associated information using stored or discovered knowledge. Techniques have been developed for intelligent query answering using discovered knowledge and/or knowledge discovery tools, which includes generalization, data summarization, concept clustering, rule discovery, query rewriting, deduction, lazy evaluation, application of multiple-layered databases, etc. Our study shows that knowledge discovery substantially broadens the spectrum of intelligent query answering and may have deep implications on query answering in data- and knowledge-base systems.
An Analytic Study of Two Probabilistic Models for Establishing Ad Hoc WLANs
Authors: Sam Hsu, Lianfen Qian, Mohammad Ilyas
Venue: Information Technology and Management (2003)

Two contention-based algorithms are proposed in this paper for establishing ad hoc Wireless Local Area Networks (WLANs). They are named uniform and geometric, respectively, based on the nature of the probabilistic model in the decision making process used in each algorithm. The main performance consideration in this paper is the network setup time each algorithm requires. It is shown that the network setup time is an explicit function of the total solicitation rounds required. The paper is, therefore, focused on deriving the distribution of the total solicitation rounds needed for setting up a network. It is shown analytically that the performance of uniform is better than that of geometric. It also derives the asymptotic lower and upper bounds for the average setup times for uniform.
Primal and Dual Stability Results for Variational Inequalities
Authors: Alfred Auslender, Rafael Correa
Venue: Computational Optimization and Applications (2000)

The purpose of this paper is to study the continuous dependence of solutions of variational inequalities with respect to perturbations of the data that are maximal monotone operators and closed convex functions. The constraint sets are defined by a finite number of linear equalities and non linear convex inequalities. Primal and dual stability results are given, extending the classical ones for optimization problems.
Parallel Minimal Norm Method for Tridiagonal Linear Systems
Authors: L. Dekker, E. Dekker
Venue: IEEE Transactions on Computers (1995)

Based on the parallel minimal norm method an algorithm is derived to solve tridiagonal linear systems with a high degree of parallelism. No conditions need to be posed with respect to the system. Experiments indicate that the numerical stability of the algorithm is similar to Gaussian elimination with partial pivoting.
Using a Capability Evaluation to Select a Contractor
Authors: David Rugg
Venue: IEEE Software (1993)

The experiences of a government team in determining the winner of a three-year, $95-million software avionics contract using the Software Engineering Institute's Software Capability Evaluation program are discussed. The proposal evaluations, on-site evaluations, and post-on-site evaluation activities are all described. It is concluded that the evaluation method integrated well into the contractor-selection process.
Main Memory Database Systems: An Overview
Authors: H. Garcia-Molina, K. Salem
Venue: IEEE Transactions on Knowledge and Data Engineering (1992)

Main memory database systems (MMDBs) store their data in main physical memory and provide very high-speed access. Conventional database systems are optimized for the particular characteristics of disk storage mechanisms. Memory resident systems, on the other hand, use different optimizations to structure and organize data, as well as to make it reliable. The authors survey the major memory residence optimizations and briefly discuss some of the MMDBs that have been designed or implemented.
A Novel Reconfigurable Wrapper for Testing of Embedded Core-Based SOCs and its Associated Scheduling Algorithm
Authors: Sandeep Koranne
Venue: Journal of Electronic Testing: Theory and Applications (2002)

In this paper a mathematical formulation and an efficient solution, of the embedded core-based system-on-chip (SOC) test scheduling problem (ECTSP) is presented. The ECTSP can be stated as follows&semi; given a chip with NC cores each having a test Ti&semi; where Ti takes time {\cal F}_T(T_i,w_j) to execute on a test access mechanism (TAM) of width wj, and a constraint W on the number of top-level test pins&semi; calculate the TAM assignment vector &pi; and the schedule &Sigma; for each test Ti, such that the completion time of the full chip test is minimized. All existing approaches have solved the ECTSP by solving the TAM partition and scheduling problem sequentially. In this paper we present an unified approach to solve the ECTSP. We present the first report of a design of reconfigurable core wrapper which allows for a dynamic change in the width of the test access mechanism (TAM) executing a core test. An automatic procedure for the creation of DfT hardware required for reconfiguration using a graph theoretic representation of core wrappers is also presented. For the case of reconfigurable wrappers, efficient algorithms to compute the schedule are presented based upon some recent results in the field of malleable task scheduling. Cases in which the degree of reconfigurability are constrained are considered&semi; the case when only a single core can have reconfigurable wrapper, a schedule with zero TAM idle time can be found in time O(NC(NC + W)lgW), and the case when only 2 different wrapper configurations are allowed can be solved in time O(NC3). Comparison with existing results on benchmark SOCs show that our algorithms outperform state-of-art ILP formulations not only in schedule makespan, but also significantly reduce computation time.
Designing a Real-Time Coprocessor for Ada Tasking
Authors: Joachim Roos
Venue: IEEE Design Test (1991)

A VLSI coprocessor that radically improves the real-time performance of the Ada tasking model, especially the rendezvous, is discussed. An overview of multilevel design is given, and design levels and models are examined. A description is given of the design strategy, which entails stepwise refinement of functional models representing the coprocessor at more and more detailed levels. A chip was generated using the Genesil silicon compiler, but most of the design was defined and verified on the instruction-set-processor and register-transfer levels.
Frequency Response Verification of Analog Circuits Using Global Optimization Techniques
Authors: Suresh Seshadri, Jacob A. Abraham
Venue: Journal of Electronic Testing: Theory and Applications (2001)

This paper develops a new formal technique to verify the frequency response of analog circuits using global optimization techniques. Since simulation-based approaches are unable to cover the design space, there is a need for formal approaches to verify large circuits. Drawing parallels from the digital domain, the verification problem in the analog domain is modeled as a non-linear optimization problem and solved using global optimization techniques by ensuring that the implementation response is bounded within an envelope around the specification. We also address the problem of verifying frequency response under the influence of parameter variations. Direct as well as indirect techniques are illustrated using accurate frequency response models. Experimental results are presented to show the effectiveness of the proposed methodology.
Deciding Properties of Timed Transition Models
Authors: J. S. Ostroff
Venue: IEEE Transactions on Parallel and Distributed Systems (1990)

Real-time distributed systems are modeled by a times transition model (TTM). For any finite-state TTM, decision procedures are provided for checking a small but important class of properties (specified in real-time temporal logic). The procedures are linear in the size of the system reachability graph. The class of properties includes invariance, precedence, eventuality and real-time response specifications.
A two-level temporal logic for evolving specifications
Authors: P. Y. Schobbens, G. Saake, A. Sernadas, C. Sernadas
Venue: Information Processing Letters (2002)

Traditional information system specifications are fixed: the rules of the system are frozen at specification time. In practice, most systems have to change their rules in unexpected ways during their lifetime. We present here a simple variant of a temporal logic that deals with specification evolution. It is a linear time temporal logic with two levels of time: intervals, interrupted by mutations (changes of rules), which compose lives of the system. We present a complete axiom system and complexity results, which show a large compatibility with classical linear temporal logic.
A linear analytical boundary element method (BEM) for 2D homogeneous potential problems
Authors: Jürgen Friedrich
Venue: Computers Geosciences (2002)

The solution of potential problems is not only fundamental for geosciences, but also an essential part of related subjects like electro- and fluid-mechanics. In all fields, solution algorithms are needed that should be as accurate as possible, robust, simple to program, easy to use, fast and small in computer memory. An ideal technique to fulfill these criteria is the boundary element method (BEM) which applies Green's identities to transform volume integrals into boundary integrals. This work describes a linear analytical BEM for 2D homogeneous potential problems that is more robust and precise than numerical methods because it avoids numerical schemes and coordinate transformations. After deriving the solution algorithm, the introduced approach is tested against different benchmarks. Finally, the gained method was incorporated into an existing software program described before in this journal by the same author.
Towards Benchmarks for Knowledge Systems and Their Implications for Data Engineering
Authors: F. Hayes-Roth
Venue: IEEE Transactions on Knowledge and Data Engineering (1989)

The author suggests a new focus on benchmarks for knowledge systems, following the lines of similar benchmarks in other computing fields. It is noted that knowledge systems differ from conventional systems in a key way, namely their ability to interpret and apply knowledge. This gives rise to a distinction between intrinsic measures concerned with engineering qualities and extrinsic measures relating to task productivity, and both warrant improved measurement techniques. Primary concerns within the extrinsic realm include advice quality, reasoning correctness, robustness, and solution efficiency. Intrinsic concerns, on the other hand, center on elegance of knowledge base design, modularity, and architecture. The author suggests criteria for good measures and benchmarks, and ways to satisfy these through the design of knowledge and key knowledge engineering costs and performance parameters. It is suggest that the focus on measuring knowledge systems should help clarify the technical relationships between knowledge engineering and data engineering.
Fast analysis and optimization of power/ground networks
Authors: Haihua Su, Kaushik Gala, Sachin S. Sapatnekar
Venue: Proceedings of the 2000 IEEE/ACM international conference on Computer-aided design (2000)

This paper presents an efficient method for optimizing power/ground (P/G) networks. It proposes a structured skeleton that is intermediate to the conventional method that uses full meshes (which are hard to analyze efficiently), and tree-structured P/G networks (which provide poor performance). As an example, we consider a P/G network structure modeled as an overlying mesh with underlying trees originating from the mesh, which eases the task of analysis with acceptable performance sacrifices. A fast and efficient event-driven P/G network simulator is proposed, which hierarchically simulates the P/G network with an adaptation of PRIMA to handle non-zero initial conditions. An adjoint network that incorporates the variable topology of the original P/G network, as elements switch in and out of the network, is constructed to calculate the transient adjoint sensitivity over multiple intervals. These are used to drive a sensitivity-based heuristic optimization method. Experimental results show that this procedure can be used to efficiently optimize large networks.