An Automated Algorithm to Distinguish and Characterize Solar Flares and Associated Sequential Chromospheric Brightenings

We present a new automated algorithm to identify, track, and characterize small-scale brightening associated with solar eruptive phenomena observed in H{\alpha}. The temporal spatially-localized changes in chromospheric intensities can be separated into two categories: flare ribbons and sequential chromospheric brightenings (SCBs). Within each category of brightening we determine the smallest resolvable locus of pixels, a kernel, and track the temporal evolution of the position and intensity of each kernel. This tracking is accomplished by isolating the eruptive features, identifying kernels, and linking detections between frames into trajectories of kernels. We fully characterize the evolving intensity and morphology of the flare ribbons by observing the tracked flare kernels in aggregate. With the location of SCB and flare kernels identified, they can easily be overlaid on top of complementary data sets to extract Doppler velocities and magnetic field intensities underlying the kernels. This algorithm is adaptable to any dataset to identify and track solar features.Comment: 22 pages, 9 figure

Optimization of concrete I-beams using a new hybrid glowworm swarm algorithm

In this paper a new hybrid glowworm swarm algorithm (SAGSO) for solving structural optimization problems is presented. The structure proposed to be optimized here is a simply-supported concrete I-beam defined by 20 variables. Eight different concrete mixtures are studied, varying the compressive strength grade and compacting system. The solutions are evaluated following the Spanish Code for structural concrete. The algorithm is applied to two objective functions, namely the embedded CO2 emissions and the economic cost of the structure. The ability of glowworm swarm optimization (GSO) to search in the entire solution space is combined with the local search by Simulated Annealing (SA) to obtain better results than using the GSO and SA independently. Finally, the hybrid algorithm can solve structural optimization problems applied to discrete variables. The study showed that large sections with a highly exposed surface area and the use of conventional vibrated concrete (CVC) with the lower strength grade minimize the CO2 emissionsGarcía Segura, T.; Yepes Piqueras, V.; Martí Albiñana, JV.; Alcalá González, J. (2014). Optimization of concrete I-beams using a new hybrid glowworm swarm algorithm. Latin American Journal of Solids and Structures. 11(7):1190-1205. doi:10.1590/S1679-78252014000700007S11901205117Alinia Ahandani, M., Vakil Baghmisheh, M. T., Badamchi Zadeh, M. A., & Ghaemi, S. (2012). Hybrid particle swarm optimization transplanted into a hyper-heuristic structure for solving examination timetabling problem. Swarm and Evolutionary Computation, 7, 21-34. doi:10.1016/j.swevo.2012.06.004Chen, S.-M., Sarosh, A., & Dong, Y.-F. (2012). Simulated annealing based artificial bee colony algorithm for global numerical optimization. Applied Mathematics and Computation, 219(8), 3575-3589. doi:10.1016/j.amc.2012.09.052Collins, F. (2010). Inclusion of carbonation during the life cycle of built and recycled concrete: influence on their carbon footprint. The International Journal of Life Cycle Assessment, 15(6), 549-556. doi:10.1007/s11367-010-0191-4Dutta, R., Ganguli, R., & Mani, V. (2011). Swarm intelligence algorithms for integrated optimization of piezoelectric actuator and sensor placement and feedback gains. Smart Materials and Structures, 20(10), 105018. doi:10.1088/0964-1726/20/10/105018Fan, S.-K. S., & Zahara, E. (2007). A hybrid simplex search and particle swarm optimization for unconstrained optimization. European Journal of Operational Research, 181(2), 527-548. doi:10.1016/j.ejor.2006.06.034García-Segura, T., Yepes, V., & Alcalá, J. (2013). Life cycle greenhouse gas emissions of blended cement concrete including carbonation and durability. The International Journal of Life Cycle Assessment, 19(1), 3-12. doi:10.1007/s11367-013-0614-0Gong, Q. Q., Zhou, Y. Q., & Yang, Y. (2010). Artificial Glowworm Swarm Optimization Algorithm for Solving 0-1 Knapsack Problem. Advanced Materials Research, 143-144, 166-171. doi:10.4028/www.scientific.net/amr.143-144.166Hare, W., Nutini, J., & Tesfamariam, S. (2013). A survey of non-gradient optimization methods in structural engineering. Advances in Engineering Software, 59, 19-28. doi:10.1016/j.advengsoft.2013.03.001He, S., Prempain, E., & Wu, Q. H. (2004). An improved particle swarm optimizer for mechanical design optimization problems. Engineering Optimization, 36(5), 585-605. doi:10.1080/03052150410001704854Karaboga, D., & Basturk, B. (2008). On the performance of artificial bee colony (ABC) algorithm. Applied Soft Computing, 8(1), 687-697. doi:10.1016/j.asoc.2007.05.007Khan, K., & Sahai, A. (2012). A Glowworm Optimization Method for the Design of Web Services. International Journal of Intelligent Systems and Applications, 4(10), 89-102. doi:10.5815/ijisa.2012.10.10Kicinger, R., Arciszewski, T., & Jong, K. D. (2005). Evolutionary computation and structural design: A survey of the state-of-the-art. Computers & Structures, 83(23-24), 1943-1978. doi:10.1016/j.compstruc.2005.03.002Kirkpatrick, S., Gelatt, C. D., & Vecchi, M. P. (1983). Optimization by Simulated Annealing. Science, 220(4598), 671-680. doi:10.1126/science.220.4598.671Koide, R. M., França, G. von Z. de, & Luersen, M. A. (2013). An ant colony algorithm applied to lay-up optimization of laminated composite plates. Latin American Journal of Solids and Structures, 10(3), 491-504. doi:10.1590/s1679-78252013000300003Krishnanand, K. N., & Ghose, D. (2009). Glowworm swarm optimisation: a new method for optimising multi-modal functions. International Journal of Computational Intelligence Studies, 1(1), 93. doi:10.1504/ijcistudies.2009.025340Li, L. J., Huang, Z. B., & Liu, F. (2009). A heuristic particle swarm optimization method for truss structures with discrete variables. Computers & Structures, 87(7-8), 435-443. doi:10.1016/j.compstruc.2009.01.004Liao, W.-H., Kao, Y., & Li, Y.-S. (2011). A sensor deployment approach using glowworm swarm optimization algorithm in wireless sensor networks. Expert Systems with Applications, 38(10), 12180-12188. doi:10.1016/j.eswa.2011.03.053Luo, Q. F., & Zhang, J. L. (2011). Hybrid Artificial Glowworm Swarm Optimization Algorithm for Solving Constrained Engineering Problem. Advanced Materials Research, 204-210, 823-827. doi:10.4028/www.scientific.net/amr.204-210.823Martí, J. V., Gonzalez-Vidosa, F., Yepes, V., & Alcalá, J. (2013). Design of prestressed concrete precast road bridges with hybrid simulated annealing. Engineering Structures, 48, 342-352. doi:10.1016/j.engstruct.2012.09.014Martinez-Martin, F. J., Gonzalez-Vidosa, F., Hospitaler, A., & Yepes, V. (2013). A parametric study of optimum tall piers for railway bridge viaducts. Structural Engineering and Mechanics, 45(6), 723-740. doi:10.12989/sem.2013.45.6.723Medina, J. R. (2001). Estimation of Incident and Reflected Waves Using Simulated Annealing. Journal of Waterway, Port, Coastal, and Ocean Engineering, 127(4), 213-221. doi:10.1061/(asce)0733-950x(2001)127:4(213)Parsopoulos, K. E., & Vrahatis, M. N. (2002). Natural Computing, 1(2/3), 235-306. doi:10.1023/a:1016568309421Paya-Zaforteza, I., Yepes, V., González-Vidosa, F., & Hospitaler, A. (2010). On the Weibull cost estimation of building frames designed by simulated annealing. Meccanica, 45(5), 693-704. doi:10.1007/s11012-010-9285-0Sarma, K. C., & Adeli, H. (1998). Cost Optimization of Concrete Structures. Journal of Structural Engineering, 124(5), 570-578. doi:10.1061/(asce)0733-9445(1998)124:5(570)Shieh, H.-L., Kuo, C.-C., & Chiang, C.-M. (2011). Modified particle swarm optimization algorithm with simulated annealing behavior and its numerical verification. Applied Mathematics and Computation, 218(8), 4365-4383. doi:10.1016/j.amc.2011.10.012Sideris, K. K., & Anagnostopoulos, N. S. (2013). Durability of normal strength self-compacting concretes and their impact on service life of reinforced concrete structures. Construction and Building Materials, 41, 491-497. doi:10.1016/j.conbuildmat.2012.12.042Valdez, F., Melin, P., & Castillo, O. (2011). An improved evolutionary method with fuzzy logic for combining Particle Swarm Optimization and Genetic Algorithms. Applied Soft Computing, 11(2), 2625-2632. doi:10.1016/j.asoc.2010.10.010Wang, H., Sun, H., Li, C., Rahnamayan, S., & Pan, J. (2013). Diversity enhanced particle swarm optimization with neighborhood search. Information Sciences, 223, 119-135. doi:10.1016/j.ins.2012.10.012Yepes, V., Gonzalez-Vidosa, F., Alcala, J., & Villalba, P. (2012). CO2-Optimization Design of Reinforced Concrete Retaining Walls Based on a VNS-Threshold Acceptance Strategy. Journal of Computing in Civil Engineering, 26(3), 378-386. doi:10.1061/(asce)cp.1943-5487.000014

New insights into the genetic etiology of Alzheimer's disease and related dementias

Characterization of the genetic landscape of Alzheimer's disease (AD) and related dementias (ADD) provides a unique opportunity for a better understanding of the associated pathophysiological processes. We performed a two-stage genome-wide association study totaling 111,326 clinically diagnosed/'proxy' AD cases and 677,663 controls. We found 75 risk loci, of which 42 were new at the time of analysis. Pathway enrichment analyses confirmed the involvement of amyloid/tau pathways and highlighted microglia implication. Gene prioritization in the new loci identified 31 genes that were suggestive of new genetically associated processes, including the tumor necrosis factor alpha pathway through the linear ubiquitin chain assembly complex. We also built a new genetic risk score associated with the risk of future AD/dementia or progression from mild cognitive impairment to AD/dementia. The improvement in prediction led to a 1.6- to 1.9-fold increase in AD risk from the lowest to the highest decile, in addition to effects of age and the APOE ε4 allele

Measurement of the azimuthal anisotropy of Y(1S) and Y(2S) mesons in PbPb collisions at √S^{S}NN = 5.02 TeV

The second-order Fourier coefficients (υ$_{2}$) characterizing the azimuthal distributions of Υ(1S) and Υ(2S) mesons produced in PbPb collisions at $\sqrt{s_{NN}}$ = 5.02 TeV are studied. The Υmesons are reconstructed in their dimuon decay channel, as measured by the CMS detector. The collected data set corresponds to an integrated luminosity of 1.7 nb$^{-1}$. The scalar product method is used to extract the υ$_{2}$ coefficients of the azimuthal distributions. Results are reported for the rapidity range |y| < 2.4, in the transverse momentum interval 0 < p$_{T}$ < 50 GeV/c, and in three centrality ranges of 10–30%, 30–50% and 50–90%. In contrast to the J/ψ mesons, the measured υ$_{2}$ values for the Υ mesons are found to be consistent with zero

Measurement of prompt D0^{0} and D‾\overline{D}0^{0} meson azimuthal anisotropy and search for strong electric fields in PbPb collisions at root SNN\sqrt{S_{NN}} = 5.02 TeV

The strong Coulomb field created in ultrarelativistic heavy ion collisions is expected to produce a rapiditydependent difference (Av2) in the second Fourier coefficient of the azimuthal distribution (elliptic flow, v2) between D0 (uc) and D0 (uc) mesons. Motivated by the search for evidence of this field, the CMS detector at the LHC is used to perform the first measurement of Av2. The rapidity-averaged value is found to be (Av2) = 0.001 ? 0.001 (stat)? 0.003 (syst) in PbPb collisions at ?sNN = 5.02 TeV. In addition, the influence of the collision geometry is explored by measuring the D0 and D0mesons v2 and triangular flow coefficient (v3) as functions of rapidity, transverse momentum (pT), and event centrality (a measure of the overlap of the two Pb nuclei). A clear centrality dependence of prompt D0 meson v2 values is observed, while the v3 is largely independent of centrality. These trends are consistent with expectations of flow driven by the initial-state geometry. ? 2021 The Author. Published by Elsevier B.V. This is an open access article under the CC BY licens

Performance of reconstruction and identification of τ leptons decaying to hadrons and vτ in pp collisions at √s=13 TeV

The algorithm developed by the CMS Collaboration to reconstruct and identify τ leptons produced in proton-proton collisions at √s=7 and 8 TeV, via their decays to hadrons and a neutrino, has been significantly improved. The changes include a revised reconstruction of π⁰ candidates, and improvements in multivariate discriminants to separate τ leptons from jets and electrons. The algorithm is extended to reconstruct τ leptons in highly Lorentz-boosted pair production, and in the high-level trigger. The performance of the algorithm is studied using proton-proton collisions recorded during 2016 at √s=13 TeV, corresponding to an integrated luminosity of 35.9 fb¯¹. The performance is evaluated in terms of the efficiency for a genuine τ lepton to pass the identification criteria and of the probabilities for jets, electrons, and muons to be misidentified as τ leptons. The results are found to be very close to those expected from Monte Carlo simulation

Performance of the CMS Level-1 trigger in proton-proton collisions at √s = 13 TeV

At the start of Run 2 in 2015, the LHC delivered proton-proton collisions at a center-of-mass energy of 13\TeV. During Run 2 (years 2015–2018) the LHC eventually reached a luminosity of 2.1× 10$^{34}$ cm$^{-2}$s$^{-1}$, almost three times that reached during Run 1 (2009–2013) and a factor of two larger than the LHC design value, leading to events with up to a mean of about 50 simultaneous inelastic proton-proton collisions per bunch crossing (pileup). The CMS Level-1 trigger was upgraded prior to 2016 to improve the selection of physics events in the challenging conditions posed by the second run of the LHC. This paper describes the performance of the CMS Level-1 trigger upgrade during the data taking period of 2016–2018. The upgraded trigger implements pattern recognition and boosted decision tree regression techniques for muon reconstruction, includes pileup subtraction for jets and energy sums, and incorporates pileup-dependent isolation requirements for electrons and tau leptons. In addition, the new trigger calculates high-level quantities such as the invariant mass of pairs of reconstructed particles. The upgrade reduces the trigger rate from background processes and improves the trigger efficiency for a wide variety of physics signals

Measurement of the Y(1S) pair production cross section and search for resonances decaying to Y(1S)μ⁺μ⁻ in proton-proton collisions at √s = 13 TeV

The fiducial cross section for Y(1S)pair production in proton-proton collisions at a center-of-mass energy of 13TeVin the region where both Y(1S)mesons have an absolute rapidity below 2.0 is measured to be 79 ± 11 (stat) ±6 (syst) ±3 (B)pbassuming the mesons are produced unpolarized. The last uncertainty corresponds to the uncertainty in the Y(1S)meson dimuon branching fraction. The measurement is performed in the final state with four muons using proton-proton collision data collected in 2016 by the CMS experiment at the LHC, corresponding to an integrated luminosity of 35.9fb$^{-1}$. This process serves as a standard model reference in a search for narrow resonances decaying to Y(1S)μ$^{+}$μ$^{-}$ in the same final state. Such a resonance could indicate the existence of a tetraquark that is a bound state of two bquarks and two b̅ antiquarks. The tetraquark search is performed for masses in the vicinity of four times the bottom quark mass, between 17.5 and 19.5GeV, while a generic search for other resonances is performed for masses between 16.5 and 27GeV. No significant excess of events compatible with a narrow resonance is observed in the data. Limits on the production cross section times branching fraction to four muons via an intermediate Y(1S)resonance are set as a function of the resonance mass