On the broadcast capacity of wireless multihop interference networks

This paper is concerned with wireless broadcasting in multihop networks where a selected number of relay nodes may aid the source node in the broadcast under a given total energy and hop constraint. We study an ad-hoc network with infinitely many nodes and analytically find the number and positions of rebroadcasting relay nodes to achieve the optimal broadcast capacity. The interference due to multiple transmissions in the geographical area is taken into account. Based on the theoretical findings, we then propose one distributed and one centralized heuristic for relay selection in wireless broadcasting. We discuss the broadcast capacity performances and CSI (channel state information) requirements of these algorithms. The results illustrate that the benefits of peer-assisted broadcasting are more pronounced in the centralized relay selection algorithm when compared to the fully randomized and distributed selection under a realistic system model

System architecture for road lighting

Traditional road lighting systems consume a large amount of energy. When the ambient light falls under a certain threshold, all the luminaries are turned at full-power without considering user perception and interaction. The feeling of safety experienced by users and user-lighting system interaction via consumer electronics (CE) devices should be investigated. For this study, we establish a software-controlled testbed that allows changing the brightness level of each street luminary remotely. In this paper, we describe the system architecture of this testbed deployed on a street along with the future work directions

Euler-Lagrange equations for composition functionals in calculus of variations on time scales

In this paper we consider the problem of the calculus of variations for a functional which is the composition of a certain scalar function $H$ with the delta integral of a vector valued field $f$, i.e., of the form $H(\int_{a}^{b}f(t,x^{\sigma}(t),x^{\Delta}(t))\Delta t)$. Euler-Lagrange equations, natural boundary conditions for such problems as well as a necessary optimality condition for isoperimetric problems, on a general time scale, are given. A number of corollaries are obtained, and several examples illustrating the new results are discussed in detail.Comment: Submitted 10-May-2009 to Discrete and Continuous Dynamical Systems (DCDS-B); revised 10-March-2010; accepted 04-July-201

Improved Bounds on Quantum Learning Algorithms

In this article we give several new results on the complexity of algorithms that learn Boolean functions from quantum queries and quantum examples. Hunziker et al. conjectured that for any class C of Boolean functions, the number of quantum black-box queries which are required to exactly identify an unknown function from C is $O(\frac{\log |C|}{\sqrt{{\hat{\gamma}}^{C}}})$, where $\hat{\gamma}^{C}$ is a combinatorial parameter of the class C. We essentially resolve this conjecture in the affirmative by giving a quantum algorithm that, for any class C, identifies any unknown function from C using $O(\frac{\log |C| \log \log |C|}{\sqrt{{\hat{\gamma}}^{C}}})$ quantum black-box queries. We consider a range of natural problems intermediate between the exact learning problem (in which the learner must obtain all bits of information about the black-box function) and the usual problem of computing a predicate (in which the learner must obtain only one bit of information about the black-box function). We give positive and negative results on when the quantum and classical query complexities of these intermediate problems are polynomially related to each other. Finally, we improve the known lower bounds on the number of quantum examples (as opposed to quantum black-box queries) required for $(\epsilon,\delta)$-PAC learning any concept class of Vapnik-Chervonenkis dimension d over the domain $\{0,1\}^n$ from $\Omega(\frac{d}{n})$ to $\Omega(\frac{1}{\epsilon}\log \frac{1}{\delta}+d+\frac{\sqrt{d}}{\epsilon})$. This new lower bound comes closer to matching known upper bounds for classical PAC learning.Comment: Minor corrections. 18 pages. To appear in Quantum Information Processing. Requires: algorithm.sty, algorithmic.sty to buil

Archaeological Analysis in the Information Age: Guidelines for Maximizing the Reach, Comprehensiveness, and Longevity of Data

With the advent of the Web, increased emphasis on “research data management,” and innovations in reproducible research practices, scholars have more incentives and opportunities to document and disseminate their primary data. This article seeks to guide archaeologists in data sharing by highlighting recurring challenges in reusing archived data gleaned from observations on workflows and reanalysis efforts involving datasets published over the past 15 years by Open Context. Based on our findings, we propose specific guidelines to improve data management, documentation, and publishing practices so that primary data can be more efficiently discovered, understood, aggregated, and synthesized by wider research communities

Universality in Systems with Power-Law Memory and Fractional Dynamics

There are a few different ways to extend regular nonlinear dynamical systems by introducing power-law memory or considering fractional differential/difference equations instead of integer ones. This extension allows the introduction of families of nonlinear dynamical systems converging to regular systems in the case of an integer power-law memory or an integer order of derivatives/differences. The examples considered in this review include the logistic family of maps (converging in the case of the first order difference to the regular logistic map), the universal family of maps, and the standard family of maps (the latter two converging, in the case of the second difference, to the regular universal and standard maps). Correspondingly, the phenomenon of transition to chaos through a period doubling cascade of bifurcations in regular nonlinear systems, known as "universality", can be extended to fractional maps, which are maps with power-/asymptotically power-law memory. The new features of universality, including cascades of bifurcations on single trajectories, which appear in fractional (with memory) nonlinear dynamical systems are the main subject of this review.Comment: 23 pages 7 Figures, to appear Oct 28 201

The Hahn Quantum Variational Calculus

We introduce the Hahn quantum variational calculus. Necessary and sufficient optimality conditions for the basic, isoperimetric, and Hahn quantum Lagrange problems, are studied. We also show the validity of Leitmann's direct method for the Hahn quantum variational calculus, and give explicit solutions to some concrete problems. To illustrate the results, we provide several examples and discuss a quantum version of the well known Ramsey model of economics.Comment: Submitted: 3/March/2010; 4th revision: 9/June/2010; accepted: 18/June/2010; for publication in Journal of Optimization Theory and Application

A novel lineage of the Capra genus discovered in the Taurus Mountains of Turkey using ancient genomics

Direkli Cave, located in the Taurus Mountains of southern Turkey, was occupied by Late Epipaleolithic hunters-gatherers for the seasonal hunting and processing of game including large numbers of wild goats. We report genomic data from new and published Capra specimens from Direkli Cave and, supplemented with historic genomes from multiple Capra species, find a novel lineage best represented by a ~14,000 year old 2.59 X genome sequenced from specimen Direkli4. This newly discovered Capra lineage is a sister clade to the Caucasian tur species (Capra cylindricornis and Capra caucasica), both now limited to the Caucasus region. We identify genomic regions introgressed in domestic goats with high affinity to Direkli4, and find that West Eurasian domestic goats in the past, but not those today, appear enriched for Direkli4-specific alleles at a genome-wide level. This forgotten 'Taurasian tur' likely survived Late Pleistocene climatic change in a Taurus Mountain refuge and its genomic fate is unknown