The n crossing number of a graph G, denoted crn(G), is the minimum number of crossings in a drawing of G on an orientable surface of genus n. We prove that for every a > b > 0, there exists a graph G for which cr0(G) = a, cr1(G) = b, and cr2(G) = 0. This provides support for a conjecture of Archdeacon et al. and resolves a problem of Salazar.

This paper proposes a new equation to show the time domain features of jitter: Jitter = (Ti+1-Ti)/Ti. The subjects are tonal language speakers. Jitter is extracted from EGG signals. The results show that: (1) jitter does not obey Gaussian distribution but multimodal distribution; (2) the first peak position near zero of the jitter distribution curve increases with the pitch; (3) each peak posit...

The reconstruction of the trade routes along which garnets reached Europe in early Middle Ages demonstrates persistence long-distance after fall Western Roman Empire. Early medieval garnet jewellery from Italy and presence lapidary workshops are important evidence for understanding dynamics this commerce but systematically overlooked. Chemical trace-element analysis (LA-ICP-MS) loose inset glas...

introduction: antifertility effects of naturally occuring antisperm antibody (asa) in infertile couples and studies on experimental immunization of various animals with sperm antigens represent asa as an immunocontraceptive target. the effects of different factors on sperm immunogenecity and asa production have been studied and different results have been reported. in this study, whole sperm im...

We prove an analog of the Szemerédi-Trotter theorem in the plane for definable curves and points in any o-minimal structure over an arbitrary real closed field R. One new ingredient in the proof is an extension of the well known crossing number inequality for graphs to the case of embeddings in any o-minimal structure over an arbitrary real closed field.

This paper describes a methodology, and the results stemming from it, for analysing the dynamic encoding of speaker identity and dialect in prosodic parameters. A method based on employing properties of the well known Dynamic Time Warping (DTW) algorithm’s path of best match allows the separation of purely dynamic from static properties of acoustic parameters and hence their evaluation as to dy...

In this paper, we address a problem of safe and efficient intersection crossing traffic management of autonomous and connected ground traffic. Toward this objective, we propose an algorithm that is called the Discrete-time occupancies trajectory based Intersection traffic Coordination Algorithm (DICA). We first prove that the basic DICA is deadlock free and also starvation free. Then, we show t...

Deactivation routes of bright ππ* (La) and excimer charge transfer (CT) states have been mapped for two stacked quantum mechanical (CASPT2//CASSCF) adenines inside a solvated DNA double strand decamer (poly(dA)·poly(dT)) described at the molecular mechanics level. Calculations show that one carbon (C2) puckering is a common relaxation coordinate for both the La and CT paths. By mapping the lowe...

Pedestrian crashes are among the most common causes of death and serious injury to young children in the developed world. An initial phase of our research showed that younger children (6-7 year olds) and those with poor or under-developed functional skills may be at higher risk of crash involvement, compared with older children with well developed skills. While education is considered an essent...