97 resultados para COPY-NUMBER ALTERATION
Resumo:
A $k$-box $B=(R_1,...,R_k)$, where each $R_i$ is a closed interval on the real line, is defined to be the Cartesian product $R_1\times R_2\times ...\times R_k$. If each $R_i$ is a unit length interval, we call $B$ a $k$-cube. Boxicity of a graph $G$, denoted as $\boxi(G)$, is the minimum integer $k$ such that $G$ is an intersection graph of $k$-boxes. Similarly, the cubicity of $G$, denoted as $\cubi(G)$, is the minimum integer $k$ such that $G$ is an intersection graph of $k$-cubes. It was shown in [L. Sunil Chandran, Mathew C. Francis, and Naveen Sivadasan: Representing graphs as the intersection of axis-parallel cubes. MCDES-2008, IISc Centenary Conference, available at CoRR, abs/cs/ 0607092, 2006.] that, for a graph $G$ with maximum degree $\Delta$, $\cubi(G)\leq \lceil 4(\Delta +1)\log n\rceil$. In this paper, we show that, for a $k$-degenerate graph $G$, $\cubi(G) \leq (k+2) \lceil 2e \log n \rceil$. Since $k$ is at most $\Delta$ and can be much lower, this clearly is a stronger result. This bound is tight. We also give an efficient deterministic algorithm that runs in $O(n^2k)$ time to output a $8k(\lceil 2.42 \log n\rceil + 1)$ dimensional cube representation for $G$. An important consequence of the above result is that if the crossing number of a graph $G$ is $t$, then $\boxi(G)$ is $O(t^{1/4}{\lceil\log t\rceil}^{3/4})$ . This bound is tight up to a factor of $O((\log t)^{1/4})$. We also show that, if $G$ has $n$ vertices, then $\cubi(G)$ is $O(\log n + t^{1/4}\log t)$. Using our bound for the cubicity of $k$-degenerate graphs we show that cubicity of almost all graphs in $\mathcal{G}(n,m)$ model is $O(d_{av}\log n)$, where $d_{av}$ denotes the average degree of the graph under consideration. model is O(davlogn).
Resumo:
Ab initio GW calculations are a standard method for computing the spectroscopic properties of many materials. The most computationally expensive part in conventional implementations of the method is the generation and summation over the large number of empty orbitals required to converge the electron self-energy. We propose a scheme to reduce the summation over empty states by the use of a modified static remainder approximation, which is simple to implement and yields accurate self-energies for both bulk and molecular systems requiring a small fraction of the typical number of empty orbitals.
Resumo:
Lipopolysaccharide (LPS) is an endotoxin, a potent stimulator of immune response and induction of LPS leads to acute lung injury (ALI)/acute respiratory distress syndrome (ARDS). ARDS is a life-threatening disease worldwide with a high mortality rate. The immunological effect of LPS with spleen and thymus is well documented; however the impact on membrane phospholipid during endotoxemia has not yet been studied. Hence we aimed to investigate the influence of LPS on spleen and thymus phospholipid and fatty acid composition by 32P]orthophosphate labeling in rats. The in vitro labeling was carried out with phosphate-free medium (saline). Time course, LPS concentration-dependent, pre- and post-labeling with LPS and fatty acid analysis of phospholipid were performed. Labeling studies showed that 50 mu g LPS specifically altered the major phospholipids, phosphatidylcholine and phosphatidylglycerol in spleen and phosphatidylcholine in thymus. Fatty acid analysis showed a marked alteration of unsaturated fatty acids/saturated fatty acids in spleen and thymus leading to immune impairment via the fatty acid remodeling pathway. Our present in vitro lipid metabolic labeling study could open up new vistas for exploring LPS-induced immune impairment in spleen and thymus, as well as the underlying mechanism.
Resumo:
The timer-based selection scheme is a popular, simple, and distributed scheme that is used to select the best node from a set of available nodes. In it, each node sets a timer as a function of a local preference number called a metric, and transmits a packet when its timer expires. The scheme ensures that the timer of the best node, which has the highest metric, expires first. However, it fails to select the best node if another node transmits a packet within Delta s of the transmission by the best node. We derive the optimal timer mapping that maximizes the average success probability for the practical scenario in which the number of nodes in the system is unknown but only its probability distribution is known. We show that it has a special discrete structure, and present a recursive characterization to determine it. We benchmark its performance with ad hoc approaches proposed in the literature, and show that it delivers significant gains. New insights about the optimality of some ad hoc approaches are also developed.
Resumo:
Let I be an m-primary ideal of a Noetherian local ring (R, m) of positive dimension. The coefficient e(1)(I) of the Hilbert polynomial of an I-admissible filtration I is called the Chern number of I. A formula for the Chern number has been derived involving the Euler characteristic of subcomplexes of a Koszul complex. Specific formulas for the Chern number have been given in local rings of dimension at most two. These have been used to provide new and unified proofs of several results about e(1)(I).
Resumo:
A dynamical instability is observed in experimental studies on micro-channels of rectangular cross-section with smallest dimension 100 and 160 mu m in which one of the walls is made of soft gel. There is a spontaneous transition from an ordered, laminar flow to a chaotic and highly mixed flow state when the Reynolds number increases beyond a critical value. The critical Reynolds number, which decreases as the elasticity modulus of the soft wall is reduced, is as low as 200 for the softest wall used here (in contrast to 1200 for a rigid-walled channel) The instability onset is observed by the breakup of a dye-stream introduced in the centre of the micro-channel, as well as the onset of wall oscillations due to laser scattering from fluorescent beads embedded in the wall of the channel. The mixing time across a channel of width 1.5 mm, measured by dye-stream and outlet conductance experiments, is smaller by a factor of 10(5) than that for a laminar flow. The increased mixing rate comes at very little cost, because the pressure drop (energy requirement to drive the flow) increases continuously and modestly at transition. The deformed shape is reconstructed numerically, and computational fluid dynamics (CFD) simulations are carried out to obtain the pressure gradient and the velocity fields for different flow rates. The pressure difference across the channel predicted by simulations is in agreement with the experiments (within experimental errors) for flow rates where the dye stream is laminar, but the experimental pressure difference is higher than the simulation prediction after dye-stream breakup. A linear stability analysis is carried out using the parallel-flow approximation, in which the wall is modelled as a neo-Hookean elastic solid, and the simulation results for the mean velocity and pressure gradient from the CFD simulations are used as inputs. The stability analysis accurately predicts the Reynolds number (based on flow rate) at which an instability is observed in the dye stream, and it also predicts that the instability first takes place at the downstream converging section of the channel, and not at the upstream diverging section. The stability analysis also indicates that the destabilization is due to the modification of the flow and the local pressure gradient due to the wall deformation; if we assume a parabolic velocity profile with the pressure gradient given by the plane Poiseuille law, the flow is always found to be stable.
Resumo:
In this paper control of oblique vortex shedding in the wake behind a straight circular cylinder is explored experimentally and computationally. Towards this, steady rotation of the cylinder about its axis is used as a control device. Some limited studies are also performed with a stepped circular cylinder, where at the step the flow is inevitably three-dimensional irrespective of the rotation rate. When there is no rotation, the vortex shedding pattern is three dimensional as described in many previous studies. With a non-zero rotation rate, it is demonstrated experimentally as well as numerically that the shedding pattern becomes more and more two-dimensional. At sufficiently high rotation rates, the vortex shedding is completely suppressed.
Resumo:
Mechanisms involved in establishing the organization and numbers of fibres in a muscle are not completely understood. During Drosophila indirect flight muscle (IFM) formation, muscle growth is achieved by both incorporating hundreds of nuclei, and hypertrophy. As a result, IFMs provide a good model with which to understand the mechanisms that govern overall muscle organization and growth. We present a detailed analysis of the organization of dorsal longitudinal muscles (DLMs), a subset of the IFMs. We show that each DLM is similar to a vertebrate fascicle and consists of multiple muscle fibres. However, increased fascicle size does not necessarily change the number of constituent fibres, but does increase the number of myofibrils packed within the fibres. We also find that altering the number of myoblasts available for fusion changes DLM fascicle size and fibres are loosely packed with myofibrils. Additionally, we show that knock down of genes required for mitochondrial fusion causes a severe reduction in the size of DLM fascicles and fibres. Our results establish the organization levels of DLMs and highlight the importance of the appropriate number of nuclei and mitochondrial fusion in determining the overall organization, growth and size of DLMs. (C) 2013 Elsevier Inc. All rights reserved.
Resumo:
Here we report chromium isotope compositions, expressed as delta Cr-53/ 52 in per mil (&) relative to NIST 979, measured in selected Cr-rich minerals and rocks formed by the primary magmatic as well as the secondary metamorphic and weathering processes. The main objectives of this study were: (i) to further constrain the isotope composition of the Earth's mantle Cr inventory and its possible variation during geological history, based on the analysis of globally distributed and stratigraphically constrained mantle-derived chromites; and (ii) to investigate the magnitude and systematics of Cr isotope fractionation during oxidative weathering and secondary alteration (i. e., hydration, serpentinization) of the magmatic Cr sources. Specifically, we analyzed delta Cr-53/ 52 in a set of globally distributed mantle-derived chromites (FeMgCr2O4, n = 30) collected from various locations in Europe, Asia, Africa and South America, and our results confirm that a chromite-hosted Earth's mantle Cr inventory is uniform at - 0.079 +/- 0.129& (2SD), which we named here as a ` canonical' mantle d 53/ 52 Cr signature. Furthermore our dataset of stratigraphically constrained chromites, whose crystallization ages cover most of the Earth's geological history, indicate that the bulk Cr isotope composition of the chromite-hosted mantle inventory has remained uniform, within about +/- 0.100&, since at least the Early Archean times (similar to 3500 million years ago, Ma). To investigate the systematics of Cr isotope fractionation associated with alteration processes we analyzed a number of secondary Cr-rich minerals and variably altered ultramafic rocks (i. e., serpentinized harzburgites, lherzolites) that revealed large positive delta Cr-53/ 52 anomalies that are systematically shifted to higher values with an increasing degree of alteration and serpentinization. The degree of aqueous alteration and serpentinization was quantified by the abundances of fluid-mobile (Rb, K) elements, and by the Loss On Ignition (LOI) parameter, which determines the amount of structurally bound water (OH/ H2O) present in secondary hydrated minerals like serpentine. Overall, we observed that altered ultramafic rocks that yielded the highest LOI values, and the lowest amounts of fluid mobile elements, also yielded the heaviest delta Cr-53/ 52 signatures. Therefore, we conclude that secondary alteration (i.e., hydration, serpentinization) of ultramafic rocks in near-surface oxidative environments tend to shift the bulk Cr isotope composition of the weathered products to isotopically heavier values, pointing to a dynamic redox cycling of Cr in the Earth's crustal and near-surface environments. Hence, if validated by future
Resumo:
In this paper, we propose a quantum method for generation of random numbers based on bosonic stimulation. Randomness arises through the path-dependent indeterministic amplification of two competing bosonic modes. We show that the process provides an efficient method for macroscopic extraction of microscopic randomness.
Resumo:
The distributed, low-feedback, timer scheme is used in several wireless systems to select the best node from the available nodes. In it, each node sets a timer as a function of a local preference number called a metric, and transmits a packet when its timer expires. The scheme ensures that the timer of the best node, which has the highest metric, expires first. However, it fails to select the best node if another node transmits a packet within Delta s of the transmission by the best node. We derive the optimal metric-to-timer mappings for the practical scenario where the number of nodes is unknown. We consider two cases in which the probability distribution of the number of nodes is either known a priori or is unknown. In the first case, the optimal mapping maximizes the success probability averaged over the probability distribution. In the second case, a robust mapping maximizes the worst case average success probability over all possible probability distributions on the number of nodes. Results reveal that the proposed mappings deliver significant gains compared to the mappings considered in the literature.
Resumo:
Hydrophobic/superhydrophobic metallic surfaces prepared via chemical treatment are encountered in many industrial scenarios involving the impingement of spray droplets. The effectiveness of such surfaces is understood through the analysis of droplet impact experiments. In the present study, three target surfaces with aluminum (Al-6061) as base material-acid-etched, Octadecyl Trichloro Silane (OTS) coated, and acid-etched plus OTS-coated-were prepared. Experiments on the impact of inertia dominated water drops on these chemically modified aluminum surfaces were carried out with the objective to highlight the effect of chemical treatment on the target surfaces on key sub-processes occurring in drop impact phenomenon. High speed videos of the entire drop impact dynamics were captured at three Weber number (We) conditions representative of high We (We > 200) regime. During the early stages of drop spreading, the drop impact resulted in ejection of secondary droplets from spreading drop front on the etched surfaces resembling prompt splash on rough surfaces whereas no such splashing was observable on untreated aluminum surface. Prominent development of undulations (fingers) were observed at the rim of drop spreading on the etched surfaces; between the etched surfaces the OTS-coated surface showed a subdued development of fingers than the uncoated surface. The impacted drops showed intense receding on OTS-coated surfaces whereas on the etched surface a highly irregular receding, with drop liquid sticking to the surface, was observed. Quantitative analyses were performed to reveal the effect of target surface characteristics on drop impact parameters such as temporal variation of spread factor of drop lamella, temporal variation of average finger length during spreading phase, maximum drop spreading, time taken to attain maximum spreading, sensitivity of maximum spreading to We, number of fingers at maximum spreading, and average receding velocity of drop lamella. Existing models for maximum drop spreading showed reasonably good agreement with the experimental measurements on the target surfaces except the acid-etched surface. (C) 2014 Elsevier B.V. All rights reserved.
Resumo:
Rainbow connection number, rc(G), of a connected graph G is the minimum number of colors needed to color its edges so that every pair of vertices is connected by at least one path in which no two edges are colored the same (note that the coloring need not be proper). In this paper we study the rainbow connection number with respect to three important graph product operations (namely the Cartesian product, the lexicographic product and the strong product) and the operation of taking the power of a graph. In this direction, we show that if G is a graph obtained by applying any of the operations mentioned above on non-trivial graphs, then rc(G) a parts per thousand currency sign 2r(G) + c, where r(G) denotes the radius of G and . In general the rainbow connection number of a bridgeless graph can be as high as the square of its radius 1]. This is an attempt to identify some graph classes which have rainbow connection number very close to the obvious lower bound of diameter (and thus the radius). The bounds reported are tight up to additive constants. The proofs are constructive and hence yield polynomial time -factor approximation algorithms.
Resumo:
Central to network tomography is the problem of identifiability, the ability to identify internal network characteristics uniquely from end-to-end measurements. This problem is often underconstrained even when internal network characteristics such as link delays are modeled as additive constants. While it is known that the network topology can play a role in determining the extent of identifiability, there is a lack in the fundamental understanding of being able to quantify it for a given network. In this paper, we consider the problem of identifying additive link metrics in an arbitrary undirected network using measurement nodes and establishing paths/cycles between them. For a given placement of measurement nodes, we define and derive the ``link rank'' of the network-the maximum number of linearly independent cycles/paths that may be established between the measurement nodes. We achieve this in linear time. The link rank helps quantify the exact extent of identifiability in a network. We also develop a quadratic time algorithm to compute a set of cycles/paths that achieves the maximum rank.