Search

A classical result of K. L. Chung and W. Feller deals with the partial sums S k S_k arising in a fair coin-tossing game. If N n N_n is the number of “positive” terms among S 1 S_1 , S 2 S_2 , …, S n S_n then the quantity P ( N 2 n = 2 r ) P(N_{2n} = 2r) takes an elegant form. We lift the restriction on an even number of tosses and give a simple expression for P ( N 2 n + 1 = r ) P(N_{2n+1} = r) , r = 0 r = 0 , 1 1 , 2 2 , …, 2 n + 1 2n+1 . We get to this ansatz by adaptating the Feynman–Kac methodology.

In a recently published theorem on the split common fixed point problem for strict pseudocontractive and asymptotically nonexpansive mappings, Tang et al. (J. Inequal. Appl. 2015:305, 2015) studied a uniformly convex and 2-uniformly smooth real Banach space with the Opial property and best smoothness constant κ satisfying the condition $0 0 < κ < 1 2 , as a real Banach space more general than Hilbert spaces. A well-known example of a uniformly convex and 2-uniformly smooth real Banach space with the Opial property is $E=l_{p}$ E = l p , $2\leq p 2 ≤ p < ∞ . It is shown in this paper that, if κ is the best smoothness constant of E and satisfies the condition $0 0 < κ ≤ 1 2 , then E is necessarily $l_{2}$ l 2 , a real Hilbert space. Furthermore, some important remarks concerning the proof of this theorem are presented.

There are similarities between Drinfeld modules and abelian varieties. The purpose of this paper is to investigate these similarities in terms of supersingularity. More specifically, we provide explicit formulas of Hasse invariants (or, equivalently, of supersingular polynomials) for Drinfeld modules, which is a continuation of the 2013 paper by Ahmad El-Guindy and Matthew A. Papanikolas. We present several supersingular Drinfeld modules as an application.

This paper is concerned with some stochastic properties of a novel rock–paper–scissors model. Firstly, the global existence of an unique positive solution of the stochastic model is obtained. Then we demonstrate the positive solution of the model is stochastically bounded. Besides, some sufficient conditions for population to be stochastically permanent and extinct are derived with the use of some appropriate Lyapunov functions. At last, some numerical simulations are carried out to illustrate our theoretical analysis results.

This paper studies the second-order coding rates for memoryless channels with a state sequence known non-causally at the encoder. In the case of finite alphabets, an achievability result is obtained using constant-composition random coding, and by using a small fraction of the block to transmit the empirical distribution of the state sequence. For error probabilities less than 0.5, it is shown that the second-order rate improves on an existing one based on independent and identically distributed random coding. In the Gaussian case (dirty paper coding) with an almost-sure power constraint, an achievability result is obtained using random coding over the surface of a sphere, and using a small fraction of the block to transmit a quantized description of the state power. It is shown that the second-order asymptotics are identical to the single-user Gaussian channel of the same input power without a state.

Let l be a Banach sequence space with a monotone norm in which the canonical system (e_{n}) is an unconditional basis. We show that if there exists a continuous linear unbounded operator between l-K\"{o}the spaces, then there exists a continuous unbounded quasi-diagonal operator between them. Using this result, we study in terms of corresponding K\"{o}the matrices when every continuous linear operator between l-K\"{o}the spaces is bounded. As an application, we observe that the existence of an unbounded operator between l-K\"{o}the spaces, under a splitting condition, causes the existence of a common basic subspace.

In this note we offer some criticism on the paper “On an identity for zeros of Bessel functions” by Baricz et al. [3] . The paper gives identities of type Stieltjes–Calogero for the sums of reciprocals of differences of fourth powers of zeros of Bessel functions. Although interesting in principle, by containing one too many sums of similar complexity the identities fail to convey the true spirit of the work of Stieltjes and Calogero. We rectify this by providing what we think is the correct type of identity for the above-said sums, in the general setup of entire functions of order

The analysis of dielectric response function obtained from the power transformer is a well-accepted technique in insulation diagnosis. A convenient way of analysing time-domain dielectric response φ(t) is the formulation of simple resistance−capacitance-based circuits like the conventional Debye model (CDM) or the modified Debye model (MDM) that are capable of modelling φ(t). However, available techniques do not guarantee unique branch parameters of such circuits for a given φ(t). In fact, the branch parameters are known to depend on the curve-fitting procedure opted during model formulation. This makes accuracy of CDM and MDM parameter-based diagnosis techniques less reliable. Furthermore, it seems logical to analyse the time-domain dielectric response of oil-paper insulation using a model containing time-varying parameters. In this study, a methodology is proposed using which such an insulation model (containing time-varying parameters) is formulated using time-domain insulation response. Related analysis presented suggests that the proposed model is immune to problems associated with available insulation models (containing time-invariant parameters). The performance of the proposed model in indicating insulation condition is tested on data obtained from several real-life power transformers.

Turning a linear sugar into its cyclized form is an essential skill in biochemistry. A simple paper model is described that can be used by any student to transform a carbohydrate in its Fischer projection and correctly cyclize it into its Haworth form. The model can also be used to illustrate several key aspects of the Fischer projection of which many students are typically unaware.

In a recent paper referred to in the title, the author used the concept of quasi self-adjointness to obtain conservation laws for a system of the ( 2 + 1 ) -dimensional Bogoyavlensky–Konopelchenko equation. Apart from the adjoint system of equations, all the results on the quasi self-adjointness and the subsequent conservation laws obtained are inaccurate. In this comment, we clarify these inaccuracies and also generate conservation laws for a potential form of the underlying equation through Noether theorem.

In 1903, Epstein published his proof of meromorphic continuation and a functional equation for Dirichlet series associated with quadratic forms, now called Epstein zeta-functions. However, already in 1889 (or even earlier) Hurwitz was aware of these results as his mathematical diaries and some unpublished notes (in an almost final form) found in his estate at the ETH Zurich show. In this article we present and analyze Hurwitz's notes and compare his reasoning with Epstein's paper in detail.

O. Einstein (2008) proved Bollob\'as-type theorems on intersecting families of ordered sets of finite sets and subspaces. Unfortunately, we report that the proof of a theorem on ordered sets of subspaces had a mistake. We prove two weaker variants., Comment: 6 pages. Improved bound for Theorem 4

Two limit cycles for the continuous model of the rockscissorspaper (RSP) game is constructed.The Hopf bifurcation method is used for the construction of limit cycles.The results give a partial answer to an open question posed by Neumann and Schuster. In this paper we construct two limit cycles with a heteroclinic polycycle for the three-dimensional continuous model of the rockscissorspaper (RSP) game between bacteriocin producing bacteria. Our construction gives a partial answer to an open question posed by Neumann and Schuster (2007) concerning how many limit cycles can coexist for the RSP game.

This paper presents a new method to calculate the feedback control gain for a class of multivariable bilinear system, and also applied this method on the control of two sections of paper-making process with disturbance. The robust H∞ control problem is to design a state feedback controller such that the robust stability and a prescribed H∞ performance of the resulting closed-loop system are ensured. The controller turns out to be robust with respect to the disturbance in the plant. Utilizing the Schur complement and some variable transformations, the stability conditions of the multivariable bilinear systems are formulated in terms of Lyapunov function via the form of linear matrix inequality (LMI). The gain of controller will be calculated via LMI. Finally, the application examples of a headbox section and a dryer section of paper-making process are used to illustrate the applicability of the proposed method.

We complete a gap in the proof that exceptional polynomials are complete orthogonal systems in the associated Hilbert spaces.

Translation of the seminal 1877 paper by Ludwig Boltzmann which for the first time established the probabilistic basis of entropy. Includes a scientific commentary.

The authors of [1] have become aware that several equations in [1] were presented with errors. As confirmed in this brief note, neither do the errors invalidate the game theoretic approach proposed in [1] , nor violate the equilibrium of the approach. However, the parameter selection, which is required to preserve the validity and unique equilibrium of the approach, is affected by the errors. We correct the equations with detailed mathematical derivations in the note.

In this paper, we introduce some notions of invariancy for the Ricci tensor on real hypersurfaces in complex two-plane Grassmannians G 2 ( C m + 2 ) , namely, F -invariant and invariant Ricci tensor. Using these notions, we give non-existence theorem and characterization for the special case among the real hypersurfaces of Type ( A ) in G 2 ( C m + 2 ) , respectively. Here the distribution F is defined by F = [ ξ ] ∪ D ⊥ where D ⊥ = Span { ξ 1 , ξ 2 , ξ 3 } and [ ξ ] = Span { ξ } .

In this paper author was proved the boundedness of the multidimensional Hardy type operator in weighted Lebesgue spaces with a variable exponent. As an application we prove the boundedness of certain sublinear operators on the weighted variable Lebesgue space. Note that the proof of multidimensional Hardy type operator in weighted Lebesgue spaces with a variable exponent don't contained any mistakes. But at the proving of the boundedness of certain sublinear operators on the weighted variable Lebesgue space Georgian colleagues discovered a small but significant error in this paper. This result is assigned as Theorem 5 in noted paper. In other words, sufficient conditions for general weights ensuring the validity of the two-weight strong type inequalities for some sublinear operator was found. In this theorem the inequality (9) isn't true. In this note we give the details of the correct argument. We presume that the reader is familiar with the contents and notation of our original paper. At the heart of our correction is the following Theorem which replaces Theorem 5.

A. Yu. Ishlinsky’s scientific publications impress one by the extremely wide scope of his scientific interests. Most of his results lie in two fundamental fields of research, mechanics of deformable bodies and mechanics of gyroscope and navigation systems; chronologically, they appeared mainly in this order. One of his first important results that became widely known was the construction of an exact theory of the Brinell test (1942). This theory dealt with determining the stress state under a rigid punch of spherical or plane shape penetrating into a perfectly plastic medium. The problem was solved in the rigorous statement in the framework of the Haar–von Karman complete plasticity hypothesis containing two relations between the principal stresses rather than one relation as in the Saint-Venant theory. The subsequent development of this problem led (1954) to construction of a general theory of plasticity which, in particular, allowed one to overcome the difficulties related to the derivation of the 3D strain equations beyond the elasticity range. A series of Ishlinsky’s papers (1940–1946) deals with imperfect elasticity, fracture theory, and plasticity theory. In this series, he constructed a description of aftereffect and relaxation generalizing the Maxwell and Thomson concepts on the basis of a linear differential relation between the stress and the strain. Plastic fracture models were also studied in these works. In particular, one of the fracture models was constructed for the example of a body whose one-dimensional strain obeys the law dσ/dt+ rσ= bde/dt+ bne, where σ is the stress and e is the strain. This model also admits a simple and illustrative interpretation as a damper with springs, which permits readily understanding the introduced fracture hypotheses and analyzing specific examples for various loading laws. Ishlinsky returned to plasticity and fracture theories in 1965–1968. The problem on the impact of a viscoplastic rod on a rigid obstacle is of interest. In the model accepted by Ishlinsky, the motion of the rod cross-sections is governed by heat equations with complex boundary conditions. It turned out unexpectedly that on impact the viscoplastic state does not instantly extend to the entire rod; instead, it runs away from the impact point and then returns without reaching the free end, thus leaving a rigid segment of the rod. In fracture theory of this time period, one should mention Ishlinsky’s paper of 1968, where two crack development models are compared. One model is the Griffith–Irvin model, and the other, which was developed later, is due to S. A. Khristianovich and G. I. Barenblatt. Ishlinsky showed that the latter model tends to the former as the range of the adhesion forces postulated in the latter tends to zero. Ishlinsky’s papers on the stability of elastic systems are of extreme importance. In a joint 1949 paper with M. A. Lavrent’ev, he theoretically explained the spectacular experiment in which a tube subjected to an underwater explosion loses its shape in such a way that the number of corrugations is the greater the closer they are to the explosion site. It turned out that the relationship between the characteristic exponents, the equilibrium mode number, and the applied external load constructed when studying the equilibrium modes permits one to maximize the buckling rate with respect to the mode number. The greater the applied force, the higher the mode number maximizing the characteristic exponent is. This result has numerous practical applications. The buckling problem for elastic systems, which goes back to Euler, is usually solved by methods of the theory of strength of materials for simplified models of rod or plate type. Ishlinsky studied this

We give a simple proof and a multivariable generalization of an identity due to E. Alkan concerning a weighted average of the Ramanujan sums. We deduce identities for other weighted averages of the Ramanujan sums with weights concerning logarithms, values of arithmetic functions for gcd's, the Gamma function, the Bernoulli polynomials, and binomial coefficients., Comment: 8 pages

We indicate how recent results of Grafakos and Teschl (J Fourier Anal Appl 19:167–179, 2013), and Estrada (J Fourier Anal Appl 20:301–320, 2014), relating the Fourier transform of a radial function in $$\mathbb R^n$$ and the Fourier transform of the same function in $$\mathbb R^{n+2}$$ and $$\mathbb R^{n+1}$$ , respectively, are located within known results on transplantation for Hankel transforms.

This paper examines zero-sum games that are based on a cyclic preference relation defined over undistinguished actions. For each of these games, the set of Nash equilibria is characterized. When the number of actions is odd, a unique Nash equilibrium is always obtained. On the other hand, in the case of an even number of actions, every such game exhibits an infinite number of Nash equilibria. Our results give some insights as to the robustness of Nash equilibria with respect to perturbations of the action set.

In this paper, we examine and correct various results relating to estimation of a Pareto distribution in the presence of outliers according to a model introduced by Dixit and Jabbari Nooghabi (2011) [1] and further studied by Dixit and Jabbari Nooghabi (2011) [2] . In particular, Dixit and Jabbari Nooghabi (2011) [2] state that the maximum likelihood estimators for the parameters appearing in their model do not exist. We show that these estimators can in fact exist, and we present and illustrate a method for determining them when they do. Two numerical illustrations using actual insurance data are included.

When playing games in groups, it is an advantage for individuals to have accurate statistical information on the strategies of their opponents. Such information may be obtained by remembering previous interactions. We consider a rock-paper-scissors game in which agents are able to recall their last m interactions, used to estimate the behavior of their opponents. At critical memory length, a Hopf bifurcation leads to the formation of stable limit cycles. In a mixed population, agents with longer memories have an advantage, provided the system has a stable fixed point, and there is some asymmetry in the payoffs of the pure strategies. However, at a critical concentration of long memory agents, the appearance of limit cycles destroys their advantage. By introducing population dynamics that favors successful agents, we show that the system evolves toward the bifurcation point.

We investigate a population of individuals who play the Rock–Paper–Scissors (RPS) game. The players choose strategies not only by optimizing their payoffs, but also taking into account the popularity of the strategies. For the standard RPS game, we find an asymptotically stable polymorphism with coexistence of all strategies. For the general RPS game we find the limit cycles. Their stability depends exclusively on two model parameters: the sum of the entries of the RPS payoff matrix, and a sensitivity parameter which characterizes the personality of the players. Apart from the supercritical Hopf bifurcation, we found the subcritical bifurcation numerically for some intervals of the parameters of the model.

A bound on the capacity of the causal dirty-paper channel with arbitrary interference and general independent identically distributed additive noise is derived. In particular, it is shown that for the case of Gaussian noise, the capacity is upper bounded by log2(1+SNR/e) bits per real dimension. This bound is useful for SNR ≤ e(e-2) .

The purpose of this comment is to correct mistaken assumptions and claims made in the paper “Stochastic feedback, nonlinear families of Markov processes, and nonlinear Fokker–Planck equations” by T. D. Frank [T.D. Frank, Stochastic feedback, non-linear families of Markov processes, and nonlinear Fokker–Planck equations, Physica A 331 (2004) 391]. Our comment centers on the claims of a “non-linear Markov process” and a “non-linear Fokker–Planck equation.” First, memory in transition densities is misidentified as a Markov process. Second, the paper assumes that one can derive a Fokker–Planck equation from a Chapman–Kolmogorov equation, but no proof was offered that a Chapman–Kolmogorov equation exists for the memory-dependent processes considered. A “non-linear Markov process” is claimed on the basis of a non-linear diffusion pde for a 1-point probability density. We show that, regardless of which initial value problem one may solve for the 1-point density, the resulting stochastic process, defined necessarily by the conditional probabilities (the transition probabilities), is either an ordinary linearly generated Markovian one, or else is a linearly generated non-Markovian process with memory. We provide explicit examples of diffusion coefficients that reflect both the Markovian and the memory-dependent cases. So there is neither a “non-linear Markov process”, nor a “non-linear Fokker–Planck equation” for a conditional probability density. The confusion rampant in the literature arises in part from labeling a non-linear diffusion equation for a 1-point probability density as “non-linear Fokker–Planck,” whereas neither a 1-point density nor an equation of motion for a 1-point density can define a stochastic process. In a closely related context, we point out that Borland misidentified a translation invariant 1-point probability density derived from a non-linear diffusion equation as a conditional probability density. Finally, in the Appendix A we present the theory of Fokker–Planck pdes and Chapman–Kolmogorov equations for stochastic processes with finite memory.

Two players of Rock-Paper-Scissors are modeled as adaptive agents which use a reinforcement learning algorithm and exhibit chaotic behavior in terms of trajectories of probability in mixed strategies space. This paper demonstrates that an external super-agent can exploit the behavior of the other players to predict favorable moments to play against one of the other players the symbol suggested by a sub-optimal strategy. This third agent does not affect the learning process of the other two players, whose only goal is to beat each other. The choice of the best moment to play is based on a threshold associated with the Local Lyapunov Exponent or the Entropy, each computed by using the time series of symbols played by one of the other players. A method for automatically adapting such a threshold is presented and evaluated. The results show that these techniques can be used effectively by a super-agent in a game involving adaptive agents that exhibit collective chaotic behavior.

An error has been detected (and also corrected) in Theorem 2.8 of the paper entitled “Adjoining an Order Unit to a Matrix Ordered Space” (Positivity, (2005)9: 207–223; DOI 10.1007/s11117-003-2778-5). Accordingly, some of the results of the paper have been modified. Also, a notion of C*-matricially, Riesz normed spaces has been introduced.

In this paper, a finite element procedure is used to study the dynamic behaviour of a paper web in a free span between two rollers, including effects of transport velocity and surrounding air. The paper web is modelled as a three-dimensional orthotropic structure. The influence of air is accounted for by utilizing fluid-solid interaction analyses based on acoustic theory. The contribution of transport velocity is included through gyroscopic matrices and forces. The structural response on harmonic excitations has been studied using linear and non-linear models. Results show that air significantly reduces eigenfrequencies of the web. So called ''edge-flutter'' is nothing but the result of skew tension profile. Excessive web vibration can be eliminated by adjusting the web tension.

This article reviews Albert Einstein's first published paper, submitted for publication in 1900. At that time, Einstein was 21 and a recent college graduate. His paper uses modeling and least squares to analyze data in support of a scientific proposition. Einstein is shown to be well trained, for his day, in using statistics as a tool in his scientific research. This paper also shows his ability to make trivial arithmetic mistakes and some clumsiness in data recording. A major aim of this article is to help provide a better appreciation of Einstein as an active user of statistical arguments in this and other of his important publications.

In this short note an addition to the paper [A.G. Bratsos, M. Ehrhardt, I.Th. Famelis, A discrete Adomian decomposition method for discrete nonlinear Schrodinger equations, Appl. Math. Comput. 197(1) (2008) 190-205] using the modulus of the terms evaluated from the Adomian decomposition method on p. 194 and their relation to the convergence of the resulting series is presented. Conclusions for the accuracy of the approximated solution are derived.

Costa's celebrated ldquowriting on dirty paperrdquo (WDP) shows that the power-constrained channel Y=X+S+Z, with Gaussian Z, has the same capacity as the standard AWGN channel Y=X+Z, provided that the ldquointerferencerdquo S (no matter how strong it is) is known at the transmitter. While this ability for perfect interference cancelation is very appealing, it relies heavily on the Gaussianity of the (unknown) noise Z. We construct an example of ldquobadrdquo noise for writing on dirty paper, namely, ldquodifference set noiserdquo. If the interference S is strong, then difference-set noise limits the WDP capacity to at most 2 bits. At the same time, like in the AWGN case, the zero-interference capacity grows without bound with the input constraint. Thus almost 100% of the available capacity is lost in WDP in the presence of difference-set noise. This high capacity loss is due to the ldquoentropy amplification propertyrdquo (EAP) of noise with an aperiodic probability distribution. Using the EAP and the duality between WDP and Wyner-Ziv source coding, we also give an example of dramatic rate-loss in quantizing encrypted source.

Nofal and El Gebaly (2017), presented certain characterizations of the Pareto distribution based on the conditional expectations of power of the order statistics. In this short note we show that the same results can easily be obtained in terms of the power of the random variable.

We will revisit the main theorem in [1] in which given a Turing machine program P and an input X, a formula Ω(X,P ) is constructed, about which it is asserted, among other things, that it is true iff the machine P accepts an input X in less than 2|X| steps. We claim that this is not true. Counterexample. As X we take a word 11 having length 2. The input inscribed on the tape before the computation starts consists of symbols 01100. . . (followed by zeros). We construct a Turing machine P accepting all nonempty words and rejecting the empty word: instruction M(0) : q10 → q3R, instruction M(1) : q30 → q2L, instruction M(2) : q31 → q0L, instruction M(3) : q00 → q00, instruction M(4) : q20 → q20. We show how P operates on input X. Before the first step, the head scans a cell with symbol 0 and sees 0. Step 1. Perform the instruction M(0) : q10 → q3R, after which the head scans cell 1 and sees 1. Step 2. Perform the instruction M(2) : q31 → q0L, after which the head scans cell 0 and sees 0. Step 3. Perform the instruction M(3) : q00 → q00, after which the head scans cell 0 and sees 0. Thus the Turing machine constructed accepts input X in less than 2|X| = 4 steps. Now consider a formula Ω(X,P ) constructed given a program P and an input X. Our goal is to check the value of a formula χ(0)&R(P ) → χ(ω) for the following values of variables

A l-Bayesian erasure test (BET) based on order statistics with diversity reception for noncoherent M-ary frequency shift keying (FSK) signaling is examined. In the l-BET, the M-ary FSK symbol is erased whenever the a posteriori probability of correct decision, which is a function of the l-largest sums of energy detector outputs, is less than a threshold. For binary FSK signaling in Rayleigh flat fading channels, the 2-BET is found to be the same as the difference threshold test (DTT), which declares an erasure whenever the difference between the largest and the second largest sums of energy detector outputs is less than a threshold. The output threshold test (OTT), which declares an erasure whenever the largest sum of energy detector outputs is less than a threshold, is proved equivalent to the 1-BET for the Rayleigh flat fading channel. Closed-form expressions for the probabilities of correct decision and symbol error for the DTT, Viterbi's ratio threshold test (RTT), and the OTT are derived when square-law combining (SLC) diversity is used. Several erasure tests including the Z-BET, the RTT, the OTT, and the DTT are compared in terms of probability of codeword error. The 2-BET provides almost the same performance as the BET that requires all the sums of energy detector outputs. The 2-BET provides power gains of 0.9 dB and 0.7 dB over the RTT for (7, 3) and (15, 7) Reed-Solomon (RS) codes, respectively, when the probability of codeword error is 10-3 and the diversity order is one.

This paper considers certain neutral differential equation with the distributed delayddt[x(t)+c(t)x([email protected])]+p(t)x(t)+q(t)x([email protected])+r(t)@!"t"-"@d^tx(s)ds=0.Without imposing a nonnegative restriction on coefficients of the equation, we establish a delay-dependent asymptotic stability condition for the equation by introducing a new Lyapunov function. The condition presented here is different from that of Park [J.H. Park, LMI optimization approach to asymptotic stability of certain neutral delay differential equation with time-varying coefficients, Appl. Math. Comput. 160 (2005) 355-361] in the sense that it is dependent on all delays of the equation. Numerical examples illustrate effectiveness and sharpness of our theoretical result.

We generalize a result of F. Luca and A. Sankaranarayanan by proving that the set of n for which ϕ(1) + + ϕ(n) is squareful is of zero density. A similar statement holds for σ (n) instead of ϕ(n) and for some other multiplicative functions.

A counterexample is provided in this short note to show that some of local convergence theorems established in [D.K.R. Babajee, M.Z. Dauhoo, An analysis of the properties of the variants of Newton’s method with third order convergence, Appl. Math. Comput. 183 (2006) 659–684] are not always true. Some mistakes in the proofs of these theorems are pointed out.

De Broglie's contribution in the Philosophical Magazine from 1924 is fascinating from many standpoints: for its moderate use of mathematics, the close connection to Einstein's special theory of relativity, and of course for the proposal of matter waves. We revisit this mostly speculative publication, which contributed crucially to the birth of quantum mechanics.

Product quality in the paper-making industry can be assessed by opacity of a linear trace through continuous production sheets, summarized in spectral form. We adopt a class of non-Gaussian stochastic models for continuous spatial variation to describe data of this type. The model has flexible covariance structure, physically interpretable parameters and allows several scales of variation for the underlying process. We derive the spectral properties of the model, and develop methods of parameter estimation based on maximum likelihood in the frequency domain. The methods are illustrated using sample data from a UK mill.

We considered in Example 3.1 of the paper [1] an S-structure on R2n+s . We concluded that when s > 1 this manifold cannot be of constant φ-sectional curvature. Unfortunately this result is wrong. In fact, essentially due to a sign mistake in defining the φ-structure and a consequent transposition of the elements of the φ-basis (3.2), some of the Christoffel’s symbols were incorrect. In the present rectification, using a more slendler tecnique, we prove that our manifold is of constant φ-sectional curvature −3s and then it is η-Einstein.

The authors would like to correct the proof of Theorem 3(a) in the original paper “On the asymptotic behaviour of the 2D Navier-Stokes equations with Navier friction conditions towards Euler equations.” [ZAMM 89(10), 810-822, 2009].

This paper presents a sufficient condition for a one-dimensional Dirac operator with a potential tending to infinity at infinity to have no eigenvalues. It also provides a quick proof (and suggests variations) of a related criterion given by Evans and Harris.

for their paper “Preconditioning Indefinite Systems in Interior Point Methods for Optimization”, published in Volume 28, pages 149–171. This paper describes a class of indefinite preconditioners for reduced KKT systems arising in quadratic and nonlinear optimization with interior point methods. Spectral analysis of preconditioners is given and the improvements resulting from the use of primal-dual regularization are demonstrated. Computational results are reported for the application of the preconditioner to a variety of medium-size convex quadratic programming problems. Work on the paper began during the Summer of 2001, about a year after the authors had first met when Zilli invited Gondzio to give a series of lectures on interior point methods in Padova in September, 2000. The authors had complementary research backgrounds: Bergamaschi and Zilli worked on the theory and implementation of iterative methods for linear and nonlinear systems of equations [2], while Gondzio worked on the design and implementation of interior point methods for large-scale optimization [3]. This was essential since together, the three authors could tackle in depth a problem which required expertice in several areas. At that time Bergamaschi and Zilli were impressed with the recent development of Lukysan and Vlycek [6], who applied conjugate gradients to indefinite systems, and with the later analysis of Keller, Gould and Wathen [4] of indefinite constraint preconditioners. They convinced Gondzio to look into the issue. In the meantime, Rozlozn´ok and Simoncini [7] came up with an improved understanding of issues connected with indefinite preconditioning (in the context of saddle point problems arising in partial differential equation); these developments led the authors to take a closer look at the problem. Starting in July, 2001, the authors began to incorporate into Gondzio’s interior point code HOPDM (higher order primal dual methods) four iterative techniques: conjugate gradients, BiCGstab, GMRES and QMR. A description of these schemes can be found in Kelley’s book [5] and the references therein. The authors realized that the key difficulty in the solution of augmented systems of Newton equations in interior point methods for quadratic and nonlinear programming (otherwise known as reduced KKT systems) consisted in the loss of sparsity caused by the presence of the Hessian matrix Q in the system � (Q + � 1

We would like to start by congratulating Byrne and Girolami for writing such a thoughtful and extremely interesting paper. This is in fact a worthy addition to other high impact papers recently published by Professor Girolami’s lab in this field. The common theme of these papers is to use geometrically motivated methods to improve efficiency of sampling algorithms. In their seminal paper, Girolami & Calderhead (2011) proposed a novel Hamiltonian Monte Carlo (HMC) method, called Riemannian manifold HMC, that exploits the Riemannian geometry of the target distribution to improve standard HMC’s efficiency by automatically adapting to the local structure. Although this is a natural and beautiful idea, there are significant computational difficulties, which arise in effectively implementing this algorithm. In contrast, in this current contribution, Byrne and Girolami focused on special probability distributions, which give rise to particularly nice Riemannian geometries. In particular, the examples under consideration described in Section 4 allow for closed-form solutions to the geodesic equation, which can be used to reduce computational cost of geometrically motivated Monte Carlo methods. Although the proposed splitting algorithm is quiet interesting, we initially doubted its impact because Riemannian metrics with closed-form geodesics are extremely rare. However, we are now convinced that this approach will likely see application beyond what is outlined herein. For example, we believe that this approach can be used to improve computational efficiency of sampling algorithms when the parameter space is constrained. The standard HMC algorithm needs to evaluate each proposal to ensure that it is within the boundaries imposed by the constraints. Alternatively, as discussed by Neal (2011), one could modify standard HMC so the sampler bounces back after hitting the boundaries. In Appendix A, Byrne and Girolami discussed this approach for geodesic updates on the simplex. In many cases, a constrained parameter space can be bijectively mapped to a unit ball

In a paper by Lee and Hedrick (1995), some conditions for the global asymptotic stability of linear systems under saturating controls were presented as new. We show that most of the results of this paper are already well-known and published. Therefore they cannot be considered as new.