In this paper we find the maximum number of pairwise edge-disjoint mcycles which exist in a complete graph with n vertices, for all values of n and m with 3 ≤ m ≤ n.

In 1973 Bermond, Germa, Heydemann and Sotteau conjectured that if n divides ( n k ) , then the complete k-uniform hypergraph on n vertices has a decomposition into Hamilton Berge cycles. Here a Berge cycle consists of an alternating sequence v1, e1, v2, . . . , vn, en of distinct vertices vi and distinct edges ei so that each ei contains vi and vi+1. So the divisibility condition is clearly nec...

The design of a globally convergent position observer for feature points from visual information is challenging problem, especially the case with only inertial measurements and without assumptions uniform observability, which remained open long time. We give solution to problem in this paper assuming that bearing point, biased linear acceleration rotational velocity robot – all body-fixed frame...

An electrically neutral current-loop, with magnetic dipole m0, that is at rest in a static, uniform electric field E0 experiences no force or torque. However, if that system is observed in the lab frame where the loop has velocity v parallel to E0, and v c, where c is the speed of light, then there appears to be an electric dipole moment, p = v/c×m0 associated with the loop (in Gaussian units)....

Let G be a graph and H a subgraph of G. A D(G,H, λ) design is a collection D of subgraphs of G each isomorphic to H so that every 2-path (path of length 2) in G lies in exactly λ subgraphs in D. The problem of constructing D(Kn, Cn, 1) designs is the so-called Dudeney’s round table problem. We denote by Ck a cycle on k vertices and by Pk a path on k vertices. In this paper, we construct D(Kn,n,...

We study the minimum number of complete r-partite r-uniform hypergraphs needed to partition the edges of the complete r-uniform hypergraph on n vertices and we improve previous results of Alon.

Recently, the rapid development of inexpensive RGB-D sensor, like Microsoft Kinect, provides adequate information for human action recognition. In this paper, a recognition algorithm is presented in which feature representation is generated by concatenating spatial features from human contour of key frames and temporal features from time difference information of a sequence. Then, an improved m...

well-known seismic design codes have offered an alternative equivalent static procedure for practical purposes instead of verifying design trials with complicated step-y-step dynamic analyses. such a pattern of base-shear distribution over the building height will enforce its special stiffness and strength distribution which is not necessarily best suited for seismic design. the present study, ...

Temporal Compression Instead of storing complete frames, temporal (interframe) compression stores only what has changed from one frame to the next, which dramatically reduces the amount of data that needs to be stored while still achieving high-quality images. Video is stored in three types of frames: a standalone I-frame that contains a complete image, and then predictive P-frames and bipredic...