Asymptotic Correction of More Sturm–Liouville Eigenvalue Estimates

The asymptotic correction technique of Paine, de Hoog and Anderssen can dramatically improve the accuracy of finite difference or finite element eigenvalues at negligible extra cost if closed form expressions are available for the errors in a simpler related problem. This paper gives closed form expressions for the errors in the eigenvalues of certain Sturm–Liouville problems obtained by various methods, thereby increasing the range of problems for which asymptotic correction can achieve maximum efficiency. It also investigates implementation of the method for more general problems.     

Unique satisfiability of Horn sets can be solved in nearly linear time

If a Horn set I has a single satisfying truth assignment or model then that model is said to be unique for I. The question of determining whether a unique model exists for a given Horn set I is shown to be solved in O((L)*L) time, where L is the sum of the lengths of the clauses in I and is the inverse Ackermann function. It is also shown that if LA*log (A) where A is the number of distinct proposition letters then unique satisfiability can be determined in O(L) time.     

The diameter of randomly perturbed digraphs and some applications

The central observation of this paper is that if εn random arcs are added to any n‐node strongly connected digraph with bounded degree then the resulting graph has diameter 𝒪(lnn) with high probability. We apply this to smoothed analysis of algorithms and property testing. Smoothed Analysis: Recognizing strongly connected digraphs is a basic computational task in graph theory. Even for digraphs with bounded degree, it is NL‐complete. By XORing an arbitrary bounded degree digraph with a sparse random digraph R ∼ 𝔻_n,ε/n we obtain a “smoothed” instance. We show that, with high probability, a log‐space algorithm will correctly determine if a smoothed instance is strongly connected. We also show that if NL ⫅̸ almost‐L then no heuristic can recognize similarly perturbed instances of (s,t)‐connectivity. Property Testing: A digraph is called k‐linked if, for every choice of 2k distinct vertices s₁,…,s_k,t₁,…,t_k, the graph contains k vertex disjoint paths joining s_r to t_r for r = 1,…,k. Recognizing k‐linked digraphs is NP‐complete for k ≥ 2. We describe a polynomial time algorithm for bounded degree digraphs, which accepts k‐linked graphs with high probability, and rejects all graphs that are at least εn arcs away from being k‐linked. © 2007 Wiley Periodicals, Inc. Random Struct. Alg., 2007     

Enhancing the Success of African-American Students in the Sciences: Freshman Year Outcomes

The Meyerhoff Program is an intensive, multicomponent program focused on enhancing the success of talented African-American students in science and engineering at a predominantly white, medium-sized university. The program components, taken together, address the four primary factors emphasized in the research literature as limiting minority student performance and persistence in science: knowledge and skills, motivation and support, monitoring and advising, and academic and social integration. Outcome analyses indicated that the first three cohorts of Meyerhoff students (total N=69) achieved an overall GPA (mean=3.5) significantly greater than that of an African-American historical comparison sample (mean=2.8) of comparably talented science students at the university. This difference was even greater for first year science GPA (means of 3.4 and 2.4, respectively), and in specific science and mathematics courses. Observational and questionnaire data indicated that the Meyerhoff program study groups, peerbased community, financial scholarships, summer bridge program and staff appear to be especially important contributors to student success. Implications of the findings for enhancing the success of African-American and other underrepresented populations in science are discussed.     

An economic analysis of microbial reduction of sulfur dioxide as a means of byproduct recovery from regenerable processes for flue gas desulfurization

Applied Biochemistry and Biotechnology - In summary, it appears that the microbial reduction process is clearly not competitive with conventional SO2-reduction techniques when glucose (DE95 corn...     

Complexes in polymers IV. FTIR microscopic characterization of thin organic polymer films containing embedded transition-metal carbonyl complexes

Thin films of polystyrene (PS), poly(methyl methacrylate) (PMMA) and polystyrene-polyacrylonitrile copolymer (PS-AN), containing various embedded transition-metal complexes, have been studied by FTIR microscopy. The spatial distributions of the transition-metal carbonyl complexes throughout the thin organic polymer films have been determined by a two-dimensional IR mapping procedure. The spectral variations observed in the distribution of the metal carbonyls throughout the different polymer films are discussed. The IR data show that the technique used to prepare the organometallic-embedded thin films (viz. freeze-drying of solutions followed by hot mechanical pressing of the residues) does in general lead to homogeneous films which may eventually find industrial application, e.g. as membrane sensors for small molecules.     

Gravitational Entropy in Cosmological Models

We discuss whether an appropriately defined dimensionless scalar function might be an acceptable candidate for the gravitational entropy, by explicitly considering Szekeres and Bianchi type VI _h models that admit an isotropic singularity. We also briefly discuss other possible gravitational entropy functions, including an appropriate measure of the velocity dependent Bel-Robinson tensor. PACS: 04.20.-q 95.30.Sf 98.80.Jk     

Route stability in vehicle routing decisions: a bi-objective approach using metaheuristics

In this paper, we argue that vehicle routing solutions are often tactical decisions, that should not be changed too often or too much. For marketing or other reasons, vehicle routing solutions should be stable, i.e. a new solution (when e.g. new customers require service) should be as similar as possible to a solution already in use. Simultaneously however, this new solution should still have a good quality in the traditional sense (e.g. small total travel cost). In this paper, we develop a way to measure the difference between two vehicle routing solutions. We use this distance measure to create a metaheuristic approach that will find solutions that are “close” (in the solution space) to a given baseline solution and at the same time have a high quality in the sense that their total distance traveled is small. By using this approach, the dispatcher is offered a choice of Pareto-optimal solutions, allowing him to make a trade-off between changing his existing solution and allowing a longer travel distance. Some experiments are performed to show the effectiveness of the approach.