Search results for "ARCHITECTURE"
showing 10 items of 3706 documents
A Branch-Price-and-Cut Algorithm for the Min-Max k -Vehicle Windy Rural Postman Problem
2013
[EN] The min-max k -vehicles windy rural postman problem consists of minimizing the maximal distance traveled by a vehicle to find a set of balanced routes that jointly service all the required edges in a windy graph. This is a very difficult problem, for which a branch-and-cut algorithm has already been proposed, providing good results when the number of vehicles is small. In this article, we present a branch-price-and-cut method capable of obtaining optimal solutions for this problem when the number of vehicles is larger for the same set of required edges. Extensive computational results on instances from the literature are presented.
Impact of the community structure on the dynamics of complex networks
2023
Networks are everywhere. We encounter them daily in our lives, through our social interactions, how we come up with decisions in our brain, to having phone calls, conducting financial transactions, and traveling from one place to another. Individual actions are influenced by their environment, which is, in turn, influenced by the network's topology. Notably, individuals may change their actions, ideas, or opinions to conform to the aspirations of a particular social group. In the same vein, the spread of a virus can take a certain course if the network's structure induces specific pathways for expansion. In such scenarios, communities substantially impact the evolution of the dynamics. They…
New digital trends in current architecture. A comprehensive critical examination
2017
The research presented is about digital revolution in architecture, which has contributed to the birth of new figurative trends. The work was conducted through the definition of a framework to identify and classify architectural design elements that should be attributed to the methods and techniques of design computing, then applied to sixty prominent recent architectures which are acknowledged products of digital means. The early results suggest that a new era is coming, where the conceptual starting point of designers is often born in the digital space, taking advantage of the augmented representation skills to control and manipulate form. We will also do an overview of these new architec…
Portable Video Supercomputing
2004
As inexpensive imaging chips and wireless telecommunications are incorporated into an increasing array, of portable products, the need for high efficiency, high throughput embedded processing will become an important challenge in computer architecture. Videocentric applications, such wireless videoconferencing, real-time video enhancement and analysis, and new, immersive modes of distance education, will exceed the computational capabilities of current microprocessor and digital signal processor (DSP) architectures. A new class of embedded computers, portable video supercomputers, will combine supercomputer performance with the energy efficiency required for deployment in portable systems. …
"Le château de Dijon"
2000
National audience
Simulations of non-spherical particles suspended in a shear flow
2000
The lattice-Boltzmann method was used to investigate the effects of the shape and concentration of the particles on the rheological properties of non-Brownian suspensions for non-zero Reynolds numbers. Several case studies were analyzed and the methods used were found to give accurate predictions for these systems. The viscosity of suspensions of both spherical and non-spherical particles was determined as functions of shear rate and concentration of particles. It was shown that, for high shear rates, shear thickening appears. This phenomenon is particularly pronounced for particles of irregular shape.
Epichristoffel Words and Minimization of Moore Automata
2014
This paper is focused on the connection between the combinatorics of words and minimization of automata. The three main ingredients are the epichristoffel words, Moore automata and a variant of Hopcroft's algorithm for their minimization. Epichristoffel words defined in [14] generalize some properties of circular sturmian words. Here we prove a factorization property and the existence of the reduction tree, that uniquely identifies the structure of the word. Furthermore, in the paper we investigate the problem of the minimization of Moore automata by defining a variant of Hopcroft's minimization algorithm. The use of this variant makes simpler the computation of the running time and consequ…
Lower space bounds for randomized computation
1994
It is a fundamental problem in the randomized computation how to separate different randomized time or randomized space classes (c.f., e.g., [KV87, KV88]). We have separated randomized space classes below log n in [FK94]. Now we have succeeded to separate small randomized time classes for multi-tape 2-way Turing machines. Surprisingly, these “small” bounds are of type n+f(n) with f(n) not exceeding linear functions. This new approach to “sublinear” time complexity is a natural counterpart to sublinear space complexity. The latter was introduced by considering the input tape and the work tape as separate devices and distinguishing between the space used for processing information and the spa…
Combinatorics of Finite Words and Suffix Automata
2009
The suffix automaton of a finite word is the minimal deterministic automaton accepting the language of its suffixes. The states of the suffix automaton are the classes of an equivalence relation defined on the set of factors. We explore the relationship between the combinatorial properties of a finite word and the structural properties of its suffix automaton. We give formulas for expressing the total number of states and the total number of edges of the suffix automaton in terms of special factors of the word.
The Alternating BWT: an algorithmic perspective
2020
Abstract The Burrows-Wheeler Transform (BWT) is a word transformation introduced in 1994 for Data Compression. It has become a fundamental tool for designing self-indexing data structures, with important applications in several areas in science and engineering. The Alternating Burrows-Wheeler Transform (ABWT) is another transformation recently introduced in Gessel et al. (2012) [21] and studied in the field of Combinatorics on Words. It is analogous to the BWT, except that it uses an alternating lexicographical order instead of the usual one. Building on results in Giancarlo et al. (2018) [23] , where we have shown that BWT and ABWT are part of a larger class of reversible transformations, …