21.
R-árboles, estructuras métricas en sus espacios de finales y algunas aplicaciones a la topología geométrica
- Martínez Pérez, Álvaro
La memoria presenta dos partes diferenciadas, teniendo la primera incidencia en la segunda. La primera parte se centra en el estudio de la geometría a gran escala de los R-árboles en términos de conceptos y técnicas de naturaleza métrica de sus correspondientes espacios de finales. Asimismo se utilizan los resultados encontrados para dar algunas aplicaciones a la teoría de la forma; en este sentido, y esencialmente, se pone de manifiesto una estrecha relación que permite describir de modo novedoso y reformular conceptos y resultados de ésta última en términos de la geometría a gran escala de los R-árboles. Los resultados...
22.
Interconnection Topologies and Routing
- Gabriele Kotsis
The major aims of this workistogive a comparativesurvey of static interconnection
topologies, and to discuss their properties with respect to their use as interconnection topologies
in message passing multi-computer systems, i. e. each processing elementhasitsown
local memory, there is no common memory, and the processing elements communicate via
message-passing. To this end it was necessary to recall relevant measures on graphs from
graph theory,like for example the average distance or the network diameter, and requirements
from the parallel processing area, likethereliability or extensibility. Special emphasis
has been given to present the construction rules for various graphs, because these seemed
-- along with the network characteristics -- most relevant...
23.
Watermarking Layout Topologies
- Edoardo Charbon,Ilhami Torunoglu
Watermarking is a technique currently being developed to effectively protect
Intellectual Properties of various types. In this paper a formalization of the
watermarking problem is presented in the context of IC physical design. A class
of algorithms is proposed for implanting arbitrary codes in the inherent structure
of layout topologies. Similarly, a method is given to reconstruct the original
watermark for a given design. The concepts of robustness against forgery and
theft tracking are analyzed in light of the proposed algorithms. Examples are
presented to show the feasibility of the approach.
1 Introduction
With the explosion of electronic Intellectual Property (IP) commerce, it
is becoming of critical importance to develop...
24.
Three-Dimensional Network Topologies
- John Pezaris,Gill Pratt,Steve Ward
. This paper presents the derivation and performance results
of several new three-dimensional topologies. Various transformations can
be applied to the conventional six-neighbor mesh in order to construct
these topologies, which vary both in number of neighbors (degree) and
logical connectivity. Analysis shows that after normalization for constant
pin-count, lower-degree topologies yield lower latencies for long
messages on unloaded networks, while higher-degree topologies possess
higher bandwidth capacities. Although simulation results generally verify
these findings, we also observe a surprising amount of difference in
the performance between distinct topologies of the same degree.
1 Introduction
The past few years have seen a rise in popularity of multiprocessors using direct
networks that span two...
25.
Three-Dimensional Network Topologies
- John Pezaris,Gill Pratt,Steve Ward
. This paper presents the derivation and performance results
of several new three-dimensional topologies. Various transformations can
be applied to the conventional six-neighbor mesh in order to construct
these topologies, which vary both in number of neighbors (degree) and
logical connectivity. Analysis shows that after normalization for constant
pin-count, lower-degree topologies yield lower latencies for long
messages on unloaded networks, while higher-degree topologies possess
higher bandwidth capacities. Although simulation results generally verify
these findings, we also observe a surprising amount of difference in
the performance between distinct topologies of the same degree.
1 Introduction
The past few years have seen a rise in popularity of multiprocessors using direct
networks that span two...
26.
Three-Dimensional Network Topologies
- John Pezaris,Gill Pratt,Steve Ward
. This paper presents the derivation and performance results
of several new three-dimensional topologies. Various transformations can
be applied to the conventional six-neighbor mesh in order to construct
these topologies, which vary both in number of neighbors (degree) and
logical connectivity. Analysis shows that after normalization for constant
pin-count, lower-degree topologies yield lower latencies for long
messages on unloaded networks, while higher-degree topologies possess
higher bandwidth capacities. Although simulation results generally verify
these findings, we also observe a surprising amount of difference in
the performance between distinct topologies of the same degree.
1 Introduction
The past few years have seen a rise in popularity of multiprocessors using direct
networks that span two...
27.
Three-Dimensional Network Topologies
- John Pezaris,Gill Pratt,Steve Ward
. This paper presents the derivation and performance results
of several new three-dimensional topologies. Various transformations can
be applied to the conventional six-neighbor mesh in order to construct
these topologies, which vary both in number of neighbors (degree) and
logical connectivity. Analysis shows that after normalization for constant
pin-count, lower-degree topologies yield lower latencies for long
messages on unloaded networks, while higher-degree topologies possess
higher bandwidth capacities. Although simulation results generally verify
these findings, we also observe a surprising amount of difference in
the performance between distinct topologies of the same degree.
1 Introduction
The past few years have seen a rise in popularity of multiprocessors using direct
networks that span two...
28.
Linear Equivalence of Ideal Topologies
- Irena Swanson
It is proved that whenever P is a prime ideal in a commutative Noetherian
ring such that the P -adic and the P -symbolic topologies are equivalent, then
the two topologies are equivalent linearly. Several explicit examples are calculated,
in particular for all prime ideals corresponding to non-torsion points on nonsingular
elliptic cubic curves.
There are many examples of prime ideals P in commutative Noetherian rings for which
the symbolic Rees algebra S(P ) = Phi n P
(n)
, where P
(n)
is the nth symbolic power of P ,
is not a Noetherian ring. The first such example was found by Rees in [Re4], and later
Roberts [Ro1], [Ro2] and...
29.
A Performance Comparison Between Graph and Hypergraph Topologies for Passive Star WDM Lightwave Networks
- H. Bourdin; A. Ferreira; K. Marcus
Wavelength division multiplexing (WDM) allows the huge bandwidth of optical øber to be divided into several high-speed channels in optical passive star based networks. For such processor networks, most of the proposed architectures for interconnecting nodes are based on graph topologies. Recently, topologies based on the hypergraph theory have emerged, motivated by the observation that each multiplexed channel can actually be seen as a logical resource shared among many processors, and not only between two of them. In this paper, we show that these hypergraph passive star WDM lightwave networks present many advantages with respect to graph-based ones, in terms...
30.
Topologies for the Digital Spaces
- Ulrich Eckhardt,Longin Jan Latecki
We show that there are only two topologies in Z
and five topologies
in Z
whose connected sets are connected in the intuitive sense. Both
topologies for Z
are well known (e.g., one is presented in D. Marcus, F.
Wyse et al., Amer. Math. Monthly 77, pp. 1119, 1979, and the second
in E. Khalimsky et al., Topology and its Applications 36, pp. 1--17, 1990)
and found applications in computer graphics and computer vision (e.g.
A. Rosenfeld, Amer. Math. Monthly 77, pp. 621--630, 1979, and T. Y.
Kong et al., Amer. Math. Monthly 98, pp. 901--917, 1991). Two of the
five topologies for Z
are products of the topologies known from Z
....
31.
Interpolating Between Topologies: Casimir Energies
- Donald Marolf
A set of models is considered which, in a certain since, interpolates between
1+1 free quantum field theories on topologically distinct backgrounds. The
intermediate models may be termed free quantum field theories, though they
are certainly not local. Their ground state energies are computed and shown
to be finite. The possible relevance to changing spacetime topologies is discussed.
1
I. INTRODUCTION
The suggestion that the topology of spacetime is not fixed [1], but may change in the
course of (quantum) evolution has attracted much interest and has been addressed from
many points of view. Perhaps the earliest concrete work on the subject was that of Anderson
and DeWitt [2] who...
32.
Topologie Des Locuteurs Et Presegmentation Pour Le Decodage Acoustico-Phonetique
- Topologie Des,Locuteurs Et Presegmentation,Pour Le,Decodage Acoustico-phonetique,C. Barras,M. -j. Caraty,C. Montacie,Universite Paris
INTRODUCTION
Le dcodage acoustico-phontique (DAP) reste une
tape fondamentale de la reconnaissance de la parole
continue. Les mthodes actuellement les plus
performantes dans ce domaine sont fondes sur les
modles de Markov cachs (HMM). Des tudes sur les
espaces de reprsentation ou sur le choix des modles
permettent une amlioration des performances.
Cependant, le DAP est un processus au cours duquel
segmentation et identification sont troitement lies, et
les systmes de reconnaissance base de HMM ne
permettent pas de localiser avec prcision les
frontires phontiques. De plus, la variabilit interlocuteurs
rend le choix de l'ensemble d'apprentissage
crucial pour une bonne estimation des densits de
probabilit des modles.
Pour rsoudre ces problmes, deux mthodes de
traitement du signal...
33.
Small-World Internet Topologies
- Shudong Jin,Azer Bestavros
Recent work has shown the prevalence of small-world phenomena
[28] in many networks. Small-world graphs exhibit a high degree of
clustering, yet have typically short path lengths between arbitrary vertices.
Internet AS-level graphs have been shown to exhibit small-world behaviors
[9]. In this paper, we show that both Internet AS-level and routerlevel
graphs exhibit small-world behavior. We attribute such behavior to
two possible causes--namely the high variability of vertex degree distributions
(which were found to follow approximately a power law [15]) and the
preference of vertices to have local connections. We show that both factors
contribute with different relative degrees to the small-world behavior of
AS-level and router-level topologies. Our...
34.
On Torus Topologies with Random Extra Links
In this paper we study networks based on torus
topologies enhanced with additional, arbitrary assigned
links. We develop a method for analyzing the expected
number of hops which can be applied to any torus topology
with randomly assigned extra links when the simplest
greedy routing is used. Using this method, we
study the following topologies with extra links: onedimensional
unidirectional and bidirectional torus (i.e.,
ring), and two-dimensional bidirectional and unidirectional
torus (e.g., Bidirectional Manhattan Network
and Manhattan Street Network). We also show how
these results can be extended to some non-torus topologies
with extra links, such as the bus and the twodimensional
grid. From our analysis we find that the
expected number of hops...
35.
On Torus Topologies with Random Extra Links
In this paper we study networks based on torus
topologies enhanced with additional, arbitrary assigned
links. We develop a method for analyzing the expected
number of hops which can be applied to any torus topology
with randomly assigned extra links when the simplest
greedy routing is used. Using this method, we
study the following topologies with extra links: onedimensional
unidirectional and bidirectional torus (i.e.,
ring), and two-dimensional bidirectional and unidirectional
torus (e.g., Bidirectional Manhattan Network
and Manhattan Street Network). We also show how
these results can be extended to some non-torus topologies
with extra links, such as the bus and the twodimensional
grid. From our analysis we find that the
expected number of hops...
36.
Operator Topologies and Reflexive Representability
- Michael G. Megrelishvili
Using the concept of fragmentability, we show that weakly continuous
group representations are frequently strongly continuous. We show that
if a Banach (or, even, Frechet) space X has the Radon-Nikodym property RNP,
then the weak and strong operator topologies coincide on every bounded (respectively,
equicontinuous) subgroup G of GL(X) . We also strengthen a result
of Shtern on reflexive representability of topological groups.
37.
Functional Skeletons Generate Process Topologies in Eden
. We present a collection of skeletons that are appropriate to
instantiate process systems in the functional-concurrent language Eden
[BLOM96]. Eden is a functional language providing facilities for the explicit
definition and instantiation of processes. Skeletons in this language
are just higher order functions having process definitions as parameters.
We introduce skeletons for both transformational (i.e. deterministic) and
reactive (usually non deterministic) process topologies and illustrate
their use by applying them to several examples. Some pointers to the
skeletons literature are also given.
Keywords: Functional programming, concurrent programming, parallel
programming, skeletons, higher order functions.
1
38.
Sparse Topologies with Small Spectrum Size
One of the fundamental properties of a graph is the number of distinct eigenvalues of
its adjacency or Laplace matrix. Determining this number is of theoretical interest
as well as of practical impact. Sparse graphs with small spectra exhibit excellent
structural properties and can act as interconnection topologies. In this paper, for
any n we present graphs, for which the product of their vertex degree and the
number of dierent eigenvalues is small. It is known that load balancing can be
performed on such graphs in a small number of steps.
39.
Functional Skeletons Generate Process Topologies in Eden
. We present a collection of skeletons that are appropriate to
instantiate process systems in the functional-concurrent language Eden
[BLOM96]. Eden is a functional language providing facilities for the explicit
definition and instantiation of processes. Skeletons in this language
are just higher order functions having process definitions as parameters.
We introduce skeletons for both transformational (i.e. deterministic)
and reactive (usually non deterministic) process topologies and illustrate
their use by applying them to several examples. Some comparisons to the
skeletons literature are also established.
Keywords: Functional programming, concurrent programming, parallel
programming, skeletons, higher order functions.
1 Introduction
Functional languages are often said to be amenable for implicit parallelism but,
in order to get enough...
40.
Functional Skeletons Generate Process Topologies in Eden
. We present a collection of skeletons that are appropriate to
instantiate process systems in the functional-concurrent language Eden
[BLOM96]. Eden is a functional language providing facilities for the explicit
definition and instantiation of processes. Skeletons in this language
are just higher order functions having process definitions as parameters.
We introduce skeletons for both transformational (i.e. deterministic) and
reactive (usually non deterministic) process topologies and illustrate
their use by applying them to several examples. Some pointers to the
skeletons literature are also given.
Keywords: Functional programming, concurrent programming, parallel
programming, skeletons, higher order functions.
1 Introduction
Functional languages are often said to be amenable for implicit parallelism because
referential transparency allows evaluating expressions...
