نتایج جستجو برای: جبر استثنایی g2

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

پایان نامه :دانشگاه آزاد اسلامی - دانشگاه آزاد اسلامی واحد تهران مرکزی - دانشکده روانشناسی و علوم تربیتی 1393

دراین پزوهش مساله اصلی محقق آن است که کاربرد هوشمندسازی تا چه حد در میزان یادگیری کودکان استثنایی کم توان ذهنی موثر است؟ برای پاسخ به این پرسش، با بررسی ادبیات موجود در حوزه هوشمندسازی، چهار فرضیه یا متغیرهای پیش بین(میزان اطلاعات آموزگاران، نرم افزار آموزشی ریاضی، نرم افزار آموزشی علوم و نرم افزار آموزشی فارسی )در یادگیری دانش آموزان تدوین گردید. روش تحقیق از لحاظ هدف، کاربردی، از نظر میزان نظ...

A.A.T. Shabani

Compositions of biotite from three different rock types of Mashhad granitoids, i.e., granodiorite, monzogranite and leucogranite in NE of Iran have been documented by electron microprobe and wet chemistry for Fe3+ and Fe2+. Mashhad granitoids have been geochronologically and petrologically grouped into G1 and G2 phases. Microprobe data show that the total Fe contents in biotite from G2 leucogra...

تکنیک تحلیل کیفی تطبیقی» که مبتنی بر «جبر بولی» یا بسط بولی منطق مقایسه اسمی استرارت میل است،روششناسی ضمنی و تلویحی تحقیقات تطبیقی – تاریخی است. بااستفاده از این تکنیک تحلیل گران می توانند به وارسی ترکیب های متفاوت از تبیین کننده ها، به مثابه علل یک نتیجه (معلول) واحد بپردازند. تکنیک جبر بولی در تحلیل تطبیقی-تاریخی نیز ابزاری سودمند برای تحلیل مجموعه داده هایی با N متوسط است. در مقاله حاضر ابتد...

1998
R. Holman T. W. Kephart

We construct the N = 1 supergravity analog of the Green-Schwarz and heterotic superstring theories in 10D. We find the SO(8) theory previously found by compactification of 10D on K3. We also find eleven G 2 × G 2 theories, two with symmetric matter content. It is not obvious how tenof the G 2 × G 2 theories can be gotten from 10D. Ten-dimensional superstrings [1], [2], [3], [4] are one of the m...

2008
A. Alexandrov

Following the program, proposed in hep-th/0310113, of systematizing known properties of matrix model partition functions (defined as solutions to the Virasoro-like sets of linear differential equations), we proceed to consideration of non-Gaussian phases of the Hermitean one-matrix model. A unified approach is proposed for description of “connected correlators” in the form of the phaseindepende...

2008
François Gelis Sangyong Jeon Raju Venugopalan

We develop the formalism discussed previously in hep-ph/0601209 and hep-ph/0605246 to construct a kinetic theory that provides insight into the earliest “Glasma” stage of a high energy heavy ion collision. Particles produced from the decay of classical fields in the Glasma obey a Boltzmann equation whose novel features include an inhomogeneous source term and new contributions to the collision ...

2002
Erik Hurst

This paper documents the extent to which homeowners use housing equity to smooth their consumption over time. Unlike drawing down other forms of saving, accessing accumulated home equity can be quite costly. Theoretically and empirically, a key distinction can be drawn between those refinancing their home mortgage to improve their wealth position from those who had a consumption smoothing motiv...

2015
Jia-Bao Liu Xiang-Feng Pan Fu-Tao Hu

Let G1 and G2 be two graphs on disjoint sets of n1 and n2 vertices, respectively. The corona of graphs G1 and G2, denoted by G1 ◦ G2, is the graph formed from one copy of G1 and n1 copies of G2 where the i-th vertex of G1 is adjacent to every vertex in the i-th copy of G2. The neighborhood corona of G1 and G2, denoted by G1 ⋄ G2, is the graph obtained by taking one copy of G1 and n1 copies of G...

Journal: :Discrete Mathematics 2013
Martin Sonntag Hanns-Martin Teichert

Let G = (V,E) be a simple undirected graph. The neighborhood hypergraph N (G) = (V, EN ) of G has the edge set EN = {e ⊆ V | |e| ≥ 1 ∧ ∃x ∈ V : e = NG(x)}. In a certain sense, this is a generalization of the well-known notion of the neighborhood graph N(G) = (V,EN ). For several products G1 ◦G2 of simple undirected graphs G1 and G2, we investigate the question how N(G1 ◦G2) / N (G1 ◦G2) can be ...

Journal: :Graphs and Combinatorics 2007
Alexandr V. Kostochka Gexin Yu

Two graphs G1 and G2 of order n pack if there exist injective mappings of their vertex sets into [n], such that the images of the edge sets do not intersect. Sauer and Spencer proved that if (G1) (G2) < 0.5n, then G1 and G2 pack. In this note, we study an Ore-type analogue of the Sauer–Spencer Theorem. Let θ(G) = max{d(u)+ d(v) : uv ∈ E(G)}. We show that if θ(G1) (G2) < n, then G1 and G2 pack. ...

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

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