"Vj" Essays and Research Papers

Sort By:
Satisfactory Essays
Good Essays
Better Essays
Powerful Essays
Best Essays
Page 3 of 41 - About 403 Essays
  • Satisfactory Essays

    ISSN 1995-0802‚ Lobachevskii Journal of Mathematics‚ 2009‚ Vol. 30‚ No. 4‚ pp. 337–346. c Pleiades Publishing‚ Ltd.‚ 2009. Marcinkiewicz-Zygmund Type Law of Large Numbers for Double Arrays of Random Elements in Banach Spaces Le Van Dung1* ‚ Thuntida Ngamkham2 ‚ Nguyen Duy Tien1** ‚ and A. I. Volodin3*** 1 Faculty of Mathematics‚ National University of Hanoi‚ 3 34 Nguyen Trai‚ Hanoi‚ Vietnam 2 3 Department of Mathematics and Statistics‚ Thammasat University‚ Rangsit Center‚ Pathumthani

    Premium Probability theory Random variable

    • 1770 Words
    • 8 Pages
    Satisfactory Essays
  • Powerful Essays

    Mtv Brand Failure

    • 8944 Words
    • 36 Pages

    Cultural Nationalism on MTV India Journal of Communication Inquiry Jocelyn Cullity The Global Desi: Cultural Nationalism on MTV India The article examines how the introduction of satellite television into India during the 1990s has led to the emergence of a new form of cultural nationalism based on the active and self-conscious indigenization of global media. Using MTV India as an ethnographic case study‚ this process is demonstrated through analysis of the images themselves and by a consideration

    Premium MTV Middle class Culture

    • 8944 Words
    • 36 Pages
    Powerful Essays
  • Powerful Essays

    Improved Fast Decoupled Power Flow R. Eid‚ S. W. Georges and R. A. Jabr Notre-Dame University‚ sgeorges@ndu.edu.lb Abstract This paper presents an Improved Fast Decoupled Power Flow Method (IFDPFM) based on different strategies of updating the voltage angle (δ) and the bus voltage (V) in each iteration. This method was tested on many IEEE bus test systems. When compared with the Newton-Raphson and with the classical Fast Decoupled methods‚ the IFDPFM resulted in large computing savings (in

    Premium Electrical engineering

    • 2809 Words
    • 12 Pages
    Powerful Essays
  • Powerful Essays

    Chapter 6. 1.0 TRANSPORTATION PROBLEM The transportation problem is a special class of the linear programming problem. It deals with the situation in which a commodity is transported from Sources to Destinations. The objective is to determine the amount of commodity to be transported from each source to each destination so that the total transportation cost is minimum. EXAMPLE 1.1 A soft drink manufacturing firm has m plants located in m different cities. The total production is absorbed

    Premium Operations research Equals sign

    • 1805 Words
    • 9 Pages
    Powerful Essays
  • Satisfactory Essays

    Topology exam

    • 1639 Words
    • 9 Pages

    Tentamen Topologie‚ Voorjaar 2014 01.07.2014‚ 12:30-15:30 (16:30)‚ LIN4+5 (LIN8) Toelichting: • Je mag geen hulpmiddelen (zoals aantekeningen‚ rekenmachine‚ telefoon‚ tablet‚ etc.) gebruiken‚ behalve het dictaat (op papier!) en evtl. woordenboeken Engels/Nederlands. • Als je stellingen uit het dictaat gebruikt‚ geef volledige referenties‚ waarbij je ook duidelijk maakt dat aan de voorwaarden voldaan is. Naar stellingen of huiswerkopgaven in het dictaat mag alleen verwezen worden als die dit

    Premium

    • 1639 Words
    • 9 Pages
    Satisfactory Essays
  • Satisfactory Essays

    Hungarian Method

    • 1489 Words
    • 34 Pages

    HW5Q2) The model:- Optimize Z = Where‚ Xij= no of containers from distribution center I to customer j …..(i=1‚2‚3‚4: j=A‚B‚C) Cij= Shipping cost per container from distribution center I to customer j Subject to‚ ∑XiA=600 ∑XiB=500 ∑XiC=500 ∑X1j=450 ∑X2j=600 ∑X3j=350 Xij= integer The VAM penalty cost is given by‚ The initial allocation in VAM method is made in the row or column that has the highest penalty cost. In following table‚ column C has highest penalty cost i.e. $350. and we choose

    Premium Hong Kong 175

    • 1489 Words
    • 34 Pages
    Satisfactory Essays
  • Better Essays

    Fuzzy Topsis Method

    • 1470 Words
    • 6 Pages

    Fuzzy TOPSIS method This is an approach based on the TOPSIS technique (Technique for Order Preference by Similarity to Ideal Solution) and the fuzzy set theory. The TOPSIS method is based on the concept that the optimum option has the least distance from the positive ideal solution. It is a linear weighting technique‚ which was first proposed‚ in its crisp version by Chen and Hwang(1992)‚ with reference to Hwang and Yoon(1981). Since then‚ this method has been widely adopted to solve MCDM problems

    Free Decision making software Decision theory Decision making

    • 1470 Words
    • 6 Pages
    Better Essays
  • Satisfactory Essays

    Chi-square Distribution

    • 882 Words
    • 4 Pages

    2.3. The Chi-Square Distribution One of the most important special cases of the gamma distribution is the chi-square distribution because the sum of the squares of independent normal random variables with mean zero and standard deviation one has a chi-square distribution. This section collects some basic properties of chi-square random variables‚ all of which are well known; see Hogg and Tanis [6]. A random variable X has a chi-square distribution with n degrees of freedom if it is a gamma

    Premium Normal distribution Variance Probability theory

    • 882 Words
    • 4 Pages
    Satisfactory Essays
  • Good Essays

    General Knowledge

    • 14590 Words
    • 59 Pages

    Prepared by R. VIJAYALAYAN NR IAS ACADEMY THE INSTITUTE FOR IAS‚ IPS‚ IRS (ALL UPSC & TNPSC EXAMINATIONS) C-79‚ 10th Cross (West)‚ Thillainagar‚ Tiruchirapalli-18 Cell: 98425-54825 Ph: 0431-4020611 www.nriasacademy.com email:vijay.nriasacademy@gmail.com Current Affairs – 2012 2012 - Current Affairs - Volume - 9 07.11.2012 1. mnkupf;f mjpgu; Nju;jy; vd;W eilngw;wJ? - etk;gu; - 6 - 57-tJ mjpgu; Nju;jy; - [dehaf fl;rp Ntl;ghsu; - guhf; xghkh (illinois) - [dehaf fl;rp Jiz mjpgu; Ntl;ghsu; -

    Premium

    • 14590 Words
    • 59 Pages
    Good Essays
  • Powerful Essays

    Graph Theory

    • 6861 Words
    • 28 Pages

    MATH1081 Discrete Mathematics T. Britz/D. Chan/D. Trenerry §5 Graph Theory Loosely speaking‚ a graph is a set of dots and dot-connecting lines. The dots are called vertices and the lines are called edges. Formally‚ a (finite) graph G consists of A finite set V whose elements are called the vertices of G; A finite set E whose elements are called the edges of G; A function that assigns to each edge e ∈ E an unordered pair of vertices called the endpoints of e. This function is called the edge-endpoint

    Premium Graph theory

    • 6861 Words
    • 28 Pages
    Powerful Essays
Page 1 2 3 4 5 6 7 8 9 41