ppxscal/embedding_network huggingface dataset:
Acceptable Numerations of Function Spaces
Authors: K, Akira a
Venue:  (1983)

We study when a numeration of the set of morphisms from a numeration to the other is well-behaved. We call well-behaved numerations ``acceptable numerations''''. We characterize acceptable numerations by two axioms and show that acceptable numerations are recursively isomorphic to each other. We also show that for each acceptable numeration a fixed point theorem holds. Relation between Cartesian closedness and S-m-n property is discussed in terms of acceptable numerations. As an example of acceptable numerations, we study directed indexings of effective domains.
DOING IT WITH MIRRORS: LOW BUDGET STEREO GRAPHICS
Authors: Allen VanGelder, Jane Wilhelms
Venue:  (1994)

Intereactive stereoscopic images can be viewed on a graphics workstation by producing side-by-side images and viewing through a simple mirror device. However, it is important that the viewing device have pairs of adjustable nonparallel mirrors so large windows can be viewed without the human''s sightlines needing to diverge, or ``look wall-eyed". Trans- formations to produce the correct images for this viewing method are described. Previous work applied to the case where both left and right images were to be superimposed and multiplexed in the same region of the screen, often called anaglyphs. Such cases are adequately handled by a translation and an off-axis perspective transformation. The same kind of transformation can be used with a parallel-mirror device, but such devices have practical limitations. This paper shows that nonparallel mirrors require a somewhat more complicated transformation involving scene rotations as well. Derivation of the correct angle of rotation is the main difficulty in computing this transformation. The transformation can be implemented by a sequence of graphics library procedures. Advantages and disadvantages of nonparallel mirror methods are discussed.
Wrens: A Framework for Rapidly Evolvable Network Services
Authors: A. Acharya, M. Ibel, M. Schmitt, M. Koelsch, D. Magdic, B. Smith, M. Tuncer
Venue:  (1999)

In this paper, we describe the Wrens framework for rapidly evolvable network services. The goal of Wrens is to provide the abstractions and the infrastructure that facilitate rapid development, extension and deployment of network services. The design of Wrens is based on four principles. First, the communication structure of services should be specified explicitly in a form that can be understood by the infrastructure. This allows the infrastructure to automatically instantiate complex services, detect many kinds of failures and (in many cases) automatically repair them. In addition, it allows service designers to rapidly prototype services by plugging together existing service components. Second, complex services should be constructed as a collection of interacting service modules that communicate via named channels. Service modules written in this manner are easier to plug together since the interactions between such modules are limited to explicitly named channels. Third, the level of interaction between end-user applications and the communication infrastructure should be raised -- instead of being limited to asking for a communication channel to a specific server, applications should be able to request a named service. This facilitates service evolution as the structure and the implementation of a service can be changed without changing the requesting application. Furthermore, this provides an opportunity for the infrastructure to transparently handle many kinds of faults. Finally, the specification and implementation of services should use symbolic names wherever possible. Symbolic names provide a level of indirection that allows the infrastructure to transparently adapt a service to varying levels of resource availability with relative ease. We describe our prototype implementation of the Wrens framework and report our experiences with developing and deploying a diverse suite of services. Our experience has been positive. We were able to develop these services in a short time. We were also able to develop useful extensions for several of these services in the matter of a few hours. We also present an evaluation of the overheads introduced by the Wrens framework and the costs of end-to-end operations.
Computer monitoring of load test on piles
Authors: G. Lipnik, B. Kovacic, P. Šparl
Venue: Proceedings of the eighth international conference on The application of artificial intelligence to civil and structural engineering computing (2001)

In soft soil foundation must be strengthened with piles. Problem is always local, so measurement must be done on working location. Building company can only guess the quality of piles support. Laboratory for electrical measurement on Faculty for Electrical Engineering and Computer science and faculty for civil engineering developed special measurement of the load capacity of pile. Strains in the pile and vertical displacements of the pile were measured to depth of 15-m during load test. Measurements indicated the upper load limit of the pile and behaviour of the pile during load test.
E-commerce in construction: barriers and enablers
Authors: K. Ruikar, C. J. Anumba, P. M. Carrillo, G. Stevenson
Venue: Proceedings of the eighth international conference on The application of artificial intelligence to civil and structural engineering computing (2001)

The Internet has revolutionised the way in which information is stored, exchanged and viewed. It has opened new avenues for businesses, which were only a decade ago almost inconceivable. With the help of the Internet, traditional technologies like Electronic Data Interchange (EDI) and new, emerging technologies like eXtensible Markup Language (XML), it is now possible to reach a much wider, if not a global, audience within a very short span of time at a fraction of the amount it would have cost previously.Thus, the Internet has made the world a much smaller place. Businesses have recognized the possibilities such a revolution has opened up and have plunged into the global race to take advantage of the opportunities offered by the new ICT (Information and Communications Technology). This sudden recognition of the need to adopt new measures has some immediate consequences. There arises a need for businesses to shift from their traditional, tried and tested methods and in some cases, to radically alter these methods to embrace new technology. Such changes can prompt businesses to improve the traditional business processes, innovate their products and services, and develop strategies that are flexible to incorporate new technologies as and when they emerge. The boom in electronic ways of conducting business, or e-commerce, as is commonly referred to, has had knock-on effects on virtually every business sector. The construction industry is no exception.Initially the paper briefly reviews the technologies and business drivers, which have contributed to the evolution of e-commerce, namely EDI and Value Added Networks (VAN). It further outlines, the categories into which e-commerce is divided and briefly discusses e-commerce applications outside construction. It then discusses the current trends of e-commerce in the construction industry along with identifying the barriers and enablers that influence e-commerce adoption. The potential benefits of e-commerce to the construction sector are also discussed.
A Generalization of the Frank Matrix
Authors: James M. Varah
Venue:  (1984)

In this paper, we give a generalization of the well-known Frank matrix and show how to compute its eigensystem accurately. As well, we attempt to explain the ill-condition of its eigenvalues by treating it as a perturbation of a defective matrix.
SPECTRAL-BASED MULTI-WAY FPGA PARTITIONING
Authors: Pak Chan, Martine Schlag, Jason Zien
Venue:  (1994)

Recent research on FPGA partitioning has focussed on finding minimum cuts between partitions without regard to the routability of the partitioned subcircuits. In this paper we develop a spectral approach to multi-way partitioning in which the primary goal is to produce routable subcircuits while maximizing FPGA device utilization. To assist the partitioner in assessing the routability of the partitioned subcircuits, we have developed a theory to predict the routability of the partitioned subcircuits prior to partitioning. Advancement over the current work is evidenced by results of experiments on the standard MCNC benchmarks.
Classifying Network Architectures for Locating Information Sources
Authors: Ron Dolin, Divyakant Agrawal, Amr El Abbadi
Venue:  (1996)

This paper presents three broad classes of network architecture that support discovery of information sources. Relevant concepts such as query routing and the extraction, propagation, and retrieval of metadata are defined. Based on these concepts, different models of locating and querying relevant information sources are presented. Finally, we estimate several important characteristics of these models and classes as well as their expected scalability.
Digitization Regime as a Cause for Variation in Algorithm Performance Across Two Mammogram Databases
Authors: Ramachandran Chandrasekhar, Yianni Attikiouzel
Venue:  (1999)

This paper addresses the problem of variation in performance of the same algorithm, when it was tested out on images from two different public domain databases of digitized mammograms. Investigation of this variation revealed that the two databases had been digitized differently. Beyond differences in spatial and greyscale resolution, there was a still more fundamental difference in how transmitted light intensity was allocated to pixel values. In our case, this difference was as profound as that between expressing a signal in volts and then in dBm. To expect the same algorithm to work equally well on both would be naive; yet, this issue has largely escaped research scrutiny in the context of mammogram databases. Algorithms developed on one database may not work equally well on another, digitized differently. In describing an algorithm, it is preferable to state also the database (and digitization regime) on which it was developed. To allow pixel values to be translated from one database regime to another, it is recommended that a standard optical step-wedge be digitized and embedded in the mammogram during digitization. Eventually, it may be possible to standardize digitization regimes to facilitate easy cross-database validation of the same algorithm.
Untangling the Threads: Reduction for a Concurrent Object-Based ProgrammingModel (Dissertation)
Authors: William E Adams
Venue:  (2000)

Reduction is a technique for simplifying reasoning about systems where a set of sequential executions, which we call `threads'', are executed concurrently. In a concurrent execution, steps from different threads are interleaved. A reduction theorem shows that a concurrent execution is equivalent to an execution in which all the steps of a given thread appear contiguously. These steps can be replaced by a single step representing the complete execution of the thread. Applying reduction to each thread in turn, we reduce a concurrent execution to a sequence of atomic steps, one for each thread. This is a sequential execution, where threads execute one at a time. Reasoning about the sequential reduction is significantly simpler than reasoning about the original execution. In the sequential execution, we do not need to consider the interactions of steps from different threads. We describe a model for concurrent systems, called `Seuss''. In this model, a program is a set of independently executing boxes, which communicate using a form of remote procedure call. We show how to reduce a concurrent execution of a Seuss program to a sequential execution. Since every concurrent execution is equivalent to a sequential execution, we can understand all possible executions of a Seuss program by understanding just its sequential executions. We show three main results. One gives sufficient conditions to guarantee that all threads in an execution terminate. The other two concern reduction of executions in which all threads terminate. We express the reduction results relative to restrictions on which pairs of threads can run concurrently. The first reduction theorem shows a restriction on concurrency that guarantees that every execution can be reduced to a sequential execution. The second reduction theorem gives a stronger restriction on concurrency (so less concurrency is allowed in an execution), but, in return, gives a reduced sequential execution that has stronger fairness properties (and thus better progress properties) than we get with the first theorem. To show these results, we use an operational semantics for a simple Seuss language. The semantics is such that our results apply to any language implementing the Seuss model.
Geometric Performance Analysis of Semaphore Programs
Authors: Marc Abrams
Venue:  (1993)

A key problem in designing parallel programs that achieve a desired performance goal is the ability to analyze exactly program performance, given a specification of the process syncronization structure and the execution timings of all code segments. The problem solved in this paper is to derive, for all possible process starting times, the set of all possible limit cycle execution sequences in which a process blocks. This paper makes two contributions. First, it employs a novel analysis method that derives timed execution sequences from a geometric model of program execution, called timed progress graphs. Second, it solves the timed progress graph not by a computational geometric algorithm, as employed by most solutions in the literature to untimed progress graphs, but by an analytic solution.
A conjugate Gradient Algorithm for the Efficient Training of Artificial Neural Networks
Authors: Christakis Charalambous
Venue:  (1990)

A novel approach is presented for the training of multilayer feedforward neural networks, using a conjugate gradient algorithm. The algorithm updates the unput weights to each neuron in an efficient prallel way, similar to the one used by the well known backpropagation algorithm. The performance of the algorithm is superior to that of the conventional backpropagation algorithm and is based on strong theoretical reasons supported by the numerical results of three examples.
Pocket News: news contents adaptation for mobile user
Authors: Youn-Sik Hong, In-Sook Park, Jeong-Taek Ryu, Hye-Sun Hur
Venue: Proceedings of the fourteenth ACM conference on Hypertext and hypermedia (2003)

We have presented a system called Pocket News that transforms web contents in the internet automatically to the contents to be adapted for a mobile terminal, especially PDA. It is adequate for the web sites whose contents have been updated frequently, like as news contents. We have also proposed a page splitting technique to navigate mobile pages with button controls instead of scroll up/down controls. The proposed system also generates mHTML pages for mobile phone which support Mobile Explorer.
Meps Rev. 3.0 -- A Parallel Message Passing System
Authors: Michael Nolle
Venue:  (1993)

This report serves as a technical documentation on the parallel message passing system MePS developed in the Institute Technische Informatik I at the Technical University of Hamburg-Harburg. The second part of the document can be used as a programmers guide as well. MePS was developed to be used on transputer networks. Up to now the de Bruijn network is requiered as communication topology. All implementations are done in ParC a C dialect for transputer based systems developed by Parsec. For implementations on parallel systems with distributed memory it is necessary to specify the data exchange between the concurrently operating processes. Those communication demands have to be implemented in addition to the computations. ParC offers some communication primitives by means of subroutine calls. Using this primitives it is possible to exchange data between directly connected processors. Neighbours that can be addressed in this way are transputers connected by one of the four links. Every communication between more distant transputers has to use a routing mechanism over some intermediate processors. The implementations of those communication details normally requieres a great portion of the effort of the parallel program generation work. MePs intends to avoid the repeated implementation of those communication details. MePS gives a runtime environment for ParC programs. The connection realized by the environment may be seen as a virtually complete connected parallel system. The user interface is given by means of send and receive functions. They operate in a buffered and asynchronous way. Via those functions it is possible to send / receive data between any pair of processors, broadcast data from one to all processors, get access to a virtual terminal implemented on every processor (the local output of one processor is redirected to the local virtual terminal of that processor with a sl virtprintf(...) routine), synchronize all processors (especial
PARALLEL VOLUME RENDERING ON A SHARED-MEMORY MULTIPROCESSOR
Authors: Judy Challinger
Venue:  (1991)

*Volume rendering* is a powerful, but computationally intensive, computer graphics technique for visualizing volumetric data sets. This paper presents results of investigations into techniques for volume rendering using parallel processing on a shared-memory, multiple-instruction, multiple-data (MIMD) architecture. In particular, two widely used algorithms for volume rendering, *raycasting* and *projection*, have been parallelized on a BBN TC2000, and their performance has been measured and analyzed. Preliminary results indicate that the raycasting approach to volume rendering has some advantages for parallelization on this type of architecture.
Comparing the Performance of Database Selection Algorithms
Authors: James C. French, Allison L. Powell, Jamie Callan, Charles L. Viles, Travis Emmitt, Kevin J. Prey
Venue:  (1999)

We compare the performance of two database selection algorithms reported in the literature. Their performance is compared using a common testbed designed specifically for database selection techniques. The testbed is a decomposition of the TREC/TIPSTER data into 236 subcollections. We present results of a recent investigation of the performance of the CORI algorithm and compare the performance with earlier work that examined the performance of gGlOSS. The databases from our testbed were ranked using both the gGlOSS and CORI techniques and compared to the RBR baseline, a baseline derived from TREC relevance judgements. We examined the degree to which CORI and gGlOSS approximate this baseline. Our results confirm our earlier observation that the gGlOSS Ideal(l) ranks do not estimate relevance-based ranks well. We also find that CORI is a uniformly better estimator of relevance-based ranks than gGlOSS for the test environment used in this study. Part of the advantage of the CORI algorithm can be explained by a strong correlation between gGlOSS and a size-based baseline (SBR). We also find that CORI produces consistently accurate rankings on testbeds ranging from 100--921 sites. However for a given level of recall, search effort appears to scale linearly with the number of databases.
A Schema \& Constraint-Based Representation to Understanding Natural Language
Authors: Eliza W Kuttner
Venue:  (1987)

This thesis attempts to represent the syntax and semantics of English sentences using a schema and constraint-based approach. In this approach, syntactic and semantic knowledge that are represented by schemata are processed in parallel with the utilization of network consistency techniques and an augmented version of Earley''s context-free parsing algorithm. A sentence''s syntax and semantics are disambiguated incrementally as the interpretation proceeds left to right, word by word. Each word and recognized grammatical constituent provide additional information that helps to guide the interpretation process. It is desirable to attempt to apply network consistency techniques and schema-knowledge representations on understanding natural language since the former has been proven to be quite efficient and the latter provides modularity in representing knowledge. In addition, this approach is appealing because it can cope with ambiguities in an efficient manner. Multiple interpretations are retained if ambiguity exists as indicated by the words processed so far. How- ever, incorrect interpretations are eliminated as soon as their inappropriateness is discovered. Thus, backtracking search which is known to be inefficient is avoided. 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
Three-dimensional progressive damage analysis of composite joints
Authors: P. Perugini, A. Riccio, F. Scaramuzzino
Venue: Proceedings of the eighth international conference on The application of artificial intelligence to civil and structural engineering computing (2001)

A three-dimensional progressive damage FEM model, based on the Hashin failure criteria and ply discount material's degradation rules, has been developed. The geometrically non-linear approach, for stress calculation, and the penalty method, for frictional contact forces evaluation, has been adopted in the FEM model here proposed. First, the structural behaviour of a single lap composite joint under in-plane tensile load was investigated and the obtained numerical results were compared with literature experimental data in order to validate the proposed FEM model. Then a comparison between the progressive damage approach and the no-damage approach was performed in order to study the influence of failure mechanisms on the structural behaviour of composite joints. Finally the effectiveness of the developed numerical tool for the prediction of damage on-set and propagation was also critically discussed.
KIDS: Construction of Database Management Systems based on Reuse
Authors: Andreas Geppert, Stefan Scherrer, Klaus R. Dittrich
Venue:  (1997)

This paper describes the KIDS approach to database management system (DBMS) construction. KIDS aims at the development of a DBMS-construction approach by defining specification-based approaches strongly relying on software reuse. We propose an architecture model that supports reuse of architectures, but is also able to integrate various DBMS components into a coherent entirety. Second, KIDS defines a construction process model that strives for reuse in all phases. We have identified three important aspects that are initially addressed by the construction approach: the data model aspect, the transaction management aspect, and the integrity management aspect. For each of these aspects, a customized approach how to construct the corresponding subsystem has been developed, again relying on software reuse wherever possible. While these aspects have been considered because of their relevance for any DBMS, the construction method is open for further aspects.