نتایج جستجو برای: star s rothberger space

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

Journal: :پژوهش فیزیک ایران 0
معصومه حمیدی m. hamidi department of surveying and geomatics engineering, university of tehran, iranگروه مهندسی نقشه برداری، پردیس دانشکده های فنی، دانشگاه تهران فرهاد صمدزادگان f. samadzadegan department of surveying and geomatics engineering, university of tehran, iranگروه مهندسی نقشه برداری، پردیس دانشکده های فنی، دانشگاه تهران

star identification is one of the most important stages in attitude determination with star trackers. this can be performed using matching algorithms between observed stars and a master star catalogue. the main challenge in this approach is to provide a fast and reliable identification algorithm that is sufficiently robust in different pointing views of the star tracker optical system in the sp...

صمدزادگان, فرهاد, حمیدی, معصومه,

Star identification is one of the most important stages in attitude determination with star trackers. This can be performed using matching algorithms between observed stars and a master star catalogue. The main challenge in this approach is to provide a fast and reliable identification algorithm that is sufficiently robust in different pointing views of the star tracker optical system in the sp...

2007
Peter Alfeld

We consider polynomial spline spaces S r d (4) of degree d and smoothness r deened on triangulations. It is known that for d 3r + 2, S r d (4) possesses a basis of star-supported splines, i.e., splines whose supports are at most the set of triangles surrounding a vertex. Here we extend the theory by showing that for all d 3r + 1, there exist triangulations for which no such bases exist. x1. Int...

Journal: :Fundamenta Mathematicae 2014

1999
S. J. Dilworth S. J. DILWORTH

Various kinds of closed centred sets in normed spaces are considered. Necessary and sufficient conditions are obtained for every decreasing sequence of such sets to have nonempty intersection. Let X be a real or complex normed space. Recall that a set S ⊆ X is symmetric if S = −S and balanced if tS ⊆ S for all t ∈ [−1, 1]. It is convenient to introduce the following definitions. Definitions. 1....

1996
Frederick M. Walter

The isolated neutron star RX J185635-3754 is the closest known neutron star to the Sun. Based on HST WFPC2 obervations over a 3 year baseline, I report its proper motion (332±1 mas yr at a position angle of 100.3±0.1) and parallax (16.5±2.3 mas; 61 pc). This proper motion brings the neutron star from the general vicinity of the Sco-Cen OB association. For an assumed neutron star radial velocity...

2000
Frederick M. Walter

The isolated neutron star RX J185635-3754 is the closest known neutron star to the Sun. Based on HST WFPC2 obervations over a 3 year baseline, I report its proper motion (332±1 mas yr at a position angle of 100.3±0.1) and parallax (16.5±2.3 mas; 61 pc). This proper motion brings the neutron star from the general vicinity of the Sco-Cen OB association. For an assumed neutron star radial velocity...

In this paper we investigate the stability of one-sided perturbation to g-frame expansions. We show that if $Lambda$ is a g-frame of a Hilbert space $mathcal{H}$, $Lambda_{i}^{a}=Lambda_{i}+Theta_{i}$ where $Theta_{i} in mathcal{L}(mathcal{H},mathcal{H}_{i})$, and $widetilde{f}=sum_{i in J}Lambda_{i}^{star}widetilde{Lambda}_{i}^{a}f$, $widehat{f}=sum_{i in J}(Lambda_{i}^{a})^{star}widetilde{Lam...

Journal: :Topology and its Applications 2022

We explore the connections between selection games on Hausdorff spaces and their corresponding Vietoris space of compact subsets. These considerations offer a similar relationship as well-known ?-covers X ordinary open covers finite powers X. The primary utility this method is to establish relationships with k-covers Particularly, we show that some commonly studied principles are equivalent rel...

2007
Christian Sohler Heinz Nixdorf

In this paper we deal with two problems on star-shaped polygons. First, we present a Las-Vegas algorithm that uniformly at random creates a star-shaped polygon whose vertices are given by a point set S of n points in the plane that does not admit degenerate star-shaped polygons. The expected running time of the algorithm is O(n 2 logn) and it uses O(n) memory. We call a star-shaped polygon dege...

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

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