Complex systems, in many different scientific sectors, show coarse-grain properties with simple growth laws with respect to fundamental microscopic algorithms. We propose a classification scheme of growth laws which includes human aging, tumor (and/or tissue) growth, logistic and generalized logistic growth and the aging of technical devices. The proposed classification permits to evaluate the ...

Article history: Received 2 November 2011 Available online xxxx Communicated by Luchezar L. Avramov MSC: primary 16E40, 55P35 secondary 16E45, 16T10, 16T15, 18G55, 55P40, 55U10, 55U15, 57T05, 57T30

A method is described for the purification of the A substance in horse saliva, and additional observations on the chemical properties of the preparation are reported. The preparation isolated was found to be highly active serologically and it appears to be polysaccharide in nature.

The authors present an epizootiological analysis of viral haemorrhagic disease of rabbits in Poland. The biological, physical and chemical properties of virus isolates used for the production and control of the vaccine 'Cunivac' (produced in Poland) are also presented. The safety and efficacy of this vaccine are demonstrated. Laboratory experiments and large-scale field observations yielded sat...

Molecular modeling frequently constructs classification models for the prediction of two-class entities, such as compound bio(in)activity, chemical property (non)existence, protein (non)interaction, and so forth. The models are evaluated using well known metrics such as accuracy or true positive rates. However, these frequently used metrics applied to retrospective and/or artificially generated...

Following a non-technical personal reminiscence of the author's conception of Chua's circuit, this paper presents the systematic sequence of technical steps which the author used to design his chaotic circuit. The design procedure. though straightforward in nature. could not have been concocted without a working knowledge of several crucial properties of nonlinear circuits and their physical re...

We consider graphs that admit polyline drawings where all crossings occur at the same angle α ∈ (0, π2 ]. We prove that every graph on n vertices that admits such a polyline drawing with at most two bends per edge has O(n) edges. This result remains true when each crossing occurs at an angle from a small set of angles. We also provide several extensions that might be of independent interest.