13 resultados para Tibetan coded character set extension B
em Cambridge University Engineering Department Publications Database
Resumo:
Drosophila germ-band extension (GBE) is an example of the convergence and extension movements that elongate and narrow embryonic tissues. To understand the collective cell behaviours underlying tissue morphogenesis, we have continuously quantified cell intercalation and cell shape change during GBE. We show that the fast, early phase of GBE depends on cell shape change in addition to cell intercalation. In antero-posterior patterning mutants such as those for the gap gene Krüppel, defective polarized cell intercalation is compensated for by an increase in antero-posterior cell elongation, such that the initial rate of extension remains the same. Spatio-temporal patterns of cell behaviours indicate that an antero-posterior tensile force deforms the germ band, causing the cells to change shape passively. The rate of antero-posterior cell elongation is reduced in twist mutant embryos, which lack mesoderm. We propose that cell shape change contributing to germ-band extension is a passive response to mechanical forces caused by the invaginating mesoderm.
Resumo:
When searching for characteristic subpatterns in potentially noisy graph data, it appears self-evident that having multiple observations would be better than having just one. However, it turns out that the inconsistencies introduced when different graph instances have different edge sets pose a serious challenge. In this work we address this challenge for the problem of finding maximum weighted cliques. We introduce the concept of most persistent soft-clique. This is subset of vertices, that 1) is almost fully or at least densely connected, 2) occurs in all or almost all graph instances, and 3) has the maximum weight. We present a measure of clique-ness, that essentially counts the number of edge missing to make a subset of vertices into a clique. With this measure, we show that the problem of finding the most persistent soft-clique problem can be cast either as: a) a max-min two person game optimization problem, or b) a min-min soft margin optimization problem. Both formulations lead to the same solution when using a partial Lagrangian method to solve the optimization problems. By experiments on synthetic data and on real social network data we show that the proposed method is able to reliably find soft cliques in graph data, even if that is distorted by random noise or unreliable observations. Copyright 2012 by the author(s)/owner(s).
Resumo:
We present a fixed-grid finite element technique for fluid-structure interaction problems involving incompressible viscous flows and thin structures. The flow equations are discretised with isoparametric b-spline basis functions defined on a logically Cartesian grid. In addition, the previously proposed subdivision-stabilisation technique is used to ensure inf-sup stability. The beam equations are discretised with b-splines and the shell equations with subdivision basis functions, both leading to a rotation-free formulation. The interface conditions between the fluid and the structure are enforced with the Nitsche technique. The resulting coupled system of equations is solved with a Dirichlet-Robin partitioning scheme, and the fluid equations are solved with a pressure-correction method. Auxiliary techniques employed for improving numerical robustness include the level-set based implicit representation of the structure interface on the fluid grid, a cut-cell integration algorithm based on marching tetrahedra and the conservative data transfer between the fluid and structure discretisations. A number of verification and validation examples, primarily motivated by animal locomotion in air or water, demonstrate the robustness and efficiency of our approach. © 2013 John Wiley & Sons, Ltd.
Resumo:
A new class of 16-ary Amplitude Phase Shift Keying (APSK) coded modulations deemed double-ring PSK modulations best suited for (satellite) nonlinear channels is proposed. Constellation parameters optimization has been based on geometric and information-theoretic considerations. Furthermore, pre- and post-compensation techniques to reduce the nonlinearity impact have been examined. Digital timing clock and carrier phase have been derived and analyzed for a Turbo coded version of the same new modulation scheme. Finally, the performance of state-of the art Turbo coded modulation for this new 16-ary digital modulation has been investigated and compared to the known TCM schemes. It is shown that for the same coding scheme, double-ring APSK modulation outperforms classical 16-QAM and 16-PSK over a typical satellite nonlinear channel due to its intrinsic robustness against the High Power Amplifier (HPA) nonlinear characteristics. The new modulation is shown to be power- and spectrally-efficient, with interesting applications to satellite communications. © 2002 by the American Institute of Aeronautics and Astronautics, Inc.
Resumo:
We present and test an extension of slow feature analysis as a novel approach to nonlinear blind source separation. The algorithm relies on temporal correlations and iteratively reconstructs a set of statistically independent sources from arbitrary nonlinear instantaneous mixtures. Simulations show that it is able to invert a complicated nonlinear mixture of two audio signals with a high reliability. The algorithm is based on a mathematical analysis of slow feature analysis for the case of input data that are generated from statistically independent sources. © 2014 Henning Sprekeler, Tiziano Zito and Laurenz Wiskott.