A new approach based on the implementation of probabilistic neural network (PNN) is presented for classification of electrocardiogram (ECG) beats. Four types of ECG beats (normal beat, congestive heart failure beat, ventricular tachyarrhythmia beat, atrial fibrillation beat) obtained from the Physiobank database were analyzed. The ECG signals were decomposed into time-frequency representations using discrete wavelet transform (DWT) and wavelet coefficients were calculated to represent the signals. The aim of the study is classification of the ECG beats by the combination of wavelet coefficients and PNN. The purpose is to determine an optimum classification scheme for this problem and also to infer clues about the extracted features. The present research demonstrated that the wavelet coefficients are the features which well represent the ECG signals and the PNN trained on these features achieved high classification accuracies.
In the paper we deal with weak Boolean products of bounded dually residuated l-monoids (DRl-monoids). Since bounded DRl-monoids are a generalization of pseudo MValgebras and pseudo BL-algebras, the results can be immediately applied to these algebras.
In this paper the notion of weak chain-completeness is introduced for pseudo-ordered sets as an extension of the notion of chain-completeness of posets (see [3]) and it is shown that every isotone map of a weakly chain-complete pseudo-ordered set into itself has a least fixed point.
Some criteria for weak compactness of set valued integrals are given. Also we show some applications to the study of multimeasures on Banach spaces with the Radon-Nikodym property.
Here we consider the weak congruence lattice $C_{W}(A)$ of an algebra $A$ with the congruence extension property (the CEP for short) and the weak congruence intersection property (briefly the WCIP). In the first section we give necessary and sufficient conditions for the semimodularity of that lattice. In the second part we characterize algebras whose weak congruences form complemented lattices.
The full consistency of Saaty's matrix of preference intensities used in AHP is practically unachievable for a large number of objects being compared. There are many procedures and methods published in the literature that describe how to assess whether Saaty's matrix is "consistent enough". Consistency is in these cases measured for an already defined matrix (i.e. ex-post). In this paper we present a procedure that guarantees that an acceptable level of consistency of expert information concerning preferences will be achieved. The proposed method is based on dividing the process of inputting Saaty's matrix into two steps. First, the ordering of the compared objects with respect to their significance is determined using the pairwise comparison method. Second, the intensities of preferences are defined for the objects numbered in accordance with their ordering (resulting from the first step). In this paper the weak consistency of Saaty's matrix is defined, which is easy to check during the process of inputting the preference intensities. Several propositions concerning the properties of weakly consistent Saaty's matrices are proven in the paper. We show on an example that the weak consistency, which represents a very natural requirement on Saaty's matrix of preference intensities, is not achieved for some matrices, which are considered "consistent enough" according to the criteria published in the literature. The proposed method of setting Saaty's matrix of preference intensities was used in the model for determining scores for particular categories of artistic production, which is an integral part of the Registry of Artistic Results (RUV) currently being developed in the Czech Republic. The Registry contains data on works of art originating from creative activities of Czech art colleges and faculties. Based on the total scores achieved by these institutions, a part of the state budget subsidy is being allocated among them.
We explore (weak) continuity properties of group operations. For this purpose, the Novak number and developability number are applied. It is shown that if $(G, \cdot ,\tau )$ is a regular right (left) semitopological group with $\mathop{{\rm dev}}(G)<\mathop{{\rm Nov}}(G)$ such that all left (right) translations are feebly continuous, then $(G,\cdot ,\tau )$ is a topological group. This extends several results in literature.