浅谈我国现行立法、执法、司法的现状及其局限性

我国现行法律体系完整，但在法律权力运作的过程中局限不小，实效不大，必须在党的领导下，合理地配置法律权力，使法律做到真正独立，充分发挥法律为人民服务的作用。     

A multivariate empirical characteristic function test of independence with normal marginals

This paper proposes a semi-parametric test of independence (or serial independence) between marginal vectors each of which is normally distributed but without assuming the joint normality of these marginal vectors. The test statistic is a Cramér–von Mises functional of a process defined from the empirical characteristic function. This process is defined similarly as the process of Ghoudi et al. [J. Multivariate Anal. 79 (2001) 191] built from the empirical distribution function and used to test for independence between univariate marginal variables. The test statistic can be represented as a V-statistic. It is consistent to detect any form of dependence. The weak convergence of the process is derived. The asymptotic distribution of the Cramér–von Mises functionals is approximated by the Cornish–Fisher expansion using a recursive formula for cumulants and inversion of the characteristic function with numerical evaluation of the eigenvalues. The test statistic is finally compared with Wilks statistic for testing the parametric hypothesis of independence in the one-way MANOVA model with random effects.     

美国独立战争时期黑人争取解放的道路

美国独立战争时期，广大黑人肩负争取国家独立和自身解放的双重任务。他们通过参加独立战争、向议会递交请愿书等“合法”斗争和进行武装起义、逃亡等“非法”斗争的道路来争取自由和解放。但在当时的条件下，他们取得的成绩非常有限，仅取得了局部斗争的胜利，要想彻底打碎他们身上的枷锁是不可能的。     

On the generation of circuits and minimal forbidden sets

We present several complexity results related to generation and counting of all circuits of an independence system. Our motivation to study these problems is their relevance in the solution of resource constrained scheduling problems, where an independence system arises as the subsets of jobs that may be scheduled simultaneously. We are interested in the circuits of this system, the so-called minimal forbidden sets, which are minimal subsets of jobs that must not be scheduled simultaneously. As a consequence of the complexity results for general independence systems, we obtain several complexity results in the context of resource constrained scheduling. On that account, we propose and analyze a simple backtracking algorithm that generates all minimal forbidden sets for such problems. The performance of this algorithm, in comparison to a previously suggested divide-and-conquer approach, is evaluated empirically using instances from the project scheduling library PSPLIB.Acknowledgement We appreciate the input of two anonymous referees. Particularly the deep remarks of one of them greatly improved our understanding of several issues; he also suggested the simplified Example 1. We thank Marc Pfetsch and Alexander Grigoriev for several enlightening discussions. Marc Pfetsch also pointed us to the paper [15]. Parts of this work were done while the authors were PhD students at the Technische Universität Berlin, Germany, where Frederik Stork was supported by DFG grant Mo 446/3-3, and Marc Uetz was supported by bmb+f grant 03-MO7TU1-3 and GIF grant I 246-304.02/97.     

A note on the edge cover number and independence number in hypergraphs

Consider a hypergraph of rank r>2 with m edges, independence number α and edge cover number ρ. We prove the inequality

     

A lower bound on independence in terms of degrees

We prove a new lower bound on the independence number of a simple connected graph in terms of its degrees.     

A suggested statistical test for measuring bivariate nonlinear dependence

We devise a new asymptotic statistical test to assess independence in bivariate continuous distributions. Our approach is based on the Cramér–von Mises test, in which the empirical process is viewed as the Kullback–Leibler divergence, that is, as the distance between the data under the independence hypothesis and the data empirically observed. We derive the theoretical characteristic function of the limit distribution of the test statistic and find the critical values through computer simulation. A Monte Carlo experiment is considered as assessing the validation and power performance of the test by assuming a bivariate nonlinear dependence structure with fat tails. Two extra examples, respectively, consider stationary and conditionally nonstationary series. Results confirm that our suggested test is consistent and powerful in the presence of bivariate nonlinear dependence even if the environment is non-Gaussian. Our case is illustrated with high-frequency data from stocks listed on the NYSE that recently experienced so-called mini-flash crashes.     

An application of Vizing and Vizing-like adjacency lemmas to Vizing’s Independence Number Conjecture of edge chromatic critical graphs

In 1968, Vizing conjectured that, if G is a Δ-critical graph with n vertices, then , where α(G) is the independence number of G. In this note, we apply Vizing and Vizing-like adjacency lemmas to this problem and obtain better bounds for Δ∈{7,…,19}.     

论圣马丁在军事上的贡献

圣马丁是拉丁美洲独立运动中涌现出的著名军事家。其军事上的主要贡献是制定和实施了解放南美洲的战略计划 ;对智利和秘鲁的殖民军实行“攻心”政治战 ;重视士兵的训练 ;强化后勤保障工作 ;组建智利海军 ,从海上向西班牙殖民军发起进攻