Search

With a rapidly growing attention on the development of learning-augmented algorithms, we revisit the classical online traveling salesman problem (OLTSP) from the perspective of such learning approaches. A learning-augmented online algorithm, or simply an online algorithm with predictions, considers how to improve its competitive performance with theoretical guarantees by forecasting the information of future requests, e.g., their release time or locations in the OLTSP. In this study, we investigate the OLTSP on the real line, motivated by the parcel picking problem in a smart warehouse, which aims at scheduling a route for a server (saying, a Kiva robot), starting at the origin, serving all online requests and returning to the origin such that the completion time is minimized. Each online request is released over time on the real line and the server moves back and forth along the line with unit speed. We mainly focus on zealous algorithms, a special type of online algorithms for the OLTSP which never allow the sever to wait if there are still unserved requests, and exploit a specific forecasting strategy, called online predictions, which makes a sequence of predictions one by one in an online manner. In order to ensure better competitive performance, we particularly explore the worst-case scenarios that restrict the power of such predictions. Based on the discussion, we make an assumption in which online predictions are guaranteed to be useful, and devise a learning-augmented algorithm with max 6 λ + 1 4 λ , 2 λ + 1 2 λ -robustness and max 3 2 + η t + η p O P T , 6 + λ 4 + (1 − λ) η p O P T -consistency, 0 < λ ≤ 1 , comparing to the previous lower bound of 7 4 , where η t and η p which indicate prediction errors are sufficiently small constants. Moreover, we also conduct numerical experiments to demonstrate the practical effectiveness of the proposed algorithm. [ABSTRACT FROM AUTHOR]

The online car-sharing problem finds many real-world applications. The problem, proposed by Luo, Erlebach and Xu in 2018, mainly focuses on an online model in which there are two locations: 0 and 1, and k total cars. Each request which specifies its pick-up time and pick-up location (among 0 and 1, and the other is the drop-off location) is released in each stage a fixed amount of time before its specified start (i.e. pick-up) time. The time between the booking (i.e. released) time and the start time is enough to move empty cars between 0 and 1 for relocation if they are not used in that stage. The model, called k S2L-F, assumes that requests in each stage arrive sequentially regardless of the same booking time and the decision (accept or reject) must be made immediately. The goal is to accept as many requests as possible. In spite of only two locations, the analysis does not seem easy and the (tight) competitive ratio (CR) is only known to be 2 for k = 2 and 1.5 for a restricted value of k , i.e., a multiple of three. In this paper, we remove all the holes of unknown CR's; namely we prove that the CR is 2 k k + ⌊ k / 3 ⌋ for all k ≥ 2. Furthermore, if the algorithm can delay its decision until all requests have come in each stage, the CR is improved to roughly 4/3. We can take this advantage even further; precisely we can achieve a CR of 2 + R 3 if the number of requests in each stage is at most Rk , 1 ≤ R ≤ 2 , where we do not have to know the value of R in advance. Finally we demonstrate that randomization also helps to get (slightly) better CR's, and prove some lower bounds to show the tightness. [ABSTRACT FROM AUTHOR]

Poly (ADP-ribose) polymerase-1 (PARP-1) and telomerase, as well as DNA damage response pathways are targets for anticancer drug development, and specific inhibitors are currently under clinical investigation. The purpose of this work is to evaluate anticancer activities of anthraquinone-derived tricyclic and tetracyclic small molecules and their structure-activity relationships with PARP-1 inhibition in non-small cell lung cancer (NSCLC) and NSCLC-overexpressing Oct4 and Nanog clone, which show high-expression of PARP-1 and more resistance to anticancer drug. We applied our library selected compounds to NCI's 60 human cancer cell-lines (NCI-60) in order to generate systematic profiling data. Based on our analysis, it is hypothesized that these drugs might be, directly and indirectly, target components to induce mitochondrial permeability transition and the release of pro-apoptotic factors as potential anti-NSCLC or PARP inhibitor candidates. Altogether, the most active NSC747854 showed its cytotoxicity and dose-dependent PARP inhibitory manner, thus it emerges as a promising structure for anti-cancer therapy with no significant negative influence on normal cells. Our studies present evidence that telomere maintenance should be taken into consideration in efforts not only to overcome drug resistance, but also to optimize the use of telomere-based therapeutics. These findings will be of great value to facilitate structure-based design of selective PARP inhibitors, in general, and telomerase inhibitors, in particular. Together, the data presented here expand our insight into the PARP inhibitors and support the resource-demanding lead optimization of structurally related small molecules for human cancer therapy. [ABSTRACT FROM AUTHOR]