Zobrazeno 1 - 10
of 210
pro vyhledávání: '"Deng, Yuefan"'
While deep neural networks (DNNs) have revolutionized many fields, their fragility to carefully designed adversarial attacks impedes the usage of DNNs in safety-critical applications. In this paper, we strive to explore the robust features which are
Externí odkaz:
http://arxiv.org/abs/2309.04650
Autor:
Zhu, Yicong, Han, Changnian, Zhang, Peng, Cong, Guojing, Kozloski, James R., Yang, Chih-Chieh, Zhang, Leili, Deng, Yuefan
We have developed an AI-aided multiple time stepping (AI-MTS) algorithm and multiscale modeling framework (AI-MSM) and implemented them on the Summit-like supercomputer, AIMOS. AI-MSM is the first of its kind to integrate multi-physics, including int
Externí odkaz:
http://arxiv.org/abs/2205.14121
Communication latency has become one of the determining factors for the performance of parallel clusters. To design low-latency network topologies for high-performance computing clusters, we optimize the diameters, mean path lengths, and bisection wi
Externí odkaz:
http://arxiv.org/abs/2201.01342
While deep neural networks have shown impressive performance in many tasks, they are fragile to carefully designed adversarial attacks. We propose a novel adversarial training-based model by Attention Guided Knowledge Distillation and Bi-directional
Externí odkaz:
http://arxiv.org/abs/2108.06017
Autor:
Zhang, Ziji, Kementzidis, Georgios, Zhang, Peng, Zhang, Leili, Kozloski, James, Hansen, Adam, Rafailovich, Miriam, Simon, Marcia, Deng, Yuefan
Publikováno v:
In Computer Physics Communications February 2024 295
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.
We organize a table of regular graphs with minimal diameters and minimal mean path lengths, large bisection widths and high degrees of symmetries, obtained by enumerations on supercomputers. These optimal graphs, many of which are newly discovered, m
Externí odkaz:
http://arxiv.org/abs/1910.13539
We introduced the load-balanced routing algorithms, for interconnection networks resulting from nesting, by considering the pressure of the data forwarding in each node. Benchmarks on a small cluster with various network topologies, and simulations f
Externí odkaz:
http://arxiv.org/abs/1909.06497
Publikováno v:
Mathematics (MDPI), 7(12), 1214(2019)
Using three supercomputers, we broke a record set in 2011, in the enumeration of non-isomorphic regular graphs by expanding the sequence of A006820 in Online Encyclopedia of Integer Sequences (OEIS), to achieve the number for 4-regular graphs of orde
Externí odkaz:
http://arxiv.org/abs/1907.12455