Number of results to display per page
Search Results
11002. Transparentní keramika - požehnání pro společenství laserových vědců
- Creator:
- David, Samuel Paul, Navrátil, Petr, Hanuš, Martin, Jambunathan, Venkatesan, Divoký, Martin, Lucianetti, Antonio, and Mocek, Tomáš
- Format:
- print, bez média, and svazek
- Type:
- model:article and TEXT
- Subject:
- fyzika, lasery, physics, lasers, 6, and 53
- Language:
- Czech and English
- Description:
- Transparentní keramika se v laserové technice využívá jako matrice aktivních laserových prostředí vysokovýkonových laserů, kde se začala prosazovat od začátku milénia. Díky svým jedinečným vlastnostem je atraktivní alternativou monokrystalů a skel, kdy nachází využití v široké škále oborů a aplikací zahrnujících optiku, vojenství, medicínu, detektory záření a další., Transparent ceramics have been used as matrices for laser gain media of high power lasers since the beginning of this millennium. Thanks to its unique qualities it has become an attractive alternative to glasses and single crystals, finding applications in the field of optics, defence, medical facilities, radiation detectors and many others., Samuel Paul David, Petr Navrátil, Martin Hanuš, Venkatesan Jambunathan, Martin Divoký, Antonio Lucianetti, Tomáš Mocek., and Obsahuje bibliografické odkazy
- Rights:
- http://creativecommons.org/licenses/by-nc-sa/4.0/ and policy:public
11003. Transport safety, neurobehavioral disorders and medical fitness standards
- Creator:
- Tuček, Milan
- Format:
- bez média and svazek
- Type:
- model:article and TEXT
- Subject:
- Transport, railway, safety, sleepeness, fatigue, neurobehavioral disorders, alcohol, drugs, and fitness standards
- Language:
- English
- Description:
- The effects of sleepiness, sleep loss and fatigue have been the focus of literally hundreds of studies dating back to 1896. Sleep disorders, like any other medical condition potentially affecting the safe performance of essential job functions or the safety of co-workers or the general public, require an individual assessment of the employee diagnosed with the condition to determine medical fitness for service and the necessity of any appropriate reasonable accommodations. The medical fitness assessment is a tool for maximum possible operational safety and the health and safety of all personnel in the railway industry. The article describes relevant international medical fitness standards for railway staff with special rules recommended for mental disorders, disorders of the central nervous system and use of alcohol, drugs, and other psychotropic substances.
- Rights:
- http://creativecommons.org/publicdomain/mark/1.0/ and policy:public
11004. Transverse vibration analysis of a prestressed thin circular plate in contact with an acoustic cavity
- Creator:
- Gorman, Daniel G., Lee, Chee K., Craighead, Ian A., and Horáček, Jaromír
- Format:
- bez média and svazek
- Type:
- model:article and TEXT
- Subject:
- vibrations, vibro-acoustic interaction, and structural / acoustic
- Language:
- English
- Description:
- This paper describes the free transverse vibration analysis of a thin circular plate, subjected to in plane stretching, whilst in interaction with a cylindrical acoustic cavity. An analysis is performed which combines the equations describing the plate and the acoustic cavity to form a matrix equation which, when solved, produces the natural frequencies (latent roots) of the coupled system and associated latent vectors which describe the mode shape coefficients of the plate. After assessing the numerical convergence of the method, results are compared with those from a commercial finite element code (ANSYS). The results analysis is then extended to investigate the effect of stressing upon the free vibration of the coupled system. and Obsahuje seznam literatury
- Rights:
- http://creativecommons.org/licenses/by-nc-sa/4.0/ and policy:public
11005. Travel groupoids
- Creator:
- Nebeský, Ladislav
- Format:
- bez média and svazek
- Type:
- model:article and TEXT
- Subject:
- travel groupoid, graph, path, and geodetic graph
- Language:
- English
- Description:
- In this paper, by a travel groupoid is meant an ordered pair $(V, *)$ such that $V$ is a nonempty set and $*$ is a binary operation on $V$ satisfying the following two conditions for all $u, v \in V$: \[ (u * v) * u = u; \text{ if }(u * v ) * v = u, \text{ then } u = v. \] Let $(V, *)$ be a travel groupoid. It is easy to show that if $x, y \in V$, then $x * y = y$ if and only if $y * x = x$. We say that $(V, *)$ is on a (finite or infinite) graph $G$ if $V(G) = V$ and \[ E(G) = \lbrace \lbrace u, v\rbrace \: u, v \in V \text{ and } u \ne u * v = v\rbrace . \] Clearly, every travel groupoid is on exactly one graph. In this paper, some properties of travel groupoids on graphs are studied.
- Rights:
- http://creativecommons.org/publicdomain/mark/1.0/ and policy:public
11006. Travel groupoids on infinite graphs
- Creator:
- Cho, Jung Rae, Park, Jeongmi, and Sano, Yoshio
- Format:
- bez média and svazek
- Type:
- model:article and TEXT
- Subject:
- travel groupoid, geodetic graph, and infinite graph
- Language:
- English
- Description:
- The notion of travel groupoids was introduced by L. Nebeský in 2006 in connection with a study on geodetic graphs. A travel groupoid is a pair of a set $V$ and a binary operation $*$ on $V$ satisfying two axioms. We can associate a graph with a travel groupoid. We say that a graph $G$ has a travel groupoid if the graph associated with the travel groupoid is equal to $G$. Nebeský gave a characterization of finite graphs having a travel groupoid. In this paper, we study travel groupoids on infinite graphs. We answer a question posed by Nebeský, and we also give a characterization of infinite graphs having a travel groupoid.
- Rights:
- http://creativecommons.org/publicdomain/mark/1.0/ and policy:public
11007. Treatment of hypertriglyceridemia: a review of current options
- Creator:
- Michal Vrablík and Richard Češka
- Format:
- print, bez média, and svazek
- Type:
- article, články, model:article, and TEXT
- Subject:
- Fyziologie člověka a srovnávací fyziologie, dietní jídla, statiny, omega-3 mastné kyseliny, diet, statins, omega-3 fatty acids, triglycerides, fibrates, ezetimibe, niacin, mipomersen, lomitapide, 14, and 612
- Language:
- English
- Description:
- Hypertriglyceridemia is an important marker of increased levels of highly atherogenic rem nant -like particles. The importance of lowering plasma levels of triglycerides (TG) has been called into question many times, but currently it is considered an integral part of residual cardiovascular risk reduction strategies. Lifestyle changes (improved diet and increased physical activity) are effective TG lowering measures. Pharmacological treatment usually starts with statins, although associated TG reductions are typically modest. Fibrates are currently the drugs of choice for hyperTG, frequently in c ombination with statins. Niacin and omega -3 fatty acids improve control of triglyceride levels when the above measures are inadequately effective. Some novel therapies including anti- sense oligonucleotides and inhibitors of microsomal triglyceride transfer protein have shown significant TG lowering efficacy. The current approach to the management of hypertriglyceridemia is based on lifestyle changes and, usually, drug combinations (statin and fibrate and/or omega -3 fatty acids or niacin)., M. Vrablík, R. Češka., and Obsahuje bibliografii
- Rights:
- http://creativecommons.org/publicdomain/mark/1.0/ and policy:public
11008. Tree and local computations in a cross-entropy minimization problem with marginal constraints
- Creator:
- Malvestuto, Francesco M.
- Format:
- bez média and svazek
- Type:
- model:article and TEXT
- Subject:
- cross-entropy, acrylic hypergraph, connection tree, junction tree, probabilistic database, and relation database
- Language:
- English
- Description:
- In probability theory, Bayesian statistics, artificial intelligence and database theory the minimum cross-entropy principle is often used to estimate a distribution with a given set P of marginal distributions under the proportionality assumption with respect to a given "prior'' distribution q. Such an estimation problem admits a solution if and only if there exists an extension of P that is dominated by q. In this paper we consider the case that q is not given explicitly, but is specified as the maximum-entropy extension of an auxiliary set Q of distributions. There are three problems that naturally arise: (1) the existence of an extension of a distribution set (such as P and Q), (2) the existence of an extension of P that is dominated by the maximum entropy extension of Q, (3) the numeric computation of the minimum cross-entropy extension of P with respect to the maximum entropy extension of Q. In the spirit of a divide-and-conquer approach, we prove that, for each of the three above-mentioned problems, the global solution can be easily obtained by combining the solutions to subproblems defined at node level of a suitable tree.
- Rights:
- http://creativecommons.org/publicdomain/mark/1.0/ and policy:public
11009. Tree compression pushdown automaton
- Creator:
- Poliak, Martin, Janoušek, Jan, and Bořivoj
- Format:
- bez média and svazek
- Type:
- model:article and TEXT
- Subject:
- trees, pushdown automata, compression, indexing trees, and arbology
- Language:
- English
- Description:
- A new kind of a deterministic pushdown automaton, called a \emph{Tree Compression Automaton}, is presented. The tree compression automaton represents a complete compressed index of a set of trees for subtrees and accepts all subtrees of given trees. The algorithm for constructing our pushdown automaton is incremental. For a single tree with n nodes, the automaton has at most n+1 states, its transition function cardinality is at most 4n and there are 2n+1 pushdown store symbols. If hashing is used for storing automaton's transitions, thus removing a factor of logn, the construction of the automaton takes linear time and space with respect to the length n of the input tree(s). Our pushdown automaton construction can also be used for finding all subtree repeats without augmenting the overall complexity.
- Rights:
- http://creativecommons.org/publicdomain/mark/1.0/ and policy:public
11010. Tree pattern matching from regular tree expressions
- Creator:
- Belabbaci, Ahlem, Cherroun, Hadda, Cleophas, Loek, and Ziadi, Djelloul
- Format:
- bez média and svazek
- Type:
- model:article and TEXT
- Subject:
- tree automata, Thompson Tree automata, regular tree expressions, and tree pattern matching
- Language:
- English
- Description:
- In this work we deal with tree pattern matching over ranked trees, where the pattern set to be matched against is defined by a regular tree expression. We present a new method that uses a tree automaton constructed inductively from a regular tree expression. First we construct a special tree automaton for the regular tree expression of the pattern E, which is somehow a generalization of Thompson automaton for strings. Then we run the constructed automaton on the subject tree t. The pattern matching algorithm requires an O(|t||E|) time complexity, where |t| is the number of nodes of t and |E| is the size of the regular tree expression E. The novelty of this contribution besides the low time complexity is that the set of patterns can be infinite, since we use regular tree expressions to represent patterns.
- Rights:
- http://creativecommons.org/publicdomain/mark/1.0/ and policy:public