in order to study effects of nitrogen fertilization and cultivars on some of traits of different barley an experiment was conducted at isfahan in 2012. the experimental was split plot in a randomized complete block design with three replications. in this experiment, different levels of nitrogen in the main plots included four levels (0, 50, 100 and 150 n kg/ha (urea)) and barley cultivars inclu...

The dictionary matching is a task to find all occurrences of pattern strings in a set D (called a dictionary) on a text string T . The Aho-Corasick-automaton (AC-automaton) which is built on D is a fundamental data structure which enables us to solve the dictionary matching problem in O(d log σ) preprocessing time and O(n log σ + occ) matching time, where d is the total length of the patterns i...

The sorption affinity of eighty-six charged amine structures to phospholipid monolayers (log KIAM) was determined using immobilized artificial membrane high-performance liquid chromatography (IAM-HPLC). The amine compounds covered the most prevalent types of polar groups, widely ranged in structural complexity, and included forty-seven pharmaceuticals, as well as several narcotics and pesticide...

We consider the problem of topology recognition in wireless (radio) networks modeled as undirected graphs. Topology recognition is a fundamental task in which every node of the network has to output a map of the underlying graph i.e., an isomorphic copy of it, and situate itself in this map. In wireless networks, nodes communicate in synchronous rounds. In each round a node can either transmit ...

In TSP with neighborhoods (TSPN) we are given a collection X of k polygonal regions, called neighborhoods, with totally n vertices, and we seek the shortest tour that visits each neighborhood. The Euclidean TSP is a special case of the TSPN problem, so TSPN is also NP-hard. In this paper we present a simple and fast algorithm that, given a start point, computes a TSPN tour of length O(log k) ti...

A k-query locally decodable code (LDC) C : Σn → ΓN encodes each message x into a codeword C(x) such that each symbol of x can be probabilistically recovered by querying only k coordinates of C(x), even after a constant fraction of the coordinates have been corrupted. Yekhanin (2008) constructed a 3-query LDC of subexponential length, N = exp(exp(O(log n/ log log n))), under the assumption that ...

We present a new on-line algorithm for computing the Lempel-Ziv factorization of a string that runs in O(N logN) time and uses only O(N log σ) bits of working space, where N is the length of the string and σ is the size of the alphabet. This is a notable improvement compared to the performance of previous on-line algorithms using the same order of working space but running in either O(N log3 N)...

The dictionary matching is a task to find all occurrences of pattern strings in a set D (called a dictionary) on a text string T . The Aho-Corasick-automaton (AC-automaton) which is built on D is a fundamental data structure which enables us to solve the dictionary matching problem in O(d log σ) preprocessing time and O(n log σ + occ) matching time, where d is the total length of the patterns i...

A widely used morphometric method (Macdonald et al. 1998) to calculate the zero-plane displacement (zd) and aerodynamic roughness length (z0) for momentum is further developed to include vegetation. The adaptation also applies to the Kanda et al. (2013) morphometric method which considers roughness-element height variability. Roughness-element heights (mean, maximum and standard deviation) of b...

We address the point-to-face approximate shortest path problem in R: Given a set of polyhedral obstacles with a total of n vertices, a source point s, an obstacle face f , and a real positive parameter ǫ, compute a path from s to f that avoids the interior of the obstacles and has length at most (1 + ǫ) times the length of the shortest obstacle avoiding path from s to f . We present three appro...