On the optimum design of unitary cyclic group space-time codes

In this letter, based on the exact pairwise-error probability, we derive the union bound on the symbol-error probability (SEP) of the differential unitary space-time (DUST) modulation employing group codes. Instead of using the rank-and-determinant or Euclidean distance criteria, we optimize the cyclic group codes such that the union bound on the SEP is minimized for a predetermined scenario, taking into account the number of transmit and receive antennas and the operating signal-to-noise ratio (SNR). Our simulation results show that for a wide range of SNRs, the codes with the minimum union bound for a particular SNR outperform the codes designed based on rank-and-determinant or Euclidean distance criteria.     

Nonparametric Analysis of the Order-Statistic Model in Software Reliability

In the literature on statistical inference in software reliability, the assumptions of parametric models and random sampling of bugs have been pervasive. We argue that both assumptions are problematic, the first because of robustness concerns and the second due to logical and practical difficulties. These considerations motivate the approach taken in this paper. We propose a nonparametric software reliability model based on the order-statistic paradigm. The objective of the work is to estimate, from data on discovery times observed within a type I censoring framework, both the underlying distribution F from which discovery times are generated and N, the unknown number of bugs in the software. The estimates are used to predict the next time to failure. The approach makes use of Bayesian nonparametric inference methods, in particular, the beta-Stacy process. The proposed methodology is illustrated on both real and simulated data     

当道路难行时,尽快转向无带方向——Sony XDCAM HD高清系统全程支持2006陆虎G4越野挑战赛

陆虎（Land Rover）G4越野挑战赛．是各大汽车公司彼此互相交流的重大活动。经过三年多的精心准备．2006年G4挑战赛正式拉开了帷幕——一个月时间，18组挑战者．4000公里行程．跨越泰国、老挝、巴西和波利维亚。本届赛事是2003年G4挑战赛的延续．它的前身就是2000年结束的“骆驼杯”越野挑战赛。     

The influence of morphological information on cataphoric pronoun assignment.

In 3 eye-tracking experiments, the authors investigated the use of morphological information during pronoun resolution. Experiments 1 and 2 showed that disruption occurred when a preferred assignment was inconsistent with gender information. Experiment 2 ensured that this difficulty was not due to the introduction of a new discourse entity. Experiment 3 showed that disruption also occurred when number information was inconsistent with the preferred assignment. The results indicate that the use of morphological information is delayed until after the computation of coreference relations. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

Parallel associative combinator evaluation II

A new evaluation model for SK combinator expressions is presented and used as a basis for the design of a novel processor. The resulting machine architecture resembles a dataflow ring, but executions are constrained to be fully lazy. An automatic dynamic load sharing mechanism for a distributed multiprocessor architecture is suggested, and initial simulation results are presented.