A5101892980- VLSI and FPGA Design Techniques
- VLSI and Analog Circuit Testing
- Parallel Computing and Optimization Techniques
- graph theory and CDMA systems
- Particle physics theoretical and experimental studies
- High-Energy Particle Collisions Research
- Digital Image Processing Techniques
- Coding theory and cryptography
- Advanced Graph Theory Research
- Quantum Chromodynamics and Particle Interactions
- Interconnection Networks and Systems
- Computational Physics and Python Applications
- Solar and Space Plasma Dynamics
- Magnetic and Electromagnetic Effects
- Network Packet Processing and Optimization
- Low-power high-performance VLSI design
- semigroups and automata theory
- Magnetic confinement fusion research
- Optimization and Search Problems
- Ionosphere and magnetosphere dynamics
- Scientific Research and Discoveries
- Cosmology and Gravitation Theories
- Graph Theory and Algorithms
- Geophysics and Gravity Measurements
- Gas Dynamics and Kinetic Theory
Huizhou University
2023
University of Science and Technology of China
2019-2020
Saarland University
1991-2002
We revisit the azimuthal angle dependence of local spin polarization hyperons in heavy-ion collisions at 200 GeV framework (3+1)D viscous hydrodynamic model CLVisc. Two different initial conditions are considered our simulation: optical Glauber condition without orbital angular momentum and AMPT with an momentum. find that hyperon strongly depends on choice so-called "spin chemical potential" $\Omega_{\mu\nu}$. With $\Omega_{\mu\nu}$ chosen to be proportional temperature vorticity,...
We have developed a numerical framework for full solution of the relativistic Boltzmann equations quark-gluon matter using multiple Graphics Processing Units (GPUs) on distributed clusters. Including all $2 \to 2$ scattering processes 3-flavor quarks and gluons, we compute time evolution distribution functions in both coordinate momentum spaces cases pure mixture gluons. By introducing symmetrical sampling method GPUs which ensures particle number conservation, our is able to perform...
Precise congestion prediction from a placement solution plays crucial role in circuit placement. This work proposes the lattice hypergraph (LH-graph), novel graph formulation for circuits, which preserves netlist data during whole learning process, and enables information propagated geometrically topologically. Based on formulation, we further developed heterogeneous neural network architecture LHNN, jointing routing demand regression to support spot classification. LHNN constantly achieves...
Running time is a key metric across the standard physical design flow stages. However, with rapid growth in sizes, routing runtime has become bottleneck flow. As result, speeding becomes critical and pressing task for IC automation. Aside from running time, we need to evaluate quality of global solution since poor engine degrades performance after entire stage. This work takes both them into consideration. We propose framework GPU-accelerated algorithms heterogeneous graph scheduler, called...
Precise congestion prediction from a placement solution plays crucial role in circuit placement. This work proposes the lattice hypergraph (LH-graph), novel graph formulation for circuits, which preserves netlist data during whole learning process, and enables information propagated geometrically topologically. Based on formulation, we further developed heterogeneous neural network architecture LHNN, jointing routing demand regression to support spot classification. LHNN constantly achieves...
Running time is a key metric across the standard physical design flow stages. However, with rapid growth in sizes, routing runtime has become bottleneck flow. To improve effectiveness of modern global router, we propose framework GPU-accelerated algorithms and heterogeneous task graph scheduler, called FastGR. Its runtime-oriented version FastGRL achieves 2.489× speedup compared state-of-the-art router. Furthermore, L-shape pattern used can contribute to 9.324× over sequential algorithm on...
Abstract Recently, robot scheduling has been widely concerned by numerous companies and researchers. They adopt an intelligent algorithm to design strategies for automated guided vehicle (AGV) achieve required moving routes certain aims. However, the existing employ mathematical program models arrange robots’ control ignore machine issues that robots may have. This will cause conflict lead whole a deadlock when scale of reaches critical point. In this paper, we present novel strategy...
Article Free Access Share on On the assignment complexity of uniform trees Author: Hongzhong Wu View Profile Authors Info & Claims ISSAC '93: Proceedings 1993 international symposium Symbolic and algebraic computationAugust 1993Pages 95–104https://doi.org/10.1145/164081.164100Published:01 August 1993Publication History 1citation52DownloadsMetricsTotal Citations1Total Downloads52Last 12 Months2Last 6 weeks0 Get Citation AlertsNew Alert added!This alert has been successfully added will be sent...
The author describes a new method to construct an L*n boolean matrix for two given integers n and k (k<n), such that every L*k submatrix contains 2/sup k/ distinct row vectors of
The author describes a new method to construct an L*n boolean matrix for two given integers n and k (k<n), such that every L*k submatrix contains 2/sup k/ distinct row vectors of