Conditioning of Random Conic Systems Under a General Family of Input Distributions

We consider the conic feasibility problem associated with the linear homogeneous system Ax≤0, x≠0. The complexity of iterative algorithms for solving this problem depends on a condition number C(A). When studying the typical behavior of algorithms under stochastic input, one is therefore naturally led to investigate the fatness of the tails of the distribution of C(A). Introducing the very general class of uniformly absolutely continuous probability models for the random matrix A, we show that the distribution tails of C(A) decrease at algebraic rates, both for the Goffin–Cheung–Cucker number C _G and the Renegar number C _R . The exponent that drives the decay arises naturally in the theory of uniform absolute continuity, which we also develop in this paper. In the case of C _G , we also discuss lower bounds on the tail probabilities and show that there exist absolutely continuous input models for which the tail decay is subalgebraic. R. Hauser was supported by a grant of the Nuffield Foundation under the “Newly Appointed Lecturers” grant scheme (project number NAL/00720/G) and through grant GR/S34472 from the Engineering and Physical Sciences Research Council of the UK. The research in this paper was conducted while T. Müller was a research student at the University of Oxford. He was partially supported by EPSRC, the Oxford University Department of Statistics, Bekker-la-Bastide fonds, Dr. Hendrik Muller’s Vaderlandsch fonds, and Prins Bernhard Cultuurfonds.     

Maximal exponents of polyhedral cones (I)

Let K be a proper (i.e., closed, pointed, full convex) cone in Rn. An n×n matrix A is said to be K-primitive if there exists a positive integer k such that ; the least such k is referred to as the exponent of A and is denoted by γ(A). For a polyhedral cone K, the maximum value of γ(A), taken over all K-primitive matrices A, is called the exponent of K and is denoted by γ(K). It is proved that if K is an n-dimensional polyhedral cone with m extreme rays then for any K-primitive matrix A, γ(A)?(mA−1)(m−1)+1, where mA denotes the degree of the minimal polynomial of A, and the equality holds only if the digraph (E,P(A,K)) associated with A (as a cone-preserving map) is equal to the unique (up to isomorphism) usual digraph associated with an m×m primitive matrix whose exponent attains Wielandt's classical sharp bound. As a consequence, for any n-dimensional polyhedral cone K with m extreme rays, γ(K)?(n−1)(m−1)+1. Our work answers in the affirmative a conjecture posed by Steve Kirkland about an upper bound of γ(K) for a polyhedral cone K with a given number of extreme rays.     

Large Monotone Paths in Graphs with Bounded Degree

 We prove that for every ε>0 and positive integer r, there exists Δ₀=Δ₀(ε) such that if Δ>Δ₀ and n>n(Δ,ε,r) then there exists a packing of K _n with ⌊(n−1)/Δ⌋ graphs, each having maximum degree at most Δ and girth at least r, where at most εn ² edges are unpacked. This result is used to prove the following: Let f be an assignment of real numbers to the edges of a graph G. Let α(G,f) denote the maximum length of a monotone simple path of G with respect to f. Let α(G) be the minimum of α(G,f), ranging over all possible assignments. Now let α_Δ be the maximum of α(G) ranging over all graphs with maximum degree at most Δ. We prove that Δ+1≥α_Δ≥Δ(1−o(1)). This extends some results of Graham and Kleitman [6] and of Calderbank et al. [4] who considered α(K _n ). Received: March 15, 1999?Final version received: October 22, 1999     

Notions and relations for RKA-secure permutation and function families

The theory of designing block ciphers is mature, having seen significant progress since the early 1990s for over two decades, especially during the AES development effort. Nevertheless, interesting directions exist, in particular in the study of the provable security of block ciphers along similar veins as public-key primitives, i.e. the notion of pseudorandomness (PRP) and indistinguishability (IND). Furthermore, recent cryptanalytic progress has shown that block ciphers well designed against known cryptanalysis techniques including related-key attacks (RKA) may turn out to be less secure against RKA than expected. The notion of provable security of block ciphers against RKA was initiated by Bellare and Kohno, and subsequently treated by Lucks. Concrete block cipher constructions were proposed therein with provable security guarantees. In this paper, we are interested in the security notions for RKA-secure block ciphers. In the first part of the paper, we show that secure tweakable permutation families in the sense of strong pseudorandom permutation (SPRP) can be transformed into secure permutation families in the sense of SPRP against some classes of RKA (SPRP–RKA). This fact allows us to construct a secure SPRP–RKA cipher which is faster than the Bellare–Kohno PRP–RKA cipher. We also show that function families of a certain form secure in the sense of a pseudorandom function (PRF) can be transformed into secure permutation families in the sense of PRP against some classes of RKA (PRP–RKA). We can exploit it to get various constructions secure against some classes of RKA from known MAC algorithms. Furthermore, we discuss how the key recovery (KR) security of the Bellare–Kohno PRP–RKA, the Lucks PRP–RKA and our SPRP–RKA ciphers relates to existing types of attacks on block ciphers like meet-in-the-middle and slide attacks. In the second part of the paper, we define other security notions for RKA-secure block ciphers, namely in the sense of indistinguishability (IND) and non-malleability, and show the relations between these security notions. In particular, we show that secure tweakable permutation families in the sense of IND (resp. non-malleability) can be transformed into RKA-secure permutation families in the sense of IND (resp. non-malleability).     

Analytical and numerical prediction of harmonic sound power in the inlet of aero-engines with emphasis on transonic rotation speeds

Tone noise radiated through the inlet of a turbofan is mainly due to rotor-stator interactions at subsonic regimes (approach flight), and to the shock waves attached to each blade at supersonic helical tip speeds (takeoff). The axial compressor of a helicopter turboshaft engine is transonic as well and can be studied like turbofans at takeoff. The objective of the paper is to predict the sound power at the inlet radiating into the free field, with a focus on transonic conditions because sound levels are much higher. Direct numerical computation of tone acoustic power is based on a RANS (Reynolds averaged Navier–Stokes) solver followed by an integration of acoustic intensity over specified inlet cross-sections, derived from Cantrell and Hart equations (valid in irrotational flows). In transonic regimes, sound power decreases along the intake because of nonlinear propagation, which must be discriminated from numerical dissipation. This is one of the reasons why an analytical approach is also suggested. It is based on three steps: (i) appraisal of the initial pressure jump of the shock waves; (ii) 2D nonlinear propagation model of Morfey and Fisher; (iii) calculation of the sound power of the 3D ducted acoustic field. In this model, all the blades are assumed to be identical such that only the blade passing frequency and its harmonics are predicted (like in the present numerical simulations). However, transfer from blade passing frequency to multiple pure tones can be evaluated in a fourth step through a statistical analysis of irregularities between blades. Interest of the analytical method is to provide a good estimate of nonlinear acoustic propagation in the upstream duct while being easy and fast to compute. The various methods are applied to two turbofan models, respectively in approach (subsonic) and takeoff (transonic) conditions, and to a Turbomeca turboshaft engine (transonic case). The analytical method in transonic appears to be quite reliable by comparison with the numerical solution and with available experimental data.     

Cationic beta-cyclodextrin bilayer vesicles

Cationic amphiphilic beta-cyclodextrins, substituted with hydrophobic n-alkylthio chains at the primary hydroxyl side and hydrophilic omega-amino-oligo(ethylene glycol) units at the secondary side, form bilayer vesicles with a diameter of 30-35 nm (when alkyl = hexadecyl) or nanoparticles with a diameter of ca. 120 nm (when alkyl = hexyl) in water.     

Primordial Black Holes: Pair Creation, Lorentzian Condition, and Evaporation

The wave function of the universe is usuallytaken to be a functional of the threemetric on aspacelike section, , which is measured. It issometimes better, however, to work in the conjugaterepresentation, where the wave function depends on a quantityrelated to the second fundamental form of . Thismakes it possible to ensure that is part of aLorentzian universe by requiring that the argument of the wave function be purely imaginary. Wedemonstrate the advantages of this formalism first inthe well-known examples of the nucleation of a de Sitteror a Nariai universe. We then use it to calculate the pair creation rate for submaximal blackholes in de Sitter space, which had been thought tovanish semiclassically. We also study the quantumevolution of asymptotically de Sitter black holes. Forblack holes whose size is comparable to that of thecosmological horizon, this process differs significantlyfrom the evaporation of asymptotically flat black holes.Our model includes the one-loop effective action in the s-wave and large-N approximation.Black holes of the maximal mass are in equilibrium.Unexpectedly, we find that nearly maximal quantumSchwarzschild–de Sitter black holes antievaporate.However, there is a different perturbative mode thatleads to evaporation. We show that this mode will alwaysbe excited when a pair of maximal cosmological blackholes nucleates.