Searcharxiv⌕ Search

arXiv subjects

Yan Huang

Publications and source records attributed to Yan Huang.

At least 271 records · Page 15Linked to original sources

DeepMove: Learning Place Representations through Large Scale Movement Data

Understanding and reasoning about places and their relationships are critical for many applications. Places are traditionally curated by a small group of people as place gazetteers and are represented by an ID with spatial extent, category, and other descriptions. However, a place context is described to a large extent by movements made from/to other places. Places are linked and related to each other by these movements. This important context is missing from the traditional representation. We present DeepMove, a novel approach for learning latent representations of places. DeepMove advances the current deep learning based place representations by directly model movements between places. We demonstrate DeepMove's latent representations on place categorization and clustering tasks on large place and movement datasets with respect to important parameters. Our results show that DeepMove outperforms state-of-the-art baselines. DeepMove's representations can provide up to 15% higher than competing methods in matching rate of place category and result in up to 39% higher silhouette coefficient value for place clusters. DeepMove is spatial and temporal context aware. It is scalable. It outperforms competing models using much smaller training dataset (a month or 1/12 of data). These qualities make it suitable for a broad class of real-world applications.

cs.LG↗

Constraining the ejecta for the nonthermal emission from GW170817

We consider a simple model for the nonthermal emission from GW170817, in which a quasi-spherical ejecta is released in the merger event, with the kinetic energy distributed over the momentum as $E(>γβ)\propto(γβ)^{-k}$. The ejecta drives a shock into the medium and gives rise to synchrotron radiation. Using multi-band observations we constrain that $k\approx6.7$; (assuming medium density of $\sim10^{-2}\rm cm^{-3}$ and postshock magnetic field carries a fraction $10^{-5}-10^{-3}$ of the postshock internal energy) the total kinetic energy is $(0.3-5)\times10^{51}$erg; the slowest ejecta velocity is $\sim(0.7-0.8)c$; and the fastest ejecta has a Lorentz factor of $\sim4-7$. We conclude that the sub-relativistic dynamical ejecta responsible to the kilonova cannot produce the nonthermal emission. The co-existence of the nonthermal and thermal kilonova emission implies that two corresponding ejecta are ejected at different angles.

astro-ph.HE↗

Technical Report on Efficient Integration of Dynamic TDD with Massive MIMO

Recent advances in massive multiple-input multiple-output (MIMO) communication show that equipping base stations (BSs) with large arrays of antenna can significantly improve the performance of cellular networks. Massive MIMO has the potential to mitigate the interference in the network and enhance the average throughput per user. On the other hand, dynamic time division duplexing (TDD), which allows neighboring cells to operate with different uplink (UL) and downlink (DL) sub-frame configurations, is a promising enhancement for the conventional static TDD. Compared with static TDD, dynamic TDD can offer more flexibility to accommodate various UL and DL traffic patterns across different cells, but may result in additional interference among cells transmitting in different directions. Based on the unique characteristics and properties of massive MIMO and dynamic TDD, we propose a marriage of these two techniques, i.e., to have massive MIMO address the limitation of dynamic TDD in macro cell (MC) networks. Specifically, we advocate that the benefits of dynamic TDD can be fully extracted in MC networks equipped with massive MIMO, i.e., the BS-to-BS interference can be effectively removed by increasing the number of BS antennas. We provide detailed analysis using random matrix theory to show that the effect of the BS-to-BS interference on uplink transmissions vanishes as the number of BS antennas per-user grows infinitely large. Last but not least, we validate our analysis by numerical simulations.

eess.SP↗

Persistent X-ray emission from ASASSN-15lh: massive ejecta and pre-SLSN dense wind?

The persistent soft X-ray emission from the location of the so-far most luminous supernova (SN), ASASSN-15lh (or SN 2015L), with $L \sim 10^{42} \rm erg~ s^{-1}$, is puzzling. We show that it can be explained by radiation from the SN-shock accelerated electrons inverse-Compton scattering the intense UV photons. The non-detection in radio requires strong free-free absorption in the dense medium. In these interpretations, the circumstellar medium is derived to be a wind ($n\propto R^{-2}$) with mass-loss rate of $\dot M \gtrsim 3 \times10^{-3}M_\odot(v_{\rm w}/10^3 \rm km\,s^{-1}) yr^{-1}$, and the initial velocity of the bulk SN ejecta is $\lesssim 0.02c$. These constraints imply a massive ejecta mass of $\gtrsim 60(E_0/2\times10^{52} \rm erg)M_\odot$ in \asn, and a strong wind ejected by the progenitor star within $\sim8 (v_{\rm w}/10^3 \rm km\,s^{-1})^{-1}$ yrs before explosion.

astro-ph.HE↗

A Hierarchical Contextual Attention-based GRU Network for Sequential Recommendation

Sequential recommendation is one of fundamental tasks for Web applications. Previous methods are mostly based on Markov chains with a strong Markov assumption. Recently, recurrent neural networks (RNNs) are getting more and more popular and has demonstrated its effectiveness in many tasks. The last hidden state is usually applied as the sequence's representation to make recommendation. Benefit from the natural characteristics of RNN, the hidden state is a combination of long-term dependency and short-term interest to some degrees. However, the monotonic temporal dependency of RNN impairs the user's short-term interest. Consequently, the hidden state is not sufficient to reflect the user's final interest. In this work, to deal with this problem, we propose a Hierarchical Contextual Attention-based GRU (HCA-GRU) network. The first level of HCA-GRU is conducted on the input. We construct a contextual input by using several recent inputs based on the attention mechanism. This can model the complicated correlations among recent items and strengthen the hidden state. The second level is executed on the hidden state. We fuse the current hidden state and a contextual hidden state built by the attention mechanism, which leads to a more suitable user's overall interest. Experiments on two real-world datasets show that HCA-GRU can effectively generate the personalized ranking list and achieve significant improvement.

cs.IR↗

Learning Semantic Concepts and Order for Image and Sentence Matching

Image and sentence matching has made great progress recently, but it remains challenging due to the large visual-semantic discrepancy. This mainly arises from that the representation of pixel-level image usually lacks of high-level semantic information as in its matched sentence. In this work, we propose a semantic-enhanced image and sentence matching model, which can improve the image representation by learning semantic concepts and then organizing them in a correct semantic order. Given an image, we first use a multi-regional multi-label CNN to predict its semantic concepts, including objects, properties, actions, etc. Then, considering that different orders of semantic concepts lead to diverse semantic meanings, we use a context-gated sentence generation scheme for semantic order learning. It simultaneously uses the image global context containing concept relations as reference and the groundtruth semantic order in the matched sentence as supervision. After obtaining the improved image representation, we learn the sentence representation with a conventional LSTM, and then jointly perform image and sentence matching and sentence generation for model learning. Extensive experiments demonstrate the effectiveness of our learned semantic concepts and order, by achieving the state-of-the-art results on two public benchmark datasets.

cs.CV↗

A description of pseudorapidity distributions of charged particles produced in Au+Au collisions at RHIC energies

The charged particles produced in heavy ion collisions consist of two parts: One is from the freeze-out of hot and dense matter formed in collisions. The other is from the leading particles. In this paper, the hot and dense matter is assumed to expand according to the hydrodynamic model including phase transition and decouples into particles via the prescription of Cooper-Frye. The leading particles are as usual supposed to have Gaussian rapidity distributions with the number equaling that of participants. The investigations of this paper show that, unlike low energy situations, the leading particles are essential in describing the pseudorapidity distributions of charged particles produced in high energy heavy ion collisions. This might be due to the different transparencies of nuclei at different energies.

nucl-th↗

Who Will You Share a Ride With: Factors that Influence Trust of Potential Rideshare Partners

Ridesharing can save energy, reduce pollution, and alleviate congestion. Ridesharing systems allow peer-to-peer ride matching through mobile-phone applications. In many systems people have little information about the driver and co-riders. Trust heavily influences the usage of a ridesharing system, however, work in this area is limited. In this paper, we investigate the role of social media in shaping trust and delineate factors that influence the decisions of trust placed on a driver or co-rider. We design a ridesharing system where a rider can see the Instagram profile and 10 recent pictures of a co-rider and ask them to make judgments on six trust related questions. We discovered three important factors that shape trust forming: \textit{social proof}, \textit{social approval}, and \textit{self-disclosure}. These three factors account for 40\%, 33\%, and 13\% of the variance, and subsequent factors extracted accounted for substantially less variance. Using these three factors, we successfully build a trust prediction model with F-measure of 87.4\%, an improvement from 78.6\% on using all factors collected.

cs.SI↗

Instance-aware Image and Sentence Matching with Selective Multimodal LSTM

Effective image and sentence matching depends on how to well measure their global visual-semantic similarity. Based on the observation that such a global similarity arises from a complex aggregation of multiple local similarities between pairwise instances of image (objects) and sentence (words), we propose a selective multimodal Long Short-Term Memory network (sm-LSTM) for instance-aware image and sentence matching. The sm-LSTM includes a multimodal context-modulated attention scheme at each timestep that can selectively attend to a pair of instances of image and sentence, by predicting pairwise instance-aware saliency maps for image and sentence. For selected pairwise instances, their representations are obtained based on the predicted saliency maps, and then compared to measure their local similarity. By similarly measuring multiple local similarities within a few timesteps, the sm-LSTM sequentially aggregates them with hidden states to obtain a final matching score as the desired global similarity. Extensive experiments show that our model can well match image and sentence with complex content, and achieve the state-of-the-art results on two public benchmark datasets.

cs.CV↗

Multimodal Memory Modelling for Video Captioning

Video captioning which automatically translates video clips into natural language sentences is a very important task in computer vision. By virtue of recent deep learning technologies, e.g., convolutional neural networks (CNNs) and recurrent neural networks (RNNs), video captioning has made great progress. However, learning an effective mapping from visual sequence space to language space is still a challenging problem. In this paper, we propose a Multimodal Memory Model (M3) to describe videos, which builds a visual and textual shared memory to model the long-term visual-textual dependency and further guide global visual attention on described targets. Specifically, the proposed M3 attaches an external memory to store and retrieve both visual and textual contents by interacting with video and sentence with multiple read and write operations. First, text representation in the Long Short-Term Memory (LSTM) based text decoder is written into the memory, and the memory contents will be read out to guide an attention to select related visual targets. Then, the selected visual information is written into the memory, which will be further read out to the text decoder. To evaluate the proposed model, we perform experiments on two publicly benchmark datasets: MSVD and MSR-VTT. The experimental results demonstrate that our method outperforms the state-of-theart methods in terms of BLEU and METEOR.

cs.CV↗

Anchoring and Agreement in Syntactic Annotations

We present a study on two key characteristics of human syntactic annotations: anchoring and agreement. Anchoring is a well known cognitive bias in human decision making, where judgments are drawn towards pre-existing values. We study the influence of anchoring on a standard approach to creation of syntactic resources where syntactic annotations are obtained via human editing of tagger and parser output. Our experiments demonstrate a clear anchoring effect and reveal unwanted consequences, including overestimation of parsing performance and lower quality of annotations in comparison with human-based annotations. Using sentences from the Penn Treebank WSJ, we also report systematically obtained inter-annotator agreement estimates for English dependency parsing. Our agreement results control for parser bias, and are consequential in that they are on par with state of the art parsing performance for English newswire. We discuss the impact of our findings on strategies for future annotation efforts and parser evaluations.

cs.CL↗

A combined model for pseudorapidity distributions in Cu-Cu collisions at BNL-RHIC energies

The charged particles produced in nucleus-nucleus collisions come from leading particles and those frozen out from the hot and dense matter created in collisions. The leading particles are conventionally supposed having Gaussian rapidity distributions normalized to the number of participants. The hot and dense matter is assumed to expand according to the unified hydrodynamics, a hydro model which unifies the features of Landau and Hwa-Bjorken model, and freeze out into charged particles from a space-like hypersurface with a proper time of Tau_FO . The rapidity distribution of this part of charged particles can be derived out analytically. The combined contribution from both leading particles and unified hydrodynamics is then compared against the experimental data performed by BNL-RHIC-PHOBOS Collaboration in different centrality Cu-Cu collisions at sqrt(s_NN)=200 and 62.4 GeV, respectively. The model predictions are in well consistent with experimental measurements.

nucl-th↗

The radio environment of the 21 Centimeter Array: RFI detection and mitigation

Detection and mitigation of radio frequency interference (RFI) is the first and also the key step for data processing in radio observations, especially for ongoing low frequency radio experiments towards the detection of the cosmic dawn and epoch of reionization (EoR). In this paper we demonstrate the technique and efficiency of RFI identification and mitigation for the 21 Centimeter Array (21CMA), a radio interferometer dedicated to the statistical measurement of EoR. For terrestrial, man-made RFI, we concentrate mainly on a statistical approach by identifying and then excising non-Gaussian signatures, in the sense that the extremely weak cosmic signal is actually buried under thermal and therefore Gaussian noise. We also introduce the so-called visibility correlation coefficient instead of conventional visibility, which allows a further suppression of rapidly time-varying RFI. Finally, we briefly discuss removals of the sky RFI, the leakage of sidelobes from off-field strong radio sources with time-invariant power and a featureless spectrum. It turns out that state of the art technique should allow us to detect and mitigate RFI to a satisfactory level in present low frequency interferometer observations such as those acquired with the 21CMA, and the accuracy and efficiency can be greatly improved with the employment of low-cost, high-speed computing facilities for data acquisition and processing.

astro-ph.IM↗

A combined model for the pseudorapidity distributions in p-p collisions at center-of-mass energies from 23.6 to 7000 GeV

In p-p collisions, the produced charge particles consist of two leading particles and those frozen out from the hot and dense matter created in collisions. The two leading particles are respectively in the projectile and target fragmentation region, which, in this paper, are conventionally supposed to have Gaussian rapidity distributions. The hot and dense matter is assumed to expand according to the unified hydrodynamics, a hydro model which unifies the features of Landau and Hwa-Bjorken model, and freeze out into charged particles from a space-like hypersurface with a fixed proper time of Tau_FO. The rapidity distribution of this part of charged particles can be derived out analytically. The combined contribution from both leading particles and unified hydrodynamics is then compared against the experimental data performed in a wide now available center-of-mass energy region from 23.6 to 7000 GeV. The model predictions are in well consistent with experimental measurements.

nucl-th↗

Infrared colour properties of nearby radio-luminous galaxies

By combining the data of the Two Micron All Sky Survey, the \textit{Wide Field Infrared Survey Explorer} and the \textit{AKARI} satellite, we study the infrared colour properties of a sample of 2712 nearby radio-luminous galaxies (RLGs). These RLGs are divided into radio-loud (RL) active galactic nuclei (AGNs), mainly occurring at redshifts of $0.05 $ 3.0. We also analyse the MIR colours of RL AGNs divided into low- and high-excitation radio galaxies (LERGs and HERGs, respectively). The ([3.4]$-$[4.6])$-$([4.6]$-$[12]) diagram clearly shows separate distributions of LERGs and HERGs and a region of overlap, which suggests that LERGs and HERGs have different MIR properties. LERGs are responsible for the double-core distribution of RL AGNs on the ([3.4]$-$[4.6])$-$([4.6]$-$[12]) diagram. In addition, we also suggest 90$-$140$μ$m band spectral index $α(90,140)<-1.4$ as a criterion of selecting nearby active galaxies with non-thermal emissions at far-infrared wavelengths.

astro-ph.GA↗

Community Detection from Location-Tagged Networks

Many real world systems or web services can be represented as a network such as social networks and transportation networks. In the past decade, many algorithms have been developed to detect the communities in a network using connections between nodes. However in many real world networks, the locations of nodes have great influence on the community structure. For example, in a social network, more connections are established between geographically proximate users. The impact of locations on community has not been fully investigated by the research literature. In this paper, we propose a community detection method which takes locations of nodes into consideration. The goal is to detect communities with both geographic proximity and network closeness. We analyze the distribution of the distances between connected and unconnected nodes to measure the influence of location on the network structure on two real location-tagged social networks. We propose a method to determine if a location-based community detection method is suitable for a given network. We propose a new community detection algorithm that pushes the location information into the community detection. We test our proposed method on both synthetic data and real world network datasets. The results show that the communities detected by our method distribute in a smaller area compared with the traditional methods and have the similar or higher tightness on network connections.

cs.SI↗

Large Scale Real-time Ridesharing with Service Guarantee on Road Networks

The mean occupancy rates of personal vehicle trips in the United States is only 1.6 persons per vehicle mile. Urban traffic gridlock is a familiar scene. Ridesharing has the potential to solve many environmental, congestion, and energy problems. In this paper, we introduce the problem of large scale real-time ridesharing with service guarantee on road networks. Servers and trip requests are dynamically matched while waiting time and service time constraints of trips are satisfied. We first propose two basic algorithms: a branch-and-bound algorithm and an integer programing algorithm. However, these algorithm structures do not adapt well to the dynamic nature of the ridesharing problem. Thus, we then propose a kinetic tree algorithm capable of better scheduling dynamic requests and adjusting routes on-the-fly. We perform experiments on a large real taxi dataset from Shanghai. The results show that the kinetic tree algorithm is faster than other algorithms in response time.

cs.DS↗