Study and simulation of spatial video compression for remotely piloted vehicles

Techniques of video compression applicable to remotely piloted vehicles (RPVs) are investigated. One approach is to reduce the frame rate, the other is to reduce the number of bits per sample needed to represent static picture detail by means of digital video compression. Hadamard transforms of 8 x 8 subpictures, with adaptive and nonadaptive quantization of transform coefficients, were investigated for the latter technique. Tapes of typical RPV video, processed by Aeronautronic Ford to simulate four frame rates, were again processed by the Ames real-time video system to obtain a variety of compressions of each of the four frame rates

Planar digraphs without large acyclic sets

Given a directed graph, an acyclic set is a set of vertices inducing a subgraph with no directed cycle. In this note we show that there exist oriented planar graphs of order $n$ for which the size of the maximum acyclic set is at most $\lceil \frac{n+1}{2} \rceil$, for any $n$. This disproves a conjecture of Harutyunyan and shows that a question of Albertson is best possible.Comment: 3 pages, 1 figur

Minimum Cell Connection in Line Segment Arrangements

We study the complexity of the following cell connection problems in segment arrangements. Given a set of straight-line segments in the plane and two points a and b in different cells of the induced arrangement: [(i)] compute the minimum number of segments one needs to remove so that there is a path connecting a to b that does not intersect any of the remaining segments; [(ii)] compute the minimum number of segments one needs to remove so that the arrangement induced by the remaining segments has a single cell. We show that problems (i) and (ii) are NP-hard and discuss some special, tractable cases. Most notably, we provide a near-linear-time algorithm for a variant of problem (i) where the path connecting a to b must stay inside a given polygon P with a constant number of holes, the segments are contained in P, and the endpoints of the segments are on the boundary of P. The approach for this latter result uses homotopy of paths to group the segments into clusters with the property that either all segments in a cluster or none participate in an optimal solution

Calcitonin receptor-like receptor is expressed on gastrointestinal immune cells

Background/Aims: Pharmacological and morphological studies suggest that the gut mucosal immune system and local neuropeptide-containing neurones interact. We aimed to determine whether gut immune cells are targets for calcitonin gene-related peptide (CGRP), which has potent immune regulatory properties. Methods: Using density gradient centrifugation, rat lamina propria mononuclear cells (LP-MNCs) and intra-epithelial lymphocytes (IELs) were isolated. RT-PCR was employed for the detection of mRNA of rat calcitonin receptor-like receptor (CRLR), which is considered to represent the pharmacologically defined CGRP receptor-1 subtype, as well as mRNA of the receptor activity-modifying proteins, which are essential for CRLR function and determine ligand specificity. A radioreceptor assay was employed for the detection of specific CGRP binding sites. Results: RT-PCR and DNA sequencing showed that LP-MNCs and IELs express CRLR. Incubation of isolated LP-MNCs with radiolabelled alphaCGRP revealed the existence of specific binding sites for CGRP. Conclusion: These novel data indicate that mucosal immune cells of the rat gut are a target for CGRP and provide significant evidence that CGRP functions as an immune regulator in the gut mucosa. Copyright (C) 2002 S. Karger AG, Basel

Minimum cell connection in line segment arrangements

We study the complexity of the following cell connection problems in segment arrangements. Given a set of straight-line segments in the plane and two points a and b in different cells of the induced arrangement: (i) compute the minimum number of segments one needs to remove so that there is a path connecting a to b that does not intersect any of the remaining segments; (ii) compute the minimum number of segments one needs to remove so that the arrangement induced by the remaining segments has a single cell. We show that problems (i) and (ii) are NP-hard and discuss some special, tractable cases. Most notably, we provide a near-linear-time algorithm for a variant of problem (i) where the path connecting a to b must stay inside a given polygon P with a constant number of holes, the segments are contained in P, and the endpoints of the segments are on the boundary of P. The approach for this latter result uses homotopy of paths to group the segments into clusters with the property that either all segments in a cluster or none participate in an optimal solution

Minimum-Cost Coverage of Point Sets by Disks

We consider a class of geometric facility location problems in which the goal is to determine a set X of disks given by their centers (t_j) and radii (r_j) that cover a given set of demand points Y in the plane at the smallest possible cost. We consider cost functions of the form sum_j f(r_j), where f(r)=r^alpha is the cost of transmission to radius r. Special cases arise for alpha=1 (sum of radii) and alpha=2 (total area); power consumption models in wireless network design often use an exponent alpha>2. Different scenarios arise according to possible restrictions on the transmission centers t_j, which may be constrained to belong to a given discrete set or to lie on a line, etc. We obtain several new results, including (a) exact and approximation algorithms for selecting transmission points t_j on a given line in order to cover demand points Y in the plane; (b) approximation algorithms (and an algebraic intractability result) for selecting an optimal line on which to place transmission points to cover Y; (c) a proof of NP-hardness for a discrete set of transmission points in the plane and any fixed alpha>1; and (d) a polynomial-time approximation scheme for the problem of computing a minimum cost covering tour (MCCT), in which the total cost is a linear combination of the transmission cost for the set of disks and the length of a tour/path that connects the centers of the disks.Comment: 10 pages, 4 figures, Latex, to appear in ACM Symposium on Computational Geometry 200

Mimicry technology : a versatile tool for small RNA suppression

A decade ago the discovery of the target mimicry regulatory process on the activity of a mature microRNA (miRNA) enabled for the first time the customized attenuation of miRNA activity in plants. That powerful technology was named MIMIC and was based on engineering the IPS1 long noncoding transcript to become complementary to the miRNA under study. In order to avoid IPS1 degradation, the predicted miRNA-mediated cleavage site was interrupted by three additional nucleotides giving rise to the so-called MIMIC decoy. Since then, MIMIC technology has been used in several plant species and in basic and translational research. We here provide a detailed guide to produce custom-designed MIMIC decoys to facilitate the study of sRNA functions in plants