A multicast routing scheme for efficient safety message dissemination in VANET

Vehicular ad hoc network (VANET) is a wireless ad hoc network that operates in a vehicular environment to provide communication between vehicles. VANET can be used by a diverse range of applications to improve road safety. Cooperative collision warning system (CCWS) is one of the safety applications that can provide situational awareness and warning to drivers by exchanging safety messages between cooperative vehicles. Currently, the routing strategies for safety message dissemination in CCWS are scoped broadcast. However, the broadcast schemes are not efficient as a warning message is sent to a large number of vehicles in the area, rather than only the endangered vehicles. They also cannot prioritize the receivers based on their critical time to avoid collision. This paper presents a more efficient multicast routing scheme that can reduce unnecessary transmissions and also use adaptive transmission range. The multicast scheme involves methods to identify an abnormal vehicle, the vehicles that may be endangered by the abnormal vehicle, and the latest time for each endangered vehicle to receive the warning message in order to avoid the danger. We transform this multicast routing problem into a delay-constrained minimum Steiner tree problem. Therefore, we can use existing algorithms to solve the problem. The advantages of our multicast routing scheme are mainly its potential to support various road traffic scenarios, to optimize the wireless channel utilization, and to prioritize the receivers.

Towards automatic tree crown detection and delineation in spectral feature space using PCNN and morphological reconstruction

The application of object-based approaches to the problem of extracting vegetation information from images requires accurate delineation of individual tree crowns. This paper presents an automated method for individual tree crown detection and delineation by applying a simplified PCNN model in spectral feature space followed by post-processing using morphological reconstruction. The algorithm was tested on high resolution multi-spectral aerial images and the results are compared with two existing image segmentation algorithms. The results demonstrate that our algorithm outperforms the other two solutions with the average accuracy of 81.8%.

Using incomplete online metric maps for topological exploration with the Gap Navigation Tree

This paper presents a general, global approach to the problem of robot exploration, utilizing a topological data structure to guide an underlying Simultaneous Localization and Mapping (SLAM) process. A Gap Navigation Tree (GNT) is used to motivate global target selection and occluded regions of the environment (called “gaps”) are tracked probabilistically. The process of map construction and the motion of the vehicle alters both the shape and location of these regions. The use of online mapping is shown to reduce the difficulties in implementing the GNT.

Minimizing information leakage of tree-based RFID authentication protocols using alternate tree-walking

The privacy of efficient tree-based RFID authentication protocols is heavily dependent on the branching factor on the top layer. Indefinitely increasing the branching factor, however, is not a viable option. This paper proposes the alternate-tree walking scheme as well as two protocols to circumvent this problem. The privacy of the resulting protocols is shown to be comparable to that of linear-time protocols, where there is no leakage of information, whilst reducing the computational load of the database by one-third of what is required of tree-based protocols during authentication. We also identify and address a limitation in quantifying privacy in RFID protocols.

Supplementary information : weighted tree kernels for sequence analysis

Genomic sequences are fundamentally text documents, admitting various representations according to need and tokenization. Gene expression depends crucially on binding of enzymes to the DNA sequence at small, poorly conserved binding sites, limiting the utility of standard pattern search. However, one may exploit the regular syntactic structure of the enzyme's component proteins and the corresponding binding sites, framing the problem as one of detecting grammatically correct genomic phrases. In this paper we propose new kernels based on weighted tree structures, traversing the paths within them to capture the features which underpin the task. Experimentally, we and that these kernels provide performance comparable with state of the art approaches for this problem, while offering significant computational advantages over earlier methods. The methods proposed may be applied to a broad range of sequence or tree-structured data in molecular biology and other domains.

The long and short of it: branch lengths and the problem of placing the New Zealand short-tailed bat.

The taxonomic position of the endemic New Zealand bat genus Mystacina has vexed systematists ever since its erection in 1843. Over the years the genus has been linked with many microchiropteran families and superfamilies. Most recent classifications place it in the Vespertilionoidea, although some immunological evidence links it with the Noctilionoidea (=Phyllostomoidea). We have sequenced 402 bp of the mitochondrial cytochrome b gene for M. tuberculata (Gray in Dieffenbach, 1843), and using both our own and published DNA sequences for taxa in both superfamilies, we applied different tree reconstruction methods to find the appropriate phylogeny and different methods of estimating confidence in the parts of the tree. All methods strongly support the classification of Mystacina in the Noctilionoidea. Spectral analysis suggests that parsimony analysis may be misleading for Mystacina's precise placement within the Noctilionoidea because of its long terminal branch. Analyses not susceptible to long-branch attraction suggest that the Mystacinidae is a sister family to the Phyllostomidae. Dating the divergence times between the different taxa suggests that the extant chiropteran families radiated around and shortly after the Cretaceous–Tertiary boundary. We discuss the biogeographical implications of classifying Mystacina within the Noctilionoidea and contrast our result with those classifications placing Mystacina in the Vespertilionoidea, concluding that evidence for the latter is weak.

The Long and Short of It: Branch Lengths and the Problem of Placing the New Zealand Short-Tailed Bat, Mystacina

The taxonomic position of the endemic New Zealand bat genus Mystacina has vexed systematists ever since its erection in 1843. Over the years the genus has been linked with many microchiropteran families and superfamilies. Most recent classifications place it in the Vespertilionoidea, although some immunological evidence links it with the Noctilionoidea (=Phyllostomoidea). We have sequenced 402 bp of the mitochondrial cytochrome b gene for M. tuberculata (Gray in Dieffenbach, 1843), and using both our own and published DNA sequences for taxa in both superfamilies, we applied different tree reconstruction methods to find the appropriate phylogeny and different methods of estimating confidence in the parts of the tree. All methods strongly support the classification of Mystacina in the Noctilionoidea. Spectral analysis suggests that parsimony analysis may be misleading for Mystacina's precise placement within the Noctilionoidea because of its long terminal branch. Analyses not susceptible to long-branch attraction suggest that the Mystacinidae is a sister family to the Phyllostomidae. Dating the divergence times between the different taxa suggests that the extant chiropteran families radiated around and shortly after the Cretaceous-Tertiary boundary. We discuss the biogeographical implications of classifying Mystacina within the Noctilionoidea and contrast our result with those classifications placing Mystacina in the Vespertilionoidea, concluding that evidence for the latter is weak.

Parallel streaming signature EM-tree: A clustering algorithm for web scale applications

The proliferation of the web presents an unsolved problem of automatically analyzing billions of pages of natural language. We introduce a scalable algorithm that clusters hundreds of millions of web pages into hundreds of thousands of clusters. It does this on a single mid-range machine using efficient algorithms and compressed document representations. It is applied to two web-scale crawls covering tens of terabytes. ClueWeb09 and ClueWeb12 contain 500 and 733 million web pages and were clustered into 500,000 to 700,000 clusters. To the best of our knowledge, such fine grained clustering has not been previously demonstrated. Previous approaches clustered a sample that limits the maximum number of discoverable clusters. The proposed EM-tree algorithm uses the entire collection in clustering and produces several orders of magnitude more clusters than the existing algorithms. Fine grained clustering is necessary for meaningful clustering in massive collections where the number of distinct topics grows linearly with collection size. These fine-grained clusters show an improved cluster quality when assessed with two novel evaluations using ad hoc search relevance judgments and spam classifications for external validation. These evaluations solve the problem of assessing the quality of clusters where categorical labeling is unavailable and unfeasible.

An Efficient and Verifiable Solution to the Millionaire Problem

A new solution to the millionaire problem is designed on the base of two new techniques: zero test and batch equation. Zero test is a technique used to test whether one or more ciphertext contains a zero without revealing other information. Batch equation is a technique used to test equality of multiple integers. Combination of these two techniques produces the only known solution to the millionaire problem that is correct, private, publicly verifiable and efficient at the same time.