158 resultados para Visitor segment
Resumo:
This study examines the effect of electric field on energy absorption capacity of carbon nanotube forests (CNTFs), comprising of vertically aligned multiwalled carbon nanotubes, under both quasistatic (strain rate, (epsilon) over dot = 10(-3) s(-1)) and dynamic ((epsilon) over dot = similar to 10(3) s(-1)) loading conditions. Under quasistatic condition, the CNTFs were cyclically loaded and unloaded while electric field was applied along the length of carbon nanotube (CNT) either throughout the loading cycle or explicitly during either the loading or the unloading segment. The energy absorbed per cycle by CNTF increased monotonically with electric field when the field was applied only during the loading segment: A 7 fold increase in the energy absorption capacity was registered at an electric field of 1 kV/m whereas no significant change in it was noted for other schemes of electro-mechanical loading. The energy absorption capacity of CNTF under dynamic loading condition also increased monotonically with electric field; however, relative to the quasistatic condition, less pronounced effect was observed. This intriguing strain rate dependent effect of electric field on energy absorption capacity of CNTF is explained in terms of electric field induced strengthening of CNTF, originating from the time dependent electric field induced polarization of CNT. (C) 2015 Elsevier Ltd. All rights reserved.
Resumo:
The broader goal of the research being described here is to automatically acquire diagnostic knowledge from documents in the domain of manual and mechanical assembly of aircraft structures. These documents are treated as a discourse used by experts to communicate with others. It therefore becomes possible to use discourse analysis to enable machine understanding of the text. The research challenge addressed in the paper is to identify documents or sections of documents that are potential sources of knowledge. In a subsequent step, domain knowledge will be extracted from these segments. The segmentation task requires partitioning the document into relevant segments and understanding the context of each segment. In discourse analysis, the division of a discourse into various segments is achieved through certain indicative clauses called cue phrases that indicate changes in the discourse context. However, in formal documents such language may not be used. Hence the use of a domain specific ontology and an assembly process model is proposed to segregate chunks of the text based on a local context. Elements of the ontology/model, and their related terms serve as indicators of current context for a segment and changes in context between segments. Local contexts are aggregated for increasingly larger segments to identify if the document (or portions of it) pertains to the topic of interest, namely, assembly. Knowledge acquired through such processes enables acquisition and reuse of knowledge during any part of the lifecycle of a product.
Resumo:
Biogenesis of the iron-sulfur (Fe-S) cluster is an indispensable process in living cells. In mammalian mitochondria, the initial step of the Fe-S cluster assembly process is assisted by the NFS1-ISD11 complex, which delivers sulfur to scaffold protein ISCU during Fe-S cluster synthesis. Although ISD11 is an essential protein, its cellular role in Fe-S cluster biogenesis is still not defined. Our study maps the important ISD11 amino acid residues belonging to putative helix 1 (Phe-40), helix 3 (Leu-63, Arg-68, Gln-69, Ile-72, Tyr-76), and C-terminal segment (Leu-81, Glu-84) are critical for in vivo Fe-S cluster biogenesis. Importantly, mutation of these conserved ISD11 residues into alanine leads to its compromised interaction with NFS1, resulting in reduced stability and enhanced aggregation of NFS1 in the mitochondria. Due to altered interaction with ISD11 mutants, the levels of NFS1 and Isu1 were significantly depleted, which affects Fe-S cluster biosynthesis, leading to reduced electron transport chain complex (ETC) activity and mitochondrial respiration. In humans, a clinically relevant ISD11 mutation (R68L) has been associated in the development of a mitochondrial genetic disorder, COXPD19. Our findings highlight that the ISD11 R68A/R68L mutation display reduced affinity to form a stable subcomplex with NFS1, and thereby fails to prevent NFS1 aggregation resulting in impairment of the Fe-S cluster biogenesis. The prime affected machinery is the ETC complex, which showed compromised redox properties, causing diminished mitochondrial respiration. Furthermore, the R68L ISD11 mutant displayed accumulation of mitochondrial iron and reactive oxygen species, leading to mitochondrial dysfunction, which correlates with the phenotype observed in COXPD19 patients.
Resumo:
In optical character recognition of very old books, the recognition accuracy drops mainly due to the merging or breaking of characters. In this paper, we propose the first algorithm to segment merged Kannada characters by using a hypothesis to select the positions to be cut. This method searches for the best possible positions to segment, by taking into account the support vector machine classifier's recognition score and the validity of the aspect ratio (width to height ratio) of the segments between every pair of cut positions. The hypothesis to select the cut position is based on the fact that a concave surface exists above and below the touching portion. These concave surfaces are noted down by tracing the valleys in the top contour of the image and similarly doing it for the image rotated upside-down. The cut positions are then derived as closely matching valleys of the original and the rotated images. Our proposed segmentation algorithm works well for different font styles, shapes and sizes better than the existing vertical projection profile based segmentation. The proposed algorithm has been tested on 1125 different word images, each containing multiple merged characters, from an old Kannada book and 89.6% correct segmentation is achieved and the character recognition accuracy of merged words is 91.2%. A few points of merge are still missed due to the absence of a matched valley due to the specific shapes of the particular characters meeting at the merges.
Resumo:
A new procedure for the identification of regular secondary structures using a C-alpha trace has identified 659 pi-helices in 3582 protein chains, solved at high resolution. Taking advantage of this significantly expanded database of pi-helices, we have analysed the functional and structural roles of helices and determined the position-wise amino acid propensity within and around them. These helices range from 5 to 18 residues in length with the average twist and rise being 85.2 +/- 7.2 and 1.28 +/- 0.31 angstrom, respectively. A total of 546 (similar to 83%) out of 659 pi-helices occur in conjunction with alpha-helices, with 101 pi-helices being interspersed between two alpha-helices. The majority of interspersed pi-helices were found to be conserved across a large number of structures within a protein family and produce a significant bend in the overall helical segment as well as local distortions in the neighbouring a-helices. The presence of a pi-helical fragment leads to appropriate orientation of the constituent residues, so as to facilitate favourable interactions and also help in proper folding of the protein chain. In addition to intra helical 6 -> 1 N H center dot center dot center dot O hydrogen bonds, pi-helices are also stabilized by several other non-bonded interactions. pi-Helices show distinct positional residue preferences, which are different from those of a-helices.
Resumo:
Imaging flow cytometry is an emerging technology that combines the statistical power of flow cytometry with spatial and quantitative morphology of digital microscopy. It allows high-throughput imaging of cells with good spatial resolution, while they are in flow. This paper proposes a general framework for the processing/classification of cells imaged using imaging flow cytometer. Each cell is localized by finding an accurate cell contour. Then, features reflecting cell size, circularity and complexity are extracted for the classification using SVM. Unlike the conventional iterative, semi-automatic segmentation algorithms such as active contour, we propose a noniterative, fully automatic graph-based cell localization. In order to evaluate the performance of the proposed framework, we have successfully classified unstained label-free leukaemia cell-lines MOLT, K562 and HL60 from video streams captured using custom fabricated cost-effective microfluidics-based imaging flow cytometer. The proposed system is a significant development in the direction of building a cost-effective cell analysis platform that would facilitate affordable mass screening camps looking cellular morphology for disease diagnosis. Lay description In this article, we propose a novel framework for processing the raw data generated using microfluidics based imaging flow cytometers. Microfluidics microscopy or microfluidics based imaging flow cytometry (mIFC) is a recent microscopy paradigm, that combines the statistical power of flow cytometry with spatial and quantitative morphology of digital microscopy, which allows us imaging cells while they are in flow. In comparison to the conventional slide-based imaging systems, mIFC is a nascent technology enabling high throughput imaging of cells and is yet to take the form of a clinical diagnostic tool. The proposed framework process the raw data generated by the mIFC systems. The framework incorporates several steps: beginning from pre-processing of the raw video frames to enhance the contents of the cell, localising the cell by a novel, fully automatic, non-iterative graph based algorithm, extraction of different quantitative morphological parameters and subsequent classification of cells. In order to evaluate the performance of the proposed framework, we have successfully classified unstained label-free leukaemia cell-lines MOLT, K562 and HL60 from video streams captured using cost-effective microfluidics based imaging flow cytometer. The cell lines of HL60, K562 and MOLT were obtained from ATCC (American Type Culture Collection) and are separately cultured in the lab. Thus, each culture contains cells from its own category alone and thereby provides the ground truth. Each cell is localised by finding a closed cell contour by defining a directed, weighted graph from the Canny edge images of the cell such that the closed contour lies along the shortest weighted path surrounding the centroid of the cell from a starting point on a good curve segment to an immediate endpoint. Once the cell is localised, morphological features reflecting size, shape and complexity of the cells are extracted and used to develop a support vector machine based classification system. We could classify the cell-lines with good accuracy and the results were quite consistent across different cross validation experiments. We hope that imaging flow cytometers equipped with the proposed framework for image processing would enable cost-effective, automated and reliable disease screening in over-loaded facilities, which cannot afford to hire skilled personnel in large numbers. Such platforms would potentially facilitate screening camps in low income group countries; thereby transforming the current health care paradigms by enabling rapid, automated diagnosis for diseases like cancer.
Resumo:
The central part of the Himalaya (Kumaun and Garhwal Provinces of India) is noted for its prolonged seismic quiescence, and therefore, developing a longer-term time series of past earthquakes to understand their recurrence pattern in this segment assumes importance. In addition to direct observations of offsets in stratigraphic exposures or other proxies like paleoliquefaction, deformation preserved within stalagmites (speleothems) in karst system can be analyzed to obtain continuous millennial scale time series of earthquakes. The Central Indian Himalaya hosts natural caves between major active thrusts forming potential storehouses for paleoseismological records. Here, we present results from the limestone caves in the Kumaun Himalaya and discuss the implications of growth perturbations identified in the stalagmites as possible earthquake recorders. This article focuses on three stalagmites from the Dharamjali Cave located in the eastern Kumaun Himalaya, although two other caves, one of them located in the foothills, were also examined for their suitability. The growth anomalies in stalagmites include abrupt tilting or rotation of growth axes, growth termination, and breakage followed by regrowth. The U-Th age data from three specimens allow us to constrain the intervals of growth anomalies, and these were dated at 4273 +/- 410 years BP (2673-1853 BC), 2782 +/- 79 years BP (851-693 BC), 2498 +/- 117 years BP (605-371 BC), 1503 +/- 245 years BP (262-752 AD), 1346 +/- 101 years BP (563-765 AD), and 687 +/- 147 years BP (1176-1470 AD). The dates may correspond to the timings of major/great earthquakes in the region and the youngest event (1176-1470 AD) shows chronological correspondence with either one of the great medieval earthquakes (1050-1250 and 1259-1433 AD) evident from trench excavations across the Himalayan Frontal Thrust.
Resumo:
We consider a Social Group' of networked nodes, seeking a universe' of segments. Each node has a subset of the universe and access to an expensive resource for downloading data. Nodes can also acquire the universe by exchanging copies of segments among themselves, at low cost, using inter-node links. While exchanges over inter-node links ensure minimum cost, some nodes in the group try to exploit the system. We term such nodes as non-reciprocating nodes' and prohibit such behavior by proposing the give-and-take' criterion, where exchange is allowed if each node has segments unavailable with the other. Under this criterion, we consider the problem of maximizing the number of nodes with the universe at the end of local exchanges. First, we present a randomized algorithm that is shown to be optimal in the asymptotic regime. Then, we present greedy links algorithm, which performs well for most of the scenarios and yields an optimal result when the number of nodes is four. The polygon algorithm is proposed, which yields an optimal result when each of the nodes has a unique segment. After presenting some intuitive algorithms (e.g., greedy incremental algorithm and rarest first algorithm), we compare the performances of all proposed algorithms with the optimal. Copyright (c) 2015 John Wiley & Sons, Ltd.