Minimal Type Theory (MTT)

Minimal Type Theory (MTT) is based on type theory in that it is agnostic about Predicate Logic level and expressly disallows the evaluation of incompatible types. It is called Minimal because it has the fewest possible number of fundamental types, and has all of its syntax expressed entirely as the connections in a directed acyclic graph

The challenge of ensuring gender equality in Vietnamese and English high schools: espoused and real commitments

Purpose: This research study examines the issue of gender equality in high schools in Vietnam and England. Design: Data gathering consisted of interviews with teachers in two high schools and the staff of a pedagogic university in Vietnam and staff of one high school and of the Initial Teacher Training department of a University in England. Data was analysed using a combination of grounded theory, cross-cultural study, and narrative analysis within a liberal feminist framework. Findings: The main findings from Vietnam include that despite a strong commitment to gender equality by the central government both pedagogy and curriculum in Vietnamese High Schools fail to promote gender equality and that gender equality is, therefore, espoused rather than enacted. Findings from England revealed considerable success had been achieved in gaining equality of both opportunity and outcomes but that a more sophisticated discourse on gender in education needed to emerge

Tunnel spin polarization of Ni80Fe20/SiO2 probed with a magnetic tunnel transistor

The tunnel spin polarization of Ni80Fe20/SiO2 interfaces has been investigated using a magnetic tunnel transistor (MTT). The MTT with a Ni80Fe20/SiO2 emitter shows a magnetocurrent of 74% at 100 K, corresponding to a tunnel spin polarization of the Ni80Fe20/SiO2 interface of 27%. This is only slightly lower than the value of 34% for Ni80Fe20/Al2O3 interfaces determined in similar MTT structures. This suggests that SiO2 can be applied in semiconductor spintronic devices, for example in ferromagnet/SiO2/Si tunnel contacts for spin injection.\ud \u

An analysis of the Bayesian track labelling problem

In multi-target tracking (MTT), the problem of assigning labels to tracks (track labelling) is vastly covered in literature, but its exact mathematical formulation, in terms of Bayesian statistics, has not been yet looked at in detail. Doing so, however, may help us to understand how Bayes-optimal track labelling should be performed or numerically approximated. Moreover, it can help us to better understand and tackle some practical difficulties associated with the MTT problem, in particular the so-called ``mixed labelling'' phenomenon that has been observed in MTT algorithms. In this memorandum, we rigorously formulate the optimal track labelling problem using Finite Set Statistics (FISST), and look in detail at the mixed labeling phenomenon. As practical contributions of the memorandum, we derive a new track extraction formulation with some nice properties and a statistic associated with track labelling with clear physical meaning. Additionally, we show how to calculate this statistic for two well-known MTT algorithms

HELAC-Onia: an automatic matrix element generator for heavy quarkonium physics

By the virtues of the Dyson-Schwinger equations, we upgrade the published code \mtt{HELAC} to be capable to calculate the heavy quarkonium helicity amplitudes in the framework of NRQCD factorization, which we dub \mtt{HELAC-Onia}. We rewrote the original \mtt{HELAC} to make the new program be able to calculate helicity amplitudes of multi P-wave quarkonium states production at hadron colliders and electron-positron colliders by including new P-wave off-shell currents. Therefore, besides the high efficiencies in computation of multi-leg processes within the Standard Model, \mtt{HELAC-Onia} is also sufficiently numerical stable in dealing with P-wave quarkonia (e.g. $h_{c,b},\chi_{c,b}$) and P-wave color-octet intermediate states. To the best of our knowledge, it is a first general-purpose automatic quarkonium matrix elements generator based on recursion relations on the market.Comment: Published version. 24 pages,1 figure, 7 tables, HELAC-Onia is available from http://helac-phegas.web.cern.ch/helac-phega