نتایج جستجو برای: strongly orthogonal set

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

Journal: :Nonlinear Differential Equations and Applications NoDEA 2018

2007
Joydeep Sen Sarma

Tasks can be classi ed as either periodic which execute every some time units or vice versa as aperiodic. Sporadic tasks are a special case of aperiodic tasks which are guaranteed to have a minimum spacing between consecutive instances of the same task. Sporadic tasks sets can be handled by modeling them as periodic tasks and therefore we will concentrate on the former two types of tasks. Sched...

Journal: :Journal of Mathematical Analysis and Applications 2003

Journal: :Materials research proceedings 2023

Abstract. The dynamics of connecting elements should be identified to evaluate their effects on the assemblies where they are employed. In general, a linear analysis is sufficient determine dynamics. However, in some cases, responses depend amplitude and frequency excitation, thus nonlinear analyses must carried out. Following modal approach, Nonlinear Normal Modes (NNMs) can used. aim this wor...

Suppose that A is a C^*-algebra. We consider the class of A-linear mappins between two inner product A-modules such that for each two orthogonal vectors in the domain space their values are orthogonal in the target space. In this paper, we intend to determine A-linear mappings that preserve orthogonality. For this purpose, suppose that E and F are two inner product A-modules and A+ is the set o...

2005
Jian Zhou Huazhong Shu Hongqing Zhu Christine Toumoulin Limin Luo

Orthogonal moments are recognized as useful tools for object representation and image analysis. It has been shown that the recently developed discrete orthogonal moments have better performance than the conventional continuous orthogonal moments. In this paper, a new set of discrete orthogonal polynomials, namely Hahn polynomials, are introduced. The related Hahn moment functions defined on thi...

Journal: :CoRR 2012
Giovanni Viglietta

Guarding and searching problems have been of fundamental interest since the early years of Computational Geometry. Both are well-developed areas of research and have been thoroughly studied in planar polygonal settings. In this thesis we tackle the Art Gallery Problem and the Searchlight Scheduling Problem in 3-dimensional polyhedral environments, putting special emphasis on edge guards and ort...

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه شهید مدنی آذربایجان - دانشکده علوم پایه 1392

let g=(v,e) be a graph with vertex set v and edge set e.for two vertices u,v of g ,the closed interval i[u,v] ,consists of u,v and all vertices lying in some u-v geodesic in g.if s is a set of vertices of g then i[s]is the union of all sets i[u,v]for u,v ? s. if i[s]=v(g) , then s is a geodetic set for g.the geodetic number g(g) is the minimum cardinality of geodetic set.the maximum cardinalit...

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

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