نتایج جستجو برای: upward embedding

تعداد نتایج: 86962  

Journal: :Journal of Graph Algorithms and Applications 2011

Journal: :Electronic Colloquium on Computational Complexity (ECCC) 2006
Nutan Limaye Meena Mahajan Jayalal Sarma

We re-examine the complexity of evaluating monotone planar circuits MPCVP, with special attention to circuits with cylindrical embeddings. MPCVP is known to be in NC, and for the special case of upward stratified circuits, it is known to be in LogDCFL. We characterize cylindricality, which is stronger than planarity but strictly generalizes upward planarity, and make the characterization partia...

Journal: :bulletin of the iranian mathematical society 0
m.r. koushesh isfahan university of technology

‎for a given measure space $(x,{mathscr b},mu)$ we construct all measure spaces $(y,{mathscr c},lambda)$ in which $(x,{mathscr b},mu)$ is embeddable‎. ‎the construction is modeled on the ultrafilter construction of the stone--v{c}ech compactification of a completely regular topological space‎. ‎under certain conditions the construction simplifies‎. ‎examples are given when this simplification o...

Journal: :iranian journal of pathology 2008
r, salehi b. tabanifar e. asgarani m. faghihi t. allame

background and objective: formalin-fixed paraffin-embedded tissues are a valuable source of dna for molecular studies. we designed and optimized an efficient procedure for dna extraction from formalin-fixed paraffin embedded tissues. materials and methods: seventy three blocks of cervical paraffin-embedded tissues were investigated. dna was extracted using 45 minutes boiling in alkaline solutio...

2008
Martijn Pistorius

Consider the problem to explicitly calculate the law of the first passage time T (a) of a general Lévy process Z above a positive level a. In this paper it is shown that the law of T (a) can be approximated arbitrarily closely by the laws of T (a), the corresponding first passages time for X, where (X)n is a sequence of Lévy processes whose positive jumps follow a phase-type distribution. Subse...

Journal: :Multiple-Valued Logic and Soft Computing 2015
Jelena Colic Hajime Machida Jovanka Pantovic

Hyperoperations are mappings that assign a non-void subset of a set to each n-tuple of elements from the set. They present a fundamental notion for modeling non deterministic processes. Even though for each non deterministic automaton there is a language equivalent deterministic automaton, they do not have the same behavior. As behavior of concurrent processes took place in emerging fields of t...

2012
Garance Genicot Debraj Ray

This paper develops a mobility measure that combines desirable features of the relative and absolute approaches to measuring mobility. From the relative approach we borrow the idea that income growth accruing to the relatively poor is more to be valued than income growth to the relatively rich. From the absolute approach we take the idea that upward changes are to be valued, in and of themselve...

2011
John Derrick Eerke A. Boiten

Data refinement in a state-based language such as Z is defined using a relational model in terms of the behaviour of abstract programs. Downward and upward simulation conditions form a sound and jointly complete methodology to verify relational data refinements, which can be checked on an event-byevent basis rather than per trace. In models of concurrency, refinement is often defined in terms o...

2016
John Baldwin Will Boney

This paper addresses a number of fundamental problems in logic and the philosophy of mathematics by considering some more technical problems in model theory and set theory. The interplay between syntax and semantics is usually considered the hallmark of model theory. At first sight, Shelah’s notion of abstract elementary class shatters that icon. As in the beginnings of the modern theory of str...

The investigation presented in this paper is a novel method in question answering (QA) that enables a QA system to gain performance through reuse of information in the answer to one question to answer another related question. Our analysis shows that a pair of question in a general open domain QA can have embedding relation through their mentions of noun phrase expressions. We present methods f...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید