Detection of lithium in nearby young late-M dwarfs

Late M-type dwarfs in the solar neighborhood include a mixture of very low-mass stars and brown dwarfs which is difficult to disentangle due to the lack of constraints on their age such as trigonometric parallax, lithium detection and space velocity. We search for young brown dwarf candidates among a sample of 28 nearby late-M dwarfs with spectral types between M5.0 and M9.0, and we also search for debris disks around three of them. Based on theoretical models, we used the color $I-J$, the $J$-band absolute magnitude and the detection of the Li I 6708 $\AA$ doublet line as a strong constraint to estimate masses and ages of our targets. For the search of debris disks, we observed three targets at submillimeter wavelength of 850 $\mu$m. We report here the first clear detections of lithium absorption in four targets and a marginal detection in one target. Our mass estimates indicate that two of them are young brown dwarfs, two are young brown dwarf candidates and one is a young very low-mass star. The closest young field brown dwarf in our sample at only $\sim$15 pc is an excellent benchmark for further studying physical properties of brown dwarfs in the range 100$-$150 Myr. We did not detect any debris disks around three late-M dwarfs, and we estimated upper limits to the dust mass of debris disks around them.Comment: 10 pages, 5 figures, accepted for publication in Astronomy and Astrophysic

Secrecy outage probability of a NOMA scheme and impact imperfect channel state information in underlay cooperative cognitive networks

Security performance and the impact of imperfect channel state information (CSI) in underlay cooperative cognitive networks (UCCN) is investigated in this paper. In the proposed scheme, relay R uses non-orthogonal multiple access (NOMA) technology to transfer messages e1, e2 from the source node S to User 1 (U1) and User 2 (U2), respectively. An eavesdropper (E) is also proposed to wiretap the messages of U1 and U2. The transmission’s security performance in the proposed system was analyzed and performed over Rayleigh fading channels. Through numerical analysis, the results showed that the proposed system’s secrecy performance became more efficient when the eavesdropper node E was farther away from the source node S and the intermediate cooperative relay R. The secrecy performance of U1 was also compared to the secrecy performance of U2. Finally, the simulation results matched the Monte Carlo simulations well

The Waldschmidt constant for squarefree monomial ideals

Given a squarefree monomial ideal $I \subseteq R =k[x_1,\ldots,x_n]$, we show that $\widehat\alpha(I)$, the Waldschmidt constant of $I$, can be expressed as the optimal solution to a linear program constructed from the primary decomposition of $I$. By applying results from fractional graph theory, we can then express $\widehat\alpha(I)$ in terms of the fractional chromatic number of a hypergraph also constructed from the primary decomposition of $I$. Moreover, expressing $\widehat\alpha(I)$ as the solution to a linear program enables us to prove a Chudnovsky-like lower bound on $\widehat\alpha(I)$, thus verifying a conjecture of Cooper-Embree-H\`a-Hoefel for monomial ideals in the squarefree case. As an application, we compute the Waldschmidt constant and the resurgence for some families of squarefree monomial ideals. For example, we determine both constants for unions of general linear subspaces of $\mathbb{P}^n$ with few components compared to $n$, and we find the Waldschmidt constant for the Stanley-Reisner ideal of a uniform matroid.Comment: 26 pages. This project was started at the Mathematisches Forschungsinstitut Oberwolfach (MFO) as part of the mini-workshop "Ideals of Linear Subspaces, Their Symbolic Powers and Waring Problems" held in February 2015. Comments are welcome. Revised version corrects some typos, updates the references, and clarifies some hypotheses. To appear in the Journal of Algebraic Combinatoric

Flat Energy-Histogram Simulation of the Phase Transition in an Ising Fully Frustrated Lattice

We show in this paper the results on the phase transition of the so-called fully frustrated simple cubic lattice with the Ising spin model. We use here the Monte Carlo method with the flat energy-histogram Wang-Landau technique which is very powerful to detect weak first-order phase transition. We show that the phase transition is clearly of first order, providing a definite answer to a question raised 25 years ago.Comment: Submitted for publicatio

Discovering Valuable Items from Massive Data

Suppose there is a large collection of items, each with an associated cost and an inherent utility that is revealed only once we commit to selecting it. Given a budget on the cumulative cost of the selected items, how can we pick a subset of maximal value? This task generalizes several important problems such as multi-arm bandits, active search and the knapsack problem. We present an algorithm, GP-Select, which utilizes prior knowledge about similarity be- tween items, expressed as a kernel function. GP-Select uses Gaussian process prediction to balance exploration (estimating the unknown value of items) and exploitation (selecting items of high value). We extend GP-Select to be able to discover sets that simultaneously have high utility and are diverse. Our preference for diversity can be specified as an arbitrary monotone submodular function that quantifies the diminishing returns obtained when selecting similar items. Furthermore, we exploit the structure of the model updates to achieve an order of magnitude (up to 40X) speedup in our experiments without resorting to approximations. We provide strong guarantees on the performance of GP-Select and apply it to three real-world case studies of industrial relevance: (1) Refreshing a repository of prices in a Global Distribution System for the travel industry, (2) Identifying diverse, binding-affine peptides in a vaccine de- sign task and (3) Maximizing clicks in a web-scale recommender system by recommending items to users

Resource Competition on Integral Polymatroids

We study competitive resource allocation problems in which players distribute their demands integrally on a set of resources subject to player-specific submodular capacity constraints. Each player has to pay for each unit of demand a cost that is a nondecreasing and convex function of the total allocation of that resource. This general model of resource allocation generalizes both singleton congestion games with integer-splittable demands and matroid congestion games with player-specific costs. As our main result, we show that in such general resource allocation problems a pure Nash equilibrium is guaranteed to exist by giving a pseudo-polynomial algorithm computing a pure Nash equilibrium.Comment: 17 page

Solar models and solar neutrino oscillations

We provide a summary of the current knowledge, theoretical and experimental, of solar neutrino fluxes and of the masses and mixing angles that characterize solar neutrino oscillations. We also summarize the principal reasons for doing new solar neutrino experiments and what we think may be learned from the future measurements.Comment: Submitted to the Neutrino Focus Issue of New Journal of Physics at http://www.njp.or