Birger Wernerfelt, Cynthia A. Montgomery
Hasil untuk "q-bio.SC"
Menampilkan 20 dari ~1710886 hasil · dari CrossRef, arXiv, DOAJ, Semantic Scholar
Larry H. P. Lang, R. Stulz, R. Walkling
W. Stephenson
Cynthia A. Montgomery, Birger Wernerfelt
Paolo Marcellini
J. Tsitsiklis
F. Nistal de Paz, C. Nistal de Paz
Steven R. Brown
K. Golec-Biernat, M. Wüsthoff
We present a model based on the concept of saturation for small $Q^2$ and small $x$. With only three parameters we achieve a good description of all Deep Inelastic Scattering data below $x=0.01$. This includes a consistent treatment of charm and a successful extrapolation into the photoproduction regime. The same model leads to a roughly constant ratio of diffractive and inclusive cross section.
A. Anderson, H. Bijlmer, P. Fournier et al.
K. Parsons, Agata McCormac, M. Butavicius et al.
Tarek Tohme, Massimo Vergassola, Thierry Mora et al.
Cells integrate signals and make decisions about their future state in short amounts of time. A lot of theoretical effort has gone into asking how to best design gene regulatory circuits that fulfill a given function, yet little is known about the constraints that performing that function in a small amount of time imposes on circuit architectures. Using an optimization framework, we explore the properties of a class of promoter architectures that distinguish small differences in transcription factor concentrations under time constraints. We show that the full temporal trajectory of gene activity allows for faster decisions than its integrated activity represented by the total number of transcribed mRNA. The topology of promoter architectures that allow for rapidly distinguishing low transcription factor concentrations result in a low, shallow, and non cooperative response, while at high concentrations, the response is high and cooperative. In the presence of non-cognate ligands, networks with fast and accurate decision times need not be optimally selective, especially if discrimination is difficult. While optimal networks are generically out of equilibrium, the energy associated with that irreversibility is only modest, and negligible at small concentrations. Instead, our results highlight the crucial role of rate-limiting steps imposed by biophysical constraints.
M. Mursaleen, K. Ansari, Asif Khan
Kathleen Hamilton, Mayanka Chandra Shekar, John Gounley et al.
Zhenfei Tan, H. Zhong, Q. Xia et al.
The technical virtual power plant (TVPP) is a promising paradigm to facilitate the integration of distributed energy resources (DERs) while incorporating operational constraints of both DERs and networks. Due to the volatility and limited predictability of DER generation and electric loads, the output capability of the TVPP is uncertain. In this regard, this paper proposes the robust capability curve (RCC) of the TVPP, which explicitly characterizes the allowable range of the scheduled power output that is executable for the TVPP under uncertainties. Implementing the RCC can secure the scheduling of the TVPP against unexpected fluctuations of operating conditions when the TVPP participates in the transmission-level dispatch. Mathematically, the RCC is the first-stage feasible set of an adjustable robust optimization problem. An uncertainty set model incorporating the variable correlation and uncertainty budget is employed, which makes the robustness and conservatism of the RCC adjustable. A novel methodology is proposed to estimate the RCC by the convex hull of several points on its perimeter. These perimeter points are obtained by solving a series of multi scenario-optimal power flow problems with worst-case uncertainty realizations identified based on a linearized network configuration. Case studies based on the IEEE-13 test feeder validate the effectiveness of the RCC to ensure the scheduling feasibility while hedging against uncertainties. The computational efficiency of the proposed RCC estimation method is also verified based on larger-scale test systems.
H. Srivastava, B. Khan, N. Khan et al.
Hongwei Ge, Yumei Song, Chunguo Wu et al.
The problem of adaptive traffic signal control in the multi-intersection system has attracted the attention of researchers. Among the existing methods, reinforcement learning has shown to be effective. However, the complex intersection features, heterogeneous intersection structures, and dynamic coordination for multiple intersections pose challenges for reinforcement learning-based algorithms. This paper proposes a cooperative deep Q-network with Q-value transfer (QT-CDQN) for adaptive multi-intersection signal control. In QT-CDQN, a multi-intersection traffic network in a region is modeled as a multi-agent reinforcement learning system. Each agent searches the optimal strategy to control an intersection by a deep Q-network that takes the discrete state encoding of traffic information as the network inputs. To work cooperatively, the agent considers the influence of the latest actions of its adjacencies in the process of policy learning. Especially, the optimal Q-values of the neighbor agents at the latest time step are transferred to the loss function of the Q-network. Moreover, the strategy of the target network and the mechanism of experience replay are used to improve the stability of the algorithm. The advantages of QT-CDQN lie not only in the effectiveness and scalability for the multi-intersection system but also in the versatility to deal with the heterogeneous intersection structures. The experimental studies under different road structures show that the QT-CDQN is competitive in terms of average queue length, average speed, and average waiting time when compared with the state-of-the-art algorithms. Furthermore, the experiments of recurring congestion and occasional congestion validate the adaptability of the QT-CDQN to dynamic traffic environments.
Ji-Cai Liu, F. Petrov
We establish a $q$-analogue of Sun--Zhao's congruence on harmonic sums. Based on this $q$-congruence and a $q$-series identity, we prove a congruence conjecture on sums of central $q$-binomial coefficients, which was recently proposed by Guo. We also deduce a $q$-analogue of a congruence due to Apagodu and Zeilberger from Guo's $q$-congruence.
Gerardo Aquino, Andrea Rocco
We consider a generic class of gene circuits affected by nonlinear extrinsic noise. To address this nonlinearity we introduce a general perturbative methodology based on assuming timescale separation between noise and genes dynamics, with fluctuations exhibiting a large but finite correlation time. We apply this methodology to the case of the toggle switch, and by considering biologically relevant log-normal fluctuations, we find that the system exhibits noise-induced transitions. The system becomes bimodal in regions of the parameter space where it would be deterministically monostable. We show that by including higher order corrections our methodology allows one to obtain correct predictions for the occurrence of transitions even for not so large correlation time of the fluctuations, overcoming thereby limitations of previous theoretical approaches. Interestingly we find that at intermediate noise intensities the noise-induced transition in the toggle switch affects one of the genes involved, but not the other one.
M. Govindaraj, S. Sivasubramanian
Halaman 18 dari 85545