Spontaneous swimming behaviors of koi carp Cyprinus carpio koi were recorded using a video tracking system. Routine single-beat turns were selected from the recorded image sequences for kinematic and hydrodynamic analysis. As with C-starts, the turns can be divided into two stages (stage 1 and stage 2), based on kinematics. Stage 1 involves a bend to one side forming a C-shaped curve in the bod...

This is a sequel to an accepted talk of WAW 2011, where we introduced a set of generalized Laplacians of hypergraphs through the high-ordered random walks. In that paper, we proved the eigenvalues of these Laplacians can effectively control the mixing rate of highordered random walks, the generalized distances/diameters, and the edge expansions. In this talk, we will give a preliminary report o...

We introduce a novel type of surface waves that form at the edge of guiding structures consisting of several concentric rings. Such surface waves rotate steadily upon propagation and, in contrast with nonrotating waves, for high rotation frequencies they do not exhibit power thresholds for their existence. There exists an upper limit for the surface wave rotation frequency, which depends on the...

In our model, the immobile frozen particles are used to construct the spherical surface template of the NP. For a specific NP with determined radius, we first use the geodesic subdivision method to get all the vertex positions. This method is a repeated subdivision process of triangles. Starting with an icosahedron inscribed in the sphere, we first find the midpoint of each edge, and then push ...

let $g$ be a simple graph of order $n$ and size $m$.the edge covering of $g$ is a set of edges such that every vertex of $g$ is incident to at least one edge of the set. the edge cover polynomial of $g$ is the polynomial$e(g,x)=sum_{i=rho(g)}^{m} e(g,i) x^{i}$,where $e(g,i)$ is the number of edge coverings of $g$ of size $i$, and$rho(g)$ is the edge covering number of $g$. in this paper we stud...

let g=(v,e) be a simple graph. an edge labeling f:e to {0,1} induces a vertex labeling f^+:v to z_2 defined by $f^+(v)equiv sumlimits_{uvin e} f(uv)pmod{2}$ for each $v in v$, where z_2={0,1} is the additive group of order 2. for $iin{0,1}$, let e_f(i)=|f^{-1}(i)| and v_f(i)=|(f^+)^{-1}(i)|. a labeling f is called edge-friendly if $|e_f(1)-e_f(0)|le 1$. i_f(g)=v_f(1)-v_f(0) is called the edge-f...

We consider weighted graphs, where the edge weights are positive definite matrices. The eigenvalues of a graph are the eigenvalues of its adjacency matrix. We obtain another upper bound which is sharp on the spectral radius of the adjacency matrix and compare with some known upper bounds with the help of some examples of graphs. We also characterize graphs for which the bound is attained.

Abstract. Using high-accuracy rotation curves of spiral galaxies, we derive distributions of the surface mass density. Comparing with the luminosity profiles, we show that the dark mass in disk and bulge distributions follows those of luminous (stellar) mass, while luminous mass in halos does not follow dark mass. The darkmass fraction (DMF) increases with the radius in the disk, and rapidly to...

We use observed rotation velocity-luminosity (VL) and size-luminosity (RL) relations to single out a specific scenario for disk galaxy formation in the ΛCDM cosmology. Our model involves four independent log-normal random variables: dark-halo concentration c, disk spin λgal, disk mass fraction mgal, and stellar mass-to-light ratio ΥI . A simultaneous match of the VL and RL zero points with adia...