Photonic devices can be developed, and their working principle can be understood only by considering the phenomena taking place at the nanoscale level. Optical properties of plasmonic structures depend on their geometric parameters and are sensitive to them. Recently, many advanced methods for the preparation of nanostructures have been proposed; however still, the geometric parameters are inac...

Character recognition in video is a challenging task because low resolution and complex background of video cause disconnections, loss of information, loss of shapes of the characters etc. In this paper, we introduce a novel Ring Radius Transform (RRT) and the concept of medial pixels on characters with broken contours in the edge domain for reconstruction. For each pixel, the RRT assigns a val...

We study the problem of arranging a set of n disks with prescribed radii on n rays emanating from the origin such that two neighboring rays are separated by an angle of 2π/n. The center of the disks have to lie on the rays, and no two disk centers are allowed to lie on the same ray. We require that the disks have disjoint interiors, and that for every ray the segment between the origin and the ...

What is the length of the shortest sequence S of reals so that the set of consecutive n-words in S form a covering code for permutations on {1, 2, . . . , n} of radius R ? (The distance between two n-words is the number of transpositions needed to have the same order type.) The above problem can be viewed as a special case of finding a De Bruijn covering code for a rooted hypergraph. Each edge ...

In this paper, we define and obtain several properties of the (adjacency) energy a hypergraph. particular, bounds for are obtained as functions structural spectral parameters, such Zagreb index radius. We also study how hypergraph varies when vertex/edge is removed or an edge divided. addition, solve extremal problem class hyperstars, show that never odd number.

The passive biomechanical behavior of blood vessels is generally modeled by a parallel arrangement of elastin and collagen, with collagen recruitment depending on vessel strain. We experimentally determined the collagen recruitment distribution using confocal microscopy. Digital images from sections of rabbit carotid artery under increasing circumferential stretch ratio were acquired. The strai...

We provide a lower bound for the spectral radius of the universal cover of irregular graphs in the presence of symmetric edge weights. We use this bound to derive an Alon-Boppana type bound for the second eigenvalue of the normalized Laplacian.

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 a lower bound and an upper bound on the spectral radius of the adjacency matrix of weighted graphs and characterize graphs for which the bounds are attained. 2011 Elsevier Inc. All rights reserved.

a‎s we know, developing mathematical models and numerical procedures that would appropriately treat and solve systems of linear equations where some of the system's parameters are proposed as fuzzy numbers is very important in fuzzy set theory. for this reason, many researchers have used various numerical methods to solve fuzzy linear systems. in this paper, we define the concepts of midpoint a...

For two vertices u and v in a graph G = (V, E), the detour distance D(u, v) is the length of a longest u–v path in G. A u–v path of length D(u, v) is called a u–v detour. A set S ⊆ V is called an edge detour set if every edge in G lies on a detour joining a pair of vertices of S. The edge detour number dn1(G) of G is the minimum order of its edge detour sets and any edge detour set of order dn1...