Black hole solutions in f(R) gravity coupled with non-linear Yang-Mills field

It is shown that in the static, spherically symmetric spacetime the problem of metric f(R) gravity coupled with non-linear Yang-Mills (YM) field constructed from the Wu-Yang ansatz as source, can be solved in all dimensions. By non-linearity it is meant that the YM Lagrangian depends arbitrarily on its invariant. A particular form is considered to be in the power-law form with limit of the standard YM theory. The formalism admits black hole solutions with single or double horizons in which f(R) can be obtained, in general numerically. In 6-dimensional case we obtain an exact solution given by f(R)=\surdR gravity that couples with the YM field in a consistent manner.Comment: 12 pages, 8 figures, revised version with major changes including expanded references. Dedicated to the memory of Yavuz Nutku (1943-2010

Resource targets for advanced underground coal extraction systems

Resource targets appropriate for federal sponsorship of research and development of advanced underground coal mining systems are identified. A comprehensive examination of conventional and unconventional coals with particular attention to exceptionally thin and thick seams, steeply dipping beds, and multiple seam geometry was made. The results indicate that the resource of primary importance is flat lying bituminous coal of moderate thickness, under moderate cover, and located within the lower 48 states. Resources of secondary importance are the flat lying multiple seams and thin seams (especially those in Appalachia). Steeply dipping coals, abandoned pillars, and exceptionally thick western coals may be important in some regions of subregions, but the limited tonnage available places them in a position of tertiary importance

Colourings of cubic graphs inducing isomorphic monochromatic subgraphs

A $k$-bisection of a bridgeless cubic graph $G$ is a $2$-colouring of its vertex set such that the colour classes have the same cardinality and all connected components in the two subgraphs induced by the colour classes (monochromatic components in what follows) have order at most $k$. Ban and Linial conjectured that every bridgeless cubic graph admits a $2$-bisection except for the Petersen graph. A similar problem for the edge set of cubic graphs has been studied: Wormald conjectured that every cubic graph $G$ with $|E(G)| \equiv 0 \pmod 2$ has a $2$-edge colouring such that the two monochromatic subgraphs are isomorphic linear forests (i.e. a forest whose components are paths). Finally, Ando conjectured that every cubic graph admits a bisection such that the two induced monochromatic subgraphs are isomorphic. In this paper, we give a detailed insight into the conjectures of Ban-Linial and Wormald and provide evidence of a strong relation of both of them with Ando's conjecture. Furthermore, we also give computational and theoretical evidence in their support. As a result, we pose some open problems stronger than the above mentioned conjectures. Moreover, we prove Ban-Linial's conjecture for cubic cycle permutation graphs. As a by-product of studying $2$-edge colourings of cubic graphs having linear forests as monochromatic components, we also give a negative answer to a problem posed by Jackson and Wormald about certain decompositions of cubic graphs into linear forests.Comment: 33 pages; submitted for publicatio

Solutions for f(R) gravity coupled with electromagnetic field

In the presence of external, linear / nonlinear electromagnetic fields we integrate f(R) \sim R+2{\alpha}\surd(R+const.) gravity equations. In contrast to their Einsteinian cousins the obtained black holes are non-asymptotically flat with a deficit angle. In proper limits we obtain from our general solution the global monopole solution in f(R) gravity. The scale symmetry breaking term adopted as the nonlinear electromagnetic source adjusts the sign of the mass of the resulting black hole to be physical.Comment: 7 pages no figure, final version for publication in European Physical Journal

Rapid, multiplexed microfluidic phage display

The development of a method for high-throughput, automated proteomic screening could impact areas ranging from fundamental molecular interactions to the discovery of novel disease markers and therapeutic targets. Surface display techniques allow for efficient handling of large molecular libraries in small volumes. In particular, phage display has emerged as a powerful technology for selecting peptides and proteins with enhanced, target-specific binding affinities. Yet, the process becomes cumbersome and time-consuming when multiple targets are involved.Here we demonstrate for the first time a microfluidic chip capable of identifying high affinity phage displayed peptides for multiple targets in just a single round and without the need for bacterial infection. The chip is shown to be able to yield well-established control consensus sequences while simultaneously identifying new sequences for clinically important targets. Indeed, the confined parameters of the device allow not only for highly controlled assay conditions but also introduce a significant time-reduction to the phage display process. We anticipate that this easily-fabricated, disposable device has the potential to impact areas ranging from fundamental studies of protein, peptide, and molecular interactions, to applications such as fully automated proteomic screening

Space Efficient Breadth-First and Level Traversals of Consistent Global States of Parallel Programs

Enumerating consistent global states of a computation is a fundamental problem in parallel computing with applications to debug- ging, testing and runtime verification of parallel programs. Breadth-first search (BFS) enumeration is especially useful for these applications as it finds an erroneous consistent global state with the least number of events possible. The total number of executed events in a global state is called its rank. BFS also allows enumeration of all global states of a given rank or within a range of ranks. If a computation on n processes has m events per process on average, then the traditional BFS (Cooper-Marzullo and its variants) requires $\mathcal{O}(\frac{m^{n-1}}{n})$ space in the worst case, whereas ou r algorithm performs the BFS requires $\mathcal{O}(m^2n^2)$ space. Thus, we reduce the space complexity for BFS enumeration of consistent global states exponentially. and give the first polynomial space algorithm for this task. In our experimental evaluation of seven benchmarks, traditional BFS fails in many cases by exhausting the 2 GB heap space allowed to the JVM. In contrast, our implementation uses less than 60 MB memory and is also faster in many cases