Báo cáo toán học: "An optimal strongly identifying code in the infinite triangular grid" docx

... of identifying codes. Identifying codes and locating-dominating codes have been extensively studied: see the Internet bibliography [11] maintained by Antoine Lobstein. For results on the triangular grid, ... ✉ Figure 1: A strongly identifying code with density 6/19. The purpose of this note is to prove that this code is optimal, i.e., the density of every strongly id...

Ngày tải lên: 08/08/2014, 12:22

... that the general step of the OMP process is in essence the same as the initial step in the sense that the residual is considered as a new measurement preserving the sparsity level of an input ... constant. By applying the result in Theorem 1.1 , we can obtain the minimum dimension of m ensuring exact reconstruction of K-sparse signal using the OMP algorithm. Sp ecific...

Ngày tải lên: 20/06/2014, 20:20

... rate hits the fairness point 1/i, beyond which it increases linearly, and the probability of a packet finding available space in the shared buffer increases linearly up until the fairness point 1/i, ... some continuity conditions, in the limit  → 0, the sum becomes integral; the probability limit ν exists; the quantization cell T ∈ P  becomes the in nitesimal integratio...

Ngày tải lên: 23/06/2014, 00:20

Ngày tải lên: 05/08/2014, 15:20

... give the best results. This is not surprlsing, since there is Do significant difference in the degrees of certainty corresponding to z scores of 4 and beyond. The last improvement in the performance ... 2.48 a zero The same procedure applied to the rest of the wordllst gives the proper matches, Tltla flnals in polysyllabic words having been deleted when deriving t...

Ngày tải lên: 21/02/2014, 20:20

... described in their own right. To the best of the author's knowledge, the various parsing algorithms mentioned above have not been dis- cussed together in the existing literature. The main purpose ... of nondeterministic LR parsing. At this point we use the term state to indicate the symbols occurring on the stack of the original algo- rithm, which also occu...

Ngày tải lên: 17/03/2014, 09:20

... merging operation in β. Since the binarization β is itself valid, this X must be either one of the position sets in X , or the result of a previous merge in the binarization β. So we divide the ... analysis of the algorithm in Figure 1. We define the length of an LCFRS production p, written |p|, as the sum of the length of all strings α j in α in the definition...

Ngày tải lên: 23/03/2014, 16:21

... followed in the problems stated in Section 3 by overviewing the learning-based mechanisms for acquiring learning capabilities both in network and user’s equipment. Finally, the article concludes in ... service, the time and the location of the user. Competing interests The authors declare that they have no competing interests. Acknowledgements This study was p...

Ngày tải lên: 20/06/2014, 20:20

... on the impinging angles of sources. In this article, we propose an efficient implementation of IAA (EIAA) by modifying the use of the optimal filtering, i.e., in each iteration of EIAA, the optimal ... modifying the use of the optimal filtering, i.e., in each iteration, the optimal filter is only utilized to estimate the spatial components likely corresponding to...

Ngày tải lên: 20/06/2014, 20:20

... endorsed in the present study (Figure 4). In summary, the polar fraction 3 exhibited, in comparison with the other remaining wastewater fractions, the highest inhibiti on values in the influent of the ... quality assurance. The negativ e controls documented the altera- tions in the bioluminescence intensity of the tested bac- teria in the absence of any toxic...

Ngày tải lên: 20/06/2014, 20:20