Searcharxiv⌕ Search

arXiv subjects

Hung Tran

Publications and source records attributed to Hung Tran.

At least 55 records · Page 3Linked to original sources
arXiv2020

Goal-driven Long-Term Trajectory Prediction

The prediction of humans' short-term trajectories has advanced significantly with the use of powerful sequential modeling and rich environment feature extraction. However, long-term prediction is still a major challenge for the current methods as the errors could accumulate along the way. Indeed, consistent and stable prediction far to the end of a trajectory inherently requires deeper analysis into the overall structure of that trajectory, which is related to the pedestrian's intention on the destination of the journey. In this work, we propose to model a hypothetical process that determines pedestrians' goals and the impact of such process on long-term future trajectories. We design Goal-driven Trajectory Prediction model - a dual-channel neural network that realizes such intuition. The two channels of the network take their dedicated roles and collaborate to generate future trajectories. Different than conventional goal-conditioned, planning-based methods, the model architecture is designed to generalize the patterns and work across different scenes with arbitrary geometrical and semantic structures. The model is shown to outperform the state-of-the-art in various settings, especially in large prediction horizons. This result is another evidence for the effectiveness of adaptive structured representation of visual and geometrical features in human behavior analysis.

cs.CV↗
arXiv2020

On the Morse Index with Constraints II: Applications

This is the second paper in our sequence. Here, we apply our abstract Morse index formulation developed in the previous paper to study several optimization set-ups with constraints, including type I or/and type II considerations. A common theme is that critical points belong to the family of capillary surfaces, defined by constant mean curvature and intersecting the ambient manifold at a fixed angle. In each case, we classify how the general index is related to the index with a constraint. For capillary surfaces in a Euclidean ball, we obtain an index estimate which recovers stability results of G. Wang and C. Xia and J. Gou and C. Xia as special cases. By considering a family of examples, we show that inequality is also sharp. Furthermore, we precisely determine indices with constraints for important examples such as the critical catenoid, round cylinders in a ball, and CMC surfaces with constant curvature in a sphere.

math.DG↗
arXiv2020

On the Morse Index with Constraints I: An Abstract Formulation

In this sequence, we first prove an abstract Morse index theorem in a Hilbert space modeling a variational problem with constraints. Then, our abstract formulation is applied to study several optimization setups including closed CMC hypersurfaces, capillary surfaces in a ball, and critical points of type-II partitioning. In this paper, we study the index and nullity of a symmetric bounded bilinear form in a Hilbert space. The main results determine precisely how these notions change when restricting to a subspace of a finite codimension.

math.DG↗
arXiv2020

Index Characterization for Free Boundary Minimal Surfaces

In this paper, we compute the Morse index for a free boundary minimal submanifold from data of two simpler problems. The first one is the corresponding problem with fixed boundary condition; and the second is associated with the Dirichlet-to-Neumann map for Jacobi fields. As an application, we show that the Morse index of a free boundary minimal annulus is equal to 4 if and only if it is the critical catenoid.

math.DG↗
arXiv2020

Simulating Population Protocols in Sub-Constant Time per Interaction

We consider the problem of efficiently simulating population protocols. In the population model, we are given a distributed system of $n$ agents modeled as identical finite-state machines. In each time step, a pair of agents is selected uniformly at random to interact. In an interaction, agents update their states according to a common transition function. We empirically and analytically analyze two classes of simulators for this model. First, we consider sequential simulators executing one interaction after the other. Key to the performance of these simulators is the data structure storing the agents' states. For our analysis, we consider plain arrays, binary search trees, and a novel Dynamic Alias Table data structure. Secondly, we consider batch processing to efficiently update the states of multiple independent agents in one step. For many protocols considered in literature, our simulator requires amortized sub-constant time per interaction and is fast in practice: given a fixed time budget, the implementation of our batched simulator is able to simulate population protocols several orders of magnitude larger compared to the sequential competitors, and can carry out $2^{50}$ interactions among the same number of agents in less than 400s.

cs.DS↗
arXiv2020

On the variation of curvature functionals in space forms with application to a generalized Willmore energy

Functionals involving surface curvature are important across a range of scientific disciplines, and their extrema are representative of physically meaningful objects such as atomic lattices and biomembranes. Inspired in particular by the relationship of the Willmore energy to lipid bilayers, we consider a general functional depending on a surface and a symmetric combination of its principal curvatures, provided the surface is immersed in a 3-D space form. We compute the first and second variations of this functional, leading to expressions given entirely in terms of the surface fundamental forms. We then apply the stability criteria afforded by our calculations to a generalization of the Willmore functional, proving a result regarding the stability of spheres.

math.DG↗
arXiv2019

Einstein four-manifolds of pinched sectional curvature

In this paper, we obtain classification of four-dimensional Einstein manifolds with positive Ricci curvature and pinched sectional curvature. In particular, the first result concerns with an upper bound of sectional curvature, improving a theorem of E. Costa. The second is a generalization of D. Yang's result assuming an upper bound on the difference between sectional curvatures.

math.DG↗
arXiv2019

Four-manifolds of Pinched Sectional Curvature

In this paper, we study closed four-dimensional manifolds. In particular, we show that under various new pinching curvature conditions (for example, the sectional curvature is no more than 5/6 of the smallest Ricci eigenvalue) then the manifold is definite. If restricting to a metric with harmonic Weyl tensor, then it must be self-dual or anti-self-dual under the same conditions. Similarly, if restricting to an Einstein metric, then it must be either the complex projective space with its Fubini-Study metric, the round sphere or their quotients. Furthermore, we also classify Einstein manifolds with positive intersection form and an upper bound on the sectional curvature.

math.DG↗
arXiv2018

Parallel and I/O-efficient Randomisation of Massive Networks using Global Curveball Trades

Graph randomisation is a crucial task in the analysis and synthesis of networks. It is typically implemented as an edge switching process (ESMC) repeatedly swapping the nodes of random edge pairs while maintaining the degrees involved. Curveball is a novel approach that instead considers the whole neighbourhoods of randomly drawn node pairs. Its Markov chain converges to a uniform distribution, and experiments suggest that it requires less steps than the established ESMC. Since trades however are more expensive, we study Curveball's practical runtime by introducing the first efficient Curveball algorithms: the I/O-efficient EM-CB for simple undirected graphs and its internal memory pendant IM-CB. Further, we investigate global trades processing every node in a graph during a single super step, and show that undirected global trades converge to a uniform distribution and perform superior in practice. We then discuss EM-GCB and EM-PGCB for global trades and give experimental evidence that EM-PGCB achieves the quality of the state-of-the-art ESMC algorithm EM-ES nearly one order of magnitude faster.

cs.DS↗
arXiv2017

The Gauss map of a free boundary minimal surface

In this paper, we study the Gauss map of a free boundary minimal surface. The main theorem asserts that if components of the Gauss map are eigenfunctions of the Jacobi-Steklov operator, then the surface must be rotationally symmetric.

math.DG↗
arXiv2017

Complete manifolds with bounded curvature and spectral gaps

We study the spectrum of complete noncompact manifolds with bounded curvature and positive injectivity radius. We give general conditions which imply that their essential spectrum has an arbitrarily large finite number of gaps. In particular, for any noncompact covering of a compact manifold, there is a metric on the base so that the lifted metric has an arbitrarily large finite number of gaps in its essential spectrum. Also, for any complete noncompact manifold with bounded curvature and positive injectivity radius we construct a metric uniformly equivalent to the given one (also of bounded curvature and positive injectivity radius) with an arbitrarily large finite number of gaps in its essential spectrum.

math.SP↗
arXiv2017

On Closed Manifolds with Harmonic Weyl Curvature

We derive point-wise and integral rigidity/gap results for a closed manifold with harmonic Weyl curvature in any dimension. In particular, there is a generalization of Tachibana's theorem for non-negative curvature operator. The key ingredients are new Bochner-Weitzenböck-Lichnerowicz type formulas for the Weyl tensor, which are generalizations of identities in dimension four.

math.DG↗
arXiv2017

On the Morse index of higher-dimensional free boundary minimal catenoids

For all $n$, we define the $n$-dimensional critical catenoid $M_n$ to be the unique rotationally symmetric, free boundary minimal hypersurface of non-trivial topology embedded in the closed unit ball in $\Bbb{R}^{n+1}$. We show that the Morse index $\text{MI}(n)$ of $M_n$ satisfies the following asymptotic estimate as $n$ tends to infinity. $$ \lim_{n\rightarrow+\infty}\frac{\text{Log}(\text{MI}(n))}{\sqrt{n}\text{Log}(\sqrt{n})} = 1. $$ We also study the numerical problem, providing exact values for the Morse index for $n=2,\cdots,100$, together with qualitative studies of $\text{MI}(n)$ and related geometric quantities for large values of $n$.

math.DG↗
arXiv2017

I/O-Efficient Generation of Massive Graphs Following the LFR Benchmark

LFR is a popular benchmark graph generator used to evaluate community detection algorithms. We present EM-LFR, the first external memory algorithm able to generate massive complex networks following the LFR benchmark. Its most expensive component is the generation of random graphs with prescribed degree sequences which can be divided into two steps: the graphs are first materialized deterministically using the Havel-Hakimi algorithm, and then randomized. Our main contributions are EM-HH and EM-ES, two I/O-efficient external memory algorithms for these two steps. We also propose EM-CM/ES, an alternative sampling scheme using the Configuration Model and rewiring steps to obtain a random simple graph. In an experimental evaluation we demonstrate their performance; our implementation is able to handle graphs with more than 37 billion edges on a single machine, is competitive with a massive parallel distributed algorithm, and is faster than a state-of-the-art internal memory implementation even on instances fitting in main memory. EM-LFR's implementation is capable of generating large graph instances orders of magnitude faster than the original implementation. We give evidence that both implementations yield graphs with matching properties by applying clustering algorithms to generated instances. Similarly, we analyse the evolution of graph properties as EM-ES is executed on networks obtained with EM-CM/ES and find that the alternative approach can accelerate the sampling process.

cs.DS↗
arXiv2017

Downlink Power Optimization for Heterogeneous Networks with Time Reversal-based Transmission under Backhaul Limitation

In this paper, we investigate an application of two different beamforming techniques and propose a novel downlink power minimization scheme for a two-tier heterogeneous network (HetNet) model. In this context, we employ time reversal (TR) technique to a femtocell base station (FBS) whereas we assume that a macrocell base station (MBS) uses a zero-forcing-based algorithm and the communication channels are subject to frequency selective fading. Additionally, HetNet's backhaul connection is unable to support a sufficient throughput for signaling information exchange between two tiers. Given the considered HetNet model, a downlink power minimization scheme is proposed, and closed-form expressions concerning the optimal solution are provided, taking this constraint into account. Furthermore, considering imperfect channel estimation at TR-employed femtocell, a worst-case robust power minimization problem is formulated. By devising TR worst-case analysis, this robust problem is transformed into an equivalent formulation that is tractable to solve. The results presented in our paper show that the TR technique outperforms the zero-forcing one in the perspective of beamforming methods for femtocell working environments. Finally, we validate the proposed power loading strategy for both cases of perfect and imperfect channel estimations.

cs.IT↗
arXiv2014

Impact of Secondary User Communication on Security Communication of Primary User

Recently, spectrum sharing has been considered as a promising solution to improve the spectrum utilization. It however may be vulnerable to security problems as the primary and secondary network access the same resource. Therefore, in this paper, we focus on the performance analysis of a cognitive radio network in the presence of an eavesdropper (EAV) who illegally listens to the primary user (PU) communication in which the transmit power of the secondary transmitter (SU-Tx) is subject to the joint constraint of peak transmit power of the SU-Tx and outage probability of the PU. Accordingly, an adaptive transmit power policy and an analytical expression of symbol error probability are derived for the SU. Most importantly, security evaluations of primary network in terms of the probability of existence of non-zero secrecy capacity and outage probability of secrecy capacity are obtained. Numerical results reveal a fact that the security of the primary network does not only depends on the channel mean powers between primary and secondary networks, but also strongly depends on the channel condition of the SU-Tx to EAV link and transmit power policy of the SU-Tx.

cs.CR↗
arXiv2014

Harnack Estimates for Conjugate Heat Kernel on Evolving Manifolds

In this article we derive Harnack estimates for conjugate heat kernel in an abstract geometric flow. Our calculation involves a correction term D. When D is nonnegative, we are able to obtain a Harnack inequality. Our abstract formulation provides a unified framework for some known results, in particular including corresponding results of Ni, Perelman, and Tran as special cases. Moreover it leads to new results in the setting of Ricci-Harmonic flow and mean curvature flow in Lorentzian manifolds with nonnegative sectional curvature.

math.DG↗