ppxscal/embedding_network huggingface dataset:
Optimal Orientations of Annular Networks
Authors: Bermond Jean-Claude, Bond Johny, Martin Carole, Pekec Aleksandar, Roberts Fred S.
Venue:  (1999)

Annular Network $AN(c,s)$ is a graph representing a $c\times s$ grid in polar coordinates. We give lower bounds for the diameter of orientations of $AN(c,s)$ and provide orientations which show that bounds are tight in most cases.
Modifying a knot of B-spline curves
Authors: Imre Juhász, Miklós Hoffmann
Venue: Computer Aided Geometric Design (2003)

The modification of a knot of a B-spline curve of order k generates a family of B-spline curves. We show that an envelope of this family is a B-spline curve defined by the same control polygon, and its order is k - m, where m is the multiplicity of the modified knot. Moreover, their arbitrary order derivatives differ only in a multiplier.
A virtual topology for WDM multihop lightwave networks
Authors: Sung-Woo Park, Young-Chon Kim
Venue: Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 2)-Volume - Volume 2 (1995)

WDM multihop networks require that their virtual topology and routing algorithm be simple and efficient while providing extremely high performance. To comply with this, the interconnections of the bidirectional manhattan street network (BMSN) is hierarchically rearranged. The resulting virtual topology constitutes a four-connected MSN-based network called the hierarchical MSN (HMSN). Having the same node degree as BMSN, the proposed HMSN increases no H/W complexity. Routing in HMSN is not also a serious burden to the overall processing overhead since it is a simple two-level extension of the deflection routing used in the two-connected MSNs. Nevertheless, HMSN performs better than the competing BMSN. This improvement in network delay and throughput is verified through numerical implementations.
Improving Performance of Adaptive Media Access Control Protocols for High-Density Wireless Networks
Authors: Alvin Lim, Kui Mok
Venue: Proceedings of the 1999 International Symposium on Parallel Architectures, Algorithms and Networks (1999)

The problems of intermittent disconnection, high error rate and collision in high-density wireless networks cause degradation in the performance of wireless media access control protocols, such as slotted ALOHA Time Division Multiple Access (slotted ALOHA/TDMA) and Direct Sequence Code Division Multiple Access (DS/CDMA). We propose adaptive techniques for improving performance of media access protocols through awareness of the mobile communication environment. These techniques involve detection of intermittent disconnection, high error rates, and collisions. Upon detection and notification of these conditions by snooping devices, the media access control layer adapts its operation and synchronization accordingly to reduce delay and loss of bandwidth. Results from our simulation studies show that adaptive TDMA improves performance by as much as 12 times over basic TDMA and adaptive CDMA improves by as much as 4 times over basic CDMA in wireless network with high population cells. Overall, adaptive CDMA still performs better than adaptive TDMA by about 4 times.
Design and implementation of a multicast-buffer ATM switch
Authors: Jin Li, Chuan-Lin Wu
Venue: Proceedings of the 1995 International Conference on Network Protocols (1995)

We propose a multicast-buffer ATM switch, where a dedicated buffer is allocated to store all multicast cells in an ATM switch. We describe the design of the dedicated multicast buffer in an output-buffer ATM switch and in a shared-buffer ATM switch. No additional copy circuit or complicated control circuit is needed to implement the multicast-buffer ATM switch. Our performance evaluation shows that the proposed switch has a low cell-loss ratio. We are implementing an eight-by-eight output buffer ATM switch with the multicast buffer. We also present a window control mechanism to further improve the utilization of the multicast buffer. Therefore, we believe the multicast-buffer ATM switch is a good candidate to support the multicast function for future broadband ISDN applications
A Dynamic Light-Weight Group Service
Authors: Luis Rodrigues, Katherine Guo, Antonio Sargento, Robbert van Renesse, Brad Glade, Paulo Verissimo, Kenneth Birman
Venue:  (1996)

The virtual synchrony model for group communication has proven to be a powerful paradigm for building distributed applications. Implementations of virtual synchrony usually require the use of failure detectors and failure recovery protocols. In applications that require the use of a large number of groups, significant performance gains can be attained if these groups share the resources required to provide virtual synchrony. A service that maps user groups onto instances of a virtually synchronous implementation is called a Light-Weight Group Service. This paper proposes a new design for the Light-Weight Group protocols that enables the usage of this service in a transparent and dynamic manner. As a test case, the new design was implemented in the Horus system, although the underlying principles can be applied to other architectures as well. The paper also presents performance results from this implementation.
Multicarrier Techniques for 4G Mobile Communications
Authors: Shinsuke Hara, Ramjee Prasad
Venue:  (2003)

:As research for future fourth generation (4G) mobile communication systems is underway worldwide in major companies and academic institutions, forward-thinking professionals are striving to gain a thorough understanding of the cutting-edge technologies and design techniques that will make these systems work. This book helps readers do just that by: providing a comprehensive introduction to multicarrier techniques for 4G mobile communications with a special focus on the analytical aspects; explaining radio channel characteristics and phenomena and discussing the advantages and disadvantages of the OFDM scheme; featuring new multicarrier-related techniques, MC-CDMA, research on several 4G systems, and a look at several problems to be overcome with these systems; examining the concept and detail of the ODFM scheme and how to carry out theoretical analysis on the performance of transmission systems in radio channels; showing how ODFM has been successfully adopted as a modulation scheme in communications systems and broadcasting systems such as ADSL, wireless LANs, and DVB-T.
A Note on Iteration
Authors: David Gries
Venue:  (1977)

NO SUPPLIED The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Clustered File Generation and Its Application to Computer Science Taxonomies
Authors: D. Bergmark, Gerard Salton
Venue:  (1976)

A clustered file organization is one where related, or similar records are grouped into classes, or clusters of items in such a way that all items within a cluster are jointly retrievable. Such a file organization is advantageous for interactive searching where tentative query formulations may be used and the records may be specified incompletely or approximately. An inexpensive file clustering method applicable to large files is given together with an appropriate file search method. The method is used to cluster a file of research articles in computer science based on citation similarities between the papers; this leads to the identification of groups of active computer science research topics and of productive computer scientists.
A Family of Delphi Components for Case-Based Reasoning
Authors: Henrik Bergström
Venue: Proceedings of the 11th IEEE International Conference on Tools with Artificial Intelligence (1999)

Nearest Neighbor (NN) algorithms are one of the more popular approaches to implementing Case-Based Reasoning systems. In this paper a family of Delphi components are presented that implements an NN approach based on the Weighted Euclidean Distance (WED). To make the approach more general the distance measure of WED is implemented by so called Comparators which are specialized components for comparing attribute values. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
A Tool for Extracting XML Association Rules
Authors: Daniele Braga, Alessandro Campi, Stefano Ceri, Mika Klemettinen, Pier Luca Lanzi
Venue: Proceedings of the 14th IEEE International Conference on Tools with Artificial Intelligence (2002)

The recent success of XML as a standard to represent semi-structured data, and the increasing amount of available XML data, pose new challenges to the data mining community. In this paper we present the X MINE operator a tool we developed to extract XML association rules for XML documents. The operator; that is based on XPath and inspired by the syntax of XQuery, allows us to express complex mining tasks, compactly and intuitively. X MINE canbe used to specify indifferently (and simultaneously) mining tasks both on the content and on the structure of the data, since the distinction in XML is slight.
A Structured TCP in Standard ML
Authors: Edoardo S. Biagioni
Venue:  (1994)

This paper describes the design of an implementation of the Transmission Control Protocol using an extension of the Standard ML SML language. SML supports higher-order functions, modularity, and type-safe module composition. We find that by using SML we can achieve good structure and good performance simultaneously. Good structure includes a modular decomposition of the protocol stack and of the TCP implementation, a control structure that imposes a total ordering on all events and processes them synchronously, and a test structure that allows component testing to catch problems before system integration. Strategies that help achieve good performance include using fast algorithms, using language constructs that make it easy to stage function evaluation, and language implementation features such as compacting garbage collection.
Advanced Physical Models for Mask Data Verification and Impacts on Physical Layout Synthesis
Authors: Qi-De Qian, Sheldon X. -D. Tan
Venue: Proceedings of the 4th International Symposium on Quality Electronic Design (2003)

The proliferation and acceptance of reticle enhancementtechnologies (RET) like optical proximity correction(OPC) and phase shift masking (PSM) have significantlyincreased the cost and complexity of sub-100 nmphotomasks. The photomask layout is no longer an exactreplica of the design layout. As a result, reliably verifyingRET synthesis accuracy, structural integrity, andconformance to mask fabrication rules are crucial for themanufacture of nanometer regime VLSI designs. In thispaper, we demonstrate a physical model based masklayout verification system. The new system consists of anefficient wafer-patterning simulator that is able to solvethe process physical equations for optical imaging andresist development and hence can achieve high degreeaccuracy required by mask verification tasks. It is able toefficiently evaluate mask performance by simulating edgedisplacement errors between wafer image and theintended layout. We show the capabilities for hot spotdetection, line width variation analysis, and processwindow prediction capabilities with a sample practicallayout. We also discuss the potential of the new physicalmodel simulator for improving circuit performance inphysical layout synthesis.
An experience in introducing configuration management in a process-centered software engineering environment
Authors: L. Lavazza
Venue: Proceedings of the Third IEEE International Conference on Engineering of Complex Computer Systems (1997)

Configuration Management (CM) is widely recognized as one of the key practices in software development, specially as far as the development of big and complex software systems is concerned. Therefore, tools supporting CM have been constantly evolving, and are now sophisticated software products, providing many features, including the possibility to model-to some extent-the work-flow concerning the configuration items. Process-Centered Software Engineering Environments (PSEEs) aim at providing development environments where production activities are carried out according to a given model of the software process. Since CM has a fundamental role in any software process, it is interesting to understand to what extent a PSEE can be used to support a process model which includes CM issues, and to compare the PSEE-based environments with state-of-the-art commercial CM tools. The work described here is a first step towards this goal, concerning the development of a specific CM environment (featuring a subset of the functionalities provided by CCC/Harvest) based on the SPADE PSEE. The results reported can however be generalized to several CM tools and PSEEs.
An Adaptive Processor Allocation Strategy for Mesh-Connected Systems
Authors: Kyung-Hee Seo, Sung-Chun Kim
Venue: Proceedings of the 1997 International Symposium on Parallel Architectures, Algorithms and Networks (1997)

We propose an adaptive processor allocation strategy based on shape manipulations of required submesh for large mesh-connected systems. When an incoming job requests a rectangular submesh, our strategy first tries to allocate the conventional rectangular submeshes including 90-degree rotation and folding techniques. If it fails, our strategy further tries to allocate more flexible and robust L-shaped submeshes instead of signaling the allocation failure. Thus, our strategy accommodates incoming job earlier than conventional strategies. Simulation results indicate that our strategy performs more efficiently than other strategies in terms of the external fragmentation, the job response time, and the system utilization. Our strategy is transparent to application programmers and does not require additional hardware supports. Moreover, with our L-shaped submesh allocation strategy, application programmers using the mesh-connected system may no longer limit their request to rectangular submeshes. They can request the L-shaped submesh with the number of processors much closer to the exactly needed value to execute their job.
High-order/spectral methods of unstructured grids I. Time-domain solution of Maxwell''s equations
Authors: Warburton J.S. Hesthaven and T.
Venue:  (2001)

We present an ab initio development of a convergent high-order accurate scheme for the solution of linear conservation laws in geometrically complex domains. As our main example we present a detailed development and analysis of a scheme suitable for the time-domain solution of Maxwell''s equations in a three-dimensional domain. The fully unstructured spatial discretization is made possible by the use of a high-order nodal basis, employing multivariate Lagrange polynomials defined on the triangles and tetrahedra. Careful choices of the unstructured nodal grid points ensure high-order/spectral accuracy, while the equations themselves are satisfied in a discontinuous Galerkin form with the boundary conditions being enforced weakly through a penalty term. Accuracy, stability, and convergence of the semi-discrete approximation to Maxwell''s equations is established rigorously and bounds on the global divergence error are provided. Concerns related to efficient implementations are discussed in detail. This sets the stage for the presentation of examples, verifying the theoretical results, as well as illustrating the versatility, flexibility, and robustness when solving two- and three-dimensional benchmarks in computational electromagnetics. Pure scattering as well as penetration is discussed and high parallel performance of the scheme is demonstrated.
Features of Optical Interconnects in Distributed-Shared Memory Organized MIMD Architectures: The Ultimate Goal
Authors: Edward E. E. Frietman, Ramon J. Ernst, Roy Crosbie, Masao Shimoji
Venue: Proceedings of the 1997 International Symposium on Parallel Architectures, Algorithms and Networks (1997)

The antipode of a sequential computer, using a single CPU to execute the tasks, is a massively parallel processor containing large numbers of computing nodes. Supplemental to the shared and distributed memory organizations are the distributed-shared systems, allowing nodes to explore a single globally shared address space. A different vision is introduced concerning the prospects of an optically coupled version of such a system. In each cluster, an electrical crossbar looks after the interconnections between the nodes, the various memory modules and external I/O channels. The clusters itself are optically coupled through a free space oriented data distributing system. Analogies found in the design of the Convex SPP1000 validate the closeness to reality of such an architecture. Following the preceding clarification also an idealized picture of the fundamental properties of an optically based, fully connected distributed - (virtual) shared memory architecture will be outlined.
The sufficient cause principle and reasoning about action
Authors: Peter D. Grunwald
Venue:  (1997)

Most `causal'' approaches to reasoning about action have not addressed the basic question of causality directly: what has to be the case in a domain in order for the assertion `$A$ causes $B$'' to be valid with respect to the domain? Pearl''s recent causal theories based on {\em structural equations\/} do provide an answer to this question. In this paper, we extend Pearl''s formalism so that the typical problems encountered in common sense reasoning about action can be represented in it. The resulting theory comes in both a propositional and a first-order version. The propositional version turns out to be capable of handling many complicated instances of the ramification problem, including domains that contain cyclic causal relationships. It also provides new insights into actions with non-deterministic and/or `disjunctive'' effects. The first-order version additionally handles domains with `dependent'' fluents, incompletely specified action schedules, causal chains of events and `surprises''. We provide an in-depth comparison between our theory and three other recent approaches: those of McCain \& Turner, Baral \& Gelfond and Lin. For the former two, we show that they can be reinterpreted as approximations of our extension of Pearl''s theory: we prove theorems stating that for large classes of reasoning domains, they permit the same inferences as our theory does, and we give examples of reasoning domains that fall outside these classes, for which our approach clearly works better. For the approach of Lin, we show informally that, for those reasoning domains on which both his and our approach are defined, the two approaches are nearly equivalent. In this way we are able to establish a connection between Lin''s approach and Pearl''s semantics of causation. Since all concepts in our theory which involve causality are defined in completely non-causal terms, we hope that our work may help bridge the conceptual gap between `causal'' and `non-causal'' approaches to common sense temporal reasoning.
Persistence as a Form of Interaction
Authors: D. Goldin, P. Wegner
Venue:  (1998)

D. Goldin, Univ. of Massachusetts - Boston P. Wegner, Brown University This paper establishes a relation between {\em interaction} and {\em persistence}. Interactive computation is characterized by Interaction Machines (IMs), with a restricted subclass of {\em Sequential Interaction Machines} (SIMs) controlled by a single sequential stream of interactions, modeling transducers and simple data abstractions. {\em Persistent Turing Machines} (PTMs) are introduced by extending Turing Machines (TMs) with a persistent working tape. It is shown that SIMs and PTMs are expressively equivalent but more expressive than TMs where, following Milner, {\em expressiveness} is defined in terms of observerability of system behavior. This work is part of a larger effort towards a more comprehensive formalization of interactive computation, with the aim of characterizing empirical computation by interaction.
Programming with stigmergy: using swarms for construction
Authors: Zachary Mason
Venue: Proceedings of the eighth international conference on Artificial life (2002)

Social insects build extremely complex structures despite their limited perception and the absence of a global control system. Many of the structures built by termites can be construed as emergent phenomena driven by each worker's reaction to local pheremone levels. Thin work extrapolates from termite building to a system for specifying swarm activity. In the system, swarms are homogeneous and composed of simple, memory-less that perceive only their immediate environment. The swarm's activity is coordinated by virtual pheremone concentrations. The rules governing the agents' reactions can be designed to produce swarms that build complex, composable structures.
Randomized Agreement Protocols and Distributed Deadlock Detection Algorithm
Authors: Gabriel Bracha
Venue:  (1985)

NOT SUPPLIED
Power Trends and Performance Characterization of 3-Dimensional Integration for Future Technology Generations
Venue: Proceedings of the 2nd International Symposium on Quality Electronic Design (2001)

3-D technology promises higher integration density and lower interconnection complexity and delay. At present, however, not much work on circuit applications has been done due to lack of insight into 3-D circuit architecture and performance. One of the purposes of realizing 3-D integration is to reduce the interconnect complexity and delay of 2-D, which are widely avowed as the barriers to the continued performance gain in the future technology generations. Therefore, in this paper, we present a stochastic 3-D interconnect model, study the impact of 3-D integration on circuit performance and power consumption. We show that 3-D structures effectively reduce the number of long delay nets, significantly reduce the number of repeaters, and dramatically improve the circuit performance. With 3-D integration, circuits can be clocked at frequencies much higher (double, even triple) than with 2-D. However, we also show that the impacts of vertical wires on chip area and interconnect delay can be limiting factors on the vertical integration of device layers; and that 3-D integration offers limited relief of power consumption.
On Accumulator-Based Bit-Serial Test Response Compaction Schemes
Venue: Proceedings of the 2nd International Symposium on Quality Electronic Design (2001)

The data paths of most contemporary general and special purpose processors include registers, adders and other arithmetic circuits. If these circuits are also used for Built-In Self-Test, the extra area required for embedding testing structures can be cut down efficiently. Several schemes based on accumulators, subtracters, multipliers and shift registers have been proposed and analyzed in the past for parallel test response compaction, whereas some efforts have also been devoted in the bit-serial response compaction case. In this paper, we analyze and evaluate the bit-serial version of a recently proposed scheme for parallel test response compaction [5]. Experimental results on the ISCAS'85 benchmark circuits indicate that the post-compaction fault coverage drop attained by the new scheme is significantly lower than other already known accumulator-based compaction schemes. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
System on a Chip: Changing IC Design Today and in the Future
Authors: Theo A. C. M. Claasen
Venue: IEEE Micro (2003)

Market-related trends continue to drive innovation in the semiconductor industry. Today, they are particularly driving the design of systems on a chip, the new breed of complex, highly integrated systems.