It has been previously demonstrated that Gi/o proteins are involved in ischemic preconditioning (IPC) in rabbits and dogs; however, there has been controversy as to the role of Gi/o proteins in IPC in in vivo rat infarct models. Therefore, the role of G proteins in the cardioprotective effect of IPC in a rat infarct model was reevaluated. Cardioprotection as indicated by infarct size (IS) as a ...

Rapid growth of technical developments has created huge challenges for microphone forensics a subcategory of audio forensic science, because of the availability of numerous digital recording devices and massive amount of recording data. Demand for fast and efficient methods to assure integrity and authenticity of information is becoming more and more important in criminal investigation nowadays...

We introduce the first index that can be built in o(n) time for a text of length n, and also queried in o(m) time for a pattern of length m. On a constant-size alphabet, for example, our index uses O(n log n) bits, is built in O(n/ log n) deterministic time, and finds the occ pattern occurrences in time O(m/ logn + √ logn log logn + occ), where ε > 0 is an arbitrarily small constant. As a compa...

Place/Transition (PT) Petri nets are one of the most widely used models of concurrency. However, they still lack, in our view, a satisfactory semantics: on the one hand the ‘token game’ is too intensional, even in its more abstract interpretations in terms of nonsequential processes and monoidal categories; on the other hand, Winskel’s basic unfolding construction, which provides a coreflection...

Tumorigenesis can arise from inappropriate activation of developmental genes in mature tissues. Here, we show that the developmental regulator Six1 is overexpressed in ovarian carcinoma cell lines (OCC) compared with normal ovarian surface epithelium. As observed in other cancers, Six1 overexpression in OCC leads to increased A-type cyclin expression and increased proliferation. In addition, Si...

We consider the problem of supporting several different path queries over a tree on n nodes, each having a weight drawn from a set of σ distinct values, where σ ≤ n. One query we support is the path median query, which asks for the median weight on a path between two given nodes. For this and the more general path selection query, we present a linear space data structure that answers queries in...

The dictionary matching is a task to find all occurrences of pattern strings in a set D (called a dictionary) on a text string T . The Aho-Corasick-automaton (AC-automaton) which is built on D is a fundamental data structure which enables us to solve the dictionary matching problem in O(d log σ) preprocessing time and O(n log σ + occ) matching time, where d is the total length of the patterns i...