Paul in Acts

Author: Porter, Stanley E Title: Paul in Acts. Publisher: Tubingen: Hendrickson Pubs, 1999

Trends in Issuance: Underlying Factors and Implications

Trends in debt issuance have changed significantly over the past decade, both prior to the financial crisis and subsequently. This article provides an update on these trends in Canada relative to those in other capital markets and, where possible, analyzes the impact of the crisis on Canadian corporate issuance. The author examines trends in capital markets in Canada and other regions over the past ten years, focusing on three areas: the issuance of financial and non-financial corporate bonds, the issuance of financial and non-financial corporate equity, and securitization. The increased use of innovative and riskier financing prior to the crisis was less pronounced in Canada, and future refinancing needs are more in line with historical issuance levels.

Sparsest Cut on Bounded Treewidth Graphs: Algorithms and Hardness Results

We give a 2-approximation algorithm for Non-Uniform Sparsest Cut that runs in time $n^{O(k)}$, where $k$ is the treewidth of the graph. This improves on the previous $2^{2^k}$-approximation in time \poly(n) 2^{O(k)} due to Chlamt\'a\v{c} et al. To complement this algorithm, we show the following hardness results: If the Non-Uniform Sparsest Cut problem has a $\rho$-approximation for series-parallel graphs (where $\rho \geq 1$), then the Max Cut problem has an algorithm with approximation factor arbitrarily close to $1/\rho$. Hence, even for such restricted graphs (which have treewidth 2), the Sparsest Cut problem is NP-hard to approximate better than $17/16 - \epsilon$ for $\epsilon > 0$; assuming the Unique Games Conjecture the hardness becomes $1/\alpha_{GW} - \epsilon$. For graphs with large (but constant) treewidth, we show a hardness result of $2 - \epsilon$ assuming the Unique Games Conjecture. Our algorithm rounds a linear program based on (a subset of) the Sherali-Adams lift of the standard Sparsest Cut LP. We show that even for treewidth-2 graphs, the LP has an integrality gap close to 2 even after polynomially many rounds of Sherali-Adams. Hence our approach cannot be improved even on such restricted graphs without using a stronger relaxation

Computer program for transient response of structural rings subjected to fragment impact

Mathematical optimization of containment/deflection system would save time, effort, and material as well as afford designer greater opportunity to investigate new ideas and variety of materials

Simulating Future Global Deforestation Using Geographically Explicit Mode

What might the spatial distribution of forests look like in 2100? Global deforestation continues to be a significant component of human activity affecting both the terrestrial and atmospheric environments. This work models the relationship between people and forests using two approaches. Initially, a brief global scale analysis of recent historical trends is conducted. The remainder of the paper then focuses on current population densities as determinants of cumulative historical deforestation. Spatially explicit models are generated and used to generate two possible scenarios of future deforestation. The results suggest that future deforestation in tropical Africa may be considerably worse than deforestation in Amazonia

How to refute a random CSP

Let $P$ be a $k$-ary predicate over a finite alphabet. Consider a random CSP$(P)$ instance $I$ over $n$ variables with $m$ constraints. When $m \gg n$ the instance $I$ will be unsatisfiable with high probability, and we want to find a refutation - i.e., a certificate of unsatisfiability. When $P$ is the $3$-ary OR predicate, this is the well studied problem of refuting random $3$-SAT formulas, and an efficient algorithm is known only when $m \gg n^{3/2}$. Understanding the density required for refutation of other predicates is important in cryptography, proof complexity, and learning theory. Previously, it was known that for a $k$-ary predicate, having $m \gg n^{\lceil k/2 \rceil}$ constraints suffices for refutation. We give a criterion for predicates that often yields efficient refutation algorithms at much lower densities. Specifically, if $P$ fails to support a $t$-wise uniform distribution, then there is an efficient algorithm that refutes random CSP$(P)$ instances $I$ whp when $m \gg n^{t/2}$. Indeed, our algorithm will "somewhat strongly" refute $I$, certifying $\mathrm{Opt}(I) \leq 1-\Omega_k(1)$, if $t = k$ then we get the strongest possible refutation, certifying $\mathrm{Opt}(I) \leq \mathrm{E}[P] + o(1)$. This last result is new even in the context of random $k$-SAT. Regarding the optimality of our $m \gg n^{t/2}$ requirement, prior work on SDP hierarchies has given some evidence that efficient refutation of random CSP$(P)$ may be impossible when $m \ll n^{t/2}$. Thus there is an indication our algorithm's dependence on $m$ is optimal for every $P$, at least in the context of SDP hierarchies. Along these lines, we show that our refutation algorithm can be carried out by the $O(1)$-round SOS SDP hierarchy. Finally, as an application of our result, we falsify assumptions used to show hardness-of-learning results in recent work of Daniely, Linial, and Shalev-Shwartz

Experimental and data analysis techniques for deducing collision-induced forces from photographic histories of engine rotor fragment impact/interaction with a containment ring

An analysis method termed TEJ-JET is described whereby measured transient elastic and inelastic deformations of an engine-rotor fragment-impacted structural ring are analyzed to deduce the transient external forces experienced by that ring as a result of fragment impact and interaction with the ring. Although the theoretical feasibility of the TEJ-JET concept was established, its practical feasibility when utilizing experimental measurements of limited precision and accuracy remains to be established. The experimental equipment and the techniques (high-speed motion photography) employed to measure the transient deformations of fragment-impacted rings are described. Sources of error and data uncertainties are identified. Techniques employed to reduce data reading uncertainties and to correct the data for optical-distortion effects are discussed. These procedures, including spatial smoothing of the deformed ring shape by Fourier series and timewise smoothing by Gram polynomials, are applied illustratively to recent measurements involving the impact of a single T58 turbine rotor blade against an aluminum containment ring. Plausible predictions of the fragment-ring impact/interaction forces are obtained by one branch of this TEJ-JET method; however, a second branch of this method, which provides an independent estimate of these forces, remains to be evaluated