Search results for " graph"

Maintaining Dynamic Minimum Spanning Trees: An Experimental Study

2010

AbstractWe report our findings on an extensive empirical study on the performance of several algorithms for maintaining minimum spanning trees in dynamic graphs. In particular, we have implemented and tested several variants of the polylogarithmic algorithm by Holm et al., sparsification on top of Frederickson’s algorithm, and other (less sophisticated) dynamic algorithms. In our experiments, we considered as test sets several random, semi-random and worst-case inputs previously considered in the literature together with inputs arising from real-world applications (e.g., a graph of the Internet Autonomous Systems).

A Hebbian approach to complex-network generation

2011

Through a redefinition of patterns in an Hopfield-like model, we introduce and develop an approach to model discrete systems made up of many, interacting components with inner degrees of freedom. Our approach clarifies the intrinsic connection between the kind of interactions among components and the emergent topology describing the system itself; also, it allows to effectively address the statistical mechanics on the resulting networks. Indeed, a wide class of analytically treatable, weighted random graphs with a tunable level of correlation can be recovered and controlled. We especially focus on the case of imitative couplings among components endowed with similar patterns (i.e. attribute…

Characterization of the 3D information of Calyptogena shells

2003

We propose in this paper an application of multiresolution analysis techniques to extract information contained in the growth increments of a bivalve mollusk called: Calyptogena . The first stage consists in extracting a range image of the mollusk’s shell using a 3-D scanner. Applying a multiresolution analysis enables us to localize precisely those growth increments by preserving relevant details. Moreover, interesting spatial and frequency properties of the multiresolution analysis underline information contained on the shell. Intra-individual variation and inter-individual variations are compared to assume some conclusions as for the ontogenetic evolution of the animal such as periodicit…

Real-time manipulation of ZnO nanowires on a flat surface employed for tribological measurements: Experimental methods and modeling

2012

Elastic and tribological properties of zinc oxide nanowires (NWs) on Si wafer and highly oriented pyrolytic graphite (HOPG) are experimentally investigated and theoretically interpreted. Measurements are performed inside a scanning electron microscope (SEM) using real-time manipulation technique that enables two possible ways of data registration: “external” force registration with quartz tuning fork (QTF) based sensor and “internal” force registration utilizing in situ observed elastic deformation of NWs. Young modulus is determined by loading half-suspended NW at its free end and then employed for the following tribological experiments. Maximal static friction force is estimated when NW i…

Soluntina forma urbis. Analisi grafiche e schemi

2015

L’autrice propone un’interpretazione grafica del sito archeologico di Solunto attraverso una lettura digitale per layer concettuali, con l’obiettivo di individuare gli elementi urbani caratterizzanti il sito e definire un ulteriore disegno della città storica. Identificare gli elementi morfologici e tipologici che definiscono la struttura urbana del sito permette di riconoscere una sovrapposizione di sistemi grafici: quello della città sedimentata, costituito dai resti archeologici, quindi dalla materia della città ancora visibile e quello della città virtuale, all’interno del quale percorsi, punti di sosta e di aggregazione diventano elementi nodali per definire la configurazione digitale …

How to best return the value of a function

1989

Approximation algorithm for constrained coupled-tasks scheduling problem

2014

International audience; We tackle the makespan minimization coupled-tasks problem in presence of compatibility constraints. In particular, we focus on stretched coupled-tasks, i.e. coupled-tasks having the same sub-tasks execution time and idle time duration. In such context, we propose some complexity results according to several parameters and we design an efficient polynomial-time approximation algorithm.

Graph recursive least squares filter for topology inference in causal data processes

2017

In this paper, we introduce the concept of recursive least squares graph filters for online topology inference in data networks that are modelled as Causal Graph Processes (CGP). A Causal Graph Process (CGP) is an auto regressive process in the time series associated to different variables, and whose coefficients are the so-called graph filters, which are matrix polynomials with different orders of the graph adjacency matrix. Given the time series of data at different variables, the goal is to estimate these graph filters, hence the associated underlying adjacency matrix. Previously proposed algorithms have focused on a batch approach, assuming implicitly stationarity of the CGP. We propose…

Accelerating H.264 inter prediction in a GPU by using CUDA

2010

H.264/AVC defines a very efficient algorithm for the inter prediction but it takes too much time. With the emergence of General Purpose Graphics Processing Units (GPGPU), a new door has been opened to support this video algorithm into these small processing units. In this paper, a forward step is developed towards an implementation of the H.264/AVC inter prediction algorithm into a GPU using Compute Unified Device Architecture (CUDA). The results show a negligible rate distortion drop with a time reduction on average up to 93.6%.

Orders of Consciousness and Forms of Reflexivity in Descartes

2007