Mathematics achievement and interest in mathematics from a differential perspective

In this article, we present results of an empirical study with 500 German students of grades 7 and 8. The study focussed on students' mathematics achievement and their interest in mathematics as well as on the relation between these two constructs. In particular, the results show that the development of an individual student's achievement between grade 7 and grade 8 depends on the achievement level of the specific classroom and therefore on the specific mathematics instruction Interest in mathematics could be regarded a predictor for mathematics achievement Moreover, our findings suggest that the students show hardly any fear of mathematics independent of their achievement level.     

New heuristics for over-constrained flight to gate assignments

We consider the over-constrained Airport Gate Assignment Problem where the number of flights exceed the number of gates available, and where the objectives are to minimize the number of ungated flights and the total walking distances. The problem is formulated as a binary quadratic programming problem. We design a greedy algorithm and use a Tabu Search meta-heuristic to solve the problem. The greedy algorithm minimizes ungated flights while we devise a new neighbourhood search technique, the Interval Exchange Move, which allows us flexibility in seeking good solutions, especially when flight schedules are dense in time. Experiments conducted give good results.     

Spin-trapped hydroxyl free radicals studied at low field by Field-Cycled Dynamic Nuclear Polarization

The technique of Field-Cycled Dynamic Nuclear Polarization (FC-DNP) involves the EPR irradiation of a free radical solution and the subsequent observation of the NMR signal, the experiment being carried out at a range of magnetic field strengths in order to measure the free radical’s EPR spectrum. In this work FC-DNP has been used to study the EPR spectrum of DMPO spin-trapped hydroxyl free radicals at magnetic field strengths between 0.5 mT and 13.0 mT (5–130 Gauss). The low-field EPR spectrum contains six separate EPR lines, in contrast to the well-known X-band spectrum where only four are seen. Knowledge of the spin-adduct’s EPR spectrum will be of use to workers involved in low-field EPR, especially those conducting biological or in-vivo spin-trapping experiments.     

How to Build Robust Shared Control Systems

Previous researchers have designed shared control schemes with a view to minimising the likelihood that participants will conspire to perform an unauthorised act. But, human nature being what it is, systems inevitably fail; so shared control schemes should also be designed so that the police can identify conspirators after the fact. This requirement leads us to search for schemes with sparse access structures. We show how this can be done using ideas from coding theory. In particular, secret sharing schemes based on geometric codes whose dual [n,k,d] codes have d and n as their only nonzero weights are suitable. We determine their access structures and analyse their properties. We have found almost all of them, and established some relations among codes, designs and secret-sharing schemes.     

Electron attenuation lengths in fullerene and fullerides

Using X-ray photoemission measurements, we have determined the attenuation length of C 1s photoelectrons in C₆₀ film to be 21.5 Å with the incident photon energy of Mg Kα radiation. The inelastic mean free path calculated with the TPP-2M algorithm coincides fairly well with the experimentally determined attenuation length, indicating the validity of the algorithm to fullerene and fullerides. The inelastic mean free paths for some fullerides, i.e. K₃C₆₀, K₆C₆₀, Ba₄C₆₀, Sm_2.75C₆₀ and Sm₆C₆₀ are calculated to help the quantitative analyses of the photoemission spectra for these compounds.     

Bargaining over the division of a shrinking pie: An axiomatic approach

The Bargaining Problem paradigm is extended to time-consuming conflict situations. Such a situation can be represented by a chain of bargaining domains, each representing the conflict at a different point in time. The solution function selects a point in the union of all these domains. We characterize a solution function which satisfies several requirements and explore its properties. One of the results is that an extension of the Adding requirement (Thomson-Myerson 1980) is enough, under some conditions, to yield a solution point, so there is no need to extend the stronger requirements of Independence of Irrelevant Alternatives (Nash 1950) or Monotonicity (Kalai-Smorodinsky 1975).     

Constructions of External Difference Families and Disjoint Difference Families

External difference families (EDFs) are a type of new combinatorial designs originated from cryptography. In this paper, some earlier ideas of recursive and cyclotomic constructions of combinatorial designs are extended, and a number of classes of EDFs and disjoint difference families are presented. A link between a subclass of EDFs and a special type of (almost) difference sets is set up.     

Spin-transfer switching in MgO magnetic tunnel junction nanostructures

Spin-transfer driven switching was observed in MgO based magnetic tunnelling junctions (MTJ) with tunnelling magnetoresistance ratio of up to 160% and the average intrinsic switching current density (J_c0) down to 2 MA/cm², which are the best known results reported in spin-transfer switched MTJ nanostructures. Based on a comparison of results both from MgO and AlO_x MTJs, further switching current decrease via MgO dual structures with two pinned layers is discussed.     

Interior point cutting plane method for optimal power flow

In this paper, an interior point cutting plane method (IPCPM)is applied to solve optimal power flow (OPF) problems. Comparedwith the simplex cutting plane method (SCPM), the IPCPM is simpler,and efficient because of its polynomial-time characteristic.Issues in implementing IPCPM for OPF problems are addressed,including (1) how to generate cutting planes without using thesimplex tableau, (2) how to identify the basis variables inIPCPM, and (3) how to generate mixed integer cutting planes.The calculation speed of the proposed algorithm is further enhancedby utilizing the sparsity features of the OPF formulation. Numericalsimulations on IEEE 14-300-bus test systems have shown thatthe proposed method is effective.