Equivalent Form Research Articles

The Morphophonemic (/i/) in the Central Kurdish dialect of the language

The morphophonemic (/i/) in the Central Kurdish dialect of the Kurdish language, in the (Phonetic, Phonological, Morphological, and Syntactic) structures appear as the same form, but they are different in their structures. This research is conducted on (analytical- descriptive) method, and aome of the equivalent forms of (/i/) are analyzed based on the principles of generative school. For the purpose of presenting the examples, along with the phonemic alphabet, international phonetic alphabet (IPA) is also used. The examples are taken from daily expressions in central Kurdish dialect. In compared words, the vowel phoneme proves itself in the smallest phonological two-word example, and is differed from the semi-consonant (/i/). In the morphological and syntactic structures, it performes different duties as a bound morpheme, and due to the present stress, the long sound of (/i:/) or the short (/i/) are embodied.

Closed SPARSE—A predictive particle cloud tracer

A closed and predictive particle cloud tracer method is presented that models the mean motion and deformation of a cloud of inertial particles at a singular point in space and along its Lagrangian trajectory in time. The tracer builds upon the Subgrid Particle-Averaged Reynolds Stress Equivalent (SPARSE) formulation first introduced in Davis et al. (2017) for the tracing of particle clouds. It was later extended to a Cloud-In-Cell (CIC) formulation in Taverniers et al. (2019) using a Gaussian distribution of a cloud’s influence over a mesh-based, velocity field solution. SPARSE corrects the cloud’s trace to second order by combining a Taylor series expansion of the drag coefficient and Nusselt number correction factors around the mean relative velocity of a cloud of particles with a Reynolds decomposition of the particle equations to obtain a governing system for the first two statistical moments of the cloud’s position, velocity and temperature. Here, we close the thus far unclosed SPARSE formulation by determining the velocity field in the vicinity of the mean cloud location using a truncated Taylor series velocity representation and by combining that with averaging. The resulting tracer is predictive. It enables the tracing of a cloud of particles through a single point and so reduces the required degrees of freedom in the accurate tracing of groups of particles. We demonstrate the accuracy and convergence of the method in several one-, two- and three-dimensional test cases.

Evaluation of Two Adjuvant Formulations for an Inactivated Yellow Fever 17DD Vaccine Candidate in Mice.

The attenuated yellow fever (YF) vaccine is one of the most successful vaccines ever developed. After a single dose administration YF vaccine can induce balanced Th1/Th2 immune responses and long-lasting neutralizing antibodies. These attributes endorsed it as a model of how to properly stimulate the innate response to target protective immune responses. Despite their longstanding success, attenuated YF vaccines can cause rare fatal adverse events and are contraindicated for persons with immunosuppression, egg allergy and age < 6 months and >60 years. These drawbacks have encouraged the development of a non-live vaccine. The aim of the present study is to characterize and compare the immunological profile of two adjuvant formulations of an inactivated YF 17DD vaccine candidate. Inactivated YF vaccine formulations based on alum (Al(OH)3) or squalene (AddaVax®) were investigated by immunization of C57BL/6 mice in 3-dose or 2-dose schedules, respectively, and compared with a single dose of attenuated YF virus 17DD. Sera were analyzed by ELISA and Plaque Reduction Neutralization Test (PRNT) for detection of total IgG and neutralizing antibodies against YF virus. In addition, splenocytes were collected to evaluate cellular responses by ELISpot. Both inactivated formulations were able to induce high titers of IgG against YF, although neutralizing antibodies levels were borderline on pre-challenge samples. Analysis of IgG subtypes revealed a predominance of IgG2a associated with improved neutralizing capacity in animals immunized with the attenuated YF vaccine, and a predominance of IgG1 in groups immunized with experimental non-live formulations (alum and AddaVax®). After intracerebral (IC) challenge, attenuated and inactivated vaccine formulations showed an increase in neutralizing antibodies. The AddaVax®-based inactivated vaccine and the attenuated vaccine achieved 100% protection, and alum-based equivalent formulation achieved 70% protection.

Number theory, borderline dimension and extensive entropy in distributions of ranked data.

The consideration of an existing stochastic approach for the reproduction of ranked data pointed at a formal equivalence between its key mathematical expression and that for trajectories at the tangent bifurcation. This fact led to a nonlinear dynamical approach for rank distributions that shows similarities with universality classes in critical phenomena. The renormalization group (RG) fixed-point map f*(x) for a tangent bifurcation of arbitrary nonlinearity z > 1 has proved to be a powerful tool into which the formalism can be couched. The source distribution P(N) of the stochastic approach can be linked to f*(x) while the size-rank N(k) and frequency-rank F(k') distributions are obtained, respectively, from the map trajectories xt and the sums of its positions. We provide now an extension to Number Theory as we obtain from the trajectories xt of f*(x) the numbers, or asymptotic approximations of them, for the Factorial, Natural, Prime and Fibonacci sets. A measure of the advance of these numbers towards infinity is given by sums of positions that represent their reciprocals. We specify rank distribution universality classes, already associated with real data, to these number sets. We find that the convergence of the series of number reciprocals occurs first at nonlinearity z = 2, that which corresponds to the classical Zipf law, and link this transition edge to the action of the attractor when it first reduces the fractal dimension of trajectory positions to zero. Furthermore, the search of logarithmic corrections common to borderline dimensions provides a link to the Prime numbers set. Finally, we find corroborating evidence of these logarithmic corrections from the analysis of large data sets for ranked earthquake magnitudes. The formalism links all types of ranked distributions to a generalized extensive entropy.

Some Compound Fractional Poisson Processes

In this paper, we introduce and study fractional versions of the Bell–Touchard process, the Poisson-logarithmic process and the generalized Pólya–Aeppli process. The state probabilities of these compound fractional Poisson processes solve a system of fractional differential equations that involves the Caputo fractional derivative of order 0&lt;β&lt;1. It is shown that these processes are limiting cases of a recently introduced process, namely, the generalized counting process. We obtain the mean, variance, covariance, long-range dependence property, etc., for these processes. Further, we obtain several equivalent forms of the one-dimensional distribution of fractional versions of these processes.

Improving Localization Accuracy under Constrained Regions in Wireless Sensor Networks through Geometry Optimization.

In addition to various estimation algorithms, the target localization accuracy in wireless sensor networks (WSNs) can also be improved from the perspective of geometry optimization. Note that existing placement strategies are mainly aimed at unconstrained deployment regions, i.e., the positions of sensors are arbitrary. In this paper, considering factors such as terrain, communication, and security, the optimal range-based sensor geometries under circular deployment region and minimum safety distance constraints are proposed. The geometry optimization problem is modeled as a constrained optimization problem, with a D-optimality-based (maximizing the determinant of FIM matrix) scalar function as the objective function and the irregular feasible deployment regions as the constraints. We transform the constrained optimization problem into an equivalent form using the introduced maximum feasible angle and separation angle, and discuss the optimal geometries based on the relationship between the minimum safety distance and the maximum feasible angle. We first consider optimal geometries for two and three sensors in the localization system, and then use their findings to extend the study to scenarios with arbitrary numbers of sensors and arbitrarily shaped feasible regions. Numerical simulation results are included to verify the theoretical conclusions.

Gradient discretization of a 3D-2D-1D mixed-dimensional diffusive model with resolved interface, application to the drying of a fractured porous medium

Abstract We consider a 3D-2D-1D mixed-dimensional diffusive model in a fractured porous medium coupling the 1D model along the centerline skeleton of a tubular network, the 2D model on a network of planar fractures and the 3D model in the surrounding matrix domain. The transmission conditions are based on a potential continuity assumption at matrix fracture interfaces, and on Robin type conditions at the resolved interfaces between the tubular network and the matrix and fracture network domains. The discretization of this mixed-dimensional model is formulated in the gradient discretization framework (Droniou, J., Eymard, R. &amp; Herbin, R. (2016) Gradient schemes: generic tools for the numerical analysis of diffusion equations. ESAIM Math. Model. Numer. Anal., 50, 749–781), which covers a large class of conforming and nonconforming schemes and provides stability and error estimates based on general coercivity, consistency and limit-conformity properties. As an example of discretization fitting this framework, the mixed-dimensional version of the vertex approximate gradient (VAG) scheme is developed. It is designed to allow nonconforming meshes at the interface between the 1D and 3D-2D domains, to provide a conservative formulation with local flux expressions and to be asymptotic preserving in the limit of high transfer coefficients. Numerical experiments are provided on analytical solutions for simplified geometries, which confirm the theoretical results. Using its equivalent finite volume formulation, the VAG discretization is extended to a drying mixed-dimensional model coupling the Richards equation in a fractured porous medium and the convection diffusion of the vapor molar fraction along the 1D domain. It is applied to simulate the drying process between an operating tunnel and a radioactive waste storage rock with explicit representation of the fractures in the excavated damaged zone.

Maximum weight perfect matching problem with additional disjunctive conflict constraints

AbstractWe focus on an extension of the maximum weight perfect matching problem with additional disjunctive conflict constraints in conjunction with the degree and binary restrictions. Given a simple graph with a nonnegative weight associated with each edge and a set of conflicting edges, the perfect matching problem with conflict constraints consists of finding a maximum weight perfect matching without any conflicting edge pair. Unlike the well‐known ordinary maximum weight perfect matching problem this one is strongly ‐hard. We propose two branch‐and‐bound algorithms for the exact solution of the problem. The first one is based on an equivalent maximum weight stable set formulation with an additional cardinality restriction obtained on the graph representing conflict relations and uses the information coming from its maximal stable sets. The second one is essentially a recursive depth first search scheme that benefits from simple upper bounds incorporated with a fast infeasibility detection procedure to prune the branch‐and‐bound tree. According to the extensive computational tests it is possible to say that they are both very efficient.

Las construcciones con verbo soporte en español y en italiano: asimetrías léxicas y morfosintácticas

Light verb constructions (LVCs) permeate the oral and written productions of native (and non-native) speakers of typologically different languages (e.g., Indo-European, Afro-Asiatic, and Sino-Tibetan languages, among others). From a cross-linguistic perspective, LVCs share basic combinatory and predicative features. However, semantic and morphosyntactic contrasts are visible even in closely related languages such as Spanish and Italian. Therefore, this paper aims to show some of the most significant asymmetries existing between Peninsular Spanish light verb constructions and their equivalent forms in Italian. The ultimate goal of this research is to highlight some of the systematic contrasts that affect specific semantic classes.

TRANSLATION OF PHRASEMES. EQUIVALENCE AND NONEQUIVALENCE

Most of the set phrases with equivalent meaning and internal form in Russian and Serbian are found in Russian and Serbian as cognates. Thus, national specificity is phenomenologically embodied in a considerable number of set phrases with partially or totally different internal forms, as well as in the existence o f set phrases without equivalent in other languages. Criteria on the base of which they are evaluated are as follows: 1) morphological structure of the phraseme; 2) lexical stylistic structure of the phraseme; 3) functional structure of the phraseme (real or potential equivalence with a word); 4) specific manner of representing the reality (expressive image on the base of which the idiom is formed)

Addendum: Timelike and spacelike kernel functions for the hadronic vacuum polarization contribution to the muon anomalous magnetic moment (2022 J. Phys. G: Nucl. Part. Phys. 49 055001)

This addendum provides results complementary to those obtained in [J. Phys. G 49, 055001 (2022)]. Specifically, an equivalent form of the relation, which binds together the ‘spacelike’ kernel functions for the hadronic vacuum polarization contribution to the muon anomalous magnetic moment , is obtained. It is shown that the infrared limiting value of the ‘spacelike’ and ‘timelike’ kernel functions, which enter the representations for involving the Adler function and the R-ratio, is identical to the corresponding QED contribution to the muon anomalous magnetic moment of the preceding order in the electromagnetic coupling. The next-to-leading order contributions (which includes the leptonic and hadronic insertions) and (which includes the double hadronic insertion), are studied. The three kernel functions appearing in the representations for , which involve the hadronic vacuum polarization function, Adler function, and the R-ratio, are presented for the cases of the electron and τ-lepton loop insertions.

Simultaneously vanishing higher derived limits without large cardinals

A question dating to Mardešić and Prasolov’s 1988 work [S. Mardešić and A. V. Prasolov, Strong homology is not additive, Trans. Amer. Math. Soc. 307(2) (1988) 725–744], and motivating a considerable amount of set theoretic work in the years since, is that of whether it is consistent with the ZFC axioms for the higher derived limits [Formula: see text] [Formula: see text] of a certain inverse system [Formula: see text] indexed by [Formula: see text] to simultaneously vanish. An equivalent formulation of this question is that of whether it is consistent for all [Formula: see text]-coherent families of functions indexed by [Formula: see text] to be trivial. In this paper, we prove that, in any forcing extension given by adjoining [Formula: see text]-many Cohen reals, [Formula: see text] vanishes for all [Formula: see text]. Our proof involves a detailed combinatorial analysis of the forcing extension and repeated applications of higher-dimensional [Formula: see text]-system lemmas. This work removes all large cardinal hypotheses from the main result of [J. Bergfalk and C. Lambie-Hanson, Simultaneously vanishing higher derived limits, Forum Math. Pi 9 (2021) e4] and substantially reduces the least value of the continuum known to be compatible with the simultaneous vanishing of [Formula: see text] for all [Formula: see text].

A new equivalent stress approach based on complex invariants: The COIN LiWI method

In this paper, a new equivalent stress approach is presented, which builds on the basic ideas of linear wave interference (LiWI) and thus leads to physically valid signals. Complex invariants (COIN) were introduced for the derivation, whereby a generalized calculation method with consideration of the tension shear strength ratio could be derived following the formulation of Mertens (1988). The LiWI approach was also applied to an equivalent stress formulation from the German FKM guideline (Rennert et al., 2021). Both approaches were tested and compared with signed von-Mises using existing experiments with a wide range of different loads, e.g. nonproportional, variable, frequency superimposed.

Consistency-enhanced SAV BDF2 time-marching method with relaxation for the incompressible Cahn–Hilliard–Navier–Stokes binary fluid model

In recent years, the scalar auxiliary variable (SAV) approach is popular to design decoupled, linear, and energy dissipation-preserving scheme for phase-field models. By introducing an appropriate time-dependent auxiliary variable, the original equations are transformed into equivalent forms and the nonlinear and coupling terms can be easily handled in an explicit manner. The estimation of energy stability is easy to prove and the numerical implementation is efficient. By utilizing the “zero-energy-contribution” property and defining another time-dependent auxiliary variable, the SAV approach can be extended to develop linear and energy-stable schemes for various phase-field fluid models. However, the discrete version of energy stability resulting from SAV approach corresponds to a modified energy instead of the original one. Generally, the discrete modified energy and discrete original energy are not consistent. Moreover, the discrete auxiliary variable related to “zero-energy-contribution” property might be not consistent with its continuous value 1. To enhance the consistency, we herein develop a simple and practical relaxation technique for the SAV BDF2 scheme of Cahn–Hilliard–Navier–Stokes model. The relaxation technique does not obviously increase the computational costs and still leads to provable energy dissipation law. In each time step, the calculation is efficient because we only need to solve several elliptic equations with constant coefficients. Numerical experiments indicate that the proposed method has desired accuracy, energy stability, and capability for incompressible two-phase fluid flows.

On positive and positive partial transpose matrices

A block matrix $\left[ \begin{smallmatrix}A &amp; X \\{{X}^{*}} &amp; B \\\end{smallmatrix} \right]$ is positive partial transpose (PPT) if both $\left[ \begin{smallmatrix}A &amp; X \\{{X}^{*}} &amp; B \\\end{smallmatrix} \right]$ and $\left[ \begin{smallmatrix}A &amp; {{X}^{*}} \\X &amp; B \\\end{smallmatrix} \right]$ are positive semi-definite. This class is significant in studying the separability criterion for density matrices. The current paper presents new relations for such matrices. This includes some equivalent forms and new related inequalities that extend some results from the literature. In the end of the paper, we present some related results for positive semi-definite block matrices, which have similar forms as those presented for PPT matrices, with applications that include significant improvement of numerical radius inequalities.

Non-negative Ollivier curvature on graphs, reverse Poincaré inequality, Buser inequality, Liouville property, Harnack inequality and eigenvalue estimates

We prove that for combinatorial graphs with non-negative Ollivier curvature, one has‖Ptμ−Ptν‖1≤W1(μ,ν)t for all probability measures μ,ν where Pt is the heat semigroup and W1 is the ℓ1-Wasserstein distance. This turns out to be an equivalent formulation of a version of reverse Poincaré inequality. Furthermore, this estimate allows us to prove Buser inequality, Liouville property and the eigenvalue estimate λ1≥log⁡(2)/diam2.

Toward an Understanding of Long-tailed Runtimes of SLS Algorithms

The satisfiability problem (SAT) is one of the most famous problems in computer science. Traditionally, its NP-completeness has been used to argue that SAT is intractable. However, there have been tremendous practical advances in recent years that allow modern SAT solvers to solve instances with millions of variables and clauses. A particularly successful paradigm in this context is stochastic local search (SLS). In most cases, there are different ways of formulating the underlying SAT problem. While it is known that the precise formulation of the problem has a significant impact on the runtime of solvers, finding a helpful formulation is generally non-trivial. The recently introduced GapSAT solver [Lorenz and Wörz 2020] demonstrated a successful way to improve the performance of an SLS solver on average by learning additional information, which logically entails from the original problem. Still, there were also cases in which the performance slightly deteriorated. This justifies in-depth investigations into how learning logical implications affects runtimes for SLS algorithms. In this work, we propose a method for generating logically equivalent problem formulations, generalizing the ideas of GapSAT . This method allows a rigorous mathematical study of the effect on the runtime of SLS SAT solvers. Initially, we conduct empirical investigations. If the modification process is treated as random, then Johnson SB distributions provide a perfect characterization of the hardness. Since the observed Johnson SB distributions approach lognormal distributions, our analysis also suggests that the hardness is long-tailed. As a second contribution, we theoretically prove that restarts are useful for long-tailed distributions. This implies that incorporating additional restarts can further refine all algorithms employing above mentioned modification technique. Since the empirical studies compellingly suggest that the runtime distributions follow Johnson SB distributions, we also investigate this property on a theoretical basis. We succeed in proving that the runtimes for the special case of Schöning’s random walk algorithm [Schöning 2002] are approximately Johnson SB distributed.

Palynological recovery of small carbonaceous fossils (SCFs) indicates that the late Cambrian acritarch Goniomorpha Yin 1986 represents the teeth of a priapulid worm

New palynological studies from the Xiaoyangqiao section (Jilin Province, north-east China), which has been selected as an Auxiliary Boundary Stratigraphic Section and Point (ASSP) for the base of the Ordovician, confirms the presence of Goniomorpha Yin 1986 in intervals ranging from the late Cambrian (Furongian) to the Early Ordovician (Tremadocian), and allow us to clarify its morphology and affinities. Despite being compared originally to vesicular microfossils with processes arising from one pole, Goniomorpha lacks an enclosed cavity, so it cannot be classified as an acritarch in the strict sense. Instead, we find that the specimens originally described as Goniomorpha are actually part of a wider spectrum of morphologies that are identifiable as the pharyngeal teeth of priapulid worms. The best-preserved specimens resolve the ‘processes’ as denticles arising from an arch on the margins of a cuticular pad, sometimes with an extending spur and polygonal microstructure. Closely equivalent forms have been reported from Cambrian assemblages of small carbonaceous fossils (SCFs) and in situ on Burgess Shale specimens of the priapulid Ottoia. The findings from the Xiaoyangqiao section extend the taphonomic range of Cambrian-type SCFs into the Ordovician, and provide the first evidence for priapulids from the Ordovician of northern China. More generally, our results demonstrate the reciprocal insights from palynological and SCF-type processing for identifying problematic microfossils.

Linear and Energy-Stable Method with Enhanced Consistency for the Incompressible Cahn–Hilliard–Navier–Stokes Two-Phase Flow Model

The Cahn–Hilliard–Navier–Stokes model is extensively used for simulating two-phase incompressible fluid flows. With the absence of exterior force, this model satisfies the energy dissipation law. The present work focuses on developing a linear, decoupled, and energy dissipation-preserving time-marching scheme for the hydrodynamics coupled Cahn–Hilliard model. An efficient time-dependent auxiliary variable approach is first introduced to design equivalent equations. Based on equivalent forms, a BDF2-type linear scheme is constructed. In each time step, the unique solvability and the energy dissipation law can be analytically estimated. To enhance the energy stability and the consistency, we correct the modified energy by a practical relaxation technique. Using the finite difference method in space, the fully discrete scheme is described, and the numerical solutions can be separately implemented. Numerical results indicate that the proposed scheme has desired accuracy, consistency, and energy stability. Moreover, the flow-coupled phase separation, the falling droplet, and the dripping droplet are well simulated.

Perfect models for finite Coxeter groups

A model for a finite group is a set of linear characters of subgroups that can be induced to obtain every irreducible character exactly once. A perfect model for a finite Coxeter group is a model in which the relevant subgroups are the quasiparabolic centralizers of perfect involutions. In prior work, we showed that perfect models give rise to interesting examples of W-graphs. Here, we classify which finite Coxeter groups have perfect models. Specifically, we prove that the irreducible finite Coxeter groups with perfect models are those of types An, Bn, D2n+1, H3, or I2(n). We also show that up to a natural form of equivalence, outside types A3, Bn, and H3, each irreducible finite Coxeter group has at most one perfect model. Along the way, we also prove a technical result about representations of finite Coxeter groups, namely, that induction from standard parabolic subgroups of corank at least two is never multiplicity-free.