Nonstandard models that are definable in models of Peano Arithmetic

In this paper, we investigate definable models of Peano Arithmetic PA in a model of PA. For any definable model N without parameters in a model M, we show that N is isomorphic to M if M is elementary extension of the standard model and N is elementarily equivalent to M. On the other hand, we show that there is a model M and a definable model N with parameters in M such that N is elementarily equivalent to M but N is not isomorphic to M. We also show that there is a model M and a definable model N with parameters in M such that N is elementarily equivalent to M, and N is isomorphic to M, but N is not definably isomorphic to M. And also, we give a generalization of Tennenbaum's theorem. At the end, we give a new method to construct a definable model by a refinement of Kotlarski's method. (© 2007 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim)     

A Regularly Preemptive Model and its Approximations

A regularly preemptive model D,MAP/D ₁,D ₂/1 is studied. Priority customers have constant inter-arrival times and constant service times. On the other hand, ordinary customers' arrivals follow a Markovian Arrival Process (MAP) with constant service times. Although this model can be formulated by using the piecewise Markov process, there remain some difficult problems on numerical calculations. In order to solve these problems, a novel approximation model MAP/MR/1 with Markov renewal services is proposed. These two queueing processes become different due to the existence of idle periods. Thus, a MAP/MR/1 queue with a general boundary condition is introduced. It is a model with the exceptional first service in each busy period. In particular, two special models are studied: one is a warm-up queue and the other is a cool-down queue. It can be proved that the waiting time of ordinary customers for the regular preemption model is stochastically smaller than the waiting time of the former model. On the other hand, it is stochastically larger than the waiting time of the latter model.     

Forcing the Least Measurable to Violate GCH

Starting with a model for “GCH + k is k⁺ supercompact”, we force and construct a model for “k is the least measurable cardinal + 2^k = K⁺”. This model has the property that forcing over it with Add(k,k⁺⁺) preserves the fact k is the least measurable cardinal.     

Optimal block length for Basic mode data transmission control procedure

This paper considers two models of BASIC mode data transmission: When we transmit data with length l

1. (1) data are divided into N blocks and each block is transmitted individually

2. (2) data are divided into N sub-blocks and all sub-blocks are transmitted together.

We derive total average transmission data lengths of each model and discuss optimal numbers N* and block length B* which minimize them. In model 1, the length of one block is approximately determined independently of l. It is shown in a numerical example that when l is large, model 2 is better than model 1.     

Substructure lattices and almost minimal end extensions of models of Peano arithmetic

This paper concerns intermediate structure lattices Lt(??/??), where ?? is an almost minimal elementary end extension of the model ?? of Peano Arithmetic. For the purposes of this abstract only, let us say that ?? attains L if L ? Lt(??/??) for some almost minimal elementary end extension of ??. If T is a completion of PA and L is a finite lattice, then: (A) If some model of T attains L, then every countable model of T does. (B) If some rather classless, ?₁‐saturated model of T attains L, then every model of T does. (© 2004 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Nearly Model Complete Theories

A theory T of a language L is 1-model complete (nearly model complete) iff for every formula ρ of L there is a formula ? (χ) of L which is a ??-formula (a Boolean combination of universal formulas) such that T ? ?x [??θ]. The main results of the paper give characterizations of nearly model complete theories and of 1-model complete theories. As a consequence we obtain that a theory T is nearly model complete iff whenever ?? is a model of T and ???₁??, then T ∪ Δ¹_?? is a complete L(A)-theory, where Δ¹_?? is the 1-diagram of ??. We also point out that our main results extend to (n + l)-model complete and nearly ra-model complete theories for all n > 0.     

Cochain model for thickenings and its application to rational LS-category

A thickening of a finite CW-complex X is by definition a compact manifold M of the same simple homotopy type as X. We give a model for the cochain complex of the boundary of that manifold, C ^*(δM), as a module over the cochain algebra C ^*(X). We also show how to construct an algebraic model of the rational homotopy type of δC ^*(M) from a model of X. Using this rational model, we prove a new formula for the rational Lusternik–Schnirelmann category of X. Received: 24 September 1999     

Three-dimensional Gross-Neveu model at nonzero temperature and in an external magnetic field

The phase structure of the (2+1) Gross-Neveu model at nonzero temperatureT and in an external fieldH is studied in the leading order of the 1/N expansion. It is shown that for any fixed value ofT there exists a critical valueH _c of the magnetic field such that whenH>H _c the chiral invariance of the model is spontaneously broken. For fixedH, there exists a critical value of the temperatureT _c (H) such that forT>T _c (H) the original symmetry of the model is restored. The phase portrait of the model is constructed in theH-T plane.Institute of High Energy Physics, Serpukhov. Translated from Teoreticheskaya i Matematicheskaya Fizika, Vol. 90, No. 1, pp. 3–11, January, 1992.     

Damping Functions correct over‐dissipation of the Smagorinsky Model

This paper studies the time‐averaged energy dissipation rate ?ε _{S M D} (u )? for the combination of the Smagorinsky model and damping function. The Smagorinsky model is well known to over‐damp. One common correction is to include damping functions that reduce the effects of model viscosity near walls. Mathematical analysis is given here that allows evaluation of ?ε _{S M D} (u )? for any damping function. Moreover, the analysis motivates a modified van Driest damping. It is proven that the combination of the Smagorinsky with this modified damping function does not over‐dissipate and is also consistent with Kolmogorov phenomenology. Copyright © 2017 John Wiley & Sons, Ltd.     

Stochastic bounds for a polling system

In this note we consider two queueing systems: a symmetric polling system with gated service at allN queues and with switchover times, and a single-server single-queue model with one arrival stream of ordinary customers andN additional permanently present customers. It is assumed that the combined arrival process at the queues of the polling system coincides with the arrival process of the ordinary customers in the single-queue model, and that the service time and switchover time distributions of the polling model coincide with the service time distributions of the ordinary and permanent customers, respectively, in the single-queue model. A complete equivalence between both models is accomplished by the following queue insertion of arriving customers. In the single-queue model, an arriving ordinary customer occupies with probabilityp _i a position at the end of the queue section behind theith permanent customer,i = l, ...,N. In the cyclic polling model, an arriving customer with probabilityp _i joins the end of theith queue to be visited by the server, measured from its present position.For the single-queue model we prove that, if two queue insertion distributions {p _{i, i} = l, ...,N} and {q _{i, i} = l, ...,N} are stochastically ordered, then also the workload and queue length distributions in the corresponding two single-queue versions are stochastically ordered. This immediately leads to equivalent stochastic orderings in polling models.Finally, the single-queue model with Poisson arrivals andp ₁ = 1 is studied in detail.Part of the research of the first author has been supported by the Esprit BRA project QMIPS.     

A function space model approach to the rational evaluation subgroups

Let f : U → X be a map from a connected nilpotent space U to a connected rational space X. The evaluation subgroup G _*(U, X; f), which is a generalization of the Gottlieb group of X, is investigated. The key device for the study is an explicit Sullivan model for the connected component containing f of the function space of maps from U to X, which is derived from the general theory of such a model due to Brown and Szczarba (Trans Am Math Soc 349, 4931–4951, 1997). In particular, we show that non Gottlieb elements are detected by analyzing a Sullivan model for the map f and by looking at non-triviality of higher order Whitehead products in the homotopy group of X. The Gottlieb triviality of a fibration in the sense of Lupton and Smith (The evaluation subgroup of a fibre inclusion, 2006) is also discussed from the function space model point of view. Moreover, we proceed to consideration of the evaluation subgroup of the fundamental group of a nilpotent space. In consequence, the first Gottlieb group of the total space of each S ¹-bundle over the n-dimensional torus is determined explicitly in the non-rational case.      

Heavy and light traffic in fluid models with burst arrivals

We consider the problem of finding a heavy and light traffic limits for the steady-state workload in a fluid model having a continuous burst arrival process. Such a model is useful for describing (among other things) the packetwise transmission of data in telecommunications, where each packet is approximated to be a continuous flow. Whereas in a queueing model, each arrival epoch,t _n , corresponds to a customer with a service timeS _n , the burst model is different: each arrival epoch,t _n , corresponds to a burst of work, that is, a continuous flow of work (fluid, information) to the system at rate 1 during the time interval [t _n ,t _n +S _n ]. In the present paper we show that the burst and queueing models share the same heavy-traffic limit for work, but that their behavior in light traffic is quite different.Research supported by the Japan Society for the Promotion of Science, during the author's fellowship in Tokyo.Research funded by C & C Information Technology Research Laboratories, NEC, and the International Science Foundation.     

Order restricted inference for sequential k-out-of-n systems

Sequential order statistics have been introduced to model sequential k-out-of-n systems which, as an extension of k-out-of-n systems, allow the failure of some components of the system to influence the remaining ones. Based on an independent sample of vectors of sequential order statistics, the maximum likelihood estimators of the model parameters of a sequential k-out-of-n system are derived under order restrictions. Special attention is paid to the simultaneous maximum likelihood estimation of the model parameters and the distribution parameters for a flexible location-scale family. Furthermore, order restricted hypothesis tests are considered for making the decision whether the usual k-out-of-n model or the general sequential k-out-of-n model is appropriate for a given data.     

Dynamics of SIS model with saturation incidence,infection age and impulsive birth

In this paper, an impulsive birth and infection age SIS epidemic model is studied. Since infection age is an important factor of epidemic progression, we incorporate the infection age into the model. In this model, we analyze the dynamical behaviors of this model and point out that there exists an infection‐free periodic solution that is globally asymptotically stable if R₀<1. When R₁>1, R₂<1, then the disease is permanent. Our results indicate that a large period T of pulse, or a small pulse birth rate p is the sufficient condition for the eradication of the disease. Copyright © 2009 John Wiley & Sons, Ltd.     

A physically motivated model for filled elastomers including strain rate and amplitude dependency in finite viscoelasticity

A microstructure-based model of rubber reinforcement, the so-called dynamic flocculation model (DFM), is presented describing filler-induced stress softening and hysteresis by the breakdown and reaggregation of strained filler clusters [1]. An extension of this model allows to consider incomplete deformation cycles that occur in the simulation of arbitrary deformation histories [2]. Good agreement between measurement and the model is obtained for CB-filled elastomers like NR, SBR or EPDM, loaded along various deformation histories. One very important aspect is that the model parameters can be directly referred to the physical properties. This benefit is used to extend the model to further essential effects like time- and rate-dependent material behavior. In the limit range above the glass transition temperature these viscoelastic effects originate mainly from the filler-filler interactions. In the material model these interactions are characterized by two material parameters s_v and s_d, respectively. The parameter s_v defines the strength of the virgin filler cluster, whereas s_d represents the strength according to the broken or damaged filler clusters. Both parameters can be defined as functions of time s_v,d = ŝ_v,d(t), which can be motivated by physical meaning [3]. Due to this extension it is possible to capture the very complex strain rate and amplitude dependency during loading and relaxation. (© 2015 Wiley-VCH Verlag GmbH & Co. KGaA, Weinheim)     

Modelling the dynamics of stochastic local search on <Emphasis Type="Italic">k</Emphasis>-<Emphasis Type="SmallCaps">sat</Emphasis>

A new analytical tool is presented to provide a better understanding of the search space of k-sat. This tool, termed the local value distribution , describes the probability of finding assignments of any value q′ in the neighbourhood of assignments of value q. The local value distribution is then used to define a Markov model to model the dynamics of a corresponding stochastic local search algorithm for k-sat. The model is evaluated by comparing the predicted algorithm dynamics to experimental results. In most cases the fit of the model to the experimental results is very good, but limitations are also recognised.     

Efficient and accurate spectral method for the time-fractional dual-phase-lag heat transfer model and its parameter estimation

In the current paper, a heat transfer model is suggested based on a time-fractional dual-phase-lag (DPL) model. We discuss the model in two parts, the direct problem and the inverse problem. Firstly, for solving it, the finite difference/Legendre spectral method is constructed. In the temporal direction, we employ the weighted and shifted Grünwald approximation, which can achieve second order convergence. In the spatial direction, the Legendre spectral method is used, it can obtain spectral accuracy. The stability and convergence are theoretically analyzed. For the inverse problem, the Bayesian method is used to construct an algorithm to estimate the four parameters for the model, namely, the time-fractional order α, the time-fractional order β, the delay time τ_T, and the relaxation time τ_q. Next, numerical experiments are provided to demonstrate the effectiveness of our scheme, with the values of τ_q and τ_T for processed meat employed. We also make a comparison with another method. The data obtained for the direct problem are used in the parameter estimation. The paper provides an accurate and efficient numerical method for the time-fractional DPL model.     

Global optima results for the Kauffman NK model

The Kauffman NK model has been used in theoretical biology, physics and business organizations to model complex systems with interacting components. Recent NK model results have focused on local optima. This paper analyzes global optima of the NK model. The resulting global optimization problem is transformed into a stochastic network model that is closely related to two well-studied problems in operations research. This leads to applicable strategies for explicit computation of bounds on the global optima particularly with K either small or close to N. A general lower bound, which is sharp for K = 0, is obtained for the expected value of the global optimum of the NK model. A detailed analysis is provided for the expectation and variance of the global optimum when K = N−1. The lower and upper bounds on the expectation obtained for this case show that there is a wide gap between the values of the local and the global optima. They also indicate that the complexity catastrophe that occurs with the local optima does not arise for the global optima.     

Scale Free Properties of Random <Emphasis Type="Italic">k</Emphasis>-Trees

Scale free graphs have attracted attention as their non-uniform structure that can be used as a model for many social networks including the WWW and the Internet. In this paper, we propose a simple random model for generating scale free k-trees. For any fixed integer k, a k-tree consists of a generalized tree parameterized by k, and is one of the basic notions in the area of graph minors. Our model is quite simple and natural; it first picks a maximal clique of size k + 1 uniformly at random, it then picks k vertices in the clique uniformly at random, and adds a new vertex incident to the k vertices. That is, the model only makes uniform random choices twice per vertex. Then (asymptotically) the distribution of vertex degree in the resultant k-tree follows a power law with exponent 2 + 1/k, the k-tree has a large clustering coefficient, and the diameter is small. Moreover, our experimental results indicate that the resultant k-trees have extremely small diameter, proportional to o(log n), where n is the number of vertices in the k-tree, and the o(1) term is a function of k.