On continuous timed automata with input-determined guards

We consider a general class of timed automata parameterized by a set of “input-determined” operators, in a continuous time setting. We show that for any such set of operators, we have a monadic second order logic characterization of the class of timed languages accepted by the corresponding class of automata. Further, we consider natural timed temporal logics based on these operators, and show that they are expressively equivalent to the first-order fragment of the corresponding MSO logics. As a corollary of these general results we obtain an expressive completeness result for the continuous version of MTL.

3D Image Reconstruction From Truncated Helical Cone Beam Projection Data - A Linear Prediction Approach

With the introduction of 2D flat-panel X-ray detectors, 3D image reconstruction using helical cone-beam tomography is fast replacing the conventional 2D reconstruction techniques. In 3D image reconstruction, the source orbit or scanning geometry should satisfy the data sufficiency or completeness condition for exact reconstruction. The helical scan geometry satisfies this condition and hence can give exact reconstruction. The theoretically exact helical cone-beam reconstruction algorithm proposed by Katsevich is a breakthrough and has attracted interest in the 3D reconstruction using helical cone-beam Computed Tomography.In many practical situations, the available projection data is incomplete. One such case is where the detector plane does not completely cover the full extent of the object being imaged in lateral direction resulting in truncated projections. This result in artifacts that mask small features near to the periphery of the ROI when reconstructed using the convolution back projection (CBP) method assuming that the projection data is complete. A number of techniques exist which deal with completion of missing data followed by the CBP reconstruction. In 2D, linear prediction (LP)extrapolation has been shown to be efficient for data completion, involving minimal assumptions on the nature of the data, producing smooth extensions of the missing projection data.In this paper, we propose to extend the LP approach for extrapolating helical cone beam truncated data. The projection on the multi row flat panel detectors has missing columns towards either ends in the lateral direction in truncated data situation. The available data from each detector row is modeled using a linear predictor. The available data is extrapolated and this completed projection data is backprojected using the Katsevich algorithm. Simulation results show the efficacy of the proposed method.

Polynomial Approximation, Local Polynomial convexity, and Degenerate CR Singularities- II

We provide some conditions for the graph of a Holder-continuous function on (D) over bar, where (D) over bar is a closed disk in C, to be polynomially convex. Almost all sufficient conditions known to date - provided the function (say F) is smooth - arise from versions of the Weierstrass Approximation Theorem on (D) over bar. These conditions often fail to yield any conclusion if rank(R)DF is not maximal on a sufficiently large subset of (D) over bar. We bypass this difficulty by introducing a technique that relies on the interplay of certain plurisubharmonic functions. This technique also allows us to make some observations on the polynomial hull of a graph in C(2) at an isolated complex tangency.

Computational Biology and Language

Current scientific research is characterized by increasing specialization, accumulating knowledge at a high speed due to parallel advances in a multitude of sub-disciplines. Recent estimates suggest that human knowledge doubles every two to three years – and with the advances in information and communication technologies, this wide body of scientific knowledge is available to anyone, anywhere, anytime. This may also be referred to as ambient intelligence – an environment characterized by plentiful and available knowledge. The bottleneck in utilizing this knowledge for specific applications is not accessing but assimilating the information and transforming it to suit the needs for a specific application. The increasingly specialized areas of scientific research often have the common goal of converting data into insight allowing the identification of solutions to scientific problems. Due to this common goal, there are strong parallels between different areas of applications that can be exploited and used to cross-fertilize different disciplines. For example, the same fundamental statistical methods are used extensively in speech and language processing, in materials science applications, in visual processing and in biomedicine. Each sub-discipline has found its own specialized methodologies making these statistical methods successful to the given application. The unification of specialized areas is possible because many different problems can share strong analogies, making the theories developed for one problem applicable to other areas of research. It is the goal of this paper to demonstrate the utility of merging two disparate areas of applications to advance scientific research. The merging process requires cross-disciplinary collaboration to allow maximal exploitation of advances in one sub-discipline for that of another. We will demonstrate this general concept with the specific example of merging language technologies and computational biology.

Boxicity and Poset Dimension

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.

Low-Delay, High-Rate Nonsquare Complex Orthogonal Designs

The maximal rate of a nonsquare complex orthogonal design for transmit antennas is 1/2 + 1/n if is even and 1/2 + 1/n+1 if is odd and the codes have been constructed for all by Liang (2003) and Lu et al. (2005) to achieve this rate. A lower bound on the decoding delay of maximal-rate complex orthogonal designs has been obtained by Adams et al. (2007) and it is observed that Liang's construction achieves the bound on delay for equal to 1 and 3 modulo 4 while Lu et al.'s construction achieves the bound for n = 0, 1, 3 mod 4. For n = 2 mod 4, Adams et al. (2010) have shown that the minimal decoding delay is twice the lower bound, in which case, both Liang's and Lu et al.'s construction achieve the minimum decoding delay. For large value of, it is observed that the rate is close to half and the decoding delay is very large. A class of rate-1/2 codes with low decoding delay for all has been constructed by Tarokh et al. (1999). In this paper, another class of rate-1/2 codes is constructed for all in which case the decoding delay is half the decoding delay of the rate-1/2 codes given by Tarokh et al. This is achieved by giving first a general construction of square real orthogonal designs which includes as special cases the well-known constructions of Adams, Lax, and Phillips and the construction of Geramita and Pullman, and then making use of it to obtain the desired rate-1/2 codes. For the case of nine transmit antennas, the proposed rate-1/2 code is shown to be of minimal delay. The proposed construction results in designs with zero entries which may have high peak-to-average power ratio and it is shown that by appropriate postmultiplication, a design with no zero entry can be obtained with no change in the code parameters.

Biochemical characterization of a recombinant Swainsona canescens calcium-dependent protein kinase (ScCPK1)

Calcium-dependent protein kinases (CPKs) constitute a unique family of kinases involved in many physiological responses in plants. Biochemical and kinetic properties of a recombinant Swainsona canescens calcium-dependent protein kinase (ScCPK1) were examined in this study. The optimum pH and temperature for activity were pH 7.5 and 37 degrees C, respectively. Substrate phosphorylation activity of ScCPK1 was calmodulin (CaM) independent. Yet CaM antagonists, W7 N-(6-aminohexyl)-5-chloro-1-naphthalene sulphonamide] and calmidazolium inhibited the activity with IC50 values of 750 nM and 350 pM, respectively. Both serine and threonine residues were found to be phosphorylated in auto-phosphorylated ScCPK1 and in histone III-S phosphorylated by ScCPK1. The Ca2+] for half maximal activity (K-0.5) was found to be 0.4 mu M for ScCPK1 with histone III-S as substrate. Kinetic analysis showed that Km of ScCPK1 for histone III-S was 4.8 mu M. These data suggest that ScCPK1 is a functional Ser/Thr kinase, regulated by calcium, and may have a role in Ca2+-mediated signaling in S. canescens. (C) 2012 Elsevier Masson SAS. All rights reserved.

Promiscuous restriction is a cellular defense strategy that confers fitness advantage to bacteria

Most bacterial genomes harbor restriction-modification systems, encoding a REase and its cognate MTase. On attack by a foreign DNA, the REase recognizes it as nonself and subjects it to restriction. Should REases be highly specific for targeting the invading foreign DNA? It is often considered to be the case. However, when bacteria harboring a promiscuous or high-fidelity variant of the REase were challenged with bacteriophages, fitness was maximal under conditions of catalytic promiscuity. We also delineate possible mechanisms by which the REase recognizes the chromosome as self at the noncanonical sites, thereby preventing lethal dsDNA breaks. This study provides a fundamental understanding of how bacteria exploit an existing defense system to gain fitness advantage during a host-parasite coevolutionary ``arms race.''

A Rhodanine Derivative CCR-11 Inhibits Bacterial Proliferation by Inhibiting the Assembly and GTPase Activity of FtsZ

A perturbation of FtsZ assembly dynamics has been shown to inhibit bacterial cytokinesis. In this study, the antibacterial activity of 151 rhodanine compounds was assayed using Bacillus subtilis cells. Of 151 compounds, eight strongly inhibited bacterial proliferation at 2 mu M. Subsequently, we used the elongation of B. subtilis cells as a secondary screen to identify potential FtsZ-targeted antibacterial agents. We found that three compounds significantly increased bacterial cell length. One of the three compounds, namely, CCR-11 (E)-2-thioxo-5-({3-(trifluoromethyl)phenyl]furan-2-yl}methylene) thiazolidin-4-one], inhibited the assembly and GTPase activity of FtsZ in vitro. CCR-11 bound to FtsZ with a dissociation constant of 1.5 +/- 0.3 mu M. A docking analysis indicated that CCR-11 may bind to FtsZ in a cavity adjacent to the T7 loop and that short halogen oxygen, H-bonding, and hydrophobic interactions might be important for the binding of CCR-11 with FtsZ. CCR-11 inhibited the proliferation of B. subtilis cells with a half-maximal inhibitory concentration (IC50) of 1.2 +/- 0.2 mu M and a minimal inhibitory concentration of 3 mu M. It also potently inhibited proliferation of Mycobacterium smegmatis cells. Further, CCR-11 perturbed Z-ring formation in B. subtilis cells; however, it neither visibly affected nucleoid segregation nor altered the membrane integrity of the cells. CCR-11 inhibited HeLa cell proliferation with an IC50 value of 18.1 +/- 0.2,mu M (similar to 15 x IC50 of B. subtilis cell proliferation). The results suggested that CCR-11 inhibits bacterial cytokinesis by inhibiting FtsZ assembly, and it can be used as a lead molecule to develop FtsZ-targeted antibacterial agents.

Zero-Sum Risk-Sensitive Stochastic Differential Games

We study zero-sum risk-sensitive stochastic differential games on the infinite horizon with discounted and ergodic payoff criteria. Under certain assumptions, we establish the existence of values and saddle-point equilibria. We obtain our results by studying the corresponding Hamilton-Jacobi-Isaacs equations. Finally, we show that the value of the ergodic payoff criterion is a constant multiple of the maximal eigenvalue of the generators of the associated nonlinear semigroups.

An Antitubulin Agent BCFMT Inhibits Proliferation of Cancer Cells and Induces Cell Death by Inhibiting Microtubule Dynamics

Using cell based screening assay, we identified a novel anti-tubulin agent (Z)-5-((5-(4-bromo-3-chlorophenyl)furan-2-yl)methylene)-2-thioxothiazoli din-4-one (BCFMT) that inhibited proliferation of human cervical carcinoma (HeLa) (IC50, 7.2 +/- 1.8 mu M), human breast adenocarcinoma (MCF-7) (IC50, 10.0 +/- 0.5 mu M), highly metastatic breast adenocarcinoma (MDA-MB-231) (IC50, 6.0 +/- 1 mu M), cisplatin-resistant human ovarian carcinoma (A2780-cis) (IC50, 5.8 +/- 0.3 mu M) and multi-drug resistant mouse mammary tumor (EMT6/AR1) (IC50, 6.5 +/- 1 mu M) cells. Using several complimentary strategies, BCFMT was found to inhibit cancer cell proliferation at G2/M phase of the cell cycle apparently by targeting microtubules. In addition, BCFMT strongly suppressed the dynamics of individual microtubules in live MCF-7 cells. At its half maximal proliferation inhibitory concentration (10 mu M), BCFMT reduced the rates of growing and shortening phases of microtubules in MCF-7 cells by 37 and 40%, respectively. Further, it increased the time microtubules spent in the pause (neither growing nor shortening detectably) state by 135% and reduced the dynamicity (dimer exchange per unit time) of microtubules by 70%. In vitro, BCFMT bound to tubulin with a dissociation constant of 8.3 +/- 1.8 mu M, inhibited tubulin assembly and suppressed GTPase activity of microtubules. BCFMT competitively inhibited the binding of BODIPY FL-vinblastine to tubulin with an inhibitory concentration (K-i) of 5.2 +/- 1.5 mu M suggesting that it binds to tubulin at the vinblastine site. In cultured cells, BCFMT-treatment depolymerized interphase microtubules, perturbed the spindle organization and accumulated checkpoint proteins (BubR1 and Mad2) at the kinetochores. BCFMT-treated MCF-7 cells showed enhanced nuclear accumulation of p53 and its downstream p21, which consequently activated apoptosis in these cells. The results suggested that BCFMT inhibits proliferation of several types of cancer cells including drug resistance cells by suppressing microtubule dynamics and indicated that the compound may have chemotherapeutic potential.

The defect sequence for contractive tuples

We introduce the defect sequence for a contractive tuple of Hilbert space operators and investigate its properties. The defect sequence is a sequence of numbers, called defect dimensions associated with a contractive tuple. We show that there are upper bounds for the defect dimensions. The tuples for which these upper bounds are obtained, are called maximal contractive tuples. The upper bounds are different in the non-commutative and in the commutative case. We show that the creation operators on the full Fock space and the coordinate multipliers on the Drury-Arveson space are maximal. We also study pure tuples and see how the defect dimensions play a role in their irreducibility. (C) 2012 Elsevier Inc. All rights reserved.

Performance of a class of multi-robot deploy and search strategies based on centroidal voronoi configurations

This article considers a class of deploy and search strategies for multi-robot systems and evaluates their performance. The application framework used is deployment of a system of autonomous mobile robots equipped with required sensors in a search space to gather information. The lack of information about the search space is modelled as an uncertainty density distribution. The agents are deployed to maximise single-step search effectiveness. The centroidal Voronoi configuration, which achieves a locally optimal deployment, forms the basis for sequential deploy and search (SDS) and combined deploy and search (CDS) strategies. Completeness results are provided for both search strategies. The deployment strategy is analysed in the presence of constraints on robot speed and limit on sensor range for the convergence of trajectories with corresponding control laws responsible for the motion of robots. SDS and CDS strategies are compared with standard greedy and random search strategies on the basis of time taken to achieve reduction in the uncertainty density below a desired level. The simulation experiments reveal several important issues related to the dependence of the relative performances of the search strategies on parameters such as the number of robots, speed of robots and their sensor range limits.

Low-pass filters and differential tympanal tuning in a paleotropical bushcricket with an unusually low frequency call

Low-frequency sounds are advantageous for long-range acoustic signal transmission, but for small animals they constitute a challenge for signal detection and localization. The efficient detection of sound in insects is enhanced by mechanical resonance either in the tracheal or tympanal system before subsequent neuronal amplification. Making small structures resonant at low sound frequencies poses challenges for insects and has not been adequately studied. Similarly, detecting the direction of long-wavelength sound using interaural signal amplitude and/or phase differences is difficult for small animals. Pseudophylline bushcrickets predominantly call at high, often ultrasonic frequencies, but a few paleotropical species use lower frequencies. We investigated the mechanical frequency tuning of the tympana of one such species, Onomarchus uninotatus, a large bushcricket that produces a narrow bandwidth call at an unusually low carrier frequency of 3.2. kHz. Onomarchus uninotatus, like most bushcrickets, has two large tympanal membranes on each fore-tibia. We found that both these membranes vibrate like hinged flaps anchored at the dorsal wall and do not show higher modes of vibration in the frequency range investigated (1.5-20. kHz). The anterior tympanal membrane acts as a low-pass filter, attenuating sounds at frequencies above 3.5. kHz, in contrast to the high-pass filter characteristic of other bushcricket tympana. Responses to higher frequencies are partitioned to the posterior tympanal membrane, which shows maximal sensitivity at several broad frequency ranges, peaking at 3.1, 7.4 and 14.4. kHz. This partitioning between the two tympanal membranes constitutes an unusual feature of peripheral auditory processing in insects. The complex tracheal shape of O. uninotatus also deviates from the known tube or horn shapes associated with simple band-pass or high-pass amplification of tracheal input to the tympana. Interestingly, while the anterior tympanal membrane shows directional sensitivity at conspecific call frequencies, the posterior tympanal membrane is not directional at conspecific frequencies and instead shows directionality at higher frequencies.

Mycobacterium tuberculosis mutT1 (Rv2985) and ADPRase (Rv1700) proteins constitute a two-stage mechanism of 8-Oxo-dGTP and 8-Oxo-GTP detoxification and adenosine to cytidine mutation avoidance

Approximately one third of the world population is infected with Mycobacterium tuberculosis, the causative agent of tuberculosis. A better understanding of the pathogen biology is crucial to develop new tools/strategies to tackle its spread and treatment. In the host macrophages, the pathogen is exposed to reactive oxygen species, known to damage dGTP and GTP to 8-oxo-dGTP and 8-oxo-GTP, respectively. Incorporation of the damaged nucleotides in nucleic acids is detrimental to organisms. MutT proteins, belonging to a class of Nudix hydrolases, hydrolyze 8-oxo-G nucleoside triphosphates/diphosphates to the corresponding nucleoside monophosphates and sanitize the nucleotide pool. Mycobacteria possess several MutT proteins. However, a functional homolog of Escherichia coli MutT has not been identified. Here, we characterized MtuMutT1 and Rv1700 proteins of M. tuberculosis. Unlike other MutT proteins, MtuMutT1 converts 8-oxo-dGTP to 8-oxo-dGDP, and 8-oxo-GTP to 8-oxo-GDP. Rv1700 then converts them to the corresponding nucleoside monophosphates. This observation suggests the presence of a two-stage mechanism of 8-oxo-dGTP/8-oxo-GTP detoxification in mycobacteria. MtuMutT1 converts 8-oxo-dGTP to 8-oxo-dGDP with a K-m of similar to 50 mu M and V-max of similar to 0.9 pmol/min per ng of protein, and Rv1700 converts 8-oxo-dGDP to 8-oxo-dGMP with a K-m of similar to 9.5 mu M and V-max of similar to 0.04 pmol/min per ng of protein. Together, MtuMutT1 and Rv1700 offer maximal rescue to E. coli for its MutT deficiency by decreasing A to C mutations (a hallmark of MutT deficiency). We suggest that the concerted action of MtuMutT1 and Rv1700 plays a crucial role in survival of bacteria against oxidative stress.