Zobrazeno 1 - 10
of 1 049
pro vyhledávání: '"Son, Hoang"'
Autor:
Huynh, Phuong Duy, Dau, Son Hoang, Tran, Hong Yen, Huppert, Nick, Sun, Hoonie, Cervenjak, Joshua, Li, Xiaodong, Viterbo, Emanuele
We explored in this work the ubiquitous phenomenon of serial scammers, who deploy thousands of addresses to conduct a series of similar Rug Pulls on popular decentralized exchanges (DEXs). We first constructed a list of about 384,000 scammer addresse
Externí odkaz:
http://arxiv.org/abs/2412.10993
Motivated by a repair problem for fractional repetition codes in distributed storage, each block of any Steiner quadruple system (SQS) of order $v$ is partitioned into two pairs. Each pair in such a partition is called a nested design pair and its mu
Externí odkaz:
http://arxiv.org/abs/2410.14417
Autor:
Cao, Quang, Vgena, Katerina, Mavroeidi, Aikaterini-Georgia, Kalloniatis, Christos, Yi, Xun, Dau, Son Hoang
Centralized social networks have experienced a transformative impact on our digital era communication, connection, and information-sharing information. However, it has also raised significant concerns regarding users' privacy and individual rights. I
Externí odkaz:
http://arxiv.org/abs/2409.18360
In this paper, we design a family of $[n,k,d]$ block circulant codes that consist of many $[n_0 \ll n,k_0 \ll k,d_0]$ local codes and that satisfy three properties: (1) the code supports distributed erasure decoding, (2) $d$ can be scaled above $d_0$
Externí odkaz:
http://arxiv.org/abs/2406.12160
Autor:
Dinh, Thi Xinh, Le, Ba Thong, Dau, Son Hoang, Boztas, Serdar, Kruglik, Stanislav, Kiah, Han Mao, Viterbo, Emanuele, Etzion, Tuvi, Chee, Yeow Meng
We generalize the problem of recovering a lost/erased symbol in a Reed-Solomon code to the scenario in which some side information about the lost symbol is known. The side information is represented as a set $S$ of linearly independent combinations o
Externí odkaz:
http://arxiv.org/abs/2405.07180
We investigate the problem of privately recovering a single erasure for Reed-Solomon codes with low communication bandwidths. For an $[n,k]_{q^\ell}$ code with $n-k\geq q^{m}+t-1$, we construct a repair scheme that allows a client to recover an arbit
Externí odkaz:
http://arxiv.org/abs/2405.06583
To measure repair latency at helper nodes, we introduce a new metric called skip cost that quantifies the number of contiguous sections accessed on a disk. We provide explicit constructions of zigzag codes and fractional repetition codes that incur z
Externí odkaz:
http://arxiv.org/abs/2405.03614
In this paper, we focus on the design of binary constant weight codes that admit low-complexity encoding and decoding algorithms, and that have a size $M=2^k$. For every integer $\ell \geq 3$, we construct a $(n=2^\ell, M=2^{k_{\ell}}, d=2)$ constant
Externí odkaz:
http://arxiv.org/abs/2401.16647
Large Language Models (LLMs) have been garnering significant attention of AI researchers, especially following the widespread popularity of ChatGPT. However, due to LLMs' intricate architecture and vast parameters, several concerns and challenges reg
Externí odkaz:
http://arxiv.org/abs/2310.05312
Autor:
Son Hoang Le, Son Hong Nguyen
Publikováno v:
Journal of Dental Sciences, Vol 19, Iss 4, Pp 2203-2209 (2024)
Background/purpose: Platelet-rich fibrin (PRF) is a promising host-derived scaffold for regenerative endodontic treatment. This study investigated the effects of advanced PRF plus (A-PRF+) and injectable PRF (i-PRF) on the proliferation, migration, a
Externí odkaz:
https://doaj.org/article/3f8f2d4d8af94402b617088b215c585e
