نتایج جستجو برای: Common solution

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

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه شیراز - دانشکده علوم 1390

this work is presented in five parts. in the first part preparation of the starting complex [pt(c^n)cl(dmso)], 1, in which c^n = n(1),c(2?)-chelated, deprotonated 2-phenylpyridine, and dmso = dimethylsulfoxide, and its reaction with 1 equiv of the biphosphine ligands bis(diphenylphosphino)amine, dppa, or bis(diphenylphosphino)methane, dppm, to give the complex [pt(c^n)cl(dppa)], 2, or [pt(c^n)c...

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

growing demands and requires of high data rate systems cause significant increase of high frequency systems for wideband communication applications. as mixers are one of the main blocks of each receivers and its performance has great impact on receiver’s performance; in this thesis, a new solution for ku-band (12-18 ghz) mixer design in tsmc 0.18 µm is presented. this mixer has high linearity a...

Journal: :IEEE Concurrency 2000
Pascal Felber Rachid Guerraoui

The Object Group Service (OGS) extends CORBA with the ability to gather several objects inside a group and to transparently handle the group membership and the consistent invocations of the group members. OGS does not require any change to the CORBA specification: it is portable on any CORBA 2.0 ORB and does not rely on ORB vendorspecific features. We present the OGS programming model and we di...

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

abstract: in this thesis, we focus to class of convex optimization problem whose objective function is given as a linear function and a convex function of a linear transformation of the decision variables and whose feasible region is a polytope. we show that there exists an optimal solution to this class of problems on a face of the constraint polytope of feasible region. based on this, we dev...

2011
Yung-Hsiang Liu Li-Ting Tsai Chia-Wen Hsieh Rong-Jaye Chen

The approximate common divisor problem(ACDP) is to find one or more divisors which is the greatest common divisor of the approximate numbers a and b of two given numbers a0 and b0. Howgrave-Graham[7] has considered the special case of b = b0 and gave a continued fraction approach and a lattice approach to find divisors. Furthermore he raised another lattice approach for ACDP based on Coppersmit...

2001
John K. Johnstone

We develop an efficient algorithm for the construction of common tangents between a set of Bezier curves. Common tangents are important in visibility, lighting, robot motion, and convex hulls. Common tangency is reduced to the intersection of parametric curves in a dual space, rather than the traditional intersection of implicit curves. We show how to represent the tangent space of a plane Bezi...

Journal: :GAZI UNIVERSITY JOURNAL OF SCIENCE 2020

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه تربیت معلم تهران 1381

‏‎the purpose of the present study was to investigate the latent pattern underlying reading ability . some 272 male and female participants. english majors at the ba level , participated in the study. two valid tests were used in this study, the reading test developed exclusively for the purpose of this project and academic reading section of ielts. to investigate the possible latent underlying...

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

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