Current research was conducted during 2006 and 2007 cropping seasons to assessment the anatomy of the flag leaf and yield of rice in the Khuzestan province according split plot experiment based on randomized complete block design with three replications. Main plot included different sowing dates at three levels (5 May, 26 May and 16 June). Hoveizeh, Hamar (Heat tolerance), Ghermez Anbori, Champ...

Text-based person re-identification (Re-id) is an important task in video surveillance, which consists of retrieving the corresponding person's image given a textual description from large gallery images. It difficult to directly match visual contents with descriptions due modality heterogeneity. On one hand, embedding are not discriminative enough, originates high abstraction descriptions. One...

Adders, as one of the major components of digital computing systems, have a strong influence on their performance. There are various types of adders, each of which uses a different algorithm to do addition with a certain delay. In addition to low computational delay, minimizing power consumption is also a main priority in adder circuit design. In this paper, the proposed adder is divided into s...

A path in an edge-colored graph G is rainbow if no two edges of it are colored the same. The graph G is rainbow-connected if there is a rainbow path between every pair of vertices. If there is a rainbow shortest path between every pair of vertices, the graph G is strongly rainbow-connected. The minimum number of colors needed to make G rainbow-connected is known as the rainbow connection number...

Let (W, C) be an m-cycle system of order n and let Ω ⊂ W , |Ω| = v < n. We say that a path design (Ω,P) of order v and block size s (2 ≤ s ≤ m− 1) is embedded in (W, C) if for every p ∈ P there is an m-cycle c = (a1, a2, . . . , am) ∈ C such that: (1) p = [ak, ak+1, . . . , ak+s−1] for some k ∈ {1, 2, . . . ,m} (i.e. the (s− 1)-path p occurs in the m-cycle c); and (2) ak−1, ak+s ∈ Ω. Note that ...

This paper presents a blocked united algorithm for the allpairs shortest paths (APSP) problem. This algorithm simultaneously computes both the shortest-path distance matrix and the shortest-path construction matrix for a graph. It is designed for a high-speed APSP solution on hybrid CPU-GPU systems. In our implementation, two most compute intensive parts of the algorithm are performed on the GP...