arXiv subjects

Heng Zhang

Publications and source records attributed to Heng Zhang.

At least 181 records · Page 10Linked to original sources

arXiv2023

Magnetic kagome materials RETi3Bi4 family with weak interlayer interactions

Kagome materials have attracted a surge of research interest recently, especially for the ones combining with magnetism, and the ones with weak interlayer interactions which can fabricate thin devices. However, kagome materials combining both characters of magnetism and weak interlayer interactions are rare. Here we investigate a new family of titanium based kagome materials RETi3Bi4 (RE = Eu, Gd and Sm). The flakes of nanometer thickness of RETi3Bi4 can be obtained by exfoliation due to the weak interlayer interactions. According to magnetic measurements, out-of-plane ferromagnetism, out-of-plane anti-ferromagnetism, and in-plane ferromagnetism are formed for RE = Eu, Gd, and Sm respectively. The magnetic orders are simple and the saturation magnetizations can be relatively large since the rare earth elements solely provide the magnetic moments. Further by angle-resolved photoemission spectroscopy (ARPES) and first-principles calculations, the electronic structures of RETi3Bi4 are investigated. The ARPES results are consistent with the calculations, indicating the bands characteristic with kagome sublattice in RETi3Bi4. We expect these materials to be promising candidates for observation of the exotic magnetic topological phases and the related topological quantum transport studies.

cond-mat.mtrl-sci↗

arXiv2023

Fine-grained Spatio-Temporal Distribution Prediction of Mobile Content Delivery in 5G Ultra-Dense Networks

The 5G networks have extensively promoted the growth of mobile users and novel applications, and with the skyrocketing user requests for a large amount of popular content, the consequent content delivery services (CDSs) have been bringing a heavy load to mobile service providers. As a key mission in intelligent networks management, understanding and predicting the distribution of CDSs benefits many tasks of modern network services such as resource provisioning and proactive content caching for content delivery networks. However, the revolutions in novel ubiquitous network architectures led by ultra-dense networks (UDNs) make the task extremely challenging. Specifically, conventional methods face the challenges of insufficient spatio precision, lacking generalizability, and complex multi-feature dependencies of user requests, making their effectiveness unreliable in CDSs prediction under 5G UDNs. In this paper, we propose to adopt a series of encoding and sampling methods to model CDSs of known and unknown areas at a tailored fine-grained level. Moreover, we design a spatio-temporal-social multi-feature extraction framework for CDSs hotspots prediction, in which a novel edge-enhanced graph convolution block is proposed to encode dynamic CDSs networks based on the social relationships and the spatio features. Besides, we introduce the Long-Short Term Memory (LSTM) to further capture the temporal dependency. Extensive performance evaluations with real-world measurement data collected in two mobile content applications demonstrate the effectiveness of our proposed solution, which can improve the prediction area under the curve (AUC) by 40.5% compared to the state-of-the-art proposals at a spatio granularity of 76m, with up to 80% of the unknown areas.

cs.NI↗

arXiv2023

Refining 6-DoF Grasps with Context-Specific Classifiers

In this work, we present GraspFlow, a refinement approach for generating context-specific grasps. We formulate the problem of grasp synthesis as a sampling problem: we seek to sample from a context-conditioned probability distribution of successful grasps. However, this target distribution is unknown. As a solution, we devise a discriminator gradient-flow method to evolve grasps obtained from a simpler distribution in a manner that mimics sampling from the desired target distribution. Unlike existing approaches, GraspFlow is modular, allowing grasps that satisfy multiple criteria to be obtained simply by incorporating the relevant discriminators. It is also simple to implement, requiring minimal code given existing auto-differentiation libraries and suitable discriminators. Experiments show that GraspFlow generates stable and executable grasps on a real-world Panda robot for a diverse range of objects. In particular, in 60 trials on 20 different household objects, the first attempted grasp was successful 94% of the time, and 100% grasp success was achieved by the second grasp. Moreover, incorporating a functional discriminator for robot-human handover improved the functional aspect of the grasp by up to 33%.

cs.RO↗

arXiv2023

A Survey on Reservoir Computing and its Interdisciplinary Applications Beyond Traditional Machine Learning

Reservoir computing (RC), first applied to temporal signal processing, is a recurrent neural network in which neurons are randomly connected. Once initialized, the connection strengths remain unchanged. Such a simple structure turns RC into a non-linear dynamical system that maps low-dimensional inputs into a high-dimensional space. The model's rich dynamics, linear separability, and memory capacity then enable a simple linear readout to generate adequate responses for various applications. RC spans areas far beyond machine learning, since it has been shown that the complex dynamics can be realized in various physical hardware implementations and biological devices. This yields greater flexibility and shorter computation time. Moreover, the neuronal responses triggered by the model's dynamics shed light on understanding brain mechanisms that also exploit similar dynamical processes. While the literature on RC is vast and fragmented, here we conduct a unified review of RC's recent developments from machine learning to physics, biology, and neuroscience. We first review the early RC models, and then survey the state-of-the-art models and their applications. We further introduce studies on modeling the brain's mechanisms by RC. Finally, we offer new perspectives on RC development, including reservoir design, coding frameworks unification, physical RC implementations, and interaction between RC, cognitive neuroscience and evolution.

cs.NE↗

arXiv2023

One for All: Unified Workload Prediction for Dynamic Multi-tenant Edge Cloud Platforms

Workload prediction in multi-tenant edge cloud platforms (MT-ECP) is vital for efficient application deployment and resource provisioning. However, the heterogeneous application patterns, variable infrastructure performance, and frequent deployments in MT-ECP pose significant challenges for accurate and efficient workload prediction. Clustering-based methods for dynamic MT-ECP modeling often incur excessive costs due to the need to maintain numerous data clusters and models, which leads to excessive costs. Existing end-to-end time series prediction methods are challenging to provide consistent prediction performance in dynamic MT-ECP. In this paper, we propose an end-to-end framework with global pooling and static content awareness, DynEformer, to provide a unified workload prediction scheme for dynamic MT-ECP. Meticulously designed global pooling and information merging mechanisms can effectively identify and utilize global application patterns to drive local workload predictions. The integration of static content-aware mechanisms enhances model robustness in real-world scenarios. Through experiments on five real-world datasets, DynEformer achieved state-of-the-art in the dynamic scene of MT-ECP and provided a unified end-to-end prediction scheme for MT-ECP.

cs.NI↗

arXiv2023

Strong substrate influence on atomic structure and properties of epitaxial VO2 thin films

The metal-insulator transition (MIT) observed in vanadium dioxide (VO2) has been a topic of great research interest for past decades, with the underlying physics yet not fully understood due to the complex electron interactions and structures involved. The ability to understand and tune the MIT behaviour is of vital importance from the perspective of both underlying fundamental science as well as potential applications. In this work, we use scanning transmission electron microscopy (STEM) to investigate cross-section lamella of the VO2 films deposited using pulsed laser deposition (PLD) on three substrates: c-cut sapphire, TiO2(101) and TiO2(001). Advanced STEM imaging is performed in which also the oxygen atom columns are resolved. We link the overall film quality and structures on atomic and nanoscale to the electrical transition characteristics. We observe poor MIT characteristics on c-sapphire due to the presence of very small domains with six orientation variants, and on TiO2 (001) due to the presence of cracks induced by stress relaxation. However, the MIT on TiO2 (101) behaves favourably, despite similar stress relaxation which, however, only lead to domain boundaries but no cracks.

cond-mat.mtrl-sci↗

arXiv2023

Hierarchical Dialogue Understanding with Special Tokens and Turn-level Attention

Compared with standard text, understanding dialogue is more challenging for machines as the dynamic and unexpected semantic changes in each turn. To model such inconsistent semantics, we propose a simple but effective Hierarchical Dialogue Understanding model, HiDialog. Specifically, we first insert multiple special tokens into a dialogue and propose the turn-level attention to learn turn embeddings hierarchically. Then, a heterogeneous graph module is leveraged to polish the learned embeddings. We evaluate our model on various dialogue understanding tasks including dialogue relation extraction, dialogue emotion recognition, and dialogue act classification. Results show that our simple approach achieves state-of-the-art performance on all three tasks above. All our source code is publicly available at https://github.com/ShawX825/HiDialog.

cs.CL↗

arXiv2023

Electronic properties of 2{\it H}-stacking bilayer MoS$_2$ measured by terahertz time-domain spectroscopy

Bilayer (BL) molybdenum disulfide (MoS$_2$) is one of the most important electronic structures not only in valleytronics but also in realizing twistronic systems on the basis of the topological mosaics in Moiré superlattices. In this work, BL MoS$_2$ on sapphire substrate with 2$H$-stacking structure is fabricated. We apply the terahertz (THz) time-domain spectroscopy (TDS) for examining the basic optoelectronic properties of this kind of BL MoS$_2$. The optical conductivity of BL MoS$_2$ is obtained in temperature regime from 80 to 280 K. Through fitting the experimental data with the theoretical formula, the key sample parameters of BL MoS$_2$ can be determined, such as the electron density, the electronic relaxation time and the electronic localization factor. The temperature dependence of these parameters is examined and analyzed. We find that, similar to monolayer (ML) MoS$_2$, BL MoS$_2$ with 2$H$-stacking can respond strongly to THz radiation field and show semiconductor-like optoelectronic features. The theoretical calculations using density functional theory (DFT) can help us to further understand why the THz optoelectronic properties of BL MoS$_2$ differ from those observed for ML MoS$_2$. The results obtained from this study indicate that the THz TDS can be applied suitably to study the optoelectronic properties of BL MoS$_2$ based twistronic systems for novel applications as optical and optoelectronic materials and devices.

cond-mat.mtrl-sci↗

arXiv2023

Dynamical Equations With Bottom-up Self-Organizing Properties Learn Accurate Dynamical Hierarchies Without Any Loss Function

Self-organization is ubiquitous in nature and mind. However, machine learning and theories of cognition still barely touch the subject. The hurdle is that general patterns are difficult to define in terms of dynamical equations and designing a system that could learn by reordering itself is still to be seen. Here, we propose a learning system, where patterns are defined within the realm of nonlinear dynamics with positive and negative feedback loops, allowing attractor-repeller pairs to emerge for each pattern observed. Experiments reveal that such a system can map temporal to spatial correlation, enabling hierarchical structures to be learned from sequential data. The results are accurate enough to surpass state-of-the-art unsupervised learning algorithms in seven out of eight experiments as well as two real-world problems. Interestingly, the dynamic nature of the system makes it inherently adaptive, giving rise to phenomena similar to phase transitions in chemistry/thermodynamics when the input structure changes. Thus, the work here sheds light on how self-organization can allow for pattern recognition and hints at how intelligent behavior might emerge from simple dynamic equations without any objective/loss function.

cs.AI↗

arXiv2023

Joint Optimization of Video-based AI Inference Tasks in MEC-assisted Augmented Reality Systems

The high computational complexity and energy consumption of artificial intelligence (AI) algorithms hinder their application in augmented reality (AR) systems. However, mobile edge computing (MEC) makes it possible to solve this problem. This paper considers the scene of completing video-based AI inference tasks in the MEC system. We formulate a mixed-integer nonlinear programming problem (MINLP) to reduce inference delays, energy consumption and to improve recognition accuracy. We give a simplified expression of the inference complexity model and accuracy model through derivation and experimentation. The problem is then solved iteratively by using alternating optimization. Specifically, by assuming that the offloading decision is given, the problem is decoupled into two sub-problems, i.e., the resource allocation problem for the devices set that completes the inference tasks locally, and that for the devices set that offloads tasks. For the problem of offloading decision optimization, we propose a Channel-Aware heuristic algorithm. To further reduce the complexity, we propose an alternating direction method of multipliers (ADMM) based distributed algorithm. The ADMM-based algorithm has a low computational complexity that grows linearly with the number of devices. Numerical experiments show the effectiveness of proposed algorithms. The trade-off relationship between delay, energy consumption, and accuracy is also analyzed.

cs.NI↗

arXiv2022

Zeroth-Order Stochastic Coordinate Methods for Decentralized Non-convex Optimization

In this letter, we first propose a \underline{Z}eroth-\underline{O}rder c\underline{O}ordinate \underline{M}ethod~(ZOOM) to solve the stochastic optimization problem over a decentralized network with only zeroth-order~(ZO) oracle feedback available. Moreover, we equip a simple mechanism "powerball" to ZOOM and propose ZOOM-PB to accelerate the convergence of ZOOM. Compared with the existing methods, we verify the proposed algorithms through two benchmark examples in the literature, namely the black-box binary classification and the generating adversarial examples from black-box DNNs in order to compare with the existing state-of-the-art centralized and distributed ZO algorithms. The numerical results demonstrate a faster convergence rate of the proposed algorithms.

math.OC↗

arXiv2022

Adaptive dynamic programming-based algorithm for infinite-horizon linear quadratic stochastic optimal control problems

This paper investigates an infinite-horizon linear quadratic stochastic (LQS) optimal control problem for a class of continuous-time stochastic systems. By employing the technique of adaptive dynamic programming (ADP), we propose a novel model-free policy iteration (PI) algorithm. Without needing all information of the system coefficient matrices, the proposed PI algorithm iterates by using the data of the input and system state collected on a fixed time interval. Finally, a numerical example is presented to demonstrate the feasibility of the obtained algorithm.

math.OC↗

arXiv2022

A Novel Graph-based Motion Planner of Multi-Mobile Robot Systems with Formation and Obstacle Constraints

Multi-mobile robot systems show great advantages over one single robot in many applications. However, the robots are required to form desired task-specified formations, making feasible motions decrease significantly. Thus, it is challenging to determine whether the robots can pass through an obstructed environment under formation constraints, especially in an obstacle-rich environment. Furthermore, is there an optimal path for the robots? To deal with the two problems, a novel graphbased motion planner is proposed in this paper. A mapping between workspace and configuration space of multi-mobile robot systems is first built, where valid configurations can be acquired to satisfy both formation constraints and collision avoidance. Then, an undirected graph is generated by verifying connectivity between valid configurations. The breadth-first search method is employed to answer the question of whether there is a feasible path on the graph. Finally, an optimal path will be planned on the updated graph, considering the cost of path length and formation preference. Simulation results show that the planner can be applied to get optimal motions of robots under formation constraints in obstacle-rich environments. Additionally, different constraints are considered.

cs.RO↗

arXiv2022

Data-driven policy iteration algorithm for continuous-time stochastic linear-quadratic optimal control problems

This paper studies a continuous-time stochastic linear-quadratic (SLQ) optimal control problem on infinite-horizon. A data-driven policy iteration algorithm is proposed to solve the SLQ problem. Without knowing three system coefficient matrices, this algorithm uses the collected data to iteratively approximate a solution of the corresponding stochastic algebraic Riccati equation (SARE). A simulation example is provided to illustrate the effectiveness and applicability of the algorithm.

math.OC↗

arXiv2022

A multi-chain synchronization protocol that leverage zero knowledge proof to minimize communication trust base

Delphinus cross-chain aggregator is a universal firmware which synchronise states between different smart contracts on different block-chains. In the world of block-chains, synchronization challenges are two-folded. Firstly, contracts from different main block-chain can not communicate with each other which makes it hard to establish a trustworthy communication channel for them to share and maintain a universal state between each other. Secondly, transactions on different block-chains can hardly be ordered thus conflicts are common and we need a novel way to avoid and handle these conflicts. Delphinus cross-chain aggregator is a ZKSNARK based multi-block-chain layer on top of which rich cross chain applications can run safely and efficiently.

cs.NI↗

arXiv2022

Adaptive incomplete multi-view learning via tensor graph completion

With the advancement of the data acquisition techniques, multi-view learning has become a hot topic. Some multi-view learning methods assume that the multi-view data is complete, which means that all instances are present, but this too ideal. Certain tensor-based methods for handing incomplete multi-view data have emerged and have achieved better result. However, there are still some problems, such as use of traditional tensor norm which makes the computation high and is not able to handle out-of-sample. To solve these two problems, we proposed a new incomplete multi view learning method. A new tensor norm is defined to implement graph tensor data recover. The recovered graphs are then regularized to a consistent low-dimensional representation of the samples. In addition, adaptive weights are equipped to each view to adjust the importance of different views. Compared with the existing methods, our method nor only explores the consistency among views, but also obtains the low-dimensional representation of the new samples by using the learned projection matrix. An efficient algorithm based on inexact augmented Lagrange multiplier (ALM) method are designed to solve the model and convergence is proved. Experimental results on four datasets show the effectiveness of our method.

cs.LG↗

arXiv2022

Prediction-based Hybrid Slicing Framework for Service Level Agreement Guarantee in Mobility Scenarios: A Deep Learning Approach

Network slicing is a critical driver for guaranteeing the diverse service level agreements (SLA) in 5G and future networks. Inter-slice radio resource allocation (IS-RRA) in the radio access network (RAN) is very important. However, user mobility brings new challenges for optimal IS-RRA. This paper first proposes a soft and hard hybrid slicing framework where a common slice is introduced to realize a trade-off between isolation and spectrum efficiency (SE). To address the challenges posed by user mobility, we propose a two-step deep learning-based algorithm: joint long short-term memory (LSTM)-based network state prediction and deep Q network (DQN)-based slicing strategy. In the proposal, LSTM networks are employed to predict traffic demand and the location of each user in a slicing window level. Moreover, channel gain is mapped by location and a radio map. Then, the predicted channel gain and traffic demand are input to the DQN to output the precise slicing adjustment. Finally, experiment results confirm the effectiveness of our proposed slicing framework: the slices' SLA can be guaranteed well, and the proposed algorithm can achieve near-optimal performance in terms of the SLA satisfaction ratio, isolation degree and SE.

eess.SY↗

arXiv2022

Joint Optimization of DNN Inference Delay and Energy under Accuracy Constraints for AR Applications

The high computational complexity and high energy consumption of artificial intelligence (AI) algorithms hinder their application in augmented reality (AR) systems. This paper considers the scene of completing video-based AI inference tasks in the mobile edge computing (MEC) system. We use multiply-and-accumulate operations (MACs) for problem analysis and optimize delay and energy consumption under accuracy constraints. To solve this problem, we first assume that offloading policy is known and decouple the problem into two subproblems. After solving these two subproblems, we propose an iterative-based scheduling algorithm to obtain the optimal offloading policy. We also experimentally discuss the relationship between delay, energy consumption, and inference accuracy.

eess.SY↗