ppxscal/embedding_network huggingface dataset:
Compiling Verilog into timed finite state machines
Authors: Szu-Tsung Cheng, R. K. Brayton, G. York, K. Yelick, A. Saldanha
Venue: Proceedings of the 4th IEEE International Verilog HDL Conference (1995)

The lack of formal semantics for HDLs has made it hard to make a formal bridge between simulation tools based on HDLs and synthesis/verification tools based on finite state machines. We address the problem of finding a larger subset of Verilog HDL (which includes timing constructs) and a systematic way of extracting FSMs from programs built using the subset. Using timed FSMs as the target language for HDL compilation gives us two potential advantages. First, FSMs can be used to model systems that do not have hardware implementation. Second, FSMs can be used to model systems that are implementable but not automatically synthesizable.
When Cyborgs Meet: Building Communities of Cooperating Wearable Agents
Authors: Gerd Kortuem, Jay Schneider, Jim Suruda, Steve Fickas, Zary Segall
Venue: Proceedings of the 3rd IEEE International Symposium on Wearable Computers (1999)

This paper introduces the notion of a Wearable Community as a group of wearable users who cooperate for their mutual benefit. In such a community, wearable computers act as personal agents on behalf of and in the interest of their 'owners'. These agents are goal-directed and will perform a broad array of tasks for the user, ranging from personal scheduling to task planning. We describe how personal wearable agents can be used to enable goal directed cooperation during physical encounters of people with selfish and conflicting goals, such that cooperation leads to mutually beneficial results. We discuss negotiation protocols, and describe the design and implementation of a wearable agent system, as well as a simulator for large-scale wearable communities.
A Conversation with Jim Gray
Venue: Queue (2003)

Sit down, turn off your cellphone, and prepare to be fascinated. Clear your schedule, because once you’ve started reading this interview, you won’t be able to put it down until you’ve finished it.
Optimal Parallel Algorithms for Transitive Closure and Point Location in Planar Structures
Authors: Roberto Tamassia, Jeffrey S Vitter
Venue:  (1989)

We present parallel algorithms for several graph and geometric problems, including transitive closure and topological sorting in planar $st$-graphs, preprocessing planar subdivisions for point location queries, and construction of visibility representations and drawings of planar graphs. Most of these algorithms achieve optimal $O( log n)$ running time with $n / log n$ processors in the EREW PRAM model.
Performance analysis of a shared-medium ATM switch
Authors: A. O. Zaghloul, H. G. Perros
Venue: Proceedings of the IEEE Symposium on Computers and Communications (ISCC'95) (1995)

In this paper, we present an approximate analysis of a generic shared-medium ATM switch with input and output queueing. Input traffic is assumed to be bursty and is modelled by an interrupted Bernoulli process (IBP). Three different bus service policies are analyzed: time division multiplexing (TDM), cyclic, and random. The output links may have constant or geometric service time. The analysis is based on the notion of decomposition whereby the switch is decomposed into smaller sub-systems. First, each input queue is analyzed in isolation after we modify its service process. Subsequently, the shared medium is analyzed as a separate sub-system utilizing the output process of each input queue. Finally, each output queue is analyzed in isolation. The results from the individual sub-systems are combined together through an iterative scheme. This method permits realistic system characteristics such as limited buffer size, asymmetric load conditions, and nonuniform destinations to be taken into consideration in the analysis. The model's accuracy is verified through simulation.
.Net E-Commerce Programming, 1 edition
Authors: Mike Gunderloy, Noel Jerke
Venue:  (2002)

:"With .NET E-Commerce Programming, you not only sharpen your programming skills but also get a full set of code solutions for building an online store." "Written for experienced programmers, this book details the entire process of planning, building, and managing an online store with Visual Basic .NET, ASP.NET, ADO.NET, and SQL Server 2000. It begins with an overview of technology and terminology and then moves on to planning, showing you how to design the database for the store. In this phase, you'll use Visio for Enterprise Architects to translate requirements into SQL code. From there, you'll begin building the shopper interface, creating a catalog, shopping basket, and checkout process and adding features that will enable users to view their order history and edit their profiles. You'll create and implement cohesive, browser-based functionality for managing the catalog, taxes, shipping charges, and orders." Database, front end, and management - those are the essentials. You get much more, though: advice on selecting and managing a server, tips for implementing up-sell and cross-sell marketing tactics, and instructions on localizing your store for consumers worldwide. Everywhere you turn, the focus is on reaping the special benefits .NET offers your e-commerce project: shorter development times, improved scalability and performance, easier application integration, and tighter security.
Collineations and Characterizations of Generalized Quadrangles of Order (q+1, q-1)
Authors: M. A. Miller, S. E. Payne
Venue:  (1998)

For each q-arc \Omega^- of PG(2,q), q=2^e, there is a well-known construction of a GQ S with parameters (q+1, q-1). We give a new characterization of S that makes it easy to see that there is only one case in which the collineation group of S contains elements not induced by collineations of the ambient PG(3,q). This is the case in which the hyperoval containing \Omega^- is regular (i.e., contains a conic) and the nucleus of the conic is not in \Omega^-. The situation for the known GQ naturally arising with parameters (q-1, q+1) is also surveyed.
Random Fibonacci sequences and the number 1.13198824...
Authors: Divakar Viswanath
Venue:  (1997)

\begin{abstract} For the familiar Fibonacci sequence --defined by $f_1 = f_2 = 1$, and $f_n = f_{n-1} + f_{n-2}$ for $n<2$ --$f_n$ increases exponentially with $n$ at a rate given by the golden ratio $(1+\sqrt{5})/2=1.61803398\ldots$. But for a simple modification with both additions and subtractions --the {\it random} Fibonacci sequences defined by $t_1=t_2=1$, and for $n<2$, $t_n = \pm t_{n-1} \pm t_{n-2}$, where each $\pm$ sign is independent and either $+$ or $-$ with probability $1/2$ --it is not even obvious if $\abs{t_n}$ should increase with $n$. Our main result is that \begin{equation*} \sqrt[n]{\abs{t_n}} \rightarrow 1.13198824\ldots\:\:\: \text{as}\:\:\: n \rightarrow\infty \end{equation*} with probability $1$. Finding the number $1.13198824\ldots$ involves the theory of random matrix products, Stern-Brocot division of the real line, a fractal-like measure, a computer calculation, and a rounding error analysis to validate the computer calculation. \end{abstract}
Scripting for EDA Tools: A Case Study
Venue: Proceedings of the 2nd International Symposium on Quality Electronic Design (2001)

How to integrate EDA tools to enable interoperability and ease of use has been a very time-consuming and complicated job. Conventionally, each tool comes with a unique and simple set of commands for interactive use such as Sis [12], Vis [8], and Magic [5], but it lacks full programming capability of a scripting language. Also, it discourages further exploration to the underlying system functionality. Not only the code is hard to reuse, but also rapid prototyping of a new algorithm is impossible. A new algorithm may still take years to develop, which has to start from scratch and struggles between various formats. In this paper, we study and address how to easily integrate those application program interface(API)'s into most popular scripting languages such as Tcl [10] or Perl [13]. This enables a full scripting or programming language capability into a tool, and most important of all, any tool can be interoperated over a uniform platform on an API level. Rapid prototyping of a new algorithm thus becomes much easier and faster. It also promotes software reuse. Many existing extension packages for the scripting languages can be therefore integrated such as Tk [10] for graphic user interface(GUI), and CPAN collection [4] for various Perl applications. From a standpoint of high software quality, this approach also provides a very good vehicle for comprehensive testing of each API in an EDA tool. 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
Block--diagonal and indefinite symmetric preconditioners for mixed finite element formulations
Authors: Valeria Simoncini, Ilaria Perugia
Venue:  (1999)

We are interested in the numerical solution of large structured indefinite symmetric linear systems arising in mixed finite element approximations of the magnetostatic problem; in particular, we analyze definite block--diagonal and indefinite symmetric preconditioners. Relating the algebraic characteristics of the resulting preconditioned matrix to the properties of the continuous problem and of its finite element discretization, we show that the considered preconditioning strategies make the used Krylov subspace solver insensitive to the mesh refinement parameter, in terms of number of iterations. In order to achieve computational efficiency, we also analyze algebraic approximations to the optimal preconditioners, and discuss their performance on real two and three dimensional application problems.
A Linear Sieve Algorithm for Finding Prime Numbers
Authors: David Gries, Jayadev Misra
Venue:  (1977)

NO SUPPLIED
A Logical Ring Reliable Multicast Protocol for Mobile Nodes
Authors: Ioanis Nikolaidis, Janelle J. Harms
Venue: Proceedings of the Seventh Annual International Conference on Network Protocols (1999)

A protocol for the reliable multicast of data to mobile hosts is described. A logical ring is maintained between all the base stations that handle the multicast traffic of the same multicast group. A token passing protocol enforces a consistent view between all base stations with respect to the frames that are considered delivered to all mobiles. The interaction of the reliable multicasting and the handoff events of the mobiles is controlled by a special handoff protocol. A description of the management protocol is also given. We use simulation results to illustrate the feasibility of the approach and reveal the performance interplay between the base station buffer size and the token rotation frequency.
Development of a neural network to predict residential energy consumption
Authors: R. R. A. Issa, I. Flood, M. Asmus
Venue: Proceedings of the sixth international conference on Application of artificial intelligence to civil & structural engineering (2001)

In Florida, an Energy Performance Index (EPI) calculation must be performed and submitted before a building permit can be granted. The EPI is a measure of energy efficiency calculated for all new construction and renovations. It uses data on several components of a structure to assign a rating (it must be under 100 points to pass). The lower the EPI, the more efficient the structure should be. This study involved the collection of residential EPI data from participating Gainesville Regional Utilities customers, matching this data with the actual energy consumption data and training an artificial neural network to relate the EPI to actual energy consumption. The ability of the artificial neural network to predict annual energy consumption will help residential designers/builders advance the goals of reducing the monthly cost of new housing and reducing the associated environmental impact and energy use. Data on new residential construction EPI calculations for 1998-2000 in Alachua County and corresponding energy consumption data for one year was compiled. This data was also matched with the conditioned living area of each house and then imported into the neural network. A local subdivision in which several houses were issued permits based on the same EPI was also identified as a control group so that normal variations in annual energy consumption could be determined. The neural network was used to create a model to predict annual energy consumption cost.
Properties of the working-set model
Authors: Peter J. Denning, Stuart C. Schwartz
Venue: ACM SIGOPS Operating Systems Review (1972)

A program's working set W (t, T) at time t is the set of distinct pages among the T most recently referenced pages. Relations between the average working-set size, the missing-page rate, and the interreference-interval distribution may be derived both from time-average definitions and from ensemble-average (statistical) definitions. An efficient algorithm for estimating these quantities is given. The relation to LRU (least recently used) paging is characterized. The independent-reference model, in which page references are statistically independent, is used to assess the effects of interpage dependencies on working-set size observations. Under general assumptions, working-set size is shown to be normally distributed.
Inter-Class Mutation Operators for Java
Authors: Yu-Seung Ma, Yong-Rae Kwon, Jeff Offutt
Venue: Proceedings of the 13th International Symposium on Software Reliability Engineering (2002)

The effectiveness of mutation testing depends heavily onthe types of faults that the mutation operators are designedrepresent. Therefore, the quality of the mutation operatorsis key to mutation testing. Mutation testing has traditionallybeen applied to procedural-based languages, andmutation operators have been developed to support most oftheir language features.Object-oriented programming languages contain newlanguage features, most notably inheritance, polymorphism,and dynamic binding. Not surprisingly, these languagefeatures allow new kinds of faults, some of which arenot modeled by traditional mutation operators. Althoughmutation operators for OO languages have previously beensuggested, our work in OO faults indicate that the previousoperators are insufficient to test these OO languagefeatures, particularly at the class testing level. This paperintroduces a new set of class mutation operators forthe OO language Java. These operators are based on specificOO faults and can be used to detect faults involvinginheritance, polymorphism, and dynamic binding, thus areuseful for inter-class testing. An initial Java mutation toolhas recently been completed, and a more powerful versioncurrently under construction.
Simulation of fatigue fracture of a rubber rail support
Authors: D. Tran
Venue: Proceedings of the sixth conference on Computational structures technology (2002)

Fatigue Crack Growth Characteristics (FCGC), the relationship between the fatigue crack growth rate and the strain energy release rate, has been used successfully to predict residual strength or the fatigue service life of metallic structures. FCGC has not been used to the same extent for rubber components, even though rubber components are often employed in dynamic rather than static applications, for which fatigue mode of failure should be used as the criterion in analysis and design. This paper investigates the application of fracture mechanics and FEM in the investigation of the propagation of crack in a rubber rail support and the estimation of its fatigue service life by using FCGC of a natural rubber. The key technique used in this investigation is to determine the strain energy release rates G of the structure by using finite element method (FEM) and the virtual crack extension method. The G versus crack growth curve is then combined with FCGC to predict the number of cycles to failure. For the case of the rubber rail support, because of the high degree of non-linearity of the problem due to rubber material properties, large deformation and great discrepancy between the rigidity of steel and rubber components, the analysis is divided into two stages: first a three-dimensional model of the structure is analysed under static loading, the maximum stress thus found and the displacements measured in static testing were used to validate an equivalent two-dimensional model. Then the two-dimensional model is subjected to the virtual crack extension simulation, from which the strain energy release rate is found and combined with FCGC of rubber to determine the service life. Results compared favourably with fatigue test results indicating that FCGC and FEM modelling can be used to predict fatigue behaviour of rubber components and provide tools for improvement in their design.
Collected Papers of the Soar/IFOR Project: Spring 1994
Authors: W. L Johnson, Randolph M. Jones, David Keirsey, Frank V. Koss, John E. Laird, Jill F. Lehman, Paul E. Neilsen, Paul S. Rosenbloom, Robert Rubinoff, Karl B. Schwamb, Milind Tambe, Michael Lent, Robert Wray
Venue:  (1994)

The summer of 1992, the Soar/IFOR research group has been building intelligent automated agents for tactical air simulation. The ultimate goal of this project is to develop automated pilots whose behavior in simulated engagements is indistinguishable from that of human pilots. This technical report is a collection of the research papers that have been generated from this project as of Spring 1994. The research covered in these papers spans a wide spectrum of issues in agent development such as explanation, managing situational awareness, managing multiple interacting goals, coordination between multiple agents, natural language processing, developing believable agents, event tracking, and the infrastructure to support agent development, including knowledge acquisition and use, interfacing to simulation environments, and developing low cost simulators.
Recursion as a Programming Tool
Authors: David Gries
Venue:  (1975)

NO SUPPLIED
Is self-replication an embedded characteristic of artificial/living matter?
Authors: Eleonora Bilotta, Antonio Lafusa, Pietro Pantano
Venue: Proceedings of the eighth international conference on Artificial life (2002)

This paper introduces a method through which, using genetic algorithms on two dimensional cellular automata, we obtain emergent phenomena of self-replication. Three indices of complexity, based on input entropy have been developed and used as fitness functions in the evolutionary experiments. The genetic algorithm, realized by a special design of the genome, is efficient and the research in the CA rules space has given appreciable results, both for the quantity and for the quality of the emergent phenomena. We found that each of these indices is strictly connected to the complexity of the rules and to the self-reproducers behavior contained in them. We noticed that self-reproduction is a widespread process also in artificial life simulations. Almost all the evolved rules manifest self-reproducers, as if this process were an embedded characteristic of artificial/living matter. The self-reproducers, different in shape, function and behavior, reveal an algorithmic logic in self-replication, which follows different but synchronized rhythms, evidencing variation, increasing structural complexity and some of them general constructive capacity.
Methodology for designing a computer architecture
Authors: Javaid Aslam
Venue: ACM SIGARCH Computer Architecture News (1984)

To design a computer architecture for a class of computations (algorithms), systematically and in a top-down fashion, a general and uniform methodology should be developed. For a given class, there exists an information structure of the architecture such that efficient performance can be achieved for the given class. The methodology is used to find such an information structure and then, to define the control structure of the architecture at functional level. The control structure itself can be treated as another architecture (with a different computing environment), and therefore, again, its Information Structure and then Control Structure (at a lower level) could be found using the same methodology. This recursive application of the methodology to define and design Information Structures and Control Structures terminates when the Control Structure can be trivially 'hard-wired'. Power of the methodology will lie in its generality, i.e. it could be used to design an architecture for practically any arbitrary computing environment.
Tolerating Network Failures in System Area Networks
Authors: Jeffrey Tang, Angelos Bilas
Venue: Proceedings of the 2002 International Conference on Parallel Processing (2002)

In this paper, we investigate how system area networks can deal with transient and permanent network failures. We design an implement a firmware-level retransmission schemeto tolerate transient failures and an on-demand network mapping scheme to deal with permanent failures. Both schemes are transparent to applications and are conceptually simple and suitable for low-level implementations, e.g. in firmware. We then examine how the retransmission scheme affects system performance and how various protocol parameters impact system behavior. We analyze and evaluate system performance by using a real implementation on a state-of-the art cluster an both micro-benchmarks and real applications from the SPLASH-2 suite.
A Content Placement and Management System for Distributed Web-Server Systems
Authors: Chu-Sing Yang, Mon-Yen Luo
Venue: Proceedings of the The 20th International Conference on Distributed Computing Systems ( ICDCS 2000) (2000)

Clusters of commodity computers are becoming an increasingly popular approach for building cost-effective high performance Internet servers. However, how to place and manage content in such a distributed and complex system becomes a challenging problem. In particular, such distributed servers tend to be more heterogeneous, and this heterogeneity will further increase the management burden. This paper describes the motivation, design, implementation and performance of a content placement and management system for the heterogeneous distributed Web server.
Fault Tolerant Leader Election with Termination Detection, in General Undirected Networks
Authors: Reuven Bar-Yehuda, Shay Kutten
Venue:  (1986)

The problem of leader election in an asynchronous network with possible faulty edges (and nodes) is studied. In our model, a faulty edge is an edge which does not transfer messages in both directions. The election is needed in such cases in order to reorganize the network after failures have occurred. The goal is a fault tolerant algorithm with detection of termination. The common methods for the heavily studied termination detection cannot be applied in unreliable networks. Actually, when there is no additional knowledge, it is obvious that no fault tolerant algorithm can guarantee termination detection. However in real networks it is reasonable to expect that some global information, such as ``how many nodes form a majority'''', is known. For this model we present an $0(n ^ 2 + m)$ messages complexity algorithm, and each message is $0(log(MazId))$ bits (where $n$ is number of nodes, $m$ the number of edges and $MaxId$ is the maximum identify.) Before presenting the formal algorithm and proofs, we present an informal description in which we construct our algorithm step by step. The algorithm guarantees termination in a component with a majority of the nodes. This algorithm can be used in networks in which message transmission is not restricted to the FIFO discipline. Thus, the memory (or the time and messages) needed to simulate the FIFO discipline, is saved. The memory space needed in each node is only $0(MaxNodesDegree~+~log(MaxId))$(which, within a constant, is the best possible).