Searches for B(s)0 →J/ψpp‾ B_{(s)}^0\ \to {J \left/ {{\psi p}} \right.}\overline{p} and B + → J/ψ p p‾ \overline{p} π + decays

The results of searches for B0(s)→J/ψ pp¯ and B + → J/ψ p p¯ π+ decays are reported. The analysis is based on a data sample, corresponding to an integrated luminosity of 1.0 fb−1 of pp collisions, collected with the LHCb detector. An excess with 2.8 σ significance is seen for the decay B0s→J/ψ pp¯ and an upper limit on the branching fraction is set at the 90 % confidence level: B(B0s→J/ψ pp¯) < 4.8 × 10−6, which is the first such limit. No significant signals are seen for B 0 → J/ψ p p¯ and B + → J/ψ p p¯ π + decays, for which the corresponding limits are set: B(B0→J/ψ pp¯) < 5.2 × 10−7, which significantly improves the existing limit; and B(B+→J/ψ pp¯π+) < 5.0 × 10−7, which is the first limit on this branching fraction

Báo cáo xem xét năng lực thừa hành pháp luật và xác định nhu cầu đào tạo cho công tác quản lý các khu rừng đặc dụng = Legislation enforcement capacity and training needs in special use forests

iv, 58; iv, 56 tr. ; 30 c

Nhu cầu điều tra, giám sát và đào tạo về bảo tồn đa dạng sinh học ở các khu rừng đặc dụng = Biodiversity conservation survey, monitoring and training needs for special use forests

iv, 57; iv, 59 tr. ; 30 c

Tổng quan và khuyến nghị về kế hoạch - thể chế - tài chính ở các khu rừng đặc dụng tại Việt Nam = institutional and financial arrangements for protected area management in Vietnam overview and recommendations

vi, 128; vi, 125 tr. ; 30 c

Hoàn thiện thể chế và tăng cường năng lực bảo tồn đa dạng sinh học tại các khu bảo vệ = Institutional strengthening and capacity building for biodiversity conservation in protected areas

iv, 48; iv, 48 tr. ; 30 c

CHAPTER 8 Impact of SPAM Game on Coding and Multi-User Interference

R E{#(n)#(n) + (8.1) and this last is one of the outcomes (known at the receiver side because also the receiver can perform the allocation) of the SPAM game. The other outcome of the SPAM game, that is, the throughput, gives to the transmitter the constellation cardinality for the number of symbols to be employed. So, the codes to be employed are a "set of codes" depending on the cardinality, linked to the capacity. For example, if a users achieve 1 bit/slot obviously the cardinality of possible symbols is 2, so only two symbols (BPSK-like) can be employed. On the other hand, if a user achieve a rate of 16 bit/slot, it can employ a constellation with 2 16 points (32K) with approximatively the same performance of the previous case. The system model is the above mentioned where learning, training, payload phase coexist. While about learning and training a lot of space is spent, here the focus is on the payload that can be summarized as #H -# # + -# d , (8.2) 276 wher