ppxscal/embedding_network huggingface dataset:
Shallow Multiplication Circuits
Authors: M. S. Paterson, U. Zwick
Venue:  (1990)

Ofman, Wallace and others used carry save adders to design multiplication circuits whose total delay is proportional to the logarithm of the length of the two numbers multiplied. An extension of their work is presented here. The first part presents a general theory describing the optimal way in which given carry save adders can be combined into carry save networks. In the second part, two new designs of basic carry save adders are described. Using these building blocks and the above general theory, the shallowest know theoretical circuits for multiplication are obtained.
ANALYSIS OF SOURCE POLICY IN RATE-CONTROLLED ATM NETWORKS
Authors: Lampros Kalampoukas, Anujan Varma
Venue:  (1996)

This paper provides an analysis of the source policy in the rate-based congestion control algorithm being developed by the ATM Forum and derives approximate analytical closed-form expressions to describe the rate-increase process. These approximations are used to analyze the impact of the source algorithm on the TCP slow-start process operating over a rate-controlled ATM network where rate allocation is performed explicitly in the switches. The results show that the increase in TCP congestion window ramp-up time is noticeable when the round-trip delay is small. When the idle-detection policy is enabled at the source, the slow-start process is significantly prolonged, and results in slower recovery upon a cell loss. The results are verified by simulation.
The influence of column base connectivity on the carrying capacity of columns
Authors: H. H. Lau, M. H. R. Godley, R. G. Beale
Venue: Proceedings of the eighth international conference on The application of artificial intelligence to civil and structural engineering computing (2001)

The carrying capacity of a column with one end pinned and the other end flat subjected to a combined axial load and a side load applied at the middle of the column has been investigated both theoretically and experimentally. The flat end is treated as fixed when in contact with the ground or as an eccentrically loaded, pinned connection rotating about one edge. The column represents a member in the middle of a storage rack where the base-plate connecting the column to the ground is often only lightly bolted.The results of the investigation show that non-stocky columns which have flat ends can carry loads in excess of the Euler pinned buckling loads if the side loads are kept below transition values.
T2: A Customizable Parallel Database For Multi-dimensional Data
Authors: Chialin Chang, Anurag Acharya, Alan Sussman, Joel Saltz
Venue:  (1998)

In this paper, we present T2, a customizable parallel database that integrates storage, retrieval and processing of multi-dimensional datasets. T2 provides support for common operations including index generation, data retrieval, memory management, scheduling of processing across a parallel machine and user interaction. It achieves its primary advantage from the ability to seamlessly integrate data retrieval and processing for a wide variety of applications and from the ability to maintain and jointly process multiple datasets with different underlying grids. Most other systems for multi-dimensional data have focused on uniformly distributed datasets, such as images, maps, and dense multi-dimensional arrays. Many real datasets, however, are non-uniform or unstructured. For example, satellite data consists of a two dimensional strip that is embedded in a three dimensional space; water contamination studies use unstructured meshes to selectively simulate regions and so on. T2 can handle both uniform and non-uniform datasets.
The Computational Complexity of Truth Maintenance Systems
Authors: Gregory M. Provan
Venue:  (1988)

We define the complexity of the problems that the Assumption-Based TMS (ATMS) solves. Defining the conjunction of the set of input clauses as a Boolean expression, it is shown that an ATMS solves two distinct problems: (l) generating a set of minimal supports (or label) for each database literal; and (2) computing a minimal expression (or set of maximal contexts) from the set of minimal supports. The complexity of determining the set of minimal supports for a set $x$ of literals with respect to a set $X$ of clauses is exponential in the number of assumptions for almost all Boolean expressions, even though a satisfying assignment for the literals occurring in $X$ can be found in linear time. Generating a minimal expression is an NP-hard problem. The ATMS algorithms can be used with many control mechanisms to improve their performance for both problems; however, we argue that manipulating the label set (which is exponential in the number of assumptions) requires considerable computational overhead (in terms of space and time), and that it will be infeasible to solve moderately large problems without problem restructuring.
Metadata Management for Data Warehousing: Between Vision and Reality
Authors: Anca Vaduva, Klaus R. Dittrich
Venue:  (2000)

Capturing, representing and processing metadata promises to facilitate the management, consistent use and understanding of data and thus better support the exploitation of masses of information that is available online today. Despite the increasing interest in metadata management, its purpose, requirements and problems are still not clear. This is particularly true in the area of data warehousing. The reasons are multiple. Compared to the past, today''s metadata management considers a significantly larger spectrum of information (including even certain pieces of programs). Moreover, metadata are produced by various tools and reside in different sources which need to be integrated in order to ensure consistency and provide uniform access, impact analysis and tracking. Existing work has only partially covered some of these aspects, such that no comprehensive view exists so far. Therefore, this paper summarizes the most important issues of metadata management for data warehousing, including the role of metadata and solved and unsolved problems of the available solutions. The design of an appropriate information model, metadata integration and advanced user interaction facilities are crucial questions to be answered.
Effect of Elevated Mass Center on the Global Stability of a Solid Supported by Elastica Columns
Authors: William I. Thacker, C. Y. Wang, Layne T. Watson
Venue:  (1996)

Recently we advocated a new stability index, the global critical load, for very elastic structures. This index is extremely useful for flexible structures under large disturbances such as earthquakes. The present note determines this index for a two-dimensional rigid solid supported by two flexible columns. Using the nonlinear elastica equations the buckling and postbuckling problem is solved by a homotopy nonlinear system solver. The present results show the bifurcation curve is quite sensitive to the elevated mass center. The global buckling load is drastically reduced although the critical buckling load of linear stability analysis is the same. An explanation is given through the study of a solid supported by one column.
An Agenda for Human-Computer Interaction Research: User Interface Development Processes and Methodologies
Authors: H. R Hartson
Venue:  (1991)

This paper is the result of one working group in a workshop entitled "An Agenda for Human-Computer Interaction Research: Science and Engineering Serving Human Needs." The workshop, sponsored by the National Science Foundation, brought together "20-25 of the most prominent HCI researchers from the disciplines of computer science, engineering, information science, psychology, and human factors along with several NSF staff members." The workshop results, to appear in the HCI literature, identify critical research issues and potential avenues for assaulting them, along with necessary infrastructure recommendations related to educational, professional, and facility problems. The overall topical area was divided into five areas, each with an individual researcher in charge of directing discussion and reporting on the area. The areas included theory and taxonomy of HCI models, the interface development process, I/O devices and interaction styles, software tools, and computer supported collaborative work.
Application of simulated annealing to optimal barreling of externally pressurised shells
Authors: J. Blachut
Venue: Proceedings of the eighth international conference on The application of artificial intelligence to civil and structural engineering computing (2001)

The load carrying capacity, of externally pressurised and optimally shaped metallic shell, has been increased by 40 % over the performance of an equivalent cylinder. The optimal geometry has been sought within a class of generalised ellipses by the application of simulated annealing algorithm.The optimal solution has been verified experimentally by collapsing two, nominally identical, CNC-machined, mild steel shells at about 17 MPa. The wall thickness of the optimal shell was about 2.6 mm, its height was about 100 mm and its diameter was 200 mm. The effect of initial geometric imperfections on the ultimate load is also discussed. The comparison of theoretical and experimental results is good.
Classification of Moving Objects from Real World Image Sequences
Authors: Sok G Lim, Mike Alder, Christopher J.S. deSilva, Yianni Attikiouzel
Venue:  (1995)

In a previous paper, we presented a syntactic approach to classifying In a previous paper, we presented a syntactic approach to classifying objects in a domestic environment such as human beings, curtains blown by the wind, and external events such as moving tree branches. We introduced Quadratic Neural Networks (QNNs) to model the input data and then extract features of the objects from the model. We called the feature extraction process the UpWrite. With only one level of UpWrite we were able to achieve around 90% recognition rate. In this paper, we introduce another level of UpWrite to overcome some of the problems that the first UpWrite failed to handle.
Polylogarithmic Approximation for Minimum Communication Spanning Trees
Authors: D. Peleg
Venue:  (1997)

This paper considers a problem introduced in [Hu74], concerning the selection of a minimum communication spanning tree (MCT) for a given weighted network, namely, a tree that minimizes the total cost of transmitting a given set of communication requirements between n sites over the tree edges. Some special cases of the problem are solved in [Hu74]. An equivalent but slightly different formulation of the problem is given in [AKPW95], based on the concept of a spanning tree of low average stretch for weighted connected multigraphs. An algorithm is presented in [AKPW95] for constructing a spanning tree with average stretch O(2O{logn}) for any given multigraph, yielding an approximation algorithm for the MCT problem with a similar approximation ratio. It is conjectured in [AKPW95] that the true bound on average stretch is O(logn). This paper shows that for every weighted complete multigraph (with arbitrary multiplicities) there exists a spanning tree whose average stretch is bounded by O(ln n5/2 n?ln D), where D is the network''s diameter. The proof yields an approximation algorithm for minimum communication spanning trees with ratio O(ln5/2n?ln D). 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
EMPIRICAL EVALUATION OF MULTILEVEL LOGIC MINIMIZATION TOOLS FOR A FIELD-PROGRAMMABLE GATE ARRAY TECHNOLOGY
Authors: Martine D. F. Schlag, Pak K. Chan, Jackson Kong
Venue:  (1991)

We examine empirically the performance of multi-level logic minimization tools for a lookup table-based Field-Programmable Gate Array (FPGA) technology. The experiments are conducted by using the university tools *misII* for combinational logic minimization and *mustang* for state assignment, the industrial tools *xnfmap* for technology mapping, and *apr* for automatic placement and routing. We measure the quality of the multi-level minimization tools by the number of *routed* configurable logic blocks (CLBs) in the FPGA realization. We report three results: a) we have developed a new system to support rapid prototyping using FPGAs, b) there is a linear relationship between the number of literals and the number of *routed* CLBs, and c) in all but one of the 31 *MCNC-89* benchmark finite state machines, one-hot state assignment resulted in substantially less CLBs than any other state encoding method. These results are useful to those who prototype a design in FPGAs, and then transfer the design to a different technology (e.g., CMOS standard cell). It provides valuable information on the difference in performance of a design realized in different technologies.
A Fast Divide \& Conquer Protocol for Contention Resolution on Broadcast Channels
Authors: Karl Abrahamson
Venue:  (1985)

We describe a contention resolution protocol for an ethernet-like broadcast channel The protocol is based on tree algorithms, particularly that of Greenberg. We show how to obtain a simpler and more accurate estimate of the number of contending stations than Greenberg''s method, and use the new estimation method to obtain an improved protocol.
Portals unlock the knowledge that drives business value
Authors: Robert Duffner
Venue: Designing portals: opportunities and challenges (2003)

In this chapter, Robert Duffner, director of product marketing at BEA Systems, defines the landscape and technologies for tenterprise portals. Beginning with the business driver's that led to the historical creation of the product category, the article goes on to describe the three generations of portal product evolution form simple packaged applications to robust portal platforms. Duffner describes a five-tier framework that defines the technical underpinnings of the ideal portal platform and provides a vision for how the technology will evolve over time.
A Developer''s Survey of Polygonal Simplification Algorithms
Authors: David Luebke
Venue:  (1999)

Polygonal simplification, a.k.a. level of detail, is an important tool for anyone doing interactive rendering, but how is a developer to choose among the dozens of published algorithms? This article surveys the field from a developer''s point of view, attempting to identify the issues in picking an algorithm, relate the strengths and weaknesses of different approaches, and describe a number of published algorithms as examples.
Verteilungstransparenz in Datenbanksystemen
Authors: J. Kusch, G. Saake
Venue:  (1996)

Datenbanksysteme werden zunehmend zu der ma?gebenden Komponente von Informationssystemen. Sie verwalten fur die Anwendungen umfangreiche Mengen an gespeicherten Informationen. Um die naturlichen Modi des Denkens und Arbeitens von Menschen und Organisationen gerade in Bezug auf Kooperation besser zu unterstutzen, werden Rechnernetze eingesetzt. Hierbei kann ein verteiltes Datenbanksystem als integrierende Plattform fur verschiedene Anwendungen, die auf voneinander entfernten Rechnern plaziert sind, dienen. Aufgrund der zur Einbettung von Informationssystemen in sich andernde Organisationsstrukturen benotigten Skalierbarkeit konnen grundlegende Entscheidungen uber die Verteilungsstrukturen nicht zweckerfullend im voraus getroffen werden. Die Phase des Verteilungsentwurf mu? somit durch ein vom Zugriffsprofil auf die Daten und weiteren Anforderungen abhangiges Verteilungstuning ersetzt werden. Dies ist nur moglich, wenn die Aspekte der Verteilung dem Anwender und Systementwickler in transparenter aber dennoch beeinflu?barer Weise zur Verfugung stehen. Dieser Bericht gibt einen Eindruck uber den aktuellen Stand verteilter Datenbanksysteme bezuglich der unterstutzten Verteilungsformen und Transparenzeigenschaften wieder. Da der Bereich der Mehrrechnerdatenbanksysteme variantenreich ist und sich noch keine Standardisierung bezuglich der Terminologie durchgesetzt hat, erfolgt zunachst eine Einordnung von verteilten Datenbanksystemen. Daraufhin werden abhangig vom Datenbanksystem und auch speziell fur transparent verteilte Daten verschiedene Datenbankentwurfsprozesse vorgestellt. Grundlegend fur verteilte Datenbanksysteme in Bezug auf Datenverteilung sind die Konzepte Datenbankmanagementsystem-Architektur, Schemakatalog, Objektidentifikation und Objektklassenpartitionierung, die zunachst systemunabhangig diskutiert werden. Als Schwerpunkt dieses Berichts werden anschlie?end existierende Systeme in Hinblick auf unterstutzte Verteilungseinheiten und -moglichkeiten untersucht. Im einzelnen sind dies die verteilten relationalen Datenbanksysteme ADDAM, CA-DB:STAR, Distributed INGRES, INFORMIX-STAR, Oracle-7, Porel, PROGRESS-V8, R*, SDD-1 und Sybase-10 sowie die verteilten objektorientierten Datenbanksysteme Arjuna, Bellerophon, EOS, ITASCA, Mariposa, MO2-GO, Objectivity/DB-3.0, ORION-2, PCTE, Shore und VERSANT-R4. Hierbei hat sich gezeigt, da? insgesamt den wichtigen Eigenschaften von Skalierbarkeit und Verfugbarkeit, die einher mit Verteilungstransparenz ma?gebend fur verteilte Datenbanksysteme sind, zu wenig Beachtung geschenkt wird.
Linear Feature Extraction using the Multiresolution Fourier Transform
Authors: A. R. Davies, R. G. Wilson
Venue:  (1990)

A hierarchical space-time image representation - the Multiresolution Fourier Transform (MFT) - is discussed, and its properties are used in order to define a spectrum based model for the class of simple linear features, such as straight lines and edges. The model is used to derive a method of identifying these features and estimating their parameters, ie position and orientation. Results are presented for this process using a test image. The effect of white noise is considered, and a correlation measure is defined to show the effect of the noise upon the model. A method of further improving the results for a noisy image, by smoothing with oriented ellipses is also considered.
Set-Serializability: A Formal Theory for Partitioned Data
Authors: Gustavo Alonso, Amr El Abbadi
Venue:  (1993)

High transaction throughput in a distributed database system can be achieved by increasing the autonomy of each site. This can be achieved by making more data available locally. One way to ensure this is to partition data items in several subsets and allocate one subset to each site. As long as a transaction can execute locally using the data items allocated to a single site, it will not need to access data at other sites. An example of partitioned data is a ticket reservation system in which instead of locating all the tickets for an event in one central site, they are divided into several lots and each lot is allocated to a site. In that way, sites can proceed locally without communication with the central site or with other sites, speeding up the processing of transactions. To guarantee correct executions, constraints must be imposed on the operations that can be executed in parallel over the partitioned data items. These constraints can be represented as distributed assertions and a mechanism must be provided to maintain them across the distributed system. The fact that the data has been partitioned may lead to situations in which an operation can not be performed over a partition of the data but it could be done if the data was not partitioned. As a consequence, Data Partitioning may reduce the overall availability of data, which is clearly undesirable. To solve this problem, a protocol has to be developed to dynamically redefine a partition of data in such a way that the data is available at the site where it is needed. In this paper we introduce a general theory for distributed assertions and a protocol for maintaining the validity of these assertions over a distributed database. The operations of the protocol are executed as an atomic transaction, which allows an analysis of the problem using an extension of serializability theory. Set-serializability is defined as the correctness criteria for these type of databases. It has the advantage of allowing standard serializable histories and histories that, due to the execution of the protocol for partitioned data, contain cyclic dependencies among transactions. Such transactions must cooperate to maintain the correctness of the database and the validity f the distributed assertions. Thus, set-serializability guarantees the correctness of the database both from the serializability point of view and from the assertions point of view. Our approach is novel and makes several significant contributions. Our theory models both partitioned and non-partitioned data objects and we propose solutions that integrate both concurrency control and recovery. In particular, we propose the notion of transactions sets and set history, that allow a set of independent transactions to cooperate to maintain the database consistency and to terminate conditionally to each other. Thus, the set of executions allowed by set-serializability is a superset of of that allowed by serializability. Previous approaches considered
Thermal load produced part-through cracks in cement mortar layer on foamed concrete system floors
Authors: J. H. J. Kim
Venue: Proceedings of the eighth international conference on The application of artificial intelligence to civil and structural engineering computing (2001)

This paper analyzes the cracks with average spacing in the top cement mortar layer of a foamed concrete floor system due to thermal loading. The cracks are assumed to propagate transversely in one parallel direction with a uniform spacing across the cement mortar layer. The analysis includes the characteristic of the formed cracks reaching only a part of the thickness of the cement mortar layer. The cement mortar layer supported by foamed concrete, rubber, and reinforced concrete slab layers can be considered as a beam with a variable crack depth profile. The material properties of foamed concrete floor system as an elastic foundation will be discussed. The cracks are modeled using the Rice-Levy nonlinear softening line spacing model. The cement mortar layer with cracks is analyzed using a compliance function for bending moments and axial forces in the crack plane. The parallel crack is divided into vertical strips. The cement mortar material behavior of elastic strength, plastic yield, fracture criterions are included in the analysis. The maximum thermal load is reached when the largest vertical crack growth reaches its limit where the growth becomes insignificant. The numerical calculations will be discussed in detail.
Browsing and Placement of Multiresolution Images on Secondary Storage
Authors: Sunil Prabhakar, Divyakant Agrawal, Amr El Abbadi, Ambuj Singh, Terence Smith
Venue:  (1996)

With the rapid advances in computer and communication technologies, there is an increasing demand to build and maintain large image repositories. In order to reduce the demands on I/O and network resources, multiresolution representations of images are being proposed for the storage organization of images. Image decomposition techniques such as {\em wavelets} can be used to provide multiple resolution images. The image is represented by several coefficients, one of them with visual similarity to the original image but at a lower resolution. Thus, these visually similar coefficients can be thought of as the {\em thumbnails} or {\em icons} of the original image. This paper addresses the problem of storing these multiresolution coefficients on disk(s) so that thumbnail browsing as well as image reconstruction can be performed efficiently. Several strategies are evaluated to store the image coefficients on parallel disks. These strategies can be classified into two broad classes depending on whether the browsing pattern of the images is used in the placement of image coefficients. Disk simulation is used to evaluate the performance of these strategies. The data used in the simulation are of two types: the texture samples from the Brodatz collection as well as 50,000 real landsat images. The results indicate that significant performance improvements can be achieved with as few as four disks by placing image coefficients based upon the browsing access patterns.