Velocity ratio in the analysis of linear dynamical systems

The transfer matrix method is known to be well suited for a complete analysis of a lumped as well as distributed element, one-dimensional, linear dynamical system with a marked chain topology. However, general subroutines of the type available for classical matrix methods are not available in the current literature on transfer matrix methods. In the present article, general expressions for various aspects of analysis-viz., natural frequency equation, modal vectors, forced response and filter performance—have been evaluated in terms of a single parameter, referred to as velocity ratio. Subprograms have been developed for use with the transfer matrix method for the evaluation of velocity ratio and related parameters. It is shown that a given system, branched or straight-through, can be completely analysed in terms of these basic subprograms, on a stored program digital computer. It is observed that the transfer matrix method with the velocity ratio approach has certain advantages over the existing general matrix methods in the analysis of one-dimensional systems.

An algebraic algorithm for the design and analysis of linear dynamical systems

In an earlier paper [1], it has been shown that velocity ratio, defined with reference to the analogous circuit, is a basic parameter in the complete analysis of a linear one-dimensional dynamical system. In this paper it is shown that the terms constituting velocity ratio can be readily determined by means of an algebraic algorithm developed from a heuristic study of the process of transfer matrix multiplication. The algorithm permits the set of most significant terms at a particular frequency of interest to be identified from a knowledge of the relative magnitudes of the impedances of the constituent elements of a proposed configuration. This feature makes the algorithm a potential tool in a first approach to a rational design of a complex dynamical filter. This algorithm is particularly suited for the desk analysis of a medium size system with lumped as well as distributed elements.

On linear order and computation : The expressiveness of interactive computations on linear orders and computations indexed by ordinals

We solve the Dynamic Ehrenfeucht-Fra\"iss\'e Game on linear orders for both players, yielding a normal form for quantifier-rank equivalence classes of linear orders in first-order logic, infinitary logic, and generalized-infinitary logics with linearly ordered clocks. We show that Scott Sentences can be manipulated quickly, classified into local information, and consistency can be decided effectively in the length of the Scott Sentence. We describe a finite set of linked automata moving continuously on a linear order. Running them on ordinals, we compute the ordinal truth predicate and compute truth in the constructible universe of set-theory. Among the corollaries are a study of semi-models as efficient database of both model-theoretic and formulaic information, and a new proof of the atomicity of the Boolean algebra of sentences consistent with the theory of linear order -- i.e., that the finitely axiomatized theories of linear order are dense.

Application of ultraspherical polynomials to forced oscillations of a third-order non-linear system

In this paper the method of ultraspherical polynomial approximation is applied to study the steady-state response in forced oscillations of a third-order non-linear system. The non-linear function is expanded in ultraspherical polynomials and the expansion is restricted to the linear term. The equation for the response curve is obtained by using the linearized equation and the results are presented graphically. The agreement between the approximate solution and the analog computer solution is satisfactory. The problem of stability is not dealt with in this paper.

Numerical studies on quasilinear and linear elliptic equations

We explore here the acceleration of convergence of iterative methods for the solution of a class of quasilinear and linear algebraic equations. The specific systems are the finite difference form of the Navier-Stokes equations and the energy equation for recirculating flows. The acceleration procedures considered are: the successive over relaxation scheme; several implicit methods; and a second-order procedure. A new implicit method—the alternating direction line iterative method—is proposed in this paper. The method combines the advantages of the line successive over relaxation and alternating direction implicit methods. The various methods are tested for their computational economy and accuracy on a typical recirculating flow situation. The numerical experiments show that the alternating direction line iterative method is the most economical method of solving the Navier-Stokes equations for all Reynolds numbers in the laminar regime. The usual ADI method is shown to be not so attractive for large Reynolds numbers because of the loss of diagonal dominance. This loss can however be restored by a suitable choice of the relaxation parameter, but at the cost of accuracy. The accuracy of the new procedure is comparable to that of the well-tested successive overrelaxation method and to the available results in the literature. The second-order procedure turns out to be the most efficient method for the solution of the linear energy equation.

Non-linear bending of beams of variable cross-section

For the non-linear bending of cantilever beams of variable cross-section, the effect of large deformations, but with linear elasticity, is considered. The governing integral equation is solved by a numerical iterative procedure. Results for some typical cases are obtained and compared with some of those available in the literature.

Viscoelastic Properties of Nanocrystalline Films of Semiconducting Chalcogenides at Liquid/Liquid Interface

The interfacial shear rheological properties of a continuous single-crystalline film of CuS and a 3D particulate gel of CdS nanoparticles (3−5 nm in diameter) formed at toluene−water interfaces have been studied. The ultrathin films (50 nm in thickness) are formed in situ in the shear cell through a reaction at the toluene−water interface between a metal−organic compound in the organic layer and an appropriate reagent for sulfidation in the aqueous layer. Linear viscoelastic spectra of the nanofilms reveal solid-like rheological behavior with the storage modulus higher than the loss modulus over the range of angular frequencies probed. Large strain amplitude sweep measurements on the CdS nanofilms formed at different reactant concentrations suggest that they form a weakly flocculated gel. Under steady shear, the films exhibit a yield stress, followed by a steady shear thinning at high shear rates. The viscoelastic and flow behavior of these films that are in common with those of many 3D “soft” materials like gels, foams, and concentrated colloidal suspensions can be described by the “soft” glassy rheology model.

Estimating daily methane production in individual cattle with irregular feed intake patterns from short-term methane emission measurements

Spot measurements of methane emission rate (n = 18 700) by 24 Angus steers fed mixed rations from GrowSafe feeders were made over 3- to 6-min periods by a GreenFeed emission monitoring (GEM) unit. The data were analysed to estimate daily methane production (DMP; g/day) and derived methane yield (MY; g/kg dry matter intake (DMI)). A one-compartment dose model of spot emission rate v. time since the preceding meal was compared with the models of Wood (1967) and Dijkstra et al. (1997) and the average of spot measures. Fitted values for DMP were calculated from the area under the curves. Two methods of relating methane and feed intakes were then studied: the classical calculation of MY as DMP/DMI (kg/day); and a novel method of estimating DMP from time and size of preceding meals using either the data for only the two meals preceding a spot measurement, or all meals for 3 days prior. Two approaches were also used to estimate DMP from spot measurements: fitting of splines on a 'per-animal per-day' basis and an alternate approach of modelling DMP after each feed event by least squares (using Solver), summing (for each animal) the contributions from each feed event by best-fitting a one-compartment model. Time since the preceding meal was of limited value in estimating DMP. Even when the meal sizes and time intervals between a spot measurement and all feeding events in the previous 72 h were assessed, only 16.9% of the variance in spot emission rate measured by GEM was explained by this feeding information. While using the preceding meal alone gave a biased (underestimate) of DMP, allowing for a longer feed history removed this bias. A power analysis taking into account the sources of variation in DMP indicated that to obtain an estimate of DMP with a 95% confidence interval within 5% of the observed 64 days mean of spot measures would require 40 animals measured over 45 days (two spot measurements per day) or 30 animals measured over 55 days. These numbers suggest that spot measurements could be made in association with feed efficiency tests made over 70 days. Spot measurements of enteric emissions can be used to define DMP but the number of animals and samples are larger than are needed when day-long measures are made.

Constrained linear minimax filter for systems with large plant uncertainties

This paper presents a method of designing a minimax filter in the presence of large plant uncertainties and constraints on the mean squared values of the estimates. The minimax filtering problem is reformulated in the framework of a deterministic optimal control problem and the method of solution employed, invokes the matrix Minimum Principle. The constrained linear filter and its relation to singular control problems has been illustrated. For the class of problems considered here it is shown that the filter can he constrained separately after carrying out the mini maximization. Numorieal examples are presented to illustrate the results.

A new approach for fixed point smoothing in linear distributed parameter systems

In this paper, we solve the distributed parameter fixed point smoothing problem by formulating it as an extended linear filtering problem and show that these results coincide with those obtained in the literature using the forward innovations method.

Algorithms for 13C metabolic flux analysis

The metabolism of an organism consists of a network of biochemical reactions that transform small molecules, or metabolites, into others in order to produce energy and building blocks for essential macromolecules. The goal of metabolic flux analysis is to uncover the rates, or the fluxes, of those biochemical reactions. In a steady state, the sum of the fluxes that produce an internal metabolite is equal to the sum of the fluxes that consume the same molecule. Thus the steady state imposes linear balance constraints to the fluxes. In general, the balance constraints imposed by the steady state are not sufficient to uncover all the fluxes of a metabolic network. The fluxes through cycles and alternative pathways between the same source and target metabolites remain unknown. More information about the fluxes can be obtained from isotopic labelling experiments, where a cell population is fed with labelled nutrients, such as glucose that contains 13C atoms. Labels are then transferred by biochemical reactions to other metabolites. The relative abundances of different labelling patterns in internal metabolites depend on the fluxes of pathways producing them. Thus, the relative abundances of different labelling patterns contain information about the fluxes that cannot be uncovered from the balance constraints derived from the steady state. The field of research that estimates the fluxes utilizing the measured constraints to the relative abundances of different labelling patterns induced by 13C labelled nutrients is called 13C metabolic flux analysis. There exist two approaches of 13C metabolic flux analysis. In the optimization approach, a non-linear optimization task, where candidate fluxes are iteratively generated until they fit to the measured abundances of different labelling patterns, is constructed. In the direct approach, linear balance constraints given by the steady state are augmented with linear constraints derived from the abundances of different labelling patterns of metabolites. Thus, mathematically involved non-linear optimization methods that can get stuck to the local optima can be avoided. On the other hand, the direct approach may require more measurement data than the optimization approach to obtain the same flux information. Furthermore, the optimization framework can easily be applied regardless of the labelling measurement technology and with all network topologies. In this thesis we present a formal computational framework for direct 13C metabolic flux analysis. The aim of our study is to construct as many linear constraints to the fluxes from the 13C labelling measurements using only computational methods that avoid non-linear techniques and are independent from the type of measurement data, the labelling of external nutrients and the topology of the metabolic network. The presented framework is the first representative of the direct approach for 13C metabolic flux analysis that is free from restricting assumptions made about these parameters.In our framework, measurement data is first propagated from the measured metabolites to other metabolites. The propagation is facilitated by the flow analysis of metabolite fragments in the network. Then new linear constraints to the fluxes are derived from the propagated data by applying the techniques of linear algebra.Based on the results of the fragment flow analysis, we also present an experiment planning method that selects sets of metabolites whose relative abundances of different labelling patterns are most useful for 13C metabolic flux analysis. Furthermore, we give computational tools to process raw 13C labelling data produced by tandem mass spectrometry to a form suitable for 13C metabolic flux analysis.

Optimisation Problems in Wireless Sensor Networks : Local Algorithms and Local Graphs

This thesis studies optimisation problems related to modern large-scale distributed systems, such as wireless sensor networks and wireless ad-hoc networks. The concrete tasks that we use as motivating examples are the following: (i) maximising the lifetime of a battery-powered wireless sensor network, (ii) maximising the capacity of a wireless communication network, and (iii) minimising the number of sensors in a surveillance application. A sensor node consumes energy both when it is transmitting or forwarding data, and when it is performing measurements. Hence task (i), lifetime maximisation, can be approached from two different perspectives. First, we can seek for optimal data flows that make the most out of the energy resources available in the network; such optimisation problems are examples of so-called max-min linear programs. Second, we can conserve energy by putting redundant sensors into sleep mode; we arrive at the sleep scheduling problem, in which the objective is to find an optimal schedule that determines when each sensor node is asleep and when it is awake. In a wireless network simultaneous radio transmissions may interfere with each other. Task (ii), capacity maximisation, therefore gives rise to another scheduling problem, the activity scheduling problem, in which the objective is to find a minimum-length conflict-free schedule that satisfies the data transmission requirements of all wireless communication links. Task (iii), minimising the number of sensors, is related to the classical graph problem of finding a minimum dominating set. However, if we are not only interested in detecting an intruder but also locating the intruder, it is not sufficient to solve the dominating set problem; formulations such as minimum-size identifying codes and locating dominating codes are more appropriate. This thesis presents approximation algorithms for each of these optimisation problems, i.e., for max-min linear programs, sleep scheduling, activity scheduling, identifying codes, and locating dominating codes. Two complementary approaches are taken. The main focus is on local algorithms, which are constant-time distributed algorithms. The contributions include local approximation algorithms for max-min linear programs, sleep scheduling, and activity scheduling. In the case of max-min linear programs, tight upper and lower bounds are proved for the best possible approximation ratio that can be achieved by any local algorithm. The second approach is the study of centralised polynomial-time algorithms in local graphs these are geometric graphs whose structure exhibits spatial locality. Among other contributions, it is shown that while identifying codes and locating dominating codes are hard to approximate in general graphs, they admit a polynomial-time approximation scheme in local graphs.

Otolith morphology of four mackerel species (Scomberomorus spp.) in Australia: Species differentiation and prediction for fisheries monitoring and assessment

Four species of large mackerels (Scomberomorus spp.) co-occur in the waters off northern Australia and are important to fisheries in the region. State fisheries agencies monitor these species for fisheries assessment; however, data inaccuracies may exist due to difficulties with identification of these closely related species, particularly when specimens are incomplete from fish processing. This study examined the efficacy of using otolith morphometrics to differentiate and predict among the four mackerel species off northeastern Australia. Seven otolith measurements and five shape indices were recorded from 555 mackerel specimens. Multivariate modelling including linear discriminant analysis (LDA) and support vector machines, successfully differentiated among the four species based on otolith morphometrics. Cross validation determined a predictive accuracy of at least 96% for both models. An optimum predictive model for the four mackerel species was an LDA model that included fork length, feret length, feret width, perimeter, area, roundness, form factor and rectangularity as explanatory variables. This analysis may improve the accuracy of fisheries monitoring, the estimates based on this monitoring (i.e. mortality rate) and the overall management of mackerel species in Australia.

Turbulence measurements in an equilibrium axisymmetric wall jet

This paper reports measurements of turbulent quantities in an axisymmetric wall jet subjected to an adverse pressure gradient in a conical diffuser, in such a way that a suitably defined pressure-gradient parameter is everywhere small. Self-similarity is observed in the mean velocity profile, as well as the profiles of many turbulent quantities at sufficiently large distances from the injection slot. Autocorrelation measurements indicate that, in the region of turbulent production, the time scale of ν fluctuations is very much smaller than the time scale of u fluctuations. Based on the data on these time scales, a possible model is proposed for the Reynolds stress. One-dimensional energy spectra are obtained for the u, v and w components at several points in the wall jet. It is found that self-similarity is exhibited by the one-dimensional wavenumber spectrum of $\overline{q^2}(=\overline{u^2}+\overline{v^2}+\overline{w^2})$, if the half-width of the wall jet and the local mean velocity are used for forming the non-dimensional wavenumber. Both the autocorrelation curves and the spectra indicate the existence of periodicity in the flow. The rate of dissipation of turbulent energy is estimated from the $\overline{q^2}$ spectra, using a slightly modified version of a previously suggested method.

Iterative solution of a class of linear equations with application to reconstruction of three-dimensional object arrays

An iterative algorithm baaed on probabilistic estimation is described for obtaining the minimum-norm solution of a very large, consistent, linear system of equations AX = g where A is an (m times n) matrix with non-negative elements, x and g are respectively (n times 1) and (m times 1) vectors with positive components.