arXiv subjects

Liang Wang

Publications and source records attributed to Liang Wang.

At least 649 records · Page 36Linked to original sources

arXiv2016

I(FIB)F: Iterated Bloom Filters for Routing in Named Data Networks

Named Data Networks provide a clean-slate redesign of the Future Internet for efficient content distribution. Because Internet of Things are expected to compose a significant part of Future Internet, most content will be managed by constrained devices. Such devices are often equipped with limited CPU, memory, bandwidth, and energy supply. However, the current Named Data Networks design neglects the specific requirements of Internet of Things scenarios and many data structures need to be further optimised. The purpose of this research is to provide an efficient strategy to route in Named Data Networks by constructing a Forwarding Information Base using Iterated Bloom Filters defined as I(FIB)F. We propose the use of content names based on iterative hashes. This strategy leads to reduce the overhead of packets. Moreover, the memory and the complexity required in the forwarding strategy are lower than in current solutions. We compare our proposal with solutions based on hierarchical names and Standard Bloom Filters. We show how to further optimise I(FIB)F by exploiting the structure information contained in hierarchical content names. Finally, two strategies may be followed to reduce: (i) the overall memory for routing or (ii) the probability of false positives.

cs.NI↗

arXiv2016

Fast k-NN search

Efficient index structures for fast approximate nearest neighbor queries are required in many applications such as recommendation systems. In high-dimensional spaces, many conventional methods suffer from excessive usage of memory and slow response times. We propose a method where multiple random projection trees are combined by a novel voting scheme. The key idea is to exploit the redundancy in a large number of candidate sets obtained by independently generated random projections in order to reduce the number of expensive exact distance evaluations. The method is straightforward to implement using sparse projections which leads to a reduced memory footprint and fast index construction. Furthermore, it enables grouping of the required computations into big matrix multiplications, which leads to additional savings due to cache effects and low-level parallelization. We demonstrate by extensive experiments on a wide variety of data sets that the method is faster than existing partitioning tree or hashing based approaches, making it the fastest available technique on high accuracy levels.

stat.ML↗

arXiv2016

You Really Need A Good Ruler to Measure Caching Performance in Information-Centric Networks

Information-centric networks are an interesting new paradigm for distributing content on the Internet. They bring up many research challenges, such as addressing content by name, securing content, and wide-spread caching of content. Caching has caught a lot of attention in the research community, but a lot of the work suffers from a poor understanding of the different metrics with which caching performance can be measured. In this paper we not only present a comprehensive overview of different caching metrics that have been proposed for information-centric networks, but also propose the coupling factor as a new metric to capture the relation- ship between content popularity and network topology. As we show, many commonly used metrics have several failure modes which are largely ignored in literature. We identify these problems and propose remedies and new metrics to address these failures. Our work highlights the fundamental differences between information-centric caches and "traditional" cache networks and we demonstrate the need for a systematic understanding of the metrics for information- centric caching. We also discuss how experimental work should be done when evaluating networks of caches.

cs.NI↗

arXiv2016

NIHAO X: Reconciling the local galaxy velocity function with Cold Dark Matter via mock HI observations

We used 87 high resolution hydrodynamical cosmological simulations from the NIHAO suite to investigate the relation between the maximum circular velocity (Vmax) of a dark matter halo in a collisionless simulation and the velocity width of the HI gas in the same halo in the hydrodynamical simulation. These two quantities are normally used to compare theoretical and observational velocity functions and have led to a possible discrepancy between observations and predictions based on the Cold Dark Matter (CDM) model. We show that below 100 km/s, there is clear bias between HI based velocities and Vmax, that leads to an underestimation of the actual circular velocity of the halo. When this bias is taken into account the CDM model has no trouble in reproducing the observed velocity function and no lack of low velocity galaxies is actually present. Our simulations also reproduce the linewidth - stellar mass (Tully-Fisher) relation and HI sizes, indicating that the HI gas in our simulations is as extended as observed. The physical reason for the lower than expected linewidths is that, in contrast to high mass galaxies, low mass galaxies no longer have extended thin HI rotating disks, as is commonly assumed.

astro-ph.GA↗

arXiv2016

A Comprehensive Survey on Cross-modal Retrieval

In recent years, cross-modal retrieval has drawn much attention due to the rapid growth of multimodal data. It takes one type of data as the query to retrieve relevant data of another type. For example, a user can use a text to retrieve relevant pictures or videos. Since the query and its retrieved results can be of different modalities, how to measure the content similarity between different modalities of data remains a challenge. Various methods have been proposed to deal with such a problem. In this paper, we first review a number of representative methods for cross-modal retrieval and classify them into two main groups: 1) real-valued representation learning, and 2) binary representation learning. Real-valued representation learning methods aim to learn real-valued common representations for different modalities of data. To speed up the cross-modal retrieval, a number of binary representation learning methods are proposed to map different modalities of data into a common Hamming space. Then, we introduce several multimodal datasets in the community, and show the experimental results on two commonly used multimodal datasets. The comparison reveals the characteristic of different kinds of cross-modal retrieval methods, which is expected to benefit both practical applications and future research. Finally, we discuss open problems and future research directions.

cs.MM↗

arXiv2016

NIHAO project II: Halo shape, phase-space density and velocity distribution of dark matter in galaxy formation simulations

We use the NIHAO (Numerical Investigation of Hundred Astrophysical Objects) cosmological simulations to study the effects of galaxy formation on key properties of dark matter (DM) haloes. NIHAO consists of $\simeq 90$ high-resolution SPH simulations that include (metal-line) cooling, star formation, and feedback from massive stars and SuperNovae, and cover a wide stellar and halo mass range: $10^6 < M_* / M_{\odot} < 10^{11}$ ( $10^{9.5} < M_{\rm halo} / M_{\odot} < 10^{12.5}$). When compared to DM-only simulations, the NIHAO haloes have similar shapes at the virial radius, R_{\rm vir}, but are substantially rounder inside $\simeq 0.1R_{\rm vir}$. In NIHAO simulations $c/a$ increases with halo mass and integrated star formation efficiency, reaching $\sim 0.8$ at the Milky Way mass (compared to 0.5 in DM-only), providing a plausible solution to the long-standing conflict between observations and DM-only simulations. The radial profile of the phase-space $Q$ parameter ($ρ/σ^3$) is best fit with a single power law in DM-only simulations, but shows a flattening within $\simeq 0.1R_{\rm vir}$ for NIHAO for total masses $M>10^{11} M_{\odot}$. Finally, the global velocity distribution of DM is similar in both DM-only and NIHAO simulations, but in the solar neighborhood, NIHAO galaxies deviate substantially from Maxwellian. The distribution is more symmetric, roughly Gaussian, with a peak that shifts to higher velocities for Milky Way mass haloes. We provide the distribution parameters which can be used for predictions for direct DM detection experiments. Our results underline the ability of the galaxy formation processes to modify the properties of dark matter haloes.

astro-ph.GA↗

arXiv2016

NIHAO IX: the role of gas inflows and outflows in driving the contraction and expansion of cold dark matter haloes

We use ~100 cosmological galaxy formation zoom-in simulations using the smoothed particle hydrodynamics code {\sc gasoline} to study the effect of baryonic processes on the mass profiles of cold dark matter haloes. The haloes in our study range from dwarf (M_{200}~10^{10}Msun) to Milky Way (M_{200}~10^{12}Msun) masses. Our simulations exhibit a wide range of halo responses, primarily varying with mass, from expansion to contraction, with up to factor ~10 changes in the enclosed dark matter mass at one per cent of the virial radius. Confirming previous studies, the halo response is correlated with the integrated efficiency of star formation: e_SF=(M_{star}/M_{200})/(Ω_b/Ω_m). In addition we report a new correlation with the compactness of the stellar system: e_R=r_{1/2}/R_{200}. We provide an analytic formula depending on e_SF and e_R for the response of cold dark matter haloes to baryonic processes. An observationally testable prediction is that, at fixed mass, larger galaxies experience more halo expansion, while the smaller galaxies more halo contraction. This diversity of dark halo response is captured by a toy model consisting of cycles of adiabatic inflow (causing contraction) and impulsive gas outflow (causing expansion). For net outflow, or equal inflow and outflow fractions, f, the overall effect is expansion, with more expansion with larger f. For net inflow, contraction occurs for small f (large radii), while expansion occurs for large f (small radii), recovering the phenomenology seen in our simulations. These regularities in the galaxy formation process provide a step towards a fully predictive model for the structure of cold dark matter haloes.

astro-ph.GA↗

arXiv2016

The Pan-Pacific Planet Search V. Fundamental Parameters for 164 Evolved Stars

We present spectroscopic stellar parameters for the complete target list of 164 evolved stars from the Pan-Pacific Planet Search, a five-year radial velocity campaign using the 3.9m Anglo-Australian Telescope. For 87 of these bright giants, our work represents the first determination of their fundamental parameters. Our results carry typical uncertainties of 100 K, 0.15 dex, and 0.1 dex in $T_{\rm eff}$, $\log g$, and [Fe/H] and are consistent with literature values where available. The derived stellar masses have a mean of $1.31^{+0.28}_{-0.25}$ Msun, with a tail extending to $\sim$2 Msun, consistent with the interpretation of these targets as "retired" A-F type stars.

astro-ph.SR↗

arXiv2016

Calibration of LAMOST Stellar Surface Gravities Using the Kepler Asteroseismic Data

Asteroseismology is a powerful tool to precisely determine the evolutionary status and fundamental properties of stars. With the unprecedented precision and nearly continuous photometric data acquired by the NASA Kepler mission, parameters of more than 10$^4$ stars have been determined nearly consistently. However, most studies still use photometric effective temperatures (Teff) and metallicities ([Fe/H]) as inputs, which are not sufficiently accurate as suggested by previous studies. We adopted the spectroscopic Teff and [Fe/H] values based on the LAMOST low-resolution spectra (R~1,800), and combined them with the global oscillation parameters to derive the physical parameters of a large sample of stars. Clear trends were found between Δlogg(LAMOST - seismic) and spectroscopic Teff as well as logg, which may result in an overestimation of up to 0.5 dex for the logg of giants in the LAMOST catalog. We established empirical calibration relations for the logg values of dwarfs and giants. These results can be used for determining the precise distances to these stars based on their spectroscopic parameters.

astro-ph.SR↗

arXiv2016

Taming Limits with Approximate Networking

Internet is the linchpin of modern society, which the various threads of modern life weave around. But being a part of the bigger energy-guzzling industrial economy, it is vulnerable to disruption. It is widely believed that our society is exhausting its vital resources to meet our energy requirements, and the cheap fossil fuel fiesta will soon abate as we cross the tipping point of global oil production. We will then enter the long arc of scarcity, constraints, and limits---a post-peak "long emergency" that may subsist for a long time. To avoid the collapse of the networking ecosystem in this long emergency, it is imperative that we start thinking about how networking should adapt to these adverse "undeveloping" societal conditions. We propose using the idea of "\textit{approximate networking}"---which will provide \textit{good-enough} networking services by employing \textit{contextually-appropriate} tradeoffs---to survive, or even thrive, in the conditions of scarcity and limits.

cs.NI↗

arXiv2016

C3PO: Computation Congestion Control (PrOactive) - an algorithm for dynamic diffusion of ephemeral in-network services

There is an obvious trend that more and more data and computation are migrating into networks nowadays. Combining mature virtualization technologies with service-centric net- working, we are entering into an era where countless services reside in an ISP network to provide low-latency access. Such services are often computation intensive and are dynamically created and destroyed on demands everywhere in the network to perform various tasks. Consequently, these ephemeral in-network services introduce a new type of congestion in the network which we refer to as "computation congestion". The service load need to be effectively distributed on different nodes in order to maintain the funtionality and responsiveness of the network, which calls for a new design rather than reusing the centralised scheduler designed for cloud-based services. In this paper, we study both passive and proactive control strategies, based on the proactive control we further propose a fully distributed solution which is low complexity, adaptive, and responsive to network dynamics.

cs.NI↗

arXiv2016

Lattice Boltzmann simulation of separation phenomenon in a binary gaseous flow through a microchannel

Gas separation of a binary gaseous mixture is one of characteristic phenomena in the micro-scale flows that differ from the conventional size flows. In this work, the separation in a binary gas mixture flows through a microchannel is investigated by the lattice Boltzmann method with a diffuse-bounce-back (DBB) boundary condition. The separation degree and rate are measured in the He--Ar and Ne--Ar systems for different mole fractions, pressure ratios, and Knudsen numbers. The results show that the separation phenomenon in the He--Ar mixture is more obvious than that in the Ne--Ar mixture at the same mole fraction owing to the larger molecular mass ratio. In addition, the increase in the pressure ratio reduces the difference in the molecular velocities between the two species, and the separation phenomenon becomes weaker. However, the gas separation is enhanced with an increase in the Knudsen number. This is because the resulting rarefaction effect reduces the interactions between the gas molecules of the two species, and thus increases the difference in the molecular velocity.

physics.comp-ph↗

arXiv2016

Bandwidth-aware Service Placement in Community Network Clouds

Seamless computing and service sharing in community networks have been gaining momentum due to the emerging technology of community network micro-clouds (CNMCs). However, running services in CNMCs can face enormous challenges such as the dynamic nature of micro-clouds, limited capacity of nodes and links, asymmetric quality of wireless links for services, deployment mod- els based on geographic singularities rather than network QoS, and etc. CNMCs have been increasingly used by network-intensive services that exchange significant amounts of data between the nodes on which they run, therefore the performance heavily relies on the available bandwidth resource in a network. This paper proposes a novel bandwidth-aware service placement algorithm which out- performs the current random placement adopted by Guifi.net. Our preliminary results show that the proposed algorithm consistently outperforms the current random placement adopted in Guifi.net by 35% regarding its bandwidth gain. More importantly, as the number of services increases, the gain tends to increase accordingly.

cs.NI↗

arXiv2016

Approximate Networking for Global Access to the Internet for All (GAIA)

Decades of experience have shown that there is no single one-size-fits-all solution that can be used to provision Internet globally and that invariably there are tradeoffs in the design of Internet. Despite the best efforts of networking researchers and practitioners, an ideal Internet experience is inaccessible to an overwhelming majority of people the world over, mainly due to the lack of cost efficient ways of provisioning high-performance global Internet. In this paper, we argue that instead of an exclusive focus on a utopian goal of universally accessible "ideal networking" (in which we have high throughput and quality of service as well as low latency and congestion), we should consider providing "approximate networking" through the adoption of context-appropriate tradeoffs. Approximate networking can be used to implement a pragmatic tiered global access to the Internet for all (GAIA) system in which different users the world over have different context-appropriate (but still contextually functional) Internet experience.

cs.NI↗

arXiv2016

"Resource Pooling" for Wireless Networks: Solutions for the Developing World

We live in a world in which there is a great disparity between the lives of the rich and the poor. Technology offers great promise in bridging this gap. In particular, wireless technology unfetters developing communities from the constraints of infrastructure providing a great opportunity to leapfrog years of neglect and technological waywardness. In this paper, we highlight the role of resource pooling for wireless networks in the developing world. Resource pooling involves: (i) abstracting a collection of networked resources to behave like a single unified resource pool and (ii) developing mechanisms for shifting load between the various parts of the unified resource pool. The popularity of resource pooling stems from its ability to provide resilience, high utilization, and flexibility at an acceptable cost. We show that "resource pooling", which is very popular in its various manifestations, is the key unifying principle underlying a diverse number of successful wireless technologies (such as white space networking, community networks, etc.). We discuss various applications of resource pooled wireless technologies and provide a discussion on open issues.

cs.NI↗

arXiv2016

XBF: Scaling up Bloom-filter-based Source Routing

A well known drawback of IP-multicast is that it requires per-group state to be stored in the routers. Bloom-filter based source-routed multicast remedies this problem by moving the state from the routers to the packets. However, a fixed sized Bloom-filter can only store a limited number of items before the false positive ratio grows too high implying scalability issues. Several proposals have tried to address these scalability issues in Bloom-filter forwarding. These proposals, however, unnecessarily increase the forwarding complexity. In this paper, we present Extensible-Bloom-filter (XBF), a new framing and forwarding solution which effectively circumvents the aforementioned drawbacks. XBF partitions a network into sub-networks that reflect the network topology and traffic patterns, and uses a separate fixed-length Bloom-filter in each of these. We formulate this partition assignment problem into a balanced edge partitioning problem, and evaluate it with simulations on realistic topologies. Our results show that XBF scales to very large networks with minimal overhead and completely eliminates the false-positives that have plagued the traditional Bloom-filter-based forwarding protocols. It furthermore integrates with SDN environments, making it highly suitable for deployments in off-the-shelf SDN-based networks.

cs.NI↗

arXiv2016

A Pair of Giant Planets around the Evolved Intermediate-Mass Star HD 47366: Multiple Circular Orbits or a Mutually Retrograde Configuration

We report the detection of a double planetary system around the evolved intermediate-mass star HD 47366 from precise radial-velocity measurements at Okayama Astrophysical Observatory, Xinglong Station, and Australian Astronomical Observatory. The star is a K1 giant with a mass of 1.81+-0.13M_sun, a radius of 7.30+-0.33R_sun, and solar metallicity. The planetary system is composed of two giant planets with minimum mass of 1.75^{+0.20}_{-0.17}Mjup and 1.86^{+0.16}_{-0.15}Mjup, orbital period of 363.3^{+2.5}_{-2.4} d and 684.7^{+5.0}_{-4.9} d, and eccentricity of 0.089^{+0.079}_{-0.060} and 0.278^{+0.067}_{-0.094}, respectively, which are derived by a double Keplerian orbital fit to the radial-velocity data. The system adds to the population of multi-giant-planet systems with relatively small orbital separations, which are preferentially found around evolved intermediate-mass stars. Dynamical stability analysis for the system revealed, however, that the best-fit orbits are unstable in the case of a prograde configuration. The system could be stable if the planets were in 2:1 mean-motion resonance, but this is less likely considering the observed period ratio and eccentricity. A present possible scenario for the system is that both of the planets have nearly circular orbits, namely the eccentricity of the outer planet is less than ~0.15, which is just within 1.4sigma of the best-fit value, or the planets are in a mutually retrograde configuration with a mutual orbital inclination larger than 160 degree.

astro-ph.EP↗

arXiv2015

The Pan-Pacific Planet Search. IV. Two super-Jupiters in a 3:5 resonance orbiting the giant star HD33844

We report the discovery of two giant planets orbiting the K giant HD 33844 based on radial velocity data from three independent campaigns. The planets move on nearly circular orbits with semimajor axes $a_b=1.60\pm$0.02 AU and $a_c=2.24\pm$0.05 AU, and have minimum masses (m sin $i$) of $M_b=1.96\pm$0.12 Mjup and $M_c=1.76\pm$0.18 Mjup. Detailed N-body dynamical simulations show that the two planets remain on stable orbits for more than $10^6$ years for low eccentricities, and are most likely trapped in a mutual 3:5 mean-motion resonance.

astro-ph.EP↗