在VAX系列机上使用CVMS操作系统

在分析ＣＶＭＳ操作系统软硬件支持的基础上，提出了国产中西文终端ＧＷ２２０，ＣＪ４０１０，ＨＺ２００Ａ等作为ＶＡＸ计算机终端时进入和使用ＣＶＭＳ操作系统的一种方法；比较了ＥＤＩＴ和ＨＥＤＴ两个编辑命令使用的异同；最后，通过建立ＬＯＧＩＮ，ＣＯＭ命令过程，提出了进入ＣＶＭＳ系统更为方便的方法。     

任意浓度下活度系数的计算

根据实验所测有关电解质溶液的活度系数,确定其数学模型为γ=e~(a bm cm~2 d/m)。利用最小二乘法建立了1∶1型电解质活度系数与浓度之间的函数关系式,从而通过此关系式可对任意浓度下1∶1型电解质的活度系数进行预测,其相对误差不超过2.6％。     

设备诊断系统的建立及应用

介绍了一套设备诊断系统的基本构成，通过实例证明了系统的可行性；展示了实施设备状态监测和故障诊断这种先进设备管理维修方式良好的发展前景．     

Quantized Feedback Adaptive Reliable $$H_{\infty }$$ Control for Linear Time-Varying Delayed Systems

Based on an improved \(H_\infty \) performance index, the method of designing a reliable adaptive \(H_\infty \) controller with quantized state is addressed for the time-varying delayed system in this paper. On the basis of online estimates of actuator faults, the controller parameters are updated automatically to compensate the influence of actuator faults on the system while the desired improved \(H_\infty \) performance is preserved. A Lyapunov function candidate is constructed to prove that the closed-loop system is asymptotically stable. And the existing sufficient conditions of the controller are proved to be less conservative. The gains of the controller and the parameters of the adaptive law are co-designed and obtained in terms of solutions to a set of linear matrix inequalities. Finally, two numerical examples are given to illustrate that the proposed method is more effective than the previous methods for time-varying delayed systems.     

An Evolutionary Method for Synthesizing Low-Sensitivity Lossless Matching Networks

Whereas the present practice of designing matching networks for antennas is limited to conventional topologies, requiring a significant amount of domain knowledge, evolutionary algorithms can be used for automatically identifying unconventional designs that are more effective than would otherwise be developed. In this work, an automatic method to design lossless matching networks driven by an evolutionary algorithm (EA) that considers the sensitivities of the network parameters during the synthesis process is presented. To this end, a closed-form expression for the transducer power gain (TPG) sensitivity with respect to the component values is employed in such a way that the effects of the components tolerance on the matching network performance can easily be quantified. A 3D data structure based on the adjacency matrix is conveniently used to represent any type of network topologies. The proposed EA employs a novel set of topology variation operators, tailored for changing the circuit topology, and an association step, with the aim of reducing the number of nodes of the matching circuit. The efficiency of the proposed EA is tested in the synthesis of an impedance matching network for a VHF monopole whip antenna. This study’s results indicate a matching bandwidth improvement, a more uniformly distributed TPG along the operation frequency band and a more stable TPG regarding the components tolerance compared to the results obtained by previous approaches.     

A Novel SAO-based Filtering Technique for Reduction in Temporal Flickering Artifacts in H.265/HEVC

This paper presents a novel filtering technique based on sample adaptive offset (SAO) in H.265/high-efficiency video coding (HEVC) for reduction in the temporal flickering artifacts and improving the coding performance. SAO is a newly introduced technique for in-loop filtering in H.265/HEVC, which derives the offsets independently for each frame in the spatial domain without considering temporal frame correlation. As a result, the temporal distortion artifacts which will have a negative effect on the subjective quality, such as flickering artifacts, cannot be effectively addressed. In this paper, the rate-distortion optimization of the newly developed SAO method, referred to as Inter-SAO, is performed on the residual samples between adjacent frames. Inter-SAO and SAO in the reference software of H.265/HEVC (i.e., the test model HM) are then combined to form the novel in-loop filter-based method, denoted as 3D-SAO filtering method, where both spatial information and temporal information are effectively utilized to reduce the overall distortion in reconstructed videos. Compared with the SAO in HM, 3D-SAO has demonstrated its advanced performance for flickering artifacts suppression. Furthermore, 3D-SAO improves the coding efficiency compared with the SAO in HM with a performance gain of up to 0.91 dB in \(\Delta PSNR\), 1.74 dB in \(\Delta PSPNR\) and 7.33 % in BD-rate reduction.     

Concurrent Knowledge Extraction in Public-Key Models

Knowledge extraction is a fundamental notion, modeling machine possession of values (witnesses) in a computational complexity sense and enabling one to argue about the internal state of a party in a protocol without probing its internal secret state. However, when transactions are concurrent, say over the Internet, with players possessing public keys (as is common in cryptography), assuring that entities “know” what they claim to know, where adversaries may be well coordinated across different transactions, turns out to be much more subtle and in need of re-examination. In such settings, mixing the public-key structure as part of the language and statements is a natural adversarial strategy. Here, we investigate how to formally treat knowledge possession by parties interacting concurrently in the public-key model. More technically, we look into the relative power of the notion of “concurrent knowledge extraction” (CKE) for concurrent zero knowledge (CZK) in the bare public-key (BPK) model, where the language and statements being proved can be dynamically and adaptively chosen by the prover and may be possibly based on verifiers’ public keys. By concrete attacks against some existing natural protocols, we first show that concurrent soundness and normal arguments of knowledge do not guarantee concurrent verifier security in the public-key setting. Here, roughly speaking, concurrent verifier security says that the malicious concurrent prover should “know" all the witnesses to all the possibly public-key-related statements adaptively chosen and successfully proved in the concurrent sessions. These concrete attacks serve as a good motivation for understanding “possession of knowledge” for concurrent transactions with registered public keys, i.e., the subtleties of concurrent knowledge extraction in the public-key model. This motivates us to introduce and formalize the notion of CKE, along with clarifications of various subtleties. Two implementations are then presented for constant-round concurrently knowledge extractable concurrent zero-knowledge (CZK–CKE) argument for \(\mathcal {NP}\) in the BPK model: One protocol is generic and based on standard polynomial-time assumptions, whereas the other protocol is computationally efficient and employs complexity leveraging in a novel way. Both protocols can be practically instantiated for some specific number-theoretic languages without going through general \(\mathcal {NP}\)-reductions. Of independent interest are the discussions about the subtleties surrounding the fundamental structure of Feige–Shamir zero knowledge in the BPK model.     

Practical Analog Circuit Diagnosis Based on Fault Features with Minimum Ambiguities

As numerous faults exist in practical analog circuits, new challenges arise in the field of diagnosis with large-scale target faults as well as fault features. To address this issue, firstly, an ambiguity model is built to measure the distinguishability between two faults. Then, the optimal fault features are obtained by analyzing the response curves of the circuit under test (CUT) to minimize the ambiguities among the faults. Finally, comparisons are made among three classification methods, including the maximum likelihood classifier (MLC), artificial neural networks (ANNs) and support vector machine (SVM), to demonstrate their own diagnostic abilities for practical use. Two examples are illustrated, and taking advantage of an automated implementation framework, 92 faults in total are examined in the second example. The experimental results show that good diagnostic performances can be obtained with the proposed method. However, when a practical case is encountered, the ANNs method may fail due to its high time and space complexity, while the MLC and SVM methods are still applicable.