Pilot Tone Actuated Antenna Array Pattern Reconfiguration

A new strategy for remote reconfiguration of an antenna array far field radiation pattern is described. The scheme uses a pilot tone co-transmitted with a carrier signal from a location distant from that of a receive antenna array whose far field pattern is to be reconfigured. By mixing the co-transmitted signals locally at each antenna element in the array an IF signal is formed which defines an equivalent array spacing that can be made variable by tuning the frequency of the pilot tone with respect to the RF carrier. This makes the antenna array factor hence far field spatial characteristic reconfigurable on receive. For a 10 x 1 microstrip patch element array we show that the receive pattern can be made to vary from 35 to 10 degrees half power beam width as the difference frequency between the pilot and the carrier at 2.45 GHz varies between 10 MHz and 500 MHz carrier.

On the complexity of solving polytree-shaped limited memory influence diagrams with binary variables

Influence diagrams are intuitive and concise representations of structured decision problems. When the problem is non-Markovian, an optimal strategy can be exponentially large in the size of the diagram. We can avoid the inherent intractability by constraining the size of admissible strategies, giving rise to limited memory influence diagrams. A valuable question is then how small do strategies need to be to enable efficient optimal planning. Arguably, the smallest strategies one can conceive simply prescribe an action for each time step, without considering past decisions or observations. Previous work has shown that finding such optimal strategies even for polytree-shaped diagrams with ternary variables and a single value node is NP-hard, but the case of binary variables was left open. In this paper we address such a case, by first noting that optimal strategies can be obtained in polynomial time for polytree-shaped diagrams with binary variables and a single value node. We then show that the same problem is NP-hard if the diagram has multiple value nodes. These two results close the fixed-parameter complexity analysis of optimal strategy selection in influence diagrams parametrized by the shape of the diagram, the number of value nodes and the maximum variable cardinality.

Complexity of Inferences in Polytree-shaped Semi-Qualitative Probabilistic Networks

Semi-qualitative probabilistic networks (SQPNs) merge two important graphical model formalisms: Bayesian networks and qualitative probabilistic networks. They provide a very general modeling framework by allowing the combination of numeric and qualitative assessments over a discrete domain, and can be compactly encoded by exploiting the same factorization of joint probability distributions that are behind the Bayesian networks. This paper explores the computational complexity of semi-qualitative probabilistic networks, and takes the polytree-shaped networks as its main target. We show that the inference problem is coNP-Complete for binary polytrees with multiple observed nodes. We also show that inferences can be performed in linear time if there is a single observed node, which is a relevant practical case. Because our proof is constructive, we obtain an efficient linear time algorithm for SQPNs under such assumptions. To the best of our knowledge, this is the first exact polynomial-time algorithm for SQPNs. Together these results provide a clear picture of the inferential complexity in polytree-shaped SQPNs.

IDS: A Divide-and-Conquer Algorithm for Inference in Polytree-Shaped Credal Networks

A credal network is a graph-theoretic model that represents imprecision in joint probability distributions. An inference in a credal net aims at computing an interval for the probability of an event of interest. Algorithms for inference in credal networks can be divided into exact and approximate. The selection of an algorithm is based on a trade off that ponders how much time someone wants to spend in a particular calculation against the quality of the computed values. This paper presents an algorithm, called IDS, that combines exact and approximate methods for computing inferences in polytree-shaped credal networks. The algorithm provides an approach to trade time and precision when making inferences in credal nets

Making space: English women, letter-writing, and the life of the mind, c.1650-1750

This article uses women's letter-writing from the late seventeenth and early eighteenth centuries to explore the home as a site of female intellectual endeavour. Far from representing a static backdrop to the action of domestic life, the home played a dynamic role in women's experiences of the life of the mind and shaped the ways in which women thought and wrote. Letters were penned in dining rooms, parlours and closets, by firesides, and on desks and laps. In their letters, women projected images of themselves scribbling epistles to friends in order to maintain their mental intimacy. Space was both real and imagined and the physical realities of a hand-written and hand-delivered letter gave way to the imaginative possibilities brought by networks of epistolary exchange and the alternative spaces of creative thought. By reinstating the home more fully in the history of female intellectual experience, a more nuanced view of the domestic arena can be developed: one that sees the home not as a site of exclusion and confinement, but as a space for scholarship and exchange. 

Secure Transmission in MIMO Wiretap Channels Using General-Order Transmit Antenna Selection with Outdated CSI

In this paper, we propose general-order transmit antenna selection to enhance the secrecy performance of multiple-input–multiple-output multieavesdropper channels with outdated channel state information (CSI) at the transmitter. To evaluate the effect of the outdated CSI on the secure transmission of the system, we investigate the secrecy performance for two practical scenarios, i.e., Scenarios I and II, where the eavesdropper's CSI is not available at the transmitter and is available at the transmitter, respectively. For Scenario I, we derive exact and asymptotic closed-form expressions for the secrecy outage probability in Nakagami- m fading channels. In addition, we also derive the probability of nonzero secrecy capacity and the \varepsilon -outage secrecy capacity, respectively. Simple asymptotic expressions for the secrecy outage probability reveal that the secrecy diversity order is reduced when the CSI is outdated at the transmitter, and it is independent of the number of antennas at each eavesdropper N_text\rm{E} , the fading parameter of the eavesdropper's channel m_text\rm{E} , and the number of eavesdroppers M . For Scenario II, we make a comprehensive analysis of the average secrecy capacity obtained by the system. Specifically, new closed-form expressions for the exact and asymptotic average secrecy capacity are derived, which are valid for general systems with an arbitrary number of antennas, number of eavesdroppers, and fading severity parameters. Resorting to these results, we also determine a high signal-to-noise ratio power offset to explicitly quantify the impact of the main c- annel and the eavesdropper's channel on the average secrecy capacity.

Quantum control of photodissociation using intense, femtosecond pulses shaped with third order dispersion

We demonstrate the ability to control the molecular dissociation rate using femtosecond pulses shaped with third-order dispersion (TOD). Explicitly, a significant 50% enhancement in the dissociation yield for the low lying vibrational levels (v ∼ 6) of an H+2 ion-beam target was measured as a function of TOD. The underlying mechanism responsible for this enhanced dissociation was theoretically identified as non-adiabatic alignment induced by the pre-pulses situated on the leading edge of pulses shaped with negative TOD. This control scheme is expected to work in other molecules as it does not rely on specific characteristics of our test-case H+2 molecule.

Secure Transmission in Spectrum Sharing MIMO Networks with Generalized Antenna Selection over Nakagami-m Channels

In this paper, we investigate the secrecy outage performance of spectrum sharing multiple-input multiple-output networks using generalized transmit antenna selection with maximal ratio combining over Nakagami-m channels. In particular, the outdated channel state information is considered at the process of antenna selection due to feedback delay. Considering a practical passive eavesdropper scenario, we derive the exact and asymptotic closed-form expressions of secrecy outage probability, which enable us to evaluate the secrecy performance with high efficiency and present a new design insight into the impact of key parameters on the secrecy performance. In addition, the analytical results demonstrate that the achievable secrecy diversity order is only determined by the parameters of the secondary network, while other parameters related to primary or eavesdropper’s channels have a significantly impact on the secrecy coding gain.