Sentence examples for a general refinement of from inspiring English sources

In the Augustan Age (43 bc to ad 18), the influence of the neōteroi can be discerned particularly in the pastoral idylls of Virgil and the elegies of Sextus Propertius and Tibullus and in a general refinement of works of the didactic-patriotic tradition.

In this paper, in the form of (1.2) and (1.3) we shall show a general refinement of the Becker-Stark inequalities as follows.

In this paper, we establish a general refinement of the Becker-Stark inequalities by using the power series expansion of the tangent function via Bernoulli numbers and the property of a function involving Riemann's zeta one.

Zhu and Hua [7] established a general refinement of the Becker-Stark inequalities by using the power series expansion of the tangent function via Bernoulli numbers and the property of a function involving Riemann's zeta one.

Later, Zhu and Hua [6] gave a general refinement of the Becker-Stark inequalities (1.4) by the power series expansion of the tangent function in terms of the Bernoulli numbers.

The EMVC method can also be used for the general refinement of gene set collections, either to create versions of a gene set collection that are customized for a specific domain or to identify and entirely remove annotations that exhibit poor alignment with a broad selection of genomic datasets.

The result of Theorem 4.1 prompts us to consider the following general refinements of the Erdös-Mordell inequality in the form: sum R_{1}gefrac{2sum k_{1}(r_{1}+R_{1})}{sum k_{1}}ge2sum r_{1}, (5.1) where (k_{1}), (k_{2}), (k_{3}) are positive real numbers.

Exploring the stabilizability concept, recently introduced by Raïssouli, we give an approach for obtaining refinements of mean-inequalities in a general point of view.

An important question arises from this latter situation: Under what general conditions, (3.16) is a refinement of (3.15), that is, m 3 < R ( m 1, m 3, m 2 ) and R ( m 1, m 4, m 2 ) < m 4 ?

The concept of target perceivability is a part of the general methodology of Integrated Probabilistic Data Association IPDAandand represents a refinement of the concept of track existence (which does not address the possibility that a target cannot be detected) and of target observability (which presumes the presence of a target) [13 15].

The general problem we address is the following: Given a non-binary gene tree G and a species tree S, find a refinement of G containing the minimum number of NADs with respect to S. Such a refinement of G is called a minimum refinement of G w.r.t. S. Hence, we aim at refining each non-binary node of G.