ppxscal/embedding_network huggingface dataset:
Critical loading events for the assessment of medium span bridges
Authors: C. C. Caprani, S. A. Grave, E. J. O'Brien, A. J. O'Connor
Venue: Proceedings of the sixth conference on Computational structures technology (2002)

This paper describes the simulation of free-flowing traffic across bridges to predict the characteristic values for bridge load effects such as bending moment and shear force. The results of these simulations are then used to demonstrate that, in predicting the characteristic extreme load effects to which a bridge may be subjected, it is not sufficient to solely model one- or two-truck presence events. It is shown that loading events involving three or more trucks may need be included in the model for short to medium spans. The critical loading events for a particular load effect are strongly dependent on the span and the shape of the influence line.
LOTTO: group formation by overhearing in large teams
Authors: Francois Legras, Catherine Tessier
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

We present in this paper an extension to our overhearing-based group formation framework \otto (Organizing Teams Through Overhearing). This framework allows a team to dynamically re-organize itself in accordance to the evolution of the communication possibilities between agents. In \otto, each agent overhears some of the messages exchanged within the team and uses them to incrementally update a map of the organization of the team. One of the key points of \otto is that only few resources are used - a small data structure is used to track each team member and there is no need to store the overheard messages. With \lotto (\otto for Large numbers of agents) we address the problem of large teams in which using \otto "as is" would be costly in terms of memory and therefore contrary to \otto's philosophy of low resource usage. Therefore, we have implemented a strategy that allows an agent with a limited memory to track only a part of the team. We have run a series of experiments in order to evaluate the impact of this limitation and present some results.
Enhancing the Scalability and Usability of Computational Grids via Logical User Accounts and Virtual File Systems
Authors: Nirav H. Kapadia, Renato J. Figueiredo, Jose A. B. Fortes
Venue: Proceedings of the 10th Heterogeneous Computing Workshop â"" HCW 2001 (Workshop 1) - Volume 2 (2001)

This paper elaborates on mechanisms by which users, data, and applications can be decoupled from individualcomputers and administrative domains. The mechanisms, which consist of logical user accounts and a virtual file system, introduce a layer of abstraction between the physical computing infrastructure and the virtual computational grid perceived by users. This abstraction converts compute servers into interchangeable parts, allowing a computational grid to assemble computing systems at run time without being limited by the traditional constraints associated with user accounts, file systems, and administrative domains. The described approach has already been deployed in the context of PUNCH (the Purdue University Network Computing Hubs), and is unique in its ability to integrate unmodified applications (even commercial ones) and existing computing infrastructure into a heterogeneous, wide-area network computing environment.
Topic-Sensitive PageRank: A Context-Sensitive Ranking Algorithm for Web Search
Authors: Taher H. Haveliwala
Venue: IEEE Transactions on Knowledge and Data Engineering (2003)

The original PageRank algorithm for improving the ranking of search-query results computes a single vector, using the link structure of the Web, to capture the relative “importance” of Web pages, independent of any particular search query. To yield more accurate search results, we propose computing a set of PageRank vectors, biased using a set of representative topics, to capture more accurately the notion of importance with respect to a particular topic. For ordinary keyword search queries, we compute the topic-sensitive PageRank scores for pages satisfying the query using the topic of the query keywords. For searches done in context (e.g., when the search query is performed by highlighting words in a Web page), we compute the topic-sensitive PageRank scores using the topic of the context in which the query appeared. By using linear combinations of these (precomputed) biased PageRank vectors to generate context-specific importance scores for pages at query time, we show that we can generate more accurate rankings than with a single, generic PageRank vector. We describe techniques for efficiently implementing a large-scale search system based on the topic-sensitive PageRank scheme.
Xept: A Software Instrumentation Method For Exception Handling
Authors: K.-P. Vo, Y.-M. Wang, P. E. Chung, Y. Huang
Venue: Proceedings of the Eighth International Symposium on Software Reliability Engineering (1997)

Modern software systems are often built from existing library components. A common problem is how to fix bugs when source code is not available. Xept is an instrumentation language and tool that can be used to add to object code the ability to detect, mask, recover and propagate exceptions from library functions. This helps to alleviate or avoid a large class of errors resulting from function misuses. Examples are given to show applications of Xept in actual software systems.
The use of dynamic contexts to improve casual internet searching
Authors: Gondy Leroy, Ann M. Lally, Hsinchun Chen
Venue: ACM Transactions on Information Systems (TOIS) (2003)

Research has shown that most users' online information searches are suboptimal. Query optimization based on a relevance feedback or genetic algorithm using dynamic query contexts can help casual users search the Internet. These algorithms can draw on implicit user feedback based on the surrounding links and text in a search engine result set to expand user queries with a variable number of keywords in two manners. Positive expansion adds terms to a user's keywords with a Boolean "and," negative expansion adds terms to the user's keywords with a Boolean "not." Each algorithm was examined for three user groups, high, middle, and low achievers, who were classified according to their overall performance. The interactions of users with different levels of expertise with different expansion types or algorithms were evaluated. The genetic algorithm with negative expansion tripled recall and doubled precision for low achievers, but high achievers displayed an opposed trend and seemed to be hindered in this condition. The effect of other conditions was less substantial.
Indexing for progressive skyline computation
Authors: Pin-Kwang Eng, Beng Chin Ooi, Kian-Lee Tan
Venue: Data Knowledge Engineering (2003)

Many decision support applications are characterized by several features: (1) the query is typically based on multiple criteria; (2) there is no single optimal answer (or answer set); (3) because of (2), users are typically looking for satisficing answers; (4) for the same query, different users, dictated by their personal preferences, may find different answers meeting their needs. As such, it is important for the DBMS to present all interesting answers that may fulfill a user's need. In this paper, we focus on the set of interesting answers called the skyline. Given a set of points, the skyline comprises the points that are not dominated by other points. A point dominates another point if it is as good or better in all dimensions and better in at least one dimension. We present two novel indexing schemes to compute the skyline of a set of points progressively. Unlike most existing algorithms that require at least one pass over the dataset to return the first interesting point, our algorithms return interesting points gradually as they are identified. The first algorithm, Bitmap, is completely non-blocking and exploits a bitmap structure to quickly identify whether a point is an interesting point or not. The second method, Index, exploits a transformation mechanism and a B+-tree index to return skyline points in batches. Our extensive performance study shows that the proposed algorithms provide quick initial response time as compared to existing algorithms. Moreover, both schemes can also outperform existing techniques in terms of total response time. While Index is superior in most cases, Bitmap is effective when the number of distinct values per dimension is small as well as when the number of skyline points is large.
Active Streaming in Transport Delay Minimization
Authors: Javed I. Khan
Venue: Proceedings of the 2000 International Workshop on Parallel Processing (2000)

In this paper, we present a technique for reducing response delay for web systems, which is based on a proactive cache scheme. It combines predictive pre-fetching and streaming to overlap the read-time with loading time. This graph-based model analyzes the hyperlink structure to form the prediction. It also utilizes data streaming to further minimize the pre-load, without compromising the responsiveness. The analysis demonstrates that such new hyper-graph based pre-fetching can reduce the lag-time of a cache system by a factor ranging from 2-10. In this paper, we focus on pre-fetching and provide the technique, the optimization algorithms and the simulation results.
Concurrent Local Search for Fast Proximity Algorithms on Parallel and Vector Architectures
Authors: Peter Su
Venue:  (1992)

This paper presents a fast algorithm for solving the all-nearest-neighbors problem. The algorithm uses a data parallel style of programming which can be efficiently utilized on a variety of parallel and vector architectures [4,21,26]. I have implemented the algorithm in C on one such architecture, the Cray Y-MP. On one Cray CPU, the implementation is about 19 times faster than a fast sequential algorithm running on a Sparc workstation. The main idea in the algorithm is to divide the plane up into a fixed grid of cells, or buckets. When the points are well distributed, the algorithm processes each query point, q, by searching a small number of cells close to q. Bentley, WEide and Yao first presented this idea for conventional architectures [3], but the technique works equally well on parallel and vector machines, leading to a simple, efficient algorithm. We can also use the cell technique to solve a wide variety of basic computational problems such as finding closest pairs, sorting and constructing Voronoi diagrams and Delaunay triangulations.
Computing Dominators and Its Applications on Processor Arrays with Reconfigurable Bus Systems
Venue: Proceedings of the 1996 International Symposium on Parallel Architectures, Algorithms and Networks (1996)

This paper makes an efficient improvement of processor complexity while solving some connectivity problems in processor arrays with reconfigurable bus systems. We first derive two constant time algorithms in the proposed parallel processing system for computing the dominators and the dominator tree of an undirected graph either using a 3-D n * n * n processors or a 2-D n^2 * n^2 processors, where n is the number of vertices of the graph. Then based on the dominator tree algorithm, we also solve many other graph connectivity problems in constant time. They are the articulation points, bridges, biconnected components,and bridge-connected components problems in undirected graphs.
Drishti: An Integrated Navigation System for Visually Impaired and Disabled
Authors: Abdelsalam (Sumi) Helal, Steven Edwin Moore, Balaji Ramachandran
Venue: Proceedings of the 5th IEEE International Symposium on Wearable Computers (2001)

Drishti is a wireless pedestrian navigation system. It integrates several technologies including wearable computers, voice recognition and synthesis, wireless networks, Geographic Information System (GIS) and Global positioning system (GPS). Drishti augments contextual information to the visually impaired and computes optimized routes based on user preference, temporal constraints (e.g. traffic congestion), and dynamic obstacles (e.g. ongoing ground work, road blockade for special events). The system constantly guides the blind user to navigate based on static and dynamic data. Environmental conditions and landmark information queried from a spatial database along their route are provided on the fly through detailed explanatory voice cues. The system also provides capability for the user to add intelligence, as perceived by the blind user, to the central server hosting the spatial database. Our system is supplementary to other navigational aids such as canes, blind guide dogs and wheel chairs.
Wavelet bases in H(div) and H(curl)
Authors: Karsten Urban
Venue:  (1998)

Some years ago, compactly supported divergence-free wavelets have been constructed which also give rise to a stable (biorthogonal) wavelet splitting of H(div). These bases have successfully been used both in the analysis and numerical treatment of the Stokes- and Navier-Stokes equations. In this paper, we construct stable wavelet bases for the stream function spaces H(curl). Moreover, curl-free vector wavelets are constructed and analysed. The relationship between H(div) and H(curl) are expressed in terms of these wavelets. We obtain discrete (orthogonal) Hodge decompositions. Our construction works independently of the space dimension, but in terms of general assumptions on the underlying wavelet systems in L^2(\Omega) that are used as building blocks. We give concrete examples of such bases for tensor product and certain more general domains $\Omega\subset\er^n$. As an application, we obtain wavelet multilevel preconditioners in H(div) and H(curl). EMAIL:: urban@dragon.ian.pv.cnr.it KEYWORDS:: H(div), H(curl), stream function spaces, wavelets
Measuring the performance of parallel message-based process architectures
Authors: D. C. Schmidt, T. Suda
Venue: Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 2)-Volume - Volume 2 (1995)

Message-based process architectures are widely regarded as an effective method for structuring parallel protocol processing on shared memory multi-processor platforms. A message-based process architecture binds one or more processing elements with data messages and control messages received from applications and network interfaces. In this architecture, parallelism is achieved by simultaneously escorting multiple messages on separate processing elements through a stack of protocol tasks. The paper reports performance results from empirical comparisons of a connection-oriented TCP/IP protocol stack implemented using two different parallel message-based process architectures. These performance experiments measure the throughput, context switching, and synchronization exhibited by the two process architectures on a shared memory multi-processor platform. The experimental results demonstrate the extent to which the selection of a parallel process architecture affects protocol stack performance.
Existential Types for Imperative Languages: Technical Results
Authors: Dan Grossman
Venue:  (2001)

This technical report contains the full type-safety proof for the language presented in the paper \emph{Existential Types for Imperative Languages}, originally submitted for publication in October 2001. Because this report should be read only after the paper, effectively as an appendix, we do not repeat the motivation, examples, and informal presentation contained there. Also refer to the paper for related work and a bibliography. We do repeat the figures and definitions so that this report comprises a self-contained proof. 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
Path Optimization for Graph Partitioning Problems
Authors: W. Jonathan Berry, Mark K. Goldberg
Venue:  (1995)

This paper presents a new heuristic for graph partitioning called Path Optimization PO, and the results of an extensive set of empirical comparisons of the new algorithm with two very well known algorithms for partitioning: The Kernighan-Lin algorithm and simulated annealing. Our experiments are described in detail, and the results are presented in such a way as to reveal performance trends based on several variables. Sufficient trials are run to obtain 99% confidence intervals small enough to lead to a statistical ranking of the implementations for various circumstances. The results for geometric graphs, which have become a frequently-used benchmark in the evaluation of partitioning algorithms, show that PO holds an advantage over the others. In addition to the main test suite described above, comparisons of PO to more recent partitioning approaches are also given. We present the results of comparisons of PO with a parallelized implementation of Goemans'' and Williamson''s 0.878 approximation algorithm, a flow-based heuristic due to Lang and Rao, and the multilevel algorithm of Hendrickson and Leland.
MDD-Based Synthesis of Multi-Valued Logic Networks
Authors: Rolf Drechsler, Mitch Thornton, David Wessels
Venue: Proceedings of the 30th IEEE International Symposium on Multiple-Valued Logic (2000)

A method for the synthesis of large Multi-Valued Logic Networks (MVLNs) using Multi-Valued Decision Diagrams (MDDs) is presented. The size of the resulting circuit is linear in the size of the original MDD. In contrast to previously presented approaches to circuit design using MDDs; here the nodes are not substituted by multiplexers. Instead, a small circuit is created representing the functionality of each edge in the graph. The resulting circuits have nice properties with respect to area/delay estimation and power dissipation. Experimental results are given to illustrate the efficiency of the approach.
Piecewise quadratic trigonometric polynomial curves
Authors: Xuli Han
Venue: Mathematics of Computation (2003)

Analogous to the quadratic B-spline curve, a piecewise quadratic trigonometric polynomial curve is presented in this paper. The quadratic trigonometric polynomial curve has C2 continuity, while the quadratic B-spline curve has C1 continuity. The quadratic trigonometric polynomial curve is closer to the given control polygon than the quadratic B-spline curve.
DNA evolutionary linguistics and RNA structure modeling: a computational approach
Authors: T. Yokomori, S. Kobayashi
Venue: Proceedings of the First International Symposium on Intelligence in Neural and Biological Systems (INBS'95) (1995)

The authors are concerned with analysing formal linguistic properties of DNA sequences in which a number of the language theoretic analysis on DNA sequences are established by means of computational methods. First, employing a formal language theoretic framework, the authors consider a kind of evolutionary problem of DNA sequences, asking (1) how DNA sequences were initially created and then evolved (grew up) to be a language of certain complexity, and (2) what primitive constructs were minimally required for the process of evolution. In terms of formal linguistic concepts, the authors present several results that provide their views on these questions at a conceptual level. Based on the formal analysis on these biological questions, the authors then choose a certain type of tree generating grammars called tree adjunct grammars (TAG) to attach the problem of modeling the secondary structure of RNA sequences. By proposing an extended model of TAGs, the authors demonstrate the usefulness of the grammars for modeling some typical RNA secondary structures including "pseudoknots", which suggests that TAG families as RNA grammars have a great potential for RNA secondary structure prediction.
CharToon 2.1 extensions; Expression repertoire and lip sync
Authors: Zs Ruttkay, Alban D.F. Lelievre
Venue:  (2000)

CharToon is a modular system to design and animate 21/2D faces and other graphic al objects. This report contains the extensions made for version 2.1, effecting only the Animation Editor module. The new features allow the re-usage of a reper toire of expression snapshots and animations and automatic generation of lip-syn c from phoneme and/or viseme sequences.
Resolution lower bounds for the weak functional pigeonhole principle
Authors: Alexander A. Razborov
Venue: Theoretical Computer Science (2003)

We show that every resolution proof of the functional version FPHPnm of the pigeonhole principle (in which one pigeon may not split between several holes) must have size exp(Ω(n/(log m)2)). This implies an exp(Ω(n1/3)) bound when the number of pigeons m is arbitrary.
Integer NC^1 is equal to Boolean NC^1
Authors: Stephen Bloch
Venue:  (1996)

We show that the product of $n$ $3 \times 3$ matrices of $n$-bit integers can be computed in $P$-uniform $FNC^1$. Since this problem is complete~\cite{BOC:const_registers} for formul\ae\ in $\{+, \cdot\}$ on $n$-bit integers, we conclude that ``algebraic $NC^1$'''' on integers is equal to the usual Boolean notion of $NC^1$ functions.
Truth vs Knowledge: The Difference Between What a Component Does and What We Know It Does
Authors: Mary Shaw
Venue: Proceedings of the 8th International Workshop on Software Specification and Design (1996)

Conventional doctrine holds that specifications are sufficient, complete, static, and homogeneous. For system-level specifications, especially for software architectures, conventional doctrine often fails to hold. This can happen when properties other than functionality are critical, when not all properties of interest can be identified in advance, or when the specifications are expensive to create. That is, the conventional doctrine often fails for practical software components. Specifications for real software must be incremental, extensible, and heterogeneous. To support such specifications, our notations and tools must be able to extend and manipulate structured specifications. In the UniCon architecture description language, we introduce credentials, a property-list form of specification that supports evolving heterogeneous specifcations and their use with system-building and analysis tools.
Implementation of the proposed facilities for Exception Handling and Termination in Modula-2
Authors: K. J Gough
Venue:  (1992)

ISO working group WG-13 has proposed extensions to Modula-2 which introduce module finalization and exception handling. Some early experience in implementing these extensions is reported here. Some general discussion of the implementation of context-saving is included. In particular, the impossibility of specifying such facilities as ordinary (non-system) procedures is explained.
On the Structure of Bounded Queries to Arbitrary NP Sets
Authors: Richard Chang
Venue:  (1988)

In [Kad87b], Kadin showed that if the Polynomial Hierarchy (PH) has infinitely many levels, then for all $k$, $P^{SAT[k]} \subseteq P^{SAT[k+1]}$. In this paper, we extend Kadin''s technique to show that a proper query hierarchy is not an exclusive property of SAT. In fact, for any $A \in NP \overbrace{low_{3}}$, if PH is infinite, then $P^{A[k]} \subseteq P^{A[k+1]}$. Moreover, for the case of parallel queries, we show that $P^{A||[k+1]}$ is not contained in $P^{SAT||[k]}$. We claim that having a proper query hierarchy is a consequence of the oracle access mechanism and not a result of the ``hardness'''' of a set. To support this claim, we show that assuming PH is infinite, one can construct an intermediate set $B \in NP$ so that $P^{B[k+1]} \subseteq P^{SAT[k]}$. That is, the query hierarchy for $B$ grows as ``tall'''' as the query hierarchy for SAT. In addition, $B$ is intermediate, so it is not ``hard'''' in any sense (e.g., not NP hard under many-one, Turing, or strong nondeterministic reductions). Using these same techniques, we explore some other questions about query hierarchies. For example, we show that is there exists any $A$ such that $P^{A[2]} = P^{SAT[1]}$ then PH collapses to $\Delta^{P}_{3}$. 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