نتایج جستجو برای: in split
تعداد نتایج: 16983387 فیلتر نتایج به سال:
in this paper, two new hamilton operators are defined and the algebra of dual split quaternions isdeveloped using these operators. it is shown that finite screw motions in minkowski 3-space can be expressedby dual-number ( 3×3 ) matrices in dual lorentzian space. moreover, by means of hamilton operators, screwmotion is obtained in 3-dimensional minkowski space 3r1
In this paper, a plasmonic filter made of a split ring, two U-shaped structures and two straight waveguides is designed and investigated. In the proposed structure, the split ring and U-shaped structures are situated between straight waveguides. Simulations are done based on FDTD method. Split ring, U-shaped structures and straight waveguides are made of air in the silver background. In the pro...
Ultrasound of 2 MHz frequency and 1.2 W/cm(2) acoustic intensity was applied to examine the effect of sonication on recombinant tissue-type plasminogen activator (rt-PA)-induced thrombolysis as well as on the distribution of plasminogen and t-PA within whole blood clots in vitro. Thrombolysis was evaluated quantitatively by measuring clot weight reduction and the level of fibrin degradation pro...
The split-radix FFT computes a size-n complex DFT, when n is a large power of 2, using just 4n lgn−6n+8 arithmetic operations on real numbers. This operation count was first announced in 1968, stood unchallenged for more than thirty years, and was widely believed to be best possible. Recently James Van Buskirk posted software demonstrating that the split-radix FFT is not optimal. Van Buskirk’s ...
Since Pollock’s 1989 paper, much linguistic argumentation has been mounted in favor of the split inflection hypothesis. This paper presents evidence from a neuropsychological angle in support of this hypothesis. Given that agrammatic aphasic patients demonstrate a selective deficit in the syntactic domain, it is tempting to look for impairment patterns that pertain to issues debated in current ...
Finding the pebbling number of a graph is harder than NP-complete (Π 2 complete, to be precise). However, for many families of graphs there are formulas or polynomial algorithms for computing pebbling numbers; for example, complete graphs, products of paths (including cubes), trees, cycles, diameter two graphs, and more. Moreover, graphs having minimum pebbling number are called Class 0, and ma...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید