Search results for "Horizon"
showing 10 items of 600 documents
Inferring Horizontal Gene Transfer with DarkHorse, Phylomizer, and ETE Toolkits
2020
In this chapter, we describe how to use DarkHorse2.0 to search for xenologs in the genome of the cyanobacterium Synechococcus elongatus PCC 7942. DarkHorse is an implicit phylogenetic method that uses BLAST searches to identify proteins having close homologs of unexpected taxonomic affiliation. Once a set of putative xenologs are identified, Phylomizer is used to reconstruct phylogenetic trees. Phylomizer reproduces all the necessary steps to perform a basic phylogenetic analysis. The combined use of DarkHorse and Phylomizer allows the identification of genes incorporated into a given genome by HGT.
Stock Volatility Predictability in Bull and Bear Markets
2020
Recent literature on stock return predictability suggests that it varies substantially across economic states being strongest during bad economic times. In line with this evidence, we document that stock volatility predictability is also state dependent. In particular, using a large data set of high-frequency data on individual stocks and a few popular time-series volatility models, in this paper we comprehensively examine how volatility forecastability varies across bull and bear states of the stock market. We find that the volatility forecast horizon is substantially longer when the market is in a bear state than when it is in a bull state. In addition, the volatility forecast accuracy is…
Impact of decision horizon on post-prognostics maintenance and missions scheduling: a railways case study
2021
International audience; In this paper, we propose a study of the decision horizon duration for rolling stock mission assignment and maintenance planning in a prognostics and health management (PHM) context. The aim is to determine the best decision horizon duration that allows the con- struction of a suitable schedule that assigns railway vehicles to missions and integrates required maintenance operations accord- ing to the current and future health of the vehicles. A genetic algorithm is used to minimize the overall cost of the joint schedule as a function of the decision horizon. The results are compared to three proposed heuristics to study the influence of the resolution method on the d…
Contributions to Branch-and-Price-and-Cut Algorithms for Routing Problems
2019
This article deals with new exact branch-and-price-and-cut algorithms for the solution of routing problems. Specialized methods for the pickup-and-delivery problem (PDP), the truck-and-trailer routing problem (TTRP), the periodic vehicle routing problem (PVRP) and a service network design and hub location problem (SNDHLP) are presented. We develop a new technique for the acceleration of bidirectional labeling algorithms by a dynamic choice of the merge point. Moreover, for variants of the PDP, the bidirectional labeling can be effectively applied for the first time. In the TTRP, we model the extension to a 2 days planning horizon and the consideration of a quantity-dependent transfer time. …
Determining the best shipper sizes for sending products to customers
2014
A distribution company has to send products, packed into shippers, from the warehouse to retail shops. The number of different shipper types is regarded as a parameter given by the user, who is looking for a balance between transportation costs and stock and procurement costs. The problem is to decide the sizes of the shipper types to keep at the warehouse so as to minimize the cost of meeting the forecasted demand over the planning horizon. In this paper, we describe an integer linear programming formulation for the problem and obtaining feasible solutions. Other models, based on multiknapsack and p-median and facility location models, are for obtaining lower bounds. We study several ways …
Using Genetic Algorithms for Optimizing the PPC in the Highway Horizontal Alignment Design.
2016
Various studies have emphasized the interesting advantages related to the use of new transition curves for improving the geometric design of highway horizontal alignments. In a previous paper, one of the writers proposed a polynomial curve, called a polynomial parametric curve (PPC), proving its efficiency in solving several design problems characterized by a very complex geometry (egg-shaped transition, transition between reversing circular curves, semidirect and inner-loop connections, and so on). The PPC also showed considerable advantages from a dynamic perspective, as evidenced by the analysis of the main dynamic variables related to motion (as well as rate of change of radial accelera…
Branch-and-Price-and-Cut for the Periodic Vehicle Routing Problem with Flexible Schedule Structures
2019
This paper addresses the periodic vehicle routing problem with time windows (PVRPTW). Therein, customers require one or several visits during a planning horizon of several periods. The possible visiting patterns (schedules) per customer are limited. In the classical PVRPTW, it is common to assume that each customer requires a specific visit frequency and offers all corresponding schedules with regular intervals between the visits. In this paper, we permit all kinds of schedule structures and the choice of the service frequency. We present an exact branch-and-price-and-cut algorithm for the classical PVRPTW and its variant with flexible schedules. The pricing problems are elementary shortes…
The periodic rural postman problem with irregular services on mixed graphs
2019
Abstract In this paper, we deal with an extension of the rural postman problem in which some links of a mixed graph must be traversed a given number of times over a time horizon. These links represent entities that must be serviced a specified number of times in some subsets of days (or periods) of the time horizon. The aim is to design a set of minimum-cost tours, one for each day/period of the time horizon, that satisfy the service requirements. We refer to this problem as the periodic rural postman problem with irregular services (PRPP–IS). Some practical applications of the problem can be found in road maintenance operations and road network surveillance, for example. In order to solve …
De novo biosynthesis of simple aromatic compounds by an arthropod ( Archegozetes longisetosus )
2020
The ability to synthesize simple aromatic compounds is well known from bacteria, fungi and plants, which all share an exclusive biosynthetic route—the shikimic acid pathway. Some of these organisms further evolved the polyketide pathway to form core benzenoids via a head-to-tail condensation of polyketide precursors. Arthropods supposedly lack the ability to synthesize aromatics and instead rely on aromatic amino acids acquired from food, or from symbiotic microorganisms. The few studies purportedly showing de novo biosynthesis via the polyketide synthase (PKS) pathway failed to exclude endosymbiotic bacteria, so their results are inconclusive. We investigated the biosynthesis of aromatic …
Verification of Radiative Transfer Schemes for the EHT
2020
Authors: Gold, Roman; Broderick, Avery E.; Younsi, Ziri; Fromm, Christian M.; Gammie, Charles F.; Mościbrodzka, Monika; Pu, Hung-Yi; Bronzwaer, Thomas; Davelaar, Jordy; Dexter, Jason; Ball, David; Chan, Chi-kwan; Kawashima, Tomohisa; Mizuno, Yosuke; Ripperda, Bart; Akiyama, Kazunori; Alberdi, Antxon; Alef, Walter; Asada, Keiichi; Azulay, Rebecca Baczko, Anne-Kathrin; Baloković, Mislav; Barrett, John; Bintley, Dan; Blackburn, Lindy; Boland, Wilfred; Bouman, Katherine L.; Bower, Geoffrey C.; Bremer, Michael; Brinkerink, Christiaan D.; Brissenden, Roger; Britzen, Silke; Broguiere, Dominique; Byun, Do-Young; Carlstrom, John E.; Chael, Andrew; Chatterjee, Koushik; Chatterjee, Shami; Chen, Ming-T…