Suppose $G$ is a split connected‎ ‎reductive orthogonal or symplectic group over an infinite field‎ ‎$F,$ $P=MN$ is a maximal parabolic subgroup of $G,$ $frak{n}$ is‎ ‎the Lie algebra of the unipotent radical $N.$ Under the adjoint‎ ‎action of its stabilizer in $M,$ every maximal prehomogeneous‎ ‎subspaces of $frak{n}$ is determined‎.

Kinematic redundancy of a pair of manipulator-task can be classified into intrinsic and functional redundancies. This paper compares two different approaches to solve the inverse kinematics of functionally-redundant serial manipulators. First, the augmented approach add a virtual joint to the manipulator in order to render the Jacobian matrice underdetermined and project a secondary task onto t...

We derive an explicit lower bound on the capacity of the discrete amplitude–constrained Gaussian channel by proving the existence of tight frames that permit redundant vector representations with small coefficients. Our method encodes the information in subspaces that are optimal in terms of the power to amplitude ratio. In a recent paper, Lyubarskii and Vershynin discuss how the work of Kashin...

An experimental study is conducted on three ½ scales, single-story, single-bay, frame specimens. The first specimen was a reinforced concrete frame with solid-brick infill. The second specimen was a reinforced concrete frame with hollow clay perforated-brick infill. The last specimen was a reinforced concrete frame without any infill. These three specimens were tested by pseudostatic method. Di...

Abstract: – In this paper a new rotor field orientation control of six phase induction machine is proposed. The machine has two three phase windings spatially shifted by 30 electrical degrees. The dynamic model of the machine is based on the three two dimensional orthogonal subspaces. The proposed method uses a simple estimator for identifying rotor flux and its orientation. To eliminate the ex...

A circuit complexity of a graph is the minimum number of union and intersection operations needed to obtain the whole set of its edges starting from stars. Our main motivation to study this measure of graphs is that it is related to the circuit complexity of boolean functions. We prove some lower bounds to the circuit complexity of explicitly given graphs. In particular, we use the graph theore...

In this paper, we propose video classification using linear manifolds (affine subspaces). In our method, we represent videos belonging to a same class by several linear manifolds using k-varieties clustering. When a test video is given, each frame of it votes for the class to which its nearest linear manifold belongs. According to this voting, the test video is classified into the class that ac...

in this paper, we define and study the notion of the real-valued functions on a frame $l$. we show that $f(l) $, consisting of all frame homomorphisms from the power set of $mathbb{r}$ to a frame $ l$, is an $f$-ring, as a generalization of all functions from a set $x$ into $mathbb r$. also, we show that $f(l) $ is isomorphic to a sub-$f$-ring of $mathcal{r}(l)$, the ring of real-valued continu...

Abstract G-frames are generalized frames which include ordinary frames, bounded invertible linear operators, as well as many recent generalizations of frames, e.g., bounded quasi-projectors and frames of subspaces. G-frames are natural generalizations of frames and provide more choices on analyzing functions from frame expansion coefficients. We give characterizations of g-frames and prove that...