We introduce and study balanced online graph avoidance games on the random graph process. The game is played by a player we call Painter. Edges of the complete graph with n vertices are revealed two at a time in a random order. In each move, Painter immediately and irrevocably decides on a balanced coloring of the new edge pair: either the first edge is colored red and the second one blue or vi...

Several organic solvents (OSs) are potent carcinogens among population at risk. Their genotoxicity have important implications for cancer production. Genotoxicity could be related to lipid peroxidation with decrease of endogenous body antioxidants. This work included 27 car spray painters exposed to a mixture of mainly aromatic OSs and a comparable group of 27 males. For both groups, chromosoma...

Our laboratory is constructing a painter robot. The first step in painting is to extract desirable feature lines such as silhouette and boundary lines, which represent the object to be drawn. For this purpose, this thesis proposes a system that extracts feature lines from a textured 3D polygonal model. First, the system builds a textured 3D model of the target object from multiple cameras using...

Among various traditional art forms, brush stroke drawing is one of the widely used styles in modern computer graphic tools such as GIMP, Photoshop and Painter. In this paper, we develop an AI-aided art authoring (A4) system of nonphotorealistic rendering that allows users to automatically generate brush stroke paintings in a specific artist’s style. Within the reinforcement learning framework ...

This research was conducted in the west forest of Guilan, northern Iran. Data from various harvesting methods for 20 years were collected. Results showed that, productivity rate of round wood, pulp wood and fuel wood has had an upward trend, while rate of traditional products (lumber, sawn wood, charcoal, etc.) has had a downward trend. Production cost has been investigated in this research. Th...

Given a graph H and an integer r ≥ 2, let G → (H, r) denote the Ramsey property of a graph G, that is, every r-coloring of the edges of G results in a monochromatic copy of H. Further, let m(G) = maxF⊆G |E(F )|/|V (F )| and define the Ramsey density minf (H, r) as the infimum of m(G) over all graphs G such that G → (H, r). In the first part of this paper we show that when H is a complete graph ...

Article history: Received 28 January 2015 Accepted 25 February 2015 Available online 6 March 2015