Zobrazeno 1 - 10
of 62
pro vyhledávání: '"Farong Zhong"'
Publikováno v:
IEEE Access, Vol 6, Pp 26707-26717 (2018)
A method is proposed, called l-formula, to design efficient successive cancellation (SC) decoding of polar codes with medium-dimensional binary kernels (dimensions up to 16). Our l-formula method obtains the simplified recursive formulas of the SC de
Externí odkaz:
https://doaj.org/article/abbc938f5ddb4243853cacaeabf246ca
Autor:
Farong Zhong, Jiahui Wang
Publikováno v:
Computer Science & Information Technology (CS & IT).
Zero-visibility cops and robber game is a variant of the classical model. The robber is invisible in the zero-visibility game. In this paper, we study the zero-visibility cops and robber game on the cube grid. We first study a partition problem of th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::781f7973f1c6a828f0b6f5f1d0f921ec
https://doi.org/10.5121/csit.2020.102003
https://doi.org/10.5121/csit.2020.102003
Publikováno v:
Algorithmica. 80:3959-3981
Research on graph searching has recently gained interest in computer science, mathematics, and physics. This paper studies fast searching of a fugitive in a graph, a model that was introduced by Dyer et al. (in: Fleischer, Xu (eds.) Algorithmic aspec
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::83b649d3f2ac68a28ff6867d74f17d8e
https://doi.org/10.1007/s00453-018-0456-z
https://doi.org/10.1007/s00453-018-0456-z
Publikováno v:
IEEE Access, Vol 6, Pp 26707-26717 (2018)
A method is proposed, called $l$ -formula, to design efficient successive cancellation (SC) decoding of polar codes with medium-dimensional binary kernels (dimensions up to 16). Our $l$ -formula method obtains the simplified recursive formulas of the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c15f1715d83e6c76be8d9bc720a6294f
https://ieeexplore.ieee.org/document/8355997/
https://ieeexplore.ieee.org/document/8355997/
Publikováno v:
Bioinformatics Research and Applications ISBN: 9783319387819
ISBRA
ISBRA
In mass spectrometry-based de novo protein sequencing, it is hard to complete the sequence of the whole protein. Motivated by this, we study the (one-sided) problem of filling a protein scaffold ${\mathcal{ S}}$ with some missing amino acids, given a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ac52e173da10549a3c00ecbc102b501c
https://doi.org/10.1109/tnb.2017.2666780
https://doi.org/10.1109/tnb.2017.2666780
Reliability Evaluation of Network Systems with Dependent Propagated Failures Using Decision Diagrams
Publikováno v:
IEEE Transactions on Dependable and Secure Computing. 13:672-683
In a network system, a propagated failure (PF) is a failure originating from a network component that can cause extensive damages to other network components or even the failure of the entire system. Existing works on PFs have mostly assumed the dete
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1f02f7e56e8588f315a6e270e85d977d
https://doi.org/10.1109/tdsc.2015.2433254
https://doi.org/10.1109/tdsc.2015.2433254
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030250041
IWOCA
IWOCA
The zero-visibility cops and robber game is a variant of Cops and Robbers subject to the constraint that the cops have no information at any time about the location of the robber. We first study a partition problem in which for a given graph and an i
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::42237133da985b61d1b2cd13160b088b
https://doi.org/10.1007/978-3-030-25005-8_36
https://doi.org/10.1007/978-3-030-25005-8_36
Publikováno v:
Reliability Engineering & System Safety. 131:83-93
In the Binary Decision Diagram (BDD)-based network reliability analysis, heuristics have been widely used to obtain a reasonably good ordering of edge variables. Orderings generated using different heuristics can lead to dramatically different sizes
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e723f899eba4fa8d793398278deac9a9
https://doi.org/10.1016/j.ress.2014.06.025
https://doi.org/10.1016/j.ress.2014.06.025
Publikováno v:
Journal of Computer Science and Technology. 29:879-886
The maximum diameter color-spanning set problem (MaxDCS) is defined as follows: given n points with m colors, select m points with m distinct colors such that the diameter of the set of chosen points is maximized. In this paper, we design an optimal
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1e8e23d8b6b40ce6504dc8a08232ff87
https://doi.org/10.1007/s11390-014-1475-0
https://doi.org/10.1007/s11390-014-1475-0
Publikováno v:
Journal of Combinatorial Optimization. 29:589-604
Given a set of $$n$$ n points, each is painted by one of the $$k$$ k given colors, we want to choose $$k$$ k points with distinct colors to form a color spanning set. For each color spanning set, we can construct the convex hull and the smallest axis
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4dc27b98d93b689fc41b704e9dcd07ca
https://doi.org/10.1007/s10878-014-9764-7
https://doi.org/10.1007/s10878-014-9764-7