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.

Alexander Mackay : missionary hero of Uganda.

http://www.archive.org/details/alexandermackay00unknuoft/

The life and work of Lucinda B. Helm : founder of the Woman's Parsonage and Home Mission Society of the M.E. church, South / by Arabel Wilbur Alexander.

http://purl.oclc.org/KUK/KDL/B92-53-27061877

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.

The abelianization of the Johnson kernel

We prove that the first complex homology of the Johnson subgroup of the Torelli group Tg is a non-trivial, unipotent Tg-module for all g ≥ 4 and give an explicit presentation of it as a Sym H 1(Tg,C)-module when g ≥ 6. We do this by proving that, for a finitely generated group G satisfying an assumption close to formality, the triviality of the restricted characteristic variety implies that the first homology of its Johnson kernel is a nilpotent module over the corresponding Laurent polynomial ring, isomorphic to the infinitesimal Alexander invariant of the associated graded Lie algebra of G. In this setup, we also obtain a precise nilpotence test. © European Mathematical Society 2014.

THE COMPLETE PRELUDES OF ALEXANDER SCRIABIN: THE EVOLUTION OF HIS REVOLUTIONARY COMPOSITIONAL STYLE

During the second half of the nineteenth century, a series of remarkable advances in musical composition emerged in the works of such innovative spirits as Franz Liszt, Hector Berlioz and Richard Wagner. Their pioneering works exerted an extraordinary impact on the music of the subsequent generation of composers--of disparate nationalities-who were active at the dawn of the 20th century: Including most notably Claude-Achille Debussy, Gustav Mahler, Richard Strauss, and Alexander Nikolayevich Scriabin. These important musical figures, each one leaving an indelible and formative imprint on late-nineteenth century Romantic style, together launched the modern era in music. Scriabin stands alone as a transcendental visionary: His music, initiated in the fashion of Chopin and Liszt, wanders through the realms of Debussy and Wagner, and, ultimately abandoning late Romantic tradition, unlocks the heretofore unforeseen power of atonality, bitonality, polyrhythms and key-signature free compositions. Arguably, Scriabin's compositions count among the most innovative, idiosyncratic and bewitching of all time. The development of Scriabin's groundbreaking compositional style is best understood by means of his piano works, which comprise the majority of his oeuvre. Beyond the larger works-his twelve sonatas, a concerto and a fantasy-Scriabin's piano explorations are also represented by miniature gems: The mazurkas, impromptus, waltzes, poems, a polonaise, etudes, nocturnes, morceaux and, in particular, the preludes. Scriabin's 90 preludes for piano, arranged in several opus numbers, richly exemplify the striking evolution of his ingenious music, his idiosyncratic philosophy and his provocative personality.

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.