变频调速节能改造方案的经济性评价和比较

本文详细介绍了变频调速节能改造方案的经济性评价方法。静态分析法包括投资回收期法、抵偿年限法和年计算费用法；动态分析法则包括净现值法、内部回收率法、总费用现值法和最小年费用法。     

一种精准数控STC设计方法

介绍了雷达接收机中STC控制的产生背景、原理及方法,采用MATLAB语言进行仿真,重点介绍了一种基于电控衰减器作为受控部件的数字STC控制曲线的精确设计方法,并提出了雷达STC的设计和使用原则。     

Allocation of jobs and identical resources with two pooling centers

We examine the resource allocation problem of partitioning identical servers into two parallel pooling centers, and simultaneously assigning job types to pooling centers. Each job type has a distinct Poisson arrival rate and a distinct holding cost per unit time. Each pooling center becomes a queueing system with an exponential service time distribution. The goal is to minimize the total holding cost. The problem is shown to be polynomial if a job type can be divided between the pooling centers, and NP-hard if dividing job types is not possible. When there are two servers and jobs cannot be divided, we demonstrate that the two pooling center configuration is rarely optimal. A heuristic which checks the single pooling center has an upper bound on the relative error of 4/3. The heuristic is extended for the multiple server problem, where relative error is bounded above by the number of servers.      

Single machine group scheduling with ordered criteria

The single machine group scheduling problem is considered. Jobs are classified into several groups on the basis of group technology, i.e. jobs of the same group have to be processed jointly. A machine set-up time independent of the group sequence is needed between each two consecutive groups. A schedule specifies the sequence of groups and the sequence of jobs in each group. The quality of a schedule is measured by the criteriaF ₁, ...,F _m ordered by their relative importance. The objective is to minimize the least important criterionF _m subject to the schedule being optimal with respect to the more important criterionF _m–1 which is minimized on the set of schedules minimizing criterionF _m–2 and so on. The most important criterion isF ₁, which is minimized on the set of all feasible schedules. An approach to solve this multicriterion problem in polynomial time is presented if functionsF ₁, ...,F _m have special properties. The total weighted completion time and the total weighted exponential time are the examples of functionsF ₁, ...,F _m–1 and the maximum cost is an example of functionF _m for which our approach can be applied.The research of the authors was partially supported by a KBN Grant No. 3 P 406 003 05, the Fundamental Research Fund of Belarus, Project N 60-242, and the Deutsche Forschungsgemeinschaft, Project Schema, respectively. The paper was completed while the first author was visiting the University of Melbourne.     

Minimum cost multiflows in undirected networks

LetN = (G, T, c, a) be a network, whereG is an undirected graph,T is a distinguished subset of its vertices (calledterminals), and each edgee ofG has nonnegative integer-valuedcapacity c(e) andcost a(e). Theminimum cost maximum multi(commodity)flow problem (*) studied in this paper is to find ac-admissible multiflowf inG such that: (i)f is allowed to contain partial flows connecting any pairs of terminals, (ii) the total value off is as large as possible, and (iii) the total cost off is as small as possible, subject to (ii). This generalizes, on one hand, the undirected version of the classical minimum cost maximum flow problem (when |T| = 2), and, on the other hand, the problem of finding a maximum fractional packing ofT-paths (whena 0). Lovász and Cherkassky independently proved that the latter has a half-integral optimal solution.A pseudo-polynomial algorithm for solving (*) has been developed earlier and, as its consequence, the theorem on the existence of a half-integral optimal solution for (*) was obtained. In the present paper we give a direct, shorter, proof of this theorem. Then we prove the existence of a half-integral optimal solution for the dual problem. Finally, we show that half-integral optimal primal and dual solutions can be designed by a combinatorial strongly polynomial algorithm, provided that some optimal dual solution is known (the latter can be found, in strongly polynomial time, by use of a version of the ellipsoid method).This work was partially supported by Chaire municipale, Mairie de Grenoble, France.     

一种利用小波降噪的卫星导航信号并行捕获算法

针对全球定位系统（Global Positioning System,GPS）接收机传统捕获算法计算复杂度高、捕获灵敏度低等缺点,提出了一种可降噪的简化并行码相位捕获（Noise Reduction for Simplified Parallel Code Phase Acquisition,NR-SPCA）算法。该算法通过对信号降采样,利用小波变换对二次采样信号作降噪处理,提高了捕获灵敏度;利用GPS信号和C/A码互相关的稀疏性,并行计算降噪后的信号的相关值,提高了运算效率。仿真结果表明,在90%概率捕获成功的前提下,NR-SPCA算法比传统的PCA算法信噪比低1 dB,运算效率提升了100%。该算法还可应用于航天探测、自动驾驶等领域。     

基于周期截断数据矩阵奇异值分解的干扰抑制技术

针对现有适用于单天线接收机的干扰抑制技术难以为周期调频(PFM)干扰和卫星导航信号提供足够分离度,导致消除干扰成分时卫星导航信号损伤较大的问题,该文提出一种基于周期截断数据矩阵奇异值分解的干扰抑制方法。利用调频干扰信号的周期性把分散在较大带宽的能量集中到重排数据中几个甚至单个频点;进而采用奇异值分解(SVD)将干扰与期望信号映射进不同的投影子空间以消除干扰成分。仿真结果表明该方法可以降低在剔除干扰时卫星导航信号损失,提升卫星导航接收机对抗宽带周期调频干扰的能力。     

为调谐器设计的带自动幅度控制1.1GHz差分压控振荡器

为集成调谐器接收机芯片系统设计了一个带自动幅度控制回路的差分结构电容电感压控振荡器.通过采用pMOS管作为有源负阻使振荡器谐振回路可以直接接地电平,减小了寄生效应,扩大了频率调谐的线性及其范围.采用的自动幅度控制AAC回路具有元件少,噪声低,控制灵敏,调节容易,结构简单及设计方便的优点,并保证振荡器电路的性能最小地依赖于环境和制造工艺参数的变化.所设计的压控振荡器采用新加坡特许50GHz 0.35μm SiGe BiCMOS工艺流片,经测试在1MHz频率偏移处达到了-127.27dBc/Hz的相位噪声性能,具有宽的(990～1140MHz)和线性(调谐增益32.4MHz/V)的频率调谐曲线.整个振荡器电路在5V的供电电压下仅消耗6.6mA的电流,可以满足调谐器的应用需要.     

GPS接收机中的码分多址信号处理研究

介绍了基于码分多址信号处理的GPS(全球定位系统)接收机的算法和电路设计。GPS接收机电路的信号处理任务主要是对数字化后的基带扩频信号进行载波跟踪、解调、解扩、码跟踪,从而得到符号数据。着重讨论了GPS接收机中信号处理部分的COSTAS、码跟踪、帧同步生成电路三大模块的功能任务、原理、算法及其相应的电路设计。通过这些研究工作,可以进一步设计出当前应用日益普遍的GPS接收机电路,该电路具有功能全面、通用性好、可靠性高等特点。     

Determination/estimation of an optimal replacement interval under minimal repair

In this paper the problem of estimation of an optimal replacement interval for a system which is minimally repaired at failures is studied. The problem is investigated both under a parametric and a nonparametric form of the failure intensity of the system. It is assumed that observational data from n systems are available. Some asymptotic results are shown. A graphical procedure for determining/estimating an optimal replacement interval is presented. The procedure is particularly valuable for sensitivity analyses, for example with respect to the costs involved.