Axially symmetric soliton solutions in a Skyrme-Faddeev-type model with Gies`s extension

We construct static soliton solutions with non-zero Hopf topological charges to a theory which is the extended Skyrme-Faddeev model with a further quartic term in derivatives. We use an axially symmetric ansatz based on toroidal coordinates, and solve the resulting two coupled nonlinear partial differential equations in two variables by a successive over-relaxation method. We construct numerical solutions with the Hopf charge up to 4. The solutions present an interesting behavior under the changes of a special combination of the coupling constants of the quartic terms.

Dependence of Response Functions and Orbital Functionals on Occupation Numbers

Explicitly orbital-dependent approximations to the exchange-correlation energy functional of density functional theory typically not only depend on the single-particle Kohn-Sham orbitals but also on their occupation numbers in the ground-state Slater determinant. The variational calculation of the corresponding exchange-correlation potentials with the optimized effective potential (OEP) method therefore also requires a variation of the occupation numbers with respect to a variation in the effective single-particle potential, which is usually not taken into account. Here it is shown under which circumstances this procedure is justified.

CONTRA: Improving the performance of dynamic investigations in natural abundance organic solids by mirror-symmetric constant-time CODEX

We present a minor but essential modification to the CODEX 1D-MAS exchange experiment. The new CONTRA method, which requires minor changes of the original sequence only, has advantages over the previously introduced S-CODEX, since it is less sensitive to artefacts caused by finite pulse lengths. The performance of this variant, including the finite pulse effect, was confirmed by SIMPSON calculations and demonstrated on a number of dynamic systems. (C) 2007 Elsevier Inc. All rights reserved.

The defensive functions of plant inhibitors are not restricted to insect enzyme inhibition

Three plant proteinase inhibitors BbKI (kallikrein inhibitor) and BbCI (cruzipain inhibitor) from Bauhinia bouhinioides, and a BrTI (trypsin inhibitor) from B. rufa, were examined for other effects in Callosobruchus maculatus development; of these only BrTI affected bruchid emergence. BrTI and BbKI share 81% identities in their primary sequences and the major differences between them are the regions comprising the RGD and RGE motifs in BrTI. These sequences were shown to be essential for BrTI insecticidal activity, since a modified BbKI [that is a recombinant form (BbKIm) with some amino acid residues replaced by those found in BrTI sequence] also strongly inhibited insect development. By using synthetic peptides related to the BrTI sequence, YLEAPVARGDGGLA-NH(2) (RGE) and IVYYPDRGETGL-NH(2) (RGE), it was found that the peptide with an RGE sequence was able to block normal development of C. maculatus larvae (ED(50) 0.16% and LD(50) 0.09%), this being even more effective than the native protein. (C) 2009 Elsevier Ltd. All rights reserved.

A note on a practical relationship between filter coefficients and scaling and wavelet functions of Discrete Wavelet Transforms

In this paper, the relationship between the filter coefficients and the scaling and wavelet functions of the Discrete Wavelet Transform is presented and exemplified from a practical point-of-view. The explanations complement the wavelet theory, that is well documented in the literature, being important for researchers who work with this tool for time-frequency analysis. (c) 2011 Elsevier Ltd. All rights reserved.

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.

Improved score tests in symmetric linear regression models

The class of symmetric linear regression models has the normal linear regression model as a special case and includes several models that assume that the errors follow a symmetric distribution with longer-than-normal tails. An important member of this class is the t linear regression model, which is commonly used as an alternative to the usual normal regression model when the data contain extreme or outlying observations. In this article, we develop second-order asymptotic theory for score tests in this class of models. We obtain Bartlett-corrected score statistics for testing hypotheses on the regression and the dispersion parameters. The corrected statistics have chi-squared distributions with errors of order O(n(-3/2)), n being the sample size. The corrections represent an improvement over the corresponding original Rao`s score statistics, which are chi-squared distributed up to errors of order O(n(-1)). Simulation results show that the corrected score tests perform much better than their uncorrected counterparts in samples of small or moderate size.