Frequency characteristics of aerial scenes with respect to a video imagining system

Thesis (M.A.)--Boston UniversityAn overall investigation is made of operating characteristics, theoretical limitations and optimum range values for video communication of aerial scenes. Reasons are given for the selection of a particular receiver and the importance of this type of study is indicated from the A.D.P. crystals' complex A.C. frequency response. The restricted contrast range, due to haze, is noted in evaluating the various video systems

The Invisible Web: A Quick Overview

This article provides a quick overview of recent literature published about the Invisible Web. In particular, this article covers such topics as what is the Invisible Web, weaknesses of popular search engines, types of information found on the Invisible Web, when to use the Invisible Web, search tools and search strategies

Two-batch liar games on a general bounded channel

We consider an extension of the 2-person R\'enyi-Ulam liar game in which lies are governed by a channel $C$, a set of allowable lie strings of maximum length $k$. Carole selects $x\in[n]$, and Paul makes $t$-ary queries to uniquely determine $x$. In each of $q$ rounds, Paul weakly partitions $[n]=A_0\cup >... \cup A_{t-1}$ and asks for $a$ such that $x\in A_a$. Carole responds with some $b$, and if $a\neq b$, then $x$ accumulates a lie $(a,b)$. Carole's string of lies for $x$ must be in the channel $C$. Paul wins if he determines $x$ within $q$ rounds. We further restrict Paul to ask his questions in two off-line batches. We show that for a range of sizes of the second batch, the maximum size of the search space $[n]$ for which Paul can guarantee finding the distinguished element is $\sim t^{q+k}/(E_k(C)\binom{q}{k})$ as $q\to\infty$, where $E_k(C)$ is the number of lie strings in $C$ of maximum length $k$. This generalizes previous work of Dumitriu and Spencer, and of Ahlswede, Cicalese, and Deppe. We extend Paul's strategy to solve also the pathological liar variant, in a unified manner which gives the existence of asymptotically perfect two-batch adaptive codes for the channel $C$.Comment: 26 page

Simpler Variational Problem for Statistical Equilibria of the 2D Euler Equation and Other Systems with Long Range Interactions

The Robert-Sommeria-Miller equilibrium statistical mechanics predicts the final organization of two dimensional flows. This powerful theory is difficult to handle practically, due to the complexity associated with an infinite number of constraints. Several alternative simpler variational problems, based on Casimir's or stream function functionals, have been considered recently. We establish the relations between all these variational problems, justifying the use of simpler formulations.Comment: 5 pages, submited to Physica