bluuebunny/crossref_metadata_2025_split huggingface dataset:
Citizenship and Politics: The Legacy of Wilton Park for Post-War Reconstruction
Authors: Welch David 
Published: September 2008

Writing in 1965 in Britain Looks to Germany, Donald Cameron Watt concluded:Perhaps the biggest successes scored by the Education Branch lay in the programme of exchange visits at all levels, in the discovery and encouragement of a new generation of teachers in Germany.…and most imaginatively of all in the opening up of the Wilton Park Centre to which leaders of opinion in Germany came for short residential courses on British democratic practice. Politicians, journalists, teachers, academics, trades unionists mingle together in these courses, and so valuable did the centre appear to German opinion that it was German initiative and German financial contribution which helped to preserve it in its present form when a niggardly Treasury and a disastrously unimaginative Foreign Secretary threatened to abolish it. Its impact on German life and on the political elites of West Germany has been incalculable.
Improved Bounds for Mixing Rates of Markov Chains and Multicommodity Flow
Authors: Sinclair Alistair 
Published: September 2008

The paper is concerned with tools for the quantitative analysis of finite Markov chains whose states are combinatorial structures. Chains of this kind have algorithmic applications in many areas, including random sampling, approximate counting, statistical physics and combinatorial optimisation. The efficiency of the resulting algorithms depends crucially on the mixing rate of the chain,i.e., the time taken for it to reach its stationary or equilibrium distribution.The paper presents a new upper bound on the mixing rate, based on the solution to a multicommodity flow problem in the Markov chain viewed as a graph. The bound gives sharper estimates for the mixing rate of several important complex Markov chains. As a result, improved bounds are obtained for the runtimes of randomised approximation algorithms for various problems, including computing the permanent of a 0–1 matrix, counting matchings in graphs, and computing the partition function of a ferromagnetic Ising system. Moreover, solutions to the multicommodity flow problem are shown to capture the mixing rate quite closely: thus, under fairly general conditions, a Markov chain is rapidly mixing if and only if it supports a flow of low cost.
Random Matrices and Brownian Motion
Authors: Goh William M. Y. , Schmutz Eric 
Published: September 2008

For T ∈ GLn (Fq), let Ωn (t, T) be the number of irreducible factors of degree less than or equal to nt in the characteristic polynomial of T. Letand suppose T is chosen from G Ln(Fq) at random uniformly. We prove that the stochastic process ≺Zn(t)≻t∈[0, 1] converges to the standard Brownian motion process W(t), as n → ∞.
A Discrete Analogue of a Theorem of Makarov
Authors: Lawler Gregory F. 
Published: September 2008

A theorem of Makarov states that the harmonic measure of a connected subset of ℝ2 is supported on a set of Hausdorff dimension one. This paper gives an analogue of this theorem for discrete harmonic measure, i.e., the hitting measure of simple random walk. It is proved that for any 1/2 < α < 1, β < α − 1/2, there is a constant k such that for any connected subset A ⊂ ℤ2 of radius n,where HA denotes discrete harmonic measure.
On Partitioning and Packing Products with Rectangles
Authors: Ahlswede Rudolf , Cai Ning 
Published: September 2008

In [1] we introduced and studied for product hypergraphs where ℋi = (i,ℰi), the minimal size π(ℋn) of a partition of into sets that are elements of . The main result was thatif the ℋis are graphs with all loops included. A key step in the proof concerns the special case of complete graphs. Here we show that (1) also holds when the ℋi are complete d-uniform hypergraphs with all loops included, subject to a condition on the sizes of the i. We also present an upper bound on packing numbers.
Block Reduced Lattice Bases and Successive Minima
Authors: Schnorr C. P. 
Published: September 2008

A lattice basis bi,…,bm is called block reduced with block size β if for every β consecutive vectors bi,…,bi+β−1, the orthogonal projections of bi,…,bi+β−1 in span(bi,…,bi−1)⊥ are reduced in the sense of Hermite and Korkin–Zolotarev. Let λi denote the successive minima of lattice L, and let b1,…,bm be a basis of L that is block reduced with block size β. We prove that for i = 1,…, mwhere γβ is the Hermite constant for dimension β. For block size β = 3 and odd rank m ≥ 3, we show thatwhere the maximum is taken over all block reduced bases of all lattices L. We present critical block reduced bases achieving this maximum. Using block reduced bases, we improve Babai's construction of a nearby lattice point. Given a block reduced basis with block size β of the lattice L, and given a point x in the span of L, a lattice point υ can be found in time βO(β) satisfyingThese results also give improvements on the method of solving integer programming problems via basis reduction.
On the Hardness of Approximating Some Optimization Problems That Are Supposedly Easier Than MAX CLIQUE
Authors: Verbitsky Oleg 
Published: September 2008

We focus our attention on the class RMAX(2) of NP optimization problems. Owing to recent developments in interactive proof techniques, RMAX(2) was shown to be the lowest class of logical classification that contains problems hard to approximate. Namely, the RMAX(2)-complete problem MAX CLIQUE (of finding the size of the largest clique in a graph) is not approximable in polynomial time within any constant factor unless NP=P.We are interested in problems inside RMAX(2) that are not known to be complete but are still hard to approximate. We point out that one such problem is MAXlog n, n, considered by Berman and Schnitger: given m conjunctions, each of them consisting of log m propositional variables or their negations, find the maximal number of simultaneously satisfiable conjunctions. We also obtain the approximation hardness results for some other problems in RMAX(2). Finally, we discuss the question of whether or not the problems under consideration are RMAX(2)-complete.
Valid Generalisation from Approximate Interpolation
Authors: Anthony Martin , Bartlett Peter , Ishai Yuval , Shawe-Taylor John 
Published: September 2008

Let and be sets of functions from domain X to ℝ. We say that validly generalises from approximate interpolation if and only if for each η > 0 and ∈, δ ∈ (0,1) there is m0(η, ∈, δ) such that for any function t ∈ and any probability distribution on X, if m > m0 then with m-probability at least 1 – δ, a sample X = (x1, X2,…,xm) ∈ Xm satisfiesWe find conditions that are necessary and sufficient for to validly generalise from approximate interpolation, and we obtain bounds on the sample length m0{η,∈,δ) in terms of various parameters describing the expressive power of .
Poisson mixtures
Authors: Church Kenneth W. , Gale William A. 
Published: September 2008

AbstractShannon (1948) showed that a wide range of practical problems can be reduced to the problem of estimating probability distributions of words and ngrams in text. It has become standard practice in text compression, speech recognition, information retrieval and many other applications of Shannon's theory to introduce a “bag-of-words” assumption. But obviously, word rates vary from genre to genre, author to author, topic to topic, document to document, section to section, and paragraph to paragraph. The proposed Poisson mixture captures much of this heterogeneous structure by allowing the Poisson parameter θ to vary over documents subject to a density function φ. φ is intended to capture dependencies on hidden variables such genre, author, topic, etc. (The Negative Binomial is a well-known special case where φ is a Г distribution.) Poisson mixtures fit the data better than standard Poissons, producing more accurate estimates of the variance over documents (σ2), entropy (H), inverse document frequency (IDF), and adaptation (Pr(x ≥ 2/x ≥ 1)).
A rule-based phrase parser for real-time text-to-speech synthesis
Authors: Bachenko Joan , Fitzpatrick Eileen , Daugherty Jeffrey 
Published: September 2008

AbstractText-to-speech systems are currently designed to work on complete sentences and paragraphs, thereby allowing front end processors access to large amounts of linguistic context. Problems with this design arise when applications require text to be synthesized in near real time, as it is being typed. How does the system decide which incoming words should be collected and synthesized as a group when prior and subsequent word groups are unknown? We describe a rule-based parser that uses a three cell buffer and phrasing rules to identify break points for incoming text. Words up to the break point are synthesized as new text is moved into the buffer; no hierarchical structure is built beyond the lexical level. The parser was developed for use in a system that synthesizes written telecommunications by Deaf and hard of hearing people. These are texts written entirely in upper case, with little or no punctuation, and using a nonstandard variety of English (e.g.WHEN DO I WILL CALL BACK YOU). The parser performed well in a three month field trial utilizing tens of thousands of texts. Laboratory tests indicate that the parser exhibited a low error rate when compared with a human reader.
Russian morphology: An engineering approach
Authors: Mikheev Andrei , Liubushkina Liubov 
Published: September 2008

AbstractMorphological analysis, which is at the heart of the processing of natural language requires computationally effective morphological processors. In this paper an approach to the organization of an inflectional morphological model and its application for the Russian language are described. The main objective of our morphological processor is not the classification of word constituents, but rather an efficient computational recognition of morpho-syntactic features of words and the generation of words according to requested morpho-syntactic features. Another major concern that the processor aims to address is the ease of extending the lexicon. The templated word-paradigm model used in the system has an engineering flavour: paradigm formation rules are of a bottom-up (word specific) nature rather than general observations about the language, and word formation units are segments of words rather than proper morphemes. This approach allows us to handle uniformly both general cases and exceptions, and requires extremely simple data structures and control mechanisms which can be easily implemented as a finite-state automata. The morphological processor described in this paper is fully implemented for a substantial subset of Russian (more then 1,500,000 word-tokens – 95,000 word paradigms) and provides an extensive list of morpho-syntactic features together with stress positions for words utilized in its lexicon. Special dictionary management tools were built for browsing, debugging and extension of the lexicon. The actual implementation was done in C and C++, and the system is available for the MS-DOS, MS-Windows and UNIX platforms.
A hierarchical Dirichlet language model
Authors: MacKay David J. C. , Peto Linda C. Bauman 
Published: September 2008

AbstractWe discuss a hierarchical probabilistic model whose predictions are similar to those of the popular language modelling procedure known as ‘smoothing’. A number of interesting differences from smoothing emerge. The insights gained from a probabilistic view of this problem point towards new directions for language modelling. The ideas of this paper are also applicable to other problems such as the modelling of triphomes in speech, and DNA and protein sequences in molecular biology. The new algorithm is compared with smoothing on a two million word corpus. The methods prove to be about equally accurate, with the hierarchical model using fewer computational resources.
High speed feature unification and parsing
Authors: Brown John C. 
Published: September 2008

AbstractFeature unification in parsing has previously used either inefficient Prolog programs, or LISP programs implementing early pre-WAM Prolog models of unification involving searches of binding lists, and the copying of rules to generate edges: features within rules and edges have traditionally been expressed as lists or functions, with clarity being preferred to speed of processing. As a result, parsing takes about 0·5 seconds for a 7-word sentence. Our earlier work produced an optimised chart parser for a non-unification context-free-grammar that achieved 5 ms parses, with high-ambiguity sentences involving hundreds of edges, using the grammar and sentences from Tomita's work on shift-reduce parsing with multiple stack branches. A parallel logic card design resulted that would speed this by a further factor of at least 17. The current paper extends this parser to treat a much more complex unification grammar with structures, using extensive indexing of rules and edges and the optimisations of top-down filtering and look-ahead, to demonstrate where unification occurs during parsing. Unification in parsing is distinguished from that in Prolog, and four alternative schemes for storing features and performing unification are considered, including the traditional binding-list method and three other methods optimised for speed for which overall unification times are calculated. Parallelisation of unification using cheap logic hardware is considered, and estimates show that unification will negligibly increase the parse time of our parallel parser card. Preliminary results are reported from a prototype serial parser that uses the fourth most efficient unification method, and achieves 7 ms for 7-word sentences, and under 1 s for a 36-word 360-way ambiguous sentence with 10,000 edges, on a conventional workstation.
Engineering “word experts” for word disambiguation
Authors: Berleant Daniel 
Published: September 2008

AbstractEvery word in the lexicon of a natural language is used distinctly from all the other words. A word expert is a small expert system-like module for processing a particular word based on other words in its vicinity. A word expert exploits the idiosyncratic nature of a word by using a set of context testing decision rules that test the identity and placement of context words to infer the word's role in the passage.The main application of word experts is disambiguating words. Work on word experts has never fully recognized previous related work, and a comprehensive review of that work would therefore contribute to the field. This paper both provides such a review, and describes guidelines and considerations useful in the design and construction of word expert based systems.
The discourse markerwellin the history of English
Authors: Jucker Andreas H. 
Published: September 2008

The discourse markerwellhas four distinct uses in Modern English: as a frame it introduces a new topic or prefaces direct reported speech; as a qualifier it prefaces a reply which is only a partial answer to a question; as a face-threat mitigator it prefaces a disagreement; and as a pause filler it bridges interactional silence.In Old Englishwellwas used on an interpersonal level as an emphatic attention-getting device (similar to Old Englishhwæt‘listen’, ‘behold’, or ‘what’). In Middle English,wellalways functioned as a frame on a textual level. In Early Modern English, and particularly in the plays by Shakespeare, the uses ofwelldiversified considerably and adopted interpersonal uses again.
Angiotensin II modulates CD40 expression in vascular smooth muscle cells
Authors: Souza Heraldo P. , Frediani Denise , Cobra Ana L. , Moretti Ana I. , Jurado Márcia C. , Fernandes Thadeu R. , Cardounel Arturo J. , Zweier Jay L. , Tostes Rita C. 
Published: September 2008

The signalling pathway CD40/CD40L (CD40 ligand) plays an important role in atherosclerotic plaque formation and rupture. AngII (angiotensin II), which induces oxidative stress and inflammation, is also implicated in the progression of atherosclerosis. In the present study, we tested the hypothesis that AngII increases CD40/CD40L activity in vascular cells and that ROS (reactive oxygen species) are part of the signalling cascade that controls CD40/CD40L expression. Human CASMCs (coronary artery smooth muscle cells) in culture exposed to IL (interleukin)-1β or TNF-α (tumour necrosis factor-α) had increased superoxide generation and enhanced CD40 expression, detected by EPR (electron paramagnetic resonance) and immunoblotting respectively. Both phenomena were abolished by previous incubation with membrane-permeant antioxidants or cell transfection with p22phoxantisense. AngII (50–200 nmol/l) induced an early and sustained increase in CD40 mRNA and protein expression in CASMCs, which was blocked by treatment with antioxidants. Increased CD40 expression led to enhanced activity of the pathway, as AngII-treated cells stimulated with recombinant CD40L released higher amounts of IL-8 and had increased COX-2 (cyclo-oxygenase-2) expression. We conclude that AngII stimulation of vascular cells leads to a ROS-dependent increase in CD40/CD40L signalling pathway activity. This phenomenon may be an important mechanism modulating the arterial injury observed in atherosclerosis-related vasculopathy.
MPI-LIT: a literature-curated dataset of microbial binary protein--protein interactions
Authors: Rajagopala Seesandra V. , Goll Johannes , Gowda N.D. Deve , Sunil Kumar C. , Titz Björn , Mukherjee Arnab , Mary Sharmila S. , Raviswaran Naresh , Poojari Chetan S. , Ramachandra Srinivas , Shtivelband Svetlana , Blazie Stephen M. , Hofmann Julia , Uetz Peter 
Published: September 2008

Abstract
Prokaryotic protein–protein interactions are underrepresented in currently available databases. Here, we describe a ‘gold standard’ dataset (MPI-LIT) focusing on microbial binary protein–protein interactions and associated experimental evidence that we have manually curated from 813 abstracts and full texts that were selected from an initial set of 36 852 abstracts. The MPI-LIT dataset comprises 1237 experimental descriptions that describe a non-redundant set of 746 interactions of which 659 (88%) are not reported in public databases. To estimate the curation quality, we compared our dataset with a union of microbial interaction data from IntAct, DIP, BIND and MINT. Among common abstracts, we achieve a sensitivity of up to 66% for interactions and 75% for experimental methods. Compared with these other datasets, MPI-LIT has the lowest fraction of interaction experiments per abstract (0.9) and the highest coverage of strains (92) and scientific articles (813). We compared methods that evaluate functional interactions among proteins (such as genomic context or co-expression) which are implemented in the STRING database. Most of these methods discriminate well between functionally relevant protein interactions (MPI-LIT) and high-throughput data.
Availability: http://www.jcvi.org/mpidb/interaction.php?dbsource=MPI-LIT.
Contact: raja@jcvi.org
Supplementary information: Supplementary data are available at Bioinformatics online.
First Report of Pea enation mosaic virus Infecting Pea and Broad Bean in Spain
Authors: Tornos T. , Cebrián M. C. , Córdoba-Sellés M. C. , Alfaro-Fernández A. , Herrera-Vásquez J. A. , Font M. I. , Jorda M. C. 
Published: September 2008

During the spring of 2007, pea plants (Pisum sativum L.) (cvs. Utrillo and Floreta) showing virus-like symptoms were observed in several commercial fields in the southern and eastern regions of Catalonia, Spain. Incidence of symptomatic plants ranged from 5 to 15% and was distributed in both small and large patches. Infected plants exhibited yellow mosaic leaf symptoms that later became translucent. Leaves gradually curled and in some cases developed enations near the veins on the abaxial surface. Plants were “bushy” and had shortened internodes. Infection prior to pod formation resulted in pods that were distorted and stunted (1). The infected leaves and pods were tested by indirect-ELISA with a potyvirus-specific antibody (Agdia, Elkhart, IN) and double-antibody sandwich (DAS)-ELISA with antibodies specific to Pea enation mosaic virus (PEMV), Broad bean wilt virus 1 (BBWV-1), Beet western yellow virus (BWYV), Bean yellow mosaic virus (BYMV), Alfalfa mosaic virus (AMV), and Tomato spotted wilt virus (TSWV) (Loewe Biochemica GmbH, Sauerlach, Germany). PEMV was detected in all 24 symptomatic samples that were collected from 10 locations between March 2007 and March 2008. Thirteen of these samples also tested positive for BWYV, but no differences in symptom expression were observed in plants infected with both viruses or PEMV alone. PEMV was also identified in seven broad bean plants (Vicia faba L.) from three additional locations. These plants expressed interveinal yellow mosaic on leaves and deformed pods. The genomic sequence of PEMV-1 (GenBank Accession No. L04573) was used to design primers to amplify a 451-nt segment of the polymerase gene by reverse transcription (RT)-PCR; PEMV-D (5′-TGACCATGAGTCCACTGAGG-3′), PEMV-R (5′-AGTATCTTCCAACAACCACAT-3′). One ELISA-positive sample was analyzed and the expected size amplicon was generated. Direct sequencing (GenBank Accession No. EU652339) revealed that PEMV-1 and our pea isolate have nucleotide sequence identities of 95%. To our knowledge, this is the first report of PEMV in Spain, which might cause important economical losses since PEMV is an important viral disease of pea and other legumes worldwide. Reference: (1) J. S. Skaf and G. A. Zoeten. No. 372 (No. 257 revised) in: Description of Plant Viruses. AAB, Kew, Surrey, England, 2000.
First Report of White Mold Caused by Sclerotinia sclerotiorum on Sweet Basil in Turkey
Authors: Tok F. M. 
Published: September 2008

In February of 2008, wilt and collapse of sweet basil (Ocimum basilicum L.) was observed on approximately 20% of the plants in a commercial greenhouse in Demre, Antalya, Turkey. Crown and stems of infected plants were necrotic; leaves turned brown and wilted. Profuse, white mycelia and occasionally black sclerotia were found inside and outside of affected stems. Sclerotinia sclerotiorum (Lib). de Bary, identified based on morphological characteristics was isolated from sclerotia and symptomatic stems on potato dextrose agar amended with tetracycline. To conduct pathogenicity tests, sclerotia produced on carrot discs were surface disinfested in 70% ethanol and dried on sterilized filter papers. Ten sclerotia were placed in 9-cm-diameter glass petri plates containing 15 ml of sterilized distilled water. Plates were wrapped with Parafilm and incubated at 4°C for 5 to 6 weeks in the dark. Plates were then incubated at 15°C in 12 h of dark and 12 h of light. Apothecia developed after 2 weeks. Ascospores were harvested from apothecia with distilled water by crushing and shaking the apothecia in centrifuge tubes. Thirty basil plants sprayed with ascospores (106 spores per ml) were maintained in a growth chamber at 22°C and 90% humidity. After 2 weeks, necrotic leaves and stems were observed on all inoculated plants. S. sclerotiorum was recovered from symptomatic tissues. No symptoms developed on the 30 basil plants sprayed with sterile distilled water. The pathogenicity test was repeated with similar results. S. sclerotiorum on basil has been reported in Canada (4), the United States, (2,3), and Italy (1). To our knowledge, this is the first report of S. sclerotiorum on basil in Turkey. References: (1) A. Garibaldi et al. Plant Dis. 81:124, 1997. (2) G. E. Holcomb and M. J. Reed. Plant Dis. 78:924, 1994. (3) S. T. Koike. Plant Dis. 84:1342, 2000. (4) T. C. Paulitz. Plant Dis. 81:229, 1997.