High speed all optical networks

An inherent problem of conventional point-to-point wide area network (WAN) architectures is that they cannot translate optical transmission bandwidth into comparable user available throughput due to the limiting electronic processing speed of the switching nodes. The first solution to wavelength division multiplexing (WDM) based WAN networks that overcomes this limitation is presented. The proposed Lightnet architecture takes into account the idiosyncrasies of WDM switching/transmission leading to an efficient and pragmatic solution. The Lightnet architecture trades the ample WDM bandwidth for a reduction in the number of processing stages and a simplification of each switching stage, leading to drastically increased effective network throughputs. The principle of the Lightnet architecture is the construction and use of virtual topology networks, embedded in the original network in the wavelength domain. For this construction Lightnets utilize the new concept of lightpaths which constitute the links of the virtual topology. Lightpaths are all-optical, multihop, paths in the network that allow data to be switched through intermediate nodes using high throughput passive optical switches. The use of the virtual topologies and the associated switching design introduce a number of new ideas, which are discussed in detail

Fast Recognition of Partial Star Products and Quasi Cartesian Products

This paper is concerned with the fast computation of a relation $\R$ on the edge set of connected graphs that plays a decisive role in the recognition of approximate Cartesian products, the weak reconstruction of Cartesian products, and the recognition of Cartesian graph bundles with a triangle free basis. A special case of $\R$ is the relation $\delta^\ast$, whose convex closure yields the product relation $\sigma$ that induces the prime factor decomposition of connected graphs with respect to the Cartesian product. For the construction of $\R$ so-called Partial Star Products are of particular interest. Several special data structures are used that allow to compute Partial Star Products in constant time. These computations are tuned to the recognition of approximate graph products, but also lead to a linear time algorithm for the computation of $\delta^\ast$ for graphs with maximum bounded degree. Furthermore, we define \emph{quasi Cartesian products} as graphs with non-trivial $\delta^\ast$. We provide several examples, and show that quasi Cartesian products can be recognized in linear time for graphs with bounded maximum degree. Finally, we note that quasi products can be recognized in sublinear time with a parallelized algorithm

The lattice dimension of a graph

We describe a polynomial time algorithm for, given an undirected graph G, finding the minimum dimension d such that G may be isometrically embedded into the d-dimensional integer lattice Z^d.Comment: 6 pages, 3 figure

Displaying 3D Models in Web Pages using WebGL

Import 22/07/2015Hlavným cieľom tejto práce je vytvoriť aplikáciu, ktorá bude zobrazovať interaktívny 3D obsah. Aplikácia je navrhnutá pre webové prostredie a na zobrazenie využíva technológiu WebGL. Hlavné zameranie aplikácie je na zobrazenie scén z oblasti architektúry. V prvej časti práce su opísané možnosti zobrazenia 3D obsahu vo webovom prostredí. V ďalšej časti je teoretický popis použitých algoritmov pre zobrazenie, postprocessing a algoritmov pre identifikáciu objektov. Posledná časť je venovaná návrhu a praktickej implementácii aplikácie.The main objective of this work is to create an application that will display interactive 3D content. The application is designed for web environment, and use WebGL technology. The main focus of the application is to display architecture visualization. First part of work describe the possibility of displaying 3D content in web environment. Below is a theoretical description of the algorithms for displaying, postprocessing and object identification. The last part is dedicated to the development and practical implementation of the application.460 - Katedra informatikyvýborn

Warehouse Information System

Bakalářská práce je zaměřena na analýzu zvolených výrobních procesů společnosti PRÁCE INVALIDŮ, s.r.o., návrh modulů informačního systému pro skladové hospodářství včetně jejich implementace, spojení se stávajícím systémem a zhodnocení přínosu navrženého řešení.Bachelor’s thesis is focused on analysis selected production process for company PRACE INVALIDU, s.r.o., design and implementation information system modules for inventory control, joining with current system and evaluation of solution benefits.

Intersections of automorphism fixed subgroups in the free group of rank three

We show that in the free group of rank 3, given an arbitrary number of automorphisms, the intersection of their fixed subgroups is equal to the fixed subgroup of some other single automorphism.Comment: Published by Algebraic and Geometric Topology at http://www.maths.warwick.ac.uk/agt/AGTVol4/agt-4-11.abs.htm