Simple Sequence Repeat Markers in Genetic Divergence and Marker-Assisted Selection of Rice Cultivars: A Review

Sequencing of rice genome has facilitated the understanding of rice evolution and has been utilized extensively for mining of DNA markers to facilitate marker-assisted breeding. Simple sequence repeat (SSR) markers that are tandemly repeated nucleotide sequence motifs flanked by unique sequences are presently the maker of choice in rice improvement due to their abundance, co-dominant inheritance, high levels of allelic diversity, and simple reproducible assay. The current level of genome coverage by SSR markers in rice is sufficient to employ them for genotype identification and marker-assisted selection in breeding for mapping of genes and quantitative trait loci analysis. This review provides comprehensive information on the mapping and applications of SSR markers in investigation of rice cultivars to study their genetic divergence and marker-assisted selection of important agronomic traits.     

Iterative equalization combining algorithm in intersymbol interference channel

To realize joint optimization of spatial diversity and equalization combining in the intersymbol interference (ISI) channel, an iterative equalization combining algorithm is proposed. The proposed algorithm uses the coefficients of Turbo equalization to calculate the combination weights without estimating the signal to noise ratio in each diversity branch. The equalized symbols from different diversity branches are combined, and the extrinsic information output from the decoder is fed back to the equalizers, so as to exchange soft information between the equalizers and the decoder. The performance of the proposed algorithm is analyzed using the extrinsic information transfer (EXIT) chart and verified by simulations. Results show that our approach fully exploits time domain information from the multipath channel and spatial domain information from multi receiving antennas, which efficiently improve the performance of the receiver in the severe ISI channel.     

A case-deletion diagnostic for penalized calibration estimators and BLUP under linear mixed models in survey sampling

The penalized calibration technique in survey sampling combines usual calibration and soft calibration by introducing a penalty term. Certain relevant estimates in survey sampling can be considered as penalized calibration estimates obtained as particular cases from an optimization problem with a common basic structure. In this framework, a case deletion diagnostic is proposed for a class of penalized calibration estimators including both design-based and model-based estimators. The diagnostic compares finite population parameter estimates and can be calculated from quantities related to the full data set. The resulting diagnostic is a function of the residual and leverage, as other diagnostics in regression models, and of the calibration weight, a singular feature in survey sampling. Moreover, a particular case, which includes the basic unit level model for small area estimation, is considered. Both a real and an artificial example are included to illustrate the diagnostic proposed. The results obtained clearly show that the proposed diagnostic depends on the calibration and soft-calibration variables, on the penalization term, as well as on the parameter to estimate.     

嵌入式盲文单手输入系统设计与实现

计算机录入编辑盲文是信息处理的特殊应用领域，是特殊教育中的重要研究课题。文中将盲文制作为特殊符号，通过制作字库，编写个性化码表，然后嵌入到主流输入法，从而实现盲文与汉字混排以及实现单手盲文输入。该系统具有易学易记性、盲文编码多样性、嵌入性强等优点，并通过实验证明输入盲文效率能提高5~6倍，在盲文出版、盲文印刷、盲文教学等领域有重要的应用价值。但盲文字符在不同平台(如智能手机)与不同操作系统兼容性问题还有待进一步研究开发。     

p-Median and p-dispersion problems: A bi-criteria analysis

Given a collection of n locations and a symmetric measure of distance (difference) between each pair of locations, we seek to identify (select) a subset of p locations so as to achieve two distinct objectives. The first objective is to use the selected locations as centers (medians) of p groups that would partition the entire collection and minimize the total distance between the locations and their respective group medians. The second objective is to maximize the minimum distance (diversity) among the selected locations themselves. We study this problem as a multi-objective optimization problem and propose an iterative algorithm to obtain its non-dominated frontier. At each iteration we construct and solve a 0–1 integer programming problem. Through a computational experiment we show that this algorithm is computationally effective for small to medium size instances of the problem. We also propose a Lagrangian heuristic algorithm for solving larger instances of this problem.     

一种改进的MC-CDMA系统结构

MC-CDMA在频域扩频时实际上是一种频率分集,对于频率分集重数的要求通常小于子载波的数目N,故扩频因子可以小于子载波数目。改进了这种MC-CDMA系统的结构,通过在频域引入交织器,使交织后频率分集各分量经历独立的哀落,从而提高了抗哀落能力。最后给出了用系统仿真软件SPW仿真的结果。     

MIMO系统中简单的扩展空时块编码分集技术研究

本文提出一种多输入多输出（MIMO）天线系统中简单的扩展空时块编码（SSTBC）分集技术，采用沃尔什码来区分各天线发送数据子流。采用这种方法，在系统带宽一定时，不降低发送信息速率，同时接收机简单。不同天线的发送信息经过了所有收一发天线对之间的空间子信道，获得了所有路径的部分空间分集增益，仿真结果表明，这种增益的获得不受限于接收分集阶数，并且随发射天线的增加以一定的线性关系增加。     

Self-adjusting the intensity of assortative mating in genetic algorithms

Mate selection plays a crucial role in both natural and artificial systems. While traditional Evolutionary Algorithms (EA) usually engage in random mating strategies, that is, mating chance is independent of genotypic or phenotypic distance between individuals, in natural systems non-random mating is common, which means that somehow this mechanism has been favored during the evolutionary process. In non-random mating, the individuals mate according to their parenthood or likeness. Previous studies indicate that negative assortative mating (AM)—also known as dissortative mating—, which is a specific type of non-random mating, may improve EAs performance by maintaining the genetic diversity of the population at a higher level during the search process. In this paper we present the Variable Dissortative Mating Genetic Algorithm (VDMGA). The algorithm holds a mechanism that varies the GA’s mating restrictions during the run by means of simple rule based on the number of chromosomes created in each generation and indirectly influenced by the genetic diversity of the population. We compare VDMGA not only with traditional Genetic Algorithms (GA) but also with two preceding non-random mating EAs: the CHC algorithm and the negative Assortative Mating Genetic Algorithm (nAMGA). We intend to study the effects of the different methods in the performance of GAs and verify the reliability of the proposed algorithm when facing an heterogeneous set of landscapes. In addition, we include the positive Assortative Mating Genetic Algorithm (pAMGA) in the experiments in order test both negative and positive AM mechanisms, and try to understand if and when negative AM (or DM) speeds up the search process or enables the GAs to escape local optima traps. For these purposes, an extensive set of optimization test problems was chosen to cover a variety of search landscapes with different characteristics. Our results confirm that negative AM is effective in leading EAs out of local optima traps, and show that the proposed VDMGA is at least as efficient as nAMGA when applied to the range of our problems, being more efficient in very hard functions were traditional GAs usually fail to escape local optima. Also, scalability tests have been made that show VDMGA ability to decrease optimal population size, thus reducing the amount of evaluations needed to attain global optima. We like to stress that only two parameters need to be hand-tuned in VDMGA, thus reducing the tuning effort present in traditional GAs and nAMGA.     

CDMA发射分集系统的多用户检测常模算法分析

空时分集技术的最大优点在于在不增加带宽的情况下可以提高系统的可靠性,是目前移动通信的研究热点.常模算法是一种性能优良的码分多址(CDMA)盲多用户检测技术,能确保判决信号与实际传送信号之间的差错较小,误码率性能良好.文中提出将标准线性受限常模算法(LCCMA)与空时分组码(STBC)相结合,设计出一种收敛快、能够改善系统性能的基于2-空时分组码的多用户接收机.     

Analysis of run-in process for PC manufacturing

This paper gives a review of the methodology used to tune the run-in process of a PC manufacturing line. It shows in some detail the analysis carried-out on the test data gathered on the manufacturing line and presents a clear picture of the run-in process in order to choose the best compromise between process efficiency and costs.