ORCID Profile
0000-0003-2382-8137
Current Organisation
University of South Australia
Does something not look right? The information on this page has been harvested from data sources that may not be up to date. We continue to work with information providers to improve coverage and quality. To report an issue, use the Feedback Form.
Publisher: Elsevier BV
Date: 10-2007
Publisher: Informa UK Limited
Date: 1997
Publisher: Elsevier BV
Date: 08-2005
Publisher: Elsevier BV
Date: 2006
Publisher: Elsevier BV
Date: 11-2023
Publisher: SIGMA (Symmetry, Integrability and Geometry: Methods and Application)
Date: 07-04-2006
Publisher: IEEE
Date: 2002
Publisher: Springer London
Date: 1995
Publisher: Elsevier BV
Date: 06-2020
Publisher: IEEE
Date: 07-2015
Publisher: Cambridge University Press (CUP)
Date: 1997
DOI: 10.1017/S0334270000000746
Abstract: This paper derives key equations for the determination of optimal control strategies in an important engineering application. A train travels from one station to the next along a track with continuously varying gradient. The journey must be completed within a given time and it is desirable to minimise fuel consumption. We assume that only certain discrete throttle settings are possible and that each setting determines a constant rate of fuel supply. This assumption is based on the control mechanism for a typical diesel-electric locomotive. For each setting the power developed by the locomotive is directly proportional to the rate of fuel supply. We assume a single level of braking acceleration. For each fixed finite sequence of control settings we show that fuel consumption is minimised only if the settings are changed when certain key equations are satisfied. The strategy determined by these equations is called a strategy of optimal type. We show that the equations can be derived using an intuitive limit procedure applied to corresponding equations obtained by Howlett [9, 10] in the case of a piecewise constant gradient. The equations will also be derived directly by extending the methods used by Howlett. We discuss a basic solution procedure for the key equations and apply the procedure to find a strategy of optimal type in appropriate specific ex les.
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 04-2006
Publisher: Elsevier BV
Date: 12-2016
Publisher: IEEE
Date: 2003
Publisher: Elsevier BV
Date: 06-2010
Publisher: Springer Science and Business Media LLC
Date: 2003
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 1993
DOI: 10.1109/9.262051
Publisher: Springer Science and Business Media LLC
Date: 2003
Publisher: Informa UK Limited
Date: 09-2006
Publisher: Institute for Operations Research and the Management Sciences (INFORMS)
Date: 03-2023
Abstract: We propose an analytic solution to the problem of finding optimal driving strategies that minimize total tractive energy consumption for a fleet of trains traveling on the same track in the same direction subject to clearance-time equality constraints that ensure safe separation and compress the headway timespan. We assume the track is ided into sections by a set of trackside signals at fixed positions. For each intermediate signal there is an associated signal segment consisting of the two adjacent sections. Successive trains are safely separated only if the leading train leaves the signal segment before the following train enters. Although the fleet can be safely separated by a complete set of clearance times and associated clearance-time inequality constraints the problem of finding optimal schedules with safe separation rapidly becomes intractable as the number of trains and signals increases. The main difficulty is in distinguishing between active equality constraints and inactive inequality constraints. The curse of dimensionality means it is not feasible to check every different combination of active constraints, find the optimal strategies for each train, optimize the corresponding prescribed times and calculate the cost. Nevertheless we can formulate and solve an alternative problem with active clearance-time equality constraints for successive trains defined at selected signals. We show that this problem can be formulated as an unconstrained convex optimization and propose a solution algorithm that finds the optimal schedule and the associated optimal strategies for each train. Finally we find optimal schedules for a case study using realistic parameters on a busy metropolitan line.
Publisher: Elsevier BV
Date: 04-1994
Publisher: Elsevier BV
Date: 03-2009
Publisher: Cambridge University Press (CUP)
Date: 04-1990
DOI: 10.1017/S0334270000006780
Abstract: A train travels from one station to the next along a level track. The journey must be completed within a given time and it is desirable to minimise the energy required to drive the train. It has been shown with an appropriate formulation of the problem that an optimal strategy exists and that this strategy must satisfy a Pontryagin type criterion. In this paper the Pontryagin principle will be used to find the nature of the optimal strategy and this information will then be used to determine the precise optimal strategy.
Publisher: Elsevier BV
Date: 09-2014
Publisher: Cambridge University Press (CUP)
Date: 07-2020
DOI: 10.1017/S1446181120000188
Abstract: Let $\\boldsymbol{f}$ be a square-integrable, zero-mean, random vector with observable realizations in a Hilbert space H , and let $\\boldsymbol{g}$ be an associated square-integrable, zero-mean, random vector with realizations which are not observable in a Hilbert space K . We seek an optimal filter in the form of a closed linear operator X acting on the observable realizations of a proximate vector $\\boldsymbol{f}_{\\epsilon } \\approx \\boldsymbol{f}$ that provides the best estimate $\\widehat{\\boldsymbol{g}}_{\\epsilon} = X \\boldsymbol{f}_{\\epsilon}$ of the vector $\\boldsymbol{g}$ . We assume the required covariance operators are known. The results are illustrated with a typical ex le.
Publisher: Elsevier BV
Date: 04-1996
Publisher: Cambridge University Press (CUP)
Date: 07-1997
DOI: 10.1017/S0334270000009188
Abstract: In this paper we propose a systematic theoretical procedure for the constructive approximation of non-linear operators and show how this procedure can be applied to the modelling of dynamical systems. We extend previous work to show that the model is stable to small disturbances in the input signal and we pay special attention to the role of real number parameters in the modelling process. The implications of computability are also discussed. A number of specific ex les are presented for the particular purpose of illustrating the theoretical procedure.
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 2022
Publisher: The American Association of Immunologists
Date: 15-09-2020
Abstract: The generation of reliable mAb of unique and desired specificities serves as a valuable technology to study protein expression and function. However, standard approaches to mAb generation usually involve large-scale protein purification and intensive screening. In this study, we describe an optimized high-throughput proof-of-principle method for the expanded generation, enrichment, and screening of mouse hybridomas secreting mAb specific for a protein of interest. Briefly, we demonstrate that small amounts of a biotinylated protein of interest can be used to generate tetramers for use as prime-boost immunogens, followed by selective enrichment of Ag-specific B cells by magnetic sorting using the same tetramers prior to hybridoma generation. This serves two purposes: 1) to effectively expand both low- and high-affinity B cells specific for the antigenic bait during immunization and 2) to minimize subsequent laborious hybridoma efforts by positive selection of Ag-specific, Ab-secreting cells prior to hybridoma fusion and validation screening. Finally, we employ a rapid and inexpensive screening technology, CELLISA, a high-throughput validation method that uses a chimeric Ag fused to the CD3ζ signaling domain expressed on enzyme-generating reporter cells these reporters can detect specific mAb in hybridoma supernatants via plate-bound Ab-capture arrays, thereby easing screening. Using this strategy, we generated and characterized novel mouse mAb specific for a viral immunoevasin, the mouse CMV m12 protein, and suggest that these mAb may protect mice from CMV infection via passive immunity.
Publisher: Society for Industrial and Applied Mathematics
Date: 19-12-2013
Publisher: Informa UK Limited
Date: 09-2003
Publisher: Informa UK Limited
Date: 10-2007
Publisher: IEEE
Date: 2003
Publisher: IEEE
Date: 06-2007
Publisher: Springer Science and Business Media LLC
Date: 2002
Publisher: Springer Science and Business Media LLC
Date: 02-07-2009
Publisher: Elsevier BV
Date: 08-2003
Publisher: American Institute of Mathematical Sciences (AIMS)
Date: 2007
Publisher: American Institute of Mathematical Sciences (AIMS)
Date: 2007
Publisher: Cambridge University Press (CUP)
Date: 04-1982
DOI: 10.1017/S033427000000031X
Abstract: For finite dimensional linear systems it is known that in certain circumstances the input can be retrieved from a knowledge of the output only. The main aim of this paper is to produce explicit formulae for input retrieval in systems which do not possess direct linkage from input to output . Although two different procedures are suggested the fundamental idea in both cases is to find an expression for the inverse transfer function of the system. In the first case this is achieved using a general method of power series inversion and in the second case by a sequence of elementary operations on a Rosenbrock type system matrix.
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 03-2001
DOI: 10.1109/82.924074
Publisher: Oxford University Press (OUP)
Date: 03-1999
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 05-2001
DOI: 10.1109/78.917807
Publisher: Australian Mathematical Publishing Association, Inc.
Date: 04-02-2021
DOI: 10.21914/ANZIAMJ.V62.15576
Abstract: Let \\(\\boldsymbol{f}\\) be a square-integrable, zero-mean, random vector with observable realizations in a Hilbert space \\(H\\), and let \\(\\boldsymbol{g}\\) be an associated square-integrable, zero-mean, random vector with realizations which are not observable in a Hilbert space \\(K\\). We seek an optimal filter in the form of a closed linear operator \\(X\\) acting on the observable realizations of a proximate vector \\(\\boldsymbol{f}_{\\epsilon} \\approx \\boldsymbol{f}\\) that provides the best estimate \\(\\widehat{\\boldsymbol{g}}_{\\epsilon} = X\\! \\boldsymbol{f}_{\\epsilon}\\) of the vector \\(\\boldsymbol{g}\\). We assume the required covariance operators are known. The results are illustrated with a typical ex le. doi:10.1017/S1446181120000188
Publisher: Elsevier BV
Date: 02-2007
Publisher: Cambridge University Press (CUP)
Date: 21-12-2018
DOI: 10.1017/S1446788718000411
Abstract: We consider a linear operator pencil with complex parameter mapping one Hilbert space onto another. It is known that the resolvent is analytic in an open annular region of the complex plane centred at the origin if and only if the coefficients of the Laurent series satisfy a doubly-infinite set of left and right fundamental equations and are suitably bounded. If the resolvent has an isolated singularity at the origin we propose a recursive orthogonal decomposition of the domain and range spaces that enables us to construct the key nonorthogonal projections that separate the singular and regular components of the resolvent and subsequently allows us to find a formula for the basic solution to the fundamental equations. We show that each Laurent series coefficient in the singular part of the resolvent can be approximated by a weakly convergent sequence of finite-dimensional matrix operators and we show how our analysis can be extended to find a global expression for the resolvent of a linear pencil in the case where the resolvent has only a finite number of isolated singularities.
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 2022
Publisher: Cambridge University Press (CUP)
Date: 04-1990
DOI: 10.1017/S0334270000006780
Abstract: A train travels from one station to the next along a level track. The journey must be completed within a given time and it is desirable to minimise the energy required to drive the train. It has been shown with an appropriate formulation of the problem that an optimal strategy exists and that this strategy must satisfy a Pontryagin type criterion. In this paper the Pontryagin principle will be used to find the nature of the optimal strategy and this information will then be used to determine the precise optimal strategy.
Publisher: Springer Science and Business Media LLC
Date: 2002
Publisher: Elsevier BV
Date: 12-2016
Publisher: Elsevier BV
Date: 05-2014
Publisher: Elsevier BV
Date: 12-2016
Publisher: IEEE
Date: 06-2011
Publisher: Cambridge University Press (CUP)
Date: 07-1994
DOI: 10.1017/S0334270000010225
Abstract: How should a vehicle he driven to minimise fuel consumption? In this paper we consider the case where a train is to be driven along a straight, level track, but where speed limits may apply over parts of the track. The journey is to be completed within a specified time using as little fuel as possible. For a journey without speed limits, the optimal driving strategy typically requires full power, speed holding, coasting and full braking, in that order. The holding speed and braking speed can be determined from the vehicle characteristics and the time available to complete the journey. If the vehicle has discrete control settings, the holding phase should be approximated by alternate coast and power phases between two critical speeds. For a journey with speed limits, a similar strategy applies. For each given journey time there is a unique holding speed. On intervals of track where the speed limit is below the desired holding speed, the speed must be held at the limit. If braking is necessary on an interval, the speed at which braking commences is determined in part by the holding speed for the interval. For vehicles with discrete control, speed-holding is approximated by alternate coast and power phases between two critical speeds, or between a lower critical speed and the speed limit.
Publisher: Elsevier BV
Date: 1992
Publisher: Informa UK Limited
Date: 1998
Publisher: Springer Science and Business Media LLC
Date: 21-08-2009
Publisher: Springer Science and Business Media LLC
Date: 2005
Publisher: Springer Science and Business Media LLC
Date: 28-10-2010
Publisher: Elsevier BV
Date: 2008
Publisher: Modelling and Simulation Society of Australia and New Zealand (MSSANZ), Inc.
Date: 12-12-2011
Publisher: Elsevier BV
Date: 05-2009
Publisher: Elsevier BV
Date: 11-2006
Publisher: Springer New York
Date: 2009
Publisher: Springer US
Date: 2001
Publisher: Cambridge University Press (CUP)
Date: 14-10-2015
DOI: 10.1017/S1446788713000621
Abstract: We find the potential function whose gradient best approximates an observed square integrable function on a bounded open set subject to prescribed weight factors. With an appropriate choice of topology, we show that the gradient operator is a bounded linear operator and that the desired potential function is obtained by solving a second-order, self-adjoint, linear, elliptic partial differential equation. The main result makes a precise analogy with a standard procedure for the best approximate solution of a system of linear algebraic equations. The use of bounded operators means that the definitive equation is expressed in terms of well-defined functions and that the error in a numerical solution can be calculated by direct substitution into this equation. The proposed method is illustrated with a hypothetical ex le.
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 09-2020
Publisher: AIP
Date: 2012
DOI: 10.1063/1.4757496
Publisher: Cambridge University Press (CUP)
Date: 04-2020
DOI: 10.1017/S1446181120000140
Abstract: The population dynamics for the replicator equation has been well studied in continuous time, but there is less work that explicitly considers the evolution in discrete time. The discrete-time dynamics can often be justified indirectly by establishing the relevant evolutionary dynamics for the corresponding continuous-time system, and then appealing to an appropriate approximation property. In this paper we study the discrete-time system directly, and establish basic stability results for the evolution of a population defined by a positive definite system matrix, where the population is disrupted by random perturbations to the genotype distribution either through migration or mutation, in each successive generation.
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 05-2005
Publisher: Springer New York
Date: 2009
Publisher: Elsevier BV
Date: 08-2001
Publisher: Elsevier BV
Date: 05-2018
Publisher: Birkhäuser Boston
Date: 2023
Publisher: American Institute of Mathematical Sciences (AIMS)
Date: 05-2012
Publisher: Elsevier BV
Date: 11-2009
Publisher: Cambridge University Press (CUP)
Date: 03-2014
Abstract: We propose a discrete state-space model for storage of urban stormwater in two connected dams using an optimal pump-to-fill policy to transfer water from the capture dam to the holding dam. We assume stochastic supply to the capture dam and independent stochastic demand from the holding dam. We find new analytic formulae to calculate steady-state probabilities for the contents of each dam and thereby enable operators to better understand system behaviour. We illustrate our methods by considering some particular ex les and discuss extension of our analysis to a series of three connected dams.
Publisher: Elsevier BV
Date: 11-2015
Publisher: Elsevier BV
Date: 06-2020
Publisher: Poincare Publishers
Date: 30-12-2018
Publisher: Society for Industrial & Applied Mathematics (SIAM)
Date: 2001
Publisher: Springer Science and Business Media LLC
Date: 2003
Publisher: Elsevier BV
Date: 11-2011
Publisher: IEEE
Date: 1997
Publisher: Australian Mathematical Publishing Association, Inc.
Date: 27-08-2016
Publisher: SAGE Publications
Date: 09-2013
Abstract: In Australia, and elsewhere, the movement of trains on long-haul rail networks is usually planned in advance. Typically, a train plan is developed to confirm that the required train movements and track maintenance activities can occur. The plan specifies when track segments will be occupied by particular trains and maintenance activities. On the day of operation, a train controller monitors and controls the movement of trains and maintenance crews, and updates the train plan in response to unplanned disruptions. It can be difficult to predict how good a plan will be in practice. The main performance indicator for a train service should be reliability – the proportion of trains running the service that complete at or before the scheduled time. We define the robustness of a planned train service to be the expected reliability. The robustness of in idual train services and for a train plan as a whole can be estimated by simulating the train plan many times with random, but realistic, perturbations to train departure times and segment durations, and then analysing the distributions of arrival times. This process can also be used to set arrival times that will achieve a desired level of robustness for each train service.
Publisher: Oxford University Press (OUP)
Date: 03-1999
Publisher: Cambridge University Press (CUP)
Date: 04-2003
DOI: 10.1017/S1446181100012888
Abstract: Let u be a random signal with realisations in an infinite-dimensional vector space X and υ an associated observable random signal with realisations in a finite-dimensional subspace Y ⊆ X . We seek a pointwise-best estimate of u using a bounded linear filter on the observed data vector υ. When x is a finite-dimensional Euclidean space and the covariance matrix for υ is nonsingular, it is known that the best estimate û of u is given by a standard matrix expression prescribing a linear mean-square filter. For the infinite-dimensional Hilbert space problem we show that the matrix expression must be replaced by an analogous but more general expression using bounded linear operators. The extension procedure depends directly on the theory of the Bochner integral and on the construction of appropriate HilbertSchmidt operators. An extended ex le is given.
Publisher: Cambridge University Press (CUP)
Date: 07-2016
DOI: 10.1017/S1446181116000092
Abstract: In this paper, we show that the cost of an optimal train journey on level track over a fixed distance is a strictly decreasing and strictly convex function of journey time. The precise structure of the cost–time curves for in idual trains is an important consideration in the design of energy-efficient timetables on complex rail networks. The development of optimal timetables for busy metropolitan lines can be considered as a two-stage process. The first stage seeks to find optimal transit times for each in idual journey segment subject to the usual trip-time, dwell-time, headway and connection constraints in such a way that the total energy consumption over all proposed journeys is minimized. The second stage adjusts the arrival and departure times for each journey while preserving the in idual segment times and the overall journey times, in order to best synchronize the collective movement of trains through the network and thereby maximize recovery of energy from regenerative braking. The precise nature of the cost–time curve is a critical component in the first stage of the optimization.
Publisher: IEEE
Date: 06-2007
Publisher: American Institute of Mathematical Sciences (AIMS)
Date: 2007
Publisher: Elsevier BV
Date: 03-2009
Publisher: Cambridge University Press (CUP)
Date: 26-11-2019
DOI: 10.1017/S1446788718000228
Abstract: In modelling joint probability distributions it is often desirable to incorporate standard marginal distributions and match a set of key observed mixed moments. At the same time it may also be prudent to avoid additional unwarranted assumptions. The problem is to find the least ordered distribution that respects the prescribed constraints. In this paper we will construct a suitable joint probability distribution by finding the checkerboard copula of maximum entropy that allows us to incorporate the appropriate marginal distributions and match the nominated set of observed moments.
Publisher: Elsevier BV
Date: 06-2023
Publisher: Elsevier BV
Date: 09-2023
Publisher: Cambridge University Press (CUP)
Date: 08-09-2016
DOI: 10.1017/S1446181116000183
Abstract: We discuss modelling and simulation of volumetric rainfall in a catchment of the Murray–Darling Basin – an important food production region in Australia that was seriously affected by a recent prolonged drought. Consequently, there has been sustained interest in development of improved water management policies. In order to model accumulated volumetric catchment rainfall over a fixed time period, it is necessary to sum weighted rainfall depths at representative sites within each sub-catchment. Since sub-catchment rainfall may be highly correlated, the use of a Gamma distribution to model rainfall at each site means that catchment rainfall is expressed as a sum of correlated Gamma random variables. We compare four different models and conclude that a joint probability distribution for catchment rainfall constructed by using a copula of maximum entropy is the most effective.
Publisher: Cambridge University Press (CUP)
Date: 10-2018
DOI: 10.1017/S1446181118000214
Abstract: When two trains travel along the same track in the same direction, it is a common safety requirement that the trains must be separated by at least two signals. This means that there will always be at least one clear section of track between the two trains. If the safe-separation condition is violated, then the driver of the following train must adopt a revised strategy that will enable the train to stop at the next signal if necessary. One simple way to ensure safe separation is to define a prescribed set of latest allowed section exit times for the leading train and a corresponding prescribed set of earliest allowed section entry times for the following train. We will find strategies that minimize the total tractive energy required for both trains to complete their respective journeys within the overall allowed journey times and subject to the additional prescribed section clearance times. We assume that the drivers use a discrete control mechanism and show that the optimal driving strategy for each train is defined by a sequence of approximate speedholding phases at a uniquely defined optimal driving speed on each section and that the sequence of optimal driving speeds is a decreasing sequence for the leading train and an increasing sequence for the following train. We illustrate our results by finding optimal strategies and associated speed profiles for both trains in some elementary but realistic ex les.
Publisher: Australian Mathematical Publishing Association, Inc.
Date: 13-01-2021
DOI: 10.21914/ANZIAMJ.V62.14843
Abstract: The population dynamics for the replicator equation has been well studied in continuous time, but there is less work that explicitly considers the evolution in discrete time. The discrete-time dynamics can often be justified indirectly by establishing the relevant evolutionary dynamics for the corresponding continuous-time system, and then appealing to an appropriate approximation property. In this paper we study the discrete-time system directly, and establish basic stability results for the evolution of a population defined by a positive definite system matrix, where the population is disrupted by random perturbations to the genotype distribution either through migration or mutation, in each successive generation. doi: 10.1017/S1446181120000140
Publisher: Elsevier BV
Date: 08-2019
Publisher: Elsevier BV
Date: 05-2003
Publisher: MDPI AG
Date: 10-02-2014
DOI: 10.3390/E16020747
Publisher: Hindawi Limited
Date: 2005
DOI: 10.1155/AAA.2005.319
Abstract: We study the minimization problem f ( x ) → min , x ∈ C , where f belongs to a complete metric space ℳ of convex functions and the set C is a countable intersection of a decreasing sequence of closed convex sets C i in a reflexive Banach space. Let ℱ be the set of all f ∈ ℳ for which the solutions of the minimization problem over the set C i converge strongly as i → ∞ to the solution over the set C . In our recent work we show that the set ℱ contains an everywhere dense G δ subset of ℳ . In this paper, we show that the complement ℳ \\ ℱ is not only of the first Baire category but also a σ -porous set.
Publisher: Penerbit UTM Press
Date: 15-06-2013
DOI: 10.11113/JT.V63.1918
Abstract: One of the major difficulties in simulating rainfall is the need to accurately represent rainfall accumulations. An accurate simulation of monthly rainfall should also provide an accurate simulation of yearly rainfall by summing the monthly totals. A major problem in this regard is that rainfall distributions for successive months may not be independent. Thus the rainfall accumulation problem must be represented as the summation of dependent random variables. This study is aimed to show if the statistical parameters for several stations within a particular catchment is known, then a weighted sum is used to determine a rainfall model for the entire local catchment. A spatial analysis for the sum of rainfall volumes from four selected meteorological stations within the same region using the monthly rainfall data is conducted. The sum of n correlated gamma variables is used to model the sum of monthly rainfall totals from four stations when there is significant correlation between the stations.
Publisher: Elsevier BV
Date: 10-2013
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 12-2002
Publisher: IEEE
Date: 10-2014
Publisher: Cambridge University Press (CUP)
Date: 07-1994
DOI: 10.1017/S0334270000010225
Abstract: How should a vehicle he driven to minimise fuel consumption? In this paper we consider the case where a train is to be driven along a straight, level track, but where speed limits may apply over parts of the track. The journey is to be completed within a specified time using as little fuel as possible. For a journey without speed limits, the optimal driving strategy typically requires full power, speed holding, coasting and full braking, in that order. The holding speed and braking speed can be determined from the vehicle characteristics and the time available to complete the journey. If the vehicle has discrete control settings, the holding phase should be approximated by alternate coast and power phases between two critical speeds. For a journey with speed limits, a similar strategy applies. For each given journey time there is a unique holding speed. On intervals of track where the speed limit is below the desired holding speed, the speed must be held at the limit. If braking is necessary on an interval, the speed at which braking commences is determined in part by the holding speed for the interval. For vehicles with discrete control, speed-holding is approximated by alternate coast and power phases between two critical speeds, or between a lower critical speed and the speed limit.
Publisher: Elsevier BV
Date: 05-2023
Publisher: Springer Science and Business Media LLC
Date: 2000
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 05-2001
DOI: 10.1109/81.922461
Publisher: Thomas Telford Ltd.
Date: 12-2064
DOI: 10.1680/WAMA.900053
Abstract: The management of three connected reservoirs for the capture, storage and supply of urban stormwater is modelled using a pump-to-fill policy that minimises the volume of water lost to overflow. A discrete state Markov model is used with constant daily demand from the supply reservoir and stochastic inflow to the capture reservoir. The pump-to-fill policy is completely deterministic and depends only on the current volume in the supply, storage and capture reservoirs. By judicious ordering of the states the very large transition matrix is shown to possess a nested block upper Hessenberg structure. Standard censoring methods reduce the analysis of the system to a characteristic sequence of full-to-full transitions for the supply reservoir. The nested block structure of the original transition matrix is captured using special recursive algebraic procedures that enable a further reduction to a sequence of simultaneous full-to-full transitions for the supply and storage reservoirs. Capabilities of the model are demonstrated through application to a hypothetical three-reservoir network for the capture and supply of water. The methods proposed in this paper could be used to calculate the steady-state probabilities for three-reservoir storage systems and could assist projections for future water supply capabilities. This paper also provides insight into how the analysis could be extended to systems of more than three reservoirs.
Publisher: Springer Science and Business Media LLC
Date: 05-11-2018
DOI: 10.1038/S41467-018-06989-2
Abstract: The interaction between natural killer (NK) cell inhibitory receptors and their cognate ligands constitutes a key mechanism by which healthy tissues are protected from NK cell-mediated lysis. However, self-ligand recognition remains poorly understood within the prototypical NKR-P1 receptor family. Here we report the structure of the inhibitory NKR-P1B receptor bound to its cognate host ligand, Clr-b. NKR-P1B and Clr-b interact via a head-to-head docking mode through an interface that includes a large array of polar interactions. NKR-P1B:Clr-b recognition is extremely sensitive to mutations at the heterodimeric interface, with most mutations severely impacting both Clr-b binding and NKR-P1B receptor function to implicate a low affinity interaction. Within the structure, two NKR-P1B:Clr-b complexes are cross-linked by a non-classic NKR-P1B homodimer, and the disruption of homodimer formation abrogates Clr-b recognition. These data provide an insight into a fundamental missing-self recognition system and suggest an avidity-based mechanism underpins NKR-P1B receptor function.
Publisher: American Mathematical Society (AMS)
Date: 28-08-2004
DOI: 10.1090/S0002-9939-03-07164-8
Abstract: A nonlinear dynamical system is modelled as a nonlinear mapping from a set of input signals into a corresponding set of output signals. Each signal is specified by a set of real number parameters, but such sets may be uncountably infinite. For numerical simulation of the system each signal must be represented by a finite parameter set and the mapping must be defined by a finite arithmetical process. Nevertheless the numerical simulation should be a good approximation to the mathematical model. We discuss the representation of realistic dynamical systems and establish a stable approximation theorem for numerical simulation of such systems.
Publisher: Cambridge University Press (CUP)
Date: 08-1974
DOI: 10.1017/S1446788700019182
Abstract: Let R be the set of real numbers, and let S 1 denote the class of all real valued functions f on R which are smooth to the first order (i.e. the derivative ƒ( 1 ) exists and is continuous) and have compact support. The first order variation off on an open set U is given by and in the case where U = R we have the total first order variation of f , usually denoted by I 1 ( f ).
Publisher: Elsevier BV
Date: 06-2015
No related grants have been discovered for Phil Howlett.