ppxscal/embedding_network huggingface dataset:
Combining function points software estimation model with ADISSA methodology for systems analysis and design
Authors: P. Shoval, O. Feldman
Venue: Proceedings of the 7th Israeli Conference on Computer-Based Systems and Software Engineering (1996)

The study proposes a combination of the function points model for software estimation with the ADISSA methodology for systems analysis and design. This combined approach, which is supported by a software tool, enables one to estimate various software metrics, such as size, effort, and duration, in the early stages of systems development, by basing them on the products of a thorough system analysis and design process.
A Model and Temporal proof system for Networks of Processes
Authors: Van L Nguyen, Alan J. Demers, David Gries, Susan S. Owicki
Venue:  (1985)

An approach is presented for modeling networks of processes that communicate exclusively through message passing. A process (or a network) is defined by its set of possible behaviors, where each behavior is an abstraction of an infinite execution sequence of the process. The resulting model is simple and modular and facilitates information hiding. It can describe both synchronous and asynchronous networks. It supports recursively-defined networks and can characterize liveness properties such as progress of inputs and outputs, termination, and deadlock. A sound and complete temporal proof system based on the model is presented. It is compositional a specification of a network is formed naturally from specifications of its components.
Stationary Subdivision and Multiresolution Surface Representations
Authors: Denis N. Zorin
Venue:  (1997)

Stationary subdivision is an important tool for generating smooth free-form surfaces used in CAGD and computer graphics. One of the challenges in the construction of subdivision schemes for arbitrary meshes is to guarantee that the surfaces produced by the algorithm are Ck-continuous. First results in this direction were obtained only recently. In this thesis we derive necessary and sufficient criteria for Ck-continuity that generalize and extend most known conditions. We present a new method for analysis of smoothness of subdivision which allows us to analyze subdivision schemes which do not generate surfaces admitting closed-form parameterization on regular meshes, such as the Butterfly scheme and schemes with modified rules for tagged edges. The theoretical basis for analysis of subdivision that we develop allows us to suggest methods for constructing new subdivision schemes with improved behavior. We present a new interpolating subdivision scheme based on the Butterfly scheme, which generates Ck-continuous surfaces from arbitrary meshes. We describe a multiresolution representation for meshes based on subdivision. Combining subdivision and the smoothing algorithms of Taubin [61] allows us to construct a set of algorithms for interactive multiresolution editing of complex hierarchical meshes of arbitrary topology.
Wavelength Conversion in Optical Networks
Authors: Jon Kleinberg, Amit Kumar
Venue:  (1998)

In many models of optical routing, we are given a set of communication paths in a network, and we must assign a wavelength to each path so that paths sharing an edge receive different wavelengths. The goal is to assign as few wavelengths as possible, in order to make as efficient use as possible of the optical bandwidth. Wilfong and Winkler considered the problem of placing wavelength converters in such a network: if a node of the network contains a converter, any path that passes through this node may change its wavelength. Having converters at some of the nodes can reduce the number of wavelengths required for routing, down to the following natural {\em congestion bound}: even with converters, we will always need at least as many wavelengths as the maximum number of paths sharing a single edge. Thus Winkler and Wilfong defined a set $S$ of nodes in a network to be {\em sufficient} if, placing converters at the nodes in $S$, every set of paths can be routed with a number of wavelengths equal to its congestion bound. They showed that finding a sufficient set of minimum size is NP-complete. In this paper, we provide a polynomial-time algorithm to find a sufficient set for an arbitrary directed network whose size is within a factor of $2$ of minimum. For the special case of planar graphs with bi-directional edges, we obtain a polynomial-time approximation scheme. Our techniques establish a connection between the problem of finding a minimum sufficient set and an interesting simultaneous generalization of the Vertex Cover and Feedback Vertex Set problems in undirected graphs.
Structuring Decompiled Graphs
Authors: Cristina Cifuentes
Venue:  (1994)

A structuring algorithm for arbitrary control flow graphs is presented. Graphs are structured into semantical and structural equivalent graphs, without the need of code replication or introduction of new variable The algorithm makes use of a set of generic high level language constructs that includes different type of loops and conditionals. Gotos are used only when the graph cannot be structured with the constructs in the generic set. This algorithm is adequate for the control flow analysis required when decompiling programs, given that binary program does not contain information on the high-level structures used by the initial high-level language program (i.e. before compilation). The algorithm has been implemented as part of the dcc decompiler, an i8O286 decompiler of DOS binary program and has proved successful in its aim of structuring decompiled graphs.
The Light Magnet, Coupling of Electronic and Nuclear Angular Momenta in Optical NMR and ESR: Quantum Theory
Authors: M. W. Evans
Venue:  (1991)

Optical NMR and ESR is a recently introduced technique in which a circularly polarised laser (a "light magnet") is used in an NMR or ESR spectrometer to induce magnetization. The spectral consequences are developed with a quantum theory similar to the rigorous theory of Zeeman splitting of Russell Saunders states, a theory which is suitable for atoms and molecules with net electronic angular momentum, and in which the antisymmetric electronic polarisability is finite. The optical NMR and ESR hamiltonians are developed with the Wigner Eckart Theorem. The circularly polarised laser shifts the original NMR and ESR resonance lines, and splits the shifted lines into analytically useful patterns. The theory gives Lande factors which are in agreement with an earlier, simple, semi-classical theory.
Low Cost Concurrent Error Detection Based on Modulo Weight-Based Codes
Authors: Debaleena Das, Nur A. Touba, Markus Seuring, Michael Gössel
Venue: Proceedings of the 6th IEEE International On-Line Testing Workshop (IOLTW) (2000)

This paper explains the concept of ¿modulo weight-based codes¿ and presents an efficient scheme for concurrent error detection of arbitrary multilevel circuits based on these codes. It is shown that in most cases modulo weight-based codes can achieve high fault detection capabilities of around 99% with just three check bits and without constraining the circuit structure. Modulo weight-based codes, present a way of exploiting the circuit structure to increase fault detection capability. An optimum choice of weights for the code can be made using information about the circuit structure. The paper presents an efficient algorithm to achieve the weight assignment based on simple estimates of the probabilities of the existence of sensitized paths from the signal line to the circuit outputs. Finally, a self-checking checker design is presented for the proposed modulo weight-based codes.
Command and Conquer Generals
Venue:  (2003)

:In a Time of Modern War, Can You Be a Great Leader? ·Successful strategies for commanding your forces in the air and on land ·How to build structures at the right times, in the right places ·Advanced economic strategies ·Killer walkthroughs for every scenario ·Battle strategies for the Americans, Chinese, and GLA ·Expert multiplayer strategies ·Tricks and tips to help you get the most from your unitsAuthor Biography: 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
Efficient Ordered Brodacasting in Reliable CSMA/CD Networks
Authors: Pankaj Jalote
Venue: Proceedings of the The 18th International Conference on Distributed Computing Systems (1998)

Ordered broadcast is a communication paradigm which requires that all the nodes in the network receive a message, and that the nodes receive the different messages in the same order. Ordered broadcast is particularly useful for supporting fault tolerance in distributed systems. We present a protocol for ordered broadcasts in a CSMA/CD network that uses the high reliability and collision detection properties of these networks in a novel manner. The control of the protocol is distributed, and even if the sender of a message fails after transmitting a message which is missed by some nodes, the ordered broadcast property is satisfied. The protocol has a small overhead, but requires both hardware and software support for implementation.
On Class-based Isolation of UDP, Short-lived and Long-lived TCP Flows
Authors: Selma Yilmaz, Ibrahim Matta
Venue:  (2001)

Abstract The congestion control mechanisms of TCP make it vulnerable in an environment where flows with different congestion-sensitivity compete for scarce resources. With the increasing amount of unresponsive UDP traffic in today''s Internet, new mechanisms are needed to enforce fairness in the core of the network. We propose a scalable Diffserv-like architecture, where flows with different characteristics are classified into separate service queues at the routers. Such class-based isolation provides protection so that flows with different characteristics do not negatively impact one another. In this study, we examine different aspects of UDP and TCP interaction and possible gains from segregating UDP and TCP into different classes. We also investigate the utility of further segregating TCP flows into two classes, which are class of short and class of long flows. Results are obtained analytically for both Tail-drop and Random Early Drop (RED) routers. Class-based isolation have the following salient features: (1) better fairness, (2) improved predictability for all kinds of flows, (3) lower transmission delay for delay-sensitive flows, and (4) better control over Quality of Service (QoS) of a particular traffic type.
A time-optimal solution to planar point location in ordered functional domains, with applications
Authors: A. Zomaya
Venue: Proceedings of the 1996 International Symposium on Parallel Architectures, Algorithms and Networks (1996)

Consider a family C of continuous functions stored, in discretized form, one function per row in a mesh with multiple broadcasting of size /spl radic/n/spl times//spl radic/n. In a number of Computer Aided Geometric Design applications it is necessary to answer point location queries with respect to the given functions: e.g. cubic B-splines, control polygons of Bezier curves, etc. The main contribution of this work is to show that in such a domain an arbitrary collection of m, (1/spl les/m/spl les/n), point location queries can be answered in /spl Theta/(m//spl radic/n) time. We show that this is best possible on this platform. Our algorithms do not ignore the I/O time and see it as an important component of the overall processing time. In this regard, our algorithms feature a very attractive property, namely that the I/O time and the processing time are essentially the same.
Natural convection of water in an inclined cavity with heat generation
Authors: K. Sundaravadivelu, P. Kandaswamy
Venue: The Korean Journal of Computational Applied Mathematics (2003)

The convection of water is investigated in the vicinity of its density maximum temperature (277 K) in an inclined square cavity in the presence of heat sources. Numerical investigations are carried out by maintaining one of the vertical walls uniformly at 273 K and varying the other wall between temperatures 275 K and 285 K at different inclinations angles. The isotherms, streamlines and velocity profiles reveal the possible existence of multicellular fluid motions, and bidirectional velocity distributions. These fluid flow and heat transfer characteristics are significantly modified by the cavity inclination in the presence of heat sources.
Multilevel selection and the evolution of predatory restraint
Authors: Joshua Mitteldorf, David H. Croll, S. Chandu Ravela
Venue: Proceedings of the eighth international conference on Artificial life (2002)

Individual selection favors that predator which can most efficiently turn its prey into increased reproductive capacity. But any species that becomes too successful in this game sows the seed of its own demise; for its progeny may be delivered into an environment where prey populations are depleted, and starvation a danger. From this danger derives a compensatory evolutionary pull toward moderation. The latter effect derives from a cost that is shared generally by the community that claims a common prey population. A widely accepted argument from classical evolutionary theory holds that the selective force of such group effects is likely to be weak and slow-acting compared to the efficiency of individual selection. We offer a numerical simulation in defiance of this wisdom, demonstrating how under general assumptions and a wide range of parameter values, predatory restraint may evolve as a group adaptation.
An abstraction of intercellular communication
Authors: Thomas E. Portegys
Venue: Proceedings of the eighth international conference on Artificial life (2002)

Multi-cellular organisms exhibit many mechanisms of intercellular communication for control and developmental purposes. Neurotransmitters, hormones, and signals mediating such processes as apoptosis and angiogenesis are but a few of these mechanisms. An abstraction of intercellular communication is presented here to provide a basis for constructing artificial life forms and self-organizing systems. Although the investigational vehicle is a cellular automaton, a cell in this context can be viewed in a broader sense. An intercellular signal is defined as a parameterized entity, a powerful paradigm that expresses not only lateral but also hierarchical and even recursive control structures. "Game of Life", Turing machine and other examples are included.
Broadcasting on Incomplete WK-Recursive Networks
Venue: Proceedings of the 1996 International Symposium on Parallel Architectures, Algorithms and Networks (1996)

The WK-recursive networks, which were originally proposed by Vecchia and Sanges, have suffered from a rigorous restriction on the number of nodes. Like other incomplete networks, the incomplete WK-recursive networks have been proposed to relieve this restriction. In this paper, broadcasting on the incomplete WK-recursive networks is discussed. The proposed broadcasting algorithm is optimal with respect to message complexity. Besides, extensive experiments are made to evaluate its performance. Experimental results show that the heights of the broadcasting trees do not exceed the diameters, and a high percentage of the nodes can receive the message from the source node via the shortest path.
Domesticating Bead: adapting an information visualization system to a financial institution
Authors: D. Brodbeck, M. Chalmers, A. Lunzer, P. Cotture
Venue: Proceedings of the 1997 IEEE Symposium on Information Visualization (InfoVis '97) (1997)

The Bead visualization system employs a fast algorithm for laying out high-dimensional data in a low-dimensional space, and a number of features added to 3D visualizations to improve imageability. We describe recent work on both aspects of the system, in particular a generalization of the data types laid out and the implementation of imageability features in a 2D visualization tool. The variety of data analyzed in a financial institution such as UBS, and the ubiquity of spreadsheets as a medium for analysis, led us to extend our layout tools to handle data in a generic spreadsheet format. We describe the metrics of similarity used for this data type, and give examples of layouts of sets of records of financial trades. Conservatism and scepticism with regard to 3D visualization, along with the lack of functionality of widely available 3D web browsers, led to the development of a 2D visualization tool with refinements of a number of our imageability features.
ADAPTIVE WAVELET COLLOCATION METHODS FOR INITIAL VALUE BOUNDARY PROBLEMS OF NONLINEAR PDE''S
Authors: Wei Cai, JianZhong Wang
Venue:  (1993)

We have designed a cubic spline wavelet decomposition for the Sobolev space H^2_0I where I is a bounded interval. Based on a special ``point-wise orthogonality'''' of the wavelet basis functions, a fast Discrete Wavelet Transform (DWT) is constructed. This DWT transform will map discrete samples of a function to its wavelet expansion coefficients in Q(N log N) operations. Using this transform, we propose a collocation method for the initial value boundary problem of nonlinear PDE''s. Then, we test the efficiency of the DWT transform and apply the collocation method to solve linear and nonlinear PDE''s.
Abstract for Panel on The Future of Generators
Authors: Ira Baxter
Venue: Proceedings of the 4th International Conference on Software Reuse (1996)

Panel Members: Jim Neighbors, others TBD. Code reuse libraries are popular because they are apparently easy to set up and provide the first evidence of an organization movement towards the payoff of reuse. Generative reuse systems are much less common, yet often provide measurable reuse payoff. This panel explores the motivation and basic technology that make generative reuse possible.
A Neural Network Approach to Hyphenating Norwegian
Authors: Terje Kristensen
Venue: Proceedings of the IEEE-INNS-ENNS International Joint Conference on Neural Networks (IJCNN'00)-Volume 2 - Volume 2 (2000)

This paper presents a method to automatically hyphenate Norwegian by a Backpropagation neural network. The original database consists of about 67000 Norwegian words and is developed by the Norwegian Computing Centre for the Humanities at the University of Bergen. The experiments have been done on a PC-platform and on only a sample of words from the database. The hyphenation program has been developed in Cortex-Pro, a general-purpose neural network simulation environment. 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 Fast and Updatable IP Address Lookup Scheme
Authors: Sang-Hun Chung, Sungkee Jean, Hyunsoo Yoon, Jung-Wan Cho
Venue: Proceedings of the 2001 International Conference on Computer Networks and Mobile Computing (ICCNMC'01) (2001)

The Internet is growing very rapidly in both the size and the amount of traffic. This gowth has placed excessive strain on the Internet infrastructure, especially on routers. The IP address lookup is the operation that searches the longest matching prefix for the destination address of an incoming packet in order to determine the next hop of the packet. This operation is complex and is a major bottleneck in high-performance routers. In this paper, we propose a fast and updatable lookup scheme that can be easily implemented in hardware. We also present the memory allocation policy that supports for the incremental update of the forwardingtable. Since our lookup scheme can be implemented with the small-bit logic and SRAM, the average delay per one lookup is about 18ns. That is, our scheme can achieve 55.56x106 routing lookups/s in average.
Design and Evaluation of Incremental Data Structures and Algorithms for Dynamic Query Interfaces
Authors: Egemen Tanin, Richard Beigel, Ben Shneiderman
Venue: Proceedings of the 1997 IEEE Symposium on Information Visualization (InfoVis '97) (1997)

Dynamic query interfaces (DQIs) are a recently developed database access mechanism that provides continuous real-time feedback to the user during query formulation. Previous work shows that DQIs are an elegant and powerful interface to small databases. Unfortunately, when applied to large databases, previous DQI algorithms slow to a crawl. We present a new incremental approach to DQI algorithms and display updates that works well with large databases, both in theory and in practice.
Computing Partitions with Applications to the Knapsack Problem
Authors: Ellis Horowitz, Sartaj Sahni
Venue:  (1972)

Given $r$ numbers $s_{1}, \ldots, s_{r}$, algorithms are investigated for finding all possible combinations of these numbers which sum to $M$. This problem is a particular instance of the 0-1 unidimensional knapsack problem. All of the usual algorithms for this problem are investigated both in terms of asymptotic computing times and storage requirements, as well as average computing times. We develop a technique which improves all of the dynamic programming methods by a square root factor. Using this improvement a variety of new heuristics and improved data structures are incorporated for decreasing the average behavior of these methods. The resulting algorithms are then compared on a wide set of data. It is then shown how these improvements can be applied to various versions of the knapsack problem. Key words and Phrases: partitions, knapsack problem, dynamic programmiing, integer optimization.
Visualizing Geometric Algorithms Over the Web
Authors: J. E. Baker, I. F. Cruz, G.Liotta, R. Tamassia
Venue:  (1997)

The visual nature of geometry applications makes it a natural area where visualization can be an effective tool for demonstrating algorithms. In this paper we propose a new model, called Mocha, for interactive visualization of algorithms over the World Wide Web. Mocha is a distributed model with a client-server architecture that optimally partitions the software components of a typical algorithm execution and visualization system, and leverages the power of the Java language, which has become the standard for distributing interactive platform-independent applications across the Web. Mocha provides high levels of security, protects the algorithm code, places a light communication load on the Internet, and allows users with limited computing resources to access executions of computationally expensive algorithms. The user interface combines fast responsiveness with the powerful authoring capabilities of hypertext narratives. We describe the architecture of Mocha, show its advantages over previous methods, and present a prototype that can be accessed by any user with a WWW browser supporting Java. The Mocha prototype has been widely accessed over the WWW, as demonstrated by the statistics that we have collected, and the Mocha model has been adopted by other research groups. Mocha is currently part of a broader system, called GeomNet, which performs distributed geometric computing over the Internet.
SLC: Symbolic Scheduling for Executing Parameterized Task Graphs on Multiprocessors
Authors: Michel Cosnard, Emmanuel Jeannot, Tao Yang
Venue: Proceedings of the 1999 International Conference on Parallel Processing (1999)

Task graph scheduling has been found effective in performance prediction and optimization of parallel applications. A number of static scheduling algorithms have been proposed for task graph execution on distributed memory machines. Such an approach cannot be adapted to changes in values of program parameters and the number of processors and also it cannot handle large task graphs.In this paper, we model parallel computation using parameterized task graphs which represent coarse-grain parallelism independent of the problem size. We present a scheduling algorithm for a parameterized task graph which first derives symbolic linear clusters and then assigns task clusters to processors. The runtime system executes clusters on each processor in a multi-threaded fashion. We evaluate our method using various compute-intensive kernels that can be found in scientific applications.