Search

Dieser Beitrag ist mit Zustimmung des Rechteinhabers aufgrund einer (DFG geförderten) Allianz- bzw. Nationallizenz frei zugänglich., This publication is with permission of the rights owner freely accessible due to an Alliance licence and a national licence (funded by the DFG, German Research Foundation) respectively., The paper ‘Zur Dynamik elastisch gekoppelter Punktsysteme’ by Schrödinger (1914) does not seem to have attracted the attention that it deserves. We translate it into English here and we discuss its results in detail, with a view to its possible influence in the modern theories of generalised continua. The clever solution found, in terms of Bessel functions, by Schrödinger of the problem of the vibrations of a linear infinite chain of molecules gives some important methodological hints for contemporary research.

We correct a mistake in a lemma in the paper cited in the title and show that it did not affect any of the other results of the paper. To this end, we prove results on linearly disjoint field extensions that do not seem to be commonly known. We give an example to show that a separability assumption in one of these results cannot be dropped (doing so had led to the mistake). Further, we discuss recent generalizations of the original classification of defect extensions.

We introduce our efforts within the project ‘The science of deep specification’ to work out the key formal underpinnings of industrial-scale formal specifications of software and hardware components, anticipating a world where large verified systems are routinely built out of smaller verified components that are also used by many other projects. We identify an important class of specification that has already been used in a few experiments that connect strong component-correctness theorems across the work of different teams. To help popularize the unique advantages of that style, we dub itdeep specification, and we say that it encompasses specifications that arerich,two-sided,formalandlive(terms that we define in the article). Our core team is developing a proof-of-concept system (based on the Coq proof assistant) whose specification and verification work is divided across largely decoupled subteams at our four institutions, encompassing hardware microarchitecture, compilers, operating systems and applications, along with cross-cutting principles and tools for effective specification. We also aim to catalyse interest in the approach, not just by basic researchers but also by users in industry.This article is part of the themed issue ‘Verified trustworthy software systems’.

This comment is devoted to the paper “Lie Symmetry Analysis, Explicit Solutions, and Conservation Laws of a Spatially Two-Dimensional Burgers–Huxley Equation” (Symmery, 2020, vol.12, 170), in which several results are either incorrect, or incomplete, or misleading.

Inspired by the article “Anomalous relaxation model based on the fractional derivative with a Prabhakar-like kernel” (Z. Angew. Math. Phys. (2019) 70:42) whose authors Zhao and Sun studied the integro-differential equation with the kernel given by the Prabhakar function $$e^{-\gamma }_{\alpha , \beta }(t, \lambda )$$ , we provide the solution to this equation which is complementary to that obtained up to now. Our solution is valid for effective relaxation times whose admissible range extends the limits given in Zhao and Sun (Z Angew Math Phys 70:42, 2019, Theorem 3.1) to all positive values. For special choices of parameters entering the equation itself and/or characterizing the kernel, the solution comprises to known phenomenological relaxation patterns, e.g., to the Cole–Cole model (if $$\gamma = 1, \beta =1-\alpha $$ ) or to the standard Debye relaxation.

The aim of this paper is to study a new equivalent form of the weak maximum principle for a large class of differential operators on Riemannian manifolds. This new form has been inspired by the work of Berestycki, Hamel and Rossi for trace operators, and allows us to shed new light on it and to introduce a new sufficient bounded Khas’minskii type condition for its validity. We show its effectiveness by applying it to obtain some uniqueness results in a geometric setting.

Software design impacts much of statistical analysis and, as technology changes, dramatically so in recent years, it is exciting to learn how statistical software is adapting and changing. This leads to the collection of papers published here, written by John Chambers, Duncan Temple Lang, Michael Lawrence, Martin Morgan, Yihui Xie, Heike Hofmann and Xiaoyue Cheng., Published in at http://dx.doi.org/10.1214/14-STS481 the Statistical Science (http://www.imstat.org/sts/) by the Institute of Mathematical Statistics (http://www.imstat.org)

In this paper, we analyze the complexity of an eco-epidemiological model for phytoplankton–zooplankton system in presence of toxicity and time delay. Holling type II function response is incorporated to address the predation rate as well as toxic substance distribution in zooplankton. It is also presumed that infected phytoplankton does recover from the viral infection. In the absence of time delay, stability and Hopf-bifurcation conditions are investigated to explore the system dynamics around all the possible equilibrium points. Further, in the presence of time delay, conditions for local stability are derived around the interior equilibria and the properties of the periodic solution are obtained by applying normal form theory and central manifold arguments. Computational simulation is performed to illustrate our theoretical findings. It is explored that system dynamics is very sensitive corresponding to carrying capacity and toxin liberation rate and able to generate chaos. Further, it is observed that time delay in the viral infection process can destabilize the phytoplankton density whereas zooplankton density remains in its old state. Incorporation of time delay also gives the scenario of double Hopf-bifurcation. Some control parameters are discussed to stabilize system dynamics. The effect of time delay on (i) growth rate of susceptible phytoplankton shows the extinction and double Hopf-bifurcation in the zooplankton population, (ii) a sufficiently large value of carrying capacity stabilizes the chaotic dynamics or makes the whole system chaotic with further increment.

In this paper we develop new tensor methods for unconstrained convex optimization, which solve at each iteration an auxiliary problem of minimizing convex multivariate polynomial. We analyze the simplest scheme, based on minimization of a regularized local model of the objective function, and its accelerated version obtained in the framework of estimating sequences. Their rates of convergence are compared with the worst-case lower complexity bounds for corresponding problem classes. Finally, for the third-order methods, we suggest an efficient technique for solving the auxiliary problem, which is based on the recently developed relative smoothness condition (Bauschke et al. in Math Oper Res 42:330–348, 2017; Lu et al. in SIOPT 28(1):333–354, 2018). With this elaboration, the third-order methods become implementable and very fast. The rate of convergence in terms of the function value for the accelerated third-order scheme reaches the level $$O\left( {1 \over k^4}\right) $$ O 1 k 4 , where k is the number of iterations. This is very close to the lower bound of the order $$O\left( {1 \over k^5}\right) $$ O 1 k 5 , which is also justified in this paper. At the same time, in many important cases the computational cost of one iteration of this method remains on the level typical for the second-order methods.

COVID-19 pandemic has affected all aspects of people's lives and disrupted the economy. Forecasting the number of cases infected with this virus can help authorities make accurate decisions on the interventions that must be implemented to control the pandemic. Investigation of the studies on COVID-19 forecasting indicates that various techniques such as statistical, mathematical, and machine and deep learning have been utilized. Although deep learning models have shown promising results in this context, their performance can be improved using auxiliary features. Therefore, in this study, we propose two hybrid deep learning methods that utilize the statistical features as auxiliary inputs and associate them with their main input. Specifically, we design a hybrid method of the multihead attention mechanism and the statistical features (ATT_FE) and a combined method of convolutional neural network and the statistical features (CNN_FE) and apply them to COVID-19 data of 10 countries with the highest number of confirmed cases. The results of experiments indicate that the hybrid models outperform their conventional counterparts in terms of performance measures. The experiments also demonstrate the superiority of the hybrid ATT_FE method over the long short-term memory model.

The class of log-elliptical distributions is well used and studied in risk measurement and actuarial science. The reason is that risks are often skewed and positive when they describe pure risks, i.e., risks in which there is no possibility of profit. In practice, risk managers confront a system of mutually dependent risks, not only one risk. Thus, it is important to measure risks while capturing their dependence structure. In this short paper, we compute the multivariate risk measures, multivariate tail conditional expectation, and multivariate tail covariance measure for the family of log-elliptical distributions, which captures the dependence structure of the risks while focusing on the tail of their distributions, i.e., on extreme loss events. We then study our result and examine special cases, as well as the optimal portfolio selection using such measures. Finally, we show how the given multivariate tail moments can also be computed for log-skew elliptical models based on similar approaches given for the log-elliptical case.

Pulp washing process has the features of multivariate, time delay, nonlinearity. Considering the difficulties of modeling and optimal control in pulp washing process, a data-driven operational-pattern optimization method is proposed to model and optimize the pulp washing process in this paper. The most important quality indexes of pulp washing performance are residual soda in the washed pulp and Baume degree of extracted black liquor. Considering the difficulties of modeling, online measurement of these indexes, two-step neural networks, and multivariate logistic regression are used to establish the prediction models of residual soda and Baume degree. The mathematical model of the washing process can be identified, and the indexes can meet the production requirements. In the target of better product quality, low cost, and low energy consumption, a multiobjective problems is solved by ant colony optimization algorithm based on the optimized operational-pattern database. It shows that the theoretical analyses are correct and the practical applications are feasible, optimization control system has been designed for the pulp washing process, and the practical results show that pulp production increased by 20% and water consumption decreased by nearly 30%. This method is effective in the pulp washing process.

In this paper we study bipartite quantum correlations using techniques from tracial noncommutative polynomial optimization. We construct a hierarchy of semidefinite programming lower bounds on the minimal entanglement dimension of a bipartite correlation. This hierarchy converges to a new parameter: the minimal average entanglement dimension, which measures the amount of entanglement needed to reproduce a quantum correlation when access to shared randomness is free. For synchronous correlations, we show a correspondence between the minimal entanglement dimension and the completely positive semidefinite rank of an associated matrix. We then study optimization over the set of synchronous correlations by investigating quantum graph parameters. We unify existing bounds on the quantum chromatic number and the quantum stability number by placing them in the framework of tracial optimization. In particular, we show that the projective packing number, the projective rank, and the tracial rank arise naturally when considering tracial analogues of the Lasserre hierarchy for the stability and chromatic number of a graph. We also introduce semidefinite programming hierarchies converging to the commuting quantum chromatic number and commuting quantum stability number., Comment: 26 pages

The possibilities of exploiting the special structure of d.c. programs, which consist of optimizing the difference of convex functions, are currently more or less limited to variants of the DCA proposed by Pham Dinh Tao and Le Thi Hoai An in 1997. These assume that either the convex or the concave part, or both, are evaluated by one of their subgradients. In this paper we propose an algorithm which allows the evaluation of both the concave and the convex part by their proximal points. Additionally, we allow a smooth part, which is evaluated via its gradient. In the spirit of primal-dual splitting algorithms, the concave part might be the composition of a concave function with a linear operator, which are, however, evaluated separately. For this algorithm we show that every cluster point is a solution of the optimization problem. Furthermore, we show the connection to the Toland dual problem and prove a descent property for the objective function values of a primal-dual formulation of the problem. Convergence of the iterates is shown if this objective function satisfies the Kurdyka--\L ojasiewicz property. In the last part, we apply the algorithm to an image processing model.

In this short paper we prove a parametric version of the Harnack inequality for \(\phi\)-Laplacian equations. In this sense, the estimates are optimal and represent an improvement of previous bounds for this kind of operators.

This work presents an optimization proposal to better the computational convergence time in convection-diffusion and driven-cavity problems by applying a simulated annealing (SA) metaheuristic, obtaining optimal values in relaxation factors (RF) that optimize the problem convergence during its numerical execution. These relaxation factors are tested in numerical models to accelerate their computational convergence in a shorter time. The experimental results show that the relaxation factors obtained by the SA algorithm improve the computational time of the problem convergence regardless of user experience in the initial low-quality RF proposal.

In this short paper we combine the representability theorem introduced in [17, 18] with the theory of derived formal models introduced in [2] to prove the existence representability of the derived Hilbert space RHilb(X) for a separated k-analytic space X. Such representability results relies on a localization theorem stating that if X is a quasi-compact and quasi-separated formal scheme, then the \infty-category Coh^+(X^rig) of almost perfect complexes over the generic fiber can be realized as a Verdier quotient of the \infty-category Coh^+(X). Along the way, we prove several results concerning the the \infty-categories of formal models for almost perfect modules on derived k-analytic spaces., 28 pages

In order to solve the Sylvester equations more efficiently, a new four parameters positive and skew-Hermitian splitting (FPPSS) iterative method is proposed in this paper based on the previous research of the positive and skew-Hermitian splitting (PSS) iterative method. We prove that when coefficient matrix A and B satisfy certain conditions, the FPPSS iterative method is convergent in the parameter&rsquo, s value region. The numerical experiment results show that compared with previous iterative method, the FPPSS iterative method is more effective in terms of iteration number IT and runtime.

The "exact subgraph" approach was recently introduced as a hierarchical scheme to get increasingly tight semidefinite programming relaxations of several NP-hard graph optimization problems. Solving these relaxations is a computational challenge because of the potentially large number of violated subgraph constraints. We introduce a computational framework for these relaxations designed to cope with these difficulties. We suggest a partial Lagrangian dual, and exploit the fact that its evaluation decomposes into several independent subproblems. This opens the way to use the bundle method from non-smooth optimization to minimize the dual function. Finally computational experiments on the Max-Cut, stable set and coloring problem show the excellent quality of the bounds obtained with this approach., arXiv admin note: substantial text overlap with arXiv:1902.05345

We investigate the asymptotic properties of the trajectories generated by a second-order dynamical system with Hessian driven damping and a Tikhonov regularization term in connection with the minimization of a smooth convex function in Hilbert spaces. We obtain fast convergence results for the function values along the trajectories. The Tikhonov regularization term enables the derivation of strong convergence results of the trajectory to the minimizer of the objective function of minimum norm.

In this work we introduce the r-Hunter-Saxton equation, a generalisation of the Hunter-Saxton equation arising as extremals of an action principle posed in L_r. We characterise solutions to the Cauchy problem, quantifying the blow-up time and studying various symmetry reductions. We construct piecewise linear functions and show that they are weak solutions to the r-Hunter-Saxton equation., Revised after referee comments

This short paper concerns the existence of curves with low gonality on smooth hypersurfaces $$X\subset \mathbb {P}^{n+1}$$ . After reviewing a series of results on this topic, we report on a recent progress we achieved as a product of the Workshop Birational geometry of surfaces, held at University of Rome “Tor Vergata” on January 11th–15th, 2016. In particular, we obtained that if $$X\subset \mathbb {P}^{n+1}$$ is a very general hypersurface of degree $$d\geqslant 2n+2$$ , the least gonality of a curve $$C\subset X$$ passing through a general point of X is $$\mathrm {gon}(C)=d-\left\lfloor \frac{\sqrt{16n+1}-1}{2}\right\rfloor $$ , apart from some exceptions we list.

In this short paper, we construct a unipotent nearby cycle functor and show a p-adic analogue of Beilinson’s equivalence comparing two derived categories: the derived category of holonomic arithmetic $${\mathcal {D}}$$ -modules and the derived category of arithmetic $${\mathcal {D}}$$ -modules whose cohomologies are holonomic.

Understanding the structure of financial markets deals with suitably determining the functional relation between financial variables. In this respect, important variables are the trading activity, defined here as the number of trades N, the traded volume V, the asset price P, the squared volatility \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\sigma ^2$$\end{document}σ2, the bid-ask spread S and the cost of trading C. Different reasonings result in simple proportionality relations (“scaling laws”) between these variables. A basic proportionality is established between the trading activity and the squared volatility, i.e., \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$N \sim \sigma ^2$$\end{document}N∼σ2. More sophisticated relations are the so called 3/2-law \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$N^{3/2} \sim \sigma P V /C$$\end{document}N3/2∼σPV/C and the intriguing scaling \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$N \sim (\sigma P/S)^2$$\end{document}N∼(σP/S)2. We prove that these “scaling laws” are the only possible relations for considered sets of variables by means of a well-known argument from physics: dimensional analysis. Moreover, we provide empirical evidence based on data from the NASDAQ stock exchange showing that the sophisticated relations hold with a certain degree of universality. Finally, we discuss the time scaling of the volatility \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\sigma $$\end{document}σ, which turns out to be more subtle than one might naively expect.

Membranes processes, in particular, nanofiltration and reverse osmosis, represent an important alternative for treatment of contaminated waters. In this context, the present study aims to evaluate the efficiency of the removal of the carbamates: carbaryl, carbofuran and methomyl at different concentrations from water fortified with these compounds. A pilot nanofiltration unit, operating in the tangential flow, provided with a membrane in the spiral configuration, Model NF90-4040 (Dow Filmtec Membranes) was used. Two types of fortified water with carbamates were performed: distilled water and pond water. Nanofiltration tests with distilled water were performed in a closed system, in order to maintain a constant concentration of carbamates in the feed water. In this case, the efficiency of carbamates removal was greater or equal than 89, 100 and 74% for carbaryl, carbofuran, and methomyl, respectively. When using pond water, the removal of carbamates was higher or equal: 98, 100 and 90% for carbaryl, carbofuran, and methomyl, respectively. The results indicate that by nanofiltration, it is possible to obtain drinking water from the contaminated water with carbamates, according to international guidelines.

Cellulose nanopapers have gained significant attention in recent years as large-scale reinforcement for high-loading cellulose nanocomposites, substrates for printed electronics and filter nanopapers for water treatment. The mechanical properties of nanopapers are of fundamental importance for all these applications. Cellulose nanopapers can simply be prepared by filtering a suspension of nanocellulose, followed by heat consolidation. It was already demonstrated that the mechanical properties of cellulose nanopapers can be tailored by the fineness of the fibrils used or by modifying nanocellulose fibrils for instance by polymer adsorption, but nanocellulose blends remain underexplored. In this work, we show that the mechanical and physical properties of cellulose nanopapers can be tuned by creating nanopapers from blends of various grades of nanocellulose, i.e. (mechanically refined) bacterial cellulose or cellulose nanofibrils extracted from never-dried bleached softwood pulp by chemical and mechanical pre-treatments. We found that nanopapers made from blends of two or three nanocellulose grades show synergistic effects resulting in improved stiffness, strength, ductility, toughness and physical properties. This article is part of a discussion meeting issue ‘New horizons for cellulose nanotechnology’.

In this short paper, we extend the classical Hoffman-Meeks Halfspace Theorem [Hoffman and Meeks, 'The strong halfspace theorem for minimal surfaces', Invent. Math. 101 (1990) 373-377] to self-shrinkers, that is: Let $P$ be a hyperplane passing through the origin. The only properly immersed self-shrinker $\Sigma $ contained in one of the closed half-space determined by $P$ is $\Sigma = P$. Our proof is geometric and uses a catenoid type hypersurface discovered by Kleene-Moller [Kleene and Moller, 'Self-shrinkers with a rotational symmetry', Trans. Amer. Math. Soc. 366 (2014) 3943-3963]. Also, using a similar geometric idea, we obtain that the only self-shrinker properly immersed in an closed cylinder $ \overline {B^{k+1} (R)} \times {\mathbb R}^{n-k}\subset {\mathbb R}^{n+1}$, for some $k\in \{1, \ldots, n\}$ and radius $R$, $R \leqslant \sqrt {2k}$, is the cylinder ${\mathbb S}^k (\sqrt {2k}) \times {\mathbb R}^{n-k}$. We also extend the above results for $\lambda $-hypersurfaces.

In 1985, Odoni showed that in characteristic 0 0 the Galois group of the n n -th iterate of the generic polynomial with degree d d is as large as possible. That is, he showed that this Galois group is the n n -th wreath power of the symmetric group S d S_d . We generalize this result to positive characteristic, as well as to the generic rational function. These results can be applied to prove certain density results in number theory, two of which are presented here. This work was partially completed by the late R.W.K. Odoni in an unpublished paper.

Curaua (Ananas erictifolius) fiber was investigated as sorbent of diesel and biodiesel oils, and compared with peat, which is used commercially. The sorption tests were carried out for the unclassified fiber and within the granulometry ranges ≤ 180; 180-425; 425-850 and 850-3350 μm, in the times 5, 10, 20, 40, 60 and 1440 min. The sorbents were also submitted to a physycal-chemical and energetic characterization. The unclassified curaua fiber presented a medium sorption capacity of the diesel oil of 1.12 g oil g fiber -1 , similar to the one found for peat, which was 1.25 g oil g peat -1 , whereas the biodiesel sorption was 1.16 g oil g fiber -1 , higher than the peat sorption, 0.85 g oil g peat -1 . The peat showed the highest mean sorption value of both oils in the 180-425 μm granulometry, decreasing with its increase. With the granolumetry increase, the curaua fiber experienced an increase in the biodiesel sorption, but remained constant regarding the diesel sorption. The calorific power of the sorbents after sorption was higher, due to the sorbed oil

Using the approach of so-called c-sequences introduced by the fifth author in his recent work, we give much simpler and shorter proofs of multivalued Perov's type results with respect to the ones presented in the recently published paper by M. Abbas et al. Our proofs improve, complement, unify and enrich the ones from the recent papers. Further, in the last section of this paper, we correct and generalize the well-known Perov's fixed point result. We show that this result is in fact equivalent to Banach's contraction principle.

When the reduced twisted $C^*$-algebra $C^*_r(\mathcal{G}, c)$ of a non-principal groupoid $\mathcal{G}$ admits a Cartan subalgebra, Renault's work on Cartan subalgebras implies the existence of another groupoid description of $C^*_r(\mathcal{G}, c)$. In an earlier paper, joint with Reznikoff and Wright, we identified situations where such a Cartan subalgebra arises from a subgroupoid $\mathcal{S}$ of $\mathcal{G}$. In this paper, we study the relationship between the original groupoids $\mathcal{S}, \mathcal{G}$ and the Weyl groupoid and twist associated to the Cartan pair. We first identify the spectrum $\mathfrak{B}$ of the Cartan subalgebra $C^*_r(\mathcal{S}, c)$. We then show that the quotient groupoid $\mathcal{G}/\mathcal{S}$ acts on $\mathfrak{B}$, and that the corresponding action groupoid is exactly the Weyl groupoid of the Cartan pair. Lastly we show that, if the quotient map $\mathcal{G}\to\mathcal{G}/\mathcal{S}$ admits a continuous section, then the Weyl twist is also given by an explicit continuous $2$-cocycle on $\mathcal{G}/\mathcal{S} \ltimes \mathfrak{B}$., 32 pages

The inverse Frobenius-Perron problem (IFPP) is a collective term for a family of problems that requires the construction of an ergodic dynamical system model with prescribed statistical characteristics. Solutions to this problem draw upon concepts from ergodic theory and are scattered throughout the literature across domains such as physics, engineering, biology and economics. This paper presents a survey of the original formulation of the IFPP, wherein the invariant probability density function of the system state is prescribed. The paper also reviews different strategies for solving this problem and demonstrates several of the techniques using examples. The purpose of this survey is to provide a unified source of information on the original formulation of the IFPP and its solutions, thereby improving accessibility to the associated modeling techniques and promoting their practical application. The paper is concluded by discussing possible avenues for future work.

This paper considers a continuous-time quasi birth-death (qbd) process, which informally can be seen as a birth-death process of which the parameters are modulated by an external continuous-time Markov chain. The aim is to numerically approximate the time-dependent distribution of the resulting bivariate Markov process in an accurate and efficient way. An approach based on the Erlangization principle is proposed and formally justified. Its performance is investigated and compared with two existing approaches: one based on numerical evaluation of the matrix exponential underlying the qbd process, and one based on the uniformization technique. It is shown that in many settings the approach based on Erlangization is faster than the other approaches, while still being highly accurate. In the last part of the paper, we demonstrate the use of the developed technique in the context of the evaluation of the likelihood pertaining to a time series, which can then be optimized over its parameters to obtain the maximum likelihood estimator. More specifically, through a series of examples with simulated and real-life data, we show how it can be deployed in model selection problems that involve the choice between a qbd and its non-modulated counterpart.

The present paper aims to find some new midpoint-type inequalities for twice quantum differentiable convex functions. The consequences derived in this paper are unification and generalization of the comparable consequences in the literature on midpoint inequalities. © 2021 Muhammad Aamir Ali et al., published by De Gruyter. National Natural Science Foundation of China, NSFC: 11301127, 11601485, 11626101, 11701176, 11971241, 61673169 Funding information : The work was supported by the Natural Science Foundation of China (Grant Nos. 61673169, 11301127, 11701176, 11626101, 11601485, 11971241). 2-s2.0-85105011594

Travel time estimation & reliability evaluation of any means of transportation in every type of travel mode- land, rail, sea and air has been of immense interest of the researchers; primarily due to growing economic concern in the field of logistics & passenger movement. In situations like quantitative data inaccessibility or data imprecision, fuzzy set based possibilistic approach is recognized as a practical choice in obtaining the reliability estimates. This paper proposes and advocates possibilistic approach for travel time reliability computation of any type transportation vehicle under fuzzy type of data. The proposed approach is a novel way of computing the travel time & obtaining the related reliability value. Initially, the paper proposes the general methodology for travel time reliability evaluation. Individual travel time components of a transportation vehicle are considered as fuzzy; as a result, travel time is modelled as a fuzzy variable. Travel time reliability of a transportation vehicle has been defined with the help of possibilistic measures. The proposed procedure is then demonstrated with an application to marine vessel carrying the bulk. After illustration of the proposed methodology, sensitivity analysis is carried out. The paper ends with the comments on comparative features of the three cases.

The goal of this paper is to explore the interrelated relationships between the quality of corporate governance, Stakeholder’s pressure, and Sustainability Reporting. We claim that sustainable development strategies are the result of the interaction of two variables: the standard of corporate governance and the pressure of stakeholders rather than the outcome of a single variable. The results indicate that the company size and corporate governance rating are positively correlated with sustainability reporting Scores disclosed by the Turkish companies. The analysis of 125 firm-year data suggest that the company provides more SRS if it has a better corporate governance rating; or larger total assets. The paper also reveals that social, environmental and economic indicators, as pillars of sustainable development, are not the result of corporate governance practices or of stakeholder pressure alone, but represent a holistic reflection of the accumulated effects of various factors related to both corporate governance practices and stakeholder theory. This paper extends the work of Taşkirmaz, and Gamze (2017) which examined the relationship between corporate governance and corporate social responsibility. Our results increase understanding of sustainable practices of the circular economy in Turkish industrial companies and indicate future trends for these applications. This research will help managers of manufacturing companies in formulating their plans to maximize the use of available resources and improve efficiency in the context of the circular economy.

The motivation of this paper is to study the uniqueness problems of meromorphic functions concerning differential polynomials that share a small function. The results of the paper improve and generalize the recent results due to Fengrong Zhang and Linlin Wu [13]. We also solve an open problem as posed in the last section of [13].

The paper deals with the existence of solutions for(p,Q)(p,Q)coupled elliptic systems in the Heisenberg group, with critical exponential growth at infinity and singular behavior at the origin. We derive existence of nonnegative solutions with both components nontrivial and different, that is solving an actual system, which does not reduce into an equation. The main features and novelties of the paper are the presence of a general coupled critical exponential term of the Trudinger-Moser type and the fact that the system is set inℍn{{\mathbb{H}}}^{n}.

Scenario optimization is a broad methodology to perform optimization based on empirical knowledge. One collects previous cases, called “scenarios”, for the set-up in which optimization is being performed, and makes a decision that is optimal for the cases that have been collected. For convex optimization, a solid theory has been developed that provides guarantees of performance, and constraint satisfaction, of the scenario solution. In this paper, we open a new direction of investigation: the risk that a performance is not achieved, or that constraints are violated, is studied jointly with the complexity (as precisely defined in the paper) of the solution. It is shown that the joint probability distribution of risk and complexity is concentrated in such a way that the complexity carries fundamental information to tightly judge the risk. This result is obtained without requiring extra knowledge on the underlying optimization problem than that carried by the scenarios; in particular, no extra knowledge on the distribution by which scenarios are generated is assumed, so that the result is broadly applicable. This deep-seated result unveils a fundamental and general structure of data-driven optimization and suggests practical approaches for risk assessment.

In the present paper, we consider the nonparametric regression model with random design based on \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$(\mathbf{X}_\mathrm{t},\mathbf{Y}_\mathrm{t})_{\mathrm{t}\ge 0}$$\end{document}(Xt,Yt)t≥0 a \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathbb {R}^{d}\times \mathbb {R}^{q}$$\end{document}Rd×Rq-valued strictly stationary and ergodic continuous time process, where the regression function is given by \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$m(\mathbf{x},\psi ) = \mathbb {E}(\psi (\mathbf{Y}) \mid \mathbf{X} = \mathbf{x}))$$\end{document}m(x,ψ)=E(ψ(Y)∣X=x)), for a measurable function \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\psi : \mathbb {R}^{q} \rightarrow \mathbb {R}$$\end{document}ψ:Rq→R. We focus on the estimation of the location \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\varvec{\Theta }}$$\end{document}Θ (mode) of a unique maximum of \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$m(\cdot , \psi )$$\end{document}m(·,ψ) by the location \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$ \widehat{{\varvec{\Theta }}}_\mathrm{T}$$\end{document}Θ^T of a maximum of the Nadaraya–Watson kernel estimator \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\widehat{m}_\mathrm{T}(\cdot , \psi )$$\end{document}m^T(·,ψ) for the curve \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$m(\cdot , \psi )$$\end{document}m(·,ψ). Within this context, we obtain the consistency with rate and the asymptotic normality results for \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$ \widehat{{\varvec{\Theta }}}_\mathrm{T}$$\end{document}Θ^T under mild local smoothness assumptions on \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$m(\cdot , \psi )$$\end{document}m(·,ψ) and the design density \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$f(\cdot )$$\end{document}f(·) of \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathbf{X}$$\end{document}X. Beyond ergodicity, any other assumption is imposed on the data. This paper extends the scope of some previous results established under the mixing condition. The usefulness of our results will be illustrated in the construction of confidence regions.

In this paper, we present some fixed point results satisfying generalized contractive condition with new auxiliary function in complete metric spaces. More precisely, the structure of the paper is the following. In the first section, we present some useful notions and results. The main aim of second section is to establish some new fixed point results in complete metric spaces. Finally, in the third section, we show the validity and superiority of our main results by suitable example. Also, as an application of our main result, some interesting corollaries have been included, which make our concepts and results effective. Our main result generalizes some well known existing results in the literature.

Altun, Ishak/0000-0002-7967-0554 WOS:000537813000001 In this paper, we present some fixed point results for multivalued mappings with both closed values and proximinal values on left K-complete quasi metric spaces. We also provide a nontrivial example to illustrate our results. Prince Sultan University [RG-DES-2017-01-17] The authors are thankful to the referees for making valuable suggestions leading to the better presentations of the paper. This work was supported by the Prince Sultan University through the Research Group NAMAM under Grant RG-DES-2017-01-17.

This paper aims to present a new pathwise approximation method, which gives approximate solutions of order $\begin{array}{} \displaystyle \frac{3}{2} \end{array}$ for stochastic differential equations (SDEs) driven by multidimensional Brownian motions. The new method, which assumes the diffusion matrix non-degeneracy, employs the Runge-Kutta method and uses the Itô-Taylor expansion, but the generating of the approximation of the expansion is carried out as a whole rather than individual terms. The new idea we applied in this paper is to replace the iterated stochastic integrals Iα by random variables, so implementing this scheme does not require the computation of the iterated stochastic integrals Iα. Then, using a coupling which can be found by a technique from optimal transport theory would give a good approximation in a mean square. The results of implementing this new scheme by MATLAB confirms the validity of the method.

In this paper, we consider the improved estimation of average production of peppermint at block level of Barabanki district of Uttar Pradesh State (India). We suggest certain estimators for population-mean. Here, population refers to production population as study variable and auxiliary-variable refers to Area of field. We study the sampling properties naming bias and MSE of estimators, which are presently proposed by us in the paper. We compare our proposed estimators with other ones existing in literature. For the support of the theoretical findings, we carry out a numerical study for the natural population on primary data collected from Banikodar Block of Barabanki District situated in Uttar Pradesh State.

In this paper the linear representation of a graph is defined. A linear representation of a graph is a subgroup of $GL(p,\mathbb{R})$, the group of invertible matrices of order $ p $ and real coefficients. It will be demonstrated that every graph admits a linear representation. In this paper, simple and finite graphs will be used, framed in the graphs theory's area

Multiphoton Quantum Key Distribution (QKD) has recently been proposed to exchange the secret keys using the rotational of polarization over a multi-stage protocol. It has the ability to outperform the weaknesses of a single photon QKD by improving the generation of key rate and distance range. This paper investigates the theoretical aspects of multiphoton QKD protocol&rsquo, s performance over free space optic (FSO) networks. The most common setup for quantum communication is the single-beam approach. However, the single-beam setup has limitations in terms of high geometrical loss. In this paper, the symmetry multiple-beam for quantum communication which is called as Multiphoton Quantum Communication-Multiple Beam (MQC-MB) is proposed to transmit the multiphoton from the sender to the receiver in order to minimize the impact of geometrical loss that is faced by the single-beam setup. The analysis was carried out through mathematical analysis by establishing the FSO quantum model with the effects of atmospheric and geometrical loss as well as considering atmospheric turbulence modeled by log-normal distribution. The design criteria of FSO, such as the transmitter, receiver, beam divergence, and diameter of apertures, are analytically investigated. The numerical results demonstrate that the MQC-MB outperforms the single-beam in terms of reducing channel loss by about 8 dB and works well under strong turbulence channel. Furthermore, the MQC-MB reduces the quantum bit error rate (QBER) and improves the secret key rate (SKR) as compared to the single-beam system even though the distance between the sender and receiver increases.

In the first part of the paper, we clarify the connections between several algebraic objects appearing in matroid theory: both partial fields and hyperfields are fuzzy rings, fuzzy rings are tracts, and these relations are compatible with the respective matroid theories. Moreover, fuzzy rings are ordered blueprints and lie in the intersection of tracts with ordered blueprints; we call the objects of this intersection pastures. In the second part, we construct moduli spaces for matroids over pastures. We show that, for any non-empty finite set $E$, the functor taking a pasture $F$ to the set of isomorphism classes of rank-$r$ $F$-matroids on $E$ is representable by an ordered blue scheme $Mat(r,E)$, the moduli space of rank-$r$ matroids on $E$. In the third part, we draw conclusions on matroid theory. A classical rank-$r$ matroid $M$ on $E$ corresponds to a $\mathbb{K}$-valued point of $Mat(r,E)$ where $\mathbb{K}$ is the Krasner hyperfield. Such a point defines a residue pasture $k_M$, which we call the universal pasture of $M$. We show that for every pasture $F$, morphisms $k_M\to F$ are canonically in bijection with $F$-matroid structures on $M$. An analogous weak universal pasture $k_M^w$ classifies weak $F$-matroid structures on $M$. The unit group of $k_M^w$ can be canonically identified with the Tutte group of $M$. We call the sub-pasture $k_M^f$ of $k_M^w$ generated by ``cross-ratios' the foundation of $M$,. It parametrizes rescaling classes of weak $F$-matroid structures on $M$, and its unit group is coincides with the inner Tutte group of $M$. We show that a matroid $M$ is regular if and only if its foundation is the regular partial field, and a non-regular matroid $M$ is binary if and only if its foundation is the field with two elements. This yields a new proof of the fact that a matroid is regular if and only if it is both binary and orientable., 85 pages; some additional material, e.g. a new section 5.6; the terminology has been adapted to the usage in follow-up papers

We study a free boundary problem for a parabolic partial differential equation in which the solution is coupled to the moving boundary through an integral constraint. The problem arises as the hydrodynamic limit of an interacting particle system involving branching Brownian motion with selection, the so-called Brownian bees model which is studied in a companion paper. In this paper we prove existence and uniqueness of the solution to the free boundary problem, and we characterise the behaviour of the solution in the large time limit., Comment: 53 pages

We are interested in the McKay quiver $\Gamma(G)$ and skew group rings $A*G$, where $G$ is a finite subgroup of $\mathrm{GL}(V)$, where $V$ is a finite dimensional vector space over a field $K$, and $A$ is a $K-G$-algebra. These skew group rings appear in Auslander's version of the McKay correspondence. In the first part of this paper we consider complex reflection groups $G \subseteq \mathrm{GL}(V)$ and find a combinatorial method, making use of Young diagrams, to construct the McKay quivers for the groups $G(r,p,n)$. We first look at the case $G(1,1,n)$, which is isomorphic to the symmetric group $S_n$, followed by $G(r,1,n)$ for $r >1$. Then, using Clifford theory, we can determine the McKay quiver for any $G(r,p,n)$ and thus for all finite irreducible complex reflection groups up to finitely many exceptions. In the second part of the paper we consider a more conceptual approach to McKay quivers of arbitrary finite groups: we define the Lusztig algebra $\widetilde A(G)$ of a finite group $G \subseteq \mathrm{GL}(V)$, which is Morita equivalent to the skew group ring $A*G$. This description gives us an embedding of the basic algebra Morita equivalent to $A*G$ into a matrix algebra over $A$., Comment: v2: minor revision, final version to appear in Algebr. Represent. Theory