With the growing size and complexity of power systems, system analysis—such as transients calculation—takes much time. Hence, fast calculation methods are required. Although parallel processing is a hopeful method, there have been difficulties in the parallel solution of linear equations which appear in power-flow calculations by the Newton-Raphson method. This paper aims at the fast calculation of the power-flow problem by means of parallel processing. In order to improve the suitability to the parallel solution of the differential equation in transients calculation, we assume the use of a direct-mapping parallel processing machine to map directly the network of a power system onto a network of processors. Under this assumption, we propose a new parallel-processing-oriented method in which the linear equation is solved by linear iterations between nodes with Aitken acceleration. We simulate the method on three model power systems and compare this Parallel Iterative Method (PIN) with a Parallel Direct Method (PDM) which uses the banded matrix according to the number of operations required. As a result, we can expect that PIM may solve linear equations faster than PDM with m processors, although the PIM might be inferior to the PDM with m × m processors, where m denotes the half-band width of the banded matrix. 相似文献
Four levels of egg white powder (EWP), 0, 1.5, 3.0 and 4.5%, were added to fisfc cracker formulation consisting of tapioca starch, fish paste, and water. the mixture was extruded through a single screw extruder, and the extrudate was cut, dried, heated in a microwave, and the degrees of expansion, bulk density, colour and protein content were measured. The addition of 1.5 and 3.0% EWP had no significant effect ( P < 0.01) on diametral and longitudinal expansion, however, 4.5% EWP significantly ( P < 0.01) reduced them. Bulk density and protein content of the final product increased as the percentage of EWP increased in the formulation. the total colour difference measurement showed a significant increase ( P < 0.01) in brown colouration at 4.5% EWP. 相似文献
This paper concerns the following problem: given a set of multi-attribute records, a fixed number of buckets and a two-disk system, arrange the records into the buckets and then store the buckets between the disks in such a way that, over all possible orthogonal range queries (ORQs), the disk access concurrency is maximized. We shall adopt the multiple key hashing (MKH) method for arranging records into buckets and use the disk modulo (DM) allocation method for storing buckets onto disks. Since the DM allocation method has been shown to be superior to any other allocation methods for allocating an MKH file onto a two-disk system for answering ORQs, the real issue is knowing how to determine an optimal way for organizing the records into buckets based upon the MKH concept.
A performance formula that can be used to evaluate the average response time, over all possible ORQs, of an MKH file in a two-disk system using the DM allocation method is first presented. Based upon this formula, it is shown that our design problem is related to a notoriously difficult problem, namely the Prime Number Problem. Then a performance lower bound and an efficient algorithm for designing optimal MKH files in certain cases are presented. It is pointed out that in some cases the optimal MKH file for ORQs in a two-disk system using the DM allocation method is identical to the optimal MKH file for ORQs in a single-disk system and the optimal average response time in a two-disk system is slightly greater than one half of that in a single-disk system. 相似文献
Stability of large-scale coal-fired MHD channels is studied by (1) linearized stability analysis, and (2) time-dependent 1-D analysis. The channel length is 15 m with 600 electrode pairs, and the output power ranges from 220.6 MW through 258.7 MW. Linearized stability analyses show that the Faraday channels operated with fixed loading resistance are stable, whereas the two waves of u and u–a (u, a: gas and sound velocity) become unstable in the Faraday channel with fixed loading factor. Two waves of u and u–a are unstable in the diagonal channel with fixed loading current and the u + a wave becomes unstable in the diagonal channel with fixed electrode current. Time-dependent one-dimensional analyses indicate that the Faraday channels with fixed load resistance are smooth without growth of fluctuation. The diagonal channels with fixed electrode current are smooth with no fluctuation, though the linear theory indicates that the u + a wave is unstable. The diagonal channel with fixed load current suffers large disturbance along the latter half of the channel, being consistent with the linearized analysis which indicates that the u - a and u waves are unstable. 相似文献
A scanning electron microscope (SEM) is a sophisticated equipment employed for fine imaging of a variety of surfaces. In this study, prediction models of SEM were constructed by using a generalized regression neural network (GRNN) and genetic algorithm (GA). The SEM components examined include condenser lens 1 and 2 and objective lens (coarse and fine) referred to as CL1, CL2, OL-Coarse, and OL-Fine. For a systematic modeling of SEM resolution (R), a face-centered Box–Wilson experiment was conducted. Two sets of data were collected with or without the adjustment of magnification. Root-mean-squared prediction error of optimized GRNN models are GA 0.481 and 1.96×10-12 for non-adjusted and adjusted data, respectively. The optimized models demonstrated a much improved prediction over statistical regression models. The optimized models were used to optimize parameters particularly under best tuned SEM environment. For the variations in CL2 and OL-Coarse, the highest R could be achieved at all conditions except a larger CL2 either at smaller or larger OL-Coarse. For the variations in CL1 and CL2, the highest R was obtained at all conditions but larger CL2 and smaller CL1. 相似文献
This paper addresses the problem of switching stabilization for discrete-time switched linear systems. Based on the abstraction-aggregation methodology, we propose a state-feedback path-wise switching law, which is a state-feedback concatenation from a finite set of switching paths each defined over a finite time interval. We prove that the set of state-feedback path-wise switching laws is universal in the sense that any stabilizable switched linear system admits a stabilizing switching law in this set. We further develop a computational procedure to calculate a stabilizing switching law in the set. 相似文献