程控用户交换机的中继方式及数字中继模块的设计与实现

本文史介绍一种程控用户交换机数字中继模块的实现方法。它以加拿大 MITEL 公司的MH89780数字中继接口芯片(CEPT Digital Trunk Interface Hybrid)和 MT8980(8×32)时隙交换矩阵芯片(Digital Time/Space Crosspoint Switch)为基础来实现数字中继接口功能。这种中继电路为程控用户交换机进入公用电话网提供了全自功入网能力,并易于进行程控用户交换机之间的组网。数字中继采用 PCM30/32路系统,可以采用随路信令,也可以采用公共信道信令。     

语音识别技术综述

本文综述了语音识别领域里的主要技术。首先,系统地介绍了孤立词识别系统中的算法和技术。然后,简要介绍了连续语音识别系统中的主要处理方法。最后,说明了语音理解系统中的特殊问题。     

BASIC 主程序与汇编语言子程序连接的新方法

本文总结了在实际工作中摸索的 BASIC 主程序与汇编语言子程序连接的新方法。它采用 DEBUG 的 W 命令直接将汇编子程序的机器代码存入磁盘的扇区。再在 BASIC 环境下调用 DOS 中断25H,将汇编子程序机器码装入内存,然后可由CALL 语句或由 USR 函数调用。该方法可以简化 BASIC 主程序和汇编语言子程序的调试和连接过程。     

Solution of minisum and minimax location–allocation problems with Euclidean distances

A new method for the solution of minimax and minisum location–allocation problems with Euclidean distances is suggested. The method is based on providing differentiable approximations to the objective functions. Thus, if we would like to locate m service facilities with respect to n given demand points, we have to minimize a nonlinear unconstrained function in the 2m variables x₁,y₁, ?,x_m,y_m. This has been done very efficiently using a quasi-Newton method. Since both the original problems and their approximations are neither convex nor concave, the solutions attained may be only local minima. Quite surprisingly, for small problems of locating two or three service points, the global minimum was reached even when the initial position was far from the final result. In both the minisum and minimax cases, large problems of locating 10 service facilities among 100 demand points have been solved. The minima reached in these problems are only local, which is seen by having different solutions for different initial guesses. For practical purposes, one can take different initial positions and choose the final result with best values of the objective function. The likelihood of the best results obtained for these large problems to be close to the global minimum is discussed. We also discuss the possibility of extending the method to cases in which the costs are not necessarily proportional to the Euclidean distances but may be more general functions of the demand and service points coordinates. The method also can be extended easily to similar three-dimensional problems.     

A finite-range distribution of failure times

Properties of a finite-range failure-time distribution, that includes the exponential as a particular case, have been studied. The distribution is IFR when the shape parameter exceeds unity, but is IFRA always. For a given value of the shape parameter, the distribution is NBUE over a segment of its range. Estimators of parameters have been derived. Distributions of two-component series, parallel, and standby system lives have also been worked out.     

Extrapolation of the mean lifetime of a large population from its preliminary survival history

A large population of independent identical units having finite mean lifetime T is observed. From the history A(y) of cumulative arrivals and the history B(y) of cumulative removals in the interval 0 ≦ y ≦ τ one must predict at time τ the desired T . Two lifetime predictors X(τ) and Y(τ) and related simple predictors obtained from A(y) and B(y) are shown to converge to T with a rate of convergence dependent on the structure of the failure rate function of the units. This dependence is studied theoretically and numerically.