Measurement of the squeezed vacuum state by a bichromatic local oscillator

We present the experimental measurement of a squeezed vacuum state by means of a bichromatic local oscillator (BLO). A pair of local oscillators at $\pm$5 MHz around the central frequency $\omega_{0}$ of the fundamental field with equal power are generated by three acousto-optic modulators and phase-locked, which are used as a BLO. The squeezed vacuum light are detected by a phase-sensitive balanced-homodyne detection with a BLO. The baseband signal around $\omega_{0}$ combined with a broad squeezed field can be detected with the sensitivity below the shot-noise limit, in which the baseband signal is shifted to the vicinity of 5 MHz (the half of the BLO separation). This work has the important applications in quantum state measurement and quantum informatio

Semi-supervised Text Regression with Conditional Generative Adversarial Networks

Enormous online textual information provides intriguing opportunities for understandings of social and economic semantics. In this paper, we propose a novel text regression model based on a conditional generative adversarial network (GAN), with an attempt to associate textual data and social outcomes in a semi-supervised manner. Besides promising potential of predicting capabilities, our superiorities are twofold: (i) the model works with unbalanced datasets of limited labelled data, which align with real-world scenarios; and (ii) predictions are obtained by an end-to-end framework, without explicitly selecting high-level representations. Finally we point out related datasets for experiments and future research directions

Estimation of Markov Chain via Rank-Constrained Likelihood

This paper studies the estimation of low-rank Markov chains from empirical trajectories. We propose a non-convex estimator based on rank-constrained likelihood maximization. Statistical upper bounds are provided for the Kullback-Leiber divergence and the $\ell_2$ risk between the estimator and the true transition matrix. The estimator reveals a compressed state space of the Markov chain. We also develop a novel DC (difference of convex function) programming algorithm to tackle the rank-constrained non-smooth optimization problem. Convergence results are established. Experiments show that the proposed estimator achieves better empirical performance than other popular approaches.Comment: Accepted at ICML 201

Conceptual development of a novel photovoltaic-thermoelectric system and preliminary economic analysis

© 2016 Elsevier Ltd Photovoltaic-thermoelectric (PV-TE) hybrid system is one typical electrical production based on the solar wide-band spectral absorption. However the PV-TE system appears to be economically unfeasible owing to the significantly higher cost and lower power output. In order to overcome this disadvantage, a novel PV-TE system based on the flat plate micro-channel heat pipe was proposed in this paper. The mathematic model was built and the performance under different ambient conditions was analyzed. In addition, the annual performance and the preliminary economic analysis of the new PV-TE system was also made to compare to the conventional PV system. The results showed that the new PV-TE has a higher electrical output and economic performance

An asymptotically superlinearly convergent semismooth Newton augmented Lagrangian method for Linear Programming

Powerful interior-point methods (IPM) based commercial solvers, such as Gurobi and Mosek, have been hugely successful in solving large-scale linear programming (LP) problems. The high efficiency of these solvers depends critically on the sparsity of the problem data and advanced matrix factorization techniques. For a large scale LP problem with data matrix $A$ that is dense (possibly structured) or whose corresponding normal matrix $AA^T$ has a dense Cholesky factor (even with re-ordering), these solvers may require excessive computational cost and/or extremely heavy memory usage in each interior-point iteration. Unfortunately, the natural remedy, i.e., the use of iterative methods based IPM solvers, although can avoid the explicit computation of the coefficient matrix and its factorization, is not practically viable due to the inherent extreme ill-conditioning of the large scale normal equation arising in each interior-point iteration. To provide a better alternative choice for solving large scale LPs with dense data or requiring expensive factorization of its normal equation, we propose a semismooth Newton based inexact proximal augmented Lagrangian ({\sc Snipal}) method. Different from classical IPMs, in each iteration of {\sc Snipal}, iterative methods can efficiently be used to solve simpler yet better conditioned semismooth Newton linear systems. Moreover, {\sc Snipal} not only enjoys a fast asymptotic superlinear convergence but is also proven to enjoy a finite termination property. Numerical comparisons with Gurobi have demonstrated encouraging potential of {\sc Snipal} for handling large-scale LP problems where the constraint matrix $A$ has a dense representation or $AA^T$ has a dense factorization even with an appropriate re-ordering.Comment: Due to the limitation "The abstract field cannot be longer than 1,920 characters", the abstract appearing here is slightly shorter than that in the PDF fil