Before and Beyond the Bachelor Machine

This paper will examine the importance of Marcel Duchamp’s La Machine Célibataire (The Bachelor) on Art and Technology in the 20th and 21st centurie

Experimental asymmetric phase-covariant quantum cloning of polarization qubits

We report on two optical realizations of the $1 \to 2$ asymmetric phase-covariant cloning machines for polarization states of single photons. The experimental setups combine two-photon interference and tunable polarization filtering that enables us to control the asymmetry of the cloners. The first scheme involves a special unbalanced bulk beam splitter exhibiting different splitting ratios for vertical and horizontal polarizations, respectively. The second implemented scheme consists of a balanced fiber coupler where photon bunching occurs, followed by a free-space part with polarization filters. With this later approach we were able to demonstrate very high cloning fidelities which are above the universal cloning limit.Comment: 7 pages, 8 figure

Special Libraries, March 1943

Volume 34, Issue 3https://scholarworks.sjsu.edu/sla_sl_1943/1002/thumbnail.jp

Postmortem iris recognition and its application in human identification

Iris recognition is a validated and non-invasive human identification technology currently implemented for the purposes of surveillance and security (i.e. border control, schools, military). Similar to deoxyribonucleic acid (DNA), irises are a highly individualizing component of the human body. Based on a lack of genetic penetrance, irises are unique between an individual’s left and right iris and between identical twins, proving to be more individualizing than DNA. At this time, little to no research has been conducted on the use of postmortem iris scanning as a biometric measurement of identification. The purpose of this pilot study is to explore the use of iris recognition as a tool for postmortem identification. Objectives of the study include determining whether current iris recognition technology can locate and detect iris codes in postmortem globes, and if iris scans collected at different postmortem time intervals can be identified as the same iris initially enrolled. Data from 43 decedents involving 148 subsequent iris scans demonstrated a subsequent match rate of approximately 80%, supporting the theory that iris recognition technology is capable of detecting and identifying an individual’s iris code in a postmortem setting. A chi-square test of independence showed no significant difference between match outcomes and the globe scanned (left vs. right), and gender had no bearing on the match outcome. There was a significant relationship between iris color and match outcome, with blue/gray eyes yielding a lower match rate (59%) compared to brown (82%) or green/hazel eyes (88%), however, the sample size of blue/gray eyes in this study was not large enough to draw a meaningful conclusion. An isolated case involving an antemortem initial scan collected from an individual on life support yielded an accurate identification (match) with a subsequent scan captured at approximately 10 hours postmortem. Falsely rejected subsequent iris scans or "no match" results occurred in about 20% of scans; they were observed at each PMI range and varied from 19-30%. The false reject rate is too high to reliably establish non-identity when used alone and ideally would be significantly lower prior to implementation in a forensic setting; however, a "no match" could be confirmed using another method. Importantly, the data showed a false match rate or false accept rate (FAR) of zero, a result consistent with previous iris recognition studies in living individuals. The preliminary results of this pilot study demonstrate a plausible role for iris recognition in postmortem human identification. Implementation of a universal iris recognition database would benefit the medicolegal death investigation and forensic pathology communities, and has potential applications to other situations such as missing persons and human trafficking cases

Shena Simon College: report from the Inspectorate (FEFC inspection report; 23/96 and 110/00)

The Further Education Funding Council has a legal duty to make sure further education in England is properly assessed. The FEFC’s inspectorate inspects and reports on each college of further education according to a four-year cycle. This record comprises the reports for periods 1995-96 and 1999-2000

A Computation in a Cellular Automaton Collider Rule 110

A cellular automaton collider is a finite state machine build of rings of one-dimensional cellular automata. We show how a computation can be performed on the collider by exploiting interactions between gliders (particles, localisations). The constructions proposed are based on universality of elementary cellular automaton rule 110, cyclic tag systems, supercolliders, and computing on rings.Comment: 39 pages, 32 figures, 3 table

Complexity of Small Universal Turing Machines: A Survey

We survey some work concerned with small universal Turing machines, cellular automata, tag systems, and other simple models of computation. For example it has been an open question for some time as to whether the smallest known universal Turing machines of Minsky, Rogozhin, Baiocchi and Kudlek are efficient (polynomial time) simulators of Turing machines. These are some of the most intuitively simple computational devices and previously the best known simulations were exponentially slow. We discuss recent work that shows that these machines are indeed efficient simulators. In addition, another related result shows that Rule 110, a well-known elementary cellular automaton, is efficiently universal. We also discuss some old and new universal program size results, including the smallest known universal Turing machines. We finish the survey with results on generalised and restricted Turing machine models including machines with a periodic background on the tape (instead of a blank symbol), multiple tapes, multiple dimensions, and machines that never write to their tape. We then discuss some ideas for future work