Genome Sequence of the Wheat Stem Sawfly, Cephus cinctus, Representing an Early-Branching Lineage of the Hymenoptera, Illuminates Evolution of Hymenopteran Chemoreceptors.

The wheat stem sawfly, Cephus cinctus, is a major pest of wheat and key ecological player in the grasslands of western North America. It also represents the distinctive Cephoidea superfamily of sawflies (Symphyta) that appeared early during the hymenopteran radiation, but after three early-branching eusymphytan superfamilies that form the base of the order Hymenoptera. We present a high-quality draft genome assembly of 162 Mb in 1,976 scaffolds with a scaffold N50 of 622 kb. Automated gene annotation identified 11,210 protein-coding gene models and 1,307 noncoding RNA models. Thirteen percent of the assembly consists of ∼58,000 transposable elements partitioned equally between Class-I and Class-II elements. Orthology analysis reveals that 86% of Cephus proteins have identifiable orthologs in other insects. Phylogenomic analysis of conserved subsets of these proteins supports the placement of the Cephoidea between the Eusymphyta and the parasitic woodwasp superfamily Orussoidea. Manual annotation and phylogenetic analysis of families of odorant, gustatory, and ionotropic receptors, plus odorant-binding proteins, shows that Cephus has representatives for most conserved and expanded gene lineages in the Apocrita (wasps, ants, and bees). Cephus has also maintained several insect gene lineages that have been lost from the Apocrita, most prominently the carbon dioxide receptor subfamily. Furthermore, Cephus encodes a few small lineage-specific chemoreceptor gene family expansions that might be involved in adaptations to new grasses including wheat. These comparative analyses identify gene family members likely to have been present in the hymenopteran ancestor and provide a new perspective on the evolution of the chemosensory gene repertoire

Solution of the Job-Shop Scheduling Problem through the Traveling Salesman Problem

[ES] En este trabajo se estudia el Problema de Secuenciación de Trabajos codificado como un Problema de Agente Viajero y resuelto mediante Algoritmos Genéticos. Se propone un Algoritmo Genético en donde se comparan dos tipos de selección: por torneo y por ruleta. Se realizan diferentes pruebas para la solución del Problema del Agente Viajero con los dos tipos de selección bajo diferentes parámetros: número de individuos, número de iteraciones, probabilidad de cruce y probabilidad de mutación; a partir de estos se seleccionan los parámetros y el tipo de selección. Posteriormente se codifica al Problema de Secuenciación como un Problema del Agente Viajero. La propuesta se presenta mediante la aplicación a diferentes ejemplos del Problema de Secuenciación de Trabajos y la comparación con los resultados obtenidos en la literatura.[EN] In this paper we proposed a solution to the Job-Shop Scheduling Problem using the Traveling Salesman Problem solved by Genetic Algorithms. We proposed a genetic algorithm where we compare two types of selection: tournament and roulette. Different tests are performed to solve the Traveling Salesman Problem with the two types of selection under different parameters: number of individuals, number of iterations, crossover probability and mutation probability. Then the best type of selection and the best parameters are used to solve the Job-Shop Scheduling Problem with Genetic Algorithms for the Traveling Salesman Problem. The proposal is presented solving different examples of Job Sequencing Problem and compare them with the results obtained in the literature.Anaya Fuentes, G.; Hernández Gress, E.; Seck Tuoh Mora, J.; Medina Marín, J. (2016). Solución al Problema de Secuenciación de Trabajos mediante el Problema del Agente Viajero. Revista Iberoamericana de Automática e Informática industrial. 13(4):430-437. https://doi.org/10.1016/j.riai.2016.07.003OJS430437134Beasley, J., 1990.OR-Library: Distributing test problems by electronic mail. Journal of the Operational Research Society, 11, 1069-1072.Bektas, T., 2006. The multiple traveling salesman problem: an overview of formulations and solution procedures, 34,209-219.Bozejko, W., Pempera J. and Smuntnicki C., 2009. Parallel simulated annealing for the Job Shop Scheduling problem. Biological Cybernetics, 60, 139-144.Buthainah F. and Hamza A., 2008. Enhanced Traveling Salesman Problem solving by Genetic Algorithm Technique. World Academy of Science, Engineering and Technology,38, 298-302.Cerny, V., 1985. Thermodynamical Approach to the Traveling Salesman Problem: An Efficient Simulation Algorithm. Lecture note in computer science Proceedings of the 9th Intenational Conference on Computational Science, 5544, 631-640.Chambers, L., 1998. Genetic Algorithms. University Western Press, Australia.Chatterjee, S., Carrera C., and Linch L., 1996. Genetic Algorithms and traveling salesman problems. Siam Journal of Optimation, 515-529.Chunguo, W., Wei X., and Yanchun L., 2004. A Modified Integer-Coding Genetic Algorithm for Job Shop Scheduling Problem, Trends in Artificial Intelligence. Lecture Notes in Computer Science Volum 3157,373-380.Delgado E., 2005. Aplicación de Algoritmos Genéticos para la Programación de Tareas de una celda de manufactura. Ingeniería e Investigación: Universidad Nacional de Colombia, 24-31.Dorigo, M., 1997. Ant colonies for the traveling salesman problem. Universidad Libre de Bruselas, Bélgica.Fogel, D., 1998. An evolutionary approach to the traveling salesman problem. Biological Cybernetics, 60, 139-144.Gao, S., Zhang L, and Zhang F. 2007. g. Solving Traveling Salesman Problem by Ant Colony Optimization Algorithm with Association Rule Proceedings of the Third International Conference on Natural Computation, 3, 693-698.Ge, H., Du W., y Quian F., 2007. A hybrid algorithm based on swarm optimization and simulated annealing for job shop scheduling. Proceedings of the Third International Conference on Natural Computation, 3, 715-719.Gerhard, R., 2006. Discrete and Combinatorial Optimization. Universidad de Heidelberg-Instituto de Ciencias de la Computación, Alemania.Goldberg, D., 1989. Genetic Algorithms in Search, Optimization and Machine Learning. Addison-Wesley Publishing Corporation, Estados Unidos de América.Holland, J., 1992. Adaptation in Natural and Artificial Systems. MIT Press, Cambridge, Estados Unidos de América.Jog, P., Kim J., Suh J., y Gucht D., 1991. Parallel Genetic Algorithms Applied to the Traveling Salesman Problem. European Journal of Operational Research, 490-510.Juang, C., 2004. A hybrid genetic algorithm and particle swarm optimization for recurrent network design. IEEE Transactions on Evolutionary Computation, 34, 997-1006.Larrañaga, P., Kuijpers C., Murga R., Inza I., y Dizdarevic S., 1999. Genetic Algorithms for the Traveling Salesman Problem: A review of Representations and Operators. Artificial Intelligence Review, 129-170.Maldonado C. 2010. El mundo de las ciencias de la complejidad: Una investigación sobre qué son, su desarrollo y sus posibilidades. Universidad del Rosario.Moon, C., Kim J., Choi G., y Seo Y., 2002. An efficient genetic algorithm for the traveling salesman problem with precedent constraints. European Journal of Operational Research, 606-617.Ruiz, J., 2011. Complexity Indicators Applied to the Job Shop Scheduling Problem. International Journal of Combinatorial Optimization Problems and Informatics, 25-31.Sivanamdam, S. y Deepa S, 2008. Introduction to Genetic Algorithms. Springer, Estados Unidos de América.Tamilarasi, A. y Anantha K., 2010. An enhanced genetic algorithm with simulated annealing for jobshop scheduling. International Journal of Engineering Science and Technology 2, 144-151.Wagner, H, 1975. Principles of Operations Research. 2ª ed. Englewood Cliffs, N.J. Prentice Hall, Estados Unidos de América.Winston, W., 2005. Investigación de Operaciones: Aplicaciones y Algoritmos. Indiana University Press, Estados Unidos de América.Yamada T., y Nakano R., 1997. Genetic Algorithms for Job Shop Scheduling. Proceedings of Modern Heuristic for Decision Support, UNICOM Seminar London, 67-81

Cardiovascular and pulmonary complications of aneurysmal subarachnoid hemorrhage

Cardiopulmonary complications after aneurysmal subarachnoid hemorrhage negatively affect overall morbidity and mortality. An electronic literature search was performed for English-language articles focused on cardiopulmonary complications with subarachnoid hemorrhage published through October 2010. A total of 278 citations were identified, including 72 clinical studies. In most cases, study quality was low or very low. Cardiac injury, evidenced by an elevation in troponin levels, is reported in about one-third of patients after aneurysmal subarachnoid hemorrhage. Arrhythmias also occur in about one-third of patients after subarachnoid hemorrhage. The incidence of pulmonary complications, especially neurogenic pulmonary edema, is more difficult to establish from available literature. Cardiopulmonary complications have been linked to worsened clinical outcome, suggesting a role for cardiac monitoring and interventions

Hemodynamic management of subarachnoid hemorrhage

Hemodynamic augmentation therapy is considered standard treatment to help prevent and treat vasospasm and delayed cerebral ischemia. Standard triple- H therapy combines volume expansion (hypervolemia), blood pressure augmentation (hypertension), and hemodilution. An electronic literature search was conducted of English-language papers published between 2000 and October 2010 that focused on hemodynamic augmentation therapies in patients with subarachnoid hemorrhage. Among the eligible reports identified, 11 addressed volume expansion, 10 blood pressure management, 4 inotropic therapy, and 12 hemodynamic augmentation in patients with unsecured aneurysms. While hypovolemia should be avoided, hypervolemia did not appear to confer additional benefits over normovolemic therapy, with an excess of side effects occurring in patients treated with hypervolemic targets. Overall, hypertension was associated with higher cerebral blood flow, regardless of volume status (normo- or hypervolemia), with neurological symptom reversal seen in two-thirds of treated patients. Limited data were available for evaluating inotropic agents or hemodynamic augmentation in patients with additional unsecured aneurysms. In the context of sparse data, no incremental risk of aneurysmal rupture has been reported with the induction of hemodynamic augmentation

Endocrine function following acute SAH

Disruption of the hypothalamic-pituitary-adrenal axes may occur after aneurysmal subarachnoid hemorrhage, resulting in hypopituitarism. An electronic literature search was conducted to identify articles with English-language abstracts published between 1980 and March 2011, which addressed hypothalamic-pituitary-adrenal axis insufficiency and hormone replacement. A total of 18 observational and prospective, randomized studies were selected for this review. Limited data are available, evaluating pituitary effects during the acute stage after subarachnoid hemorrhage, with inconsistent results being reported. Overall, after acute subarachnoid hemorrhage, cortisol levels may initially be supranormal, decreasing toward normal levels over time. During the months to years after subarachnoid hemorrhage, pituitary deficiency may occur in one out of three patients. Limited data suggest modest outcome benefits with fludrocortisone and no benefit or harm from corticosteroids

Anemia and transfusion after subarachnoid hemorrhage

Delayed cerebral ischemia after subarachnoid hemorrhage (SAH) may be affected by a number of factors, including cerebral blood flow and oxygen delivery. Anemia affects about half of patients with SAH and is associated with worse outcome. Anemia also may contribute to the development of or exacerbate delayed cerebral ischemia. This review was designed to examine the prevalence and impact of anemia in patients with SAH and to evaluate the effects of transfusion. A literature search was made to identify original research on anemia and transfusion in SAH patients. A total of 27 articles were identified that addressed the effects of red blood cell transfusion (RBCT) on brain physiology, anemia in SAH, and clinical management with RBCT or erythropoietin. Most studies provided retrospectively analyzed data of very low-quality according to the GRADE criteria. While RBCT can have beneficial effects on brain physiology, RBCT may be associated with medical complications, infection, vasospasm, and poor outcome after SAH. The effects may vary with disease severity or the presence of vasospasm, but it remains unclear whether RBCTs are a marker of disease severity or a cause of worse outcome. Erythropoietin data are limited. The literature review further suggests that the results of the Transfusion Requirements in Critical Care Trial and subsequent observational studies on RBCT in general critical care do not apply to SAH patients and that randomized trials to address the role of RBCT in SAH are required