ppxscal/embedding_network huggingface dataset:
A Knowledge-Based System for Selecting Test Methodologies
Authors: Xi-An Zhu, Melvin A. Breuer
Venue: IEEE Design Test (1988)

A prototype knowledge-based system that helps select test methodologies for a particular type of logic structure is described. The system, called TDES, (testable design expert system), is a subsystem of Adam, an advanced design automation system. The system is being used to test programmable logic arrays, but its architecture is applicable to other types of structures such as RAMs, ROMs, and other combinational logic. It uses a divide-and-conquer (partitioning) strategy and works interactively with a user as an intelligent consultant and assistant.
A Neural Network Approach in Diabetes Management by Insulin Administration
Authors: G. Gogou, N. Maglaveras, B. V. Ambrosiadou, D. Goulis, C. Pappas
Venue: Journal of Medical Systems (2001)

Diabetes management by insulin administration is based on medical experts' experience, intuition, and expertise. As there is very little information in medical literature concerning practical aspects of this issue, medical experts adopt their own rules for insulin regimen specification and dose adjustment. This paper investigates the application of a neural network approach for the development of a prototype system for knowledge classification in this domain. The system will further facilitate decision making for diabetic patient management by insulin administration. In particular, a generating algorithm for learning arbitrary classification is employed. The factors participating in the decision making were among others diabetes type, patient age, current treatment, glucose profile, physical activity, food intake, and desirable blood glucose control. The resulting system was trained with 100 cases and tested on 100 patient cases. The system proved to be applicable to this particular problem, classifing correctly 92% of the testing cases.
Three-Dimensional Topology Preserving Reduction on the 4-Subfields
Authors: Cherng-Min Ma, Shu-Yen Wan, Jiann-Der Lee
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2002)

This paper discusses thinning on 3D binary images with the 4-subfield approach. Although a thinning algorithm concerns binary images, the algorithm itself can be represented as a set of three-color reduction templates. A thinning algorithm is topology preserving if the set of all three-color templates is topology preserving. Sufficient and necessary conditions of time complexity {\rm{O}}(n) were proposed for verifying the topological soundness of a 3D 4-subfield thinning algorithm of n three-color templates. Theories and techniques for computerizing such conditions were discussed. Two 4-subfield thinning algorithms on 3D images, one for generating medial curves, and the other one for generating medial surfaces, are proposed and proved to preserve topology by our sufficient and necessary conditions.
The Texture Gradient Equation for Recovering Shape from Texture
Authors: M. Clerc, S. Mallat
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2002)

This paper studies the recovery of shape from texture under perspective projection. We regard Shape from Texture as a statistical estimation problem, the texture being the realization of a stochastic process. We introduce warplets, which generalize wavelets over the 2D affine group. At fine scales, the warpogram of the image obeys a transport equation, called Texture Gradient Equation. In order to recover the 3D shape of the surface, one must estimate the deformation gradient, which measures metric changes in the image. This is made possible by imposing a notion of homogeneity for the original texture, according to which the deformation gradient is equal to the velocity of the Texture Gradient Equation. By measuring the warplet transform of the image at different scales, we obtain a deformation gradient estimator.
Parallel frequent set counting
Authors: D. B. Skillicorn
Venue: Parallel Computing (2002)

Computing the frequent subsets of large multi-attribute data is a key component of local pattern detection data mining algorithms. It is both computation- and data-intensive. The standard parallel algorithms require multiple passes through the data. The cost of data access may easily outweigh any performance gained by parallelizing the computational part. We address two opportunities for performance improvement: using a parallel approximate algorithm that requires only a single pass over the data; and using a probabilistic technique to avoid generating most of the lattice of subsets implied by each object's data. The computation required is only slightly greater than levelwise algorithms, but the amount of data access is much smaller.
Designing and Implementing an Architecture with Boundary Scan
Authors: R. P. van Riessen, H. G. Kerkhoff, A. Kloppenburg
Venue: IEEE Design Test (1990)

A description is given of a standardized structured test methodology based on the boundary-scan proposal from the Joint Test Action Group (JTAG), which is now IEEE proposed standard P1149.1. Boundary scan does not address testability at the IC level, primarily because there is no standard for designing built-in self-testing (BIST) circuits. An architecture called the hierarchical testable, or H-testable, architecture that is compatible with the JTAG boundary-scan standard for PCB testing and provides BIST at the IC level is presented. The two have been merged, ensuring testability of the hardware from the printed-circuit-board level down to integrated-circuit level. In addition, the architecture has built-in self-test at the IC level. The authors have implemented this design using a self-test compiler.
Requirements Engineering: The Emerging Wisdom
Authors: Jawed Siddiqi, M. Chandra Shekaran
Venue: IEEE Software (1996)

Developments in requirements engineering, as in system development, have come in waves. The next wave of requirements techniques and tools should account for the problem and development context, accommodate incompleteness, and recognize and exploit the non-absolute nature of user needs.
Bounding the Mean Response Time of the Minimum Expected Delay Routing Policy: An Algorithmic Approach
Authors: Richard R. Muntz, John C. S. Lui, Don Towsley
Venue: IEEE Transactions on Computers (1995)

Balancing loads in a multi-server system can have a significant impact on performance. In this paper, we model such a system as a heterogeneous multi-server queueing system. We study the behavior of such a system operating under the minimum expected delay (MED) routing policy, i.e., an arriving customer is assigned to the queue which has the minimal expected value of unfinished work. This routing discipline can be viewed as a generalization of the join-the-shortest queue (SQ) discipline for homogeneous servers. There is no closed-form solution for this class of queueing problem. In this paper, we provide a methodology to compute upper and lower bounds on the mean response time of the system. This methodology allows one to tradeoff the tightness of the bounds and computational cost. Applications and numerical examples are presented which show how to use this methodology for deriving performance measures and also illustrating that the excellent accuracy of the computational algorithm which is achievable with modest computational cost.
Virtual sample generation using a population of networks
Authors: Sungzoon Cho, Min Jang, Sungjune Chang
Venue: Neural Processing Letters (1997)

Multilayer perceptrons have been shown to approximate any continuous functions with a desired precision. With insufficient training samples, however, the network can not learn the function properly and popular model selection methods such as cross validation can not be used. We propose a scheme to generate virtual samples using a population of networks. They are applied to regression problems and are shown to improve generalization and to solve the model selection problem at the same time.
Cyclic Ostrom Spreads
Authors: Vikram Jha, Norman Johnson
Venue: Designs, Codes and Cryptography (1999)

We call a transitive permutation group G stable if every non-trivial orbit B, of a point stabilizerG_O , is such that some element of G-G_O leaves invariant B\cup \{O\}. We characterize all finite affine planes \pi of order n that admit a collineation group G that acts, on the points of \pi , as a stable 3/2-transitive permutation group of rank n+2 . The planes obtained are precisely what we have called cyclic Ostrom planes; these are translation planes whose associated spreads are obtained from the Desarguesian spread \delta , of order n=p^r , by replacing a partial subspread of \delta by another consisting of GF(p) subspaces that are unions of kern orbits. All Andr&eacute; spreads, as well as many other spreads, are examples of cyclic Ostrom spreads.
Quantum waves: the proper basis for low dissipation quantum computing
Authors: D. K. Ferry, R. Akis, I. Knezevic
Venue: Microelectronic Engineering (2002)

The promise of more effective computation led to quantum computers, which are supposed to surpass binary, digital computers. This is an outgrowth of the search for dissipation-free computation, in which the bit state is switched 'adiabatically.' Implementations in which the two local minima are at different energy levels are unstable. Using super-symmetric quantum mechanics, we show that natural transitions occur between degenerate eigenstates. Then we can write, quite generally, that the qubit should satisfy the Hamiltonian H = k2 > 0, and we associate k with the 'momentum' in Hilbert space. That is, the fundamental structure of the quantum qubit should be that of a quantum plane wave.
Intersection sets in AG(n, q) and a characterization of the hyperbolic quadric in PG(3,q)
Authors: Corrado Zanella
Venue: Discrete Mathematics (2002)

Bruen proved that if A is a set of points in AG(n, q) which intersects every hyperplane in at least t points, then |A| ≥ (n+t-1)(q-1) + 1, leaving as an open question how good such bound is. Here we prove that, up to a trivial case, if t > ((n - 1)(q - 1) + 1)/2, then Bruen's bound can be improved. If t is equal to the integer part of ((n - 1)(q - 1) + 1)/2, then there are some examples which attain such a lower bound. Somehow, this suggests the following combinatorial characterization: if a set S of points in PG(3, q) meets every affine plane in at least q - 1 points and is of minimum size with respect to this property, then S is a hyperbolic quadric.
SemQuery: Semantic Clustering and Querying on Heterogeneous Features for Visual Data
Authors: Gholamhosein Sheikholeslami, Wendy Chang, Aidong Zhang
Venue: IEEE Transactions on Knowledge and Data Engineering (2002)

The effectiveness of the content-based image retrieval can be enhanced using heterogeneous features embedded in the images. However, since the features in texture, color, and shape are generated using different computation methods and thus may require different similarity measurements, the integration of the retrievals on heterogeneous features is a nontrivial task. In this paper, we present a semantics-based clustering and indexing approach, termed SemQuery, to support visual queries on heterogeneous features of images. Using this approach, the database images are classified based on their heterogeneous features. Each semantic image cluster contains a set of subclusters that are represented by the heterogeneous features that the images contain. An image is included in a semantic cluster if it falls within the scope of all the heterogeneous clusters of the semantic cluster. We also design a neural network model to merge the results of basic queries on individual features. A query processing strategy is then presented to support visual queries on heterogeneous features. An experimental analysis is conducted and presented to demonstrate the effectiveness and efficiency of the proposed approach.
Exploiting Instruction-Level Parallelism for Integrated Control-Flow Monitoring
Authors: M. A. Schuette, J. P. Shen
Venue: IEEE Transactions on Computers (1994)

Computer architectures are using increased degrees of instruction-level machine parallelism to achieve higher performance, e.g., superpipelined, superscalar and very long instruction word (VLIW) processors. Full utilization of such machine parallelism is difficult to achieve and sustain, resulting in the occurrence of idle resources at run time. This work explores the use of such idle resources for concurrent error detection in processors employing instruction-level machine parallelism. The Multiflow TRACE 14/300 processor, a VLIW machine, is chosen as an experimental vehicle. Experiments indicate that significant idle resources are likely to exist across a wide range of scientific applications for the TRACE 14/300. A methodology is presented for detecting transient control-flow errors, called available resource-driven control-flow monitoring (ARC), whose resource use can be tailored to the existence of idle resources in the processor. Results of applying ARC to the Multiflow TRACE 14/300 processor show that
Speaker clustering for speech recognition using vocal tract parameters
Authors: Masaki Naito, Li Deng, Yoshinori Sagisaka
Venue: Speech Communication (2002)

We propose speaker clustering methods for speech recognition based on vocal tract (VT) size related articulatory parameters associated with individual speakers. Two parameters characterizing gross VT dimensions are first derived from the formant frequencies of two vowels and are then used to cluster speakers. The resulting speaker clusters are significantly different from speaker clusters obtained by conventional acoustic criteria. Then phoneme recognition experiments are carried out by using speaker-clustered HMMs (SC-HMMs) trained for each cluster. The proposed method requires a small amount of speech data for speaker clustering and for selecting the most suitable SC-HMM for a target speaker, but gives higher recognition rates than conventional speaker clustering methods based on acoustic criteria.
Bottom-Up Construction of Ontologies
Authors: Paul E. van der Vet, Nicolaas J. I. Mars
Venue: IEEE Transactions on Knowledge and Data Engineering (1998)

We present a particular way of building ontologies that proceeds in a bottom-up fashion. Concepts are defined in a way that mirrors the way their instances are composed out of smaller objects. The smaller objects themselves may also be modeled as being composed. Bottom-up ontologies are flexible through the use of implicit and, hence, parsimonious part-whole and subconcept-superconcept relations. The bottom-up method complements current practice, where, as a rule, ontologies are built top-down. The design method is illustrated by an example involving ontologies of pure substances at several levels of detail. It is not claimed that bottom-up construction is a generally valid recipe; indeed, such recipes are deemed uninformative or impossible. Rather, the approach is intended to enrich the ontology developer's toolkit.
Literate Programming Simplified
Authors: Norman Ramsey
Venue: IEEE Software (1994)

Literate programming tools let you arrange the parts of a program in any order and extract documentation and code from the same source file. The author argues that language-dependence and feature complexity have hampered acceptance of these tools, then offers a simpler alternative.
An Efficient Systolic Algorithm for the Longest CommonSubsequence Problem
Authors: Yen-Chun Lin, Jyh-Chian Chen
Venue: The Journal of Supercomputing (1998)

A longest common subsequence (LCS) of two strings is a common subsequence of the two strings of maximal length. The LCS problem is to find an LCS of two given strings and the length of the LCS (LLCS). In this paper, a fast linear systolic algorithm that improves on previous systolic algorithms for solving the LCS problem is presented. For two given strings of length m and n, where m &ge; n, the LLCS and an LCS can be found in m + 2n &minus; 1 time steps. This algorithm achieves the tight lower bound of the time complexity under the situation where symbols are input sequentially to a linear array of n processors. The systolic algorithm can be modified to take only m + n steps on multicomputers by using the scatter operation.
Multiscale Segmentation of Unstructured Document Pages Using Soft Decision Integration
Authors: Kamran Etemad, David Doermann, Rama Chellappa
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1997)

We present an algorithm for layout-independent document page segmentation based on document texture using multiscale feature vectors and fuzzy local decision information. Multiscale feature vectors are classified locally using a neural network to allow soft/fuzzy multi-class membership assignments. Segmentation is performed by integrating soft local decision vectors to reduce their "ambiguities."
Testing the diameter of graphs
Authors: Michal Parnas, Dana Ron
Venue: Random Structures Algorithms (2002)

We propose a general model for testing graph properties, which extends and simplifies the bounded degree model of Goldreich and Ron [Property Testing in Bounded Degree Graphs, Proc. 31st Annual ACM Symposium on the Theory of Computing, 1997, pp. 406-415.] In this model, we present a family of algorithms that test whether the diameter of a graph is bounded by a given parameter D, or is ε-far from any graph with diameter at most β(D). The function β(D) ranges between D + 4 and 4D + 2, depending on the algorithm. All our algorithms run in time polynomial in 1/ε.
A Graph-Based Data Model and its Ramifications
Authors: Mark Levene, George Loizou
Venue: IEEE Transactions on Knowledge and Data Engineering (1995)

Currently, database researchers are investigating new data models in order to remedy the deficiences of the flat relational model when applied to nonbusiness applications. Herein we concentrate on a recent graph-based data model called the hypernode model. The single underlying data structure of this model is the hypernode which is a digraph with a unique defining label. We present in detail the three components of the model, namely its data structure, the hypernode, its query and update language, called HNQL, and its provision for enforcing integrity constraints. We first demonstrate that the said data model is a natural candidate for formalising hypertext. We then compare it with other graph-based data models and with set-based data models. We also investigate the expressive power of HNQL. Finally, using the hypernode model as a paradigm for graph-based data modelling, we show how to bridge the gap between graph-based and set-based data models, and at what computational cost this can be done.
On-Line Clustering
Authors: Athman Bouguettaya
Venue: IEEE Transactions on Knowledge and Data Engineering (1996)

In this study, we focus on the stability and behavior of three widely used clustering algorithms. Various correlation coefficients are computed to help us understand the sensitivity of object clustering. Surprisingly, the results indicate that there is almost no difference among any clustering approach. Furthermore, all methods appear to be near stable. These findings tend to show that the clustering algorithms are independent of the way objects are inherently clustered.
Optimizing Large Join Queries Using A Graph-Based Approach
Authors: Chiang Lee, Chi-Sheng Shih, Yaw-Huei Chen
Venue: IEEE Transactions on Knowledge and Data Engineering (2001)

Although many query tree optimization strategies have been proposed in the literature, there still is a lack of a formal and complete representation of all possible permutations of query operations (i.e., execution plans) in a uniform manner. A graph-theoretic approach presented in this paper provides a sound mathematical basis for representing a query and searching for an execution plan. In this graph model, a node represents an operation and a directed edge between two nodes indicates the order of executing these two operations in an execution plan. Each node is associated with a weight and so is an edge. The weight is an expression containing optimization required parameters, such as relation size, tuple size, join selectivity factors. All possible execution plans are representable in this graph and each spanning tree of the graph becomes an execution plan. It is a general model which can be used in the optimizer of a DBMS for interal query representation. On the basis of this model, we devise an algorithm that finds a near optimal execution plan using only polynomial time. The algorithm is compared with a few other popular optimization methods. Experiments show that the proposed algorithm is superior to the others under most circumstances.
Implementing Automatic Location Update for Follow-Me Database Using VoIP and Bluetooth Technologies
Authors: Yi-Bing Lin, Hsu-Yung Cheng, Ya-Hsing Cheng, Prathima Agrawal
Venue: IEEE Transactions on Computers (2002)

Personal Number (PN) service or Follow-me service allows a user to access telecommunication services with any terminals (e.g., fixed telephones or mobile phones) in any locations within the service area. To provide this feature, the PN user needs to manually register with a phone number every time he/she enters a new location. If the user forgets to register the new phone number, the incoming calls will be misrouted. To provide user-friendly Follow-me service, this paper proposes an Automatic Follow-me Service (AFS) approach that automatically updates the PN records in the Follow-me database. The significance of our approach is that AFS can be integrated with existing Follow-me databases to automate PN services offered by different PSTN service providers. We show how AFS can be implemented by using the Voice over IP and Bluetooth technologies. Then, we propose an analytic model to investigate the performance of AFS. The analytic results are validated by simulation experiments. Our study suggests how to select polling frequency to optimize the AFS performance.
An "effective" capacitance based delay metric for RC interconnect
Authors: Chandramouli V. Kashyap, Charles J. Alpert, Anirudh Devgan
Venue: Proceedings of the 2000 IEEE/ACM international conference on Computer-aided design (2000)

Efficient, yet accurate delay estimation for RC interconnect is required for the optimization loop of timing-driven physical design tools. For many applications, the Elmore delay metric [4] has been widely used due to its efficiency and ease of use. However, it is well known that the Elmore metric can have significant error since it ignores the resistive shielding of down-stream capacitance. We present a new interconnect metric called ECM that accounts for this resistive shielding by computing an effective capacitance to model the downstream capacitance. ECM can also be computed with the same complexity as the Elmore delay and does not require the computation of moments. Experiments show that ECM is significantly more accurate than Elmore delay and is competitive with other metrics that use multiple moments.