ppxscal/embedding_network huggingface dataset:
Finite element method for developing arbitrary surfaces to flattened forms
Authors: Qi-Lin Zhang, Xiao-Qun Luo
Venue: Finite Elements in Analysis and Design (2003)

In this paper the principle for developing 3D mesh of flat triangles on arbitrary surfaces to, its closest flattened 2D mesh is proposed. Such principle is proved equivalent to the condition that the finite element method (FEM) residual forces of the 2D-mesh member structure are equal to zero. The incremental FEM method and iterative procedures are derived for eliminating such residual forces. For developable 3D mesh of flat triangles, the method of this paper will give the accurate flattened 2D mesh, and for non-developable 3D mesh, this paper can lead to the closest flattened 2D mesh. The obtained 2D mesh can also be taken as the flattened form of the curved surface, which is described by the 3D mesh of flat triangles. Numerical examples show that the method of this paper has stable convergence and high efficiency.
Artificial Synesthesia via Sonification: A Wearable Augmented Sensory System
Authors: Leonard N. Foner
Venue: Proceedings of the 1st IEEE International Symposium on Wearable Computers (1997)

A design for an implemented, prototype wearable artificial sensory system is presented which uses data sonification to compensate for normal limitations in the human visual system. The system gives insight into the complete visible-light spectra from objects being seen by the user; long-term wear and consequent training might lead to identification of various visually-indistinguishable materials based on the sounds of their spectra. A system design is presented, and some possible extensions to both the sonification and the sensor package are discussed.
Versatile Processor Design for Efficiency and High Performance
Authors: Sotirios G. Ziavras
Venue: Proceedings of the 2000 International Symposium on Parallel Architectures, Algorithms and Networks (2000)

New architectural concepts are introduced for unprocessor designs that conform to the data-driven computation paradigm. Usage of our D2-CPU (Data-Driven processor) follows the natural flow of programs, minimizes the number of redundant operations, lowers the hardware cost, and reduces the power consumption, Instructions enter the processing unit when they are ready to execute or when all their operand(s) are to be available within a few clock cycles. This approach results in outstanding performance and elimination of large numbers of redundant operations that plague current processor designs. A comparative analysis of our design with conventional designs proves that it is capable of better performance and higher efficiency.
Linear and quadratic potential variation in a new piezoelectric eight node finite element
Authors: O. Polit, I. Bruant
Venue: Proceedings of the sixth conference on Computational structures technology (2002)

This paper deals with the problem of multilayered plates with piezoelectric actuators and sensors. For this purpose, a new plate finite element is defined in order to analyse this kind of coupled problems for both moderately thick and thin plate without any patologies of classical plate finite elements (shear locking, membrane locking, spurious modes, . . . ). This finite element is based on the Reissner-Mindlin plate model for the displacement field and has eight nodes with the five classical mechanical degrees of freedom at each node. The potential function is approximated using the layers-wise approach and is quadratic with respect to the in-plane coordinates : one degree of freedom at the eight nodes. Two kinds of finite element approximation for the potential function with respect to the thickness co-ordinate are studied in this work : a linear and a quadratic variation in each layers. The major advantage of this choice is to obtain a total independence between the middle plane mesh and the discretisation of the potential function in the thickness direction. In order to evaluate the efficiency of this finite element, some static and dynamic tests have been conducted about the cylindrical bending of plates and compared with reference solutions for monomorphe and sandwich plates. Results obtained are in very good agreement and show the efficiency of this new finite element for both displacements and potential function. Furthermore, linear and quadratic variations of the potential function in each layer are also evaluated.
Simplified Voronoi Diagrams
Authors: John Canny, Bruce R Donald
Venue:  (1987)

We are interested in Voronoi diagrams as a tool in robot path planning, where the search for a path in an $r$ dimensional space may be simplified to a search on an $r-1$ dimensional Voronoi diagram. We define a Voronoi diagram $V$ based on a measure of distance which is not a true metric. This formulation has lower algebraic complexity than the usual definition, which is a considerable advantage in motion planning problems with many degrees of freedom. In its simplest form, the measure of distance between a point and a polytope is the maximum of the distances of the point from the half-spaces which pass through faces of the polytope. More generally, the measure is defined in configuration spaces which represent rotation. The Voronoi diagram defined using this distance measure is no longer a strong deformation retract of free space, but it has the following useful property: any path through free space which starts and ends on the diagram can be continuously deformed so that it lies entirely on the diagram. Thus it is still complete for motion planning, but it has lower algebraic complexity than a diagram based on the euclidean metric.
Finding Repeated Elements
Authors: Jayadev Misra, David Gries
Venue:  (1982)

Two algorithms are presented for finding the values that occur more than $n \div k$ times in array b[O:n-1]. The second algorithm requires time $O(n \log(k))$ and extra space $O(k)$. We prove that $O(n \log(k))$ is a lower bound on the time required for any algorithm based on comparing array elements, so that the second algorithm is optimal. As special cases, determining whether a value occurs more than $n \div 2$ times requires linear time, but determining whether there are duplicates the case $k=n$ requires time $O(n \log(n))$. The algorithms may be interesting from a standpoint of programming methodology; each was developed as an extension of an algorithm for the simple case $k=2$.
Graph Rigidity
Authors: Richard Cole
Venue:  (1982)

The relationship between graph isomorphism and graph rigidity is studied. Although in general it is not known if these problems are equivalent under polynomial time Turing reductions, equivalence is shown for a subclass of graphs with abelian automorphism groups. 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
Performance Evaluation of Web browsing over Hybrid Fiber Coaxial Broad-Band Networks
Authors: Ivan Tam Ming Chit, Mohan Krishna Patnam, King Tung Chan, Foo Siang Fook
Venue: Proceedings of the 7th IEEE International Conference on Networks (1999)

The phenomenal growth of the Internet in recent years has motivated a number of cable operators to upgrade their wide installed base of cable networks to offer broadband data services to residential subscribers. This enables them to access a variety of local community content as well as the Internet. Current state-of-the-art cable modems implement sophisticated modulation-demodulation techniques that offer services with several fold increase in access speeds from homes compared to conventional dial-up access. But experiences show that the performance of the Web browsing may be severely hampered if the overall network configuration and its connectivity to the external world are not well studied e.g., connection to U.S. backbone. This paper investigates the performance of web browsing in such an environment by taking a case study of Singapore-ONE broadband network. We present a simple model for estimating the bandwidth of overseas link for large user base by considering HTTP as the prime application .We later analyze the performance of HTTP protocol over such a network and propose simple modifications including changes in access sub-net, for better performance.
A New General Purpose Parallel Database System
Authors: M. Afshar, J. Bates, G. Bierman, K. Moody
Venue: Proceedings of the 1997 International Symposium on Parallel Architectures, Algorithms and Networks (1997)

This paper is concerned with the transparent parallelization of declarative database queries, based on theoretical principles. We have designed an entire database architecture suitable for use on any general-purpose parallel machine. This architecture addresses the shortcomings in flexibility and scalability of commercial parallel databases. A substantial benefit is that the mathematical principles underlying our framework allow provably correct parallel evaluations and optimizations, using compile-time transformations. We address parallelism in a language-independent way through the choice of monoids as a formulation for expressing and modeling queries. Queries expressed in our declarative language are transformed into applications of a higher-order function, the monoid homomorphism. The evaluation of this function is partitioned at run-time, giving a tree-like processor topology, the depth and breadth of which can be varied with a declarative execution plan. Leaf nodes within the evaluation tree operate on their own data partitions and forward results to the appropriate interior nodes. Due to the nature of our language, the functions that are necessary to combine results from independent parallel evaluations are generated automatically at compile-time from a monoid definition dictionary, additions to which can be made to extend the system's data types. We have built a complete prototype of our system, which uses Swiss Radio Corporation's entire recorded music catalogue, on a general-purpose AP1000, 128-cell parallel computer at the IFPC.
A dynamic reanalysis technique for modifications of structural components
Authors: P. Cacciola, G. Muscolino
Venue: Proceedings of the sixth conference on Computational structures technology (2002)

A procedure for the reanalysis of the dynamic response of linear systems subjected to deterministic loads is presented. The procedure allows to evaluate the dynamic response of the modified structural system avoiding both the solution of the new eigenproblem and the evaluation of the associated transition matrix related to the new structure. The method is able to solve also the case in which topological modifications are introduced. In this case, known the eigenproperties of the original structure, the equation of motion of the modified system are written in a reduced space by means of the Ritz vectors. Lastly an unconditionally stable step-by-step procedure based on the dynamic modification method is applied to find the dynamic response of the new structure. The proposed method is computationally very effective since it does not require any eigensolution and leads to very accurate results as shown in the numerical applications.
High-performance scalable computing for real-time applications
Authors: T. Boggess, F. Shirley
Venue: Proceedings of the 6th International Conference on Computer Communications and Networks (1997)

Sanders is integrating emerging interconnect technologies with other high-performance computing technologies to meet the demanding requirements of future, real-time, embedded military applications. Myrinet, a switched network, is used to connect heterogeneous computer nodes in a low-latency, high-throughput system area network (SAN). Myrinet includes a standardized intelligent node-to-network interface, called a LANai, which isolates each node from the network. Types of nodes under development include digital signal processor (DSP), reduced instruction set computing (RISC), and reconfigurable computing (RC). Modeling and simulation of the computing system are performed within the Ptolemy environment. High density interconnect (HDI) packaging reduces size, weight and power (SWAP), a requirement especially important for avionics applications. PacketWay, an Internet Engineering Task Force (IETF) proposed standard, provides a high-performance interface between heterogeneous SANs, and includes an option for high speed inter-SAN encryption. A prototype high-performance scalable computer is being built at Sanders with this set of technologies, to meet the requirements of several future military programs.
Learning Low-Level Vision
Authors: William T. Freeman, Egon C. Pasztor
Venue: Proceedings of the International Conference on Computer Vision-Volume 2 - Volume 2 (1999)

We show a learning-based method for low-level vision problems{estimating scenes from images. We generate a synthetic world of scenes and their corresponding rendered images. We model that world with a Markov network, learning the network parameters from the examples. Bayesian belief propagation allows us to efficiently find a local maximum of the posterior probability for the scene, given the image. We call this approach VISTA{Vision by Image/Scene TrAining.We apply VISTA to the "super-resolution" problem (estimating high frequency details from a low-resolution image), showing good results. For the motion estimation problem, we show figure/ground discrimination, solution of the aperture problem, and filling-in arising from application of the same probabilistic machinery.
Asymptotically Good Covers in Hypergraphs: Extended Abstract of the Dissertation
Authors: P. M Kayll
Venue:  (1995)

In the early 1980''s, V. R\"{o}dl proved the Erd\H{o}s-Hanani Conjecture, sparking a remarkable sequence of developments in the theory of packing and covering in hypergraphs with bounded edge size. Generalizations were given by P. Frankl and R\"{o}dl, by N. Pippenger, and by others. In each case, an appropriate {\em semirandom} method was used to ``construct'''' the desired optimal object (covering, matching, coloring) in several random stages, followed by a greedy stage. The current work, which further generalizes some of the above results, is again probabilistic, and uses, in addition to earlier ideas, connections with so-called {\em normal} distributions on the set of matchings of a graph. For fixed $k\geq 2$, ${\cal H}$ a $k$-bounded hypergraph, and $t:{\cal H}\rightarrow \mbox{{\bf R}}^+$ a fractional cover, a sufficient condition is given to ensure that the edge cover number $\rho({\cal H})$, {\em i.e.}, the size of a smallest set of edges of ${\cal H}$ with union $V({\cal H})$, is asymptotically at most $t({\cal H}) = \sum_{A\in {\cal H}}t(A)$. This settles a conjecture first publicized in Visegr\''{a}d, June 1991.
ADAPTLOAD: Effective Balancing in Custered Web Servers Under Transient Load Conditions
Authors: Alma Riska, Wei Sun, Evgenia Smirni, Gianfranco Ciardo
Venue: Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02) (2002)

We focus on adaptive policies for load balancing in clustered web servers, based on the size distribution of the requested documents. The proposed scheduling policy, ADAPTLOAD, adapts its balancing parameters on-the-fly, according to changes in the behavior of the customer population such as fluctuations in the intensity of arrivals or document popularity. Detailed performance comparisons via simulation using traces from the 1998 World Cup showthat ADAPTLOAD is robust as it consistently outperforms traditional load balancing policies, especially under conditions of transient overload.
A meta-model for intelligent adaptive multi-agent systems in open environments
Authors: Thomas Juan, Leon Sterling
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

In this paper, we introduce the ROADMAP meta-model, designed to describe intelligent adaptive multi-agent systems in open environments. The meta-model captures our understanding of the properties of such systems and our perspective on organizational concepts such as roles. It defines agent constructs such as agents and roles, and their inter-relationships such as aggregation, in a way that best facilitates the development of intelligent adaptive systems in open environments.We intend to use the meta-model for knowledge sharing. We expect developers of AOSE methodologies, tools, programming languages and frameworks to benefit from understanding the design and structure of the ROADMAP meta-model. By adopting the meta-model, the resulting methodologies, tools and languages should inherit its desirable characteristics and better support the development of intelligent adaptive systems in open environments.
Software Reliability Growth Models: Assumptions vs. Reality
Authors: Alan Wood
Venue: Proceedings of the Eighth International Symposium on Software Reliability Engineering (1997)

Software reliability growth models are often differentiated by assumptions regarding testing and defect repair. In this paper, these model assumptions are compared to Tandem's software development and test environment. The key differences between our environment and the standard model assumptions are that (1) the total number of defects can increase due to new code being introduced during system test, but the models normally assume a constant total number of defects, and (2) the defect-finding efficiency of tests can vary but is assumed constant by the models. In spite of the model assumption violations, we (and other practitioners) continue to use the models because they are easy to apply and because the results seem reasonable. However, we are concerned about the potential inaccuracy of the models and would like to determine the effect of the assumption violations. This paper contains suggestions for research to quantify the model inaccuracy and help practitioners make accuracy vs. model complexity tradeoffs.
PhotoShop Elements 2: The Complete Reference, 1 edition
Authors: Ken Milburn, Gene Hirsh
Venue:  (2002)

:Expand your creative potential exponentially by learning to maximize the tools and technologies available in Photoshop Elements. This well-written resource is perfectly suited for business professionals or home users who want the power of a digital image editor without wading through the complications of a full-service graphics program such as Photoshop. You'll quickly become familiar with the features, tools, and techniques to work your own digital darkroom magic and create beautiful graphics, illustrations, and artwork. Understand layers, selections, and exposure. Generate text, special effects, and composite images. Plus -- Photoshop Elements 2: The Complete Reference will help you prepare your work for presentation in print, slide show projections, or the Web.
On shared randomness and the size of secure signatures
Authors: Ronald J.F. Cramer
Venue:  (1995)

We present an efficient signature scheme that is not existentially forgeable under adaptively chosen message attacks \cite{gmr}. The main feature of our scheme is that any practical number of signatures can be made while the size of the signatures remains relatively small, under the condition that all signers have access to a list of shared random strings. More precisely, let integers $l$ and $d$ be fixed and let $k$ be a security parameter. Given a list of $l$ random $(k-1)$-bit strings shared by all signers, at least $l^d$ signatures can be made by each signer in our scheme, where the size of a public key is $k$ bits. The size of a signature does not exceed $(4d-3)k$ bits. The first secure signature scheme where such trade-offs between shared randomness and the size of signatures has been realized was proposed by Dwork and Naor at Crypto ''94 [1]. Their scheme is based on RSA, while their method for achieving efficiency relies on special properties of RSA that seem to go beyond the properties of general trapdoor permutations. Our contribution is to show that a secure signature scheme with similar efficiency can be based on a general cryptographic assumption that is potentially weaker than an RSA assumption, namely the existence of a family of claw-free trapdoor permutations [3], which can be constructed under the factoring assumption.
Reconfigurable Mesh-Connected Processor Arrays Using Row-Column Bypassing and Direct Replacement
Authors: Nobuo Tsuda, Tatsuyuki Shimizu
Venue: Proceedings of the 2000 International Symposium on Parallel Architectures, Algorithms and Networks (2000)

This paper proposes an advanced reconfiguration scheme using row-column bypassing and direct replacement for two-dimensional mesh-connected processing-node arrays that makes an array usable for massively parallel computingand stand-alone computing in an efficient dividedmanner. This scheme uses an array providing a switching circuit in every node for row-column by-passing and a simple bypass network with a tree structure allocated to the array by graph-node coloring with a minimum inter-node distance of three for direct replacement. It can reconfigure a subarray with a regular matrix of free nodes usable for parallel computing in the array while allowing a small delay in the meshconnections but maintaining a communication path from every busy node being used as stand-alone computing to the outside of the array. The direct replacement is used for substitution of busy nodes which are not covered by row-column bypassing with free nodes locatedin the rows or columns to be bypassed, helping to enlarge the size of the reconfigured subarray. The bypass allocation with a minimum distance of three enables distributed communications and simple routing in the array while attaining a large success probability of the direct replacement. The proposed scheme is advantageous for constructing fault-tolerant massively parallel systems by using personal computers or workstations as processing nodes and Ethernet devices for interconnections.
Consensus Algorithms for the Generation of all Maximal Bicliques
Authors: Alexe Gabriela, Alexe Sorin, Foldes Stephan, Peter L. Hammer, Simeone Bruno
Venue:  (2000)

We describe a consensus-type algorithm for determining all the maximal complete bipartite (not necessarily induced) subgraphs of a graph. We show that by imposing a particular order in which the consensus type operations should be executed, this algorithm becomes totally polynomial. By imposing a further restriction on the way the algorithm has to be executed, we derive an improved variant of it, the complexity of which is bounded by a polynomial that is cubic in the input size, and only linear in the output size, and show its high efficiency on numerous computational experiments on randomly generated graphs with up to 1000 vertices and 6000 edges.