New Bounds for the Maximum Size of Ternary Constant Weight Codes

This work was partially supported by the Bulgarian National Science Fund under Grant I–618/96.

On the Maximum of a Branching Process Conditioned on the Total Progeny

The maximum M of a critical Bienaymé-Galton-Watson process conditioned on the total progeny N is studied. Imbedding of the process in a random walk is used. A limit theorem for the distribution of M as N → ∞ is proved. The result is trasferred to the non-critical processes. A corollary for the maximal strata of a random rooted labeled tree is obtained.

Method for Analytical Representation of the Maximum Inaccuracies of Indirectly Measurable Variable

Let us have an indirectly measurable variable which is a function of directly measurable variables. In this survey we present the introduced by us method for analytical representation of its maximum absolute and relative inaccuracy as functions, respectively, of the maximum absolute and of the relative inaccuracies of the directly measurable variables. Our new approach consists of assuming for fixed variables the statistical mean values of the absolute values of the coefficients of influence, respectively, of the absolute and relative inaccuracies of the directly measurable variables in order to determine the analytical form of the maximum absolute and relative inaccuracies of an indirectly measurable variable. Moreover, we give a method for determining the numerical values of the maximum absolute and relative inaccuracies. We define a sample plane of the ideal perfectly accurate experiment and using it we give a universal numerical characteristic – a dimensionless scale for determining the quality (accuracy) of the experiment.

On Solving the Maximum Betweenness Problem Using Genetic Algorithms

In this paper a genetic algorithm (GA) is applied on Maximum Betweennes Problem (MBP). The maximum of the objective function is obtained by finding a permutation which satisfies a maximal number of betweenness constraints. Every permutation considered is genetically coded with an integer representation. Standard operators are used in the GA. Instances in the experimental results are randomly generated. For smaller dimensions, optimal solutions of MBP are obtained by total enumeration. For those instances, the GA reached all optimal solutions except one. The GA also obtained results for larger instances of up to 50 elements and 1000 triples. The running time of execution and finding optimal results is quite short.

Solving Maximum Clique Problem for Protein Structure Similarity

Computing the similarity between two protein structures is a crucial task in molecular biology, and has been extensively investigated. Many protein structure comparison methods can be modeled as maximum weighted clique problems in specific k-partite graphs, referred here as alignment graphs. In this paper we present both a new integer programming formulation for solving such clique problems and a dedicated branch and bound algorithm for solving the maximum cardinality clique problem. Both approaches have been integrated in VAST, a software for aligning protein 3D structures largely used in the National Center for Biotechnology Information, an original clique solver which uses the well known Bron and Kerbosch algorithm (BK). Our computational results on real protein alignment instances show that our branch and bound algorithm is up to 116 times faster than BK.

Maximum Principle and Its Application for the Time-Fractional Diffusion Equations

MSC 2010: 26A33, 33E12, 35B45, 35B50, 35K99, 45K05 Dedicated to Professor Rudolf Gorenflo on the occasion of his 80th anniversary

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.

Implementation of the EM Algorithm for Maximum Likelihood Estimation of a Random Effects Model for One Longitudinal Ordinal Outcome

2010 Mathematics Subject Classification: 62J99.

Extended Maximum Principles

2000 Mathematics Subject Classification: 35B50, 35L15.

Resolvent and Scattering Matrix at the Maximum of the Potential

2000 Mathematics Subject Classification: 35P25, 81U20, 35S30, 47A10, 35B38.