67 research outputs found

    Lessons from building an automated pre-departure sequencer for airports

    Get PDF
    Commercial airports are under increasing pressure to comply with the Eurocontrol collaborative decision making (CDM) initiative, to ensure that information is passed between stakeholders, integrate automated decision support or make predictions. These systems can also aid effective operations beyond the airport by communicating scheduling decisions to other relevant parties, such as Eurocontrol, for passing on to downstream airports and enabling overall airspace improvements. One of the major CDM components is aimed at producing the target take-off times and target startup-approval times, i.e. scheduling when the aircraft should push back from the gates and start their engines and when they will take off. For medium-sized airports, a common choice for this is a “pre-departure sequencer” (PDS). In this paper, we describe the design and requirements challenges which arose during our development of a PDS system for medium sized international airports. Firstly, the scheduling problem is highly dynamic and event driven. Secondly, it is important to end-users that the system be predictable and, as far as possible, transparent in its operation, with decisions that can be explained. Thirdly, users can override decisions, and this information has to be taken into account. Finally, it is important that the system is as fair as possible for all users of the airport, and the interpretation of this is considered here. Together, these factors have influenced the design of the PDS system which has been built to work within an existing large system which is being used at many airport

    Transient Responses to NOTCH and TLX1/HOX11 Inhibition in T-Cell Acute Lymphoblastic Leukemia/Lymphoma

    Get PDF
    To improve the treatment strategies of T-cell acute lymphoblastic leukemia/lymphoma (T-ALL), further efforts are needed to identify therapeutic targets. Dysregulated expression of HOX-type transcription factors occurs in 30–40% of cases of T-ALL. TLX1/HOX11 is the prototypical HOX-type transcription factor. TLX1 may be an attractive therapeutic target because mice that are deficient in TLX1 are healthy. To test this possibility, we developed a conditional doxycycline-regulated mouse model of TLX1-initiated T-ALL. TLX1 induced T-ALL after ∼5–7 months with penetrance of 15–60%. Similar to human TLX1-type T-ALLs, the TLX1-induced tumors were arrested at the cortical stage of T-cell development and acquired activating NOTCH1 mutations. Inhibition of NOTCH signaling abrogated growth of cell lines derived from the TLX1-induced tumors. NOTCH inhibition also transiently delayed leukemia progression in vivo. Suppression of TLX1 expression slowed the growth of TLX1 tumor cell lines. Suppression of TLX1 in vivo also transiently delayed leukemia progression. We have shown that TLX1 functions as a T-cell oncogene that is active during both the induction and the maintenance phases of leukemia. However, the effect of suppressing NOTCH or TLX1 was transient. The tumors eventually “escaped” from inhibition. These data imply that the biological pathways and gene sets impacted by TLX1 and NOTCH have largely lost their importance in the fully established tumor. They have been supplanted by stronger oncogenic pathways. Although TLX1 or NOTCH inhibitors may not be effective as single agents, they may still contribute to combination therapy for TLX1-driven acute leukemia

    Advances in structure elucidation of small molecules using mass spectrometry

    Get PDF
    The structural elucidation of small molecules using mass spectrometry plays an important role in modern life sciences and bioanalytical approaches. This review covers different soft and hard ionization techniques and figures of merit for modern mass spectrometers, such as mass resolving power, mass accuracy, isotopic abundance accuracy, accurate mass multiple-stage MS(n) capability, as well as hybrid mass spectrometric and orthogonal chromatographic approaches. The latter part discusses mass spectral data handling strategies, which includes background and noise subtraction, adduct formation and detection, charge state determination, accurate mass measurements, elemental composition determinations, and complex data-dependent setups with ion maps and ion trees. The importance of mass spectral library search algorithms for tandem mass spectra and multiple-stage MS(n) mass spectra as well as mass spectral tree libraries that combine multiple-stage mass spectra are outlined. The successive chapter discusses mass spectral fragmentation pathways, biotransformation reactions and drug metabolism studies, the mass spectral simulation and generation of in silico mass spectra, expert systems for mass spectral interpretation, and the use of computational chemistry to explain gas-phase phenomena. A single chapter discusses data handling for hyphenated approaches including mass spectral deconvolution for clean mass spectra, cheminformatics approaches and structure retention relationships, and retention index predictions for gas and liquid chromatography. The last section reviews the current state of electronic data sharing of mass spectra and discusses the importance of software development for the advancement of structure elucidation of small molecules

    The Golf Director Problem: Forming Teams for Club Golf Competitions

    No full text

    Models and Algorithms for Real-Time Control of Aircraft Landing

    No full text
    In this paper, models and algorithms for real-time control of the region around the airport are proposed. We consider the dynamic case in which the entry times of aircraft in the region are unknown and the sequence of aircraft must be recomputed whenever a new aircraft approaches the terminal area. A set of constraints which allow the controller to maintain given patterns of the landing sequences previously generated must be taken into account. Heuristic algorithms are proposed and computational results are discussed

    State Space Reduced Dynamic Programming for the Aircraft Sequencing Problem with Constrained Position ShiftingCombinatorial Optimization

    No full text
    In this paper we present state space reduction techniques for a dynamic programming algorithm applied to the Aircraft Sequencing Problem (ASP) with Constrained Position Shifting (CPS). We consider the classical version of the ASP, which calls for determining the order in which a given set of aircraft should be assigned to a runway at an airport, subject to minimum separations in time between consecutive aircraft, in order to minimize the sum of the weighted deviations from the scheduled arrival/departure times of the aircraft. The focus of the paper is on a number of ways of improving the computation times of the dynamic programming algorithm proposed. This is achieved by using heuristic upper bounds and a completion lower bound in order to reduce the state space in the dynamic programming algorithm. We compare our algorithm to an approach based on mixed integer linear programming, which was adapted from the literature for the case of CPS. We show using real-world air traffic instances from the Milan Linate Airport that the dynamic programming algorithm significantly outperforms the MILP. Furthermore, we show that the proposed algorithm is capable of solving very large instances in short computation times, and that it is suitable for use in a real-time setting

    Coordination of Traffic Flows in the TMA

    No full text
    A number of models and algorithms designed to optimize the management of the terminal area have been presented in the literature and/or have been implemented in some airport. Most of them focus their attention mainly on landing operations, while modeling capabilities concentrate on the runway complex, assumed to be a single runway in the simplest case, or, when necessary, examine specific configurations. In this paper, we propose a modeling approach to coordinate inbound and outbound traffic flows on all the prefixed routes, through a discretization of the whole space terminal area. Several operational constraints, like longitudinal and diagonal separations in particular regions of the airspace and different runway configurations (independent, parallel, crossing), can be represented in a uniform framework. In order to assess the model's capabilities, we describe in detail a case study performed for the Rome Fiumicino airport for which we report also algorithmic results with respect to different performance indices

    Coordination of Traffic Flows in the TMA

    No full text
    corecore