نتایج جستجو برای: generated by ideal sources point mass

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

Journal: :پژوهش فیزیک ایران 0
احمد شیرانی m. h. alamatsaz محمد حسن علامت ساز a. shirani

monte carlo simulation is widely used in calculations involing transport of photons through different materials of different shapes. the method consists of randomly generating a finite set of photon histories over which the quantities of interest are averaged. in photon transport calculations, sampling the photon scattering angle from the klein-nishina probability distribution is of special imp...

Journal: :J. Symb. Log. 2005
Yue Yang Liang Yu

Let [NB]1 denote the ideal generated by nonbounding c.e. degrees and NCup the ideal of noncuppable c.e. degrees. We show that both [NB]1 ∩ NCup and the ideal generated by nonbounding and noncuppable degrees are new, in the sense that they are different from M, [NB]1 and NCup — the only three known definable ideals so far.

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه صنعتی (نوشیروانی) بابل - دانشکده مهندسی مکانیک 1389

due to the limiting workspace of parallel manipulator and regarding to finding the trajectory planning of singularity free at workspace is difficult, so finding a best solution that can develop a technique to determine the singularity-free zones in the workspace of parallel manipulators is highly important. in this thesis a simple and new technique are presented to determine the maximal singula...

2010
Jintai Ding Timothy J. Hodges Victoria Kruglov

We give exact formulas for the growth of the ideal Aλ for λ a quadratic element of the algebra of Boolean functions over the Galois field GF (2). That is, we calculate dimAkλ where Ak is the subspace of elements of degree less than or equal to k. These results clarify some of the assertions made in the article of Yang and Chen [YC] concerning the efficiency of the XL algorithm in cryptography.

Journal: :JOURNAL OF THE ILLUMINATING ENGINEERING INSTITUTE OF JAPAN 1928

This paper uses the weighted L$_1-$norm to propose an algorithm for finding a well-dispersed subset of non-dominated solutions of multiple objective mixed integer linear programming problem. When all variables are integer it finds the whole set of efficient solutions. In each iteration of the proposed method only a mixed integer linear programming problem is solved and its optimal solutions gen...

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

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