On the critical exponents of random k‐SAT

There has been much recent interest in the satisfiability of random Boolean formulas. A random k‐SAT formula is the conjunction of m random clauses, each of which is the disjunction of k literals (a variable or its negation). It is known that when the number of variables n is large, there is a sharp transition from satisfiability to unsatisfiability; in the case of 2‐SAT this happens when m/n → 1, for 3‐SAT the critical ratio is thought to be m/n ≈ 4.2. The sharpness of this transition is characterized by a critical exponent, sometimes called ν = ν_k (the smaller the value of ν the sharper the transition). Experiments have suggested that ν₃ = 1.5 ± 0.1. ν₄ = 1.25 ± 0.05, ν₅ = 1.1 ± 0.05, ν₆ = 1.05 ± 0.05, and heuristics have suggested that ν_k → 1 as k → ∞. We give here a simple proof that each of these exponents is at least 2 (provided the exponent is well defined). This result holds for each of the three standard ensembles of random k‐SAT formulas: m clauses selected uniformly at random without replacement, m clauses selected uniformly at random with replacement, and each clause selected with probability p independent of the other clauses. We also obtain similar results for q‐colorability and the appearance of a q‐core in a random graph. © 2002 Wiley Periodicals, Inc. Random Struct. Alg., 21: 182–195, 2002     

The plus construction, Postnikov towers and universal central module extensions

Given a connected spaceX, we consider the effect of Quillen’s plus construction on the homotopy groups ofX in terms of its Postnikov decomposition. Specifically, using universal properties of the fibration sequenceAX→X→X ⁺, we explain the contribution of π _n X to π _n X ⁺, π _n+1 X ⁺ and π _n AX, π _n+1 AX explicitly in terms of the low dimensional homology of π _n X regarded as a module over π₁ X. Key ingredients developed here for this purpose are universal II-central fibrations and a theory of universal central extensions of modules, analogous to universal central extensions of perfect groups. Research partially supported by NSERC of Canada.     

The auction algorithm for the transportation problem

The auction algorithm is a parallel relaxation method for solving the classical assignment problem. It resembles a competitive bidding process whereby unassigned persons bid simultaneously for objects, thereby raising their prices. Once all bids are in, objects are awarded to the highest bidder. This paper generalizes the auction algorithm to solve linear transportation problems. The idea is to convert the transportation problem into an assignment problem, and then to modify the auction algorithm to exploit the special structure of this problem. Computational results show that this modified version of the auction algorithm is very efficient for certain types of transportation problems.     

FFT-based algorithms for the string matching with mismatches problem

The string matching with mismatches problem requires finding the Hamming distance between a pattern P of length m and every length m substring of text T with length n. Fischer and Paterson's FFT-based algorithm solves the problem without error in O(σnlogm), where σ is the size of the alphabet Σ [SIAM–AMS Proc. 7 (1973) 113–125]. However, this in the worst case reduces to O(nmlogm). Atallah, Chyzak and Dumas used the idea of randomly mapping the letters of the alphabet to complex roots of unity to estimate the score vector in time O(nlogm) [Algorithmica 29 (2001) 468–486]. We show that the algorithm's score variance can be substantially lowered by using a bijective mapping, and specifically to zero in the case of binary and ternary alphabets. This result is extended via alphabet remappings to deterministically solve the string matching with mismatches problem with a constant factor of 2 improvement over Fischer–Paterson's method.     

Partially isometric dilations of noncommuting -tuples of operators

Given a row contraction of operators on a Hilbert space and a family of projections on the space that stabilizes the operators, we show there is a unique minimal joint dilation to a row contraction of partial isometries that satisfy natural relations. For a fixed row contraction the set of all dilations forms a partially ordered set with a largest and smallest element. A key technical device in our analysis is a connection with directed graphs. We use a Wold decomposition for partial isometries to describe the models for these dilations, and we discuss how the basic properties of a dilation depend on the row contraction.

     

Activity of microemulsion-based nanoparticles at the human bio-nano interface: concentration-dependent effects on thrombosis and hemolysis in whole blood

Background: Although microemulsion-based nanoparticles (MEs) may be useful for drug delivery or scavenging, these benefits must be balanced against potential nanotoxicological effects in biological tissue (bio-nano interface). We investigated the actions of assembled MEs and their individual components at the bio-nano interface of thrombosis and hemolysis in human blood. Methods: Oil-in-water MEs were synthesized using ethylbutyrate, sodium caprylate, and pluronic F-68 (ME4) or F-127 (ME6) in 0.9% NaCl_w/v. The effects of MEs or components on thrombosis were determined using thrombo-elastography, platelet contractile force, clot elastic modulus, and platelet counting. For hemolysis, ME or components were incubated with erythrocytes, centrifuged, and washed for measurement of free hemoglobin by spectroscopy. Results and conclusions: The mean particle diameters (polydispersity index) for ME6 and ME4 were 23.6 ± 2.5 nm (0.362) and 14.0 ± 1.0 nm (0.008), respectively. MEs (0, 0.03, 0.3, 3 mM) markedly reduced the thromboelastograph maximal amplitude in a concentration-dependent manner (49.0 ± 4.2, 39.0 ± 5.6, 15.0 ± 8.7, 3.8 ± 1.3 mm, respectively), an effect highly correlated (r2 = 0.94) with similar changes caused by pluronic surfactants (48.7 ± 10.9, 30.7 ± 15.8, 20.0 ± 11.3, 2.0 ± 0.5) alone. Neither oil nor sodium caprylate alone affected the thromboelastograph. The clot contractile force was reduced by ME (27.3 ± 11.1–6.7 ± 3.4 kdynes/cm², P = 0.02, n = 5) whereas the platelet population not affected (175 ± 28–182 ± 23 10⁶/ml, P = 0.12, n = 6). This data suggests that MEs reduced platelet activity due to associated pluronic surfactants, but caused minimal changes in protein function necessary for coagulation. Although pharmacological concentrations of sodium caprylate caused hemolysis (EC₅₀ = 213 mM), MEs and pluronic surfactants did not disrupt erythrocytes. Knowledge of nanoparticle activity and potential associated nanotoxicity at this bio-nano interface enables rational ME design for in vivo applications.     

Designing an effective federal biomass program

This article addresses two questions: Has the effectiveness of the US governments federal research and development (R&;D) spending suffered from the post-1980 strategic change from freely shared and publicly owned to privately owned scientific advances? What criteria would a federal R&;D program use to design a strategy that most effectively enhances the well-being of farmers and rural communities? Several studies found that the pre-1980 US Department of Agriculture research strategy was very effective. No comparable studies have analyzed the comparative effectiveness of the post-1980 strategy of restricting access to the results of public research. Recent experience and several analytical studies suggest that to significantly enhance the health of rural economies from an expanded use of plant matter as an industrial material, federal policy should channel scientific and engineering research into small- and medium-sized production and processing technologies and should encourage farmer-owned, value-added enterprises.