Recently, there has been much interest in the application of linear logic, a logic of resourceconsumption, to computer science. In particular, the present authors (and others) have considered how logic programming languages can be derived by purely proof-theoretic analyses of linear logic. Such languages provide a notion of resource-oriented programming, often leading to programs that are more ...

We study quasilinear degenerate parabolic-hyperbolic stochastic partial differential equations with general multiplicative noise within the framework of kinetic solutions. Our results are twofold: First, we establish new regularity results based on averaging techniques. Second, we prove the existence and uniqueness of solutions in a full L1 setting requiring no growth assumptions on the nonline...

for a graph $g$ with edge set $e(g)$, the multiplicative sum zagreb index of $g$ is defined as$pi^*(g)=pi_{uvin e(g)}[d_g(u)+d_g(v)]$, where $d_g(v)$ is the degree of vertex $v$ in $g$.in this paper, we first introduce some graph transformations that decreasethis index. in application, we identify the fourteen class of trees, with the first through fourteenth smallest multiplicative sum zagreb ...

‎for a graph $g$ with edge set $e(g)$‎, ‎the multiplicative second zagreb index of $g$ is defined as‎ ‎$pi_2(g)=pi_{uvin e(g)}[d_g(u)d_g(v)]$‎, ‎where $d_g(v)$ is the degree of vertex $v$ in $g$‎. ‎in this paper‎, ‎we identify the eighth class of trees‎, ‎with the first through eighth smallest multiplicative second zagreb indeces among all trees of order $ngeq 14$‎.

Small molecules in chemistry can be represented as graphs. In a quantitative structure-activity relationship (QSAR) analysis, the central task is to find a regression function that predicts the activity of the molecule in high accuracy. Setting a QSAR as a primal target, we propose a new linear programming approach to the graph-based regression problem. Our method extends the graph classificati...

Computing approximately optimal solutions is an attractive way to cope with NP-hard optimization problems. In the past decade or so, semidefinite programming or SDP (a form of convex optimization that generalizes linear programming) has emerged as a powerful tool for designing such algorithms, and the last few years have seen a profusion of results (worst-case algorithms, average case algorithm...

To analyze the stability of Itô stochastic differential equations with multiplicative noise, we introduce the stochastic logarithmic norm. The logarithmic norm was originally introduced by G. Dahlquist in 1958 as a tool to study the growth of solutions to ordinary differential equations and for estimating the error growth in discretization methods for their approximate solutions. We extend the ...

We consider the long time limit theorems for the solutions of a discrete wave equation with a weak stochastic forcing. The multiplicative noise conserves the energy, and in the unpinned case also conserves the momentum. We obtain a time-inhomogeneous OrnsteinUhlenbeck equation for the limit wave function that holds both for square integrable and statistically homogeneous initial data. The limit...

In this paper, we develop two zonotope-based set-membership estimation algorithms for identification of time-varying parameters in linear models, where both additive and multiplicative uncertainties are treated explicitly. The two recursive algorithms can be differentiated by their ways of processing the data and required computations. The first algorithm, which is referred to as Cone And Zonot...