Fortran programs for the time-dependent Gross-Pitaevskii equation in a fully anisotropic trap

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

C programs for solving the time-dependent Gross-Pitaevskii equation in a fully anisotropic trap

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Langevin simulation of scalar fields: Additive and multiplicative noises and lattice renormalization

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

Triangular-lattice anisotropic dimerized Heisenberg antiferromagnet: Stability and excitations of the quantum paramagnetic phase

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Vortex lattice of a long superconducting wire with a columnar defect

In the present work we study a long superconducting wire with a columnar defect in the presence of an applied magnetic field. The cross section of the cylinder is assumed to be circular. The field is taken uniform and parallel to the cylinder axis. We use the London theory to investigate the vortex lattice inside the wire. Although this theory is valid in the limit of low vortex density, that is, when the nearest neighbor vortex distance is much larger than the coherence length, we can obtain a reasonable qualitative description of lattice properties. We calculate: (1) the vortex lattice structure using the simulated annealing technique; (2) the magnetization curve as a function of the applied field.

Tensor3D: A computer graphics program to simulate 3D real-time deformation and visualization of geometric bodies

Tensor3D is a geometric modeling program with the capacity to simulate and visualize in real-time the deformation, specified through a tensor matrix and applied to triangulated models representing geological bodies. 3D visualization allows the study of deformational processes that are traditionally conducted in 2D, such as simple and pure shears. Besides geometric objects that are immediately available in the program window, the program can read other models from disk, thus being able to import objects created with different open-source or proprietary programs. A strain ellipsoid and a bounding box are simultaneously shown and instantly deformed with the main object. The principal axes of strain are visualized as well to provide graphical information about the orientation of the tensor's normal components. The deformed models can also be saved, retrieved later and deformed again, in order to study different steps of progressive strain, or to make this data available to other programs. The shape of stress ellipsoids and the corresponding Mohr circles defined by any stress tensor can also be represented. The application was written using the Visualization ToolKit, a powerful scientific visualization library in the public domain. This development choice, allied to the use of the Tcl/Tk programming language, which is independent on the host computational platform, makes the program a useful tool for the study of geometric deformations directly in three dimensions in teaching as well as research activities. (C) 2007 Elsevier Ltd. All rights reserved.

Toda lattice field theories, discrete W algebras, Toda lattice hierarchies and quantum groups

In analogy with the Liouville case we study the sl3 Toda theory on the lattice and define the relevant quadratic algebra and out of it we recover the discrete W3 algebra. We define an integrable system with respect to the latter and establish the relation with the Toda lattice hierarchy. We compute the relevant continuum limits. Finally we find the quantum version of the quadratic algebra.

Algorithms for network piecewise-linear programs: A comparative study

Piecewise-Linear Programming (PLP) is an important area of Mathematical Programming and concerns the minimisation of a convex separable piecewise-linear objective function, subject to linear constraints. In this paper a subarea of PLP called Network Piecewise-Linear Programming (NPLP) is explored. The paper presents four specialised algorithms for NPLP: (Strongly Feasible) Primal Simplex, Dual Method, Out-of-Kilter and (Strongly Polynomial) Cost-Scaling and their relative efficiency is studied. A statistically designed experiment is used to perform a computational comparison of the algorithms. The response variable observed in the experiment is the CPU time to solve randomly generated network piecewise-linear problems classified according to problem class (Transportation, Transshipment and Circulation), problem size, extent of capacitation, and number of breakpoints per arc. Results and conclusions on performance of the algorithms are reported.

Vortex lattice and matching fields for a long superconducting wire

We investigate the flux penetration patterns and matching fields of a long cylindrical wire of circular cross section in the presence of an external magnetic field. For this study we write the London theory for a long cylinder both for the mixed and Meissner states, with boundary conditions appropriate for this geometry. Using the Monte Carlo simulated annealing method, the free energy of the mixed state is minimized with respect to the vortex position and we obtain the ground state of the vortex lattice for N=3 up to 18 vortices. The free energy of the Meissner and mixed states provides expressions for the matching fields. We find that, as in the case of samples of different geometry, the finite-size effect provokes a delay on the vortex penetration and a vortex accumulation in the center of the sample. The vortex patterns obtained are in good agreement with experimental results.

Conditional reasoning: A key to assessing computer-based knowledge-building communication processes

This article describes a methodological approach to conditional reasoning in online asynchronous learning environments such as Virtual-U VGroups, developed by SFU, BC, Canada, consistent with the notion of meaning implication: If part of a meaning C is embedded in B and a part of a meaning B is embedded in A, then A implies C in terms of meaning [Piaget 91]. A new transcript analysis technique was developed to assess the flows of conditional meaning implications and to identify the occurrence of hypotheses and connections among them in two human science graduate mixed-mode online courses offered in the summer/spring session of 1997 by SFU. Flows of conditional meaning implications were confronted with Virtual-U VGroups threads and results of the two courses were compared. Findings suggest that Virtual-U VGroups is a knowledge-building environment although the tree-like Virtual-U VGroups threads should be transformed into neuronal-like threads. Findings also suggest that formulating hypotheses together triggers a collaboratively problem-solving process that scaffolds knowledge-building in asynchronous learning environments: A pedagogical technique and an built-in tool for formulating hypotheses together are proposed. © Springer Pub. Co.

Study of water and dimethylformamide interaction by computer simulation

Monte Carlo simulations of water-dimethylformamide (DMF) mixtures were performed in the isothermal and isobaric ensemble at 298.15 K and 1 atm. The intermolecular interaction energy was calculated using the classical 6-12 Lennard-Jones pairwise potential plus a Coulomb term. The TIP4P model was used for simulating water molecules, and a six-site model previously optimised by us was used to represent DMF. The potential energy for the water-DMF interaction was obtained via standard geometric combining rules using the original potential parameters for the pure liquids. The radial distribution functions calculated for water-DMF mixtures show well characterised hydrogen bonds between the oxygen site of DMF and hydrogen of water. A structureless correlation curve was observed for the interaction between the hydrogen site of the carbonyl group and the oxygen site of water. Hydration effects on the stabilisation of the DMF molecule in aqueous solution have been investigated using statistical perturbation theory. The results show that energetic changes involved in the hydration process are not strong enough to stabilise another configuration of DMF than the planar one.

Lattice constellations and codes from quadratic number fields

We propose new classes of linear codes over integer rings of quadratic extensions of Q, the field of rational numbers. The codes are considered with respect to a Mannheim metric, which is a Manhattan metric modulo a two-dimensional (2-D) grid. In particular, codes over Gaussian integers and Eisenstein-Jacobi integers are extensively studied. Decoding algorithms are proposed for these codes when up to two coordinates of a transmitted code vector are affected by errors of arbitrary Mannheim weight. Moreover, we show that the proposed codes are maximum-distance separable (MDS), with respect to the Hamming distance. The practical interest in such Mannheim-metric codes is their use in coded modulation schemes based on quadrature amplitude modulation (QAM)-type constellations, for which neither the Hamming nor the Lee metric is appropriate.

Localization of a Bose-Einstein condensate in a bichromatic optical lattice

By direct numerical simulation of the time-dependent Gross-Pitaevskii equation, we study different aspects of the localization of a noninteracting ideal Bose-Einstein condensate (BEC) in a one-dimensional bichromatic quasiperiodic optical-lattice potential. Such a quasiperiodic potential, used in a recent experiment on the localization of a BEC, can be formed by the superposition of two standing-wave polarized laser beams with different wavelengths. We investigate the effect of the variation of optical amplitudes and wavelengths on the localization of a noninteracting BEC. We also simulate the nonlinear dynamics when a harmonically trapped BEC is suddenly released into a quasiperiodic potential, as done experimentally in a laser speckle potential. We finally study the destruction of the localization in an interacting BEC due to the repulsion generated by a positive scattering length between the bosonic atoms. © 2009 The American Physical Society.

Boosting optimum-path forest clustering through harmony Search and its applications for intrusion detection in computer networks

In this paper we propose a nature-inspired approach that can boost the Optimum-Path Forest (OPF) clustering algorithm by optimizing its parameters in a discrete lattice. The experiments in two public datasets have shown that the proposed algorithm can achieve similar parameters' values compared to the exhaustive search. Although, the proposed technique is faster than the traditional one, being interesting for intrusion detection in large scale traffic networks. © 2012 IEEE.

Two matrix-based lattice construction techniques

Let m and n be integers greater than 1. Given lattices A and B of dimensions m and n, respectively, a technique for constructing a lattice from them of dimension m+n-1 is introduced. Furthermore, if A and B possess bases satisfying certain conditions, then a second technique yields a lattice of dimension m+n-2. The relevant parameters of the new lattices are given in terms of the respective parameters of A,B, and a lattice C isometric to a sublattice of A and B. Denser sphere packings than previously known ones in dimensions 52, 68, 84, 248, 520, and 4098 are obtained. © 2012 Elsevier Inc. All rights reserved.