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.

Necessary optimality conditions for a bilevel optimization problem are given in the paper by Kohli (J Optim Theory Appl 152: 632–651, 2012). Recently, the same author corrected his results in the note (J Optim Theory Appl 181:706–707, 2019). In this work, we have pointed out that some of the new modifications are wrong. We correct the flaws and present an alternative proof for the main result.

In a paper industry, especially in thick stock wet end process, the two most important variables are retention in forming section of a paper machine and basis weight of the thick stock. Present paper attempts to understand the governing mass balance equations which may be required to deduce an appropriate process model.

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.

This discussion reviews the paper by Zhengjun Zhang in the context of broader research on multivariate extreme value theory and max-stable processes.

This is a corrigendum to our paper, “On a class of prime entire functions”, published in Acta Math. Sin., Engl. Ser., 25, 1647–1652 (2009).

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.

We introduce a graph Ramsey game called Ramsey, Paper, Scissors. This game has two players, Proposer and Decider. Starting from an empty graph on $n$ vertices, on each turn Proposer proposes a potential edge and Decider simultaneously decides (without knowing Proposer's choice) whether to add it to the graph. Proposer cannot propose an edge which would create a triangle in the graph. The game ends when Proposer has no legal moves remaining, and Proposer wins if the final graph has independence number at least $s$. We prove a threshold phenomenon exists for this game by exhibiting randomized strategies for both players that are optimal up to constants. Namely, there exist constants $0B\sqrt{n}\log{n}$. This is a factor of $\Theta(\sqrt{\log{n}})$ larger than the lower bound coming from the off-diagonal Ramsey number $r(3,s)$.

In this work, we improve and correct some results in the paper by Proinov (J Fixed Point Theory Appl 22:1–27, 2020).

We correct some mistakes in the paper “A mass formula for negacyclic codes of length 2k and some good negacyclic codes over $\mathbb {Z}_{4}+u\mathbb {Z}_{4}$ ” (Bandi et al. Cryptogr. Commun. 9, 241–272, 2017).

Giving the proper citations, it is shown that, except of Lemma 2.4 and Theorem 2.6, almost all the results of the paper in the title have been previously published for ordered hypersemigroups in Eur. J. Pure Appl. Math. and they are not new. There are also two results obtained from ordered semigroups just putting a ``$\circ$" instead of ``$\cdot$" (that isn't a correct way to work), without reference to ordered semigroups on which the results on ordered hypersemigroups are based. One of them can be obtained as corollary to a theorem in Eur. J. Pure Appl. Math. as well, and it is not new.

Many complex physical systems exhibit a rich variety of discrete behavioural modes. Often, the system complexity limits the applicability of standard modelling tools. Hence, understanding the underlying physics of different behaviours and distinguishing between them is challenging. Although traditional machine learning techniques could predict and classify behaviour well, typically they do not provide any meaningful insight into the underlying physics of the system. In this paper we present a novel method for extracting physically meaningful clusters of discrete behaviour from limited experimental observations. This method obtains a set of physically plausible functions that both facilitate behavioural clustering and aid in system understanding. We demonstrate the approach on the V-shaped falling paper system, a new falling paper type system that exhibits four distinct behavioural modes depending on a few morphological parameters. Using just 49 experimental observations, the method discovered a set of candidate functions that distinguish behaviours with an error of 2.04%, while also aiding insight into the physical phenomena driving each behaviour. © 2019 Howison et al. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.

This work is a contribution to the Project UIDB/04035/2020, funded by FCT - Fundacao para a Ciencia e a Tecnologia, Portugal.

The objective of this study was to characterize the properties of pulp and paper manufactured from two agricultural residues namely, wheat straw (Triticum aestivum L. em Thell.) and date palm midribs (Phoenix dactylifera L.) widely available in Saudi Arabia by employing soda-anthraquinone (AQ) pulping process. Specimens from cedar wood (Juniperus procera Hochst. ex Endl.) wood was also used as control samples. Chemical and the morphological characteristics of all three types of raw materials in addition to basic properties of hand sheets made from such resources were evaluated. The results indicated that wheat straw had the highest hemicellulose and ash values of 35% and 7% and the lowest lignin content value of 18%, respectively. The fibre length of the both palm fronds and wheat straw was lower than that of 2.2 mm which was found for J. procera. Overall strength properties of the handsheet made from two agricultural raw materials were significantly lower than those made from J. procera pulp. Wheat straw handsheets also had higher strength properties than those made from date palm midribs with an exception of their tear index. Based on the results of this study it appears that both types of raw materials, date palm midribs and wheat straw could have a potential to manufacture pulp and paper with accepted properties so that such underutilized species can be converted into value-added products.

In the above article, a second-order convergence in the maximum norm of the two-dimensional regularized long-wave equation is proved. However, due to a wrong inequality in Lemma 3.3 used in X. Wang et al.[1], there are some fundamental errors in this paper, in particular the proof of Theorem 3.3 and the convergence Theorem are no longer correct. The present brief paper contains clarifying comments.

Connectivity is the safety network for biodiversity conservation because connected habitats are more effective for saving the species and ecological functions. The nature of coupling for connectivity also plays an important role in the co-existence of species in cyclic-dominance. The rock-paper-scissors game is one of the paradigmatic mathematical model in evolutionary game theory to understand the mechanism of biodiversity in cyclic-dominance. In this paper, the metapopulation model for rock-paper-scissors with mutations is presented in which the total population is divided into patches and the patches form a network of complete graph. The migration among patches is allowed through simple random walk. The replicator-mutator equations are used with the migration term. When migration is allowed then the population of the patches will synchronized and attain stable state through Hopf bifurcation. Apart form this, two phases are observed when the strategies of one of the species mutate to other two species: co-existence of all the species phase and existence of one kind of species phase. The transition from one phase to another phase is taking place due to transcritical bifurcation. The dynamics of the population of species of rock, paper, scissors is studied in the environment of homogeneous and heterogeneous mutation. Numerical simulations have been performed when mutation is allowed in all the patches (homogeneous mutation) and some of the patches (heterogeneous mutation). It has been observed that when the number of patches is increased in the case of heterogeneous mutation then the population of any of the species will not extinct and all the species will co-exist.

In this work, we describe a new approach that uses deep neural networks (DNN) to obtain regularization parameters for solving inverse problems. We consider a supervised learning approach, where a network is trained to approximate the mapping from observation data to regularization parameters. Once the network is trained, regularization parameters for newly obtained data can be computed by efficient forward propagation of the DNN. We show that a wide variety of regularization functionals, forward models, and noise models may be considered. The network-obtained regularization parameters can be computed more efficiently and may even lead to more accurate solutions compared to existing regularization parameter selection methods. We emphasize that the key advantage of using DNNs for learning regularization parameters, compared to previous works on learning via optimal experimental design or empirical Bayes risk minimization, is greater generalizability. That is, rather than computing one set of parameters that is optimal with respect to one particular design objective, DNN-computed regularization parameters are tailored to the specific features or properties of the newly observed data. Thus, our approach may better handle cases where the observation is not a close representation of the training set. Furthermore, we avoid the need for expensive and challenging bilevel optimization methods as utilized in other existing training approaches. Numerical results demonstrate the potential of using DNNs to learn regularization parameters., 27 pages, 16 figures

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

Recently, metapopulation models for rock-paper-scissors games have been presented. Each subpopulation is represented by a node on a graph. An individual is either rock (R), scissors (S) or paper (P); it randomly migrates among subpopulations. In the present paper, we assume victory rates differ in different subpopulations. To investigate the dynamic state of each subpopulation (node), we numerically obtain the solutions of reaction-diffusion equations on the graphs with two and three nodes. In the case of homogeneous victory rates, we find each subpopulation has a periodic solution with neutral stability. However, when victory rates between subpopulations are heterogeneous, the solution approaches stable focuses. The heterogeneity of victory rates promotes the coexistence of species.

Thomas L. Saaty, a world-renowned scholar and our beloved Advisory Editor, passed away on August 14, 2017 at the age of 91.  He has made many fundamental contributions to operations research, analytics, business and mathematics. Despite his heavy illness for 14 months, as passionate about science, he has also enthusiastically published his research. We review his final works published in 2017 and 2018. We are also honored to reveal and publish his final statements on neural firing and synthesis in making comparisons & life satisfaction, respectively, in his final two papers; the previous one submitted by him just before his passing and the other one submitted by his co-authors after his death to European Journal of Pure and Applied Mathematics (EJPAM).We just would like to remember and honor Saaty’s memory by publishing his final papers at EJPAM and this humble remarks dedicated to the memory of Thomas L. Saaty on the occasion of the first anniversary of his passing, August 14, 2018.

In this work, a counterexample is given to refute a result in the paper by Younis et al. (J Fixed Point Theory Appl 21:1–33, 2019). Furthermore, applying this counterexample, we give negative answers to some of the open problems in their paper. Recently, Baradol et al. give a new theorem to rectify the result of Younis et al. However, we find that there are some gaps in the proofs of their results. Finally, we introduce a fundamental lemma and fill these gaps.

In this work, some counterexamples are given to refute some results reported in the paper by Guo and Li [8] (J Optim Theory Appl 162,(2014), 821-844). We correct the faulty in some of their theorems and we present alternative proofs. Moreover, we extend the definition of approximately pseudo-dissipative in the setting of metrizable topological vector spaces.

Migration paths of animals are rarely the same. The paths may change according to seasonal and circadian rhythms. We study the effect of temporal migration on population dynamics of rock-paper-scissors (RPS) games with mutation by using the metapopulation dynamic model with two patches. Via mutation, an individual R changes to S with rate μ. All agents move by random walk between two patches and the RPS game is performed in each patch. The migration path between two patches is switched on or off periodically. The dynamics are represented by the reaction-diffusion equations with time-dependent diffusion coefficients in diffusively coupled reactors. We obtain the solutions of time-dependent reaction-diffusion equations numerically and analytically. The time-varying migration path induces complex behavior for the RPS dynamics, depending on the frequency of the periodical path. We find that the phase transitions occur by varying mutation rate μ. The phase transition depends highly on the frequency.

We give an overview of our critiques of "proofs" of security and a guide to our papers on the subject that have appeared over the past decade and a half. We also provide numerous additional examples and a few updates and errata.

In this paper, we consider precoder designs for multiuser multiple-input-single-output (MISO) broadcasting channels. Instead of using a traditional linear zero-forcing (ZF) precoder, we propose a generalized ZF (GZF) precoder in conjunction with successive dirty-paper coding (DPC) for data-transmissions, namely, the GZF-DP precoder, where the suffix \lq{}DP\rq{} stands for \lq{}dirty-paper\rq{}. The GZF-DP precoder is designed to generate a band-shaped and lower-triangular effective channel $\vec{F}$ such that only the entries along the main diagonal and the $\nu$ first lower-diagonals can take non-zero values. Utilizing the successive DPC, the known non-causal inter-user interferences from the other (up to) $\nu$ users are canceled through successive encoding. We analyze optimal GZF-DP precoder designs both for sum-rate and minimum user-rate maximizations. Utilizing Lagrange multipliers, the optimal precoders for both cases are solved in closed-forms in relation to optimal power allocations. For the sum-rate maximization, the optimal power allocation can be found through water-filling, but with modified water-levels depending on the parameter $\nu$. While for the minimum user-rate maximization that measures the quality of the service (QoS), the optimal power allocation is directly solved in closed-form which also depends on $\nu$. Moreover, we propose two low-complexity user-ordering algorithms for the GZF-DP precoder designs for both maximizations, respectively. We show through numerical results that, the proposed GZF-DP precoder with a small $\nu$ ($\leq\!3$) renders significant rate increments compared to the previous precoder designs such as the linear ZF and user-grouping based DPC (UG-DP) precoders., Comment: 31 pages, 13 figures, submitted to IEEE Transactions on Wireless Communications in Aug. 2016

In this study, we investigate a discrete-time version of logit dynamics, as applied to the rock–paper–scissors (RPS) game. First, we show that around the Nash equilibrium point, an attracting closed invariant curve appears due to the Neimark–Sacker bifurcation. Next, near the resonance point, we find a period-three attracting cycle, which can be thought of as a counterpart to the cyclically stable set in the RPS game with best response dynamics. Moreover, we show that the cycle can coexist with an attracting closed invariant curve, a period-three saddle cycle, and the attracting or repelling Nash equilibrium point. Finally, we use the codimension-two bifurcation theory to specify the set of heteroclinic bifurcations that destroy the coexistence of the attractors.

This Forum Note concerns the question of necessary optimality conditions in optimal control problems subject to state constraints. Some critical remarks about a recently published paper are made.

The purpose of this note is to discuss how paper folding can be used to find the exact trigonometric ratios of the following four angles: 22.5°, 67.5°, 27°, and 63°.

This paper deals with the observer design of nonlinear tubular chemical reactor models. The analysis is performed on a linearized version of the model around a steady-state profile, in which some coefficients are a function of the spatial variable. The study starts from a general model of chemical tubular reactors that will serve as a benchmark model for the formulation in the infinite dimensional Hilbert state space. The optimal output injection operator associated to the proposed observer is computed via the solution of the infinite-dimensional Riccati equation in the space variable. The performance of the observer is illustrated through numerical experiments of an industrial pulp bleaching tubular reactor model.

Author summary Conferences are great venues for disseminating algorithmic bioinformatics results, but they unfortunately do not offer an opportunity to make major revisions in the way that journals do. As a result, it is not possible for authors to fix mistakes that might be easily correctable but nevertheless can cause the paper to be rejected. As a reviewer, I wish that I had the opportunity to tell the authors, “Hey, you forgot to do this really important thing, without which it is hard to accept the paper, but if you could go back and fix it, you might have a great paper for the conference.” This lack of a back and forth can be especially problematic for first-time submitters or those from outside the field, e.g., biologists. In this article, I outline Ten Simple Rules to follow when writing an algorithmic bioinformatics conference paper to avoid having it rejected.

The purpose of this comment paper is to show that the results of the paper (Cui, 2021) are incorrect.

In this corrigendum we correct an error in our paper [T. Caraballo, R. Colucci, J. Lopez-de-la-Cruz and A. Rapaport. A way to model stochastic perturbations in population dynamics models with bounded realizations, Commun Nonlinear Sci Numer Simulat, 77(2019) 239–257]. We present a correct way to model real noisy perturbations by considering a slightly different stochastic process based, as in the original paper, on the Ornstein-Uhlenbeck process. Namely, we correct the formulae that generates the noisy realizations to ensure the boundedness property to be satisfied with probability one (which turns out not to be true in our original paper even though it was observed in all the simulations).

These notes aim to provide a deeper insight on the specifics of two articles dealing with chemotaxis models with nonlinear production. More precisely, we are referring to the papers “Boundedness of solutions to a quasilinear parabolic–parabolic chemotaxis model with nonlinear signal production” by Tao et al. (2019) [2] and “Boundedness for a fully parabolic Keller–Segel model with sublinear segregation and superlinear aggregation” by Frassu and Viglialoro (2021) [1] . These works, independently published in these last years, present results leaving open room for further improvement. Indeed, in the first a gap in the proof of the main claim appears, whereas the cornerstone assumption in the second is not sharp. In these pages we give a more complete picture to the relative underlying comprehension.

This paper addresses the stability analysis of linear systems subject to a time-varying delay. The contribution of this paper is twofolds. First, we aim at presenting a new matrix inequality, which can be seen as an improved version of the reciprocally convex combination, which provides a more accurate delay-dependent lower bound. When gathering this new inequality with the Wirtinger-based integral inequality, efficient stability conditions expressed in terms of LMI are designed and show a clear reduction of the conservatism with a reasonable associated computational cost. The second original contribution of this paper consists in noting that stability conditions issued from the Wirtinger-based integral inequality depends in an affine manner on the bounds of the delay function and also on its derivative. This allows to refine the definition of allowable delay set and to relax usual convex on the delay function. As a result of this new characterization, the LMI conditions allows obtaining stability regions for slow time-varying delay systems which are very closed to the constant delay case.

International audience; This article studies the kinetic dynamics of the rock-paper-scissors binary game. We first prove existence and uniqueness of the solution of the kinetic equation and subsequently we prove the rigorous derivation of the quasi-invariant limit for two meaningful choices of the domain of definition of the independent variables. We notice that the domain of definition of the problem plays a crucial role and heavily influences the behavior of the solution. The rigorous proof of the relaxation limit does not need the use of entropy estimates for ensuring compactness.

A game of rock-paper-scissors is an interesting example of an interaction where none of the pure strategies strictly dominates all others, leading to a cyclic pattern. In this work, we consider an unstable version of rock-paper-scissors dynamics and allow individuals to make behavioural mistakes during the strategy execution. We show that such an assumption can break a cyclic relationship leading to a stable equilibrium emerging with only one strategy surviving. We consider two cases: completely random mistakes when individuals have no bias towards any strategy and a general form of mistakes. Then, we determine conditions for a strategy to dominate all other strategies. However, given that individuals who adopt a dominating strategy are still prone to behavioural mistakes in the observed behaviour, we may still observe extinct strategies. That is, behavioural mistakes in strategy execution stabilise evolutionary dynamics leading to an evolutionary stable and, potentially, mixed co-existence equilibrium., Author summary A game of rock-paper-scissors is more than just a children’s game. This type of interactions is often used to describe competition among animals or humans. A special feature of such an interaction is that none of the pure strategies dominates, resulting in a cyclic pattern. However, in wild communities such interactions are rarely observed by biologists. Our results suggest that this lack of cyclicity may stem from imperfectness of interacting individuals. In other words, we show analytically that heterogeneity in behavioural patterns may break a cyclic relationship and lead to a stable equilibrium in pure or mixed strategies.

We discuss the recent paper by A. Dar\'os and L.K. Arruda (On the instability of elliptic traveling wave solutions of the modified Camassa-Holm equation, J. Diff. Equat., 266 (2019), 1946-1968). Our intention is to correct some imperfections left by the authors and present the orbital stability of periodic snoidal waves in the energy space., Comment: 10 pages and 2 figures

In this note, we make two revisions of the paper [2]. The first one is the asymptotic behavior of the energy functional as $$t\rightarrow T$$ (see [2, Theorem 1.6]), where T is the blow-up time. The second one is the equivalent conditions for the solutions blowing up in finite time or existing globally (see [2, Theorem 1.8]).