Rozsáhlý záchranný výzkum probíhající v nedávné minulosti na stavbě obchvatu Kolína poskytl důležité prameny rovněž ze středního eneolitu. Výsledkem jejich postupné publikace je i tento článek, prezentující osm objektů daného období z plochy I-9. Z analytického hlediska jsou podstatné dva početné soubory, ve kterých byly zachyceny prameny hned několika archeologických kultur. Dominantní součást tvoří nálezy staršího stupně kultury řivnáčské, ojediněle provázené chronologicky korespondujícími importy či napodobeninami keramiky kultury bošácké, zachycené v materiálech z kolínského obchvatu již podruhé. V jednom objektu byly navíc identifikovány zlomky keramiky slezské větve kultury kulovitých amfor, které jsou interpretovány jako doklad sídelního horizontu následujícího po opuštění řivnáčského sídliště. Text je tak zároveň příspěvkem k problematice chronologické uzavřenosti nálezových souborů ze sídlištních objektů. and Extensive rescue excavation recently carried out at the construction of the Kolín ring road yielded important information sources also for the Middle Eneolithic period. The present article, accounting for eight features of the given period from area I-9, represents one of the results of their progressive publication. From the analytical point of view, two large assemblages are substantial, providing evidence of several archaeological cultures. The dominant component consists in finds from the early stage of the Řivnáč culture, sporadically accompanied by chronologically corresponding imports or imitations of the Bošáca culture pottery, recorded in the materials from the Kolín ring road for the second time already. Pottery sherds of the Silesian branch of the Globular Amphora culture were identified in one of the features and are interpreted as evidence of the settlement horizon subsequent to the abandonment of the Řivnáč culture settlement. The text thus contributes also to the issue of chronological closure of find contexts of settlement features.
Medical diagnostic accuracies can be improved when the pattern is simplified through representation by important features. Features are used to represent patterns with minimal loss of important information. The feature vector, which is comprised of the set of all features used for describing a pattern, is a reduced-dimensional representation of that pattern. By identifying a set of salient features, the noise in a classification model can be reduced, resulting in more accurate classification. In this study, a signal-to-noise ratio (SNR) saliency measure was employed to determine saliency of input features of recurrent neural networks (RNNs) used in the classification of electrocardiogram (ECG) signals. In order to extract features representing four types of ECG beats (normal beat, congestive heart failure beat, ventricular tachyarrhythmia beat, atrial fibrillation beat) obtained from the Physiobank database, eigenvector methods were used. The RNNs used in the ECG beats classification were trained for the SNR screening method. The results of the application of the SNR screening method to the ECG signals demonstrated that classification accuracies of the RNNs with salient input features are higher than those of the RNNs with salient and non-salient input features.
A caterpillar is a tree with the property that after deleting all its vertices of degree 1 a simple path is obtained. The signed 2-domination number γ 2 s (G) and the signed total 2-domination number γ 2 st(G) of a graph G are variants of the signed domination number γs(G) and the signed total domination number γst(G). Their values for caterpillars are studied.
The set $D$ of distinct signed degrees of the vertices in a signed graph $G$ is called its signed degree set. In this paper, we prove that every non-empty set of positive (negative) integers is the signed degree set of some connected signed graph and determine the smallest possible order for such a signed graph. We also prove that every non-empty set of integers is the signed degree set of some connected signed graph.
The concept of signed domination number of an undirected graph (introduced by J. E. Dunbar, S. T. Hedetniemi, M. A. Henning and P. J. Slater) is transferred to directed graphs. Exact values are found for particular types of tournaments. It is proved that for digraphs with a directed Hamiltonian cycle the signed domination number may be arbitrarily small.