The coordinated growth of epidermal cells in plant leaves creates the characteristic jigsaw puzzle appearance of the pavement cells. Now, Xu et al. (2010) report that AUXIN-BINDING PROTEIN 1 mediates auxin activation of two GTPase pathways that antagonistically control planar morphogenesis of leaf epidermal cells to create this distinctive pattern.

ABSTRACT
 One of the skills 21st century that must be possessed is ability to collaborate or work together. Cooperation means working together achieve same goal. In context learning, cooperation referred as an activity aimed at group between friends who have different opinions, but these differences opinion can put This study aims determine application jigsaw-type cooperative learning and ...

Porcine reproductive and respiratory syndrome virus (PRRSV) is the causative agent of the, probably, most economically important disease for pig industry worldwide. This disease, characterised by producing failure in sows problems growing pigs, appeared late 1980s United States Canada. Since its appearance, strains capable higher mortality rates as well greater severity clinical signs lesions t...

Word Sense Disambiguation (WSD) is traditionally considered an AI-hard problem. A breakthrough in this field would have a significant impact on many relevant webbased applications, such as information retrieval and information extraction. This paper describes JIGSAW, a knowledge-based WSD system that attemps to disambiguate all words in a text by exploiting WordNet1 senses. The main assumption ...

In a recent work, Mossel and Ross considered the shotgun assembly problem for a random jigsaw puzzle. Their model consists of a puzzle an n×n grid, where each vertex is viewed as a center of a piece. They assume that each of the four edges adjacent to a vertex, is assigned one of q colors (corresponding to ”jigs”, or cut shapes) uniformly at random. Mossel and Ross asked: how large should q = q...

The jigsaw puzzle is a well known problem, which many encounter during childhood. Given a set of parts, one needs to reconstruct the original image. This problem is known to be NP-complete. In this paper I describe a greedy solver with several improvements. Before discussing the general idea and improvements, I will discuss some important known metrics that will help us clarify the solver algor...

We speed up the screening of a computer image compressed as an iterated function system (IFS) of affine transformations w1, . . ., wN . The idea is to avoid applying a given map to a given point if nothing new would be obtained. Let w(x, y) be the result of applying transformation w to pixel coordinates (x, y) then rounding to the nearest integer pair, say (u, v). Then the w-jigsaw pieces w−1(u...

A random jigsaw puzzle is constructed by arranging n2 square pieces into an n× n grid and assigning to each edge of a piece one of q available colours uniformly at random, with the restriction that touching edges receive the same colour. We show that if q = o(n) then with high probability such a puzzle does not have a unique solution, while if q ≥ n1+ε for any constant ε > 0 then the solution i...