Directed flow loops are highly undesirable because they are associated with wastage of energy for maintaining them and entail big losses to the world economy. It is shown that directed flow loops may appear in networks even if the dispatched commodity does not physically travel along a closed contour. Consequently, a theorem giving the necessary and sufficient condition of a directed flow loop ...

When people learn that I study lethal injection, they are usually curious to know more (or at least they are polite enough to ask questions). Interestingly, the question that arises most often— from lawyers, law students, and laypeople—is why states behave as they do. In the wake of botched executions and ample evidence of lethal injection‘s dangers, why do states fail to address their executio...

Word form segmentation abilities emerge during the first year of life, and it has been proposed that infants initially rely on two types of cues to extract words from fluent speech: Transitional Probabilities (TPs) and rhythmic units. The main goal of the present study was to use the behavioral method of the Headturn Preference Procedure (HPP) to investigate again rhythmic segmentation of sylla...

Here we show the existence of a smooth complex projective curve Z P 3 of degree d and genus g such that TP 3 jZ is stable for all integers d; g such that (roughly) d 2 =9 < g < (d?1) 2 =8. Following a construction of Gruson and Peskine we will nd such a curve Z on an integral rational quartic surface with a double line. We will use in an essential way also the main properties of stable vector b...

Based on Johnson's (1994) across-the-board (ATB) movement analysis of Gapping, Agbayani and Zoerner (2004) argue that Gapping involves the application of sideward movement of the main verb out of coordinate structures. In this paper, I show that the verb movement analyses of Gapping are problematic. Ultimately, I maintain that Gapping is a discourse-oriented variant of TP ellipsis. More precise...

We consider the problem of finding shortest non-crossing thick paths in a polygonal domain, where a thick path is a Minkowski sum of a usual path and unit disk. We show that in a simple polygon, K shortest paths may be found in optimal O(K(n + K)) time and O(n + K) space. For polygons with holes we show that the problem becomes (weakly) NP-hard even for the case K = 2 and even when the paths ar...

A new test sequence generation method is proposed for testing the conformance of a protocol implementation to its data portion modeled by an Extended Finite State Machine (EFSM), which is represented by a Data Flow Digraph. All-Use and IO-dfchain are two important criteria for selecting paths from the Data Flow Digraph to generate a test sequence which traces the data flow property, but it is a...

Fractured-rock aquifers display spatially and temporally variable hydraulic conductivity generally attributed to variable fracture intensity and connectivity. Empirical evidence suggests fracture aperture and hydraulic conductivity are sensitive to in situ stress. This study investigates the sensitivity of fractured-rock hydraulic conductivity, groundwater flow paths, and advectiondominated tra...

The present paper gives an algorithm that finds simultaneously the shortest paths between many pairs of nodes in a given network. In the book by Berge, the values of shortest paths between many pairs of nodes are found. Here, we use a special matrix multiplication technique to find the actual arcs that are used to form the shortest paths. In a network with n nodes, log [n-l] special matrix mult...

This abstract is submitted in support of the INFORMS Telecommunications Dissertation Award [1]. Internet backbone networks are evolving to a layered architecture where IP with Multi-Protocol Label Switching (MPLS) network is on top of Wavelength Division Multiplexing (WDM) optical networks. Providing survivability in such networks presents several challenging problems. The requirements for rapi...