In this paper we present space-query trade-offs for external memory data structures that answer shortest path queries on planar directed graphs. For any S = Ω(N ) and S = O(N/B), our main result is a family of structures that use S space and answer queries in O( 2 SB ) I/Os, thus obtaining optimal space-query product O(N/B). An S space structure can be constructed in O( √ S · sort(N)) I/Os, whe...

In this paper, we propose a new fast search algorithm for block motion estimation (BME). This algorithm employs two techniques: the center-biased technique and the two-path technique. The former is applied to stop the search procedure if the block currently being processed is stationary. Otherwise, the proposed algorithm conducts the two-path search to perform BME. The search result of the trad...

We live in a world where our personal data are both valuable and vulnerable to misappropriation through exploitation of security vulnerabilities in online services. For instance, Dropbox, a popular cloud storage tool, has certain security flaws that can be exploited to compromise a users data, one of which being that a user’s access pattern is unprotected. We have thus created an implementation...

in order to investigate genetic correlation and path analysis between grain yield and yield components, fifteen early maturing hybrids of grain corn (zea. mays) using a randomized complete block design with 4 replications were evaluated in khoramabad agricultural research center, iran. the data were collected and analyzed for ear emergence date, anthesis date, maturity date, plant height, ear h...

OBJECTIVE To quantitatively evaluate the effect of motor nerve branch block and neurotomy of the soleus nerve on triceps surae spasticity, reviewing 2 cases. METHODS Beside clinical assessment, we carried out a quantitative measurement of the stiffness of the ankle flexor muscles. The path length of the phase diagram between elastic and viscous stiffness quantifies the reflex response to move...

The longest path problem is to find a longest path in a given graph. While the graph classes in which the Hamiltonian path problem can be solved efficiently are widely investigated, few graph classes are known to be solved efficiently for the longest path problem. For a tree, a simple linear time algorithm for the longest path problem is known. We first generalize the algorithm, and show that t...

2 ADD-Based Timing Analysis The problem of calculatin& the timing r8poose of a combin... tionallogic block can be formulated as follows: GiYen a combinational block, find the set of input vectors for which the length of the critical path, under a .pecified mode of operation and a gate delay model, is maximum; the length of the critical path gi~ the overall block delay. Given a gate g of the net...

to determine the correlation between important traits with yield in barley through path analysis for selecting high yielding lines, three new lines of barley resistant to cold (c-81-13, c-81-11, c-81 -15), compared with valfajr (as control) were studied. this experiment was conducted in a randomized complete block design with three replications, during 2008 to 2010 in boyer ahmad city.a number ...

latched before the output signals in the bundle are stable. The algorithm used to detect delay faults in the processing logic of the ASC is similar to that exploited in delay testing of combinational circuits [15]. Basically, the pair of test patterns < , > must be applied to the inputs of the combinational circuit to detect its delay path fault. The pair < , > is made up of < @ , @ >, where an...

In this paper, the new approach for identification of synchronous generator using nonlinear feedback model and with piecewise linear map is investigated. In this method, synchronous generator model consists of a linear-dynamic block in forward path and a nonlinear-static block in feedback path. The identification method simultaneously approximates these blocks without requiring prior assumption...