86 resultados para Temporal dimension


Relevância:

20.00% 20.00%

Publicador:

Resumo:

Let G be a simple, undirected, finite graph with vertex set V (G) and edge set E(G). A k-dimensional box is a Cartesian product of closed intervals [a(1), b(1)] x [a(2), b(2)] x ... x [a(k), b(k)]. The boxicity of G, box(G), is the minimum integer k such that G can be represented as the intersection graph of k-dimensional boxes; i.e., each vertex is mapped to a k-dimensional box and two vertices are adjacent in G if and only if their corresponding boxes intersect. Let P = (S, P) be a poset, where S is the ground set and P is a reflexive, antisymmetric and transitive binary relation on S. The dimension of P, dim(P), is the minimum integer t such that P can be expressed as the intersection of t total orders. Let G(P) be the underlying comparability graph of P; i.e., S is the vertex set and two vertices are adjacent if and only if they are comparable in P. It is a well-known fact that posets with the same underlying comparability graph have the same dimension. The first result of this paper links the dimension of a poset to the boxicity of its underlying comparability graph. In particular, we show that for any poset P, box(G(P))/(chi(G(P)) - 1) <= dim(P) <= 2box(G(P)), where chi(G(P)) is the chromatic number of G(P) and chi(G(P)) not equal 1. It immediately follows that if P is a height-2 poset, then box(G(P)) <= dim(P) <= 2box(G(P)) since the underlying comparability graph of a height-2 poset is a bipartite graph. The second result of the paper relates the boxicity of a graph G with a natural partial order associated with the extended double cover of G, denoted as G(c): Note that G(c) is a bipartite graph with partite sets A and B which are copies of V (G) such that, corresponding to every u is an element of V (G), there are two vertices u(A) is an element of A and u(B) is an element of B and {u(A), v(B)} is an edge in G(c) if and only if either u = v or u is adjacent to v in G. Let P(c) be the natural height-2 poset associated with G(c) by making A the set of minimal elements and B the set of maximal elements. We show that box(G)/2 <= dim(P(c)) <= 2box(G) + 4. These results have some immediate and significant consequences. The upper bound dim(P) <= 2box(G(P)) allows us to derive hitherto unknown upper bounds for poset dimension such as dim(P) = 2 tree width (G(P)) + 4, since boxicity of any graph is known to be at most its tree width + 2. In the other direction, using the already known bounds for partial order dimension we get the following: (1) The boxicity of any graph with maximum degree Delta is O(Delta log(2) Delta), which is an improvement over the best-known upper bound of Delta(2) + 2. (2) There exist graphs with boxicity Omega(Delta log Delta). This disproves a conjecture that the boxicity of a graph is O(Delta). (3) There exists no polynomial-time algorithm to approximate the boxicity of a bipartite graph on n vertices with a factor of O(n(0.5-is an element of)) for any is an element of > 0 unless NP = ZPP.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Malaria afflicts 300 million people worldwide, with over a million deaths every year. With no immediate prospect of a vaccine against the disease, drugs are the only choice to treat it. Unfortunately, the parasite has become resistant to most antimalarials, restricting the option to use artemisinins (ARTs) for effective cure. With the use of ARTs as the front-line antimalarials, reports are already available on the possible resistance development to these drugs as well. Therefore, it has become necessary to use ART-based combination therapies to delay emergence of resistance. It is also necessary to discover new pharmacophores to eventually replace ART. Studies in our laboratory have shown that curcumin not only synergizes with ART as an antimalarial to kill the parasite, but is also uniquely able to prime the immune system to protect against parasite recrudescence in the animal model. The results indicate a potential for the use of ART curcumin combination against recrudescence/relapse in falciparum and vivax malaria. In addition, studies have also suggested the use of curcumin as an adjunct therapy against cerebral malaria. In this review we have attempted to highlight these aspects as well as the studies directed to discover new pharmacophores as potential replacements for ART.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Helicopter trim involves solution of nonlinear force equilibrium equations. As in many nonlinear dynamic systems, helicopter trim problem can show chaotic behavior. This chaotic behavior is found in the basin of attraction of the nonlinear trim equations which have to be solved to determine the main rotor control inputs given by the pilot. This study focuses on the boundary of the basin of attraction obtained for a set of control inputs. We analyze the boundary by considering it at different magnification levels. The magnified views reveal intricate geometries. It is also found that the basin boundary exhibits the characteristic of statistical self-similarity, which is an essential property of fractal geometries. These results led the authors to investigate the fractal dimension of the basin boundary. It is found that this dimension is indeed greater than the topological dimension. From all the observations, it is evident that the boundary of the basin of attraction for helicopter trim problem is fractal in nature. (C) 2012 Elsevier Inc. All rights reserved.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

This paper discusses an approach for river mapping and flood evaluation based on multi-temporal time series analysis of satellite images utilizing pixel spectral information for image classification and region-based segmentation for extracting water-covered regions. Analysis of MODIS satellite images is applied in three stages: before flood, during flood and after flood. Water regions are extracted from the MODIS images using image classification (based on spectral information) and image segmentation (based on spatial information). Multi-temporal MODIS images from ``normal'' (non-flood) and flood time-periods are processed in two steps. In the first step, image classifiers such as Support Vector Machines (SVMs) and Artificial Neural Networks (ANNs) separate the image pixels into water and non-water groups based on their spectral features. The classified image is then segmented using spatial features of the water pixels to remove the misclassified water. From the results obtained, we evaluate the performance of the method and conclude that the use of image classification (SVM and ANN) and region-based image segmentation is an accurate and reliable approach for the extraction of water-covered regions. (c) 2012 COSPAR. Published by Elsevier Ltd. All rights reserved.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Various logical formalisms with the freeze quantifier have been recently considered to model computer systems even though this is a powerful mechanism that often leads to undecidability. In this article, we study a linear-time temporal logic with past-time operators such that the freeze operator is only used to express that some value from an infinite set is repeated in the future or in the past. Such a restriction has been inspired by a recent work on spatio-temporal logics that suggests such a restricted use of the freeze operator. We show decidability of finitary and infinitary satisfiability by reduction into the verification of temporal properties in Petri nets by proposing a symbolic representation of models. This is a quite surprising result in view of the expressive power of the logic since the logic is closed under negation, contains future-time and past-time temporal operators and can express the nonce property and its negation. These ingredients are known to lead to undecidability with a more liberal use of the freeze quantifier. The article also contains developments about the relationships between temporal logics with the freeze operator and counter automata as well as reductions into first-order logics over data words.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

The transport of reactive solutes through fractured porous formations has been analyzed. The transport through the porous block is represented by a general multiprocess nonequilibrium equation (MPNE), which, for the fracture, is represented by an advection-dispersion equation with linear equilibrium sorption and first-order transformation. An implicit finite-difference technique has been used to solve the two coupled equations. The transport characteristics have been analyzed in terms of zeroth, first, and second temporal moments of the solute in the fracture. The solute behavior for fractured impermeable and fractured permeable formations are first compared and the effects of various fracture and matrix transport parameters are analyzed. Subsequently, the transport through a fractured permeable formation is analyzed to ascertain the effect of equilibrium sorption, rate-limited sorption, and the multiprocess nonequilibrium transport process. It was found that the temporal moments were nearly identical for the fractured impermeable and permeable formations when both the diffusion coefficient and the first-order transformation coefficient were relatively large. The multiprocess nonequilibrium model resulted in a smaller mass recovery in the fracture and higher dispersion than the equilibrium and rate-limited sorption models. DOI: 10.1061/(ASCE)HE.19435584.0000586. (C) 2012 American Society of Civil Engineers.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

The Hooghly River estuary provides a unique experimental site to understand the effect of monsoonal river discharge on freshwater and seawater mixing. Water samples collected bi-weekly for a duration of 17 months were analyzed for salinity, delta O-18,delta C-13(DIC), as well as delta D to investigate the differential mixing of freshwater and seawater. The differences in salinity and delta O-18 of samples collected during low and high tides on the same day are strongly correlated suggesting a well mixed water column at our sampling site. Low salinity and depleted delta O-18 during monsoon is consistent with increased river discharge as well as high rainfall. We identified different slopes in a delta O-18 versus salinity plot for the estuary water samples collected during monsoon and non-monsoon seasons. This is driven by composition of the freshwater source which is dominated by rainwater during monsoon and rivers during non-monsoon months. Selected delta D analyses of samples indicate that groundwater contributes significantly to the Hooghly Estuary during low rainfall times of the year. delta C-13(DIC) measured in the water recorded low values towards the end of monsoon indicating low productivity (i.e. increased organic respiration) while progressively increasing delta C-13(DIC) values from October till January as well as during some of the pre-monsoon months can be explained by increasing productivity. Very low delta C-13(DIC) (similar to-20%0) suggests involvement of carbon derived from anaerobic oxidation of organics and/or methane with potential contribution from increased anthropogenic water supply. An estimate of seawater incursion into the Hooghly Estuary at different times of the year is obtained by using salinity data in a two-component mixing model. Presence of seawater was found maximum (31-37%) during February till July and lowest (less than or equal to 6%) from September till November. We notice a temporal offset between Ganges River discharge farther upstream at Farakka and salinity variation at the Hooghly Estuary. We believe that this time lag is a result of the physical distance between Farakka and Kakdweep (our sampling location) and put constraints on the travel time of river water during early monsoon. (c) 2012 Published by Elsevier B.V.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

In this paper, we are interested in high spectral efficiency multicode CDMA systems with large number of users employing single/multiple transmit antennas and higher-order modulation. In particular, we consider a local neighborhood search based multiuser detection algorithm which offers very good performance and complexity, suited for systems with large number of users employing M-QAM/M-PSK. We apply the algorithm on the chip matched filter output vector. We demonstrate near-single user (SU) performance of the algorithm in CDMA systems with large number of users using 4-QAM/16-QAM/64-QAM/8-PSK on AWGN, frequency-flat, and frequency-selective fading channels. We further show that the algorithm performs very well in multicode multiple-input multiple-output (MIMO) CDMA systems as well, outperforming other linear detectors and interference cancelers reported in the literature for such systems. The per-symbol complexity of the search algorithm is O(K2n2tn2cM), K: number of users, nt: number of transmit antennas at each user, nc: number of spreading codes multiplexed on each transmit antenna, M: modulation alphabet size, making the algorithm attractive for multiuser detection in large-dimension multicode MIMO-CDMA systems with M-QAM.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

The gross characteristics of spatio-temporal current evolution in the return stroke phase of a cloud-to-ground lightning are rather well defined. However, they by themselves do not ensure the salient features for the resulting remote Electro- Magnetic Fields (EMFs). In spite of significant efforts in the engineering models wherein, the spatio-temporal current distribution all along the channel is specified by the design, all the salient features of remote EMFs could not be achieved. Only the current evolution that ensures the basic characteristics along with its ability to reproduce all the salient features of remote EMFs ranging from 50 m – 200 km from the lightning channel, can be considered as a realistic return stroke channel current. In view of this, the present work intends to investigate on the required fine features of the return stroke current evolution that yields all the desired features. To ensure that the current evolution is not arbitrary but obeys the involved basic physical processes, a recently developed physical model will be employed for the analysis.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Compressive Sampling Matching Pursuit (CoSaMP) is one of the popular greedy methods in the emerging field of Compressed Sensing (CS). In addition to the appealing empirical performance, CoSaMP has also splendid theoretical guarantees for convergence. In this paper, we propose a modification in CoSaMP to adaptively choose the dimension of search space in each iteration, using a threshold based approach. Using Monte Carlo simulations, we show that this modification improves the reconstruction capability of the CoSaMP algorithm in clean as well as noisy measurement cases. From empirical observations, we also propose an optimum value for the threshold to use in applications.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

The potential merit of laser-induced breakdown spectroscopy (LIBS) has been demonstrated for detection and quantification of trace pollutants trapped in snow/ice samples. In this technique, a high-power pulsed laser beam from Nd:YAG Laser (Model no. Surelite III-10, Continuum, Santa Clara, CA, USA) is focused on the surface of the target to generate plasma. The characteristic emissions from laser-generated plasma are collected and recorded by a fiber-coupled LIBS 2000+ (Ocean Optics, Santa Clara, CA, USA) spectrometer. The fingerprint of the constituents present in the sample is obtained by analyzing the spectral lines by using OOI LIBS software. Reliable detection of several elements like Zn, Al, Mg, Fe, Ca, C, N, H, and O in snow/ice samples collected from different locations (elevation) of Manali and several snow samples collected from the Greater Himalayan region (from a cold lab in Manali, India) in different months has been demonstrated. The calibration curve approach has been adopted for the quantitative analysis of these elements like Zn, Al, Fe, and Mg. Our results clearly demonstrate that the level of contamination is higher in those samples that were collected in the month of January in comparison to those collected in February and March.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Intraspecific competition is a key factor shaping space-use strategies and movement decisions in many species, yet how and when neighbors utilize shared areas while exhibiting active avoidance of one another is largely unknown. Here, we investigated temporal landscape partitioning in a population of wild baboons (Papio cynocephalus). We used global positioning system (GPS) collars to synchronously record the hourly locations of five baboon social groups for similar to 900 days, and we used behavioral, demographic, and life history data to measure factors affecting use of overlap areas. Annual home ranges of neighboring groups overlapped substantially, as predicted (baboons are considered non-territorial), but home ranges overlapped less when space use was assessed over shorter time scales. Moreover, neighboring groups were in close spatial proximity to one another on fewer days than predicted by a null model, suggesting an avoidance-based spacing pattern. At all time scales examined (monthly, biweekly, and weekly), time spent in overlap areas was greater during time periods when groups fed on evenly dispersed, low-quality foods. The percent of fertile females in social groups was negatively correlated with time spent in overlap areas only during weekly time intervals. This suggests that broad temporal changes in ecological resources are a major predictor of how intensively overlap areas are used, and groups modify these ecologically driven spacing patterns at short time scales based on female reproductive status. Together, these findings offer insight into the economics of territoriality by highlighting the dynamics of spacing patterns at differing time scales.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Let where be a set of points in d-dimensional space with a given metric rho. For a point let r (p) be the distance of p with respect to rho from its nearest neighbor in Let B(p,r (p) ) be the open ball with respect to rho centered at p and having the radius r (p) . We define the sphere-of-influence graph (SIG) of as the intersection graph of the family of sets Given a graph G, a set of points in d-dimensional space with the metric rho is called a d-dimensional SIG-representation of G, if G is isomorphic to the SIG of It is known that the absence of isolated vertices is a necessary and sufficient condition for a graph to have a SIG-representation under the L (a)-metric in some space of finite dimension. The SIG-dimension under the L (a)-metric of a graph G without isolated vertices is defined to be the minimum positive integer d such that G has a d-dimensional SIG-representation under the L (a)-metric. It is denoted by SIG (a)(G). We study the SIG-dimension of trees under the L (a)-metric and almost completely answer an open problem posed by Michael and Quint (Discrete Appl Math 127:447-460, 2003). Let T be a tree with at least two vertices. For each let leaf-degree(v) denote the number of neighbors of v that are leaves. We define the maximum leaf-degree as leaf-degree(x). Let leaf-degree{(v) = alpha}. If |S| = 1, we define beta(T) = alpha(T) - 1. Otherwise define beta(T) = alpha(T). We show that for a tree where beta = beta (T), provided beta is not of the form 2 (k) - 1, for some positive integer k a parts per thousand yen 1. If beta = 2 (k) - 1, then We show that both values are possible.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

The product dimension of a graph G is defined as the minimum natural number l such that G is an induced subgraph of a direct product of l complete graphs. In this paper we study the product dimension of forests, bounded treewidth graphs and k-degenerate graphs. We show that every forest on n vertices has product dimension at most 1.441 log n + 3. This improves the best known upper bound of 3 log n for the same due to Poljak and Pultr. The technique used in arriving at the above bound is extended and combined with a well-known result on the existence of orthogonal Latin squares to show that every graph on n vertices with treewidth at most t has product dimension at most (t + 2) (log n + 1). We also show that every k-degenerate graph on n vertices has product dimension at most inverted right perpendicular5.545 k log ninverted left perpendicular + 1. This improves the upper bound of 32 k log n for the same by Eaton and Rodl.