Engaging in videogame play: An activity-centric analysis of the player experience

This paper focuses on examining play activities in people's favourite videogame experience. Through interviews with 30 videogame players we discovered which types of play activities are most appealing. Our research identifies the level of appeal of a wide range of game play activities. We have established that high levels of engagement for many participants is grounded in play as power and play as strategy, with play as fantasy adding to the experience. Through our study we established that conflict-based activities hold strong appeal. We subsequently investigated the context in which players talked about their experience of conflict within game. By using activities as a categorisation of gameplay we have been able to capture the play experience across a range of games and a range of gaming contexts. By examining players' individual experience we begin to understand why conflict in videogames appears to be a popular choice of activities.

Hakoah men's soccer team at a game against Graz Hasair; Vienna Portraits Men

Score 2:1 Hakoah; Names of players with numbers handwritten on verso

What does the future hold for our traditional department stores?

Years of buy-outs, takeovers, mergers and rebranding have whittled a once plentiful landscape of department store competitors down to two major players, Myer and David Jones. Now, despite David Jones confirming it refused a potential A$3 billion merger proposal approach from its arch-competitor in October 2013, we must face the distinct possibility of there only being room for one, full line, up-market department store in Australia.

How your shopping choices will help Coles and Woolworths take on the banks

The days when Coles and Woolworths only sold groceries are long gone. Both are now established players in a broad range of consumer markets, with interests in liquor and hotels, fuel and convenience, general merchandise and mobile phones. With a network of over 1,600 supermarkets, 1,100 service stations, 2,200 liquor stores and nearly 400 hotels, the supermarket duo are now getting ready for a war with Australia’s big four banks.

Milton Weill papers, 1918-1950.

Contains correspondence, memoranda, speeches, etc. to various departments on the National Jewish Welfare Board, the Anti-Defamation League, and the Jewish War Veterans of the U.S. relating to Jewish personnel in the U.S. Armed Forces during World War II and concerned with public relations, anti-Semitism and discrimination, the chaplaincy, etc.; includes also published articles and radio addresses for the same period and extensive correspondence with Rabbi Milton Steinberg from 1946 to 1950, as well as material by and about Rabbi Steinberg. The collection also contains personal family correspondence while Weill was serving overseas during World War I, memorabilia and a scrapbook relating to these military experiences, and undated typescript copies of dramatic sketches.

Alice Davis Menken papers, undated, 1880-1936.

Primarily correspondence, reports, etc. relating to activities with the Society of New York State Women, Jewish Welfare Board, Jewish Protectory and Aid Society (later called Jewish Board of Guardians), New York City Woman's Night Court, Hudson State Training School, New York State Reformatory for Women, Society for Political Study, Daughters of American Revolution, Progressive Party, Mayor's Committee of Women on National Defense, New York, Congregation Shearith Israel, Florence Crittendon League, Committee of Fourteen and the Inwood House; includes also journals, diaries and other material relating to personal life, and a biographical sketch submitted to the Jewish Biographical Bureau, and copies of published and manuscript articles. Contains a "Survey of Reformatory and Correctional Institutions and Agencies As Related To The Problem of Commercialized Vice" in manuscript, submitted in August, 1919 and also material relating to program and activities of New York Training School For Community Center Workers.

Industrial Removal Office records undated, 1899-1922

Contains Board of Directors minutes (1903, 1907), Executive Committee minutes (1907), Removal Committee minutes (1903-1917), Annual Reports (1910, 1913), Monthly Reports (1901-1919), Monthly Bulletins (1914-1915), studies of those removed, Bressler's "The Removal Work, Including Galveston," and several papers relating to the IRO and immigration. Financial papers include a budget (1914), comparative per capita cost figures (1909-1922), audits (1915-1918), receipts and expenditures (1918-1922), investment records, bank balances (1907-1922), removal work cash book (1904-1911), office expenses cash account (1903-1906), and the financial records of other agencies working with the IRO (1906). Includes also removal case records of first the Jewish Agricultural Society (1899-1900), and then of the IRO (1901-1922) when it took over its work, family reunion case records (1901-1904), and the follow-up records of persons removed to various cities (1903-1914). Contains also the correspondence of traveling agents' contacts throughout the U.S. from 1905-1914, among them Stanley Bero, Henry P. Goldstein, Philip Seman, and Morris D. Waldman.

On linear order and computation : The expressiveness of interactive computations on linear orders and computations indexed by ordinals

We solve the Dynamic Ehrenfeucht-Fra\"iss\'e Game on linear orders for both players, yielding a normal form for quantifier-rank equivalence classes of linear orders in first-order logic, infinitary logic, and generalized-infinitary logics with linearly ordered clocks. We show that Scott Sentences can be manipulated quickly, classified into local information, and consistency can be decided effectively in the length of the Scott Sentence. We describe a finite set of linked automata moving continuously on a linear order. Running them on ordinals, we compute the ordinal truth predicate and compute truth in the constructible universe of set-theory. Among the corollaries are a study of semi-models as efficient database of both model-theoretic and formulaic information, and a new proof of the atomicity of the Boolean algebra of sentences consistent with the theory of linear order -- i.e., that the finitely axiomatized theories of linear order are dense.

Myer Starr, memoirs undated

Myer Starr was born in Dmitrovka in the Ukraine, which was then part of Russia. As a child he was apprenticed to a tailor and later a bakery before he began work at a dry goods store at the age of 11. After his mother died, Starr and his younger brother crossed the border into Germany and then immigrated to the United States. Starr and his brother sailed on the "Kleist" into New York in February 1913. From there, they traveled to a sister's house in Malden, Massachusetts. Myer later married and had two sons, graduates of Harvard College and Tufts University.

On Games on Non-Wellfounded Sets and Stationary Sets

In this thesis we study a few games related to non-wellfounded and stationary sets. Games have turned out to be an important tool in mathematical logic ranging from semantic games defining the truth of a sentence in a given logic to for example games on real numbers whose determinacies have important effects on the consistency of certain large cardinal assumptions. The equality of non-wellfounded sets can be determined by a so called bisimulation game already used to identify processes in theoretical computer science and possible world models for modal logic. Here we present a game to classify non-wellfounded sets according to their branching structure. We also study games on stationary sets moving back to classical wellfounded set theory. We also describe a way to approximate non-wellfounded sets with hereditarily finite wellfounded sets. The framework used to do this is domain theory. In the Banach-Mazur game, also called the ideal game, the players play a descending sequence of stationary sets and the second player tries to keep their intersection stationary. The game is connected to precipitousness of the corresponding ideal. In the pressing down game first player plays regressive functions defined on stationary sets and the second player responds with a stationary set where the function is constant trying to keep the intersection stationary. This game has applications in model theory to the determinacy of the Ehrenfeucht-Fraisse game. We show that it is consistent that these games are not equivalent.

Inventing the Future: Intellectual Property and 3D Printing

A new technology – 3D printing – has the potential to make radical changes to aspects of the way in which we live. Put simply, it allows people to download designs and turn them into physical objects by laying down successive layers of material. Replacements or parts for household objects such as toys, utensils and gadgets could become available at the press of a button. With this innovation, however, comes the need to consider impacts on a wide range of forms of intellectual property, as Dr Matthew Rimmer explains. 3D Printing is the latest in a long line of disruptive technologies – including photocopiers, cassette recorders, MP3 players, personal computers, peer to peer networks, and wikis – which have challenged intellectual property laws, policies, practices, and norms. As The Economist has observed, ‘Tinkerers with machines that turn binary digits into molecules are pioneering a whole new way of making things—one that could well rewrite the rules of manufacturing in much the same way as the PC trashed the traditional world of computing.’

Remarks prepared for delivery by Fred W. Friendly on the occasion of the tenth presentation of the Hubert H. Humphrey First Amendment Freedoms Prize.

Typescript (photocopy) of a speach delivered by Prof. Friendly at the New York Marriott Marquis Hotel, June 10, 1988.

Planar pursuit-evasion with variable speeds, part 1, extremal trajectory maps

Pursuit evasion in a plane is formulated with both players allowed to vary their speeds between fixed limits. A suitable choice of real-space coordinates confers open-loop optimality on the game. The solution in the small is described in terms of the individual players'' extremal trajectory maps (ETM). Each map is independent of role, adversary, and capture radius. An ETM depicts the actual real-space trajectories. A template method of generating constant control arcs is described. Examples of ETM for an aircraft flying at a constant altitude with fixed and varying speeds are presented.

Planar pursuit-evasion with variable speeds, part 2, barrier sections

An iterative method of constructing sections of the game surfaces from the players'' extremal trajectory maps is discussed. Barrier sections are presented for aircraft pursuit-evasion at constant altitude, with one aircraft flying at sustained speed and the other varying its speed.

Computational Techniques for Haplotype Inference and for Local Alignment Significance

This thesis which consists of an introduction and four peer-reviewed original publications studies the problems of haplotype inference (haplotyping) and local alignment significance. The problems studied here belong to the broad area of bioinformatics and computational biology. The presented solutions are computationally fast and accurate, which makes them practical in high-throughput sequence data analysis. Haplotype inference is a computational problem where the goal is to estimate haplotypes from a sample of genotypes as accurately as possible. This problem is important as the direct measurement of haplotypes is difficult, whereas the genotypes are easier to quantify. Haplotypes are the key-players when studying for example the genetic causes of diseases. In this thesis, three methods are presented for the haplotype inference problem referred to as HaploParser, HIT, and BACH. HaploParser is based on a combinatorial mosaic model and hierarchical parsing that together mimic recombinations and point-mutations in a biologically plausible way. In this mosaic model, the current population is assumed to be evolved from a small founder population. Thus, the haplotypes of the current population are recombinations of the (implicit) founder haplotypes with some point--mutations. HIT (Haplotype Inference Technique) uses a hidden Markov model for haplotypes and efficient algorithms are presented to learn this model from genotype data. The model structure of HIT is analogous to the mosaic model of HaploParser with founder haplotypes. Therefore, it can be seen as a probabilistic model of recombinations and point-mutations. BACH (Bayesian Context-based Haplotyping) utilizes a context tree weighting algorithm to efficiently sum over all variable-length Markov chains to evaluate the posterior probability of a haplotype configuration. Algorithms are presented that find haplotype configurations with high posterior probability. BACH is the most accurate method presented in this thesis and has comparable performance to the best available software for haplotype inference. Local alignment significance is a computational problem where one is interested in whether the local similarities in two sequences are due to the fact that the sequences are related or just by chance. Similarity of sequences is measured by their best local alignment score and from that, a p-value is computed. This p-value is the probability of picking two sequences from the null model that have as good or better best local alignment score. Local alignment significance is used routinely for example in homology searches. In this thesis, a general framework is sketched that allows one to compute a tight upper bound for the p-value of a local pairwise alignment score. Unlike the previous methods, the presented framework is not affeced by so-called edge-effects and can handle gaps (deletions and insertions) without troublesome sampling and curve fitting.