Gating properties of Na(+) channels are the critical determinants for the state-dependent block by class I antiarrhythmic drugs; however, recent site-directed mutagenesis studies have shown that the Na(+) channel selectivity filter region controls drug access to and dissociation from the binding site. To validate these observations, we have exploited a naturally occurring cardiac Na(+) channel ...

Regular path queries are the building block of almost any mechanism for querying semistructured data. Despite the fact that the main applications of such data are distributed, there are only few works dealing with distributed evaluation of regular path queries. In this paper we present a message-efficient and truly distributed algorithm for computing the answer to regular path queries in a mult...

Originally designed to improve the efficiency of packets forwarding, MPLS provides support for Traffic Engineering and network resilience. Constrained-based path computation is a key building block for Traffic Engineering in MPLS networks, since it allows to set-up LSPs along paths that satisfy QoS constraints. This paper deals with two distinct categories of path computation algorithms: on-lin...

This paper focuses on evaluation of the effectiveness of optimization at various layers of the IO path, such as the file system, the device driver scheduler, and the disk drive itself. IO performance is enhanced via effective block allocation at the file system, request merging and reordering at the device driver, and additional complex request reordering at the disk drive. Our measurements sho...

For each admissible v, we exhibit a path design P (v, 4, 1) with a spanning set of minimum cardinality and a P (v, 4, 1) with a scattering set of maximum

Recently, Wong [1] pointed out that Yan and Chang’s [2] linear-time algorithm for the path-partition problem for block graphs is not correct, by giving the following example. Suppose G is the graph consisting of a vertex w and a set of triangles {xi, yi, zi} such that each xi is adjacent to w for 1 i k, where k 3. Then p(G) = k − 1, but Yan and Chang’s algorithm gives p(G)= 1. He also traced th...

Let C be a finite connected graph for which there is a countable universal C-free graph, and whose tree of blocks is a path. Then the blocks of C are complete. This generalizes a result of Füredi and Komjáth, and fits naturally into a set of conjectures regarding the existence of countable C-free graphs, with C an arbitrary finite connected graph.

A new resampling procedure, the continuous-path block bootstrap, is proposed in the context of testing for integrated (unit root) time series. The continuous-path block bootstrap (CBB) is a nonparametric procedure that successfully generates unit root integrated pseudo time series retaining the important characteristics of the data, e.g., the dependence structure of the stationary process drivi...

The boundaries between block and convolutional codes have become diffused after recent advances in the understanding of the trellis structure of block codes and the tail-biting structure of some convolutional codes. Therefore, decoding algorithms traditionally proposed for decoding convolutional codes have been applied for decoding certain classes of block codes. This paper presents the decodin...

This paper is an introduction to the problem of Critical Path determination in the context of Timing Veriication. After correct logic veriication, timing is the next most important concern to be addressed by designers. The speed of a circuit is related to the length of the longest path through which a signal can travel, also known as the longest true path or critical path of the circuit. This p...