Analysis of operating conditions of ground-fault protection schemes for generator stator winding

This paper presents results of simulation studies of the influence of methods of grounding the stator winding of the unit-connected generator neutral on the operating conditions of a 100-percent ground-fault protection excited by the third-harmonic voltage ratio in the generator neutral and at its terminals. The analysis was performed for a generator with the neutral grounded through a ground-fault neutralizer, a third-harmonic stop filter, a resistor, and a capacitive voltage divider. The influence of the parameters of the particular elements of the grounding circuits on the voltage-feeding measuring element of the protection was determined. The capacitance to ground of the generator breakers was taken into account. The simulations were run for 1110-MVA unit-connected generator at ground faults along the whole length of the generator stator winding. It has been found that the method of grounding the generator neutral and the parameter of the grounding elements significantly influences the operating conditions of this protection. It is shown that through the proper selection of these parameters, the ground-fault protection of whole stator winding, counting from the generator neutral to the terminals is ensured.     

Design of a wideband microstrip antenna and the use of artificial neural networks in parameter calculation

This paper deals with the design of a multi-slot hole-coupled microstrip antenna on a substrate of 2 mm thickness that gives multi-frequency (wideband) characteristics. The Method of Moments (MoM)-based IE3D software was used to simulate the results for return loss, VSWR, the Smith chart, and the radiation patterns. A tunnel-based artificial neural network (ANN) was also developed to calculate the radiation patterns of the antenna. The radiation patterns were measured experimentally at 10.5 GHz and 12 GHz. The experimental results were in good agreement with the simulated results from IE3D and those of the artificial neural network. A new method of using a genetic algorithm (GA) in an artificial neural network is also discussed. This new method was used to calculate the resonant frequency of a single-shorting-post microstrip antenna. The resonant frequency calculated using the genetic-algorithm-coupled artificial neural network was compared with the analytical and experimental results. The results obtained were in very good agreement with the experimental results.     

Terahertz characterisation of building materials

To obtain realistic models for propagation channels in future pico-cellular indoor terahertz communication systems it is necessary to know the reflective properties of building materials found in a typical office environment. The angular dependent reflection coefficients of different building materials were determined using terahertz time-domain spectroscopy in transmission geometry and Fresnel's equations. This approach is more efficient than a set of measurements in reflection geometry for different angles. Verification of the method with a set of such reflection measurements shows an excellent agreement.     

An efficient nonlinear circuit simulation technique

This paper proposes a novel method for the analysis and simulation of integrated circuits (ICs) with the potential to greatly shorten the IC design cycle. The circuits are assumed to be subjected to input signals that have widely separated rates of variation, e.g., in communication systems, an RF carrier modulated by a low-frequency information signal. The proposed technique involves two stages. Initially, a particular order result for the circuit response is obtained using a multiresolution collocation scheme involving cubic spline wavelet decomposition. A more accurate solution is then obtained by adding another layer to the wavelet series approximation. However, the novel technique presented here enables the reuse of results acquired in the first stage to obtain the second-stage result. Therefore, vast gains in efficiency are obtained. Furthermore, a nonlinear model-order reduction technique can readily be used in both stages making the calculations even more efficient. Results will highlight the efficacy of the proposed approach     

Evaluation of image similarity by histogram intersection

Colour is the most widely used attribute in image retrieval and object recognition. A technique known as histogram intersection has been widely studied and is considered to be effective for color‐image indexing. The key issue of this algorithm is the selection of an appropriate color space and optimal quantization of the selected color space. The goal of this article is to measure the model performance in predicting human judgment in similarity measurement for various images, to explore the capability of the model with a wide set of color spaces, and to find the optimal quantization of the selected color spaces. Six color spaces and twelve quantization levels are involved in evaluating the performance of histogram intersection. The categorical judgment and rank order experiments were conducted to measure image similarity. The CIELAB color space was found to perform at least as good as or better than the other color spaces tested, and the ability to predict image similarity increased with the number of bins used in the histograms, for up to 512 bins (8 per channel). With more than 512 bins, further improvement was negligible for the image datasets used in this study. © 2005 Wiley Periodicals, Inc. Col Res Appl, 30, 265–274, 2005; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/col.20122     

A computational analysis of LCP methods for bilinear and concave quadratic programming

The use of a sequential linear complementarity problem (SLCP) algorithm for finding a global minimum of bilinear programming problem (BLP) or a concave quadratic program (CQP) is examined. The algorithm consists of solving a sequence of linear complementarity problems (LCP). A branch-and-bound method is also considered in this study. This algorithm is based on the reformulation of a BLP into an LCP with a linear function to minimize. Computational experience with small and medium scale BLPs and CQPs indicates that the SLCP algorithm is quite efficient in finding a global minimum (or at least a solution that is quite near the optimum), but it is, in general, unable to establish that such a solution has been found. An algorithm to find a lower-bound for the BLP can overcome this drawback in some cases. Furthermore the SLCP algorithm is shown to be robust and compares favorably with the branch-and-bound method and another alternative technique.     

Cinematic primitives for multimedia

The development of robust frameworks in interactive multimedia for representing story elements to the machine so that they can be retrieved in multiple contexts is addressed. Interactive multimedia is discussed as a user-directed form of storytelling, and the nature of cinematic storytelling is examined. It is proposed that content can be represented in layers. This model for layered information will allow programs to take advantage of the relation between cinematic sequences and the world they represent. The collection of content by the camera and microphone is considered in this context. The use of the methodology to build meaningful, context-rich sequences is discussed     

Interaction of a ductile projectile with a brittle solid medium

The process of interaction of a ductile projectile with a many times harder brittle target is analyzed in the 500–1000 m/sec range of velocities. The effect of hardness of the target and its fragmentation on the penetration depth is shown.Translated from Problemy Prochnosti, No. 9, pp. 60–62, September, 1991.