990 resultados para Vienna (Austria)
Resumo:
Acknowledgements We are grateful to Ke-Xin Chen, Song Tan and Jing Cao (Wenzhou University) for care of the animals. We thank Dr. Teresa G. Valencak (Research Institute of Wildlife Ecology, University of Veterinary Medicine Vienna, Austria) for her assistance with the body temperature measurements using the thermo-sensitive passive transponders. We thank Peter Thomson (University of Aberdeen) for his technical assistance with the isotope analysis for the DLW measurements. This work was supported by grant (no. 31270458) from the National Natural Science Foundation of China, grant (pd2013374) from Zhejiang province, and grants (no. 14SK51A, 14SK52A) from Wenzhou University.
Resumo:
Various manganese nodules donated to the Scripps Institution of Oceanography from the Hakurei Maru Cruise GH77-1, January-March, 1977, in the Central Pacific Basin have been analysed for their lithium content by J. Korkish from the Institute of Analytical Chemistry, Analysis of Nuclear Raw Materials Division, University of Vienna, Austria. The author has used a Perkin-Elmer atomic-absorption spectrometer 303 after speration by dissolution in hydrochloric acid.
Resumo:
Taxonomies have gained a broad usage in a variety of fields due to their extensibility, as well as their use for classification and knowledge organization. Of particular interest is the digital document management domain in which their hierarchical structure can be effectively employed in order to organize documents into content-specific categories. Common or standard taxonomies (e.g., the ACM Computing Classification System) contain concepts that are too general for conceptualizing specific knowledge domains. In this paper we introduce a novel automated approach that combines sub-trees from general taxonomies with specialized seed taxonomies by using specific Natural Language Processing techniques. We provide an extensible and generalizable model for combining taxonomies in the practical context of two very large European research projects. Because the manual combination of taxonomies by domain experts is a highly time consuming task, our model measures the semantic relatedness between concept labels in CBOW or skip-gram Word2vec vector spaces. A preliminary quantitative evaluation of the resulting taxonomies is performed after applying a greedy algorithm with incremental thresholds used for matching and combining topic labels.
Resumo:
Abstract not available
Resumo:
There are few professions in which visual acuity is as important as it is to radiologists. The diagnostic decision making process is composed of a number of events (detection or observation, interpretation and reporting), where the detection phase is subject to a number of physical and psychological phenomena that are critical to the process. Visual acuity is one phenomenon that has often been overlooked, and there is very little research assessing the impact of reduced visual acuity on diagnostic performance. The aim of this study was to investigate the impact of reduced visual acuity on an observer’s ability to detect simulated nodules in an anthropomorphic chest phantom.
Resumo:
Background - For dose reduction actions, the principle of “image quality as good as possible” to “image quality as good as needed” requires to know whether the physical measures and visual image quality relate. Visual evaluation and objective physical measures of image quality can appear to be different. If there is no noticeable effect on the visual image quality with a low dose but there is a objective physical measure impact, then the overall dose may be reduced without compromising the diagnostic image quality. Low dose imaging can be used for certain types of observations, e.g. thoracic scoliosis, control after metal implantation for osteosynthesis, reviewing pneumonia and tuberculosis. Aim of the study - To determine whether physical measures of noise predict visual (clinical) image quality at low dose levels.
Resumo:
Protective factors are neglected in risk assessment in adult psychiatric and criminal justice populations. This review investigated the predictive efficacy of selected tools that assess protective factors. Five databases were searched using comprehensive terms for records up to June 2014, resulting in 17 studies (n = 2,198). Results were combined in a multilevel meta-analysis using the R (R Core Team, R: A Language and Environment for Statistical Computing, Vienna, Austria: R Foundation for Statistical Computing, 2015) metafor package (Viechtbauer, Journal of Statistical Software, 2010, 36, 1). Prediction of outcomes was poor relative to a reference category of violent offending, with the exception of prediction of discharge from secure units. There were no significant differences between the predictive efficacy of risk scales, protective scales, and summary judgments. Protective factor assessment may be clinically useful, but more development is required. Claims that use of these tools is therapeutically beneficial require testing.
Resumo:
This paper presents our work on analysing the high level search within a graph based hyperheuristic. The graph based hyperheuristic solves the problem at a higher level by searching through permutations of graph heuristics rather than the actual solutions. The heuristic permutations are then used to construct the solutions. Variable Neighborhood Search, Steepest Descent, Iterated Local Search and Tabu Search are compared. An analysis of their performance within the high level search space of heuristics is also carried out. Experimental results on benchmark exam timetabling problems demonstrate the simplicity and efficiency of this hyperheuristic approach. They also indicate that the choice of the high level search methodology is not crucial and the high level search should explore the heuristic search space as widely as possible within a limited searching time. This simple and general graph based hyperheuristic may be applied to a range of timetabling and optimisation problems.
Resumo:
This paper presents our work on analysing the high level search within a graph based hyperheuristic. The graph based hyperheuristic solves the problem at a higher level by searching through permutations of graph heuristics rather than the actual solutions. The heuristic permutations are then used to construct the solutions. Variable Neighborhood Search, Steepest Descent, Iterated Local Search and Tabu Search are compared. An analysis of their performance within the high level search space of heuristics is also carried out. Experimental results on benchmark exam timetabling problems demonstrate the simplicity and efficiency of this hyperheuristic approach. They also indicate that the choice of the high level search methodology is not crucial and the high level search should explore the heuristic search space as widely as possible within a limited searching time. This simple and general graph based hyperheuristic may be applied to a range of timetabling and optimisation problems.
Resumo:
Abstract not available
Resumo:
In the context of active control of rotating machines, standard optimal controller methods enable a trade-off to be made between (weighted) mean-square vibrations and (weighted) mean-square currents injected into magnetic bearings. One shortcoming of such controllers is that no concern is devoted to the voltages required. In practice, the voltage available imposes a strict limitation on the maximum possible rate of change of control force (force slew rate). This paper removes the aforementioned existing shortcomings of traditional optimal control.