The photophysics and photochemistry of kynurenine (KN) covalently bound to the amino acids lysine, cysteine, and histidine, the antioxidant glutathione, and the protein lysozyme have been studied by optical spectroscopy with femto- and nanosecond time resolution. The fluorescence quantum yield of the adducts of KN to amino acids is approximately 2 times higher than that of the free KN in soluti...

An associahedral set is a combinatorial object generated by Stasheff associahedra {Kn} and equipped with appropriate face and degeneracy operators. Associahedral sets are similar in many ways to simplicial or cubical sets. In this paper we give a formal definition of an associahedral set, discuss some naturally occurring examples and construct an explicit geometric diagonal ∆ : C∗(Kn) −→ C∗(Kn)...

Lower extremity injuries are a frequent outcome of automotive accidents. While the lower extremity injury criterion is based on fracture of bone, most injuries are of less severity. Recent studies suggest microscopic, occult fractures that have been shown to be precursors of gross bone fractures, may occur in the kneecap (patella) for impacts with rigid and deformable interfaces due to excessiv...

We write K or Kd for the set of convex bodies in Rd, that is, compact convex sets with nonempty interior in Rd. Assume K ∈ K and x1, . . . , xn are random, independent points chosen according to the uniform distribution in K. The convex hull of these points, to be denoted by Kn, is called a random polytope inscribed in K. Thus Kn = [x1, . . . , xn] where [S] stands for the convex hull of the se...

Computational modeling via the finite element method is an important tool used in injury biomechanics, and validation is required to give confidence in a model’s results. In the validation of the Global Human Body Models Consortium (GHBMC) mid-sized male model (M50), frontal and lateral validation was performed. This study presents a subset of that work, focusing on lateral impacts in full body...

For each positive integer n ≥ 2, there is a well-known regular orientable Hamiltonian embedding of Kn,n, and this generates a regular face 2-colourable triangular embedding of Kn,n,n. In the case n ≡ 0 (mod 8), and only in this case, there is a second regular orientable Hamiltonian embedding of Kn,n. The current paper presents an analysis of the face 2-colourable triangular embedding of Kn,n,n ...

We start with the simplest possible model. There are kn objects for sale and n potential buyers. The valuations vi are drawn independently from a common distribution F (vi) for all potential bidders. We assume that F has a continuous density function f . Suppose now that the objects are allocated according to the following rule: kn buyers with the highest bids receive the object and pay the pri...

The number of disjoint cocircuits in a matroid is bounded by its rank. There are, however, matroids with arbitrarily large rank that do not contain two disjoint cocircuits; consider, for example, M(Kn) and Un,2n. Also the bicircular matroids B(Kn) have arbitrarily large rank and have no 3 disjoint cocircuits. We prove that for each k and n there exists a constant c such that, if M is a matroid ...

The number of disjoint co-circuits in a matroid is bounded by its rank. There are, however, matroids with arbitrarily large rank that do not contain two disjoint co-circuits; consider, for example, M(Kn) and Un,2n. Also the bicircular matroids B(Kn) have arbitrarily large rank and have no 3 disjoint co-circuits. We prove that for each k and n there exists a constant c such that, if M is a matro...

In this paper we present a randomized algorithm for the multipacket routing problem on an n×nmesh. The algorithm completes with high probability in at the most kn + o(kn) parallel communication steps, with a queue size of k + o(k). The previous best known algorithm [3] takes 5 4 kn+O( kn f(n) ) steps with a queue size of O(k f(n)) (for any 1 ≤ f(n) ≤ n). The algorithm that we will present is op...