arXiv subjects

Jun Luo

Publications and source records attributed to Jun Luo.

At least 253 records · Page 14Linked to original sources

arXiv2016

Test of non-Newtonian gravitational force at micrometer range

We report an experimental test of non-Newtonian gravitational forces at mi- crometer range. To experimentally subtract off the Casimir force and the electrostatic force background, differential force measurements were performed by sensing the lateral force between a gold sphere and a density modulated source mass using a soft cantilever. The current sensitivity is limited by the patch electrostatic force, which is further improved by two dimensional (2D) force mapping. The preliminary result sets a model independent constraint on the Yukawa type force at this range.

gr-qc↗

arXiv2015

Discrete Li-occupation versus pseudo-continuous Na-occupation and their relationship with structural change behaviors in Fe2(MoO4)3

The key factors governing the single-phase or multi-phase structural change behaviors during the intercalation/deintercalation of guest ions have not been well studied and understood yet. Through systematic studies of orthorhombic Fe2(MoO4)3 electrode, two distinct guest ion occupation paths, namely discrete one for Li and pseudo-continuous one for Na, as well as their relationship with single-phase and two-phase modes for Na1 and Li1, respectively during the intercalation/deintercalation process have been demonstrated. For the first time, the direct atomic-scale observation of biphasic domains (discrete occupation) in partially lithiated Fe2(MoO4)3 and the one by one Na occupation (pseudo-continuous occupation) at 8d sites in partially sodiated Fe2(MoO4)3 are obtained during the discharge processes of Li/Fe2(MoO4)3 and Na/Fe2(MoO4)3 cells respectively. Our combined experimental and theoretical studies bring the new insights for the research and development of intercalation compounds as electrode materials for secondary batteries.

cond-mat.mtrl-sci↗

arXiv2015

TianQin: a space-borne gravitational wave detector

TianQin is a proposal for a space-borne detector of gravitational waves in the millihertz frequencies. The experiment relies on a constellation of three drag-free spacecraft orbiting the Earth. Inter-spacecraft laser interferometry is used to monitor the distances between the test masses. The experiment is designed to be capable of detecting a signal with high confidence from a single source of gravitational waves within a few months of observing time. We describe the preliminary mission concept for TianQin, including the candidate source and experimental designs. We present estimates for the major constituents of the experiment's error budget and discuss the project's overall feasibility. Given the current level of technology readiness, we expect TianQin to be flown in the second half of the next decade.

astro-ph.IM↗

arXiv2015

Speed Partitioning for Indexing Moving Objects

Indexing moving objects has been extensively studied in the past decades. Moving objects, such as vehicles and mobile device users, usually exhibit some patterns on their velocities, which can be utilized for velocity-based partitioning to improve performance of the indexes. Existing velocity-based partitioning techniques rely on some kinds of heuristics rather than analytically calculate the optimal solution. In this paper, we propose a novel speed partitioning technique based on a formal analysis over speed values of the moving objects. We first show that speed partitioning will significantly reduce the search space expansion which has direct impacts on query performance of the indexes. Next we formulate the optimal speed partitioning problem based on search space expansion analysis and then compute the optimal solution using dynamic programming. We then build the partitioned indexing system where queries are duplicated and processed in each index partition. Extensive experiments demonstrate that our method dramatically improves the performance of indexes for moving objects and outperforms other state-of-the-art velocity-based partitioning approaches.

cs.DB↗

arXiv2015

Search for Lorentz invariance violation through tests of the gravitational inverse square law at short-ranges

A search for sidereal variations in the non-Newtonian force between two tungsten plates separated at millimeter ranges sets experimental limits on Lorentz invariance violation involving quadratic couplings of Riemann curvature. We show that the Lorentz invariance violation force between two finite flat plates is dominated by the edge effects, which includes a suppression effect leading to lower limits than previous rough estimates. From this search, we determine the current best constraints of the Lorentz invariance violating coefficients at a level of $10^{-8}$ m$^{2}$.

gr-qc↗

arXiv2015

Raman pulse duration effect in gravity gradiometers composed of two atom interferometers

We investigated the Raman pulse duration effect in a gravity gradiometer with two atom interferometers. Since the two atom clouds in the gradiometer experience different gravitational fields, it is hard to compensate the Doppler shifts of the two clouds simultaneously by chirping the frequency of a common Raman laser, which leads to an appreciable phase shift. When applied to an experiment measuring the Newtonian gravitational constant G, the effect contributes to a systematic offset as large as -49ppm in Nature 510, 518 (2014). Thus an underestimated value of G measured by atom interferometers can be partly explained due to this effect.

physics.atom-ph↗

arXiv2015

Test of the universality of free fall with atoms in different spin Orientations

We report a test of the universality of free fall (UFF) related to spin-gravity coupling effects by comparing the gravity acceleration of the $^{87}$Rb atoms in $m_F=+1$ versus that in $m_F=-1$, where the corresponding spin orientations are opposite. A Mach-Zehnder-type atom interferometer is exploited to sequentially measure the free fall acceleration of the atoms in these two sublevels, and the resultant E$\rm{\ddot{o}}$tv$\rm{\ddot{o}}$s ratio determined by this work is ${η_S} =(-0.2\pm1.5)\times 10^{-5}$. The interferometer using atoms in $m_F=+1$ or $m_F=-1$ is highly sensitive to magnetic field inhomogeneity, which limits the current experimental precision of our UFF test. The work here provides a stepping stone for future higher precision UFF test related to different spin orientations on atomic basis.

physics.atom-ph↗

arXiv2014

On cut sets of attractors of iterated function systems

In this paper, we study cut sets of attractors of iteration function systems (IFS) in $\mathbb{R}^d$. Under natural conditions, we show that all irreducible cut sets of these attractors are perfect sets or single points. This leads to a criterion for the existence of cut points of IFS attractors. If the IFS attractors are self-affine tiles, our results become algorithmically checkable and can be used to exhibit cut points with the help of Hata graphs. This enables us to construct cut points of some self-affine tiles studied in the literature.

math.GN↗

arXiv2014

A numerical scale for non locally connected planar continua

We introduce a numerical scale to quantify to which extent a planar continuum is not locally connected. For a locally connected continuum, the numerical scale is zero; for a continuum like the topologist's sine curve, the scale is one; for an indecomposable continuum, it is infinite. Among others, we shall pose a new problem that may be of some interest: can we estimate the scale from above for the Mandelbrot set $\mathcal{M}$ ?

math.GN↗

arXiv2014

Rauzy fractals with countable fundamental group

We prove that every free group of finite rank can be realized as the fundamental group of a planar Rauzy fractal associated with a 4-letter unimodular cubic Pisot substitution. This characterizes all countable fundamental groups for planar Rauzy fractals. We give an explicit construction relying on two operations on substitutions: symbolic splittings and conjugations by free group automorphisms.

math.DS↗

arXiv2013

Truthful Scheduling Mechanisms for Powering Mobile Crowdsensing

Mobile crowdsensing leverages mobile devices (e.g., smart phones) and human mobility for pervasive information exploration and collection; it has been deemed as a promising paradigm that will revolutionize various research and application domains. Unfortunately, the practicality of mobile crowdsensing can be crippled due to the lack of incentive mechanisms that stimulate human participation. In this paper, we study incentive mechanisms for a novel Mobile Crowdsensing Scheduling (MCS) problem, where a mobile crowdsensing application owner announces a set of sensing tasks, then human users (carrying mobile devices) compete for the tasks based on their respective sensing costs and available time periods, and finally the owner schedules as well as pays the users to maximize its own sensing revenue under a certain budget. We prove that the MCS problem is NP-hard and propose polynomial-time approximation mechanisms for it. We also show that our approximation mechanisms (including both offline and online versions) achieve desirable game-theoretic properties, namely truthfulness and individual rationality, as well as O(1) performance ratios. Finally, we conduct extensive simulations to demonstrate the correctness and effectiveness of our approach.

cs.NI↗

arXiv2012

Error analysis for satellite gravity field determination based on two-dimensional Fourier methods

The time-wise and space-wise approaches are generally applied to data processing and error analysis for satellite gravimetry missions. But both the approaches, which are based on least-squares collocation, address the whole effect of measurement errors and estimate the resolution of gravity field models mainly from a numerical point of indirect view. Moreover, requirement for higher accuracy and resolution gravity field models could make the computation more difficult, and serious numerical instabilities arise. In order to overcome the problems, this study focuses on constructing a direct relationship between power spectral density of the satellite gravimetry measurements and coefficients of the Earth's gravity potential. Based on two-dimensional Fourier transform, the relationship is analytically concluded. By taking advantage of the analytical expression, it is efficient and distinct for parameter estimation and error analysis of missions. From the relationship and the simulations, it is analytically confirmed that the low-frequency noise affects the gravity field recovery in all degrees for the instance of satellite gradiometer recovery mission. Furthermore, some other results and suggestions are also described.

physics.geo-ph↗

arXiv2012

Neighbor Discovery for Wireless Networks via Compressed Sensing

This paper studies the problem of neighbor discovery in wireless networks, namely, each node wishes to discover and identify the network interface addresses (NIAs) of those nodes within a single hop. A novel paradigm, called compressed neighbor discovery is proposed, which enables all nodes to simultaneously discover their respective neighborhoods with a single frame of transmission, which is typically of a few thousand symbol epochs. The key technique is to assign each node a unique on-off signature and let all nodes simultaneously transmit their signatures. Despite that the radios are half-duplex, each node observes a superposition of its neighbors' signatures (partially) through its own off-slots. To identify its neighbors out of a large network address space, each node solves a compressed sensing (or sparse recovery) problem. Two practical schemes are studied. The first employs random on-off signatures, and each node discovers its neighbors using a noncoherent detection algorithm based on group testing. The second scheme uses on-off signatures based on a deterministic second-order Reed-Muller code, and applies a chirp decoding algorithm. The second scheme needs much lower signal-to-noise ratio (SNR) to achieve the same error performance. The complexity of the chirp decoding algorithm is sub-linear, so that it is in principle scalable to networks with billions of nodes with 48-bit IEEE 802.11 MAC addresses. The compressed neighbor discovery schemes are much more efficient than conventional random-access discovery, where nodes have to retransmit over many frames with random delays to be successfully discovered.

cs.NI↗

arXiv2012

MEGCOM: Min-Energy Group COMmunication in Multi-hop Wireless Networks

Given the increasing demand from wireless applications, designing energy-efficient group communication protocols is of great importance to multi-hop wireless networks. A group communication session involves a set of member nodes, each of them needs to send a certain number of data packets to all other members. In this paper, we consider the problem of building a shared multicast tree spanning the member nodes such that the total energy consumption of a group communication session using the shared multicast tree is minimized. Since this problem was proven as NP-complete, we propose, under our Min-Energy Group COMmunication (MEGCOM) framework, three distributed approximation algorithms with provable approximation ratios. When the transmission power of each wireless node is fixed, our first two algorithms have the approximation ratios of O(ln(Δ+ 1)) and O(1), respectively, where Δis the maximum node degree in the network. When the transmission power of each wireless node is adjustable, our third algorithm again delivers a constant approximation ratio. We also use extensive simulations to verify the practical performance of our algorithms.

cs.NI↗

arXiv2012

Minimum-Energy All-to-All Multicasting in Multi-hop Wireless Networks

Designing energy-efficient all-to-all multicasting protocols is of of great importance for multi-hop wireless networks such as wireless sensor networks and wireless ad hoc networks. In an all-to-all multicast session, there exists a set of wireless destination nodes, and each destination node needs to send some data packets to all other destination nodes. We consider the problem of building a shared multicast tree spanning the destination nodes such that the total energy consumption of realizing an all-to-all multicast session using the shared multicast tree is minimized. Since building such a multicast tree has been proved to be NP-complete, we provide both centralized and distributed approximation algorithms with provable approximation ratios for it. When the transmission power of each wireless node is fixed, our centralized and distributed algorithms have the approximation ratios of $4ln(Δ+1)+7$ and 13, respectively, where $Δ$ is the maximum node degree in the network. When the transmission power of each wireless node is adjustable, both of our centralized and distributed algorithms have the constant approximation ratio of 145.

cs.NI↗

arXiv2011

Duty-Cycle-Aware Minimum-Energy Multicasting in Wireless Sensor Networks

In duty-cycled wireless sensor networks, the nodes switch between active and dormant states, and each node may determine its active/dormant schedule independently. This complicates the Minimum-Energy Multicasting (MEM) problem, which has been primarily studied in always-active wireless ad-hoc networks. In this paper, we study the duty-cycle-aware MEM problem in wireless sensor networks, and we present a formulation of the Minimum-Energy Multicast Tree Construction and Scheduling (MEMTCS) problem. We prove that the MEMTCS problem is NP-hard, and it is unlikely to have an approximation algorithm with a performance ratio of $(1-o(1))\lnΔ$, where $Δ$ is the maximum node degree in a network. We propose a polynomial-time approximation algorithm for the MEMTCS problem with a performance ratio of $\mathcal{O}(H(Δ+1))$, where $H(\cdot)$ is the harmonic number. We also provide a distributed implementation of our algorithm. Finally, we perform extensive simulations and the results demonstrate that our algorithm significantly outperform other known algorithms in terms of both the total energy cost and the transmission redundancy.

cs.NI↗

arXiv2011

Dual-Level Compressed Aggregation: Recovering Fields of Physical Quantities from Incomplete Sensory Data

Although wireless sensor networks (WSNs) are powerful in monitoring physical events, the data collected from a WSN are almost always incomplete if the surveyed physical event spreads over a wide area. The reason for this incompleteness is twofold: i) insufficient network coverage and ii) data aggregation for energy saving. Whereas the existing recovery schemes only tackle the second aspect, we develop Dual-lEvel Compressed Aggregation (DECA) as a novel framework to address both aspects. Specifically, DECA allows a high fidelity recovery of a widespread event, under the situations that the WSN only sparsely covers the event area and that an in-network data aggregation is applied for traffic reduction. Exploiting both the low-rank nature of real-world events and the redundancy in sensory data, DECA combines matrix completion with a fine-tuned compressed sensing technique to conduct a dual-level reconstruction process. We demonstrate that DECA can recover a widespread event with less than 5% of the data, with respect to the dimension of the event, being collected. Performance evaluation based on both synthetic and real data sets confirms the recovery fidelity and energy efficiency of our DECA framework.

cs.NI↗

arXiv2011

GeoQuorum: Load Balancing and Energy Efficient Data Access in Wireless Sensor Networks

When data productions and consumptions are heavily unbalanced and when the origins of data queries are spatially and temporally distributed, the so called in-network data storage paradigm supersedes the conventional data collection paradigm in wireless sensor networks (WSNs). In this paper, we first introduce geometric quorum systems (along with their metrics) to incarnate the idea of in-network data storage. These quorum systems are "geometric" because curves (rather than discrete node sets) are used to form quorums. We then propose GeoQuorum as a new quorum system, for which the quorum forming curves are parameterized. Though our proposal stems from the existing work on using curves to guide data replication and retrieval in dense WSNs, we significantly expand this design methodology, by endowing GeoQuorum with a great flexibility to fine-tune itself towards different application requirements. In particular, the tunability allows GeoQuorum to substantially improve the load balancing performance and to remain competitive in energy efficiency. Both our analysis and simulations confirm the performance enhancement brought by GeoQuorum.

cs.NI↗