The radio spectra of reddened 2MASS QSOs: evidence for young radio jets

Multifrequency radio continuum observations (1.4-22 GHz) of a sample of reddened QSOs are presented. We find a high incidence (13/16) of radio spectral properties, such as low frequency turnovers, high frequency spectral breaks or steep power-law slopes, similar to those observed in powerful compact steep spectrum (CSS) and gigahertz-peaked spectrum (GPS) sources. The radio data are consistent with relatively young radio jets with synchotron ages <1e6-1e7yr. This calculation is limited by the lack of high resolution (milli-arcsec) radio observations. For the one source in the sample that such data are available a much younger radio age is determined, <2e3yr, similar to those of GPS/CSS sources. These findings are consistent with claims that reddened QSOs are young systems captured at the first stages of the growth of their supermassive black holes. It also suggests that expanding radio lobes may be an important feedback mode at the early stages of the evolution of AGN.Comment: 9 pages, to appear in MNRA

Safe Spacecraft Rendezvous and Proximity Operations via Reachability Analysis

The rapid expansion of the utilization of space by nations and industry has presented new challenges and opportunities to operate efficiently and responsibly. Reachability analysis is the process of computing the set of states that can be reached given all admissible controls and can be a valuable component in an autonomous mission planning system if conducted efficiently. In the current research, reachability analysis is used with several relative motion models to show that all ranges of orbits can be computed in milliseconds, and that it is a feasible approach for on-board autonomous mission planning. Reachability analysis is then combined with an Artificial Potential Function (APF) derived guidance control law to conduct safe spacecraft rendezvous between a deputy in a Natural Motion Circumnavigation (NMC) relative orbit around a chief while avoiding obstacles. While the APF employed in this research requires improvements for trajectory computation, this research demonstrates the feasibility of combining reachability analysis with an APF for safe, on-board, autonomous mission planning

Large-scale clique cover of real-world networks

The edge clique cover (ECC ) problem deals with discovering a set of (possibly overlapping) cliques in a given graph that covers each of the graph's edges. This problem finds applications ranging from social networks to compiler optimization and stringology. We consider several variants of the ECC problem, using classical quality measures (like the number of cliques) and new ones. We describe efficient heuristic algorithms, the fastest one taking O(mdG) time for a graph with m edges, degeneracy dG (also known as k-core number). For large real-world networks with millions of nodes, like social networks, an algorithm should have (almost) linear running time to be practical: Our algorithm for finding ECCs of large networks has linear-time performance in practice because dG is small, as our experiments show, on real-world networks with thousands to several million nodes

String Synchronizing Sets: Sublinear-Time BWT Construction and Optimal LCE Data Structure

Burrows-Wheeler transform (BWT) is an invertible text transformation that, given a text $T$ of length $n$, permutes its symbols according to the lexicographic order of suffixes of $T$. BWT is one of the most heavily studied algorithms in data compression with numerous applications in indexing, sequence analysis, and bioinformatics. Its construction is a bottleneck in many scenarios, and settling the complexity of this task is one of the most important unsolved problems in sequence analysis that has remained open for 25 years. Given a binary string of length $n$, occupying $O(n/\log n)$ machine words, the BWT construction algorithm due to Hon et al. (SIAM J. Comput., 2009) runs in $O(n)$ time and $O(n/\log n)$ space. Recent advancements (Belazzougui, STOC 2014, and Munro et al., SODA 2017) focus on removing the alphabet-size dependency in the time complexity, but they still require $\Omega(n)$ time. In this paper, we propose the first algorithm that breaks the $O(n)$-time barrier for BWT construction. Given a binary string of length $n$, our procedure builds the Burrows-Wheeler transform in $O(n/\sqrt{\log n})$ time and $O(n/\log n)$ space. We complement this result with a conditional lower bound proving that any further progress in the time complexity of BWT construction would yield faster algorithms for the very well studied problem of counting inversions: it would improve the state-of-the-art $O(m\sqrt{\log m})$-time solution by Chan and P\v{a}tra\c{s}cu (SODA 2010). Our algorithm is based on a novel concept of string synchronizing sets, which is of independent interest. As one of the applications, we show that this technique lets us design a data structure of the optimal size $O(n/\log n)$ that answers Longest Common Extension queries (LCE queries) in $O(1)$ time and, furthermore, can be deterministically constructed in the optimal $O(n/\log n)$ time.Comment: Full version of a paper accepted to STOC 201

On the type of triangle groups

We prove a conjecture of R. Schwartz about the type of some complex hyperbolic triangle groups.Comment: 10 pages, 3 figure

Investigation of electrodynamic stabilization and control of long orbiting tethers

The possibility of using electrodynamic forces to control pendular oscillations during the retrieval of a subsatellite is investigated. The use of the tether for transferring payloads between orbits is studied

Molecular modeling of -endotoxins from Bacillus thuringiensis.

Bacillus thuringiensis (Bt) is a Gram-positive entomotoxic bacterium widely used to control crop pests and disease vectors. Since the introduction of transgenic plants expressing Bt genes, it has been demonstrated that Bt-crops constitute an important tool in the increase of productivity and in the decrease of the use of chemical pesticides. Its success comes from the production of the ?-endotoxins (Cry). These toxins share a molecular mechanism of similar action or, at least, some common aspects

Recent advances in cytomegalovirus infection management in solid organ transplant recipients

Purpose of review Human cytomegalovirus (CMV) continues to be the most important infectious complication following solid organ transplantation (SOT). Recent findings Universal prophylaxis and preemptive therapy are the most adopted strategies for prevention of CMV disease globally. Prophylaxis with valganciclovir is the most widely used approach to CMV prevention, however leukopenia and late onset CMV disease after discontinuation of prophylaxis requires new strategies to prevent this complication. The use of assays detecting CMV-specific T cell-mediated immunity may individualize the duration of antiviral prophylaxis after transplantation. Letermovir has been recently approved for prophylaxis in kidney transplant recipients. CMV-RNAemia used together with CMV-DNAemia in the viral surveillance of CMV infection provides accurate information on viral load kinetics, mostly in patients receiving letermovir prophylaxis/therapy. The development of refractory and resistant CMV infection remains a major challenge and a new treatment with maribavir is currently available. In the present paper we will review the most recent advances in prevention and treatment of CMV diseases in SOT recipients. Summary Recent findings, summarized in the present paper, may be useful to optimize prevention and treatment of CMV infection in SOT