ppxscal/embedding_network huggingface dataset:
Spatio-Temporal Predicates
Authors: Martin Erwig, Markus Schneider
Venue: IEEE Transactions on Knowledge and Data Engineering (2002)

This paper investigates temporal changes of topological relationships and thereby integrates two important research areas: First, two-dimensional topological relationships that have been investigated quite intensively and, second, the change of spatial information over time. We investigate spatio-temporal predicates, which describe developments of well-known spatial topological relationships. A framework is developed in which spatio-temporal predicates can be obtained by temporal aggregation of elementary spatial predicates and sequential composition. We compare our framework with two other possible approaches: one is based on the observation that spatio-temporal objects correspond to three-dimensional spatial objects for which existing topological predicates can be exploited. The other approach is to consider possible transitions between spatial configurations. These considerations help to identify a canonical set of spatio-temporal predicates.
Arachne: A Portable Threads System Supporting Migrant Threads on Heterogeneous Network Farms
Authors: Bozhidar Dimitrov, Vernon Rego
Venue: IEEE Transactions on Parallel and Distributed Systems (1998)

We present the design and implementation of Arachne, a threads system that can be interfaced with a communications library for multithreaded distributed computations. In particular, Arachne supports thread migration between heterogeneous platforms, dynamic stack size management, and recursive thread functions. Arachne is efficient, flexible, and portable¿it is based entirely on C and C++.To facilitate heterogeneous thread operations, we have added three keywords to the C++ language. The Arachne preprocessor takes as input code written in that language and outputs C++ code suitable for compilation with a conventional C++ compiler. The Arachne runtime system manages all threads during program execution. We present some performance measurements on the costs of basic thread operations and thread migration in Arachne and compare these to costs in other threads systems.
Performance Modeling Using PDL
Authors: Ranga Vemuri, Ram Mandayam, Vijay Meduri
Venue: Computer (1996)

PDL (performance description language) is a high-level performance modeling language that offers a way to generate valuable design analysis data. Designers can write generic performance models in PDL and, for specific designs, compile them into executable versions. The PDL system can then process performance data and generate detailed graphs that can be used for analysis. PDL theory is embedded into designer-friendly language constructs to permit succinct and readable performance models. And because the PDL evaluator supports incremental attribute evaluation, the performance models can be partially evaluated. PDL is a step toward further development of robust general-purpose environments for performance modeling and evaluation.
Internet Blue Pages: The Guide to Federal Government Web Sites, 1st edition
Authors: Laura Andriot
Venue:  (1999)

:Organized by agency in the government manual style that libraries prefer, this guide features comprehensive entries that include the function or purpose of that agency, URLs, and links from agency home pages. The alphabetically listed entries are numbered and fully indexed to allow readers to find federal government Web sites quickly and easily.
A Generic Reification Technique for Object-Oriented Reflective Languages
Authors: Rémi Douence, Mario Südholt
Venue: Higher-Order and Symbolic Computation (2001)

Computational reflection is gaining interest in practical applications as witnessed by the use of reflection in the Java programming environment and recent work on reflective middleware. Reflective systems offer many different reflection programming interfaces, the so-called Meta-Object Protocols (MOPs). Their design is subject to a number of constraints relating to, among others, expressive power, efficiency and security properties. Since these constraints are different from one application to another, it would be desirable to easily provide specially-tailored MOPs.In this paper, we present a generic reification technique based on program transformation. It enables the selective reification of arbitrary parts of object-oriented meta-circular interpreters. The reification process is of fine granularity: individual objects of the run-time system can be reified independently. Furthermore, the program transformation can be applied to different interpreter definitions. Each resulting reflective implementation provides a different MOP directly derived from the original interpreter definition.
Analysis of Application of the IDDQ Technique to the Deep Sub-Micron VLSI Testing
Authors: Chih-Wen Lu, Chung Len Lee, Chauchin Su, Jwu-E Chen
Venue: Journal of Electronic Testing: Theory and Applications (2002)

In this work, IDDQ current for the deep sub-micron VLSI in year 2011 is estimated with a statistical approach according to the International Technology Roadmap for Semiconductors 1999 Edition considering process variations and different input vectors. The estimated results show that the standard deviation of the IDDQ current is proportional to the square root of the circuit size and the IDDQ currents of the defect-free and the defective devices, which are of the size up to 1 &times; 107 gates, are still differentiable under the condition of random process deviations and input vectors. Two new IDDQ testing schemes, which detect the defective current based on the two separate IDDQ distributions, are proposed. From the study, it is concluded that IDDQ testing is still applicable for the deep sub-micron VLSI for the next ten years.
Official NetScape Navigator 4, 2nd edition
Authors: Phil James, R. Allen Wyke
Venue:  (1997)

:Readers will learn Intranet, extranet, and Internet technologies. Includes sections on Navigator 4 installation, interface, customization, and basic browsing. Shows how to view graphics, sound, and video. Shows how to customize the browser and add shortcuts and bookmarks. Provides step-by-step instructions for intranet, extranet, and Internet tasks. Explains the Netcaster interface and "pushed" channels. Covers dozens of the most innovative and informative sites on the Web. Navigator 4 (standalone version, which includes Netcaster). AT&T WorldNet Service software. HTML version of the Internet listings for easy access.
Divisor matrices and magic sequences
Authors: R. H. Jeurissen
Venue: Discrete Mathematics (2002)

Yuster (Arithmetic progressions with constant weight, Discrete Math. 224 (2000) 225-237) defines divisor matrices and uses them to derive results on "magic" sequences, i.e. finite sequences a1,a2,...,an with the property that for a certain k all sums Σj=1k aij with i1,i2....,ik an arithmetic subsequence of 1,2,...,n, are equal. An important condition is the (conjectured) non-singularity of the elementary divisor matrices Ak, that could only be proved for k with at most two prime divisors. We present a proof for general k, thereby generalizing the results in Yuster [1] (Arithmetic progressions with constant weight, Discrete Math., to appear.). Our exploration of Ak also leads to new proofs, and enables us to add other results, in particular we give the dimension of the space of k-magic sequences of length n for every k and n and over every field.
PM: A System to Support the Automatic Acquisition of Programming Knowledge
Authors: R. G. Reynolds, J. I. Maletic, S. E. Porvin
Venue: IEEE Transactions on Knowledge and Data Engineering (1990)

A system called partial metrics (PM) which utilizes chunking as a model for acquiring knowledge about program implementation is described. The chunking paradigm has three phases. The first phase partitions the object to be chunked into relatively independent parts called aggregates. The objects to be chunked in PM are code modules. Modules are separated into a collection of aggregates based on a model of stepwise refinement. A heuristic that generates a hierarchically structured collection of refinement steps describing how the program could have been developed as a set of independent refinement decisions (object-oriented stepwise implementation) is given. The second phase encodes (abstracts) each of the aggregates. Various techniques for symbolic learning can be applied to produce a frame-based encoding of information present in the code. This abstraction contains information about the aggregate's role in the refinement process as well as the code's functionality. The third phase inserts the chunked aggregate into a hierarchically structured library of cases based on the contents of its frame description. The storage of an aggregate enables its future use in problem-solving activities. An example of how this approach can be used to acquire knowledge from a sort module is described.
Embedding of Cycles in Arrangement Graphs
Authors: K. Day, A. Tripathi
Venue: IEEE Transactions on Computers (1993)

Arrangement graphs have been proposed as an attractive interconnection topology for large multiprocessor systems. The authors study these graphs by proving the existence of Hamiltonian cycles in any arrangement graph. They also prove that an arrangement graph contains cycles of all lengths ranging between 3 and the size of the graph. They show that an arrangement graph can be decomposed into node disjoint cycles in many different ways.
Temporal Semantic Assumptions and Their Use in Databases
Authors: Claudio Bettini, X. Sean Wang, Sushil Jajodia
Venue: IEEE Transactions on Knowledge and Data Engineering (1998)

Data explicitly stored in a temporal database are often associated with certain semantic assumptions. Each assumption can be viewed as a way of deriving implicit information from explicitly stored data. Rather than leaving the task of deriving (possibly infinite) implicit data to application programs, as is the case currently, it is desirable that this be handled by the database management system. To achieve this, this paper formalizes and studies two types of semantic assumptions: point-based and interval-based. The point-based assumptions include those assumptions that use interpolation methods over values at different time instants, while the interval-based assumptions include those that involve the conversion of values across different time granularities. The paper presents techniques on: 1) how assumptions on specific sets of attributes can be automatically derived from the specification of interpolation and conversion functions, and 2) given the representation of assumptions, how a user query can be converted into a system query such that the answer of this system query over the explicit data is the same as that of the user query over the explicit and the implicit data. To precisely illustrate concepts and algorithms, the paper uses a logic-based abstract query language. The paper also shows how the same concepts can be applied to concrete temporal query languages.
Data Sonification: Do You See What I Hear?
Authors: Tara M. Madhyastha, Daniel A. Reed
Venue: IEEE Software (1995)

Using sound to complement graphics and to present data is becoming increasingly popular. Sound can potentially reveal patterns and anomalies in data that are difficult to perceive visually. Moreover, psychological studies show that some types of data are more quickly assimilated when presented with sound; an audio alarm is the classic example. Unfortunately, the lack of standards governing the software interface to sound hardware, as well as the diversity of sound hardware, make it difficult to portably integrate mappings of data to sound ( sonifications ) with existing data visualization tools. This paper describes the design of a sonification toolkit, Porsonify, created to simplify this task.
Object Technology: A Virtual Roundtable
Authors: Hesham El-Rewini, Scott Hamilton
Venue: Computer (1995)

Software development is a difficult and time-consuming process. As software systems become larger and ever more complex, developers are searching for mechanisms to control that complexity. The main goals have always been to lower the cost and improve productivity, reuse, and maintainability. The procedure-oriented paradigm and structured programming were popular for a while, and their fundamentals may still be valid. Today, however, OO is being heralded by many as one promising solution. This roundtable contains an assortment of short articles from both industry and academia on aspects of object orientation: distributed objects in the client-server environment, standardization efforts to ensure cross-platform interoperability, object technology and parallel computing, object-oriented databases, the problems inherent in OO testing, and, finally, the theoretical foundations of object-based programming.
Myrinet: A Gigabit-per-Second Local Area Network
Authors: Nanette J. Boden, Danny Cohen, Robert E. Felderman, Alan E. Kulawik, Charles L. Seitz, Jakov N. Seizovic, Wen-King Su
Venue: IEEE Micro (1995)

Myrinet is a new type of local-area network (LAN) based on the technology used for packet communication and switching within "massively-parallel processors" (MPPs). Think of Myrinet as an MPP message-passing network that can span campus dimensions, rather than as a wide-area telecommunications network that is operating in close quarters. The technical steps toward making Myrinet a reality included the development of (1) robust, 25m communication channels with flow control, packet framing, and error control; (2) self-initializing, low-latency, cut-through switches; (3) host interfaces that can map the network, select routes, and translate from network addresses to routes, as well as handle packet traffic; and (4) streamlined host software that allows direct communication between user processes and the network.
Is Object Technology Software's Industrial Platform?
Authors: Ivar Jacobson
Venue: IEEE Software (1993)

The past, present, and future of object-oriented software technology are discussed. The current beamless modeling of object-oriented systems and language choices are renewed. Future architecture development, development processes, legacy systems, and languages are described.
A Top-Down Processor Allocation Scheme for Hypercube Computers
Authors: J. Kim, C. R. Das, W. Lin
Venue: IEEE Transactions on Parallel and Distributed Systems (1991)

An efficient processor allocation policy is presented for hypercube computers. The allocation policy is called free list since it maintains a list of free subcubes available in the system. An incoming request of dimension k (2/sup k/ nodes) is allocated by finding a free subcube of dimension k or by decomposing an available subcube of dimension greater than k. This free list policy uses a top-down allocation rule in contrast to the bottom-up approach used by the previous bit-map allocation algorithms. This allocation scheme is compared to the buddy, gray code (GC), and modified buddy allocation policies reported for the hypercubes. It is shown that the free list policy is optimal in a static environment, as are the other policies, and it also gives better subcube recognition ability compared to the previous schemes in a dynamic environment. The performance of this policy, in terms of parameters such as average delay, system utilization, and time complexity, is compared to the other schemes to demonstrate its effectiveness. The extension of the algorithm for parallel implementation, noncubic allocation, and inclusion/exclusion allocation is also given.
Mobile Commerce: A New Frontier
Authors: Upkar Varshney, Ronald J. Vetter, Ravi Kalakota
Venue: Computer (2000)

Electronic commerce continues to see phenomenal growth, but so far most e-commerce development involves wired infrastructures. The authors believe emerging wireless and mobile networks will provide new avenues for growth, creating new opportunities in mobile commerce. According to the GartnerGroup, a market research firm, by 2004 at least 40 percent of consumer-to-business e-commerce will come from smart phones using the wireless application protocol (WAP). Based on a study by the Wireless Data and Computing Service, a division of Strategy Analytics, the annual mobile commerce market may rise to $200 billion by 2004. The authors provide a mobile commerce framework to illustrate potential applications such as mobile inventory management, product location and search, proactive service management, and mobile entertainment. They also describe the wireless user and networking infrastructure, emerging W3C standards, and the open and global WAP specification.
Extendible look-up table of twiddle factors and radix-8 based fast Fourier transform
Authors: Qing Li, Nengchao Wang, Baochang Shi, Chuguang Zheng
Venue: Signal Processing (2002)

An extendible look-up table of the twiddle factors for implementation of fast Fourier transform (FFT) is introduced in this paper. In fact, this twiddle factors table is independent of the length of sequence. It need not be recomputed for shorter sequences. And for longer sequences, the table can be extended easily. A radix-8 based FFT algorithm for 2m-FFT with this table is presented. Experimental comparisons between our algorithm and FFTW software package have be done. And the results indicate that our FFT scheme is effective.
Electrical transport through poly(G)-poly(C) DNA molecules
Authors: J. S. Hwang, G. S. Lee, K. J. Kong, D. J. Ahn, S. W. Hwang, D. Ahn
Venue: Microelectronic Engineering (2002)

We report the details of the direct electrical transport through 60 base pairs of poly(G)-poly(C) DNA molecules between two electrodes with nanometer spacings. An almost monotonic increase in the current is observed from the sample with the gap of 30 µm and with a DNA solution droplet. The I-V and the dI/dV-V measured from various samples with the electrode gap ranging from 20 to 100 nm at different conditions show reproducible clear staircases. The average gap value of the observed staircases is consistent with the energy gap obtained from a tight binding calculation.
Performance of the EY-NPMA Protocol
Authors: K. Fu, Y. J. Guo, S. K. Barton
Venue: Wireless Personal Communications: An International Journal (1997)

The throughput of the Elimination Yield Non-pre-emptive Priority Multiple Access (EY-NPMA) protocol, which has been chosen as the medium access control (MAC) protocol for HIPERLAN, is simulated. Connection between users is based on a statistical model of path loss with power law against distance and 6 dB log-normal shadowing. It is shown that the throughput performance of the EY-NPMA protocol in networks of moderate size and with small proportion of hidden nodes is satisfactory. For a fully connected network, the throughput reaches 0.85 at an offered traffic of 1 and remains at this level. The maximum throughput reduces gradually when the number of hidden node pairs in the network is increased. With 11% of hidden nodes in the network the peak throughput falls to 0.6.
Scalable photon splatting for global illumination
Authors: Fabien Lavignotte, Mathias Paulin
Venue: Proceedings of the 1st international conference on Computer graphics and interactive techniques in Australasia and South East Asia (2003)

In this paper, we present a new image based method for computing efficiently global illumination using graphics hardware. We propose a two pass method to compute global lighting at each pixel. In the first pass, photons are traced from the light sources and their hit points are stored. Then, in the second pass, each photons hit point is splatted on the image to reconstruct the irradiance. The main advantages of our method in comparison with previous approaches is scalability. Indeed, it can be used to obtain coarse solution as well as accurate solution and is well suited for complex scenes. First, we present the density estimation framework that is the theory behind our reconstruction pass to understand how to control the accuracy with our method. Then, we show how to use graphics hardware to improve reconstruction time with some restrictions but without losing the ability to compute an accurate simulation.
Using VHDL for Board Level Simulation
Authors: Sandi Habinc, Peter Sinander
Venue: IEEE Design Test (1996)

Prototyping is a necessity for successful development of printed circuit boards built with complex components such as microprocessors, ASICs and ASSPs. In this paper an approach to prototyping will be presented based on VHDL models for board-level simulation written for high functional accuracy and simulation performance. Recommendations for developing such models will be provided, supported by preliminary results from a novel way of measuring the cost of VHDL statements. Practical examples on how simulation performance has been improved for some models will demonstrate the importance of optimisation on the source code level. Distribution of models will be discussed, emphasizing on protection of design information and usage of modelling guidelines. Successful industry activities will be described, demonstrating the feasibility and benefits of board-level simulation for spacecraft electronics.
Development of sub-10-nm atomic layer deposition barriers for Cu/low-k interconnects
Authors: Gerald Beyer, Alessandra Satta, Jörg Schuhmacher, Karen Maex, Wim Besling, Olli Kilpela, Hessel Sprey, Georg Tempel
Venue: Microelectronic Engineering (2002)

The development of atomic layer deposition (ALD) barriers with a thickness below 10 nm for copper/low-k dielectric interconnects was reviewed. The CMOS 65-nm technology node, which is presumably the first node, at which ALD barriers will be employed, was taken as a reference. The ALD barrier process will most likely meet the geometrical requirements, i.e. the capability to deposit barrier films in narrow dimensions. In order to establish the compliance of ALD barriers with the thickness requirements, the growth of the ALD layer was investigated. It was shown that the growth of the ALD films proceeds via islands, which are formed in the nucleation step. The thickness, which is necessary to close the surface of the substrate, depends on process conditions and barrier material. It is argued that the minimum barrier thickness should be at least of the same order as the thickness to achieve closure. In the 65-nm technology node barriers have to be compatible with low-k dielectric materials. To achieve growth of ALD barriers on dense low-k materials, surface treatments of the dielectric films have to be implemented. The deposition of ALD films on dielectric materials with an interconnected pore structure results in penetration of the ALD precursors into the pore system and deposition of the barrier inside the dielectric material.
Supporting Dynamic Interactions among Web-Based Information Sources
Authors: Athman Bouguettaya, Boualem Benatallah, Lily Hendra, Mourad Ouzzani, James Beard
Venue: IEEE Transactions on Knowledge and Data Engineering (2000)

The ubiquity of the World Wide Web offers an ideal opportunity for the deployment of highly distributed applications. Now that connectivity is no longer an issue, the attention has turned to providing a middleware infrastructure that will sustain data sharing among Web-accessible databases. We present a dynamic architecture and system for describing, locating, and accessing data from Web-accessible databases. We propose the use of flexible organizational constructs service links and coalitions to facilitate data organization, discovery, and sharing among Internet-accessible databases. A language is also proposed to support the definition and manipulation of these constructs. The implementation combines Java, CORBA, database API (JDBC), agent, and database technologies to support a scalable and portable architecture interconnecting large networks of heterogeneous and autonomous databases. We report on an experiment to provide uniform access to a Web of healthcare-related databases.