网络侵权投诉的平台审核及边界

现行法律规定网络平台侵权投诉（即通知）的形式审查,在机制目的设置上,旨在降低平台实质审查带来的高成本。然而,过于简单的形式审查要件之规定对平台的稳定性与人力审核成本反而提出了更高的要求。为维护平台信息数据的稳定性,平台难免会选择实质审查来减少形式审查所产生的信息波动。这又与网络平台侵权投诉形式审查的宗旨相悖。平台针对不同的权利类型的投诉进行审核,其中最为核心的就是对“构成侵权的初步证明材料”的把握。这个过程是个主观大于客观的自我内心确信。在以高度盖然性为标准的大前提下,网络平台要做的是权利归属的恰当性判断。     

单窃听双跳协作网络的中继选择方案及其性能分析

研究了安全通信意义下,单向译码转发（decode-and-forward,DF）协作无线网络的中继选择问题。针对窃听者既能获得信源发出的信号,又能窃取中继节点转发数据的通信系统,提出了3种中继选择方案来对抗窃听者,增强系统物理层安全性。其中,方案一选择到窃听者信噪比（signal-to-noise ratio,SNR）最小的中继节点;方案二为最大最小（max-min）选择方案,即选择信源到中继节点和中继节点到信宿的较差信噪比中最大值所对应的中继节点;方案三根据窃听信道和主信道的瞬时信道状态信息（channel state information,CSI）选择使得窃听网络有最大保密容量的中继节点。在对各方案的性能分析过程中,得到了各中继选择方案拦截概率的闭式表示,进一步对拦截概率作渐近分析,获得了各中继选择方案的分集阶数。具体地,方案一的分集阶数为1,另外2个中继选择方案的分集阶数均为中继节点个数M。数值结果验证了理论分析得到的结论。     

Outlier detection and robust variable selection via the penalized weighted LAD-LASSO method

This paper studies the outlier detection and robust variable selection problem in the linear regression model. The penalized weighted least absolute deviation (PWLAD) regression estimation method and the adaptive least absolute shrinkage and selection operator (LASSO) are combined to simultaneously achieve outlier detection, and robust variable selection. An iterative algorithm is proposed to solve the proposed optimization problem. Monte Carlo studies are evaluated the finite-sample performance of the proposed methods. The results indicate that the finite sample performance of the proposed methods performs better than that of the existing methods when there are leverage points or outliers in the response variable or explanatory variables. Finally, we apply the proposed methodology to analyze two real datasets.     

论科学证据的两种概率解释

在科学证据研究中,存在＂正相关＂和＂高概率＂两种科学证据的概率定义。从这两个定义出发,能够比较清晰直观地解释科学证据的许多相关问题,如科学证据中的＂比较级＂和＂可接受性＂等。然而,两个定义自身存在着不可忽视的缺陷：＂正相关＂不是证据的充要条件,＂高概率＂也不足以使证据之为证据。     

Uniform in bandwidth consistency for various kernel estimators involving functional data

The paper investigates various nonparametric models including regression, conditional distribution, conditional density and conditional hazard function, when the covariates are infinite dimensional. The main contribution is to prove uniform in bandwidth asymptotic results for kernel estimators of these functional operators. Then, the application issues, involving data-driven bandwidth selection, are discussed.     

Exact average coverage probabilities and confidence coefficients of confidence intervals for discrete distributions

For a confidence interval (L(X),U(X)) of a parameter θ in one-parameter discrete distributions, the coverage probability is a variable function of θ. The confidence coefficient is the infimum of the coverage probabilities, inf  _θ P _θ (θ∈(L(X),U(X))). Since we do not know which point in the parameter space the infimum coverage probability occurs at, the exact confidence coefficients are unknown. Beside confidence coefficients, evaluation of a confidence intervals can be based on the average coverage probability. Usually, the exact average probability is also unknown and it was approximated by taking the mean of the coverage probabilities at some randomly chosen points in the parameter space. In this article, methodologies for computing the exact average coverage probabilities as well as the exact confidence coefficients of confidence intervals for one-parameter discrete distributions are proposed. With these methodologies, both exact values can be derived.     

Deconvolution methods for non-parametric inference in two-level mixed models

Summary.  We develop a general non-parametric approach to the analysis of clustered data via random effects. Assuming only that the link function is known, the regression functions and the distributions of both cluster means and observation errors are treated non-parametrically. Our argument proceeds by viewing the observation error at the cluster mean level as though it were a measurement error in an errors-in-variables problem, and using a deconvolution argument to access the distribution of the cluster mean. A Fourier deconvolution approach could be used if the distribution of the error-in-variables were known. In practice it is unknown, of course, but it can be estimated from repeated measurements, and in this way deconvolution can be achieved in an approximate sense. This argument might be interpreted as implying that large numbers of replicates are necessary for each cluster mean distribution, but that is not so; we avoid this requirement by incorporating statistical smoothing over values of nearby explanatory variables. Empirical rules are developed for the choice of smoothing parameter. Numerical simulations, and an application to real data, demonstrate small sample performance for this package of methodology. We also develop theory establishing statistical consistency.     

Shrinkage inverse regression estimation for model-free variable selection

Summary.  The family of inverse regression estimators that was recently proposed by Cook and Ni has proven effective in dimension reduction by transforming the high dimensional predictor vector to its low dimensional projections. We propose a general shrinkage estimation strategy for the entire inverse regression estimation family that is capable of simultaneous dimension reduction and variable selection. We demonstrate that the new estimators achieve consistency in variable selection without requiring any traditional model, meanwhile retaining the root n estimation consistency of the dimension reduction basis. We also show the effectiveness of the new estimators through both simulation and real data analysis.     

On distribution-weighted partial least squares with diverging number of highly correlated predictors

Summary.  Because highly correlated data arise from many scientific fields, we investigate parameter estimation in a semiparametric regression model with diverging number of predictors that are highly correlated. For this, we first develop a distribution-weighted least squares estimator that can recover directions in the central subspace, then use the distribution-weighted least squares estimator as a seed vector and project it onto a Krylov space by partial least squares to avoid computing the inverse of the covariance of predictors. Thus, distrbution-weighted partial least squares can handle the cases with high dimensional and highly correlated predictors. Furthermore, we also suggest an iterative algorithm for obtaining a better initial value before implementing partial least squares. For theoretical investigation, we obtain strong consistency and asymptotic normality when the dimension p of predictors is of convergence rate O { n ^1/2/ log ( n )} and o ( n ^1/3) respectively where n is the sample size. When there are no other constraints on the covariance of predictors, the rates n ^1/2 and n ^1/3 are optimal. We also propose a Bayesian information criterion type of criterion to estimate the dimension of the Krylov space in the partial least squares procedure. Illustrative examples with a real data set and comprehensive simulations demonstrate that the method is robust to non-ellipticity and works well even in 'small n –large p ' problems.