As RFID technology matures, it has huge potential for numerous applications in disparate fields of study. Due to the potential benefit and transformational technology that RFID promises, the United States Department of Defense (DoD) is dedicated to adopting passive RFID technology (United States Department of Defense suppliers’ passive RFID Information guide version 10.0, 2008). RFID has potent...

We study the price dynamics in a multi-agent economy consisting of buyers and competing sellers, where each seller has limited information about its competitors’ prices. In this economy, buyers use shopbots while the sellers employ automated pricing agents or pricebots. Derivative following (DF) provides a simple, albeit naïve, strategy for dynamic pricing in such a scenario. In this work, we r...

Wireless systems already provide time delay and signal strength measurements and the future may see antenna arrays that provide directional information. All these may be used for positioning. Although the statistical accuracy of different positioning methods is well studied, the systematic error effects, which arise, for example, from errors in sensor (node) location, network synchronization, o...

Modern flight control systems are expected to perform beyond their conventional flight envelopes and exhibit robustness and adaptability to uncertain environments and failures. Adaptive control has been shown to improve the performance of a flight control system in the presence of uncertainties and failures. Recently, a new adaptive design named DF-MRAC has been developed which offers the possi...

For X a compact abelian group and B an infinite subset of its dual X̂, let CB be the set of all x ∈ X such that 〈φ(x) : φ ∈ B〉 converges to 1. If F is a free filter on X̂, let DF = {CB : B ∈ F}. The sets CB and DF are subgroups of X. CB always has Haar measure 0, while the measure of DF depends on F . We show that there is a filter F such that DF has measure 0 but is not contained in any CB . Thi...

Let us write DF (G) = {F ∈ F : F ∩ G = ∅} for a set G and a family F . Then a family F of sets is said to be (≤ l)-almost intersecting (l-almost intersecting) if for any F ∈ F we have |DF (F )| ≤ l (|DF (F )| = l). In this paper we investigate the problem of finding the maximum size of an (≤ l)almost intersecting (l-almost intersecting) family F . AMS Subject Classification: 05D05

This paper presents faster inversion-free point addition formulas for the curve y(1 + ax) = cx(1 + dy). The proposed formulas improve the point doubling operation count record from 6M + 5S to 8M and mixed addition operation count record from 10M to 8M. Both sets of formulas are shown to be 4-way parallel, leading to an effective cost of 2M per either of the group operations.

Trabalho desenvolvido como parte de tese de doutorado no laboratório de Neurociências e Comportamento, Ciências Fisiológicas, Departamento de Biologia Animal da Universidade de Brasília Brasília (DF) Brasil. 1 Doutoranda do Departamento de Biologia Animal, Universidade de Brasília UnB Brasília (DF) Brasil. 2 Professor Adjunto da UnB Brasília (DF) Brasil; Doutor em Neurociências pela University ...