Metallochlorophylls of magnesium, copper and zinc: evaluation of the influence of the first coordination sphere on their solvatochromism and aggregation properties

In this study the role of different metal centers (magnesium, zinc and copper) on the enhancement of the hydrophilic character of metallochlorophylls, was evaluated. The solvatochromism as well as the aggregation process for these compounds in water/ethanol mixtures at different volume ratios were evaluated using Fluorescence, and Resonant Light Scattering (RLS) measurements, aiming to characterize the behavior of these compounds. Independently on the studied metallochlorophyll, the presence of at least 60% of water results in a considerable increase in the fluorescence emission, probably a direct consequence of a lower aggregation of these compounds, which is confirmed by the results from RLS measurements. Additionally, the results suggest that magnesium and zinc chlorophyll should be promising phototherapeutic agents for Photodynamic Therapy.

THE LOWER CENTRAL AND DERIVED SERIES OF THE BRAID GROUPS OF THE SPHERE

In this paper, we determine the lower central and derived series for the braid groups of the sphere. We are motivated in part by the study of Fadell-Neuwirth short exact sequences, but the problem is important in its own right. The braid groups of the 2-sphere S(2) were studied by Fadell, Van Buskirk and Gillette during the 1960s, and are of particular interest due to the fact that they have torsion elements (which were characterised by Murasugi). We first prove that for all n epsilon N, the lower central series of the n-string braid group B(n)(S(2)) is constant from the commutator subgroup onwards. We obtain a presentation of Gamma(2)(Bn(S(2))), from which we observe that Gamma(2)(B(4)(S(2))) is a semi-direct product of the quaternion group Q(8) of order 8 by a free group F(2) of rank 2. As for the derived series of Bn(S(2)), we show that for all n >= 5, it is constant from the derived subgroup onwards. The group Bn(S(2)) being finite and soluble for n <= 3, the critical case is n = 4 for which the derived subgroup is the above semi-direct product Q(8) (sic) F(2). By proving a general result concerning the structure of the derived subgroup of a semi-direct product, we are able to determine completely the derived series of B(4)(S(2)) which from (B(4)(S(2)))(4) onwards coincides with that of the free group of rank 2, as well as its successive derived series quotients.

A Study on the Relationship of Embedded Sensitivity With Measuring Grid and Mode Shapes

Embedded sensitivity analysis has proven to be a useful tool in finding optimum positions of structure reinforcements. However, it was not clear how sensitivities obtained from the embedded sensitivity method were related to the normal mode, or operational mode, associated to the frequency of interest. In this work, this relationship is studied based on a finite element of a slender sheet metal piece, with preponderant bending modes. It is shown that higher sensitivities always occur at nodes or antinodes of the vibrating system. [DOI: 10.1115/1.4002127]

Applying semantics to grid middleware

Scheduling parallel and distributed applications efficiently onto grid environments is a difficult task and a great variety of scheduling heuristics has been developed aiming to address this issue. A successful grid resource allocation depends, among other things, on the quality of the available information about software artifacts and grid resources. In this article, we propose a semantic approach to integrate selection of equivalent resources and selection of equivalent software artifacts to improve the scheduling of resources suitable for a given set of application execution requirements. We also describe a prototype implementation of our approach based on the Integrade grid middleware and experimental results that illustrate its benefits. Copyright (C) 2009 John Wiley & Sons, Ltd.

Coarse-grid higher order finite-difference time-domain algorithm with low dispersion errors

Higher order (2,4) FDTD schemes used for numerical solutions of Maxwell`s equations are focused on diminishing the truncation errors caused by the Taylor series expansion of the spatial derivatives. These schemes use a larger computational stencil, which generally makes use of the two constant coefficients, C-1 and C-2, for the four-point central-difference operators. In this paper we propose a novel way to diminish these truncation errors, in order to obtain more accurate numerical solutions of Maxwell`s equations. For such purpose, we present a method to individually optimize the pair of coefficients, C-1 and C-2, based on any desired grid size resolution and size of time step. Particularly, we are interested in using coarser grid discretizations to be able to simulate electrically large domains. The results of our optimization algorithm show a significant reduction in dispersion error and numerical anisotropy for all modeled grid size resolutions. Numerical simulations of free-space propagation verifies the very promising theoretical results. The model is also shown to perform well in more complex, realistic scenarios.

Strong surjectivity of maps from 2-complexes into the 2-sphere

Given a model 2-complex K(P) of a group presentation P, we associate to it an integer matrix Delta(P) and we prove that a cellular map f : K(P) -> S(2) is root free (is not strongly surjective) if and only if the diophantine linear system Delta(P) Y = (deg) over right arrow (f) has an integer solution, here (deg) over right arrow (f) is the so-called vector-degree of f

The analytic torsion of a cone over a sphere

We compute the analytic torsion of a cone over a sphere of dimensions 1, 2, and 3, and we conjecture a general formula for the cone over an odd dimensional sphere. (C) 2009 Elsevier Masson SAS. All rights reserved.

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.

Scheduling Grid Applications with Software Requirements

The aim of task scheduling is to minimize the makespan of applications, exploiting the best possible way to use shared resources. Applications have requirements which call for customized environments for their execution. One way to provide such environments is to use virtualization on demand. This paper presents two schedulers based on integer linear programming which schedule virtual machines (VMs) in grid resources and tasks on these VMs. The schedulers differ from previous work by the joint scheduling of tasks and VMs and by considering the impact of the available bandwidth on the quality of the schedule. Experiments show the efficacy of the schedulers in scenarios with different network configurations.

Application execution management on the InteGrade opportunistic grid middleware

The InteGrade project is a multi-university effort to build a novel grid computing middleware based on the opportunistic use of resources belonging to user workstations. The InteGrade middleware currently enables the execution of sequential, bag-of-tasks, and parallel applications that follow the BSP or the MPI programming models. This article presents the lessons learned over the last five years of the InteGrade development and describes the solutions achieved concerning the support for robust application execution. The contributions cover the related fields of application scheduling, execution management, and fault tolerance. We present our solutions, describing their implementation principles and evaluation through the analysis of several experimental results. (C) 2010 Elsevier Inc. All rights reserved.

Minimizing the object dimensions in circle and sphere packing problems

Given a fixed set of identical or different-sized circular items, the problem we deal with consists on finding the smallest object within which the items can be packed. Circular, triangular, squared, rectangular and also strip objects are considered. Moreover, 2D and 3D problems are treated. Twice-differentiable models for all these problems are presented. A strategy to reduce the complexity of evaluating the models is employed and, as a consequence, instances with a large number of items can be considered. Numerical experiments show the flexibility and reliability of the new unified approach. (C) 2007 Elsevier Ltd. All rights reserved.

THE LOWER CENTRAL AND DERIVED SERIES OF THE BRAID GROUPS OF THE FINITELY-PUNCTURED SPHERE

Motivated in part by the study of Fadell-Neuwirth short exact sequences, we determine the lower central and derived series for the braid groups of the finitely-punctured sphere. For n >= 1, the class of m-string braid groups B(m)(S(2)\{x(1), ... , x(n)}) of the n-punctured sphere includes the usual Artin braid groups B(m) (for n = 1), those of the annulus, which are Artin groups of type B (for n = 2), and affine Artin groups of type (C) over tilde (for n = 3). We first consider the case n = 1. Motivated by the study of almost periodic solutions of algebraic equations with almost periodic coefficients, Gorin and Lin calculated the commutator subgroup of the Artin braid groups. We extend their results, and show that the lower central series (respectively, derived series) of B(m) is completely determined for all m is an element of N (respectively, for all m not equal 4). In the exceptional case m = 4, we obtain some higher elements of the derived series and its quotients. When n >= 2, we prove that the lower central series (respectively, derived series) of B(m)(S(2)\{x(1), ... , x(n)}) is constant from the commutator subgroup onwards for all m >= 3 (respectively, m >= 5). The case m = 1 is that of the free group of rank n - 1. The case n = 2 is of particular interest notably when m = 2 also. In this case, the commutator subgroup is a free group of infinite rank. We then go on to show that B(2)(S(2)\{x(1), x(2)}) admits various interpretations, as the Baumslag-Solitar group BS(2, 2), or as a one-relator group with non-trivial centre for example. We conclude from this latter fact that B(2)(S(2)\{x(1), x(2)}) is residually nilpotent, and that from the commutator subgroup onwards, its lower central series coincides with that of the free product Z(2) * Z. Further, its lower central series quotients Gamma(i)/Gamma(i+1) are direct sums of copies of Z(2), the number of summands being determined explicitly. In the case m >= 3 and n = 2, we obtain a presentation of the derived subgroup, from which we deduce its Abelianization. Finally, in the case n = 3, we obtain partial results for the derived series, and we prove that the lower central series quotients Gamma(i)/Gamma(i+1) are 2-elementary finitely-generated groups.

The classification and the conjugacy classes of the finite subgroups of the sphere braid groups

Let n >= 3. We classify the finite groups which are realised as subgroups of the sphere braid group B(n)(S(2)). Such groups must be of cohomological period 2 or 4. Depending on the value of n, we show that the following are the maximal finite subgroups of B(n)(S(2)): Z(2(n-1)); the dicyclic groups of order 4n and 4(n - 2); the binary tetrahedral group T*; the binary octahedral group O*; and the binary icosahedral group I(*). We give geometric as well as some explicit algebraic constructions of these groups in B(n)(S(2)) and determine the number of conjugacy classes of such finite subgroups. We also reprove Murasugi`s classification of the torsion elements of B(n)(S(2)) and explain how the finite subgroups of B(n)(S(2)) are related to this classification, as well as to the lower central and derived series of B(n)(S(2)).

Estrogen receptor: Structural differences and potential implications on selectivity examined by the GRID/CPCA approach

Selective Estrogen Receptor Modulators ( SERMs) have been developed, but the selectivity towards the subtypes ( ER or ER is not well understood. Based on three-dimensional structural properties of ligand binding domains, a model that takes into account this aspect was developed via molecular interaction fields and consensus principal component analysis (GRID/CPCA).

Proposal for the teaching of the chemical control of supragingival biofilm

The mechanical control of supragingival biofilm is accepted as one of the most important measures to treat and prevent dental caries and periodontal diseases. Nevertheless, maintaining dental surfaces biofilm-free is not an easy task. In this regard, chemical agents, mainly in the form of mouthwashes, have been studied to help overcome the difficulties involved in the mechanical control of biofilm. The aim of this paper was to discuss proposals for the teaching of supragingival chemical control (SCC) in order to improve dentists' knowledge regarding this clinical issue. Firstly, the literature regarding the efficacy of antiseptics is presented, clearly showing that chemical agents are clinically effective in the reduction of biofilm and gingival inflammation when used as adjuvant agents to mechanical control. Thus, it is suggested that the content related to SCC be included in the curricular grid of dental schools. Secondly, some essential topics are recommended to be included in the teaching of SCC as follows: skills and competencies expected of a graduate dentist regarding SCC; how to include this content in the curricular grid; teaching-learning tools and techniques to be employed; and program content.