نتایج جستجو برای: finitedi erence method

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

Journal: :Journal of universal mathematics 2021

In this paper, the new set di§erence is deÖned between interval- ued intuitionistic fuzzy sets (IVIFSs).A di§erent perspective reduced to formal IVIFSs. This difference IVIFSs introduced by using : operation. Instead of comparing operator with all other operations, operation which defined \ used. Some fundamentel properties are provided and not on examined whether satisfy or alpha-operation. By...

1992
Tracy Larrabee

This article describes the Boolean satis ability method for generating test patterns for single stuck at faults in combinational circuits This new method generates test patterns in two steps First it constructs a formula expressing the Boolean di erence between the unfaulted and faulted circuits Second it applies a Boolean satis ability algorithm to the resulting formula This approach di ers fr...

2012
Qinquan Gao Daniel Philip Eddie Edwards

Prostate segmentation facilitates prostate cancer detection and can help to diagnose the pathological stage of disease. Segmented anatomical models may also help to improve the outcome of robotic-aided laparoscopic prostatectomy (RALP) by augmented reality image guidance. In this paper, we present a fully automated segmentation pipeline for multi-center and multi-vendor MRI prostate segmentatio...

2011
Rebekka Christopoulou Je rey Han Ahmed Jaber Dean R. Lillard

For lung cancer, the Peto et al. method involves approximating national non-smoker death rates by the death rates of a reference population of non-smokers. Lung cancer attributable mortality in a given country is thus calculated as the di erence between total national death rates and the respective death rates in the reference population. For other smoking-related diseases, we calculate the pro...

2006
Massimo Narizzano Luca Pulina Armando Tacchella

Empirical scoring is the most common ranking method in automated reasoning systems competitions. Statistical testing can be used to validate the results of scoring, since the null hypothesis of equal performances is tested against the alternative hypothesis of signi cant di erence in performances using a precise mathematical formulation. This paper evaluates the merits of statistical testing as...

2001
H. C. Yee

An improved high order nite di erence method for lowMach number computational aeroacoustics (CAA) is described. The improvements involve the conditioning of the Euler equations to minimize numerical cancellation errors, and the use of a stable non-dissipative sixth-order central spatial interior scheme and a third-order boundary scheme. Spurious high frequency oscillations are damped by a third...

Journal: :Math. Meth. of OR 1998
Jesús Mario Bilbao

We study a cooperation structure in which the feasible coalitions are those belonging to a partition closure system. First, we develop the relation between the dividends of Harsanyi in the restricted game and the worth function in the original game. Next, we obtain an method for computing the Shapley and Banzhaf values of the closure-restricted games using the dividends formula. Finally, we ana...

2001
Bernhard Müller H. C. Yee

An improved high order nite di erence method for low Mach number computational aeroacoustics (CAA) is described. The improvements involve the conditioning of the Euler equations to minimize numerical cancellation errors, and the use of a stable non-dissipative sixth-order central spatial interior scheme and a thirdorder boundary scheme. Spurious high frequency oscillations are damped by a third...

1996
D. B. Skillicorn

We present a tree di erence algorithm with expected sequential execution timeO(n log log n) and expected parallel execution time of O(log n), for trees of size n. The algorithm assumes unique labels and permits operations only on leaves and frontier subtrees. Despite these limitations, it can be useful in the analysis of structured text. 1 Applications of Tree Di erence In this paper we describ...

1999
Justin A. Boyan

TD( ) is a popular family of algorithms for approximate policy evaluation in large MDPs. TD( ) works by incrementally updating the value function after each observed transition. It has two major drawbacks: it makes ine cient use of data, and it requires the user to manually tune a stepsize schedule for good performance. For the case of linear value function approximations and = 0, the Least-Squ...

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

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