Defining the role of common variation in the genomic and biological architecture of adult human height.

Using genome-wide data from 253,288 individuals, we identified 697 variants at genome-wide significance that together explained one-fifth of the heritability for adult height. By testing different numbers of variants in independent studies, we show that the most strongly associated ∼2,000, ∼3,700 and ∼9,500 SNPs explained ∼21%, ∼24% and ∼29% of phenotypic variance. Furthermore, all common variants together captured 60% of heritability. The 697 variants clustered in 423 loci were enriched for genes, pathways and tissue types known to be involved in growth and together implicated genes and pathways not highlighted in earlier efforts, such as signaling by fibroblast growth factors, WNT/β-catenin and chondroitin sulfate-related genes. We identified several genes and pathways not previously connected with human skeletal growth, including mTOR, osteoglycin and binding of hyaluronic acid. Our results indicate a genetic architecture for human height that is characterized by a very large but finite number (thousands) of causal variants.

Tumor architecture exerts no bias on nuclear grading in breast cancer diagnosis.

We recently reported that nuclear grading in prostate cancer is subject to a strong confirmation bias induced by the tumor architecture. We now wondered whether a similar bias governs nuclear grading in breast carcinoma. An unannounced test was performed at a pathology conference. Pathologists were asked to grade nuclei in a PowerPoint presentation. Circular high power fields of 27 invasive ductal carcinomas were shown, superimposed over low power background images of either tubule-rich or tubule-poor carcinomas. We found (a) that diagnostic reproducibility of nuclear grades was poor to moderate (weighed kappa values between 0.07 and 0.54, 27 cases, 44 graders), but (b) that nuclear grades were not affected by the tumor architecture. We speculate that the categorized grading in breast cancer, separating tubule formation, nuclear pleomorphism, and mitotic figure counts in a combined three tier score, prevents the bias that architecture exerts on nuclear grades in less well-controlled situations.

VLSI architecture for an Underwater Robot Vision System

It is well known that image processing requires a huge amount of computation, mainly at low level processing where the algorithms are dealing with a great number of data-pixel. One of the solutions to estimate motions involves detection of the correspondences between two images. For normalised correlation criteria, previous experiments shown that the result is not altered in presence of nonuniform illumination. Usually, hardware for motion estimation has been limited to simple correlation criteria. The main goal of this paper is to propose a VLSI architecture for motion estimation using a matching criteria more complex than Sum of Absolute Differences (SAD) criteria. Today hardware devices provide many facilities for the integration of more and more complex designs as well as the possibility to easily communicate with general purpose processors

Le paysage originel et la nostalgique élégiaque chez Maurice Chappaz

Si le XXe siècle est l'une des époques les plus paradoxales de notre Histoire - à la fois générateur du progrès technique qui devait accroître la qualité de vie des hommes et triste berceau de deux guerres mondiales qui n'ont cessé de multi-plier ravages et victimes pendant presque trente ans -, il a produit un nombre considérable de poètes, qui continuent d'intéresser un large public. Au fil des quelque 580 pages qui constituent le présent volume, les auteurs ont tenté de présenter chacun un poète du siècle dernier, en essayant de mettre en évidence les parti-cularités de sa poétique. Ce livre n'est donc pas une anthologie de tombeaux, mais une approche intellectuelle dont le but est d'éclairer une partie de la vie et de l'oeuvre des 32 poètes traités.

Proposal of a parallel architecture for a motion detection algorithm

This paper proposes a parallel architecture for estimation of the motion of an underwater robot. It is well known that image processing requires a huge amount of computation, mainly at low-level processing where the algorithms are dealing with a great number of data. In a motion estimation algorithm, correspondences between two images have to be solved at the low level. In the underwater imaging, normalised correlation can be a solution in the presence of non-uniform illumination. Due to its regular processing scheme, parallel implementation of the correspondence problem can be an adequate approach to reduce the computation time. Taking into consideration the complexity of the normalised correlation criteria, a new approach using parallel organisation of every processor from the architecture is proposed

On AUV control architecture

This paper surveys control architectures proposed in the literature and describes a control architecture that is being developed for a semi-autonomous underwater vehicle for intervention missions (SAUVIM) at the University of Hawaii. Conceived as hybrid, this architecture has been organized in three layers: planning, control and execution. The mission is planned with a sequence of subgoals. Each subgoal has a related task supervisor responsible for arranging a set of pre-programmed task modules in order to achieve the subgoal. Task modules are the key concept of the architecture. They are the main building blocks and can be dynamically re-arranged by the task supervisor. In our architecture, deliberation takes place at the planning layer while reaction is dealt through the parallel execution of the task modules. Hence, the system presents both a hierarchical and an heterarchical decomposition, being able to show a predictable response while keeping rapid reactivity to the dynamic environment

All-Optical Label Stacking: Easing the Trade-offs Between Routing and Architecture Cost in All-Optical Packet Switching

All-optical label swapping (AOLS) forms a key technology towards the implementation of all-optical packet switching nodes (AOPS) for the future optical Internet. The capital expenditures of the deployment of AOLS increases with the size of the label spaces (i.e. the number of used labels), since a special optical device is needed for each recognized label on every node. Label space sizes are affected by the way in which demands are routed. For instance, while shortest-path routing leads to the usage of fewer labels but high link utilization, minimum interference routing leads to the opposite. This paper studies all-optical label stacking (AOLStack), which is an extension of the AOLS architecture. AOLStack aims at reducing label spaces while easing the compromise with link utilization. In this paper, an integer lineal program is proposed with the objective of analyzing the softening of the aforementioned trade-off due to AOLStack. Furthermore, a heuristic aiming at finding good solutions in polynomial-time is proposed as well. Simulation results show that AOLStack either a) reduces the label spaces with a low increase in the link utilization or, similarly, b) uses better the residual bandwidth to decrease the number of labels even more