关于一种新模型对软件总体可靠度的估计

本文在对文[4]中软件可靠度的估计进行研究的基础上,提出了软件总体可靠性的一个新模型,对软件总体的可靠度进行了讨论,利用点估计方法,得到软件可靠度的点估计值,证明了软件总体失效率λ估计解的唯一性,并对缺陷数进行了估计,从而给出了新模型下软体总体可靠性的估计.     

High throughput N-modular redundancy for error correction design of memristive stateful logic

Memristive stateful logic is one of the most promising candidates to implement an in-memory computing system that computes within the storage unit. It can eliminate the costs for the data movement in the traditional von Neumann system. However, the instability in the memristors is inevitable due to the limitation of the current fabrication technology, which incurs a great challenge for the reliability of the memristive stateful logic. In this paper, the implication of device instability on the reliability of the logic event is simulated. The mathematical relationship between logic reliability and redundancy has been deduced. By combining the mathematical relationship with the vector-matrix multiplication in a memristive crossbar array, the logic error correction scheme with high throughput has been proposed. Moreover, a universal design paradigm has been put forward for complex logic. And the circuit schematic and the flow of the scheme have been raised. Finally, a 1-bit full adder (FA) based on the NOR logic and NOT logic is simulated and the mathematical evaluation is performed. It demonstrates the scheme can improve the reliability of the logic significantly. And compared with other four error corrections, the scheme which can be suitable for all kinds of R-R logics and V-R logics has the best universality and throughput. Compared with the other two approaches which also need additional complementary metal-oxide semiconductor (CMOS) circuits, it needs fewer transistors and cycles for the error correction.     

Spectrum Slicing for Multiple Access Channels with Heterogeneous Services

Wireless mobile networks from the fifth generation (5G) and beyond serve as platforms for flexible support of heterogeneous traffic types with diverse performance requirements. In particular, the broadband services aim for the traditional rate optimization, while the time-sensitive services aim for the optimization of latency and reliability, and some novel metrics such as Age of Information (AoI). In such settings, the key question is the one of spectrum slicing: how these services share the same chunk of available spectrum while meeting the heterogeneous requirements. In this work we investigated the two canonical frameworks for spectrum sharing, Orthogonal Multiple Access (OMA) and Non-Orthogonal Multiple Access (NOMA), in a simple, but insightful setup with a single time-slotted shared frequency channel, involving one broadband user, aiming to maximize throughput and using packet-level coding to protect its transmissions from noise and interference, and several intermittent users, aiming to either to improve their latency-reliability performance or to minimize their AoI. We analytically assessed the performances of Time Division Multiple Access (TDMA) and ALOHA-based schemes in both OMA and NOMA frameworks by deriving their Pareto regions and the corresponding optimal values of their parameters. Our results show that NOMA can outperform traditional OMA in latency-reliability oriented systems in most conditions, but OMA performs slightly better in age-oriented systems.     

二项分布的参数估计问题研究

本文主要讨论二项分布的参数估计问题.对GB/T 4087.1-1983,GB/T 4087.2-1983,GB/T4087.3-1985给出的经典二项分布参数点估计、区间估计和可靠度置信下限计算方法进行了分析,指出了其中存在的问题.根据二项分布的数学表达式推导出了二项分布参数的概率分布密度函数,在此基础上提出了进行二项分布参数估计的一般方法.     

“Product Partition” and related problems of scheduling and systems reliability: Computational complexity and approximation

Problem Product Partition differs from the NP-complete problem Partition in that the addition operation is replaced by the multiplication operation. Furthermore it differs from the NP-complete problem Subset Product in that it does not contain the product value B in its input. We prove that problem Product Partition and several of its modifications are NP-complete in the strong sense. Our results imply the strong NP-hardness of a number of scheduling problems with start-time-dependent job processing times and a problem of designing a reliable system with a series–parallel structure. It should be noticed that the strong NP-hardness of the considered optimization problems does not preclude the existence of a fully polynomial time approximation scheme (FPTAS) for them. We present a simple FPTAS for one of these problems.     

K/n(G)系统可靠性评定的多源验前信息融合方法

在多源验前信息的情况下,以k/n(G)系统为例,讨论了如何对系统的可靠性指标进行估计的问题.在多个验前信息源给出了系统可靠性指标点估计的情况下,利用多层Bayes方法及经验Bayes方法对这些数据进行融合,并给出系统可靠性指标的Bayes点估计,同时对系统可靠度的置信区间也作了讨论.仿真算例表明这种处理方法是合理有效的.     

两相同部件并联部分可修复系统的可靠性分析

用C_0半群理论,研究了一类两相同部件并联部分可修复系统解的存在惟一性及指数稳定性,并从本征向量的角度讨论了此系统的一些主要可靠性指标,给出了瞬态可用度的数值模拟.     

Chip firing and all-terminal network reliability bounds

The (all-terminal) reliability of a graph G is the probability that all vertices are in the same connected component, given that vertices are always operational but edges fail independently each with probability p. Computing reliability is #P-complete, and hence is expected to be intractable. Consequently techniques for efficiently (and effectively) bounding reliability have been the major thrust of research in the area. We utilize a deep connection between reliability and chip firings on graphs to improve previous bounds for reliability.     

RELIABILITY ASSESSMENT OF STRUCTURAL SYSTEMS BASED ON DIRECTIONAL VECTOR SIMULATION TECHNIQUE

The new improved directional vector simulation method for analyzing the reliability of structural systems failure probability is researched. This paper also points out the defects of general directional vector simulation, and gives rise to a new higher accuracy approximate integral formula of structural systems failure probability. A new geometric meaning of characteristic function is obtained. A new simple method of generating uniformly distributed random vector samples inn-dimensional unit hyper-spherical surface is put forward and strictly proved. This method is easy to put into practice. Numerical examples are given to show the applicability and effectiveness of the suggested approach to structural systems reliability problems. Supported by Chinese Postdoctor Fund([1998]6, 23).     

Flexible software reliability growth model with testing effort dependent learning process

A lot of importance has been attached to the testing phase of the Software Development Life Cycle (SDLC). It is during this phase it is checked whether the software product meets user requirements or not. Any discrepancies that are identified are removed. But testing needs to be monitored to increase its effectiveness. Software Reliability Growth Models (SRGMs) that specify mathematical relationships between the failure phenomenon and time have proved useful. SRGMs that include factors that affect failure process are more realistic and useful. Software fault detection and removal during the testing phase of SDLC depend on how testing resources (test cases, manpower and time) are used and also on previously identified faults. With this motivation a Non-Homogeneous Poisson Process (NHPP) based SRGM is proposed in this paper which is flexible enough to describe various software failure/reliability curves. Both testing efforts and time dependent fault detection rate (FDR) are considered for software reliability modeling. The time lag between fault identification and removal has also been depicted. The applicability of our model is shown by validating it on software failure data sets obtained from different real software development projects. The comparisons with established models in terms of goodness of fit, the Akaike Information Criterion (AIC), Mean of Squared Errors (MSE), etc. have been presented.