0

flow in the first two-stage of v 94.2 gas turbine is simulated numerically. in this turbine, the second stator is clocked relative to the first stator to different positions. steady-state analysis was carried out by varying the circumferential relative position of the consecutive stator vanes to study the effects of the clocking on turbine performance. a density based compressible inviscid flow...

In this paper we present the first step in a larger series of experiments for the induction of predicate/argument structures. The structures that we are inducing are very similar to the conceptual structures that are used in Frame Semantics (such as FrameNet). Those structures are called messages and they were previously used in the context of a multi-document summarization system of evolving e...

We propose two-dimensional representations for the efficient frontier two different Network DEA (NDEA) models. Both follow a previous study that developed generalization of representation method classic using new form linearization. The graphical allows managers and decision-makers unfamiliar with linear programming to understand results obtained simply clearly. In this study, we can obtain gra...

Aims: Brucellosis is one of the most important public health problems in developing countries, especially in rural areas closely related to animals. This study determines the effectiveness of an educational intervention based on Protection Motivation Theory on promoting preventive behaviors from brucellosis between the farmerchr('39')s ranchers in the comprehensive rural health center. Materia...

a r t i c l e i n f o a b s t r a c t The level-set method is a popular interface tracking method in two-phase flow simulations. An often-cited reason for using it is that the method naturally handles topological changes in the interface, e.g. merging drops, due to the implicit formulation. It is also said that the interface curvature and normal vectors are easily calculated. This last point is...

Logical structures for modeling agents’ reasoning about unawareness are presented where it can hold simultaneously that: (i) agents’ beliefs about whether they are fully aware need not be veracious with partitional information; and (ii) the agent is fully aware if and only if she is aware of a fixed domain of formulae. In light of (ii), all states are deemed “possible”. Semantics operate in two...