ppxscal/embedding_network huggingface dataset:
Wide-Band UHF Radio Propagation Characteristics in a Tunnel Environment
Authors: Y. P. Zhang, Y. Hwang, P. C. Ching
Venue: Wireless Personal Communications: An International Journal (1998)

This paper presents the measured wide-band characteristics of 900 and 1800 MHz band radio propagation channels in a tunnel environment for microcellular and personal communications. The measurements were made using the swept frequency technique. The analysis of the average measured power delay profiles reveals that the rms time delay spread is less than 25 ns when the tunnel is empty and can be as large as 103 ns when the tunnel is blocked by vehicles.
Statistical Shape Features for Content-Based Image Retrieval
Authors: Sami Brandt, Jorma Laaksonen, Erkki Oja
Venue: Journal of Mathematical Imaging and Vision (2002)

In this article the use of statistical, low-level shape features in content-based image retrieval is studied. The emphasis is on such techniques which do not demand object segmentation. PicSOM, the image retrieval system used in the experiments, requires that features are represented by constant-sized feature vectors for which the Euclidean distance can be used as a similarity measure. The shape features suggested here are edge histograms and Fourier-transform-based features computed from the image after edge detection in Cartesian or polar coordinate planes. The results show that both local and global shape features are important clues of shapes in an image.
The design and optimization of SOC test solutions
Authors: Erik Larsson, Zebo Peng, Gunnar Carlsson
Venue: Proceedings of the 2001 IEEE/ACM international conference on Computer-aided design (2001)

We propose an integrated technique for extensive optimization of the final test solution for System-on-Chip using Simulated Annealing. The produced results from the technique are a minimized test schedule fulfilling test conflicts under test power constraints and an optimized design of the test access mechanism. We have implemented the proposed algorithm and performed experiments with several benchmarks and industrial designs to show the usefulness and efficiency of our technique.
A Knowledge Model For Unifying Deductive and Non-Deductive Heterogeneous Databases
Authors: Linda Sirounian, William I. Grosky
Venue: IEEE Transactions on Knowledge and Data Engineering (1995)

A new, much-needed knowledge model for integrating heterogeneous knowledge represented by independently developed deductive rules and diverse data models has been developed and is shown here. It has the strength and expressiveness necessary to unify seemingly disparate, autonomous components. Separate components, including rules, are modeled as functional units. A complete set of relationships, or links, between units based on domain interdependencies is defined, along with a set of integration operators. This approach resolves the unique and complex forms of conflict that arise from integrating deductive rules from autonomous sources, such as conflicts in meaning, redundancies and subsumption. This model has significant application to the creation of a common representation for future shared environments.
Duality and well behavior of nonconvex functions
Authors: S. Guillaume
Venue: Journal of Optimization Theory and Applications (2002)

This article is devoted to the study of optimization problems involving a convex composite function, that is, the composition of a convex function with a mapping. We introduce the definitions of conjugate functions and associated subdifferentials which suit this particular structure. We use these definitions to study the conditioning, well-posedness, and well behavior of such functions.
The Banyan-Hypercube Networks
Authors: A. S. Youssef, B. Narahari
Venue: IEEE Transactions on Parallel and Distributed Systems (1990)

The authors introduce a family of networks that are a synthesis of banyans and hypercubes and are called the banyan-hypercubes (BH). They combine the advantageous features of banyans and hypercubes and thus have better communication capabilities.The networks can be viewed as consisting of interconnecting hypercubes. It is shown that many hypercube features can be incorporated into BHs with regard to routing, embedding of rings and meshes, and partitioning, and that improvements over the hypercube result are made. In particular, it is shown that BHs have better diameters and average distances than hypercubes, and they embed pyramids and multiple pyramids with dilation cost 1. An optimal routing algorithm for BHs and an efficient partitioning strategy are presented.
KINKFOLD: an AutoLISP program for construction of geological cross-sections using borehole image data
Authors: Sait Ismail Özkaya
Venue: Computers Geosciences (2002)

KINKFOLD is an AutoLISP program designed to construct geological cross-sections from borehole image or dip meter logs. The program uses the kink-fold method for cross-section construction. Beds are folded around hinge lines as angle bisectors so that bedding thickness remains unchanged. KINKFOLD may be used to model a wide variety of parallel fold structures, including overturned and faulted folds, and folds truncated by unconformities. The program accepts data from vertical or inclined boreholes. The KINKFOLD program cannot be used to model fault drag, growth folds, inversion structures or disharmonic folds where the bed thickness changes either because of deformation or deposition. Faulted structures and similar folds can be modelled by KINKFOLD by omitting dip measurements within fault drag zones and near axial planes of similar folds.
An Approach of Implementing General Learning Companions for Problem Solving
Authors: Chih-Yueh Chou, Tak-Wai Chan, Chi-Jen Lin
Venue: IEEE Transactions on Knowledge and Data Engineering (2002)

Adding a learning companion, a computer simulated social agent, to a computer based learning system can enhance its educational value by enriching the way in which the computer and the user interact. This paper presents a novel simulation approach, named General Companion Modeling (referred to hereinafter as GCM), to implement learning companions in a general problem-solving domain. DwestAgent, a learning companion system, is also implemented using the GCM approach to demonstrate the feasibility of the proposed approach. In addition, the approach can help developers of learning companions clarify implementation issues and requirements involved in simulating 1) domain competencies, 2) learning competencies, 3) behaviors as a peer tutor, and 4)behaviors as a peer tutee of a learning companion. Using GCM, one can simulate learning companions with various characteristics by adjusting parameters within the proposed simulation framework.
Printed Embedded Data Graphical User Interfaces
Authors: David L. Hecht
Venue: Computer (2001)

Printed embedded data graphical user interfaces (PEDGUIs) generalize the interaction domain to images and objects to enable interaction with passive objects and active displays throughout user environ-ments. Embedded data helps establish the selection location, gesture, and identity or context of the chosen substrate and links to other resources.A key element for PEDGUI systems is imprinting machine-readable encoding and elec-tronic capture of images containing the embedded data for machine interpretation of user interaction.Work at Xerox focuses on developing embedded data technology that provides substantial data capacity and local and global spatial address capability with good aesthetics and graphical integration with line art, text, and pictorial documents in color or black and white.Embedded data technology, user-interface research, and emerging commercial developments provide a substantial foundation for novel applications inviting widespread practical use.
Comments on "Design of Fiducials for Accurate Registration Using Machine Vision"
Authors: G. Chiorboli, G. P. Vecchi
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1993)

The commenters point out that the subpixel registration accuracy improves by one order of magnitude if images are not binarized as indicated in the above said paper by Bose and Amir, but gray scale information is fully exploited in calculating the centroid position.
Fast Allocation of Processes in Distributed and Parallel Systems
Authors: C. M. Woodside, G. G. Monforton
Venue: IEEE Transactions on Parallel and Distributed Systems (1993)

MULTIFIT-COM, a static task allocator which could be incorporated into an automatedcompiler/linker/loader for distributed processing systems, is presented. The allocator usesperformance information for the processes making up the system in order to determine anappropriate mapping of tasks onto processors. It uses several heuristic extensions of theMULTIFIT bin-packing algorithm to find an allocation that will offer a high systemthroughput, taking into account the expected execution and interprocessorcommunication requirements of the software on the given hardware architecture.Throughput is evaluated by an asymptotic bound for saturated conditions and under anassumption that only processing resources are required. A set of options are proposed foreach of the allocator's major steps. An evaluation was made on 680 small randomlygenerated examples. Using all the search options, an average performance difference ofjust over 1% was obtained. Using a carefully chosen small subset of only four options, afurther degradation of just over 1.5% was obtained. The allocator is also applied to adigital signal processing system consisting of 119 tasks to illustrate its clustering and loadbalancing properties on a large system.
NREC: Risk Assessment and Planning of Complex Designs
Authors: Margarida F. Jacome, Viktor Lapinskii
Venue: IEEE Design Test (1997)

We introduce a model for nonrecurring engineering design cost estimation and discuss its implementation in the tool, NREC. NREC assists the estimation and tracking of NRE costs associated with complete product development processes, from requirements to tape out, and can be easily customized to the specifics of different design environments. Since NREC maintains a highly structured history of all projects undertaken in a particular environment, it can also assist managers in performing an individual and/or comparative assessment of design processes within a particular, possibly distributed, design environment.
An Algorithm for Exact Bounds on the Time Separation of Events in Concurrent Systems
Authors: Steven M. Burns, Henrik Hulgaard, Tod Amon, Gaetano Borriello
Venue: IEEE Transactions on Computers (1995)

Determining the time separation of events is a fundamental problem in the analysis, synthesis, and optimization of concurrent systems. Applications range from logic optimization of asynchronous digital circuits to evaluation of execution times of programs for real-time systems. We present an efficient algorithm to find exact (tight) bounds on the separation time of events in an arbitrary process graph without conditional behavior. This result is more general than the methods presented in several previously published papers as it handles cyclic graphs and yields the tightest possible bounds on event separations. The algorithm is based on a functional decomposition technique that permits the implicit evaluation of an infinitely unfolded process graph. Examples are presented that demonstrate the utility and efficiency of the solution. The algorithm will form a basis for exploration of timing-constrained synthesis techniques.
A Framework for Mapping Periodic Real-Time Applications on Multicomputers
Authors: S. P. Shukla, D. P. Agrawal
Venue: IEEE Transactions on Parallel and Distributed Systems (1994)

This short paper presents a framework for periodic execution of task-flow graphs that enables schedulability analysis of the communication requirements. The analysis performs the steps of segmenting messages, assigning the segments to specific links and time intervals, and ordering them within the intervals to generate node switching schedules that provide contention-free message routing at run-time. The analysis is also used to integrate task allocation with message routing using a contention-based objective function. Usefulness of the proposed scheme in ensuring guaranteed communication performance is demonstrated by an appropriate example.
Integrating HDL Synthesis and Partitioning for Multi-FPGA Designs
Authors: Wen-Jong Fang, Allen C. -H. Wu
Venue: IEEE Design Test (1998)

This paper presents a study on the interaction between HDL synthesis and partitioning for multi-FPGA designs with varying structural characteristics and HDL coding styles. We propose an integrated synthesis and partitioning methodology for multi-FPGA designs and demonstrate that the proper use of integrated HDL synthesis and partitioning methods is crucial to achieving high density multi-FPGA designs.
Toward Systematic Construction of Diagnostic Systems for Large Industrial Plants: Methods, Languages, and Tools
Authors: B. el Ayeb
Venue: IEEE Transactions on Knowledge and Data Engineering (1994)

We address the problem of systematically constructing diagnostic systems for large industrial plants. Toward this end, we propose an environment based on methods, languages and tools allowing systematic construction of diagnostic systems for units of large industrial plants. This environment is based on a skillful articulation of methods, languages, and tools. The process of construction proceeds in three stages as follows. Using methods, the first stage aims at structuring the unit into a set of hierarchies and graphs pointing out several views. The second stage makes use of languages to give a precise specification of the different components embedded in the unit. Finally, tools map the specifications of the unit to derive the diagnostic system.
A Systolic Algorithm for the k-Nearest Neighbors Problem
Authors: Yirng-An Chen, Youn-Long Lin, Long-Wen Chang
Venue: IEEE Transactions on Computers (1992)

The authors present a systolic algorithm and its variations for the k-nearest neighbors problem (kNNP). Multiple-shot queries with different ranges (k values) can be served in a pipelined fashion. A partitioning scheme is developed to handle large size problems. Performance of the algorithm is analyzed. Formulas for the optimal array size in terms of computation time and area-time-time product (ATT) are derived. The algorithm can solve a multiple-shot kNNP in N+2 square root N*K systolic steps using square root N*K processing elements, where N is the problem size (i.e. the number of points), and K is the sum of all k-values.
Federating Diverse Collections of Scientific Literature
Authors: Bruce Schatz, William H. Mischo, Timothy W. Cole, Joseph B. Hardin, Ann P. Bishop, Hsinchun Chen
Venue: Computer (1996)

The Digital Library Initiative (DLI) project at the University of Illinois at Urbana-Champaign is developing the information infrastructure to effectively search technical documents on the Internet. The authors are constructing a large testbed of scientific literature, evaluating its effectiveness under significant use, and researching enhanced search technology. They are building repositories (organized collections) of indexed multiple-source collections and federating (merging and mapping) them by searching the material via multiple views of a single virtual collection. Developing widely usable Web technology is also a key goal. Improving Web search beyond full-text retrieval will require using document structure in the short term and document semantics in the long term. Their testbed efforts concentrate on journal articles from the scientific literature, with structure specified by the Standard Generalized Markup Language (SGML). Research efforts extract semantics from documents using the scalable technology of concept spaces based on context frequency. They then merge these efforts with traditional library indexing to provide a single Internet interface to indexes of multiple repositories.
The sizing rules method for analog integrated circuit design
Authors: H. Graeb, S. Zizala, J. Eckmueller, K. Antreich
Venue: Proceedings of the 2001 IEEE/ACM international conference on Computer-aided design (2001)

This paper presents the sizing rules method for analog CMOS circuit design that consists of: first, the development of a hierarchical library of transistor pair groups as basic building blocks for analog CMOS circuits; second, the derivation of a hierarchical generic list of constraints that must be satisfied to guarantee the function of each block and its reliability with respect to physical effects; and third, the development of an automatic recognition of building blocks in a circuit schematic. The sizing rules method efficiently captures design knowledge on the technology-specific level of transistor pair groups. This reduces the preparatory modeling effort for analog circuit synthesis. Results of industrial applications to circuit sizing, design centering, response surface modeling and analog placement show the significance of the sizing rules method. Sizing rules especially make sure that automatic circuit sizing and design centering lead to technically meaningful and robust results.
Parallel Rule Firing in Production Systems
Authors: T. Ishida
Venue: IEEE Transactions on Knowledge and Data Engineering (1991)

To improve the performance of forward chaining production systems, a new parallel execution model in which multiple production rules are fired in parallel in each production cycle is proposed. Solutions for three major problems in parallel rule firing are provided. The first solution, interference analysis, detects cases where a parallel firing result is different from the result of any sequential firing. Based on a data dependency graph of production systems, general techniques applicable to both compile- and run-time interference analyses are proposed. The second solution, parallel firing algorithms, achieve the parallel firing on multiple processor architectures. An efficient selection algorithm is provided to select multiple rules to be fired in parallel by combining the compile- and run-time interference analysis techniques. The parallel programming environment, the third solution, provides language facilities to enable programmers to make full use of potential parallelism without considering the internal parallel mechanisms. A parallel firing simulator is also implemented to estimate the effectiveness of parallel firings of production system programs. The effectiveness of parallel rule firings on several production system applications is evaluated. Results show that the degree of concurrency can be increased by a factor of 2-9. The sources of parallelism are investigated based on the evaluation results.
The evolution of effective B-tree: page organization and techniques: a personal account
Authors: David Lomet
Venue: ACM SIGMOD Record (2001)

An under-appreciated facet of index search structures is the importance of high performance search within B-tree internal nodes. Much attention has been focused on improving node fanout, and hence minimizing the tree height [BU77, LL86]. [GG97, Lo98] have discussed the importance of B-tree page size. A recent article [GL2001] discusses internal node architecture, but the subject is buried in a single section of the paper.In this short note, I want to describe the long evolution of good internal node architecture and techniques, including an understanding of what problem was being solved during each of the incremental steps that have led to much improved node organizations.
Reconfigurability and Reliability of Systolic/Wavefront Arrays
Authors: E. H. -M. Sha, K. Steiglitz
Venue: IEEE Transactions on Computers (1993)

The authors study fault-tolerant redundant structures for maintaining reliable arrays. In particular, they assume that the desired array (application graph) is embedded in a certain class of regular, bounded-degree graphs called dynamic graphs. The degree of reconfigurability (DR) and DR with distance (DR/sup d/) of a redundant graph are defined. When DR and DR/sup d/ are independent of the size of the application graph, the graph is finitely reconfigurable (FR) and locally reconfigurable (LR), respectively. It is shown that DR provides a natural lower bound on the time complexity of any distributed reconfiguration algorithm and that there is no difference between being FR and LR on dynamic graphs. It is also shown that if both local reconfigurability and a fixed level of reliability are to be maintained, a dynamic graph must be of a dimension at least one greater than the application graph. Thus, for example, a one-dimensional systolic array cannot be embedded in a one-dimensional dynamic graph without sacrificing either reliability or locality of reconfiguration.
An experimental APL compiler for a distributed memory parallel machine
Authors: Wai Mee Ching, Alex Katz
Venue: Proceedings of the 1994 ACM/IEEE conference on Supercomputing (1994)

We developed an experimental APL compiler for the IBM SP1 distributed memory parallel machine. It accepts classical APL programs, without additional directives, and generates parallelized C code for execution on the SP1 machine. The compiler exploits data parallelism in APL programs based on parallel high level primitives. Program variables are either replicated or partitioned. We also present performance data for five moderate size programs running on the SP1.
Scalable parallel formulations of the barnes-hut method for n-body simulations
Authors: Ananth Y. Grama, Vipin Kumar, Ahmed Sameh
Venue: Proceedings of the 1994 ACM/IEEE conference on Supercomputing (1994)

In this paper, we present two new parallel formulations of the Barnes-Hut method. These parallel formulations are especially suited for simulations with irregular particle densities. We first present a parallel formulation that uses a static partitioning of the domain and assignment of subdomains to processors. We demonstrate that this scheme delivers acceptable load balance, and coupled with two collective communication operations, it yields good performance. We present a second parallel formulation which combines static decomposition of the domain with an assignment of subdomains to processors based on Morton ordering. This alleviates the load imbalance inherent in the first scheme. The second parallel formulation is inspired by two currently best known parallel algorithms for the Barnes-Hut method. We present an experimental evaluation of these schemes on a 256 processor nCUBE2 parallel computer for an astrophysical simulation.
Query Languages for Sequence Databases: Termination and Complexity
Authors: Giansalvatore Mecca, Anthony J. Bonner
Venue: IEEE Transactions on Knowledge and Data Engineering (2001)

This paper develops a query language for sequence databases, such as genome databases and text databases. Unlike relational data, queries over sequential data can easily produce infinite answer sets since the universe of sequences is infinite, even for a finite alphabet. The challenge is to develop query languages that are both highly expressive and finite. This paper develops such a language as a subset of a logic for string databases called Sequence Datalog. The main idea is to use safe recursion to control and limit unsafe recursion. The main results are the definition of a finite form of recursion, called domain-bounded recursion, and a characterization of its complexity and expressive power. Although finite, the resulting class of programs is highly expressive since its data complexity is complete for the elementary functions.