Searcharxiv⌕ Search

arXiv subjects

Ning Wang

Publications and source records attributed to Ning Wang.

At least 217 records · Page 12Linked to original sources

Recyclable Semi-supervised Method Based on Multi-model Ensemble for Video Scene Parsing

Pixel-level Scene Understanding is one of the fundamental problems in computer vision, which aims at recognizing object classes, masks and semantics of each pixel in the given image. Since the real-world is actually video-based rather than a static state, learning to perform video semantic segmentation is more reasonable and practical for realistic applications. In this paper, we adopt Mask2Former as architecture and ViT-Adapter as backbone. Then, we propose a recyclable semi-supervised training method based on multi-model ensemble. Our method achieves the mIoU scores of 62.97% and 65.83% on Development test and final test respectively. Finally, we obtain the 2nd place in the Video Scene Parsing in the Wild Challenge at CVPR 2023.

eess.IV↗

Systematic study of fusion barriers with energy dependent barrier radius

Considering energy dependence of the barrier radius in heavy-ion fusion reactions, a modified Siwek-Wilczyński (MSW) fusion cross section formula is proposed. With the MSW formula, the fusion barrier parameters for 367 reaction systems are systematically extracted, based on 443 datasets of measured cross sections. We find that the fusion excitation functions for about $60\%$ reaction systems can be better described by introducing the energy dependence of the barrier radius which is due to the dynamical effects at energies near and below the barrier. Considering both the influence of the geometry radii and that of the reduced de Broglie wavelength of the colliding nuclei, the barrier heights are well reproduced with only one model parameter. The extracted barrier radius parameters linearly decrease with the effective fissility parameter, and the width of the barrier distribution relates to the barrier height and as well as the reduced de Broglie wavelength at energies around the Coulomb barrier.

nucl-th↗

Efficient and secure quantum network coding based on quantum full homomorphic encryption

Based on $d$-dimensional quantum full homomorphic encryption, an efficient and secure quantum network coding protocol is proposed in this paper. First, a quantum full homomorphic encryption protocol is constructed utilizing $d$-dimensional universal quantum gates. On this basis, an efficient quantum network coding protocol is proposed. In the protocol, two source nodes encrypt their respective prepared quantum states with the quantum full homomorphic encryption protocol. The two intermediate nodes successively perform homomorphic evaluation of the received quantum states. Finally, the two sink nodes recover the quantum states transmitted by the two source nodes in the butterfly network depending on their measurement results. The performance analysis shows that the proposed quantum network coding protocol is correct and resistant to attacks launched by dishonest intermediate nodes and external eavesdroppers. Compared to related protocols, the proposed protocol not only enables to transfer information in $d$-dimensional quantum system, but also requires only 1 quantum gate and a key of length 2 in the encryption phase, which makes the protocol has higher efficiency.

quant-ph↗

Digital simulation of non-Abelian anyons with 68 programmable superconducting qubits

Non-Abelian anyons are exotic quasiparticle excitations hosted by certain topological phases of matter. They break the fermion-boson dichotomy and obey non-Abelian braiding statistics: their interchanges yield unitary operations, rather than merely a phase factor, in a space spanned by topologically degenerate wavefunctions. They are the building blocks of topological quantum computing. However, experimental observation of non-Abelian anyons and their characterizing braiding statistics is notoriously challenging and has remained elusive hitherto, in spite of various theoretical proposals. Here, we report an experimental quantum digital simulation of projective non-Abelian anyons and their braiding statistics with up to 68 programmable superconducting qubits arranged on a two-dimensional lattice. By implementing the ground states of the toric-code model with twists through quantum circuits, we demonstrate that twists exchange electric and magnetic charges and behave as a particular type of non-Abelian anyons, i.e., the Ising anyons. In particular, we show experimentally that these twists follow the fusion rules and non-Abelian braiding statistics of the Ising type, and can be explored to encode topological logical qubits. Furthermore, we demonstrate how to implement both single- and two-qubit logic gates through applying a sequence of elementary Pauli gates on the underlying physical qubits. Our results demonstrate a versatile quantum digital approach for simulating non-Abelian anyons, offering a new lens into the study of such peculiar quasiparticles.

quant-ph↗

A Mountain-Shaped Single-Stage Network for Accurate Image Restoration

Image restoration is the task of aiming to obtain a high-quality image from a corrupt input image, such as deblurring and deraining. In image restoration, it is typically necessary to maintain a complex balance between spatial details and contextual information. Although a multi-stage network can optimally balance these competing goals and achieve significant performance, this also increases the system's complexity. In this paper, we propose a mountain-shaped single-stage design base on a simple U-Net architecture, which removes or replaces unnecessary nonlinear activation functions to achieve the above balance with low system complexity. Specifically, we propose a feature fusion middleware (FFM) mechanism as an information exchange component between the encoder-decoder architectural levels. It seamlessly integrates upper-layer information into the adjacent lower layer, sequentially down to the lowest layer. Finally, all information is fused into the original image resolution manipulation level. This preserves spatial details and integrates contextual information, ensuring high-quality image restoration. In addition, we propose a multi-head attention middle block (MHAMB) as a bridge between the encoder and decoder to capture more global information and surpass the limitations of the receptive field of CNNs. Extensive experiments demonstrate that our approach, named as M3SNet, outperforms previous state-of-the-art models while using less than half the computational costs, for several image restoration tasks, such as image deraining and deblurring.

cs.CV↗

A optimization framework for herbal prescription planning based on deep reinforcement learning

Treatment planning for chronic diseases is a critical task in medical artificial intelligence, particularly in traditional Chinese medicine (TCM). However, generating optimized sequential treatment strategies for patients with chronic diseases in different clinical encounters remains a challenging issue that requires further exploration. In this study, we proposed a TCM herbal prescription planning framework based on deep reinforcement learning for chronic disease treatment (PrescDRL). PrescDRL is a sequential herbal prescription optimization model that focuses on long-term effectiveness rather than achieving maximum reward at every step, thereby ensuring better patient outcomes. We constructed a high-quality benchmark dataset for sequential diagnosis and treatment of diabetes and evaluated PrescDRL against this benchmark. Our results showed that PrescDRL achieved a higher curative effect, with the single-step reward improving by 117% and 153% compared to doctors. Furthermore, PrescDRL outperformed the benchmark in prescription prediction, with precision improving by 40.5% and recall improving by 63%. Overall, our study demonstrates the potential of using artificial intelligence to improve clinical intelligent diagnosis and treatment in TCM.

cs.AI↗

Resource Allocation for RIS-Assisted Device-to-Device Communications in Heterogeneous Cellular Networks

In recent years, with the explosive growth of data traffic, communication base stations (BSs) need to serve more and more users. Offloading traffic from BSs has become an efficient way to reduce the burden on BSs. Device-to-Device (D2D) communications have emerged to improve spectrum utilization by reusing the frequency spectrum of the cellular frequency band. In the general environment, Heterogeneous Cellular Networks (HCNs) including millimeter wave (mm-wave) have appeared. Since the D2D link allows to share of spectrum resources with the cellular user, it will bring potential interference to the cellular user. Fortunately, an emerging technology called Reconfigurable Intelligent Surface (RIS) can mitigate the severe interference caused by D2D links by shaping the incident beam and improving the multipath phase shift. In this paper, we study the resource allocation scheme to maximize the system sum rate, in the RISassisted single-cell heterogeneous D2D communication scenario. To solve the Block Coordinate Descent (BCD) problem, the problem of maximizing the sum rate is decomposed into three sub-problems. The resource allocation sub-problem is solved by a coalitional game method based on the game theory. The power allocation problem of the coalition converts the concave function into a convex optimization by mathematical transformation. The problem is solved by the gradient descent method. The local search method is adopted to find the optimum for the phase conversion problem. Then iterate until the difference of sum rate is less than the threshold. The simulation results show that the designed algorithm is superior to other benchmark schemes in the literature.

cs.IT↗

Ballistic transport spectroscopy of spin-orbit-coupled bands in monolayer graphene on WSe$_2$

Van der Waals interactions with transition metal dichalcogenides was shown to induce strong spin-orbit coupling (SOC) in graphene, offering great promises to combine large experimental flexibility of graphene with unique tuning capabilities of the SOC that can rotate spin by moving electrons or vice versa. Here, we probe SOC-driven band splitting and electron dynamics in graphene on WSe$_2$ by measuring ballistic transverse magnetic focusing. We found a clear splitting in the first focusing peak whose evolution in charge density and magnetic field is well reproduced by calculations using SOC strength of ~13 meV and no splitting in the second peak that indicates stronger Rashba SOC. A possible suppression of electron-electron scatterings was also found in temperature dependence measurement. Further, we found that Shubnikov-de Haas oscillations exhibit SOC strength of ~3.4 meV, suggesting that it probes different electron dynamics, calling for new theory. Our study demonstrates an interesting possibility to exploit ballistic electron motion pronounced in graphene for emerging spin-orbitronics.

cond-mat.mes-hall↗

Authenticated Multiparty Quantum Key Agreement for Optical-Ring Quantum Communication Networks

Quantum communication networks are connected by various devices to achieve communication or distributed computing for users in remote locations. In order to solve the problem of generating temporary session key for secure communication in optical-ring quantum networks, a quantum key agreement protocol is proposed. In the key agreement protocols, an attacker can impersonate a legal user to participate in the negotiation process and eavesdrop the agreement key easily. This is often overlooked in most quantum key agreement protocols, which makes them insecure in practical implementation. Considering this problem, the function of authenticating the user's identity is added in the proposed protocol. Combining classical hash function with identity information, we design the authentication operation conforming to the characteristics of quantum search algorithm. In the security analysis of the proposed protocol, quantum state discrimination is utilized to show that the protocol is secure against common attacks and impersonation attack. In addition, only single photons need to be prepared and measured, which makes our protocol feasible with existing technology.

quant-ph↗

Superconductivity in boron-doped carbon nanotube networks

By using the five Angstrom diameter pores of calcined zeolite as the template, we have fabricated boron doped carbon nanotube networks via the chemical vapor deposition method. Raman data indicate the network to comprise segments of interconnected carbon nano tubes. Transport measurements showed a superconducting transition initiating at 40K, with a sharp downturn around 20K to a low resistance state at 2K, accompanied by a low resistance plateau in the current voltage characteristic, fluctuating around zero resistance. Magnetic measurements exhibited the Meissner effect characteristic of thin superconducting wire networks in which the superconducting wire radius is much smaller than the London penetration length. At low magnetic field, the negative diamagnetic susceptibility was observed to persist beyond 200K. The transport and magnetic data are reconciled on the basis of a physical model based on weak links comprising short, one-dimensional superconducting nano tubes, that govern the global transport behavior.

cond-mat.supr-con↗

SU-Net: Pose estimation network for non-cooperative spacecraft on-orbit

Spacecraft pose estimation plays a vital role in many on-orbit space missions, such as rendezvous and docking, debris removal, and on-orbit maintenance. At present, space images contain widely varying lighting conditions, high contrast and low resolution, pose estimation of space objects is more challenging than that of objects on earth. In this paper, we analyzing the radar image characteristics of spacecraft on-orbit, then propose a new deep learning neural Network structure named Dense Residual U-shaped Network (DR-U-Net) to extract image features. We further introduce a novel neural network based on DR-U-Net, namely Spacecraft U-shaped Network (SU-Net) to achieve end-to-end pose estimation for non-cooperative spacecraft. Specifically, the SU-Net first preprocess the image of non-cooperative spacecraft, then transfer learning was used for pre-training. Subsequently, in order to solve the problem of radar image blur and low ability of spacecraft contour recognition, we add residual connection and dense connection to the backbone network U-Net, and we named it DR-U-Net. In this way, the feature loss and the complexity of the model is reduced, and the degradation of deep neural network during training is avoided. Finally, a layer of feedforward neural network is used for pose estimation of non-cooperative spacecraft on-orbit. Experiments prove that the proposed method does not rely on the hand-made object specific features, and the model has robust robustness, and the calculation accuracy outperforms the state-of-the-art pose estimation methods. The absolute error is 0.1557 to 0.4491 , the mean error is about 0.302 , and the standard deviation is about 0.065 .

cs.CV↗

Generative Adversarial Network for Personalized Art Therapy in Melanoma Disease Management

Melanoma is the most lethal type of skin cancer. Patients are vulnerable to mental health illnesses which can reduce the effectiveness of the cancer treatment and the patients adherence to drug plans. It is crucial to preserve the mental health of patients while they are receiving treatment. However, current art therapy approaches are not personal and unique to the patient. We aim to provide a well-trained image style transfer model that can quickly generate unique art from personal dermoscopic melanoma images as an additional tool for art therapy in disease management of melanoma. Visual art appreciation as a common form of art therapy in disease management that measurably reduces the degree of psychological distress. We developed a network based on the cycle-consistent generative adversarial network for style transfer that generates personalized and unique artworks from dermoscopic melanoma images. We developed a model that converts melanoma images into unique flower-themed artworks that relate to the shape of the lesion and are therefore personal to the patient. Further, we altered the initial framework and made comparisons and evaluations of the results. With this, we increased the options in the toolbox for art therapy in disease management of melanoma. The development of an easy-to-use user interface ensures the availability of the approach to stakeholders. The transformation of melanoma into flower-themed artworks is achieved by the proposed model and the graphical user interface. This contribution opens a new field of GANs in art therapy and could lead to more personalized disease management.

eess.IV↗

Joint Optimization of Relay Selection and Transmission Scheduling for UAV-Aided mmWave Vehicular Networks

To deal with the explosive growth of mobile traffic, millimeter-wave (mmWave) communications with abundant bandwidth resources have been applied to vehicular networks. As mmWave signal is sensitive to blockage, we introduce the unmanned aerial vehicle (UAV)-aided two-way relaying system for vehicular connection enhancement and coverage expansion. How to improve transmission efficiency and to reduce latency time in such a dynamic scenario is a challenging problem. In this paper, we formulate the joint optimization problem of relay selection and transmission scheduling, aiming to reduce transmission time while meeting the throughput requirements. To solve this problem, two schemes are proposed. The first one is the random relay selection with concurrent scheduling (RCS), a low-complexity algorithm implemented in two steps. The second one is the joint relay selection with dynamic scheduling (JRDS), which fully avoids relay contentions and exploits potential concurrent ability, to obtain further performance enhancement over RCS. Through extensive simulations under different environments with various flow numbers and vehicle speeds, we demonstrate that both RCS and JRDS schemes outperform the existing schemes significantly in terms of transmission time and network throughput. We also analyze the impact of threshold selection on achievable performance.

cs.IT↗

Smaller Is Bigger: Rethinking the Embedding Rate of Deep Hiding

Deep hiding, concealing secret information using Deep Neural Networks (DNNs), can significantly increase the embedding rate and improve the efficiency of secret sharing. Existing works mainly force on designing DNNs with higher embedding rates or fancy functionalities. In this paper, we want to answer some fundamental questions: how to increase and what determines the embedding rate of deep hiding. To this end, we first propose a novel Local Deep Hiding (LDH) scheme that significantly increases the embedding rate by hiding large secret images into small local regions of cover images. Our scheme consists of three DNNs: hiding, locating, and revealing. We use the hiding network to convert a secret image in a small imperceptible compact secret code that is embedded into a random local region of a cover image. The locating network assists the revealing process by identifying the position of secret codes in the stego image, while the revealing network recovers all full-size secret images from these identified local regions. Our LDH achieves an extremely high embedding rate, i.e., $16\times24$ bpp and exhibits superior robustness to common image distortions. We also conduct comprehensive experiments to evaluate our scheme under various system settings. We further quantitatively analyze the trade-off between the embedding rate and image quality with different image restoration algorithms.

cs.MM↗

Reentry Risk and Safety Assessment of Spacecraft Debris Based on Machine Learning

Uncontrolled spacecraft will disintegrate and generate a large amount of debris in the reentry process, and ablative debris may cause potential risks to the safety of human life and property on the ground. Therefore, predicting the landing points of spacecraft debris and forecasting the degree of risk of debris to human life and property is very important. In view that it is difficult to predict the process of reentry process and the reentry point in advance, and the debris generated from reentry disintegration may cause ground damage for the uncontrolled space vehicle on expiration of service. In this paper, we adopt the object-oriented approach to consider the spacecraft and its disintegrated components as consisting of simple basic geometric models, and introduce three machine learning models: the support vector regression (SVR), decision tree regression (DTR) and multilayer perceptron (MLP) to predict the velocity, longitude and latitude of spacecraft debris landing points for the first time. Then, we compare the prediction accuracy of the three models. Furthermore, we define the reentry risk and the degree of danger, and we calculate the risk level for each spacecraft debris and make warnings accordingly. The experimental results show that the proposed method can obtain high accuracy prediction results in at least 15 seconds and make safety level warning more real-time.

cs.LG↗

Quantum solid phase and Coulomb drag in two-dimensional electron-electron bilayers of MoS2

Coulomb drag experiments can give us information about the interaction state of double-layer systems. Here, we demonstrate anomalous Coulomb drag behaviours in a two-dimensional electron-electron bilayer system constructed by stacking atomically thin MoS2 on opposite sides of thin dielectric layers of boron nitride. In the low temperature regime, the measured drag resistance does not follow the behaviour predicted by the Coulomb drag models of exchanging momenta and energies with the particles in Fermi-liquid bilayer systems. Instead, it shows an upturn to higher and higher values. We investigate quantum solid/fluid phases and the Kosterlitz-Thouless/Wigner two-dimensional quantum melting transition in this bilayer system and describe this interesting phenomenon based on thermally activated carriers of quantum defects from the formation of the correlation-induced electron solid phases with enhanced stabilization by the potential due to the boron nitride dielectric layers.

cond-mat.mes-hall↗

Comparing Psychometric and Behavioral Predictors of Compliance During Human-AI Interactions

Optimization of human-AI teams hinges on the AI's ability to tailor its interaction to individual human teammates. A common hypothesis in adaptive AI research is that minor differences in people's predisposition to trust can significantly impact their likelihood of complying with recommendations from the AI. Predisposition to trust is often measured with self-report inventories that are administered before interactions. We benchmark a popular measure of this kind against behavioral predictors of compliance. We find that the inventory is a less effective predictor of compliance than the behavioral measures in datasets taken from three previous research projects. This suggests a general property that individual differences in initial behavior are more predictive than differences in self-reported trust attitudes. This result also shows a potential for easily accessible behavioral measures to provide an AI with more accurate models without the use of (often costly) survey instruments.

cs.HC↗

My Actions Speak Louder Than Your Words: When User Behavior Predicts Their Beliefs about Agents' Attributes

An implicit expectation of asking users to rate agents, such as an AI decision-aid, is that they will use only relevant information -- ask them about an agent's benevolence, and they should consider whether or not it was kind. Behavioral science, however, suggests that people sometimes use irrelevant information. We identify an instance of this phenomenon, where users who experience better outcomes in a human-agent interaction systematically rated the agent as having better abilities, being more benevolent, and exhibiting greater integrity in a post hoc assessment than users who experienced worse outcome -- which were the result of their own behavior -- with the same agent. Our analyses suggest the need for augmentation of models so that they account for such biased perceptions as well as mechanisms so that agents can detect and even actively work to correct this and similar biases of users.

cs.HC↗