Zobrazeno 1 - 10
of 284
pro vyhledávání: '"Du, ZhiHui"'
With the development of astronomical facilities, large-scale time series data observed by these facilities is being collected. Analyzing anomalies in these astronomical observations is crucial for uncovering potential celestial events and physical ph
Externí odkaz:
http://arxiv.org/abs/2403.10220
Autor:
Bader, David A., Li, Fuhuan, Du, Zhihui, Pauliuchenka, Palina, Rodriguez, Oliver Alvarado, Gupta, Anant, Minnal, Sai Sri Vastav, Nahata, Valmik, Ganeshan, Anya, Gundogdu, Ahmet, Lew, Jason
Listing and counting triangles in graphs is a key algorithmic kernel for network analyses, including community detection, clustering coefficients, k-trusses, and triangle centrality. In this paper, we propose the novel concept of a cover-edge set tha
Externí odkaz:
http://arxiv.org/abs/2403.02997
Publikováno v:
W. Fan, Z. Du, M. Smith-Creasey, D. Fern\'andez, "HoneyDOC: An Efficient Honeypot Architecture Enabling All-Round Design", IEEE Journal on Selected Areas in Communications, vol. 37, issue 3, March 2019
Honeypots are designed to trap the attacker with the purpose of investigating its malicious behavior. Owing to the increasing variety and sophistication of cyber attacks, how to capture high-quality attack data has become a challenge in the context o
Externí odkaz:
http://arxiv.org/abs/2402.06516
Finding connected components in a graph is a fundamental problem in graph analysis. In this work, we present a novel minimum-mapping based Contour algorithm to efficiently solve the connectivity problem. We prove that the Contour algorithm with two o
Externí odkaz:
http://arxiv.org/abs/2311.02811
Analyzing large-scale graphs poses challenges due to their increasing size and the demand for interactive and user-friendly analytics tools. These graphs arise from various domains, including cybersecurity, social sciences, health sciences, and netwo
Externí odkaz:
http://arxiv.org/abs/2309.09943
One of the most critical problems in the field of string algorithms is the longest common subsequence problem (LCS). The problem is NP-hard for an arbitrary number of strings but can be solved in polynomial time for a fixed number of strings. In this
Externí odkaz:
http://arxiv.org/abs/2309.09072
Autor:
Bader, David A., Li, Fuhuan, Ganeshan, Anya, Gundogdu, Ahmet, Lew, Jason, Rodriguez, Oliver Alvarado, Du, Zhihui
Counting and finding triangles in graphs is often used in real-world analytics to characterize cohesiveness and identify communities in graphs. In this paper, we propose the novel concept of a cover-edge set that can be used to find triangles more ef
Externí odkaz:
http://arxiv.org/abs/2210.00389
Publikováno v:
In Plant Physiology and Biochemistry September 2024 214
Publikováno v:
In Food Bioscience June 2024 59
Publikováno v:
In ISA Transactions March 2024 146:154-164