A method for exact reliability of consecutive2-out-of-(r, r)-from-(n, n):F systems

A new reliability model, consecutive 2‐out‐of‐(r, r)‐from‐(n, n):F model, is proposed. The consecutive 2‐out‐of‐(r, r)‐from‐(n, n):F system consists of a square grid of side n (containing n² components) such that the system fails if and only if there is at least one square of side r which includes among them at least two failed components. For i.i.d. case an algorithm is given for computing the reliability of the system. The reliability function can be expressed by the number of 0–1 matrices having no two or more 0s at any square of side r.     

An integrated GA-DEA algorithm for determining the most effective maintenance policy for a k -out-of- n problem

This paper presents a novel hybrid GA-DEA algorithm in order to solve multi-objective \(k\) -out-of- \(n\) problem and determine preferred policy. The proposed algorithm maximizes overall system reliability and availability, while minimizing system cost and queue length, simultaneously. To meet these objectives, an adaptive hybrid GA-DEA algorithm is developed to identify the optimal solutions and improve computation efficiency. In order to improve computation efficiency genetic algorithm (GA) is used to simulate a series production line and find the Pareto-optimal solutions which are different values of \(k\) and \(n\) of \(k\) -out-of- \(n\) problem. Data envelopment analysis is used to find the best \(k\) and \(n\) from Genetic Algorithm’s Pareto solutions. An illustrative example is applied to show the flexibility and effectiveness of the proposed algorithm. The proposed algorithm of this study would help managers to identify the preferred policy considering and investigating various parameters and scenarios in logical time. Also considering different objectives result in Pareto-optimal solutions that would help decision makers to select the preferred solution based on their situation and preference.     

A new information-weighted recursive algorithm for time-varying systems: application to UAV system identification

This paper presents a new recursive identification method which can efficiently estimate time-varying parameters in discrete time systems and has significant advantages over standard recursive least-squares (RLS) method. This new information-weighted recursive algorithm for time-varying systems has three novel features, discounting of inaccurate estimates through weighting by the Information matrix, using the reuse of past data in computing current parameter estimates, a new tuneable damping factor parameter and a precisely designed compensation term to neutralise the estimation error caused by time-varying coefficients. A rigorous proof of convergence is also provided. Simulations show that the new algorithm significantly outperforms standard RLS, exhibiting better tracking performance and faster convergence. Flight tests on a T-REX 800 helicopter Unmanned Aerial Vehicle platform show that it gives system parameter estimates that are accurate enough and converge quickly enough that flight controllers can be designed in real-time based on the online identified model.     

一个（t，n）门限签名-（k，m）门限验证的群签名方案

基于离散对数问题,提出了一个(t,n)门限签名-(k,m)门限验证的群签名方案。在该方案中,n个签名者中至少t个合作可以生成有效的群签名;而m个验证者中至少k个合作可以验证签名的有效性。参与者的公、私钥以及群公钥由参与者共同协商,无需可信中心参与;参与者之间的信息可以以明文形式传送;能够抵御内部相互欺诈和外部攻击。方案的安全性是基于离散对数问题的难解性。     

A new algorithm for a recursive construction of the minimal interpolation space

In this work, we introduce a new interpolation algorithm, based on a recursive method for computing Lagrange interpolants. This algorithm allows to construct recursively the minimal interpolation space (see [1]) with respect to a finite set of points. We also extend this recursive method to the osculatory interpolation problem.     

A new algorithm for a recursive construction of the minimal interpolation space

In this work, we introduce a new interpolation algorithm, based on a recursive method for computing Lagrange interpolants. This algorithm allows to construct recursively the minimal interpolation space (see [1]) with respect to a finite set of points. We also extend this recursive method to the osculatory interpolation problem.     

一种新的(m+1,n)理性秘密分享机制

重复理性秘密分享机制仅适用于交互轮数无限的情形,但是无限轮的理性秘密分享机制的效率不高。为此,在(m,n) Shamir秘密分享机制的基础上,结合有限重复博弈,为每个参与者赋予一个参加协议的时限,由此提出一种新的(m+1,n)有限轮理性秘密分享机制。分析结果表明,当时限和参与者的效用函数满足一定条件时,可以得到一个常数轮的理性秘密分享机制,使所有理性参与者可以恢复秘密。     

一种新的BOC(n,n)型信号的精确捕获算法

针对BOC(n,n)型信号自相关函数存在三个峰值导致伪码捕获模糊性的问题,提出了一种新的基于相关函数的精确无模糊的捕获算法。该算法将信号进行频域的多普勒补偿,通过本地增设QBOC(n,n)支路,利用BOC(n,n)信号自相关以及BOC(n,n)和QBOC(n,n)互相关,经移位±TC/4、取模、求和、平方运算而实现。理论与仿真分析表明,该算法在不改变自相关主峰宽度的情况下完全消除相关副峰的同时,显著提高了主峰峰值;比传统捕获算法的性能好4.5 dB左右,并且捕获精度良好、易于实现。     

A fast algorithm for determining the linear complexity of a binary sequence with period 2 n p m

An efficient algorithm for determining the linear complexity and the minimal polynomial of a binary sequence with period 2 ⁿ p ^m is proposed and proved, where 2 is a primitive root modulop ². The new algorithm generalizes the algorithm for computing the linear complexity of a binary sequence with period 2 ⁿ and the algorithm for computing the linear complexity of a binary sequence with periodp ⁿ , where 2 is a primitive root modulop ².     

Extension of coefficients for (n,k, m) convolutional-code-based packet loss recovery

This paper discusses a new idea for improving the recovery of (n, k, m) convolutional-code-based packet-level FEC. We extend the coefficients in the generator matrix to the elements on GF(2⁸). Each byte in the redundant packets is generated independently, assuming the bytes are the elements on GF(2⁸). The postreconstruction receiving rate is analytically derived from the necessary conditions for recovery. Moreover, the ability to recover lost packets is estimated based on analysis, and we demonstrate that the extension of coefficients improves the number of recovered packets more than the conventional method where coefficients are 0 or 1.     

A randomized algorithm for controlling the round-off error accumulation in recursive digital frequency synthesis (DFS)

Recursive methods for digital frequency synthesis (DFS) exhibit numerical instability due to the round-off error propagation and accumulation in the finite precision digital computations. Because of this, despite their simplicity and other desirable features, recursive DFS methods are generally avoided in practice. In this paper we present a method that solves this numerical instability problem for the coupled form oscillator (CFO) method in a simple manner by randomizing the selection of the rotation phase-step. The internal process uncertainty, induced by the truncation of intermediate computation results, is used for randomization. Interestingly this results in the self-stabilizing property of the proposed method.     

基于遗传算法的随机性（Q，r）库存系统仿真优化

（Q，r）模型是库存管理中的重要控制模型。对于随机性（Q，r）库存系统，难以用解析方法求解最优的库存控制策略。运用仿真优化技术，基于离散事件系统仿真原理，建立了随机性（Q，r）库存系统的仿真模型，设计了一种改进的遗传算法并应用它优化库存系统的库存控制策略。采用面向对象方法实现了仿真模型和改进的遗传算法。仿真实例表明所提出的仿真优化技术是可行且有效的。     

A lattice algorithm for factoring the spectrum of a moving average process

Triangular decomposition of the semi-infinite covariance matrix of a moving average process can be used as a spectral factorization technique. An efficient lattice algorithm is derived for performing the necessary computations. This technique is a special case of the fast Cholesky decomposition of stationary covariance matrices. The algorithm can be used to factor multichannel spectra to a desired degree of accuracy.     

一种新的BOC(n,n)无模糊跟踪算法

针对BOC(n,n)信号相关峰的多峰性引起信号跟踪模糊的问题,提出一种新的BOC(n,n)无模糊跟踪算法,通过重构本地BOC码合成无边峰的相关函数解决BOC信号的模糊跟踪问题.仿真与分析表明,提出的算法完全消除了自相关函数的多个边峰并保持窄相关,去模糊效果更好,具有良好的跟踪性能.相比于传统跟踪算法、自相关边锋消除法(ASPeCT)和副载波相位消除法(SCPC),新算法的鉴相曲线斜率较大,且鉴相曲线更加稳定.对于BOC-sin(n,n)和BOC-cos(n,n)信号,新算法的码相位测量误差均方差比副载波相位消除法更低,抗噪声性能最好.在抗多径性能方面,多径包络面积最小,多径抑制效果最优.     

A recursive sweep-plane algorithm,determining all cells of a finite division of Rd

“Sweep-plane” algorithms seem to become more and more important for the solution of certain geometrical problems. We present an algorithm of this kind that enumerates the cells of all dimensions into whichR ^d is partitioned by a finite set of hyperplanesF _i ⁰ . A plane sweeping through space (remaining parallel to itself) finds new cells each time it includes an intersection of someF _i ⁰ (normally a point). An analysis of the intersection-properties allows the construction of an algorithm recursive with respect to the dimension of space. Full generality has been one of our main objectives.     

一种高误码(n,k,m)非系统卷积码盲识别算法

针对信息截获等领域中的卷积码盲识别问题,提出一种高误码 (n,k,m)非系统卷积码盲识别算法。首先建立可变的数据矩阵模型,对侦收到的数据进行相关预处理,以减小误码对识别的影响,提高算法的容错性能;再对预处理后的数据矩阵进行统计分析,识别出卷积码的各项参数,并提取各个数据矩阵的校验序列;进而利用校验序列构建线性方程组求解生成多项式矩阵组,通过设定筛选生成多项式矩阵的条件,筛选出非系统卷积码的生成多项式矩阵,最终完成对非系统卷积码的识别。仿真实验表明,该算法可以对高误码(n,k,m)非系统卷积码实现有效的盲识别。     

基于(m,k)-firm约束规范的混合任务调度算法研究

讨论了在准实时环境下,包括准实时周期任务和准实时非周期任务在内的混合任务调度算法HTSF.HTSF算法是在满足周期任务(m,k)-firm 约束规范的前提下提高非周期任务可调度性,同时合理利用可用空闲时间,提高整个系统的服务质量.HTSF算法给出了非周期任务的可调度性分析方法,同时采用静态调度与动态调度相结合的方法调度周期任务和非周期任务.模拟测试结果显示,系统对非周期任务的接收率比同类相关算法的接收率高.     

A recursive method for determining the Laplace transform of exp (At)

A method for recursively determining the Laplace transform of the state transition matrix for a linear time-invariant system is presented. The method does not require matrix inversion, nor does the complexity of the operations involved increase with the dimensionality of the system. It is equally applicable to systems with distinct or multiple roots.