Searcharxiv⌕ Search

arXiv subjects

Zheng Dong

Publications and source records attributed to Zheng Dong.

At least 73 records · Page 4Linked to original sources

Location-aware Single Image Reflection Removal

This paper proposes a novel location-aware deep-learning-based single image reflection removal method. Our network has a reflection detection module to regress a probabilistic reflection confidence map, taking multi-scale Laplacian features as inputs. This probabilistic map tells if a region is reflection-dominated or transmission-dominated, and it is used as a cue for the network to control the feature flow when predicting the reflection and transmission layers. We design our network as a recurrent network to progressively refine reflection removal results at each iteration. The novelty is that we leverage Laplacian kernel parameters to emphasize the boundaries of strong reflections. It is beneficial to strong reflection detection and substantially improves the quality of reflection removal results. Extensive experiments verify the superior performance of the proposed method over state-of-the-art approaches. Our code and the pre-trained model can be found at https://github.com/zdlarr/Location-aware-SIRR.

cs.CV↗

Butterfly-Core Community Search over Labeled Graphs

Community search aims at finding densely connected subgraphs for query vertices in a graph. While this task has been studied widely in the literature, most of the existing works only focus on finding homogeneous communities rather than heterogeneous communities with different labels. In this paper, we motivate a new problem of cross-group community search, namely Butterfly-Core Community (BCC), over a labeled graph, where each vertex has a label indicating its properties and an edge between two vertices indicates their cross relationship. Specifically, for two query vertices with different labels, we aim to find a densely connected cross community that contains two query vertices and consists of butterfly networks, where each wing of the butterflies is induced by a k-core search based on one query vertex and two wings are connected by these butterflies. Indeed, the BCC structure admits the structure cohesiveness and minimum diameter, and thus can effectively capture the heterogeneous and concise collaborative team. Moreover, we theoretically prove this problem is NP-hard and analyze its non-approximability. To efficiently tackle the problem, we develop a heuristic algorithm, which first finds a BCC containing the query vertices, then iteratively removes the farthest vertices to the query vertices from the graph. The algorithm can achieve a 2-approximation to the optimal solution. To further improve the efficiency, we design a butterfly-core index and develop a suite of efficient algorithms for butterfly-core identification and maintenance as vertices are eliminated. Extensive experiments on eight real-world networks and four novel case studies validate the effectiveness and efficiency of our algorithms.

cs.SI↗

Time-constrained Adaptive Influence Maximization

The well-known influence maximization problem aims at maximizing the influence of one information cascade in a social network by selecting appropriate seed users prior to the diffusion process. In its adaptive version, additional seed users can be selected after observing certain diffusion results. On the other hand, social computing tasks are often time-critical, and therefore only the influence resulted in the early period is worthwhile, which can be naturally modeled by enforcing a time constraint. In this paper, we present an analysis of the time-constrained adaptive influence maximization problem. We show that the new problem is combinatorially different from the existing problems, and the current techniques such as submodular maximization and adaptive submodularity are unfortunately inapplicable. On the theory side, we provide the hardness results of computing the optimal policy and a lower bound on the adaptive gap. For practical solutions, from basic to advanced, we design a series of seeding policies for achieving high efficacy and scalability. Finally, we investigate the proposed solutions through extensive simulations based on real-world datasets.

cs.SI↗

Multiuser Scheduling for Minimizing Age of Information in Uplink MIMO Systems

This paper studies the user scheduling problem in a multiuser multiple-input multi-output (MIMO) status update system, in which multiple single-antenna devices aim to send their latest statuses to a multiple-antenna information-fusion access point (AP) via a shared wireless channel. The information freshness in the considered system is quantified by a recently proposed metric, termed age of information (AoI). Thanks to the extra spatial degrees-of-freedom brought about by the multiple antennas at the AP, multiple devices can be granted to transmit simultaneously in each time slot. We aim to seek the optimal scheduling policy that can minimize the network-wide AoI by optimally deciding which device or group of devices to be scheduled for transmission in each slot given the instantaneous AoI values of all devices at the beginning of the slot. To that end, we formulate the multiuser scheduling problem as a Markov decision process (MDP). We attain the optimal policy by resolving the formulated MDP problem and develop a low-complexity sub-optimal policy. Simulation results show that the proposed optimal and sub-optimal policies significantly outperform the state-of-the-art benchmark schemes.

cs.IT↗

WatchDog: Real-time Vehicle Tracking on Geo-distributed Edge Nodes

Vehicle tracking, a core application to smart city video analytics, is becoming more widely deployed than ever before thanks to the increasing number of traffic cameras and recent advances of computer vision and machine learning. Due to the constraints of bandwidth, latency, and privacy concerns, tracking tasks are more preferable to run on edge devices sitting close to the cameras. However, edge devices are provisioned with a fixed amount of compute budget, making them incompetent to adapt to time-varying tracking workloads caused by traffic dynamics. In coping with this challenge, we propose WatchDog, a real-time vehicle tracking system fully utilizes edge nodes across the road network. WatchDog leverages computer vision tasks with different resource-accuracy trade-offs, and decompose and schedule tracking tasks judiciously across edge devices based on the current workload to maximize the number of tasks while ensuring a provable response time bound at each edge device. Extensive evaluations have been conducted using real-world city-wide vehicle trajectory datasets, showing a 100% tracking coverage with real-time guarantee.

cs.DC↗

Design of Non-orthogonal and Noncoherent Massive MIMO for Scalable URLLC Beyond 5G

This paper is to design and optimize a non-orthogonal and noncoherent massive multiple-input multiple-output (MIMO) framework towards enabling scalable ultra-reliable low-latency communications (sURLLC) in wireless systems beyond 5G. In this framework, the huge diversity gain associated with the large-scale antenna array in massive MIMO systems is leveraged to ensure ultrahigh reliability. To reduce the overhead and latency induced by the channel estimation process, we advocate the noncoherent communication technique which does not need the knowledge of instantaneous channel state information (CSI) but only depends on the large-scale fading coefficients for information decoding. To boost the scalability of the system considered, we enable the non-orthogonal channel access of multiple users by devising a new differential modulation scheme to assure that each transmitted signal matrix can be uniquely determined in the noise-free case and be reliably estimated in noisy cases when the antenna array size is scaled up. The key idea is to make the transmitted signals from multiple users be superimposed properly over the air such that when the sum-signal is correctly detected, the signals sent by all users can be uniquely determined. To further improve the average error performance when the array antenna number is large, we propose a max-min Kullback-Leibler (KL) divergence-based design by jointly optimizing the transmitted powers of all users and the sub-constellation assignment among them. Simulation results show that the proposed design significantly outperforms the existing max-min Euclidean distance-based counterpart in terms of error performance. Moreover, our proposed approach also has a better error performance than the conventional coherent zero-forcing (ZF) receiver with orthogonal channel training, particularly for cell-edge users.

eess.SP↗

Signal Design for AF Relay Systems using Superposition Coding and Finite-Alphabet Inputs

This paper focuses on the signal design in a Gaussian amplify-and-forward (AF) relay system with superposition coding (SC) being applied at the relay, which allows the source and relay to transmit their own information within two time slots. Practical quadrature amplitude modulation (QAM) constellations are adopted at the source and relay. To improve the system error performance, we optimize the weight coefficients adopted at the source and relay to maximize the minimum Euclidean distance of the received composite constellation, subject to their individual average power constraints. The formulated optimization problem is shown to be a mixed continuous-discrete one that is non-trivial to resolve in general. By resorting to the punched Farey sequence, we manage to obtain the optimal solution to the formulated problem by first partitioning the entire feasible region into a finite number of sub-intervals and then taking the maximum over all the possible sub-intervals. Simulation results are provided to demonstrate the superior performance of our proposed design based on SC over that using conventional time division multiple access (TDMA).

eess.SP↗

On Multi-Cascade Influence Maximization: Model, Hardness and Algorithmic Framework

This paper studies the multi-cascade influence maximization problem, which explores strategies for launching one information cascade in a social network with multiple existing cascades. With natural extensions to the classic models, we first propose the independent multi-cascade model where the diffusion process is governed by the so-called activation function. We show that the proposed model is sufficiently flexible as it generalizes most of the existing cascade-based models. We then study the multi-cascade influence maximization problem under the designed model and provide approximation hardness under common complexity assumptions, namely Exponential Time Hypothesis and $NP \subseteq DTIME(n^{\poly \log n})$. Given the hardness results, we build a framework for designing heuristic seed selection algorithms with a testable data-dependent approximation ratio. The designed algorithm leverages upper and lower bounds, which reveal the key combinatorial structure behind the multi-cascade influence maximization problem. The performance of the framework is theoretically analyzed and practically evaluated through extensive simulations. The superiority of the proposed solution is supported by encouraging experimental results, in terms of effectiveness and efficiency.

cs.SI↗

Online terrain estimation for autonomous vehicles on deformable terrains

In this work, a terrain estimation framework is developed for autonomous vehicles operating on deformable terrains. Previous work in this area usually relies on steady state tire operation, linearized classical terramechanics models, or on computationally expensive algorithms that are not suitable for real-time estimation. To address these shortcomings, this work develops a reduced-order nonlinear terramechanics model as a surrogate of the Soil Contact Model (SCM) through extending a state-of-the-art Bekker model to account for additional dynamic effects. It is shown that this reduced-order surrogate model is able to accurately replicate the forces predicted by the SCM while reducing the computation cost by an order of magnitude. This surrogate model is then utilized in a unscented Kalman filter to estimate the sinkage exponent. Simulations suggest this parameter can be estimated within 4% of its true value for clay and sandy loam terrains. It is also shown that utilizing this estimated parameter can reduce the prediction errors of the future vehicle states by orders of magnitude, which could assist with achieving more robust model-predictive autonomous navigation strategies.

eess.SY↗

Noncoherent Multiuser Massive SIMO for Low-Latency Industrial IoT Communications

In this paper, we consider a multiuser massive single-input multiple-output (SIMO) enabled Industrial Internet of Things (IIoT) communication system. To reduce the latency and overhead caused by channel estimation, we assume that only the large-scale fading coefficients are available. We employ a noncoherent maximum-likelihood (ML) detector at the receiver side which does not need the instantaneous channel state information (CSI). For such a massive SIMO system, we present a new design framework to assure that each transmitted signal matrix can be uniquely determined in the noise-free case and be reliably estimated in noisy cases. The key idea is to utilize a new concept called the uniquely decomposable constellation group (UDCG) based on the practically used quadrature amplitude modulation~(QAM) constellation. To improve the average error performance when the antenna array size is scaled up, we propose a max-min Kullback-Leibler (KL) distance design by carrying out optimization over the transmitted power and the sub-constellation assignment. Finally, simulation results show that the proposed design outperforms significantly the existing max-min Euclidean distance based method in terms of error performance. Moreover, our proposed approach also has a better error performance than the conventional coherent zero-forcing (ZF) receiver with orthogonal training for cell edge users.

cs.IT↗

Noncoherent and Non-orthogonal Massive SIMO for Critical Industrial IoT Communications

Towards the realization of ultra-reliable low-latency wireless communications required in critical industrial Internet of Things (IIoT) applications, this paper presents a new noncoherent and non-orthogonal massive single-input multiple-output (SIMO) framework, in which a large number of antennas are deployed to provide high spatial diversity so as to enable ultra-reliable communications, and noncoherent transmission and non-orthogonal multiple access techniques are applied to effectively reduce the latency at the physical and data link layers, respectively. A two-user IIoT system is considered to elaborate the key design principle of our framework, in which two controlled nodes (CNs) transmit their data to a common managing node (MN) on the same time-frequency resource block, and the MN implements the noncoherent maximum likelihood detector to recover the transmitted symbols of both CNs from the received sum signal. We analyze the error performance of the considered system and then minimize the system error probability by jointly designing the constellations of both CNs. Simulation results show that our design has lower error probability than existing designs.

cs.IT↗

Average SEP-Optimal Precoding for Correlated Massive MIMO with ZF Detection: An Asymptotic Analysis

This paper investigates the symbol error probability~(SEP) of point-to-point massive multiple-input multiple-output (MIMO) systems using equally likely PAM, PSK, and square QAM signallings in the presence of transmitter correlation. The receiver has perfect knowledge of the channel coefficients, while the transmitter only knows first- and second-order channel statistics. With a zero-forcing~(ZF) detector implemented at the receiver side, we design and derive closed-form expressions of the optimal precoders at the transmitter that minimizes the average SEP over channel statistics for various modulation schemes. We then unveil some nice structures on the resulting minimum average SEP expressions, which naturally motivate us to explore the use of two useful mathematical tools to systematically study their asymptotic behaviors. The first tool is the Szegö's theorem on large Hermitian Toeplitz matrices and the second tool is the well-known limit: $\lim_{x\to\infty}(1+1/x)^x=e$. The application of these two tools enables us to attain very simple expressions of the SEP limits as the number of the transmitter antennas goes to infinity. A major advantage of our asymptotic analysis is that the asymptotic SEP converges to the true SEP when the number of antennas is moderately large. As such, the obtained expressions can serve as effective SEP approximations for massive MIMO systems even when the number of antennas is not very large. For the widely used exponential correlation model, we derive closed-form expressions for the SEP limits of both optimally precoded and uniformly precoded systems. Extensive simulations are provided to demonstrate the effectiveness of our asymptotic analysis and compare the performance limit of optimally precoded and uniformly precoded systems.

cs.IT↗

A novel application of probabilistic teleportation: p-Rabin qubit-oblivious transfer

All existing quantum oblivious transfer protocols are to realize the oblivious transfer of bit or bit-string. In this paper, p-Rabin quantum oblivious transfer of a qubit (abbr. p-Rabin qubit-OT) is achieved by using a probabilistic teleportation (abbr. PT) protocol. Here, this is the first time that the concept of qubit-OT is presented. As the PT protocol is able to transfer an (un)known pure state with a certain probability, this feature makes the PT protocol well fit for Rabin OT. Furthermore, the PT protocol can be used for OT of a bit by encoding classical bit with two pre-agreed orthogonal states. Finally, security analysis shows that the PT protocol can be against participants attacks, and what's more, the discussion of relationship with no-go theorem demonstrates that the PT protocol is able to evade the no-go theorem.

quant-ph↗

New Analysis Techniques for Supporting Hard Real-Time Sporadic DAG Task Systems on Multiprocessors

The scheduling and schedulability analysis of real-time directed acyclic graph (DAG) task systems have received much recent attention. The DAG model can accurately represent intra-task parallelim and precedence constraints existing in many application domains. Existing techniques show that analyzing the DAG model is fundamentally more challenging compared to the ordinary sporadic task model, due to the complex intra-DAG precedence constraints which may cause rather pessimistic schedulability loss. However,such increased loss is counter-intuitive because the DAG structure shall better exploit the parallelism provided by the multiprocessor platform. Our observation is that the intra-DAG precedence constraints, if not carefully considered by the scheduling algorithm, may cause very unpredictable execution behaviors of subtasks in a DAG and further cause pessimistic analysis. In this paper, we present a set of novel scheduling and analysis techniques for better supporting hard real-time sporadic DAG tasks on multiprocessors, through smartly defining and analyzing the execution order of subtasks in each DAG. Evaluation demonstrates that our developed utilization-based schedulability test is highly efficient, which dramatically improves schedulability of existing utilization-based tests by over 60% on average. Interestingly, when each DAG in the system is an ordinary sporadic task, our test becomes identical to the classical density test designed for the sporadic task model.

cs.OS↗

Uplink Non-Orthogonal Multiple Access with Finite-Alphabet Inputs

This paper focuses on the non-orthogonal multiple access (NOMA) design for a classical two-user multiple access channel (MAC) with finite-alphabet inputs. We consider practical quadrature amplitude modulation (QAM) constellations at both transmitters, the sizes of which are assumed to be not necessarily identical. We propose to maximize the minimum Euclidean distance of the received sum-constellation with a maximum likelihood (ML) detector by adjusting the scaling factors (i.e., instantaneous transmitted powers and phases) of both users. The formulated problem is a mixed continuous-discrete optimization problem, which is nontrivial to resolve in general. By carefully observing the structure of the objective function, we discover that Farey sequence can be applied to tackle the formulated problem. However, the existing Farey sequence is not applicable when the constellation sizes of the two users are not the same. Motivated by this, we define a new type of Farey sequence, termed punched Farey sequence. Based on this, we manage to achieve a closed-form optimal solution to the original problem by first dividing the entire feasible region into a finite number of Farey intervals and then taking the maximum over all the possible intervals. The resulting sum-constellation is proved to be a regular QAM constellation of a larger size. Moreover, the superiority of NOMA over time-division multiple access (TDMA) in terms of minimum Euclidean distance is rigorously proved. Furthermore, the optimal rate allocation among the two users is obtained in closed-form to further maximize the obtained minimum Euclidean distance of the received signal subject to a total rate constraint. Finally, simulation results are provided to verify our theoretical analysis and demonstrate the merits of the proposed NOMA over existing orthogonal and non-orthogonal designs.

cs.IT↗

On Non-Orthogonal Multiple Access with Finite-Alphabet Inputs in Z-Channels

This paper focuses on the design of non-orthogonal multiple access (NOMA) in a classical two-transmitter two-receiver Z-channel, wherein one transmitter sends information to its intended receiver from the direct link while the other transmitter sends information to both receivers from the direct and cross links. Unlike most existing designs using (continuous) Gaussian input distribution, we consider the practical finite-alphabet (i.e., discrete) inputs by assuming that the widely-used quadrature amplitude modulation (QAM) constellations are adopted by both transmitters. To balance the error performance of two receivers, we apply the max-min fairness design criterion in this paper. More specifically, we propose to jointly optimize the scaling factors at both transmitters, which control the minimum Euclidean distance of transmitting constellations, to maximize the smaller minimum Euclidean distance of two resulting constellations at the receivers, subject to an individual average power constraint at each transmitter. The formulated problem is a mixed continuous-discrete optimization problem and is thus intractable in general. By resorting to the Farey sequence, we manage to attain the closed-form expression for the optimal solution to the formulated problem. This is achieved by dividing the overall feasible region of the original optimization problem into a finite number of sub-intervals and deriving the optimal solution in each sub-interval. Through carefully observing the structure of the optimal solutions in all sub-intervals, we obtain compact and closed-form expressions for the optimal solutions to the original problem in three possible scenarios defined by the relative strength of the cross link. Simulation studies are provided to validate our analysis and demonstrate the merits of the proposed design over existing orthogonal or non-orthogonal schemes.

cs.IT↗

Quadrature Amplitude Modulation Division for Multiuser MISO Broadcast Channels

This paper considers a discrete-time multiuser multiple-input single-output (MISO) Gaussian broadcast channel~(BC), in which channel state information (CSI) is available at both the transmitter and the receivers. The flexible and explicit design of a uniquely decomposable constellation group (UDCG) is provided based on pulse amplitude modulation (PAM) and rectangular quadrature amplitude modulation (QAM) constellations. With this, a modulation division (MD) transmission scheme is developed for the MISO BC. The proposed MD scheme enables each receiver to uniquely and efficiently detect their desired signals from the superposition of mutually interfering cochannel signals in the absence of noise. In our design, the optimal transmitter beamforming problem is solved in a closed-form for two-user MISO BC using max-min fairness as a design criterion. Then, for a general case with more than two receivers, we develop a user-grouping-based beamforming scheme, where the grouping method, beamforming vector design and power allocation problems are addressed by using weighted max-min fairness. It is shown that our proposed approach has a lower probability of error compared with the zero-forcing (ZF) method when the Hermitian angle between the two channel vectors is small in a two-user case. In addition, simulation results also reveal that for the general channel model with more than two users, our user-grouping-based scheme significantly outperforms the ZF, time division (TD), minimum mean-square error (MMSE) and signal-to-leakage-and-noise ratio (SLNR) based techniques in moderate and high SNR regimes when the number of users approaches to the number of base station (BS) antennas and it degrades into the ZF scheme when the number of users is far less than the number of BS antennas in Rayleigh fading channels.

cs.IT↗

Touch-enabled Programming for the Lab of Things

Lab of Things (LoT, lab-of-things.com) is a research platform for interconnection, programming, and large scale deployment of devices and sensors. These devices and sensors can then be used for deployment of field studies in a variety of research areas including elderly care, energy management, and the like. LoT is built on top of HomeOS, a middle-ware component, making interconnection of a wide range of devices possible. LoT also provides cloud storage and remote monitoring capabilities. Traditionally programming on the LoT platform has been done using C# in Microsoft Visual Studio. While LoT programs developed on the .NET framework offer a rich set of functionality, writing programs on LoT can be challenging for developers who are not experienced with the technology involved. In this demonstration, we introduce an innovative programming approach on the LoT platform by building a Generic Application and creating corresponding libraries on the user-friendly TouchDevelop (touchdevelop.com) programming environment. As an example, we implemented the same functionality of the Lab of Things Alerts application using the new Generic App. In addition to a touch-enabled programming environment, the new approach also significantly saves time and effort developers have to devote when creating a customized Lab of Things application.

cs.PL↗