Arbidol: a broad-spectrum antiviral that inhibits acute and chronic HCV infection

Arbidol (ARB) is an antiviral compound that was originally proven effective for treatment of influenza and several other respiratory viral infections. The broad spectrum of ARB anti-viral activity led us to evaluate its effect on hepatitis C virus (HCV) infection and replication in cell culture. Long-term ARB treatment of Huh7 cells chronically replicating a genomic length genotype 1b replicon resulted in sustained reduction of viral RNA and protein expression, and eventually cured HCV infected cells. Pre-treatment of human hepatoma Huh7.5.1 cells with 15 μM ARB for 24 to 48 hours inhibited acute infection with JFH-1 virus by up to 1000-fold. The inhibitory effect of ARB on HCV was not due to generalized cytotoxicity, nor to augmentation of IFN antiviral signaling pathways, but involved impaired virus-mediated membrane fusion. ARB's affinity for membranes may inhibit several aspects of the HCV lifecycle that are membrane-dependent

On representations of the feasible set in convex optimization

We consider the convex optimization problem $\min \{f(x) : g_j(x)\leq 0, j=1,...,m\}$ where $f$ is convex, the feasible set K is convex and Slater's condition holds, but the functions $g_j$ are not necessarily convex. We show that for any representation of K that satisfies a mild nondegeneracy assumption, every minimizer is a Karush-Kuhn-Tucker (KKT) point and conversely every KKT point is a minimizer. That is, the KKT optimality conditions are necessary and sufficient as in convex programming where one assumes that the $g_j$ are convex. So in convex optimization, and as far as one is concerned with KKT points, what really matters is the geometry of K and not so much its representation.Comment: to appear in Optimization Letter

Fast Primal-Dual Gradient Method for Strongly Convex Minimization Problems with Linear Constraints

In this paper we consider a class of optimization problems with a strongly convex objective function and the feasible set given by an intersection of a simple convex set with a set given by a number of linear equality and inequality constraints. A number of optimization problems in applications can be stated in this form, examples being the entropy-linear programming, the ridge regression, the elastic net, the regularized optimal transport, etc. We extend the Fast Gradient Method applied to the dual problem in order to make it primal-dual so that it allows not only to solve the dual problem, but also to construct nearly optimal and nearly feasible solution of the primal problem. We also prove a theorem about the convergence rate for the proposed algorithm in terms of the objective function and the linear constraints infeasibility.Comment: Submitted for DOOR 201

Molecular-orbital-free algorithm for excited states in time-dependent perturbation theory

A non-linear conjugate gradient optimization scheme is used to obtain excitation energies within the Random Phase Approximation (RPA). The solutions to the RPA eigenvalue equation are located through a variational characterization using a modified Thouless functional, which is based upon an asymmetric Rayleigh quotient, in an orthogonalized atomic orbital representation. In this way, the computational bottleneck of calculating molecular orbitals is avoided. The variational space is reduced to the physically-relevant transitions by projections. The feasibility of an RPA implementation scaling linearly with system size, N, is investigated by monitoring convergence behavior with respect to the quality of initial guess and sensitivity to noise under thresholding, both for well- and ill-conditioned problems. The molecular- orbital-free algorithm is found to be robust and computationally efficient providing a first step toward a large-scale, reduced complexity calculation of time-dependent optical properties and linear response. The algorithm is extensible to other forms of time-dependent perturbation theory including, but not limited to, time-dependent Density Functional theory.Comment: 9 pages, 7 figure

Rapid induction of p21WAF1 but delayed down-regulation of Cdc25A in the TGF-β-induced cell cycle arrest of gastric carcinoma cells

Transforming growth factor-beta (TGF-beta) is a multifunctional polypeptide that inhibits cellular proliferation in most epithelial cells. cdk4 and several cyclin-dependent kinase (cdk) inhibitors (p15(INK4B), p21(WAFI/Cip1) and p27(Kip1)) have been implicated in the TGF-beta-induced cell cycle arrest. More recently, down-regulation of Cdc25A, a cdk activator, was additionally suggested as a mechanism underlying growth inhibition by TGF-beta. The existence of diverse cellular mediators, of TGF-beta, however, raises the question of whether their involvement might occur in a redundant manner or coordinately in a certain cell type. Using two TGF-beta-sensitive gastric carcinoma cell lines (SNU-16 and -620), we addressed the contributory roles of several cdk inhibitors, and of cdk4 and Cdc25A, in TGF-beta-induced cell cycle arrest by comparing their temporal expression pattern in response to TGF-beta. Among the cdk inhibitors examined, p21 mRNA was most rapidly (in less than 1 h) and prominently induced by TGF-beta. In contrast, p15 mRNA was more slowly induced than p21 in SNU-620: cells, and not expressed in SNU-16 cells harbouring homozygous deletion of p15. Western blotting results confirmed the rapid increase of p21 while opposite patterns of p27 expression were observed in the two cell lines. The down-regulation of Cdc25A mRNA occurred, but was more delayed than that of p15 or p21. Until G1 arrest was established, changes in the protein levels of both Cdc25A and cdk4 were marginal. Co-immunoprecipitation with anti-cdk4 antibody showed that induced p21 associates with cdk4, and that its kinase activity is reduced by TGF-beta, which kinetically correlates closely with G1 arrest following TGF-beta treatment of both cell lines. These results suggest that in certain human epithelial cells, p21 may play an early role in TGF-beta-induced cell cycle arrest, and its cooperation with other cdk inhibitors is different depending on cell type. Delayed down-regulation of Cdc25A and cdk4 may contribute to cell adaptation to the quiescent state in the two gastric carcinoma cell lines studied

Projection methods in conic optimization

There exist efficient algorithms to project a point onto the intersection of a convex cone and an affine subspace. Those conic projections are in turn the work-horse of a range of algorithms in conic optimization, having a variety of applications in science, finance and engineering. This chapter reviews some of these algorithms, emphasizing the so-called regularization algorithms for linear conic optimization, and applications in polynomial optimization. This is a presentation of the material of several recent research articles; we aim here at clarifying the ideas, presenting them in a general framework, and pointing out important techniques

The Hopf Algebra of Renormalization, Normal Coordinates and Kontsevich Deformation Quantization

Using normal coordinates in a Poincar\'e-Birkhoff-Witt basis for the Hopf algebra of renormalization in perturbative quantum field theory, we investigate the relation between the twisted antipode axiom in that formalism, the Birkhoff algebraic decomposition and the universal formula of Kontsevich for quantum deformation.Comment: 21 pages, 15 figure

Text-to-4D dynamic scene generation

We present MAV3D (Make-A-Video3D), a method for generating three-dimensional dynamic scenes from text descriptions. Our approach uses a 4D dynamic Neural Radiance Field (NeRF), which is optimized for scene appearance, density, and motion consistency by querying a Text-to-Video (T2V) diffusion-based model. The dynamic video output generated from the provided text can be viewed from any camera location and angle, and can be composited into any 3D environment. MAV3D does not require any 3D or 4D data and the T2V model is trained only on Text-Image pairs and unlabeled videos. We demonstrate the effectiveness of our approach using comprehensive quantitative and qualitative experiments and show an improvement over previously established internal baselines. To the best of our knowledge, our method is the first to generate 3D dynamic scenes given a text description. Generated samples can be viewed at make-a-video3d.github.i

The Pure Virtual Braid Group Is Quadratic

If an augmented algebra K over Q is filtered by powers of its augmentation ideal I, the associated graded algebra grK need not in general be quadratic: although it is generated in degree 1, its relations may not be generated by homogeneous relations of degree 2. In this paper we give a sufficient criterion (called the PVH Criterion) for grK to be quadratic. When K is the group algebra of a group G, quadraticity is known to be equivalent to the existence of a (not necessarily homomorphic) universal finite type invariant for G. Thus the PVH Criterion also implies the existence of such a universal finite type invariant for the group G. We apply the PVH Criterion to the group algebra of the pure virtual braid group (also known as the quasi-triangular group), and show that the corresponding associated graded algebra is quadratic, and hence that these groups have a (not necessarily homomorphic) universal finite type invariant.Comment: 53 pages, 15 figures. Some clarifications added and inaccuracies corrected, reflecting suggestions made by the referee of the published version of the pape