two peroxidases (ec. 1.11.1.7), pod i and pod ii were purified from the roots of cultivatedraphanus sativus l. var. cicil by one step ion-exchange chromatography after fractionation by acetone. the molecular weight of these enzymes were 43000 and 41000 daltons and rz 1.2 and 2.0 for pod i and pod ii, respectively. both enzymes consisted of a single polypeptide chain on sds-page. the maximum act...

In the present paper we have described a system for acquiring, processing and decomposing EMG signals for the purpose of extracting as many motor unit action potential trains as possible with the greatest level of accuracy. This system consists of 4 main sections. The first section consists of methodologies for signal acquisition and quality verification. Three channels of EMG signals are acqui...

Biomedical signals are long records of electrical activity within the human body, and they faithfully represent the state of health of a person. Of the many biomedical signals, focus of this work is on Electro-encephalogram (EEG), Electro-cardiogram (ECG) and Electro-myogram (EMG). It is tiresome for physicians to visually examine the long records of biomedical signals to arrive at conclusions....

Test-retest reliability was assessed for parameters describing motor unit action potential shapes, obtained from multi-channel surface EMG signals.

An equitable coloring of a graph G is a proper coloring of the vertices of G such that color classes differ in size by at most one. In this note, we verify the equitable coloring conjecture [W. Meyer, Amer. Math. Monthly 80 (1973), 920–922] for some classes of graphs which are defined by forbidden induced subgraphs using known results.

A graph G on n vertices is pancyclic if G contains cycles of all lengths`for 3 ` n and G is cycle extendable if for every nonhamiltonian cycle C G there is a cycle C 0 G such that V (C) V (C 0) and jV (C 0) n V (C)j = 1. We prove that (i) every 2-connected K 1;3-free graph is pancyclic, if G is P 5-free and n 6, if G is P 6-free and n 10, or if G is P 7-free, deer-free and n 14, and (ii) every ...

A set A of vertices of a graph G is called d-scattered in G if no two d-neighborhoods of (distinct) vertices of A intersect. In other words, A is d-scattered if no two distinct vertices of A have distance at most 2d. This notion was isolated in the context of finite model theory by Gurevich and recently it played a prominent role in the study of homomorphism preservation theorems for special cl...

In this paper we propose a structural characterization for a class of bipartite graphs defined by two forbidden induced subgraphs. We show that the obtained characterization leads to polynomial-time algorithms for several problems that are NP-hard in general bipartite graphs.

An antimatroid is an accessible union-closed family of subsets of a 0nite set. A number of classes of antimatroids are closed under taking minors such as point-search antimatroids of rooted (di)graphs, line-search antimatroids of rooted (di)graphs, shelling antimatroids of rooted trees, shelling antimatroids of posets, etc. The forbidden minor characterizations are known for point-search antima...

Let H be a set of connected graphs. A graph G is said to be H-free if G does not contain any element of H as an induced subgraph. Let Fk(H) be the set of k-connected H-free graphs. When we study the relationship between forbidden subgraphs and a certain graph property, we often allow a finite exceptional set of graphs. But if the symmetric difference of Fk(H1) and Fk(H2) is finite and we allow ...