Plumbagin, a hydroxy 1,4-naphthoquinone compound from plant metabolites, exhibits anticancer, antibacterial, and antifungal activities via modulating various signaling molecules. However, its effects on vascular functions are rarely studied except in pulmonary and coronary arteries where NADPH oxidase (NOX) inhibition was suggested as a mechanism. Here we investigate the effects of plumbagin on...

Using multi-fractal detrended fluctuation analysis (MF-DFA), the scaling features of wind speed time series (WSTS) could be explored. In this paper, we discuss the influence of sub-daily variation, which is a natural feature of wind, in MF-DFA of WSTS. First, the choice of the lower bound of the segment length, a significant parameter of MF-DFA, was studied. The results of expanding the lower b...

An alternative 24-h statistical hurricane intensity model is presented and verified for 13 hurricanes during the 2004–05 seasons. The model uses a new method involving a discriminant function analysis (DFA) to select from a collection of multiple regression equations. These equations were developed to predict the future 24-h wind speed increase and the 24-h pressure drop that were constructed f...

The aim of this study was to investigate the origins of the lateral circumflex femoral artery (LCFA) in the Turkish population. For this purpose, we investigated 110 inguinal regions of 56 cadavers between 1997 and 2007. The LCFA was found to be branched from the deep femoral artery (DFA) in 85 (77.3%) cases and from the femoral artery (FA) in 21 (19.1%) cases. In two (1.8%) cases the ascending...

We evaluated the predictive power of two classification techniques, one parametric !/ discriminant function analysis (DFA) and the other non-parametric !/ classification and regression tree analysis (CART), in order to provide a non-subjective quantitative method of determining age class in Vancouver Island marmots (Marmota vancouverensis ) and hoary marmots (Marmota caligata ). For both techni...

Given a regular expression R and a string T the regular expression matching problem is to determine if T matches any string in the language generated by R. The best known solution to the problem uses linear space and O ( nm log logn log3/2 n +n+m ) time in the worst-case [2], where m and n are the lengths of R and T , respectively. A common misconception is that we can solve the problem efficie...

Recently, a characterization of the class of nondeterministic finite automata (NFAs) for which determinization results in a minimal deterministic finite automaton (DFA), was given in [2]. We present a similar result for the case of symmetric difference NFAs. Also, we show that determinization of any minimal symmetric difference NFA produces a minimal DFA.

We expand on recent work extending the semantic automata model of quantifier verification to iteration. We demonstrate a simple and intuitive method to construct a minimal iteration DFA from two DFA recognizing monadic regular quantifier languages and prove that deterministic CFL are also closed under quantifier iteration. We also touch upon the relation between computational results and lingui...

3 Finite Automata 11 3.1 Deterministic finite automata . . . . . . . . . . . . . . . . . . . . 11 3.1.1 What is a DFA? . . . . . . . . . . . . . . . . . . . . . . . 11 3.1.2 The language of a DFA . . . . . . . . . . . . . . . . . . . 13 3.2 Nondeterministic finite automata . . . . . . . . . . . . . . . . . . 14 3.2.1 What is an NFA? . . . . . . . . . . . . . . . . . . . . . . . 14 3.2.2 The lan...