One-dimensional trapped atoms: critical coupling parameter and critical number of particles

In this paper we consider the case of a Bose gas in low dimension in order to illustrate the applicability of a method that allows us to construct analytical relations, valid for a broad range of coupling parameters, for a function which asymptotic expansions are known. The method is well suitable to investigate the problem of stability of a collection of Bose particles trapped in one- dimensional configuration for the case where the scattering length presents a negative value. The eigenvalues for this interacting quantum one-dimensional many particle system become negative when the interactions overcome the trapping energy and, in this case, the system becomes unstable. Here we calculate the critical coupling parameter and apply for the case of Lithium atoms obtaining the critical number of particles for the limit of stability.

Tightened Lieb-Oxford Bound for Systems of Fixed Particle Number

The Lieb-Oxford bound is a constraint upon approximate exchange-correlation functionals. We explore a nonempirical tightening of that bound in both universal and electron number-dependent form. The test functional is PBE. Regarding both atomization energies (slightly worsened) and bond lengths (slightly improved), we find the PBE functional to be remarkably insensitive to the value of the Lieb-Oxford bound. This both rationalizes the use of the original Lieb-Oxford constant in PBE and suggests that enhancement factors more sensitive to sharpened constraints await discovery.

U-curve: A branch-and-bound optimization algorithm for U-shaped cost functions on Boolean lattices applied to the feature selection problem

This paper presents the formulation of a combinatorial optimization problem with the following characteristics: (i) the search space is the power set of a finite set structured as a Boolean lattice; (ii) the cost function forms a U-shaped curve when applied to any lattice chain. This formulation applies for feature selection in the context of pattern recognition. The known approaches for this problem are branch-and-bound algorithms and heuristics that explore partially the search space. Branch-and-bound algorithms are equivalent to the full search, while heuristics are not. This paper presents a branch-and-bound algorithm that differs from the others known by exploring the lattice structure and the U-shaped chain curves of the search space. The main contribution of this paper is the architecture of this algorithm that is based on the representation and exploration of the search space by new lattice properties proven here. Several experiments, with well known public data, indicate the superiority of the proposed method to the sequential floating forward selection (SFFS), which is a popular heuristic that gives good results in very short computational time. In all experiments, the proposed method got better or equal results in similar or even smaller computational time. (C) 2009 Elsevier Ltd. All rights reserved.

The number of open paths in an oriented rho-percolation model

We study the asymptotic properties of the number of open paths of length n in an oriented rho-percolation model. We show that this number is e(n alpha(rho)(1+o(1))) as n ->infinity. The exponent alpha is deterministic, it can be expressed in terms of the free energy of a polymer model, and it can be explicitly computed in some range of the parameters. Moreover, in a restricted range of the parameters, we even show that the number of such paths is n(-1/2)We (n alpha(rho))(1+o(1)) for some nondegenerate random variable W. We build on connections with the model of directed polymers in random environment, and we use techniques and results developed in this context.

Random number generators for the generalized Birnbaum-Saunders distribution

The generalized Birnbaum-Saunders distribution pertains to a class of lifetime models including both lighter and heavier tailed distributions. This model adapts well to lifetime data, even when outliers exist, and has other good theoretical properties and application perspectives. However, statistical inference tools may not exist in closed form for this model. Hence, simulation and numerical studies are needed, which require a random number generator. Three different ways to generate observations from this model are considered here. These generators are compared by utilizing a goodness-of-fit procedure as well as their effectiveness in predicting the true parameter values by using Monte Carlo simulations. This goodness-of-fit procedure may also be used as an estimation method. The quality of this estimation method is studied here. Finally, through a real data set, the generalized and classical Birnbaum-Saunders models are compared by using this estimation method.

The 3-colored Ramsey number of even cycles

Denote by R(L, L, L) the minimum integer N such that any 3-coloring of the edges of the complete graph on N vertices contains a monochromatic copy of a graph L. Bondy and Erdos conjectured that when L is the cycle C(n) on n vertices, R(C(n), C(n), C(n)) = 4n - 3 for every odd n > 3. Luczak proved that if n is odd, then R(C(n), C(n), C(n)) = 4n + o(n), as n -> infinity, and Kohayakawa, Simonovits and Skokan confirmed the Bondy-Erdos conjecture for all sufficiently large values of n. Figaj and Luczak determined an asymptotic result for the `complementary` case where the cycles are even: they showed that for even n, we have R(C(n), C(n), C(n)) = 2n + o(n), as n -> infinity. In this paper, we prove that there exists n I such that for every even n >= n(1), R(C(n), C(n), C(n)) = 2n. (C) 2009 Elsevier Inc. All rights reserved.

Acetylation of cellulose in LiCl-N,N-dimethylacetamide: first report on the correlation between the reaction efficiency and the aggregation number of dissolved cellulose

The acylation of three cellulose samples by acetic anhydride, Ac(2)O, in the solvent system LiCl/N,N-dimethylacetamide, DMAc (4 h, 110 A degrees C), has been revisited in order to investigate the dependence of the reaction efficiency on the structural characteristics of cellulose, and its aggregation in solution. The cellulose samples employed included microcrystalline, MCC; mercerized cotton linters, M-cotton, and mercerized sisal, M-sisal. The reaction efficiency expresses the relationship between the degree of substitution, DS, of the ester obtained, and the molar ratio Ac(2)O/AGU (anhydroglucose unit of the biopolymer); 100% efficiency means obtaining DS = 3 at Ac(2)O/AGU = 3. For all celluloses, the dependence of DS on Ac(2)O/AGU is described by an exponential decay equation: DS = DS(o) - Ae(-[(Ac2O/AGU)/B]); (A) and (B) are regression coefficients, and DS(o) is the calculated maximum degree of substitution, achieved under the conditions of each experiment. Values of (B) are clearly dependent on the cellulose employed: B((M-cotton)) > B((M-sisal)) > B((MCC)); they correlate qualitatively with the degree of polymerization of cellulose, and linearly with the aggregation number, N(agg), of the dissolved biopolymer, as calculated from static light scattering measurements: (B) = 1.709 + 0.034 N(agg). To our knowledge, this is the first report on the latter correlation; it shows the importance of the physical state of dissolved cellulose, and serves to explain, in part, the need to use distinct reaction conditions for MCC and fibrous celluloses, in particular Ac(2)O/AGU, time, temperature.

Branch and Bound Algorithm for Multiprocessor Scheduling

The multiprocessor task graph scheduling problem has been extensively studied asacademic optimization problem which occurs in optimizing the execution time of parallelalgorithm with parallel computer. The problem is already being known as one of the NPhardproblems. There are many good approaches made with many optimizing algorithmto find out the optimum solution for this problem with less computational time. One ofthem is branch and bound algorithm.In this paper, we propose a branch and bound algorithm for the multiprocessor schedulingproblem. We investigate the algorithm by comparing two different lower bounds withtheir computational costs and the size of the pruned tree.Several experiments are made with small set of problems and results are compared indifferent sections.

Produktion, skador och grenegenskaper hos 10-årig tall i ett kombinerat förbands- och avkommeförsök : Volume production, damages and branch properties in a 10-year old combined spacing and progeny trial of Scots pine

A Scots pine (Pinus sylvestris) progeny trial was established in 1990, in the southwestern part of Sweden. The offspring was from 30 plus trees. The trial is located on abandoned agricultural land and has a single tree block design with a variation in spacing. The trial has been damaged by voles. At a tree age of ten years, growth, damages and branch properties were estimated. An analysis of variance on height, diameter and stem volume shows significant difference between spacing and progenies as well as interactions between these factors. As indicated by a better annual height increment and fewer and thinner branches at each whorl the densest spacing has the highest potential to produce quality logs.There were also differences between progenies in growth and quality traits. Some progenies combined good growth and branch characters with low mortality, straight stems and few damages. Other progenies had superior volume production.

Solar thermal components adapted to common building standards (SCAS)

Pilot versions of a solar heating/natural gas burner system, of a solar heating/pellet burner system and of a façade/roof integrated polymeric collector have been installed in the summer of 2006 in a number of demonstration houses in Denmark, Sweden and Norway.These three new products have been evaluated by means of measurements of the thermal performance and energy savings of the pilot systems in practice and by means of a commercial evaluation.The conclusion of the evaluations is that the products are attractive for the industry partners METRO THERM A/S, Solentek and SOLARNOR. It is expected that the companies will bring the products into the market in 2007.Further, the results of the project have been presented atinternational and national congresses and seminars for the solar heating branch. The congresses and seminars attracted a lot of interested participants.Furthermore, the project results have been published in international congress papers as well as in national journals in the energy field.Consequently, the Nordic solar heating industry will benefit from the project.

Genetic Control of Residual Variance for Teat Number in Pigs

The genetic improvement in litter size in pigs has been substantial during the last 10-15 years. The number of teats on the sow must increase as well to meet the needs of the piglets, because each piglet needs access to its own teat. We applied a genetic heterogeneity model on teat numberin sows, and estimated medium-high heritability for teat number (0.5), but low heritability for residual variance (0.05), indicating that selection for reduced variance might have very limited effect. A numerically positive correlation (0.8) between additive genetic breeding values for mean and for variance was found, but because of the low heritability for residual variance, the variance will increase very slowly with the mean.

On statistical bounds of heuristic solutions to location problems

Solutions to combinatorial optimization problems, such as problems of locating facilities, frequently rely on heuristics to minimize the objective function. The optimum is sought iteratively and a criterion is needed to decide when the procedure (almost) attains it. Pre-setting the number of iterations dominates in OR applications, which implies that the quality of the solution cannot be ascertained. A small, almost dormant, branch of the literature suggests using statistical principles to estimate the minimum and its bounds as a tool to decide upon stopping and evaluating the quality of the solution. In this paper we examine the functioning of statistical bounds obtained from four different estimators by using simulated annealing on p-median test problems taken from Beasley’s OR-library. We find the Weibull estimator and the 2nd order Jackknife estimator preferable and the requirement of sample size to be about 10 being much less than the current recommendation. However, reliable statistical bounds are found to depend critically on a sample of heuristic solutions of high quality and we give a simple statistic useful for checking the quality. We end the paper with an illustration on using statistical bounds in a problem of locating some 70 distribution centers of the Swedish Post in one Swedish region.