Zobrazeno 1 - 10
of 93 694
pro vyhledávání: '"Computation theory"'
Autor:
Xianyang Zeng, Hongli Yang
Publikováno v:
IEEE Access, Vol 10, Pp 126188-126198 (2022)
In this paper, we focus on the numerical solutions of Maxwell’s equations with Dirichlet boundary conditions in rectangular coordinate. A class of explicit methods is derived by using an effective solver for a system of ordinary differential equati
Externí odkaz:
https://doaj.org/article/300f81776db14295a5c4897215359f74
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
Journal of chemical information and modeling, vol 63, iss 4
We introduce RMechDB, an open-access platform for aggregating, curating, and distributing reliable data about elementary radical reaction steps for computational radical reaction modeling and prediction. RMechDB contains over 5,300 elementary radical
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d568ad3c8a585f3b7305f84657e00583
https://doi.org/10.1021/acs.jcim.2c01359
https://doi.org/10.1021/acs.jcim.2c01359
Autor:
Benjamin I. Tingle, Khanh G. Tang, Mar Castanon, John J. Gutierrez, Munkhzul Khurelbaatar, Chinzorig Dandarchuluun, Yurii S. Moroz, John J. Irwin
Publikováno v:
Journal of chemical information and modeling, vol 63, iss 4
Purchasable chemical space has grown rapidly into the tens of billions of molecules, providing unprecedented opportunities for ligand discovery but straining the tools that might exploit these molecules at scale. We have therefore developed ZINC-22,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3f32583cef016d6b94cf5163ef8ba5a2
https://doi.org/10.1021/acs.jcim.2c01253
https://doi.org/10.1021/acs.jcim.2c01253
Publikováno v:
Advances in Mathematics of Communications. 17:697-713
For more than two decades, proving or refuting the following statement has remained a challenging open problem in the theory of secret sharing schemes (SSSs): every ideal access structure admits an ideal perfect multi-linear SSS. The class of group-c
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5ff263e8831b3a69221ce81859d860d7
https://doi.org/10.3934/amc.2021017
https://doi.org/10.3934/amc.2021017
Autor:
Kai Cai, Guangyue Han
Publikováno v:
Advances in Mathematics of Communications. 17:431-445
The Langberg-Medard multiple unicast conjecture claims that for any strongly reachable \begin{document}$ k $\end{document} -pair network, there exists a multi-flow with rate \begin{document}$ (1,1,\dots,1) $\end{document} . In this paper, we examine
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::bfb8b1f4c833f35460ade74f6b70697e
https://doi.org/10.3934/amc.2021001
https://doi.org/10.3934/amc.2021001
Publikováno v:
Advances in Mathematics of Communications. 17:660-680
Graph states are present in quantum information and found applications ranging from quantum network protocols (like secret sharing) to measurement based quantum computing. In this paper, we extend the notion of graph states, which can be regarded as
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e908ca1e0108207ebf98e1abc2f7c2c5
https://doi.org/10.3934/amc.2021015
https://doi.org/10.3934/amc.2021015
Publikováno v:
Advances in Mathematics of Communications. 17:733-756
In this paper, a new class of generalized cyclotomic binary sequences with period \begin{document}$ 4p^n $\end{document} is proposed. These sequences are almost balanced, and the explicit formulas of their linear complexity and autocorrelation are pr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::dc06bfd1de92689f8d478590f2644a34
https://doi.org/10.3934/amc.2021019
https://doi.org/10.3934/amc.2021019
Publikováno v:
Advances in Mathematics of Communications. 17:845-872
MDS matrices play an important role in the design of block ciphers, and constructing MDS matrices with fewer xor gates is of significant interest for lightweight ciphers. For this topic, Duval and Leurent proposed an approach to construct MDS matrice
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a98d6632eebdc5e63e41783c0ac8660f
https://doi.org/10.3934/amc.2021025
https://doi.org/10.3934/amc.2021025
Autor:
Sergey Norin, Luke Postle
Publikováno v:
Journal of Combinatorial Theory, Series B. 158:283-300
In 1943, Hadwiger conjectured that every graph with no K t + 1 minor is t-colorable for every t ≥ 0 . While Hadwiger's conjecture does not hold for list-coloring, the linear weakening is conjectured to be true. In the 1980 s, Kostochka and Thomason
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d6d8b44f0b43a9de3c7f5bc2f43026ae
https://doi.org/10.1016/j.jctb.2021.02.001
https://doi.org/10.1016/j.jctb.2021.02.001