ppxscal/embedding_network huggingface dataset:
Expert Systems in the UK
Authors: Roy Rada
Venue: IEEE Expert: Intelligent Systems and Their Applications (1990)

A brief background on British involvement in computer science is given, focusing on the Alvey Project. This was a five-year, $1-billion research-and-development program for information technology begun in response to Japan's Fifth Generation Computer Systems initiative, which highlighted expert systems as a major opportunity area. Britain's manpower in the area is examined. Marketplace factors are cited to explain why the British are particularly prominent in logic and human-computer interaction. Interactions among people in developing expert systems and the influence of hiring practices are examined. British projects and European Economic Community practices in which Europe is involved are reviewed.
VLSI Design and CAD Technology in Korea
Authors: Young-Uk Yu
Venue: IEEE Design Test (1989)

An overview is given of Korean VLSI and CAD technology, which did not develop naturally as it did in more advanced countries. Korean engineers had no electronic systems developed domestically for studying bipolar and MOS IC design. Consequently, they had to apply reverse engineering to the problem, which slowed development considerably. In 1982, the Korean government initiated the national project specifically to speed the progress of electronic technology development. Since then, VLSI design and CAD technology have begun to spread throughout the country. A prototype CAD system, called EDAS, was developed this year, and the project's goal has become the establishment of fully domestic VLSI CAD technology by 1991.
A perspective view and survey of meta-learning
Authors: Ricardo Vilalta, Youssef Drissi
Venue: Artificial Intelligence Review (2002)

Different researchers hold different views of what the term meta-learning exactly means. The first part of this paper provides our own perspective view in which the goal is to build self-adaptive learners (i.e. learning algorithms that improve their bias dynamically through experience by accumulating meta-knowledge). The second part provides a survey of meta-learning as reported by the machine-learning literature. We find that, despite different views and research lines, a question remains constant: how can we exploit knowledge about learning (i.e. meta-knowledge) to improve the performance of learning algorithms? Clearly the answer to this question is key to the advancement of the field and continues being the subject of intensive research.
Joint Data and Kalman Estimation for Rayleigh Fading Channels
Authors: M. J. Omidi, S. Pasupathy, P. G. Gulak
Venue: Wireless Personal Communications: An International Journal (1999)

Channel estimation is an essential part of many detection techniques proposed for data transmission over fading channels. For the frequency selective Rayleigh fading channel an autoregressive moving average representation is proposed based on the fading model parameters. The parameters of this representation are determined based on the fading channel characteristics, making it possible to employ the Kalman filter as the best estimator for the channel impulse response. For IS-136 formatted data transmission the Kalman filter is employed with the Viterbi algorithm in a Per-Survivor Processing (PSP) fashion and the ove rall bit error rate performance is shown to be superior to that of detection techniques using the RLS and LMS estimators. To allow more than one channel estimation per symbol interval, Per-Branch Processing (PBP) method is introduced as a general case of PSP and its effect on performance is evaluated. The sensitivity of performance to parameters such as fading model order and vehicle speed is also studied.
The evolution matrix: recovering software evolution using software visualization techniques
Authors: Michele Lanza
Venue: Proceedings of the 4th International Workshop on Principles of Software Evolution (2001)

One of the major problems in software evolution is coping with the complexity which stems from the huge amount of data that must be considered. The current approaches to deal with that problem all aim at a reduction of complexity and a filtering of the relevant information. In this paper we propose an approach based on a combination of software visualization and software metrics which we have already successfully applied in the field of software reverse engineering. Using this approach we discuss a simple and effective way to visualize the evolution of software systems which helps to recover the evolution of object oriented software systems.
Dynamic Base Station Selection for Personal Communication Systems with Distributed Control Schemes
Authors: Hitoshi Takanashi, Stephen S. Rappaport
Venue: Wireless Personal Communications: An International Journal (1999)

Distributed control schemes allow base stations in personal communication systems to be placed at locations corresponding to high expected traffic. This flexible base station placement creates significant overlapping coverage areas that can be utilized to improve system performance [1]. A new technique for dynamic base station selection in systems with overlapping cells is considered and its effect on traffic performance is characterized. The technique realizes robust performance for personal communication systems in fluctuating and heavily tapered traffic. A mathematical analysis based on a state transition model is used to evaluate performance of a system that employs the proposed technique. The results indicate that improved blocking probability and carried traffic performance are obtainable. Computer simulations were undertaken confirm the analytical results.
Compatible observability don't cares revisited
Authors: R. K. Brayton
Venue: Proceedings of the 2001 IEEE/ACM international conference on Computer-aided design (2001)

CODCs stand for compatible observability don't cares. We first examine the definition of compatibility and when a set of CODCs is compatible. We then discuss Savoj's CODC computation for propagating CODCs from a node's output to its fanins, and show by example, that the results can depend on the current implementation of the node. Then we generalize the computation so that the result is independent of the implementation at the node. The CODCs propagated by this computation are proved to be maximal in some sense. Local don't cares (LDCs) are CODCs of a node, pre-imaged to the primary inputs and then imaged and projected to the local fanins of the node. LDCs combine CODCs with SDCs (satisfiability don't cares), but only the CODC part is propagated to the fanin network. Another form of local don't cares, propagates both the CODC and SDC parts to the fanin network. Both are shown to be compatible in some sense, but conservative. We give a method for updating both kinds of local don't cares incrementally when other nodes in the network are changed.
Rewriting Queries Using Views
Authors: S. Flesca, S. Greco
Venue: IEEE Transactions on Knowledge and Data Engineering (2001)

In this paper, we consider the problem of answering queries using materialized views in the presence of negative goals. The solution is carried out by ¿inverting¿ views and deriving both positive and negative knowledge. In order to derive negative knowledge, we invert conjunctive views with negation into a set of (extended) views which may also have, in addition to negation-as-failure, a different form of negation called classical (or strong) negation. We also consider the case of disjunctive views and present a technique which permits us to infer both positive and negative knowledge. Furthermore, we extend previous techniques for inferring knowledge from views based on relations with functional dependencies. Finally, we present a prototype of a system developed at the University of Calabria.
Authors' Reply
Authors: W. Najjar, J. L. Gaudiot
Venue: IEEE Transactions on Computers (1994)

Recently, W. Najjar and J.L. Gaudilot (1990) have proposed a new measure for network reliability which they called network resilience. One attractive feature of network resilience is that it has a good and simple approximation, as purported to have been proved by the authors (also supported by simulations). We show that their proof has several pitfalls remained to be fixed.
A domain-driven approach to improving search effectiveness in traditional online catalogs
Authors: Theresa I. Jefferson, Thomas J. Nagy
Venue: Information and Management (2002)

Search performance can be greatly improved by using domain knowledge to assist users in developing a problem specification tailored to the information contained in the system. A methodology is presented for utilizing intelligent information retrieval techniques and domain-specific knowledge to improve user searching. For databases involving a relatively narrow domain, a "system thesaurus" combined with expert systems technology can be used to create an intelligent front end to assist the user in retrieving information with greater precision and recall Evaluation of the prototype showed greatly improved search effectiveness and satisfaction over the traditional catalog system.
Parallel Simulated Annealing: Accuracy vs. Speed in Placement
Authors: M. D. Durand
Venue: IEEE Design Test (1989)

The techniques that researchers have used to control error in VLSI placement are surveyed. The author discusses the application of parallelism, synchronization with serial subsets, combining algorithms, periodic synchronization, shared-memory implementation, local-memory implementation, and connection Machine implementation. The issues of temporary versus cumulative error, task allocation, and error measurements are examined.
Signal Integrity: Fault Modeling and Testing in High-Speed SoCs
Authors: Mehrdad Nourani, Amir Attarha
Venue: Journal of Electronic Testing: Theory and Applications (2002)

As we approach 100 nm technology the interconnect issues are becoming one of the main concerns in the testing of gigahertz system-on-chips. Voltage distortion (noise) and delay violations (skew) contribute to the signal integrity loss and ultimately functional error, performance degradation and reliability problems. In this paper, we first define a model for integrity faults on the high-speed interconnects. Then, we present a BIST-based test methodology that includes two special cells to detect and measure noise and skew occurring on the interconnects of the gigahertz system-on-chips. Using an inexpensive test architecture the integrity information accumulated by these special cells can be scanned out for final test and reliability analysis.
Using Data Mining Methods to Build Customer Profiles
Authors: Gediminas Adomavicius, Alexander Tuzhilin
Venue: Computer (2001)

Personalization--the ability to provide content and services tailored to individuals' preferences and behavior--is an important marketing tool. The authors developed an approach that uses information from customers' transactional histories to construct individual profiles containing facts about the customer and rules describing that customer's behavior. They used data mining methods to derive behavioral rules from the data. They also developed a method for validating customers' profiles to separate "good" rules from "bad." They implemented the profile construction and validation methods using the 1:1Pro system. Including personal behavioral rules in customers' profiles makes this approach unique.Focusing on statistical validity and acceptability to an expert, the authors explain how to judge the quality of rules stored in customers' profiles. Their objective is to incorporate the concept of effectiveness in 1:1Pro. The authors propose combining the constraint specification, data mining, and rule validation stages into one system.
Binary and ternary codes of covering radius one: some new lower bounds
Authors: Wolfgang Haas
Venue: Discrete Mathematics (2002)

Let kq(n) denote the minimal cardinality of a q-ary code C of length n and covering radius one. The numbers of elements of C that lie in a fixed k-dimensional subspace of {0,...,q - 1}n satisfy a certain system of linear inequalities. In a recent paper, the author developed a method to deal with this system for values of k, which are unbounded with increasing n. The aim of the present paper is to generalize the method in the cases q = 2 and 3, which provides new lower bounds for k2(n) and k3(n).
Fingerprint image enhancement using filtering techniques
Authors: Shlomo Greenberg, Mayer Aladjem, Daniel Kogan
Venue: Real-Time Imaging (2002)

Extracting minutiae from fingerprint images is one of the most important steps in automatic fingerprint identification and classification. Minutiae are local discontinuities in the fingerprint pattern, mainly terminations and bifurcations. Most of the minutiae detection methods are based on image binarization while some others extract the minutiae directly from gray-scale images. In this work we compare these two approaches and propose two different methods for fingerprint ridge image enhancement. The first one is carried out using local histogram equalization, Wiener filtering, and image binarization. The second method uses a unique anisotropic filter for direct gray-scale enhancement. The results achieved are compared with those obtained through some other methods. Both methods show some improvement in the minutiae detection process in terms of time required and efficiency.
Aggregation of Imprecise and Uncertain Information in Databases
Authors: S. McClean, B. Scotney, M. Shapcott
Venue: IEEE Transactions on Knowledge and Data Engineering (2001)

Information stored in a database is often subject to uncertainty and imprecision. Probability theory provides a well-known and well understood way of representing uncertainty and may thus be used to provide a mechanism for storing uncertain information in a database. We consider the problem of aggregation using an imprecise probability data model that allows us to represent imprecision by partial probabilities and uncertainty using probability distributions. Most work to date has concentrated on providing functionality for extending the relational algebra with a view to executing traditional queries on uncertain or imprecise data. However, for imprecise and uncertain data, we often require aggregation operators that provide information on patterns in the data. Thus, while traditional query processing is tuple-driven, processing of uncertain data is often attribute-driven where we use aggregation operators to discover attribute properties. The aggregation operator that we define uses the Kullback-Leibler information divergence between the aggregated probability distribution and the individual tuple values to provide a probability distribution for the domain values of an attribute or group of attributes. The provision of such aggregation operators is a central requirement in furnishing a database with the capability to perform the operations necessary for knowledge discovery in databases.
The DASH Prototype: Logic Overhead and Performance
Authors: D. Lenoski, J. Laudon, T. Joe, D. Nakahira, L. Stevens, A. Gupta, J. Hennessy
Venue: IEEE Transactions on Parallel and Distributed Systems (1993)

The fundamental premise behind the DASH project is that it is feasible to build large-scale shared-memory multiprocessors with hardware cache coherence. The hardware overhead of directory-based cache coherence in a 48-processor is examined. The data show that the overhead is only about 10-15%, which appears to be a small cost for the ease of programming offered by coherent caches and the potential for higher performance. The performance of the system is discussed, and the speedups obtained by a variety of parallel applications running on the prototype are shown. Using a sophisticated hardware performance monitor, the effectiveness of coherent caches and the relationship between an application's reference behavior and its speedup are characterized. The optimizations incorporated in the DASH protocol are evaluated in terms of their effectiveness on parallel applications and on atomic tests that stress the memory system.
The Superscalar Architecture of the MC68060
Authors: Joe Circello, Greg Edgington, Dan McCarthy, James Gay, David Schimke, Steven Sullivan, Richard Duerden, Chris Hinds, Danny Marquette, Lal Sood, Al Crouch, Daniel Chow
Venue: IEEE Micro (1995)

Motorola's MC68060 microprocessor is the newest member of the 68000 microprocessor family, its cost-effective and power-thrifty solution for high performanceembedded processing applications. This article focuses on the MC68060 microarchitecture features, such as its superscalar pipeline implementation, that enable it to achieve its high performance objectives while maintaining 68000 user code compatibility. The first MC68060 implementations, supplied at 50 MHz and 66 MHz, are 3.3V parts that achieve 103 dhrystone mips performance (66MHz).
The first term in the expansion of plethysm of Schur functions
Authors: Mei Yang
Venue: Discrete Mathematics (2002)

Plethysm of two Schur functions can be expressed as a sum of Schur functions with nonnegative integer coefficients. Recently, a new algorithm has been developed to compute the coefficients individually. Knowing the first non-zero term (the largest term under the reverse lexicographic ordering of partitions) in the expansion will speed up caulations significantly. In this paper, we show that by using combinatorial properties of nested inverse Kostka numbers, we are able to obtain some general results regarding the first term. In a lot of cases, the first term can be easily found, and the coefficient is equal to unity. We also give some results on the last term.
Adding Multiple-Fault Tolerance to Generalized Cube Networks
Authors: C. J. Shih, K. E. Batcher
Venue: IEEE Transactions on Parallel and Distributed Systems (1994)

Generalized cube networks are limited to single-fault tolerance with respect topermutation connections. The vector space approach presented here yields manyfault-tolerance schemes that can tolerate two and three faults. In each scheme,redundant switches and links are added to networks and interconnected in certain ways.These redundancies are represented by a matrix called the redundancy matrix. Afault-free network without redundancy is represented by an identity matrix. As faultyswitches and links are discovered, the remaining switches and links are remapped toestablish an intact network. The remapping is analogous to converting an invertibleredundancy matrix back to an identity matrix.
Software evolution: let's sharpen the terminology before sharpening (out-of-scope) tools
Authors: Roland T. Mittermeir
Venue: Proceedings of the 4th International Workshop on Principles of Software Evolution (2001)

Research on software evolution focuses on one hand on empirical investigations studying changes in long-living software systems, on the other hand on methods and tools, how such evolutionary behaviour of software can be controlled or supported.This paper departs from the observation that the empirical work and the tool- or methods-builder's work are quite often only obliquely related. Too often, the two camps depart from a token-semantics of the word evolution. However, by ignoring the precise meanings of the words software and system, chances for misunderstandings are high. Therefore, an attempt to sharpen semantics of these three terms is made by stratifying their scope. On the basis of these sharpened definitions, some exemplary attempts for dealing with Software Evolution are mentioned..
Genetics-Based Learning of New Heuristics: Rational Scheduling of Experiments and Generalization
Authors: Benjamin W. Wah, Arthur Ieumwananonthachai, Lon-Chan Chu, Akiko N. Aizawa
Venue: IEEE Transactions on Knowledge and Data Engineering (1995)

In this paper we present new methods for the automated learning of heuristics in knowledge-lean applications and for finding heuristics that can be generalized to unlearned domains. These applications lack domain knowledge for credit assignment; hence, operators for composing new heuristics are generally model-free, domain independent, and syntactic in nature. The operators we have used are genetics-based; examples of which include mutation and cross-over. Learning is based on a generate-and-test paradigm that maintains a pool of competing heuristics, tests them to a limited extent, creates new ones from those that perform well in the past, and prunes poor ones from the pool. We have studied three important issues in learning better heuristics: 1) anomalies in performance evaluation, 2) rational scheduling of limited computational resources in testing candidate heuristics in single-objective as well as multiobjective learning, and 3) finding heuristics that can be generalized to unlearned domains. We show experimental results in learning better heuristics for 1) process placement for distributed-memory multicomputers, 2) node decomposition in a branch-and-bound search, 3) generation of test patterns in VLSI circuit testing, and 4) VLSI cell placement and routing.
Software Engineering in the Academy
Authors: Bertrand Meyer
Venue: Computer (2001)

The lack of a universally accepted definition of software engineering makes teaching the discipline a challenge. A textbook definition of the term might read something like this: "the body of methods, tools, and techniques intended to produce quality software." Rather than emphasizing quality alone, we could distinguish software engineering from programming by defining it as follows: "the development of possibly large systems intended for use in production environments, over a possibly long period, worked on by possibly many people, and possibly undergoing many changes." In this definition, "development" includes management, maintenance, validation, documentation, and so forth. Given the shortage of qualified personnel and the ongoing search for excellent developers, educational institutions must strive to train students who will, upon graduation, take their place in the top tier. By teaching them fundamental thought leavened with practical experience, these establishments can help prepare these students for a long-term professional growth that synchronizes smoothly with the discipline's progress-- for, while technology evolves, the concepts remain.
Radar fusion to detect targets-Part II
Authors: A. Farina, M. Grazzini
Venue: Signal Processing (2002)

In a previous paper [3] the Authors have described the concept of cueing a microwave radar by exploiting the detection of a low frequency radar; the target of interest was an aircraft. In this publication the study is extended to the case in which the target is a ballistic object. This study differs from the previous one for the electromagnetic and the kinematics characteristics of the target. The mathematical approach conceived in the previous paper has been extended to the present study case. The ranging advantage of using the cueing system is demonstrated also in the case of ballistic target.