Search results for: donating - Bridge of Knowledge

Search

Search results for: donating
Przykład wyników znalezionych w innych katalogach

Search results for: donating

  • International Journal of Rotating Machinery

    Journals

    ISSN: 1023-621X , eISSN: 1542-3034

  • Rotating rod and ball

    Full text to download in external service

  • Rotating rod and ball

    We consider a mechanical system consisting of an infinite rod (a straight line) and a ball (a massless point) on the plane. The rod rotates uniformly around one of its points. The ball is reflected elastically when colliding with the rod and moves freely between consecutive hits. A sliding motion along the rod is also allowed. We prove the existence and uniqueness of the motion with a given position and velocity at a certain time...

    Full text to download in external service

  • Super Dominating Sets in Graphs

    Publication

    In this paper some results on the super domination number are obtained. We prove that if T is a tree with at least three vertices, then n2≤γsp(T)≤n−s, where s is the number of support vertices in T and we characterize the extremal trees.

    Full text to download in external service

  • Billiard in a rotating half-plane

    Publication

    The main objective of this research is to study the properties of a billiard system in an unbounded domain with moving boundary. We consider a system consisting of an infinite rod (a straight line) and a ball (a massless point) on the plane. The rod rotates uniformly around one of its points and experiences elastic collisions with the ball. We define a mathematical model for the dynamics of such a system and write down asymptotic...

    Full text available to download

  • Locating and Identifying Ferromagnetic Objects

    Publication

    - Year 2011

    The new non-iterative method of determining the dipole moment and location is presented in this paper. The algorithm of an object's localization and identification was achieved by using numerical calculations and approximation method. The arbitrary shapes of an object were assumed in the identification algorithm - axially symmetric spheroid (a prolate and an oblate). Several examples of localization and identification of an object's...

  • Locating and Identifying Ferromagnetic Objects

    The new non-iterative method of determining the dipole moment and location is presented in this paper. The algorithm of an object's localization and identification was achieved by using numerical calculations and approximation method. The arbitrary shapes of an object were assumed in the identification algorithm - axially symmetric spheroid (a prolate and an oblate). Several examples of localization and identification of an object's...

  • Reconfiguring Minimum Dominating Sets in Trees

    Publication

    We provide tight bounds on the diameter of γ-graphs, which are reconfiguration graphs of the minimum dominating sets of a graph G. In particular, we prove that for any tree T of order n ≥ 3, the diameter of its γ-graph is at most n/2 in the single vertex replacement adjacency model, whereas in the slide adjacency model, it is at most 2(n − 1)/3. Our proof is constructive, leading to a simple linear-time algorithm for determining...

    Full text available to download

  • Hybrid model of moving or rotating continua

    Publication

    - Year 2009

    The paper introduces the method of the model reduction of systems that experience a Coriolis acceleration or gyroscopic effect component. In such causes that corresponding system equations are non-self-adjoined. Modal reduced model is built up for the system without Coriolis or gyroscopic effect terms. These phenomena are next included by application of any lumping technique. Hence, the final reduced model is a hybrid one, obtained...

    Full text to download in external service

  • On proper (1,2)‐dominating sets in graphs

    Publication

    In 2008, Hedetniemi et al. introduced the concept of (1,)-domination and obtained some interesting results for (1,2) -domination. Obviously every (1,1) -dominating set of a graph (known as 2-dominating set) is (1,2) -dominating; to distinguish these concepts, we define a proper (1,2) -dominating set of a graph as follows: a subset is a proper (1,2) -dominating set of a graph if is (1,2) -dominating and it is not a (1,1) -dominating...

    Full text to download in external service