We calculate the cross-correlation function (CCF) between damped Ly-α systems (DLAs) and Lyman break galaxies (LBGs) using cosmological hydrodynamic simulations at z = 3. We compute the CCF with two different methods. First, we assume that there is one DLA in each dark matter halo if its DLA cross section is non-zero. In our second approach we weight the pair-count by the DLA cross section of e...

We study the approximability of the All-or-Nothing multicommodity flow problem in directed graphs with symmetric demand pairs (SymANF). The input consists of a directed graph G = (V,E) and a collection of (unordered) pairs of nodesM = {s1t1, s2t2, . . . , sktk}. A subsetM′ of the pairs is routable if there is a feasible multicommodity flow in G such that, for each pair siti ∈ M′, the amount of ...

BACKGROUND AND PURPOSE In this study, we present our experience with 11 patients with ruptured cavernous sinus aneurysms causing carotid cavernous fistulas (CCFs), to assess the incidence of ruptured cavernous sinus aneurysms causing CCFs and evaluate clinical presentations, treatments, and outcomes. PATIENTS AND METHODS During a 10-year period, 10 of 689 (1.5%) endovascular-treated ruptured ...

Ehlers-Danlos syndrome (EDS) type IV is a collagen vascular disease with an autosomal dominant inheritance caused by COL3A1 mutation. Patients with EDS type IV can present with organ rupture, spontaneous arterial dissections and ruptured aneurysms. Because of their propensity to form arterial dissections, aneurysms and rupture, they can develop carotid-cavernous fistula (CCF) after minor trauma...

This paper considers scheduling parallelizable jobs in the non-clairvoyant speed scaling setting to minimize the objective of weighted flow time plus energy. Previously, strong lower bounds were shown on this model in the unweighted setting even when the algorithm is given a constant amount of resource augmentation over the optimal solution. However, these lower bounds were given only for certa...

Efficient execution of distributed database operators such as joining and aggregating is critical for the performance of big data analytics. With the increase of the compute speedup of modern CPUs, reducing the network communication time of these operators in large systems is becoming increasingly important, and also challenging current techniques. Significant performance improvements have been...

Can complexity classes be characterized in terms of efficient reducibility to the (undecidable) set of Kolmogorov-random strings? Although this might seem improbable, a series of papers has recently provided evidence that this may be the case. In particular, it is known that there is a class of problems C defined in terms of polynomial-time truth-table reducibility to RK (the set of Kolmogorov-...

We present a mechanism for computing asymptotically stable school optimal matchings, while guaranteeing that it is an asymptotic dominant strategy for every student to report their true preferences to the mechanism. Our main tool in this endeavor is differential privacy: we give an algorithm that coordinates a stable matching using differentially private signals, which lead to our truthfulness ...

The potential of five low-cost and globally available sorbents, including three raw waste products – tire crumb rubber (WTCR), coconut coir fiber (CCF) blast furnace slag (BFS) two modified materials biochar (BC) iron coated (FeBC) were evaluated for removing a mixture polycyclic aromatic hydrocarbons (PAHs): pyrene (PYR), phenanthrene (PHE), acenaphthylene (ACY) naphthalene (NAP) from simulate...

Randomized exponential backoff is a widely deployed technique for coordinating access to a shared resource. A good backoff protocol should, arguably, satisfy three natural properties: (i) it should provide constant throughput, wasting as little time as possible; (ii) it should require few failed access attempts, minimizing the amount of wasted effort; and (iii) it should be robust, continuing t...