We describe a new algorithm that computes the nth Bernoulli number in n4/3+o(1) bit operations. This improves on previous algorithms that had complexity n2+o(1).

Using the water eliminated mechanism, reactions of 4-pyridinecarboxylic acid hydrazide and salicylaldehyde, benzaldehyde, cinnamaldehyde, and formaldehyde afforded the corresponding N(4)[(E)-1-(2-hydroxyphenyl) methylidene] (NHPM), N(4)-[(E)-2-phenylethylidene] (NPI), N(4)[(E,2E)-3-phenyl-2-propenylidene] (NPPI), and N(4)[(E) ethylidene] (NEI) isonicotinohydrazide, in high yields, after several...

Given a set S of n points in the plane, a radial ordering of S with respect to a point p (not in S) is a clockwise circular ordering of the elements in S by angle around p. If S is two-colored, a colored radial ordering is a radial ordering of S in which only the colors of the points are considered. In this paper, we obtain bounds on the number of distinct non-colored and colored radial orderin...

Recent research indicates that non-tonal novel events, deviating from an ongoing auditory environment, elicit a positive event-related potential (ERP), the novel P3. Although a variety of studies examined the neural network engaged in novelty detection, there is no complete picture of the underlying brain mechanisms. This experiment investigated these neural mechanisms by combining ERP and func...

The common bed bug is an obligate hematophagous parasite of humans. We studied the regulation of molting and metamorphosis in bed bugs with a goal to identify key players involved. qRT-PCR studies on the expression of genes known to be involved in molting and metamorphosis showed high levels of Krüppel homolog 1 [Kr-h1, a transcription factor that plays key roles in juvenile hormone (JH) action...

It has been well established that nitrogen coordinated transition metal, TM-N4-C (TM = Fe and Co) moieties, are responsible for the higher catalytic activity electrochemical oxygen reduction reaction. However, results obtained using density functional theory calculations vary from one to another, which can lead controversy. Herein, we assess accuracy of theoretical approach different class exch...

A basic result in graph theory says that any n-vertex tournament with in- and out-degrees larger than n−24 contains a Hamilton cycle, this is tight. In 1990, Bollobás Häggkvist significantly extended by showing for fixed k ε>0, sufficiently large n, all tournaments degrees at least n4+εn contain the k-th power of cycle. Up until now, there has not been progress on determining more accurate erro...