Rrecise analysis of the orbit of minor planet (1221) Amor, based on all observations made In 1932-1980, shows that in 1956 there was an unexplained event in the motion of the asteroid. Possible interpretations of that fact as well as peculiarities in the long-term motion of Amor in 1650-2170 are discussed. The ephemeris of Amor for 1988 is presented.
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.
To fulfill the requirements on the laser ranging systems, the soft/hardware package of the Helwan station was significantly modified in period 1982-84. The max. ranging reprate was increased up to 5 pps. The mount pointing accuracy was increased implementing the mechanical inaccuracies software model. The automatical comparison of the time base to the Loran C signal was put into operation.
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
Particles as an inflexible and synsemantic word class have already become a theme of many individual studies. According to the general definition particle indicates a relation of the speaker to the statement, he/she expresses modality of the sentence or emphasizes constituent of a/the sentence. Some of the particles have the validity of sentence, e. g. Ano. Nikoli. Zajisté. So called proper particles cannot stand in the function of another word class: ať, kéž. On the contrary, improper particles can be (according with coocurence) another word class, too: jistě, asi, prý. Goal of this paper is to point in which contexts the particle bohužel, although it is a non-sentence expression, can gain the character of sentence equivalent and which functions its synonyms and antonyms have.
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.
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.