Results 71 to 80 of about 491,574 (256)

Organizing the interface—Plasma membrane architecture and receptor dynamics in virus‐cell interactions

open access: yesFEBS Letters, EarlyView.
Plasma membranes contain dynamic nanoscale domains that organize lipids and receptors. Because viruses operate at similar scales, this architecture shapes early infection steps, including attachment, receptor engagement, and entry. Using influenza A virus and HIV‐1 as examples, we highlight how receptor nanoclusters, multivalent glycan interactions ...
Jan Schlegel, Christian Sieben
wiley   +1 more source

Heuristic procedures for reactive project scheduling. [PDF]

open access: yes
This paper describes new heuristic reactive project scheduling procedures that may be used to repair resource-constrained roject baseline schedules that suer from multiple activity duration disruptions during project execution.The objective is to ...
Van de Vonder, S   +3 more
core  

Predict+Optimize Problem in Renewable Energy Scheduling

open access: yesIEEE Access
Predict+Optimize frameworks integrate forecasting and optimization to address real-world challenges such as renewable energy scheduling, where variability and uncertainty are critical factors.
Christoph Bergmeir   +27 more
doaj   +1 more source

Residual tail twisting in ascidian larvae is stabilized by asymmetric myofibrils that resist bilateral symmetry restoration

open access: yesFEBS Letters, EarlyView.
Ascidian Ciona larvae initially show strong clockwise tail twisting, which is largely corrected during development. However, a small residual twist remains. This study shows that organized helical myofibrils in tail muscles mechanically stabilize this residual asymmetry, preventing complete restoration of bilateral symmetry and revealing how embryos ...
Yuki S. Kogure   +3 more
wiley   +1 more source

A novel class of scheduling policies for the stochastic resource-constrained project scheduling problem. [PDF]

open access: yes
We study the resource-constrained project scheduling problem with stochastic activity durations. We introduce a new class of scheduling policies for this problem, which make a number of a-priori sequencing decisions in a pre-processing phase, while the ...
Leus, Roel   +2 more
core  

Research on Group Scheduling with General Logarithmic Deterioration Subject to Maximal Completion Time Cost

open access: yesAxioms
Single-machine group scheduling with general logarithmic deterioration is investigated, where the actual job processing (resp. group setup) time is a non-decreasing function of the sum of the logarithmic job processing (resp.
Jin-Da Miao   +3 more
doaj   +1 more source

The Aircraft Landing Problem

open access: yesCommunications, 2003
The problem studied in the paper is an air traffic problem on the airport runway. The goal is finding an aircraft landing sequence that meets the time window for the particular aircraft and at the same time the separation times between two aircraft ...
Jan Pelikan
doaj   +1 more source

Rab14 regulates the transport of human papillomavirus to the trans‐Golgi network for infectious cell entry

open access: yesFEBS Letters, EarlyView.
This study reveals that the small GTPase Rab14 is necessary for human papillomavirus (HPV) infection and plays an essential role in the transport of virions to the trans‐Golgi network (TGN). HPV in the early endosome (EE), which harbors GTP‐bound Rab14, is transported to the TGN through the switch of Rab14 from its GTP‐bound to GDP‐bound form.
Yoshiyuki Ishii, Iwao Kukimoto
wiley   +1 more source

Project scheduling under undertainty – survey and research potentials. [PDF]

open access: yes
The vast majority of the research efforts in project scheduling assume complete information about the scheduling problem to be solved and a static deterministic environment within which the pre-computed baseline schedule will be executed. However, in the
Herroelen, Willy, Leus, Roel
core  

Mathematical Programming vs. Constraint Programming for Scheduling Problems

open access: yesCommunications, 2013
This paper focuses on a classical scheduling problem known as the job-shop scheduling problem which is one of the most difficult problems in combinatorial optimisation.
Ludmila Janosikova, Tomas Hreben
doaj   +1 more source

Home - About - Disclaimer - Privacy