Finite-Element Time-Step Coupled Generator, Load, AVR and Brushless Exciter Modelling

This paper presented results from a details and comprehensive simulation using finite element method of the practical operation of an electrical machine. The results it displayed have been used in practice to design more efficient equipment.

Investigation of tanpura string vibrations using a two-dimensional time-domain model incorporating coupling and bridge friction

Tanpura string vibrations have been investigated previously using numerical models based on energy conserving schemes derived from a Hamiltonian description in one-dimensional form. Such time-domain models have the property that, for the lossless case, the numerical Hamiltonian (representing total energy of the system) can be proven to be constant from one time step
to the next, irrespective of any of the system parameters; in practice the Hamiltonian can be shown to be conserved within machine precision. Models of this kind can reproduce a jvari effect, which results from the bridge-string interaction. However the one-dimensional formulation has recently been shown to fail to replicate the jvaris strong dependence on the thread placement. As a first step towards simulations which accurately emulate this sensitivity to the thread placement, a twodimensional model is proposed, incorporating coupling of controllable level between the two string polarisations at the string termination opposite from the barrier. In addition, a friction force acting when the string slides across the bridge in horizontal direction is introduced, thus effecting a further damping mechanism. In this preliminary study, the string is terminated at the position of the thread. As in the one-dimensional model, an implicit scheme has to be used to solve the system, employing Newton's method to calculate the updated positions and momentums of each string segment. The two-dimensional model is proven to be energy conserving when the loss parameters are set to zero, irrespective of the coupling constant. Both frequency-dependent and independent losses are then added to the string, so that the model can be compared to analogous instruments. The influence of coupling and the bridge friction are investigated.

Goal Recognition through Goal Graph Analysis

We present a novel approach to goal recognition based on a two-stage paradigm of graph construction and analysis. First, a graph structure called a Goal Graph is constructed to represent the observed actions, the state of the world, and the achieved goals as well as various connections between these nodes at consecutive time steps. Then, the Goal Graph is analysed at each time step to recognise those partially or fully achieved goals that are consistent with the actions observed so far. The Goal Graph analysis also reveals valid plans for the recognised goals or part of these goals. Our approach to goal recognition does not need a plan library. It does not suffer from the problems in the acquisition and hand-coding of large plan libraries, neither does it have the problems in searching the plan space of exponential size. We describe two algorithms for Goal Graph construction and analysis in this paradigm. These algorithms are both provably sound, polynomial-time, and polynomial-space. The number of goals recognised by our algorithms is usually very small after a sequence of observed actions has been processed. Thus the sequence of observed actions is well explained by the recognised goals with little ambiguity. We have evaluated these algorithms in the UNIX domain, in which excellent performance has been achieved in terms of accuracy, efficiency, and scalability.

Unsteady Simulations of a Film Cooling Flow from an Inclined Cylindrical Jet

Film cooling is extensively used to provide protection against the severe thermal environment in gas turbine engines. Most of the computational studies on film cooling flow have been done using steady Reynolds-averaged Navier–Stokes calculation procedures. However, the flowfield associated with a jet in a crossflow is highly unsteady and complex with different types of vortical structures. In this paper, a computational investigation about the unsteady phenomena of a jet in a crossflow is performed using detached eddy simulation. Detailed computation of a single row of 35 deg round holes on a flat plate has been obtained for a 1.0 blowing ratio and a 2.0 density ratio. First, time-step size, grid resolution, and computational domain tests for an unsteady simulation have been conducted. Comparison between the results of unsteady Reynolds-averaged Navier–Stokes calculation, detached eddy simulation, and large eddy simulation is also performed. Comparison of the time-averaged detached eddy simulation prediction with the measured film-cooling effectiveness shows that the detached eddy simulation prediction is reasonable. From present detached eddy simulations, the influential coherent vortical structures of a film cooling flow can be seen. The unsteady physics of jet in a crossflow interactions and a jet liftoff in film cooling flows have been explained.

Dense subgraphs on dynamic networks

In distributed networks, it is often useful for the nodes to be aware of dense subgraphs, e.g., such a dense subgraph could reveal dense substructures in otherwise sparse graphs (e.g. the World Wide Web or social networks); these might reveal community clusters or dense regions for possibly maintaining good communication infrastructure. In this work, we address the problem of self-awareness of nodes in a dynamic network with regards to graph density, i.e., we give distributed algorithms for maintaining dense subgraphs that the member nodes are aware of. The only knowledge that the nodes need is that of the dynamic diameter D, i.e., the maximum number of rounds it takes for a message to traverse the dynamic network. For our work, we consider a model where the number of nodes are fixed, but a powerful adversary can add or remove a limited number of edges from the network at each time step. The communication is by broadcast only and follows the CONGEST model. Our algorithms are continuously executed on the network, and at any time (after some initialization) each node will be aware if it is part (or not) of a particular dense subgraph. We give algorithms that (2 + e)-approximate the densest subgraph and (3 + e)-approximate the at-least-k-densest subgraph (for a given parameter k). Our algorithms work for a wide range of parameter values and run in O(D log n) time. Further, a special case of our results also gives the first fully decentralized approximation algorithms for densest and at-least-k-densest subgraph problems for static distributed graphs. © 2012 Springer-Verlag.

Brief announcement: Maintaining large dense subgraphs on dynamic networks

In distributed networks, some groups of nodes may have more inter-connections, perhaps due to their larger bandwidth availability or communication requirements. In many scenarios, it may be useful for the nodes to know if they form part of a dense subgraph, e.g., such a dense subgraph could form a high bandwidth backbone for the network. In this work, we address the problem of self-awareness of nodes in a dynamic network with regards to graph density, i.e., we give distributed algorithms for maintaining dense subgraphs (subgraphs that the member nodes are aware of). The only knowledge that the nodes need is that of the dynamic diameter D, i.e., the maximum number of rounds it takes for a message to traverse the dynamic network. For our work, we consider a model where the number of nodes are fixed, but a powerful adversary can add or remove a limited number of edges from the network at each time step. The communication is by broadcast only and follows the CONGEST model in the sense that only messages of O(log n) size are permitted, where n is the number of nodes in the network. Our algorithms are continuously executed on the network, and at any time (after some initialization) each node will be aware if it is part (or not) of a particular dense subgraph. We give algorithms that approximate both the densest subgraph, i.e., the subgraph of the highest density in the network, and the at-least-k-densest subgraph (for a given parameter k), i.e., the densest subgraph of size at least k. We give a (2 + e)-approximation algorithm for the densest subgraph problem. The at-least-k-densest subgraph is known to be NP-hard for the general case in the centralized setting and the best known algorithm gives a 2-approximation. We present an algorithm that maintains a (3+e)-approximation in our distributed, dynamic setting. Our algorithms run in O(Dlog n) time. © 2012 Authors.

Numerical Study of Wave Slamming on an Oscillating Flap

Bottom hinged Oscillating Wave Surge Converters (OWSCs) are efficient devices for extracting power from ocean waves. There is limited knowledge about wave slamming on such devices. This paper deals with numerical studies of wave slamming on an oscillating flap to investigate the mechanism of slamming events. In our model, the Navier–Stokes equations are discretized using the Finite Volume method with the Volume of Fluid (VOF) approach for interface capturing. Waves are generated by a flaptype wave maker in the numerical wave tank, and the dynamic mesh method is applied to model the motion of the oscillating flap. Basic mesh and time step refinement studies are performed. The flow characteristics in a slamming event are analysed based on numerical results. Various simulations with different flap densities, water depths and wave amplitudes are performed for a better understanding of the slamming.

Experimental Investigation of Transient Saltwater Intrusion in Heterogeneous Porous Media

A 2D sandbox style experiment was developed to compare the results of numerical modelling to physical testing for saltwater intrusion in homogeneous and heterogeneous aquifers. The sandbox consisted of a thin central viewing chamber filled with glass beads of varying diameters (780μm, 1090μm and 1325μm) under fully saturated conditions. Dyed saltwater (SW) was introduced at the side boundary and a head difference imposed across the porous media. Images of the SW wedge were recorded at intervals in order to assess the suitability of the numerical models predictions of transient SW intrusion. Numerical modelling of the experimental cases were simulated using SUTRA. Two main parameters were chosen to express the condition of the intruding SW wedge at each recorded time step; the toe penetration length (TL) and the width of the mixing zone (WMZ). The WMZ was larger under transient conditions in the heterogeneous case, while the TL was longer for the homogeneous case. The increased variability in the flow field fo the heterogeneous case resulted in increased dispersion, and thus, increased WMZ.

On the complexity of solving polytree-shaped limited memory influence diagrams with binary variables

Influence diagrams are intuitive and concise representations of structured decision problems. When the problem is non-Markovian, an optimal strategy can be exponentially large in the size of the diagram. We can avoid the inherent intractability by constraining the size of admissible strategies, giving rise to limited memory influence diagrams. A valuable question is then how small do strategies need to be to enable efficient optimal planning. Arguably, the smallest strategies one can conceive simply prescribe an action for each time step, without considering past decisions or observations. Previous work has shown that finding such optimal strategies even for polytree-shaped diagrams with ternary variables and a single value node is NP-hard, but the case of binary variables was left open. In this paper we address such a case, by first noting that optimal strategies can be obtained in polynomial time for polytree-shaped diagrams with binary variables and a single value node. We then show that the same problem is NP-hard if the diagram has multiple value nodes. These two results close the fixed-parameter complexity analysis of optimal strategy selection in influence diagrams parametrized by the shape of the diagram, the number of value nodes and the maximum variable cardinality.

Development of a minor groove binder assay for real-time one-step RT-PCR detection of swine vesicular disease virus

The design and development of a 5' conjugated minor groove binder (MGB) probe real-time RT-PCR assay are described for rapid, sensitive and specific detection of swine vesicular disease virus (SVDV) RNA. The assay is designed to target the 2C gene of the SVDV genome and is capable of detecting 2 x 10(2) copies of an RNA standard per reaction. It does not detect any of the other RNA viruses that cause vesicular disease in pigs, or the human enterovirus, Coxsackie B5 virus (CVB5) which is closely related antigenically to SVDV. The linear range of this test was from 2 x 10(2) to 2 x 10(8) copies/mu l. The assay is rapid and can detect SVDV RNA in just over 3.5 h including the time required for nucleic acid extraction. The development of this assay provides a useful tool for the differential diagnosis of SVD or for the detection of SVDV in research applications. This study demonstrates the suitability of MGB probes as a real-time PCR chemistry for the diagnosis of swine vesicular disease. (C) 2010 Elsevier B.V. All rights reserved.

Double potential step chronoamperometry at microdisk electrodes: simulating the case of unequal diffusion coefficients

An efficient approach to the simulation of the double potential step chronoamperometry at a microdisk electrode based on an exponentially expanding time grid and conformal mapping of the space is presented. The dimensionless second potential step flux data are included as a function of the first potential step duration and the ratio of the diffusion coefficients of the reacting species allowing instant analysis of the experimental double potential step chronoamperograms without a need for simulation. The values of the diffusion coefficients are determined for several test systems and found to be in good agreement with existing literature data. (C) 2004 Elsevier B.V. All rights reserved.

The exponentiated convex variable step-size (ECVSS) algorithm

For some time there is a large interest in variable step-size methods for adaptive filtering. Recently, a few stochastic gradient algorithms have been proposed, which are based on cost functions that have exponential dependence on the chosen error. However, we have experienced that the cost function based on exponential of the squared error does not always satisfactorily converge. In this paper we modify this cost function in order to improve the convergence of exponentiated cost function and the novel ECVSS (exponentiated convex variable step-size) stochastic gradient algorithm is obtained. The proposed technique has attractive properties in both stationary and abrupt-change situations. (C) 2010 Elsevier B.V. All rights reserved.

Time-resolved optical spectroscopy of the pulsating DA white dwarf HS0507+0434B - New constraints on mode identification and pulsation properties

We present a detailed analysis of time-resolved optical spectra of the ZZ Ceti white dwarf, HS 0507+0434B. Using the wavelength dependence of observed mode amplitudes, we deduce the spherical degree, l, of the modes, most of which have l = 1. The presence of a large number of combination frequencies (linear sums or differences of the real modes) enabled us not only to test theoretical predictions but also to indirectly infer spherical and azimuthal degrees of real modes that had no observed splittings. In addition to the above, we measure line-of-sight velocities from our spectra. We find only marginal evidence for periodic modulation associated with the pulsation modes: at the frequency of the strongest mode in the lightcurve, we measure an amplitude of 2.6 +/- 1.0 kms(-1), which has a probability of 2% of being due to chance; for the other modes, we find lower values. Our velocity amplitudes and upper limits are smaller by a factor of two compared to the amplitudes found in ZZ Psc. We find that this is consistent with expectations based on the position of HS 0507+0434B in the instability strip. Combining all the available information from data such as ours is a first step towards constraining atmospheric properties in a convectionally unstable environment from an observational perspective.