Search

The aerodynamic performance of a deployable and low-cost unmanned aerial vehicle (UAV) is investigated and improved in present work. The parameters of configuration, such as airfoil and winglet, are determined via an optimising process based on a discrete adjoint method. The optimised target is locked on an increasing lift-to-drag ratio with a limited variation of pitching moments. The separation that will lead to a stall is delayed after optimisation. Up to 128 design variables are used by the optimised solver to give enough flexibility of the geometrical transformation. As much as 20% enhancement of lift-to-drag ratio is gained at the cruise angle-of-attack, that is, a significant improvement in the lift-to-drag ratio adhering to the preferred configuration is obtained with increasing lift and decreasing drag coefficients, essentially entailing an improved aerodynamic performance.

A class of games for finding a leader among a group of candidates is studied in detail. This class covers games based on coin tossing and rock-paper-scissors as special cases and its complexity exhibits similar stochastic behaviors: either of logarithmic mean and bounded variance or of exponential mean and exponential variance. Many applications are also discussed.

In this note we re-examine the analysis of the paper "On the martingale property of stochastic exponentials" by B. Wong and C.C. Heyde, Journal of Applied Probability, 41(3):654-664, 2004. Some counterexamples are presented and alternative formulations are discussed., Comment: To appear in Journal of Applied Probability, 11 pages

Recently, Saleh claimed to have solved `a long standing open question' in Topology; namely, he proved that every almost continuous function is closure continuous (= $\theta$-continuous). Unfortunately, this problem was settled long time ago and even a better result is known., Comment: 2 pages, to appear in "Glasgow Math. J."

In [5] Doeblin considered some classes of finite non-homogeneous Markov chains and gave without proofs several results concerning their asymptotic behaviour. In the present paper we first attempt to make Doeblin's results precise and try to reconstruct his arguments. Subsequently we investigate more general situations, where a state space decomposition is provided by the sets occurring in the representation of the atomic sets of the tail or-field. We show that Doeblin's notion of an associated chain, as well as considerations regarding the tail ar-field structure of the chain, can be used to solve such cases. FINITE MARKOV CHAIN; FINAL CLASS; CYCLICALLY MOVING SUBCLASS; TAIL ar-FIELD; ATOMIC SET; RECURRENCE; WHIRLPOOL

In a recent paper Weiss (1965) has suggested a simple model for a carrier-borne epidemic such as typhoid. He considers a population (of size m) of susceptibles into which a number (k) of carriers is introduced. These carriers exhibit no overt symptoms and are only detectable by the discovery of infected persons. He supposed that after the initial introduction of the carriers, the population remains entirely closed and no new carriers arise. The epidemic then progresses until either all the carriers have been traced and isolated or until the entire population has succumbed to the disease.

We illustrate a technique for computing certain integrals that arise in probability theory by giving a new derivation of a formula of Kingman. This formula contains the joint distribution of the processes F(t) = inf {s: X(t + s) = b} and B(t) = inf{s: X(t - s) = b} where X is a time homogeneous, continuous parameter, Markov process and b is a fixed point in its state space. We then extend this formula to the situation in which b is replaced by a finite set {b 1, …, b n }.

A well known observation of Lov\'asz is that if a hypergraph is not $2$-colorable, then at least one pair of its edges intersect at a single vertex. %This very simple criterion turned out to be extremly useful . In this short paper we consider the quantitative version of Lov\'asz's criterion. That is, we ask how many pairs of edges intersecting at a single vertex, should belong to a non $2$-colorable $n$-uniform hypergraph? Our main result is an {\em exact} answer to this question, which further characterizes all the extremal hypergraphs. The proof combines Bollob\'as's two families theorem with Pluhar's randomized coloring algorithm., Comment: A note on Property B

This study proposed a novel ensemble analysis strategy to improve hand, foot and mouth disease (HFMD) prediction by integrating environmental data. The approach began by establishing a vector autoregressive model (VAR). Then, a dynamic Bayesian networks (DBN) model was used for variable selection of environmental factors. Finally, a VAR model with constraints (CVAR) was established for predicting the incidence of HFMD in Chengdu city from 2011 to 2017. DBN showed that temperature was related to HFMD at lags 1 and 2. Humidity, wind speed, sunshine, PM10, SO2 and NO2 were related to HFMD at lag 2. Compared with the autoregressive integrated moving average model with external variables (ARIMAX), the CVAR model had a higher coefficient of determination (R2, average difference: + 2.11%; t = 6.2051, P = 0.0003 < 0.05), a lower root mean-squared error (−24.88%; t = −5.2898, P = 0.0007 < 0.05) and a lower mean absolute percentage error (−16.69%; t = −4.3647, P = 0.0024 < 0.05). The accuracy of predicting the time-series shape was 88.16% for the CVAR model and 86.41% for ARIMAX. The CVAR model performed better in terms of variable selection, model interpretation and prediction. Therefore, it could be used by health authorities to identify potential HFMD outbreaks and develop disease control measures.

SUMMARYThe purpose of this study was to apply a novel statistical method for variable selection and a model-based approach for filling data gaps in mortality rates associated with foodborne diseases using the WHO Vital Registration mortality dataset. Correlation analysis and elastic net regularization methods were applied to drop redundant variables and to select the most meaningful subset of predictors. Whenever predictor data were missing, multiple imputation was used to fill in plausible values. Cluster analysis was applied to identify similar groups of countries based on the values of the predictors. Finally, a Bayesian hierarchical regression model was fit to the final dataset for predicting mortality rates. From 113 potential predictors, 32 were retained after correlation analysis. Out of these 32 predictors, eight with non-zero coefficients were selected using the elastic net regularization method. Based on the values of these variables, four clusters of countries were identified. The uncertainty of predictions was large for countries within clusters lacking mortality rates, and it was low for a cluster that had mortality rate information. Our results demonstrated that, using Bayesian hierarchical regression models, a data-driven clustering of countries and a meaningful subset of predictors can be used to fill data gaps in foodborne disease mortality.

The activated sludge process is one of the major aerobic processes used in the biological treatment of wastewater. A significant drawback of this process is the production of excess sludge, the disposal of which can account for 50-60% of the running costs of a plant. Thus there is a growing interest in methods that reduce the volume and mass of excess sludge produced as part of biological wastewater treatment processes. In practice a target value is often set for the sludge content inside the bioreactor. If the sludge content is higher than the target value, the process is stopped and the reactor is cleaned. This is undesirable as it increases running costs. In chapter 2 we investigate a simple model for the activated sludge process in which the influent contains a mixture of soluble and biodegradable particulate substrate. Within the bioreactor the biodegradable particulate substrate is hydrolyzed to form soluble substrate. The soluble organics are used for energy and growth by the biomass. Biomass decay produces soluble substrate in addition to inert material. We use steady-state analysis to investigate how the amount of sludge formed depends upon the residence time and the use of a settling unit. We show that when the steady-state sludge content is plotted as a function of the residence time that there are five generic response diagrams, depending upon the value of the effective recycle parameter. Four of them are desirable because the sludge content is below the target value if the residence time is higher than some critical value that is not ‘too large’ in practice. In chapter 3 we investigate how the volume and mass of excess sludge produced by the activated sludge process can be reduced by coupling the bioreactor used in the process to a sludge disintegration unit. In chapter 4 a seemingly minor modification is made to the model in chapter 2.

This graphical technique utilizes only three types of artifacts from the collection to the seriated. The relationship between the three selected types is plotted on three-pole graph paper. The points on the graph are clustered along a line representing change through time; hence the archaeological materials are arranged in their correct temporal sequence. Data from Paragonah, Utah, and Pindi, New Mexico, two Southwestern sites for which the time sequence is known, are used for empirical tests of the seriational technique. In both cases there is close agreement between the results of the seriation and the time sequence revealed by field evidence. SERIATION, or the arrangement of archaeological materials in their chronological order by overlapping of similar traits in different finds, has a long history dating back to the "Sequence Dates" of Petrie (1904). In recent years, increased attention has been given to problems of seriation; two notable advances include the graphical technique developed by Ford (Ford and Willey 1949); and the statistical method proposed by Brainerd (1951) and Robinson (1951). Despite certain shortcomings, both of these methods work and both of them provide more sensitive measures of chronological difference than anything we have had heretofore. Some criticisims of the methods have been raised (Lehmer 1951; Bennyhoff 1951) and it is apparent that seriation techniques are neither a substitute for good field techniques nor for an adequate typology (Dixon 1956). Still, I am convinced from my own application of both of these methods to the field data from excavations, that the following statements are valid: 1. Both the Ford and the Brainerd-Robinson methods yield results that are consistent with the field data. In many cases the methods can be checked against stratigraphy, building superposition, and other field observations (Belous 1953; Collier 1955). If the results are not consistent with the field observations, other methods of age determination must be applied (Dixon 1956). *Presented at the 57th Annual Meeting of the American Anthropological Association, November 23, 1958, Washington, D.C. 2. Seriation methods provide a more detailed picture of temporal change than stratigraphy and field observations alone. Application of these methods can give a more objective determination of the number of cultural periods present, can indicate interruptions in the temporal sequence, and can sometimes indicate the presence of mixed or disturbed collections in the sequence. Application of seriation techniques is not mere data-juggling, but an extremely useful adjunct to ordinary methods of analysis. DESCRIPTION OF THE METHOD In beginning a seriation, the first step is selection of the trait to be seriated. This trait must have the following characteristics: (1) abundance; (2) measurable diversity (more than one type); (3) long time span in terms of the sample seriated (the feature should occur throughout the time span studied). If pottery is present this is likely to be the best feature for seriation, although this is not always true. In southern California it is seldom possible to seriate pottery collections on a statistical basis because there is not enough diversity of types. Assuming that pottery is used for the seriation, the next step is to reduce the number of pottery types to three for purposes of the analysis. The reduction to three types may be done in several ways: 1. Selecting the three most abundant types will usually work. In this case all other types are omitted from the seriation, although they may sometimes be used as a check on the results as described below. 2. In cases where a large part of the pottery sample consists of a common type (such as a plainware), occurring in about the same proportion throughout the time span of the sample, the common type may be skipped and the seriation done with the next three most common

N THE course of certain investigations on the identification of cloth ash,192 it became necessary to develop a technique whereby relatively large (5 to 15 cm.) fragments of ashed cloth of all types woven from vegetable fiber could be permanently preserved. The requirements were that the preparations should be capable of withstanding the relatively rough handling of the laboratory. They should show the textile remains displayed flat with the yarns of the warp and weft in their original relations. The samples should be so mounted that both sides could be studied with the microscope. Characteristics of Ashed Fabrics. The ash of a textile woven from vegetable fiber is generally an extremely fragile substance. The relative durability of such material is greatly influenced by the presence of sizing and weighting in the original cloth. The mordants used in dyeing, should such be present, would also have some effect. Generally, however, the ashed residue will stand but very little handling without collapsing to an impalpable powder which furnishes but little evidence as to the original nature of the cloth from which the ash was derived. Some indication of the type of fiber, whether that of cotton, linen, jute, or other material, may be furnished by the examination of such powdery residues, but this is about all. Where the cloth has been merely carbonized, the preservation of the carbon web presents no serious difficulties, but in the event of complete incineration where only the mineral constituents of the fibers remain, the residue is extremely fragile. It is for the latter, class of residues that the technique was developed. Literature Concerning the Preservation of Ashed Residues. The literature on the subject of ash preservation is meager, and what little there is is hard to come by. References related to the present subject are to be found in the works of Lucas,'93 Mitchell,l94 Matthews,195 and more recently the work of Sodermann and O'Connell.'9'

The Hodrick–Prescott (HP) filter has been a popular method of trend extraction from economic time series. However, it is impractical without modification if some observations are not available. This paper improves the HP filter so that it can be applied in such situations. More precisely, this paper introduces two alternative generalized HP filters that are applicable for this purpose. We provide their properties and a way of specifying those smoothing parameters that are required for their application. In addition, we numerically examine their performance. Finally, based on our analysis, we recommend one of them for applied studies.

Let $S \subset \Bbb R^n$ be a smooth compact hypersurface with a strictly positive second fundamental form, $E$ be the Fourier extension operator on $S$, and $X$ be a Lebesgue measurable subset of $\Bbb R^n$. If $X$ contains a ball of each radius, then the problem of determining the range of exponents $(p,q)$ for which the estimate $\| Ef \|_{L^q(X)} \leq C \| f \|_{L^p(S)}$ holds is equivalent to the restriction conjecture. In this paper, we study the estimate under the following assumption on the set $X$: there is a number $0 < \alpha \leq n$ such that $|X \cap B_R| \leq c \, R^\alpha$ for all balls $B_R$ in $\Bbb R^n$ of radius $R \geq 1$. On the left-hand side of this estimate, we are integrating the function $|Ef(x)|^q$ against the measure $\chi_X dx$. Our approach consists of replacing the characteristic function $\chi_X$ of $X$ by an appropriate weight function $H$, and studying the resulting estimate in three different regimes: small values of $\alpha$, intermediate values of $\alpha$, and large values of $\alpha$. In the first regime, we establish the estimate by using already available methods. In the second regime, we prove a weighted H\"{o}lder-type inequality that holds for general non-negative Lebesgue measurable functions on $\Bbb R^n$, and combine it with the result from the first regime. In the third regime, we borrow a recent fractal Fourier restriction theorem of Du and Zhang and combine it with the result from the second regime. In the opposite direction, the results of this paper improve on the Du-Zhang theorem in the range $0 < \alpha < n/2$., Comment: 31 pages. Minor revision

This paper presents an approach, based on interpolation theory of operators, to the study of interpolating sequences for interpolation Banach spaces between Hardy spaces. It is shown that the famous Carleson result forH∞can be lifted to a large class of abstract Hardy spaces. A description is provided of the range of the Carleson operator defined on interpolation spaces between the classical Hardy spaces in terms of uniformly separated sequences. A key role in this description is played by some general interpolation results proved in the paper. As by-products, novel results are obtained which extend the Shapiro–Shields result on the characterisation of interpolation sequences for the classical Hardy spacesHp. Applications to Hardy–Lorentz, Hardy–Marcinkiewicz and Hardy–Orlicz spaces are presented.

This is the first of a series of two papers dealing with local limit theorems in relatively hyperbolic groups. In this first paper, we prove rough estimates for the Green function. Along the way, we introduce the notion of relative automaticity which will be useful in both papers and we show that relatively hyperbolic groups are relatively automatic. We also define the notion of spectral positive recurrence for random walks on relatively hyperbolic groups. We then use our estimates for the Green function to prove that $p_n\asymp R^{-n}n^{-3/2}$ for spectrally positive-recurrent random walks, where $p_n$ is the probability of going back to the origin at time n and where R is the inverse of the spectral radius of the random walk.

In this paper we extend to non-classical set theories the standard strategy of proving independence using Boolean-valued models. This extension is provided by means of a new technique that, combining algebras (by taking their product), is able to provide product-algebra-valued models of set theories. In this paper we also provide applications of this new technique by showing that: (1) we can import the classical independence results to non-classical set theory (as an example we prove the independence of$\mathsf {CH}$); and (2) we can provide new independence results. We end by discussing the role of non-classical algebra-valued models for the debate between universists and multiversists and by arguing that non-classical models should be included as legitimate members of the multiverse.

The Σ-invariants of Bieri–Neumann–Strebel and Bieri–Renz involve an action of a discrete group G on a geometrically suitable space M. In the early versions, M was always a finite-dimensional Euclidean space on which G acted by translations. A substantial literature exists on this, connecting the invariants to group theory and to tropical geometry (which, actually, Σ-theory anticipated). More recently, we have generalized these invariants to the case where M is a proper CAT(0) space on which G acts by isometries. The “zeroth stage” of this was developed in our paper [BG16]. The present paper provides a higher-dimensional extension of the theory to the “nth stage” for any n.

Initial insurance losses are often reported with a textual description of the claim. The claims manager must determine the adequate case reserve for each known claim. In this paper, we present a framework for predicting the amount of loss given a textual description of the claim using a large number of words found in the descriptions. Prior work has focused on classifying insurance claims based on keywords selected by a human expert, whereas in this paper the focus is on loss amount prediction with automatic word selection. In order to transform words into numeric vectors, we use word cosine similarities and word embedding matrices. When we consider all unique words found in the training dataset and impose a generalised additive model to the resulting explanatory variables, the resulting design matrix is high dimensional. For this reason, we use a group lasso penalty to reduce the number of coefficients in the model. The scalable, analytical framework proposed provides for a parsimonious and interpretable model. Finally, we discuss the implications of the analysis, including how the framework may be used by an insurance company and how the interpretation of the covariates can lead to significant policy change. The code can be found in the TAGAM R package (github.com/scottmanski/TAGAM).

Time variation is a fundamental problem in statistical and econometric analysis of macroeconomic and financial data. Recently, there has been considerable focus on developing econometric modelling that enables stochastic structural change in model parameters and on model estimation by Bayesian or nonparametric kernel methods. In the context of the estimation of covariance matrices of large dimensional panels, such data requires taking into account time variation, possible dependence and heavy-tailed distributions. In this paper, we introduce a nonparametric version of regularization techniques for sparse large covariance matrices, developed by Bickel and Levina (2008) and others. We focus on the robustness of such a procedure to time variation, dependence and heavy-tailedness of distributions. The paper includes a set of results on Bernstein type inequalities for dependent unbounded variables which are expected to be applicable in econometric analysis beyond estimation of large covariance matrices. We discuss the utility of the robust thresholding method, comparing it with other estimators in simulations and an empirical application on the design of minimum variance portfolios.

This paper develops an asymptotic theory of nonlinear least squares estimation by establishing a new framework that can be easily applied to various nonlinear regression models with heteroscedasticity. As an illustration, we explore an application of the framework to nonlinear regression models with nonstationarity and heteroscedasticity. In addition to these main results, this paper provides a maximum inequality for a class of martingales, which is of interest in its own right.

This paper establishes a new version of integration by parts formula of Markov chains for sensitivity computation, under much lower restrictions than the existing researches. Our approach is more fundamental and applicable without using Girsanov theorem or Malliavin calculus as did by past papers. Numerically, we apply this formula to compute sensitivity regarding the transition rate matrix and compare with a recent research by an IPA (infinitesimal perturbation analysis) method and other approaches.

In this paper we consider the following problem: letXk, be a Banach space with a normalised basis (e(k, j))j, whose biorthogonals are denoted by${(e_{(k,j)}^*)_j}$, for$k\in\N$, let$Z=\ell^\infty(X_k:k\kin\N)$be theirl∞-sum, and let$T:Z\to Z$be a bounded linear operator with a large diagonal,i.e.,$$\begin{align*}\inf_{k,j} \big|e^*_{(k,j)}(T(e_{(k,j)})\big|>0.\end{align*}$$Under which condition does the identity onZfactor throughT? The purpose of this paper is to formulate general conditions for which the answer is positive.

Providing optimal strategies for maintaining technical systems in good working condition is an important goal in reliability engineering. The main aim of this paper is to propose some optimal maintenance policies for coherent systems based on some partial information about the status of components in the system. For this purpose, in the first part of the paper, we propose two criteria under which we compute the probability of the number of failed components in a coherent system with independent and identically distributed components. The first proposed criterion utilizes partial information about the status of the components with a single inspection of the system, and the second one uses partial information about the status of component failure under double monitoring of the system. In the computation of both criteria, we use the notion of the signature vector associated with the system. Some stochastic comparisons between two coherent systems have been made based on the proposed concepts. Then, by imposing some cost functions, we introduce new approaches to the optimal corrective and preventive maintenance of coherent systems. To illustrate the results, some examples are examined numerically and graphically.

In this paper, to model cascading failures, a new stochastic failure model is proposed. In a system subject to cascading failures, after each failure of the component, the remaining component suffers from increased load or stress. This results in shortened residual lifetimes of the remaining components. In this paper, to model this effect, the concept of the usual stochastic order is employed along with the accelerated life test model, and a new general class of stochastic failure models is generated.

Recently, Cavaliere, Georgiev, and Taylor (2018, Econometric Theory 34, 302–348) (CGT) considered the augmented Dickey–Fuller (ADF) test for a unit-root model with linear noise driven by i.i.d. infinite variance innovations and showed that ordinary least squares (OLS)-based ADF statistics have the same distribution as in Chan and Tran (1989, Econometric Theory 5, 354–362) for i.i.d. infinite variance noise. They also proposed an interesting question to extend their results to the case with infinite variance GARCH innovations as considered in Zhang, Sin, and Ling (2015, Stochastic Processes and their Applications 125, 482–512). This paper addresses this question. In particular, the limit distributions of the ADF for random walk models with short-memory linear noise driven by infinite variance GARCH innovations are studied. We show that when the tail index $\alpha , the limit distributions are completely different from that of CGT and the estimator of the parameters of the lag terms used in the ADF regression is not consistent. This paper provides a broad treatment of unit-root models with linear GARCH noises, which encompasses the commonly entertained unit-root IGARCH model as a special case.

In this paper, we present a version of Guan-Zhou’s optimal $L^{2}$ extension theorem and its application. As a main application, we show that under a natural condition, the question posed by Ohsawa in his series paper VIII on the extension of $L^{2}$ holomorphic functions holds. We also give an explicit counterexample which shows that the question fails in general.

This paper explores versions of the Yoneda Lemma in settings founded upon FM sets. In particular, we explore the lemma for three base categories: the category of nominal sets and equivariant functions; the category of nominal sets and all finitely supported functions, introduced in this paper; and the category of FM sets and finitely supported functions. We make this exploration in ordinary, enriched and internal settings. We also show that the finite support of Yoneda natural transformations is a theorem for free.

In this paper, we first use the distribution of the number of records to demonstrate that the right tail probabilities of counts of rare events are generally better approximated by the right tail probabilities of Poisson distribution than {those} of normal distribution. We then show the moderate deviations in Poisson approximation generally require an adjustment and, with suitable adjustment, we establish better error estimates of the moderate deviations in Poisson approximation than those in \cite{CFS}. Our estimates contain no unspecified constants and are easy to apply. We illustrate the use of the theorems in six applications: Poisson-binomial distribution, matching problem, occupancy problem, birthday problem, random graphs and 2-runs. The paper complements the works of \cite{CC92,BCC95,CFS}., 29 pages and 5 figures

Suppose that $G$ is a simple reductive group over $\mathbf{Q}$, with an exceptional Dynkin type and with $G(\mathbf{R})$ quaternionic (in the sense of Gross–Wallach). In a previous paper, we gave an explicit form of the Fourier expansion of modular forms on $G$ along the unipotent radical of the Heisenberg parabolic. In this paper, we give the Fourier expansion of the minimal modular form $\unicode[STIX]{x1D703}_{Gan}$ on quaternionic $E_{8}$ and some applications. The $Sym^{8}(V_{2})$-valued automorphic function $\unicode[STIX]{x1D703}_{Gan}$ is a weight 4, level one modular form on $E_{8}$, which has been studied by Gan. The applications we give are the construction of special modular forms on quaternionic $E_{7},E_{6}$ and $G_{2}$. We also discuss a family of degenerate Heisenberg Eisenstein series on the groups $G$, which may be thought of as an analogue to the quaternionic exceptional groups of the holomorphic Siegel Eisenstein series on the groups $\operatorname{GSp}_{2n}$.

The tight combination model improves the positioning accuracy of the Global Navigation Satellite System (GNSS) in complex environments by increasing the redundancy of observation. However, the ambiguity cannot be calculated directly because of the correlation between it and the phase difference inter-system bias (DISB) in the model. This paper proposes a method of DISB estimation based on the principle of maximum ratio. From the data analysis, for the standard deviation of code DISB, the improvement of the method can up to 0·179 m with the poor quality data. In addition, compared to the parameter combination method, the standard deviation of all the phase DISB was deceased with the method in the paper. About the phase DISB of GPS L1/Galileo E1, the standard deviation decreased from 0·014/0·022/0·009/0·051 cycles to 0·006/0·015/0·004/0·029 cycles of four baselines, which represents the improvement of 57·14/31·82/55·56/43·14%. About the phase DISB of GPS L1/BDS B1, the standard deviation decreased from 0·014/0·061/0·010/0·052 cycles to 0·002/0·005/0·009/0·004 cycles of four baselines, which represents the improvement of 85·71/91·80/10·00/92·31%.

In this paper, we analyze Boolean formulas in conjunctive normal form (CNF) from the perspective of read-once resolution (ROR) refutation schemes. A read-once (resolution) refutation is one in which each clause is used at most once. Derived clauses can be used as many times as they are deduced. However, clauses in the original formula can only be used as part of one derivation. It is well known that ROR is not complete; that is, there exist unsatisfiable formulas for which no ROR exists. Likewise, the problem of checking if a 3CNF formula has a read-once refutation is NP-complete. This paper is concerned with a variant of satisfiability called not-all-equal satisfiability (NAE-satisfiability). A CNF formula is NAE-satisfiable if it has a satisfying assignment in which at least one literal in each clause is set to false. It is well known that the problem of checking NAE-satisfiability is NP-complete. Clearly, the class of CNF formulas which are NAE-satisfiable is a proper subset of satisfiable CNF formulas. It follows that traditional resolution cannot always find a proof of NAE-unsatisfiability. Thus, traditional resolution is not a sound procedure for checking NAE-satisfiability. In this paper, we introduce a variant of resolution called NAE-resolution which is a sound and complete procedure for checking NAE-satisfiability in CNF formulas. The focus of this paper is on a variant of NAE-resolution called read-once NAE-resolution in which each clause (input or derived) can be part of at most one NAE-resolution step. Our principal result is that read-once NAE-resolution is a sound and complete procedure for 2CNF formulas. Furthermore, we provide an algorithm to determine the smallest such NAE-resolution in polynomial time. This is in stark contrast to the corresponding problem concerning 2CNF formulas and ROR refutations. We also show that the problem of checking whether a 3CNF formula has a read-once NAE-resolution is NP-complete.

We present a new method of proving the Diophantine extremality of various dynamically defined measures, vastly expanding the class of measures known to be extremal. This generalizes and improves the celebrated theorem of Kleinbock and Margulis [{\it Invent. Math.} {\bf 138}(3) (1999), 451--494] resolving Sprind\v zuk's conjecture, as well as its extension by Kleinbock, Lindenstrauss, and Weiss [On fractal measures and Diophantine approximation. {\it Selecta Math.} {\bf 10} (2004), 479--523], hereafter abbreviated KLW. As applications we prove the extremality of all hyperbolic measures of smooth dynamical systems with sufficiently large Hausdorff dimension, and of the Patterson--Sullivan measures of all nonplanar geometrically finite groups. The key technical idea, which has led to a plethora of new applications, is a significant weakening of KLW's sufficient conditions for extremality. In the first of this series of papers [{\it Selecta Math.} {\bf 24}(3) (2018), 2165--2206], we introduce and develop a systematic account of two classes of measures, which we call {\it quasi-decaying} and {\it weakly quasi-decaying}. We prove that weak quasi-decay implies strong extremality in the matrix approximation framework, as well as proving the ``inherited exponent of irrationality'' version of this theorem. In this paper, the second of the series, we establish sufficient conditions on various classes of conformal dynamical systems for their measures to be quasi-decaying. In particular, we prove the above-mentioned result about Patterson--Sullivan measures, and we show that equilibrium states (including conformal measures) of nonplanar infinite iterated function systems (including those which do not satisfy the open set condition) and rational functions are quasi-decaying., Comment: Link to Part I: arXiv:1504.04778

In this paper we investigate the computational complexity of deciding if a given finite algebraic structure satisfies a fixed (strong) Maltsev condition $\Sigma$. Our goal in this paper is to show that $\Sigma$-testing can be accomplished in polynomial time when the algebras tested are idempotent and the Maltsev condition $\Sigma$ can be described using paths. Examples of such path conditions are having a Maltsev term, having a majority operation, and having a chain of J\'onsson (or Gumm) terms of fixed length., Comment: 33 pages, 19 figures

Large samples from a light-tailed distribution often have a well-defined shape. This paper examines the implications of the assumption that there is a limit shape. We show that the limit shape determines the upper quantiles for a large class of random variables. These variables may be described loosely as continuous homogeneous functionals of the underlying random vector. They play an important role in evaluating risk in a multivariate setting. The paper also looks at various coefficients of tail dependence and at the distribution of the scaled sample points for large samples. The paper assumes convergence in probability rather than almost sure convergence. This results in an elegant theory. In particular, there is a simple characterization of domains of attraction.

Let $\unicode[STIX]{x1D703}$ be an irrational real number. The map $T_{\unicode[STIX]{x1D703}}:y\mapsto (y+\unicode[STIX]{x1D703})\!\hspace{0.6em}{\rm mod}\hspace{0.2em}1$ from the unit interval $\mathbf{I}= [\!0,1\![$ (endowed with the Lebesgue measure) to itself is ergodic. In a short paper [Parry, Automorphisms of the Bernoulli endomorphism and a class of skew-products. Ergod. Th. & Dynam. Sys.16 (1996), 519–529] published in 1996, Parry provided an explicit isomorphism between the measure-preserving map $[T_{\unicode[STIX]{x1D703}},\text{Id}]$ and the unilateral dyadic Bernoulli shift when $\unicode[STIX]{x1D703}$ is extremely well approximated by the rational numbers, namely, if $$\begin{eqnarray}\inf _{q\geq 1}q^{4}4^{q^{2}}~\text{dist}(\unicode[STIX]{x1D703},q^{-1}\mathbb{Z})=0.\end{eqnarray}$$ A few years later, Hoffman and Rudolph [Uniform endomorphisms which are isomorphic to a Bernoulli shift. Ann. of Math. (2)156 (2002), 79–101] showed that for every irrational number, the measure-preserving map $[T_{\unicode[STIX]{x1D703}},\text{Id}]$ is isomorphic to the unilateral dyadic Bernoulli shift. Their proof is not constructive. In the present paper, we relax notably Parry’s condition on $\unicode[STIX]{x1D703}$: the explicit map provided by Parry’s method is an isomorphism between the map $[T_{\unicode[STIX]{x1D703}},\text{Id}]$ and the unilateral dyadic Bernoulli shift whenever $$\begin{eqnarray}\inf _{q\geq 1}q^{4}~\text{dist}(\unicode[STIX]{x1D703},q^{-1}\mathbb{Z})=0.\end{eqnarray}$$ This condition can be relaxed again into $$\begin{eqnarray}\inf _{n\geq 1}q_{n}^{3}~(a_{1}+\cdots +a_{n})~|q_{n}\unicode[STIX]{x1D703}-p_{n}| where $[0;a_{1},a_{2},\ldots ]$ is the continued fraction expansion and $(p_{n}/q_{n})_{n\geq 0}$ the sequence of convergents of $\Vert \unicode[STIX]{x1D703}\Vert :=\text{dist}(\unicode[STIX]{x1D703},\mathbb{Z})$. Whether Parry’s map is an isomorphism for every $\unicode[STIX]{x1D703}$ or not is still an open question, although we expect a positive answer.

This paper generalizes the Kunita–Watanabe decomposition of an $L^2$ space. The generalization comes from using nonlinear stochastic integrals where the integrator is a family of continuous martingales bounded in $L^2$ . This result is also the solution of an optimization problem in $L^2$ . First, martingales are assumed to be stochastic integrals. Then, to get the general result, it is shown that the regularity of the family of martingales with respect to its spatial parameter is inherited by the integrands in the integral representation of the martingales. Finally, an example showing how the results of this paper, with the Clark–Ocone formula, can be applied to polynomial functions of Brownian integrals.

The notion of quantized characters was introduced in our previous paper as a natural quantization of characters in the context of asymptotic representation theory forquantum groups. As in the case of ordinary groups, the representation associated with any extreme quantized character generates a von Neumann factor. From the viewpoint of operator algebras (and measurable dynamical systems), it is natural to ask what is the Murray–von Neumann–Connes type of the resulting factor. In this paper, we give a complete solution to this question when the inductive system is of quantum unitary groups $U_{q}(N)$.

We study a Markovian agent-based model (MABM) in this paper. Each agent is endowed with a local state that changes over time as the agent interacts with its neighbours. The neighbourhood structure is given by a graph. In a recent paper [Simon et al. 2011], the authors used the automorphisms of the underlying graph to generate a lumpable partition of the joint state space ensuring Markovianness of the lumped process for binary dynamics. However, many large random graphs tend to become asymmetric rendering the automorphism-based lumping approach ineffective as a tool of model reduction. In order to mitigate this problem, we propose a lumping method based on a notion of local symmetry, which compares only local neighbourhoods of vertices. Since local symmetry only ensures approximate lumpability, we quantify the approximation error by means of Kullback-Leibler divergence rate between the original Markov chain and a lifted Markov chain. We prove the approximation error decreases monotonically. The connections to fibrations of graphs are also discussed., Comment: 28 pages, 4 figures

The HOD Dichotomy Theorem states that if there is an extendible cardinal, δ, then either HOD is “close” to V (in the sense that it correctly computes successors of singular cardinals greater than δ) or HOD is “far” from V (in the sense that all regular cardinals greater than or equal to δ are measurable in HOD). The question is whether the future will lead to the first or the second side of the dichotomy. Is HOD “close” to V, or “far” from V? There is a program aimed at establishing the first alternative—the “close” side of the HOD Dichotomy. This is the program of inner model theory. In recent years the third author has provided evidence that there is an ultimate inner model—Ultimate-L—and he has isolated a natural conjecture associated with the model—the Ultimate-L Conjecture. This conjecture implies that (assuming the existence of an extendible cardinal) that the first alternative holds—HOD is “close” to V. This is the future in which pattern prevails. In this paper we introduce a very different program, one aimed at establishing the second alternative—the “far” side of the HOD Dichotomy. This is the program of large cardinals beyond choice. Kunen famously showed that if AC holds then there cannot be a Reinhardt cardinal. It has remained open whether Reinhardt cardinals are consistent in ZF alone. It turns out that there is an entire hierarchy of choiceless large cardinals of which Reinhardt cardinals are only the beginning, and, surprisingly, this hierarchy appears to be highly ordered and amenable to systematic investigation, as we shall show in this paper. The point is that if these choiceless large cardinals are consistent then the Ultimate-L Conjecture must fail. This is the future where chaos prevails.

This paper considers two variants of M/G/1 queues with impatient customers, which are denoted by M/G/1+Gw and M/G/1+Gs. In the M/G/1+Gw queue customers have deadlines for their waiting times, and they leave the system immediately if their services do not start before the expiration of their deadlines. On the other hand, in the M/G/1+Gs queue customers have deadlines for their sojourn times, where customers in service also immediately leave the system when their deadlines expire. In this paper we derive comparison results for performance measures of these models. In particular, we show that if the service time distribution is new better than used in expectation, then the loss probability in the M/G/1+Gs queue is greater than that in the M/G/1+Gw queue.

This paper concerns the study of the global structure of measure-preserving actions of countable groups on standard probability spaces. Weak containment is a hierarchical notion of complexity of such actions, motivated by an analogous concept in the theory of unitary representations. This concept gives rise to an associated notion of equivalence of actions, called weak equivalence, which is much coarser than the notion of isomorphism (conjugacy). It is well understood now that, in general, isomorphism is a very complex notion, a fact which manifests itself, for example, in the lack of any reasonable structure in the space of actions modulo isomorphism. On the other hand, the space of weak equivalence classes is quite well behaved. Another interesting fact that relates to the study of weak containment is that many important parameters associated with actions, such as the type, cost, and combinatorial parameters, turn out to be invariants of weak equivalence and in fact exhibit desirable monotonicity properties with respect to the pre-order of weak containment, a fact that can be useful in certain applications. There has been quite a lot of activity in this area in the last few years, and our goal in this paper is to provide a survey of this work.

This paper studies a periodic-review single-commodity setup-cost inventory model with backorders and holding/backlog costs satisfying quasiconvexity assumptions. We show that the Markov decision process for this inventory model satisfies the assumptions that lead to the validity of optimality equations for discounted and average-cost problems and to the existence of optimal (s,S) policies. In particular, we prove the equicontinuity of the family of discounted value functions and the convergence of optimal discounted lower thresholds to the optimal average-cost lower threshold for some sequence of discount factors converging to 1. If an arbitrary nonnegative amount of inventory can be ordered, we establish stronger convergence properties: (i) the optimal discounted lower thresholds converge to optimal average-cost lower threshold; and (ii) the discounted relative value functions converge to average-cost relative value function. These convergence results previously were known only for subsequences of discount factors even for problems with convex holding/backlog costs. The results of this paper also hold for problems with fixed lead times.

This paper studies the regularity results of classical solutions to the two-dimensional critical Oldroyd-B model in the corotational case. The critical case refers to the full Laplacian dissipation in the velocity or the full Laplacian dissipation in the non-Newtonian part of the stress tensor. Whether or not their classical solutions develop finite time singularities is a difficult problem and remains open. The object of this paper is two-fold. Firstly, we establish the global regularity result to the case when the critical case occurs in the velocity and a logarithmic dissipation occurs in the non-Newtonian part of the stress tensor. Secondly, when the critical case occurs in the non-Newtonian part of the stress tensor, we first present many interesting global a priori bounds, then establish a conditional global regularity in terms of the non-Newtonian part of the stress tensor. This criterion comes naturally from our approach to obtain a global L∞-bound for the vorticity ω.

Let${\mathcal{S}}$be the family of analytic and univalent functions$f$in the unit disk$\mathbb{D}$with the normalization$f(0)=f^{\prime }(0)-1=0$, and let$\unicode[STIX]{x1D6FE}_{n}(f)=\unicode[STIX]{x1D6FE}_{n}$denote the logarithmic coefficients of$f\in {\mathcal{S}}$. In this paper we study bounds for the logarithmic coefficients for certain subfamilies of univalent functions. Also, we consider the families${\mathcal{F}}(c)$and${\mathcal{G}}(c)$of functions$f\in {\mathcal{S}}$defined by$$\begin{eqnarray}\text{Re}\biggl(1+{\displaystyle \frac{zf^{\prime \prime }(z)}{f^{\prime }(z)}}\biggr)>1-{\displaystyle \frac{c}{2}}\quad \text{and}\quad \text{Re}\biggl(1+{\displaystyle \frac{zf^{\prime \prime }(z)}{f^{\prime }(z)}}\biggr)for some$c\in (0,3]$and$c\in (0,1]$, respectively. We obtain the sharp upper bound for$|\unicode[STIX]{x1D6FE}_{n}|$when$n=1,2,3$and$f$belongs to the classes${\mathcal{F}}(c)$and${\mathcal{G}}(c)$, respectively. The paper concludes with the following two conjectures:∙If$f\in {\mathcal{F}}(-1/2)$, then$|\unicode[STIX]{x1D6FE}_{n}|\leq 1/n(1-(1/2^{n+1}))$for$n\geq 1$, and$$\begin{eqnarray}\mathop{\sum }_{n=1}^{\infty }|\unicode[STIX]{x1D6FE}_{n}|^{2}\leq {\displaystyle \frac{\unicode[STIX]{x1D70B}^{2}}{6}}+{\displaystyle \frac{1}{4}}~\text{Li}_{2}\biggl({\displaystyle \frac{1}{4}}\biggr)-\text{Li}_{2}\biggl({\displaystyle \frac{1}{2}}\biggr),\end{eqnarray}$$where$\text{Li}_{2}(x)$denotes the dilogarithm function.∙If$f\in {\mathcal{G}}(c)$, then$|\unicode[STIX]{x1D6FE}_{n}|\leq c/2n(n+1)$for$n\geq 1$.

In this paper, we extend the strong laws of large numbers and entropy ergodic theorem for partial sums for tree-indexed nonhomogeneous Markov chains fields to delayed versions of nonhomogeneous Markov chains fields indexed by a homogeneous tree. At first we study a generalized strong limit theorem for nonhomogeneous Markov chains indexed by a homogeneous tree. Then we prove the generalized strong laws of large numbers and the generalized asymptotic equipartition property for delayed sums of finite nonhomogeneous Markov chains indexed by a homogeneous tree. As corollaries, we can get the similar results of some current literatures. In this paper, the problem settings may not allow to use Doob's martingale convergence theorem, and we overcome this difficulty by using Borel–Cantelli Lemma so that our proof technique also has some new elements compared with the reference Yang and Ye (2007).

With the growing interest in scale-resolving simulations of spatially evolving boundary layers, synthetic turbulence generation (STG) has become a valuable tool for providing unsteady turbulent boundary conditions through a sum over a finite number of spatio-temporal Fourier modes with amplitude, direction and phase determined by a random number set. Recent developments of STG methods are designed to match target profiles for anisotropic and inhomogeneous Reynolds stresses. In this paper, it is shown that, for practical values of the number of modes, a given set of random numbers may produce Reynolds stress profiles that are 30 % off their target. To remedy this situation, the error in the STG stress prediction is decomposed into a steady-state bias and a purely unsteady part affecting the time convergence. Direct relationships between the random number vectors and both types of error are developed, allowing large collections of random number sets to be rapidly scanned and the best performers selected for a much improved agreement with the target. The process is verified for the inflow to a direct numerical simulation of a flat plate at . This paper demonstrates sufficient time convergence over a few flow-through times as well as a correction of the method's biases.

This paper deals with homogenization of flow in porous media with large inhomogeneities. Classical homogenization relies on representative elementary volumes (REV) large enough that asymptotic macroscopic parameters, e.g. effective permeabilities, can be employed to describe the expected or mean behaviour. In this way, Darcy's law, which describes the relationship between macroscopic pressure gradient and volumetric flow rate, was derived. In the presence of large features, however, the required REV size may reach the same order as the geometric reference scale of the problem, and thus effective permeabilities obtained from classical homogenization studies may be unsuited. This is in particular the case for reservoirs with isolated, highly conductive fractures. To see this, consider flow from left to right through a block of finite size. If the latter is small enough, such that some fractures are connected to both left and right boundaries, then the resulting flow will be larger for the same average pressure gradient than through a wider block. In this paper, a new sub-REV continuum model to describe this pre-asymptotic flow behaviour is presented. The model relies on a non-local multi-media description based on coupled integral–differential equations. The only empirical information required for calibration is the effective permeability of an infinitely large domain, e.g. as obtained from classical homogenization. With a series of numerical studies and comparison with Monte Carlo reference data it is demonstrated that the devised sub-REV model accurately captures mean flow rates and pressure profiles for arbitrary domain sizes.