Search

LC3 lipidation plays an important role in the regulation of macroautophagy and LC3-associated microautophagy. The E1-like enzyme ATG7 is one of the core components that are directly involved in LC3 lipidation reaction. Here, we provide evidence showing that acetylation of ATG7 tightly controls its enzyme activity to regulate the induction of macroautophagy and LC3-associated microautophagy. Mechanistically, acetylation of ATG7 disrupts its interaction with the E2-like enzyme ATG3, leading to an inhibition of LC3 lipidation in vitro and in vivo. Functionally, in response to various different stimuli, cellular ATG7 undergoes deacetylation to induce macroautophagy and LC3-associated microautophagy, which are necessary for cells to eliminate cytoplasmic DNA and degrade lysosome membrane proteins, respectively. Taken together, these findings reveal that ATG7 acetylation acts as a critical rheostat in controlling LC3 lipidation and related cellular processes. Abbreviations: AMPK: AMP-activated protein kinase; ATG: autophagy-related; cGAMP: cyclic GMP-AMP; CGAS: cyclic GMP-AMP synthase; CREBBP/CBP: CREB binding protein; EGF: epidermal growth factor; EGFR: epidermal growth factor receptor; EP300/p300: E1A binding protein p300; IFNB1: interferon beta 1; ISD: interferon stimulatory DNA; MAP1LC3/LC3: microtubule associated protein 1 light chain 3; MCOLN1/TRPML1: mucolipin TRP cation channel 1; MEF: mouse embryonic fibroblast; MTOR: mechanistic target of rapamycin kinase; NAM: nicotinamide; PE: phosphatidylethanolamine; PTM: post-translational modification; RB1CC1/FIP200: RB1 inducible coiled-coil 1; SIRT: sirtuin; SQSTM1/p62: sequestosome 1; STING1: stimulator of interferon response cGAMP interactor 1; TSA: trichostatin A; ULK1: unc-51 like autophagy activating kinase 1; WIPI2: WD repeat domain, phosphoinositide interacting 2; WT: wild-type. [ABSTRACT FROM AUTHOR]

Objective. The accurate automatic segmentation of tumors from computed tomography (CT) volumes facilitates early diagnosis and treatment of patients. A significant challenge in tumor segmentation is the integration of the spatial correlations among multiple parts of a CT volume and the context relationship across multiple channels. Approach. We proposed a mutually enhanced multi-view information model (MEMI) to propagate and fuse the spatial correlations and the context relationship and then apply it to lung tumor CT segmentation. First, a feature map was obtained from segmentation backbone encoder, which contained many image region nodes. An attention mechanism from the region node perspective was presented to determine the impact of all the other nodes on a specific node and enhance the node attribute embedding. A gated convolution-based strategy was also designed to integrate the enhanced attributes and the original node features. Second, transformer across multiple channels was constructed to integrate the channel context relationship. Finally, since the encoded node attributes from the gated convolution view and those from the channel transformer view were complementary, an interaction attention mechanism was proposed to propagate the mutual information among the multiple views. Main results. The segmentation performance was evaluated on both public lung tumor dataset and private dataset collected from a hospital. The experimental results demonstrated that MEMI was superior to other compared segmentation methods. Ablation studies showed the contributions of node correlation learning, channel context relationship learning, and mutual information interaction across multiple views to the improved segmentation performance. Utilizing MEMI on multiple segmentation backbones also demonstrated MEMI's generalization ability. Significance. Our model improved the lung tumor segmentation performance by learning the correlations among multiple region nodes, integrating the channel context relationship, and mutual information enhancement from multiple views. [ABSTRACT FROM AUTHOR]

In this paper, we address the problem of online car-sharing with variable booking times (CSV for short). In this scenario, customers submit ride requests, each specifying two important time parameters: the booking time and the pick-up time (start time), as well as two location parameters—the pick-up location and the drop-off location within a graph. For each request, it’s important to note that it must be booked before its scheduled start time. The booking time can fall within a specific interval prior to the request’s starting time. Additionally, each car is capable of serving only one request at any given time. The primary objective of the scheduler is to optimize the utilization of k cars to serve as many requests as possible. As requests arrive at their booking times, the scheduler faces an immediate decision: whether to accept or decline the request. This decision must be made promptly upon request submission, precisely at the booking time. We prove that no deterministic online algorithm can achieve a competitive ratio smaller than L + 1 even on a special case of a path (where L denotes the ratio between the largest and the smallest request travel time). For general graphs, we give a Greedy Algorithm that achieves (3 L + 1) -competitive ratio for CSV. We also give a Parted Greedy Algorithm with competitive ratio (5 2 L + 10) when the number of cars k is no less than 5 4 L + 20 ; for CSV on a special case of a path, the competitive ratio of Parted Greedy Algorithm is (2 L + 10) when k ≥ L + 20 . [ABSTRACT FROM AUTHOR]

Liquid droplets hanging from solid surfaces are commonplace, but their physics is complex. Examples include dew or raindrops hanging onto wires or droplets accumulating onto a cover placed over warm food or windshields. In these scenarios, determining the force of detachment is crucial to rationally design technologies. Despite much research, a quantitative theoretical framework for detachment force remains elusive. In response, we interrogated the elemental droplet–surface system via comprehensive laboratory and computational experiments. The results reveal that the Young–Laplace equation can be utilized to accurately predict the droplet detachment force. When challenged against experiments with liquids of varying properties and droplet sizes, detaching from smooth and microtextured surfaces of wetting and non-wetting chemical make-ups, the predictions were in an excellent quantitative agreement. This study advances the current understanding of droplet physics and will contribute to the rational development of technologies. Understanding the physics that govern the dynamics of liquid droplets and their interaction with solid surfaces is crucial for a range of industrial applications, from pesticides to solar cells. Here, the authors develop a framework based on the Young-Laplace equation, to predict the force required to detach a drop from flat and microstructured solid surfaces. [ABSTRACT FROM AUTHOR]

Liquid droplets hanging from solid surfaces are commonplace, but their physics is complex. Examples include dew or raindrops hanging onto wires or droplets accumulating onto a cover placed over warm food or windshields. In these scenarios, determining the force of detachment is crucial to rationally design technologies. Despite much research, a quantitative theoretical framework for detachment force remains elusive. In response, we interrogated the elemental droplet–surface system via comprehensive laboratory and computational experiments. The results reveal that the Young–Laplace equation can be utilized to accurately predict the droplet detachment force. When challenged against experiments with liquids of varying properties and droplet sizes, detaching from smooth and microtextured surfaces of wetting and non-wetting chemical make-ups, the predictions were in an excellent quantitative agreement. This study advances the current understanding of droplet physics and will contribute to the rational development of technologies. Understanding the physics that govern the dynamics of liquid droplets and their interaction with solid surfaces is crucial for a range of industrial applications, from pesticides to solar cells. Here, the authors develop a framework based on the Young-Laplace equation, to predict the force required to detach a drop from flat and microstructured solid surfaces. [ABSTRACT FROM AUTHOR]

This work investigates a new semi-online scheduling problem with lookahead. We focus on job scheduling on two identical parallel machines, where deterministic online algorithms only know the information of k initial jobs (i.e., the initial-lookahead information), while the following jobs still arrive one-by-one in an over-list fashion. We consider makespan minimization as the objective. The study aims at revealing the value of knowing k initial jobs, which are used to improve the competitive performance of those online algorithms without such initial-lookahead information. We provide the following findings: (1) For the scenario where the k initial jobs are all the largest jobs with length Δ , we prove that the classical LIST algorithm is optimal with competitive ratio (k + 3) / (k + 2) ; (2) For the scenario where the total length of these k   (> 1) jobs is at least Δ , we show that any online algorithm has a competitive ratio at least 3/2, implying that the initial-lookahead knowledge is powerless since there exists a 3/2-competitive online algorithm without such information; (3) For the scenario where the total length of these k   (> α) jobs is at least α Δ (α ≥ 2), we propose an online algorithm, named as LPT-LIST, with competitive ratio of (α + 2) / (α + 1) , implying that the initial-lookahead information indeed helps to improve the competitiveness of those online algorithms lacking such information. [ABSTRACT FROM AUTHOR]

In this work, we investigate a berth allocation game involving m identical berths and n vessels. Each vessel selfishly selects a consecutive set of berths for unloading, with the objective of minimizing its own cost represented by the maximum load among the chosen berths. The social cost is defined as the makespan, i.e., the maximum load over all berths. Our game generalizes classical machine scheduling games where jobs (vessels) may require multiple consecutive machines (berths). We analyze the price of anarchy (PoA) of the berth allocation game, which quantifies the impact of selfish behaviors of vessels. Specifically, we first consider a special case where each job can occupy at most two consecutive machines, and derive exact upper and lower bounds for the PoA based on the number of machines m. We show that the PoA asymptotically approaches 9 4 . For the general case where each job can occupy an arbitrary number of consecutive machines, we obtain a tight bound for the PoA, which is Θ log m log log m . [ABSTRACT FROM AUTHOR]

Nowadays cross-docking operations play a significant role in the cold-chain logistics. This paper addresses the cold-chain cross-docking truck scheduling problem where two types of products, i.e. refrigerated and frozen ones, demand separate trucks and storage areas with distinct temperature settings during their storage and transportation. We present a mixed-integer linear programming model with the objective of minimising the total operational costs that consist of inbound truck arrival penalties for violating contracted time windows, product delivery tardiness penalties, inventory costs and outbound truck transportation costs. Due to the strong NP-hardness of the considered problem, we solve it in two phases where the inbound truck arrival schedule and the schedule of outbound truck departure together with product processing are produced, respectively. Four heuristic algorithms are proposed to generate complete solutions of the considered two-stage problem, which are the combinations of two solution frameworks for the first stage and two methods for the second stage. Computational experiments are carried out to verify the effectiveness and efficiency of the proposed heuristic algorithms in terms of the solution quality and running time, respectively. [ABSTRACT FROM AUTHOR]

Increased blood demand and limited blood supply make blood shortages a significant problem in the blood supply chain, which may cause immeasurable losses. The objective of this paper is to develop the scheduling scheme of blood products during blood shortages, considering limited blood supply. For this purpose, a bi-objective mixed-integer programming model is proposed, in which one objective minimises the maximum blood shortage of hospitals as well as the other one minimises the latest arrival time. To solve this model, a $ \varepsilon $-constraint-based hybrid algorithm called $ \varepsilon $-GA-VNS is presented, which benefits from exploration of the genetic algorithm (GA) and exploitation of the variable neighbourhood search (VNS) approaches. Then, a series of numerical experiments based on Solomon's benchmark were performed to evaluate the proposed model and algorithm. A performance comparison of $ \varepsilon $-GA-VNS and NSGA-II indicated that $ \varepsilon $-GA-VNS was superior to NSGA-II in both efficiency and effectiveness. Finally, sensitivity analyses of the uncertain and stochastic blood supply and demand impart several managerial insights. [ABSTRACT FROM AUTHOR]

Inspired by the applications in on-demand manufacturing, we introduce the online k-color spanning disk problem, the first online model for color spanning problems to the best of our knowledge. Given a set P of n colored points in a plane, with each color chosen from a set C of m ≤ n colors, the online k-color spanning disk problem determines the location of the center that minimizes the accumulated radius of the minimum spanning disks for a sequence of color sets, denoted by δ = ⟨ C 1 , C 2 , … , C T ⟩ , C t ⊆ C , | C t | ≥ k , t ∈ { 1 , 2 , … , T } , as they are presented online. Here, a minimum spanning disk for a color set means a disk contains at least one point of each color. We construct a special instance to establish a lower bound on the performance of any online algorithms. Then, an O (n m log n) -time Voronoi-diagram-based algorithm is designed such that its competitive ratio matches the problem’s lower bound. This implies our algorithm is theoretically the best possible in terms of the competitive ratio. We also introduce and study a variant, named the online balanced k-color spanning disk problem, for which a non-trivial lower bound and a best possible algorithm are presented. [ABSTRACT FROM AUTHOR]

Upwelling is a widespread phenomenon in the ocean and plays key roles in the marine environment, marine fishery and air–sea carbon exchange. In coastal regions, the upwelling is usually modulated by tides and complex topography, but the dynamical mechanism is still unclear and yet to be quantified. In this study, a three-dimensional (3D) regional ocean model is used to investigate tide-induced upwelling and its mechanisms quantitatively in the mouth of a semi-closed bay, the Bohai Strait, which is a tide-dominated coastal region. The results show that the upwelling mainly occurs near the tidal front in the north of the Laotieshan Channel and the southern region of the front, with the most active upwelling existing off promontories and small islands. Numerical sensitivity experiments indicate that the upwelling in the study area is mainly caused by tides, accounting for approximately 86% of the total. The 3D balance of the vertical component of the vorticity based on the model results quantifies the dynamic processes of the upwelling and reveals that tides induce the upwelling through tidal mixing and nonlinear effects. In the tidal front zone, the upwelling is mainly caused by baroclinic processes related to tidal mixing. Off promontories and small islands, we first reveal that the upwelling is driven by both the tidal mixing and nonlinear effect related to centrifugal force rather than just one of the two mechanisms, and the latter plays a dominant role in producing the upwelling. The strong nonlinear effect is attributed to the periodic movement of barotropic tidal currents rather than the mean flow. [ABSTRACT FROM AUTHOR]

Under support of industry 4.0, researchers have shown an increased interest in MapReduce scheduling problems to process big data. However, very few studies investigate MapReduce scheduling problems under parallel batch machine environment, which is also common in practice. Motivated by this, we study a parallel batch machine scheduling problem in which all the jobs are belonging to MapReduce type. The objective of the considered problem is of minimizing the total weighted tardiness. For solving this problem, we first establish a mixed integer linear programming model, and then a rule-based genetic algorithm is developed to solve it. Numerical experiments are also conducted to demonstrate the effectiveness of the proposed method. [ABSTRACT FROM AUTHOR]

In many manufacturing and service systems, it is of great importance to generate processing schedules with strong response abilities to unexpected or urgent jobs. In this paper, we investigate the problem of scheduling jobs on two parallel identical machines. The objective is to minimise the maximum difference between any two consecutive completion times of jobs, i.e. to minimise the maximum inter-completion time. The processing of any job cannot be interrupted, and a smaller objective value of the processing schedule implies a faster response to an unexpected job that may arrive at any time point. The problem was introduced by Zheng, Pinedo, Lee, Liu, and Xu [2019. "Towards Robustness of Response Times: Minimising the Maximum Inter-completion Time on Parallel Machines." International Journal of Production Research 57 (1): 182–199]. In this work, we first give a sufficient condition of feasible solutions with respect to the makespan constraint, and reveal several basic properties of any optimal solution. We then prove a theoretical lower bound of the objective value, and propose a O (n 2) time algorithm to compute the lower bound. An efficient heuristic algorithm is further constructed to solve the considered problem. Experimental results show that the proposed algorithm outperforms all the three heuristics introduced in Zheng, Pinedo, Lee, Liu, and Xu 2019. [ABSTRACT FROM AUTHOR]

This work investigates an unrelated parallel machine scheduling problem in the shared manufacturing environment. Based on practical production complexity, five job and machine-related factors, including job splitting, setup time, learning effect, processing cost and machine eligibility constraint, are integrated into the considered problem. Parallel machines with uniform speed but non-identical processing capabilities are shared on a sharing service platform, and jobs with different types can only be processed by the machines with matching eligibilities. The platform pays an amount of processing cost for using any machine to process the jobs. To balance the processing cost paid and the satisfaction of customers, we aim to minimize the weighted sum of total processing cost and total completion time of jobs in the considered problem. We establish a mixed integer linear programming model, and provide a lower bound by relaxing the machine eligibility constraint. The CPLEX solver is employed to generate optimal solutions for small-scale instances. For large-scale instances, we propose an efficient heuristic algorithm. Experimental results demonstrate that for various instance settings, the proposed algorithm can always produce near optimal solutions. We further present several managerial insights for the shared manufacturing platform. [ABSTRACT FROM AUTHOR]

Post-translational modifications, such as phosphorylation, ubiquitination and acetylation, play crucial roles in the regulation of autophagy. Acetylation has emerged as an important regulatory mechanism for autophagy. Acetylation regulates autophagy initiation and autophagosome formation by targeting core components of the ULK1 complex, the BECN1-PIK3C3 complex, and the LC3 lipidation system. Recent studies have shown that acetylation occurs on the key proteins participating in autophagic cargo assembly and autophagosome-lysosome fusion, such as SQSTM1/p62 and STX17. In addition, acetylation controls autophagy at the transcriptional level by targeting histones and the transcription factor TFEB. Here, we review the current knowledge on acetylation of autophagy proteins and their regulations and functions in the autophagy pathway with focus on recent findings. Abbreviations : ACAT1: acetyl-CoA acetyltransferase 1; ACSS2: acyl-CoA synthetase short chain family member 2; AMPK: AMP-activated protein kinase; ATG: autophagy-related; CALCOCO2/NDP52: calcium binding and coiled-coil domain 2; CCAR2/DBC1: cell cycle and apoptosis regulator 2; BECN1: beclin 1; CMA: chaperone-mediated autophagy; CREBBP/CBP: CREB binding protein; EP300/p300: E1A binding protein p300; GAPDH: glyceraldehyde-3-phosphate dehydrogenase; GSK3: glycogen synthase kinase 3; HDAC6: histone deacetylase 6; HSPA8/HSC70: heat shock protein family A (Hsp70) member 8; KAT2A/GCN5: lysine acetyltransferase 2A; KAT2B/PCAF: lysine acetyltransferase 2B; KAT5/TIP60: lysine acetyltransferase 5; KAT8/MOF: lysine acetyltransferase 8; LAMP2A: lysosomal associated membrane protein 2A; MAP1LC3/LC3: microtubule associated protein 1 light chain 3; MTOR: mechanistic target of rapamycin kinase; NBR1: NBR1 autophagy cargo receptor; OPTN: optineurin; PD: Parkinson disease; PE: phosphatidylethanolamine; PIK3C3/VPS34: phosphatidylinositol 3-kinase catalytic subunit type 3; PKM2: pyruvate kinase M1/2; PtdIns3P: phosphatidylinositol-3-phosphate; PTM: post-translational modification; RB1CC1/FIP200: RB1 inducible coiled-coil 1; RUBCN/Rubicon: rubicon autophagy regulator; RUBCNL/Pacer: rubicon like autophagy enhancer; SIRT1: sirtuin 1; SNAP29: synaptosome associated protein 29; SNARE: soluble N-ethylamide-sensitive factor attachment protein receptor; SQSTM1/p62: sequestosome 1; STX17: syntaxin 17; TFEB: transcription factor EB; TP53/p53: tumor protein p53; TP53INP2/DOR: tumor protein p53 inducible nuclear protein 2; UBA: ubiquitin-associated; ULK1: unc-51 like autophagy activating kinase 1; VAMP8: vesicle associated membrane protein 8; WIPI2: WD repeat domain, phosphoinositide interacting 2. [ABSTRACT FROM AUTHOR]

With the rapid development of worldwide container trade, quay cranes and other resources in container terminals are suffering from increasing workloads. To reduce their failure probabilities, quay cranes usually require preventive maintenance. However, these important activities are often ignored during quay crane planning in literature. This work studies an integrated berth allocation, quay crane assignment and specific quay crane assignment problem where quay crane maintenance is involved, and establishes an integer linear programming with the objective of minimising the total turnaround time. Due to the NP-hardness of the problem, CPLEX only solves instances with up to 18 vessels. For solving larger instances, we propose Left-and-Right Vessel Move (LRVM) algorithm and improved Genetic Algorithm (GA). Experimental results reveal that GA slightly outperforms LRVM with respect to solution quality as the solution of LRVM serves as one of the initial chromosomes of GA. LRVM can output feasible solutions within seconds, even for instances with 50 vessels. We further present a sensitivity analysis of preferred berth segments, and make numerical comparison on algorithm performance for the relevant model without quay crane maintenance. Both the models and proposed heuristics in this work help in dealing with the operational management of container terminal resources in practice. [ABSTRACT FROM AUTHOR]

Motivated by scheduling practices that require a response to unplanned high-priority jobs as soon as possible without preempting any in-processing jobs, this paper considers a deterministic identical parallel machine scheduling problem to achieve robustness with regard to a worst-case response time. To the best of our knowledge, this paper is the first to study the objective of minimising the maximum inter-completion time, i.e. the maximum time difference between any two consecutive completion times of jobs. For this novel scheduling problem, we first show its NP-hardness, and then propose an integer linear programming formulation and three heuristic approaches. Numerical experiments demonstrate the efficiency of our solution methods. [ABSTRACT FROM AUTHOR]

Autophagy has emerged as a key regulator of cell metabolism. Recently, we have demonstrated that autophagy is involved in RNA metabolism by regulating ribosomal RNA (rRNA) synthesis. We found that autophagy-deficient cells display much higher 47S precursor rRNA level, which is caused by the accumulation of SQSTM1/p62 (sequestosome 1) but not other autophagy receptors. Mechanistically, SQSTM1 accumulation potentiates the activation of MTOR (mechanistic target of rapamycin kinase) complex 1 (MTORC1) signaling, which facilitates the assembly of RNA polymerase I pre-initiation complex at ribosomal DNA (rDNA) promoter regions and leads to the activation of rDNA transcription. Finally, we showed that SQSTM1 accumulation is responsible for the increase in protein synthesis, cell growth and cell proliferation in autophagy-deficient cells. Taken together, our findings reveal a regulatory role of autophagy and autophagy receptor SQSTM1 in rRNA synthesis and may provide novel mechanisms for the hyperactivated rDNA transcription in autophagy-related human diseases. Abbreviations: 5-FUrd: 5-fluorouridine; LAP: MAP1LC3/LC3-associated phagocytosis; MAP1LC3/LC3: microtubule associated protein 1 light chain 3; MTOR: mechanistic target of rapamycin kinase; PIC: pre-initiation complex; POLR1: RNA polymerase I; POLR1A: RNA polymerase I subunit A; rDNA: ribosomal DNA; RRN3: RRN3 homolog, RNA polymerase I transcription factor; rRNA: ribosomal RNA; SQSTM1/p62: sequestosome 1; TP53INP2: tumor protein p53 inducible nuclear protein 2; UBTF: upstream binding transcription factor. [ABSTRACT FROM AUTHOR]

Simple Summary: To investigate the genetic reprogramming that drives intestinal epithelial cells (IECs) maturation along the crypt-villus axis, entCerocytes were sequentially isolated from the villus tip to the crypts of porcine small intestine. The present study obtained the intestinal upper villus epithelial cells (F1) and crypt epithelial cells (F3) of 21-day suckling piglets using the divalent chelation and precipitation technique. By mRNA high-throughput sequencing analysis of F1 and F3, it was shown that a total of 672 unigenes were differentially expressed between F1 and F3, including 224 highly expressed and 448 minimally expressed unigenes. The greatest number of differentially expressed genes enriched in signal transduction, e.g., Wnt, Hippo, TGF-beta, mTOR, PI3K-Akt, and MAPK signaling pathways, were closely related to the differentiation, proliferation, maturation and apoptosis of IECs. Our results provide important information for identifying new regulators of IECs differentiation and maturation. Moreover, they can also provide insights into the regulatory mechanisms underlying intestinal epithelial cell renewal and the rapid repair of intestinal mucosal oxidative damage. It is well known that the small intestinal epithelial cells of mammals rapidly undergo differentiation, maturation, and apoptosis. However, few studies have defined the physiological state and gene expression changes of enterocytes along the crypt-villus axis in suckling piglets. In the present study, we obtained the intestinal upper villus epithelial cells (F1) and crypt epithelial cells (F3) of 21-day suckling piglets using the divalent chelation and precipitation technique. The activities of alkaline phosphatase, sucrase, and lactase of F1 were significantly higher (p < 0.05) than those of F3. To explore the differences at the gene transcription level, we compared the global transcriptional profiles of F1 and F3 using RNA-seq analysis technology. A total of 672 differentially expressed genes (DEGs) were identified between F1 and F3, including 224 highly expressed and 448 minimally expressed unigenes. Functional analyses indicated that some DEGs were involved in the transcriptional regulation of nutrient transportation (SLC15A1, SLC5A1, and SLC3A1), cell differentiation (LGR5, HOXA5 and KLF4), cell proliferation (PLK2 and TGFB3), transcriptional regulation (JUN, FOS and ATF3), and signaling transduction (WNT10B and BMP1), suggesting that these genes were related to intestinal epithelial cell maturation and cell renewal. Gene Ontology (GO) enrichment analysis showed that the DEGs were mainly associated with binding, catalytic activity, enzyme regulator activity, and molecular transducer activity. Furthermore, KEGG pathway analysis revealed that the DGEs were categorized into 284 significantly enriched pathways. The greatest number of DEGs enriched in signal transduction, some of which (Wnt, Hippo, TGF-beta, mTOR, PI3K-Akt, and MAPK signaling pathways) were closely related to the differentiation, proliferation, maturation and apoptosis of intestinal epithelial cells. We validated the expression levels of eight DEGs in F1 and F3 using qRT-PCR. The present study revealed temporal and regional changes in mRNA expression between F1 and F3 of suckling piglets, which provides insights into the regulatory mechanisms underlying intestinal epithelial cell renewal and the rapid repair of intestinal mucosal damage. [ABSTRACT FROM AUTHOR]

In this paper, we introduce the concept of "workload fence" into online machine rental and machine scheduling problems. With the knowledge of workload fence, online algorithms acquire the information of a finite number of first released jobs in advance. The concept originates from the frozen time fence in the domain of master scheduling in materials management. The total processing time of the jobs foreseen, corresponding to a finite number of jobs, is called workload fence, which is irrelevant to the job sequence. The remaining jobs in the sequence, however, can only become known on their arrival. This work aims to reveal whether the knowledge of workload fence helps to boost the competitive performance of deterministic online algorithms. For the online machine rental problem, we prove that the competitiveness of online algorithms can be improved with a sufficiently large workload fence. We further propose a best online algorithm for the corresponding scenario. For online parallel machine scheduling with workload fence, we give a positive answer to the above question for the case where the workload fence is equal to the length of the longest job. We also show that the competitiveness of online algorithms may not be improved even with a workload fence strictly larger than the largest length of a job. The results help one manager to make a better decision regarding the tradeoff between the performance improvement of online algorithms and the cost caused to acquire the knowledge of workload fence. [ABSTRACT FROM AUTHOR]

This paper addresses the online parallel machine scheduling problem with machine leasing discount. Rental cost discount is a common phenomenon in the sharing manufacturing environment. In this problem, jobs arrive one by one over-list and must be allocated irrevocably upon their arrivals without knowing future jobs. Each job is with one unit of processing time. One manufacturer leases a limited number of identical machines over a manufacturing resource sharing platform, and pays a rental fee of α per time unit for processing jobs. Especially, when the time duration of a leasing machine reaches the discount time point, the manufacturer will get a discount for further processing jobs on the machine, i.e., the unit time rental cost is α β , where β = 1 / 2 is the discount coefficient. The objective function is the sum of makespan and the rental cost of all the sharing machines. When the unit time rental cost α ≥ 2 , we first provide the lower bound of objective value of an optimal schedule in the offline version and prove a lower bound of 1.093 for the problem. Based on the analysis of the offline solution, we present a deterministic online algorithm LS-RD with a tight competitive ratio of 3/2. When 1 ≤ α < 2 , we prove that the competitive ratios of algorithm LIST are 1 and 2 for the case of m = 2 and m → ∞ , respectively. For the general rental discount 0 < β ≤ 1 , we give the relevant results for offline and online solutions. [ABSTRACT FROM AUTHOR]

This work studies the problem of cross-docking truck scheduling introduced by (Int J Prod Econ 194:102–112, Serrano et al. 2017), where internal operations including repacking and storing operations are considered. The objective is to minimize the number of inbound trucks which are assigned beyond their contracted time windows. For the special case where only inbound truck arrivals are considered while the outbound truck departures are not ensured, we present some properties of the model and propose a heuristic algorithm called Light Period and Less Options (LPLO) to solve it. For the general case of the problem, due to its NP-hardness, we design a non-trivial Three-phase Greedy (TG) algorithm and the Genetic algorithm (GA). Experimental results with comparison between exact solutions by the CPLEX solver and solutions by the two heuristic algorithms demonstrate that the both proposed heuristic algorithms are of high efficiency in generating optimal or nearly optimal solutions for the considered problem in this work. [ABSTRACT FROM AUTHOR]

This paper studies the online machine minimization problem, where the jobs have real release times, uniform processing times and a common deadline. We investigate how the lookahead ability improves the performance of online algorithms. Two lookahead models are studied, that is, the additive lookahead and the multiplicative lookahead. At any time t, the online algorithm knows all the jobs to be released before time t + L (or β · t ) in the additive (or multiplicative) lookahead model. We propose a e α (e - 1) + 1 -competitive online algorithm with the additive lookahead, where α = L T ≤ 1 and T is the common deadline of the jobs. For the multiplicative lookahead, we provide an online algorithm with a competitive ratio of β e (β - 1) e + 1 , where β ≥ 1 . Lower bounds are also provided for both of the two models, which show that our algorithms are optimal for two extreme cases, that is, α = 0 (or β = 1 ) and α = 1 (or β → ∞ ), and remain a small gap for the cases in between. Particularly, for α = 0 (or β = 1 ), the competitive ratio is e, which corresponds to the problem without lookahead. For α = 1 (or β → ∞ ), the competitive ratio is 1, which corresponds to the offline version (with full information). [ABSTRACT FROM AUTHOR]

We consider an online car-sharing problem between two locations with advance bookings. Each customer submits a pair of requests, where each request specifies the pick-up time and the pick-up location: one request from A to B, and the other request from B to A, not necessary in this order. The scheduler aims to maximize the number of satisfied customers, where the schedule has to decide whether or not to accept a request pair immediately at the time when the request pair is submitted. This problem is called OnlineTransfersForCommuting. We present lower bounds on the competitive ratio for this problem with both fixed booking times and variable booking times, and propose two algorithms, greedy algorithm and balanced greedy algorithm, that achieve the best possible competitive ratios. [ABSTRACT FROM AUTHOR]

Acquiring a comprehensive and accurate understanding of habitat preference is essential for species conservation and fishery management, especially for mobile species that migrate seasonally. Presence and absence data from field surveys are recommended when available due to their high reliability. Using field survey data, we investigated seasonal habitat suitability requirements for Tanaka's snailfish (Liparis tanakae) in the Bohai Sea and Yellow Sea (BSYS) via a machine-learning method, random forests (RFs). Five environmental and biologically relevant variables (bottom temperature, bottom salinity, current velocity, depth and distance to shore) were used to build the ecological niches between the presence/absence data and suitable habitat. In addition, the degree to which false absence data might impact model performance was evaluated. Our results indicated that RFs provided accurate predictions, with seasonal habitat suitability maps of L. tanakae differing substantially. Bottom temperature and salinity were identified as important factors influencing the distribution of L. tanakae. False absence data were found to have negative effects on model performance and the decrease in evaluation metrics was usually significant (P<0.05) after 30% or more errors were added to the absence data. Through identifying highly suitable areas within its geographic range, our study provides a baseline for L. tanakae that can be further applied in ecosystem modelling and fishery management in the BSYS. [ABSTRACT FROM AUTHOR]

Macroautophagy/autophagy, a highly conserved lysosome-dependent degradation pathway, has been intensively studied in regulating cell metabolism by degradation of intracellular components. In this study, we link autophagy to RNA metabolism by uncovering a regulatory role of autophagy in ribosomal RNA (rRNA) synthesis. Autophagy-deficient cells exhibit much higher 47S precursor rRNA level, which is caused by the accumulation of SQSTM1/p62 (sequestosome 1) but not other autophagy receptors. Mechanistically, SQSTM1 accumulation potentiates the activation of MTOR (mechanistic target of rapamycin kinase) complex 1 (MTORC1) signaling and promotes the assembly of RNA polymerase I pre-initiation complex at ribosomal DNA (rDNA) promoters, which leads to an increase of 47S rRNA transcribed from rDNA. Functionally, autophagy deficiency promotes protein synthesis, cell growth and cell proliferation, both of which are dependent on SQSTM1 accumulation. Taken together, our findings suggest that autophagy deficiency is involved in RNA metabolism by activating rDNA transcription and provide novel mechanisms for the reprogramming of cell metabolism in autophagy-related diseases including multiple types of cancers. Abbreviations: 5-FUrd: 5-fluorouridine; AMPK: AMP-activated protein kinase; ATG: autophagy related; CALCOCO2/NDP52: calcium binding and coiled-coil domain 2; ChIP: chromatin immunoprecipitation; MAP1LC3/LC3: microtubule associated protein 1 light chain 3; MAPK/ERK: mitogen-activated protein kinase; MTOR: mechanistic target of rapamycin kinase; NBR1: NBR1 autophagy cargo receptor; NFKB/NF-κB: nuclear factor kappa B; NFE2L2/NRF2: nuclear factor, erythroid 2 like 2; OPTN: optineurin; PIC: pre-initiation complex; POLR1: RNA polymerase I; POLR1A/RPA194: RNA polymerase I subunit A; POLR2A: RNA polymerase II subunit A; rDNA: ribosomal DNA; RPS6KB1/S6K1: ribosomal protein S6 kinase B1; rRNA: ribosomal RNA; RUBCN/Rubicon: rubicon autophagy regulator; SQSTM1/p62: sequestosome 1; STX17: syntaxin 17; SUnSET: surface sensing of translation; TAX1BP1: Tax1 binding protein 1; UBTF/UBF1: upstream binding transcription factor; WIPI2: WD repeat domain, phosphoinositide interacting 2; WT: wild-type. [ABSTRACT FROM AUTHOR]

Motivated by a variety of applications in sharing economy, we study an identical parallel machine scheduling problem with due date-to-deadline window by jointly considering machine sharing and the time value of money. A factory owns a set of parallel identical machines and processes a set of production orders within a finite time period. In the sharing setting, the factory may also rent external machines to handle a part of orders by paying some extra cost. The factory aims to determine the sharing policy of the production orders and the scheduling rule of machines, to maximize its total future value of profits by satisfying the orders. To the best of our knowledge, there are no previous results for this problem. In this work, a mathematical programming model is derived, and a problem-specific genetic algorithm and a heuristic are proposed to solve large-scale instances. Numerical experiments using randomly generated instances are carried out to evaluate the effectiveness and efficiency of the proposed solution methods. [ABSTRACT FROM AUTHOR]

This paper studies the makespan minimisation scheduling problem in a two-stage hybrid flow shop. The first stage has one machine and the second stage hasmidentical parallel machines. Neither the processing time nor probability distribution of the processing time of each job is uncertain. We propose a robust (min–max regret) scheduling model. To solve the robust scheduling problem, which is NP-hard, we first derive some properties of the worst-case scenario for a given schedule. We then propose both exact and heuristic algorithms to solve this problem. In addition, computational experiments are conducted to evaluate the performance of the proposed algorithms. [ABSTRACT FROM AUTHOR]

In this paper, we study a new group-buying mechanism originated in China where the new mechanism adopts a fixed group price rather than a dynamic pricing mechanism. We employ a sensitive parameter, reflecting the initial customer’s seeking and communication cost and formulate this new group-buying business as a game model. First, we formulate the basic model as a Stackelberg game where the website is the leader and the seller is the follower. Our result shows that the group-buying mechanism is more efficient when the value ofis smaller, and there is also an upper bound forto adopt group-buying mechanism. Second, we establish three other group-buying game structures by considering different market power between the website and the seller. By comparing the maximum revenues and optimal decisions obtained under different market structures, some interesting and valuable managerial insights are established such that when to adopt a group-buying mechanism or a non-group-buying mechanism and how to make a decision optimally based on adopted mechanism. [ABSTRACT FROM PUBLISHER]

We study multitasking scheduling and due-window assignment problems in a single machine, which can be found in various application domains. In multitasking environment, unfinished job always interrupts in-processing job. In common due window assignment, the aim is to find optimal due window to minimise the value of the earliness and tardiness penalty. In this paper, we study two problems, where the objective of the first problem is minimise the earliness, tardiness, due-window starting time, and due-window size costs, the objective of the second problem is minmax common due-date with completion time penalty, then we obtain some analytical properties and provide polynomial time solutions. Finally, the experimental results show that the proposed methods are effective. [ABSTRACT FROM AUTHOR]

In this paper, we consider the k-sink location problem in a path network with the goal of optimizing a combinational function of the maximum completion time and the total completion time. Let P = V , E be an undirected path network with n vertices. Each vertex has a positive weight, indicating the initial amount of supplies, and each edge has a positive length and a uniform capacity, which is the maximum amount of supplies that can enter the edge per unit time. Our goal is to identify k sink locations on the path P so that all supplies will be successfully evacuated and the given objective function is optimized. This paper presents two efficient polynomial time algorithms, which achieve O n for k = 1 and O n 6 for general k, respectively. [ABSTRACT FROM AUTHOR]

Paclitaxel-induced peripheral neuropathic pain (PIPNP) is a major therapy- and dose-limiting side effect that is extremely laborious to treat. Resveratrol (Res), with a structure name of 3,5,40-trihydroxystilbene, is a kind of natural polyphenolic chemical with plenty of useful characteristics such as anti-inflammatory, and anti-oxidative stress. However, the impact of Res on PIPNP remains unclear. Therefore, the current study intends to examine the analgesic effect of Res on PIPNP. In the present study, the results revealed that Res could effectively prevent the development of paclitaxel-induced PIPNP in a dose-dependent manner when repeated doses of Res were given during PIPNP induction. This prophylactic effect of Res was involved in inhibited paclitaxel-induced up-regulation of TRPV1 instead of TRPA1 in the dorsal root ganglia. Furthermore, the inhibition of TRPV1 up-regulation by Res may be involved in a phosphorylation of ERK mechanism. In summary, we conclude that Res plays an intriguing role in the prevention of PIPNP and thus may work as a therapeutic compound for treating and preventing PIPNP. [ABSTRACT FROM AUTHOR]

Operation management of automated storage and retrieval system (AS/RS) has a great impact on system performance and is a hot research topic. Most existing works for AS/RS operation management address determining storage and retrieval (S/R) machine sequence and minimizing its travel time. In the paper, we study a new bi-objective S/R machine sequencing problem with task release time and due date in a two-depot AS/RS. The objective is to minimize the total travel time of the S/R machine and the total tardiness simultaneously. For the problem, a new bi-objective mixed integer linear programming model is established. Based on problem property analysis, an exact ϵ -constraint method, a non-dominated sorting genetic algorithm II and a promising heuristic are devised for the problem. Especially, the computational results show the efficiency and effectiveness of the proposed algorithms. [ABSTRACT FROM AUTHOR]

Ribosomal DNA (rDNA) transcription drives cell growth and cell proliferation via the product ribosomal RNA (rRNA), the essential component of ribosome. Given the fundamental role of rRNA in ribosome biogenesis, rDNA transcription has emerged as one of the effective targets for a number of human diseases including various types of cancers. In this study, we identify curcumin, an ancient drug, as a novel natural inhibitor of rDNA transcription. Curcumin treatment impairs the assembly of the RNA polymerase I preinitiation complex at rDNA promoters and represses rDNA promoter activity, which leads to the decrease of rRNA synthesis. In addition, curcumin treatment stimulates autophagosome formation and promotes autophagic degradation in cells. Mechanistically, curcumin inactivates the mechanistic target of rapamycin complex 1 (mTORC1), the upstream regulator of rDNA transcription and autophagy induction, by inhibiting mTOR lysosomal localization. Functionally, curcumin treatment inhibits protein synthesis, cell growth and cell proliferation. Taken together, these findings identify curcumin as an effective inhibitor of rDNA transcription and provide novel mechanisms for the anticancer properties of curcumin. Abbreviations: Atg: autophagy-related; GFP: green fluorescent protein; LAMP2: lysosomal associated membrane protein 2; LC3: microtubule-associated protein 1 light chain 3; MEF: mouse embryonic fibroblast; mTORC1: mechanistic target of rapamycin complex 1; rDNA: ribosomal DNA; rRNA: ribosomal RNA; TP53INP2: tumor protein p53 inducible nuclear protein 2. [ABSTRACT FROM AUTHOR]

Background: Osteosarcoma (OS) is the most common primary malignancy of bone with a high incidence in children. Circular RNAs (circRNAs) play crucial roles in the carcinogenesis and chemoresistance of OS. In the current work, we focused on the function and mechanism of hsa_circ_0003496 (circ_0003496) in OS progression and chemoresistance. Materials and Methods: The expression levels of circ_0003496, miR-370 and Krüppel-like factor 12 (KLF12) mRNA were measured by quantitative real-time polymerase chain reaction (qRT-PCR). The Cell Counting Kit-8 (CCK-8) assay was used to assess the 50% inhibitory concentration (IC50) value and cell proliferation. Cell migration, invasion and apoptosis were detected by transwell assay and flow cytometry, respectively. Western blot analysis was performed to assess the protein level. Targeted relationships among circ_0003496, miR-370 and KLF12 were validated by dual-luciferase reporter, RNA immunoprecipitation (RIP) and RNA pull-down assays. Animal studies were carried out to observe the role of circ_0003496 in vivo. Results: Our results indicated that circ_0003496 up-regulation was associated with doxorubicin (DXR) resistance of OS. Circ_0003496 knockdown repressed DXR-resistant OS cell proliferation, migration and invasion, and enhanced apoptosis and DXR sensitivity. Circ_0003496 functioned as a sponge of miR-370, and miR-370 mediated the regulatory effect of circ_0003496 depletion on DXR-resistant OS cell progression and DXR sensitivity. KLF12 was a direct target of miR-370, and miR-370 overexpression suppressed cell progression and enhanced DXR sensitivity by KLF12. Moreover, circ_0003496 protected against KLF12 repression through sponging miR-370. Additionally, circ_0003496 knockdown hampered tumor growth and promoted DXR sensitivity in vivo. Conclusion: Our present work suggested that the knockdown of circ_0003496 suppressed OS progression and enhanced DXR sensitivity at least partially through modulating KLF12 expression via functioning as a miR-370 sponge, highlighting new opportunities for OS management. [ABSTRACT FROM AUTHOR]

This paper studies the favorite machine model, where each machine has different speed for different types of jobs. The model is a natural generalization of the two related machines model and captures the features of some real life problems, such as the CPU–GPU task scheduling, the two products scheduling and the cloud computing task scheduling. We are interested in the game-theoretic version of the scheduling problem in which jobs correspond to self-interested users and machines correspond to resources. The goal is to design coordination mechanisms (local policies) with a small price of anarchy (PoA) for the scheduling game of favorite machines. We first analyze the well known Makespan policy for our problem, and provide exact bounds on both the PoA and the strong PoA (SPoA). We also propose a new local policy, called FF-LPT, which outperforms several classical policies (e.g., LPT, SPT, FF-SPT and Makespan) in terms of the PoA, and guarantees fast convergence to a pure Nash equilibrium. Moreover, computational results show that the FF-LPT policy also dominates other policies for random instances, and reveal some insights for practical applications. [ABSTRACT FROM AUTHOR]

Based on the classical MapReduce concept, we propose an extended MapReduce scheduling model. In the extended MapReduce scheduling problem, we assumed that each job contains an open-map task (the map task can be divided into multiple unparallel operations) and series-reduce tasks (each reduce task consists of only one operation). Different from the classical MapReduce scheduling problem, we also assume that all the operations cannot be processed in parallel, and the machine settings are unrelated machines. For solving the extended MapReduce scheduling problem, we establish a mixed-integer programming model with the minimum makespan as the objective function. We then propose a genetic algorithm, a simulated annealing algorithm, and an L-F algorithm to solve this problem. Numerical experiments show that L-F algorithm has better performance in solving this problem. [ABSTRACT FROM AUTHOR]

High utilization of quay cranes is a major objective pursued by seaport terminal managers. Double-cycling technique has been shown to be effective in practice. Complicated with reshuffle operations, the productivity of quay cranes could be further improved, but the problem complexity increases as a side-effect. This paper studies a double-cycling quay crane scheduling problem in which reshuffle containers can be handled internally on the vessel. For this problem, no exact algorithm exists in the literature. We present a dynamic programming approach to optimally solve the problem. Our algorithm runs in polynomial time when the number of container stacks is fixed. We also extend our proposed optimal algorithm to the general case where hatch covers are involved. [ABSTRACT FROM AUTHOR]

TP53INP2/DOR (tumor protein p53-inducible nuclear protein 2) contributes to mammalian macroautophagy/autophagy by carrying nuclear deacetylated MAP1LC3/LC3 to the cytoplasm. Here, we report that in the cytoplasm, TP53INP2 further functions in autophagosome biogenesis by promoting LC3B-ATG7 interaction. Cytoplasmic expression of the N-terminal region of TP53INP2, which includes the LC3-interacting region, effectively triggered LC3B–PE production and autophagosome formation. In the cytoplasm, TP53INP2 colocalized to early autophagic membrane structures containing ATG14, ZFYVE1/DFCP1 or WIPI2. While knockdown of TP53INP2 did not affect the formation of these autophagic structures, deletion of BECN1 or Atg5, or mutations preventing TP53INP2 from LC3 interaction, disrupted the membrane binding of TP53INP2. TP53INP2 interacted directly with ATG7 to form a LC3B-TP53INP2-ATG7 complex in the cytoplasm. Loss of TP53INP2-LC3 or TP53INP2-ATG7 interaction significantly reduced LC3B-ATG7 binding. Together, these results suggest that after shifting from the nucleus, cytoplasmic TP53INP2 is targeted to early autophagic membranes accompanied by LC3, where it contributes to autophagosome biogenesis by mediating LC3-ATG7 interaction. Abbreviations: 3-MA, 3-methyladenine; 3NES, 3 repeated nuclear export signal; 3NLS, 3 repeated nuclear localization signal; ACTB, actin beta; ATG, autophagy related; BECN1, Beclin 1; mCherry, monomeric red fluorescent protein mCherry; GFP, green fluorescent protein; GST, glutathione S-transferase; KO, knockout; LC3B/MAP1LC3B, microtubule-associated protein 1 light chain 3 beta; LC3B[G120], LC3B mutant lacking amino acids after glycine 120; LDH, lactate dehydrogenase; LMNB1, lamin B1; LIR, LC3-interacting region; MTORC1, mechanistic target of rapamycin complex 1; PE, phosphatidylethanolamine; PtdIns3K, phosphatidylinositol 3-kinase; PtdIns3P, phosphatidylinositol 3-phosphate; rDNA, ribosomal DNA; RFP, red fluorescent protein; RNAi, RNA interference; SQSTM1, sequestosome 1; TP53INP2, tumor protein p53-inducible nuclear protein 2; TP53INP2[1-28], TP53INP2 mutant containing amino acids 1 to 28; TP53INP2[28-45], TP53INP2 mutant containing amino acids 28 to 45; TP53INP2[LIRΔ], TP53INP2 mutant lacking amino acids 1 to 144; TP53INP2[NLSΔ], TP53INP2 mutant lacking amino acids 145 to 221; TP53INP2W35,I38A, TP53INP2 mutant in which tryptophan 35 and isoleucine 38 are replaced with alanine; TP53INP2W35,I38A[NLSΔ], TP53INP2 mutant lacking amino acids 145 to 221, and tryptophan 35 and isoleucine 38 are replaced with alanine; TP53INP2W35,I38A[Δ1-28],[NLSΔ], TP53INP2 mutant lacking amino acids 1 to 28 and amino acids 145 to 221, and tryptophan 35 and isoleucine 38 are replaced with alanine; TP53INP2[Δ1-28],[NLSΔ], TP53INP2 mutant lacking amino acids 1 to 28 and amino acids 145 to 221; TP53INP2[Δ67-111],[NLSΔ], TP53INP2 mutant lacking amino acids 67 to 111 and amino acids 145 to 221; TP53INP2[Δ112-144],[NLSΔ], TP53INP2 mutant lacking amino acids 112 to 144 and amino acids 145 to 221; TUBB, tubulin beta class I; ULK1, unc-51 like autophagy activating kinase 1; VMP1, vacuole membrane protein 1; WIPI2, WD repeat domain phosphoinositide-interacting 2; WT, wild-type; ZFYVE1/DFCP1, zinc finger FYVE-type containing 1. [ABSTRACT FROM AUTHOR]

The tumor protein p53‐inducible nuclear protein 2 (TP53INP2) has been reported to participate in autophagy by interacting with autophagosome‐localized autophagy‐related protein 8 (Atg8) family proteins, including LC3. Here, we uncover a novel function for TP53INP2 in the autophagic degradation of proteins. We identify the ubiquitin‐interacting motif (UIM) of TP53INP2 that mediates its binding to ubiquitin and ubiquitinated proteins. TP53INP2 lacking the UIM is able to displace autophagic adaptor p62 from LC3, which leads to accumulation of ubiquitinated proteins in cells. Furthermore, overexpression of TP53INP2 lacking the UIM sensitizes cells to chloroquine treatment. Our findings indicate that TP53INP2 may act as a novel autophagic adaptor through recruiting ubquitinated substrates to autophagosomes for degradation. [ABSTRACT FROM AUTHOR]

Given the scheduling model of bike-sharing, we consider the problem of hitting a set of n axis-parallel line segments in R 2 by a square or an ℓ ∞ -circle (and two squares, or two ℓ ∞ -circles) whose center(s) must lie on some line segment(s) such that the (maximum) edge length of the square(s) is minimized. Under a different tree model, we consider (virtual) hitting circles whose centers must lie on some tree edges with similar minmax-objectives (with the distance between a center to a target segment being the shortest path length between them). To be more specific, we consider the cases when one needs to compute one (and two) centers on some edge(s) of a tree with m edges, where n target segments must be hit, and the objective is to minimize the maximum path length from the target segments to the nearer center(s). We give three linear-time algorithms and an O (n 2 log n) algorithm for the four problems in consideration. [ABSTRACT FROM AUTHOR]

This paper studies a new version of the location problem called the mixedcenterlocation problem. Let P be a set of n points in the plane. We first consider the mixed 2-center problem, where one of the centers must be in P, and we solve it in O(n2logn) time. Second, we consider the mixed k-center problem, where m of the centers are in P, and we solve it in O(nm+O(k-m)) time. Motivated by two practical constraints, we propose two variations of the problem. Third, we present a 2-approximation algorithm and three heuristics solving the mixed k-center problem (k>2). [ABSTRACT FROM AUTHOR]

This paper addresses the integrated problem of dynamic continuous berth allocation and time-variant quay crane scheduling in container terminals and introduces the factor of tidal impacts into the problem. We mainly consider the impact of tides on the transport capacity of an approach channel that connects quay and anchorage. An integer linear programming model is developed, and then three heuristic algorithms, Genetic Algorithm, Hybrid Particle Swarm Optimization, and Hybrid Simulated Annealing, are proposed to solve the model. Numerical experiments are conducted to verify the efficient performances of the proposed heuristics. Moreover, experimental results also demonstrate the nonignorable impact of tides on the vessel turnaround time and the utilization of berth and quay cranes. [ABSTRACT FROM AUTHOR]

Cells integrate intracellular and extracellular cues to precisely control the balance of anabolic and catabolic processes, which is essential for cells to maintain homeostasis. The nuclear protein TP53INP2 (tumor protein p53 inducible nuclear protein 2) has emerged as one of the key players participating in both anabolic and catabolic processes. In the nucleus including the nucleolus, TP53INP2 binds to multiple transcription-related factors to modulate transcription, such as the transcription of thyroid hormone-related genes and ribosomal DNA. Interestingly, upon nutrient deprivation, TP53INP2 rapidly moves from the nucleus to the cytoplasm and participates in the regulation of macroautophagy/autophagy. By acting as a nutrient status sensor, TP53INP2 switches its role between transcription and autophagy by changing its subcellular localization and helps the cell to cope with environmental changes. Atg: autophagy related; LIR: LC3-interacting region; MAP1LC3/LC3: microtubule-associated protein 1 light chain 3; MTORC1: mechanistic target of rapamycin kinase complex 1; rDNA: ribosomal DNA; TP53INP2: tumor protein p53 inducible nuclear protein 2; UIM: ubiquitin-interacting motif [ABSTRACT FROM AUTHOR]

Price fluctuation is a common phenomenon in the leasing industry. This paper studies the online leasing problem in which the lessee does not know how long he will use the required equipment. Besides, the price of the equipment varies over time, and cannot be learned in advance. We bound the price fluctuations by the definition of the consumer price index. That is, the ratio of the prices between any two consecutive times lies in a predetermined range. By assuming, the lessee has two options for acquiring the equipment: purchase or lease. The problem requires that the leasing strategy should be determined under uncertainties in the using period and the price fluctuations, such that the cost for using the equipment is minimized. We present an optimal online strategy for solving this problem. Computational experiments are conducted to evaluate the characteristics of the problem and the performance of the proposed strategy. [ABSTRACT FROM AUTHOR]

This paper studies an online over-list model of the integrated allocation of berths and quay cranes (QCs) in container terminals with 1-lookahead ability. The objective is to minimize the maximum completion time of container vessels, i.e., the makespan. We focus on two different types of vessels, three berths and a small number of QCs in the hybrid berth layout, with 1-lookahead ability. We propose a (1+2)/2-competitive algorithm for the case with four cranes, a 5/4-competitive algorithm for the case with five cranes and a 4/3-competitive algorithm for the case with six cranes, respectively. All of the algorithms are proved to be optimal. [ABSTRACT FROM AUTHOR]

This paper examines the problem of combining a set of ordinal rankings to form an acceptable consensus ranking. The objective of traditional group decision making problem is to determine the Minimum Violation Ranking. Motived by the applications of adjusted consensus in recent years, we study this problem from a new perspective, for obtaining an acceptable consensus ranking for group decision making. In this paper, every voter ranks a set of alternatives respectively, and we know the acceptability index, which represents the minimum adjustments that are allowed for each voter. The problem is to find the Minimum Acceptable Violation Ranking (MAVR) which minimizes the sum of voter’s unacceptable violations. Besides, we develop a branch and bound ranking algorithm to solve this problem. The suggested improvement include: (1) analysing the ranking preference by two ways: pairwise preference and ranking-based preference; (2) constructing the lower bound and upper bound, which exclude at most half of the feasible solutions in each iteration process. Furthermore, the effectiveness and efficiency of this algorithm are verified with an example and numerical experiments. Finally, we discuss two extensions of the basic MAVR problem: the Minimum Weighted Acceptable Violation problem, whose voters are accompanied with a set of weights or multiples, and the Minimum Hierarchy Acceptable Violation problem, which uses hierarchical acceptability indexes. In addition, our results can be applied to other ranking and subset selection problems in which provide consensus rankings over the alternatives. [ABSTRACT FROM AUTHOR]

Given a graph G=(V,E,D,W), the generalized covering salesman problem (CSP) is to find a shortest tour in G such that each vertex i∈D is either on the tour or within a predetermined distance L to an arbitrary vertex j∈W on the tour, where D⊂V,W⊂V. In this paper, we propose the online CSP, where the salesman will encounter at most k blocked edges during the traversal. The edge blockages are real-time, meaning that the salesman knows about a blocked edge when it occurs. We present a lower bound 11+(k+2)Lk+1 and a CoverTreeTraversal algorithm for online CSP which is proved to be k+α-competitive, where α=0.5+(4k+2)LOPT+2γρ, γ is the approximation ratio for Steiner tree problem and ρ is the maximal number of locations that a customer can be served. When LOPT→0, our algorithm is near optimal. The problem is also extended to the version with service cost, and similar results are derived. [ABSTRACT FROM AUTHOR]

In many fault detection problems, we want to identify all defective items from a set of n items using the minimum number of tests. Group testing is for the scenario where each test is on a subset of items, and tells whether the subset contains at least one defective item or not. In practice, the number d of defective items is often unknown in advance. In this paper, we propose a randomized group testing procedure RGT for the scenario where the number d of defectives is unknown in advance, and prove that RGT is competitive. By incorporating numerical results, we obtain improved upper bounds on the expected number of tests performed by RGT, for 1≤d≤106. In particular, for 1≤d≤106 and the special case where n is a power of 2, we obtain an upper bound of dlognd+Cd+O(logd) with C≈2.67 on the expected number of tests performed by RGT, which is better than the currently best upper bound in Cheng et al. (INFORMS J Comput 26(4):677-689, 2014). We conjecture that the above improved upper bounds based on numerical results from 1≤d≤106 actually hold for all d≥1. [ABSTRACT FROM AUTHOR]