This report describes the robot, Curious George, that took part in, and won, the robot league of the 2007 Semantic Robot Vision Challenge (SRVC), held at the AAAI’07 conference in Vancouver, Canada. We describe the robot hardware, the algorithms used during each of the three competition phases, as well as the results obtained by the system during the competition.

In a recent paper [2], G. R. Blakley raised a question about the decomposition of a ^-valent starlike function into the product of two ^-valent starlike functions. It is the purpose of this note to prove the conjecture of Blakley. Definition 1. The function/(z), regular in |z| <1, is said to be in the class S(p, m), where p and m are positive integers with p^m, if and only if (1) there exists a...

A (k, n) secret image sharing method shares a protected image in n shared images and the protected image can be reconstructed by k shared images. This study solves the secret image sharing problem by a geometry secret sharing strategy named the Blakley scheme. The protected image is first partitioned into non-overlapping sets of k pixels. Each set of k pixels forms a point under a k-dimensional...

microdeletion syndromes are contiguous gene deletion syndromes of less than 5 megabases.  most often, many of these syndromes are not detectable by  routine chromosomal analysis and require more specific testing techniques such as fish or more accurate general coverage like array comparative genomic hybridization.  as many of these syndromes are phenotypically recognizable and allow for easy cl...

This article develops an algorithm for a group of guards statically positioned in a nonconvex polygonal environment with holes. Each guard possesses a single searchlight, a ray sensor which can rotate about the guard’s position but cannot penetrate the boundary of the environment. A point is detected by a searchlight if and only if the point is on the ray at some instant. Targets are points whi...

Blakley, Blakley, Chan and Massey conjectured a lower bound on the entropy of broadcast messages in threshold schemes with disenrollment. In an effort to examine the conjecture, we identify their original scheme definition has a limitation: a coalition of participants can reconstruct all shared secrets without broadcast from the dealer, and hence render the dealer no control over disenrollment....

Blakley, Blakley, Chan and Massey conjectured a lower bound on the entropy of public broadcast in a threshold scheme with disenrollment capability. In this paper, we first show that the conjecture need not be true in general. Then we establish a tight lower bound on the entropy of public information by introducing one property to the definition of threshold schemes with disenrollment. We also p...

The undisputed father of mathematical problem solving is George Pólya (December 13, 1887 – September 7, 1985), one of the giants of classical analysis in the 20 century. He considered solving problems to be a practical art, one that can be taught and learned. His books on the subject How To Solve It (1945) and the two-volume set Mathematics and Plausible Reasoning (1954), and Mathematical Disco...

Tom George lias an odd kind of picture gallery. All the houses in his street have lean-to pantries, with tiny windows, the upper half glass, the lower latticed wood. It is traditional to keep the family egg-cups on the ledge formed by the wooden bottom of the glass section. Every variety of egg-cup is here displayed?white, red, and blue china, and metal. Occasionally other small, gay articles a...

In this historical analysis of US foreign policy toward Iran during the presidency of George W. Bush, the author aims to decipher the overarching policy approach guiding United States' Iran policy in the context of the main issues arising during this time period. George W. Bush started his presidency with the legacy of past presidents, viewing Iran as a threat to US interests and drawing from t...