Rong Luo
YOU?
Author Swipe
View article: Squares of subcubic planar graphs without cycles of length 4-8 are 6-choosable
Squares of subcubic planar graphs without cycles of length 4-8 are 6-choosable Open
The {\em square} of a graph $G$, denoted $G^2$, has the same vertex set as $G$ and an edge between any two vertices at distance at most $2$ in $G$. Wegner (1977) conjectured that for a planar graph $G$, $χ(G^2) \leq 7$ if $Δ(G) = 3$, $χ(G^…
View article: Research on Board Game Strategy Methods Based on Reinforcement Learning
Research on Board Game Strategy Methods Based on Reinforcement Learning Open
As a typical sequential decision-making and gaming problem, board games have the complexity of large state space and strong dynamic confrontation, however, traditional methods have many limitations in dealing with them, so they need to be …
View article: Combinatorial $t$-Designs from Finite Abelian Groups and Their Applications to Elliptic Curve Codes
Combinatorial $t$-Designs from Finite Abelian Groups and Their Applications to Elliptic Curve Codes Open
In this paper, we establish the conditions for some finite abelian groups and the family all the $k$-sets in each of them summing up to an element $x$ to form $t$-designs. We fully characterize the sufficient and necessary conditions for t…
View article: Energy–Carbon–Value Coupling Regulation Decision Model for Multi-Park Integrated Energy Systems
Energy–Carbon–Value Coupling Regulation Decision Model for Multi-Park Integrated Energy Systems Open
View article: Egg-tray-inspired triboelectric nanogenerator pavement module for energy harvesting: design analysis and prototype testing
Egg-tray-inspired triboelectric nanogenerator pavement module for energy harvesting: design analysis and prototype testing Open
View article: Egg-tray-inspired triboelectric nanogenerator pavement module for energy harvesting: design analysis and prototype testing
Egg-tray-inspired triboelectric nanogenerator pavement module for energy harvesting: design analysis and prototype testing Open
View article: Semi-Supervised Dimensionality Reduction Method Utilizing Pairwise Constraints and Integrating Similarity and Dissimilarity among Data
Semi-Supervised Dimensionality Reduction Method Utilizing Pairwise Constraints and Integrating Similarity and Dissimilarity among Data Open
Data preprocessing stages, including data reconstruction and dimensionality reduction, play a pivotal role in influencing subsequent machine learning and data mining endeavors. While supervised dimensionality reduction typically surpasses …
View article: An 8-flow theorem for signed graphs
An 8-flow theorem for signed graphs Open
We prove that a signed graph admits a nowhere-zero $8$-flow provided that it is flow-admissible and the underlying graph admits a nowhere-zero $4$-flow. When combined with the 4-color theorem, this implies that every flow-admissible bridge…
View article: Nanoindentation Behavior and Cyclic Degradation Mechanism of Bcc Phase Alcocrfeni High-Entropy Alloy
Nanoindentation Behavior and Cyclic Degradation Mechanism of Bcc Phase Alcocrfeni High-Entropy Alloy Open
View article: A Novel Approach to Construct Huffman Sequences with Low PAPR
A Novel Approach to Construct Huffman Sequences with Low PAPR Open
The auto-correlation property of Huffman sequence makes it a good candidate for its application in radar and communication systems. However, high peak-to-average power ratio (PAPR) of Huffman sequence severely limits its application value.…
View article: Signed circuit $6$-covers of signed $K_4$-minor-free graphs
Signed circuit $6$-covers of signed $K_4$-minor-free graphs Open
Bermond, Jackson and Jaeger [{\em J. Combin. Theory Ser. B} 35 (1983): 297-308] proved that every bridgeless ordinary graph $G$ has a circuit $4$-cover and Fan [{\em J. Combin. Theory Ser. B} 54 (1992): 113-122] showed that $G$ has a circu…
View article: Integer flows on triangularly connected signed graphs
Integer flows on triangularly connected signed graphs Open
A triangle-path in a graph $G$ is a sequence of distinct triangles $T_1,T_2,\ldots,T_m$ in $G$ such that for any $i, j$ with $1\leq i < j \leq m$, $|E(T_i)\cap E(T_{i+1})|=1$ and $E(T_i)\cap E(T_j)=\emptyset$ if $j > i+1$. A connected grap…
View article: Two Classes of Optimal Ternary Cyclic Codes with Minimum Distance Four
Two Classes of Optimal Ternary Cyclic Codes with Minimum Distance Four Open
Cyclic codes are a subclass of linear codes and have applications in consumer electronics, data storage systems, and communication systems as they have efficient encoding and decoding algorithms. Let C(t,e) denote the cyclic code with two …
View article: New Binary Sequences with Low Odd Correlation via Interleaving Technique
New Binary Sequences with Low Odd Correlation via Interleaving Technique Open
Even correlation and odd correlation of sequences are two kinds of measures for their similarities. Both kinds of correlation have important applications in communication and radar. Compared with vast knowledge on sequences with good even …
View article: Microstructural Evolution and Mechanical Properties of 7075 Aluminium Alloy during Semi-Solid Compression Deformation
Microstructural Evolution and Mechanical Properties of 7075 Aluminium Alloy during Semi-Solid Compression Deformation Open
Aluminium alloys are becoming increasingly popular due to the demands for high-performance lightweight components, and semi-solid metal processing (SSM) is a technique for forming near-net-shape and complex components with far fewer defect…
View article: Doppler Resilient Waveforms Design in MIMO Radar via a Generalized Null Space Method
Doppler Resilient Waveforms Design in MIMO Radar via a Generalized Null Space Method Open
To mitigate the interference caused by range sidelobes in multiple-input multiple-output (MIMO) radar, we propose a new method to construct Doppler resilient complementary waveforms from complete complementary code (CCC). By jointly design…
View article: Effect of microcosmic contact stiffness heterogeneity on macroscopic mechanical parameters of rock
Effect of microcosmic contact stiffness heterogeneity on macroscopic mechanical parameters of rock Open
The particle flow method is used to build a rock material model formed by the contact between the particles and the geometric constraints. The heterogeneous representation method of rock material components is used to describe the heteroge…
View article: The spatial response pattern of coseismic landslides induced by the 2008 Wenchuan earthquake to the surface deformation and Coulomb stress change revealed from InSAR observations
The spatial response pattern of coseismic landslides induced by the 2008 Wenchuan earthquake to the surface deformation and Coulomb stress change revealed from InSAR observations Open
The 2008 Mw 7.9 Wenchuan earthquake triggered plenty of coseismic giant landslides, which resulted in almost one third of total fatalities and economic losses during the event. Previous studies investigated the spatial relations between la…
View article: Flows on signed graphs without long barbells
Flows on signed graphs without long barbells Open
Many basic properties in Tutte's flow theory for unsigned graphs do not have their counterparts for signed graphs. However, signed graphs without long barbells in many ways behave like unsigned graphs from the point view of flows. In this …
View article: Flows on flow-admissible signed graphs
Flows on flow-admissible signed graphs Open
In 1983, Bouchet proposed a conjecture that every flow-admissible signed graph admits a nowhere-zero $6$-flow. Bouchet himself proved that such signed graphs admit nowhere-zero $216$-flows and Zyka further proved that such signed graphs ad…
View article: Sparse Recovery With Block Multiple Measurement Vectors Algorithm
Sparse Recovery With Block Multiple Measurement Vectors Algorithm Open
This paper investigates the performance of the block multiple measurement vectors (BMMV) algorithm in reconstructing block joint sparse matrices. We prove that if 41) obeys block restricted isometry property with 8 K+1 <; Nf +1 , then BMMV…
View article: Sparse Representation Based Approach to Prediction for Economic Time Series
Sparse Representation Based Approach to Prediction for Economic Time Series Open
This paper addresses the problem of economic time series forecasting, and a new prediction method is proposed. The method fully capitalizes on the two key technologies, sparse representation, and fuzzy set theory, to handle the stock time …
View article: Influence of Bedding Planes on the Mechanical Characteristics and Fracture Pattern of Transversely Isotropic Rocks in Direct Shear Tests
Influence of Bedding Planes on the Mechanical Characteristics and Fracture Pattern of Transversely Isotropic Rocks in Direct Shear Tests Open
Bedding planes are the primary control on the anisotropy of mechanical characteristics and fracture patterns in rock. To analyze the influence of the geometrical properties of bedding planes on the direct shear strength characteristics and…
View article: Nowhere-zero $3$-flow of graphs with small independence number
Nowhere-zero $3$-flow of graphs with small independence number Open
Tutte's $3$-flow conjecture states that every $4$-edge-connected graph admits a nowhere-zero $3$-flow. In this paper, we characterize all graphs with independence number at most $4$ that admit a nowhere-zero $3$-flow. The characterization …
View article: Signed graphs: from modulo flows to integer-valued flows
Signed graphs: from modulo flows to integer-valued flows Open
Converting modulo flows into integer-valued flows is one of the most critical steps in the study of integer flows. Tutte and Jaeger's pioneering work shows the equivalence of modulo flows and integer-valued flows for ordinary graphs. Howev…
View article: Osteoblast behaviors on titania nanotube and mesopore layers
Osteoblast behaviors on titania nanotube and mesopore layers Open
Titania nanotubes and mesopores with different diameter sizes were prepared by electrochemical oxidation of titanium. The responses of osteoblastic cells isolated from Sprague-Dawley rats to the nanotube and mesopore layers were investigat…
View article: Shortest circuit covers of signed graphs
Shortest circuit covers of signed graphs Open
A shortest circuit cover ${\cal F}$ of a bridgeless graph $G$ is a family of circuits that covers every edge of $G$ and is of minimum total length. The total length of a shortest circuit cover ${\cal F}$ of $G$ is denoted by $SCC(G)$. For …