On Number of Circles Intersected by a Line
نویسندگان
چکیده
منابع مشابه
a study on insurer solvency by panel data model: the case of iranian insurance market
the aim of this thesis is an approach for assessing insurer’s solvency for iranian insurance companies. we use of economic data with both time series and cross-sectional variation, thus by using the panel data model will survey the insurer solvency.
On the expected number of linear complementarity cones intersected by random and semi-random rays
Lemke's algorithm for the linear complementarity problem follows a ray which leads from a certain fixed point (traditionally, the point (1,. . . , I ) ~ ) to the point given in the problem. The problem also induces a set of 2" cones, and a question which is relevant to the probabilistic analysis of Lemke's algorithm is to estimate the expected number of times a (semi-random) ray intersects the ...
متن کاملThe Number of Halving Circles
1. INTRODUCTION. We say that a set S of 2n + 1 points in the plane is in general position if no three of the points are collinear and no four are concyclic. We call a circle halving with respect to S if it has three points of S on its circumference, n − 1 points in its interior, and n − 1 in its exterior. The goal of this paper is to prove the following surprising fact: any set of 2n + 1 points...
متن کاملinvestigation of effective parameters on the rigidity of light composite diaphragms (psscb) by fem
در این رساله با معرفی سقف های psscb متشکل از ترکیب ورق های فولادی ذوزنقه ای و تخته های سیمانی الیافی به عنوان سقف های پیش ساخته (سازگار با سیستم سازه ای قاب های فولادی سبک) به بررسی پارامترهای موثر بر صلبیت سقف، پرداخته می شود. در تحقیق حاضر ابتدا به مدل سازی دو نمونه سقف آزمایش شده، به روش اجزاء محدود با استفاده از نرم افزار تحلیلی abaqus ver 6.10 پرداخته شده است. نمونه های ساخته شده تحت اعما...
Computing Radial Drawings on the Minimum Number of Circles
A radial drawing is a representation of a graph in which the vertices lie on concentric circles of finite radius. In this paper we study the problem of computing radial drawings of planar graphs by using the minimum number of concentric circles. We assume that the edges are drawn as straight-line segments and that co-circular vertices can be adjacent. It is proven that the problem can be solved...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series A
سال: 2002
ISSN: 0097-3165
DOI: 10.1006/jcta.2001.3243