نتایج جستجو برای: jumping method

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

Journal: :Math. Comput. 2006
Blaise Faugeras Jérôme Pousin Franck Fontvieille

A numerical scheme based on an operator splitting method and a dense output event location algorithm is proposed to integrate a diffusiondissolution/precipitation chemical initial-boundary value problem with jumping nonlinearities. The numerical analysis of the scheme is carried out and it is proved to be of order 2 in time. This global order estimate is illustrated numerically on a test case.

Journal: :The Journal of communicable diseases 2023

Journal: :Structures 2023

The floors of modern buildings are prone to excessive vibrations induced by human actions, especially when a group people perform rhythmic activities in coordinated manner. A reliable model for this load case, taking into account the experimentally observed effect, is thus essential serviceability assessment such structures. In paper, frequency-domain either single person or multiple individual...

2006
Vibhav Gogate Rina Dechter

The paper presents a method for generating solutions of a constraint satisfaction problem (CSP) uniformly at random. Our method relies on expressing the constraint network as a uniform probability distribution over its solutions and then sampling from the distribution using state-of-the-art probabilistic sampling schemes. To speed up the rate at which random solutions are generated, we augment ...

Journal: :Tourism Geographies 2013

2004

In a recent paper [1], Drs Selby and Miller described three methods of determining the fracture toughness (R), or equivalently, the fracture surface energy (23') for an epoxy resin. These methods are respectively (a) Berry's method, (b) Irwin-Kies equation and (c) Gurney's irreversible work area method. While the experimental data obtained from tapered double-cantilever beam (TDCB) specimens su...

2008
Steve Butler Nan Zang

An integer sequence a(n) is called a jump sequence if a(1) = 1 and 1 ≤ a(n) < n for n ≥ 2. Such a sequence has the property that ak(n) = a(a(· · · (a(n)) · · · )) goes to 1 in finitely many steps. We call the pattern (n, a(n), a2(n), . . . , al(n) = 1) a jumping pattern from n down to 1. In this paper we look at jumping sequences that are weight minimizing with respect to various weight functio...

Journal: :British Dental Journal 2009

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

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