When Does a Polynomial Over a Finite Field Permute the Elements of the Field?

We present a class of indecomposable polynomials of non prime-power degree over the finite field of two elements which are permutation polynomials on infinitely many finite extensions of the field. The associated geometric monodromy groups are the simple ...

on quadratic bent functions in polynomial forms

In this correspondence, we construct some new quadratic bent functions in polynomial forms by using the theory of quadratic forms over finite fields. The results improve some previous work. Moreover, we solve a problem left by Yu and Gong in 2006.

LEAST-SQUARES POLYNOMIAL SMOOTHING FOR INDUCTIVELY COUPLED PLASMA ATOMIC EMISSION-SPECTRA

The use of least-squres polynomial smoothing in ICP-AES is discussed and a method of points insertion into spectral scanning intervals is proposed in the present paper. Optimal FWHM/SR ratio can be obtained, and distortion of smoothed spectra can be avoided by use of the recommended method.

Towards national identities: Welsh theatres

Williams, Ioan. 'Towards national identities: Welsh theatres', In: The Cambridge History of British Theatre, (Eds) Kershaw, Baz., Cambridge University Press, 2004, pp.242-272 RAE2008

On the Performance of Polynomial-time CLIQUE Approximation Algorithms on Very Large Graphs

The performance of a randomized version of the subgraph-exclusion algorithm (called Ramsey) for CLIQUE by Boppana and Halldorsson is studied on very large graphs. We compare the performance of this algorithm with the performance of two common heuristic algorithms, the greedy heuristic and a version of simulated annealing. These algorithms are tested on graphs with up to 10,000 vertices on a workstation and graphs as large as 70,000 vertices on a Connection Machine. Our implementations establish the ability to run clique approximation algorithms on very large graphs. We test our implementations on a variety of different graphs. Our conclusions indicate that on randomly generated graphs minor changes to the distribution can cause dramatic changes in the performance of the heuristic algorithms. The Ramsey algorithm, while not as good as the others for the most common distributions, seems more robust and provides a more even overall performance. In general, and especially on deterministically generated graphs, a combination of simulated annealing with either the Ramsey algorithm or the greedy heuristic seems to perform best. This combined algorithm works particularly well on large Keller and Hamming graphs and has a competitive overall performance on the DIMACS benchmark graphs.

Determining Acceptance Possibility for a Quantum Computation is Hard for the Polynomial Hierarchy

It is shown that determining whether a quantum computation has a non-zero probability of accepting is at least as hard as the polynomial time hierarchy. This hardness result also applies to determining in general whether a given quantum basis state appears with nonzero amplitude in a superposition, or whether a given quantum bit has positive expectation value at the end of a quantum computation. This result is achieved by showing that the complexity class NQP of Adleman, Demarrais, and Huang, a quantum analog of NP, is equal to the counting class coC=P.

Deciding Isomorphisms of Simple Types in Polynomial Time

The isomorphisms holding in all models of the simply typed lambda calculus with surjective and terminal objects are well studied - these models are exactly the Cartesian closed categories. Isomorphism of two simple types in such a model is decidable by reduction to a normal form and comparison under a finite number of permutations (Bruce, Di Cosmo, and Longo 1992). Unfortunately, these normal forms may be exponentially larger than the original types so this construction decides isomorphism in exponential time. We show how using space-sharing/hash-consing techniques and memoization can be used to decide isomorphism in practical polynomial time (low degree, small hidden constant). Other researchers have investigated simple type isomorphism in relation to, among other potential applications, type-based retrieval of software modules from libraries and automatic generation of bridge code for multi-language systems. Our result makes such potential applications practically feasible.

People and place in the new frontier: an examination of Han and Uyghur ethnic identities

This thesis demonstrates how Han and Uyghur ethnic identities are constructed in urban Xinjiang, how they have evolved over time and how both identities gain their meaning largely from a process of interaction with the ‘other’. It shows that the boundaries that exist between Uyghur and Han hugely influence the identity content of both. Based on over 120 interviews carried out over 3 years, it brings a clear analytical framework and conceptual clarity to the questions of how ethnic identities are constructed and maintained in Xinjiang

Place, teenagers and urban identities: Growing up in the revanchist city

The recreational lives of teenagers in Ireland has been the subject of much debate in recent years. The subject has received much attention from academics, particularly in the UK and the US. In Ireland there is a dearth of research on, and a poor understanding of teenagers recreational lives. Additionally much of the research from the UK and the US to date has been focused on teenagers’ use of the street for recreation, arguing that teenagers are increasingly pushed out of public space. The research frequently emphasises teenagers’ resistance against adult hegemony. This thesis explores the recreational geographies of teenagers living in two socially and economically distinct neighbourhoods in Cork. It seeks to fill in gaps in knowledge of teenagers recreational lives in Ireland and contribute to geographical wisdom on teenagers’ geographies. Using a mixed method approach and a variety of thinking tools this research shows that teenagers living in Cork are growing up in a revanchist society. The thesis demonstrates how teenagers’ recreational practices are currently being configured in Irish society, unfolding strategies of dominance and affection which construct and regulate the recreational lives of teenagers. The effects of revanchism on teenagers’ experiences of outdoor space for recreation are also pursued. Furthermore the socio-spatial contingencies of teenagers’ recreational lives and revanchism are probed throughout the thesis, but in greater depth in the final chapters. The work also addresses an under-researched aspect of young people’s recreational - relationships with pets. Lastly, the subject of teenagers’ right to urban space is critically analysed.

A polynomial algorithm for the three-machine open shop with a bottleneck machine

The paper considers the three‐machine open shop scheduling problem to minimize themakespan. It is assumed that each job consists of at most two operations, one of which is tobe processed on the bottleneck machine, the same for all jobs. A new lower bound on theoptimal makespan is derived, and a linear‐time algorithm for finding an optimalnon‐preemptive schedule is presented.