ppxscal/embedding_network huggingface dataset:
The Effect of Object-Oriented Frameworks on Developer Productivity
Authors: Simon Moser, Oscar Nierstrasz
Venue: Computer (1996)

How much will it cost?" "How long will it take?" These questions are notoriously difficult to answer accurately and early in software development. Software metrics tackle this problem by assuming a statistical correlation between the size of a software project and the amount of effort typically required to realize it. To be useful in estimating cost, a size metric must take into account the inherent complexity of the system. Such metrics have been applied with varying degrees of success, but the nature of software development has been changing, and some of the assumptions behind the established cost-estimation techniques are slowly being invalidated. The System Meter (SM) is a new software sizing approach based on the notion of system description. System descriptions encompass all kinds of software artifacts, from requirement documents to final code. For each kind or level of artifacts, there is a corresponding flavor of SM. In our studies we used the first operational flavor, the SM at the preliminary analysis level, or Pre-SM. In contrast to the well-known Function Point (FP) metric, which is measurable after the more detailed but costly phase of domain analysis only, the SM explicitly takes OO concepts into account. It also distinguishes between components to be developed and those to be reused, thus reflecting the idea of incremental functionality. In this article we present results of a field study of 36 projects developed using object technology. We measured both FP and the Pre-SM method in all 36 projects and compared their correlation to the development effort.
Restoring a Legacy: Lessons Learned
Authors: Spencer Rugaber, Jim White
Venue: IEEE Software (1998)

Rebuilding a legacy system has some parallels to the restoration of a work of art. The authors draw upon this comparison to illustrate the challenges they faced in redesigning a telephony system. The restoration involved far more than updating the codeýthe development team also had to understand the existing architecture, add new functionality, and develop a long-term hardware migration plan. The technical and managerial lessons learned should prove valuable to those involved in similar projects.
Designs in Product Association Schemes
Authors: William J. Martin
Venue: Designs, Codes and Cryptography (1999)

A number of important families of association schemes&mdash;such as the Hamming and Johnson schemes&mdash;enjoy the property that, in each member of the family, Delsarte t-designs can be characterised combinatorially as designs in a certain partially ordered set attached to the scheme. In this paper, we extend this characterisation to designs in a product association scheme each of whose components admits a characterisation of the above type. As a consequence of our main result, we immediately obtain linear programming bounds for a wide variety of combinatorial objects as well as bounds on the size and degree of such designs analogous to Delsarte&lsquo;s bounds for t-designs in Q-polynomial association schemes.
Vision Assistance in Scenes with Extreme Contrast
Authors: Ulrich Seger, Heinz-Gerd Graf, Marc E. Landgraf
Venue: IEEE Micro (1993)

The performance and architecture of a high dynamic range camera (HDRC) chip and the conceptional advantages for its adaptation to image processing systems in traffic environments are discussed. The HDRC chip was developed with 64*64 pixels using a standard digital 1.2- mu m CMOS technology. It is shown that the implementation proves the functionality and indicates the system performance of a highly dynamic range camera is feasible.
Testing Mixed-Signal Cores: A Practical Oscillation-Based Test in an Analog Macrocell
Authors: Gloria Huertas, Diego Vázquez, Eduardo J.Peralías, Adoración Rueda, José Luis Huertas
Venue: IEEE Design Test (2002)

A formal set of design decisions can aid in using oscillation-based test for analog subsystems in SoCs. The goal is to offer designers testing options that don't have significant area overhead, performance degradation, or test time.
Coordination Algorithm for Distributed Testing
Authors: Omar Rafiq, Leo Cacciari
Venue: The Journal of Supercomputing (2003)

With the emergence of new models, architectures and middleware such as ODP, TINA and CORBA, for developing open distributed systems, testing technology requires adaptation for use within conformance assessment in such systems. All these frameworks are object-based and aim at creating open distributed environments supporting interworking, interoperability, and portability, in spite of heterogeneity and autonomy of the related systems. In this context, an open distributed system may be viewed as a system providing standardized distributed interfaces for interacting with other systems. Conformance of such a system can be assessed by attaching a related tester at each provided interface. However, many problems of controllability and observability influencing fault detection during the testing process, arise if there is no coordination between the testers. In this paper, we show how to cope with these problems by using test coordination procedures in a distributed testing architecture.
Products and polymorphic subtypes
Authors: Viviana Bono, Jerzy Tiuryn
Venue: Fundamenta Informaticae (2002)

This paper is devoted to a comprehensive study of polymorphic subtypes with products. We first present a sound and complete Hilbert style axiomatization of the relation of being a subtype in presence of →, x type constructors and the ∀ quantifier, and we show that such axiomatization is not encodable in the system with →, ∀ only. In order to give a logical semantics to such a subtyping relation, we propose a new form of a sequent which plays a key role in a natural deduction and a Gentzen style calculi. Interestingly enough, the sequent must have the form E ⊢ T, where E is a non-commutative, non-empty sequence of typing assumptions and T is a finite binary tree of typing judgements, each of them behaving like a pushdown store. We study basic metamathematical properties of the two logical systems, such as subject reduction and cut elimination. Some decidability/undecidability issues related to the presented subtyping relation are also explored: as expected, the subtyping over →, x, ∀ is undecidable, being already undecidable for the →, ∀ fragment (as proved in [15]), but for the x, ∀ fragment it turns out to be decidable.
Trends in Cooperative Distributed Problem Solving
Authors: E. H. Durfee, V. R. Lesser, D. D. Corkill
Venue: IEEE Transactions on Knowledge and Data Engineering (1989)

The authors present an overview of cooperative distributed problem solving (CDPS), an emerging research area that combines aspects of AI (artificial intelligence) and distributed processing. CDPS can be used to study how a loosely coupled network of sophisticated problem-solving nodes can solve a complex problem which consists of a set of interdependent subproblems. Subproblems arise because of spatial, temporal, and functional distribution of data, knowledge, and processing capabilities. Application areas include distributed interpretation, distributed planning and control, cooperating expert systems, and computer-supported human cooperation. The authors survey the important approaches and empirical investigations that have been developed. The approaches covered include negotiation, functionally accurate cooperation, organizational structuring, multiagent planning, sophisticated local control, and theoretical frameworks.
UST/DME: a clock tree router for general skew constraints
Authors: Chung-Wen Albert Tsao, Cheng-Kok Koh
Venue: Proceedings of the 2000 IEEE/ACM international conference on Computer-aided design (2000)

In this paper, we propose new approaches for solving the useful-skew tree (UST) routing problem [17]: Clock routing subject to general skew constraints. The clock layout synthesis engine of our UST algorithms is based on the deferred-merge embedding (DME) paradigm for zero-skew tree [5; 1] and bounded-skew tree [8; 2] routings; hence, the names UST/DME and Greedy-UST/DME for our algorithms. They simultaneously perform skew scheduling and tree routing such that each local skew range is incrementally refined to a skew value that minimizes the wirelength during the bottom-up merging phase of DME. The resulting skew schedule is not only feasible, but is also best for routing in terms of wirelength. The experimental results show very encouraging improvement over the previous BST/DME algorithm on three ISCAS89 benchmarks under general skew constraints in terms of total wirelength.
A 20 Bit Logarithmic Number System Processor
Authors: F. J. Taylor, R. Gill, J. Joseph, J. Radke
Venue: IEEE Transactions on Computers (1988)

The architecture and performance of a 20-bit arithmetic processor based on the logarithmic number system (LNS) is described. The processor performed LNS multiplication and division rapidly and with a low hardware complexity. Addition and subtraction in the LNS require the support of a table lookup unit. A scheme is proposed to minimize this complexity using a partitioned memory (ROM) and a PLA (programmable logic array). For performance evaluation, the target technology is integrated Schottky logic. The processor is shown to compare well with, if not to outperform, existing floating point (FLP) processors of equivalent range and precision. The speed-power-product ratio of an equivalent FLP processor, compared with that of the LNS processor, is reported to be 20 to 1 in the case of the square and square-root operation and 1 to 1 in the case of addition and subtraction. For multiplication and division, this ratio is about 5 to 1.
A Note on the Approximation of a Minimum-Weight Maximal Independent Set
Authors: Marc Demange
Venue: Computational Optimization and Applications (1999)

We consider the polynomial approximation behavior of the problem of finding, in a graph with weighted vertices, a maximal independent set minimizing the sum of the weights. In the spirit of a work of Halld&oacute;rson dealing with the unweighted case, we extend it and perform approximation hardness results by using a reduction from the minimum coloring problem. In particular, a consequence of our main result is that there does not exist any polynomial time algorithm approximating this problem within a ratio independent of the weights, unless P &equals; NP. We bring also to the fore a very simple ratio &rho; guaranteed by every algorithm while no polynomial time algorithm can guarantee the ratio (1 &minus; &epsi;)&rho;. The known hardness results for the unweighted case can be deduced. We finally discuss approximation results for both weighted and unweighted cases: we perform an approximation ratio that is valid for any algorithm for the former and propose an analysis of a greedy algorithm for the latter.
Secure Databases: Constraints, Inference Channels, and Monitoring Disclosures
Authors: Alexander Brodsky, Csilla Farkas, Sushil Jajodia
Venue: IEEE Transactions on Knowledge and Data Engineering (2000)

This paper investigates the problem of inference channels that occur when database constraints are combined with nonsensitive data to obtain sensitive information. We present an integrated security mechanism, called the Disclosure Monitor, which guarantees data confidentiality by extending the standard mandatory access control mechanism with a Disclosure Inference Engine. The Disclosure Inference Engine generates all the information that can be disclosed to a user based on the user's past and present queries and the database and metadata constraints. The Disclosure Inference Engine operates in two modes: data-dependent mode, when disclosure is established based on the actual data items, and data-independent mode, when only queries are utilized to generate the disclosed information. The disclosure inference algorithms for both modes are characterized by the properties of soundness (i.e., everything that is generated by the algorithm is disclosed) and completeness (i.e., everything that can be disclosed is produced by the algorithm). The technical core of this paper concentrates on the development of sound and complete algorithms for both data-dependent and data-independent disclosures.
On Morse Theory for Piecewise Smooth Functions
Authors: A. A. Agrachev, D. Pallaschke, S. Scholtes
Venue: Journal of Dynamical and Control Systems (1997)

Lower level sets of continuous selections of C2-functions defined on a smooth manifold in the vicinity of a nondegenerate critical point in the sense of &lsqb;11&rsqb; are studied. It is shown that the lower level set is homotopy equivalent to the join of the lower level sets of the smooth and the nonsmooth part, respectively, of the corresponding normal form. Some generalized Morse inequalities are deduced from this result.
On the Granularity and Clustering of Directed Acyclic Task Graphs
Authors: A. Gerasoulis, T. Yang
Venue: IEEE Transactions on Parallel and Distributed Systems (1993)

The authors consider the impact of the granularity on scheduling task graphs. Schedulingconsists of two parts, the processors assignment of tasks, also called clustering, and theordering of tasks for execution in each processor. The authors introduce two types of clusterings: nonlinear and linear clusterings. A clustering is nonlinear if two parallel tasksare mapped in the same cluster otherwise it is linear. Linear clustering fully exploits thenatural parallelism of a given directed acyclic task graph (DAG) while nonlinear clustering sequentializes independent tasks to reduce parallelism. The authors also introduce a new quantification of the granularity of a DAG and define a coarse grain DAG as the one whose granularity is greater than one. It is proved that every nonlinear clustering of a coarse grain DAG can be transformed into a linear clustering that has less or equal parallel time than the nonlinear one. This result is used to prove the optimality of some important linear clusterings used in parallel numerical computing.
KMDS: An Expert System for Integrated Hardware/Software Design of Microprocessor-Based Digital Systems
Authors: Yau-Hwang Kuo, Ling-Yang Kung, Ching-Chung Tzeng, Guang-Huei Jeng, Wei-Kuo Chia
Venue: IEEE Micro (1991)

A design automation system called KMDS, which makes use of a knowledge-based expert system and external algorithmic procedures to realize a modularized and flexible design automation tool, is presented. Its system configuration and characteristics, knowledge base and device libraries, top-down design methodology, and external utilities are described. Besides aiding the design of single-board microcomputers, KMDS helps designers of intelligence interface cards such as color display adapters and printer server cards. KMDS is flexible enough to incorporate various types of knowledge into the system and to overcome the problems that result from the existence of a large number of candidate solutions under a very high-level design specification. KMDS automatically generates a control program, making the fully automatic design of digital systems possible.
On-demand geo-referenced terrafly data miner
Authors: Naphtali Rishe, Maxim Chekmasov, Marina Chekmasova, Scott Graham, Ian De Felipe
Venue: Proceedings of the 8th international conference on Intelligent user interfaces (2003)

We present a comprehensive Internet data extraction tool adopted for the TerraFly Geographic Information System (GIS). TerraFly is a web-enabled system that allows users to virtually fly over remotely sensed data, including satellite imagery and aerial photography, using a standard Internet browser. The data extraction tool presented here is designed to augment the user's virtual flight experience with extensive data relevant to any given geographical point along the virtual flight path. The data presented to the user is retrieved from several server-side databases and is collected from the Internet data providers using our patented data extraction technology. Some data elements are presented to the user as overlays, some in popup windows, and some via hyper-linking to third-party web sites
Growth, evolution, and structural change in open source software
Authors: Michael Godfrey, Qiang Tu
Venue: Proceedings of the 4th International Workshop on Principles of Software Evolution (2001)

Our recent work has addressed how and why software systems evolve over time, with a particular emphasis on software architecture and open source software systems [2, 3, 6]. In this position paper, we present a short summary of two recent projects.First, we have performed a case study on the evolution of the Linux kernel [3], as well as some other open source software (OSS) systems. We have found that several OSS systems appear not to obey some of "Lehman's laws" of software evolution [5, 7], and that Linux in particular is continuing to grow at a geometric rate. Currently, we are working on a detailed study of the evolution of one of the subsystems of the Linux kernel: the SCSI drivers subsystem. We have found that cloning, which is usually considered to be an indicator of lazy development and poor process, is quite common and is even considered to be a useful practice.Second, we are developing a tool called Beagle to aid software maintainers in understanding how large systems have changed over time. Beagle integrates data from various static analysis and metrics tools and provides a query engine as well as navigable visualizations. Of particular note, Beagle aims to provide help in modelling long term evolution of systems that have undergone architectural and structural change.
Query Optimization and Execution Plan Generation in Object-Oriented Data Management Systems
Authors: Dave D. Straube, M. Tamer Özsu
Venue: IEEE Transactions on Knowledge and Data Engineering (1995)

The generation of execution plans for object-oriented database queries is a new and challenging area of study. Unlike the relational algebra, a common set of object algebra operators has not been defined. Similarly, a standardized object manager interface analogous to storage manager interfaces of relational subsystems does not exist. We define the interface to an object manager whose operations are the executable elements of query execution plans. Parameters to the object manager interface are streams of tuples of object identifiers. The object manager can apply methods and simple predicates to the objects identified in a tuple. Two algorithms for generating such execution plans for queries expressed in an object algebra are presented. The first algorithm runs quickly but may produce inefficient plans. The second algorithm enumerates all possible execution plans and presents them in an efficient, compact representation.
Sparse Two-Scale FEM for Homogenization Problems
Authors: A. -M. Matache
Venue: Journal of Scientific Computing (2002)

We analyze two-scale Finite Element Methods for the numerical solution of elliptic homogenization problems with coefficients oscillating at a small length scale &epsiv;&Lt;1. Based on a refined two-scale regularity on the solutions, two-scale tensor product FE spaces are introduced and error estimates which are robust (i.e., independent of &epsiv;) are given. We show that under additional two-scale regularity assumptions on the solution, resolution of the fine scale is possible with substantially fewer degrees of freedom and the two-scale full tensor product spaces can be &ldquo;thinned out&rdquo; by means of sparse interpolation preserving at the same time the error estimates.
Transition to a Legacy and Reuse-Based Software Life Cycle
Authors: Judith D. Ahrens, Noah S. Prywes
Venue: Computer (1995)

High costs and long backlogs in software development and maintenance often constrict an organization's ability to compete. Proposed solutions frequently include organizational changes and methodologies for systematic software reuse. The approach described in this article integrates the reengineering of legacy software and the reuse-based production of new software applications. In addition, the authors propose methodologies and enabling technologies for transitioning from current practices. The main innovation lies in the role and impact of reengineering legacy software in the proposed software life cycle. The top-down comprehensive methodologies advocated to date for transitioning from the prevailing software development and maintenance modes to the software reuse mode have proven to be costly and risky, with long-delayed payback periods for recovering the initial investment. However, the integration of legacy software reengineering in a reuse-based software life cycle, supported by enabling computer-aided-software-engineering environments, accelerates and economizes on the transitional processes and their ongoing operation. The authors illustrate this approach from their experience with integrating existing automatic software engineering/reengineering environments. The cost of developing software for even a few applications using a conventional methodology should approximately equal the cost of developing the domain reuse components from legacy software and generating the applications from them. The payoff comes in the declining incremental costs of engineering new applications from reusable components.
A Discovery-Based Approach to Database Ontology Design
Authors: Silvana Castano, Valeria De Antonellis
Venue: Distributed and Parallel Databases (1999)

In this paper, we introduce an approach to task-driven ontology design which is based on information discovery from database schemas. Techniques for semi-automatically discovering terms and relationships used in the information space, denoting concepts, their properties and links are proposed, which are applied in two stages. At the first stage, the focus is on the discovery of heterogeneity/ambiguity of data representations in different schemas. For this purpose, schema elements are compared according to defined comparison features and similarity coefficients are evaluated. This stage produces a set of candidates for unification into ontology concepts. At the second stage, decisions are made on which candidates to unify into concepts and on how to relate concepts by semantic links. Ontology concepts and links can be accessed according to different perspectives, so that the ontology can serve different purposes, such as, providing a search space for powerful mechanisms for concept location, setting a basis for query formulation and processing, and establishing a reference for recognizing terminological relationships between elements in different schemas.
On the Genus of Star Graphs
Authors: D. A. Hoelzeman, S. Bettayeb
Venue: IEEE Transactions on Computers (1994)

The star graph has recently been suggested as an alternative to the hypercube. The star graph has a rich structure and symmetry properties as well as desirable fault-tolerant characteristics. The star graph's maximum vertex degree and diameter, viewed as functions of network size, grow less rapidly than the corresponding measures in a hypercube. We investigate the genus of the star graph and compare it with the genus of the hypercube.
A Generalization of Jumps and Labels
Authors: Peter J. Landin
Venue: Higher-Order and Symbolic Computation (1998)

This paper describes a new language feature that is a hybrid of labels and procedures. It is closely related to jumping out of a functional subroutine, and includes conventional labels and jumping as a special, but probably not most useful, case. It is independent of assignment, ie., it can be added to a &ldquo;purely-functional&rdquo; (&ldquo;non-imperative&rdquo;) system (such as LISP without pseudo-functions or program feature). Experiments in purely functional programming suggest that its main use will be in success/failure situations, and failure actions. This innovation is incorporated in the projected experimental system, ISWIM.