A5032226905- Particle physics theoretical and experimental studies
- Quantum Chromodynamics and Particle Interactions
- High-Energy Particle Collisions Research
- Data Management and Algorithms
- Advanced Database Systems and Queries
- Data Mining Algorithms and Applications
- Neutrino Physics Research
- Welding Techniques and Residual Stresses
- Rough Sets and Fuzzy Logic
- Additive Manufacturing Materials and Processes
- Web Data Mining and Analysis
- Caching and Content Delivery
- Advanced Computational Techniques and Applications
- Dark Matter and Cosmic Phenomena
- Advanced Data Storage Technologies
- Semantic Web and Ontologies
- Data Stream Mining Techniques
- Energy Efficient Wireless Sensor Networks
- Algorithms and Data Compression
- Peer-to-Peer Network Technologies
- Sentiment Analysis and Opinion Mining
- Service-Oriented Architecture and Web Services
- Particle Detector Development and Performance
- Text and Document Classification Technologies
- High Entropy Alloys Studies
Tsinghua University
2021-2025
Imperial College London
2025
European Organization for Nuclear Research
2025
Nanjing University of Science and Technology
2018-2024
Ministry of Industry and Information Technology
2019-2024
KU Leuven
2024
University of Maryland, College Park
2024
Beijing Institute of Technology
2024
Jinan Institute of Quantum Technology
2024
University of Genoa
2024
Methods for efficient mining of frequent patterns have been studied extensively by many researchers. However, the previously proposed methods still encounter some performance bottlenecks when databases with different data characteristics, such as dense vs. sparse, long short patterns, memory-based disk-based, etc. In this study, we propose a simple and novel hyper-linked structure, H-struct new algorithm, H-mine, which takes advantage structure dynamically adjusts links in process. A...
In this study, we propose a simple and novel data structure using hyper-links, H-struct, new mining algorithm, H-mine, which takes advantage of dynamically adjusts links in the process. A distinct feature method is that it has very limited precisely predictable main memory cost runs quickly memory-based settings. Moreover, can be scaled up to large databases database partitioning. When set becomes dense, (conditional) FP-trees constructed as part Our study shows H-mine an excellent...
Abstract The predictive performance of probabilistic pavement condition deterioration is critical for effective maintenance and rehabilitation decisions. Currently, numerous improved models exist, but few rely on to improve prediction. Therefore, this study proposed an model prediction based the coupling Bayesian neural network (BNN) cuckoo search (CS) algorithm. evaluated against two metrics: determination coefficient (R 2 ) standard deviation (stability). Finally, data from management...
With the advent of cloud computing, it becomes desirable to utilize computing efficiently process complex operations on large graphs without compromising their sensitive information. This paper studies shortest distance in cloud, which aims at following goals: i) preventing outsourced from neighborhood attack, ii) preserving distances graphs, iii) minimizing overhead client side. The basic idea this is transform an original graph G into a link Gl kept locally and set Go. Each should meet...
Fluctuations in reservoir water levels exert a strong triggering effect on landslides along banks, constituting long-term concern the safe operation of hydroelectric projects and prevention management geological disasters. While existing research has investigated impact periodic level changes deformation bank landslides, observation detection such are challenging, with noticeable gaps understanding how these deformations respond to during impoundment period. To address this, our study...
With the wide applications of large scale graph data such as social networks, problem finding top-k shortest paths attracts increasing attention. This paper focuses on discovery simple (paths without loops). The well known algorithm for this is due to Yen, and provided worstcase bound O(kn(m + nlogn)), which comes from O(n) times single-source path each k paths, remains unbeaten 30 years, where n number nodes m edges. In paper, we observe that there are shared sub-paths among O(kn) paths....
A thin-walled structure was manufactured by wire + arc additive manufacturing using 18Ni 300 maraging steel, and the heat treatment process had been investigated. The microstructure of as-deposited sample martensite, ferrite nano-precipitated phases. Differently, more phases reverted austenite existed in direct aging (AT) sample. However, only lath martensite solution (SAT) AT samples performed a high strength with well plastic. primary strengthening mechanism for this great improvement...
Previous studies have shown mining closed patterns provides more benefits than the complete set of frequent patterns, since pattern leads to compact results and efficient algorithms. It is quite useful in a data stream environment where memory computation power are major concerns. This paper problem sequential over sliding windows. A synopsis structure IST (Inverse Closed Sequence Tree) designed keep inverse current window. An algorithm SeqStream developed mine windows incrementally, various...