Extended block replacement policy of a system subject to shocks

A generalization of the block replacement (BR) policy is proposed and analyzed for a system subject to shocks. Under such a policy, an operating system is preventively replaced by new ones at times i·T (i=1,2,3,...) independently of its failure history. If the system fails in: (a) ((i-1)·T, (i-1)·T+T₀), it is either replaced by a new one or minimally repaired; or (b) ((i-1)·T+T₀, i·T), it is either minimally repaired or remains inactive until the next planned replacement. The choice of these two actions is based on some mechanism (modeled as random) which depends on the number of shocks since the latest replacement. The average cost rate is obtained using the results of renewal reward theory. The model with two variables is transformed into a model with one variable and the optimum policy is discussed. Various special cases are considered. The results extend many of the well-known results for BR policies     

Construction of (2k,k, 2) Convolutional Codes with Double-Loop Cyclic Codes

In this paper, by taking multiple-time information in blocks into the coding of linear block codes, a new class of (2 \(k\) , \(k\) , 2) convolutional codes is constructed, by which a new way of constructing long codes with short ones is obtained. After that, the type of embedded codes is determined and the optimal values of the linear combination coefficients are derived by using a three-dimensional state transfer matrix to analyze and testify the constructing mechanism of the codes. Finally, the simulation experiment tests the error-correcting performance of the (2 \(k\) , \(k\) , 2) convolutional codes for different value of \(k\) , it is shown that the performance of the new convolutional codes compares favorably with that of traditional (2, 1, \(l\) ) convolutional codes.     

Optimal replacement policy (N, n) for a parallel system with common cause failure and geometric repair time

The purpose of this article is to present an improved replacement model for a parallel system of N identical units, by bringing in common cause failure (CCF), maintenance cost and repair cost per unit time additionally, and to develop a procedure to obtain the optimal redundant units N^* and optimal number of repairs n^* with the conditions that the system is allowed to undergo at most a prefixed number of repairs before to be replaced and the successive reapir times after failures constitute a non-decreasing Geometric process. Several conditions for the existence of the optimal N^* and n^* is stated and the results are illustrated by a numerical example.     

Multi-standby system with repair and replacement policy

This paper investigates the mathematical model of a system composed of (m + 1) non-identical units—one functioning and m standbys. Each unit of the system has four possible states—normal, partial failure, total failure and repair facility—the last one meaning that the totally failed unit is being attended to at the repair facility where it might be either repaired or eventually rejected and replaced. The normal and partial failure states are up states while the other two are down states. The system breaks down when the (m + 1)th unit after total failure is finally rejected and no standby remains to replace it. Several reliability characteristics of interest to system designers as well as operations managers have been computed. Results obtained earlier are verified as particular cases.     

Energy minimization for real-time systems with (m,k)-guarantee

Energy consumption and quality of service (QoS) are two primary concerns in the development of today's pervasive computing systems. While most of the current research in energy-aware real-time scheduling has been focused on hard real-time systems, a large number of practical applications and systems exhibit more soft real-time nature. In this paper, we study the problem of minimizing energy for soft real-time systems while providing a QoS guarantee. The QoS requirements are deterministically quantified with the (m,k)-constraints, which require that at least m out of any k consecutive jobs of a task meet their deadlines. In this paper, we propose a hybrid approach to achieve the dual goals of QoS guarantee and energy minimization. We first present the necessary and sufficient schedulability conditions for the static mandatory/optional workload partitioning. Then, we propose to dynamically vary the statically defined mandatory/optional partitions to accommodate dynamic run-time variations while minimizing the energy consumption. The experimental results demonstrate that our proposed techniques outperform previous work significantly in terms of both the energy savings and achieved QoS.     

Closed-form designs of complex orthogonal space-time block codes of rates (k+1)/(2k) for 2k-1 or 2k transmit antennas

In this correspondence, we present systematic and closed-form constructions of complex orthogonal space-time block codes from complex orthogonal designs of rates (k+1)/2k for 2k-1 or 2k transmit antennas for any positive integer k.     

新型(2k, k, 1)卷积码的构造

结合双环循环码和(2,1,1)卷积码,构造了一类(2k,k,1)卷积码,获得了一种短码构造长码的新方法。通过定义一种状态转移矩阵,利用代数方法和格栅图,揭示了该码类的构造机理,发现其码字结构的均衡性与多样性俱佳,具有良好的距离特性。仿真实验表明,(2k,k,1)卷积码的纠错性能和译码速度相较于传统卷积码存有一定优势。     

(t,k, n) XOR-based visual cryptography scheme with essential shadows

Visual cryptography scheme (VCS) shares a binary secret image into multiple shadows, only qualified set of shadows can reveal the secret image by stacking operation. However, VCS suffers the problems of low visual quality of the revealed image and large shadow size. A (t, k, n) XOR-based visual cryptography scheme (XVCS) shares the secret image into n shadows including t essentials and n-t non-essentials. A qualified set of shadows contains any k shadows including t essentials. The revealing process is implemented by XOR operation on the involved shadows. In this paper, we propose a construction method for (t, k, n)-XVCS with essential shadows. The secret image can be revealed perfectly, and the shadow size is small compared with VCS. Theoretical analysis and experimental results show the security and effectiveness of the proposed scheme.     

Capacity of channels with redundant multitrack (d,k) constraints:the k<d case

Run-length-limited or (d,k) recording codes are widely used in digital storage systems with peak detection. The channel capacities of the redundant multitrack (d,k) constraint are calculated and tabulated for k相似文献   

A new construction for n-track (d, k) codes with redundancy

A new construction for n-track (d, k) codes with redundancy r, referred to as (d, k; n, r) codes, is presented. This construction applies single-track (d, k+Δk) codes (with certain extra constraints and appropriate amounts of delay) on each of the n tracks. This construction achieves a large part of the capacity increases possible when using (d, k; n, r) codes, has simple encoders and decoders, and exhibits considerable robustness to faulty tracks. It is shown that under this construction, (d, k; n, r) codes can achieve at least (n-r-1:)/n*100% of the gap in capacity between conventional (d, k) and (d, ∞) codes. Several practical examples of (d, k; n, r) codes under this construction are presented     

L(j, k)-Labelings of Kronecker Products of Complete Graphs

For positive integers j ges k, an L(j, k)-labeling of a graph G is an integer labeling of its vertices such that adjacent vertices receive labels that differ by at least j and vertices that are distance two apart receive labels that differ by at least k. We determine lambda^j _k(G) for the case when G is a Kronecker product of finitely many complete graphs, where there are certain conditions on j and k. Areas of application include frequency allocation to radio transmitters.     

Turbo codes cascaded with high-rate block codes for (O,κ)-constrained channels

We consider several issues in the analysis and design of turbo coded systems for (O, κ) input-constrained channels. These constraints commonly arise in magnetic recording channels. This system is characterized by a high-rate turbo code driving a high-rate (n-1)/n, small-length (O, κ) block code. We discuss the properties of the (O, κ) code that affect its performance on both an additive white Gaussian noise (AWGN) and a precoded dicode channel. We address soft-in soft-out (SISO) decoding of linear and nonlinear (O, κ) codes and show that good (O, κ) codes exist even when d_min=1. For the (O, κ) constrained AWGN channel, we present several rate (n-1)/n block codes that optimally tradeoff bit-error-rate performance with κ. For the precoded dicode channel, we show that the systematic (O, n-1) modulation codes are superior to most other rate (n-1)/n block codes in terms of error-rate performance, and their attractiveness is increased by the fact that they do not contribute any significant complexity to the overall system     

Guaranteed Dynamic Priority Assignment Schemes for Real‐Time Tasks with (m,k)‐Firm Deadlines

We present guaranteed dynamic priority assignment schemes for multiple real‐time tasks subject to (m, k)‐firm deadlines. The proposed schemes have two scheduling objectives: providing a bounded probability of missing (m, k)‐firm constraints and maximizing the probability of deadline satisfactions. The second scheduling objective is especially necessary in order to provide the best quality of service as well as to satisfy the minimum requirements expressed by (m, k)‐firm deadlines. We analytically establish that the proposed schemes provide a guarantee on the bounded probability of missing (m, k)‐firm constraints. Experimental studies validate our analytical results and confirm the effectiveness and superiority of the proposed schemes with regard to their scheduling objectives.     

(n,F,k)系统可靠性

(n,F,k)系统由n个单元组成,当且仅当大于F个单元发生故障,或者k个或k个以上相邻单元发生故障,则系统失效本文提出了(n,F,k)系统可靠性的一般计算公式,并给出该系统可靠性的上下界。     

An age replacement policy with increasing minimal repair cost

A replacement policy for a system in which minimal repair cost increases in system age is considered. If a system fails before age T, it is minimally repaired. Otherwise, the system is replaced when if fails for the first time after age T. The mean cost rate is used as a criterion for optimization. It is shown that the optimal T minimizing the mean cost rate is finite and unique.     

广义(k,n)-门限方案

１９７９年，Ｓｈａｍｉｒ提出的（ｋ，ｎ）－门限密钥分散管理的概念使密钥管理更加安全灵活。但这一方案也有其不完善之处，因为在现实中参与密钥管理的人在系统中所处的地位不尽相同，有许多活动必须要求某些特定的人参与才能进行。本文考查了此类情形，将（ｋ，ｎ）－门限方案加以推广，提出了更为一般的（ｔ，ｋ，ｎ）－门限方案，给出（ｔ，ｋ，ｎ）－秘密分享矩阵的概念，并利用（ｔ，ｋ，ｎ）－秘密分享矩阵实现（ｔ，ｋ，ｎ）－门限方案。     

Constructions and Properties of General (k,n) Block‐Based Progressive Visual Cryptography

Recently, Hou and others introduced a (2, n) block‐based progressive visual cryptographic scheme (BPVCS) in which image blocks can be gradually recovered step by step. In Hou and others’ (2, n)‐BPVCS, a secret image is subdivided into n non‐overlapping image blocks. When participants stack their shadow images, all the image blocks associated with these t participants will be recovered. However, Hou and others’ scheme is only a simple 2‐out‐of‐n case. In this paper, we discuss a general (k, n)‐BPVCS for any k and n. Our main contribution is to give two constructions (Construction 1 and Construction 2) of this general (k, n)‐BPVCS. Also, we theoretically prove that both constructions satisfy a threshold property and progressive recovery of the proposed (k, n)‐BPVCS. For , Construction 1 is reduced to Hou and others’ (2, n)‐BPVCS.]     

Ultra Low‐k Films Derived from Hyperbranched Polycarbosilanes (HBPCS)

Dense and porous hyperbranched carbosiloxane thin films (HBCSO) are obtained by sol–gel processing using methylene‐bridged hyperbranched polycarbosilanes (HBPCSs) with the general compositional formula {(OMe)₂Si(CH₂)}. Introduction of porosity is achieved using a porogen templating approach, allowing the control of the films' dielectric constant from 2.9 to as low as 1.8. Over the entire dielectric range, the HBCSO films exhibit exceptional mechanical properties, 2–3 times superior to those obtained for non‐alkylene bridged organosiloxanes such as methylsilsesquioxanes (MSSQs) of similar densities and k‐values.