Zobrazeno 1 - 10
of 28
pro vyhledávání: '"Kyunghwan Song"'
Autor:
WonTae Hwang, Kyunghwan Song
Publikováno v:
Journal of Inequalities and Applications, Vol 2019, Iss 1, Pp 1-12 (2019)
Abstract We prove that the integer part of the reciprocal of the tail of ζ(s) $\zeta (s)$ at a rational number s=1p $s=\frac{1}{p}$ for any integer with p≥5 $p \geq 5$ or s=2p $s=\frac{2}{p}$ for any odd integer with p≥5 $p \geq 5$ can be descri
Externí odkaz:
https://doaj.org/article/00d7f2dff78843a4add4574b9c98d41a
Autor:
Hyunwoong Kim, Seonghi Lee, Kyunghwan Song, Yujun Shin, Dongyrul Park, Jongcheol Park, Jaeyong Cho, Seungyoung Ahn
Publikováno v:
Micromachines, Vol 13, Iss 7, p 1070 (2022)
In this paper, we propose and analyze a novel interposer channel structure with vertical tabbed vias to achieve high-speed signaling and low-power consumption in high-bandwidth memory (HBM). An analytical model of the self- and mutual capacitance of
Externí odkaz:
https://doaj.org/article/72be08c71b3d418b8a0b673eb3e6d93d
Autor:
Donggyun Kim, Kyunghwan Song
Publikováno v:
Journal of Inequalities and Applications, Vol 2018, Iss 1, Pp 1-13 (2018)
Abstract We present some bounds of the inverses of tails of the Riemann zeta function on 0
Externí odkaz:
https://doaj.org/article/866a7a3050c34f0aa0375a74e7505bc9
Autor:
WonTae Hwang1, Kyunghwan Song2 khsong@jejunu.ac.kr
Publikováno v:
International Journal of Mathematics & Computer Science. 2023, Vol. 18 Issue 2, p321-333. 13p.
Autor:
Kyunghwan Song, Yun Am Seo
Publikováno v:
International Journal on Advanced Science, Engineering & Information Technology; 2024, Vol. 14 Issue 3, p906-911, 6p
Autor:
WonTae Hwang1, Kyunghwan Song2 khsong0118@sunmoon.ac.kr
Publikováno v:
International Journal of Mathematics & Computer Science. 2022, Vol. 17 Issue 2, p525-535. 11p.
Publikováno v:
2022 IEEE International Symposium on Radio-Frequency Integration Technology (RFIT).
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b7b47b9bd22cf86100dff8b2b9e87047
https://doi.org/10.1109/rfit54256.2022.9882505
https://doi.org/10.1109/rfit54256.2022.9882505
Publikováno v:
Discrete Applied Mathematics. 294:31-40
Recently, Yu et al. presented an algorithm for a canonic DBC of a positive integer n by solving certain subproblems recursively and it requires O ( ( log n ) 2 log log n ) bit operations and O ( ( log n ) 2 ) bits of memory. This is currently the mos
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6a90bada9b199ba39ba5ec71746e23e8
https://doi.org/10.1016/j.dam.2021.01.023
https://doi.org/10.1016/j.dam.2021.01.023
Publikováno v:
Korean Agricultural Economics Association. 61:81-100
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::65ee2a74f5d55b015d39f84c1b02c32d
https://doi.org/10.24997/kjae.2020.61.3.81
https://doi.org/10.24997/kjae.2020.61.3.81
Publikováno v:
Discrete Applied Mathematics. 283:323-335
The security of most lattice based cryptography relies on the hardness of computing a shortest nonzero vector of lattices. We say that a lattice basis is SV-reduced if it contains a shortest nonzero vector of the lattice. In this paper, we prove that
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ff774c32bd50a3296283840a7a06bce6
https://doi.org/10.1016/j.dam.2020.01.023
https://doi.org/10.1016/j.dam.2020.01.023