ppxscal/embedding_network huggingface dataset:
KILS: A Prototypical Expert System for Assessing Technologies
Authors: Hamid Noori
Venue: IEEE Expert: Intelligent Systems and Their Applications (1990)

A prototypical knowledge-based system that uses different identification techniques to assess the impact of new technologies is presented. Technology assessment and impact identification analysis are described in the context of environmental impact assessment (EIA), and the characteristics of ten components of EIA are discussed. A knowledge-based prototype that provides a decision framework for impact identification is described, impact identification techniques are examined, and a schematic view of the prototypical system is presented. The results of an experiment to evaluate system strengths are outlined, and the system's implementation is illustrated with a simple example.
An Object Algebra Approach to Multidatabase Query Decomposition in Donaj&iacute;
Authors: Juan C. Lavariega, Susan D. Urban
Venue: Distributed and Parallel Databases (2002)

This paper presents an approach to query decomposition in a multidatabase environment. The unique aspect of this approach is that it is based on performing transformations over an object algebra that can be used as the basis for a global query language. In the paper, we first present our multidatabase environment and semantic framework, where a global conceptual schema based on the Object Data Management Group standard encompasses the information from heterogeneous data sources that include relational databases as well as object-oriented databases and flat file sources. The meta-data about the global schema is enhanced with information about virtual classes as well as virtual relationships and inheritance hierarchies that exist between multiple sources. The AQUA object algebra is used as the formal foundation for manipulation of the query expression over the multidatabase. AQUA is enhanced with distribution operators for dealing with data distribution issues. During query decomposition we perform an extensive analysis of traversals for path expressions that involve virtual relationships and hierarchies for access to several heterogeneous sources. The distribution operators defined in algebraic terms enhance the global algebra expression with semantic information about the structure, distribution, and localization of the data sources relevant to the solution of the query. By using an object algebra as the basis for query processing, we are able to define algebraic transformations and exploit rewriting techniques during the decomposition phase. Our use of an object algebra also provides a formal and uniform representation for dealing with an object-oriented approach to multidatabase query processing. As part of our query processing discussion, we include an overview of a global object identification approach for relating semantically equivalent objects from diverse data sources, illustrating how knowledge about global object identity is used in the decomposition and assembly processes.
Design Patterns in Object-Oriented Frameworks
Authors: Savitha Srinivasan
Venue: Computer (1999)

Developing interactive software systems with complex user interfaces has become increasingly common. Given this trend, it is important that new technology be based on flexible architectures that do not require developers to understand all the complexities inherent in a system. Object-oriented frameworks provide an important enabling technology for reusing both the architecture and the functionality of software components. But frameworks typically have a steep learning curve since the user must understand the abstract design of the underlying framework as well as the object collaboration rules or contracts which are often not apparent in the framework interface prior to using the framework. In this article, the author describes her experience with developing an object-oriented framework for speech recognition applications that use IBM's ViaVoice speech recognition technology. Design patterns help to effectively communicate the internal framework design and reduce dependence on the documentation.
An Invitation to Formal Methods
Authors: Hossein Saiedian
Venue: Computer (1996)

One of the most challenging tasks in software system design is to assure reliability, especially as these systems are increasingly used in sensitive and often life-critical environments such as medical systems, air traffic control, and space applications. Many claim that formal methods not only provide assurance of reliability but also have the potential to reduce costs. Although the literature contains many excellent examples of applications of formal methods for large, critical, or even business transaction systems, a large percentage of practitioners see formal methods as irrelevant to their daily work. Why? This roundtable brings together some preeminent experts in the field, asking them to address the question "What is hindering the use of formal methods in industry?"
Symmetric Functions Applied to Decomposing Solution Sets of Polynomial Systems
Authors: Andrew J. Sommese, Jan Verschelde, Charles W. Wampler
Venue: SIAM Journal on Numerical Analysis (2002)

Many polynomial systems have solution sets comprised of multiple irreducible components, possibly of different dimensions. A fundamental problem of numerical algebraic geometry is to decompose such a solution set, using floating-point numerical processes, into its components. Prior work has shown how to generate sets of generic points guaranteed to include points from every component. Furthermore, we have shown how monodromy can be used to efficiently predict the partition of these points by membership in the components. However, confirmation of this prediction required an expensive procedure of sampling each component to find an interpolating polynomial that vanishes on it. This paper proves theoretically and demonstrates in practice that linear traces suffice for this verification step, which gives great improvement in both computational speed and numerical stability. Moreover, in the case that one may still wish to compute an interpolating polynomial, we show how to do so more efficiently by building a structured grid of samples, using divided differences, and applying symmetric functions. Several test problems illustrate the effectiveness of the new methods.
A Model for Evaluation and Administration of Security in Object-Oriented Databases
Authors: E. B. Fernandez, E. Gudes, H. Song
Venue: IEEE Transactions on Knowledge and Data Engineering (1994)

The integration of object-oriented programming concepts with databases is one of the most significant advances in the evolution of database systems. Many aspects of such a combination have been studied, but there are few models to provide security for this richly structured information. We develop an authorization model for object-oriented databases. This model consists of a set of policies, a structure for authorization rules, and algorithms to evaluate access requests against the authorization rules. User access policies are based on the concept of inherited authorization applied along the class structure hierarchy. We propose also a set of administrative policies that allow the control of user access and its decentralization. Finally, we study the effect of class structuring changes on authorization.
Estimating Internet Users' Demand Characteristics
Authors: Alok Gupta, Boris Jukic, Mingzhi Li, Dale O. Stahl, Andrew B. Whinston
Venue: Computational Economics (2001)

We investigate two parametric approaches and one non-parametric approach to estimating Internet users' value-of-time, an important characteristic of demand for Internet services. The advantages of these approaches are made clear and their limitations discussed. The models are tested with data generated from our similation model of the Internet economy. Given the characteristics of the data, we investigate parametric count-data models first. While reasonably good results are obtained on all medium- and large-sized jobs, the method fails on small-sized ones. Second, we develop a nonparametric quasi-Bayesian update algorithm for retrieving the underlying distribution function of Internet users' value-of-time purely from observations on their choices. Compared with the parametric count-data models, good results are obtained in every case.
What Makes Measuring Software So Hard?
Authors: Stan Rifkin
Venue: IEEE Software (2001)

Implementing software measurement is difficult if it fails to align with an organization's market strategy. Using Michael Treacy and Fred Wiersema's The Discipline of Market Leaders as a guide, the author shows how traditional software measurement, like traditional software process improvement, is misaligned with two of the three basic strategies-customer intimacy and product innovativeness. Measurement initiatives can succeed if you understand your organization's strategic objectives and then tailor your measurement practices to fit.
Digital Signal Processor Trends
Authors: Gene Frantz
Venue: IEEE Micro (2000)

During the past decade, digital signal processors (DSPs) have hit critical mass for high-volume applications. Today, the entire digital wireless industry operates with DSP-enabled handsets and base stations. The mass storage industry depends on DSPs to produce hard disk drives and digital versatile disc (DVD) players. Ever-increasing numbers of digital subscriber line (DSL) and cable modems, line cards, and other wired telecommunications equipments are based on DSPs. Digital still cameras, hearing aids, motor control, consumer audio gear such as Internet audio are just some of the many mass market applications in which DSPs are routinely found today, along with more specialized applications such as image processing, medical instrumentation, navigation, and guidance.
Keeping Up with the Changing Web
Authors: Brian E. Brewington, George Cybenko
Venue: Computer (2000)

Because information depreciates over time, keeping Web pages current presents new design challenges. This article quantifies what "current" means for Web search engines and estimates how often they must reindex the Web to keep current with its changing pages and structure.Most information--from a newspaper story to a temperature sensor measurement to a Web page--is dynamic. When monitoring an information source, when do our previous observations become stale and need refreshing? How can we schedule these refresh operations to satisfy a required level of currency without violating resource constraints--such as band-width or computing limitations on how much data can be observed in a given time?The authors investigate the trade-offs involved in monitoring dynamic information sources and discuss the Web in detail, estimating how fast documents change and exploring what constitutes a "current" Web index. For a simple class of Web-monitoring systems--search engines--they combine their idea of currency with actual measured data to estimate revisit rates.
Instrumentation database system for performance analysis of parallel scientific applications
Authors: Jeffrey Nesheiwat, Boleslaw K. Szymanski
Venue: Parallel Computing (2002)

The complexity and computational intensity of scientific computing has fueled research on parallel computing and performance analysis. The purpose of this paper is to present a novel approach to performance analysis of large parallel programs. At the core of this approach is an instrumentation database (IDB) that enables comparative analysis of parallel code performance across architectures and algorithms.The basis of the IDB approach is scalable collection of performance data so that problem size and run-time environments do not affect the amount of information collected. This is achieved by uncoupling performance data collection from the underlying architecture and associating it with the control flow graph of the program. An important contribution of the IDB approach is the use of database technology to map program structure onto relational schema that represents the control flow hierarchy, its corresponding statistical data, and static information that describes the execution environment.To demonstrate the benefits of the proposed approach, we have implemented a POSIX compliant probe library, automated instrumentation tool, front-end visualization programs, database schema using an object-relational DBMS (PostgreSQL), and SQL queries. We also developed a methodology, based on these tools, for interactive performance analysis and demonstrated this methodology on several different parallel scientific applications.
Data Cache and Direct Memory Access in Programming Mediaprocessors
Authors: Donglok Kim, Ravi Managuli, Yongmin Kim
Venue: IEEE Micro (2001)

Mediaprocessors provide high performance by using both instruction- and data-level parallelism. Because of the increased computing power, transferring data between off- and on-chip memories without slowing down the core processor's performance is challenging. Two methods, data cache and direct memory access, address this problem in different ways.
Automatic Generation of Self-Scheduling Programs
Authors: I. Foster
Venue: IEEE Transactions on Parallel and Distributed Systems (1991)

Techniques are described for the automatic generation of self-scheduling parallelprograms. Both scheduling algorithms and the concurrent components of applications areexpressed in a high-level concurrent language. Partitioning and data dependencyinformation are expressed by simple control statements, which may be generated eitherautomatically or manually. A self-scheduling compiler, implemented as a source-to-source transformation, takes application code, control statements, and scheduling routines and generates a new program that can schedule its own execution on a parallel computer. The approach has several advantages compared to previous proposals. It generatesprograms that are portable over a wide range of parallel computers. There is no need toembed special control structures in application programs. The use of a high-levellanguage to express applications and scheduling algorithms facilitates the development,modification, and reuse of parallel programs.
Retractions of split graphs and end-orthodox split graphs
Authors: Suohai Fan
Venue: Discrete Mathematics (2002)

A retraction f of a graph G is an edge-preserving mapping of G with f(υ) = υ for all υ ∈ V(H), where H is the subgraph induced by the range of f. A graph G is called End-orthodox (End-regular) if its endomorphism monoid End X is orthodox (regular) in the semigroup sense. It is known that a graph is End-orthodox if it is End-regular and the composition of any two retractions is also a retraction. The retractions of split graphs are given and End-orthodox split graphs are characterized.
How ISO 9001 Compares With The CMM
Authors: Mark C. Paulk
Venue: IEEE Software (1995)

The Capability Maturity Model for Software (CMM), developed by the Software Engineering Institute, and the ISO 9000 series of standards, developed by the International Standards Organization, share a common concern with quality and process management. The two are driven by similar concerns and intuitively correlated. The purpose of this report is to contrast the CMM and ISO 9001, showing both their differences and their similarities. The results of the analysis indicate that, although an ISO 9001- compliant organization would not necessarily satisfy all of the level 2 key process areas, it would satisfy most of the level 2 goals and many of the level 3 goals. Because there are practices in the CMM that are not addressed in ISO 9000, it is possible for a level 1 organization to receive ISO 9001 registration; similarly, there are areas addressed by ISO 9001 that are not addressed in the CMM.
A combinatorial approach to correlation inequalities
Authors: Graham R. Brightwell, William T. Trotter
Venue: Discrete Mathematics (2002)

In this paper, we initiate a combinatorial approach to proving correlation inequalities for finite partially ordered sets. A new proof is provided for the strong form of the XYZ theorem, due to Fishburn. We also use our method to give a new proof of a related correlation result of Shepp involving two sets of relations. Our arguments are entirely combinatorial in the sense that they do not make use of the Ahlswede/Daykin theorem or any of its relatives.
Using Genetic Algorithms to Design Mesh Networks
Authors: King-Tim Ko, Kit-Sang Tang, Cheung-Yau Chan, Kim-Fung Man, Sam Kwong
Venue: Computer (1997)

Designing mesh communication networks is a complex, multiconstraint optimization problem. The design of a network connecting 10 Chinese cities demonstrates the elegance and simplicity that genetic algorithms offer in handling such problems. Designs for mesh communication networks must meet conflicting, interdependent requirements. This sets the stage for a complex problem with a solution that targets optimal topological connections, routing, and link capacity assignments. These assignments must minimize cost while satisfying traffic requirements and keeping network delays within permissible values. Since such a problem is NP-complete (one which has a solution in polynomial time, but can only be solved by nondeterministic algorithms), we must use heuristic techniques to handle the complexity and solve practical problems with a modest number of nodes. The heuristic methods used to design mesh networks include branch exchange, cut saturation, and Mentor algorithms. Another heuristic technique, genetic algorithms,1,2 appear ideal to design mesh networks with capability of handling discrete values, multiobjective functions, and multiconstraint problems.3 Existing applications of genetic algorithms to this problem,4-6 however, have only optimized the network topology. They ignore the difficult subproblems of routing and capacity assignment, a crucial determiner of network quality and cost. We present a total solution to mesh network design using a genetic algorithm approach. Not only does our method optimize network topology, it also optimizes routing and capacity assignment. In the following design for a proposed communications network, genetic algorithms produced a solution that costs 9 percent less and has two-thirds the delay of a typical design method. In our method, each optimization level uses genetic algorithms as its core, a similarity that reduces the complexity of system design. The advantages of this approach are not only its elegance and algorithmic simplicity, but also its ability to handle complicated issues such as continuous and discrete link capacities, linear or discrete cost structures, additional constraints, and various constraint models. We believe our genetic-algorithm approach to network design is novel and better than existing methods. Our 10-city network demonstrates that this method can be used for networks of reasonable size with realistic topology and traffic requirement.
IBM's ES/9000 Model 982's Fault-Tolerant Design for Consolidation
Authors: Lisa Spainhower, Thomas A. Gregg, Ram Chillarege
Venue: IEEE Micro (1994)

Consolidated work loads running around the clock means that today's large, general-purpose computers must meet high availability demands. To meet these demands, it is argued that the Model 982 provides fault tolerance by combining enhanced circuit-level error detection and failure isolation techniques with system-level techniques exploiting inherent redundancy.
Fast Iterative Methods for Sinc Systems
Authors: Michael K. Ng, Daniel Potts
Venue: SIAM Journal on Matrix Analysis and Applications (2002)

We consider linear systems of equations arising from the sinc method of boundary value problems which are typically nonsymmetric and dense. For the solutions of these systems we propose Krylov subspace methods with banded preconditioners. We prove that our preconditioners are invertible and discuss the convergence behavior of the conjugate gradient method for normal equations (CGNE). In particular, we show that the solution of an n-by-n discrete sinc system arising from the model problem can be obtained in ${\cal O} (n log2 n) operations by using the preconditioned CGNE method. Numerical results are given to illustrate the effectiveness of our fast iterative solvers.
AtelierM: a physically based interactive system for creating traditional marbling textures
Authors: Xiaoyang Mao, Toshikazu Suzuki, Atsumi Imamiya
Venue: Proceedings of the 1st international conference on Computer graphics and interactive techniques in Australasia and South East Asia (2003)

Marbling is a traditional art and printing technique loved by people all over the world for centuries. This paper presents AtelierM as a new interactive computer system for creating traditional marbling textures. AterlierM is built on the physical model of the traditional marbling. The patterning process of marbling is modeled as a 2D computational fluid dynamic problem. Marbling designs are generated as the result of color advection in the 2D flow fields obtained by numerically solving the Navier-Stokes equations of the patterning process. AtelierM allows users to easily design their own virtual patterning tools and exploit the best designs interactively through trial and error.
Data-Parallel Programming on Multicomputers
Authors: Michael J. Quinn, Philip J. Hatcher
Venue: IEEE Software (1990)

The inadequacies of conventional parallel languages for programming multicomputers are identified. The C* language is briefly reviewed, and a compiler that translates C* programs into C programs suitable for compilation and execution on a hypercube multicomputer is presented. Results illustrating the efficiency of executing data-parallel programs on a hypercube multicomputer are reported. They show the speedup achieved by three hand-compiled C* programs executing on an N-Cube 3200 multicomputer. The first two programs, Mandelbrot set calculation and matrix multiplication, have a high degree of parallelism and a simple control structure. The C* compiler can generate relatively straightforward code with performance comparable to hand-written C code. Results for a C* program that performs Gaussian elimination with partial pivoting are also presented and discussed.
Frequency Domain Analysis of Translations with Piecewise Cubic Trajectories
Authors: G. Cortelazzo, M. Balanza
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1993)

Translations with piecewise cubic trajectories are studied in the frequency domain. This class of motion has as an important subcase: cubic spline trajectories. Translations with trajectories depending on time with general polynomial law are preliminarily considered, and a general theorem concerning this type of motion is introduced. The application of this theorem to the case of cubic time dependence and the consideration of finite-duration effects lead to the solution of the piecewise cubic trajectory case. The results, which are remarkably different from those concerning constant velocity translations, clearly indicate the importance of the role of velocity and time duration. In this respect, they confirm the validity of constant velocity motion as a first-order model for frequency domain analysis of motion.
A Syntactic Approach to Scale-Space-Based Corner Description
Authors: C. Fermüller, W. Kropatsch
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1994)

Planar curves are described by information about corners integrated over various levels of resolution. The detection of corners takes place on a digital representation. To compensate for ambiguities arising from sampling problems due to the discreteness, results about the local behavior of curvature extrema in continuous scale-space are employed.