ppxscal/embedding_network huggingface dataset:
Example-Based Graphical Database Query Languages
Authors: Gültekin Özsoyoglu, Huaqing Wang
Venue: Computer (1993)

Several user-friendly graphical database query languages that let users formulate a query by specifying a graphically aided example on the screen are compared. One of the earliest such languages, M.M. Zloof's (1977) Query-by-Example, is described. Other languages discussed are Aggregates-by-Example, Summary-Table-by-Example, and Query-by-Statistical-Relational-Table for statistical and scientific databases; Time-by-Example for historical databases; Generalized-Query-by-Example for relational, network, and hierarchical databases; Office-by-Example, Formanager, the Natural Forms Query Language, and System-for-Business-Automation for office environments; and Picquery and Query-by-Pictorial-Example for pictorial (image) databases. The basic features, query specification and interpretation, object manipulation, query language constructs, and query processing techniques used in each of the languages are discussed.
Algorithms for maximum weight induced paths
Authors: Fanica Gavril
Venue: Information Processing Letters (2002)

A family of graphs is a k-bounded-hole family if every graph in the family has no holes with more than k vertices. The problem of finding in a graph a maximum weight induced path has applications in large communication and neural networks when worst case communication time needs to be evaluated; unfortunately this problem is NP-hard even when restricted to bipartite graphs. We show that this problem has polynomial time algorithms for k-bounded-hole families of graphs, for interval-filament graphs and for graphs decomposable by clique cut-sets or by splits into prime subgraphs for which such algorithms exist.
A Class of Randomized Strategies for Low-Cost Comparison of File Copies
Authors: D. Barbará, R. J. Lipton
Venue: IEEE Transactions on Parallel and Distributed Systems (1991)

A class of algorithms that use randomized signatures to compare remotely located filecopies is presented. A simple technique that sends on the order of 4/sup f/log(n) bits,where f is the number of differing pages that are to be diagnosed and n is the number ofpages in the file, is described. A method to improve the bound in the number of bits sent,making them grow with f as flog(f) and with n as log(n)log(log(n)), and a class ofalgorithms in which the number of signatures grows with f as fr/sup f/, where r can bemade to approach 1, are also presented. A comparison of these techniques is discussed.
Fast test application technique without fast scan clocks
Authors: Seonki Kim, Bapiraju Vinnakota
Venue: Proceedings of the 2000 IEEE/ACM international conference on Computer-aided design (2000)

Built-in self-test (BIST) schemes need to set the state of the circuit under test (CUT) for each test vector applied. The two primary techniques by which the state is set are test-per-scan and test-per-clock. In a test-per-scan scheme, circuit states are set using one or more scan chains. Several scan cycles are required to apply a single test vector. In very large circuits, the time to apply each test vector may be quite high. The direct option of reducing test time with a fast scan clock is difficult to realize in practice. In a test-per-clock scheme, all circuit flip-flops are loaded in parallel. A new test vector can be applied in each cycle. The area overhead incurred in accessing each storage element directly is quite significant. We propose a new Broadcast BIST (B2IST) scheme as a compromise between the two approaches. B2IST uses time-division multiplexing (TDM) to load multiple storage elements in a broadcast group in a single clock cycle, but through only a single scan data input. Based on our B2IST simulation, we compare the layout overhead and performance of B2IST with that of traditional BIST schemes on ISCAS benchmark circuits. Thus, B2IST can achieve the performance of a test-per-clock scheme, but only incur the overhead of a test-per-scan scheme.
Research and Development of a Radioisotope Dose Calibrator with Background Alarm Used in Nuclear Medical Laboratories
Authors: Ali Bülent Uşaklı, Serdar Akdurak
Venue: Journal of Medical Systems (2002)

In this study, research and development of a prototype background alarm levelled radioisotope dose calibrator for nuclear medical laboratories was emphasized. The aim was to develop a standard performance, economical dose calibrator (self-made) from the ion-chamber to the microcomputer. Dose calibrators are used in nuclear medical laboratories for treatment and diagnosis purposes. The device is developed using an ion chamber filled with 2 atm pressure argon gas, 3N201 dual gate mosfet for the extremely high impedance preamplifier, an Intel 8052AH microcontroller for the microcomputer, ADC0804 for the A/D conversion, a Phillips 2 &times; 16 character display, and other components. Correction factors are used for each radioisotope after the activity measurements, that can be updated and kept in the Ni&ndash;Cd rechargeable battery-powered RAM memory. To provide safety in nuclear medical laboratories, background activity values are measured.
TR$\Re$-String: A Geometry-Based Representation for Efficient and Effective Retrieval of Images by Spatial Similarity
Authors: Venkat N. Gudivada
Venue: IEEE Transactions on Knowledge and Data Engineering (1998)

A spatial similarity algorithm assesses the degree to which the spatial relationships among the domain objects in a database image conform to those specified in the query image. In this paper, we propose a geometry-based structure for representing the spatial relationships in the images and an associated spatial similarity algorithm. The proposed algorithm recognizes both translation, scale, and rotation variants of an image, and variants of the image generated by an arbitrary composition of translation, scale, and rotation transformations. The algorithm has ¿(n log n) time complexity in terms of the number of objects common to the database and query images. The retrieval effectiveness of the proposed algorithm is evaluated using the TESSA image collection.
Graphical Programming Using UML and SDL
Authors: Morgan Björkander
Venue: Computer (2000)

Since its introduction a few years ago, the Unified Modeling Language (UML) has captured industrywide attention as a general-purpose language for modeling software systems. Although it does a good job in the early-phase development process, UML does leave some things to be desired in the systems design and implementation phases because it is lacking in structural and behavioral constructs. The author proposes a merger between UML and the Specification and Description Language (SDL) that would enhance UML's usefulness as a graphical programming language.SDL, a language that models the architecture and behavior of event-driven, distributed systems in real-time environments, originated as a specification language within the telecommunications industry approximately 20 years ago. Today, SDL is often used as a full blown programming language. Although UML is headed in a similar direction, combining the two languages provides a modeling paradigm for visual software engineering that is more robust and effective than either language alone.
An integrated, dual learner for grammars and ontologies
Authors: Udo Hahn, Kornél G. Markó
Venue: Data Knowledge Engineering (2002)

We introduce a dual-use methodology for automating the maintenance and growth of two types of knowledge sources, which are crucial for natural language text understanding-background knowledge of the underlying domain and linguistic knowledge about the lexicon and the grammar of the underlying natural language. A particularity of this approach is that learning occurs simultaneously with the on-going text understanding process. The knowledge assimilation process is centered around the linguistic and conceptual 'quality' of various forms of evidence underlying the generation, assessment and on-going refinement of lexical and concept hypotheses. On the basis of the strength of evidence, hypotheses are ranked according to qualitative plausibility criteria, and the most reasonable ones are selected for assimilation into the already given lexical class hierarchy and domain ontology.
DSISoft: a MATLAB VSP data processing package
Authors: K. S. Beaty, G. Perron, I. Kay, E. Adam
Venue: Computers Geosciences (2002)

DSISoft is a public domain vertical seismic profile processing software package developed at the Geological Survey of Canada. DSISoft runs under MATLAB version 5.0 and above and hence is portable between computer operating systems supported by MATLAB (i.e. Unix, Windows, Macintosh, Linux). The package includes processing modules for reading and writing various standard seismic data formats, performing data editing, sorting, filtering, and other basic processing modules. The processing sequence can be scripted allowing batch processing and easy documentation. A structured format has been developed to ensure future additions to the package are compatible with existing modules. Interactive modules have been created using MATLAB's graphical user interface builder for displaying seismic data, picking first break times, examining frequency spectra, doing f-k filtering, and plotting the trace header information. DSISoft modular design facilitates the incorporation of new processing algorithms as they are developed. This paper gives an overview of the scope of the software and serves as a guide for the addition of new modules.
The Quantization Property of Probability Distributions of the Characteristics of Dynamic Systems Observed in the Presence of Random Disturbances
Authors: V. F. Krotov
Venue: Automation and Remote Control (2003)

The class of linear stochastic dynamic systems is defined, such that the laws of the probability distribution of values of output signals of a system are determined by its equations complying with the case of the absence of random disturbances. These distribution laws are found to be similar to the quantum laws of the distribution values of observable physical quantities. On this basis, a possibility of the definition of the quantum systems as systems of this class is investigated. It is shown that the theoretical proof of some axioms of quantum mechanics and new facts requiring the experimental verification follow from this definition.
Rinda: A Relational Database Processor with Hardware Specialized for Searching and Sorting
Authors: Ushio Inoue, Tetsuji Satoh, Haruo Hayami, Hideaki Takeda, Toshio Nakamura, Hideki Fukuoka
Venue: IEEE Micro (1991)

Rinda, a database processor that accelerates nonindexed relational database queries, is described. Rinda is composed of content search processors and relational operational accelerating processors; the former, search rows stored in disk storage, and the latter sort rows stored in the main memory. The processors connect to a general-purpose host computer with channel interfaces. Performance results show that Rinda executes queries three to 100 times faster then conventional database-management system software in a benchmark system.
The impact of 'phase' measurement on waiting time jitter simulations
Authors: Saman S. Abeysekera, Antonio Cantoni
Venue: Signal Processing (2002)

Clock rate adaptation is usually used in synchronizing different data streams in digital networks. Although, clock rate adaptation provides timing transparency for various data tributaries, it inherently produces a low-frequency timing jitter which is known as the waiting time jitter. The properties of waiting time jitter are discussed in detail in this paper. In particular, a basis for the analysis, simulation and modelling of the waiting time jitter is provided by clearly identifying the necessary approximations. An accurate simulation model of the synchronizer that is suitable for studying the waiting time jitter is developed. The developed model is used to provide an assessment of the performance of popular 'threshold modulation' type jitter reduction techniques.
Data Management Issues and Trade-Offs in CSCW Systems
Authors: Atul Prakash, Hyong Sop Shim, Jang Ho Lee
Venue: IEEE Transactions on Knowledge and Data Engineering (1999)

Substantial interest has developed in recent years in building computer systems that support cooperative work among groups without the need for physical proximity. This paper examines some of the difficult data management issues in designing systems for computer-supported cooperative work (CSCW). Specifically, we consider an example CSCW system to support large-scale team science over the Internet, Collaboratory Builder's Environment; we discuss the issues of managing shared data in such systems, reducing information overload, and providing group awareness and access control. We discuss several promising approaches to these issues. We point out where a significant gap remains in addressing the requirements of such systems and where designers have to make design trade-offs that can be difficult to evaluate. Finally, we discuss several open issues for future work.
Efficient Mapping of ANNs on Hypercube Massively Parallel Machines
Authors: Magdy A. Bayoumi, Q. m. Malluhi, T. r. n. Rao
Venue: IEEE Transactions on Computers (1995)

This paper presents a technique for mapping artificial neural networks (ANNs) on hypercube massively parallel machines. The paper starts by synthesizing a parallel structure, the mesh-of-appendixed-trees (MAT), for fast ANN implementation. Then, it presents a recursive procedure to embed the MAT structure into the hypercube topology. This procedure is used as the basis for an efficient mapping of ANN computations on hypercube systems. Both the multilayer feedforward with backpropagation (FFBP) and the Hopfield ANN models are considered. Algorithms to implement the recall and the training phases of the FFBP model as well as the recall phase of the Hopfield model are provided. The major advantage of our technique is high performance. Unlike the other techniques presented in the literature which require O(n) time, where N is the size of the largest layer, our implementation requires only O(log N) time. Moreover, it allows pipelining of more than one input pattern and thus further improves the performance.
Logic Programming with Arrays
Authors: J. I. Glasgow, M. A. Jenkins, E. Blevis, M. P. Féret
Venue: IEEE Transactions on Knowledge and Data Engineering (1991)

Nial is a programming language designed around a mathematical treatment of data as nested arrays. A goal of the research described is to integrate within Nial a functional style of programming based on the theory of arrays with the declarative capabilities of a logic programming environment. This is partially accomplished by storing logic clauses as arrays which can be manipulated using logic clauses. Arrays as terms are considered as part of the syntax of the clauses. The approach to logic programming is based on providing a flexible environment for experimenting with full clausal or Horn clause logic. A variety of predefined control strategies and the capability for user-defined control strategies have been provided. The expressive capabilities of combining logic and functional programming styles provides a suitable language for many application areas. The philosophy and design behind a combined logic/database model used to prototype a knowledge-based systems application are described.
Visual Reference for the Internet
Authors: Diana Rain
Venue:  (1997)

:This book details the 100 most important and common features of Internet use, covering common tasks in Microsoft Explorer, Netscape Navigator, and America Online. Each function is presented graphically, with illustrations of relevant dialog boxes and icons. This is the perfect desk companion for Internet surfing--ideal for home, school, or work.
The Performance of Crossbar-Based Binary Hypercubes
Authors: Bernard L. Menezes, Frank T. Hady
Venue: IEEE Transactions on Computers (1995)

Wormhole routing is an attractive routing technique offering low latency communication without the need to buffer an entire packet in a single node. A new queueing-theoretic model for obtaining throughput and latency of binary hypercubes supporting wormhole routing is developed here. The model is very accurate in predicting the performance of an actual multicomputer over a range of network sizes, packet lengths, and input port priority mappings. Utilizing the model, the performance of networks with identical topologies but different node architectures is estimated.
High-Level Petri Net Model of Logic Program with Negation
Authors: L. Li
Venue: IEEE Transactions on Knowledge and Data Engineering (1994)

The formalism of nonmonotonic reasoning has been integrated into logic programming to define semantics for logic program with negation. Because a Petri net provides a uniform model for both the logic of knowledge and the control of inference, the class of high-level Petri nets called predicate/transition nets (PrT-nets) has been employed to study production rule based expert systems and Horn clause logic programs. We show that a PrT-net can implement the nonmonotonicity associated with a logic program with negation as well as the monotonicity of Horn clause logic program. In particular, we define a semantics for a normal logic program and implement it with PrT-net. We demonstrate that in the presence of inconsistency in a normal logic program, the semantics still works well by deducing meaningful answers. The variations and potential applications of the PrT-net are also addressed.
Temporal Triggers in Active Databases
Authors: A. Prasad Sistla, Ouri Wolfson
Venue: IEEE Transactions on Knowledge and Data Engineering (1995)

In this paper we propose two languages, called Future Temporal Logic (FTL) and Past Temporal Logic (PTL), for specifying temporal triggers. Some examples of trigger conditions that can be specified in our language are the following: ¿The value of a certain attribute increases by more than 10% in 10 minutes,¿¿A tuple that satisfies a certain predicate is added to the database at least 10 minutes before another tuple, satisfying a different condition, is added to the database.¿ Such triggers are important for monitor and control applications.In addition to the languages, we present algorithms for processing the trigger conditions specified in these languages, namely, procedures for determining when the trigger conditions are satisfied. These methods can be added as a ¿temporal¿ component to an existing database management systems. A preliminary prototype of the temporal component that uses the FTL language has been built on top of Sybase running on SUN workstations.
A Processor-Time-Minimal Systolic Array for Cubical Mesh Algorithms
Authors: P. Cappello
Venue: IEEE Transactions on Parallel and Distributed Systems (1992)

Using a directed acyclic graph (DAG) model of algorithms, the paper focuses ontime-minimal multiprocessor schedules that use as few processors as possible. Such a processor-time-minimal scheduling of an algorithm's DAG first is illustrated using a triangular shaped 2-D directed mesh (representing, for example, an algorithm for solving a triangular system of linear equations). Then, algorithms represented by an n*n*n directed mesh are investigated. This cubical directed mesh is fundamental; it represents the standard algorithm for computing matrix product as well as many other algorithms. Completion of the cubical mesh required 3n-2 steps. It is shown that the number of processing elements needed to achieve this time bound is at least (3n/sup 2/4/). Asystolic array for the cubical directed mesh is then presented. It completes the mesh using the minimum number of steps and exactly (3n/sup 2/4/) processing elements it is processor-time-minimal. The systolic array's topology is that of a hexagonally shaped, cylindrically connected, 2-D directed mesh.
Relative Fuzzy Connectedness and Object Definition: Theory, Algorithms, and Applications in Image Segmentation
Authors: Jayaram K. Udupa, Punam K. Saha, Roberto A. Lotufo
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2002)

The notion of fuzzy connectedness captures the idea of "hanging-togetherness" of image elements in an object by assigning a strength of connectedness to every possible path between every possible pair of image elements. This concept leads to powerful image segmentation algorithms based on dynamic programming whose effectiveness has been demonstrated on 1,000s of images in a variety of applications. In the previous framework, a fuzzy connected object is defined with a threshold on the strength of connectedness. In this paper, we introduce the notion of relative connectedness that overcomes the need for a threshold and that leads to more effective segmentations. The central idea is that an object gets defined in an image because of the presence of other co-objects. Each object is initialized by a seed element. An image element c is considered to belong to that object with respect to whose reference image element c has the highest strength of connectedness. In this fashion, objects compete among each other utilizing fuzzy connectedness to grab membership of image elements. We present a theoretical and algorithmic framework for defining objects via relative connectedness and demonstrate utilizing the theory that the objects defined are independent of reference elements chosen as long as they are not in the fuzzy boundary between objects. An iterative strategy is also introduced wherein the strongest relative connected core parts are first defined and iteratively relaxed to conservatively capture the more fuzzy parts subsequently. Examples from medical imaging are presented to illustrate visually the effectiveness of relative fuzzy connectedness. A quantitative mathematical phantom study involving 160 images is conducted to demonstrate objectively the effectiveness of relative fuzzy connectedness.
A Parallel Asynchronous Garbage Collection Algorithm for Distributed Systems
Authors: N. Bagherzadeh, S. -l. Heng, C. -l. Wu
Venue: IEEE Transactions on Knowledge and Data Engineering (1991)

The problem of distributed garbage collection is discussed. An algorithm for parallel distributed asynchronous garbage collection is presented. The liveness and safety properties of this method are demonstrated. The algorithm does not require a global clock, complex termination detection methods, or distributed synchronization techniques. A new color code is introduced to distinguish between local cells (black) and those that are exclusively accessible from the remote pointers (gray). The mutator operation is revised to handle a multiple mutator scheme on a given local memory. Simulation results show that the developed distributed and parallel algorithm performs much better than the sequential method as tested on a Balance 8000 computer.
Alternative Strategies for Improving the Fairness in and an Analytical Model of the DQDB Network
Authors: B. Mukherjee, S. Banerjee
Venue: IEEE Transactions on Computers (1993)

The unfairness problem of the distributed queue dual bus (DQDB) (IEEE Std 802.6) network is addressed, and several alternative solutions that can improve the network's fairness are proposed. Implementation methods that require simple additional hardware on top of the regular DQDB interface are outlined. Simulation examples are employed to compare the performance of the schemes and to gain insight into their characteristics. The performance is also compared with that of the original DQDB and the bandwidth-balancing DQDB. An analytical model of the DQDB network is developed. Some constrained assumptions for analytical tractability are used to obtain a Markov chain model for (an earlier version of) the entire DQDB network, the corresponding state-space explosion problem is highlighted. For reasonably small systems, the analytical model can predict an individual station's throughput and mean segment delay for known (possibly asymmetric) loading patterns. The model is verified via simulation.