ppxscal/embedding_network huggingface dataset:
Programmable Networks: Selected Challenges in Computer Networking
Authors: Jonathan M. Smith
Venue: Computer (1999)

The convergence of computing and networking is nowhere more evident than in the phenomenal growth of the World Wide Web. In another sense, though, computer networking is being pulled in two opposite directions. On the one hand, the Web's popularity and growth has been fueled largely by desk-top applications consuming bandwidth-intensive images and video. On the other hand, thin-client computers are becoming more commonly used as edge-of-network devices, often connected by wireless technology. There is also an increasing mismatch between fiber-optic transmission bandwidths and computer speeds, pushing computing further away from the network core. Are there ways to close, or at least manage, this growing schism-whether through novel hardware solutions or the programmability of network infrastructures? Can we better integrate these edge-of- network devices and make them full-fledged network participants? High-speed optical networks mix many types of traffic and services, so only features needed by all aggregated services will be cost-effective to place there. They are unlikely to employ software and computing except in the so-called control plane, which manipulates the behavior of the transport system. Low-cost and low-powered thin clients need networks and software that allow plug and play and unplug: secure, mobile, sporadically detached operation. Introducing programmability into the network infrastructure (or exposing preexisting programmability to users) could meet these needs, and active networks are one model for programming net-works. Although what technologies will prevail is in question, networking and computing will continue to converge. Currently, this convergence is resulting in increased collaboration between the network infrastructure and the end hosts to meet application needs.
Expert System Security
Authors: Daniel E. O'Leary
Venue: IEEE Expert: Intelligent Systems and Their Applications (1990)

Computer risk exposures and security in general are reviewed, and factors suggesting that expert system security is a unique problem are examined. Security requirements associated with the unique characteristics of expert systems are investigated. They include technical aspects of knowledge (certainty factors, symbolic information and special fixes), structure (user interface, knowledge base, inference engine and database), design methodology (prototyping) and the current delivery environment (e.g., PCs and expert system shells). The security of working expert systems as discussed in the literature is examined. Rationales for the current apparent lack of expert system security are analyzed and the impact of possible security controls on expert system users and developers is assessed.
Flexible Robust Programming in Distributed Object Systems
Authors: Mustaque Ahamad, Muthusamy Chelliah
Venue: IEEE Transactions on Knowledge and Data Engineering (2002)

Distributed applications that access persistent objects must maintain object state consistency even when failures are encountered during the manipulation of such objects. The basic transaction model, which has been implemented by several systems to ensure consistent executions of distributed applications, is not flexible enough to meet the requirements of many complex distributed applications. This has also been recognized for advanced database applications and, as a result, extended transaction models have been developed. We argue that distributed applications that manipulate long-lived data can benefit from such transaction models. We take an approach which views the various transaction models as policies for building robust applications. Thus, we advocate that the system implement several transaction models. A robust application can be programmed in such a system using a combination of several transaction models to meet its consistency requirements. We use applications from the domain of computer-supported cooperative work to motivate such an approach. We also develop a set of system-level mechanisms which can be used to implement multiple transaction models in a uniform manner. These mechanisms are used to implement nested, split, and cooperating transaction models. A prototype system that has been implemented is described to demonstrate the feasibility of this approach.
COOL: An Object-Based Language for Parallel Programming
Authors: Rohit Chandra, Anoop Gupta, John L. Hennessy
Venue: Computer (1994)

Effectively using shared-memory multiprocessors requires substantial programming effort. We present the programming language COOL (Concurrent Object-Oriented Language), which was designed to exploit coarse-grained parallelism at the task level in shared-memory multiprocessors. COOL's primary design goals are efficiency and expressiveness. By efficiency we mean that the language constructs should be efficient to implement and a program should not have to pay for features it does not use. By expressiveness, we imply that the program should flexibly support different concurrency patterns, thereby allowing various decompositions of a problem. COOL emphasizes the integration of concurrency and synchronization with data abstraction to ease the task of creating modular and efficient parallel programs. It is an extension of C++, which was chosen because it supports abstract data type definitions and is widely used.
Complexity of homomorphisms to direct products of graphs
Authors: Judit Büki, Csaba Szabó
Venue: Information Processing Letters (2002)

For a graph G, OALG asks whether or not an input graph H together with a partial map g:S → G, S ⊆ V(H), admits a homomorphism f:H → G such that f|s = g. We show that for connected graphs G1, G2, OAL G1 × G2 is in P if G1 and G2 are trees and NP-complete otherwise.
Some Results on NQR Codes
Authors: M. C. Bhandari, M. K. Gupta, A. K. Lal
Venue: Designs, Codes and Cryptography (1999)

In [5] Tiu and Wallace have constructed a new class of linear codes called Norm Quadratic Residue code \C_p for p a prime of the form 4n+1 and determined some of its properties. It was shown that dim \C_p\leq p. He further conjectured that dim \C_p = p. In the present correspondence we show that similar construction works for primes of the form4n-1 . We further show that dim \C_p = p for any odd prime p and determine few elementary properties of these codes.
Document Processing for Automatic Knowledge Acquisition
Authors: Y. Y. Tang, C. D. Yan, C. Y. Suen
Venue: IEEE Transactions on Knowledge and Data Engineering (1994)

The knowledge acquisition bottleneck has become the major impediment to the development and application of effective information systems. To remove this bottleneck, new document processing techniques must be introduced to automatically acquire knowledge from various types of documents. By presenting a survey on the techniques and problems involved, this paper aims at serving as a catalyst to stimulate research in automatic knowledge acquisition through document processing. In this study, a document is considered to have two structures: geometric structure and logical structure. These play a key role in the process of the knowledge acquisition, which can be viewed as a process of acquiring the above structures. Extracting the geometric structure from a document refers to document analysis; mapping the geometric structure into logical structure is regarded as document understanding. Both areas are described in this paper, and the basic concept of document structure and its measurement based on entropy analysis is introduced. Logical structure and geometric models are proposed. Both top-down and bottom-up approaches and their entropy analyses are presented. Different techniques are discussed with practical examples. Mapping methods, such as tree transformation, document formatting knowledge and document format description language, are described.
Implementing Risk Management on Software Intensive Projects
Authors: Edmund H. Conrow, Patricia S. Shishido
Venue: IEEE Software (1997)

The authors provide experienced-based risk management guidelines from a highly successful distributed command-and-control project that uses several innovative risk management practices.
Will There Ever Be Software Engineering?
Authors: Michael Jackson
Venue: IEEE Software (1998)

In his opening essay, Ed Yourdon forecasts both a happy and an unhappy future. His bright future promises challenging projects, exciting technologies, innovative applications, giant salaries, and lucrative stock options. His gloomy future warns of US federal and state government departments unable to solve their Year 2000 problem, a business revolt against expensive and troublesome software that delivers no apparent economic benefits, and a consequent drying up of money to buy new releases of COTS software or to finance new software development. The good news and the bad news are essentially commercial. But the dark cloud of Yourdon's bad future offers a silver lining: if it comes to pass, there might be demands for certification and licensing of software professionals and for a formal approach to software development. In a word, we might be expected to become serious software engineers. We won't, of course. Yourdon is confident that we have learned a lot about soft-ware processes, methods, and techniques; he says that we have a vast body of knowledge in requirements, risk management, metrics, testing, and quality assurance incorporated into the SEI Capability Maturity Model. So that's all right, then. We don't really need software engineering in the narrow academic sense.
Unpredictable Certainty: The Internet and the Information Infrastructure
Authors: Marjory S. Blumenthal
Venue: Computer (1997)

The Internet's future will reflect its own evolution and its interaction with other elements of the information infrastructure. That interaction will hinge more on business factors than on technology. Although it is clear that the Internet will have substantial influence in the larger information infrastructure by the turn of the century, it is unclear how the Internet will realize that influence. Will the Internet continue to grow? Will the Internet's definition expand to include other internetworked entities? How will protocol changes transform the Internet from the inside out? The answers to these and other questions will determine the role the Internet will play.
FOCUS: An Experimental Environment for Fault Sensitivity Analysis
Authors: G. S. Choi, R. K. Iyer
Venue: IEEE Transactions on Computers (1992)

FOCUS, a simulation environment for conducting fault-sensitivity analysis of chip-level designs, is described. The environment can be used to evaluate alternative design tactics at an early design stage. A range of user specified faults is automatically injected at runtime, and their propagation to the chip I/O pins is measured through the gate and higher levels. A number of techniques for fault-sensitivity analysis are proposed and implemented in the FOCUS environment. These include transient impact assessment on latch, pin and functional errors, external pin error distribution due to in-chip transients, charge-level sensitivity analysis, and error propagation models to depict the dynamic behavior of latch errors. A case study of the impact of transient faults on microprocessor-based jet-engine controller is used to identify the critical fault propagation paths, the module most sensitive to fault propagation, and the module with the highest potential for causing external errors.
Facet Obtaining Procedures for Set Packing Problems
Authors: Lázaro Cánovas, Mercedes Landete, Alfredo Marín
Venue: SIAM Journal on Discrete Mathematics (2003)

New results concerning the facial structure of set packing polyhedra are presented. In particular, new methods are given to obtain facets from the subgraphs of the intersection graph associated with a set packing polyhedron that properly subsume several other methods in the literature. A new class of facet defining graphs, termed fans, is also introduced, as well as a procedure to link any graph to a certain claw K1,k in order to obtain a new graph and an associated facet.
Augmented Lagrangians with Adaptive Precision Control forQuadratic Programming with Equality Constraints
Authors: Z. Dostál, A. Friedlander, S. A. Santos
Venue: Computational Optimization and Applications (1999)

In this paper we introduce an augmented Lagrangian type algorithm for strictly convex quadratic programming problems with equality constraints. The new feature of the proposed algorithm is the adaptive precision control of the solution of auxiliary problems in the inner loop of the basic algorithm. Global convergence and boundedness of the penalty parameter are proved and an error estimate is given that does not have any term that accounts for the inexact solution of the auxiliary problems. Numerical experiments illustrate efficiency of the algorithm presented
Capturing Knowledge Through Top-Down Induction of Decision Trees
Authors: N. A. B. Gray
Venue: IEEE Expert: Intelligent Systems and Their Applications (1990)

TDIDT (top-down induction of decision trees) methods for heuristic rule generation lead to unnecessarily complex representations of induced knowledge and are overly sensitive to noise in training data. Practical alternatives to TDIDT approaches which lead to more direct representations of the same knowledge, are examined. The alternatives are more immune to problems with spurious correlations in small data sets and to noise in initial training data. These knowledge representation problems and alternatives are examined in the context of chess, for which a TDIDT algorithm called the ID3 algorithm was originally devised. Modifications to the ID3 algorithm are proposed so that users can measure heuristically the information content of attributes to guide search. The program iteratively examines all positive instances remaining to be covered, along with negative training-set instances; search does not take place with irrelevant context restrictions. This algorithm is no more complex than TDIDT, just as fast and less sensitive to noise and it leads to clearer representations of the information present in training-set data.
Dirac-type characterizations of graphs without long chordless cycles
Authors: Vasek Chvátal, Irena Rusu, R. Sritharan
Venue: Discrete Mathematics (2002)

We call a chordless path υ1υ2...υi simplicial if it does not extend into any chordless path υ0υ1υ2.., υiυi+1. Trivially, for every positive integer k, a graph contains no chordless cycle of length k + 3 or more if each of its nonempty induced subgraphs contains a simplicial path with at most k vertices; we prove the converse. The case of k = 1 is a classic result of Dirac.
Adaptive Web Site Agents
Authors: Michael J. Pazzani, Daniel Billsus
Venue: Autonomous Agents and Multi-Agent Systems (2002)

We discuss the design and evaluation of a class of agents that we call adaptive web site agents. The goal of such an agent is to help a user find additional information at a particular web site, adapting its behavior in response to the actions of the individual user and the actions of other visitors to the web site. The agent recommends related documents to visitors and we show that these recommendations result in increased information read at the site. It integrates and coordinates among different reasons for making recommendations including user preference for subject area, similarity between documents, frequency of citation, frequency of access, and patterns of access by visitors to the web site. We argue that this information is best used not to change the structure or content of the web site but rather to change the behavior of an animated agent that assists the user.
Kermitt: conducting an experiment on the web
Authors: Paul Montgomery, David Ritchie
Venue: Journal of Technology in Human Services (2002)

A familiar and often difficult part of the research process is recruitment of subjects to participate in an experiment or survey. The World Wide Web offers potential access to a virtually unlimited pool of subjects: The trick is to administer an experiment in a smooth, apparently seamless manner. We describe a simple program for administering an experiment dependent on measuring response times over the Web. We discuss some of the problems we had to overcome, the trade-offs we faced, the reasons for the choices we made and the possible consequences of these choices. We then discuss possible applications to other research objectives.
An Improved Algorithm for the Incremental Recomputation of Active Relational Expressions
Authors: Timothy Griffin, Leonid Libkin, Howard Trickey
Venue: IEEE Transactions on Knowledge and Data Engineering (1997)

In [1], Qian and Wiederhold presented an algorithm for the incremental recomputation of relational algebra expressions that was claimed to preserve a certain minimality condition. This condition guarantees that the incremental change sets do not contain any unnecessary tuples; so, redundant computations are not performed. We show that, in fact, their algorithm violates this condition. We present an improved algorithm that does preserve this notion of minimality.
Automatically Assessing MPEG Coding Fidelity
Authors: Christian J. Van Den Branden Lambrecht, Vasudev Bhaskaran, Al Kovalick, Murat Kunt
Venue: IEEE Design Test (1995)

We describe the prototype of a testing device for MPEG compression schemes. The device produces synthetic test patterns specifically designed to evaluate the performance of MPEG coders. The patterns are fed into the coding chain, and the behavior of the coder is evaluated by comparing the original sequence with its decoded version. This approach allows the system to independently evaluate each artifact introduced by the coding process. We developed and describe here a software-based prototype of the pattern for the proposed testing device.The quality estimation module of the testing device is still under research. The latter will analyze the individual artifacts in the decoded sequence and, on the basis of a spatio-temporal model of the human visual system, assess the quality of the coding chain.
Design and Implementation of a Semantic Query Optimizer
Authors: S. T. Shenoy, Z. M. Ozsoyoglu
Venue: IEEE Transactions on Knowledge and Data Engineering (1989)

The authors describe a scheme to utilize semantic knowledge in optimizing a user-specified query. The semantics is represented as function-free clauses in predicate logic. The scheme uses a graph-theoretic approach to identify redundant joins and restrictions present in a given query while adding additional profitable specifications to it. Dynamic and heuristic interaction of three entities-schema, semantics, and query-forms the basis of the algorithm. The implementation architecture of the algorithm and test results on a representative set of data are presented. Issues associated with updating of semantic constraints are addressed, and an algorithm for semantic maintenance is introduced.
Production Systems with Negation as Failure
Authors: P. M. Dung, P. Mancarella
Venue: IEEE Transactions on Knowledge and Data Engineering (2002)

We study action rule-based systems with two forms of negation, namely classical negation and ¿negation as failure to find a course of actions.¿ We show by several examples that adding negation as failure to such systems increases their expressiveness in the sense that real life problems can be represented in a natural and simple way. Then, we address the problem of providing a formal declarative semantics to these extended systems by adopting an argumentation-based approach which has been shown to be a simple unifying framework for understanding the declarative semantics of various nonmonotonic formalisms. In this way, we naturally define the grounded (well-founded), stable, and preferred semantics for production systems with negation as failure. Next, we characterize the class of stratified production systems, which enjoy the properties that the above mentioned semantics coincide and that negation as failure to find a course of actions can be computed by a simple bottom-up operator. Stratified production systems can be implemented on top of conventional production systems in two ways. The first way corresponds to the understanding of stratification as a form of priority assignment between rules. We show that this implementation, though sound, is not complete in the general case. Hence, we propose a second implementation by means of an algorithm which transforms a finite stratified production system into a classical one. This is a sound and complete implementation, though computationally hard, as shown in the paper.
Time-varying MMSE modulated lapped transform and its applications to transform coding for speech and audio signals
Authors: Guangyu Wang, Ulrich Heute
Venue: Signal Processing (2002)

The time-varying modulated lapped transform (MLT) is used in speech and audio coding schemes to adjust the time-frequency resolution, to eliminate pre-echoes in the reconstructed signal, and to improve the coding quality. In order to maintain the perfect-reconstruction property in transition periods, an asymmetrical window has to be used at cost of poorer frequency characteristics. We firstly generalize a window-design method for transition periods in the time-varying MLT with a rigorous proof of its PR property, then present a new window-design method, with which the prototype window is so designed that the total reconstruction distortion in presence of coefficient quantization is minimized. This leads to the time-varying minimum mean-square error (MMSE) MLT. Experiments have shown that the designed windows have better frequency characteristics than the sine window in both transition and regular periods. A general formulation of the quantization distortion for different quantization-error models and for all coding systems is given. A simplified optimal window-design algorithm without direct minimization of the distortion equation is suggested. As an example a transform-coding scheme with time-varying MMSE MLT for speech and audio signals is presented.
Problems, Methods and Specialization
Authors: Michael Jackson
Venue: IEEE Software (1994)

The large aspiration to place the whole of software development alongside the established branches as one more branch of engineering is misconceived. The author discusses how our aspiration should be to develop specialized branches of software engineering, each meriting its own place alongside the specialized established branches.
On the combinatorial structure of the approval-voting polytope
Authors: Jean-Paul Doignon, Michel Regenwetter
Venue: Journal of Mathematical Psychology (2002)

Falmagne and Regenwetter (1996) proposed a probabilistic choice model of approval voting called the size-independent model. This model was investigated geometrically by Doignon and Regenwetter (1997), who introduced the approval-voting polytope associated with the choice model. In an effort to get closer to a full linear description of the polytope, we provide all edges, two-dimensional faces, and a large group of combinatorial automorphisms. Despite the new insights gathered from these results, the main challenge of listing all facets remains an open problem.
What 'Lean and Mean' Really Means
Authors: Tom DeMarco
Venue: IEEE Software (1995)

Every once in a while, a technical periodical publishes something that readers cut out and pin to the office bulletin board. I suspect that Tom DeMarco¿s comments may warrant the mutilation of this issue.This column is excerpted from Tom¿s new book, Why Does Software Cost So Much? (and Other Puzzles of the Information Age), ©1995 by Tom DeMarco, published by Dorset House. The book consists of 24 essays: 14 reprints (several of which first appeared in IEEE Software) and 10 new essays.¿Roger Pressman