arXiv subjects

Xi Liu

Publications and source records attributed to Xi Liu.

125 records · Page 7Linked to original sources

arXiv2016

Quenching effect in below-threshold high harmonic generation

We theoretically demonstrate the quenching effect in below-threshold high harmonic generation (HHG) by using the time-dependent density-functional theory (TDDFT) and solving the time-dependent Schrödinger equation (TDSE). It is shown that the HHG is substantially suppressed in particular harmonic orders in the below-threshold region when multi-electron interaction comes into play. The position of the suppression is determined by the energy gap between the highest occupied orbital and the higher-lying orbital of the target. We show that the quenching effect is due to a new class of multi-electron dynamics involving electron-electron energy transfer, which is analog to the fluorescence quenching owing to the energy transfer between molecules in fluorescent material. This work reveals the important role of the multi-electron interaction on HHG especially in the below-threshold region.

physics.atom-ph↗

arXiv2016

The selection rules of high harmonic generation: the symmetries of molecules and laser fields

The selection rules of high harmonic generation (HHG) are investigated using three-dimensional time-dependent density functional theory (TDDFT). From the harmonic spectra obtained with various real molecules and different forms of laser fields, several factors that contribute to selection rules are revealed. Extending the targets to stereoscopic molecules, it is shown that the allowed harmonics are dependent on the symmetries of the projections of molecules. For laser fields, the symmetries contributing to the selection rules are discussed according to Lissajous figures and their dynamical directivities. All the phenomena are explained by the symmetry of the full time-dependent Hamiltonian under a combined transformation. We present a systematic study on the selection rules and propose an intuitive method for the judgment of allowed harmonic orders, which can be extended to more complex molecules and various forms of laser pulses.

physics.atom-ph↗

arXiv2016

Maximum Correntropy Unscented Filter

The unscented transformation (UT) is an efficient method to solve the state estimation problem for a non-linear dynamic system, utilizing a derivative-free higher-order approximation by approximating a Gaussian distribution rather than approximating a non-linear function. Applying the UT to a Kalman filter type estimator leads to the well-known unscented Kalman filter (UKF). Although the UKF works very well in Gaussian noises, its performance may deteriorate significantly when the noises are non-Gaussian, especially when the system is disturbed by some heavy-tailed impulsive noises. To improve the robustness of the UKF against impulsive noises, a new filter for nonlinear systems is proposed in this work, namely the maximum correntropy unscented filter (MCUF). In MCUF, the UT is applied to obtain the prior estimates of the state and covariance matrix, and a robust statistical linearization regression based on the maximum correntropy criterion (MCC) is then used to obtain the posterior estimates of the state and covariance. The satisfying performance of the new algorithm is confirmed by two illustrative examples.

stat.ML↗

arXiv2016

Revealing travel patterns and city structure with taxi trip data

Detecting regional spatial structures based on spatial interactions is crucial in applications ranging from urban planning to traffic control. In the big data era, various movement trajectories are available for studying spatial structures. This research uses large scale Shanghai taxi trip data extracted from GPS-enabled taxi trajectories to reveal traffic flow patterns and urban structure of the city. Using the network science methods, 15 temporally stable regions reflecting the scope of people's daily travels are found using community detection method on the network built from short trips, which represent residents' daily intra-urban travels and exhibit a clear pattern. In each region, taxi traffic flows are dominated by a few 'hubs' and 'hubs' in suburbs impact more trips than 'hubs' in urban areas. Land use conditions in urban regions are different from those in suburban areas. Additionally, 'hubs' in urban area associate with office buildings and commercial areas more, whereas residential land use is more common in suburban hubs. The taxi flow structures and land uses reveal the polycentric and layered concentric structure of Shanghai. Finally, according to the temporal variations of taxi flows and the diversity levels of taxi trip lengths, we explore the total taxi traffic properties of each region and proved the city structure we find. External trips across regions also take large proportion of the total traffic in each region, especially in suburbs. The results could help transportation policy making and shed light on the way to reveal urban structures with big data.

physics.soc-ph↗

arXiv2015

A note on the dynamic dominant resource fairness mechanism

Multi-resource fair allocation has beena hot topic of resource allocation. Most recently, a dynamic dominant resource fairness (DRF) mechanism is proposed for dynamic multi-resource fair allocation. In this paper, we prove that the competitive ratio of the dynamic DRF mechanism is the reciprocal of the number of resource types, for two different objectives. Moreover, we develop a linear-time algorithm to find a dynamic DRF solution at each step.

cs.GT↗

arXiv2015

Maximum Correntropy Kalman Filter

Traditional Kalman filter (KF) is derived under the well-known minimum mean square error (MMSE) criterion, which is optimal under Gaussian assumption. However, when the signals are non-Gaussian, especially when the system is disturbed by some heavy-tailed impulsive noises, the performance of KF will deteriorate seriously. To improve the robustness of KF against impulsive noises, we propose in this work a new Kalman filter, called the maximum correntropy Kalman filter (MCKF), which adopts the robust maximum correntropy criterion (MCC) as the optimality criterion, instead of using the MMSE. Similar to the traditional KF, the state mean and covariance matrix propagation equations are used to give prior estimations of the state and covariance matrix in MCKF. A novel fixed-point algorithm is then used to update the posterior estimations. A sufficient condition that guarantees the convergence of the fixed-point algorithm is given. Illustration examples are presented to demonstrate the effectiveness and robustness of the new algorithm.

stat.ML↗

arXiv2015

A Task-Type-Based Algorithm for the Energy-Aware Profit Maximizing Scheduling Problem in Heterogeneous Computing Systems

In this paper, we design an efficient algorithm for the energy-aware profit maximizing scheduling problem, where the high performance computing system administrator is to maximize the profit per unit time. The running time of the proposed algorithm is depending on the number of task types, while the running time of the previous algorithm is depending on the number of tasks. Moreover, we prove that the worst-case performance ratio is close to 2, which maybe the best result. Simulation experiments show that the proposed algorithm is more accurate than the previous method.

cs.DC↗

arXiv2013

Lossy Computing of Correlated Sources with Fractional Sampling

This paper considers the problem of lossy compression for the computation of a function of two correlated sources, both of which are observed at the encoder. Due to presence of observation costs, the encoder is allowed to observe only subsets of the samples from both sources, with a fraction of such sample pairs possibly overlapping. The rate-distortion function is characterized for memory-less sources, and then specialized to Gaussian and binary sources for selected functions and with quadratic and Hamming distortion metrics, respectively. The optimal measurement overlap fraction is shown to depend on the function to be computed by the decoder, on the source statistics, including the correlation, and on the link rate. Special cases are discussed in which the optimal overlap fraction is the maximum or minimum possible value given the sampling budget, illustrating non-trivial performance trade-offs in the design of the sampling strategy. Finally, the analysis is extended to the multi-hop set-up with jointly Gaussian sources, where each encoder can observe only one of the sources.

cs.IT↗

arXiv2013

Transmission Schemes for Gaussian Interference Channels with Transmitter Processing Energy

This work considers communication over Gaussian interference channels with processing energy cost, which explicitly takes into account the energy expended for processing when transmitters are on. In the presence of processing energy cost, transmitting all the time as in the conventional no-cost case is no longer optimal. For a two-user Gaussian interference channel with processing energy cost, assuming that the on-off states of transmitters are not utilized for signaling, several transmission schemes with varying complexities are proposed and their sum rates are compared with an interference-free upper bound. Moreover, the very strong interference regime, under which interference does not incur any rate penalty, is identified and shown to be larger than the case of no processing energy cost for certain scenarios of interest. Also, extensions to a three-user cascade Gaussian Z interference channel with processing energy cost are provided, where scheduling of user transmissions based on the channel set-up is investigated.

cs.IT↗

arXiv2012

Energy-Efficient Sensing and Communication of Parallel Gaussian Sources

Energy efficiency is a key requirement in the design of wireless sensor networks. While most theoretical studies only account for the energy requirements of communication, the sensing process, which includes measurements and compression, can also consume comparable energy. In this paper, the problem of sensing and communicating parallel sources is studied by accounting for the cost of both communication and sensing. In the first formulation of the problem, the sensor has a separate energy budget for sensing and a rate budget for communication, while, in the second, it has a single energy budget for both tasks. Assuming that sources with larger variances have lower sensing costs, the optimal allocation of sensing energy and rate that minimizes the overall distortion is derived for the first problem. Moreover, structural results on the solution of the second problem are derived under the assumption that the sources with larger variances are transmitted on channels with lower noise. Closed-form solutions are also obtained for the case where the energy budget is sufficiently large. For an arbitrary order on the variances and costs, the optimal solution to the first problem is also obtained numerically and compared with several suboptimal strategies.

cs.IT↗

arXiv2011

On the Gaussian Z-Interference Channel with Processing Energy Cost

This work considers a Gaussian interference channel with processing energy cost, which explicitly takes into account the energy expended for processing when each transmitter is on. With processing overhead, bursty transmission at each transmitter generally becomes more advantageous. Assuming on-off states do not carry information, for a two-user Z-interference channel, the new regime of very strong interference is identified and shown to be enlarged compared with the conventional one. With the interfered receiver listening when its own transmitter is silent, for a wide range of cross-link power gains, one can either achieve or get close to the interference-free upper bound on sum rate.

cs.IT↗

arXiv2011

A Secure Communication Game with a Relay Helping the Eavesdropper

In this work a four terminal complex Gaussian network composed of a source, a destination, an eavesdropper and a jammer relay is studied under two different set of assumptions: (i) The jammer relay does not hear the source transmission, and (ii) The jammer relay is causally given the source message. In both cases the jammer relay assists the eavesdropper and aims to decrease the achievable secrecy rates. The source, on the other hand, aims to increase it. To help the eavesdropper, the jammer relay can use pure relaying and/or send interference. Each of the problems is formulated as a two-player, non-cooperative, zero-sum continuous game. Assuming Gaussian strategies at the source and the jammer relay in the first problem, the Nash equilibrium is found and shown to be achieved with mixed strategies in general. The optimal cumulative distribution functions (cdf) for the source and the jammer relay that achieve the value of the game, which is the Nash equilibrium secrecy rate, are found. For the second problem, the Nash equilibrium solution is found and the results are compared to the case when the jammer relay is not informed about the source message.

cs.IT↗

arXiv2011

A Game-Theoretic View of the Interference Channel: Impact of Coordination and Bargaining

This work considers coordination and bargaining between two selfish users over a Gaussian interference channel. The usual information theoretic approach assumes full cooperation among users for codebook and rate selection. In the scenario investigated here, each user is willing to coordinate its actions only when an incentive exists and benefits of cooperation are fairly allocated. The users are first allowed to negotiate for the use of a simple Han-Kobayashi type scheme with fixed power split. Conditions for which users have incentives to cooperate are identified. Then, two different approaches are used to solve the associated bargaining problem. First, the Nash Bargaining Solution (NBS) is used as a tool to get fair information rates and the operating point is obtained as a result of an optimization problem. Next, a dynamic alternating-offer bargaining game (AOBG) from bargaining theory is introduced to model the bargaining process and the rates resulting from negotiation are characterized. The relationship between the NBS and the equilibrium outcome of the AOBG is studied and factors that may affect the bargaining outcome are discussed. Finally, under certain high signal-to-noise ratio regimes, the bargaining problem for the generalized degrees of freedom is studied.

cs.IT↗

arXiv2010

Alternating-Offer Bargaining Games over the Gaussian Interference Channel

This paper tackles the problem of how two selfish users jointly determine the operating point in the achievable rate region of a two-user Gaussian interference channel through bargaining. In previous work, incentive conditions for two users to cooperate using a simple version of Han-Kobayashi scheme was studied and the Nash bargaining solution (NBS) was used to obtain a fair operating point. Here a noncooperative bargaining game of alternating offers is adopted to model the bargaining process and rates resulting from the equilibrium outcome are analyzed. In particular, it is shown that the operating point resulting from the formulated bargaining game depends on the cost of delay in bargaining and how bargaining proceeds. If the associated bargaining problem is regular, a unique perfect equilibrium exists and lies on the individual rational efficient frontier of the achievable rate region. Besides, the equilibrium outcome approaches the NBS if the bargaining costs of both users are negligible.

cs.IT↗

arXiv2010

Coordination and Bargaining over the Gaussian Interference Channel

This work considers coordination and bargaining between two selfish users over a Gaussian interference channel using game theory. The usual information theoretic approach assumes full cooperation among users for codebook and rate selection. In the scenario investigated here, each selfish user is willing to coordinate its actions only when an incentive exists and benefits of cooperation are fairly allocated. To improve communication rates, the two users are allowed to negotiate for the use of a simple Han-Kobayashi type scheme with fixed power split and conditions for which users have incentives to cooperate are identified. The Nash bargaining solution (NBS) is used as a tool to get fair information rates. The operating point is obtained as a result of an optimization problem and compared with a TDM-based one in the literature.

cs.IT↗

arXiv2009

A Secure Communication Game with a Relay Helping the Eavesdropper

In this work a four terminal Gaussian network composed of a source, a destination, an eavesdropper and a jammer relay is studied. The jammer relay does not hear the source transmission. It assists the eavesdropper and aims to decrease the achievable secrecy rates. The source, on the other hand, aims to increase the achievable secrecy rates. Assuming Gaussian strategies at the source and the jammer relay, this problem is formulated as a two-player zero-sum continuous game, where the payoff is the achieved secrecy rate. For this game the Nash Equilibrium is generally achieved with mixed strategies. The optimal cumulative distribution functions for the source and the jammer relay that achieve the value of the game, which is the equilibrium secrecy rate, are found.

cs.IT↗

arXiv2000

Dielectric nonlinearity of relaxor ferroelectric ceramics at low ac drives

Dielectric nonlinear response of (PbMg$_{1/3}$Nb$_{2/3}$O$_3$)$_{0.9}$(PbTiO$_3$)$_{0.1}$ (0.9PMN-0.1PT) relaxor ceramics was investigated under different ac drive voltages. It was observed that: (i) the dielectric permittivity is independent on ac field amplitude at high temperatures; (ii) with increasing ac drive, the permittivity maximum increases, and the temperature of the maximum shifts to lower temperature; (iii) the nonlinear effect is weakened when the measurement frequency increases. The influences of increasing ac drive were found to be similar to that of decreasing frequency. It is believed that the dielectric nonlinearities of relaxors at low drives can be explained by the phase transition theory of ergodic space shrinking in succession. A Monte Carlo simulation was performed on the flips of micro polarizations at low ac drives to verify the theory.

cond-mat.mtrl-sci↗