نتایج جستجو برای: complete non
تعداد نتایج: 1630523 فیلتر نتایج به سال:
simplification universal as a universal feature of translation means translated texts tend to use simpler language than original texts in the same language and it can be critically investigated through common concepts: type/token ratio, lexical density, and mean sentence length. although steps have been taken to test this hypothesis in various text types in different linguistic communities, in ...
The magnitude squared coherence (MSC) spectrum is an often used frequency-dependent measure for the linear dependency between two stationary processes, and the recent literature contain several contributions on how to form high-resolution data-dependent and adaptive MSC estimators, and on the efficient implementation of such estimators. In this work, we further this development with the present...
Missing The Forest to Count the Trees: Spanning Tree Enumeration in Complete and Non-Complete Graphs
Spanning trees have been studied extensively and have many practical applications. From astronomers using spanning trees to find quasar superstructures, to biomedical engineers detecting actin fibers in cell images tree enumeration remains an interesting problem. In this paper we examine a simple, practical, algebraic approach for the enumeration of spanning trees in complete and non-complete g...
Solid Pseudopapillary Tumor of the pancreas is a rare nonfunctioning tumor. It is considered a low-grade malignancy that is apparently curable with surgical complete excision in most instances. We present a case of solid pseudopapillary pancreatic tumor that represented a challenge to the radiologists. This case highlights its possible various appearances and the need to the radiologist to be f...
We establish the complexity of decision problems associated with the nonmonotonic modal logic S4. We prove that the problem of existence of an S4-expansion for a given set A of premises is P 2-complete. Similarly, we show that for a given formula ' and a set A of premises, it is P 2-complete to decide whether ' belongs to at least one S4-expansion for A, and it is P 2-complete to decide whether...
In this paper we introduce a game semantics for System P, one of the most studied axiomatic systems for non-monotonic reasoning, conditional logic and belief revision. We prove soundness and completeness of the game semantics with respect to the rules of System P, and show that an inference is valid with respect to the game semantics if and only if it is valid with respect to the standard order...
In this paper we introduce a game semantics for System P, one of the most studied axiomatic systems for non-monotonic reasoning, conditional logic and belief revision. We prove soundness and completeness of the game semantics with respect to the rules of System P, and show that an inference is valid with respect to the game semantics if and only if it is valid with respect to the standard order...
a male patient with acute renal failure (arf) due to large b-cell non-hodgkin lymphoma infiltration of kidney is presented. the diagnosis was suspected because of coincidence of arf and tumor lysis syndrome non-responsive to conservative renal therapies. a renal biopsy confirmed diagnosis and appropriate chemotherapy led to complete improvement of renal function.
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید