In this paper we prove global convergence for asynchronous parallel pattern search. In standard pattern search, decisions regarding the update of the iterate and the step-length control parameter are synchronized implicitly across all search directions. We lose this feature in asynchronous parallel pattern search since the search along each direction proceeds semiautonomously. By bounding the v...

In this paper, we propose a new hybrid Cross Hexagon Diamond Search algorithm (CHDS) using crossshaped search pattern as the initial step and asymmetric hexagon-shaped patterns and small diamond pattern as the subsequent steps for fast block motion estimation. In block motion estimation, search pattern with different shape or size and the center biased motion vector distribution characteristics...

Product lines can improve the efficiency of software development. Product lines offer reference architecture for the development of similar products. This architecture is developed in an evolutionary process while using existing systems and reusable components. The start of the development of product lines very often is based on the reengineering and generalization of several similar existing a...

On the price of complexity, the new video compression standard H.264 is more effective than MPEG-4 in compression. Aimed at the motion estimation problem in search rate, a directional search pattern and an improved cross diamond search algorithm which adopts many technologies including prediction of initial search point, suitable search pattern choosing and auxiliary search points are proposed ...

Nearest neighbour search is a simple technique widely used in Pattern Recognition tasks. When the dataset is large and/or the dissimilarity computation is very time consuming the brute force approach is not practical. In such cases, some properties of the dissimilarity measure can be exploited in order to speed up the search. In particular, the metric properties of some dissimilarity measures h...

We give a pattern search method for nonlinearly constrained optimization that is an adaption of a bound constrained augmented Lagrangian method first proposed by Conn, Gould, and Toint [SIAM J. Numer. Anal., 28 (1991), pp. 545–572]. In the pattern search adaptation, we solve the bound constrained subproblem approximately using a pattern search method. The stopping criterion proposed by Conn, Go...

RDF data has become a vital source of information for many applications. In this thesis, we present a set of models and algorithms to effectively search large RDF knowledge bases. These knowledge bases contain a large set of subjectpredicate-object (SPO) triples where subjects and objects are entities and predicates express relationships between them. Searching such knowledge bases can be done ...

variables may bedevil pattern search methods if there is a high degree of nonlinearity. On the other hand, pattern search methods have been applied successfully to problems with as many as 256 variables. Mead simplex method to a non-stationary point. Direct search methods for uncon-strained optimization on either sequential or parallel machines. Figure 5: A selection of admissible patterns and ...

the east mediterranean region suffers from high levels of air pollution which has a negative impact on pregnancy outcomes. this work systematically reviews the epidemiological evidence on maternal exposure to air pollution and adverse pregnancy outcomes in the region. relevant papers and reports published between 2000 and 2014 were searched. combinations of search terms including countries, exp...

background: dietary approaches to stop hypertension (dash) eating plan is a healthy dietary pattern. our object is to review surveys in the field of major components of dash diet and different kinds of cancers. materials and methods: our search result from pubmed search engine recruited to find related articles. results: adherence to the dash diet components was significantly related to lower p...