The Czech ''Silesian identity'', obvious throughout the twentieth century, was based on a mixture of strong regional, even local, patriotism, which was determined by historical developments. This patriotism developed on the ethnically mixed territory of Czech Silesia (formerly Austrian Silesia). After the Second World War, this phenomenon was quickly revived, but unlike in the pre-war period, it took a clearly Czech national form. The territorial factor, by contrast, receded into the background. Behind this activity and new interpretation stood intellectual circles and institutions in Opava, some leading fi gures from Ostrava, and the Silesian Cultural Institute in Prague. In addition to cultural-educational activity, their efforts were concentratedon claiming some border areas of Polish and German Silesia as being historically Czech, and also on ensuring the distinctive administrative status of the territory of Silesia in Czechoslovakia, the seed of which they saw in the Ostrava branch of the Moravian National Committee (Zemský národní výbor) in Brno. During the Communist regime, according to the authors, the top state authorities showed an intentional lack of interest in the problems of Silesia when solving related economic and other questions. A consequence of this was a ''silencing of the offi cial sources'' about Silesia. In the 1950s, the ''Silesian-ness'' was condemned as a form of ''bourgeois nationalism'' and was identifi ed with the period of Czech-Polish national friction in the region. From the administrative point of view, Silesia was dissolved in the Ostrava area, later in the North Moravian Region, and was recalled practically only by artistic expressions of an ''Old Silesian-ness'', such as folklore and museum exhibitions. Silesian organizations and societies were, with few exceptions, dissolved or renamed and the newly established Silesian Research Institute in Opava had to orient its historical research chiefl y to the labour movement. The works of the poet Petr Bezruč (born Vladimír Vašek, 1867-1958) and his collection of verses, Slezské písně (Silesian Songs), presented a problem because of their questionable depiction of Silesian identity, and the publication of the complete collection led to disputes in cultural policy. The Ostrava-based arts and politics periodical Červený květ (Red Flower), which repeatedly included debates about regionalism, began to be published in the mid-1950s. At the end of the decade, however, the Communist Party launched a campaign against parochialism (lokálpatriotismus), which was refl ected also in the condemnation of publications seeking to exonerate the poems and ideas of Óndra Łysohorsky (born Ervín Goj, 1905-1989), who during the war promoted the theory of a ''Lach nation.'' In the 1960s, the local authorities and fi gures of Opava again began to emphasize the role of their town as a regional centre. During the Prague Spring of 1968, there were calls for the restoration of Silesian self-government, but that remained more or less limited to the Opava region, and consequently some ''Silesian'' cultural initiatives from this period were of greater importance.
Physical exercise instruction sheets are difficult to understand. In general, considerable information is hidden in these types of instruction sheets, which also makes them difficult for machines to understand. Major missing information types include the source and destination location of a human movement. Here we present a Bayesian network to extract the implicit or missing information from typical exercise instruction sheets. We proposed two different kind of Bayesian networks which consists of three and four variables respectively. The network with three variable are designed to for single exercise instruction with single action or pose and the other one designed for single or multiple sentence with two actions or poses. The conditional probability table (CPT) is the backbone of the Bayesian network. At the start, the CPT is updated from our physical exercise instruction sheet corpus (PEISC). Keeping the Action and Bodypart fixed, we have developed our CPT using a unique approach, i.e., crowdsourcing, where we have developed a CPT update system using 13 different exercises consisting of 44 different exercise videos. Using this system based on the rating of a participant of the video the specific variable of that CPT is updated automatically in the Bayesian network. We also updated the Action variable, which consists of 14 different values (action verbs) using crowdsourcing with a human computation approach.
The main aim of the present investigation was to verify the effects of three overtraining (OT) protocols performed in downhill (OTR/down), uphill (OTR/up) and without inclination (OTR) on the protein levels of Akt (Ser473), AMPKα (Thr172), PGC-1α, plasma membrane GLUT-1 and GLUT-4 as well as on the glycogen contents in mice gastrocnemius. A trained (TR) protocol was used as positive control. Rodents were divided into naïve (N, sedentary mice), control (CT, sedentary mice submitted to the performance evaluations), TR, OTR/down, OTR/up and OTR groups. At the end of the experimental protocols, gastrocnemius samples were removed and used for immunoblotting analysis as well as for glycogen measurements. There was no significant difference between the experimental groups for the protein levels of pAkt (Ser473), pAMPKα (Thr172), PGC-1α, plasma membrane GLUT-1 and GLUT-4. However, the OTR/up protocol exhibited higher contents of glycogen compared to the CT and TR groups. In summary, the OTR/up group increased the gastrocnemius glycogen content without significant changes of pAkt (Ser473), pAMPKα (Thr172), PGC-1α, plasma membrane GLUT-1 and GLUT-4., G. P. Morais, A. Da Rocha, A. P. Pinto, L. Da C. Oliveira, L. G. De Vicente, G. N. Ferreira, E. C. De Freitas, A. S. R. Da Silva., and Seznam literatury
Polarografická metoda umožňuje studium řady fyzikálněchemických problémů. Jsou uvedeny příklady z oblasti výzkumu struktury fázového rozhraní elektroda/roztok, adsorpce na povrchu elektrody, elektrochemického fotoefektu, fázových přechodů povrchových filmů, přenosu elektronu na molekulární vzdálenosti a oscilačních elektrochemických systémů., Polarography is a suitable method for solving numerous problems of physical chemistry. Examples from the following fields are given: structure of electrode/solution interfaces, adsorption on electrode surface, electrochemical photo-effect, phase transition of surface films, electron transfer over molecular distances, and electrochemical oscillating systems., Lubomír Pospíšil., and Obsahuje bibliografii
In this paper, we develop computational procedures to approximate the spectral abscissa of the switched linear system via square coordinate transformations. First, we design iterative algorithms to obtain a sequence of the least μ1 measure. Second, it is shown that this sequence is convergent and its limit can be used to estimate the spectral abscissa. Moreover, the stopping condition of Algorithm 1 is also presented. Finally, an example is carried out to illustrate the effectiveness of the proposed method.
We present a lower and an upper bound for the second smallest eigenvalue of Laplacian matrices in terms of the averaged minimal cut of weighted graphs. This is used to obtain an upper bound for the real parts of the non-maximal eigenvalues of irreducible nonnegative matrices. The result can be applied to Markov chains.
For a graph property $\mathcal {P}$ and a graph $G$, we define the domination subdivision number with respect to the property $\mathcal {P}$ to be the minimum number of edges that must be subdivided (where each edge in $G$ can be subdivided at most once) in order to change the domination number with respect to the property $\mathcal {P}$. In this paper we obtain upper bounds in terms of maximum degree and orientable/non-orientable genus for the domination subdivision number with respect to an induced-hereditary property, total domination subdivision number, bondage number with respect to an induced-hereditary property, and Roman bondage number of a graph on topological surfaces.
It is one of the fundamental and challenging problems to determine the node numbers of hidden layers in neural networks. Various efforts have been made to study the relations between the approximation ability and the number of hidden nodes of some specific neural networks, such as single-hidden-layer and two-hiddenlayer feedforward neural networks with specific or conditional activation functions. However, for arbitrary feedforward neural networks, there are few theoretical results on such issues. This paper gives an upper bound on the node number of each hidden layer for the most general feedforward neural networks called multilayer perceptrons (MLP), from an algebraic point of view. First, we put forward the method of expansion linear spaces to investigate the algebraic structure and properties of the outputs of MLPs. Then it is proved that given k distinct training samples, for any MLP with k nodes in each hidden layer, if a certain optimization problem has solutions, the approximation error keeps invariant with adding nodes to hidden layers. Furthermore, it is shown that for any MLP whose activation function for the output layer is bounded on R, at most k hidden nodes in each hidden layer are needed to learn k training samples.
The paper deals with the existence of a quasi continuous selection of a multifunction for which upper inverse image of any open set with compact complement contains a set of the form $(G\setminus I)\cup J$, where $G$ is open and $I$, $J$ are from a given ideal. The methods are based on the properties of a minimal multifunction which is generated by a cluster process with respect to a system of subsets of the form $(G\setminus I)\cup J$.
Let $R$ be an integral domain with quotient field $K$ and $f(x)$ a polynomial of positive degree in $K[x]$. In this paper we develop a method for studying almost principal uppers to zero ideals. More precisely, we prove that uppers to zero divisorial ideals of the form $I = f(x)K[x] \cap R[x]$ are almost principal in the following two cases: – $J$, the ideal generated by the leading coefficients of $I$, satisfies $J^{-1} = R$. – $I^{-1}$ as the $R[x]$-submodule of $K(x)$ is of finite type. Furthermore we prove that for $I = f(x)K[x] \cap R[x]$ we have: – $I^{-1}\cap K[x]=(I:_{K(x)}I)$. – If there exists $p/q \in I^{-1}-K[x]$, then $(q,f)\neq 1$ in $K[x]$. If in addition $q$ is irreducible and $I$ is almost principal, then $I' = q(x)K[x] \cap R[x]$ is an almost principal upper to zero. Finally we show that a Schreier domain $R$ is a greatest common divisor domain if and only if every upper to zero in $R[x]$ contains a primitive polynomial.