RECTANGULAR GRID ANTENNAS WITH VARIOUS BOUNDARY SQUARE-RINGS ARRAY

ABSTRACTA TCO/ μc-p-i-n Si:H/AI imager is presented and analyzed. The μc-p-i-n Si:H photodiode acts as a sensing element. Contacts are used as an electrical interface. The image is acquired by a scan-out process. Sampling is performed on a rectangular grid, and the read-out of the photogenerated charges is achieved by measuring simultaneously both transverse photovoltages at the coplanar electrodes. The image representation in gray-tones is obtained by using low level processing algorithms. Basic image processing algorithms are developed for image enhancement and restoration.

Download Full-text

Implementation of Heuristic Technique and Genetic Algorithms in Shikaku Puzzle Problem

Applied Mechanics and Materials ◽

10.4028/www.scientific.net/amm.58-60.1860 ◽

2011 ◽

Vol 58-60 ◽

pp. 1860-1865 ◽

Cited By ~ 1

Author(s):

Samuel Lukas ◽

Arnold Aribowo ◽

Steven Christian Halim

Keyword(s):

Genetic Algorithms ◽

Software Testing ◽

Computer Software ◽

Simple Rule ◽

Rectangular Grid ◽

Heuristic Technique ◽

Logic Puzzle

Shikaku is a logic puzzle published by Nikoli at 2005. Shikaku has a very simple rule. This puzzle is played on a rectangular grid. Some of the squares in the grid are numbered. The main objective is to create partitions inside the grid. Each partition must have exactly one number, and the number represents the area of the partition. Then the partition’s shape must be a rectangular or a square. The aim of this research is discussing how can computer software be able to solve the Shikaku problem by implementing heuristic technique and genetics algorithms. Initially the Shikaku problem is inputted into the system. Firstly, the software will solve the problem by applying heuristics methods with some logic rules. All logic rules are created and implemented into the software so that the software can minimize the partitions possibilities to the problem. If this heuristics method still can not solve the problem then genetic algorithms will be executed to find the solution. This paper elaborates from how the problem be modelled and also be implemented until software testing to ensure that the solver worked as expected. The implementation consists of a virtual puzzle board with three different size, genetic algorithms parameters, and ability to create, save, load, and solve puzzle. Software testing is conducted to find how fast the system can solve the problem.

Download Full-text

A linear-time algorithm for the longest path problem in rectangular grid graphs

Discrete Applied Mathematics ◽

10.1016/j.dam.2011.08.010 ◽

2012 ◽

Vol 160 (3) ◽

pp. 210-217 ◽

Cited By ~ 18

Author(s):

Fatemeh Keshavarz-Kohjerdi ◽

Alireza Bagheri ◽

Asghar Asgharian-Sardroud

Keyword(s):

Linear Time ◽

Time Algorithm ◽

Linear Time Algorithm ◽

Rectangular Grid ◽

Grid Graphs ◽

Longest Path ◽

Longest Path Problem

Download Full-text

PVD-Based Microstructuring Surface Techniques for Tribological Applications

World Tribology Congress III, Volume 2 ◽

10.1115/wtc2005-63303 ◽

2005 ◽

Author(s):

A. Alberdi ◽

M. Marin ◽

I. Etxeberria ◽

G. Alberdi

Keyword(s):

Vapour Deposition ◽

Mineral Oil ◽

Tribological Performance ◽

Physical Vapour Deposition ◽

Rectangular Grid ◽

New Techniques ◽

Surface Textures ◽

Microstructured Surfaces ◽

Set Up ◽

Ball On Disc

Combined techniques of Physical Vapour Deposition (PVD), laser ablation and UV-Photolithography have been set up to produce well defined surface textures able to increase the seizure resistance of high loaded lubricated systems. Using these new techniques, different predefined surface textures, following rectangular grid and zigzag stripped patterns have been generated. The microstructured surfaces developed have been characterised with confocal microscopy, optical and scanning electron microscopy. Ball-on-disc tribological tests under progressively increased load have been carried out using mineral oil as lubricant to determine the influence of surface microtextures on seizure resistance. The influence of shape and size of texture patterns on the tribological performance of the surface have been also studied.

Download Full-text

Chromatic Number for a Generalization of Cartesian Product Graphs

The Electronic Journal of Combinatorics ◽

10.37236/160 ◽

2009 ◽

Vol 16 (1) ◽

Author(s):

Daniel Král' ◽

Douglas B. West

Keyword(s):

Chromatic Number ◽

Maximum Degree ◽

Cartesian Product ◽

Rectangular Grid ◽

Product Graphs ◽

Cartesian Product Graphs

Let ${\cal G}$ be a class of graphs. A $d$-fold grid over ${\cal G}$ is a graph obtained from a $d$-dimensional rectangular grid of vertices by placing a graph from ${\cal G}$ on each of the lines parallel to one of the axes. Thus each vertex belongs to $d$ of these subgraphs. The class of $d$-fold grids over ${\cal G}$ is denoted by ${\cal G}^d$. Let $f({\cal G};d)=\max_{G\in{\cal G}^d}\chi(G)$. If each graph in ${\cal G}$ is $k$-colorable, then $f({\cal G};d)\le k^d$. We show that this bound is best possible by proving that $f({\cal G};d)=k^d$ when ${\cal G}$ is the class of all $k$-colorable graphs. We also show that $f({\cal G};d)\ge{\left\lfloor\sqrt{{d\over 6\log d}}\right\rfloor}$ when ${\cal G}$ is the class of graphs with at most one edge, and $f({\cal G};d)\ge {\left\lfloor{d\over 6\log d}\right\rfloor}$ when ${\cal G}$ is the class of graphs with maximum degree $1$.

Download Full-text