用动态规划神经网络模型研究多水库系统的水量分配(下)

为了分析多水库系统中两座水库之间灌溉用水的分配问题，建立了基到动态规划的神经网络模型。为了研究从一座上游水库取水在下游两座之库之间进行水量分配的问题，提出了3个状态变量和4个决策变量的改进的动态规划算法。采用神经网络模型，用3个状态变量动态规划算法得出调度原则，就所研究的多水库系统实例来说，新的动态规划神经网络模型的性能很好，将该模型的性能与临时凑合的标准调度原则和以前推荐使用的约束动态规划神经网络模型进行了比较。     

Self-organized public-key management for mobile ad hoc networks

In contrast with conventional networks, mobile ad hoc networks usually do not provide online access to trusted authorities or to centralized servers, and they exhibit frequent partitioning due to link and node failures and to node mobility. For these reasons, traditional security solutions that require online trusted authorities or certificate repositories are not well-suited for securing ad hoc networks. We propose a fully self-organized public-key management system that allows users to generate their public-private key pairs, to issue certificates, and to perform authentication regardless of the network partitions and without any centralized services. Furthermore, our approach does not require any trusted authority, not even in the system initialization phase.     

Small–Capacity Modular Units. Experience in Startup and Management

A series of small–capacity units has recently been constructed in regions of oil field development and crude oil and gas condensate production to satisfy the requirements for such petroleum products as naphtha, diesel fuel, kerosene, and boiler fuel and to reduce costs for delivery of these products. There are almost no data in the technical literature, particularly in periodicals, on the construction and operation of small–capacity units. We attempt to generalize the experience of Orgeneftekhimzavody Trust in this area. We hope that this experience will be useful to specialists in the development and management of small–capacity plants.     

From Poldhu to the Italian station of Coltano: Marconi and the first years of transcontinental wireless

This paper presents the evolution of low-frequency, high-power transcontinental transmission, starting from the first successful transatlantic link from Poldhu up to the Italian transcontinental station of Coltano. The trend toward higher and higher transmitting power, and the dead end into which wireless was heading if it were not for research in the higher frequency ranges, are pointed out.     

Reducible rank codes and their applications to cryptography

We present a new family of so-called reducible rank codes which are a generalization of rank product codes . This family includes maximal rank distance (MRD) codes for lengths n>N in the field F/sub N/. We give methods for encoding and decoding reducible rank codes. A public key cryptosystem based on these codes and on the idea of a column scrambler is proposed. The column scrambler "mixes" columns of a generator (parity-check) matrix of a code. It makes the system more resistant to structural attacks such as Gibson's attacks. Possible attacks on the system are thoroughly studied. The system is found to be secure against known attacks for public keys of about 16 kbits and greater.     

Graph-theoretic construction of low-density parity-check codes

This article presents a graph-theoretic method for constructing low-density parity-check (LDPC) codes from connected graphs without the requirement of large girth. This method is based on finding a set of paths in a connected graph, which satisfies the constraint that any two paths in the set are either disjoint or cross each other at one and only one vertex. Two trellis-based algorithms for finding these paths are devised. Good LDPC codes of practical lengths are constructed and they perform well with iterative decoding.     

On the convergence of the inverses of Toeplitz matrices and its applications

Many issues in signal processing involve the inverses of Toeplitz matrices. One widely used technique is to replace Toeplitz matrices with their associated circulant matrices, based on the well-known fact that Toeplitz matrices asymptotically converge to their associated circulant matrices in the weak sense. This often leads to considerable simplification. However, it is well known that such a weak convergence cannot be strengthened into strong convergence. It is this fact that severely limits the usefulness of the close relation between Toeplitz matrices and circulant matrices. Observing that communication receiver design often needs to seek optimality in regard to a data sequence transmitted within finite duration, we define the finite-term strong convergence regarding two families of matrices. We present a condition under which the inverses of a Toeplitz matrix converges in the strong sense to a circulant matrix for finite-term quadratic forms. This builds a critical link in the application of the convergence theorems for the inverses of Toeplitz matrices since the weak convergence generally finds its usefulness in issues associated with minimum mean squared error and the finite-term strong convergence is useful in issues associated with the maximum-likelihood or maximum a posteriori principles.     

Extracting Light from Polymer Light‐Emitting Diodes Using Stamped Bragg Gratings

In this paper, we describe a method for increasing the external efficiency of polymer light‐emitting diodes (LEDs) by coupling out waveguided light with Bragg gratings. We numerically model the waveguide modes in a typical LED structure and demonstrate how optimizing layer thicknesses and reducing waveguide absorption can enhance the grating outcoupling. The gratings were created by a soft‐lithography technique that minimizes changes to the conventional LED structure. Using one‐dimensional and two‐dimensional gratings, we were able to increase the forward‐directed emission by 47 % and 70 %, respectively, and the external quantum efficiency by 15 % and 25 %.