Alternative Methods Used to Assess Potential Embryo-Fetal Developmental Risk of Pharmaceuticals

This study considers the influence of structural change on aggregate labour productivity growth of the Russian economy. The term "structural change" refers to labour reallocation both between industries and between formal and informal segments within an industry. Using Russia KLEMS and official Rosstat data we decompose aggregate labour productivity growth into intra-industry (within) and between industry effects with four alternative methods of the shift-share analysis. All methods provide consistent results and demonstrate that total labour reallocation has been growth enhancing though the informality expansion has had a negative effect. As our study suggests, it is caused by growing variation in productivity levels across industries.

Download Full-text

“WAX Flow Loop” bench-scale plant for testing alternative methods of gas condensate transportation

Automation Telemechanization and Communication in Oil Industry ◽

10.33285/0132-2222-2019-5(550)-16-20 ◽

2019 ◽

pp. 16-20 ◽

Cited By ~ 1

Author(s):

L.N. Bakanovskaya ◽

◽

I.A. Chekardovskaya ◽

T.A. Volokhova ◽

◽

...

Keyword(s):

Gas Condensate ◽

Alternative Methods ◽

Flow Loop ◽

Bench Scale

Download Full-text

Investigating Applicability of the Meshfree Method to the Structural Analysis of Tires

Tire Science and Technology ◽

10.2346/1945-5852-40.2.60 ◽

2012 ◽

Vol 40 (2) ◽

pp. 60-82

Author(s):

Ken Ishihara ◽

Takehiro Noda ◽

Hiroyuki Sakurai

Keyword(s):

Meshfree Method ◽

Alternative Methods ◽

The Finite Element Method ◽

Tire Industry ◽

Academic Communities ◽

The Past ◽

New Methodologies ◽

Tire Modeling ◽

Point Data ◽

Conducting Research

ABSTRACT In contrast to the finite element method (FEM), which is widely used in the tire industry nowadays, some alternative methods have been proposed by academic communities over the past decade or so. The meshfree method is one of those new methodologies. Originally intended to remove the burden of creating the mesh that is inherent in FEM, the meshfree method relies on the point data rather than the mesh, which makes it much easier to discretize the geometry. In addition to those modeling issues, it has been found that the meshfree method has several advantages over FEM in handling geometrical nonlinearities, continuities, and so forth. In accordance with those emerging possibilities, the authors have been conducting research on the matter. This article describes the results of the authors' preliminary research on the applicability of the meshfree method to tire analyses, which include the theoretical outline, the strategy of tire modeling, numerical results, comparisons with results of FEM, and conclusions.

Download Full-text

On Some Properties of Semi-rings

Mechanical Engineering and Computer Science ◽

10.24108/0318.0001379 ◽

2018 ◽

pp. 35-50

Author(s):

A. I. Belousov

Keyword(s):

Linear Equations ◽

Oriented Graph ◽

Theoretical Computer Science ◽

Alternative Methods ◽

Main Role ◽

Cost Matrix ◽

Sequential Elimination ◽

The Matrix ◽

Systems Of Linear Equations ◽

The Cost

The main objective of this paper is to prove a theorem according to which a method of successive elimination of unknowns in the solution of systems of linear equations in the semi-rings with iteration gives the really smallest solution of the system. The proof is based on the graph interpretation of the system and establishes a relationship between the method of sequential elimination of unknowns and the method for calculating a cost matrix of a labeled oriented graph using the method of sequential calculation of cost matrices following the paths of increasing ranks. Along with that, and in terms of preparing for the proof of the main theorem, we consider the following important properties of the closed semi-rings and semi-rings with iteration.We prove the properties of an infinite sum (a supremum of the sequence in natural ordering of an idempotent semi-ring). In particular, the proof of the continuity of the addition operation is much simpler than in the known issues, which is the basis for the well-known algorithm for solving a linear equation in a semi-ring with iteration.Next, we prove a theorem on the closeness of semi-rings with iteration with respect to solutions of the systems of linear equations. We also give a detailed proof of the theorem of the cost matrix of an oriented graph labeled above a semi-ring as an iteration of the matrix of arc labels.The concept of an automaton over a semi-ring is introduced, which, unlike the usual labeled oriented graph, has a distinguished "final" vertex with a zero out-degree.All of the foregoing provides a basis for the proof of the main theorem, in which the concept of an automaton over a semi-ring plays the main role.The article's results are scientifically and methodologically valuable. The proposed proof of the main theorem allows us to relate two alternative methods for calculating the cost matrix of a labeled oriented graph, and the proposed proofs of already known statements can be useful in presenting the elements of the theory of semi-rings that plays an important role in mathematical studies of students majoring in software technologies and theoretical computer science.

Download Full-text