Improvements on the Porter`s Stemming Algorithm for Portuguese

The amount of textual information digitally stored is growing every day. However, our capability of processing and analyzing that information is not growing at the same pace. To overcome this limitation, it is important to develop semiautomatic processes to extract relevant knowledge from textual information, such as the text mining process. One of the main and most expensive stages of the text mining process is the text pre-processing stage, where the unstructured text should be transformed to structured format such as an attribute-value table. The stemming process, i.e. linguistics normalization, is usually used to find the attributes of this table. However, the stemming process is strongly dependent on the language in which the original textual information is given. Furthermore, for most languages, the stemming algorithms proposed in the literature are computationally expensive. In this work, several improvements of the well know Porter stemming algorithm for the Portuguese language, which explore the characteristics of this language, are proposed. Experimental results show that the proposed algorithm executes in far less time without affecting the quality of the generated stems.

Grid job scheduling using Route with Genetic Algorithm support

In 2006 the Route load balancing algorithm was proposed and compared to other techniques aiming at optimizing the process allocation in grid environments. This algorithm schedules tasks of parallel applications considering computer neighborhoods (where the distance is defined by the network latency). Route presents good results for large environments, although there are cases where neighbors do not have an enough computational capacity nor communication system capable of serving the application. In those situations the Route migrates tasks until they stabilize in a grid area with enough resources. This migration may take long time what reduces the overall performance. In order to improve such stabilization time, this paper proposes RouteGA (Route with Genetic Algorithm support) which considers historical information on parallel application behavior and also the computer capacities and load to optimize the scheduling. This information is extracted by using monitors and summarized in a knowledge base used to quantify the occupation of tasks. Afterwards, such information is used to parameterize a genetic algorithm responsible for optimizing the task allocation. Results confirm that RouteGA outperforms the load balancing carried out by the original Route, which had previously outperformed others scheduling algorithms from literature.

An unstructured CVFEM and moving interface algorithm for non-Newtonian Hele-Shaw flows in injection molding

Purpose - The purpose of this paper is to develop a novel unstructured simulation approach for injection molding processes described by the Hele-Shaw model. Design/methodology/approach - The scheme involves dual dynamic meshes with active and inactive cells determined from an initial background pointset. The quasi-static pressure solution in each timestep for this evolving unstructured mesh system is approximated using a control volume finite element method formulation coupled to a corresponding modified volume of fluid method. The flow is considered to be isothermal and non-Newtonian. Findings - Supporting numerical tests and performance studies for polystyrene described by Carreau, Cross, Ellis and Power-law fluid models are conducted. Results for the present method are shown to be comparable to those from other methods for both Newtonian fluid and polystyrene fluid injected in different mold geometries. Research limitations/implications - With respect to the methodology, the background pointset infers a mesh that is dynamically reconstructed here, and there are a number of efficiency issues and improvements that would be relevant to industrial applications. For instance, one can use the pointset to construct special bases and invoke a so-called ""meshless"" scheme using the basis. This would require some interesting strategies to deal with the dynamic point enrichment of the moving front that could benefit from the present front treatment strategy. There are also issues related to mass conservation and fill-time errors that might be addressed by introducing suitable projections. The general question of ""rate of convergence"" of these schemes requires analysis. Numerical results here suggest first-order accuracy and are consistent with the approximations made, but theoretical results are not available yet for these methods. Originality/value - This novel unstructured simulation approach involves dual meshes with active and inactive cells determined from an initial background pointset: local active dual patches are constructed ""on-the-fly"" for each ""active point"" to form a dynamic virtual mesh of active elements that evolves with the moving interface.

Liquid crystalline cellulosic elastomers: free standing anisotropic films under stretching

The structure and local ordering of 1,6-hexamethylenediisocyanate-(acetoxypropy1) cellulose (HDI-APC) liquid crystalline elastomer thin films are investigated by using X-ray diffraction and scattering techniques. Optical microscopy and mechanical essays are performed to complement the investigation. The study is performed in films subjected or not to an uniaxial stress. Our results indicate that the film is constituted by a bundle of helicoidal fiber-like structure, where the cellobiose block spins around the axis of the fiber, like a string-structure in a smectic-like packing, with the pitch defined by a smectic-like layer. The fibers are in average perpendicular to the smectic-like planes. Without the stretch, these bundles are warped, only with a residual orientation along the casting direction. The stretch orients the bundles along it, increasing the smectic-like and the nematic-like ordering of the fibers. Under stress, the network of molecules which connects the cellobiose blocs and forms the cellulosic matrix tends to organize their links in a hexagonal-like structure with lattice parameter commensurate to the smectic-like structure.

Analytical quantification of low-density lipoprotein using europium tetracycline indicator

Low-density lipoprotein (LDL) is known as `bad` cholesterol. If too much LDL circulates in the blood it can be retained in the walls of the arteries, causing atherosclerosis. In this paper we showed an alternative method to quantify LDL using the europium tetracycline (EuTc) indicator. The optical properties of the EuTc complex were investigated in aqueous solutions containing LDL. An enhancement was observed of the europium luminescence in the solutions with LDL compared those without the lipoprotein. A method to quantify the amount of LDL in a sample, based on EuTc enhanced luminescence, is proposed. The enhancement mechanism is also discussed. Copyright (C) 2009 John Wiley & Sons, Ltd.

An analytical relation between entropy production and quantum Lyapunov exponents for Gaussian bipartite systems

We study and compare the information loss of a large class of Gaussian bipartite systems. It includes the usual Caldeira-Leggett-type model as well as Anosov models ( parametric oscillators, the inverted oscillator environment, etc), which exhibit instability, one of the most important characteristics of chaotic systems. We establish a rigorous connection between the quantum Lyapunov exponents and coherence loss, and show that in the case of unstable environments coherence loss is completely determined by the upper quantum Lyapunov exponent, a behavior which is more universal than that of the Caldeira-Leggett-type model.

Observation of two-magnon bound states in the spin-1 anisotropic Heisenberg antiferromagnetic chain system NiCl2-4SC(NH2)(2)

Results of systematic tunable-frequency ESR studies of the spin dynamics in NiCl2-4SC(NH2)(2) (known as DTN), a gapped S = 1 chain system with easy-plane anisotropy dominating over the exchange coupling (large-D chain), are presented. We have obtained direct evidence for two-magnon bound states, predicted for S = 1 large-D spin chains in the fully spin-polarized (FSP) phase. The frequency-field dependence of the corresponding excitations was calculated using the set of parameters obtained earlier [S.A. Zvyagin, et al., Phys. Rev. Lett. 98 (2007) 047205]. Very good agreement between the calculations and the experiment was obtained. It is argued that the observation of transitions from the ground to two-magnon bound states might indicate a more complex picture of magnetic interactions in DTN, involving a finite in-plane anisotropy. (C) 2007 Elsevier B.V. All rights reserved.

Predictions from an anisotropic inflationary era

This paper investigates the predictions of an inflationary phase starting from a homogeneous and anisotropic universe of the Bianchi I type. After discussing the evolution of the background spacetime, focusing on the number of e-folds and the isotropization, we solve the perturbation equations and predict the power spectra of the curvature perturbations and gravity waves at the end of inflation. The main features of the early anisotropic phase is (1) a dependence of the spectra on the direction of the modes, (2) a coupling between curvature perturbations and gravity waves and (3) the fact that the two gravity wave polarizations do not share the same spectrum on large scales. All these effects are significant only on large scales and die out on small scales where isotropy is recovered. They depend on a characteristic scale that can, but a priori must not, be tuned to some observable scale. To fix the initial conditions, we propose a procedure that generalizes the one standardly used in inflation but that takes into account the fact that the WKB regime is violated at early times when the shear dominates. We stress that there exist modes that do not satisfy the WKB condition during the shear-dominated regime and for which the amplitude at the end of inflation depends on unknown initial conditions. On such scales, inflation loses its predictability. This study paves the way for the determination of the cosmological signature of a primordial shear, whatever the Bianchi I spacetime. It thus stresses the importance of the WKB regime to draw inflationary predictions and demonstrates that, when the number of e-folds is large enough, the predictions converge toward those of inflation in a Friedmann-Lemaitre spacetime but that they are less robust in the case of an inflationary era with a small number of e-folds.

FAST, PARALLEL AND SECURE CRYPTOGRAPHY ALGORITHM USING LORENZ`S ATTRACTOR

A novel cryptography method based on the Lorenz`s attractor chaotic system is presented. The proposed algorithm is secure and fast, making it practical for general use. We introduce the chaotic operation mode, which provides an interaction among the password, message and a chaotic system. It ensures that the algorithm yields a secure codification, even if the nature of the chaotic system is known. The algorithm has been implemented in two versions: one sequential and slow and the other, parallel and fast. Our algorithm assures the integrity of the ciphertext (we know if it has been altered, which is not assured by traditional algorithms) and consequently its authenticity. Numerical experiments are presented, discussed and show the behavior of the method in terms of security and performance. The fast version of the algorithm has a performance comparable to AES, a popular cryptography program used commercially nowadays, but it is more secure, which makes it immediately suitable for general purpose cryptography applications. An internet page has been set up, which enables the readers to test the algorithm and also to try to break into the cipher.

Spin-density functional for exchange anisotropic Heisenberg model

Ground-state energies for anti ferromagnetic Heisenberg models with exchange anisotropy are estimated by means of a local-spin approximation made in the context of the density functional theory. Correlation energy is obtained using the non-linear spin-wave theory for homogeneous systems from which the spin functional is built. Although applicable to chains of any size, the results are shown for small number of sites, to exhibit finite-size effects and allow comparison with exact-numerical data from direct diagonalization of small chains. (C) 2009 Elsevier B.V. All rights reserved.

Energy of bond defects in quantum spin chains obtained from local approximations and from exact diagonalization

We study the influence of ferromagnetic and antiferromagnetic bond defects on the ground-state energy of antiferromagnetic spin chains. In the absence of translational invariance, the energy spectrum of the full Hamiltonian is obtained numerically, by an iterative modi. cation of the power algorithm. In parallel, approximate analytical energies are obtained from a local-bond approximation, proposed here. This approximation results in significant improvement upon the mean-field approximation, at negligible extra computational effort. (C) 2008 Published by Elsevier B.V.

A study of the relaxation dynamics in a quadrupolar NMR system using Quantum State Tomography

This article reports a relaxation study in an oriented system containing spin 3/2 nuclei using quantum state tomography (QST). The use of QST allowed evaluating the time evolution of all density matrix elements starting from several initial states. Using an appropriated treatment based on the Redfield theory, the relaxation rate of each density matrix element was measured and the reduced spectral densities that describe the system relaxation were determined. All the experimental data could be well described assuming pure quadrupolar relaxation and reduced spectral densities corresponding to a superposition of slow and fast motions. The data were also analyzed in the context of Quantum Information Processing, where the coherence loss of each qubit of the system was determined using the partial trace operation. (C) 2008 Elsevier Inc. All rights reserved.

A WAVELET-BASED SPEAKER VERIFICATION ALGORITHM

This paper presents a study on wavelets and their characteristics for the specific purpose of serving as a feature extraction tool for speaker verification (SV), considering a Radial Basis Function (RBF) classifier, which is a particular type of Artificial Neural Network (ANN). Examining characteristics such as support-size, frequency and phase responses, amongst others, we show how Discrete Wavelet Transforms (DWTs), particularly the ones which derive from Finite Impulse Response (FIR) filters, can be used to extract important features from a speech signal which are useful for SV. Lastly, an SV algorithm based on the concepts presented is described.

Improved voice activity detection algorithm using wavelet and support vector machine

This paper proposes an improved voice activity detection (VAD) algorithm using wavelet and support vector machine (SVM) for European Telecommunication Standards Institution (ETS1) adaptive multi-rate (AMR) narrow-band (NB) and wide-band (WB) speech codecs. First, based on the wavelet transform, the original IIR filter bank and pitch/tone detector are implemented, respectively, via the wavelet filter bank and the wavelet-based pitch/tone detection algorithm. The wavelet filter bank can divide input speech signal into several frequency bands so that the signal power level at each sub-band can be calculated. In addition, the background noise level can be estimated in each sub-band by using the wavelet de-noising method. The wavelet filter bank is also derived to detect correlated complex signals like music. Then the proposed algorithm can apply SVM to train an optimized non-linear VAD decision rule involving the sub-band power, noise level, pitch period, tone flag, and complex signals warning flag of input speech signals. By the use of the trained SVM, the proposed VAD algorithm can produce more accurate detection results. Various experimental results carried out from the Aurora speech database with different noise conditions show that the proposed algorithm gives considerable VAD performances superior to the AMR-NB VAD Options 1 and 2, and AMR-WB VAD. (C) 2009 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.