Televised Whorf: cognitive restructuring in advanced foreign language learners as a function of audio-visual media exposure

The encoding of goal-oriented motion events varies across different languages. Speakers of languages without grammatical aspect (e.g., Swedish) tend to mention motion endpoints when describing events, e.g., “two nuns walk to a house,”, and attach importance to event endpoints when matching scenes from memory. Speakers of aspect languages (e.g., English), on the other hand, are more prone to direct attention to the ongoingness of motion events, which is reflected both in their event descriptions, e.g., “two nuns are walking.”, and in their non-verbal similarity judgements. This study examines to what extent native speakers of Swedish (n = 82) with English as a foreign language (FL) restructure their categorisation of goal-oriented motion as a function of their English proficiency and experience with the English language (e.g., exposure, learning). Seventeen monolingual native English speakers from the United Kingdom (UK) were engaged for comparison purposes. Data on motion event cognition were collected through a memory-based triads matching task, in which a target scene with an intermediate degree of endpoint orientation was matched with two alternative scenes with low and high degrees of endpoint orientation, respectively. Results showed that the preference among the Swedish speakers of L2 English to base their similarity judgements on ongoingness rather than event endpoints was correlated with their use of English in their everyday lives, such that those who often watched television in English approximated the ongoingness preference of the English native speakers. These findings suggest that event cognition patterns may be restructured through the exposure to FL audio-visual media. The results thus add to the emerging picture that learning a new language entails learning new ways of observing and reasoning about reality.

Acceleration and visualization of Dynamic Network Optimization

With the emerging prevalence of smart phones and 4G LTE networks, the demand for faster-better-cheaper mobile services anytime and anywhere is ever growing. The Dynamic Network Optimization (DNO) concept emerged as a solution that optimally and continuously tunes the network settings, in response to varying network conditions and subscriber needs. Yet, the DNO realization is still at infancy, largely hindered by the bottleneck of the lengthy optimization runtime. This paper presents the design and prototype of a novel cloud based parallel solution that further enhances the scalability of our prior work on various parallel solutions that accelerate network optimization algorithms. The solution aims to satisfy the high performance required by DNO, preliminarily on a sub-hourly basis. The paper subsequently visualizes a design and a full cycle of a DNO system. A set of potential solutions to large network and real-time DNO are also proposed. Overall, this work creates a breakthrough towards the realization of DNO.

Distributed parallelization of greedy Mobile Network Optimization algorithms

The Mobile Network Optimization (MNO) technologies have advanced at a tremendous pace in recent years. And the Dynamic Network Optimization (DNO) concept emerged years ago, aimed to continuously optimize the network in response to variations in network traffic and conditions. Yet, DNO development is still at its infancy, mainly hindered by a significant bottleneck of the lengthy optimization runtime. This paper identifies parallelism in greedy MNO algorithms and presents an advanced distributed parallel solution. The solution is designed, implemented and applied to real-life projects whose results yield a significant, highly scalable and nearly linear speedup up to 6.9 and 14.5 on distributed 8-core and 16-core systems respectively. Meanwhile, optimization outputs exhibit self-consistency and high precision compared to their sequential counterpart. This is a milestone in realizing the DNO. Further, the techniques may be applied to similar greedy optimization algorithm based applications.

Heterogeneous tensor decomposition for clustering via manifold optimization

Tensor clustering is an important tool that exploits intrinsically rich structures in real-world multiarray or Tensor datasets. Often in dealing with those datasets, standard practice is to use subspace clustering that is based on vectorizing multiarray data. However, vectorization of tensorial data does not exploit complete structure information. In this paper, we propose a subspace clustering algorithm without adopting any vectorization process. Our approach is based on a novel heterogeneous Tucker decomposition model taking into account cluster membership information. We propose a new clustering algorithm that alternates between different modes of the proposed heterogeneous tensor model. All but the last mode have closed-form updates. Updating the last mode reduces to optimizing over the multinomial manifold for which we investigate second order Riemannian geometry and propose a trust-region algorithm. Numerical experiments show that our proposed algorithm compete effectively with state-of-the-art clustering algorithms that are based on tensor factorization.

Optimization of amaranth flour films plasticized with glycerol and sorbitol by multi-response analysis

The optimal formulation for the preparation of amaranth flour films plasticized with glycerol and sorbitol was obtained by a multi-response analysis. The optimization aimed to achieve films with higher resistance to break, moderate elongation and lower solubility in water. The influence of plasticizer concentration (Cg, glycerol or Cs, sorbitol) and process temperature (Tp) on the mechanical properties and solubility of the amaranth flour films was initially studied by response surface methodology (RSM). The optimized conditions obtained were Cg 20.02 g glycerol/100 g flour and Tp 75 degrees C, and Cs 29.6 g sorbitol/100 g flour and Tp 75 degrees C. Characterization of the films prepared with these formulations revealed that the optimization methodology employed in this work was satisfactory. Sorbitol was the most suitable plasticizer. It furnished amaranth flour films that were more resistant to break and less permeable to oxygen, due to its greater miscibility with the biopolymers present in the flour and its lower affinity for water. (C) 2011 Elsevier Ltd. All rights reserved.

Successional stage and geographic features determine floristic similarity among Atlantic Forest remnants, Sao Paulo State, Brazil

Analysis of floristic similarity relationships between plant communities can detect patterns of species occurrence and also explain conditioning factors. Searching for such patterns, floristic similarity relationships among Atlantic Forest sites situated at Ibiuna Plateau, Sao Paulo state, Brazil, were analyzed by multivariate techniques. Twenty one forest fragments and six sites within a continuous Forest Reserve were included in the analyses. Floristic composition and structure of the tree community (minimum dbh 5 cm) were assessed using the point centered quarter method. Two methods were used for multivariate analysis: Detrended Correspondence Analysis (DCA) and Two-Way Indicator Species Analysis (TWINSPAN). Similarity relationships among the study areas were based on the successional stage of the community and also on spatial proximity. The more similar the successional stage of the communities, the higher the floristic similarity between them, especially if the communities are geographically close. A floristic gradient from north to south was observed, suggesting a transition between biomes, since northern indicator species are mostly heliophytes, occurring also in cerrado vegetation and seasonal semideciduous forest, while southern indicator species are mostly typical ombrophilous and climax species from typical dense evergreen Atlantic Forest.

Strategies to Optimize Biosensors Based on Impedance Spectroscopy to Detect Phytic Acid Using Layer-by-Layer Films

Impedance spectroscopy has been proven a powerful tool for reaching high sensitivity in sensor arrays made with nanostructured films in the so-called electronic tongue systems, whose distinguishing ability may be enhanced with sensing units capable of molecular recognition. In this study we show that for optimized sensors and bio-sensors the dielectric relaxation processes involved in impedance measurements should also be considered, in addition to an adequate choice of sensing materials. We used sensing units made from layer-by-layer (LbL) films with alternating layers of the polyeletrolytes, poly(allylamine) hydrochloride (PAH) and poly(vinyl sulfonate) (PVS), or LbL films of PAH alternated with layers of the enzyme phytase, all adsorbed on gold interdigitate electrodes. Surprisingly, the detection of phytic acid was as effective in the PVS/PAH sensing system as with the PAH/phytase system, in spite of the specific interactions of the latter. This was attributed to the dependence of the relaxation processes on nonspecific interactions such as electrostatic cross-linking and possibly on the distinct film architecture as the phytase layers were found to grow as columns on the LbL film, in contrast to the molecularly thin PAH/PVS films. Using projection techniques, we were able to detect phytic acid at the micromolar level with either of the sensing units in a data analysis procedure that allows for further optimization.

Seamlessly integrating similarity queries in SQL

Modern database applications are increasingly employing database management systems (DBMS) to store multimedia and other complex data. To adequately support the queries required to retrieve these kinds of data, the DBMS need to answer similarity queries. However, the standard structured query language (SQL) does not provide effective support for such queries. This paper proposes an extension to SQL that seamlessly integrates syntactical constructions to express similarity predicates to the existing SQL syntax and describes the implementation of a similarity retrieval engine that allows posing similarity queries using the language extension in a relational DBM. The engine allows the evaluation of every aspect of the proposed extension, including the data definition language and data manipulation language statements, and employs metric access methods to accelerate the queries. Copyright (c) 2008 John Wiley & Sons, Ltd.

Partial spectral projected gradient method with active-set strategy for linearly constrained optimization

A method for linearly constrained optimization which modifies and generalizes recent box-constraint optimization algorithms is introduced. The new algorithm is based on a relaxed form of Spectral Projected Gradient iterations. Intercalated with these projected steps, internal iterations restricted to faces of the polytope are performed, which enhance the efficiency of the algorithm. Convergence proofs are given and numerical experiments are included and commented. Software supporting this paper is available through the Tango Project web page: http://www.ime.usp.br/similar to egbirgin/tango/.

Optimization of the physical refining of sunflower oil concerning the final contents of trans-fatty acids

The final contents of total and individual trans-fatty acids of sunflower oil, produced during the deacidification step of physical refining were obtained using a computational simulation program that considered cis-trans isomerization reaction features for oleic, linoleic, and linolenic acids attached to the glycerol part of triacylglycerols. The impact of process variables, such as temperature and liquid flow rate, and of equipment configuration parameters, such as liquid height, diameter, and number of stages, that influence the retention time of the oil in the equipment was analyzed using the response-surface methodology (RSM). The computational simulation and the RSM results were used in two different optimization methods, aiming to minimize final levels of total and individual trans-fatty acids (trans-FA), while keeping neutral oil loss and final oil acidity at low values. The main goal of this work was to indicate that computational simulation, based on a careful modeling of the reaction system, combined with optimization could be an important tool for indicating better processing conditions in industrial physical refining plants of vegetable oils, concerning trans-FA formation.

Synthesis optimization, structural evolution and optical properties of Y(0.9)Er(0.1)Al(3)(BO(3))(4) nanopowders obtained by soft chemistry methods

This paper describes the structural evolution of Y(0.9)Er(0.1)Al(3)(BO(3))(4) nanopowders using two soft chemistry routes, the sol-gel and the polymeric precursor methods. Differential scanning calorimetry, differential thermal analyses, thermogravimetric analyses, X-ray diffraction, Fourier-transform infrared, and Raman spectroscopy techniques have been used to study the chemical reactions between 700 and 1200 degrees C temperature range. From both methods the Y(0.9)Er(0.1)Al(3)(BO(3))(4) (Er:YAB) solid solution was obtained almost pure when the powdered samples were heat treated at 1150 degrees C. Based on the results, a schematic phase formation diagram of Er:YAB crystalline solid solution was proposed for powders from each method. The Er:YAB solid solution could be optimized by adding a small amount of boron oxide in excess to the Er:YAB nominal composition. The nanoparticles are obtained around 210 nm. Photoluminescence emission spectrum of the Er:YAB nanocrystalline powders was measured on the infrared region and the Stark components of the (4)I(13/2) and (4)I(15/2) levels were determined. Finally, for the first time the Raman spectrum of Y(0.9)Er(0.1)Al(3)(BO(3))(4) crystalline phase is also presented. (C) 2008 Elsevier Masson SAS. All rights reserved.

Natural products biological screening and ligand-based virtual screening for the discovery of new antileishmanial agents

In the course of our research program to discover novel antileishmanial agents, a biological screening of natural products against Leishmania major promastigotes allowed the identification of a furoquinoline alkaloid (1) and a furanocoumarin (2) as new hits. Subsequently, an integrated ligand-based virtual screening approach was employed to search for new antileishmanial compounds using these naturally occurring molecules as templates. Fourteen out of 40 compounds selected from a database of about 800,000 compounds (extracted from ZINC, a free database for virtual screening) were experimentally confirmed to possess significant in vitro antileishmanial properties. The application of ligand-based virtual screening as a complementary approach to experimental natural product screening was a useful strategy to facilitate the identification of new promising lead candidates.

Continuous GRASP with a local active-set method for bound-constrained global optimization

Global optimization seeks a minimum or maximum of a multimodal function over a discrete or continuous domain. In this paper, we propose a hybrid heuristic-based on the CGRASP and GENCAN methods-for finding approximate solutions for continuous global optimization problems subject to box constraints. Experimental results illustrate the relative effectiveness of CGRASP-GENCAN on a set of benchmark multimodal test functions.

Outer Trust-Region Method for Constrained Optimization

Given an algorithm A for solving some mathematical problem based on the iterative solution of simpler subproblems, an outer trust-region (OTR) modification of A is the result of adding a trust-region constraint to each subproblem. The trust-region size is adaptively updated according to the behavior of crucial variables. The new subproblems should not be more complex than the original ones, and the convergence properties of the OTR algorithm should be the same as those of Algorithm A. In the present work, the OTR approach is exploited in connection with the ""greediness phenomenon"" of nonlinear programming. Convergence results for an OTR version of an augmented Lagrangian method for nonconvex constrained optimization are proved, and numerical experiments are presented.

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.