A5007723977- Interconnection Networks and Systems
- Advanced Graph Theory Research
- Coding theory and cryptography
- Advanced oxidation water treatment
- Catalytic Processes in Materials Science
- VLSI and FPGA Design Techniques
- Distributed systems and fault tolerance
- graph theory and CDMA systems
- Advanced Optical Network Technologies
- Advanced Photocatalysis Techniques
- Graph theory and applications
- semigroups and automata theory
- Advanced Data Storage Technologies
- Supercapacitor Materials and Fabrication
- Cellular Automata and Applications
- Antenna Design and Analysis
- Radio Astronomy Observations and Technology
- Advanced Materials and Mechanics
- Electrocatalysts for Energy Conversion
- Mathematical functions and polynomials
- Artificial Intelligence in Law
- Graph Theory and Algorithms
- Nuclear Materials and Properties
- Radiative Heat Transfer Studies
- Algebraic Geometry and Number Theory
Tsinghua University
2004-2024
Tsinghua–Berkeley Shenzhen Institute
2023
Shanxi University
2011-2022
University Town of Shenzhen
2022
Xi'an Jiaotong University
2018
University of Science and Technology of China
1991-1999
Beibu Gulf University
1991
A finite Gilbert-Varshamov (GV) bound for pure stabilizer (binary and nonbinary) quantum error correcting codes is presented in analogy to the GV classical by using several enumerative results unitary geometry. From this we obtain new binary a nonconstructive way having better parameters than known codes.
We give direct and recursive constructions for aperiodic periodic complementary sequences. Using these constructions, many missing entries in the table of Bomer Antweiler (1990) can be filled.
The torus network is one of the most popular interconnection topologies for massively parallel computing systems. Strong matching preclusion that additionally permits more destructive vertex faults in a graph extensive form original assumes only edge faults. In this paper, we establish strong number and all minimum sets bipartite networks 2-dimensional nonbipartite networks.
The torus network is one of the most popular interconnection networks for massively parallel computing systems. strong matching preclusion number a graph minimum vertices and edges whose deletion results in that has neither perfect matchings nor almost matchings. In this paper, we establish classify all optimal solutions two-dimensional with an odd vertices.
The cartesian product is a very effective method for designing large-scale interconnection networks. super-λ′ property an index to measure the reliability of Let G=(V,E) be connected graph. An edge set S⊆E restricted cut if G−S disconnected and every component has at least two vertices. A graph G minimum isolates one edge. Fault tolerance networks important issue. fault Sλ′(G) on maximum integer m which still any with |S|≤m. In this paper, we give lower upper bounds graphs. More refined are...
The arrangement graph A n,k is one of the attractive underlying topologies for distributed systems. Let f m (n, k) be minimum number faulty links that make every sub-arrangement n-m,k-m in under link failure model. In this paper, we proved [Formula: see text], and text] text].
A modified electric-field-coupled (MELC) resonator featuring negative permittivity is proposed to enhance the inter-element isolation of a circularly polarized (CP) patch antenna array operated at Chinese compass navigation satellite system (CNSS) downlink band. The comprises two capacitive gaps and common inductive strip connected ground plane by metal vias. suspended microstrip line excitation employed efficiently design investigate MELC whose constitutive parameters are subsequently...
The [Formula: see text]-star graph text], which is introduced to address scaling issues of the star graph, recognized as an attractive interconnection network topology for building multiprocessor systems because its desirable properties. Let text] be minimum number faulty vertices that make every subgraph isomorphic in under vertex-failure model, where text]. In this paper, we prove and
Low-rank training has emerged as a promising approach for reducing memory usage in Large Language Models (LLMs). Previous methods either rely on decomposing weight matrices (e.g., LoRA), or seek to decompose gradient GaLore) ensure reduced consumption. However, both of them constrain the low-rank subspace, thus inevitably leading sub-optimal performance. This raises question: whether it is possible consistently preserve constraint efficiency, while achieving full-rank (i.e., with gradients...
Binary sequences with lower autocorrelation values have important applications in cryptography and communications. In this paper, we present all possible parameters for binary periodical a 2-level values. For $n \equiv 1\pmod 4$, prove some cases of Schmidt's Conjecture perfect sequences. (Des. Codes Cryptogr. 78 (2016), 237-267.) 2\pmod Jungnickel Pott (Discrete Appl. Math. 95 (1999) 331-359.) left four as open problem solve three its. 3\pmod nonexistence which nontrivial are equal 3....