Theoretical Hyperbolic Model of a Partial Agonism: Explicit Formulas for Affinity, Efficacy and Amplification

The quantitative analysis of receptor-mediated effect is based on experimental concentration-response data in which the independent variable, the concentration of a receptor ligand, is linked with a dependent variable, the biological response. The steps between the drug–receptor interaction and the subsequent biological effect are to some extent unknown. The shape of the fitting curve of the experimental data may give some in-sights into the nature of the concentration–receptor–response (C-R-R) mechanism. It can be evaluated by non-linear regression analysis of the experimental data points of the independent and dependent variables, which could be considered as a history of the interaction between the drug and receptors. However, this information is not enough to evaluate such important parameters of the mechanism as the dissociation constant (affinity) and efficacy. There are two ways to provide more detailed information about the C-R-R mechanism: (i) an experimental way for obtaining data with new or

Dimension Reduction of the Explanatory Variables in Multiple Linear Regression

2002 Mathematics Subject Classification: 62J05, 62G35.

Logistic Regression in Modelling Data for CVC - Related Infection

2000 Mathematics Subject Classification: 62J12, 62P10.

Solving the Task Assignment Problem with a Variable Neighborhood Search

In this paper a variable neighborhood search (VNS) approach for the task assignment problem (TAP) is considered. An appropriate neighborhood scheme along with a shaking operator and local search procedure are constructed specifically for this problem. The computational results are presented for the instances from the literature, and compared to optimal solutions obtained by the CPLEX solver and heuristic solutions generated by the genetic algorithm. It can be seen that the proposed VNS approach reaches all optimal solutions in a quite short amount of computational time.

Variable Neighborhood Search for the File Transfer Scheduling Problem

ACM Computing Classification System (1998): I.2.8, G.1.6.

A Variable Neighborhood Search Approach for Solving the Maximum Set Splitting Problem

This paper presents a Variable neighbourhood search (VNS) approach for solving the Maximum Set Splitting Problem (MSSP). The algorithm forms a system of neighborhoods based on changing the component for an increasing number of elements. An efficient local search procedure swaps the components of pairs of elements and yields a relatively short running time. Numerical experiments are performed on the instances known in the literature: minimum hitting set and Steiner triple systems. Computational results show that the proposed VNS achieves all optimal or best known solutions in short times. The experiments indicate that the VNS compares favorably with other methods previously used for solving the MSSP. ACM Computing Classification System (1998): I.2.8.

Variable Neighborhood Search for Solving the Capacitated Single Allocation Hub Location Problem

In this paper a Variable Neighborhood Search (VNS) algorithm for solving the Capacitated Single Allocation Hub Location Problem (CSAHLP) is presented. CSAHLP consists of two subproblems; the first is choosing a set of hubs from all nodes in a network, while the other comprises finding the optimal allocation of non-hubs to hubs when a set of hubs is already known. The VNS algorithm was used for the first subproblem, while the CPLEX solver was used for the second. Computational results demonstrate that the proposed algorithm has reached optimal solutions on all 20 test instances for which optimal solutions are known, and this in short computational time.

Null Condition for Semilinear Wave Equation with Variable Coefficients

∗The author was partially supported by M.U.R.S.T. Progr. Nazionale “Problemi Non Lineari...”

Application of the Heterogeneous System Prediction Method to Pattern Recognition Problem

* This work was financially supported by RFBR-04-01-00858.

Hamilton’s Principle with Variable Order Fractional Derivatives

MSC 2010: 26A33, 70H25, 46F12, 34K37 Dedicated to 80-th birthday of Prof. Rudolf Gorenflo

Sensor Location Problem for a Multigraph

MSC 2010: 05C50, 15A03, 15A06, 65K05, 90C08, 90C35