PURPOSE To investigate the findings of infrared fundus autofluorescence in eyes with central serous chorioretinopathy (CSC). METHODS This study was an observational follow-up of 83 eyes of 80 consecutive patients with CSC recruited from a hospital referral practice. Infrared autofluorescence (IR-AF) findings and those of other clinical studies, including short-wave autofluorescence (SW-AF), f...

Rat exposure to 60% oxygen (O(2)) for 7 days (hyper-60) or to >95% O(2) for 2 days followed by 24 h in room air (hyper-95R) confers susceptibility or tolerance, respectively, of the otherwise lethal effects of subsequent exposure to 100% O(2). The objective of this study was to determine if lung retention of the radiopharmaceutical agent technetium-labeled-hexamethylpropyleneamine oxime (HMPAO)...

This paper reports the design, implementation, and application of a new interface for augmenting performance and play on the low flying trapeze. Sensors were used to gauge the motion of the trapeze and performer, mapping the data to control interactive sound and animation. The interface was tested in the context of a new multimedia composition entitled “Autumn”.

Hyper-heuristics are emerging methodologies that perform a search over the space of heuristics to solve difficult computational optimization problems. There are two main types of hyper-heuristics: selective and generative hyper-heuristics. An online selective hyper-heuristic framework manages a set of low level heuristics and aims to choose the best one at any given time using a performance mea...

‎let $g=(v(g),e(g))$ be a simple connected graph with vertex set $v(g)$ and edge‎ ‎set $e(g)$‎. ‎the (first) edge-hyper wiener index of the graph $g$ is defined as‎: ‎$$ww_{e}(g)=sum_{{f,g}subseteq e(g)}(d_{e}(f,g|g)+d_{e}^{2}(f,g|g))=frac{1}{2}sum_{fin e(g)}(d_{e}(f|g)+d^{2}_{e}(f|g)),$$‎ ‎where $d_{e}(f,g|g)$ denotes the distance between the edges $f=xy$ and $g=uv$ in $e(g)$ and $d_{e}(f|g)=s...

In this paper we present two hyper-heuristics developed for the Cross-Domain Heuristic Search Challenge. Hyper-heuristics solve hard combinatorial problems by guiding low level heuristics, rather than by manipulating problem solutions directly. Two hyper-heuristics are presented: Five Phase Approach and Genetic Hive. Development paths of the algorithms and testing methods are outlined. Performa...

The basic idea of hyper-control is to use a multimedia document to control other application systems[Chen 96]. In the original Command Processor pattern, the fixed execution sequence of computation codes and dialog codes hinders an application from supporting the hyper-control mechanism. Based on an extension of this pattern and other related patterns, we have developed a medical image system D...

Recall that a (hyper)graph is d-degenerate if every of its nonempty subgraphs has a vertex of degree at most d. Every d-degenerate (hyper)graph is (easily) (d + 1)colorable. A (hyper)graph is almost d-degenerate if it is not d-degenerate, but every its proper subgraph is d-degenerate. In particular, if G is almost (k − 1)-degenerate, then after deleting any edge it is k-colorable. For k ≥ 2, we...