نتایج جستجو برای: in plane constraint

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

2002
K. V. BHAGWAT

In various problems in theoretical physics one has to evaluate a path integral with a constraint which is of a topological nature. This arises, for example, in the theory of polymers or in the analysis of the Aharonov-Bohm effect (see ref. [ 1 ] and the literature quoted therein). In order to elucidate some of these problems Inomata and Singh [2] considered path integrals over trajectories in a...

Journal: :The International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences 2012

1992
Stephen Pollard John Porrill

This paper is concerned with robust, accurate and computationally tractable methods for the automatic recovery of 3D ellipse data from edge based stereo. The processing paradigm relies heavily on the 2D image as a rich and robust source of scene feature hypotheses (in this case ellipses). Rather than attempt to recover 3D scene descriptions by grouping unstructured estimates of disparity and/or...

2001
A. Tasora P. Righettini

This paper deals with the sliding-contact constraint equations describing the relative motion of two freeform surfaces, assuming that the surfaces can have arbitrary curvature in 3D space. The sliding-contact equations are developed either for the non-penetration condition and for the surface-tangency condition. Both are differentiated twice in time in order to allow a straightforward applicati...

2005
Govind Menon Charles D. Dermer

The Blandford-Znajek constraint equation for a stationary, axisymmetric black-hole force-free magnetosphere is cast in a 3+1 absolute space and time formulation, following Komissarov (2004). We derive an analytic solution for fields and currents to the constraint equation in the far-field limit that satisfies the Znajek condition at the event horizon. This solution generalizes the Blandford-Zna...

2004
Richard G. Paxman John H. Seldin James R. Fienup Joseph C. Marron

Three-dimensional imaging provides profile information not available with conventional twodimensional imaging. Many three-dimensional objects of interest are opaque to the illuminating radiation, meaning that the object exhibits surface, as opposed to volume, scattering. We investigate the use of an opacity constraint to perform three-dimensional phase retrieval. The use of an opacity constrain...

Journal: :مهندسی صنایع 0
ابوالفضل کاظمی استادیار دانشگاه آزاد اسلامی واحد قزوین- دانشکده صنایع و مکانیک محمدرضا ملکیان کارشناس ارشد دانشگاه آزاد اسلامی واحد قزوین- دانشکده صنایع و مکانیک کیوان صرافها کارشناس ارشد دانشگاه آزاد اسلامی واحد قزوین- باشگاه پژوهشگران جوان

inventory control problem is one of the problems in decision making and management that contains non-crisp parameters in real world. economic production quantity (epq) model in fuzzy environment has been studied so far by many researchers. one of the main assumptions in all previous researches was neglecting the inventory shortage. in this research, a new multi-item epq model with fuzzy random ...

Journal: :IEEE Trans. Automat. Contr. 2007
Fuwen Yang Mahbub Gani Didier Henrion

In this paper, the problem of designing fixed-order robustH∞ controllers is considered for linear systems affected by polytopic uncertainty. A polynomial method is employed to design a fixed-order controller that guarantees that all the closed-loop poles reside within a given region of the complex plane. In order to utilise the freedom of the controller design, an H∞ performance specification i...

1994
Alexander Bockmayr

In this paper, we show how recently developed techniques from combinatorial optimization can be embedded into constraint logic programming. We develop a constraint solver for the constraint logic programming language CLP(PB) for logic programming with pseudo-Boolean constraints. Our approach is based on the generation of polyhedral cutting planes and the concept of branch-and-cut. In the case o...

Journal: :INFORMS Journal on Computing 2007
David Pisinger Mikkel Sigurd

T two-dimensional bin-packing problem is the problem of orthogonally packing a given set of rectangles into a minimum number of two-dimensional rectangular bins. The problem is -hard and very difficult to solve in practice as no good mixed integer programming (MIP) formulation has been found for the packing problem. We propose an algorithm based on the well-known Dantzig-Wolfe decomposition whe...

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

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