We investigate complexity of the uniform membership problem for hyperedge replacement grammars in comparison with other mildly context-sensitive grammar formalisms. It turns out that the complexity of the problem cons...
详细信息
For the application of economic and mathematical methods in practical activities in modern conditions, material, scientific and personnel prerequisites have been created. Their use makes it possible to carry out compl...
详细信息
For the application of economic and mathematical methods in practical activities in modern conditions, material, scientific and personnel prerequisites have been created. Their use makes it possible to carry out compl...
ISBN:
(纸本)9798400709036
For the application of economic and mathematical methods in practical activities in modern conditions, material, scientific and personnel prerequisites have been created. Their use makes it possible to carry out complex and very time-consuming calculations that were previously impossible. The article considers economic and mathematical methods, features of their application in agricultural organizations. Taking into account the production and technological parameters, the conditions of a particular agricultural organization, a model was developed and a methodology for solving the problem of optimizing the feed ration of farm animals was developed, including four groups of restrictions: on the balance of nutrients; by dry matter content; by the content of trace elements and vitamins; by the specific weight of food groups in the diet. The target function is the minimum cost of the daily ration. The introduction of an optimal diet will significantly reduce the cost of feed, and, consequently, the cost of production. We also algorithmize the issue of feed ration for livestock using economic mathematical modeling. Let's write the program code using the Python programming language using the built-in algorithm.
The use of direct simulation Monte Carlo (DSMC) codes in the analysis of low-density flow or, more generally, flows containing regions of strong translational non-equilibrium, is justified by briefly reviewing the lim...
详细信息
The use of direct simulation Monte Carlo (DSMC) codes in the analysis of low-density flow or, more generally, flows containing regions of strong translational non-equilibrium, is justified by briefly reviewing the limitations of codes based upon a macroscopic approach. The general structure of a DSMC algorithm is described briefly, and a class of algorithms used within DSMC codes for the simulation of molecular interactions is discussed in greater detail. Basic principles of vector processing are then reviewed, and it is finally shown that the simulation of molecular interactions, which was previously thought to be non-vectorizable, can on the contrary be vectorized with high efficiency.
We consider the image of the operator, inducing the determinantal point process with the confluent hypergeometric kernel. The space is described as the image of L2[0, 1] under a unitary transform, which generalizes th...
详细信息
We consider a class of robust optimization problems that we call "robust-to-dynamics optimization" (RDO). The input to an RDO problem is twofold: (i) a mathematical program (e.g., an LP, SDP, IP, etc.), and ...
详细信息
ISBN:
(纸本)9781479978878
We consider a class of robust optimization problems that we call "robust-to-dynamics optimization" (RDO). The input to an RDO problem is twofold: (i) a mathematical program (e.g., an LP, SDP, IP, etc.), and (ii) a dynamical system (e.g., a linear, nonlinear, discrete, or continuous dynamics). The objective is to maximize over the set of initial conditions that forever remain feasible under the dynamics. The focus of this paper is on the case where the optimization problem is a linear program and the dynamics are linear. We establish some structural properties of the feasible set and prove that if the linear system is asymptotically stable, then the RDO problem can be solved in polynomial time. We also outline a semidefinite programming based algorithm for providing upper bounds on robust-to-dynamics linear programs.
In normal rabbits and mice, one i.v. injection of scarlet fever toxin (ET) (30,000 STD [skin test doses]/kg of rabbit wt or 20 g mouse) elicited a similar biphasic change in C clearance rate (early depression followed...
In normal rabbits and mice, one i.v. injection of scarlet fever toxin (ET) (30,000 STD [skin test doses]/kg of rabbit wt or 20 g mouse) elicited a similar biphasic change in C clearance rate (early depression followed by a stimulating phase) as described for gram-negative endotoxins. Prolonged depression without a subsequent stimulation phase was obtained in mice by raising the ET dose. Pyrogenic tolerance to ET is not accompanied by accelerated C clearance and is not impaired by RES blockade. A possible mechanism of ET tolerance is suggested.
Let σ={σi | i ∈ I} be some partition of the set of all primes P. A set H of subgroups of G is said to be a complete Hall σ-set of G if every member ≠ 1 of H is a Hall σi-subgroup of G, for some i ∈ I, and H con...
详细信息
Let σ={σi | i ∈ I} be some partition of the set of all primes P. A set H of subgroups of G is said to be a complete Hall σ-set of G if every member ≠ 1 of H is a Hall σi-subgroup of G, for some i ∈ I, and H contains exactly one Hall σi-subgroup of G for every σi ∈σ(G). A subgroup H of G is said to be:σ-permutable or σ-quasinormal in G if G possesses a complete Hall σ-set H such that HAx= AxH for all A ∈ H and x ∈ G:σ-subnormal in G if there is a subgroup chain A = A0≤A1≤···≤ At = G such that either Ai-1■Ai or Ai/(Ai-1)Ai is a finite σi-group for some σi ∈σ for all i = 1,..., *** Mn < Mn-1 <···< M1 < M0 = G, where Mi is a maximal subgroup of Mi-1, i = 1, 2,..., n, then Mn is said to be an n-maximal subgroup of G. If each n-maximal subgroup of G is σ-subnormal(σ-quasinormal,respectively) in G but, in the case n > 1, some(n-1)-maximal subgroup is not σ-subnormal(not σ-quasinormal,respectively) in G, we write mσ(G)= n(mσq(G)= n, respectively).In this paper, we show that the parameters mσ(G) and mσq(G) make possible to bound the σ-nilpotent length lσ(G)(see below the definitions of the terms employed), the rank r(G) and the number |π(G)| of all distinct primes dividing the order |G| of a finite soluble group G. We also give the conditions under which a finite group is σ-soluble or σ-nilpotent, and describe the structure of a finite soluble group G in the case when mσ(G)=|π(G)|. Some known results are generalized.
作者：
Cechlarova, KatarinaKatarína Cechlárová () graduated in mathematics from P. J. Šafárik University
Košice in 1984. She has taught in the Department of Geometry and Algebra (now Institute of Mathematics) at the University since graduation. Her teaching courses have included: Linear Programming Nonlinear Programming Integer Programming Game Theory Mathematical Economics Control Theory. Her research interests include topics in mathematical modelling combinatorial optimization and teaching mathematics.
mathematical optimization problems are not typical in the classical curriculum of mathematics. In this paper we show how several generalizations of an easy problem on optimal transportation were solved by gifted secon...
详细信息
mathematical optimization problems are not typical in the classical curriculum of mathematics. In this paper we show how several generalizations of an easy problem on optimal transportation were solved by gifted secondary school pupils in a correspondence mathematical seminar, how they can be used in university courses of linear programming and what the remaining open questions are.
暂无评论