Acto-myosin contractility rotates the cell nucleus

The nucleus of the eukaryotic cell functions amidst active cytoskeletal �laments, but its response to the stresses carried by these �laments is largely unexplored. We report here the results of studies of the translational and rotational dynamics of the nuclei of single �broblast cells, with the e�ects of cell migration suppressed by plating onto �bronectin-coated micro-fabricated patterns. Patterns of the same area but di�erent shapes and/or aspect ratio were used to study the e�ect of cell geometry on the dynamics. On circles, squares and equilateral triangles, the nucleus undergoes persistent rotational motion, while on high-aspect-ratio rectangles of the same area it moves only back and forth. The circle and the triangle showed respectively the largest and the smallest angular speed. We show that our observations can be understood through a hydrodynamic approach in which the nucleus is treated as a highly viscous inclusion residing in a less viscous uid of orientable �laments endowed with active stresses. Lowering actin contractility selectively by introducing blebbistatin at low concentrations drastically reduced the speed and persistence time of the angular motion of the nucleus. Time-lapse imaging of actin revealed a correlated hydrodynamic ow around the nucleus, with pro�le and magnitude consistent with the results of our theoretical approach. Coherent intracellular ows and consequent nuclear rotation thus appear to be a generic property that cells must balance by speci�c mechanisms in order to maintain nuclear homeostasis

Fixed-orientation equilateral triangle matching of point sets

Given a point set P and a class C of geometric objects, G(C)(P) is a geometric graph with vertex set P such that any two vertices p and q are adjacent if and only if there is some C is an element of C containing both p and q but no other points from P. We study G(del)(P) graphs where del is the class of downward equilateral triangles (i.e., equilateral triangles with one of their sides parallel to the x-axis and the corner opposite to this side below that side). For point sets in general position, these graphs have been shown to be equivalent to half-Theta(6) graphs and TD-Delaunay graphs. The main result in our paper is that for point sets P in general position, G(del)(P) always contains a matching of size at least vertical bar P vertical bar-1/3] and this bound is tight. We also give some structural properties of G(star)(P) graphs, where is the class which contains both upward and downward equilateral triangles. We show that for point sets in general position, the block cut point graph of G(star)(P) is simply a path. Through the equivalence of G(star)(P) graphs with Theta(6) graphs, we also derive that any Theta(6) graph can have at most 5n-11 edges, for point sets in general position. (C) 2013 Elsevier B.V. All rights reserved.

A Smooth Discretization Bridging Finite Element and Mesh-free Methods Using Polynomial Reproducing Simplex Splines

This work sets forth a `hybrid' discretization scheme utilizing bivariate simplex splines as kernels in a polynomial reproducing scheme constructed over a conventional Finite Element Method (FEM)-like domain discretization based on Delaunay triangulation. Careful construction of the simplex spline knotset ensures the success of the polynomial reproduction procedure at all points in the domain of interest, a significant advancement over its precursor, the DMS-FEM. The shape functions in the proposed method inherit the global continuity (Cp-1) and local supports of the simplex splines of degree p. In the proposed scheme, the triangles comprising the domain discretization also serve as background cells for numerical integration which here are near-aligned to the supports of the shape functions (and their intersections), thus considerably ameliorating an oft-cited source of inaccuracy in the numerical integration of mesh-free (MF) schemes. Numerical experiments show the proposed method requires lower order quadrature rules for accurate evaluation of integrals in the Galerkin weak form. Numerical demonstrations of optimal convergence rates for a few test cases are given and the method is also implemented to compute crack-tip fields in a gradient-enhanced elasticity model.

Heterochromatic paths in edge colored graphs without small cycles and heterochromatic-triangle-free graphs

Conditions for the existence of heterochromatic Hamiltonian paths and cycles in edge colored graphs are well investigated in literature. A related problem in this domain is to obtain good lower bounds for the length of a maximum heterochromatic path in an edge colored graph G. This problem is also well explored by now and the lower bounds are often specified as functions of the minimum color degree of G - the minimum number of distinct colors occurring at edges incident to any vertex of G - denoted by v(G). Initially, it was conjectured that the lower bound for the length of a maximum heterochromatic path for an edge colored graph G would be 2v(G)/3]. Chen and Li (2005) showed that the length of a maximum heterochromatic path in an edge colored graph G is at least v(G) - 1, if 1 <= v(G) <= 7, and at least 3v(G)/5] + 1 if v(G) >= 8. They conjectured that the tight lower bound would be v(G) - 1 and demonstrated some examples which achieve this bound. An unpublished manuscript from the same authors (Chen, Li) reported to show that if v(G) >= 8, then G contains a heterochromatic path of length at least 120 + 1. In this paper, we give lower bounds for the length of a maximum heterochromatic path in edge colored graphs without small cycles. We show that if G has no four cycles, then it contains a heterochromatic path of length at least v(G) - o(v(G)) and if the girth of G is at least 4 log(2)(v(G)) + 2, then it contains a heterochromatic path of length at least v(G) - 2, which is only one less than the bound conjectured by Chen and Li (2005). Other special cases considered include lower bounds for the length of a maximum heterochromatic path in edge colored bipartite graphs and triangle-free graphs: for triangle-free graphs we obtain a lower bound of 5v(G)/6] and for bipartite graphs we obtain a lower bound of 6v(G)-3/7]. In this paper, it is also shown that if the coloring is such that G has no heterochromatic triangles, then G contains a heterochromatic path of length at least 13v(G)/17)]. This improves the previously known 3v(G)/4] bound obtained by Chen and Li (2011). We also give a relatively shorter and simpler proof showing that any edge colored graph G contains a heterochromatic path of length at least (C) 2015 Elsevier Ltd. All rights reserved.

Measures of Plant Surface-areas for Eurasian Watermilfoil and Water Stargrass

Plant surface areas were measured from samples of two common submersed aquatics with widely diverging morphologies: Eurasian watermilfoil ( Myriophyllum spicatum L.) and water stargrass ( Heteranthera dubia (Jacq.) MacM.). Measures for the highly dissected leaves of Eurasian watermilfoil involved development of a regression equation relating leaf length to direct measures of a subsample of leaf parts. Measures for the simple leaves of the stargrass were sums of measured triangles. Stem surfaces for both species were calculated as measured cylinders. Though the means of the stem length and leaf length were larger for stargrass samples, their mean surface area was 95 cm 2 which was less than the 108 cm 2 recorded for Eurasian watermilfoil samples. Relating surface area to dry weight for the stargrass was straightforward, with 1 mg of dry weight yielding an average 0.678 cm 2 of surface area. Biomass measures for the water milfoil were confounded by the additional weight of epiphytic algae persisting on cleaned samples. The results suggest that a lesstime consuming method for surface area measures of plants with highly dissected leaves and a caveat for using biomass measures to estimate surface area in such plants.

Linear Chromatic Adaptation Transform Based on Delaunay Triangulation

Computer vision algorithms that use color information require color constant images to operate correctly. Color constancy of the images is usually achieved in two steps: first the illuminant is detected and then image is transformed with the chromatic adaptation transform ( CAT). Existing CAT methods use a single transformation matrix for all the colors of the input image. The method proposed in this paper requires multiple corresponding color pairs between source and target illuminants given by patches of the Macbeth color checker. It uses Delaunay triangulation to divide the color gamut of the input image into small triangles. Each color of the input image is associated with the triangle containing the color point and transformed with a full linear model associated with the triangle. Full linear model is used because diagonal models are known to be inaccurate if channel color matching functions do not have narrow peaks. Objective evaluation showed that the proposed method outperforms existing CAT methods by more than 21%; that is, it performs statistically significantly better than other existing methods.

The avifauna of Laguna Llancanelo (Mendoza, Argentina), a South American wetland of international importance

Laguna Llancanelo is a large (40,000 ha), very shallow (less than 3 m deep), inland saline waterbody, located in southern Mendoza, Argentina. A survey of the avifauna was undertaken during 1983 to 1985; field trips were made mostly to the northeastern and central-western sectors of the lagoon, in the months of April, May, September, October and December. Complementary studies were made by an aerial survey and assessments of terrestrial birds in the surroundings of the lagoon. A total of 64 species in 22 families of birds usually associated with aquatic environments were recorded. The best-represented families of aquatic birds in terms of numbers of species were: Anatidae (13 swans, geese, ducks), Scolopacidae (7 sandpipers and other small waders), Ardeidae (6 herons, bitterns, egrets, Podicipedidae (4 grebes), Rallidae (4 rails, coots) and Charadriidae (4 plovers, lapwings). The most abundant nesting birds on the lagoon were: Black-necked swan Cygnus melancoryphus (824), silvery grebe Podiceps occipitalis (202) and black-crowned night heron Nycticorax nycticorax (100).

Análise dos erros na estimação de gradientes em malhas de Voronoi

Este trabalho apresenta um estudo teórico e numérico sobre os erros que ocorrem nos cálculos de gradientes em malhas não estruturadas constituídas pelo diagrama de Voronoi, malhas estas, formadas também pela triangulação de Delaunay. As malhas adotadas, no trabalho, foram as malhas cartesianas e as malhas triangulares, esta última é gerada pela divisão de um quadrado em dois ou quatro triângulos iguais. Para tal análise, adotamos a escolha de três metodologias distintas para o cálculo dos gradientes: método de Green Gauss, método do Mínimo Resíduo Quadrático e método da Média do Gradiente Projetado Corrigido. O texto se baseia em dois enfoques principais: mostrar que as equações de erros dadas pelos gradientes podem ser semelhantes, porém com sinais opostos, para pontos de cálculos em volumes vizinhos e que a ordem do erro das equações analíticas pode ser melhorada em malhas uniformes quando comparada as não uniformes, nos casos unidimensionais, e quando analisada na face de tais volumes vizinhos nos casos bidimensionais.

News from Academy Bay

It is Scalesia atractyloides! The Marine Biology Laboratory Renaissance. The CDRS Research Vessel Beagle. Alcedo Update. Benefit Art Show Held on Santa Cruz. New Construction. Geological Activity? High Technology Science. More Pinta News. First Record of the Green Heron (Butorides viriscens) in the Galápagos Islands. Galápagos Explorer Goes Aground. A Flight Over Isabela's Northern Volcanoes.

SiO2 对Bi2O3-B2O3 玻璃体系光学、热学及结构的 影响

Glasses with compositions 50Bi2O3-xB2O3- (50-x)SiO2(x=0, 10, 20, 30, 40, 50) in mol% have been prepared by using a normal melt-quench technique. The effect of SiO2 addition on thermal stability, optical properties and structural characteristic on Bi2O3-B2O3 glass were systematically investigated by using XRD, DTA, ultraviolet-visible transmittance spectra, midinfrared transmittance spectra and Raman spectra. The experimental results demonstrate that, with the addition of SiO2, thermal stability of glass samples has been obviously improved. Once the amount of SiO2 is too much, the glass samples tend to be phase seperation which results in the decrease of thermal stability. With increasing SiO2 content, the UV cutoff edge firstly shifts to short-wave band and then shifts to long-wave band, and the transmittance of mid-infrared has been greatly improved. With substitution of SiO2 for B2O3, the [BO3] triangles and [BO4] tetrahedral groups are gradually replaced by [SiO4]. [BiO6] octahedral and [SiO4] tetrahedral units are connected forming a vibrational mode of Bi-O-Si. The physical chemistry and optical performance of Bi2O3-B2O3 glass were greatly improved by addition of SiO2.

Linear Chromatic Adaptation Transform Based on Delaunay Triangulation

Computer vision algorithms that use color information require color constant images to operate correctly. Color constancy of the images is usually achieved in two steps: first the illuminant is detected and then image is transformed with the chromatic adaptation transform ( CAT). Existing CAT methods use a single transformation matrix for all the colors of the input image. The method proposed in this paper requires multiple corresponding color pairs between source and target illuminants given by patches of the Macbeth color checker. It uses Delaunay triangulation to divide the color gamut of the input image into small triangles. Each color of the input image is associated with the triangle containing the color point and transformed with a full linear model associated with the triangle. Full linear model is used because diagonal models are known to be inaccurate if channel color matching functions do not have narrow peaks. Objective evaluation showed that the proposed method outperforms existing CAT methods by more than 21%; that is, it performs statistically significantly better than other existing methods.

Hardware Reconfigurável para Controladores Nebulosos.

Controle de processos é uma das muitas aplicações que aproveitam as vantagens do uso da teoria de conjuntos nebulosos. Nesse tipo de aplicação, o controlador é, geralmente, embutido no dispositivo controlado. Esta dissertação propõe uma arquitetura reconfigurável eficiente para controladores nebulosos embutidos. A arquitetura é parametrizável, de tal forma, que permite a configuração do controlador para que este possa ser usado na implementação de qualquer aplicação ou modelo nebuloso. Os parâmetros de configuração são: o número de variáveis de entrada (N); o número de variáveis de saída (M); o número de termos linguísticos (Q); e o número total de regras (P). A arquitetura proposta proporciona também a configuração das características que definem as regras e as funções de pertinência de cada variável de entrada e saída, permitindo a escalabilidade do projeto. A composição das premissas e consequentes das regras são configuráveis, de acordo com o controlador nebuloso objetivado. A arquitetura suporta funções de pertinência triangulares, mas pode ser estendida para aceitar outras formas, do tipo trapezoidal, sem grandes modificações. As características das funções de pertinência de cada termo linguístico, podem ser ajustadas de acordo com a definição do controlador nebuloso, permitindo o uso de triângulos. Virtualmente, não há limites máximos do número de regras ou de termos linguísticos empregados no modelo, bem como no número de variáveis de entrada e de saída. A macro-arquitetura do controlador proposto é composta por N blocos de fuzzificação, 1 bloco de inferência, M blocos de defuzzificação e N blocos referentes às características das funções de pertinência. Este último opera apenas durante a configuração do controlador. A função dos blocos de fuzzificação das variáveis de entrada é executada em paralelo, assim como, os cálculos realizados pelos blocos de defuzzificação das variáveis de saída. A paralelização das unidades de fuzzificação e defuzzificação permite acelerar o processo de obtenção da resposta final do controlador. Foram realizadas várias simulações para verificar o correto funcionamento do controlador, especificado em VHDL. Em um segundo momento, para avaliar o desempenho da arquitetura, o controlador foi sintetizado em FPGA e testado em seis aplicações para verificar sua reconfigurabilidade e escalabilidade. Os resultados obtidos foram comparados com os do MATLAB em cada aplicação implementada, para comprovar precisão do controlador.

Avaliação da sobrevida global dos pacientes portadores de câncer de pulmão invasores da fáscia endotorácica, submetidos à ressecção extramusculoperiostal em Gaiola de Passarinho

O câncer de pulmão tem alto grau de letalidade. O tabagismo é considerado o principal fator de risco associado ao carcinoma de pulmão não pequenas células. O tratamento que oferece as maiores possibilidades de cura é a cirurgia. A ressecção pulmonar associada atoracectomia é a cirurgia preconizada nos tumores T3 invadindo a parede torácica. A ressecção em Gaiola de Passarinho pode ser considerada uma técnica alternativa. Foram analisados retrospectivamente, de janeiro de 1990 à dezembro de 2009, 13 pacientes portadores de câncer de pulmão aderidos a parede torácica. Eles foram submetidos à ressecção extramusculoperiostal em Gaiola de Passarinho no Hospital Universitário Pedro Ernesto. A avaliação do grau de invasão à parede torácica foi feita no pré-operatório por métodos de imagem; e sua comprovação baseada nos achados histopatológicos dos fragmentos de tecidos enviados para a biópsia de congelação, assim como nos laudos definitivos das peças ressecadas. Os pacientes com tumores de Pancoast ou que abandonaram o acompanhamento foram excluídos do estudo. A avaliação da sobrevida global foi feita a partir dos dados de seguimento pós operatório a nível ambulatorial. A análise estatística foi composta pela curva de sobrevida ou livre de eventos ajustada pelo método de Kaplan-Meier. Complicações pós operatórias, intervalo livre de doença, recidiva local, e uso de terapia complementar também foram incluídos na análise. A idade média em anos foi de 59,6. Todos os pacientes eram tabagistas. O tipo histológico mais encontrado foi o carcinoma escamoso. A média de intervalo livre de doença foi de 44,7 meses. A sobrevida global em cinco anos foi de 60% e o índice de complicações pós-operatórias foi de 69,2%. Não houve mortalidade operatória. O estágio Ib foi encontrado em 80 %. A ressecção extramusculoperiostal demonstrou ser uma alternativa segura de tratamento cirúrgico dos tumores que não invadiram efetivamente o gradil costal. Porém novos estudos tornam-se necessários. Esta dissertação pode servir de base para futuras pesquisas sobre o tratamento cirúrgico do câncer de pulmão.