In this paper we present a case for using new power-aware metrics for determining routes in wireless ad hoc networks. We present five different metrics based on battery power consumption at nodes. We show that using these metrics in a shortest-cost routing algorithm reduces the cost/packet of routing packets by 5-30% over shortest-hop routing (this cost reduction is on top of a 40-70% reduction in energy consumption obtained by using PAMAS, our MAC layer protocol). Furthermore, using these new metrics ensures that the mean time to node failure is increased significantly. An interesting property of using shortest-cost routing is that packet delays do not increase. Finally, we note that our new metrics can be used in most traditional routing protocols for ad hoc networks. 1

We survey the current techniques to cope with the problem of string matching allowing errors. This is becoming a more and more relevant issue for many fast growing areas such as information retrieval and computational biology. We focus on online searching and mostly on edit distance, explaining the problem and its relevance, its statistical behavior, its history and current developments, and the central ideas of the algorithms and their complexities. We present a number of experiments to compare the performance of the different algorithms and show which are the best choices according to each case. We conclude with some future work directions and open problems.

Numerous databases marketed as SQL-on-Hadoop, NewSQL [16] and NoSQL have emerged to catalyze Big Data applications. These databases generally support the 3Vs [7]. (i) Volume: amount of data (ii) Velocity: speed of data in and out (iii) Variety: semi-structured and het-erogeneous data. As a result

This paper presents BigDAWG, a reference implementation of a new architecture for “Big Data ” applications. Such applications not only call for large-scale analytics, but also for real-time stream-ing support, smaller analytics at interactive speeds, data visualiza-tion, and cross-storage-system

This paper presents BigDAWG, a reference implementation of a new architecture for “Big Data ” applications. Such applications not only call for large-scale analytics, but also for real-time stream-ing support, smaller analytics at interactive speeds, data visualiza-tion, and cross-storage-system

Computer Scrabble programs have achieved a level of performance that exceeds that of the strongest human players. MAVEN was the first program to demonstrate this against human opposition. Scrabble is a game of imperfect information with a large branching factor. The techniques successfully applied in two-player games such as chess do not work here. MAVEN combines a selective move generator, simulations of likely game scenarios, and the B # algorithm to produce a world-championship-caliber Scrabble-playing program.

We introduce a new automaton on a word p, sequence of letters taken in an alphabet \Sigma , that we call factor oracle. This automaton is acyclic, recognizes at least the factors of p, has m+ 1 states and a linear number of transitions. We give an on-line construction to build it. We use this new structure in string matching algorithms that we conjecture optimal according to the experimental results. These algorithms are as efficient as the ones that already exist using less memory and being more easy to implement. Keywords: indexing, finite automaton, pattern matching, algorithm design. 1

.9 percent, 12 percent mb) and Frederick (10.6 percent, 12 percent mb), respectively. Six of fourteen cultivars showed all values (100 percent distribution, across location) of protein content in the range of 11 to less than 14 percent. Those cultivars were 2163, Big Dawg, Dominator, Champ, Tam 302

In this paper, NERC (North American Reliability Council) records of power system disturbances for the year 1984 through 1999 are explored. The disturbance sizes show a power law distribution which confirms the early results [2]. Further, we find that the probability density of time intervals

We present nrgrep ("nondeterministic reverse grep"), a new pattern matching tool designed for efficient search of complex patterns. Unlike previous tools of the grep family, such as agrep and Gnu grep, nrgrep is based on a single and uniform concept: the bit-parallel simulation of a nondeterministic suffix automaton. As a result, nrgrep can find from simple patterns to regular expressions, exactly or allowing errors in the matches, with an efficiency that degrades smoothly as the complexity of the searched pattern increases. Another concept fully integrated into nrgrep and that contributes to this smoothness is the selection of adequate subpatterns for fast scanning, which is also absent in many current tools. We show that the efficiency of nrgrep is similar to that of the fastest existing string matching tools for the simplest patterns, and by far unpaired for more complex patterns.