let $g$ be a finite group with the identity $e$‎. ‎the subgroup intersection graph $gamma_{si}(g)$ of $g$ is the graph with vertex set $v(gamma_{si}(g)) = g-e$ and two distinct vertices $x$ and $y$ are adjacent in $gamma_{si}(g)$ if and only if $|leftlangle xrightrangle capleftlangle yrightrangle|>1$‎, ‎where $leftlangle xrightrangle $ is the cyclic subgroup of $g$ generated by $xin g$‎. ‎in th...

A two-dimensional linear wave-body interaction problem can be solved using a desingularized integral method by placing free surface Rankine sources over calm water surface and satisfying boundary conditions at prescribed collocation points on the calm water surface. A new free-surface Rankine source distribution scheme, determined by the intersection points of free surface and body surface, is ...

We present to generate a bird’s-eye view of road traffic scene by integrating multiple images from in-vehicle cameras for supporting traffic safety. There are many blind spots at an intersection. Such blind spots will cause accidents and traffic jams. If it is possible to obtain views from multiple vehicles coming into one intersection from different directions, we can generate a bird's-eye vie...

A familiär relation links the densities that result for the intersection of a convex body and straight lines under uniform isotropic randomness with those that result under weighted randomness. An extension of this relation to the intersection of more general domains is utilized to obtain the variance of the n-dimensional measure of the intersection of two bodies under uniform isotropic randomn...

‎Let $R$ be a commutative ring with non-zero identity. ‎We describe all $C_3$‎- ‎and $C_4$-free intersection graph of non-trivial ideals of $R$ as well as $C_n$-free intersection graph when $R$ is a reduced ring. ‎Also, ‎we shall describe all complete, ‎regular and $n$-claw-free intersection graphs. ‎Finally, ‎we shall prove that almost all Artin rings $R$ have Hamiltonian intersection graphs. ...

PM**£(*') f° r h£rS$2 where h ( < ^ ) is the point nearest to s* at which €(li)«<r(4j). If $(52)==<r(52), then let h~$%. For r<t2 let p(r) =p(^)+log log log fc — log log log r for Ui^r^h where #1 (<*2) is the point of intersection of y—p with y = p (£2) + log log log fe—log log log r. Let p(r)~p for r i^ rgwi . It is always possible to choose H SO large that r\<ti\. We repeat the procedure and ...

Article history: Received 14 November 2009 Received in revised form 29 April 2010 Accepted 6 May 2010

Given a simple generalized polygonA of line segments and arcs that is free to move and rotate and an oriented monotone chainB composed of smooth parametric curved edges, the positions and orientations forA to gouge-freely contactB (i.e., the contact configurations) is a C0 continuous surface in a three dimensional space R3. Past results either limitB to be polygonal or depend on the very compli...

Depthmap fusion is the problem of computing dense 3D reconstructions from a set of depthmaps. Whereas this problem has received a lot of attention for purely rigid scenes, there is remarkably little prior work for dense reconstructions of scenes consisting of several moving rigid bodies or parts. This paper therefore explores this multi-body depthmap fusion problem. A first observation in the m...