The objectives of this study were to investigate color patterns of shell and mantle edge pigmentation of a Pacific oyster, C. gigas, and to estimate variance components of the two colors. A sample of 240 F0 oysters was collected from six aquaculture farms in Tongyeong, Korea to measure shell color and mantle edge pigmentation. Among the F0s, male and female individuals with black (white) shell ...

The edges of an image define the image boundary. When the image is noisy, it does not become easy to identify the edges. Therefore, a method requests to be developed that can identify edges clearly in a noisy image. Many methods have been proposed earlier using filters, transforms and wavelets with Ant colony optimization (ACO) that detect edges. We here used ACO for edge detection of noisy ima...

Let G=(V(G),E(G)) be a connected simple undirected graph with non empty vertex set V(G) and edge set E(G). For a positive integer k, by an edge irregular total k-labeling we mean a function f : V(G)UE(G) --> {1,2,...,k} such that for each two edges ab and cd, it follows that f(a)+f(ab)+f(b) is different from f(c)+f(cd)+f(d), i.e. every two edges have distinct weights. The minimum k for which G ...

The transition density ρt and pressure Pt at the inner edge separating the liquid core from the solid crust of neutron stars are systematically studied using a modified Gogny (MDI) and 47 popular Skyrme interactions within well established dynamical and thermodynamical methods. First of all, it is shown that the widely used parabolic approximation to the full Equation of State (EOS) of isospin ...

Path sensitivity improves the quality of static analysis by avoiding approximative merging of dataflow facts collected along distinct program paths. Because full path sensitivity has prohibitive cost, it is worthwhile to consider hybrid approaches that provide path sensitivity on selected subsets of paths. In this paper, we consider such a technique based on an edge string, a compact abstractio...

The vertex version of detour index was defined during the works on connected graph in chemistry. The edge versions of detour index have been introduced ecently. In this paper, the explicit relations among edge versions of detour index have been declared and due to these relations, we compute the edge detour indices for some well-known graphs.

The edge version of Szeged index and vertex version of PI index are defined very recently. They are similar to edge-PI and vertex-Szeged indices, respectively. The different versions of Szeged and PIindices are the most important topological indices defined in Chemistry. In this paper, we compute the edge-Szeged and vertex-PIindices of some important classes of benzenoid systems.

we find recursive formulae for the number of perfect matchings in a graph g by splitting g into subgraphs h and q. we use these formulas to count perfect matching of p hypercube qn. we also apply our formulas to prove that the number of perfect matching in an edge-transitive graph is , where denotes the number of perfect matchings in g, is the graph constructed from by deleting edges with an en...

One-dimensional free fermions are studied with emphasis on propagating fronts emerging from a step initial condition. The probability distribution of the number of particles at the edge of the front is determined exactly. It is found that the full counting statistics coincide with the eigenvalue statistics of the edge spectrum of matrices from the Gaussian unitary ensemble. The correspondence e...