短码直接序列扩频CDMA多用户盲同步

通过研究信号自相关矩阵特征值的特性,提出一种利用信号自相关矩阵行列式作为检测量的短码扩频DS-CDMA多用户同步算法。该算法只要求已知信号的扩频周期,对信号其他参数要求较低,实现了盲同步,仿真结果显示了该算法的有效性。与文献算法相比该算法更稳健,适应范围更广。     

一种基于帧间相关的红外弱小目标运动轨迹检测方法

针对传统帧间相关法对部分虚警轨迹难以排除的问题,研究了一种简单的帧间相关去噪算法,并提出在此基础上再次运用数学形态学方法来进一步排除虚假轨迹。算法采用形态学top-hat变换和二值化方法预处理原始图像,然后根据目标帧间相关而噪声点不相关的特点去噪,之后相加得到初步运动轨迹图像;最后采用形态学开运算,排除虚假轨迹,得到最终的检测结果。结果中检测出的目标轨迹清晰,虚警少。实验表明,该方法能有效地检测出弱小目标的运动轨迹。     

新大纲要求下的演示实验进课堂教学模式探索

军队院校生长军官通用基础课程教学大纲中的大学物理部分对于演示实验进课堂提出了明确而具体的要求。建设专用演示实验教室,不但能够满足新大纲的教学要求,而且对于实现实践性教学模式改革、为学生开展科研创新活动提供实践平台、发挥大学物理教学的对外交流功能都有重要作用。这一教学模式改革更能适应我校培养通用专业人才和联合保障人才的培养目标。     

Gold序列跳变扩频在毫米波敌我识别系统中的应用

在毫米波敌我识别系统中,识别信息在低频部分经过数字信号处理后,进行扩频调制后由微波收发信机进行传输。介绍了毫米波敌我识别系统中采用扩频调制设计原则和跳变Gold码扩频序列的设计方法,分析了扩频抗截收/截获的能力,并给出了一种用STEL2000-A芯片产生Gold序列进行跳变扩频调制的具体实现实例。     

二次型极小化问题的迭代算法

在新的控制条件下,证明了二次型极小化问题的迭代算法的有效性,所得结果改进了徐洪坤关于二次型优化的最新结果。     

From elite consumption to popular opinion: framing of the US drone program in Pakistani newspapers

The United States has conducted armed drone strikes in Pakistan since 2004. While there has been some recent work on Pakistani public opinion about drones, there is very little research on how Pakistan’s media characterize the US drone program. This is an important gap in understanding the determinants of Pakistani popular perceptions of this program. Decades of research has shown that “news framing”, a process by which certain aspects of a complex concept are emphasized in political communications with others played down, influences individual cognition while forming political opinions. In this essay, we address this lacuna by assembling an unprecedented sample of editorials about the drone program from three English newspapers and one Urdu newspaper and analyzing the news frames within them. We next compare the trends in these news frames to public opinion data collected by Pew between the spring of 2009 and 2014. Initially, most Pakistanis were unaware of the drone program, media coverage of the program expanded as drone strikes increased in frequency. While Pakistanis became more cognizant of the US drone strikes, even by 2014 large minorities remained unaware. Pakistani public opinion strongly reflected the top media frames, particularly those that are negative. This is an important finding suggesting that newspaper editorials are a good barometer of Pakistani opinions despite the fact that only information elites rely upon newspapers for political information.     

广义Fibonacci数列的通项及性质

著名的Fibonacci数列有许多通项表达式和性质。利用数学归纳法和特征方程求根的方法对广义Fibonacci数列Rn 1=uRn vRn-1,R0=a,R1=b进行研究,得到了两个通项表达式和一个性质.     

提高近场精度的海洋声学快速场改进模型

为了提高海洋声学快速场模型在近场区域的计算精度,分析了影响经典快速场模型精度的因素,主要包括Bessel函数近似、忽略内行波项以及在水平距离最远处波数采样率过低,这些因素导致快速场模型近场误差较大、远场水平距离最远处结果不正确(计算结束后需要去除水平距离后段的声场)。提出能够提高经典快速场模型近场计算精度的改进模型,改进部分主要是采用保留内行波项的近似Bessel函数,再将近场上下两个基于声源点与对称轴的三角形区域用波数积分解(使用精确Bessel函数)覆盖。算例测试结果表明:与经典快速场模型相比,改进模型可在绝对时间增加较少的情况下,显著提高近场计算精度,综合性能更优;与波数积分法相比,改进模型在误差为同量级的情况下,积分时间大幅降低,实际应用价值更高。     

On scheduling a single machine to minimize a piecewise linear objective function: A compact MIP formulation

We study the scheduling situation in which a set of jobs subjected to release dates and deadlines are to be performed on a single machine. The objective is to minimize a piecewise linear objective function ∑_jF_j where F_j(C_j) corresponds to the cost of the completion of job j at time C_j. This class of function is very large and thus interesting both from a theoretical and practical point of view: It can be used to model total (weighted) completion time, total (weighted) tardiness, earliness and tardiness, etc. We introduce a new Mixed Integer Program (MIP) based on time interval decomposition. Our MIP is closely related to the well‐known time‐indexed MIP formulation but uses much less variables and constraints. Experiments on academic benchmarks as well as on real‐life industrial problems show that our generic MIP formulation is efficient. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2009     

Server scheduling on parallel dedicated machines with fixed job sequences

We consider server scheduling on parallel dedicated machines to minimize the makespan. Each job has a loading operation and a processing operation. The loading operation requires a server that serves all the jobs. Each machine has a given set of jobs to process, and the processing sequence is known and fixed. We design a polynomial‐time algorithm to solve the two‐machine case of the problem. When the number of machines is arbitrary, the problem becomes strongly NP‐hard even if all the jobs have the same processing length or all the loading operations require a unit time. We design two heuristic algorithms to treat the case where all the loading times are unit and analyze their performance.