We improve a recent result [Badr: Hyper-minimization inO(n). Int. J. Found. Comput. Sci. 20, 2009] for hyper-minimized nite automata. Namely, we present an O(n log n) algorithm that computes for a given deterministic nite automaton (dfa) an almostequivalent dfa that is as small as possible such an automaton is called hyper-minimal. Here two nite automata are almost-equivalent if and only if the...

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...