Construction of a control system for disturbance rejection using a dual observer

A well‐known control system which can reduce the adverse effects of disturbances is a disturbance observer. However, in many cases of mechanical systems, system disturbances which do not satisfy the matching condition may be imposed. Therefore, it may be difficult to reduce the adverse effects of the disturbances by the traditional disturbance observer. In this paper, a method of control system synthesis for disturbance rejection using a dual observer is proposed. This method is based on the zeroing induced by the disturbance localization problem. This problem may be solved by dividing the state space into observable subspace and unobservable subspace. As compared with an H_∞ controller based on perfect observation, the usefulness of the proposed control system for disturbance rejection is demonstrated by numerical simulations for a two‐mass spring system. © 2002 Scripta Technica, Electr Eng Jpn, 138(4): 50–60, 2002; DOI 10.1002/eej.1138     

非AWGN环境下调制类型自动识别

在非AWGN环境下，针对CW，AM，FM，OOK，PSK，QPSK，16QAM，FSK，MSK，SSB十种混合调制信号，对调制类型特征提取方法和自动识别算法进行了分析、综合、设计和计算机仿真。提出了梯层电平分析方法、频率瞬时信号分析、剔除载波的归一化能量分析、平方后信号的频谱分析、四次方后的信号频谱分析等方法。当SNR=10dB时，计算机仿真结果是正确识别率不低于95％，自动识别的平均处理时间为不超过10s。     

工业化陶瓷超滤膜的表征

以液-液排除法测定工业化陶瓷超滤膜的孔径及孔径分布，比较了两种渗透体系对测定结果的影响；用已知分子量标准物质考察了不同膜的截留行为，获得了各膜的切割分子量值，并分析了截留率与孔径的对应关系，为工业化陶瓷膜的开发提供依据。     

Induction of immune tolerance with heart-thymus composite allotransplantation in rats

Objective To study on the role of thymus transplantation for heart allograft in rats. Methods Vascularized heart-thymus combined transplantation was performed with microsurgical technique. Graft survival, histopathology, level of IL-2, IL-4 and its mRNA expression in serum and cardiac grafts were investigated. Results Heart-thymus combined transplantation achieved effect in the prolongation of cardiac graft survival with short-term administration of cyclosporine. Conclusions Vascularized thymus transplantation induced immune tolerance in thymectomized rats.     

Onr-partition designs in hamming spaces

The concept of the combinatorial matrix of an unrestricted code and the notion of anr-partition design admitted by a code are introduced and discussed in detail. The theory includes a characterization of completely regular codes, and a combinatorial interpretation of the fact that the distinct rows of the distance distribution matrix of a code are linearly independent. In general, it is possible to compute the distance distribution matrix of any code admitting a given partition design by solving a well-defined system of linear equations; this is an efficient technique provided the number of classes in the partition is relatively small.     

Compact and localized distributed data structures

This survey concerns the role of data structures for compactly storing and representing various types of information in a localized and distributed fashion. Traditional approaches to data representation are based on global data structures, which require access to the entire structure even if the sought information involves only a small and local set of entities. In contrast, localized data representation schemes are based on breaking the information into small local pieces, or labels , selected in a way that allows one to infer information regarding a small set of entities directly from their labels, without using any additional (global) information. The survey concentrates mainly on combinatorial and algorithmic techniques, such as adjacency and distance labeling schemes and interval schemes for routing, and covers complexity results on various applications, focusing on compact localized schemes for message routing in communication networks.Received: August 2001, Accepted: May 2002, Supported in part by a grant from the Israel Science Foundation.     

On the number of broadcast schemes in networks

Broadcasting is the process of spreading one piece of information among a group of individuals connected by an interconnection network. In this paper we give exact lower and upper bounds for the number of broadcast schemes in arbitrary networks. Also, we give the exact value for complete bipartite graphs and an upper bound for regular networks. Based on the counting method we describe a new random algorithm for broadcasting in networks.     

Threshold cryptography based on Asmuth-Bloom secret sharing

In this paper, we investigate how threshold cryptography can be conducted with the Asmuth-Bloom secret sharing scheme and present three novel function sharing schemes for RSA, ElGamal and Paillier cryptosystems. To the best of our knowledge, these are the first provably secure threshold cryptosystems realized using the Asmuth-Bloom secret sharing. Proposed schemes are comparable in performance to earlier proposals in threshold cryptography.     

How to make and defend a proposal in a deliberation dialogue

In this paper it is shown how tools developed in argumentation theory and artificial intelligence can be applied to the development of a new dialectical analysis of the speech act of making a proposal in a deliberation dialogue. These tools are developed, modified and used to formulate dialogue pre-conditions, defining conditions and post-conditions for the speech act of making a proposal in a deliberation dialogue. The defining conditions set out what is required for a move in a dialogue to count as the making of a proposal by one of the parties. What is required are the conditions that (1) the move fit the requirements of the argumentation scheme for practical reasoning, and (2) the premises are propositions describing common goals of both parties or propositions that they reasonably consider means to achieve these goals. The analysis goes beyond the standard speech act approach by specifying not only the normative requirements for making a well-formed proposal, but also the requirements for responding to it by questioning or criticizing it, and the requirements for defending it.