Hypercube | EPFL Graph Search

Êtes-vous un étudiant de l'EPFL à la recherche d'un projet de semestre?

Travaillez avec nous sur des projets en science des données et en visualisation, et déployez votre projet sous forme d'application sur GraphSearch.

Découvrez-en plus sur les applications Graph.

Un hypercube est, en géométrie, un analogue n-dimensionnel d'un carré (n = 2) et d'un cube (n = 3). C'est une figure fermée, compacte, convexe constituée de groupes de segments parallèles opposés alignés dans chacune des dimensions de l'espace, à angle droit les uns par rapport aux autres. Un hypercube n-dimensionnel est aussi appelé un n-cube. Le terme « polytope de mesure » a aussi été utilisé (notamment par Coxeter), mais il est tombé en désuétude. Enfin, le cas particulier du 4-cube est souvent désigné par le terme de tesseract. Définition Si E est un espace euclidien de dimension n muni d'une base orthonormale, on définit un hypercube unité comme l'hypervolume délimité par les dans E ayant des coordonnées égales à 0 ou 1 reliés par des segments de droite. Les hypercubes sont les figures obtenues à partir de l'hypercube unité par des similitudes. Représenter un hypercube de dimension n vignette|Animation montrant comment construire un tesseract à partir

À propos de ce résultat

Cette page est générée automatiquement et peut contenir des informations qui ne sont pas correctes, complètes, à jour ou pertinentes par rapport à votre recherche. Il en va de même pour toutes les autres pages de ce site. Veillez à vérifier les informations auprès des sources officielles de l'EPFL.

Publications associées (5)

Publications associées

Chargement

Personnes associées

Chargement

Unités associées

Chargement

Concepts associés (29)

Concepts associés

Chargement

Cours associés (2)

Cours associés

Chargement

Séances de cours associées (2)

Séances de cours associées

Chargement

Efficient Data Structures For Decision Diagrams

Stéphane Rabie

Dynamic Programming Optimization (DPOP) is an algorithm proposed to solve distributed constraint optimization problems. In order to represent the multi-values functions manipulated in this algorithm, a data structure called Hypercube was implemented. A more efficient data structure, the Utility Diagram, was then proposed as an alternative to the Hypercube. DPOP also required the implementation of several operations (such as join, project, slice, split and reorder) on these two data structures. This project is a follow-up of Nacereddine Ouaret’s master thesis, which consisted in implementing all of these data structures and theirs associated operations. As DPOP may have to work on very large decision diagrams, and perform a lot of successive operations on them, having implementations which are efficient in term of speed and memory is critical. The aim of this project was therefore to seek for new ways to improve the already implemented functions for hypercubes and utility diagrams, both in term of execution time and memory consumption. This report will thus first present a quick overview of hypercubes, utility diagrams, and their associated operations (a more complete description of these objects, as well as the details about their original implementation, can be found in Nacereddine Ouaret’s report on Efficient Data Structures for Decision Diagrams). The second part will then cover various improvements made to their implementation during the course of this project. Finally, a variant for the methods used by hypercube, more economical in term of memory as it reuses existing hypercubes rather than creating new ones, will be presented.

2009

Chargement

Local trapping for elliptic random walks in random environments in Z(d)

Daniel Kious

We consider elliptic random walks in i.i.d. random environments on . The main goal of this paper is to study under which ellipticity conditions local trapping occurs. Our main result is to exhibit an ellipticity criterion for ballistic behavior which extends previously known results. We also show that if the annealed expected exit time of a unit hypercube is infinite then the walk has zero asymptotic velocity.

Springer Heidelberg2016

Chargement

The size of the sync basin revisited

Robin Delabays, Philippe Jacquod

In dynamical systems, the full stability of fixed point solutions is determined by their basins of attraction. Characterizing the structure of these basins is, in general, a complicated task, especially in high dimensionality. Recent works have advocated to quantify the non-linear stability of fixed points of dynamical systems through the relative volumes of the associated basins of attraction [Wiley et al., Chaos 16, 015103 (2006) and Menck et al. Nat. Phys. 9, 89 (2013)]. Here, we revisit this issue and propose an efficient numerical method to estimate these volumes. The algorithm first identifies stable fixed points. Second, a set of initial conditions is considered that are randomly distributed at the surface of hypercubes centered on each fixed point. These initial conditions are dynamically evolved. The linear size of each basin of attraction is finally determined by the proportion of initial conditions which converge back to the fixed point. Armed with this algorithm, we revisit the problem considered by Wiley et al. in a seminal paper [Chaos 16, 015103 (2006)] that inspired the title of the present manuscript and consider the equal-frequency Kuramoto model on a cycle. Fixed points of this model are characterized by an integer winding number q and the number n of oscillators. We find that the basin volumes scale as (1 - 4q/n)(n), contrasting with the Gaussian behavior postulated in the study by Wiley et al.. Finally, we show the applicability of our method to complex models of coupled oscillators with different natural frequencies and on meshed networks. Published by AIP Publishing.

Amer Inst Physics2017

Chargement

COM-302: Principles of digital communications

This course is on the foundations of digital communication. The focus is on the transmission problem (rather than being on source coding).

PHYS-427: Relativity and cosmology I

Introduce the students to general relativity and its classical tests.

Groupe de Coxeter

Un groupe de Coxeter est un groupe engendré par des réflexions sur un espace. Les groupes de Coxeter se retrouvent dans de nombreux domaines des mathématiques et de la géométrie. En particulier, les

Polytope

Un polytope est un objet mathématique géométrique. Le terme de polytope a été inventé par Alicia Boole Stott, la fille du logicien George Boole. Plusieurs définitions Le terme polytope

Octaèdre

En géométrie, un octaèdre (du grec oktô, huit et hedra, face) est un polyèdre à huit faces. Présentation Certains octaèdres satisfont des conditions de symétrie ou de régularité des faces