The p-shuffle is a natural generalization of the dovetail shuffle. It is defined as follows. First, the deck is cut into a top stack and a bottom stack so that the distribution of the size of the top stack is Binomial (N, p), where N is the total number of cards in the deck. Then, conditional on the outcome of the cut, the two stacks are “riffled” in such a way that all possible riffles (interl...

A modified k-deck of a graph is obtained by removing k edges in all possible ways and adding k (not necessarily new) edges in all possible ways. Krasikov and Roditty used these decks to give an independent proof of Müller’s result on the edge reconstructibility of graphs. They asked if a k-edge deck could be constructed from its modified k-deck. In this paper, we solve the problem when k = 1. W...

Suppose that A is a subset of an abelian group G. To know the 3-deck of A is to know the number of occurrences in A of translates of each possible multiset {0, a, b}. The concept of the 3-deck of a set is naturally extended to L1 functions on G. In this paper we study when the 3-deck of a function determines the function up to translations. The method is to look at the Fourier Transform of the ...

Launch and recovery helicopter wind envelope for a ship type was determined as the first step to the helicopter qualification program. Flight deck velocities data were obtained by means of a two components laser Doppler anemometer testing a 1/50 model in the wind tunnel stream. Full-scale flight deck measurements were obtained on board the ship using a sonic anemometer. Wind tunnel and full-sca...

A modified k-deck of a graph is obtained by removing k edges in all possible ways and adding k (not necessarily new) edges in all possible ways. Krasikov and Roditty used these decks to give an independent proof of Müller’s result on the edge reconstructibility of graphs. They asked if a k-edge deck could be constructed from its modified k-deck. In this paper, we solve the problem when k = 1. W...

Impairments in executive functioning are commonly found in Parkinson's disease (PD); however, the research into risky decision making has been mixed. The present study sought to investigate three potential hypotheses: difficulty learning the task probabilities, levodopa equivalent dose (LED), and the presence of apathy. Twenty-four individuals with idiopathic PD and 13 healthy controls complete...

We discuss a simplified version of the well-known card game War in which the cards in the deck have a strict ranking from 1 to n and in which the winning card and losing card are immediately placed, in that order, at the bottom of the winning player’s deck. Under this variation of War we show that it is possible for a standard fifty-two card deck to cycle, and we exhibit such a cycle. This resu...

We show that the counting class LWPP [FFK94] remains unchanged even if one allows a polynomial number of gap values rather than one. On the other hand, we show that it is impossible to improve this from polynomially many gap values to a superpolynomial number of gap values by relativizable proof techniques. The first of these results implies that the Legitimate Deck Problem (from the study of g...

A manned or unmanned helicopter-ship qualification program (Dynamic Interface Testing) evaluates, improves, and/or develops all aspects of shipboard helicopter compatibility. Issues addressed during a test may include the adequacy, effectiveness, and safety of shipboard aviation support facilities and helicopter recovery procedures. Manned and unmanned aircraft share a number of common issues a...

We discuss a simplified version of the well-known card game War in which the cards in the deck have a strict ranking from 1 to n and in which the winning card and losing card are immediately placed, in that order, at the bottom of the winning player’s deck. Under this variation of War we show that it is possible for a standard fifty-two card deck to cycle, and we exhibit such a cycle. This resu...