Torpedoes play an irreplaceable role in naval warfare; therefore, it is significant to study the dynamic response of direct navigation torpedoes. In order torpedoes under different Munk moment coefficients, equation established based on momentum theorem and theorem. The linear motion mathematical model obtained. relationship between torpedo coefficient derived. straight-line moments established...

A number of facts about quadratic load ow problems y = f(x) = 0, x 2 R n x , y 2 R n y is proved. The main results are the following 1]. If any point x belongs to a straight line connecting a pair of distinct solutions in the state space R n x , the Newton-Raphson iterative process goes along this line. If a loading process y() reaches a singular point of the problem, the corresponding trajecto...

In this paper we study the problem of computing an upward straight-line embedding of a directed graph G into a point set S, i.e. a planar drawing of G such that each vertex is mapped to a point of S, each edge is drawn as a straight-line segment, and all the edges are oriented according to a common direction. We characterize the family of directed graphs that admit an upward straight-line embed...

In this paper we study the problem of computing an upward straight-line embedding of a directed graph G into a point set S, i.e. a planar drawing of G such that each vertex is mapped to a point of S, each edge is drawn as a straight-line segment, and all the edges are oriented according to a common direction. We characterize the family of directed graphs that admit an upward straight-line embed...

Trees can be conveniently compressed with linear straight-line context-free tree grammars. Such grammars generalize straight-line context-free string grammars which are widely used in the development of algorithms that execute directly on compressed structures (without prior decompression). It is shown that every linear straight-line context-free tree grammar can be transformed in polynomial ti...

A straight-line grid drawing of a planar graph G is a drawing of G on an integer grid such that each vertex is drawn as a grid point and each edge is drawn as a straight-line segment without edge crossings. It is well known that a planar graph of n vertices admits a straight-line grid drawing on a grid of area O(n). A lower bound of Ω(n) on the area-requirement for straight-line grid drawings o...