In the physical sciences, mathematical theory and experimental investigation have always marched together. Mathematics has been less intrusive in the life sciences, possibly because they have until recently been largely descriptive, lacking the invariance principles and fundamental natural constants of physics. Increasingly in recent decades, however, mathematics has become pervasive in biology...

conclusions the mathematical meaning of the two insulin-related biomarkers examined was the same, and the odds ratios of the two biomarkers were almost the same after adjustments for other independent variables. objectives a one-year follow-up study was conducted to determine the ability of the insulin-related biomarkers to predict the risk of mets development. patients and methods a total of 2...

the objective of this work was to develop and evaluate the levofloxacin hemihydrate floating formulations (f1-f9). selection of optimized batch was done by model dependent approach and novel mathematical approach. f1-f9 batches were prepared by direct compression method using gelucire 43/01 (hydrophobic) and hydroxypropylmethylcellulose (hydrophilic) polymer in different ratios. the floating ta...

We aim to generalize Büchi’s fundamental theorem on the coincidence of recognizable and MSO-definable languages to a weighted timed setting. For this, we investigate weighted timed automata and show how we can extend Wilke’s relative distance logic with weights taken from an arbitrary semiring. We show that every formula in our logic can effectively be transformed into a weighted timed automato...

Our goal is to study the complexity of infinite binary recursive sequences. We introduce several measures of the quantity of information they contain. Some measures are based on size of programs that generate the sequence, the others are based on the Kolmogorov complexity of its finite prefixes. The relations between these complexity measures are established. The most surprising among them are ...

This paper surveys two related lines of research: Logical characterizations of (non-deterministic) linear time complexity classes, and non-expressibility results concerning sublogics of existential second-order logic. Starting from Fagin's fundamental work there has been steady progress in both elds with the eeect that the weakest logics that are used in characterizations of linear time complex...

The main factor of intelligence is defined as the ability to comprehend, formalising this ability with the help of new constructs based on descriptional complexity. The result is a comprehension test, or C-test, which is exclusively defined in computational terms. Due to its absolute and non-anthropomorphic character, it is equally applicable to both humans and non-humans. Moreover, it correlat...

The descriptive complexity of a problem is the complexity of describing the problem in some logical formalism. One of the few techniques for proving separation results in descriptive complexity is to make use of games on graphs played between two players, called the spoiler and the duplicator. There are two types of these games, which differ in the order in which the spoiler and duplicator make...

This paper presents a way to perform speaker adaptation for automatic speech recognition using the stream weights in a multi-stream setup, which included acoustic models for “Articulatory Features” such as ROUNDED or VOICED. We present supervised speaker adaptation experiments on a spontaneous speech task and compare the above stream-based approach to conventional approaches, in which the model...