Semiparametric Estimation of Heteroscedastic Binary Sample Selection Model

Binary choice sample selection models are widely used in applied economics with large cross-sectional data where heteroscedaticity is typically a serious concern. Existing parametric and semiparametric estimators for the binary selection equation and the outcome equation in such models suffer from serious drawbacks in the presence of heteroscedasticity of unknown form in the latent errors. In this paper we propose some new estimators to overcome these drawbacks under a symmetry condition, robust to both nonnormality and general heterscedasticity. The estimators are shown to be $\sqrt{n}$-consistent and asymptotically normal. We also indicate that our approaches may be extended to other important models.

Riemannian Acceleration with Preconditioning for symmetric eigenvalue problems

In this paper, we propose a Riemannian Acceleration with Preconditioning (RAP) for symmetric eigenvalue problems, which is one of the most important geodesically convex optimization problem on Riemannian manifold, and obtain the acceleration. Firstly, the preconditioning for symmetric eigenvalue problems from the Riemannian manifold viewpoint is discussed. In order to obtain the local geodesic convexity, we develop the leading angle to measure the quality of the preconditioner for symmetric eigenvalue problems. A new Riemannian acceleration, called Locally Optimal Riemannian Accelerated Gradient (LORAG) method, is proposed to overcome the local geodesic convexity for symmetric eigenvalue problems. With similar techniques for RAGD and analysis of local convex optimization in Euclidean space, we analyze the convergence of LORAG. Incorporating the local geodesic convexity of symmetric eigenvalue problems under preconditioning with the LORAG, we propose the Riemannian Acceleration with Preconditioning (RAP) and prove its acceleration. Additionally, when the Schwarz preconditioner, especially the overlapping or non-overlapping domain decomposition method, is applied for elliptic eigenvalue problems, we also obtain the rate of convergence as $1-C\kappa^{-1/2}$, where $C$ is a constant independent of the mesh sizes and the eigenvalue gap, $\kappa=\kappa_{\nu}\lambda_{2}/(\lambda_{2}-\lambda_{1})$, $\kappa_{\nu}$ is the parameter from the stable decomposition, $\lambda_{1}$ and $\lambda_{2}$ are the smallest two eigenvalues of the elliptic operator. Numerical results show the power of Riemannian acceleration and preconditioning.Comment: Due to the limit in abstract of arXiv, the abstract here is shorter than in PD

AUPress: A Comparison of an Open Access University Press with Traditional Presses

This study is a comparison of AUPress with three other traditional (non-open access) Canadian university presses. The analysis is based on the rankings that are correlated with book sales on Amazon.com and Amazon.ca. Statistical methods include the sampling of the sales ranking of randomly selected books from each press. The results of one-way ANOVA analyses show that there is no significant difference in the ranking of printed books sold by AUPress in comparison with traditional university presses. However, AUPress, can demonstrate a significantly larger readership for its books as evidenced by the number of downloads of the open electronic versions

An online synchronous test for professional interpreters

This article is based on an experiment designed to conduct an interpreting test for multiple candidates online, using web-based synchronous cyber classrooms. The test model was based on the accreditation test for Professional Interpreters produced by the National Accreditation Authority of Translators and Interpreters (NAATI) in Australia. Specifically, the test involved interpreting-specific components such as dialogue interpreting, sight translation, and consecutive interpreting, as well as non-interpreting-specific components such as questions on ethical issues. The test was conducted live synchronously and concurrently with multiple candidates – i.e., all candidates were tested in their own locations at the same time. The result of the experiment indicates the potential and feasibility of conducting interpreting tests online using the specific technology of synchronous cyber classrooms. However, there are also a number of constraints when compared to conventional face-to-face tests. There is a need for further studies on how to effectively apply this kind of technology to conduct interpreting tests for multiple candidates online in synchronous mode and without the constraints identified in this research

Scheduling for Multi-Camera Surveillance in LTE Networks

Wireless surveillance in cellular networks has become increasingly important, while commercial LTE surveillance cameras are also available nowadays. Nevertheless, most scheduling algorithms in the literature are throughput, fairness, or profit-based approaches, which are not suitable for wireless surveillance. In this paper, therefore, we explore the resource allocation problem for a multi-camera surveillance system in 3GPP Long Term Evolution (LTE) uplink (UL) networks. We minimize the number of allocated resource blocks (RBs) while guaranteeing the coverage requirement for surveillance systems in LTE UL networks. Specifically, we formulate the Camera Set Resource Allocation Problem (CSRAP) and prove that the problem is NP-Hard. We then propose an Integer Linear Programming formulation for general cases to find the optimal solution. Moreover, we present a baseline algorithm and devise an approximation algorithm to solve the problem. Simulation results based on a real surveillance map and synthetic datasets manifest that the number of allocated RBs can be effectively reduced compared to the existing approach for LTE networks.Comment: 9 pages, 10 figure

Uncovering the Deep Filter Bubble: Narrow Exposure in Short-Video Recommendation

Filter bubbles have been studied extensively within the context of online content platforms due to their potential to cause undesirable outcomes such as user dissatisfaction or polarization. With the rise of short-video platforms, the filter bubble has been given extra attention because these platforms rely on an unprecedented use of the recommender system to provide relevant content. In our work, we investigate the deep filter bubble, which refers to the user being exposed to narrow content within their broad interests. We accomplish this using one-year interaction data from a top short-video platform in China, which includes hierarchical data with three levels of categories for each video. We formalize our definition of a "deep" filter bubble within this context, and then explore various correlations within the data: first understanding the evolution of the deep filter bubble over time, and later revealing some of the factors that give rise to this phenomenon, such as specific categories, user demographics, and feedback type. We observe that while the overall proportion of users in a filter bubble remains largely constant over time, the depth composition of their filter bubble changes. In addition, we find that some demographic groups that have a higher likelihood of seeing narrower content and implicit feedback signals can lead to less bubble formation. Finally, we propose some ways in which recommender systems can be designed to reduce the risk of a user getting caught in a bubble.Comment: accepted to WWW 202

Incentive Strategies in User Community of Online Trading Platform——Bilateral Market Uncertainty Perspective

User community plays an important role in online trading platforms. It provides users a place to communicate, to solve problems and to exchange information with each other on an online trading platform which faced a bilateral market—seller and buyer participants. Beginning with the incentive strategy, this paper studies the influence of material and spiritual incentive strategies on online trading platform. In addition, the authors take bilateral market uncertainty as a moderator into consideration. By doing an empirical research of hard data from a representative domestic online trading platform, the result shows us that (1) both material and spiritual incentive strategies have significant effects on improving the community user loyalty; (2) both material and spiritual incentive strategies are almost equally beneficial in high seller user uncertainty; while spiritual incentive is more useful in high buyer user uncertainty