Uma abordagem por nuvem de partículas para problemas de otimização combinatória

Combinatorial optimization problems have the goal of maximize or minimize functions defined over a finite domain. Metaheuristics are methods designed to find good solutions in this finite domain, sometimes the optimum solution, using a subordinated heuristic, which is modeled for each particular problem. This work presents algorithms based on particle swarm optimization (metaheuristic) applied to combinatorial optimization problems: the Traveling Salesman Problem and the Multicriteria Degree Constrained Minimum Spanning Tree Problem. The first problem optimizes only one objective, while the other problem deals with many objectives. In order to evaluate the performance of the algorithms proposed, they are compared, in terms of the quality of the solutions found, to other approaches

Evolutionary computation of forests with Degree- and Role-Constrained Minimum Spanning Trees

Finding the degree-constrained minimum spanning tree (DCMST) of a graph is a widely studied NP-hard problem. One of its most important applications is network design. Here we deal with a new variant of the DCMST problem, which consists of finding not only the degree- but also the role-constrained minimum spanning tree (DRCMST), i.e., we add constraints to restrict the role of the nodes in the tree to root, intermediate or leaf node. Furthermore, we do not limit the number of root nodes to one, thereby, generally, building a forest of DRCMSTs. The modeling of network design problems can benefit from the possibility of generating more than one tree and determining the role of the nodes in the network. We propose a novel permutation-based representation to encode these forests. In this new representation, one permutation simultaneously encodes all the trees to be built. We simulate a wide variety of DRCMST problems which we optimize using eight different evolutionary computation algorithms encoding individuals of the population using the proposed representation. The algorithms we use are: estimation of distribution algorithm, generational genetic algorithm, steady-state genetic algorithm, covariance matrix adaptation evolution strategy, differential evolution, elitist evolution strategy, non-elitist evolution strategy and particle swarm optimization. The best results are for the estimation of distribution algorithms and both types of genetic algorithms, although the genetic algorithms are significantly faster.

Efficient Forest Data Structure for Evolutionary Algorithms Applied to Network Design

The design of a network is a solution to several engineering and science problems. Several network design problems are known to be NP-hard, and population-based metaheuristics like evolutionary algorithms (EAs) have been largely investigated for such problems. Such optimization methods simultaneously generate a large number of potential solutions to investigate the search space in breadth and, consequently, to avoid local optima. Obtaining a potential solution usually involves the construction and maintenance of several spanning trees, or more generally, spanning forests. To efficiently explore the search space, special data structures have been developed to provide operations that manipulate a set of spanning trees (population). For a tree with n nodes, the most efficient data structures available in the literature require time O(n) to generate a new spanning tree that modifies an existing one and to store the new solution. We propose a new data structure, called node-depth-degree representation (NDDR), and we demonstrate that using this encoding, generating a new spanning forest requires average time O(root n). Experiments with an EA based on NDDR applied to large-scale instances of the degree-constrained minimum spanning tree problem have shown that the implementation adds small constants and lower order terms to the theoretical bound.

Computación evolutiva de bosques de expansión mínimos con restricción de grado y de rol

Encontrar el árbol de expansión mínimo con restricción de grado de un grafo (DCMST por sus siglas en inglés) es un problema NP-complejo ampliamente estudiado. Una de sus aplicaciones más importantes es el dise~no de redes. Aquí nosotros tratamos una nueva variante del problema DCMST, que consiste en encontrar el árbol de expansión mínimo no solo con restricciones de grado, sino también con restricciones de rol (DRCMST), es decir, a~nadimos restricciones para restringir el rol que los nodos tienen en el árbol. Estos roles pueden ser nodo raíz, nodo intermedio o nodo hoja. Por otra parte, no limitamos el número de nodos raíz a uno, por lo que, en general, construiremos bosques de DRCMSTs. El modelado en los problemas de dise~no de redes puede beneficiarse de la posibilidad de generar más de un árbol y determinar el rol de los nodos en la red. Proponemos una nueva representación basada en permutaciones para codificar los bosques de DRCMSTs. En esta nueva representación, una permutación codifica simultáneamente todos los árboles que se construirán. Nosotros simulamos una amplia variedad de problemas DRCMST que optimizamos utilizando ocho algoritmos de computación evolutiva diferentes que codifican los individuos de la población utilizando la representación propuesta. Los algoritmos que utilizamos son: algoritmo de estimación de distribuciones (EDA), algoritmo genético generacional (gGA), algoritmo genético de estado estacionario (ssGA), estrategia evolutiva basada en la matriz de covarianzas (CMAES), evolución diferencial (DE), estrategia evolutiva elitista (ElitistES), estrategia evolutiva no elitista (NonElitistES) y optimización por enjambre de partículas (PSO). Los mejores resultados fueron para el algoritmo de estimación de distribuciones utilizado y ambos tipos de algoritmos genéticos, aunque los algoritmos genéticos fueron significativamente más rápidos.---ABSTRACT---Finding the degree-constrained minimum spanning tree (DCMST) of a graph is a widely studied NP-hard problem. One of its most important applications is network design. Here we deal with a new variant of the DCMST problem, which consists of finding not only the degree- but also the role-constrained minimum spanning tree (DRCMST), i.e., we add constraints to restrict the role of the nodes in the tree to root, intermediate or leaf node. Furthermore, we do not limit the number of root nodes to one, thereby, generally, building a forest of DRCMSTs. The modeling of network design problems can benefit from the possibility of generating more than one tree and determining the role of the nodes in the network. We propose a novel permutation-based representation to encode the forest of DRCMSTs. In this new representation, one permutation simultaneously encodes all the trees to be built. We simulate a wide variety of DRCMST problems which we optimize using eight diferent evolutionary computation algorithms encoding individuals of the population using the proposed representation. The algorithms we use are: estimation of distribution algorithm (EDA), generational genetic algorithm (gGA), steady-state genetic algorithm (ssGA), covariance matrix adaptation evolution strategy (CMAES), diferential evolution (DE), elitist evolution strategy (ElististES), non-elitist evolution strategy (NonElististES) and particle swarm optimization (PSO). The best results are for the estimation of distribution algorithm and both types of genetic algorithms, although the genetic algorithms are significantly faster. iv

Percolation of spatially constrained Erdos-R enyi networks with degree correlations

Motivated by experiments on activity in neuronal cultures [J. Soriano, M. Rodr ́ıguez Mart́ınez, T. Tlusty, and E. Moses, Proc. Natl. Acad. Sci. 105, 13758 (2008)], we investigate the percolation transition and critical exponents of spatially embedded Erd̋os-Ŕenyi networks with degree correlations. In our model networks, nodes are randomly distributed in a two-dimensional spatial domain, and the connection probability depends on Euclidian link length by a power law as well as on the degrees of linked nodes. Generally, spatial constraints lead to higher percolation thresholds in the sense that more links are needed to achieve global connectivity. However, degree correlations favor or do not favor percolation depending on the connectivity rules. We employ two construction methods to introduce degree correlations. In the first one, nodes stay homogeneously distributed and are connected via a distance- and degree-dependent probability. We observe that assortativity in the resulting network leads to a decrease of the percolation threshold. In the second construction methods, nodes are first spatially segregated depending on their degree and afterwards connected with a distance-dependent probability. In this segregated model, we find a threshold increase that accompanies the rising assortativity. Additionally, when the network is constructed in a disassortative way, we observe that this property has little effect on the percolation transition.

Conformationally constrained macrocycles that mimic tripeptide beta-strands in water and aprotic solvents

The beta-strand conformation is unknown for short peptides in aqueous solution, yet it is a fundamental building block in proteins and the crucial recognition motif for proteolytic enzymes that enable formation and turnover of all proteins. To create a generalized scaffold as a peptidomimetic that is preorganized in a beta-strand, we individually synthesized a series of 15-22-membered macrocyclic analogues of tripeptides and analyzed their structures. Each cycle is highly constrained by two trans amide bonds and a planar aromatic ring with a short nonpeptidic linker between them. A measure of this ring strain is the restricted rotation of the component tyrosinyl aromatic ring (DeltaG(rot) 76.7 kJ mol(-1) (16-membered ring), 46.1 kJ mol(-1) (17-membered ring)) evidenced by variable temperature proton NMR spectra (DMF-d(7), 200-400 K). Unusually large amide coupling constants ((3)J(NH-CHalpha) 9-10 Hz) corresponding to large dihedral angles were detected in both protic and aprotic solvents for these macrocycles, consistent with a high degree of structure in solution. The temperature dependence of all amide NH chemical shifts (Deltadelta/T7-12 ppb/deg) precluded the presence of transannular hydrogen bonds that define alternative turn structures. Whereas similar sized conventional cyclic peptides usually exist in solution as an equilibrium mixture of multiple conformers, these macrocycles adopt a well-defined beta-strand structure even in water as revealed by 2-D NMR spectral data and by a structure calculation for the smallest (15-membered) and most constrained macrocycle. Macrocycles that are sufficiently constrained to exclusively adopt a beta-strand-mimicking structure in water may be useful pre-organized and generic templates for the design of compounds that interfere with beta-strand recognition in biology.

The Optimal Degree of Monetary-Discretion in a New Keynesian Model with Private Information

This paper considers the optimal degree of discretion in monetary policy when the central bank conducts policy based on its private information about the state of the economy and is unable to commit. Society seeks to maximize social welfare by imposing restrictions on the central bank's actions over time, and the central bank takes these restrictions and the New Keynesian Phillips curve as constraints. By solving a dynamic mechanism design problem we find that it is optimal to grant "constrained discretion" to the central bank by imposing both upper and lower bounds on permissible inflation, and that these bounds must be set in a history-dependent way. The optimal degree of discretion varies over time with the severity of the time-inconsistency problem, and, although no discretion is optimal when the time-inconsistency problem is very severe, our numerical experiment suggests that no-discretion is a transient phenomenon, and that some discretion is granted eventually.

Opportunities, constraints and constrained opportunities – A study on mothers’ working time patterns in 22 European countries

The aim of this study was to analyse mothers’ working time patterns across 22 European countries. The focus was on three questions: how much mothers prefer to work, how much they actually work, and to what degree their preferred and actual working times are (in)consistent with each other. The focus was on cross-national differences in mothers’ working time patterns, comparison of mothers’ working times to that of childless women and fathers, as well as on individual- and country-level factors that explain the variation between them. In the theoretical background, the departure point was an integrative theoretical approach where the assumption is that there are various kinds of explanations for the differences in mothers’ working time patterns – namely structural, cultural and institutional – , and that these factors are laid in two levels: individual- and country-levels. Data were extracted from the European Social Survey (ESS) 2010 / 2011. The results showed that mothers’ working time patterns, both preferred and actual working times, varied across European countries. Four clusters were formed to illustrate the differences. In the full-time pattern, full-time work was the most important form of work, leaving all other working time forms marginal. The full-time pattern was perceived in terms of preferred working times in Bulgaria and Portugal. In polarised pattern countries, fulltime work was also important, but it was accompanied by a large share of mothers not working at all. In the case of preferred working times, many Eastern and Southern European countries followed it whereas in terms of actual working times it included all Eastern and Southern European countries as well as Finland. The combination pattern was characterised by the importance of long part-time hours and full-time work. It was the preferred working time pattern in the Nordic countries, France, Slovenia, and Spain, but Belgium, Denmark, France, Norway, and Sweden followed it in terms of actual working times. The fourth cluster that described mothers’ working times was called the part-time pattern, and it was illustrated by the prevalence of short and long part-time work. In the case of preferred working times, it was followed in Belgium, Germany, Ireland, the Netherlands and Switzerland. Besides Belgium, the part-time pattern was followed in the same countries in terms of actual working times. The consistency between preferred and actual working times was rather strong in a majority of countries. However, six countries fell under different working time patterns when preferred and actual working times were compared. Comparison of working mothers’, childless women’s, and fathers’ working times showed that differences between these groups were surprisingly small. It was only in part-time pattern countries that working mothers worked significantly shorter hours than working childless women and fathers. Results therefore revealed that when mothers’ working times are under study, an important question regarding the population examined is whether it consists of all mothers or only working mothers. Results moreover supported the use of the integrative theoretical approach when studying mothers’ working time patterns. Results indicate that mothers’ working time patterns in all countries are shaped by various opportunities and constraints, which are comprised of structural, cultural, institutional, and individual-level factors.

A simple method for choosing the parameters of a two degree-of-freedom tuned vibration absorber

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

Constrained intervals and interval spaces

Constrained intervals, intervals as a mapping from [0, 1] to polynomials of degree one (linear functions) with non-negative slopes, and arithmetic on constrained intervals generate a space that turns out to be a cancellative abelian monoid albeit with a richer set of properties than the usual (standard) space of interval arithmetic. This means that not only do we have the classical embedding as developed by H. Radström, S. Markov, and the extension of E. Kaucher but the properties of these polynomials. We study the geometry of the embedding of intervals into a quasilinear space and some of the properties of the mapping of constrained intervals into a space of polynomials. It is assumed that the reader is familiar with the basic notions of interval arithmetic and interval analysis. © 2013 Springer-Verlag Berlin Heidelberg.

Displacement Analysis of Under-Constrained Cable-Driven Parallel Robots

This dissertation studies the geometric static problem of under-constrained cable-driven parallel robots (CDPRs) supported by n cables, with n ≤ 6. The task consists of determining the overall robot configuration when a set of n variables is assigned. When variables relating to the platform posture are assigned, an inverse geometric static problem (IGP) must be solved; whereas, when cable lengths are given, a direct geometric static problem (DGP) must be considered. Both problems are challenging, as the robot continues to preserve some degrees of freedom even after n variables are assigned, with the final configuration determined by the applied forces. Hence, kinematics and statics are coupled and must be resolved simultaneously. In this dissertation, a general methodology is presented for modelling the aforementioned scenario with a set of algebraic equations. An elimination procedure is provided, aimed at solving the governing equations analytically and obtaining a least-degree univariate polynomial in the corresponding ideal for any value of n. Although an analytical procedure based on elimination is important from a mathematical point of view, providing an upper bound on the number of solutions in the complex field, it is not practical to compute these solutions as it would be very time-consuming. Thus, for the efficient computation of the solution set, a numerical procedure based on homotopy continuation is implemented. A continuation algorithm is also applied to find a set of robot parameters with the maximum number of real assembly modes for a given DGP. Finally, the end-effector pose depends on the applied load and may change due to external disturbances. An investigation into equilibrium stability is therefore performed.

The Crosslinking Degree Controls The Mechanical, Rheological, And Swelling Properties Of Hyaluronic Acid Microparticles.

Viscosupplements, used for treating joint and cartilage diseases, restore the rheological properties of synovial fluid, regulate joint homeostasis and act as scaffolds for cell growth and tissue regeneration. Most viscosupplements are hydrogels composed of hyaluronic acid (HA) microparticles suspended in fluid HA. These microparticles are crosslinked with chemicals to assure their stability against enzyme degradation and to prolong the action of the viscosupplement. However, the crosslinking also modifies the mechanical, swelling and rheological properties of the HA microparticle hydrogels, with consequences on the effectiveness of the application. The aim of this study is to correlate the crosslinking degree (CD) with these properties to achieve modulation of HA/DVS microparticles through CD control. Because divinyl sulfone (DVS) is the usual crosslinker of HA in viscosupplements, we examined the effects of CD by preparing HA microparticles at 1:1, 2:1, 3:1, and 5:1 HA/DVS mass ratios. The CD was calculated from inductively coupled plasma spectrometry data. HA microparticles were previously sized to a mean diameter of 87.5 µm. Higher CD increased the viscoelasticity and the extrusion force and reduced the swelling of the HA microparticle hydrogels, which also showed Newtonian pseudoplastic behavior and were classified as covalent weak. The hydrogels were not cytotoxic to fibroblasts according to an MTT (3-[4,5-dimethylthiazol-2-yl]-2,5-diphenyltetrazolium bromide) assay. © 2014 Wiley Periodicals, Inc. J Biomed Mater Res Part A, 2014.

Histologic Correlation Of Expression Of Ki-67 In Squamous Cell Carcinoma Of The Glottis According To The Degree Of Cell Differentiation.

Squamous cell carcinoma is the most common neoplasm of the larynx and glottis, and its prognosis depends on the size of the lesion, level of local invasion, cervical lymphatic spread, and presence of distant metastases. Ki-67 (MKI67) is a protein present in the core, whose function is related to cell proliferation. To evaluate the expression of marker Ki-67 in squamous cell carcinoma of the larynx and glottis and its correlation to pathological findings. Experimental study with immunohistochemistry analysis of Ki-67, calculating the percentage of the cell proliferation index in glottic squamous cell carcinomas. Sixteen cases were analyzed, with six well-differentiated and 10 poorly/moderately differentiated tumors. There was a correlation between cell proliferation index and degree of cell differentiation, with higher proliferation in poorly/moderately differentiated tumors. The cell proliferation index, as measured by Ki-67, may be useful in the characterization of histological degree in glottic squamous cell tumors.

Risk Of Leukemia In First Degree Relatives Of Patients With Nonsyndromic Cleft Lip And Palate.

The aim of this study was to determine the frequency of leukemia in parents of patients with nonsyndromic cleft lip and/or cleft palate (NSCL/P). This case-control study evaluated first-degree family members of 358 patients with NSCL/P and 1,432 subjects without craniofacial alterations or syndromes. Statistical analysis was carried out using Fisher's test. From the 358 subjects with NSCL/P, 3 first-degree parents had history of leukemia, while 2 out of 1,432 subjects from the unaffected group had a family history of leukemia. The frequency of positive family history of leukemia was not significantly increased in first-degree relatives of patients with NSCL/P.

Effect Of 4-(n,n-dimethylamino)phenethyl Alcohol On Degree Of Conversion And Cytotoxicity Of Photo-polymerized Cq-based Resin Composites.

The aim of this study was to evaluate the degree of conversion (DC) and the cytotoxicity of photo-cured experimental resin composites containing 4-(N,N-dimethylamino)phenethyl alcohol (DMPOH) combined to the camphorquinone (CQ) compared with ethylamine benzoate (EDAB). The resin composites were mechanically blended using 35 wt% of an organic matrix and 65 wt% of filler loading. To this matrix was added 0.2 wt% of CQ and 0.2 wt% of one of the reducing agents tested. 5x1 mm samples (n=5) were previously submitted to DC measurement and then pre-immersed in complete culture medium without 10% (v/v) bovine serum for 1 h or 24 h at 37 °C in a humidifier incubator with 5% CO2 and 95% humidity to evaluate the cytotoxic effects of experimental resin composites using the MTT assay on immortalized human keratinocytes cells. As a result of absence of normal distribution, the statistical analysis was performed using the nonparametric Kruskal-Wallis to evaluate the cytotoxicity and one-way analysis of variance to evaluate the DC. For multiple comparisons, cytotoxicity statistical analyses were submitted to Student-Newman-Keuls and DC analysis to Tukey's HSD post-hoc test (=0.05). No significant differences were found between the DC of DMPOH (49.9%) and EDAB (50.7%). 1 h outcomes showed no significant difference of the cell viability between EDAB (99.26%), DMPOH (94.85%) and the control group (100%). After 24 h no significant difference were found between EDAB (48.44%) and DMPOH (38.06%), but significant difference was found compared with the control group (p>0.05). DMPOH presented similar DC and cytotoxicity compared with EDAB when associated with CQ.