URL
stringlengths
15
1.68k
text_list
sequencelengths
1
199
image_list
sequencelengths
1
199
metadata
stringlengths
1.19k
3.08k
https://urbancityarch.com/25-one-less-worksheet/
[ "HomeSuper Teacher Worksheets ➟ 25 25 One Less Worksheet\n\n# 25 One Less Worksheet\n\ne more or e less groups worksheet twinkl this handy and colorful worksheet gives your children the opportunity to practice counting one more and less differentiated three ways with answers for checking e less solutions examples homework worksheets count down from 10 to 1 and state 1 less than a given number examples and step by step solutions worksheets engageny math kindergarten module 1 lesson 13 eureka math mon core worksheets kindergarten speckled frog e less than worksheet by missyrobinson useful for when using speckled frog or green bottle song for subtraction less than activity learners draw the number of frogs green bottles one less than in the empty box and write the number sentence below\n\n### one less worksheet", null, "5 Nbt 1 Worksheets Math Grade 1 Worksheets Awesome Printable from one less worksheet , image source: blitze.co\n\n## 25 Division Grouping Worksheets\n\ndivision by grouping worksheets teach an interesting division strategy of grouping objects with this unit of division model worksheets hand picked for kids of grade 3 included here are exercises such as group the objects answer questions based on the model plete the division statements fill in the missing part of the equation draw models […]" ]
[ null, "https://urbancityarch.com/wp-content/uploads/2019/09/one-less-worksheet-5-nbt-1-worksheets-math-grade-1-worksheets-awesome-printable-of-one-less-worksheet.jpg", null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.88416183,"math_prob":0.80172724,"size":1968,"snap":"2020-45-2020-50","text_gpt3_token_len":384,"char_repetition_ratio":0.1787169,"word_repetition_ratio":0.011976048,"special_character_ratio":0.19054878,"punctuation_ratio":0.008902078,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9774508,"pos_list":[0,1,2],"im_url_duplicate_count":[null,1,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2020-12-03T01:32:22Z\",\"WARC-Record-ID\":\"<urn:uuid:268b7fce-0068-4740-86da-e829bd54ab3b>\",\"Content-Length\":\"34916\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:2608f1c4-9258-47a5-a5cf-c48c7dc5b0d6>\",\"WARC-Concurrent-To\":\"<urn:uuid:d77365dd-d965-46de-aa23-2f449fae6f44>\",\"WARC-IP-Address\":\"104.27.159.75\",\"WARC-Target-URI\":\"https://urbancityarch.com/25-one-less-worksheet/\",\"WARC-Payload-Digest\":\"sha1:UJTXFTREF5GRNMAQCHEXPVOLFFSLH3T3\",\"WARC-Block-Digest\":\"sha1:LNVWL7Z7Z5TFQLZMIQ3TDJPKPHR6HT7N\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2020/CC-MAIN-2020-50/CC-MAIN-2020-50_segments_1606141717601.66_warc_CC-MAIN-20201203000447-20201203030447-00013.warc.gz\"}"}
https://medical-dictionary.thefreedictionary.com/coefficient+of+viscosity
[ "# coefficient of viscosity\n\nAlso found in: Dictionary, Thesaurus, Encyclopedia, Wikipedia.\n\n## co·ef·fi·cient of vis·cos·i·ty\n\nthe value of the force per unit area required to maintain a unit of relative velocity between two parallel planes a unit of distance apart.\nFarlex Partner Medical Dictionary © Farlex 2012\nMentioned in ?\nReferences in periodicals archive ?\n(3) Using case analysis, the degrees of influence of the water resistance ability of the rock beam deformation on the elasticity modulus, coefficient of viscosity, and water pressure were obtained.\nThis can be determined by examining the values of the temperature-dependency coefficient of viscosity (5, 23).\n[Alpha] = Pressure coefficient of viscosity, [Pa.sup.-1].\ncoefficient of viscosity function, n = 3.50 x [10.sup.-4]\ncoefficient of viscosity function, C = 4.80 x [10.sup.-4]\n\nSite: Follow: Share:\nOpen / Close" ]
[ null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.6917895,"math_prob":0.7831971,"size":306,"snap":"2021-04-2021-17","text_gpt3_token_len":72,"char_repetition_ratio":0.119205296,"word_repetition_ratio":0.0,"special_character_ratio":0.19934641,"punctuation_ratio":0.10714286,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.979948,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2021-04-20T11:45:41Z\",\"WARC-Record-ID\":\"<urn:uuid:bba1aa29-eaab-4400-b1c4-5ded357c70d5>\",\"Content-Length\":\"43234\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:e6c2a503-dd91-49db-8546-cf0616f1c46c>\",\"WARC-Concurrent-To\":\"<urn:uuid:71b0013a-755b-4e35-b5c5-589b08322c1f>\",\"WARC-IP-Address\":\"209.160.67.6\",\"WARC-Target-URI\":\"https://medical-dictionary.thefreedictionary.com/coefficient+of+viscosity\",\"WARC-Payload-Digest\":\"sha1:NSP24T4S7B3BUJ5EJMCRFCCOPKQD4PVQ\",\"WARC-Block-Digest\":\"sha1:AK5LK5NOUXCIRK3NAHVSMN7UGAX2HKSK\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2021/CC-MAIN-2021-17/CC-MAIN-2021-17_segments_1618039388763.75_warc_CC-MAIN-20210420091336-20210420121336-00190.warc.gz\"}"}
https://brilliant.org/problems/simple-math-6/
[ "# An algebra problem by Viki Zeta\n\nAlgebra Level 2\n\n$\\frac{(\\underbrace{4 + \\cdots + 4)}_{x^2\\text{ times}}}{\\underbrace{(x + \\cdots+ x)}_\\text{x times}} - 2 = \\, ?$\n\nFind the value of the above expression given that $k$ is a non-zero real number and $x$ is a natural number.\n\n×" ]
[ null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.72470605,"math_prob":0.99999297,"size":264,"snap":"2019-43-2019-47","text_gpt3_token_len":60,"char_repetition_ratio":0.15,"word_repetition_ratio":0.29268292,"special_character_ratio":0.23106061,"punctuation_ratio":0.2580645,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.999894,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2019-11-12T22:44:32Z\",\"WARC-Record-ID\":\"<urn:uuid:f7ffda11-3b63-4a6e-8d29-3955eab93554>\",\"Content-Length\":\"44708\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:2d386f53-4e9d-460c-ae1b-bdec666452b4>\",\"WARC-Concurrent-To\":\"<urn:uuid:061f8dec-c1f8-443d-bda4-18d2082e9ed3>\",\"WARC-IP-Address\":\"104.20.35.242\",\"WARC-Target-URI\":\"https://brilliant.org/problems/simple-math-6/\",\"WARC-Payload-Digest\":\"sha1:SQRR7D5MDOCW3DTJOCLIQOHPWCCHLRYF\",\"WARC-Block-Digest\":\"sha1:HPJV6RO7JZVMXK4WTIEPNVSHMAD6GMXO\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2019/CC-MAIN-2019-47/CC-MAIN-2019-47_segments_1573496665767.51_warc_CC-MAIN-20191112202920-20191112230920-00412.warc.gz\"}"}
https://openlearning.aalto.fi/mod/book/view.php?id=10324
[ "## Differential and Integral Calculus\n\nTable of Content\n\n### Basics of sequences\n\nThis section contains the most important definitions about sequences. Through these definitions the general notion of sequences will be explained, but then restricted to real number sequences.\n\n##### Definition: Sequence\n\nLet $$M$$ be a non-empty set. A sequence is a function:\n\n$f:\\mathbb{N}\\rightarrow M.$\n\nOccasionally we speak about a sequence in $$M$$.\n\nNote. Characteristics of the set $$\\mathbb{N}$$ give certain characteristics to the sequence. Because $$\\mathbb{N}$$ is ordered, the terms of the sequence are ordered.\n\n##### Definition: Terms and Indices\n\nA sequence can be denoted denoted as\n\n$$(a_{1}, a_{2}, a_{3}, \\ldots) = (a_{n})_{n\\in\\mathbb{N}} = (a_{n})_{n=1}^{\\infty} = (a_{n})_{n}$$\n\ninstead of $$f(n).$$ The numbers $$a_{1},a_{2},a_{3},\\ldots\\in M$$ are called the terms of the sequence.\n\nBecause of the mapping \\begin{aligned} f:\\mathbb{N} \\rightarrow & M \\\\ n \\mapsto & a_{n}\\end{aligned} we can assign a unique number $$n\\in\\mathbb{N}$$ to each term. We write this number as a subscript and define it as the index; it follows that we can identify any term of the sequence by its index.\n\nn 1 2 3 4 5 6 7 8 9 $$\\ldots$$\n$$\\downarrow$$ $$\\downarrow$$ $$\\downarrow$$ $$\\downarrow$$ $$\\downarrow$$ $$\\downarrow$$ $$\\downarrow$$ $$\\downarrow$$ $$\\downarrow$$\n$$a_{n}$$\n\n$$a_{1}$$ $$a_{2}$$ $$a_{3}$$ $$a_{4}$$ $$a_{5}$$ $$a_{6}$$ $$a_{7}$$ $$a_{8}$$ $$a_{9}$$ $$\\ldots$$\n\n#### A few easy examples\n\n##### Example 1: The sequence of natural numbers\n\nThe sequence $$(a_{n})_{n}$$ defined by $$a_{n}:=n,\\,n\\in \\mathbb{N}$$ is called the sequence of natural numbers. Its first few terms are: $a_1=1,\\, a_2=2,\\, a_3=3, \\ldots$ This special sequence has the property that every term is the same as its index.", null, "##### Example 2: The sequence of triangular numbers\n\nTriangular numbers get their name due to the following geometric visualization: Stacking coins to form a triangular shape gives the following diagram:", null, "To the first coin in the first layer we add two coins in a second layer to form the second picture $$a_2$$. In turn, adding three coins to $$a_2$$ forms $$a_3$$. From a mathematical point of view, this sequence is the result of summing natural numbers. To calculate the 10th triangular number we need to add the first 10 natural numbers: $D_{10} = 1+2+3+\\ldots+9+10$ In general form the sequence is defined as: $$D_{n} = 1+2+3+\\ldots+(n-1)+n.$$", null, "This motivates the following definition:\n\n##### Notation and Definition: Sum sequence\n\nLet $$(a_n)_n, a_n: \\mathbb{N}\\to M$$ be a sequence with terms $$a_n$$, the sum is written: $a_1 + a_2 + a_3 + \\ldots + a_{n-1} + a_n =: \\sum_{k=1}^n a_k$ The sign $$\\sum$$ is called sigma. Here, the index $$k$$ increases from 1 to $$n$$.\n\nSum sequences are sequences whose terms are formed by summation of previous terms.\n\nThus the nth triangular number can be written as: $D_n = \\sum_{k=1}^n k$\n\n##### Example 3: Sequence of square numbers\n\nThe sequence of square numbers $$(q_n)_n$$ is defined by: $$q_n=n^2$$. The terms of this sequence can also be illustrated by the addition of coins.\n\nInterestingly, the sum of two consecutive triangular numbers is a square number. So, for example, we have: $$3+1=4$$ and $$6+3=9$$. In general this gives the relationship:\n\n$q_n=D_n + D_{n-1}$", null, "##### Example 4: Sequence of cube numbers\n\nAnalogously to the sequence of square number, we give the definition of cube numbers as $a_n := n^3.$ The first terms of the sequence are: $$(1,8,27,64,125,\\ldots)$$.", null, "##### Example 5.\n\nLet $$(q_n)_n$$ with $$q_n := n^2$$ be the sequence of square numbers \\begin{aligned}(1,4,9,16,25,36,49,64,81,100 \\ldots)\\end{aligned} and define the function $$\\varphi(n) = 2n$$. The composition $$(q_{2n})_n$$ yields: \\begin{aligned}(q_{2n})_n &= (q_2,q_4,q_6,q_8,q_{10},\\ldots) \\\\ &= (4,16,36,64,100,\\ldots).\\end{aligned}\n\n##### Definition: Sequence of differences\n\nGiven a sequence $$(a_{n})_{n}=a_{1},\\, a_{2},\\, a_{3},\\ldots,\\, a_{n},\\ldots$$; then $(a_{n+1}-a_{n})_{n}:=a_{2}-a_{1}, a_{3}-a_{2},\\dots$ is called the 1st difference sequence of $$(a_{n})_{n}$$\n\nThe 1st difference sequence of the 1st difference sequence is called the 2nd difference sequence. Analogously the $$n$$th difference< sequence is defined.\n\n##### Example 6.\n\nGiven the sequence $$(a_n)_n$$ with $$a_n := \\frac{n^2+n}{2}$$, i.e. \\begin{aligned}(a_n)_n &= (1,3,6,10,15,21,28,36,\\ldots)\\end{aligned} Let $$(b_n)_n$$ be its 1st difference sequence. Then it follows that \\begin{aligned}(b_n)_n &= (a_2-a_1, a_3-a_2, a_4-a_3,\\ldots) \\\\ &= (2,3,4,5,6,7,8,9)\\end{aligned} A term of $$(b_n)_n$$ has the general form \\begin{aligned}b_n &= a_{n+1}-a_{n} \\\\ &= \\frac{(n+1)^2+(n+1)}{2} - \\frac{n^2+n)}{2} \\\\ &= \\frac{(n+1)^2+(n+1)-n^2 - n }{2} \\\\ &= \\frac{(n^2+2n+1)+1-n^2}{2} \\\\ &= \\frac{2n+2}{2} \\\\ &= n + 1.\\end{aligned}\n\n### Some important sequences\n\nThere are a number of sequences that can be regarded as the basis of many ideas in mathematics, but also can be used in other areas (e.g. physics, biology, or financial calculations) to model real situations. We will consider three of these sequences: the arithmetic sequence, the geometric sequence, and Fibonacci sequence, i.e. the sequence of Fibonacci numbers.\n\n#### The arithmetic sequence\n\nThere are many definitions of the arithmetic sequence:\n\n##### Definition A: Arithmetic sequence\n\nA sequence $$(a_{n})_{n}$$ is called the arithmetic sequence, when the difference $$d \\in \\mathbb{R}$$ between two consecutive terms is constant, thus: $a_{n+1}-a_{n}=d \\text{ with } d=const.$\n\nNote: The explicit rule of formation follows directly from definition A: $a_{n}=a_{1}+(n-1)\\cdot d$ For the $$n$$th term of an arithmetic sequence we also have the recursive formation rule: $a_{n+1}=a_n + d.$\n\n##### Definition B: Arithmetic sequence\n\nA non-constant sequence $$(a_{n})_{n}$$ is called an arithmetic sequence (1st order) when its 1st difference sequence is a sequence of constant value.\n\nThis rule of formation gives the arithmetic sequence its name: The middle term of any three consecutive terms is the arithmetic mean of the other two, for example:\n\n$a_2 = \\frac{a_1+a_3}{2}.$\n\n##### Example 1.\n\nThe sequence of natural numbers $(a_n)_n = (1,2,3,4,5,6,7,8,9,\\ldots)$ is an arithmetic sequence, because the difference, $$d$$, between two consecutive terms is always given as $$d=1$$.\n\n#### The geometric sequence\n\nThe geometric sequence has multiple definitions:\n\n##### Definition: Geometric sequence\n\nA sequence $$(a_{n})_{n}$$ is called a geometric sequence when the ratio of any two consecutive terms is always constant $$q\\in\\mathbb{R}$$, thus $\\frac{a_{n+1}}{a_{n}}=q \\text{ for all } n\\in\\mathbb{N}.$\n\nNote.The recursive relationship $$a_{n+1} = q\\cdot a_n$$ of the terms of the geometric sequence and the explicit formula for the calculation of the n th term of a geometric sequence $a_n=a_1\\cdot q^{n-1}$ follows directly from the definition.\n\nAgain the name and the rule of formation of this sequence are connected: Here, the middle term of three consecutive terms is the geometric mean of the other two, e.g.: $a_2 = \\sqrt{a_1\\cdot a_3}.$\n\n##### Example 2.\n\nLet $$a$$ and $$q$$ be fixed positive numbers. The sequence $$(a_n)_n$$ with $$a_n := aq^{n-1}$$, i.e. $\\left( a_1, a_2, a_3, a_4,\\ldots \\right) = \\left( a, aq, aq^2, aq^3,\\ldots \\right)$ is a geometric sequence. If $$q\\geq1$$ the sequence is monotonically increasing. If $$q<1$$ it is strictly decreasing. The corresponding range $${a,aq,aq^2, aq^3}$$ is finite in the case $$q=1$$ (namely, a singleton), otherwise it is infinite.\n\n#### The Fibonacci sequence\n\nThe Fibonacci sequence is famous because it plays a role in many biological processes, for instance in plant growth, and is frequently found in nature. The recursive definition is:\n\n##### Definition: Fibonacci sequence\n\nLet $$a_0 = a_1 = 1$$ and let $a_n := a_{n-2}+a_{n-1}$ for $$n\\geq2$$. The sequence $$(a_n)_n$$ is then called the Fibonacci sequence. The terms of the sequence are called the Fibonacci numbers.\n\nThe sequence is named after the Italian mathematician Leonardo of Pisa (ca. 1200 AD), also known as Fibonacci (son of Bonacci). He considered the size of a rabbit population and discovered the number sequence: $(1,1,2,3,5,8,13,21,34,55,\\ldots),$\n\n##### Example 3.\n\nThe structure of sunflower heads can be described by a system of two spirals, which radiate out symmetrically but contra rotating from the centre; there are 55 spirals which run clockwise and 34 which run counter-clockwise.\n\nPineapples behave very similarly. There we have 21 spirals running in one direction and 34 running in the other. Cauliflower, cacti, and fir cones are also constructed in this manner.", null, "### Convergence, divergence and limits\n\nThe following chapter deals with the convergence of sequences. We will first introduce the idea of zero sequences. After that we will define the concept of general convergence.\n\n### Preliminary remark: Absolute value in $$\\mathbb{R}$$\n\nThe absolute value function $$x \\mapsto |x|$$ is fundamental in the study of convergence of real number sequences. Therefore we should summarise again some of the main characteristics of the absolute value function:\n\n##### Definition: Absolute Value\n\nFor any given number $$x\\in\\mathbb{R}$$ its absolute value $$|x|$$ is defined by \\begin{aligned}|x|:=\\begin{cases}x & \\text{for }x\\geq0,\\\\ -x & \\text{for }x<0.\\end{cases}\\end{aligned}\n\n##### Theorem: Calculation Rule for the Absolute Value\n\nFor $$x,y\\in\\mathbb{R}$$ the following is always true:\n\n1. $$|x|\\geq0,$$\n\n2. $$|x|=0$$ if and only if $$x=0.$$\n\n3. $$|x\\cdot y|=|x|\\cdot|y|$$ (Multiplicativity)\n\n4. $$|x+y|\\leq|x|+|y|$$ (Triangle Inequality)\n\nProof.\n\nParts 1.-3. Results follow directly from the definition and by dividing it up into separate cases of the different signs of $$x$$ and $$y$$\n\nPart 4. Here we divide the triangle inequality into different cases.\nCase 1.\n\nFirst let $$x,y \\geq 0$$. Then it follows that \\begin{aligned}|x+y|=x+y=|x|+|y|\\end{aligned} and the desired inequality is shown.\n\nCase 2.\n\nNext let $$x,y < 0$$. Then: \\begin{aligned}|x+y|=-(x+y)=(-x)+ (-y)=|x|+|y|\\end{aligned}\n\nCase 3.\n\nFinally we consider the case $$x\\geq 0$$ and $$y<0$$. Here we have two subcases:\n\n• For $$x \\geq -y$$ we have $$x+y\\geq 0$$ and thus $$|x+y|=x+y$$ from the definition of absolute value. Because $$y<0$$ then $$y<-y$$ and therefore also $$x+y < x-y$$. Overall we have: \\begin{aligned}|x+y| = x+y < x-y = |x|+|y|\\end{aligned}\n\n• For $$x < -y$$ then $$x+y<0$$. We have $$|x+y|=-(x+y)=-x-y$$. Because $$x\\geq0$$, we have $$-x < x$$ and thus $$-x-y\\leq x-y$$. Overall we have: \\begin{aligned}|x+y| = -x-y \\leq x-y = |x|+|y|\\end{aligned}\n\nCase 4.\n\nThe case $$x<0$$ and $$y\\geq0$$ we prove it analogously to the case 3, in which $$x$$ and $$y$$ are exchanged.\n\n$$\\square$$\n\n### Zero sequences\n\n##### Definition: Zero sequence\n\nA sequence $$(a_{n})_{n}$$ s called a zero sequence, if for every $$\\varepsilon>0,$$ there exists an index $$n_{0}\\in\\mathbb{N}$$ such that $|a_{n}| < \\varepsilon$ for every $$n\\geq n_{0},\\, n\\in\\mathbb{N}$$. In this case we also say that the sequence converges to zero.\n\nInformally: We have a zero sequence, if the terms of the sequence with high enough indices are arbitrarily close to zero.\n\n##### Example 1.\n\nThe sequence $$(a_n)_n$$ defined by $$a_{n}:=\\frac{1}{n}$$, i.e. $\\left(a_{1},a_{2},a_{3},a_{4},\\ldots\\right):=\\left(\\frac{1}{1},\\frac{1}{2},\\frac{1}{3},\\frac{1}{4},\\ldots\\right)$ is called the harmonic sequence. Clearly, it is positive for all $$n\\in\\mathbb{N}$$, however as $$n$$ increases the absolute value of each term decreases getting closer and closer to zero.\nTake for example $$\\varepsilon := \\frac{1}{5000}$$, then choosing the index $$n_0 = 5000$$, it follows that $$a_n<\\frac{1}{5000}=\\varepsilon$$, for all $$n\\geq n_0$$.\n\n##### Example 2.\n\nConsider the sequence $(a_n)_n \\text{ where } a_n:=\\frac{1}{\\sqrt{n}}.$ Let $$\\varepsilon := \\frac{1}{1000}$$.We then obtain the index $$n_0=1000000$$ in this manner that for all terms $$a_n$$ where $$n\\geq n_0$$ $$a_n < \\frac{1}{1000}=\\varepsilon$$.\n\nNote. To check whether a sequence is a zero sequence, you must choose an (arbitrary) $$\\varepsilon \\in \\mathbb{R}$$ where $$\\varepsilon > 0$$. Then search for a index $$n_0$$, after which all terms $$n$$ are smaller then said $$\\varepsilon$$.\n\n##### Example 3.\n\nWe consider the sequence $$(a_n)_n$$, defined by $a_n := \\left( -1 \\right)^n \\cdot \\frac{1}{n^2}.$\n\nBecause of the factors $$(-1)^n$$ two consecutive terms have different signs; we call a sequence whose signs change in this way an alternating sequence.\n\nWe want to show that this sequence is a zero sequence. According to the definition we have to show that for every $$\\varepsilon > 0$$ there exist $$n_0 \\in \\mathbb{N}$$, such that we have the inequality: $|a_n|< \\varepsilon$ for every term $$a_n$$ where $$n\\geq n_0$$.\n\nProof.\n\nFirstly we let $$\\varepsilon > 0$$ be an arbitrary constant. Because the inequality $$|a_n|< \\varepsilon$$ must hold true for an arbitrary $$\\varepsilon$$ we must find the index $$n_0$$ which depends on each $$\\varepsilon$$. More exactly: The inequality $|a_{n_0}|=\\left| \\frac{1}{{n_0}^2} \\right|= \\frac{1}{{n_0}^2}<\\varepsilon$ must be true for the index $$n_0$$. Solve for $$n_0$$: $n_0 > \\frac{1}{\\sqrt{\\varepsilon}},$ this index $$n_0$$ gives our desired characteristic for every $$\\varepsilon$$.\n\n##### Negative examples\n\nThe following are examples of non-convergent alternating sequences:\n\n• $$a_n = (-1)^n$$\n\n• $$a_n = (-1)^n \\cdot n$$\n\n##### Theorem: Characteristics of Zero sequences\n\nLet $$(a_n)_n$$ and $$(b_n)_n$$ be two sequences. Then:\n\n1. Let $$(a_n)_n$$ be a zero sequence, if $$b_n = a_n$$ or $$b_n = -a_n$$ for all $$n\\in\\mathbb{N}$$ then $$(b_n)_n$$ is also a zero sequence.\n\n2. Let $$(a_n)_n$$ be a zero sequence, if $$-a_n\\leq b_n \\leq a_n$$ for all $$n\\in\\mathbb{N}$$ then $$(b_n)_n$$ is also a zero sequence.\n\n3. Let $$(a_n)_n$$ be a zero sequence, then $$(c\\cdot a_n)_n$$ where $$c \\in \\mathbb{R}$$ is also a zero sequence.\n\n4. If $$(a_n)_n$$ and $$(b_n)_n$$ are zero sequences, then $$(a_n + b_n)_n$$ is also a zero sequence.\n\nProof.\n\nParts 1 and 2. If $$(a_n)_n$$ is a zero sequence, then according to the definition there is an index $$n_0 \\in \\mathbb{N}$$, such that $$|a_n|<\\varepsilon$$ for every $$n\\geq n_0$$ and an arbitrary $$\\varepsilon\\in\\mathbb{R}$$. But then we have $$|b_n|\\leq|a_n|<\\varepsilon$$; this proves parts 1 and 2 are correct.\n\nPart 3. If $$c=0$$, then the result is trivial. Let $$c\\neq0$$ and choose $$\\varepsilon > 0$$ such that \\begin{aligned}|a_n|<\\frac{\\varepsilon}{|c|}\\end{aligned} for all $$n\\geq n_0$$. Rearranging we get: \\begin{aligned} |c|\\cdot|a_n|=|c\\cdot a_n|<\\varepsilon\\end{aligned}\n\nPart 4.\n\nBecause $$(a_n)_n$$ is a zero sequence, by the definition we have $$|a_n|<\\frac{\\varepsilon}{2}$$ for all $$n\\geq n_0$$. Analogously, for the zero sequence $$(b_n)_n$$ there is a $$m_0 \\in \\mathbb{N}$$ with $$|b_n|<\\frac{\\varepsilon}{2}$$ for all $$n\\geq m_0$$.\n\nThen for all $$n > \\max(n_0,m_0)$$ it follows (using the triangle inequality) that: \\begin{aligned}|a_n + b_n|\\leq|a_n|+|b_n|<\\frac{\\varepsilon}{2}+\\frac{\\varepsilon}{2} = \\varepsilon\\end{aligned}\n\n$$\\square$$\n\n### Convergence, divergence\n\nThe concept of zero sequences can be expanded to give us the convergence of general sequences:\n\n##### Definition: Convergence and Divergence\n\nA sequence $$(a_{n})_{n}$$ is called convergent to $$a\\in\\mathbb{R}$$, if for every $$\\varepsilon>0$$ there exists a $$n_{0}$$ such that: $|a_{n}-a| \\lt \\varepsilon \\text{ for all }n\\in\\mathbb{N}_{0},\\text{ where }n\\geq n_{0}$\n\nAn equivalent definition can be defined by:\n\nA sequence $$(a_{n})_{n}$$ is called convergent to $$a\\in\\mathbb{R}$$, if $$(a_{n}-a)_{n}$$ is a zero sequence.\n\n##### Example 4.\n\nWe consider the sequence $$(a_n)_n$$ where $a_n=\\frac{2n^2+1}{n^2+1}.$ By plugging in large values of $$n$$, we can see that for $$n\\to\\infty$$ $$a_n \\to 2$$ and therefore we can postulate that the limit is $$a=2$$.\n\nProof.\n\nFor a vigorous proof, we show that for every $$\\varepsilon > 0$$ there exists an index $$n_0\\in\\mathbb{N}$$, such that for every term $$a_n$$ with $$n>n_0$$ the following relationship holds: $\\left| \\frac{2n^2+1}{n^2+1} - 2\\right| < \\varepsilon.$\n\nFirstly we estimate the inequality: \\begin{aligned}\\left|\\frac{2n^2+1}{n^2+1}-2\\right| =&\\left|\\frac{2n^2+1-2\\cdot\\left(n^2+1\\right)}{n^2+1}\\right| \\\\ =&\\left|\\frac{2n^2+1-2n^2-2}{n^2+1}\\right| \\\\ =&\\left|-\\frac{1}{n^2+1}\\right| \\\\ =&\\left|\\frac{1}{n^2+1}\\right| \\\\ <&\\frac{1}{n}.\\end{aligned}\n\nNow, let $$\\varepsilon > 0$$ be an arbitrary constant. We then choose the index $$n_0\\in\\mathbb{N}$$, such that $n_0 > \\frac{1}{\\varepsilon} \\text{, or equivalently, } \\frac{1}{n_0} < \\varepsilon.$ Finally from the above inequality we have: $\\left|\\frac{2n^2+1}{n^2+1}-2\\right| < \\frac{1}{n} < \\frac{1}{n_0} < \\varepsilon,$ Thus we have proven the claim and so by definition $$a=2$$ is the limit of the sequence.\n\n$$\\square$$\n\nIf a sequence is convergent, then there is exactly one number which is the limit. This characteristic is called the uniqueness of convergence.\n\n##### Theorem: Uniqueness of Convergence\n\nLet $$(a_{n})_{n}$$ be a sequence that converges to $$a\\in\\mathbb{R}$$ and to $$b\\in\\mathbb{R}$$. This implies $$a=b$$.\n\nProof.\n\nAssume $$a\\ne b$$; choose $$\\varepsilon\\in\\mathbb{R}$$ with $$\\varepsilon:=\\frac{1}{3}|a-b|.$$ Then in particular $$[a-\\varepsilon,a+\\varepsilon]\\cap[b-\\varepsilon,b+\\varepsilon]=\\emptyset.$$\n\nBecause $$(a_{n})_{n}$$ converges to $$a$$, there is, according to the definition of convergence, a index $$n_{0}\\in\\mathbb{N}$$ with $$|a_{n}-a|< \\varepsilon$$ for $$n\\geq n_{0}.$$ Furthermore, because $$(a_{n})_{n}$$ converges to $$b$$ there is also a $$\\widetilde{n_{0}}\\in\\mathbb{N}$$ with $$|a_{n}-b|< \\varepsilon$$ for $$n\\geq\\widetilde{n_{0}}.$$ For $$n\\geq\\max\\{n_{0},\\widetilde{n_{0}}\\}$$ we have: \\begin{aligned}\\varepsilon\\ = &\\ \\frac{1}{3}|a-b| \\Rightarrow\\\\ 3\\varepsilon\\ = &\\ |a-b|\\\\ = &\\ |(a-a_{n})+(a_{n}-b)|\\\\ \\leq &\\ |a_{n}-a|+|a_{b}-b|\\\\ < &\\ \\varepsilon+\\varepsilon=2\\varepsilon,\\end{aligned} Consequently we have obtained $$3\\varepsilon\\leq2\\varepsilon$$, which is a contradiction as $$\\varepsilon>0$$. Therefore the assumption must be wrong, so $$a=b$$.\n\n$$\\square$$\n\n##### Definition: Divergent, Limit\n\nIf provided that a sequence $$(a_{n})_{n}$$ and an $$a\\in\\mathbb{R}$$ exist, to which the sequence converges, then the sequence is called convergent and $$a$$ is called the limit of the sequence, otherwise it is called divergent.\n\nNotation. $$(a_{n})_{n}$$ is convergent to $$a$$ is also written: $a_{n}\\rightarrow a,\\text{ or }\\lim_{n\\rightarrow\\infty}a_{n}=a.$ Such notation is allowed, as the limit of a sequence is always unique by the above Theorem (provided it exists).\n\n##### Theorem: Bounded Sequences\n\nA convergent sequence $$(a_n)_n$$ is bounded i.e. there exists a constant $$r\\in\\mathbb{R}$$ such that: $|a_n| \\lt r$ for all $$n\\in\\mathbb{N}$$.\n\nProof.\n\nWe assume that the sequence $$(a_n)_n$$ has the limit $$a$$. By the definition of convergence, we have that $$|a_n - a|<\\varepsilon$$ for all $$\\varepsilon \\in \\mathbb{R}$$ and $$n\\geq n_0$$. Choosing $$\\varepsilon = 1$$ gives:\n\\begin{aligned}|a_n|-|a|&\\ \\leq |a_n -a| \\\\ &\\ < 1,\\end{aligned} And therefore also $$|a_n|\\leq |a|+1$$.\n\nThus for all $$n\\in \\mathbb{N}$$: $|a_n|\\leq \\max \\left\\{ |a_1|,|a_2|,\\ldots,|a_{n_0}|,|a|+1 \\right\\}=:r$\n\n$$\\square$$\n\n### Rules for convergent sequences\n\n##### Theorem: Subsequences\n\nLet $$(a_{n})_{n}$$ be a sequence such that $$a_{n}\\rightarrow a$$ and let $$(a_{\\varphi(n)})_{n}$$ be a subsequence of $$(a_{n})_{n}$$. Then it follows that $$(a_{\\varphi(n)})_{n}\\rightarrow a$$.\n\nInformally: If a sequence is convergent then all of its subsequences are also convergent and in fact converge to the same limit as the original.\n\nProof.\n\nBy the definition of a subsequence $$\\varphi(n)\\geq n$$. Because $$a_{n}\\rightarrow a$$ it is implicated that $$|a_{n}-a|<\\varepsilon$$ for $$n\\geq n_{0}$$, therefore $$|a_{\\varphi(n)}-a|<\\varepsilon$$ for these indices $$n$$.\n\n$$\\square$$\n\n##### Theorem: Rules\n\nLet $$(a_{n})_{n}$$ and $$(b_{n})_{n}$$ be sequences with $$a_{n}\\rightarrow a$$ and $$b_{n}\\rightarrow b$$. Then for $$\\lambda, \\mu \\in \\mathbb{R}$$ it follows that:\n\n1. $$\\lambda \\cdot (a_n)+\\mu \\cdot (b_n) \\to \\lambda \\cdot a + \\mu \\cdot b$$\n\n2. $$(a_n)\\cdot (b_n) \\to a\\cdot b$$\n\nInformally: Sums, differences and products of convergent sequences are convergent.\n\nProof.\n\nPart 1. Let $$\\varepsilon > 0$$. We must show, that for all $$n \\geq n_0$$ it follows that: $|\\lambda \\cdot a_n + \\mu \\cdot b_n - \\lambda \\cdot a - \\mu \\cdot b| < \\varepsilon.$ The left hand side we estimate using: $|\\lambda (a_n-a)+\\mu (b_n - b)| \\leq |\\lambda|\\cdot|a_n-a|+|\\mu|\\cdot|b_n-b|.$\n\nBecause $$(a_n)_n$$ and $$(b_n)_n$$ converge, for each given $$\\varepsilon > 0$$ it holds true that: \\begin{aligned}|a_n - a| <\\ \\varepsilon_1 := &\\ \\textstyle \\frac{\\varepsilon}{2|\\lambda|} \\text{ for all }n\\geq n_0\\\\ |b_n - b| <\\ \\varepsilon_2 := &\\ \\textstyle \\frac{\\varepsilon}{2|\\mu|} \\text{ for all }n\\geq n_1\\end{aligned}\n\nTherefore \\begin{aligned}|\\lambda|\\cdot|a_n-a|+|\\mu|\\cdot|b_n-b| < &\\ |\\lambda|\\varepsilon_1 + |\\mu|\\varepsilon_2 \\\\ = &\\ \\textstyle{ \\frac{\\varepsilon}{2} + \\frac{\\varepsilon}{2} } = \\varepsilon\\end{aligned} for all numbers $$n \\geq \\max \\{n_0,n_1\\}$$. Therefore the sequence $\\left( \\lambda \\left( a_n - a \\right) + \\mu \\left( b_n - b \\right) \\right)_n$ is a zero sequence and the desired inequality is shown.\n\nPart 2. Let $$\\varepsilon > 0$$. We have to show, that for all $$n > n_0$$ $|a_n b_n - a b| < \\varepsilon.$ Furthermore an estimation of the left hand side follows: \\begin{aligned} |a_n b_n - a b| =&\\ |a_n b_n - a b_n + a b_n - ab| \\\\ \\leq &\\ |b_n|\\cdot|a_n-a| + |a|\\cdot|b_n - b|.\\end{aligned} We choose a number $$B$$, such that $$|b_n| \\lt b$$ for all $$n$$ and $$|a| \\lt b$$. Such a value of $$B$$ exists by the Theorem of convergent sequences being bounded. We can then use the estimation: \\begin{aligned}|b_n|\\cdot|a_n-a| + |a|\\cdot|b_n - b| <&\\ B \\cdot \\left(|a_n - a| + |b_n - b| \\right).\\end{aligned} For all $$n>n_0$$ we have $$|a_n - a|<\\frac{\\varepsilon}{2\\cdot B}$$ and $$|b_n - b|<\\frac{\\varepsilon}{2\\cdot B}$$, and - putting everything together - the desired inequality it shown.\n\n$$\\square$$" ]
[ null, "https://mycourses.aalto.fi/draftfile.php/799428/user/draft/567529048/kugeln_000.jpg", null, "https://mycourses.aalto.fi/draftfile.php/799428/user/draft/567529048/dreiecks_zahlen.jpg", null, "https://mycourses.aalto.fi/draftfile.php/799428/user/draft/567529048/kugeln_001.jpg", null, "https://mycourses.aalto.fi/draftfile.php/799428/user/draft/567529048/kugeln_002.jpg", null, "https://mycourses.aalto.fi/draftfile.php/799428/user/draft/567529048/kugeln_003.jpg", null, "https://mycourses.aalto.fi/draftfile.php/799428/user/draft/567529048/sonnenblume_klein.jpg", null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.76076454,"math_prob":1.0000044,"size":22011,"snap":"2021-31-2021-39","text_gpt3_token_len":7534,"char_repetition_ratio":0.17480801,"word_repetition_ratio":0.032901295,"special_character_ratio":0.35995638,"punctuation_ratio":0.11905861,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":1.0000092,"pos_list":[0,1,2,3,4,5,6,7,8,9,10,11,12],"im_url_duplicate_count":[null,2,null,2,null,2,null,2,null,2,null,2,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2021-09-26T05:44:21Z\",\"WARC-Record-ID\":\"<urn:uuid:b62280f5-3d54-45fe-9aa2-92a7df41f693>\",\"Content-Length\":\"127254\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:33eadb42-9128-4a2b-877a-ca1d7711b023>\",\"WARC-Concurrent-To\":\"<urn:uuid:d2070710-5115-4ca3-ad35-9207c558e714>\",\"WARC-IP-Address\":\"130.233.236.7\",\"WARC-Target-URI\":\"https://openlearning.aalto.fi/mod/book/view.php?id=10324\",\"WARC-Payload-Digest\":\"sha1:P4HNIXLZQBXWGW3ZKL2VEOENVJHYCL7A\",\"WARC-Block-Digest\":\"sha1:HC6LOTZFGQ2SYJMTILPH7WXR6J4OUVEF\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2021/CC-MAIN-2021-39/CC-MAIN-2021-39_segments_1631780057830.70_warc_CC-MAIN-20210926053229-20210926083229-00442.warc.gz\"}"}
https://www.rcps.us/domain/179
[ "# Mathematics\n\n•", null, "The Mathematics Standards of Learning identify essential academic content at each grade level for sequential learning. The content of the mathematics standards supports the following five goals for students: becoming mathematical problem solvers, communicating mathematically, reasoning mathematically, making mathematical connections and using mathematical representations to model and interpret practical situations. Roanoke County Schools is dedicated to helping all students achieve these goals." ]
[ null, "https://www.rcps.us/cms/lib/VA01818713/Centricity/Domain/179/piguy.jpg", null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.86463946,"math_prob":0.6037605,"size":606,"snap":"2022-27-2022-33","text_gpt3_token_len":113,"char_repetition_ratio":0.17774086,"word_repetition_ratio":0.0,"special_character_ratio":0.17656766,"punctuation_ratio":0.11363637,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9913791,"pos_list":[0,1,2],"im_url_duplicate_count":[null,6,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2022-08-17T19:17:09Z\",\"WARC-Record-ID\":\"<urn:uuid:51ce6223-a53e-49ed-8c2c-ffdf45e90872>\",\"Content-Length\":\"347775\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:a305cb50-c390-4cac-8db3-8a8079d0b589>\",\"WARC-Concurrent-To\":\"<urn:uuid:5a83c936-b8fa-491c-9060-ab2b01911fd7>\",\"WARC-IP-Address\":\"99.84.108.27\",\"WARC-Target-URI\":\"https://www.rcps.us/domain/179\",\"WARC-Payload-Digest\":\"sha1:HFNOVY67U22EEKESYXGSCEZKV7FNZHHB\",\"WARC-Block-Digest\":\"sha1:WVXO7TLT2SDJYNEXHHIJZ4KCSDWJ2BQL\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2022/CC-MAIN-2022-33/CC-MAIN-2022-33_segments_1659882573104.24_warc_CC-MAIN-20220817183340-20220817213340-00230.warc.gz\"}"}
https://metanumbers.com/100902500
[ "# 100902500 (number)\n\n100,902,500 (one hundred million nine hundred two thousand five hundred) is an even nine-digits composite number following 100902499 and preceding 100902501. In scientific notation, it is written as 1.009025 × 108. The sum of its digits is 17. It has a total of 7 prime factors and 30 positive divisors. There are 40,360,000 positive integers (up to 100902500) that are relatively prime to 100902500.\n\n## Basic properties\n\n• Is Prime? No\n• Number parity Even\n• Number length 9\n• Sum of Digits 17\n• Digital Root 8\n\n## Name\n\nShort name 100 million 902 thousand 500 one hundred million nine hundred two thousand five hundred\n\n## Notation\n\nScientific notation 1.009025 × 108 100.9025 × 106\n\n## Prime Factorization of 100902500\n\nPrime Factorization 22 × 54 × 40361\n\nComposite number\nDistinct Factors Total Factors Radical ω(n) 3 Total number of distinct prime factors Ω(n) 7 Total number of prime factors rad(n) 403610 Product of the distinct prime numbers λ(n) -1 Returns the parity of Ω(n), such that λ(n) = (-1)Ω(n) μ(n) 0 Returns: 1, if n has an even number of prime factors (and is square free) −1, if n has an odd number of prime factors (and is square free) 0, if n has a squared prime factor Λ(n) 0 Returns log(p) if n is a power pk of any prime p (for any k >= 1), else returns 0\n\nThe prime factorization of 100,902,500 is 22 × 54 × 40361. Since it has a total of 7 prime factors, 100,902,500 is a composite number.\n\n## Divisors of 100902500\n\n30 divisors\n\n Even divisors 20 10 10 0\nTotal Divisors Sum of Divisors Aliquot Sum τ(n) 30 Total number of the positive divisors of n σ(n) 2.20659e+08 Sum of all the positive divisors of n s(n) 1.19757e+08 Sum of the proper positive divisors of n A(n) 7.3553e+06 Returns the sum of divisors (σ(n)) divided by the total number of divisors (τ(n)) G(n) 10045 Returns the nth root of the product of n divisors H(n) 13.7183 Returns the total number of divisors (τ(n)) divided by the sum of the reciprocal of each divisors\n\nThe number 100,902,500 can be divided by 30 positive divisors (out of which 20 are even, and 10 are odd). The sum of these divisors (counting 100,902,500) is 220,659,054, the average is 735,530,1.8.\n\n## Other Arithmetic Functions (n = 100902500)\n\n1 φ(n) n\nEuler Totient Carmichael Lambda Prime Pi φ(n) 40360000 Total number of positive integers not greater than n that are coprime to n λ(n) 1009000 Smallest positive number such that aλ(n) ≡ 1 (mod n) for all a coprime to n π(n) ≈ 5803043 Total number of primes less than or equal to n r2(n) 40 The number of ways n can be represented as the sum of 2 squares\n\nThere are 40,360,000 positive integers (less than 100,902,500) that are coprime with 100,902,500. And there are approximately 5,803,043 prime numbers less than or equal to 100,902,500.\n\n## Divisibility of 100902500\n\n m n mod m 2 3 4 5 6 7 8 9 0 2 0 0 2 6 4 8\n\nThe number 100,902,500 is divisible by 2, 4 and 5.\n\n• Abundant\n\n• Polite\n\n• Frugal\n\n## Base conversion (100902500)\n\nBase System Value\n2 Binary 110000000111010011001100100\n3 Ternary 21000212101012122\n4 Quaternary 12000322121210\n5 Quinary 201312340000\n6 Senary 14002405112\n8 Octal 600723144\n10 Decimal 100902500\n12 Duodecimal 29960798\n20 Vigesimal 1bacg50\n36 Base36 1o2ov8\n\n## Basic calculations (n = 100902500)\n\n### Multiplication\n\nn×y\n n×2 201805000 302707500 403610000 504512500\n\n### Division\n\nn÷y\n n÷2 5.04512e+07 3.36342e+07 2.52256e+07 2.01805e+07\n\n### Exponentiation\n\nny\n n2 10181314506250000 1027320086966890625000000 103659165075176681289062500000000 10459468903998015083769628906250000000000\n\n### Nth Root\n\ny√n\n 2√n 10045 465.551 100.225 39.8823\n\n## 100902500 as geometric shapes\n\n### Circle\n\n Diameter 2.01805e+08 6.33989e+08 3.19855e+16\n\n### Sphere\n\n Volume 4.30323e+24 1.27942e+17 6.33989e+08\n\n### Square\n\nLength = n\n Perimeter 4.0361e+08 1.01813e+16 1.42698e+08\n\n### Cube\n\nLength = n\n Surface area 6.10879e+16 1.02732e+24 1.74768e+08\n\n### Equilateral Triangle\n\nLength = n\n Perimeter 3.02708e+08 4.40864e+15 8.73841e+07\n\n### Triangular Pyramid\n\nLength = n\n Surface area 1.76346e+16 1.21071e+23 8.23865e+07\n\n## Cryptographic Hash Functions\n\nmd5 771b8fdf377de5a2e1a60b15a65cd295 741c8e2f8dd8155a95a3a8f43d92bd52e29367f2 9d99fb4707398fb5959a0e1cd424d90738b8172da891bbc62b6f50dc55bfafec 5fe666d56a385346af00a07a8e9d02139f163786ea1f15aa78073bc8c6d1047a377ee4a6b9a6d169cd9c85927347c3df230899613c857b5c05b47ba7d0b97cbc 4f77d7629013ba926144e92c0fb484eada7d4da9" ]
[ null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.6176201,"math_prob":0.9873689,"size":4894,"snap":"2021-43-2021-49","text_gpt3_token_len":1739,"char_repetition_ratio":0.12699386,"word_repetition_ratio":0.03377386,"special_character_ratio":0.48855743,"punctuation_ratio":0.093446605,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9948272,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2021-12-02T01:27:11Z\",\"WARC-Record-ID\":\"<urn:uuid:09b2ff8a-ec47-4162-9426-d99436a1c2ac>\",\"Content-Length\":\"40665\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:ee90c840-5ba7-48b6-a99b-42ff17f2f2a8>\",\"WARC-Concurrent-To\":\"<urn:uuid:2f652f88-0e03-4e87-a828-5e8b39483703>\",\"WARC-IP-Address\":\"46.105.53.190\",\"WARC-Target-URI\":\"https://metanumbers.com/100902500\",\"WARC-Payload-Digest\":\"sha1:6PMJXNKWBQEISPPSMTP4TLPXPGNENGP6\",\"WARC-Block-Digest\":\"sha1:EJBWAQAMSBYAVQWPFLTQLYHPLQFI4WDL\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2021/CC-MAIN-2021-49/CC-MAIN-2021-49_segments_1637964361064.58_warc_CC-MAIN-20211201234046-20211202024046-00100.warc.gz\"}"}
https://calcopedia.com/logarithm/
[ "# Logarithm Calculator\n\nCompute natural, decimal logarithms (or with other bases) online with a solution.\n\nLogarithm equals:\n\n0copy\n\nContents\n\n## What are Logarithms and How to Calculate Them?", null, "A logarithm is the inverse operation to exponentiation, just as subtraction is the inverse of addition and division is the inverse of multiplication. Logarithms are used to solve equations in which the variable is in the exponent position.\n\nFor instance, the base 10 logarithm of 1000 is 3. This means that 10 raised to the power of 3 equals 1000. It`s commonly written as log10(1000) = 3.\n\nIf we have a logarithm written as logb(x) = y, it can be converted to its exponential form as: by = x.\n\nLogarithms are widely used in various scientific fields such as astronomy, biology, and engineering to simplify calculations of very large or very small numbers.\n\n## How to Use the Logarithm Calculator?\n\nOur logarithm calculator is a handy tool designed to help you compute logarithms without the complexities of manual calculations. Here`s a step-by-step guide:\n\n1. Navigate to the main interface of the calculator.\n\n2. Choose the base of the logarithm. Common bases are 10 (common logarithm) and 'e' (natural logarithm).\n\n3. Enter the number for which you want to compute the logarithm in the given input field.\n\n4. Click on the 'Calculate' button.\n\n5. The calculator will instantly display the result on the screen.\n\n6. Optionally, you can also view the detailed solution by clicking on the 'Show Solution' option.\n\n7. To compute another logarithm, simply clear the input fields and repeat the process.\n\n## Examples of Calculating Logarithms\n\nLogarithms might seem abstract, but they pop up in surprising, and sometimes humorous, real-life situations. Let`s dive into a few:\n\nExample 1: Imagine you're trying to figure out how many digits a number has, and someone cheekily tells you to use logarithms. If you have the number 1000, you can quickly deduce it has 4 digits. The base 10 logarithm of 1000 is 3, add 1, and there you have it!\n\nExample 2: Suppose you're at a party and someone challenges you to a decibel (dB) contest. They mention that every 10 dB increase represents a tenfold increase in intensity. If you go from 10 dB to 40 dB, the intensity increased by 10^3 or 1000 times! Logarithms make sound math fun!\n\nExample 3: Let`s say you’re a coffee enthusiast and you read that caffeine decay in the body is modeled by a logarithmic function. If you consume 200mg of caffeine, and half of it is gone after 4 hours (thanks to your liver), the decay can be understood using logarithms.\n\n## Nuances of Calculating Logarithms\n\nLogarithms, though powerful, come with their own set of quirks and intricacies. Here are some to keep in mind:\n\n1. Logarithms of numbers less than or equal to zero are undefined in the real number system.\n\n2. The logarithm of 1, no matter the base, is always 0.\n\n3. Natural logarithms have the irrational number 'e' (approximately 2.71828) as their base.\n\n4. Changing the base of a logarithm involves a formula: logb(x) = loga(x) / loga(b).\n\n5. The product rule states: logb(xy) = logb(x) + logb(y).\n\n6. The quotient rule: logb(x/y) = logb(x) - logb(y).\n\n7. The power rule: logb(xy) = y * logb(x).\n\n8. Logarithmic equations often have extraneous solutions, so always verify your results!\n\n9. Remember: logb(b) = 1, no matter what value 'b' has (except when b ≤ 0 or b = 1).\n\n10. When using calculators, ensure you know which base the calculator defaults to, typically either base 10 or 'e'.\n\n### Why are logarithms useful?\n\nLogarithms provide a way to handle very large or very small numbers, simplify calculations, and solve problems related to exponential growth and decay.\n\n### What is the base of a natural logarithm?\n\n\"e\", an irrational number approximately equal to 2.71828, is the base of natural logarithms.\n\n### Can I compute the logarithm of a negative number?\n\nIn the real number system, the logarithm of a negative number is undefined.\n\n### What is the difference between common and natural logarithms?\n\nCommon logarithms have a base of 10, while natural logarithms use the base \"e\".\n\n### How do I change the base of a logarithm?\n\nTo change the base, use the formula: log<sub>b</sub>(x) = log<sub>a</sub>(x) / log<sub>a</sub>(b).\n\n## Similar calculators\n\nYou may find the following calculators on the same topic useful:\n\n## Share on social media\n\nIf you liked it, please share the calculator on your social media platforms. It`s easy for you and beneficial for the project`s promotion. Thank you!\n\n### Do you have anything to add?\n\nFeel free to share your opinion, comment, or suggestion." ]
[ null, "https://calcopedia.com/images/logarithm.svg", null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.8908069,"math_prob":0.9760925,"size":6337,"snap":"2023-40-2023-50","text_gpt3_token_len":1434,"char_repetition_ratio":0.17069319,"word_repetition_ratio":0.13119534,"special_character_ratio":0.22597444,"punctuation_ratio":0.12677231,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9984691,"pos_list":[0,1,2],"im_url_duplicate_count":[null,1,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2023-12-01T05:46:49Z\",\"WARC-Record-ID\":\"<urn:uuid:b9579f28-cfcc-4c5c-9618-57b412b1b1e4>\",\"Content-Length\":\"27178\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:cad00751-52e8-4fcc-b29f-aa63e797a7c8>\",\"WARC-Concurrent-To\":\"<urn:uuid:7209690c-891b-4a3f-9423-ac1ac2d3489f>\",\"WARC-IP-Address\":\"104.21.77.90\",\"WARC-Target-URI\":\"https://calcopedia.com/logarithm/\",\"WARC-Payload-Digest\":\"sha1:KDYJHHBW37RSRVJPYGSAD75JMWS2QB27\",\"WARC-Block-Digest\":\"sha1:UHYQZWB4NKHXUX5MZLLSKYSIX6HTPHZU\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2023/CC-MAIN-2023-50/CC-MAIN-2023-50_segments_1700679100276.12_warc_CC-MAIN-20231201053039-20231201083039-00349.warc.gz\"}"}
http://www.tribonet.org/hertzian-stress-subsurface-calculator-line-contact/
[ "This is a Hertzian stress calculator for subsurface stress components in case of a contact between cylinders (line contact). Equations and the references are given below the calculator.\n\nAs shown in the figure, a contact of two cylinders is considered here. Hertzian subsurface stresses can be obtained using following equations:\n\n(1)", null, "where", null, "is the stress component in x direction,", null, "is the maximum Hertzian pressure and", null, "is Hertzian contact radius.Please find all the related equations here. Corresponding Matlab code for Hertzian solution can be found here. The online Hertzian contact stress calculator can be found here.\n\nEquations were taken from .\n\n. Contact Mechanics and Friction: Physical Principles and Applications, V. Popov, 2010\n\n•\n•\n•\n•" ]
[ null, "http://www.tribonet.org/wp-content/plugins/native-lazyload/assets/images/placeholder.svg", null, "http://www.tribonet.org/wp-content/plugins/native-lazyload/assets/images/placeholder.svg", null, "http://www.tribonet.org/wp-content/plugins/native-lazyload/assets/images/placeholder.svg", null, "http://www.tribonet.org/wp-content/plugins/native-lazyload/assets/images/placeholder.svg", null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.8809045,"math_prob":0.9828355,"size":739,"snap":"2020-24-2020-29","text_gpt3_token_len":154,"char_repetition_ratio":0.16054422,"word_repetition_ratio":0.0,"special_character_ratio":0.19215156,"punctuation_ratio":0.12403101,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.99804527,"pos_list":[0,1,2,3,4,5,6,7,8],"im_url_duplicate_count":[null,null,null,null,null,null,null,null,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2020-05-29T20:59:32Z\",\"WARC-Record-ID\":\"<urn:uuid:e2d124ce-4294-4cc5-9871-b84318cf193e>\",\"Content-Length\":\"95513\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:7f44964a-3845-449e-8b9b-33b3fa957186>\",\"WARC-Concurrent-To\":\"<urn:uuid:e6c35a7e-4436-4939-a1c5-796079a3dba3>\",\"WARC-IP-Address\":\"104.27.145.108\",\"WARC-Target-URI\":\"http://www.tribonet.org/hertzian-stress-subsurface-calculator-line-contact/\",\"WARC-Payload-Digest\":\"sha1:2T3XNGTKMRK3VD74QHD4TIMJHLQJKLI4\",\"WARC-Block-Digest\":\"sha1:NCZWFUIU2CLOWWUNGDZRGJNKEFUH2LW4\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2020/CC-MAIN-2020-24/CC-MAIN-2020-24_segments_1590347406365.40_warc_CC-MAIN-20200529183529-20200529213529-00474.warc.gz\"}"}
https://blog.softhints.com/pandas-check-value-column-contained-another-column-same-row/
[ "In this guide, I'll show you how to find if value in one string or list column is contained in another string column in the same row. In the article are present 3 different ways to achieve the same result.\n\nThese examples can be used to find a relationship between two columns in a DataFrame.\n\nDataset: IMDB 5000 Movie Dataset\n\n## Step 1: Check If String Column Contains Substring of Another with Function\n\nThe first solution is the easiest one to understand and work it. It is easy for customization and maintenance.\n\nTo start, we will define a function which will be used to perform the check. Then the function will be invoked by using `apply`:\n\n``````def find_value_column(row):\nreturn row.country in row.movie_title\n\ndf[df.apply(find_value_column, axis=1)][['movie_title', 'country']]\n``````\n\nwhich will result in:\n\nmovie_title country\n196 Australia Australia\n2504 McFarland, USA USA\n\nWhat will happen if there are NaN values in one of the columns?\n\n``````def find_value_column(row):\nreturn row.movie_title.lower().strip() in row.plot_keywords\n\n``````\n\nThen error will be raised:\n\n``````TypeError: (\"argument of type 'float' is not iterable\", 'occurred at index 4')\n``````\n\nThere is easy solution for this error - convert the column NaN values to empty list values thus:\n\n``````for row in df.loc[df.plot_keywords.isnull(), 'plot_keywords'].index:\ndf.at[row, 'plot_keywords'] = []\n``````\n\nnow we get proper results like:", null, "## Step 2: Check If Column Contains Another Column with Lambda\n\nThe second solution is similar to the first - in terms of performance and how it is working - one but this time we are going to use `lambda`. The advantage of this way is - shortness:\n\n``````df[df.apply(lambda x: x.country in x.movie_title, axis=1)][['movie_title', 'country']]\n``````\nmovie_title country\n196 Australia Australia\n2504 McFarland, USA USA\n\nA possible disadvantage of this method is the need to know how `apply` and `lambda` works and how to deal with errors if any.\n\nFor example this piece of code similar but will result in error like:\n\n``````df.apply(lambda row: df.country in df.movie_title, axis=1)\n``````\n\noutput:\n\n``````TypeError: (\"'Series' objects are mutable, thus they cannot be hashed\", 'occurred at index 0')\n``````\n\nIt may be obvious for some people but a novice will have hard time to understand what is going on.\n\n## Step 3: Fastest Way to Check If One Column Contains Another\n\nThis solution is the fastest one. It is short and easy to understand. It includes `zip` on the selected data. In this case data can be used from two different DataFrames.\n\n``````df[[x in x for x in zip(df['country'], df['movie_title'])]][['movie_title', 'country']]\n``````\nmovie_title country\n196 Australia Australia\n2504 McFarland, USA USA\n\nagain if the column contains NaN values they should be filled with default values like:\n\n``````df['country'].fillna('Uknown', inplace=True)\n``````\n\n## Step 4: For Loop and df.iterrows() Version\n\nThe final solution is the most simple one and it's suitable for beginners. Iterates over the rows one by one and perform the check. This solution is the slowest one:\n\n``````for i, row in df.iterrows():\nif row.country in row.movie_title:\nprint(row.country, row.movie_title)\n``````\n\nresult:\n\n``````Australia Australia\nUSA McFarland, USA\n``````\n\n## Bonus Step: Check If List Column Contains Substring of Another with Function\n\nNow lets assume that we would like to check if any value from column plot_keywords:\n\n• avatar|future|marine|native|paraplegic\n• bomb|espionage|sequel|spy|terrorist\n\nis part of the movie title.\n\nIn this case we can:\n\n1. split the string column into a list\n2. convert NaN values to empty list\n3. perform search for each word in the list against the title\n``````df['keywords'] = df.plot_keywords.str.split('|')\n``````\n\nNow we have two different options:\n\nSkip the conversion of NaN but check them in the function:\n\n``````def find_value_column(row):\nif isinstance(row['keywords'], list):\nfor keyword in row['keywords']:\nreturn keyword in row.movie_title.lower()\nelse:\nreturn False\n\n``````\n\nor\n\nConvert all the NaN values:\n\n``````df['keywords'] = df['keywords'].apply(lambda d: d if isinstance(d, list) else [])\n\ndef find_value_column(row):\nfor keyword in row['keywords']:\nreturn keyword in row.movie_title.lower()\nreturn False\n\n``````\n\nresults in:", null, "## Performance check\n\nBelow you can find results of all solutions and compare their speed:\n\n• 10 loops, best of 3: 152 ms per loop\n• 10 loops, best of 3: 153 ms per loop\n• 1000 loops, best of 3: 1.69 ms per loop\n• 1 loop, best of 3: 580 ms per loop\n\nSo the one in step 3 - zip one - is the fastest and outperform the others by magnitude. In my everyday work I prefer to use 2 and 3(for high volume data) in most cases and only in some case 1 - when there is complex logic to be implemented.\n\n## Related Articles\n\nbetter programmer\n\nPython\n\nPython\n\nSelenium\n\nPyCharm\n\nPython" ]
[ null, "https://blog.softhints.com/content/images/2020/03/pandas_search_one_column_in_another.png", null, "https://blog.softhints.com/content/images/2020/03/pandas_search_list_column_in_another.png", null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.62733835,"math_prob":0.65438026,"size":4791,"snap":"2020-45-2020-50","text_gpt3_token_len":1159,"char_repetition_ratio":0.12805516,"word_repetition_ratio":0.051034484,"special_character_ratio":0.25610518,"punctuation_ratio":0.14437367,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.953699,"pos_list":[0,1,2,3,4],"im_url_duplicate_count":[null,1,null,1,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2020-10-27T15:42:24Z\",\"WARC-Record-ID\":\"<urn:uuid:77dab7fa-5f85-4232-8111-11215409fbd8>\",\"Content-Length\":\"65464\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:bd8f36f5-de3d-4b8e-a1c4-a9da9b100b01>\",\"WARC-Concurrent-To\":\"<urn:uuid:fda0f332-bb2b-4b14-b97f-94f1cc205e2c>\",\"WARC-IP-Address\":\"104.31.78.61\",\"WARC-Target-URI\":\"https://blog.softhints.com/pandas-check-value-column-contained-another-column-same-row/\",\"WARC-Payload-Digest\":\"sha1:YH47SXQFPCUU4EOG2WAT5A54UQDZCDWF\",\"WARC-Block-Digest\":\"sha1:S652DWWCEOGZ7HTOHZWVVCMCOTENIKZJ\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2020/CC-MAIN-2020-45/CC-MAIN-2020-45_segments_1603107894203.73_warc_CC-MAIN-20201027140911-20201027170911-00545.warc.gz\"}"}
https://blog.razrlele.com/p/1485
[ "# POJ1006\n\nWritten by    20:41 February 1, 2016\n\nPOJ1006\n\nBiorhythms\n Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 124772 Accepted: 39392\n\nDescription\n\nSome people believe that there are three cycles in a person’s life that start the day he or she is born. These three cycles are the physical, emotional, and intellectual cycles, and they have periods of lengths 23, 28, and 33 days, respectively. There is one peak in each period of a cycle. At the peak of a cycle, a person performs at his or her best in the corresponding field (physical, emotional or mental). For example, if it is the mental curve, thought processes will be sharper and concentration will be easier.\nSince the three cycles have different periods, the peaks of the three cycles generally occur at different times. We would like to determine when a triple peak occurs (the peaks of all three cycles occur in the same day) for any person. For each cycle, you will be given the number of days from the beginning of the current year at which one of its peaks (not necessarily the first) occurs. You will also be given a date expressed as the number of days from the beginning of the current year. You task is to determine the number of days from the given date to the next triple peak. The given date is not counted. For example, if the given date is 10 and the next triple peak occurs on day 12, the answer is 2, not 3. If a triple peak occurs on the given date, you should give the number of days to the next occurrence of a triple peak.\n\nInput\n\nYou will be given a number of cases. The input for each case consists of one line of four integers p, e, i, and d. The values p, e, and i are the number of days from the beginning of the current year at which the physical, emotional, and intellectual cycles peak, respectively. The value d is the given date and may be smaller than any of p, e, or i. All values are non-negative and at most 365, and you may assume that a triple peak will occur within 21252 days of the given date. The end of input is indicated by a line in which p = e = i = d = -1.\n\nOutput\n\nFor each test case, print the case number followed by a message indicating the number of days to the next triple peak, in the form:\n\nCase 1: the next triple peak occurs in 1234 days.\n\nUse the plural form days” even if the answer is 1.\n\nSample Input\n\nSample Output\n\nSource\n\n(n+d)%23 == p%23\n(n+d)%28 == e%28\n(n+d)%33 == i%33\n\n### 代码\n\nCategory : acmstudy\n\nTags :" ]
[ null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.7955831,"math_prob":0.9892483,"size":5145,"snap":"2019-43-2019-47","text_gpt3_token_len":1684,"char_repetition_ratio":0.17409064,"word_repetition_ratio":0.37448132,"special_character_ratio":0.32555878,"punctuation_ratio":0.11433757,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9658275,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2019-11-12T06:56:19Z\",\"WARC-Record-ID\":\"<urn:uuid:64f47197-8079-4471-81ec-3586aa825349>\",\"Content-Length\":\"67321\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:dae9f6e9-a235-45b3-8005-ec659c40f0d1>\",\"WARC-Concurrent-To\":\"<urn:uuid:19bc8b8f-152d-49f4-8e22-8482995d91d2>\",\"WARC-IP-Address\":\"39.107.79.199\",\"WARC-Target-URI\":\"https://blog.razrlele.com/p/1485\",\"WARC-Payload-Digest\":\"sha1:5AJZJLNY5XIZMZVSPHXBV3GXTXU6A2EQ\",\"WARC-Block-Digest\":\"sha1:U3N7N64ROSIW6MBDDMQP3H5MTTDNWKGR\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2019/CC-MAIN-2019-47/CC-MAIN-2019-47_segments_1573496664752.70_warc_CC-MAIN-20191112051214-20191112075214-00134.warc.gz\"}"}
https://gitlab.linphone.org/BC/public/external/libvpx/commit/cc0eeda6ddaa76f1e7170980d11b3093d70b3d62
[ "### Fix mismatch check output\n\n```Fixes a condition where the address of the mismatching pixels was not\nbeing found/printed.\n\nChange-Id: Ifac5cd3471bc2437448128591eea7c7b87e2d8fe```\nparent 9831f205\n ... ... @@ -1517,7 +1517,7 @@ static void find_mismatch(vpx_image_t *img1, vpx_image_t *img2, uloc = uloc = uloc = uloc = -1; for (i = 0, match = 1; match && i < c_h; i += bsizey) { for (j = 0; j < match && c_w; j += bsizex) { for (j = 0; match && j < c_w; j += bsizex) { int k, l; int si = mmin(i + bsizey, c_h - i); int sj = mmin(j + bsizex, c_w - j); ... ... @@ -1541,7 +1541,7 @@ static void find_mismatch(vpx_image_t *img1, vpx_image_t *img2, } vloc = vloc = vloc = vloc = -1; for (i = 0, match = 1; match && i < c_h; i += bsizey) { for (j = 0; j < match && c_w; j += bsizex) { for (j = 0; match && j < c_w; j += bsizex) { int k, l; int si = mmin(i + bsizey, c_h - i); int sj = mmin(j + bsizex, c_w - j); ... ...\nMarkdown is supported\n0% or\nYou are about to add 0 people to the discussion. Proceed with caution.\nFinish editing this message first!" ]
[ null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.78002113,"math_prob":0.9984257,"size":231,"snap":"2019-43-2019-47","text_gpt3_token_len":68,"char_repetition_ratio":0.052863438,"word_repetition_ratio":0.0,"special_character_ratio":0.27705628,"punctuation_ratio":0.05882353,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9500189,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2019-11-15T11:43:02Z\",\"WARC-Record-ID\":\"<urn:uuid:f395e7c5-66c4-47c2-b997-52379a1d7536>\",\"Content-Length\":\"69554\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:35e0ae0b-f720-48e5-9228-123545d92798>\",\"WARC-Concurrent-To\":\"<urn:uuid:17f98f30-5a03-4083-8b10-30a7f4591f3f>\",\"WARC-IP-Address\":\"54.37.202.230\",\"WARC-Target-URI\":\"https://gitlab.linphone.org/BC/public/external/libvpx/commit/cc0eeda6ddaa76f1e7170980d11b3093d70b3d62\",\"WARC-Payload-Digest\":\"sha1:3ZJKICNUEP2GNRWY5DCRMU55ULWEPXNX\",\"WARC-Block-Digest\":\"sha1:AXKJJX3C7YY6GV3UXXJU5E2GV6BDR2GY\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2019/CC-MAIN-2019-47/CC-MAIN-2019-47_segments_1573496668618.8_warc_CC-MAIN-20191115093159-20191115121159-00536.warc.gz\"}"}
https://docs.datacentral.org.au/help-center/virtual-observatory-examples/ssa-galah-dr3-interactive-spectra-explorer-enhanced-data-central-api/
[ "# Documentation\n\nFind information, examples, FAQs and extensive descriptions of the data, curated by the survey teams.\n\n#### Help Center\n\nBrowse FAQs, guides and tutorials on common use cases.\nFeb. 10, 2021 by B. Miszalski\nFeb. 17, 2021, 11:40 a.m. B. Miszalski\n\n## SSA: GALAH DR3 Interactive Spectra Explorer enhanced by the Data Central API\n\nInteractive GALAH DR3 plot with selected low metallicity star and its spectra.\nInteractive GALAH DR3 plot with selected star and its spectra.\n\nIn this example we take a slightly approach to accessing the GALAH DR3 spectra. Instead of using the SSA service to acquire GALAH DR3 target details, we use the DataCentral API to query the GALAH DR3 tables directly using an ADQL query. The SSA service is then used to retrieve the relevant spectra on demand.\n\nPlease note that this interactive version was developed to be run from running the Python script directly on MacOSX (tested on 10.14 and 10.15).\n\nIt is not intended to be executed from within a Python notebook.\n\nInstructions: Run the script (you may need to resize the window for the plot to scale correctly) and then click on points to plot their spectra.\n\nfrom specutils import Spectrum1D\nimport matplotlib.pyplot as plt\nimport matplotlib as mpl\nfrom matplotlib.backends.backend_pdf import PdfPages\nfrom matplotlib import gridspec\nfrom mpl_toolkits.axes_grid1 import make_axes_locatable\nimport numpy as np\nimport pandas as pd\nimport matplotlib.ticker as plticker\nfrom astropy.stats import sigma_clip\nfrom astropy.time import Time\nimport requests\nimport re\nfrom io import BytesIO\nfrom astropy import units as u\nfrom pyvo.dal.ssa import search, SSAService\n\n#called by onpick to retrieve and show the spectra of the target of interest\ndef show_spectrum(name,axes,title):\n#query the SSA service\n#no position required as we already know the target name from the DataCentral API query\nurl = \"https://datacentral.org.au/vo/ssa/query\"\nservice = SSAService(url)\ncustom = {}\ncustom['TARGETNAME'] = name\ncustom['COLLECTION'] = 'galah_dr3'\nresults = service.search(**custom)\ndf = results.votable.get_first_table().to_table(use_names_over_ids=True).to_pandas()\nfilters = ['B','V','R','I']\ncolours = [\"#085dea\",\"#1e8c09\",\"#cf0000\",\"#640418\"]\n\n#go through each filter and plot its spectrum (if available)\nfor idx in range(0,4):\nfilt = filters[idx]\nax = axes[idx]\n#remove any previous spectrum/labels/titles that may have been plotted in a previous call of\n#the show_spectrum function\nax.clear()\n#show the title in the first position only\nif(idx == 0):\nax.set_title(title)\n#select only the spectrum of the filter of interest\nsubset = df[(df['band_name'] == filt)].reset_index()\n#give preference to using the continuum normalised spectra\nif(subset[subset['dataproduct_subtype'].isin(['normalised'])].shape > 0):\nsubset = subset[(subset['dataproduct_subtype'] == \"normalised\")].reset_index()\n#only proceed if we have the filter of interest available in the results\nif(subset.shape > 0):\n#add RESPONSEFORMAT=fits here to ensure we get fits format back\nurl= subset.loc[0,'access_url'] + \"&RESPONSEFORMAT=fits\"\nexptime = subset.loc[0,'t_exptime']\nax.tick_params(axis='both', which='major')\nax.tick_params(axis='both', which='minor')\nloc = plticker.MultipleLocator(base=20.0)\nax.xaxis.set_major_locator(loc)\n#plot label at last position (caveat: no check if spectra are missing)\nif(idx == 3):\nax.set_xlabel(\"Wavelength ($\\mathrm{\\AA}$)\",labelpad=10)\n#plot the spectrum\nax.plot(spec.wavelength,spec.flux,linewidth=LWIDTH,color=colours[idx])\n#adjust the y-scale to best fit the spectrum with some sigma clipping\nnspec = len(spec.spectral_axis)\nymin = min(clipped).value\nymax = max(clipped).value\nxmin = spec.wavelength.value\nxmax = spec.wavelength[nspec-1].value\n#add a 1% buffer either side of the x-range\ndx=0.01*(xmax-xmin)\nax.set_xlim(xmin-dx,xmax+dx)\n#add a 1% buffer either side of the y-range\ndy=0.03*(ymax-ymin)\nax.set_ylim(ymin-dy,ymax+dy)\n#else:\n#print missing data...\n\n#set the figure size to be wide in the horizontal direction\n#to accommodate the image cutouts alongside the spectra\nfsize=[20,13]\nmpl.rcParams['axes.linewidth'] = 0.7\nFSIZE=18\nLWIDTH=0.5\nLABELSIZE=10\n\n#Instead of querying SSA directly, we query the galah_dr3 table main_star\n#using the DataCentral API\n#Information about the table can be found at\n#https://docs.datacentral.org.au/galah/dr3/catalogue-data-access/\n# and\n#https://docs.datacentral.org.au/galah/dr3/table-schema/\n# and\n#https://datacentral.org.au/services/schema/#galah.dr3.catalogues.mainstargroup.main_star\n\n#Here we select the top 100 sources with names < 160000000000000 and low surface gravities (log g < 2)\n#together with their temperatures, surface gravities and metallicities\nsql_query = \"SELECT TOP 100 sobject_id, star_id, teff,e_teff,logg,e_logg, fe_h, e_fe_h FROM galah_dr3.main_star WHERE sobject_id < 160000000000000 and logg < 2.0\"\n#Query GALAH DR3 catalogue using DataCentral API\napi_url = 'https://datacentral.org.au/api/services/query/'\nqdata = {'title' : 'galah_test_query',\n'notes' : 'test query for ssa example',\n'sql' : sql_query,\n'run_async' : False,\n'email' : '[email protected]'}\npost = requests.post(api_url,data=qdata).json()\nresp = requests.get(post['url']).json()\n#convert the results to a pandas dataframe\ndf = pd.DataFrame(resp['result']['data'],columns=resp['result']['columns'])\n#remove results where the teff and logg are not determined\n#as the dataframe entries are still all strings, we have to do the following\n#instead of use nona() or notnull() functions of the dataframe\ndf = df[(df['teff'] != \"nan\") & (df['logg'] != \"nan\")]\n#convert columns to floats - needed since data coming from json results\nconvertme = ['teff','e_teff','logg','e_logg','fe_h','e_fe_h']\nfor c in convertme:\ndf[c] = df[c].astype(float)\nprint (df)\n#create a few lists/arrays to conveniently access the results\nteff = np.array(df['teff'])\nteff_err = np.array(df['e_teff'])\nlogg = np.array(df['logg'])\nlogg_err = np.array(df['e_logg'])\nfe_h = np.array(df['fe_h'])\nfe_h_err = np.array(df['e_fe_h'])\nnames = np.array(df['sobject_id'])\n\n#create a colourmap tied to the metallicity ([Fe/H])\ncmap = mpl.cm.get_cmap('plasma')\nnorm = mpl.colors.Normalize(vmin=min(fe_h),vmax=max(fe_h))\n\n#setup the plot using gridspec\ngs = gridspec.GridSpec\nfig = plt.figure(figsize=fsize)\n#4 rows, 2 cols\n#plot of log g/Teff takes up first col (all rows)\n#spectra take up all rows of 2nd col\ngs = gridspec.GridSpec(4,2)\n#B\n#V\n#R\n#I\n\n#plot the location of the results in a log g vs teff diagram\n#with the colours of each point determined by the [Fe/H] and the colourmap\n#The picker argument is required to allow for picking targets interactively (see below)\nsc = ax1.scatter(teff,logg,cmap=cmap,c=fe_h,picker=5)\n\n#create some space for the colourbar and add it\ndivider = make_axes_locatable(ax1)\nfig.colorbar(mappable=sc,label='[Fe/H]',cax=cax)\n\n#this annotation is a template for a label that appears when the mouse hovers\n#over each point in the above scatter plot\nannot = ax1.annotate(\"\",xy=(0,0),xytext=(-100,30),textcoords=\"offset points\",\nbbox=dict(boxstyle=\"round\",fc=\"w\"),\narrowprops=dict(arrowstyle=\"->\"))\n#all are off by default\nannot.set_visible(False)\n\n#flip y axis to show lower surface gravity at top\nax1.invert_yaxis()\n#flip x axis to show cooler stars at right\nax1.invert_xaxis()\n#set the axis labels\nax1.set_ylabel(\"$\\\\log\\\\,g$\")\nax1.set_xlabel(\"Teff (K)\")\n\n#function to update the annotations\ndef update_annot(ind):\npos = sc.get_offsets()[ind[\"ind\"]]\nannot.xy = pos\ntext = \"%s\" % [names[n] for n in ind[\"ind\"]]\nannot.set_text(text)\nannot.get_bbox_patch().set_facecolor(cmap(norm(fe_h[ind[\"ind\"]])))\nannot.get_bbox_patch().set_alpha(0.5)\n\n#called when the mouse hovers over a target\ndef hover(event):\nvis = annot.get_visible()\nif event.inaxes == ax1:\ncont, ind = sc.contains(event)\nif cont:\nupdate_annot(ind)\nannot.set_visible(True)\nfig.canvas.draw_idle()\nelse:\nif vis:\nannot.set_visible(False)\nfig.canvas.draw_idle()\n\n#called when the user clicks a target\ndef onpick(event):\nind = event.ind\npt = event.artist.get_offsets()\n#mouse positions\nmx = event.mouseevent.xdata\nmy = event.mouseevent.ydata\n#get closest index to mouse click\n#chosen contains the index of the\n#closest target to the mouse click\ndist = 1e6\nchosen = None\nfor idx in ind:\nprint (idx)\nprint (pt[idx])\npx = pt[idx]\npy = pt[idx]\nd = np.sqrt((px-mx)**2 + (py-my)**2)\nif(d < dist):\nprint (\"names[%d]\" % idx,d)\nchosen = idx\ndist = d\n\nif(chosen is not None):\nprint (names[chosen],chosen)\n#set a title that shows some of the information extracted from the API query\n#this information is not part of the SSA obscore metadata\ntitre = \"%s $\\\\log\\\\,g$=%.2f$\\\\pm$%.2f Teff=%.2f$\\\\pm$%.2f [Fe/H]=%.2f$\\\\pm$%.2f\" % (names[chosen],\nlogg[chosen],logg_err[chosen],\nteff[chosen],teff_err[chosen],\nfe_h[chosen],fe_h_err[chosen])\ntitre = re.sub(\"-\",\"$-$\",titre)\nplt.show()" ]
[ null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.56597644,"math_prob":0.89672047,"size":9117,"snap":"2021-31-2021-39","text_gpt3_token_len":2563,"char_repetition_ratio":0.08756721,"word_repetition_ratio":0.007292616,"special_character_ratio":0.28211033,"punctuation_ratio":0.16236374,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9830337,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2021-09-22T02:28:28Z\",\"WARC-Record-ID\":\"<urn:uuid:4aef6773-79b3-43f6-b679-28a84bd83d78>\",\"Content-Length\":\"62335\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:799c73c5-d70b-40d9-a723-a70ed95d5820>\",\"WARC-Concurrent-To\":\"<urn:uuid:a35b162c-bf9e-4010-9e0a-32e78dd4a76d>\",\"WARC-IP-Address\":\"192.231.167.151\",\"WARC-Target-URI\":\"https://docs.datacentral.org.au/help-center/virtual-observatory-examples/ssa-galah-dr3-interactive-spectra-explorer-enhanced-data-central-api/\",\"WARC-Payload-Digest\":\"sha1:4VB6CP22AGAIYX67T7RLIIIXCEEA4R6M\",\"WARC-Block-Digest\":\"sha1:NDZ6X6STLLKMRM4ROU6TWI4PAJXPKGHD\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2021/CC-MAIN-2021-39/CC-MAIN-2021-39_segments_1631780057303.94_warc_CC-MAIN-20210922011746-20210922041746-00439.warc.gz\"}"}
http://ctan.mirror.garr.it/mirrors/CRAN/web/packages/ggalluvial/vignettes/shiny.html
[ "# Tooltips for ggalluvial plots in Shiny apps\n\nknitr::opts_chunkset(fig.width = 6, fig.height = 3, fig.align = \"center\") library(ggalluvial) ## Problem In an interactive visualization, it is visually cleaner and better for interpretation if labels and other information appear as “tooltips” when the user hovers over or clicks on elements of the plot, rather than displaying all the labels on the plot at one time. However, the ggalluvial package does not natively include this functionality. It is possible to enable this using functions from several other packages. This vignette illustrates a Shiny app that displays an alluvial plot with tooltips that appear when the user hovers over two different plot elements: strata created with geom_stratum() and alluvia created with geom_alluvium(). The tooltips that appear when the user hovers over elements of the plot show a text label and the number of flows included in each group. This is made relatively straightforward because if the user hovers or clicks somewhere inside a ggplot panel, Shiny automatically returns information about the location of the mouse cursor in plot coordinates. That means the main work we have to do is to extract or manually recalculate the coordinates of the different plot elements. With that information, we can determine which plot element the cursor is hovering over and display the appropriate information in the tooltip or other output method. Note: The app demonstrated here depends on the packages htmltools and sp, in addition of course to ggalluvial and shiny. Please be aware that all of these packages will need to be installed on the server where your Shiny app is running. ### Hovering over and clicking on strata Enabling hovering over and clicking on strata is straightforward because of their rectangular shape. We only need the minimum and maximum x and y coordinates for each of the rectangles. The rectangles are evenly spaced along the x-axis, centered on positive integers beginning with 1. The width is set in geom_stratum() so, for example, we know that the x-coordinates of the first stratum are 1 ± width/2. The y-coordinates can be determined from the number of rows in the input data multiplied by their weights. ### Hovering over and clicking on alluvia Hovering over and clicking on alluvia are more difficult because the shapes of the alluvia are more complex. The default shape of the polygons includes an xspline curve drawn using the grid package. We need to manually reconstruct the coordinates of the polygons, then use sp::pointInPolygon() to detect which, if any, polygons the cursor is over. ## Data for reproducible example This toy dataset is used for the example app. example_data <- data.frame( weight = rep(1, 12), ID = 1:12, cluster = rep(c(1, 2), c(4, 8)), grp1 = rep(c('1a', '1b', '1a', '1b'), c(3, 2, 3, 4)), grp2 = rep(c('2a', '2b', '2a', '2b', '2a'), c(2, 2, 2, 2, 4)), grp3 = rep(c('3a','3b', '3a', '3b'), c(3, 2, 2, 5)) ) Here is a static plot generated using the toy dataset. ggplot(example_data, aes(y = weight, axis1 = grp1, axis2 = grp2, axis3 = grp3)) + geom_alluvium(aes(fill = factor(cluster)), knot.pos = 0.25) + geom_stratum(width = 1/8, reverse = TRUE) + geom_text(aes(label = after_stat(stratum)), stat = \"stratum\", reverse = TRUE, size = rel(3)) + theme_bw() + scale_x_continuous(expand = c(0, 0)) + scale_y_continuous(expand = c(0, 0))", null, "## Structure of the example app Here, we will go over each section of the code in detail. The full code is reproduced at the bottom of this document. ### User interface The app includes a minimal user interface with two output elements. ui <- fluidPage( fluidRow(tagsdiv(\nstyle = \"position: relative;\",\nplotOutput(\"alluvial_plot\", height = \"500px\",\nhover = hoverOpts(id = \"plot_hover\")\n),\nhtmlOutput(\"tooltip\")))\n)\n\nThe elements are:\n\n• a plotOutput with the argument hover defined, to enable behavior determined by the cursor’s plot coordinates whenever the user hovers over the plot.\n• an htmlOutput for the tooltip that appears next to the cursor on hover.\n\nBoth of the elements are wrapped in a fluidRow() and a div() tag.\n\nNote: This vignette only illustrates how to display output when the user hovers over an element. If you want to display output when the user clicks on an element, the corresponding argument to plotOutput() is click = clickOpts(id = \"plot_click\"). This will return the location of the mouse cursor in plot coordinates when the user clicks somewhere within the plot panel.\n\n### Server function\n\nThe server function is more complex. Its general structure looks like this, in pseudocode:\n\nserver <- function(input, output, session) {\n\noutput$alluvial_plot <- renderPlot({ '<Create \"ggplot\" object for alluvial plot.>' '<Build alluvial plot and assign globally.>' '<Extract data from built plot object used to create alluvium polygons.>' '<Use polygon splines to generate coordinates of alluvium boundaries.>' '<Convert coordinates from grid units to plot units and assign globally.>' '<Render the plot.>' }) output$tooltip <- renderText({\nif ('<mouse cursor is within the plot panel>') {\nif ('<mouse cursor is within a stratum box>') {\n'<Render stratum tooltip.>'\n} else {\nif ('<mouse cursor is within an alluvium polygon>') {\n'<Render alluvium tooltip.>'\n}\n}\n}\n})\n\n}\n\nFirst, we create the ggplot object for the alluvial plot, then we call the ggplot_build() function to build the plot without displaying it. The next lines of code are to “reverse engineer” the polygon coordinates. Finally, we call renderPlot() to pass the plot to output.\n\nNext, we define the tooltip with a renderText() expression. Within that expression, we first extract the cursor’s plot coordinates from the user input. We determine whether the cursor is hovering over a stratum and if so, display the appropriate tooltip.", null, "screenshot of tooltip on stratum\n\nIf the mouse cursor is not hovering over a stratum, we determine whether it is hovering over an alluvium polygon and if so, display different information in the tooltip.", null, "screenshot of tooltip on alluvium\n\nIf the mouse cursor is hovering over an empty region of the plot, nothing is returned by renderText() and so no tooltip text box is displayed.", null, "screenshot of cursor over empty region\n\nLet’s take a deeper dive into each part of the server function.\n\n#### 1. Drawing plot and extracting coordinates\n\nThe first part of the server function includes code to draw the plot and build it with ggplot_build(). Note that the global assignment operator <<- is used to assign node_width and pbuilt so they are both accessible outside the renderPlot() expression.\n\nNote: In the example presented here, strictly speaking all of the plot drawing and coordinate extracting code could be outside the server() function, because the plot itself does not change with user input. However if you are building an app where the plot changes in response to user input, for example a menu of options of which variables to display, the plot drawing code has to be inside the renderPlot() expression. So we’ve left it there in the example code.\n\noutput$alluvial_plot <- renderPlot({ # Width of node boxes node_width <<- 1/4 p <- ggplot(example_data, aes(y = weight, axis1 = grp1, axis2 = grp2, axis3 = grp3)) + geom_alluvium(aes(fill = factor(cluster)), knot.pos = 0.25) + geom_stratum(width = node_width, reverse = TRUE) + geom_text(aes(label = after_stat(stratum)), stat = \"stratum\", reverse = TRUE, size = rel(3)) + theme_bw() + scale_x_continuous(expand = c(0, 0)) + scale_y_continuous(expand = c(0, 0)) # Build the plot. Use global assignment so that this object is accessible # later. pbuilt <<- ggplot_build(p) Now for the hard part: reverse-engineering the coordinates of the alluvia polygons. This makes use of pbuilt$data[], a data frame with the individual elements of the alluvial plot. We add an additional column for width, which has a value of 1/3 hard-coded into ggalluvial::geom_alluvium(), then split the data frame by group (groups correspond to the individual alluvium polygons). We apply the unexported function ggalluvial:::data_to_xspline() to each element of the list to get the x-spline coordinates. Then, we pass the x-spline coordinates to the function grid::xsplineGrob() to convert them into a grid object. We pass the resulting object to grid::xsplinePoints(). At this point we now have the coordinates of the alluvium polygons.\n\n # Use built plot data to recalculate the locations of the flow polygons:\n\n# Add width parameter, and then convert built plot data to xsplines\ndata_draw <- transform(pbuilt$data[], width = 1/3) groups_to_draw <- split(data_draw, data_draw$group)\ngroup_xsplines <- lapply(groups_to_draw,\nggalluvial:::data_to_xspline,\nknot.prop = TRUE)\n\n# Convert xspline coordinates to grid object.\nxspline_coords <- lapply(\ngroup_xsplines,\nfunction(coords) grid::xsplineGrob(x=coords$x, y=coords$y,\nshape=coords$shape, open=FALSE) ) # Use grid::xsplinePoints to draw the curve for each polygon xspline_points <- lapply(xspline_coords, grid::xsplinePoints) The coordinates we have are in grid plotting units but we need to convert them into the same units as the axes on the plot. We do this by determining the range of the x and y axes in grid units (xrange_old and yrange_old), then fixing the range of the x axis as 1 to the number of strata, adjusted by the width of the nodes, and the y axis to the number of rows in the data (again, this is possible here because each flow polygon is exactly 1 unit high). We define a function new_range_transform() inline and apply it to each set of coordinates, assigning the resulting object globally so it can be accessed later. Now we have the coordinates of the polygons in plot units! So we can close the expression after returning the plot. # Define the x and y axis limits in grid coordinates (old) and plot # coordinates (new) xrange_old <- range(unlist(lapply( xspline_points, function(pts) as.numeric(pts$x)\n)))\nyrange_old <- range(unlist(lapply(\nxspline_points, function(pts) as.numeric(pts$y) ))) xrange_new <- c(1 - 1/6, 3 + 1/6) yrange_new <- c(0, nrow(example_data)) # Define function to convert grid graphics coordinates to data coordinates new_range_transform <- function(x_old, range_old, range_new) { (x_old - range_old)/(range_old - range_old) * (range_new - range_new) + range_new } # Using the x and y limits, convert the grid coordinates into plot # coordinates. Use global assignment. polygon_coords <<- lapply(xspline_points, function(pts) { x_trans <- new_range_transform(x_old = as.numeric(pts$x),\nrange_old = xrange_old,\nrange_new = xrange_new)\ny_trans <- new_range_transform(x_old = as.numeric(pts$y), range_old = yrange_old, range_new = yrange_new) list(x = x_trans, y = y_trans) }) # Return plot p }, res = 200) #### 2. Logic for determining cursor location and displaying tooltips First, we check whether the cursor is inside the plot panel. If it is not, the element plot_hover of the input will be NULL. output$tooltip <- renderText(\nif(!is.null(input$plot_hover)) { ... } ... ) Next, we check whether the cursor is over a stratum. We round the x-coordinate of the mouse cursor in data units to the nearest integer, then determine whether the x-coordinate is within node_width/2 of that integer. If so, the mouse cursor is horizontally within the box. hover <- input$plot_hover\nx_coord <- round(hover$x) if(abs(hover$x - x_coord) < (node_width / 2)) { ... }\n\nThe nearest integer to the y-coordinate corresponds to the row of the data frame because we set reverse = TRUE and all weight = 1 in the input data. So, for example, the first row of the data frame corresponds to y range c(0, 1), the second c(1, 2), and so forth. This gives us all the information we need to find the index of the rows of the input data that goes with the stratum the cursor is on. Note: It is necessary for the input data to be sorted in ascending order of the group column, named cluster in this example. If it is not sorted in this way, the relative order of the flows along the y-axis will not correspond to their order in the data.\n\nnode_row <-\npbuilt$data[]$x == x_coord & hover$y > pbuilt$data[]$ymin & hover$y < pbuilt$data[]$ymax\n\nWe get the name of the stratum as well as the total number of flows passing through it.\n\nnode_label <- pbuilt$data[]$stratum[node_row]\nnode_n <- pbuilt$data[]$n[node_row]\n\nFinally, we render a tooltip using the div tag and passing it to htmltools::renderTags(). Note that the tooltip positioning is provided in CSS coordinates (pixels), not data coordinates. This does not require any additional effort on our part because plot_hover also includes the mouse cursor location in those units.\n\nrenderTags(\ntags$div( node_label, tags$br(),\n\"n =\", node_n,\nstyle = paste0(\n\"position: absolute; \",\n\"top: \", hover$coords_css$y + offset, \"px; \",\n\"left: \", hover$coords_css$x + offset, \"px; \",\n\"background: gray; \",\n\"color: white; \"\n)\n)\n)$html If the cursor is not over a stratum, the next logic checks whether it is over an alluvium. This is done using the function sp::point.in.polygon applied across each of the polygons for which we defined the coordinates inside the renderPlot expression. hover_within_flow <- sapply( polygon_coords, function(pol) point.in.polygon(point.x = hover$x,\npoint.y = hover$y, pol.x = pol$x,\npol.y = pol$y) ) If at least one polygon is beneath the mouse cursor, we locate the corresponding row in the input data and extract information to display in the tooltip. In the situation where there are more than one polygon overlapping, we get the information for the polygon that is plotted last by calling rev() on the logical vector returned by point.in.polygon(). This means that the tooltip will display information from the alluvium that appears “on top” in the plot. In this example, we will display the names of all the nodes that the alluvium passes through. coord_id <- rev(which(hover_within_flow == 1)) flow_id <- example_data$ID[coord_id]\naxis_values <- example_data[flow_id, c('grp1', 'grp2', 'grp3')]\n\nWe render a tooltip that shows the names of all the nodes that the hovered path passes through, using very similar syntax to the above tooltip.\n\nrenderTags(\ntags$div( paste(axis_values, collapse = ' -> '), style = paste0( \"position: absolute; \", \"top: \", hover$coords_css$y + offset, \"px; \", \"left: \", hover$coords_css$x + offset, \"px; \", \"background: gray; \", \"padding: 3px; \", \"color: white; \" ) ) )$html\n\n## Conclusion\n\nThis vignette demonstrates how to enable tooltips for ggalluvial plots in Shiny apps. However it’s important to note that some of the workarounds are slightly inelegant. This may not be the optimal way to do it — other solutions are certainly possible!\n\n## Appendix\n\n### Complete app code\n\nlibrary(ggalluvial)\nlibrary(shiny)\nlibrary(htmltools)\nlibrary(sp)\n\nexample_data <- data.frame(\nweight = rep(1, 12),\nID = 1:12,\ncluster = rep(c(1, 2), c(4, 8)),\ngrp1 = rep(c('1a', '1b', '1a', '1b'), c(3, 2, 3, 4)),\ngrp2 = rep(c('2a', '2b', '2a', '2b', '2a'), c(2, 2, 2, 2, 4)),\ngrp3 = rep(c('3a','3b', '3a', '3b'), c(3, 2, 2, 5))\n)\n\n# User interface\nui <- fluidPage(\nfluidRow(tags$div( style = \"position: relative;\", plotOutput(\"alluvial_plot\", height = \"500px\", hover = hoverOpts(id = \"plot_hover\") ), htmlOutput(\"tooltip\"))) ) server <- function(input, output, session) { # Draw plot and extract coordinates output$alluvial_plot <- renderPlot({\n\n# Width of node boxes\nnode_width <<- 1/4\n\np <- ggplot(example_data,\naes(y = weight, axis1 = grp1, axis2 = grp2, axis3 = grp3)) +\ngeom_alluvium(aes(fill = factor(cluster)), knot.pos = 0.25) +\ngeom_stratum(width = node_width, reverse = TRUE) +\ngeom_text(aes(label = after_stat(stratum)),\nstat = \"stratum\",\nreverse = TRUE,\nsize = rel(3)) +\ntheme_bw() +\nscale_x_continuous(expand = c(0, 0)) +\nscale_y_continuous(expand = c(0, 0))\n\n# Build the plot. Use global assignment so that this object is accessible\n# later.\npbuilt <<- ggplot_build(p)\n\n# Use built plot data to recalculate the locations of the flow polygons:\n\n# Add width parameter, and then convert built plot data to xsplines\ndata_draw <- transform(pbuilt$data[], width = 1/3) groups_to_draw <- split(data_draw, data_draw$group)\ngroup_xsplines <- lapply(groups_to_draw,\nggalluvial:::data_to_xspline,\nknot.prop = TRUE)\n\n# Convert xspline coordinates to grid object.\nxspline_coords <- lapply(\ngroup_xsplines,\nfunction(coords) grid::xsplineGrob(x = coords$x, y = coords$y,\nshape = coords$shape, open = FALSE) ) # Use grid::xsplinePoints to draw the curve for each polygon xspline_points <- lapply(xspline_coords, grid::xsplinePoints) # Define the x and y axis limits in grid coordinates (old) and plot # coordinates (new) xrange_old <- range(unlist(lapply( xspline_points, function(pts) as.numeric(pts$x)\n)))\nyrange_old <- range(unlist(lapply(\nxspline_points,\nfunction(pts) as.numeric(pts$y) ))) xrange_new <- c(1 - 1/6, 3 + 1/6) yrange_new <- c(0, nrow(example_data)) # Define function to convert grid graphics coordinates to data coordinates new_range_transform <- function(x_old, range_old, range_new) { (x_old - range_old)/(range_old - range_old) * (range_new - range_new) + range_new } # Using the x and y limits, convert the grid coordinates into plot # coordinates. Use global assignment. polygon_coords <<- lapply(xspline_points, function(pts) { x_trans <- new_range_transform(x_old = as.numeric(pts$x),\nrange_old = xrange_old,\nrange_new = xrange_new)\ny_trans <- new_range_transform(x_old = as.numeric(pts$y), range_old = yrange_old, range_new = yrange_new) list(x = x_trans, y = y_trans) }) # Return plot p }, res = 200) output$tooltip <- renderText(\nif(!is.null(input$plot_hover)) { hover <- input$plot_hover\nx_coord <- round(hover$x) if(abs(hover$x - x_coord) < (node_width / 2)) {\n# Display node information if cursor is over a stratum box.\n\n# Determine stratum name from x and y coord, and the n.\nnode_row <- pbuilt$data[]$x == x_coord &\nhover$y > pbuilt$data[]$ymin & hover$y < pbuilt$data[]$ymax\nnode_label <- pbuilt$data[]$stratum[node_row]\nnode_n <- pbuilt$data[]$n[node_row]\n\n# Offset, in pixels, for location of tooltip relative to mouse cursor,\n# in both x and y direction.\noffset <- 5\n\n# Render tooltip\nrenderTags(\ntags$div( node_label, tags$br(),\n\"n =\", node_n,\nstyle = paste0(\n\"position: absolute; \",\n\"top: \", hover$coords_css$y + offset, \"px; \",\n\"left: \", hover$coords_css$x + offset, \"px; \",\n\"background: gray; \",\n\"color: white; \"\n)\n)\n)$html } else { # Display flow information if cursor is over a flow polygon: what # alluvia does it pass through? # Calculate whether coordinates of hovering cursor are inside one of the # polygons. hover_within_flow <- sapply( polygon_coords, function(pol) point.in.polygon(point.x = hover$x,\npoint.y = hover$y, pol.x = pol$x,\npol.y = pol$y) ) if (any(hover_within_flow)) { # Find the alluvium that is plotted on top. (last) coord_id <- rev(which(hover_within_flow == 1)) # Get the corresponding row ID from the data. flow_id <- example_data$ID[coord_id]\n# Get the axis 1-3 values for all axes for that row ID.\naxis_values <- example_data[flow_id, c('grp1', 'grp2', 'grp3')]\n\noffset <- 5\n\n# Render tooltip\nrenderTags(\ntags$div( paste(axis_values, collapse = ' -> '), style = paste0( \"position: absolute; \", \"top: \", hover$coords_css$y + offset, \"px; \", \"left: \", hover$coords_css$x + offset, \"px; \", \"background: gray; \", \"padding: 3px; \", \"color: white; \" ) ) )$html\n}\n}\n}\n)\n}\n\nshinyApp(ui = ui, server = server)" ]
[ null, "data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAkAAAAEgCAYAAABchszxAAAEGWlDQ1BrQ0dDb2xvclNwYWNlR2VuZXJpY1JHQgAAOI2NVV1oHFUUPrtzZyMkzlNsNIV0qD8NJQ2TVjShtLp/3d02bpZJNtoi6GT27s6Yyc44M7v9oU9FUHwx6psUxL+3gCAo9Q/bPrQvlQol2tQgKD60+INQ6Ium65k7M5lpurHeZe58853vnnvuuWfvBei5qliWkRQBFpquLRcy4nOHj4g9K5CEh6AXBqFXUR0rXalMAjZPC3e1W99Dwntf2dXd/p+tt0YdFSBxH2Kz5qgLiI8B8KdVy3YBevqRHz/qWh72Yui3MUDEL3q44WPXw3M+fo1pZuQs4tOIBVVTaoiXEI/MxfhGDPsxsNZfoE1q66ro5aJim3XdoLFw72H+n23BaIXzbcOnz5mfPoTvYVz7KzUl5+FRxEuqkp9G/Ajia219thzg25abkRE/BpDc3pqvphHvRFys2weqvp+krbWKIX7nhDbzLOItiM8358pTwdirqpPFnMF2xLc1WvLyOwTAibpbmvHHcvttU57y5+XqNZrLe3lE/Pq8eUj2fXKfOe3pfOjzhJYtB/yll5SDFcSDiH+hRkH25+L+sdxKEAMZahrlSX8ukqMOWy/jXW2m6M9LDBc31B9LFuv6gVKg/0Szi3KAr1kGq1GMjU/aLbnq6/lRxc4XfJ98hTargX++DbMJBSiYMIe9Ck1YAxFkKEAG3xbYaKmDDgYyFK0UGYpfoWYXG+fAPPI6tJnNwb7ClP7IyF+D+bjOtCpkhz6CFrIa/I6sFtNl8auFXGMTP34sNwI/JhkgEtmDz14ySfaRcTIBInmKPE32kxyyE2Tv+thKbEVePDfW/byMM1Kmm0XdObS7oGD/MypMXFPXrCwOtoYjyyn7BV29/MZfsVzpLDdRtuIZnbpXzvlf+ev8MvYr/Gqk4H/kV/G3csdazLuyTMPsbFhzd1UabQbjFvDRmcWJxR3zcfHkVw9GfpbJmeev9F08WW8uDkaslwX6avlWGU6NRKz0g/SHtCy9J30o/ca9zX3Kfc19zn3BXQKRO8ud477hLnAfc1/G9mrzGlrfexZ5GLdn6ZZrrEohI2wVHhZywjbhUWEy8icMCGNCUdiBlq3r+xafL549HQ5jH+an+1y+LlYBifuxAvRN/lVVVOlwlCkdVm9NOL5BE4wkQ2SMlDZU97hX86EilU/lUmkQUztTE6mx1EEPh7OmdqBtAvv8HdWpbrJS6tJj3n0CWdM6busNzRV3S9KTYhqvNiqWmuroiKgYhshMjmhTh9ptWhsF7970j/SbMrsPE1suR5z7DMC+P/Hs+y7ijrQAlhyAgccjbhjPygfeBTjzhNqy28EdkUh8C+DU9+z2v/oyeH791OncxHOs5y2AtTc7nb/f73TWPkD/qwBnjX8BoJ98VQNcC+8AAEAASURBVHgB7L0HgCRVuTb8Ts5hZ3POC2wgZ5Ao6SoKgoJeFRET3HtFEAT1U5FgQL2XK8pV/PhF8AMEURHBK4IkyXnZwOY0m2ZnZyfn7v6f58zWbE1vd09VdVV39cz7Qm33VFedOuepU6ee85435MUgoqIIKAKKgCKgCCgCisAoQiB/FLVVm6oIKAKKgCKgCCgCioBBQAmQdgRFQBFQBBQBRUARGHUIZJQAtbe3ywsvvLAfyGvXrpWnn35aurq69vtNdygCioAioAgoAoqAIuA3AhkjQN3d3XLDDTfII488MqQNV199tfzyl7+UVatWyWc+8xl59dVXh/yufygCioAioAgoAoqAIuA3AoV+F5iovPXr18s3vvENqampMZt1zLJly2TXrl1y7733ml0HHHCAPPDAA3L00Udbh+inIqAIKAKKgCKgCCgCviOQEQLU2dkp3/zmN2X37t3y+OOPDzZi4cKFcueddw7+3dLSItQU2WXFihWydOnSwV3nnHPOEBI1+IN+UQQUAUVAEVAEFAFFwCECGSFAixcvNtV55plnhlQrPz9fysrKzL6GhgajCbr22muHHPPss8/KbbfdNrjvjtt/Ku0dnYN/+/2lCvWZP2uW38V6Ki8mMcnDf7kqjLCQl5fD9Q8R/hvr66WprS3QrlBXXS2zpk4N9BpOC9e+7xSpYI4LE/6rN26U9gDtQ+tqa+XJuHdTMKhqqWFDICMEaLhGb9iwQa677jq59NJL5dhjjx1y+Je+9CX5/Oc/P7jv8MMOk1dfe23wbz+/XHzxxbIHBtn/fcH5fhbruayenl4pLCyQgoICz2Vk68RoNCqdGLRKS0rQhlB0M1dQsP69vX1SWlri6rygDv7sf/9U2oqL5dnnngvkEu878UQZj5LD0ve7u3ukpKQ4Jwl0f3+/dPf0SDkmU5zk5ZpEIhHp748Y/MNQ97O/c4PMOuBAue+++wKpzjFHHRVIuVpo+BHI+ptp5cqV8vWvf12uuuoqOfnkk/dDjBoE+wuU+oTS0tL9jvNjB4lGXn6eFIXkhR3BQMq65CIB4iBaiMGf9bffPz/uUybKIAGKog1h6Qt5efmGDATV9/miDlPf7y/ok0I8j7lIIDhG9fcN1D8Xn918am2hvQ1T32c/CKrvZ2I80WuEE4GsEqDGxkb52te+JjfeeKMcBs2OiiKgCCgCioAioAgoAplAIKsE6MEHH5Tm5ma58sorB9taV1cnf/rTnwb/1i+KgCKgCCgCioAioAj4jUBGCdApp5wi3Cy54oorhJuKIqAIKAKKgCKgCCgCmUQg9yz0MomOXksRUAQUAUVAEVAERiQCSoBG5G3VRikCioAioAgoAopAKgSUAKVCR39TBBQBRUARUAQUgRGJgBKgEXlbtVGKgCKgCCgCioAikAoBJUCp0NHfFAFFQBFQBBQBRWBEIqAEaETeVm2UIqAIKAKKgCKgCKRCQAlQKnT0N0VAEVAEFAFFQBEYkQgoARqRt1UbpQgoAoqAIqAIKAKpEFAClAod/U0RUAQUAUVAEVAERiQCSoBG5G3VRikCioAioAgoAopAKgSUAKVCR39TBBQBRUARUAQUgRGJgBKgEXlbtVGKgCKgCCgCioAikAoBJUCp0NHfFAFFQBFQBBQBRWBEIqAEaETeVm2UIqAIKAKKgCKgCKRCQAlQKnT0N0VAEVAEFAFFQBEYkQgUjshWpdOofHDCsrJ0SvDt3Ly8PMkrKhYpyD2emheJSiwalbxyYFmQe90sLxoTCVFfkIIC3/pV0oJ4jZD0fdYxv7RUBM9ArklepF9isZjkl5cP9KEcawCf3bzCXhHiHwbhc6iiCASAQO69mQIAYUiReGlLV9eQXdn6I9bdLbH+fhCIDLz8fG5kLBKRPNafL7DC3OtmJG/S0+MzKmkUBzwDF14jJH2f9YjiHuTn4MuPzyz7fhR1L8jRZzfW1ydgcYF3OUcX4LOooggEgIBS6wBA1SIVAUVAEVAEFAFFINwIKAEK9/3R2ikCioAioAgoAopAAAgoAQoAVC1SEVAEFAFFQBFQBMKNgBKgcN8frZ0ioAgoAoqAIqAIBICAEqAAQNUiFQFFQBFQBBQBRSDcCCgBCvf90dopAoqAIqAIKAKKQAAIKAEKAFQtUhFQBBQBRUARUATCjYASoHDfH62dIqAIKAKKgCKgCASAQO5FqAsABHuRjP3FAGxhEUaUDVN9nOLCelNyvf7hwT4DQelC1tdyve/kev1HVd93OrDpcSMKgZwjQEG/BhgBuCckEYAjiMzLQYgpMXJNLALU29ubm9F895KBMPWFoPtABCkQwtRe1iUX+75FHNj3c7H+FnGznuGg+91w5UeZliZACbb0ACuuRaeNQM4RoKCpQD7ybpWFJB9SN8LpFxUV5WQ4fZK3zs5OKSkpQSaMnOtmhnjyBRyWvlDAfGr9wabDKCgsCE17u5AKg30nF1Nh9CMVhlX/XEyFwWe3D6kwSkOSCyzoPhD0OyXtt7QWEBgCagMUGLRasCKgCCgCioAioAiEFQElQGG9M1ovRUARUAQUAUVAEQgMASVAgUGrBSsCioAioAgoAopAWBFQAhTWO6P1UgQUAUVAEVAEFIHAEFACFBi0WrAioAgoAoqAIqAIhBUBJUBhvTNaL0VAEVAEFAFFQBEIDAElQIFBqwUrAoqAIqAIKAKKQFgRUAIU1juj9VIEFAFFQBFQBBSBwBDIvQh1gUExUHBM8qS/oCDgqzgrPoIAgvmoSywk9XFW64GjmEyEOEZY9xysfwzRt4l/WPoC6xO08BphaS+x5xbNQLv9xjWCKOKm76P+sfzcm2Py2bXa4Dc2XsqLBd/1vVRLzxkBCOQcAYoEPCBuK6+QOw5YFIpbOxIiQTOSskaCTr87ramukaIAU7SQ/Kyurg1N37ciKQcdBTj9O7N/CVYk6PLy8pyN4h6mSNDbyypk4v4w+7Yn6HeKbxXVgnxHIPemJ75DoAUqAoqAIqAIKAKKwGhDQAnQaLvj2l5FQBFQBBQBRUARECVA2gkUAUVAEVAEFAFFYNQhoARo1N1ybbAioAgoAoqAIqAIKAHSPqAIKAKKgCKgCCgCow4BJUCj7pZrgxUBRUARGDkIxBB2oL6+fuQ0SFuSMQSUAGUMar2QIqAIKAKKgJ8IPPHEE3LIIYfIJZdcIosWLZK1a9f6WbyWNcIRUAI0wm+wNk8RUAQUgZGIQDQalauuukruueceeeqpp+TSSy+VW265ZUhTqR1SUQSSIaAEKBkyul8RUAQUAUUgtAgwSObrr78uhx56qKnjpk2bpLKy0nzfsmWLnHnmmbJ48WKZMGGCfPGLXwxtO7Ri2UMg5yJBZw8qvbIioAgoAopAmBBgpHna/5x22mnS0dEh7777rqner3/9azn77LPl6quvltbWVpk+fbpce+21Mm/evDBVX+uSZQRUA5TlG6CXVwQUAUVAEfCOADU8zzzzjHzyk5+U8847zxT07W9/W0488UT52c9+ZkgQl8La2tq8X0TPHJEIKAEakbdVG6UIKAKKwMhGoLe31yyBFRcXy5QpU+SGG26Ql19+WVpaWoy25ytf+YqQ+FxxxRUyadIk831kI6Ktc4uAEiC3iOnxioAioAgoAllHoKCgQD7xiU/IW2+9ZepCQ+jjjjtOampq5K9//at8//vfl//4j/+QiooK2bhxozBJrYoiYEdAbYDsaOh3RUARUAQUgZxAgATo9ttvl8svv1zy8vKkurpafvzjH5u6f/WrXzWaH9r+0E6IxGj9+vVy9NFH50TbtJKZQUAJUGZw1qsoAoqAIqAI+IzAWWedJdxo6EwCZAld4j/1qU8Zw2hqhFQUgUQI6BJYIlR0nyKgCCgCikDOIGAnP1alCwsLzXKY9bd+KgLxCISCAFE1+dxzz0lnZ2d8/Tz9vWHDBk/n6UmKgCKgCCgCioAiMDoQyDoBuv766+VHP/qRMWS77LLLZOfOnWkh/+ijj8oJJ5yQVhl6siKgCCgCioAioAiMbASyagPEvC3r1q2Thx56yKBMgzXGbbjppptcox6JRISxH+69915hiPREwv2MHqqiCCgCioAioAgoAqMbgawSoKVLl8rBBx88eAcWLFggDz/88ODf/LJs2TJ5++23B/cly+3S3NwsfX198uSTT8pJJ5005HhGAKVmiEtsU6dONYSLZCuRRGNRYXyJMAgJG9tEcpdrYpFQup5a33OpDexnrHdY+kIEdSkKGMBINBKa9lp9n949uSZWf8/lZzdMfZ9jsooiEAQCWSVAxx9/vDBk+Z49e4yx2t///nfZvn37kHY+//zzcttttw3uK4JhWyIZO3as3Hrrrfstob3xxhsmPPrKlSuNq+THP/5xoyX6xje+kagYqevulrO2+GhDVFgssdISbOUSKy8TKcNnfu4N6gnB0p3Sj1yLHSConSAoXRFsIBHd+N6DMbvPx4E738eykt22/GhMCn2MlVIA8lLEDf29GJrXYsmTEnyW4G9uZfkF5lOfhmR3JDf256HfSFen5HV2SV43Pru6RSJ9vlX+4R6UF6Dka8LUANENd9GJ2USG6szonB/72Mfks5/9rDCaJzU38S6LjPHAzZJDliyxvjr6PPLII+Wuu+6S++67z2iS3nnnHZk9e3bScyvwolnS05P0d9c/sKyOoSHY86qqJK92DLZayR/DzzGCtbn9iqZrJ2NYFBUFPfff79Jp7+Dst7GxUerq6qSkpCTt8jJdALVuDJ1fi3vUhwFyV3eP7EGbmqAdbO7tM99b8HcPyM6A4DWOuCRm27tn/zvqvRV5BcE/qnmYXOSXl3uvZNyZeC0KdancOuJ+E8IGskgpB24VhQVSietXo69X4zOvu0sm19TKWEwe+HsuSQ+e+aamJhk/frzQEynXhM9uV1fXELfywTbgWYg175EY2hfFxDXW2iIxppgIkERUkGAFKErAAwQ35EVn/elk/paLLrrILDcwmy81NX7KP//5T7n44ouFBtbMDhyG5SQOGGbQ2LJZzCsA5CcfRCFv3HjJGztO8qHNSkSI/MRFy0qMQC8IzTbMYLdiuXRTc4t07mmRZrwQVIJDoJMaNGy7evYtPfMFXNLabmz2ykCA6oqLsBXLOGyTS0tlIogRNUwqASMAYhPdvVtiO3cMfIL8YLAO+KJavCKQGQSySoC2bt0qjNj529/+1miAaAx9yimn+Npyhkdngrzvfve7xr7hhhtuCJ+XGAaUKLQlUJkMtB0Dfv6kySJVCOw1c6ZABeQrJlrYPgQiGOA3dnTKFrxwuTVA08P5Jm0gOJOnBk4luwh0gRxt7eK2bymE1Gc8NItTy0plVkW5TMd94jKbig8IQMuZt7Ve+le1S7QBXrk6AfABVC0ijAhklQDRIPn973+/0c5wCWz+/PlywQUX+IoTNUwXXnihnHHGGeaFtnjxYhMS3deL+F0YBvwoBiCBPVL/yuWCTH5SMHO25E8GKdJZb9poU8uzrqND1rR1yAZoevp0Rps2ppkugCS1AQSV21vQ1OXjuZgCrdBc5H06sLpKqnJw6SnTGA65Hpe2QHYiyJkV2bZVYsA1Ck2biiIwkhHIKgEisJ/73Ofk05/+tMnU64etyMSJE2XHjh2D92zu3LkmxtBuqHFpKJ1zgpdzDLGR+hkfqbRMCmC/lD9rtuTloF1NtrHny/JNLGm9hyXI/gBtFrLdztF4/SjuZz00RNyebdwt06AROrCqEluVlBaoZihZnzBEZ+0aiWzeJJghmsNiOiFIBpfuH2EIZJ0AEU9qf4KWnCQ/8aDAMDSycoVEVr0HjdAsKTjoIICXewbG8c0K+u9V7e3yelOzbIdGTWV0IFCP5Uxuz+xqlIOgETqstkYm6KRh8OaT+ERWr5Loxg3w2Mq9MBuDDdEvikAaCISCAKVR/9F5KmZokQ3rzaytYMEBUjBvHryP9FbGd4YNsO15DnZVduPa+GP075GNADV977a0mo3G00eOqZUF0AyNWvNpkJ1+TKKiGD+U+Izsvq+tGx4BfWsOj1F4j8BgRo0QB7PCQw+TPBpOq8gOaHqexszfbjSrsCgC1AA+un2H1DYWyVEgQkugFRpNi2Oxhgbpf/tNicHuTUURUARElACNgF4Qw8De9/JLxjaocAkia+dY3BS/bgGNm//Z2CRvIiq4iiKQDAGGNfh7wy55qWmPHFM3Rg6uqR7ZLvVob/+7SyVKOx8VRUARGERACdAgFLn/hev5vbt2SdFRR5sgi7nfIuctWAM7n6caGqXdx0jGzq+uR+YiAuwrT4EIvby7SY4bW2eIEL3JRpIwUCEnR8gDNJKapW1RBHxBYDRpgH0BLPSFdLRL33PPSBSurKNBGIn5se075ZFtO5T8jIYbHkAbmcrkSRCh/7thkyxvRZDSAK6RjSKjSCvU9+wzSn6yAb5eMycQUAKUE7fJZSVBCvpffUWi69a6PDG3Dt8ML59fb9wsKxmKX0URSBOBVmiE/rpjp9yNPrW2fb/kHWmWntnT6Sna/wo0P+rhlVng9Wo5hYAugeXU7XJXWa77F4AkFCx2lz/N3VUyfzRn6M8j1sursOFQUQT8RmA3IiH/adt2BFYslZPHjzPRpv2+RpDl9S99W6Lr4eWloggoAikRUAKUEp7c/zGCIGcxDOiFhx+R+41BC9owS/8LPHnUw2tE3M5QN2IbnAvu31Iv8yorDBEakwMpafrfAfmBV6iKIqAIDI+AEqDhMcr5I+j90Q/PsMJDDs3ptjCuz+NYomBuKBVFIFMIcDlsPfreoTU1xli6LKSRpSNKfjLVJfQ6IwQBJUAj5EYO1wzOCiPIj1SwaPFwh4by9xfhqcNNRRHIBgJMtcHwCstbW+VYuM4fjjhCYcpG3//2WwNRnbMBjl5TEchRBNQIOkdvnJdqR9asNmk0vJybrXPo5fWHrduV/Di4AU1NTUjc3efgSD3EKwLsj8w19v9t3CSrEXohDBJZsVzJTxhuhNYh5xBQDVDO3bL0KszI0XnIvZY/e056BWXg7EYao4L8MHCdSnIEGpHu46KLLkIuyx5pg0fcueeeKzfffHPyE/SXtBFo6euXPyP0wtSyUjltwniZmKU8Y0azi5xeKoqAIuAeAdUAuccs58/oX/qORHdsD3U7aHfx/zZtUfLj4C7dcccdcuyxx8o///lPefPNN+X++++XNWvWDJ4Zw/KNSjAI0Bj/XvTTv+5oEMYTyqREd+wQPssqioAi4A0B1QB5wy23z8ILsf+116TopJMlD4adYRO193F3Ry688EKZOHGiOakAxu5VVVWyevVqKYUb92WXXSZbt26VXYgQfv7558svf/lLd4Xr0Y4QoG0Ql8SOhm3QwRXljs5J56BYSwue4VdElNymA6OeO8oRyDkCFAs4VH1ncYmsmDLVl26Rh4l3Kdy2axCLp6azXQpgPxAaifQjRP6LUnzqaSJocxiEmbvp5bW6LRy2FW4xoVFsYV6+FEKvmm/lG/cps0JhfvKCFi5cOFjVBx54QLrhvn366afLrbfeKmeffbZcffXV0ooX9PTp0+Xaa6+VefPmDR5v/8JrVBX5NCTsVTqxx1MDxc9+9H/qSEaqRqoP7XsBhvpvYju4sEDG28H18zuWOvvx7IYtyGEkP19ayiulGcuC3YVFYj0C6Ta9E0v2QUrQ75Qg665lp4eAT6NdepVwc3bQFGIPHtwna8e6qZLjY2vxIqjr75PxvT0yobtLxiNPTyXIUdYE12aeoKITT8IbO7uroczLRGPnBgzuYRUSnCKQhCKQHIuORJA4oT8akz7c24jZItITQCflNfBKSSn33HOP3HTTTfL4448b7c+3v/1tefXVV+VnP/uZvP3224Z40EYomfAabbBtCVoGiGKe8aJi7i3T8/ZObCIxRDEHjj1Z7o/pYMBYVU8C5035BfL+SRNlUqmPEwxg04cIz7FsjhsAp620TBqgadxdUSm7QFB25RdKa0D3rJlkKkAJ4HENsLZatJ8I5BwB8rPxmS6rGYN8c1GxrMcmFVUiYydIBQb8KXjpTO3ulGmYpde1ZjaTeQyeQ/3vvCWFh2UvUOKO7h6Qn23SmWEbilT3vxRLScXQhlQgdAC1FvT+4Qw/EolJt9FnpDo787/95Cc/kbvvvluefvppmTZtmqkAtT0vvPCCfPzjH5crrrhCnnvuuVBoXwaIYmq7JGqJivBC5X0oxCePjhiiGZVe3IdckK0gKb/dvEUWVlfJSePGSiX6UrrS/9abwmc209JQVS3bsVy+raxCtmP8yk0dbaZR0+uFHYH0n8iwtzDk9euANmENZlDcpLpWymLTZXpvt8yDPcGkbfXDzvr9aF500yaJjqmT/Fmz/SjOVRnvYbmL+Zf4UsyWUJtTtvdFy3gvDLTYja0HxLS/MHiNSLrt/s1vfmMMn59//nmpra0dLO6vf/2r/PznP5eTTz5ZVq1aJRs3bpR+aCdyQUiADOFkZeOIcTEIETfeN1Ih3i/et7DKCiRY5bLu0YgfxK1wr7bLbX2Z3oJBTTMhfSA59RMny4bqGtmECNidgzrPTFxdr6EIZAYBJUCZwdnxVbowOK4uKTNbf2W1zMEovwBLZfMbG6QowJkvQ+gXYYaXByKUKXkJthK0mciGcBmmHKSHr81OkAKjfYp70WajXl6u+a1vfUt2wCNoypQpg6eT+Hz1q181mh/a/pSVlclxxx0n6/ESPfroowePy8Uv1ADZtUC8l9SukBBRU2f/LSzt47IejfuXtrQabRC1Qm7EaGqXLXVziutjI3ge1k2cJMvKymV9LE+KYUSvogiMZASUAIX47nLQ3ID1783jJshzY8fLQmiGljTukjEtASyT4VrMIF94ymmSF3BME2p7/razQTgzzrRUYJDni7IzGjF5xTJ9/SCut3nz5qTFfupTn5KOjg6pCaG3X9JKu/yB/Yk2ZJaQ2NKgu7M/YuyJrP1h+GQ9aej/ZnOLnDJ+rEwDMR1WYDNoPL4CmgA1VFbKivGTZBWIDy3wItSoaeytYW+LHpD7CCgBypF72ItZ7tvQDL09dYZMwyzt6J07ZVqLv9nQaVgZef1VKTz+RHhwkCb4L9S0MLghE01mSvgyrIBBajdeIJmO1ZKpNia7TiE0IyOZ/CRq94A2b+CXKmN3kweyG65gmjvQ/x/YslXmg3ycDCJUmyzRKicmr70aiNHzjrpx8sr4ibIJhFFFERiNCCgBysG7Xl+I9fmp02U21uhPaNgudc3+EaEo4sVE3lspBQftc632C6Km3j55GDFpGEU3E0LvokoYMnPW3WLTEGTi2nqNcCBAjyxKCQhwKYhwOwh4Nu3N4lFZA1u/ddDQHVZbY3KM0RbNLibNBZ5JP2VHVY28PGmybKYzhooiMIoRUAKUwzd/A2a3G6ZMl0WYyZ2weYOJOeRHcyKr3pO8sWMlf8JAcD0/ytwM7dIj0PzQRiNooe6KM38uc7VmiGwF3SYtPz0EetAXGJ6A9kLVIMVdkQGvvvRK9edsGnC/sadZlsE+6Ji9iVZpKB3duUOYv88v6YWjxYszZsvSkMT98qtdWo4i4BWB7AZ/8VprPW8IAssRk+P/zT9INo/3L/Ra/+uviSBWkR+yDO79v6/flhHyU4EAdMWY7bdi5s+4NiqKgB0Ban9IihlvqAbLTozpFBbh5OA5JFr9vxs2ybsNu6Tvjdd9q9pG2BD+du4BSn58Q1QLGgkIqAYo7i7G4BcUzYCWIu6ySf80UXQd1IfmxH8cN0kOqx4jx69bLfkOzkl6Uf4AG4XeV2AUfeL7PNkDWdF+n4fny5sZMHZmzBguH7Rimc0Pseoflr5g1cePtiUrw2lfS3a+3/uDrA/1kHsiPcJAjPQgo31YL5bH/BDrXnmtfyuSAD/29hp5sbdfjgeHnw+y5lWieCaemTlblpUiPQfIn9mGKcyqf2j6vvHVHKbS+rMi4AEBJUBxoPGhZ1btMIjxxkB98lwYJL+Eiq+dPlvO3bROKtNtx7atEsMsNDZ/gWs4GMPlCaj1N/b0Ish0sLPsKmh9unrhCZTGiyK+gdbLKzR9AXgGLREuE6XbZ3yqJPs+6+Km73u9NPWchggV5CMcAoyO0+xHFnHoBZHxVP/duyUPkaRp+fMItgngLcchdc0M3B830gk39sdmzpHt1HK5uK9W37eIkJtrBnFsLMc1uStXrpS77rpLGhsbTaR2hqVIR5jWprq6Op0izLmME8bI8B/72MdSlnXvvffKhAkT5Kyzzkp5nNMf063/nXfeKUuWLDFhPZxeM9lxSoDikCnA8gljpoRBmNOpCGp6Jrh0I4zS+pdFh8iHt25JP7I0SFDh7DmS72J5jV44j26ul/XIlE0s6YkUhNCeg0teXNKgE42fAfMtIhyWvlDosg94wbuwoDA0fb8LNmMlCMcQNHm240TdYUlxnowF1vQW9GoszWCTVv3dPrsxGERH2loFD81g1Rgp6zEYLE+GJuQ4kLNZDjQiuxC5+S/TZ0obgj64Hc1IPvvgBs9kumGQTPaBINp77rnnSkVFhSEQ6RKXf//3f5dJkybJ//k//yetqpKcf/Ob35S//e1vw5ZDArRo0SJfCBDT9Nx8883y4osvDnvdZAcwz+GnP/1p+ec//+ltgmErONipue1C+jWzCLSBHDyEAXAbYgilK5E3XpOYwxnkbjxYv920RbaDvAUppZitkwCpkXOQKI++smmQTPsxam5oLO1kycgvlGK4bgQTjmSyHWTmD3kFcj+29SlslzaPHScPIVwGyY9KdhEgEV63bp384Ac/MMmJ0w1J8QrMEvyQO+64Q97//vfLeBcTWz+uu2zZMhOXLJ2y5s6dK9x+97vfpVOMOVcJUNoQhreAHgzmf0Ccj3UwgExHYiAzkTffGLaIjZ2dch80P3yBBCk0Xu2GF08YI/4G2W4tO3MIMHM9yXUxtEFcYs2ERLdvE+QqGfZSJEJ/QgrZ3+QVygp82hdHNyFG2KOTpkh/wMvOw1ZSDxAGKL388ssNEr/4xS/k9ttvN98Zjf0rX/mKnH322fKRj3xEfvSjHwk1MpZwqYyEiZqj66+/Xt54Y2DsZb4/prN55JFH5Pvf/751uNGmXHLJJXLGGWfIlVdeKVu2bBn87ac//an87//+r1x99dXyr//6ryYlTnNzs9HCMEegXajpYeBUalcefvjhhGlzmG7na1/7mv00+dOf/iQ//OEPB/e99dZbcumllwo1NZ///OdNQmb++Oyzz5py6+vrzf49ewbCtzBRM48788wzDS7btuE52CuJ6s+fWPdvfOMbQ3CzznHzqQTIDVo5eGwUM9m/Il7QxjQ1QXTJja5bmxQBhvh/OGBPrwJMaGmw2qJRapPeB/3BXwRIstsQUZoG9kyMG5REYfcTQ0wgN7IbB/8vNEG/Qib2l/C5Ytx4+QsSLMOMSSUECJSXl8vhhx9uanLQQQfJggULZMOGDXLwwQdLExLakmzMnz/f2AVZS1qM2n7OOecIyQgJEu3gTjjhBHPegQceaJbSpk6dKgsXDsRpe/TRR+V973uftLS0yAUXXGCSH9M+hiSLQvLzhS98QV5//XVpR/+qRODNf/zjH8K6HXbYYeYY/vOd73xHvvzlL8vkyZPlyCOPlP/4j/8weQQHD9j75b333pP77rtvyG6W/ec//9ns24kAvaeccopZPiWpoSaV9ed5tCNiomZem+l4ihGWgXVhih7W7aMf/ahQw0V8LBKUqP68ELVXvNZrr8FbOQ0J7olOo1J6qr8IcIb42IRJ8uG8mExLI6ha//JlUoRBNi8urcIzuxrldRg8Byl8AcWnPAjyelq2ImBHgAlXKSTgNPD3M55VDOEmorsa7Jdz9b0DhOev5ZWyJr9YxsDjcjxsp8aUFEM3pJJNBMaNGyef+cxnjFbmwx/+sHnR84V+0UUXya9+9Stj30atzC6MyS+//LKpKo2l+WJfu3atIQjcSe3Qk08+abQkN9xwgyEoLI9C0vKJT3zCECb+/aUvfUlmz55tbIQsokI7xqeffnrQlpTLUCRelmzfvl1uvPFGo6E56aSTzG7mFfzjH/+IFWB3bJpld2Il4Lvf/a4hPGwryR/L4ecxxxxj2kZyRLnmmmsM4bv//vvN39xP0vi9731Pfvazn5l98fXnTtrGzpo1S5YvX24IljnQwz9KgDyAlouncPh+dMIUOR9LR5OaOHf0IBj4+5Eqo+iU0xBRrsC8CB5DXqO17R0eCnN+SjU6ezu0PnZVv/Oz9UhFwD8EGFWcljVchu3Ad+brS0vwTEURHT0dW6NWvODWVFSZ54M2eNwKO2DMjRn2OAQ9rC4uUjKU1k3y72RqdaghoeaD3mErVqww5IaGzRQuH1GjQ+2IJUxsnEi4hMQlMZIFu3zwgx8cYtx8xBFHDJIfHkfSYPdE4zXpcMDrWnLhhRcKN7dCgkP7HBIsLmlRm8UltbEIrBsv1G698847RuvEpT5L6DhArZIl8fW39rMNbEs6opOEdNDLsXP7MFg/Mmmq7IaHiFeJwW0ygqzUfBHcj1xGQZIfqk8Z0blVyY/X26XnBYAAKQ+XYflJQ2lPru576xXBbD9ms/9wW93OklJZXVm93+SAQUB3dvfIcrhMv4pYXCuhGWL+sU48tyrZQ2Dp0qVGQ3PZZZcNLvecfPLJgxWi9oceY06EtjwULonZZeLEiSahrbUvnnzQ9Z2ExxJek1oWp/04XitEj0FLuMT26quvGhslaoKuuOIKmTNnjtFAWcdYn3SHp7ctz6Gnn7XRlonLeZbE19/aTy9FtiUdUQ1QOujl4LmMcPQIvMM+tn6NVHr01Nq2YaM8GiuQTqzlBiVMBcDghlYup6Cuo+UqAl4RsKJKl6CfFsErsR22Qm4kisE7lkYev97CIlldXSPDXZX1bALJ4kZhcmAu5XFyUcnQBzDyjs9B5qYdeqxzBLiERVseLmlZIRLozs3QAxSShXfffXdIgf/5n/9plpUsOyHrxxkzZhhNEZfVrKUr/kbX9kMPPdQ6bL9P2v7Y3dCpsSGZamhoMMtWPIFaIdoFPfDAA0POJ3GivY5daNdkyerVq41dDokPN5IcaoK4nHXqqacOIVn0QGNYAC632bVYTzzxhFnisspM9slrWUbmyY4Zbr9qgIZDaAT+3g4l/p9nzZU+DH5uZTXOfRBGl631WyRmY/5uy0l1fFl+AQLTCfI1DTe0pypFf1MEMoMA7YFIfhiTqhR915FQq0mvL48SAelaXTtGvIRspXaoGRHTt3R2yUqQsDdhv/cStERv4yW4uq1dmLdvF37nMV1oF0MDqPiDAJe6aABN93hqUujR9fvf/34wACk1QyRE//Vf/2XcxekhddNNNxm7H9aA2hAundFuhwSKBs6//e1vhfF1WCZti2hPRIPiZEIbGxolW3L88ccbo2raD9F4mjZJ3/rWt4yLPA2W7UJDbpKa3/zmNyZWFI2f//KXv9gPkc/A7oltIqnjsVyqI8mi1NXVmbqTvDBeFgkMDb5ZDo9/7rnnhPZN9IRLJTyXdlKWkXmqY1P95v4NmKq0EfKbn6wwrHYrjRion5g3Xz6waqXju/YyPE1eQgwSowJFZ+UAXjBjpuPznRzImSltK0bCkOtnP3KCnR/H+FnnsPZ9P3BKVEYHyALtg7gs1tfNb8klQvKTBsFfO2asdEBL6peQ5LD+3Ph882VUaFuao0a2GKSLGzWzRZihMI8atUn8rdD+fe9xftWtBR6oT69bK3xRByG9HjXhXupCd3QaCnOZiks41MbQDf66664zZIF/33PPPca4+etf/7rRyNDQmbZDlPPOO88YVZMo0N2d7vBcavrQhz5kAs5Sq0J3+4svvjhp9WhTs2PHDkMyaKjNQLV0e6dXGgkOl6Rou0PD6Hg59thjjYcYiRq3Qw45xLjqWwEVef6Pf/xjY4RNIkQ7HxIaS3tFTRWJ2wEHHCAvvfSS0TJRo0R7I9aDuFx77bUpCRzrtGrVKrN8lkrTFV/3RH/nobPn1LtmMVzklmEdNQjhuuPSrdvki/fc61vx1GQUgTRwwGDgPg40fZiBdTsIa+81ErSbyh/V1SHHbViX8hRaDfwv2kDtT7zko8Pm1+1v4MYBlA8m15adRoKuxgMQdAyh+Pon+ztVJGiulRdz4IdpKV3zDSx4iuh+DFpoDGP9TsR631evliJ4Cr2y11skWb297j8axouRSZPl4z/6sdciEp5HQlWwt+/nAyimnOAzkYf/mHePo08Un8SOsXcso2IrknIuRgHm7JQv1Qk11dKBZz1+iI3CCSEKuwuvsgWan22IDB2UDBIgPI+phM9BOV5mDA/ATy6jlWEpkEuCvM9+ya1nnynteGHzZR2EcHyy3MaDKD9RmbsR9oCGzlVVVYl+Nn1mK4zjad8Tb5tDrzD2Mbt2hkSDmhu6mTsREhwaPTOWjl1YLy5zkQSlEo7ttL8hYUkmJFm1tbUJI4pzyY2/WUI7ItoiOa0/SSGv/+tf/9oqwtNn6h5uK5KGSXSLiwfm7rvvFq7ZWS53tlP0KxDA+Cc9MeQ1ipsOkwyZgYJvAx4DwkAj5UzLa2UVMhZxghbs3J7w0owm+2eQn2TDdRTrxnnlFZKXRtj8AgyY5djCQn4sIDiIc1Dn7JY3iXeHLtCMDdODN3bPfqan1pn6aSHAbh/FQzBgMmztTf7J54IahgK8lMrgacW+QRsWLjMR+1wR1rkFS0jlaEMR+hCdBigMKspnxqvsxgszSPKTql7U/tTAo8zYDuH+VKBdfhKdZNeuRuiNk7Bsw2WVIIST6kxLMsNeqx4kPcnIAImT3UuM55C0JDveKtP+SbsivtOpkbKnPBmuXlYZJF92Ambtt39anm32fdZ3O/nhPrq1O60/l8cYBZrLg+lKSgLEoER///vfzTW4LsnolHawOMtnFEh7TIF0KzRazucAyZxZdgtGvmz5Aogg3w8jHWdKnhw7XuqwfjyudcCrwLpuPcjPX7BU1pmKl6EdUYTvL5g1Gxkl3S+g8GVHFXoYjJ1JSIsxgx0kpABiwA5JbZGsPhH0J58LjitdIAycFdo1QOxdNNhlfzETi71kNOg6pVM+iRs32geRCLYz1QXa6EWY3HQDs7pnSEg+x+DFVAvSQ+2sGkpnCPgMXIYxeRiFmhqUdA2JM1DdIZfgEh81QAzamK6kJEDz5s0zDJHqNQ5Gjz322KDlOi9sBSOKV6OlW6nRer7d6JdEiLFGirF1kGR4HDSdYMm56WNTp8tFWA4rxX2mvIXlnWeh+eCLZjhhnrAo1K9cDnMjHFCZebsrg2TPXj/OXstB8PBhliStlxWP4RJYkJjb66HfnSHAKQFtVOxCMlSOlzOXbfj8WEto9mPC8N3Y1kDFX4VnheZBvQ6eK3u9+/GsrKka3uPLfo6X74UgPbUga9X4nEj3ZC+F6Dk5gQBTa3CpOdfkqquuSrp06LYtKQkQ1WEvvPCCKZNGVlzmil8Cc3tBPd4ZApwJd4CMFOFwGo1xBkm7CUuV7qwU50e14EXyt9lz5QOr35MnseS1AtdyI7RryMOAmecwhgXV6My4nWmSQdVyFfDkdamBa48MLE24aaseGx4ESHgYJ8oS2qIU4R53gsCGacksCkNPPiPI8w7bMQRSxOPVBhLkVM+7bkyddFuNDOCTS1uToGFi8MQongujfQvgOlpkeBCgAoNbrkn88lk69U9JgOwFW7k+mKODeUfsQl/++GBM9t/1e/oIWDNfrrtjfHcdc8RJDd4D8Vk6dqJUYKD2IsYrbPYcMraUpzOys/2llfJgn36k/UIZNpKusNka+dRELQYImGXlvUhQw0jnA7qoZ5poD7kZJPo2l/d+EB+OoCV4jkvwvQ0PdLyhtP38rTB6bjZ2aPa96X/nEtcEpMwg8SFxVFEERhsCjgkQl7+YtySe/BAwxhx48MEHRxt2WWkvX+AU2s7Q48KvwX13Ty+iOrdLBMHVDoBRc02n+/QWjAsU2YH4FFMTeyIY7Qs0WZkkP6XAiWp9as40e3xWumzWLsolsS48Lrz/1Djy72z0gQhitiTK8t4D8sM4PuXQYtFDrt2Y2Q+FqxnP4laks/BqNzS0tIG/+BxOgNHsjPIy49ae6BjdpwiMBgQcE6AvfvGLctZZZ5kYAPHW2k5Dd48GQDPVRqr3uVkzN/vM100dqILfhAzE27r2KdjXVVTKkr5eKbItLTgtM8bw5pUwpq4c6t7JeCElsLdp7cvMkhM1PiQ/RtsDnFRGLwJ0r2/Z2wcqoengFMJubxckMlG4+8bauPCVXDrNTzGh4zEzjXXvJUKM9Lwez2Iq7VDyUhP/MgZLXLMq4MGjGp/EAOneUYWAIwLEaI6MSUDXOV3qClf/sIgPBzQa8dJ2yKkwL9BqJDJl4EG70KJiTc0YOWj3LkGgKPtPjr5HEf8hb2bp4LH0rqLEX2fwAB+/0LCZNj4kPtmY7fvYFC0qAATa92pQy6GJNFqXuL7v6yUxgYgiiJ9TYYKBfJAf2gd1ggitwNLXPusmp6UkPo5asLmVFUiOGlz8oMRX1r2KQHgRcGTkTxufWbNmyebNm8PbklFeMxIhesTQc8yJ7EQ8kqUtrUlJCe0S6kGCPAmIWJRqfwiNt0nKSM6CFl6LGLTgpeaetgVdOy0/TAh0wi6Iy6KcOFR4SAnjpC0x2v247Pd8SlrQeTeOGSO9JGnoz+kKDZwPra1R8pMukHr+iEMgpQaIWV07sDxCof0PbX2++c1vmrweduvxCRMmyKJFi0YcOLnWIMuNm4O6pRmKbwMDLq7r6JQ9tjD38cdYf2/HbLHaoz2QdHVKdUuzdCFgVr4Jl2yV6v8nvX5K0eYwxBLyv3VaYpAIWM8Joxlzqcn6O91r5iHJaQwuxrS3cSu0+6kvwEQG4SFIgNi3qc10a8jNa9POZxqisatkD4HePz7s+8WLz9+XLd33wkdRgSkJ0Gc/+1lZvnz5EDiY4TVe1Ag6HpHs/s1BnAM6l7jsmpDtsPPZhBDmTpfJ+EIw9kC9PVLkcqmgGucy6V8h1Pj5w4RVTwetKuRdYtBIJT/poKjnWsuzzEXHNCZOUtUkRQ3a1XwkgEQOmKSHJPuhD+fQ7scSkp5uPM8kQiVweuhF3ZzYBPH4+VWVqvWxgNRPRSABAimf0DfeeMPRw8Y4NSrhQoADejWMKDmQU9uzFrY+XmII0QZhHUjMgY27HDWQa6ocvhlXiAN1DF5hMmeupyjRqS7IAZ4vq0x6lKWqj/42MhCwnhF6jZFs9DjI2Tek5Wb5F0tf6PtehM9aIrsfEiGmXxkgQgP2fsmIEO19DqquMtGbvdRBz1EERgsCKQkQ84tYsmLFChOi3vrb+mSoegZHZN4P+/HW7/qZPQR29XTLju4e2cb8Qx4HZNa+BTFIttXUyhQsaaUSWh/RxHKIzwujRCP3UT76h19C7y6+XpT8+IWolhOPADWKXLxizKrO/j5EmI4/IvHfkQZkzXOwvJzo7G0gP3zWUoldI8S0LfQEtUdrL8FkdCHIj3p5pUJRf1MEBhBISYDsIB1//PEJYwBZxzDr93e+8x257rrrrF36mSUEaC+wtbNLdpB8gPgwrYZJKon9XqUesUiqETCtEmQqkZSa1wU8vYYsug0cGd3TBLUQwur7sBRmIkjj5eS9JYlqr/sUgf0RsEg2TdjoXEDPwmRaF54dQxytGJe+PEg7xs96FxneLY0Q7Xy4NBZFShlGil8M8kObIRVFQBEYHoHU0w3b+d/97ndl4cKF8stf/lI2btwoTI5Kg2imy+D3X/ziF/KjH/3IZIy3naZfM4gA1fcMZvjGnuYhWh/a/HA2SxLkVfgyWFdVLZEEZVTgN1obWfFLEl3DeMSgfl6FAz3JD2fmSn68oqjneUEAK0/SApd2GttXw+YsoaBfRmzRnhMek2Qnn6m1iJvlUMk0pBQSMjo2CJ7wo+vqZDwiO7s3ux5SpP6hCIwaBJI8zUPbz8SQ1O784Q9/kNNOO838OHPmTDnhhBOMkfQTTzwhJEhr1qyRJ598Us4///yhBehfgSHAIG9NULlT29OWIsggjyvmzBCDuFMj6PhKd2No3VhbJ3ObGgd/qsZo246RezhSEuMLglGip00fPNfpF85wmQlNDZ2dIqbHBYEANavcmGKDJMPuMca+nSjas5N68JnqSYO2MPTDImh+YHGHZyRiNL5MmcNn0rJpclIPPWZkIvD6668LgxUzA7zKUAQcqQS6sezBrLEzZswYejb+mjJlimzfG/OFvzfA3sOt0NPsb3/7m+zxqD52e71cP74XM74duCfLEcfnVWh71sDAORX5sdrL86gF8uKaa5XRiIG1sarKlMGAba0OyI91bqytTRgZ143QloFeOfaXjZvz9VhFwG8EGEWa/ZEaSUYcj9LlHX3bizRC88NnyqtweZs2P/T6tIQTHC7XkfwUwqaIzgKsK9PnqIwuBGi7e/bZZwtD2qjsj4CjJ6IcsVxoA3TNNdfIqlWrBkt588035e6775YTTzzR2Af97ne/k9NPP33wdydfuHT205/+1ARZ/NznPif0PFMZigDdYBtgzMzlrTdBeF7Dtg6kpxlq+VQ2CUNLGfiLJKiIhpYYOL3K5rIKZBEuNgHb3JZhIuM6NBLloM0XjVeNldu66fGKgBsEqJHsxUSkaudOk+Hdzbk8tgfP0MaycrenDR7PJ3gBXN2rYJ+UTPphG0QixLrSYJpR2flccStDahrvo0CyK+r+sCBAc5UzzjjDmKmEpU5hq8e+acMwNfvVr34lH/7wh+XAAw8ULn9xWay+vl4YK+hTn/qU/Nu//ZshRx/60IeGKWnfz8ws/9RTT8mvf/1r40l2xBFHCBkrP0ej8EVPssPM7x2RfmnB4MqEid4tZxKj2AvXXnqLDNgOJD4m2V7OOEme3q6ukYVIleHa3Rf9JrJtqxTMnJWUhJGVV9Lo1EMusmT11v2KgO8I4HllX2aeMVIQLge3OaUUeIbWwrOS1jteZQ5SW9S5TG1hBUu1rmnc6pGnj5oiPne0FuymVjc/nZpZpetnNhGgdzYVCl/5ylfS0vpnsw1BX9sxAZo3b5689tpr8uKLL8pbb70lpfAIoubnsMMOM3W8+uqrjRG0m8SovDlLliyRXbt2GUNq2hQdfvjhQ9q8dOlSefvttwf39eOlSI1RELJ27VrpAvnodaihcFsHem70YeMgRFuCnr1xRrrxncH8uM8uJJlcrkpnycpenv07NStuSRBV6BHUqZdEDYVthvp+KtT/icTSTLEN1vfB46DJ6me+MBjQx0sRBmO2tzGgexB/vWR/s86se1B9Idl1k+0n7snn+cnOcrc/AmIclvYS+z4860H0fXeoJD86thu2cOjLFNIFPhOMuVyMvsMFsQiesWT1r6fLO9roVSYhREkdnkc/7le8Xyex50ZyRG1xIdzgmBOQXmbgRmbjWMba07aQEzfuD0ro4abiHgFmb7BkvzHY+mGUf6YkQK+88orRzDDNxbPPPgsbP8TGwENhkRRG+qUGZ+LEibJ48WLXUJL40KPsBz/4gSxYsEDuvPNO+drXvibHHnvsYFkkXLfddtvg3z0w9r3yyisH//b7S/W4cVKAdvolXSA2rRgIm1EmEzHSfsDN4xxkxyUJomcLSdlwwuOonbLLZqjQKxFssRLxhpIJB9KEgngpUajhYyDSlpTB2LkHdWm3BzaxfszSJ/tbKqFGjKSNVhx8QVhLCtaLItW5bn7Lz8BLIB+4F/rY9y0sANHAWxOf7Gp8ecbwnbZdfNKS9XE/Xu5uMHZzbB60s/kJ7B0H6BA0mGgjNa29gz1iX+ltJaWyBc9OLO552ndE6m/V0N5O4rMyTN9MXcrwv3J8cCK8vXwO8BiYBLMkTtznl3hJyOzXtbWckY1ASgJ02WWXycEHHyz33XefWf5qaWlJiIbXVBh8OZJEPfzww8Jo0rzWH//4xyEE6Etf+pJws2Qxjkk2YFrHeP284IILZOnWbVIAmye/hFGRuU2xFUgSxGUua22en3wpxAsJJ3FJNouMP97L3wxkSc0CZ3LJpBSDNSNKJ8ojvXnsOFkCr7CCuPN5jziDLwTJ4TUSSV5rixTAdReNNDYJXPYrBAz7KFGiszKzj32TLxjGt+LgTtuJAozwzCDOGW+/ecElz8/EF4CvL4GAEnba0czjvfKx79vLtr4TE8vk1xp8iG8hsKW2YWAZBtqU7i4pROwp4uyEoFvlZ+QTz28Edj+xJMtP7Dt8pkuwjDse7WI2RSuQIl3e6/HMFHnsHfRAO7imGnglfqb8aD81V3x2qeUPg+Rh/FFRBIJAwBqDEpbNpS7r5ZvKuyvZCy5hobad48ePlwMOOMC85LmbWqCglrdsl836Vw5i3MYhZgeF1IcDJm1e9vT2DcS6wcCfCeFgzfvHWVs8CeO957JXvObHXq8eHLMJ6vw5Tbvtux19j2GZKwpNUC28B1tTuPA7Ksyng/gyLsXsOj82kFCWXnNcmjSzYWcTYp9qMnqKIaGMINgOwnYONroL/aEELz72zUECinvDfkrD3m5oj7gsmA2J7Nwhsb7eYS/N2jGzexFYn/GYBOnZBJd3hpPwIsThQBg9B0l+vNRLz1EEchWBlNMIZnznDJ5SjNkOZwaMBcQlq8bGRqF9Dn+3jnELwnHHHScrV66UnZhNUbicRpug0SYcDumVMRXahsWY3R1dh9xbcG2dAILEpaeghdofEh2L7PJ6HGQ54NJrbDjZBe3EHlsCx+GOt37nvK4cbvHNu92TJ6uMdD/5Qq0sLDAB7rgEx5cxtXMMfEdSGm+Xle719Hz3CPCekIDSk4n3hfeHxJ2aSaaqqMIyLPtqJiQKrWUsiSY82fX7QIJIhNphM9eSRGuU7Fz7/vkwei7fOx7b9+t3RUAR8IZASg2QvUgSlXPOOUd2wHiVg8+5554r3/rWt4z7O0kRc4G5lQkTJgizy3OjxTqJ1K233uq2mBF3PAfzsRgoK4BzIb2hMPg39PSagIdBLf/RI4wh9KntKcaLpQ9LXm50UOvLK+Rg2AI5zRpP3Rc7n7GZQJ/Kpzsw2poJIb6ML8T28cXajheqSm4hwHvHZVkrazvpDwlsEfouE5j2wPbOd6HGEn3Vi/Shb79XWib96G90PqCZG58xp8LJ0VgYPqsoAm4ReOCBB9yeMmqOT6kBsqNAeyBqbLgUNn36dPPT3XffbVTU999/v/1QV98ZpOnBBx80S1933XWXxiyIQ48DO11dqfo+CpqhWRXlJvha3GG+/ElvNMYU6cMSgxvyw4vTmHVdzRhH9aCnDKVz4IPuMsad2FjIWvsC+OSyI1MZkERSm5DM9iqAS2uRASPA/mocDqAhIvkhwaVWlVGSfREu08HlnX3Vi6yDy7vlWsHJBpfxSITyYfc0nNTimeRzr6IIKAL+IjD804frdXZ2mkiSN954o1RXVw/WgN5f9Mh6/PHHB/d5+UJD35qaGi+njqpzuBzGmeARIEKzEdrcpLbwCQEuBbH8DhADR50iwXVbsGy2E/GBUgkNwnvxToq3oIihj0XpVhyAcImE5IfG57Q1CkA3EECttch0ELCWzGjXxmWydLOjR7HkH0M0fC+yA+QnPss7SfhAHK6YlGIJ1r78bL8GI03Px+RHRRFQBPxHwNG7jktTNEbs6KA/w1BhGguvRtBDS9K/nCLAmzalrFSOGFNriFC6RpEcZDlPZqRYvjDSsafYDBffriSqelJn9iAml0wk5iUDIuSXMAUAl/Xa+vsM+fGrXC0ndxAg2aVzAQlROYgG7b3cSjrkvAuebFuwJRM+b91YguUzR09DOxHiM3kAyA+fTxVFQBHwHwFHTxYNoM8880y56qqrTDBEVoNaIbrH/8///I/JNeJ/1bTE4RCwiNChtTUyxoNxJXkIE43SzZiGppbQ8LfU46DLF866qhrEedm39MCxwRgDAABAAElEQVRBneSnFdu+q1hXs32iDtE0lhmskjjb58YlrlQebNbx+jk6EOgE0aC9FwkFl8f29dAU7QdxMn3S9nykOHrIT3wG1kIj6kTjSEcEBkjlZKYYzyRlJpa9qL1SUQQUgWAQcESAeGkGKSTpOfroo2XDhg1y6qmnCiNNMjv8l7/85WBqp6U6QoAzRyZEpKrcqTbIDLQ4j/YSiQyraQ/kdebZgYF/C9T+FBo6MygcyY8TiWG2Htm+zcmh+x3DWXQ1Xmyc7XNTUQQSIUCCTxsw2gfRJiwVEWJfZJ/0IlsQHqIT13Ajfei3vXgmJyMGz1wPnpVurqXHKgKjHQHHXmDM+v7yyy/L888/L++9955xiz/00EOFm0o4EJiApacazBhXtrYZW55ktaLxJd3bU2pjcDKD0JFU2LVDycqM378diR5rYa9UhZeH2zzZJmv8nibJH4MgiQ6FM3p6BDELtooi4AQBaj77YBNGIsRs6lwqsz8TUQRp9ZrlvRUeX9the+aO/gzUmhOP6eVlpj9zGdfEPQrCq80JSHpM2ggUn39B2mVoAcEg4JgAPfLII0bbc9JJJwk3lXAiQG3QEsQSWoMcRbvhOm8XBvWjBYTTJKi0T+Bg7IUAUcO0prJaylubpQjluJUoYkPlwTU+b5hotIxfxMCFbSEJpOi2nXp89hEg0Wd8IfZ1Pj/UDsWQ6oJBOr1IBBOMdYj540VImJjhnf2awmVc7qNmkwS/l/7zKoqAIuALAo4J0LXXXiubNm2S008/Xc477zxh1ncvsX98qbUWkhIBam0OrKqSzQVdsmWvUTGj6vbC9dYtmeFyAe2E3MRVsZKskn5thGv8/OamlPVN+CNeStGt9VIwa7ZJlZHomEoEYGSblPwkQkf3uUWAfZ1bMThGIWzRWj0Qd16TfZ4Jg71Y71DzQy2uXUh5qNm0iBD7PJMnq+QGAj9avdb3il67YJ7vZY7GAh3bAK1atcpkgj/mmGPkV7/6lUybNk2OP/54E7hw/fr1oxG70Ld5BgbTRTDCLCKBwewxka2Pk0bQJoEJP52IWV7DS8S6ViNmw00eZ8NMlRHZsX2/yxqjathutCN3GF9YKoqAnwh0bauXVuSBq0Ch3NwI+zr7vBch8ZmeIhebRYQ4GRnwcHQ8fHupjp6jCIx4BBw/QXzpHHHEEfKd73zHeIK99NJLJnLzddddJ9dff/2IByrXGmh5QtUWF8p02COkIxx4qXlnrKCkgt8szY9FfqxjN2Apqxf2EF4k1toq0T17Bk8txnXKsDwQltxhgxXTLyMCAWP3gz5HYcgGblzMKnNgzdMLAsO+7kW45MWlLyfC53HAwzEqFSBbtF9SUQQUAfcIOH5ydu3aJU8//bT84x//MNvatWtN9vavfvWrcuGFF7q/sp4RCAIVDKqGku3pHSYjZhD3rUsQx8lpJbh0RvuIngTLAiTH1BAlsy2iWfL62lo5sHGX08sNOS6K5JO0BapAuhS6CjvJTzakAP1DEXCAAAMdJrL7oRF/PsyjGcqhCw8Sc3slEnu050S/p9o3l4FN99r9pDou/reOvd6OzIvGpWoGMqVNk4oioAgMj4BjAsRM7a2YGX3kIx8RRoSm+ztzealkH4FCkI9y2MOQgDBRZCKZBBJESYcEkXwYEmRbdqKxM8kVl8lSCSPh7sBy3CQkk3QreRjQK2GT0TF7Dt5EjpWWbi+jx49mBPDsRLduRaCqxOSBvZt6IQ6YJELMYWfv8Yz23OogrQVO208mgdyPReLjdMTKizaQ3Je1RFJfPJPx2th0rqHnKgIjDQHHBOib3/ymPPbYY/Loo4/KmjVr5PXXXzcG0fQIq8DsRSWzCNB1l5Ft6alF0tMaHT5WCUkQZ4eb0oi2TONOXpvlWB5iTmecWxAluqakW8pgX+FUisCuSN1aYA+UR6Po6TOcnqrHKQKOEYiA/MT6hnpNJjq5H/yIRKgE/bJk73dGPt+cItpzonKsfVyq9jPPF8cDLo9RBsaIQkPUmAbGrQOEVUf9VARGKgKOp9PXXHONWQLbvXu33HLLLcgJGDG2P3V1dUI7IJVgEaBnF5e36A7LQZOkg3YwXOpKPGdNXJ9pMIxmkDWvwhkll7yoCYqPID1cmZwxMzKuPUp0qnNod5Efy5O2vQ2MwbU/iqVYFUXATwSiuxok1kGdjnPp2Ut+aI+2uabO1TNoXYXaGtr98NkOQswYATJEQkRiRMNpBn6k3RC1xiojH4GlS5fK73//+4RprEZ+64dvoWMCZBXVj4epBzN4RoXmklgRDP+q4HKt4h8CvClW5nKGwuf3QU0P8E83yvHsygqkzvBmlEzyYwZsfHpRr3eC1GxxkDWeywy9eUgYGfdqicKOKNo2YKTqH+Ja0mhFgH2JOei8yiomOkUfpQNAgUtSMROTkUwZMHMOQSLESRPthvrh1UC7IQYQ5RjDHGmc1PD5VhkZCJx11lny9a9/3azWHHLIIfLEE0+MjIb52ArHS2Df//735S9/+Yu88sorxvbn3HPPlZ///OfGFqg0DY2Cj23JqaJIcuiejjSzGDjxB0YoakiYkJS2NlRZd2OwYizZAgyufgqHuANgUPzuMBGj46/JGSu9Vaz8WlwC8+KGvh0Dbi3cfasTLMVxAK4GGK1odzKCFd22TfJmFg8bJDG+/vq3ImBHwAQ7RF/yKi3ow4z2TLsh2t/x+WDy3S78PZzU4hmYgkjp2ZQBu6GhNeDYwFxkxTFoikCO+DyyNRGMSUxiDF2SIU9Dz9K/woYAvbS3Yll32bJlpmpHHnmk/OQnPzE5PcNW12zWxzEBevzxx03+r9tuu00IZrZmCkHPT6jdqIKa2C8x9d07HpLgcB2eJIfqacbz6CHtSWy37FcVEpbDqNDMH/ZOc4sjEsPjOcDbPb3YFu6jdsqtrKuokiXQJBbixWFJAcAqQ1kDZtIpygR+wwVJtMrM5CdtLmgUTrpKXMDhfJNMLFnwGn72fb45eRe5RaFxQHxl0++TEVvfwHJSEJeF6utZMSdH73dMP4jOevRhu/A54OSA974YWCbrwfSYnA8tbBiFdaZDQx/wiWBLJGwfx0lr4/yNXd2Qpb1jAVaufRO3mjW3F/axqm4vHdjxjNdHZYUljdBydqThBWyVM9I+Hb/pmQMsDJJsUPGrbnypj5bIwtTgHAgbhGXQBKUiMcUY7A1xs5EV4s19Rgu0d9Bzcw9obroBySLn7x5YfijB3/m4uU4tMUyQRBpFT5ueMc8wDvhsL4kO/jdCDLicQHsoktr+OIwGjkr/X17D26Kl82vzGpno+4SOmsRCfOHLNN94T/HJRt65vZODXvwemOAaEfQdJ0bPyeqwobZOkplMmzYAy/KigUlDvJaUSU75TOWqcKzgNrzbhT8tjADLICXY0oOsefKy8/H8WM5J9SD63/ve90xC8+RnjM5fHBOg0QnPyG91FVTxcyrKZW07Q77tL1TpcwBPRpD4m9tUGdZVmmCDsKuqWmbCDqMfL0InSwfWufyMYUYT2bFDCpCo128p4zIAlgAqoA002joMwv1oK5cmVdJDgC8c9pt9BGJ/TEkiaGDM/mdpv3gfSDSHC7kwXO3YZ2IJll+HO8/6nX22yQFBo6aXWhHaB7HubNPE0pK0Xd6teuinIjAcAitWrJAPfvCDJoDx2WefPdzho+53JUCj7pbv3+CJsOGiK/12JIAcFA7cGOQte5/B/Qm+MEGj5Rqf4OeUu7aXV0gNlsKKe527xtsLjLU0SxQG3fnjxtt3u/pOjQRDChRAExFFnqVOYNHF5UksAfTDDkslOwiQQBhqFMePqD0aMNjFChbYVBeXsxxWkUb07DNepRvu7ptcRla37IPGFBfLXNjeqSgCmUDgtddeM3k7b7/9dhO/LxPXzLVrKAHKtTsWUH0Zi6QDubXoJcJlCdqy2O19Ul3WuMZzRoxZrlMxM2OcQ43KGrjGL9y9Sxjw0IsY13gYo+Yj2rRT4XIWwwlQ6B0zEEAy7k3rtDA9LqMIkBhxs4T3shIaOxJZknE6ESQSplRJJ4wCwzcwjIOXXsJnZDqMnmkbVIagpa3IPq+iCASFwDYY91Pz8+CDD8rJJ58c1GVyvtwAF9pzHptR1QCSngMQzoCeH/zuNt0EX0hU9TsRkh/a0ljapXb8Xe/ANT5V2VEkTXXiHk93X8ZD4ZJeG4gPN2+0K1Vt9LdMIkA7LMbDasNG8kNiS9duknhLoi0twj6SjtTDZq0DfdWLMMs7Dcz7QNBIfrjEWgEipKIIBIEAnZUaGhqMlza9iLlNCcBUIIi6Z7LMfSNEJq+q1wolAgzHPwfeKbRV8CIkTVyeSCVGu4SXSLx2aRteWK0pMmGnKtP8hpcgUxnE2pi5aahweY6Ztkm6+KKkxkdJz1CMRtJfjJNFkkGbrUoM/JUdnRLb7t3dndi0IMnpNo8JfUl8psX1bS6xUuM6EH/H2cRhJN0jbUuwCNx6660mjAgDFlsbtUIqQxFI/bYaeqz+NUIR4BICA6LRA4iRpmfEDdZOm01SYZbDksySacxKAmRfvrCXTdd4uhd7FpAgevdYmiC2i5oA1qsFL8R4bxzP19ETcwaBNmh+mrdsQlybmNSiPzC1ilvph6ZmXeVQl3enZbAPLoDdT7LLkpD3RiPmuSvCsSqKgCKQOQSUAGUO61BeidFgqSHhUpAlTJfhNVI0vV2KEwzkdPulwSpn5cmEXkHr4V6cluD6gplOFbx8+DqhJoBLJCqjD4EoItVH6rcY2zSa2DejH7APMsp4sQuusQ5LX14tdmbDto6ebKmEvbMVzx+fDBJ2ThJUFAFFIHgElAAFj3For0BtTw9mn4mMRudj1solIy/C8uzn8gVArU8yV3r7NfbgmjuRXsCr0MemGNfas3mT9MLoVWV0IhBtajLBMuMN82nAzEQqTGpag8+SpLqZAdx2wOi52eNzUAfvRHpYOhUSdRJ20iU+myqKgCIQLAL6lMXhG8OCSTSFliLu8MD/5JKS3/Vh3J4iuHw3I8N6MuEgPL+iQpbDpoZ1cCvUBFH9TyJEN2U3sqmoWCqROb68u8vxaezI5dgGs4Th+pFtWyWKMvLHT2CYWsdl8UCrzX5j76oStoOt+th2+f41iL6WTiW91ieG5KZRJG1OJSRCdIZnvGaS5l58i8871wF3983oh16w53LWHCwle+k/1FbRRo6u/sZuDd+91AHFeBKrztanp0J8PIljsooiEAQCSoDiUOVDz2SvYRDWhRu9pvwQllMFe4bOvQaiw5XJ6MyTMRPdYo8PNNxJe3/nC6YcRKsD13Jbf577HoxOF3d1SoEDMloFstMFiPYkms0zezyNYCdNch0xmsaDYekLXg3THd4uc1iE2sCQ9H1i35uCoCdsF5+Vhp2Ia+A0nvhAKSRC1HVW4kVLyo0eKxEsDa9CH2RKCLdCsjIPAQ+j6PuMJeVVrFGIMapYP9oLZUJYf25h6QsxrluqKAIBIKAEKA7UAgx8ZVlOUmhVqRvEowg2AX4kQy3FbJK2BfSQgYOw47QKc4BFV0ueNGMwdyrU/HBm3d7TKxUI/ub8zH1X4Gtjy7gJMq9pIFXGvl/2fWMqhQqMjQO5wwStSiIMsggX6ILJUyTPoYG3RYTD0hcKh7EjSdJyV7sLQY7D0t6uri4pKSkRhvR3IlFEBWeSXESuREdI2hNSFtWJX9l36/Dyfwd9j9HJvZQ0AUtfNTiX9ffj2eXrn9RnbCmIEMqlF2OQQvLZh+c9LEmunfaBIDFJp+xrF8xL53Q9N0AEnI0uAVZAiw4WAQ6YNKykXQ7JjxeZj3xhw7m3W+Wa2CsgJox3QunFy4RG1l5kN176u6ppsrq/cLmLucMs8rP/EXF7oE2IbNoo0Z07ED7YGw5xJeqfYUAA/SsKrU8UNl+G/KRZJ9rhMNhhI/peKTQvbrWXZThvZkATKD6/JD+Mc8RYViqKgCKQHgJKgNLDL7Rnk3JUMzoyyAcNKwfoiLfq0g7BSfbqYmjPaOhsT15IVbpH/mMqu7GkTDphh2EJ21WLf5i0I7kFk3X0/p80ju1fv16i7fvHC9r/aN0TZgSMl9f6dcPa+7hpA/vaJmzUAHZjyYnPTwk0Y06IEI+hyzvPCVIsIkQbIYavCPZqQbZEy1YEsouAEqDs4u/71TkYclCkxqYVywGp3M7dXJx5jKaU7SMi8ecaTy/k0Urk6UVtkNMo0fHl0jV4DbRAEbTHLHmhgc1gc8md6eNLSPA3CGF0y5YBjZBLe5EEpemuDCMQ60QS3I0bjJdXzK2dUIq6RqBZWY1Ep/a+RdurHgQspGZzOC3oDGh+KhH0MFNCrS7DVxQgvlYNrmv3vMxUHfQ6ikAuI5C5pzWXUcqBunPwo/q9AwOiPaaPn1WfCa+wFgRL5DUs4ayX17bSWlj74z+tKNHJgiDGH2//uxtz3Pqx42QBElm2Q6PklzAjeKxzs8Tw4sobN07yPQa786s+Wk4KBHDfo/RI3NOUVib3FFcwMah6kmhv+vYuH5vM7iAe8bGlqkFApiJ+VjakHxOMlmi/0QQx8jVVrh2oL7WvKoqAIpAcASVAybEJ/S90taXmhW6iAxFl7XNX/6tPdeECpMp4p6XVaHos8hOf1iLRlTkUc0Dm8kAiLVGic6x9bGMDXjrFsM2YnEYmb6u8+M8YDG5j0AhFGYSupkbyGIdIbSziYcrK3zEu3zY3S7QZMZ1sxNvvymzHPW8CkR9O2NfZ70mEqNmMQutJw2nGzcr2UhSfsfa9RI11qkB/jqB+A4l+h2uZ/q4IjD4ElADl2D0vhWt5MWL4cAZKW4CgtD3JYCkHMWB0242dXWbAd0J+rLIYG4gvDqfnWATL0i5tKS6RSnhxMcpzIMKlsUZ4nXGjVohB7FBfwfKfSuYQ4LJWHklPDyy9QE6Dlla4u29G33IqxkUcz96AfRCMnqH5IUkPk1hBFVkn1pOG00xF0wW7pkSBT8NUd62LIpApBJQAZQppD9eh3QG9PYqwUWvShUG3G0kUu4dYKXgoOM1T5mApjJm3GzzEByL5ofHmcINwAY7hfNxOljjDXYN8YYt6+6SE7s4BCpfHBEsu/YgmnceXIzRfeRUwcKUbvQNNQYBVG3lFo09EiTfiPsXaOyRG4gNtTwwvbZLgIKUHWpK1Hpc++UxWwVNsGsgy7YOCdk/3igPraa8beJCU5RcaQkSixBx5mifPK7p6Xi4joAQoBHePbuLF0OxQbZ0PvYo1KHVjYOLAVYBBKixCz7J2kI9ZmPUykrSXgbMP7Um1FFaEFx+9cHhcvJD2rEFupoWID5SPYzIhMcYRakKcYKZXwD3KQ3wXoyECGcqDx5D5OxMVGSHXiCHYYozkGZuxwyLhSXCvg25uFKRlTY33PF+0feNkgGSeWwUmKnx27WQj6DZ4KZ8RKpiJ3gQX2lsAaaYVIZ59nM9ZEbzfYElknsNMBOL00hY9RxFIBwElQAnQIxHxS/iiL0BxFrmxZrSclXFJiASCn/0ZivKaTrsYT4gu9RTOeOkav7zVvTs5286XB2MExQv301A6lQFnBzBdP6ZO5u1OHiQxvlzf/kadB1/eVq4x1JkkyCyZcbkMWwG0RsXAyy9p2rxZdq1dI0cfc4yzIi1sHfbl5cuWyQQQ2hLrPGdXSXlUP8h7P8kOCSSCYvLTYIf7GwZh4l32Ja8SHx/Lcg6gQXRft/dyvdYnnfP4JFra5cFAiLZlPWqNmD6HkzWOaftgYzsHQl/wruLJxeQFWzqViT83t6CMr73+HWIElAAluDmcxfklLCvYxRq/apq8HMuGwCI/1pG1eNFPhWv81i7M4F0KiZ/dHsiy97EveaUqcjdiDpVDEzSFxrEZFr4EqnFfazHYM0xjJTxwqrv6paKzXSrwdzn2Jw8Y4K2yD0Hrth2EomEnUj0EICQrM3CNL65819fS+SLsgVaTaR3ICbrwaNF6jN87sK8D32nR1Y7Pjr2/48/AZSs0Pwy06VXY72uTENxWeEpyBKnB7x0k814vEqLzqDXqgUE172PGZSQAmHHQ9IJOEFAC5ASlUXwMSUoeBqBkav0ZWAZqhk0O3W7dCkkQ7ZxIEqn5cUp+rOtsQdLUEthvjA0oqGEhXl2TcbHx+ByHOtbh05CeLAzIU8aOlcPgafTyK69Yzff185ijjw7EjZt2XGXAzTiID+KGL4Pfbc3APk4WWkGGdvX3Snd+sbRA69CEv5tAOrk/lWbQVlLKr03oM/VpGLZXwO5nBpa+Ugn7dAu0peUgQWG2D0rVBv1NERjpCCgBGul3OI32caDvgdE1l+iSCbVDXApYutc1PtlxifbzZUYCRA23W/JjlbceHjwl0F5Uusgcb50b/1mHHdPwZp6Kme5EbGW93YitxNqpZAoBLhqOxT0oR7qSEtwDpjsxspcc7UZv2YltB/rddnzuwacbUtSO/rIOm1dhfzfRnh0WsM8+qMAQfS4zqSgCikA4EFACFI77ELpa0I6hba8qf7jK0fhzJjRBG5CQ0o0UwfCbhs7pdEK+Thi9dyFemKUuowKXgNvMxvXn4kU7A+VQU2EJ7ZSyou63KqCf+yFAcjQJ94jbIXtvVTc+t4AIbYSmaCPISdu+W7jf+d3Q+qyC9icdCjIb/ZyhINyKFYuHz1UXSJCXgKBur6nHKwKKQGoE3D/JqcvTX3McAbqfV4CY0I7BjTBNxh4QEKdZ45loktolzt65eGaMoj0ax3LZ5D3YdCyEPVBxX+oMYQweuQCE5wC8BmfAsGH40HduUNBjM40Aba3mgxDNj6EXgfzsAhlaDTL0Hu5zi40M9cB7cWV1rbjr1UNbUwcCNSlFOpihRyf+i88VtUjVIFFcVk6HjCW+gu5VBBQBpwgoAXKK1Cg4jiSE3h5uyY8FDb3C3sZS2HCz21K413LJy750wWU2esp5NUCntuY9GEUfhFQJRQliBI3B74fgdbMQJMtvA2Wr/fqZfQRorzUeZOgEkJ+tIEMrQIaWwlZsJQhyL/qXV+GzMQ/92w+hdrEV5KcID1tFXoG00SVdRRFQBDKOgE6AMw55OC9I1TzJRzo2CsUwmJ6DKNHJhJ5eNKruxoBvJz88ni+FdMMPMGbwijGI62JbohiPfeeB+Fwa65fDoflR8kO0R4dMBRk6sbRY6ubMlSkwIGeuPK8S7/LutRz7eUylQfLDKM0VadTNXuZo/M6xpL6+fkjTGxoapKWlZcg+/UMRiEdACVA8IqPsb86Ja0AYqPXxqn2xQzYO8XAmMFBgnORjBs0ZbypjZ+Maj+PSESZOXQFNUDkI3b+A+HwKxGcOiI/K6EOgo7RM/jh7nrShT3GJ9vAxtXJQdZVUoW+4EUZ6Tuby7qacZMcypQ29KEmCGCVdxTkCTzzxhBxyyCFyySWXyKJFi2Tt2rXm5BtuuEHuu+8+5wXpkaMSAX3aRuVtH2g0B1uq9lugjvdTmCvMPpDT04sdrdeBBwxJEN2GvQptmCZXVUnp3Pky1aclC6910fOyh8Ce8gp5cNZcaQQhtgvteA5GwtsltTUyxoErPMnSjBRaTXvZ6X4nCWL/p30Qn0uV1AgwWvxVV10l99xzjzz11FNy6aWXyi233LLfSfHa5v0O0B2jFgF9ykbprWeQNtrqDJeTyws8JDy0B+Krh2SGQdT6cS0nQrtVZrenoahbqSsplsPwYpuCJKatOP+B6bNl+5ixbovR43Mcge11Y+WhmXOM5idZU0gyFkIbdHAKIsSAl3R5d98Tk111+P3s/7QPok0c68gEpiqJEaBW+fXXX5dDDz3UHLBp0yapxP2y5MUXX5RzzjlHpk2bJj/84Q+t3fqpCAwi4E4XPHiafslVBBjOvgSDKoO0BSlVGLxnY9lhC1J85Ln0dekHYzIJU/EScCKW7dHYuBk9bYIenjxVTsX+RTu3OylKj8lxBNZMmy5PVI+xp7lK2SL2UxKhNpCOTZ1d0mILpTAXJD5bWd4tQ2naxXGyQo8xP5aoU4KRgz+WYXmS9j+nnXaadCAMx7vv7otkvnz5cqMZ6kbOucMOO8wcc9RRR+VgK7XKQSGgGqCgkA1huczlxeSG7VC1By281pg0jDupmWJyxuGENkeHYhYfT36s86h3emrseHl23gESwctOZWQi0Iu+9vc58+SvLsiPHQkSocUgQotqqqUS3ydDi8i+lW0h6eFkhXogLsd50Yxmuw1BX3/ChAnyzDPPyCc/+Uk577zzBi/30Y9+VMbAKWLy5MlyxhlnmGMGf9QvigAQ0DfCKOgGlvdLfC6vIJrOgZovkGYkwaTX1zzYTyxr7zBeXm6vN5AqIw/LZ/trgjgzno0Z+kSHL6l3kJx084KFcvq2LVnJH+a27Xq8cwR2YMnrbxMmS4sPdjM0dl4wcYIcXVcrL+xuQmyrYDWlTlvJJTEGJuWyHIlQOzSro10j1Att3dKlS+XII4+UKVOmyA0wfK6BfZfl/VVdzUx9A1KIMYnHqCgCdgSGn2Lbj9bvOYVAMQZL2hF0Q+PTlQGtDwdnki0uJ1jCv2cheq4XMStg4D7xs15GnqbthlPyY12baVN/P2W6PDt7rvQiNoxKbiPQjX7wz3kL5KFJU30hP0SDxscfmjJJDoQh/WdnzZT3Txhv3NTDghSJUAuIEMXYCOGZG61SgLHlE5/4hLz11lsGAhpCH3fccYYEccejjz5qlsVIiJ5++mn54Ac/OFqh0nYnQUA1QEmAyeXdjHZM2wXaDfTayEiQbbK8vujSGy+TGSUaEZq9zKY54NvtgRiJdzYSUabD3N8pq5A18w+UI9taZPHWLVLo0EA7vl36d3YQiKBvvwPbrtcqq6XHB62PvRVnQftjubyTWnB5lctirzbtkdewsT+GQaj9obE0nwMSIaaUycQkJwxtt+pAAnT77bfL5ZdfbrTN1Pj8+Mc/tn4WGkkvWbJE2tvb5corrxwkRoMH6JdRj4ASoBHUBahtIfkh8bFrYYJuIgO50WYnlUp+Hrwz3m5uhueZ+xcIy2b+pakgP4liDHlpXydOeq6qRl5fUCVHtDbLkoYdUpghsuilvnoOwiign62aMk1ex31rCwCQIxEn6AAk9o0XPlMnjK2TQ0CEnm9skuWtrfGHZO1v2riRCFEYR4jaUj7/7p8yU0TO/XPWWWcJt1bcE/uS1x133GHa0tnJJ12k3KMW2pys/4xYBJQA5fittZadSD6ofaHnUyaFxqNOBlwuLcytqJT32ty/ukjs+GKiobPfs9xO1Ov52jp5HduB3Z2ycFeDjG0Lzwsuk/cyrNdqwsx+KQzZ3ystTyudRar2kVyfPH5cqkOMbds5kybIEWNq5JldjbIZXmNhEsYRopAEVeKZEZhOtyeIum4OGmH/2MmPvWlKfOxo6Pd4BEJBgOiuuGPHDjniiCOktrY2vo6u/96wYYPMnj3bnNfV1SVNTU0ydepU1+WE9YRCuLKXF+YbjUsnjCEzqe2xY0L3XDfu9GMRp2diX4ns7HaeZ53B6haA/JDocfnB+rTXw4/vfJW9hRfsW9NnyXjkEjuoo12mbdsqZRpF2g94XZfRCi+srVOny7qaWtmO/h6kUHPyocmTjKeVk+tQC/mxaVNlLYz7SYScJgB2UrYfx9CF3hoT6CxQhkkKPkyam+Hy9PlxfS1DEcgVBLJOgK655hopxWA3ceJEufPOO+UnP/mJCVzlFUAavn3xi1+Ubdu2mSJefvlluemmm+Qf//iH1yKzfh5tYIrhEp6H/5hKgktCrX3OAgsGUXnOMMtRHzfkx6oH7XdoxEnD7OFkGtTWM8vLBg/j4F2BLPL9IH1Byi5kDt+JZZaeWaUyE6RtVmeHzGpplkmtyC2El4uK/wgQ1Qa4LG9G0tK1SGGxuadXSkA08gMmP+zL58LomYb1boXJUedge3NPs7wEjzE+l2ETaoapobXEjCUYT0iIuBztt0bVuo5+KgK5gID7p97HVlFT04cYF5bhGtdrn3zySfnMZz7j+ioRvFC//e1vy7333isMkZ5IGBKdrtlhFc7WuFTESMp5qGsBXvZR7OPAGpbB1dQPdaIbrhdhGxfgpfEussYnoxJMZ8FI0oli+3TgupXAxev13da5Ib9AGmBs+yq2UigRp2BJYVJXp0wGGZqIpbJCB0TO7TVHw/H90Lo0QruztbJK6ktKZRtIZx/6RqbldHh5MdeXV6FuirZDi7BM98Lu3fJOc7gTcMaPJQw0zWeaAVJJBjlGUhsa037ttUvoeTmEQFYJEJep/vu//9vA1QwD2XfeeUc+//nPD4GPcR4Y7tySZHldeD7JFAnUSSedZB1uPhsbG025dJM8+OCD5e6770661Eby1IMYNkEIX/5MDcHPAjPWDwz4XNqx0lIMmOwNXJ2kLj8fkZSz8GJI1H4aIncDYydqdOs+8Z6wHXahA/okLJ/VI0JrvHAwPgAawXJgkuw+8PYwez0TuAYp8X2BvYKvt5VFCJA3doIUjJsodVgiG4d4JOO7u2QctjFYOqvAsqvfEo0OxdDv8lleFPcpGebpXK+jrFyakJurCRq9BpCdXbj3TbjPg/bw/GKLwGzqgueQfSdIORiBD+dCk0kvIT/kWGgr5+MZeQbjzXoUyPr327QvflwjiDLieyufXTOJxLjDUBpccseMzHiccdKCn01AVd42apg4flnPexD1i+oydBCwaplAIKsEyLoDzOjLXC0HHnignHDCCdZu8/nSSy8ZV8chOxP8MXbsWLn11ltl586d+/26bNkyueuuu4SeAcwa/L3vfc8cu9+B2IE5kBTFvbATHed0XxTlcaDgINGLLX6wGa6cePIw3PFB/V4FrUtrV5/rgIbJXgDjMPXcDWzabQlSabg5D0tOhdCy9A7zvt+NFyaNoxO53fuJAYOtpZKt+HEreo3AfshstWOlCPuqQVjKk2giU5WX7LdNMCBHhLdkP6e9P4YX3UZoY36HBKJ+SSe0Z60gOvvRGIfEdTjs06nnZPSzw0Gi2zwY5ae6Lsn9mbBZ2wSS91JrW+jsg1LVPf43Lo85Ga84P8uLDUzqOLkzi/UDc7v4Ij39TW24iiIQBAKhIEBnnnmmnHjiifLTn/5Ubr75ZrnxxhsH20p7Hm6WLIYGx60wWZ6VA+biiy82NkHJysjDoJ3vo8ukZb7pJewec9gUYSBlvItsimXsXOGiEiRuXNJkrh5GYU0kS4Dz21gy4CxyQmmJ0FXezbhpPOAw4DJitN9iaX9Yfy9C2pSaOrkrtQ+RrEmsghReo3lMna+XKEVp3NwKnReMDRAIlN/COD//OmOaIdB+l83yjBYNjheHT5sq78JQ+iV877YR/SCu6WeZfHapvaJtZhiEY7KKIhAEAv6PLi5qSW3NqlWrzBl0Vzz//POHLHe5KCrloVWI6moJCcVI8giz2hXEJ2dzTGvhxdjZSX0YrHEuSM9MpMuY75L8sHxq1SiaMdvAoP84QIBawwumTgmM/NirQJuaI2AfdBkiSh+GgIpuyL29HP2uCCgCwSCQVQJEDcH1118v1HRQGK583rx5vrf07bffNkSL69QPPfSQfOQjH/H9GiOtQCYiJbGwe5D43UbaQ31+9kw5A8kMvQq1P8WYIerLxSuCo+c8EvrzpkyWMcVB69KGYkrSRWPrz8yagSjm3tLCDC1R/1IEFAE/EEi8NuFHyQ7KoBH0BRdcIF/4whfMMg//JiHyW+bOnSsf+MAHzDWo/aGmSSU5Aky2yPhCXJoKSqhZ+sjUySay83QYj27FkocV0dbtNTthaMplOiZ7Da7Gbmulx4cJARLkDyLWDwMeZkvo1Ujt08aOThM/qHEY+7Js1VOvqwiMFgSySoAI8ic/+UmT0I5aID+idjKeEIMqWnLqqafKm2++abwU9uzZI3V1/to4WNcZKZ+WvU+Q7WEguQumTTGh+3kdxib5IGKx3L+53jOB4TLdGJCgPfhUUQTiETh70kQTWiF+fzb+ngUt0CUVM2QpQkG80Lg7cEP+bLRRr6kI5AICWV0CswBi0jo/yI9VXqJPupIr+UmEzMA+GhQzp1dQ9j7WlRk87hMwQGX0XbtMgcHl8ci3lI6Q/DAxpIoiYEfgHJCfRXB5D5NQI8XcYp/DEvAxdWNMhPMw1U/rogiMBgRCQYBGA9BhbiOXoyhBu5QfBYNQ2mCQbCWSY0GA0glKxzK5jEYip6IIEIF/CSH5sd8Zxr1637ixhggtDBlJs9dTvysCIxEBJUAj8a66aJOVzNTyqHJxquNDSXfOgBHocMkmedwHJk+UUrwU0hESuWosh6VXSjo10HPDgADJT66QCk5CWN9LZk6XWT6G4QjDfdA6KAJhRUDfEWG9MwHXi3Y3zKtlJU0M6nKc4V4Ie59D4AbsREjIaK+RrtAguhLG3PT8URldCLDP0dg4V8iP/e6Mh30cn5ePTZsqk0ISh8deP/2uCIwkBJQAjaS76bAttJOhxod5tYIURo++GC+imS5ntLQTOry2Nu2qMVUGCZCSoLShzJkCGOTwkzOm57y7+Qx4Rn4StnIfhnPAOHiPqSgCioD/CKjFqP+YhrZEan2Y18eru7mbhnH2+r7qSiQ09RZz5eTxY6UervENaeZlY5wgJnysRrLN1n71EHNzD3Pt2JkgDedOniyliGE1UoQBQrmtQFqNF5Fxvlm9HEfKrdV2hACBkTNShADMsFaBHnBcWmIS0w7k2QpamMn9Y4jxUwbC5VWotTkXcVu4nJGuMBcbyQ+1A4zOqzKyEGBAzVMnjJOPYtloJJEf+13ict5l8Bj7F9jI1alGyA6NflcEPCOgGiDP0OXGiTSu7AfxCdrWx0KDnl40dvYjkzcj9p41aYI8um1fXCfrOl4+OXsuggasCCqhHmCikvsIUOtz5sQJJhBm7rcmdQtI3RcirQ+399ra5RXkGNvV42fGudTX118VgZGGgBKgkXZH97an3CwDBJvKwg4dB2e+iJYgtomfcgDU//UwoH4LSVP9kL4YiA80Qgya2IWM7bmUpNKP9o+UMhiw8wSETchFQ2c/7sGByDjPbSPSCb2xp1k2ILq0iiKgCLhDQAmQO7xCfzQ1PjH8F7SBsx0I2hZ9CPF9OBsPQk6FC/22rm7ZmaY9kL1uDJpI0lYBvLrhNh9k2g/7dfV7egjUwLPvOBCfRdXVmv8NUNJlnlsLDP7fam6WZYgu3a3azfQ6mZ49ahBQAjQCbrWJ4owXeQ9e5EEmL00EFV9IFyC/Wp1HY+dEZcbvoxXQh2FTdM/Gzb4O7swb1oHAiSRCtA/qh7FQewZspOLbp38PjwBzeB1SUyMHwRaG90tlKAJ8Dk/B0jODKq7t6JCVMJqmVkiJ/VCc9C9FwI6AEiA7Gjn0nYafZVjmooEvX+KMe5Np4UvpvClTTD2CvjZd98+FS/BD9dt8vxSJkOVdQ6PrIhhK07Kix/crBVtgE2xCqmAfUgQyR2loaJASxJWpAXHIRWFS3sWo+2JoezKdwT0X8WKd6TzAZWNutHNbA1uh9Vgm2wQypHZvuXpXtd5BIaAEKChkfS6XA1spUjxQ20NvLkY75me2hLYXZ8HmJ5MxdhhPiDPc55FAMiih2zzJTwyfXE6sAJngEhn3h1UaGxvloosukh4sEba1tcm5554rN998s9xwww2yZMkSufzyy8Na9f3qNb6kWOZUVMj4aLUsGDdOmCdQxRsCXJpeDJs8biT527GMvAlkaBsST+/A1hUJb5/21mI9SxFwh4ASIHd4ZeRokooSaHeK8QLmbD6Kv7vwEqamJwxCEsIEjtkQXnc7Bu+17R2BXp4vDC4nRvZq1qhxYwJX7ue9CBMhuuOOO+TYY4+VW265RSKo24IFC+SSSy4Zgk8MgS8ZDiFsQs0OE+FOh/0YbVlIOinNsGdR8Q8B3vkp0Nhys4R2Q3yWGkGcm3r7sPWaLdjwqNbV9VMRyD4CSoCydA84r+VySyG2fFo14P8oXlJGAwFtQyeiNHfjBczlmIKQJPckCfgA0lQwUnM2hTmT7ttcL40YsDMl1LY127RA1MSV4b6QrPK3Xty7bGnkLrzwQpk4cSB9CPsKl8FWr15toHnxxRflz3/+syxdulS+/OUvy3XXXZcpyPa7DmNRTSgtkfGIY8NAmXwZa+La/WDK2A7aDdUUVYrAm8wSEvzdDEAKTWIM94jR1Bk4lWE06FjBSRgnADxORRHIdQRyjgAFPYflC432Jn6JVV8OGFEMG/34whcljRONt4btperXNYMohy+vjyCtBZcosi0kjufDKPq3m7dkTY3PVCLxsZVIigZI7d677uNbgrGLksnChQsHf3rggQekG7P6008/XR577DFZvny5PPXUU2bfYYcdJqeddpocddRRg8f//+2deWxVVR7Hf7QFugEtUChQlnFYIsMijCwqiBiBgBUnUYIySoIGNOMfuESNMego/qES1GjQSNxwCQ7RaKzCREEYihrFBUQBGZUdS9la6ELp8ub3vXDfvL6+vr7lnvfuff3+ktd3l3PPPedzTu/9vXN+5/cL3ICy7WTfz9RQKOg3yBPBacHGlmp9if43zCjeGT2Xo/y8OAV2ThXz0zW1kn/6tP54ce5ZYrMz/d2gSk6dfsA/W9sOn8Kgm2JaGM8v/GCDbVGdTqdhG24m6tUw0Unj6/QwfT+oWDHttv6fFVN2vMhDBDz33+ngOyVkM+EfNxGhIkLe3KUHYeyMZe6YAnKLwA/M9WqAvebQYWvkzA3lglLUoC8GMTCHgJdKW0FF3nzzTVm6dKmsXbtWMvXXO2TOnDmSn39+unLatGmyadOmVhWgeof7Pv6PymM0Ja/VUYjOqgR5UQGCAoHyZ+u0kltGb6P5/8A0KhyZZla5w7dQI1Z6GBSzuRssOLOOm4DnFKC4a8wMoiIwSg0or1Fj5///do/qcqOJi1QxgyH2urKjRu/jhcyXL18ub7zxhmzcuFGKior8Re6qK6hsydBf8n1VaaSQAAmQAAnoCDMhkEAoAhgWvkYdEMK7s5s7yV90Ndrl6hivPcuqVatk9erVUlpa2kz5AZOSkhKpVr8wlZWVlnJUXFzcnlGx7iRAAiTgJ8ARID8KbtgEYJg6W33uFGWZ8exs38epbyhAWLH1o3rBbY+yZMkSKSsraza6s2LFCgsFppCwFL6qqkoWL17sWZ9A7bFdWWcSIAGzBKgAmeXrudwtex+Nwo4QEV4SjFTBk/NOXb3S3uTAgQMhq7xgwQLreI36foFk6zJzCgmQAAmQwHkC3nrLsdWMEhibl6fu9HtImq4G8qLM7NPbWoUSbnWRF+sVb5mp+MRLkNeTAAmkIgE3m3ekIm9X1skKZqqjPlf3Us+7HlV+ABZq23W6Wu1PORzpcGVHY6FIgARIwEUEqAC5qDGSUZTeGitq/sABMjTAGVoyyuHUPdGh/6ZKUKrUxykuzIcESIAESKA5ASpAzXm0q71x+Xny94H91Rtsas2EwpnlbB3R+qvWj0ICJEACJEACoQik1psvVA2jPOZTb81N6tHULYIYTk6XB155Z6nRMAyefer0zIDfPn+ZUXY4VkuGXKlxw7JVGdp84qSAYzRip3eafTRlCExrlyfwmNPbJvpaPGV0W3kirYvdVl4tv93n7e9I620qHZ7JFBIwQYAKUBBV/NMjqrYbBGXBx6kglshnhMbxulxHRjo11Gvk8Hpj1bQfnliBlEyewzQcQ8euubJBlaCzUUa/huKWzLIHNk6j9gPT0tjkovoqe4SU8KLYChDK79T/biI5oPz4uKXv+wx7gk4kW97LXQSoAAW1R3paumS5xP8NYjohGrwT7vR7agDK6YW9rMjbQVU2sgtX+niA5ubmSme1M0qmYHXb0IIC9RhdLvsvLAlvqzy2IuyWvpCRgDAkGRq3yi31tUJhaL/xcigM9Hsn/nfb6qtOn/eHwrgQTsXp/KPNz4t9INo6Mn1yCFABSg73hN0VASgn6FQQ7H28vMIrXmC56tdoTlFf2XqqQrYcP+FosMZ4y8brSYAESIAEEk+AClDimSfkjjAEHpPXTcbDDiYBowcJqZQDN4EiOFSnAUtVCdp9psqBHJkFCZAACZCAFwlQAfJiq4Upc4YqPsM1PtZlGh6ii8e8OYeplqOnEEm+WFeJjeteJ5vKj8tBjdxNIQESIAESaF8EqAClSHvn6Ut9tI74jNTo7Zk67UVpmwB8IM3t308O1Z6VbRUVsqeqWpqiXC3W9l2YggRIgARIwI0EqAC5sVUiLFOOTm0NVgeGQ3RKZxDjPEVIrWWyInUHUJRVKDW68mh7RaUVVLXSoyuQWtaOR0iABEiABEIRoAIUiopLjyHUQy8dteifnaVKT67lx8elRfVksWArhalDfA7rarEfy4/JEXVBckpXtFFIgARIgARSiwAVIBe3JyKy91Flp0iVnf46StFXl+d3VBsfinkChapo5uiUYp4uoT+ho0F7q2vkYE2tHD5bG7U/IfOl5R1IgARIgASiJUAFKFpiBtJjiXa+2vDkdeooPdRfT0HnTtJTX8CN1dWWXxb4AqIkjwDaBJ9LL4TWOFZ3Tg2na6TsbJ2U6wcKEn3VJq99eGcSIAESiIWA5xQg0+Mfafoqy3LqdaZvxYy0DroMPUNgr5OjXolz9burxt7qose66Hc3VX6wcquFqD3KadihaHp1y9ritOsPYNoIH9QhVP3cXgHlL/VadpQ/SAq0uQpgc3XB7qpB2+eYpjtxrt5ShqAQVTY0SE2D5hGiaYOyi2g33ak+GeZuuIdjfT/MfSI6pdwy9dMhAfWOqDxRJGrQtAjfoD1E8DzxmiBwDV4MGijHFUU3vaTDoX9RV7BiIaIj4DkFKM2wMtCnploW7twRHcU4UiPAQctX7IUM1RN0g47++KAEeUzgTbaT2tE06rTdOQ8ux7dCkKgn63MRegXvoe2DjykprayUfQb7fgfN+8+VFQnt++FYpYIn6GxVkOkJOlwrR3buX/pMNimm3ykmy8684yNgWrmOr3S8mgRIgARIgARIgAQMEKACZAAqsyQBEiABEiABEnA3ASpA7m4flo4ESIAESIAESMAAASpABqAySxIgARIgARIgAXcToALk7vZh6UiABEiABEiABAwQoAJkACqzJAESIAESIAEScDcBKkDubh+WjgRIgARIgARIwAABKkAGoDJLEiABEiABEiABdxOgAuTu9mHpSIAESIAESIAEDBCgAmQAKrMkARIgARIgARJwNwEqQO5uH5aOBEiABEiABEjAAAEqQAagMksSIAESIAESIAF3E6AC5O72YelIgARIgARIgAQMEKACZAAqsyQBEiABEiABEnA3ASpA7m4flo4ESIAESIAESMAAASpABqAySxIgARIgARIgAXcTcIUC9Msvv8inn34qx48fdzctlo4ESIAESIAESCAlCCRdAXr22Wdl2bJl8sMPP8jtt98uBw4cSAmwrAQJkAAJkAAJkIB7CWQks2j79u2T0tJSee+99yQtLU3effddeeedd+Shhx5KZrF4bxIgARIgARIggRQnkFQF6Pfff5dRo0ZZyg84jx07Vj755JNmyLdt2ybffvut/1h9Q4Pccsst/n0nN3bt2iVZPp+sXL/ByWxjzqupqcnPJuZMknhhY2OjVf4OHToksRSx39pN/Muqzkh5RaWxvl9+7Jhk5+ez78feXfxX+vQZgr6Tnp7uP+a1DTf1/arGBjm+c6exvt+gzylK+ySQVAXojz/+kG7duvnJd+3aVU6cOOHfx8bWrVvlhRde8B/7x113SeeMyIr9jSpOp06elBnTp/uvD7cxZdIkydeXQFG/fuGSJewcHqQQLyoQsOda+dprMm/uXBk0cGDCmDl1I7exL5p6tRxTJSVS+Y+OrELtvHLy5IguQd8vKCiQwt69I0pvOpHb+EdT3706sr16zRpZpFP6PXv0iOZSV6R1G/vekyZLRUVFxGz+rfakPbp3l3GXXhrRNddfd11E6Zgo9QhEpkkYqjd+IWGUwJYGHd3Jysqyd63vhQsXCj6xyL6HH5aj5eWy8M47Y7mc18RB4LfffhMYtw+86CKZeNllceTES2Mh8M1331mXse/HQi++a5p0Oh99f/jIkXKR9n9KfAQmRnl5ydq10quwkM/9KLm1x+RJNYLGL86TOkJjC7b79Olj7/KbBEiABEiABEiABIwQSKoCNG7cOPnpp5/k4MGDgtGfkpISGT9+vGMV7dKli3TXoVBK4glgdK9nz57SqVOnxN+cd7SmlvPy8kgiCQTQ59H3MyKcqk9CEVP6ljBjwLOfQgJtEeig873nDU3aSmno/Mcff2zZ+EBRGai2Ik888QQfHIZYM1sSIAESIAESIIHzBJKuAKEY9fX1UldXJ7m5uWwXEiABEiABEiABEjBOwBUKkPFa8gYkQAIkQAIkQAIkEEAgqavAAsrhyOZnn30mU6dObXUKDaNM8CmEZeWwP+rYsaMj92UmIlVVVbJ9+3a54oorQuKAh+8jR474z/XQ5cFDhgzx73MjNgIYPf1OV3xh9SR8arXmMgFuCZBu0KBBMmzYsNhuxqtaEPj1118tG8aJEye2WMFqJ2bft0k4+3327Fn5+uuvJScnRy655JJWn/vs+85yT6Xc0v+pkgoVev/99+Wpp56SW2+9NeQ/Qm1trSxYsECqq6vliy++kI0bN8qMGTNafWGkApNE1QEPokceeUT27Nkj06ZNC3nb5cuXy5YtWwTev3fv3m0ZveOFTYmdQFlZmdx2221WH/7555/l5ZdfluLi4hb9H2Fm7r77boFRNNJkZmbKxRdfHPuNeaVF4N5775Xvv//ecnr43HPPWTaM/UL4EGPfd77DwCcW+j6Un6+++krWr18v00P4e2Pfd559SuUII2gvi/4C9mnoDN+iRYt8kyZN8unLOGR1Xn/9dZ/GHfOfQ3r9x/HvcyM2Aurvxzd37lyL//33399qJjfddJNv//79rZ7niegJPP/8875XX33Vf+GSJUt8upLSv29vzJ8/36ce1a1dVZp8qiT5dDTUPs3vGAjs2LHDpx7p/Vd+/vnnvnvuuce/H7jBvh9Iw5nt1atX+zRskpWZriD2zZo1y6c/rlpkzr7fAgkPBBBI6jJ4JzRJOFLE8POKFSvCZoehaoTasAXbO9W9OiU+AjU1NfKwOpy8+eabW80IaeDjCb/a3n77bTl06FCraXkicgJ33HGHNeJpX1FZWSkY6QwUuJcAb3u0rbd6es7OzpbDhw8HJuN2lASGDx8uK1eu9F8F9hgJDRb2/WAizuyrUinz5s2zMsMoD94D8CsXKOz7gTS4HYqA5xWgzp07y+zZs1sM+wdXFtMFCLVhS6iwG/Y5fkdOYMSIETJSPd6GE3iFhv0VwprgQYXpmOCYb+Gu57nQBOBvxrZj0xEIS9GZOXNms8Tl6gkd0wSBtkEIPxPogLTZBdyJiACCN9te68H4rbfeEh1taHEt+34LJI4eePTRR0VH3iz2UOwDhX0/kAa3QxFIKSPoUBW0j0USdsNOy29nCcDe5IMPPrDirCHnwYMHy2saJ+zaa6919kbtNLePPvrIGll75plnWriSCO73QIRfxrADosRPYO/evfLggw9a9oUYiQ4W9v1gIs7uP/bYY6LmDHLfffdZUQSwCMYW9n2bBL9bI+D5EaDWKhZ8HJ5ZA3/1Yrtv377BybhvgAACGZ46dcqf84ABA+To0aOW8aj/IDdiIoCRhzUaeBMBg+FINFiw2g6G/xiBs4V93yYR3/euXbus0Ye7NEAzjM9DCft+KCrxH4PRvx04G4bnV111lbXCNzBn9v1AGtwORSClFSAsf8QHMlmjYq9bt86ap8exL7/8UsaMGROKCY85QAC2KGr0bOUE+wgMU+OY2p8JvH9PmTJFMI1AiZ3AWg36uGHDBnnppZcEtj2BYvd9hGOYMGGCYJQIsnnzZmskDuECKLETAN8HHnhAMAWDvhwotb3FfwAAAbRJREFU7PuBNMxsYzr9lVdesTKH7RVWgmFkGYKVpjjGvm/h4J8wBFLKESKUHCyHhF0QZNmyZZaNBGxOMOyP4VLEHsOLF0Z0c+bMCYOGp6IhsGnTJsEL+emnn7Yug7+lxx9/3P/iXbVqldU2aAfYXy1dulR69eoVzS2YNojAjTfeaI2kBdr33HDDDbJ48eJmfR+KKF7WmBJA34fLgqFDhwblxt1oCLz44ouiK5Ga2VYhnM+HH35ojUSw70dDM/q08DsGtycw5oddIZ79cHOCPg47uCeffFJGjx5t/Qhj34+eb3u5IqUUoEga7cyZM5bxIgMVRkLL2TRNTU2Ww8RAY3Rn78DcwhHAdAwDpIYjZO4c+74ZtlhlB3u2tkaT2ffN8Pd6ru1OAfJ6g7H8JEACJEACJEAC8ROgEUb8DJkDCZAACZAACZCAxwhQAfJYg7G4JEACJEACJEAC8ROgAhQ/Q+ZAAiRAAiRAAiTgMQJUgDzWYCwuCZAACZAACZBA/ASoAMXPkDmQAAmQAAmQAAl4jAAVII81GItLAiRAAiRAAiQQPwEqQPEzZA4kQAIkQAIkQAIeI/A/4MGEEMhzxy4AAAAASUVORK5CYII=", null, "data:image/jpeg;base64,/9j/4AAQSkZJRgABAQEAYABgAAD/4RY+RXhpZgAASUkqAAgAAAAHABIBAwABAAAAAQAAABoBBQABAAAAYgAAABsBBQABAAAAagAAACgBAwABAAAAAgAAADEBAgANAAAAcgAAADIBAgAUAAAAgAAAAGmHBAABAAAAlAAAAKYAAABgAAAAAQAAAGAAAAABAAAAR0lNUCAyLjEwLjIyAAAyMDIwOjExOjI0IDA5OjE3OjU4AAEAAaADAAEAAAABAAAAAAAAAAgAAAEEAAEAAAAAAQAAAQEEAAEAAACOAAAAAgEDAAMAAAAMAQAAAwEDAAEAAAAGAAAABgEDAAEAAAAGAAAAFQEDAAEAAAADAAAAAQIEAAEAAAASAQAAAgIEAAEAAAAkFQAAAAAAAAgACAAIAP/Y/+AAEEpGSUYAAQEAAAEAAQAA/9sAQwAIBgYHBgUIBwcHCQkICgwUDQwLCwwZEhMPFB0aHx4dGhwcICQuJyAiLCMcHCg3KSwwMTQ0NB8nOT04MjwuMzQy/9sAQwEJCQkMCwwYDQ0YMiEcITIyMjIyMjIyMjIyMjIyMjIyMjIyMjIyMjIyMjIyMjIyMjIyMjIyMjIyMjIyMjIyMjIy/8AAEQgAjgEAAwEiAAIRAQMRAf/EAB8AAAEFAQEBAQEBAAAAAAAAAAABAgMEBQYHCAkKC//EALUQAAIBAwMCBAMFBQQEAAABfQECAwAEEQUSITFBBhNRYQcicRQygZGhCCNCscEVUtHwJDNicoIJChYXGBkaJSYnKCkqNDU2Nzg5OkNERUZHSElKU1RVVldYWVpjZGVmZ2hpanN0dXZ3eHl6g4SFhoeIiYqSk5SVlpeYmZqio6Slpqeoqaqys7S1tre4ubrCw8TFxsfIycrS09TV1tfY2drh4uPk5ebn6Onq8fLz9PX29/j5+v/EAB8BAAMBAQEBAQEBAQEAAAAAAAABAgMEBQYHCAkKC//EALURAAIBAgQEAwQHBQQEAAECdwABAgMRBAUhMQYSQVEHYXETIjKBCBRCkaGxwQkjM1LwFWJy0QoWJDThJfEXGBkaJicoKSo1Njc4OTpDREVGR0hJSlNUVVZXWFlaY2RlZmdoaWpzdHV2d3h5eoKDhIWGh4iJipKTlJWWl5iZmqKjpKWmp6ipqrKztLW2t7i5usLDxMXGx8jJytLT1NXW19jZ2uLj5OXm5+jp6vLz9PX29/j5+v/aAAwDAQACEQMRAD8A9/qG780WkphOJQp2nGefpU1FAGbbS3T3Uo3OVCDCyLtXd7ECrMMs8se4xxAhip+c9iR6e1Wahtf9S3/XST/0M0ALmf8AuR/99H/Cs251eW2uXhNujbcc+Ye4+la9czqn/IUm+i/yqZtpXRtQgpzSkWv7elz/AMeyf9/D/hR/b0v/AD7J/wB/D/hWT3pax9pI7/qtLsav9vS/8+qf9/D/AIUf29L/AM+yf9/D/hWSe31paPaSD6rS7Gr/AG9L/wA+yf8Afw/4Uf29L/z7J/38P+FZVA6Ue0kH1Wl2Oms7ma7s4bgRRqJEDY3njP4VNmf+5H/30f8ACq2j/wDIGs/+uK/yq9XQeUzGuNZlt7uSA2yEpjnzD3/Cmf29L/z7J/38P+FUtR/5C9z/AMB/lVfvWEpyTsejSw9OUE2jV/t6X/n2T/v4f8KP7el/59U/7+H/AArKpD1FL2kjT6rS7Gt/b0v/AD7J/wB/D/hR/b0v/Psn/fw/4VlUdqPaSD6rS7Gm/iCVI2b7KhwCf9Yf8K1opJ5YUk8uMblDY3nv+FclP/x7yf7p/lXX2v8Ax5wf9c1/lWlOTe5yYmlGnblFzP8A3I/++j/hSQStKJNyhSjleDn0/wAamqtafeuf+up/kK0OUs0UUUAFFFFABRRRQAUUUUAFFFFABUNr/qW/66Sf+hmpqgtf9S3/AF0f/wBDNAE9czqv/ITm+i/yrpq5TWiRqsuCRwv8qOTn91CeJWG/etXsQd6Oarb2z94/nRvb+8fzp/U5dyf9YKf8j+8snPFHNVizcfMfzo3t/eP50fU33D/WCn/I/vLPNHNVtzf3j+dG9sfeP50fU33D+36f8j+863Rv+QNZ/wDXFf5Veqjo3/IFsv8Ariv8qvUi731OV1H/AJC9z/wH+VV6dqzEazcYJHC/yqpvb+8fzp/VXL3rkvOoUf3bg3Ys80HORVbe394/nQWbI+Y/nR9TfcX+sFP+R/eWeaO1Vt7f3j+dG5sfeP50fU33D/WCn/I/vJp/9RJ/un+Vdfaf8ecH/XNf5Vw8zt5EnzH7p7+1dg9w9rpEc0cYkZY1O0nGePYH+VL2LpbspY+OM+GNrF6q1p965/66n+QqCx1e3vrmS3iP7yNQx5B4JI7e4qe0+9c/9dT/ACFAyzRRRQAUUUUAFFFFABRRRQAUUCigDNiS8/tCfLEREHazc89uPbmp4Fc2Lrv+fdINwHfceat1Ba/6lv8Aro//AKGaAM21fU0vbeKVSbcRYkZhzux6/WqGrIG1WUtnGF/lXUVzGqso1SUE44X+VJuS+HccY0ZO1b4fMjt7WylcK8skZPqOK0R4egIyJn/IVjBgx4Nbek327/R5Dz/CT/KiNed7SZVXLcNy89NJoafD0Ax+9fr6Uv8AwjsH/PZ/yrXbt9axNX1XYTb27fN/Gw7e1bRlOTsmefWo4alHmlEp3dpp9qSvnu7j+FQKzn2HGwEfWmnJyTzQK6Yq27PGqVFJ+7GyOu0X/kC2X/XFf5VerKsJjB4ctZFKArCnL9B0/wA470tlrKXF2tnJEyT+XuYdgcAkf+PCuE+lWxhav/yGrj6L/KoovsxI80SAeq1Nq/8AyGrn6L/KqWa7IL3EfP4mVq8vU3LbSrG6XMVyx9scipj4egyP3r/lWDHK8Th42KsO4resNaWUpFcEK/ZuxqJqa1TOnDzw1T3ZxSY7/hHYP+er/lVa60mztVzJO+T0AHJrbublbe3aU88ce5rl5pWmdpJDkmuadea0TPYoZbQqauOhXuoovJk8vdjaev0rrooY59PhjlRXUxrwwz2rkbh1EEgJ/hP8q7G0/wCPOD/rmv8AKkpTlrMudPDU3ahbzsEVpbwOXihRGbqVXBNMtPvXP/XU/wAhVmq1p965/wCup/kKZBZoopqOrruRgw9Qc0AOooyM470hIAyTge9AC0UhYAgEjngUtABRQDnpSBgSQDyOtAFS+1Sx00Rm9uooBI21DI2Mmpra6gvIRNbyCSM9GHQ/SsvxEZhaxbCoQyoG+ZgzHIwBtGeam0S8guLZo4yQ8Rw6lmYj8W5oA1Khtf8AUt/10k/9DNTVDa/6lv8ArpJ/6GaAIJ9QSG6iiKyEMSGIiY9BnggVz2tOrapIQR91f5VreJ0X+wLyU5DRxMQQcEV5LeSQuUNrLMzn7wYmqhLldzHEUvawcL2O2BIIINWoZSCrqcMpzWVpuTpttk8+WOtOnvfJ+WM5c/pXRUpe1jpueVhMc8FVak/d2Z019rX+iokJ/esPmP8AdrCJJPJyaz7Wc+dhzkOf1rQqqceWJji6zq1L9Ogc4oo7UVocx1mkxpLoNmkiK6mFcqwyDxVtLeGNtyRIpxjIUCq2i/8AIFsv+uK/yq9Xnn1MdjjtX/5DVx9F/lVSrmr/APIaufov8qp4rtp/Cj53FfxpeoUh6ilqC5kEcXueBVmCV3Ye+sSgiF2Lwp09RS/a45x8rj6Gsdz271bt7IMu+Xv0WojRjfne5tVx9dx+rQfurcuTHMEnI+6f5V3Noy/Y4PmH+rXv7VwsiKlvIFUAbT0+ldpa2VqbOAm2h/1a/wDLMelZV+h35XtL5Fzev94fnVezILXGP+ep/kKd9itP+fWH/v2KjsUSP7QiKFUSnAAwBwK5z1Sa4QyW0qLnLIQMHB6VyUNlr1mI4LVLhIkhKnMiEE7BjBJ4O7PUde+K7B22oT6DNYx1xwf9Qv8A31UuSW5pClKp8JRmtdS86O4ijv8A/VlGVpkLhd4JHXGSM4/U09YNTASS8kl2CSMbHYEbeeuO+dta2n6g167qYwu0Z4Oav5GcZGaE01dEzg4OzOWmtdZlssolwLuPeVaSVCN/lOAVx0G4r1/KnS/27Le+akU6QNMcQsycJtQckPxzvPRu/TiuooqiTkYbTXLfEcTXCxqjBclWGfm6ktnn5ccGtjT45Y7+RWZ2AgjDs5yTJzn8cYrWoxikBj+ImCWGWPBdQo/2iRg57UeHY7c2HnwoAznDt64NP8RK76S6xorsSPlbfzz6KCT9O9SaGsy6TCs6urgYIeJYz/3yCQKYCW9pcpe3EjyYSTO1s5I5449qda203lN/pcn+sf8AhH941oVDa/6lv+ukn/oZoAz9V066utMngiuS8jrhVcAKfrxXn82i6nZamzPDZ71bdhSccjp0969Wrk9b/wCQrL9F/lV04qUrM58VVlSpuUdznltbqO1jTzBlVwVXp+FUjnJznNb3cVRvrfcPNQc/xAV6EHbQ+UxFNybmUUJyOea1oJPNiDZ5HBrH6EGrdrN5cgyfkbg1E1yyua4aftKfI90aWODzRj3pQMjiig0Ou0X/AJAtl/1xX+VXqo6L/wAgWy/64r/Kr1eefUrY47V/+Q1cfRf5VTwfWrur/wDIauPov8qpniu2n8KPncV/Gl6iY96zLqXzJcg/KvAq5dzeWm1T8zfoKzGyzBR3qrczsYyl7ODn16E9nAZZN7fdX+daZHHWmQRiKIIPxp56VTdzKnDljruMmH7iTn+E/wAq7q0/484P+ua/yrhZv9RJ/un+Vd1af8ecH/XNf5VzV+h7OWbS+RNVa0+9c/8AXU/yFWarWn3rn/rqf5Cuc9Uml/1T/Q1yJ+8frXXSkiJyOuDXIHULrcf3zdaPYupsxPMI4T4le5q6H/rpf92tNLYpfyT9nQL17iszQ7maeaUSyFgF4zWql5E901uN3mKMnKEA/Q9DRycnusFiFif3qVrliiiigYUUUUAFFFFABUNr/qW/66Sf+hmpA6lioYEjqM9KiteIW/66Sf8AoZoAnrk9b/5Csv0X+VdWGVvusD9DXKa3/wAhWX6L/KtaPxnHj/4DM7vQRkEHoaO9OBwa6zwDEuIjDMV7dqap5xWnexCSPd/EvNZ0UTzSBVHP8q00lGzOPWjVTiW7e62LsfOOxq8hDgFeaLW1iReQGfuTVsAAcCvPniXB8tj6vDZRHEwVTn37G7o95bro1mplUEQqCPwq79utv+ey1Do//IGs/wDriv8AKr1ZnZa2hxmpyLLq1y8Z3L8oyPpWdNdLGDjJNbWo/wDIXuf+A/yqq6IQdygj3FUsS4+6kZTyiNROs52vqc/I5YlmOSansIcv5rdulWZNNN1MFthhieFqc2zWu2F0Klexrtg0o+bPmq0JSq3+ytuwvag9DzR2oPQ0wGTf6mT/AHT/ACrubT/jzg/65r/KuGm/1En+6f5V1l1PNbaLHJAT5gjG3Cbsnb0rmr9D1cs+18jTqtafeuf+up/kKp6Vf3V1LLHPFtCs2DsK4AcgA568AHirlp965/66n+QrA9UnkBMbAdSDXKHSL0sf3J6+tdbRVwm47HPXw0a1uboYui2VxayymaMqCuBWjFZrHdy3HmyM0nGGxgD0HGas0VMpczuzSlSVKHIgooopGgUUUUAFFFFAFEWbm8llZgqMm35CQTz+h+lPghV7B4DllLSL8xzn5j1q3UNr/qW/66Sf+hmgDOsdLntLpHMo2KiqcE84UDp096ytbH/E1l6/dX+VdZXJ63/yFZfov8q0o/EceP8A4DM7HPf86UAZ5J/Og4zT4onmkEcaksT0rsPBSbdkENu9zMsUYJZj+VSXelrpc2xckMM7vWuk0/TlsogTzKx+Y1JqdkL21KjAdeVNYe297yPSWX/um38X9aHH/ifzp4kbGMmkZSjFWBBBwRSdq2cVLdHBCpOm/dbR12i/8gWy/wCuK/yq9WNbytD4YtXVpFYQpgxqC3bpnj8T0o0u7vnuWhuQHAA+cIQPuqc57gktXAfTLYydWYjWbkAnov8AKqRyTyT+dXNW/wCQ1cfRf5U60ubS2YO1u0jjoWPA/CuuCSimlqeJiJynVcJTsvmaui6cYYzPKCJGHyg9hVy90+G7QLIDu7MDyKz/APhIk/59z/31SHxEmR/o7f8AfVZONRu52QrYWNP2d9DMvdOmsn+YFkPRx0qmRxjn86338QROpVrYlT1BNZdxJZyZMcMkZ/3sitoyl9pHnVqdK96UijMP3MnX7p/lXdWn/HnB/wBc1/lXDT/6mTHTaf5V3Np/x5wf9c1/lWdfodmWfa+RNVa0+9c/9dT/ACFWarWn3rn/AK6n+QrnPVLNFFFABRRRQAUUUUAFFFFABRRRQAVDa/6lv+ukn/oZpyzRNI0ayIXUfMoYZH1FMtf9S3/XR/8A0M0AT1ymsoz6tKFGeF/lXV1zOqf8hOb6L/KjncPeQfVo4n93J2TKcVhJIw3OiD1Zq3bCGyslJEyNIerE1hd6WoliZS3N6OT0aTum7nUNd23H75evrS/a7b/nsv51yp7fWlrP2rOn6lHuauo2dpdsZY50STvzwaxJLaSI84I9VOampO1axxUo6HJWyWjUfNdpnSaN/wAgWy/64r/Kr2Ko6N/yBrP/AK4r/Kr1UZWtocfqyltZuMDsv8qqeW3oa0dR/wCQvc/8B/lUHej61KHu2F/Y1Ot+8cnqVfLb0NBjbI4NWqQ9RR9cl2D+wKX87K3lt6GgxtjoatUHpR9cl2D+wKX87KU0beRJwfun+Vdxaf8AHnB/1zX+VchP/qJP90/yrr7T/jzg/wCua/yo9s6m4LAQwnwu9yaq1p965/66n+QqzVa0+9c/9dT/ACFAyzRRRQAUUUUAFFFFABRRRQAUUUUAUY9PK3UkjyZRt2AuVb5jk8g+3FJPbWlpbvK7XCovJxPJ/jV+mTRLPC8T52uCDigDOMNrBceS8t0zyNkfv5CFz0Gc8VM+kWbsWdJGY9SZnJ/nUr2UclwszM+5TnGeD6VZoBNoz/7Fsf8Ank3/AH9f/Gj+xbH/AJ5N/wB/X/xrQopWRXNLuYsun6YTIcSL9mO6TEj9MZx15qW203TbqBZoonKN0zI/+NXmtUZpDlgZOGwfbFOt4EtovLQkjJJJ6kk5NFkLml3Kn9i2P/PJv+/r/wCNH9i2P/PJv+/r/wCNaFFFkPml3M2eCzsLYEi5WJRgCOWQhQBnoD0wKasVrFOts0t00jfMCZ5MckkDOfY/lV26tVu41R3dQG3fKcZ9j7U37FGblbgs5cep4PXH5ZNMkhbR7J3LtG5Y9SZXJP60n9i2P/PJv+/r/wCNaFFKyHzPuZ/9i2P/ADyb/v6/+NUns9LJdykyCDlxvcZH581u1UWwRfN/eynzDlskf4UWQ+aXcrQaZp1xCkscTlWGRmV/8ak/sWx/55N/39f/ABq5BAtvEI0yQO56mpKLIOaXczzotgQQYWIP/TV/8aJoLW0VAxuQpIQbZpMDsO/FaFQXNql0FEhYBTnAPWmJtvcpRRWqz/ZPNunkUYLGeTk4B6564INaEMKQIVjBwTkksSSfqaiSxiS6+0bnLnsTxnAGfrgAVZoEFFFFABRRRQAUUUUAFFFFAH//2f/hD11odHRwOi8vbnMuYWRvYmUuY29tL3hhcC8xLjAvADw/eHBhY2tldCBiZWdpbj0i77u/IiBpZD0iVzVNME1wQ2VoaUh6cmVTek5UY3prYzlkIj8+IDx4OnhtcG1ldGEgeG1sbnM6eD0iYWRvYmU6bnM6bWV0YS8iIHg6eG1wdGs9IlhNUCBDb3JlIDQuNC4wLUV4aXYyIj4gPHJkZjpSREYgeG1sbnM6cmRmPSJodHRwOi8vd3d3LnczLm9yZy8xOTk5LzAyLzIyLXJkZi1zeW50YXgtbnMjIj4gPHJkZjpEZXNjcmlwdGlvbiByZGY6YWJvdXQ9IiIgeG1sbnM6aXB0Y0V4dD0iaHR0cDovL2lwdGMub3JnL3N0ZC9JcHRjNHhtcEV4dC8yMDA4LTAyLTI5LyIgeG1sbnM6eG1wTU09Imh0dHA6Ly9ucy5hZG9iZS5jb20veGFwLzEuMC9tbS8iIHhtbG5zOnN0RXZ0PSJodHRwOi8vbnMuYWRvYmUuY29tL3hhcC8xLjAvc1R5cGUvUmVzb3VyY2VFdmVudCMiIHhtbG5zOnBsdXM9Imh0dHA6Ly9ucy51c2VwbHVzLm9yZy9sZGYveG1wLzEuMC8iIHhtbG5zOkdJTVA9Imh0dHA6Ly93d3cuZ2ltcC5vcmcveG1wLyIgeG1sbnM6ZGM9Imh0dHA6Ly9wdXJsLm9yZy9kYy9lbGVtZW50cy8xLjEvIiB4bWxuczp4bXA9Imh0dHA6Ly9ucy5hZG9iZS5jb20veGFwLzEuMC8iIHhtcE1NOkRvY3VtZW50SUQ9ImdpbXA6ZG9jaWQ6Z2ltcDo4YTlhMDZiOC03ODE5LTQ1ZGItODI0Yy0wZDRhYThhYTA4ZTQiIHhtcE1NOkluc3RhbmNlSUQ9InhtcC5paWQ6MWIxNmQ3ZGYtNmU0OC00NDY4LWI0YjQtZWVlOTFiYTFhNzg4IiB4bXBNTTpPcmlnaW5hbERvY3VtZW50SUQ9InhtcC5kaWQ6YjM1MTQzNGEtMjViYi00ZDIyLTgwZWQtODIwYTMxZjgyM2UwIiBHSU1QOkFQST0iMi4wIiBHSU1QOlBsYXRmb3JtPSJXaW5kb3dzIiBHSU1QOlRpbWVTdGFtcD0iMTYwNjIyNzQ3OTY3MjM5OCIgR0lNUDpWZXJzaW9uPSIyLjEwLjIyIiBkYzpGb3JtYXQ9ImltYWdlL2pwZWciIHhtcDpDcmVhdG9yVG9vbD0iR0lNUCAyLjEwIj4gPGlwdGNFeHQ6TG9jYXRpb25DcmVhdGVkPiA8cmRmOkJhZy8+IDwvaXB0Y0V4dDpMb2NhdGlvbkNyZWF0ZWQ+IDxpcHRjRXh0OkxvY2F0aW9uU2hvd24+IDxyZGY6QmFnLz4gPC9pcHRjRXh0OkxvY2F0aW9uU2hvd24+IDxpcHRjRXh0OkFydHdvcmtPck9iamVjdD4gPHJkZjpCYWcvPiA8L2lwdGNFeHQ6QXJ0d29ya09yT2JqZWN0PiA8aXB0Y0V4dDpSZWdpc3RyeUlkPiA8cmRmOkJhZy8+IDwvaXB0Y0V4dDpSZWdpc3RyeUlkPiA8eG1wTU06SGlzdG9yeT4gPHJkZjpTZXE+IDxyZGY6bGkgc3RFdnQ6YWN0aW9uPSJzYXZlZCIgc3RFdnQ6Y2hhbmdlZD0iLyIgc3RFdnQ6aW5zdGFuY2VJRD0ieG1wLmlpZDplZDIxNzM4OS0wOGI5LTRiMTMtOWYzZC05NjI2NjEwYjFiNWEiIHN0RXZ0OnNvZnR3YXJlQWdlbnQ9IkdpbXAgMi4xMCAoV2luZG93cykiIHN0RXZ0OndoZW49IjIwMjAtMTEtMjRUMDk6MDU6NDAiLz4gPHJkZjpsaSBzdEV2dDphY3Rpb249InNhdmVkIiBzdEV2dDpjaGFuZ2VkPSIvIiBzdEV2dDppbnN0YW5jZUlEPSJ4bXAuaWlkOjU0NDhjNmFhLTlkMzQtNGNhNy04NjYzLWY1MjdhMTc4MWIxMCIgc3RFdnQ6c29mdHdhcmVBZ2VudD0iR2ltcCAyLjEwIChXaW5kb3dzKSIgc3RFdnQ6d2hlbj0iMjAyMC0xMS0yNFQwOToxNzo1OSIvPiA8L3JkZjpTZXE+IDwveG1wTU06SGlzdG9yeT4gPHBsdXM6SW1hZ2VTdXBwbGllcj4gPHJkZjpTZXEvPiA8L3BsdXM6SW1hZ2VTdXBwbGllcj4gPHBsdXM6SW1hZ2VDcmVhdG9yPiA8cmRmOlNlcS8+IDwvcGx1czpJbWFnZUNyZWF0b3I+IDxwbHVzOkNvcHlyaWdodE93bmVyPiA8cmRmOlNlcS8+IDwvcGx1czpDb3B5cmlnaHRPd25lcj4gPHBsdXM6TGljZW5zb3I+IDxyZGY6U2VxLz4gPC9wbHVzOkxpY2Vuc29yPiA8L3JkZjpEZXNjcmlwdGlvbj4gPC9yZGY6UkRGPiA8L3g6eG1wbWV0YT4gICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICA8P3hwYWNrZXQgZW5kPSJ3Ij8+/+ICsElDQ19QUk9GSUxFAAEBAAACoGxjbXMEMAAAbW50clJHQiBYWVogB+QACwAYAA4AEQAXYWNzcE1TRlQAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAPbWAAEAAAAA0y1sY21zAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAANZGVzYwAAASAAAABAY3BydAAAAWAAAAA2d3RwdAAAAZgAAAAUY2hhZAAAAawAAAAsclhZWgAAAdgAAAAUYlhZWgAAAewAAAAUZ1hZWgAAAgAAAAAUclRSQwAAAhQAAAAgZ1RSQwAAAhQAAAAgYlRSQwAAAhQAAAAgY2hybQAAAjQAAAAkZG1uZAAAAlgAAAAkZG1kZAAAAnwAAAAkbWx1YwAAAAAAAAABAAAADGVuVVMAAAAkAAAAHABHAEkATQBQACAAYgB1AGkAbAB0AC0AaQBuACAAcwBSAEcAQm1sdWMAAAAAAAAAAQAAAAxlblVTAAAAGgAAABwAUAB1AGIAbABpAGMAIABEAG8AbQBhAGkAbgAAWFlaIAAAAAAAAPbWAAEAAAAA0y1zZjMyAAAAAAABDEIAAAXe///zJQAAB5MAAP2Q///7of///aIAAAPcAADAblhZWiAAAAAAAABvoAAAOPUAAAOQWFlaIAAAAAAAACSfAAAPhAAAtsRYWVogAAAAAAAAYpcAALeHAAAY2XBhcmEAAAAAAAMAAAACZmYAAPKnAAANWQAAE9AAAApbY2hybQAAAAAAAwAAAACj1wAAVHwAAEzNAACZmgAAJmcAAA9cbWx1YwAAAAAAAAABAAAADGVuVVMAAAAIAAAAHABHAEkATQBQbWx1YwAAAAAAAAABAAAADGVuVVMAAAAIAAAAHABzAFIARwBC/9sAQwADAgIDAgIDAwMDBAMDBAUIBQUEBAUKBwcGCAwKDAwLCgsLDQ4SEA0OEQ4LCxAWEBETFBUVFQwPFxgWFBgSFBUU/9sAQwEDBAQFBAUJBQUJFA0LDRQUFBQUFBQUFBQUFBQUFBQUFBQUFBQUFBQUFBQUFBQUFBQUFBQUFBQUFBQUFBQUFBQU/8IAEQgBJwIRAwERAAIRAQMRAf/EABwAAQACAwEBAQAAAAAAAAAAAAABBQIEBgMHCP/EABsBAQACAwEBAAAAAAAAAAAAAAABBQIDBAYH/9oADAMBAAIQAxAAAAH9UoJGpClN+YtE5AEIhMgAAQSAAAkAgIJAAAAAEGQAIJAAAAAAIRKQAAMIcZiudkVkT0ABER8u5bu5w64JAEIJkBBIRcdvnOhmAOXx2V3F6FIACCQAQZQ8d1b33TWACqOlAAAAAAAAAAABUFuAREfIuP0F7q7cTIAGJkAQCZi7sPK9NMAcjhurOH0yEEgGJkACCUeHTWfSOmnAHOHRgAAAAAAAAAAAqC3AIiPkXH6C91duJkADEyAIBMxd2HlemmAORw3VnD6ZCCQDEyABBKPDprPpHTTgDnDowAAAAAAAAIhMgAVBbgERHyLj9Be6u3EyABiZAEAmYu7DyvTTAHI4bqzh9NEBIBiZAAgI8ems+kdNOAOcOjAAAAAAAAAgkABUFuAQfIeK/vdfbBIAMTIAgkhje2HlummAOQx21nB6cQSAYmQAIJR4b6v6T1VAA5w6MAAAAAAAAAAAFQW4BER8c2c13lrgkAIxhlMgQSDotXb06QOPYU23jJAAxRlBMgQSeeG36bj0xCZDnDowAAAAAAAAAAAVBbgEHxex8jc762CQAYmQBBIiepqPedOzA47LloLbxIAAxMgAQSRx3n1Hj9JwcRunXHOzPRgAAAAAAAAAAq4j1NeZtikiLWXsn4xY+RuN9bBIAMTIAgkRPUVHvOoZgcdly0Ft4kAAYmQAIJI47v6jx+l4nFSTH1A52Z6MAAAAAAAAAAHM4tfLH0ZdScZhHBZ4/b4y+QaLPpSx3cNzt4MpAYGYPBroOqnrt9dq56Opp/edQzA47Ll5628Ts4btvV23vNbWGvsmWBmAecTSabKv09mpnp+lbuGISDnJdGAAAAAAAACESkCIgVMzbmMBKPkXH6C919uKLHZx9f2UGch5HoU+6t46w8t4ZapiDLqaj3nTsoTJx2XLQW3iSCULnnt+t4vR+uO71Br458jx3+lr6cjw6az6R004A5w6MAAAAAAAAEREzIAFQW4BER8h57a+02eOGczN1vqun6qeU+SKvfW8TY+ThEEiJ6io95uxnRTj0SaTLmobbxOJKCSPbHf1tf6i802KJ4/kvq7V3Qhlo8eir+k768Ac4dGAhEpAACICZEEkEiIiZkACoLcECI+L2XkrnZxenJf+9V7j009/XdnnrLbyVOzi4qz8h5zhKYCJienqPd447KSYuDz2c1Ba+JIglMkIxT0nHe2td67l+P0Hn0VfhaeIx66PDmt/qPF6UAc4dGCt1zwu3Du8Jrk6eUXETUos5aOM2ktcqYi4mZRrnQSJQSAFQW4KMuz4vY+RuN9aMtfXu0H1Dbw3dNY+T4Oz8h55aIRLKCRE9TUe86hmBx2XLz9t4kAAYkpreD0trx3sXHgcc9Ujju/qPH6UAc4dGCm1ZfE9uqkT9T1Z8Fu1aevb9Nyw5yM7iMfn8zZIvoj51lP1ctYju84Y5/EYm5zx+rxIFQW5pHz00Ic11Utpurr7pqpPTluvWk+i6V78yy6K6WMpEGSYh1NR7zp2YHHZctDbeJwRkkAYGjq6q/X0+Nj5T3Y7eHVYYderxeg7Li9LIBidcCDzhIlAKrFaZRlExIIgCrLmZwiPjie8mOqSBUFuDwPz3LWxjy28n0i08VBjOFLq7GrrvOiuynEAkhE9TUe86dmBx2XLQW3iQBJB5xNHz2WHVT+XRR2Ovvs9dh6RlHHd/UeP0oA5w6MHjE0PPaAXnRWbE4hBIAhEpIJREfIongZfpHLHDHKZjVTbgxxfl/J5SvcuPubbxOplzVG+t84n0rvWWmzRvbOWUiCRE9TUe86dmBx2XLQW3iSSACKvT2aMZeVh5Tfw67fTZCSOO8+o8fpQBzh0YNXHZw1f6cSdr3+Z8p15Za7CM0gAABjD5riy2Y/ScZ42J2s8dGMrMGMPh8tdF1t4rW6+a6uznQIz5rn15Ly86azOYmJgmUQ6qo951DMDjsuXnrbxMIMpQPPHOi0WPn2+e9NvD0HNdSYkk8d59S4/SgDnDowauOfDcHqUJmO17vNTGup26OijYSAAAER8twzrN2r7LjnEEqktwDCI+M2PlLnfWRMaGzhp91aQZe1b66wz12W3jhKEyRPU1HvOnZgcdly0Ft4kASVOnu0WvysPK33PcbWPQIJI47z6jx+kAHOHRg18cuT5L9BLqeui2stSJmYJAAABHyzDLZ2YfSsckhUFuAQfF7HyNzvrcT0jKp3VtXur4hnz2vrx3150V/rlhBIiepqPedOzA47LloLbxIA18NtNpsfHt8vtbNF7z3MGUZYThI4736jx+kAHOHRg08ufgbLxiZQ7uu9fv4dYAAAACHM4zWbMe5iQKgtwCD4vY+Rud9bBJCKLfU6ufNCfev8AVbOOy538OUZxOA6io9507MDjsuWgtvE5ROExBTc9lr58nj3+Z6DRb7OHSQIJI47z6jx+kAHOHRg08tHzu18MgmPoNX7fT1dWjMdSlIAAAIJIhMgVBbgEHxex8jc763EyINXLmoeinGeix9OL0u9s5bLdyZCJ6io951DMDjsuWgtvEjBlU6e3X17vGx8puRN3ptZjLGcZIJI47v6jx+lAHOHRg08tHzu18MgmPoNX7eo1dVtljYRkkAAAAAAKgtwCD4vY+Rud9bijIJmJoemn08+WYevF6bLRYesxbRs2sOlyXvQMgObnXn10WnOqsnDynHHoqPPror/mutiNhIyThCZiOO8+o8fpABzh0YPJhS9FUCLnRa+0bAAAAAIJAAKgtwCD4vY+Rud9bBIM42aufNQdFPiwnHdd0P0+2r/X+mG+Yi7sfLdNMAcjhtq+H0wjLXX9vmKH0XyfZx2W2mzkyZQgQiUxx3n0/i9JyZlMdXDnZnowAAAAAAAAAAa0MpV5bw1D3mM0/GLHyNxvrYMiAQim3Vuls47vRab/ACeh2aT6DlotJmLuw8t00wByOG2r4fTzEeXVTa9387zz5bjntqHqppRJAIRKY47v6fw+l+dIrpj6snnpnowAAAAAAAAAAVMKdHtM9PD5drmd+v6fjl8XsfJXG+tRlM4iYyxY+WWHjlq3MOgRE+3NctNh0nPadQyA4+cKPdV+fTWY9FTMOt4fT3vNcU+6u5Pv8x456IMonGRDju/qXH6UAc4dGAAAAAAAAAADWhMxoJtzUhqzFpE/F7LyNzvrYJCcoyxnDrK/0uvnp5vtoBBIieoqPedQzA47LloLbxIFxzW3bcHqck+aPHLTx/d5mp6KwQSRx3n1Hj9IAOcOjAAAAAAAAAAABUFuAQfF7HyNzvrSYYSyI6Ljvuo4/RJw+dWviPLLTBkziHUVHu93HOlY9blPLZ81Ba+I9cN/Q8t503JeZxkPM9CJUXRUUPTT1u7gicY47z6jx+kAHOHRgAAAAAAAAQSAAqC3AIPi9j5G731uCJSh0HLeddxejwPVNFvquMsfKQjJlEOoqPeeOGfNZR1J4Z81BbeJ9sdmTKIiUjAyJCCfOcfPLXHHd/UeP0oA5w6MAAAAAAAAAAAFQW4BB8XsfI3G+thGUT0HLedZxejyT5HqQjlOzz/OdlCjEy6mo951EZ4omXH5c3P23iQABiZAAgkcd39R4/SgDnDowAAAAAAAAAAAVBbgEHxnt850OfNt6uy857a0090kzPkeoMUVG2vouul0s+bpa71nTswOOy56Kw8qAAMTIAEEkc1t9P5rwAc4dGAAAAAAAAAAACoLcAhHyLjv7zV2oSADEyAIJInG8sPL9NMAchjtrK/06QAGJkACITMeHRWfSemnAHOHRgAAAAAAAAAAiITNSW4BER8i4/QXurtxlkADEyAIEJnG7sPLdNMAcjhurOH0yEEgGJkACCUeHTWfSOmnAHOHRgAAAAAAAAAA5jFjMaMztmkbpCOU0WG/huhMhAGkboBCZRBudVXZIrywKmMtfmtJRCZQBpG4SAmCUeWzm6Ldx6RuEm2dCAAAAAAAABBICvhMxvpwK+I1S8lJAAIhXniWEvcAARNEiwPCFpMzMQACuhExrpugACU6xoo8om6mMkgAAAAAAAAIJAADxhzyOcPpEskgAREctDTTcZRfJAAiHBItInGY6yZAAHOYsMseYjL6ZMSkADUORiPHHPss9W6zAAAAAAAAAQSAACEQSmQAAQxJRMyAABCCRIAAIgmETMgABAEJkAAAAAAAAAP/xAAvEAAABQEHAwUAAgIDAAAAAAAAAQIDBAUGEBETFCA1EjRBFSExM0AiMBYyJCVQ/9oACAEBAAEFAr5MhEVlFVW9Bp83WN4kf4sfx4/rV8I1cGjUxlBQ2qLT4dS9Pij0+KPT4o9PiilNpcYyGhkN45DQyGhkNDIaBMN4ZDQyGhkNDIbGQ0MhoWfiMPUb0+KPT4o9Pii0MVlmJkNjIaGQ2MhoZDQyGgbDYyGhkNDIaGQ0MhsZDQaZbOr+nxR6fFHp8UenxRR0kh/9DnK7KP2487C+N1m+CvtN2W49vkM81spPdfoc5XZR+3HnYXxus3wV9puy3Ht8hnmtlJ7r9DnK7KP2487C+N1m+CvtN2W49vkM81spPdfoc5XZR+3HnYRe1532b4K+03ZbjIYbPIZ5rZSe6/Q5yuykrwYzRm++aM0ZozQTvtmjNGaDdGaM0Wa4K+0/tBzBmjNGaM0ZoN0ZozRmjNGb75ojq6q3spPdfoc5XZS/qHnYXxuszwN9qeP3Ht8iJzgenSolX/yEkSxSe6/NOnogpiS0y0L5URqxGmTkvoWoUv6h52F8brM8Dfanj9x7fIi84HaPLkuIsi7qyFJ7r81bT/CiR1qaj09qDVgTKma1RWHCrIpCSNhKyINLiKMoUdQ0DA0DA0DARBYMtAwNAwHI8Ron5MYgp7EYCzPA32p4/pCXcA3KbIMaKQNDHGhYCoLBDQMDQMDQMBUSMgnXY5G4ZLDCSKtbKT3X5sLnOVGA6bqP248xZRx1JUSiuR8CZUExyddU8q+zPA32p4/ZGqbjIZfQ+Sr3niZRIkqkKuZ5rZSe6/Q5yuyjn/xz9h5FPldB3I/1nzijpM8TB32Z4Gpa0xCrrmjptSaqka1PHjHY06plcaoIkXYibIz3B5M8Ayf/AHWyk91+hzldlL+oEsyMldV0KRntiTLKKytRrUCChhdZnga/GqEtmVSahKi2co66LDtTx4MsRhdhcYh1NSTnSSS0FK6R1niZmYi83spPdXVCa1Todn7U6ulNVGK9F9fp7kCl2khzqI3VoTsWXXmVR5dYg05UipqbrfqUXSSq3T4T8i0kViv+swNY7VoTT9JqJzC3ucrc9JWiril/UPJex/JRXsh2VJKM0txTygXuMNlmeBvtTx+zC4wZ9JJlLSpMlK7vIic5spPdXVhJLpSZkaFDhm07So0qkVSREkwCp1ZVHlU2oxijWlVLptNrrBoXWm6vFKwtbeYp9SKS169EJC6JQ47a7XUzE7VA/itx5dKrFnHYsusXucqJcRE1mRZ6MmtwbRQKeIlUbjIZrDbztyVYG44TSUyjkgvjZ8XWZ4G+1PHjEH7bFCS5emQtIRLUo0KUoGqQiq6muDU1wamuDU1wWfU8tdxliRtpMuggSCSWWnDoLCqU4qix0EY6ffLSDbIwaCMZacenA6ZTk09sK+JT1XertNqU2W/e5ytym0mcRlqRFqMdqM9T+9844BaybSt5TpoV0KQZGi4gfvfZngb7U8fuWrpJR9SlXMxeoJSSbovObKT3Vzq8tv1Yx6qY9VMMuZrf9lqSactJVTZgzIq1uRpUxqE3EmNTWnOVuV8ZDhNYGGYios0w5JSkLWbhj5EVf8d1meBvtTx+6Uv+R/AjNdRjyIvObKT3V0n6L4fbT57VNjQZiZ8P+lXxaByUxTbONrMELQfxeorqpUdylOepekOj0h0KpDuHqB6RctxbPqLk591lwjvIIM0mn+ZYDpBkDIYCzPA32p4/AdIwGAwCz6En7hQabzFknpLAdPvgInObKT3V0n6L4fbS09TFnm1M0L+q0rLjFbsoy/Jqowuc5W/AUv6h5kR+rYR+0Vfvcd9meBvtTx+2SvFZ3RmulN3kROc2Unurn0mpnQvjQvjQviMk0Mf2WvnU+FIsuVZNd7nK7KX9Q84iWzekxjgG15idlmeBvtTx+x5zoQFGI7eY5fiPkROc2UnurpR4Rs5wZzgznBCPGN/ZVmKlJOi2TjUWZe5yuyl/Vf8AIfayVgvgvcmXctRe4MyHzdZngb7U8eMTuM+knXMxRgww3lIv8iJzmyk91dL7a+D2tSZffFnX35FP/vc5XZS/qHm6S1mIBArmHunZZngb7U8fcZ4E67mXH8xm+pezyInObKT3V0vtr4Xa1qlvVQobT7TX97nK7KX9W2S1luXF8BDikBClqBIMUCqymaP6zMHrMweszBXajJksGgyC1OEFmo7j9rkIy03+Cuic5spPdXOIzEejMj0ZkejMhpsmm/wucrspf1DzcZkHm8xBF0kCEeJ1ESEpvs3wV9puyuMiUT0VBk60ps4jeKj2+RF5wzwCKxIKdSbRxKo0KT3X5n5LUVpp5t9tzlQcplISslpFL+oeSvxElGBkWJsMZZJV0gj6ius3wV9puyuNWAM8Q2yb63aObKVex7PIi82YSxNk1SnwZy4ZCk91+actlB0TqyGGpDVWP40TUEU5xcR8UvHKwMe49xgY6TwwMKazUNRDYVh7e49yBOKHWoWa4G+1HYdah/IxgY9xTIhto6VCbTyfDzDjC8DGBj3wIe4ic5spPdfmfjtym2WG4zbnKg4rShFpcSE4KX9Q83GeN1LhZaavH99tmeBvtTx98CEchRfAWHmEvplU9bB3eRE5zZSe6/Q5yuyl/UMNlOg4m3/q62TrbrZtOAi9sLrM8DOnriuItTDwZebkNWp48NtLdOLSQlJJK5d8mlpdDtPfaBlgYic5spPdfoc5XZS/qI8B5up8DMBEEfAqUTObB32Z4GuzZLJqYTGqFn4y48W1PHgnnCGe4M9wZ7oz3Qb7g1Dgz3RnujPcBurO6Jzmyk91+hzldlL+q+n0/MGBj3CMcPcYGKhANJnfZngb7U8fuPb5ETnNlJ7r9DnK7KURmyUZZhEAjNiPEYGoaGpaGpaCJLWGpaGpaGoZEiNEdDsM0GaDSdmeBvtR2HSY6THSY6THSY6TBpMdJjpMdJjpMdJ49JiKWFb2Unuv0Ocrso/bjzsL4vO+zfBX2m7Lce3yGea2Unuv0Ocrso/bjzsL43Wb4K+03Y7j2+QzzWyk91+asFmvUnqbBnWzlamuCXVKxDZ1NcGprgh0msxG9FWRoqyNFWRoqyNFWRoqyIiKtLZ0VZGirI0VZGirI0VaGirQpyK3ToOprgRVqu5P1NcFSZrdRZ0VaGirI0VaGirI0VZGirIkN1aOeirI0VZGirI0VZGirI0VaCYFaRM1NcEyqViBEKVWzLU1wUiPJZ/PMhNzUQ4bcJoLWSExpDFTiuViOzI3tTmXpUiWzTSZcJ5vdJrMeI6841FREqLU090ya3CKO+zUWWqo09J3SJCIrMeaxUil1ePBdI8S/U60h5FHcSxTJCyTHL43RWks1yqKgvvUTN9O2mKpUYrr9YNL1OhPonVbdWKk1TSpa4zUZlLLcrdKf0zFOkNlUJklEORCbUzE/wDYw/d//8QAOBEAAAQCBgkDAwMFAQEAAAAAAAECAwQREBITIDEyBRQhMDNBUVJhFlOhIjRQQEJxFSNDYIFiwf/aAAgBAwEBPwH/AEfrfhmkKbmZCwb6Cwb6Cwb6Cwb6Cwb6Cwb6Cwb6Cwb6Cwb6Cwb6Cwb6Cwb6A2G5YA81xoprIjFg10Fg30Fg30Fg30Fg30Fg30Fg30Fg30Fg30Fg30Fg30Fg30Fg30EYhKSKr+DhOEW9PAKzXGeIW+j8pfg4ThFvTwCs1xnOW9PAR+UvwcJwi3p4BWa4znLengI/KX4OD4Rb08ArNcZ4hb6Oyl+Dc0yqDVYkiY9SL9v5HqRft/I9SL9v5HqRft/I9SL9v5HqNft/I9SL9v5HqRft/I9SL9v5HqRft/I9Rr9v5HqRft/I9RrPZZ/InW23FO2JWnQeo1+38j1Gv2/keo1+38j1Iv2/kepF+38j1Iv2/keo1+38j1Iv2/kepF+38j1Iv2/kepF+38j1Iv2/keo1+38hvSZ6Q2GmUvwekPuD3pBGUrkVwVb7RWdVB4TB7P1Pm4ew5A6NIfcHvSCcpXIrgq32is6qDwkD/U8hzpxUkKoZg4d5FZxBGYVomFPBIc0U2jBBGNVZwqENVY7RqrHaNVY7RqrHYNVY7RqrHaFsQ7ZTUkg5EQxcNsG/W/YVCcCuRXBVQl2r+0jDcS1/kbIM6o/lSQ1VjtGqsdg1VjsGqsdg1VjtGqsdoKDZP9gb0Q0e1SSIJ0VCp/YRiJhWWCm0mX4OE4RUxDBOF9OIMjTsO7ExiWNhYh11bxzWdxOUrkVwVXOcwxHqb4mAbdS6U03EINw6qQywlrbzoPAR+UvwcPFMNoqLXIwlZLKaaJiLYn9abkXFEyVUsQZzOdwgnKVHMeBFcFV5t1TJ1kiHjEPY40wrNQp86Jhx9povrVIRUQ08RWap/g9I/cGEOrbOaTMQunIhrY79QhI1qMTWaMGUykIhqyVRFRJQ6fIWs1qmdBA6CCcpUcpA81YRPBVTK5zmIXSBl9LwhW7RRK5DwI3SDMEX1bTERpuKdOSDqhTi3Dm4cxorYpReNwRTuFRynRyGNB7BhRzlvdI/cHTDxLkK4TiDEHFoi266REN2qBEPlDprGHXVvKrrvEE5SuRXBVuCKZyEFGuwexO0hEabaQx9GboHXVvqrrOnRWdW4TmCcB3EE5iISOr/ANBZp+DB5CB5gUpF/IwrAtshiST8jqFHtSXj/wChWYhKg8Ae4xETAqfcrkYe0cpps1mdOi404R4p5TD0U0y3aqMRzqn3LXqCumUgQRlK5FcFVJ7LrKOYUokJrGHnTdcrmEvLQExCj5BKzViQ0VnV+m80n03Jc6IvgLpWokkIaPVElUWeAUUyB7NlJA6CCcpXIrgqvkUzBFIhHv8A+JIlMNMT2mCSScKNFZ1bhJVjkNQ8jUPI1D/0FpqKq708BKYI5luYspw6gZkHH0pC1GvENrqLJQQonSrEHUyvEEZSuRXBVQd1pH7g+7ZIrA1TOZhhqe0xOVOis6tw3nKiVD3EOhKqxbw8aSvTIRu2HURBaHCGFHgQD0v7ZhRTCkyOgtolIwcuQIJylciuCq8kpmMCkI12uqoQbTWUCKRUSo0VnVuG85XHuKYTiGykUt30MSyl03OkFGT5kJmfMfyHmCP6k0pOqcwy7aIrEHk87pBGUrkVwVXm0yIRLlkkHMzmGW6qZ3dFZ1bhByURmNaZ6jWmeo1pnqHTJSzMt7yH8bnSH3B0nKQfZ/cVGIgXqp1FAyPKFpqndRlK5FcFV1tNYwWwRb1q4GW66pj+KOVOis6tw9sbMWzncYtne4xbOdxiGMzaIz32O50h9wdwymUg63ZHIeAWw5iHetUVuYWmtRNJAznQnKVyK4KhOQrA9oSUzkEoqEIt6yb2YjH/AKGW6hSEruis6tw/wlfxSeAhuEn9PpD7g7r7dYp0wb1m5I8KFtz2kMKCCcpXIrgqpJJmG26u0GfURL1s4GG5nM6CO7orOrcP8JX8UngIbhJ/T6Q+4OktlBFMPN1VUGIN60TVPEqDbr8gWiope1KAWg4vEyBFVKR3HGzeSbaeYVoOMTyH9KiU4oBsm1mIFtMR78k1EiW0NlUTdLbRorOrcKTXSaTH9Ma6mP6Y11Mf0xrqYQgm01S/T6Q+4O6atmwOIrkJVcaGnFIXWIaMgG4pBPrMNsNtZE0HgFZrjPEKlTaFl9RDS0NDMtWmBh0lGr6xDIrfUdMruis6qMMfwOkPuDvxKJKrECKZyIMskjaYgNIOQKjNOHQQkezFF9J7elB4BWa41nIcqI3SjUIWw5mIuLci3K7gbZt1VSIPaLqbWgZGWajC7orOqnr+p5DnSWcFknRpD7g7tXZOhTVqUiDcPY7FZhKhJmg5kGdLxTWwzmPUESeyqUgRz23FuGyVonkPUMSf7SD2lIqIxWDOtmHgaPh7JNdXMEImCS/t5h1lbRyXcLZRorOr8HpD7g7pqmP4EDCWZWi8RpJn/Km6QRlK5FcFX8XIKEU6qurAFS42h4pLETAraOsnLd0VnV+D0h9wdErkBBnO0cKhxBOJNJh5s2nDQdBEJAgnArkTwVUIZccykIfRpF9TgJJEUiuyD8Ah3ajYHIB9HIGlRcqNFZ1fg9IfcHdgYI1/3HLkdD2qJpxHOVxOUhgOQ5zIRPBVQTqywULZzuMWzncYtnO4xbOdxi2c7jFs53GLZzuMWzvcYtnO4wbijxOjRWdX4PSH3B0+BBQVb+46V6NgznXbB7MaU5SuRPBVvtFZ1fg4yEfdeNaEzIJ0ZFq/YEaGePMGdHEzgnaLJfQWS+gsl9BZL6CyX0FkvoLJfQO6MS7+2RhzRMQnKUxqEUWKAnArj6TW0pJDUYnsMajE9hjUYnsMajE9hjUYnsMajE9hjUYnsMajE9hjUYnsMajE9hjUYnsMajE9hjUYnsMaPh3WVKNxMvwcJwi3plsmFZrjWcqNo27jaNoOYjsC/BwnCLengFZrjPELengI/KX6zkOd5qKsk1ZDX/A17wNe8DX/AANf8DX/AANe8DX/AANf8DX/AANe8DX/AANe6kDxuJVUUShrxdBr3ga94Gv+Br/ga/4GveBr3ga/4Gv+Br3ga94GveBERFtKX+x8xzMFfViW5PDdeQe4MFiRhOwv9X//xAAuEQABAgMHBAICAgMBAAAAAAABAAIDETEQEhMgITJRBBQwQUBQImFCcVJggbH/2gAIAQIBAT8B/wBH9AI5nuIKvOV5yvOV5yvOV5yvOV5yvOV5yvOV5yvOQyOor5V5yvOV5yvOV5yvOV5yvOV5yvOV5yvOUIk1+jibvMKZHU80Kp+jibvMKZHU80Kp+jibvMKZHU80Kp+jibvMKZHU80L6MdMIn5TXZDldkOV2Q5XZDldkOV2Q5XZDldkOV2Q5XZDldkOV2Q5XZDnLdvfiuyA9rshyuyHK7IcrshyuyHK7IcrsRyuyHK7IcrshyuyHK7IcowBBp9HB2eY1yM3ebqKCxuqHyfcsg1E7YOzzGuRm7zdRQWDlNMkPke5r1bQFCtj4j2mQK7l49pvUOPtYjuViO5WI7lYjuViO5WI7lYjuUHPNCgx5qVc/a9I1yM3WXZ+06G705OxG+1iP5WI7lYjuViO5WI7lYjuViOHtHqHD2j1EQ+0x7nbj9HE3WtfIqc8rIZcmtDaZDXIzdlfCBoi0tyEyCc8uthVP0b4b3GYCLSK2w3ejkhw76GmmU1snoF+0zdmc0O0KfDLbXumbQxxoFDa5tR8EfCg7EWtNQonSNdtUSE6EdV/SY6YsYy+UBIZjWz3NepJm7PWqiQfYUQy0X7UKC55TelY2qDWtoF1OvgdoFREyqijojovdk6/pUU032hqv6VR5YOy2IxsQSKiQ8NyYZFMaXlNaGjOa5GbvBRRYYiqH0hLpJrQ2lvUUHgibU6pQ/jP9/wDifO6Ud80AdL3K/kShtknT/KfCqWppkFLV7QhrJN0b/wBTdp/u1vC58LIoYJIRg4yXuyPBEVqYxzjIqCLrZeA1yM3eB5QE01sgrquqUl1FB8P3b6laK+IJm60CafCDdQh4DXIzd4DqoTfdheiZ2dRQeA6CaxVirFQM/K2pQRr4Ye8WBpQ0ThMIiSac5rkZuzuKYJlBOMsnUUHgNMjaKckRLxHJ7zGs0J1UMfnNAjJFb7QzmuRm7MaKahNu1TtEdcnUUHgNMjdqePxTzM+Ol4L/AC8MEC4pCxrpKthonNkU05jXIzdmcVDEzY85eooPAaLDcrjlhuQpLy+168MHZkabYjfaCaZjKa5GbsrtFVQ2yE08yVcvUUHgbVXRwro4V1vCfu8sp18UHZlaZ2SmntulNMjZK01yM3WSsmiZqG2ZVE4zzdRQeBtcj9yn8aDsytMrYrb2tgKnaa5GbshKGqY26nnP1FB4G1yP3L38aDszNM7YjZa2XrtV3DBVd1DplBumZXdQyu4ar4cpKG2wnP1FB4Bosdyx3LHciZmfx4OzL7TTJVscLwXURbhkEXuNbRTI6loJC6d73nVNonles/UUFk/nT92wdmdhVE501FgiKFEguhWBesjqWwundEUOGIdE51zVNjzqq5+ooLOZIVB+T7Q1aDa7Z/1HdZB2ZZ2B13VF962QNU7pmOquzh8qmQC9ouyZ7KbAY2lsV89LIcQtTXXs3UUH0cHZnixJmQUB38cxrkZuyRIktBkDi2iZFDq5eooPo4OzLVRYnoWAyM00zbPKa5GbhYXtCfHno1VzNikVQitKmDSzqKD6ODsyxYvoZIT5HXKaqqG4qgkoe4WXQVdbwrreFcbwrjeFcbwrjeFcbwrjeFdbwpCzqKD6ODstoosWWjc0KL6OQ1yM3ebqKD6OFEa1siUY8PlHqW+k6NeV4K8FeCvBXgrwV4JseXtN6hhqsaHyjXI3QzWMzlYzOVjM5WMzlYzOVjM5WMzlYzOVjM5WMzlYzOVjM5WMzlRntdT6OJus1Wq1Wq1Wq1Wq1WtoyOp5oVT9HE3eYUyOp5oVT8z+S9ZnMmZrCWEsJYSwlhLCWEsJYSwlhLCykTCwuVhLCWEsJYSwlhLCWEsJYSwkxhb9ROz9fDGv0xoh68A92HOF7CGf3Y3wymJI1/1f/8QATRAAAQIDAgYMCwYEBgIDAAAAAQIDAAQREiAFEBMhMXQiMjM0QVFhc5GUstMUIzBAcYGDkrGzwzVCYnKCoQYVUlOTo8HR0vBg4UNjov/aAAgBAQAGPwLGXF1oOIVJiXfallrcf0N12v5jwQ5abyTjayhaa1of/ApdpqXWt/amlDY5dOeC2WXEVJtZelV8ZMNJl5CWYStlZUG2UprQop8T0xvZr3BG9mfcEb2Z9wRvZr3BDxUkKImphOccAeWBG5o6I3NHRG5o6I3NHRG5o6I3NHRG5o6I3NHRG5o6I3NHRG5o6I3NHRG5o92JRbjLa1lGdSk1JjezXuCN7M+4I3sz7ghktsoQcu2KpTTNajc0dEbmjojc0dEbmjojc0dEbmjogeLR0RuaPdjc0dEbmjojc0dEbmjojc0dESKMmmyq3VNMx2Mb2a9wRvZn3BG9mfcEb2Z9wRhNKRRKZmgA0DxaPOZfmXfii6/rcz89flpP8lxjWWu1fF/B/wCvs3cK619NvzmX5l34ouv63M/PX5aT/JcY1lrtXxfwf+vs3cK619NvzmX5l34ouv63M/PX5aT/ACXGNZa7V8X8H/r7N3CutfTb85l+Zd+KLr+tzPz1+WkvyXGdZa7V8X8H/r7N3CutfTb85l+Zd+KLsxrcz89caI0RojRGiNEaI0RojRGiNEaIkvyXGdYa7UaI0RojRGiNEDNGiNEaI0RojREh+vs3cK619NvzmX5l34ouzGuTPz1+WkubuNaw12r4vyHtOzilWnJlpRmHCPB7OhFDQg8eaGWnJOZZbedyLb7gAClZ+Ctrg4sWFda+m35ugqStxS1WUIbFSowSkKSUmypCtKTxRL8y78UYpiUZVlHGEgrI0Ctc37QUpWkkaQDimNcmfnr8tJc3ca1hrtXxfkPadnEht+bS5KomA+Nh4zMbQTWvH+0Sr7jzC1y7+Wy2SOUXnOYqJ5eDFhXWvpt+bsOeNSttyqVtN27ObhHCInXHcoRMO2hbFlVLIGjg0Qzky6bTLlco8tfCj+onFPLQybHgiLNkUCjaXmr/AN0xgpxEtkWkocQvJya2rGx2qlKzq0acUxrkz89cbmg+kRRbIRGZpJjckxuSY3JMbkmNyTG5Jiq0ITFGpcHlMbRA9CcUlzdxrWGu1i2qT+mNnLoV6IzISFcRjckxuSYHik6Y3JMbkmNyTGdtAghthJ5TG0Sn0CMH/r7N3CutfTb85l+Zd+KLr+tzPz14+NHFAI0XaJ2TnFxRaWam5Jc3ca1hrtXQFbNP7xVKgYT6cdpUZ9HFjwf+vs3cK619NvzmX5l34ouv63M/PXcyatB0XLKc7hipz3ZLm4aRJZJBUdm68m0ED8tRXpir7KpmYyy2UiVTmcsnbCpzD0mMs0FJoooUhwUUlQNCDDWsNdq8FJOeEg7FddGOg2g0XMH/AK+zdwrrX02/OZfmXfii7Ma3M/PXi48efbDTi41nQIKjnJvSXNw03I5KwVeODjqmipPEFBJpEojIyzCWVEKlGZlxLak8GzCQc3FSkOMLLZtPLcGSFBRRrohrWGu1fHpgIdzj+qKJOdWM4pD2nZu4V1r6beN2ZfWG2mxUlRpH8wwnN4Ol2VkWMk9tfwrJ+9HhLcw0uWpXKpWCnph+bZnJd5hkVUtDoKR64ZwiuYZZaUkFZLgsoP8ASTHhSJplctWmVCxZrWmn0wjwB1maedeyDdlVpNrhrTiFTCETc4xLrXtQ64E1iTk0hJaeZccKuHY2adqEzXhDXgyqUdtiya6M8JYmJ2XYeVobcdCSYYwWp1pLjrZXncFa1FE05f8ASPBPDGPCv7GUFvojILm2UvlWTyZWLVqlaU488TDboCZmWcyboTo4wR6QQfIS/Mu/FGOUYG5uNOqV6iinxOKZ1yZ+eu5XggHg4YtaTwCLSjnvyXN3GtYa7V8RWK6RxRmOy4jckPadm7hXWvpt45sKAUMkrMfRH8PIcEnJkyVtM7ON20A0TsQKjZH/AEjCS1JL8gjDCHX0hkpBbspz2OKtDE9/LmkPL8Ho5MMp8XyJ5TH8LzD5bXg6XSUPmlUtv2BZK+Lh0x/EkzIU/lzi5UJU2KIW5lBbI/8Aznj+HsmgNywy6aJFBasCn7Axh3+dWEqeslkvprlGbA2KfXazRgMtMLlm/AXrLLm2QPF0BiTwaHKzzK2W3WQNk2Q6K2uIRhQtYSl5d12inpHCctbQ9sQNgdJBA0Z4wJMTLLck7MSBCWljauVRsfTCMHvz0kxhAObJkSClTYetbYHKZzX71KR/Ea1IClpWxRRGjxQjDRG55NhP6qKr+xTjam5n+J0ybK0LbbC2U2tINKcPp/3hT/8APF4VmgxYsWLCQmoz0HquS/Mu/FGItLU4lJ4WnFNq6UkGJJGVnqFl47/frpRw24Xkm51VulcvMrd7SjSHQUqNt5133nFK/wBYSgIUK3KmNlwaPR5CS5u41rDXaxaL1kY9t0xtK+iM6bMSBlWm3nar2LrhbG14wD8I+zpDr6+5j7OkOvr7mPs6Q6+vuY+zpDr6+5jCRmG0NPeFbJLa7aR4tHDQfC5SgjRFAKRSgpFKCnFCU28k62sONuD7qhArQ4tqM/JGcAxnFYrQV44JpnhzZZR11ZddcpS0o/8AQPVjksIp/h5+rLa2lIXMM6FUzjZac37wUTOCXpBFmuUcdbVU8WxNyX5l34ox27ItgUCuEQhCrCF5YC0TQ0oYSGSooUkK2dKjohr046mM/qgHyElzdxrWGu1frBOOq9HFFAKYpD2nZu4V1r6beNStNBWNz/eNz/eNz/eEqpSvlcEtzk09JSSm3KrbeU0la81Ekg+kxhRzB2E5pTUtJ5ZDonFOJbfrsUZzQ2uIw0pwWVlIJHLFt1VlNaaKkniA4YyjSqprTOCCDygxL8y78UYzAdya8mfv0zRohi0pJNrOAc4PLizbIxU47N+S5u41rDXav2eLHbIzXJD2nZu4V1r6beNz8puN+iFPvKsoHrJ5AOEwxMoBCHkBwBWmhFfJt+GzWCW2SLL3hjJU2tXILX+8KZLmCXJVsA5CRYLdgmikmlo8GfFIOKeMuyh023h9zYnPn0RM+OLzeUKWpjNVaaDPxHPXohgfzKb3JzPsONH4Y+1J3/L/AOEfak7/AJf/AAj7Unf8v/hGQsilixX9VqA2o7EckNJ2qrdq1XhpGyqrlu1EA1x6YzExpiS5u41rDXaxaY4Ti0wTWOXEBFBGmNJjTEh7Ts3cK619NvG5+U3G/RDmapsmkYObcSULTLthSVChBsjycjhBcu5NSjbLrRDSLZaWqlFWfVT1w1OBh6Wl2sHtyq8sgoyjnoPF/rcl+Zd+KLmiJjW5n568dpOniu2b0lzdxrWGu1es8WOv3jdkPadm7hXWvpt41gaSI2n7xtP3jafvCAdNPKy/hLc34UsFLTkq5kulRIT0wVzkw0/IFHi6rC3q8qkgJPDcl+Zd+KLszrkz89dy2PXdrdkubuNaw12rvLj5BekPadm7hXWvpt43fymN0V0xuiumNurphuufN5UNyT0vLNkbNx5ouH1CoEPTaFrXMOiizRKE+6kAeu5L8y78UXZjXJn567pFzkxaOnHJc3ca1hrtXKmK46cN6Q9p2buFda+m3jd/KbjXohsNzRlGhUurSBapyVi2+su+MWG3SKFaLWxV0eYS/Mu/FF2Y1yZ+eu7yi7ZOi5Jc3ca1hrtY6kxyY7XAL8h7Ts3cK619NvG7+U3GvRDKW5hLTaFWltratpc4gc4zRSYdQ8v+pDdgdFT5hL8y78UXZjXJn5671eA3c3RGdsiOKJVCcDTryQmgcQtmiulysfYU/wC/L97H2FP/AOJL97H2FP8A+JL97DDa8FTcqkzDfjHVMkDZfhWTGisZmjGyrcSLpxSHtOzdwrrX028aknQRSNsuNsuNsuEoGgeZS/Mu/FF2Y1yZ+eu7QaIpw8EZ+jHaX0RsQBjk/wAlxjWWu1joc8ZtieSM8WuKBfkPadnE2zMSWQbfKgyvK2lZhXZJpm6TDFl1tMw4muRt1IPFiwrrX02/Ny484lpsaVLNBAcbWlxCtCkmoMS/Mu/FGJyrqBkxVefa+mAUmoOgjFMa5M/PXftceKp22KuOT/JcZ1lrtXQgCtY8VnHFHrvyHtOzil3VSBln21HLzQWmw6ihzDPXi0iMGSC8HKlfBnEOrmCtFnMa5qGtTo9ZxYV1r6bfm7QcsBalUaK01FumaJxq0Mqh9QLiRsSo56gevRyQzl5gP+JcpRuzTOjF/ETbQOdhKiVGpUbKs5MYFDM65OJmkEOhSgRZCK2xxZwB+rFMa5M/PXGmKVjTGmK1jTFnj0Rs9vxcUaY0xpj/ANYpL8lxnWGu1i20aY0xlCdkr4Rtv2i0DRzjiyvMY0xpjTBjTEh7Ts3cK619NvzctvNpdbOlKxUGA20hLbY0JQKARL8y78UYnKtoOUFF5tsOWHHJeVZYcc26m2wkq9OKY1yZ+eu/lF7Y6OSA6PQb0lzdxrWGu1ctK3MfvjT6YsrFRBoLSOO7Ie07N3CutfTb85l+Zd+KLsxrkz89d7KrGbgGIpOgwpB0jFpxyXNw001LOTLjlTRFAABxkwwp5XgqHELUVvqCQ2UqCSCfSYS40tLjas4Uk1BhrWGu1i2KSqAp0/pEUGYY0+nHVGwVG1tD8MZ82KQ9p2buFda+m35zL8y78UXZjXJn567occGx4Bx3LaRsxdkubhlmXad8bXKTDbdvJDkHH/3kjBL7WD5h2WYZeTUoqtskp2Rrnqc/TDpUz4Ml15bqGf6Af+19cNaw12sWZaumN0X70bovpjdF9MbovpgeMX0xui/ejdF9MbovpjdFdMZ1qPrxSHtOzdwrrX02/OZfmXfii7Ma5M/PXcyjgzcAvF1vRwi5Jc3ca1hrtXxfkPadm7hXWvpt+cy/Mu/FF2Y1uZ+euPu+8IFp9tPoNYrbSo8ZMbonpjdE9MbonpjdE9MbonpjdE9MbojpjMtKD+ExsXEODkVH+0SXN3GdYa7UaI0RojRGiNEDNGiNEaI0RojREh+vs3cK619NvzmX5l34ouv63M/PX5aT/JcY1lrtXxfwf+vs3cK619NvzmX5l34ouv63M/PX5aT/ACXGdZa7V8X8H/r7N3CutfTb83kmCTknXqLANKgJJp+0T7CKqQy9ZbClfgSqlfSYbe8AkNghSLPhq+Ej/wCr8MfZ0h19fcxlHMHSVm0lOxnlcJA/tcsfZ8h15fcx9nSHXl9zC0+DyKrTrju+l/fWVU3Pljesj1tfdRvWR62vuo3rI9bX3Ub1ketr7qN6yPW191G9ZHra+6jKNyknZqRsptXAaf2+SN6SPW191G9ZHra+6jesj1tfdRvWR62vuo3rI9bX3Ub0keuL7qGZYSUi5kxS14asV/yo+zpDr6+5h6UGDpLKtNodJM8qlFFQH/xfgP7R9nSHX19zCGzJyLdlxLlfDFnQa/2o3rI9bX3Ub1ketr7qN6yPW191G9ZHra+6jesj1tfdRvWR62vuoZCpST8YuwKTStP+HG9JHri+6jesj1tfdRvWR62vuo3rI9bX3Ub1ketr7qN6yPW191DEx4LInJV2Phi89RT+1H2dIdfX3MPzLmDZItsoLirM8qtAK/2o+zpDr6+5j7OkOvr7mJpyaQ024+9lLDKysDYpGkgcXF5uEuWhQ2kqQaFJ5IKG65zaJUaknEVEgAZ6mEuoo8yrQaZjQ/8AqCyoqqFBBVYNlJOgE6OLp8g7LoWFOtAFYHBWG02VbMmyhpFTxnMISsBSa8ChQ31ocK9hnWpKCUo9J4IcmV2UgJ2S6cAhaUW0rRpQ4gpPQb6LdolZolKElSj6hCXUbNIV95OdKh8DBZQl1RCrJXkzZr6b63XFWUJFSYdbsnMNm06gpNDyHgjJuFWxTaUUoJCBxni88srSFp4lCsJKzZGVcGfnDGEJA18KefJbTTbBVKH0D/TyE0EICU5BvQPxLiVffcdDVldlxtZS3waSPRDeVt1qqzlNtZtGzXlpS+9IKebl0EePWo0Jr90erhh1DWzU3k3ChGc2QoH4Aw9MMm2yGUotjQVVJvtFVjLLNlu3mA5SeKBYmUPF1w1cH3lnOYbTKKmfDfCSXW3FHMkq2VRopxeq+tywtyyK2UCpicmEvmYligFT6/unPsQeKMKJdqVTKAWRTb7GzZHr+MMoVtkoAP8A4v8A/8QAKhAAAgECBAUEAwEBAAAAAAAAAREAITEQQVFhIHGR8PEwgaGxQMHRUOH/2gAIAQEAAT8hiw21kYjIAC5hnIKkF1U0U0vSNhCSoBocwQQfeC0L4CoxGIxGIxGIxGIxGIxGIxEjHASBGIxGIxGIxGIxGIxGIxGInCCD6y9C5nCPoWZAq1IAtnnBidC45yRILf8AyB+QmDaFCqoc2s7G/U7C/U7C/U7G/UBbxFyAHIAADYTxWU31Z4rPFZ4rPFZ/Os8Vnis8Vh/52eKzxSAYKIMh5kzsb9TsL9TsL9Q3TngESBimRnjs8Vg/52eKzxWeKzm1pnik8Vnis8Vlc/VnisKApqLQIhjOdjfqdhfqdhfqdhfqACW9gNQGVSev5rs4vTZw2uA4/F/Z4O8acRwXc3Dmw+Z9/wDhDOzi9NnDa4Dj8f8AZ4O8acRwXc3Dmw+Z9/8AhDOzi9ycNrgOPx/2eDvGnju5uHNh8z7/APCGdmAJ6h2Ygn9iHZiHZiHZiHZgoQ7MQ7MQ7MRf9iHZiHZnxP3wd80xDsxDsxDsxDsxDsxDswXVrE7MQ7MQ7MQ7MQb+xDswVzvv/wAIZ2YurDSxwgCk4wAAnyv3wG13LjA4ACtucIAKmAWUq/fg/wDAGdnHrk4bXAbY/FcHZtPHdzcObgIiKmqHtxNJu7KGcYeQBpRlAWRKdYC/yBrEElEaGVgSzSkLdaFQty6i1Kw52bS8Rb5iCrUO9JawMBI4OuT0Y4/HcHZtPHfzcIu4KWpNnOuqSCBgVBG5M0GKl3EqmhUCwCln5AwQCRu9ogTdICRStRCUEZzmrdhvIXAUKm0ZNuivlDaUXWgQSUhqqIATBsG4EE7uwSNSJlDkRFuc6NkRzTEBMEcxPDTw08NAF5mW88NPDRSBvGmw9DpEyuXIpM+O4OzaYnZjNR9wnWuplpprRgJ/KeOlA1dE8NPDTw0OCIGZm1QSkoYHkpgq/fgvxhhwFoAsXaxIli9NkXDUvoh2GQYONv3+4TKSu4cJSTQ2GPx3B2bTwmNG1sE9spyl+ITGoPmOxoTQYL4fM+/8gYek7MCAsTQJIhTJgj0LYYMP3fcIiIUGm8IYhI3JwswE+OhV4VoNGghEoWZxfnRzAGhKB3KAmjWB0cam1BE7NpgDgAlZ8C0wfMoP9sPKOkKRqTJDXfAXQCMgQVIg1+/8AYmPjHouwXDh902gk6N4Pm0llDVWT/WD7Qgj3oXlpkxRC7+0qyUCWCw+OmhFmkvqxTKaoCGwGCWFUAerGecreJwGgArJpV5zs2mKIIhjeKqU5RRgqXwpMiA16Zhzg2MR0I0wQ30m2AgQiySTvO+3egMd5MdDkzqae8esVaTh0EIxQSr6lMIuckcKguhWIFCNzePMM0IYcCyQAnnAAqTYDmYcwqVgveWUQXos5QMIU+UE1mTKvokKFpFoPfUswCWVJAHOIYh7VQJca2KCAhvAJMAnfyzuBomQDEQBWdAFaEQnZoogigyyugpkOmLj43Z+QklUnGJKt4qIzAYKAXZwr2unJGQWZ14dnEviLeUHAkIii3nx3B2bTFFFFOaUJowINeaCKRoKyuxLng+0XtQ1JLvAKot/RIM3SFLF0f1WVOEUaKsm2Zxvvro003lOgcduF493GwamxQzlkNQfOoCl2Ei0CQC8E7zoRS5EUhyYA7HWFTTakIN3S1ZhQH1qbgagLMxsSP6ig2EzdhXh/wBNgBEIIBLtIaIK4DCAaWVA5TkgWwvGcyG0AutdHS6WHSN2xLWQk930MK4OWwEqEG1QN8CUVAS/ikm7uJ2o1bowXQQ9jBWOekmos1BewvR2E5aESnbWMk6aCJCrEKgEj2C+0IhjTMYJCLw5UYSnQ+4aqLpDSLUIeJyhECfFcHZtMEZ3c5qffARBBvWORtzgSy5ayO1UJQGwg6oynl4uWdT4ViRIkECSp9Amc0WTGgQAIwFgrQAdFb0vFwBsFFEDlwqGfXlSBKYjzJ7BTDFwRmCRnF0lGZEIkCgxYqEz5rVEZIDMiFwQELEi0JOnVYoAAVyrwL5nGzi0AABVAMCIpqYYOziGNtApyKA4kgBWCwpzPSDidjpFKIFA3D9h0jsCU6OJ1XS8WRaERswbHTAzZKlesPiraaDizSHC5QCIztiW3WGbi7Y/FcHZtPCVrgJ6whCJqYWQwVqDJqlFALL0qBUHqk1mx78pte/KbXvyhitA16KxNodqyNFT4BQ6xSg7jKGpqiWpNtI5JWWx4CIhYCpbCsYkIjSi4ABB2PA7+FCdBUgRuedsoVMkAdoPTVGyQK6st9ISLJQg8j9CPIz9QFGPLHtuLQlYm2PxXB2bTwuXLceA2KvOEmjrNcGgjqs5m9Kg3aNOEdOEQCXkBUmQEtHG0AA1nX0gJovDe2LlwBg6FoXatyBECAASyZiAhGUjEFBEGAjQzrAwrEBkEIFAgarFz0mrcZfX8Ty0PLQBP5DAe+uVX9qQGVACTKAloj2mwKOwpaWMPdFuYtzFuZTRmARqiEApIzmMBGxMSmV5Y6mDenx3B3bTOYxnBUBGhOYzmR+lS0cm6jCdGYVyVmYEBCAMpzp0jWc4wVVfoA3aNOFEYaAMtRFn6hAIINj6RhlJgLYKpoTCohqk4URBYQUIIZGzAgbhwBcLsjogz1DSGLNWcM8bR3PEkWdRgB1lmPxXB2bTwk2oBKMsdecoDw+POAmb0iDCCZIA9pvej+ze9H9iM/R/YMNAhGC9OvgpKB2C1Ua+sZRuIMwtwSUGlYON2ccropEVBXUwCT7PvBa2iqQEQIvFubPA2x+K4OzaeG1GugmcYVk5fNY4LQqKhLHKICXZQEAwWNvRIMYoFEKI5TyOeRzzeEKIlmOD9Og/kD7w+krQ3wWWTXDzAnf0HZx65jAhEQwcpna6h5CEwG0KF6vvEz0gAo3NCdnsI3vPiuDs2nAmeb1hqNIEtgQjlshCQlS5wwSuqYlehxzekQbt2nCow07WUoCAgVqSspYoMYsgQClUte6DUH4bswM+Kt4qKxGe8YkVrCEqWQkbz3irUNjpGwwWNYt4jrPjuDs2mLeLeBUAIckChy1hJOZhu6mUXFd+Z7y5qfeAT3iqrFvNT6AN27Th3L+8caG0NVmQHKwhpRGn9H4js49S2KqCmC2jANUbQWmW0c4KIbZ3RYNyhOXIYgUsETuEJzA4Lliw12TTkv8ASSxexD5Q3NYeFLYhYGnOAElDObGGqGeOUYyV1lRYgU9Igw3oFEp5MfyeTH8nkx/IVEkKBN/xnZx65Mc47tY35hbyqXOhQlneEXS8TeyMCoLsIMPi/vg7xpxSABoRH0fjRD9pFjKttZzl/NFWELN745saIRZ7CAhMVJWASFuI0g8oKAUMtRkQF/kDWt+uL3MG7JhgNiMHZpDgkBBI0kN6KA3g4gzqARwdTZEOYxRkQ4bxfziAJk0Ag7wXxGDmDvKC98fi/vg75pxFvOkMdYxNgUtxXPAIAQQRUDgCv4Zlhmx4BygEeFASAwZsuhJXhHQUIIcrDvqAKocwX5AxTaNdM/rMaQAySLkGgAUXVKpiRA05neZcBkIABIENOuIqTAcFjMgBAUik05oLQCWfZj2BMn0ReCdgTRAtadgQlYyVADrCSwaEhDDU5ReCVmFLuICAGCBaN4dJVyfAaIO4ZuDpCbhGDwIvBKdwKUtgALcVEQPOEHSLzsCdgR0rdFAINTpmLReCCQ0v/pgovyRqciQ/OAwRnUNA2AxdmDKOyNpLUETeI4ZRhswFeDrkxOugsNMEg9LCBtD/AMTgAbQ2x+O4OzaeAZEiZwKDEEv6JDcbLC45xYZv8Qgzs49WKOWsRO0FsDi1c+e8Cj3+4GdgUu8qmRqnSWBH3HKMmisPjoNxwqAjJQAuEM/YxBb/AL5XJ0aFUgxKJweoIvOzacEDlAiERHczA8KAgBwhCG3jO0MKH3lUIcAS0P8AiEGdnDqVkSHdZxUY80w/yiLT9/3DKYvvGFkBWHw0RuEwEEZAqdg6CpLTG98CUJBURWGSx1hVBcUy2iBQElkNSnZtOAVBjYp55PPZ5rPNZz61zyyeazzWedxuACsT/wAQgzsxprXaVYtK7QqJXnF+cABlFqHSCmozy3i1DpNwdIMRlXS3jbSu0rtPjsFh2bTK7Su0rtK7Su0rtH0XlZXaV2ldpVrSu3+GQZ2YkQZuYDz/ALYAcPYDsqePzx+ePwUd/LrPH54/Cb+WAmSm4R8TmCgB9xdIfM/qUclwVi7lm46TcdJuOk3HSbjpNx0jFS+k3HSbjpNx0m46Soq6TcdIRsL/ALf4Qzs4/SSlfRv2x+L++DvGmKKCKKKDXmiiiiguwHqff+YM4OF2cXps4bXAcfj/ALPB3TTiOC7m4c2HzPv/ADBlX2lJGRGTCVsIiooHMFAUZqVsmYJ1vue1YIZroJJY3LmHs5uUmwSXbz1Lo7S806WwaV+GjRo0aD7tTkspWPPgJGjQ4dChggIHr/QnXXAQGOsSPQ522n8QRRY9HbS26xKNAIcHGjRoblI39ECa6aHhQNGjSvhQoKx2WN4swECpVhrokCNUNYDEIOAEW6iC+ds3+78drAMhGZkPfrGpQUvPXJJwB6diIAQy5tmbMK7wOmEsiqgoS7jk1grFFFFFDSbupQpA70tD9pY+Y1IjmzBtQW2LmDURRRRRQ0EpxUBOmygqK1ym9whFxA1NyhvvKZAEQwbFAoUa7QVwUUUULlZKCnSpYQcgJKkQINDUFRCDRiLhcUqKKKKLAXLNhKx0QqYkxXI9DCRiA7TQFAQUN9DBuBYOY/LKj6iVBRdoOCcQ0VIQPdiDRNwDMIPyHKbXEY7AhCAbD7xNojwGoVIJsyoc1DLn0d8q5p14rIEphYAHuk3ZAdbFLZBrAVvFSpp1wANUCOvGEwiiHusgA60EeQmbS2P5oBBOhV7wJ26lkLuok8bZFceRsM4HWf4AEUEACAkpUdTWASEIM/OClp+Y/YCv5ii9BRRLjUUXGQ4onGQ4ovxf/9oADAMBAAIAAwAAABAgSyACwAABAAAQACgAAAAAQACAAAAAAAgASQCCSfSSTKSSTSQ6CSCSSJySCSSSSSSSSSSQSST5ZJLJJYKSIrJJJJJ2SSSSSSSSSSSSSSSSfLJJZJLBSRFZJJJJOySSSSSSSSSSRySSST5ZJLJJYKSI7JJJJL2SSSSSSSSSSSKSSSSDEEmAkgVSSgQkgEgHySSSSSSSSSSSSSSSRyCSXySSCSdwSSuSS4YSSSSSSSSSSSSASSWQSSSSSZSTCCSQSSbSvySSSSSSSSSSR8RICCSSSQTaSbQSQSSTebmSSSSSSSSSCSVyD3Pu2m1lDyRQ9a220NyLSSSSSSSSSSSQ+DB4dESSmvqwZUeSCfd2SSSSSSSSSSSWSSSSdXz0E2QKYjAGWYq6fCSSQ6SSSQGESySSSR7mLFmgBdZCkQW4OIySSSet5EYZb8hCSSAAQI0i0SbQTaSSQhabySST0q5i49MFYCSQTsqCmWGjKSY0SQNGoeAASDICe4C8+CgSSSA3zbaSS5STACSOjq3ySCR+2yaSHBRrgGSJhkg9WCTKSYQCXFv3+SSSbx/dSSSSAt+yRXr35HzcrSReUTDCQbySSQzFLmSSSRwBSSBp59N+zTKSYQQz1STaSSSObWyySSSEZSSSWQMjH+SZSTSicc6Y/SSST+agSSSSRaCSSSySbeHXJKSamUaOSTaSSSCYo5SSSSIOSSSWCCvphlrSRJQiguALySSQDMTaSSSQSSSSSwE1QNlKmST8gjWQbaSSSdZgCSSSSSSSSSWUyyTYGsSR2lGmmQ7SbySSSSSSSSQSTaKWCETf6z8qSOPRo0i3dNmSSSSSSSSSSSChGWBAXHUNjSQIFzWCM6wCSSSSSSSSSSSQWDVwCRR+CDaSYAWA9WRaSSSSSSSSSSSSSQSSWUwW2S2ac0GoNpQJ7SSSSSSSSSSSTSSSSSwGeai2jzgJU9LZNbeSSSSSSSSSSSCSSSSWSsQQFj7K3aSSSSSZySSSSSSSSSSSSSSSSG4LiARGuSQU22m23KSSSSSSSSSSSSSSSSVdbbbbJUyS6i2223XySSSSSSSSSSSSTyST5QACAAYqSIrJJJJJ2SSSSSSSSSSSSSJwQWuJtttw8ACdxt+tyPyASSSSSSSSSRSQWCcn/wD6fv8A7u/T/wDs1/8AoBIkkkkkkkkkmkkkSskkjKckkz1Ekk3VkkgackkkkkkkkkUkkiWEkkEYkkgskkkmukkkkwkkkkkkkkkn/8QAKhEAAgECBAUEAwEBAAAAAAAAAAERITFBUWGhECBxkbEw0fDxQFCBweH/2gAIAQMBAT8QtxVbCxQsfxL8s4eqq1/Dc4egqRAr9TFd8rohalOvk05pzTmnNOac05pzTmnNOacVZwLyXIghFFJpzTmnNOac05pzTmnNOacacBDmP0WB53n1bxc5NwYL1HZm5/RYHnefVvFzk3RgvUuG4/In0sDzvPq3i5ybowXqXDcf5+iwLrr59W+XOSH9TJeo4hj1Xn+i1IQIaxepoe72ND3exoe72ND3exoe72Hle72Fk+72ND3exoe72ND3expe72ND3exgRTq9hRq2a8knCbhKpHu9jS93saXu9jQ93saHu9jQ93sPK93sLJ93saHu9jQ93saHu9jQ93sZy93sPmtcvPDGP0O3Xj1bvmZsFybNmXT1MDYrzwp6igyBW/IgKlOFhqjEaHHDbrx6t3zM2i5NmzBdPUwNivPCTZMRJmPmIlCj8jEsxVZ8WpGSflEmv6u1SZQtOjFqpZxPoV1B0Gpy7BpexpexpexpOxpexpexFMXQnkh6tUKxQdEKrmxtlybNmC6DLeoRil0UDqhB5NVE2y9jQdjSdjSdjS9jS9hnCR/wT9kCtt/wCMi7dYUcFT8ZcmMioo5cGed5ISshUJckBg7nKmdY1DBkuZkVXPy5tETx2bKQpWBCVi9xOESkEOqtwiP5EVFRbARWWXDcfonRCEhUo3BNhNdRPEgm8xKP+3Fk8ZfD/RrHq3fku+Zm0XBXLImrhVGzZl0HQlcISqia4rSeDNJIkre4mRI7EyX1NIRyKsHP4s8b19Kslisl4RGqejIGNOzX9LrCumIY9ZKSrMkkt2sv9GK48R0IYkJpwu+Zm0QqIqn1FTQulskUv0YqR0Gp5MVkUQSjRBulYPFdRSmolKgxHLIZoDCL9yrceJOUwefQkQiW24E5lLAVXBJt6CrKWBKBSlLGplnQVDawGnEj0NDzFqss39Er1NmvHB6lhthnoKd7HqdWQ+3cFqPdx4DcEzyXfMzaLk2bMF054oVkzU/8H5pXb/Qxy2VcsdjZrz6FKFM3i2RYu0vIyTWIkOldVdBKkwm7OCpizXhkoNWggg+IYlHoYnaE05soMaibx+UJMApdmJQLJkywkozB6CWAfUVMbIVraSwkmV1jg/nwmtcxrkLDXKB/aisWX/SqrHfgpVEJOYfAXfMzYLk2bEk4nIrNOUlqx/YPGGMjhpLdCyhREBs159aaQJQo5NCCKp/ILt8DFtIevoNWWnkSiw/aHSw3BP2yadq1Mm3iJVxO05Qzbljc3LvmZtFybNmC6cHW/I9SRHQSSy1XqVEkhro0EJA24g2C8+hE5yyu3/pD6/8ASD/4/wCkgjmPUdhm0SzGkEsm2VgWvMlRvMdB0HIQdXj/AIU5VY1kNU2VxKfRk6USpjjOZKZd8zNguTZswXQguRzgUpCGtiqdR7qjGOaQJyYGxXn0N8vJFFJAhCQvUSlpIQhrH0upZQNQ1jT+CUURhzJwHYTKvQ2h5LqmQmnEbkcQ2xFV1MCHXiCBpAywLvmZtFybNicR0EnMslcXrElAId1EU9oVEiFiPIRBsV59DfLyKy5KySyQMLC9F2FNDMeImqf7h6E1EEeC8Dpwk2mhnINNUfByVcRUiak3FwlJJgmb8LvmZsFybNmC6cjmEkKmYl7bq7DNNdi0Mq8jUGxXn0FWwmikl4v2PlT9j5U/YaXKZFZOgvRdiGhZ+j268EwJ8ApoZmxEoEzVGYRRlI5Ff5mbBcmzZl0I43QRMtBzUrIdKshqIXBFxOJMqTYrz6DtuYcDW3HcZ9w/cx33GOMlv1U4HVL9HbrxyLcwtqYlloGgXCopTCMJKYY6VKTJwK/zM2i5NmxUGsiWPCeB1QWx3ByySuKq5TNivPoblxuG2QjFxhb51/F268cVXhrYcpwzES66FF1VMXJEDm5F6l3zM2i5NmzBdOFgEJK5Gpeg2bBUXDrUQ7jvybFefQ3Iw4XDbIwEq/i7deOQSd2QGmVrM6GAgf8AkDrqJWEz6EQ1GqHVAS6jUXlTku0JBQIPo/8Ag6t38LspjWrCFOq7ieCRGpYieBbhSBUjkZsV59BVgNQfMXsfMXsN6jwewoWl+Pt14EU4J1qIoCnp3FWFG6ildKBp2S/0qyE+lSE3LRS0MucljqNWSsQngQJL0Y2tXslj/B9aVHPFREYCVRsrca4GBsV54OElowG2rrP8m1TGOKq4JT4bdeOEckw5REWBmICDHyKpeNv8E5rWY6krAulzkcsBOMjakZJKKuGSGpxn2QZrYD2EhkCfBDiSTA2K8iuPCauRqEixb8iUKPyGHV304vsX+ljFKXcVjbrxwTpHFSkOhnc7dRjPikgoelyzis8P7iJ9Vqln7jVWN8jeiXUVMpa6+5MJ0ZKiJko2xVchbb1gkRJQ9BG2MuM0gZXDNmvP5k8rq54bdeORXkZShSnjeRG1mqtC2qtn05bvmZsFybsZcbIV3ESUJcOg8qIMTouPk2K8/o9uvAlJSOXYQknMuBpKTBCxgsAs+hRYDVKDndjgXG2RcbaiegmnMG1Y7LoNkpP4VBl5YCkqEuEEcIDyGQxbSNaD2Gy6jmKo2K8/o9uvBLwKioRDl2IBcJWXuJUpYjgliqCq0RVckidfmZtETCUOqxnI1OEheDaswXQRw5f1kqr3H7iT7jPtGfaM+wZ9oz7RjZfvMk9x+5cx/wBG2zYrz+j268cJVkYyuQ1SKyIpHIsmOQ6YiaAnIqOPlzaLhGBY27MF09TA2a8/o3I2JQ10GVGXUyP0VRdVeZooxOOhq+xq+w04+xq+xq+xSicdCfafMSGdVdFHcbMP2EaU8EuRQctpwWFhZH1R9UfVH1R9UfVH1R9UfVH1R9UOD/IagRqK9f0WYiTFr5G5UMhZFMiFkQsiFkQsiFkQsiFkQsi1qCm1DKm5M9iKiUcEiWSyWVJZLJZPAaBFxPH9Fged59W8XOTcGC9S4bj/AD8x3508k4MlyxNhaVkSM+HkZGRT8LIy49atNQjps+R2AIblK+O5MzMjIyLfh5GXH9dyhUSI/NSjjNx0QnPCuZXMrmVzKjcNJ4lUpZM2ZXMrmVzK5kZ8Kw9BOYMhkZFcyuZXMrmWuS7ZDoOSuZXMrnywJz+YlDPMiGYNU7FiXMxE29R1UCUc9DZsVoHVLnwqVFfoVOgyTll7iNKd/wBLNfRdfSj8/wD/xAApEQACAQIGAgICAwEBAAAAAAAAAREhMRAgMEFRYXHwQFCBwZGhsdHh/9oACAECAQE/EMW4Jr1c2TWqp+snQvMl+Ql/SGnLciKZ3Hcdx3Hcdx3Hcdx3Hcdwprlk5GhmSu53Hcdx3Hcdx3Hcdx3HccTJz6JuX9VXWUv/AGE3L+qrosZL/wBNK6W5f1VdZS/9NFp1tUpyinKKcopyinKKcopyinKKcopyinKKcoUTfKXShTlFOUU5RTlFOUU5RTlFOUU5RTlFOUfkeW2vorVQtlCT3o96Pej3o96Pej3o96Pej3o96PeiOrDSTjIpexGhD3o96Pej3o96Pej1o96Pej3o96wldaZwn6G1quzLmSwcaixFRrqSu5v8iaOYnKnFgKqnC1quzLmSwPbXDJQ10v8AqJC8FVfkOiiiRLFJprr/AAgrtv8AhA1tpCvGNwHE52jtHaO0do7Q7qFeehMqyY6Mi5ksDikj2mNwHJG5I7R2jtHaO0OsbFikPoTIbtSYNJ3IEo+I75GpUDq5xgg4L5JdlOYksy112EUJhA7MuZLBxhQhNQxZNwwh5ESPEK/Jk6W44TkWNAmmyOiHIOaXYoQtkdmXCSDYt1IoaSOhYHtlRwDXrCR8SsiMHMA0dLRTztw0NM57U0mpQ9KRuwVOg4kE6yFd+DoNhCEsrsy4RLqNJqEqeA1BxmexBI+WGmlI6UV1pZSAsNaDOjcaoTELImlJbTGonc4DcuEJJlskmSTuxIxG2j2G2FXCEqRePzjOlaw6ITVHxFKIwiFLM7MuZLA9s7YfVoxFayKOmmEboGnqS/MkFOxP8Nn9skeqV/kgn2NU/Ygl3f1FRzj91EU2vL/8Kz3B19qr/LH8kNk0rCguVs16/wBjJjfIX+Z+sHVNDJJ9UKYo40NychQRYnGLoblWEKF65nZlzJYHtn2CXCFE1Y15GtSelILk7YxWRvfJESJgao1yKicMG4FSatyIVNCkG4tG+DWlDBogeGJyqZnZlzJYOMzcIaWG2lkVMCklohgT2RPgpuiBOhGVVUe37HcT2l+NxEmgbcqC2SZQ004ZA1AijgauIkgoJMcimoYsrsy5ksD2zPshpKkoLJagaseCXJbHBLHO09haMooOU21vH/o4U0sJzUVGke2SBpfaIzghkWQyvJHGLWoDtMTlYNwJysHZlzJYHtleBUiFIaEkm1BdHgiwSMoJh86TIbI3VOhxdu1H4wjOwjZFVIbk3QndgibLC1PBiosHZlzJYOMs9ENVFhUUDZ1QjcEPhOoTNhYRrnRG706tilDuLQtZJx4ToNDyg7MuZLA9sjQHglAhD1Qg1QljrDcESaNYTChaNrIuSGRA4IY7CDwSdxKB2ZcyWBqYKMHBEgq49exbNsEXxQY9u1XyK3xLWWYTJMDUgb2IxSwdmXMlgexcork4jaEKQY6LXFvFF8SuGKnxLWVuCIWwmYI3B3gmDq5yJ2JCtCWzNgySJ3LG0kTPXDSlHQjoR0IdM1L6drKlcxjSTdguqUQLgLWITakqyL5CTpY6RYmcJEYJEChCegDcKRI20rpSJSkyfkNpXIjBuKkI4DUYWssFkIiGN3DGHykMbQ1TnCp0FZkvmxMOgyl2FMCCGtBTSStAOicCUKwotu2R6Kj+oFSnyLoh/wAhg6olOfVBJZPt/wCYWsIxcHAnIh5CEpjYLKJ90FKQ0qFklT3N0LekSUREDcWJomEXSwtZWMfPEVknGBUFYtZUoJSq7HHZDLZXZlzJYHtipd4rvi4kUj6iLWVKwjRTKKUFlvXF2ZQwqOBxLU8V8jlXwjikiGrOADbaW8IIwVC+pRf3Akq5+UFp2slWpVhBzN8adYKtVi7MuCloY1zhfsV17UoDgd0jbgdQ6B0DoHSOgdLCJVl9KLWLauLiHWrywHtKE5sOzLhBG5e5YHt9gKEDEwkGvVlSWztO07TtO04mMpsE1UEyY3MjJLWKMxOmdI6R0jpHTOkdI6R0sEuGIUnmPo2cqj8k4icCcROAlN2JuVDJRkhOSXyS+SXyS+SXyS+SXyS+SXyS+SXyV5FLdxtz5k1jNuX9VXRYyX/qgnHgmxJpZ7yq4+sPM8zzPM8zzGuzPM8zzPM8xPNyIUZJBCfceZ5nmeZ5kd2eZ5nmeZ5nmMXPyN8iUOckuE/AnLGIkkkkcBOZjYlTAdCSSScHagnMd/6TVIlxPZvjJJJNaEqnY0JJJJJHjtInJb4m+d2LC6Rf1df5eejYsJhXlFWZiVT2RDTnsxImd4zt0JDi3BCNBKFDJNW40yXy3Ud0RniHI7HC0LaMVnBKPnf/xAApEAEAAgEDAQgCAwEAAAAAAAABABEhMUFRYRAgcYGRobHwweFA0fEw/9oACAEBAAE/EKJTiVHNdIPQ0OVFADdh30bEk2AAxbWgCsUK66TGxAATQ1kDZGEBGtbTHExxKOPaICpjwg/B4zrE6xOsTrE6xPCngE6xOsTrE6xOsRAv4ghiY4mOJjiKUmfCdQnWJ1idYnWJ1idYnWJ1idYnWJ1idYg6Bl6bTHExxMcTE0DMqVKlSpUqVKlSpUSOO0rpKlSu4LAKOKlKhL26qNAAYLC4EgKaz57qcaswagACD4JQZBMWWdMNWvt/duyLHGoCQx7UwPtAAoCfavxGkwI/ep9q/E+1fifavxPtX4iQqa/ep9q/E+1fifavxCmNQ9c6T7H+JR9n2l417kGQKvV7n7t2NtsuHdBYWJokOiffafS/xK+U+/E+1fifavxPtX4hWgXTy3pCr7PpPtX4n2r8T7H+IZbQPf6Sj7ftL9RY2igqiWXo93927dqojGs2AwLFG6d/49d+mx7P/kd353z3NPmfJCHf8JXSaPvHc+30Yadw9g/PZl3TPZv5tT1dv/5Hd+d89zT5nyQh37CV0mj7x3Pt9GGncPYPzOO8M9m/hw/8qers/wBx+SXLly58r5ly5c0+Z8kIPfsJVxDBLly5n9ejDSXLlw9g/PfGezfzam8xCt9Nn40NBmqY8aPGjxoG59UIddXdN540eNHjQMGdTdyTxvVHFr5w6L7W7lU2L43qnieqCGbjxo8aPGhDq/UwA39U8aPGjxIssvQ3dZ43qgIPV7p7N/NqeliClrOsrcfX9RWn33/Utx9f1LcfX9S3H1/Uvx9f1GzHffrLcfX9S3H1/Utx9f1Eox1N+p0luPr+op2+v6jNNFvd3K/Lp4jNnr+pbj6/qIGn1/Utx9f1LcfX9S3H1/UTCTx9HpBUY+v6luPr+pbj6/qWdvr+omh0N/HpLcfX9RaZRddYGIF3g32ezfx6yXfdp5drB+Tu/O+e5peJ8nYanjPr+Xu1TTsO59vow07TWHsH57Pc/L2UJWPvoqEaliiNAo0FBwsmld0U3QWhc9m/jxsvF11QUFIIASpA/GXOCEUukFKAiiMupSWqTKRYcBOJctQrUC3YWGHKUWsg2ecu4KeB5x+bsxzMczHMzPi/MxzMczHMeDxPknnDU8Z9vy9zKK6dhknnPOY5mxzj8M03mOZjmHrPYH5nnD9XPsukarpAgE1BQ3KCawrDkdQUUAp1GXs38OvuLUgM2GdpCFCxVKbNIEyKAVkrIN5j0AdF0VNxXheLuiZq4hUjsA+oGs02IXUtiGDwdgWzTUKgkqkHirlZUoOFaF+ifeZe4gtwd9oRJVgWPcUpSQtvRXd2qVR5RcctVob6mnJLkKyso9yekoiK64HTNzMOq20oekx+vl7hsoqJqnW0ZMEwYnoExIFFAvrhsfaXRswXzwzT5Qy7exprQgdeKYdqlKCYtuEIXLAMPdkLt86mqEWFT5t37xyJZW+wpxKOz2b+HbO4bzB09lNLJ0qirdZlBRp2/wAe5B6rNb1HX5gJAgbjBvs998koFii4CASlWH2Y3m7hZ0OgbEw8QPcnEHJ4z7Pl7L84N9lU07biHV0vUh38H1i8waizws1I78B8MNOyjzio1XB1mrBmkPHlgp1jB+e+M9m/hywf86ZJA6azHqTeETRr5GL7k1Iq5Vt5HTwfusVnYqHj8kDpiHQu78ESCSqtXld+zQ8T5JpVpENIz6PlgCzRwSlU6wACy4Bdry184BcTjAoskVulAlgQSLFHUURcoq2gWi14ioZGpvBs47UoP8hwm5MCAMnZcr8awwSgrtGY3ENFv/SaYiXBsfmauRotq48OA2+6ezdtf/ChCFo4IPZcG+wVX5/40xVGsyvhhuuQCKMOjpAC1DqtNN4EgtC1GSCpFiNkpJPnHHm/EEIQNgHm2XofqI/aZuv34luImtYDDuft5gGVRZgXk++cAUAu6DFurM2XzMvp5Y4jSk3dW4tEUqECKWQgrC1DuhouBD/gt3JzBSFqAZdhXRAYTbCyUALUDSUVsaQYarzcQJQCxlMsjRAjL0SDZPltn5mQMgYN7ZzofqGdqhg1dsaGDZiwAaZ2fE16s6gYVzT9bd29m7Y/NVnWlgBoHKCMbCP1ikQoHAdLCIjhHGMXArLcTjXAKwsVwZ5jx4gxiBBwI03saRLc5uJzkCl2gapGumdB3YAToiqkRkv287rFOWMXHgaa0CCwCOHQqt22LD9yV2xg5QGWHD9XF6UyvoSgRBbQDyk2bRUOUUmi06r9OkFzm/MCsRdLVVSMqCwUJIlDAyEpcuaSjuSnJ36YbaBCGIdirjfHEWG6lIHie0dy3TEJgkIhXAUrO49dPWXAmH+Xlr6x8/FEC/6N/wDJfFfTQXoGxGmWhvdRZAhte/lAwFolwZdTjkmzL7QyMtZ9vy9ldtXxPtPE+0Ot9p4mZJliORY5LzXRxtzKMjT+DEvV2v4j1NsrgOnD+b1gXZmC/wCx4SzCtWzRF0PzPE9oUyrkZ8fd9m7a+tYG4YacYQYjQ7qz7hFypQGAvaCjCUIZijbIRRrq/XiNdTGFIFIsI5oOmsQBKLFTS4McnNU20wCoYbNuqXbFjtdRhx6MT6rLdd0RADl2U3cecO2sRRXQJg5xFJuKBFQM1FQjSiGKNuu4U4BahKbTeMhgpdF2gAaVBVA1+AMLdAEBYuAgHH0FpmzqVGtacENR3KEEyDi3zlGK8YN2upLaIXoUZUAUVUABQUttw/Qq8WVBQxdGh3abNkROoFILMgWWNikPiSqpQak3tAog4LHu4HRdfL2lrwOlxQLYc6hXVSoITQh5DcEoBFEfDs1ngcw546BlXBzH14LLZsBzU+Z8zAygN4xfYtC1dbRlCy1MX1IypLbrCJLNeM+r5e7VAmtO3XMLAmFbEfe4itjJeA/nHhNuwwjxGMpb1i9P9Zsg/wAT8yr60RaTXUmhh4D+4EGgxe7t8eYVfuZpfjMphTTGcSyYo1cndRMmTJ5VLbAjJCxuhUzVvYTMEcIl2TVB0lPATExdc4Kz5TKFbog+RAEaWJ8RN4t58D2RPFbsMpYmXB81HEFRNeHEXKEi5HnLao6iHlnmL6Gw1POMKmwlXJBKXodla66YjWlNFGhRbvGIKWlWHI0kShbavsQp4DmKO/QthAq3lhLZuJ0atACbUS0DPNoOQd6mbdNLRIagVENaXpM4QyYZYAWAIsi7xDnpECsXoFYKq6cjDfg4PEyX6RQmhwdXDxDDAwWyvAR2pMVuBx+/6JqQLTk3JYEuSvFW9r3aASsLTTyvXmVqisCugIB5aQx5wck+r5e7VNIg3ibVtxADQzKAq97JVM95cfLbLQzqtypSU50xtPaJRKMGvU8S6EBgeM56z3uXn7o9P2ygWCXrAWoJeXzx/s4X08hxY8nluvPv12UYFdgPJHA3Uj0IWFTBOpD4h93gLbF3SsVdTAJK6uKK2psqPx0HpeBW1gFbESDYWcoQZ1ATjuE14VviKSKu7iUVs2jW7HiDGkJsGlwlc2oSCQyVLSWC7QCYAFVcRoyqqPk/1Cj66A0HBKJNoEU3q/iE6bvWXp5QBlq8E0lzS8T5JxAyeM+r5e7VOy5c9UVdJttWtb1+8RW+oY68Oxlsrz8/aiiJGiMvNcEC5BG15h7B+ez3vy932btvtOUOw1PGL00o1vFcbTGgoSroQHe/AKASUBdKXuwyf8UOHC9JYhSsK4NCC3YHNEOGFeWOCIxW4cN0B0mUTUIlgErjUdaUnx7ypKlQE0Ac7hGIcVQFNFNFxeFJm+yZMQVinFJxFWgqrRkXrm3kjLBAk4UN1cy4hy7pyNxel0uMADNdTQpM+GJ9DLOstTVUarVOmd4pkazOI0cFl1j2l/8AL+o2i2rrH9RGECLpHc4+4gXRBrYznisYrnxjiZ+tn9TH6+XuCzut0iVHNZQzIzDwLIlzNRQZ6QaXX41L/wCEC0Qwxl2IbNthXdgIyDW/vSBQlngN2GQoC1gHlLplThqpS7TgYdVnbSDAMbdRZqh1PH3fZu2+85w07DbxJ7TLVcUMgwrrmvOPRrkKmBBERLEhp/xyJYDexVMUFUWhim4Vn6d3lKBku1kzDQiuDxEAUAHTuU0va5VoDygNxdEXsABAEQCbxWN7E+IASBoPac/McKcQMuYpk6GZp4Vk4zv/AHLB9ZzufE+6RAtRWrU0PE+ZxDU8Z9Xy92qado5zLsKmHXOJfMLCmR3Zj1O/qytvmV60Ra6F4D1P77NUPYPz2e5+Xu+zdt1FUQqCCnZJliXrRUf+sXTELusyg3/ydI/tWIVFAkxkNKNEt1+UWlBy0sra2V0H/GmAWaXnxiWlNj4bRpmY27HQPUYCnK0jsKUocCtesIC3ZifKIjVMA/GgcJ2GwmSx9zsBsxuT6vl7tUL7DTsvmj9qwLHPzMeumAsAk35q7H3ianvF4oA6VYnhC1CTTK32+1LigAtcc8w0JtFWes9z8vd9m7ZtjhFI2yTpH25n2P8AMaPtesf6SqWsUDLUA6N/8mPJgKFmgLmBtprlFx6w6twbBoHGps0zr36ertYL6b2GpCUrRh0Pqq/O3SInQ28YuBgavzlYusVLvmq6/eYiQFi8F3p/e/Eo1vAt2bMgVXS1ObmJYKugDd/uKRaoozxgr2J9Xy92qKGGrlpUWtzTqLo9YHAiN6PKMBQWsShjjSonjzpBgpbGCGaaoIt8ekUkCDSPYakC9jB+Z7T3Py932bts/v5zXsdGeyR8IUonWftYTVCrU0E08erliVgBWgNH/E0N5Rd1K/4U9UufDoQtx9Ip8VtDNTgLcMpdeik+SUJcsNzcjDd6VDhbnoRztU64JS7vaCfDF6PCIMKJQ0SyW4+kESjrxPt+XuZxW3+Jbh6RKFlq/eku4VinqYADi0vMt6VNwaR8hKHXL4lX0+E0G7kFuvXXf2zETX2lNuDUF4A28Zbj6QJqv2932btvu+cOx0Z7ZEqVZV6AKo16oSCKK1KkVQLM5TnkYKz/AMQo/wCVPV2MPLHMLrCp0L26/uDPK3rbOmYJGk0OdZTFueo3I0O+cxFFOWVjyEUxL3jWEBsUWzb+oijJilF9bqpWqVeoL7WQYxw+FRnLa9yHcLkyafnlSEAZ6qKZblDMrrU8jHrUGQBr5mP7haUMmM8DsaigpvrUJZFUHVgYVoVksZvz+ZWOnYqotpyl6+MLA9MPyb+2+ukGiAJa5c407Pc/L3fZu2X5EtYJTUKuz99aXNhxksda/wCg4P8AlT1drB+T8dmkEKci1fPQ6QMXTwEWAhcA1bS/Arz9YiK2srzAGqrAVdwbcDlVPm/1CaQhdTqbzCVkZr7/ANnc120ULidYpXawk9HEZXBopk1uXp4VEYiOfqPLWX529df6DfnPodGFbjXTaWsAbDStnz7DWB6B+ez3vyw7KXwhCKbIxAC8F0LwrZIphUdAbKAJmwrsHs38OCu4aPrPPqwHmzrrm5IhE6kVwNAV0IN4yNcA3iouhQsDbNgSLETUTNxbgmGkw8Bisq4Lq4CGovSefvMEbQzWahuuwLgfr8yqW6hqrp7zF8+XYcH9xEVuDlzNDMIgbSk/szFqaRlf2t3HU1uMNPcVxrBijGxpB2rqkEDdfCIDLxMW3TxdttC5WeYCkc2VAxt6ksXhPEHI/iZydb2P96QQdYcDofmenrLn3a4y90M+reAJl3QZEmUZaExAbwZTK2ocoz2b+PXQ66s1YqmjeNobZboBYsfdgtKAKWq0UwxnMrMx4V1mSEsqzDL4BGANiugtdACgAJ6n1CnFE6uoiBisPSYDTQyhl2nFYVNDl026b6/5A9OyYtIi0XW4wfMq0B4GPyqSxZYrz2j7naC/66nlBhxtnY42409+zmg4QgU3ZUZpitBDNaVeu/ATJ7H+47CZX43e4rikcsuP2P8AcvqhsqqKxtvpvKmKR46GQKYpX+519Os6D68YECgouAa/cz6VBxSyOQOR37GWhSr7vQHn2l5C5BTlkp18Y9PHoCFdlTiU47PZv48MD6aXAkfMhj1cUYAA8DsppZAhnQkEHrECrYU3m8Xk/Maa21a1bUqu1g/J2VnepSHAUOg4Pf8A3M1ZVygqmTnPi+3mzQ1Ck0TUfbPBKP3CFnOhnXjzmY8TXxOw1IPr7vdK7HYaTUDpTXwdOX90AAoMB2axyfhhUNq9VyOzNath2HAPnSWxr6QMw9g/Mqe5+Xu+zfzanq7GG17TBzflpoY8Y6BDeVywUAvSszSBuRyq5HHHOvExHX5IEtdYznc6wk6Smqvh8ynzloAqLI1iPsSguLzwPHp+UAiRY1h2/D6PENSfR8sYjZY3ZJKdipaKQvP1BDUrrhRWpyWRQb9OiyB5HsCm0FPLrMg9XQ1joJUib/TB6wlowVAGhBDmX1YrctvwzFRTUuJ3lsVd29bPh53HaxtC/HX22YPchhp35m89z8vd9m/m1PV2MKMaKCrzcxAgF0l+nYS8wXNwcjjpv8gawJp+PyQWJBR47U13yt3c/fYqwdU+SNalFu0XOK+MeENTxm0+6xU/eTzKD02VhEb/AMVY6GKEhhFLBbwNNVItORaE5vsCmnJuQYFFAICFP0fWA/T959j/ADPsf5j3ifTest+j7z7H+Z9r/Mw1j+28QbQFQ35ez3Py932b+dUzFddSF/5Rz+DtLrqPKYKFOouQ7ZxzXGpgEB0f7gf9j+5gVF+46x+g/MVfyP7maCjnnOdOT6CniNupL/yg3L3cT7fliTXtUCsTY6xb/wApf+UE/pL/AMpf+Uv/ACiTb0ejL6fSX/lL/wApf+UPIDbxl/5S2WvB4+77N/NqaqMKhzViFsXzNjnJgi0K26h7ypBrZ08o0K516wOmnp+yAn3PWffPzLSHPqHWffPzPvn5gAKH03iokMQ1NbVBVkvNzxEeyyvZYbA+qSFElP5nuFALXDH/AF0/10P26f66f66f66fNe4YUnzp/rp/roW/nQ6Zm7rP9dHtBZyV3b2b+bUxbmDNozqCIztGW8y3mW8st5Y2uXf5lvMt5ZbyxKGXR8k84617w197Lu5QdGU4PSArQ9JTg9JTg9JTg9IGieXowFGD0lOD0lOD0lOD0gNA0NvGIcBKMPdz2b+PNWorv/hTf/kd353z3NPmfJCVfdsZdirpNHc+30Yadw9g/Mdu8M9m/jyJiriCAGzUEsKcKIcZZIMXCALFFANVK2ALDPBmqYpu+TsOZZKPu53iHPFgKAg/jcrNIt0eOef5adL3f0ytSfL7aZjuz58+fAkC5e16FViZ0TTSdN7Z8+LOuPnHYuAzZ0QuDk1Lyqt13HLs5lBNxQWSUKCAGi2kVyYq8S2xFWjQvNXdOkOh8yG/OELu7k+fPjax+sHbiqZi26xmwXSnls7j58+UpM4e92LjnAYwW9xhd6N6Y17ObVhc4hJNihAtZNZXEll29nmO8k1QsshW0BQz/AAzuNdY9SqaEaRwiERbLln4Pa5VfYAKAOxm6RQRaq4AN2Kgjew4EG1w9BNpgKzDjesNAeSjpbG0rKSsrABeIz0lb3k01XcYvWXS1aexHNaqKtzllDnjpyEJ0SVlZWVlZmPETARnAtPhqWKyaJXYNqNxCFAvky6LyLHKVf5wcAMWjUZgFiDKynWVlY8rs+tIIqkVqgMukpgA1MEmIWWCZ5i2ddL+za1WuuNcTMlZWVlCBHCKcNA4AVVQAFVAMwiuhsCEUojdI07MtXYB8oZGojCaCwkQ1mQT+WwpQRQC0I0g+IRY2EUT14gDqS0YZJiuqRU0LL2vxXe0sUt7yTUoxZbXe5frNwNdwVhUW5Qr1tNALMHEr9xd5vvasxO0cO0cIJpKuF6avFaA5agDXJLyWLC9kmVxWBJrYHeuzTTlXUu8VlUCsdyZoWhAUKLqzQLauNF4orfG44WVKEBrvFjQAmc5ywZoy1gWiWaR/iwPTizai42hi7wkQUXYBcWih2l3dlMvEf4g2HfcwI6SrtAoo7yDtK5olLgBR3nMrmV4gR0740sGUc1Ml1nvjqB8ZXiVtazCgxj+J/9k=", null, "data:image/jpeg;base64,/9j/4AAQSkZJRgABAQEAYABgAAD/4RZsRXhpZgAASUkqAAgAAAAHABIBAwABAAAAAQAAABoBBQABAAAAYgAAABsBBQABAAAAagAAACgBAwABAAAAAgAAADEBAgANAAAAcgAAADIBAgAUAAAAgAAAAGmHBAABAAAAlAAAAKYAAABgAAAAAQAAAGAAAAABAAAAR0lNUCAyLjEwLjIyAAAyMDIwOjExOjI0IDA5OjE3OjQzAAEAAaADAAEAAAABAAAAAAAAAAgAAAEEAAEAAAAAAQAAAQEEAAEAAACNAAAAAgEDAAMAAAAMAQAAAwEDAAEAAAAGAAAABgEDAAEAAAAGAAAAFQEDAAEAAAADAAAAAQIEAAEAAAASAQAAAgIEAAEAAABRFQAAAAAAAAgACAAIAP/Y/+AAEEpGSUYAAQEAAAEAAQAA/9sAQwAIBgYHBgUIBwcHCQkICgwUDQwLCwwZEhMPFB0aHx4dGhwcICQuJyAiLCMcHCg3KSwwMTQ0NB8nOT04MjwuMzQy/9sAQwEJCQkMCwwYDQ0YMiEcITIyMjIyMjIyMjIyMjIyMjIyMjIyMjIyMjIyMjIyMjIyMjIyMjIyMjIyMjIyMjIyMjIy/8AAEQgAjQEAAwEiAAIRAQMRAf/EAB8AAAEFAQEBAQEBAAAAAAAAAAABAgMEBQYHCAkKC//EALUQAAIBAwMCBAMFBQQEAAABfQECAwAEEQUSITFBBhNRYQcicRQygZGhCCNCscEVUtHwJDNicoIJChYXGBkaJSYnKCkqNDU2Nzg5OkNERUZHSElKU1RVVldYWVpjZGVmZ2hpanN0dXZ3eHl6g4SFhoeIiYqSk5SVlpeYmZqio6Slpqeoqaqys7S1tre4ubrCw8TFxsfIycrS09TV1tfY2drh4uPk5ebn6Onq8fLz9PX29/j5+v/EAB8BAAMBAQEBAQEBAQEAAAAAAAABAgMEBQYHCAkKC//EALURAAIBAgQEAwQHBQQEAAECdwABAgMRBAUhMQYSQVEHYXETIjKBCBRCkaGxwQkjM1LwFWJy0QoWJDThJfEXGBkaJicoKSo1Njc4OTpDREVGR0hJSlNUVVZXWFlaY2RlZmdoaWpzdHV2d3h5eoKDhIWGh4iJipKTlJWWl5iZmqKjpKWmp6ipqrKztLW2t7i5usLDxMXGx8jJytLT1NXW19jZ2uLj5OXm5+jp6vLz9PX29/j5+v/aAAwDAQACEQMRAD8A9/qC880WshgOJAODjNT0UAZ1rJcvPc8syrgIsq7RnnOCB06evSrSPO0asUiBIz94/wCFTnoaZF/qU/3RQA3M/wDcj/76P+FZU2tyw3c9v9mQmFgud55yob0/2q2q5K9/5DGof9dV/wDRaVE20tDfDwjOdpGj/b0v/Psn/fw/4Uf29L/z7J/38P8AhWV3orL2kju+q0uxq/29L/z7J/38P+FH9vS/8+yf9/D/AIVknqKWj2kg+q0uxq/29L/z7J/38P8AhSNr8qqT9mTj/pof8KyjSSf6tvpR7SQnhaVtjrI3neNX2RjcAfvH/CnZn/uR/wDfR/wpbf8A494v9wfyqSug8sxG1yVZHX7MnysV/wBYexx6Un9vS/8APsn/AH8P+FZkv/HxN/11f/0I0wdTWDnJM9Onhqbim0a39vS/8+yf9/D/AIUf29Ln/j2T/v4f8KyqT+L8KXtJFfVaXY1v7el/59k/7+H/AAo/t6X/AJ9k/wC/h/wrKoNHtJB9VpdjWXXJWdF+zJ8zBf8AWHufpWtmf+5H/wB9H/CuVi/4+If+ui/zFdfWsG2tTixNOMJJRIHedI2bZHwCfvH/AAqSNt8SORgsAcUTf6iT/dP8qS3/AOPeL/cH8qs5ySiiigAooooAKKKKACiiigAooooAD0NMi/1Kf7opx6Gmxf6lPoKAH1yV7/yGNQ/66r/6LSutrjNRYjW9QwT/AK1f/RSUez9p7oni1hf3jVxe5o/z0qtubn5j+dG5v7x/On9Tfcn/AFgh/I/vLJzkUf56VWLNkfMfzo3N/eP50fU33D/WCH8j+8s02T/Vt9Kg3N/eP50js2w/Mfzo+ptdQ/t6EtOR/edxb/8AHtF/uD+VSVHb/wDHtF/uD+VSUizkJf8Aj4m/66v/AOhGmdzUVwxF3OAT/rX7/wC0aj3Nk/Mfzp/VHLW5H9uQp+44PTTcs/56Uc5qtub+8fzpNzbvvH86Pqb7h/rBD+R/eWv89KDVbc394/nQWb+8fzo+pvuH+sEP5H95bi/4+If+ui/zFdhXEW7E3cAJP+tXv711Oo35sTAdqsruFbJwQCQM/rSdP2ejZSxixfvpWtoW5v8AUSf7p/lSW/8Ax7xf7g/lVO01KHU7CeWD7q5Q/XAP9RVy3/494v8AcH8qBklFFFABRRRQAUUUUAFFFFABRRRQBmW8F4Lu6LyFY2+4Tyc5J/lgVZeN300xq7CQx4DDg5xVk9DTYv8AUp/uigDMs/7RW/Cz/wDHsIwOcZ3cf/XrGvY1bW9QLZI81eP+2SV19cheuo1rUATj96v/AKKSk+f7G44qg3avbl8ya2tbCZtrtJGx6ZPFaP8Awj9t/wA9JPzFYqsGyQa3dJvfNTyJD86j5Se4ojXne0mVWy7D8vPTSaIz4ftsj55PzpT4ftQMmR/zFazHGCfWud1bVTMxggYiMcMw/iraDnJ2TPOrww9GPNKJXuotOgJWN5JGHoRis+XaQdowKD0zTW+6a6bWR5DnzTVkkd1b/wDHtF/uD+VSVn3NzLbabE8Pl7yAFV8/McdBj/Ipun6sl9eXNsInR4ApLHo2Sw4P/AD+lcJ9Kczcf8fk/cea/H/AjUkJtC2JlkA9VNR3P/H3P/11f/0I1EDya7Yq8UfN1ZctWXqzoINIsLlN0U7sPryKk/4R+23Y3ydPWsCGeS3kDxOVYeldFp+sR3LBJcJLjHsaympx1TO7Dzw1T3ZRSY3/AIR62/vyfnVK7sbC1OwPI7+gI4rX1O8+zW+EP7x+B7e9c2zc5J5J6k1zTrzWiZ7FDLsPJc84qwscaC6hKggeYvX6110kMcpUyIrFemRnFcjFIpuYQDz5i/zFdjQnN/GEo4eLth7W8u5A0McNtIsSKi7ScKMdqfb/APHvF/uD+VLN/qJP90/ypLf/AI94v9wfypkklFNeRIkLuwVR1JOAKUEEAg5BoAWikDA5wc4oLKCASAT0HrQAtFN3rv25G4ckUrMFGScCgBaKM8ZpFYMAQcg9xQBVvNStrBo1uGZTIcLhC38qmt50uYVlj3bW6bhg/lWR4iSd0twhQoZR+7MRcufT7w4qxod7DdWZSNdjQna6bCuD9Mn+dAGoehpkX+pT/dFOzkGmxf6lP90UAPri9S/5Dmof9dU/9FJXaVxepf8AIc1D/rqn/opK1o/EcOYfwfmVwSDkGrcEzI6SocMpqn0zVO4viuUiPXqa1q0faLTc4MFmP1OXv/C90dLqWsedGsVu3BHzsP5VjVRs5cSeWeQeRV+rpxSVjHE1JVKjk/kJ2pH+6ad2pG+6ap7GMfiR20UaS2sQkRXG0cMM9qlWNEJKoqk9cDGabb/8e0X+4P5VJXAfUnD3P/H3P/11f/0I1EOpqW5/4+5/+ur/APoRqKu6Hwo+Zr/xZerFpC205JxgZpaqXsuAEHU9abdkRFXdiT+2JXf9+S6jhT3Ap/2qOU5Eg+lZBy7BV59K0ILJIwC43N+gpRpRj73Vl1sfXrfuU7xiXrdlFzAxYbRIvOfeu0+0wf8APaP/AL6FcXbqPtUC4GPMXjHvXbeTF/zzT/vkVz1/iPVy3+E/UimuYPIk/fR/dP8AEPSpLc5toj/sD+VMnhi8iT92n3T/AAj0p9vxbRf7g/lWJ6JS1yxfUNNNugyTLG2N2MgOCf0BrGistaV33mUwlgfLEwB6HofTOK6K9na2tXlUAlccH61kf25P/wA80/WolJLc1hRnUV4lZtM1SKWbyDIA7sykTdGOMMfUDnin/YtQj2gvI87xPht/QlwSAe2VAx9K2rC5a6tvMcAHJGBVpWVuVIPbiqWqM5RcXZnOtZ6nHMJ4Y3zt2lGlBPfqfbiqs+lavcRyRSs7xsEbmXB3K6Ngfka62iiwjmraw1bzgbm4l8vzcvhxhhknjHQYxxWvpiOtqdwIUyMUB7Lnir1FMDD8TEJYAv8AMpdQFIGAc9ckHFWdCigTTUeCJU35yQoG7Bxnim+IIZZ9OMcK7nLDA27v0/xqzpaTR6dCk4cSBcNvxn9OKAILTTpoLi7d5QBMSQy43feJHOOwOO9TRWb+Sn+mXHQd1/wq6ehpkX+pT/dFAEH2N/8An8ufzX/CuRv4ymsagvmux81fmbGf9WntXcVxepf8hzUP+uqf+ikrWj8Rw5j/AAfmZNxbTMCVlZx/dNZ5BB71vDqaoX1t/wAtUH+9XdGXQ+YrUdOZGXKZUZJFdQEO77mSOD71a/t+GNV82GcMR12gA/rUDruQqDyRio/s11P5SPcphTkEp3rCqpRlePU9PATo1qXLW3j+Rc/4SC3EYk8i52k4ztGP50Lr0E2VjguWOM4Cjp+dC6TeC3eL7VDscHOY+eetNi0q9t2Dpdx5Vdo/d9qzvVOxQwV1Z/mekaRepqGlwXMauqsuMOOeKvVQ0W1ks9KghlkDuBksowDmr9c56xw9yP8AS5+f+Wr/APoRqLHuamuP+Puf/rq//oRqLvXdD4UfNV/4svVjWIRSxPA5rJmkLuXJOTVq8myfLU9OtVI0M06qOnemlzSMasnTp6bst2Fvgea3U/dq6R7mgAKoUcAUHpVN3ZMIKMbElsP9Lt+T/rV/nXc1w9t/x92//XVf513Fclf4j3ct/hP1GTf6iT/dP8qS3/494v8AcH8qWb/USf7p/lSW/wDx7xf7g/lWJ6BW1UE6fIAMnj+dc5sf+435V0Wru0emysjFWGMEfUVzH225/wCe8n50/YOprciWZrCPkcb31Ok0cEWWCCPmNT2FotlA0KhQpkdwFGANzFv61W0WV5LDfIxY7jyat2l4l2rlUdCjbGDjBBwD/UUuXl0KVX2q9p31LFFFFAwooooAKKKKAA9DTIv9Sn+6KBLG7OiuCy/eA7U1HVLdWZgqhRkmgCWuK1L/AJDmof8AXVP/AEUldkkscmdjhsdcGuO1L/kOah/11T/0Ula0fiOHMP4PzK3fvQyh1KkZB4xS96UHFdZ4RhzRGGYoe3T3FIh7Vo30QeMSAZZf5VSt7dp364UdTWjtKOpyR5qNVOJZgu9oCOCR2Iq6fmjLANjHoalt4oo02ooDdz3NTSf6tvpXnTxEovlsfW4bKaVaCqqf3HTW99D9mi+S4+6P+XeT0/3ak+3Q/wBy4/8AAeT/AOJqW3/49ov9wfyqSoOk4adt880gV9pkc8qQfvHt1qhPdFcqisCe5GK2Zf8Aj4m/66v/AOhGoXKYIYBh6GqjiJX5UjGrlNFRdaU7X11Oec8e5q/Yw7I9x+838qni0Zr2c+QOnLDtUskTRSGN1KkcYNdyaS5VufNThOU/aSWnQSgjpRQaBklt/wAfcH/XVf513FcPb/8AH3B/11X+ddJq0l5GYvsnmls8hVBBHfPHbr1Hfr0rlr/Ee1lv8J+pozf6iT/dP8qS3/494v8AcH8qpWM11Nprm7XEgUjJTbn5Rzjtzmrtv/x7xf7g/lWJ6BBqVvJc2MkUYBZsYyfesD+wr3+6n/fVdVRVxqOKsjmrYWnWlzSKGl2klrZeVLgNk9DVi0tIrKAQw79g6bnLH8zU9FS3d3N4QUIqK6BRRRSKCiiigAooooApJY/6RcSyMGEqhdoGOASf61IbdZdPEBA2lAvPParJ6GmRf6lP90UAULPTDa3TzeZkHPAGM5x1/Kuc1IZ1zUP+uqf+ikrta4vUv+Q5qH/XVP8A0Ula0fiOHMP4PzK2BSgL3FHUmp7S0ku5hHGPqT0ArqbtueJGLk7IWysGvpxGBhP4j6Ci909dOuDEi/J1U+tdVa2kVnEkcfrye5NQ6rYi8tvl/wBYnK+/tWCre95HqSwFqP8Ae/rQ5LFK7NsPJoIKsQRyOOaR/umt5JNannU5SjLR2O4t/wDj2i/3B/KpazLwSnT4FhE247fmiP3eOpx1+lJpDX37xLsOVUDazqASctnoemNv5n8PPPpjnLkn7VOM8ea//oRqOOJpZAiKWYnAAqS4x9snyMjzX/8AQjVu11RbTPlWkYPdiSSa7Y6RXKj5+o1Oq1Ulomb2m2C2dsFI/eNyx96L3ToLwYYYfHDDrWV/wkU3/PBPzNJ/wkM27/UJ09TWPs6l7nofWsLycnT0KF5p81m5DqSnZx0NVcVsvr8kilXto2U9QSazppoZTlbcRn/ZY/1reLl9pHmVo0r3pyGWwH2u3/66r/Ou4rh7f/j7g/66r/Ou4rCv8R6eW/wn6kc3+ok/3T/Ki3/494v9wfypZv8AUSf7p/lSW/8Ax7xf7g/lWJ6BJRRRQAUUUUAFFFFABRRRQAUUUUAB6GmRf6lP90VHHdQzSSRo+WT7wwfp+PSpIv8AUp/uigB9cbfxGTXNQxgfvV5J/wCmSV2Wa5K9/wCQxqH/AF1X/wBFpR7R09UNYWGJfs57DIbKJm/fXCqO4Aya3LWfT7SLZG4x3JHJrB70tZyxE5bnTSyqhS1judGdSs8j94OvpS/2lZ/89B+Vc0eopaj2rOj6nDuaN/Dp90xkSbZIevHBrHmtyithlYeoNTGkk/1bfStI4ma0OSrlGHm+fW519v8A8e0X+4P5VJUdv/x7Rf7g/lUmaswOJuIy11Ocf8tX/wDQjUfktzxVuX/j4m/66v8A+hGmDqaX1qcdCv7FoVPfbd3r/WhB5LelJ5LZ6VZpO9H1ufYP7Cw3d/h/kQeS3pSeS3pVmkNH1ufYP7Cw/d/h/kRwRst1ASP+Wq/zrtq5CP8A4+If+ui/zFdfmn7R1NWJ4SGF9yD0eoyb/USf7p/lSW//AB7xf7g/lRMf3En+6f5UW/8Ax7Rf7g/lQIkooooAKKKKACiiigAooooAKKKKAKcWnRRyzOzGRZM/I4BAySx/U025t7G2h8w2MTDIGFiFXqa6LIhRxlT1FAGYsFhFdfZlsYyC3L7FwGIzj1q5/Z1l/wA+kH/fsU8WsImE2z94O+TU1AFX+zrL/n0g/wC/Y/wo/s6y/wCfSD/v2P8ACrVFAGNJHp5jnm/s5S1rIV2iJcsdo6D/AIFVuC0sZ4ElWzgAYZx5Y4/Sp2tYXD5T75y2CRk4A/kBUscaxRhEGFHQUAV/7Osv+fSD/v2P8KP7Osv+fSD/AL9irVFAGdcw2du0a/YImDsFysa8ZqK3h09bgWSWMYCKQrlFIO3aD7/xCtCW1hmlSSRcun3TkjFCWsMcxmRMSEYLZPt/gPyoAZ/Z1l/z6Qf9+xSf2dZf8+kH/fsf4VaooAqtp9kFJ+xwHHby1rNb7AkJuzpi7gfLKiNT754rbYBlKnoRg1WGn2wgEIjPljou4/40AIthYsoYWkGCM/6sf4Uv9nWX/PpB/wB+x/hVkAKAAMAUtAFb+zrL/n0g/wC/Yqpc21gZls5LGLbOrKHCKOxJHr0FalQvawyTCV0y4GAcnjqP6mgCnaJY3TSKLCJdvTMa8jJAP6GtEAKAAMAdAKjhtoYGcxJtLnLc9aloAKKKKACiiigAooooAKKKKAP/2QD/4Q9daHR0cDovL25zLmFkb2JlLmNvbS94YXAvMS4wLwA8P3hwYWNrZXQgYmVnaW49Iu+7vyIgaWQ9Ilc1TTBNcENlaGlIenJlU3pOVGN6a2M5ZCI/PiA8eDp4bXBtZXRhIHhtbG5zOng9ImFkb2JlOm5zOm1ldGEvIiB4OnhtcHRrPSJYTVAgQ29yZSA0LjQuMC1FeGl2MiI+IDxyZGY6UkRGIHhtbG5zOnJkZj0iaHR0cDovL3d3dy53My5vcmcvMTk5OS8wMi8yMi1yZGYtc3ludGF4LW5zIyI+IDxyZGY6RGVzY3JpcHRpb24gcmRmOmFib3V0PSIiIHhtbG5zOmlwdGNFeHQ9Imh0dHA6Ly9pcHRjLm9yZy9zdGQvSXB0YzR4bXBFeHQvMjAwOC0wMi0yOS8iIHhtbG5zOnhtcE1NPSJodHRwOi8vbnMuYWRvYmUuY29tL3hhcC8xLjAvbW0vIiB4bWxuczpzdEV2dD0iaHR0cDovL25zLmFkb2JlLmNvbS94YXAvMS4wL3NUeXBlL1Jlc291cmNlRXZlbnQjIiB4bWxuczpwbHVzPSJodHRwOi8vbnMudXNlcGx1cy5vcmcvbGRmL3htcC8xLjAvIiB4bWxuczpHSU1QPSJodHRwOi8vd3d3LmdpbXAub3JnL3htcC8iIHhtbG5zOmRjPSJodHRwOi8vcHVybC5vcmcvZGMvZWxlbWVudHMvMS4xLyIgeG1sbnM6eG1wPSJodHRwOi8vbnMuYWRvYmUuY29tL3hhcC8xLjAvIiB4bXBNTTpEb2N1bWVudElEPSJnaW1wOmRvY2lkOmdpbXA6Zjc1ZjI0NzUtODdhMC00ZTBkLWE5YWUtZjhhYmJhZDE0NWQ1IiB4bXBNTTpJbnN0YW5jZUlEPSJ4bXAuaWlkOmJkZjNhY2U3LWJjZGYtNDc0Zi1hZmJiLWU0MDI1OTE3OTQ3OSIgeG1wTU06T3JpZ2luYWxEb2N1bWVudElEPSJ4bXAuZGlkOjY0MzAwZDA1LWU3ZjgtNGMyNS05ZjMzLTY0N2ExYmMxYmMxNSIgR0lNUDpBUEk9IjIuMCIgR0lNUDpQbGF0Zm9ybT0iV2luZG93cyIgR0lNUDpUaW1lU3RhbXA9IjE2MDYyMjc0NjUwNzEyOTkiIEdJTVA6VmVyc2lvbj0iMi4xMC4yMiIgZGM6Rm9ybWF0PSJpbWFnZS9qcGVnIiB4bXA6Q3JlYXRvclRvb2w9IkdJTVAgMi4xMCI+IDxpcHRjRXh0OkxvY2F0aW9uQ3JlYXRlZD4gPHJkZjpCYWcvPiA8L2lwdGNFeHQ6TG9jYXRpb25DcmVhdGVkPiA8aXB0Y0V4dDpMb2NhdGlvblNob3duPiA8cmRmOkJhZy8+IDwvaXB0Y0V4dDpMb2NhdGlvblNob3duPiA8aXB0Y0V4dDpBcnR3b3JrT3JPYmplY3Q+IDxyZGY6QmFnLz4gPC9pcHRjRXh0OkFydHdvcmtPck9iamVjdD4gPGlwdGNFeHQ6UmVnaXN0cnlJZD4gPHJkZjpCYWcvPiA8L2lwdGNFeHQ6UmVnaXN0cnlJZD4gPHhtcE1NOkhpc3Rvcnk+IDxyZGY6U2VxPiA8cmRmOmxpIHN0RXZ0OmFjdGlvbj0ic2F2ZWQiIHN0RXZ0OmNoYW5nZWQ9Ii8iIHN0RXZ0Omluc3RhbmNlSUQ9InhtcC5paWQ6Y2Y0ZDQ0MzQtOGMyZC00YjNiLWJiMGItOGFlYzA4NGVmZWVhIiBzdEV2dDpzb2Z0d2FyZUFnZW50PSJHaW1wIDIuMTAgKFdpbmRvd3MpIiBzdEV2dDp3aGVuPSIyMDIwLTExLTI0VDA5OjA2OjE5Ii8+IDxyZGY6bGkgc3RFdnQ6YWN0aW9uPSJzYXZlZCIgc3RFdnQ6Y2hhbmdlZD0iLyIgc3RFdnQ6aW5zdGFuY2VJRD0ieG1wLmlpZDo1YjRjYTU4Yy1hYWE1LTQwNTUtYmU4My1lM2RhZTlkZDMyMTMiIHN0RXZ0OnNvZnR3YXJlQWdlbnQ9IkdpbXAgMi4xMCAoV2luZG93cykiIHN0RXZ0OndoZW49IjIwMjAtMTEtMjRUMDk6MTc6NDUiLz4gPC9yZGY6U2VxPiA8L3htcE1NOkhpc3Rvcnk+IDxwbHVzOkltYWdlU3VwcGxpZXI+IDxyZGY6U2VxLz4gPC9wbHVzOkltYWdlU3VwcGxpZXI+IDxwbHVzOkltYWdlQ3JlYXRvcj4gPHJkZjpTZXEvPiA8L3BsdXM6SW1hZ2VDcmVhdG9yPiA8cGx1czpDb3B5cmlnaHRPd25lcj4gPHJkZjpTZXEvPiA8L3BsdXM6Q29weXJpZ2h0T3duZXI+IDxwbHVzOkxpY2Vuc29yPiA8cmRmOlNlcS8+IDwvcGx1czpMaWNlbnNvcj4gPC9yZGY6RGVzY3JpcHRpb24+IDwvcmRmOlJERj4gPC94OnhtcG1ldGE+ICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgPD94cGFja2V0IGVuZD0idyI/Pv/iArBJQ0NfUFJPRklMRQABAQAAAqBsY21zBDAAAG1udHJSR0IgWFlaIAfkAAsAGAAOABEAF2Fjc3BNU0ZUAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAD21gABAAAAANMtbGNtcwAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAADWRlc2MAAAEgAAAAQGNwcnQAAAFgAAAANnd0cHQAAAGYAAAAFGNoYWQAAAGsAAAALHJYWVoAAAHYAAAAFGJYWVoAAAHsAAAAFGdYWVoAAAIAAAAAFHJUUkMAAAIUAAAAIGdUUkMAAAIUAAAAIGJUUkMAAAIUAAAAIGNocm0AAAI0AAAAJGRtbmQAAAJYAAAAJGRtZGQAAAJ8AAAAJG1sdWMAAAAAAAAAAQAAAAxlblVTAAAAJAAAABwARwBJAE0AUAAgAGIAdQBpAGwAdAAtAGkAbgAgAHMAUgBHAEJtbHVjAAAAAAAAAAEAAAAMZW5VUwAAABoAAAAcAFAAdQBiAGwAaQBjACAARABvAG0AYQBpAG4AAFhZWiAAAAAAAAD21gABAAAAANMtc2YzMgAAAAAAAQxCAAAF3v//8yUAAAeTAAD9kP//+6H///2iAAAD3AAAwG5YWVogAAAAAAAAb6AAADj1AAADkFhZWiAAAAAAAAAknwAAD4QAALbEWFlaIAAAAAAAAGKXAAC3hwAAGNlwYXJhAAAAAAADAAAAAmZmAADypwAADVkAABPQAAAKW2Nocm0AAAAAAAMAAAAAo9cAAFR8AABMzQAAmZoAACZnAAAPXG1sdWMAAAAAAAAAAQAAAAxlblVTAAAACAAAABwARwBJAE0AUG1sdWMAAAAAAAAAAQAAAAxlblVTAAAACAAAABwAcwBSAEcAQv/bAEMAAwICAwICAwMDAwQDAwQFCAUFBAQFCgcHBggMCgwMCwoLCw0OEhANDhEOCwsQFhARExQVFRUMDxcYFhQYEhQVFP/bAEMBAwQEBQQFCQUFCRQNCw0UFBQUFBQUFBQUFBQUFBQUFBQUFBQUFBQUFBQUFBQUFBQUFBQUFBQUFBQUFBQUFBQUFP/CABEIAScCFQMBEQACEQEDEQH/xAAcAAEAAQUBAQAAAAAAAAAAAAAAAQIDBAUGBwj/xAAbAQEAAgMBAQAAAAAAAAAAAAAAAQQCAwUGB//aAAwDAQACEAMQAAAB+qQDX4tbLPmNimoAgAAAQCQAEEolIEBBIAAAABBMgAgkAAAAAAhEpAAAxsJ5HLDe5TjROzAEPLave3OG+CQAQSAAUMOgvec3iQOLw32qfeSgkAiEyAEFURiWOX6Hv54A0h1YAAAAAAAAAAAMUygCIjyGj6TfYWaSoAFJUAQSW8tfSdDy3QpA4PCxao+kQpKgCkqABBMxh2eR6bY5YA5Q6sAAAAAAAAAAAGKZQBER5DR9JvsLNJUACkqAIJLeWvpOh5boUgcHhYtUfSIUlQBSVAAgTGJZ5HptjlgDlDqwAAAAAAAAIJAAYplAERHkNH0m+ws0lQAKSoAgkt5a+k6HluhSBweFi1R9JEIKgCkqAIIJmMSzyPTbHLAHKHVgAAAAAAAAQSAAxTKAIR5DR9LvcLEEgApKgCCS3Ovpeh5boUgcFhYtUPSJUlQBSVAAglGHZ4/p1jmADlDqwAAAAAAAAAAAYplAERHjeyrvMsIJACKYVTIEEluJ6zXc6FIHAMMXbUEEgFMRUJkCCYY+O/1HHfCJSOUOrAAAAAAAAAAABimUARDxXqeK3e2pBIAKSoAAt47Oz5Pu+hSB59soYHU8eRBIBSVAAgktUfR+q1O7wSNhLrYnlJdWAAAAAAAAAADUwyUVTOVDRo20r0T4r1PF7vbTgkAFJUAQSW8dnZ8j3fQzIHn2yhgdTx5EEgFJUACCS1R9H6rU7vEYtXnj6VGXKy6sAAAAAAAAAAHKYmUZyd5DgMXObNfsWOfj1fq9POGz30dvsozICiFchjTq0Fnja/fz8Gdfa8j3nQzIHn2yhr+p4/I17s3Xe3tXrZ2FqZUFYBZjLSaOlgarmBsren7acQkS5Q6sAAAAAAAABBIERCWMnKKYhEzMeQ0fSb7GzSjabaHW2+HVIWys0e/lch0PL25wFvHZ2fJ930JCZPPtlDA6njyIKone1ez1dP0NUbboMXHbyFLv4uG+ow7XI9NscsAcodWAAAAAAAABEJkADFMoAiI8grdnf6ejTjnVMb6xx+is8yS0jS2OTx/Q8tABbx2dnyPd1J1DHpZcfspYHU8fCBIRk4Wev5/qdvqvRE8XT9Dh67cIZ18SxyfTt1IAcodWBEEpAACISJEEkEiIiZkADFMoAiI8V6vi95Ouul6HI5ft7mq32V7zmbnX0u7n8Z0fI0zEpgIt47Oz5Pu9fjOtmN9MaPZSwOp4+GMFSZIREZdRT9Bl8313OVe5atcaz1PE0WuLapeh9Uq90AcodWDmtc6Xbh1uE6JOXljsE6eJ2aNVjO/yjCTp4jdzNJTMb2JSAAGKZQBB4p0/FbvbUgr1Xs3z/wBS2DHe9HyfC9LyNOWqESyAt47O05Hu+hmQPPtlDX9Tx5EEgEFMZYHP9RtK/Vjr+Dpywkt0fR+q1e6AOUOrBwevLi89fK5Ow054e3Xpoekp46Mtjry0e7XiRlvsHMbcfRobXB3WU0p8MT1mWHpUZAYplAEQ8V6nit1tqQVF2l6Grke8xO98vq3UpRKQCbeOfZ8n3fQpA8+2UMDqePhiTIJLZrtVzCw22ej5TJicrCzsMLmvoen7ip3QBaOxBSUQkFJVLU4trMSmmUkxEJtxGFk2yceI8iT6DMdIkDFMoAiHivU8Vu9tSEQi3OGm0368N+7sUJYgSmEW8dnZ8n3fQpA8+2UMDqePIgkkgsxlpK3Sou8G3v5Oz1dDZar9abVH0fqtXugDkzrAYuOel0dMgb+xy7swgkAAIJBER46y4SY+nGOBjleyiU5QBEPFOp4rebalLHDzq6nfzaMdtzn+q2ezRn7KkpAFvHZ2fJ930KQPPtlDA6njyIJJCNPovYc4W7/ltlrv7TVfElqj6T1Wr3QByh1YNfhv4yh6QTLuuh5bUsd0xuTkAAABYh5jDcZ497jlw0NnnFmJyAAeadPxW0sczU7edj56ECLHP9ViVfQdre8xcmJiUoLeOfacr3XRJA8+2UNf1PH0sZZECzjs0ejoUX/M3sq+/r9kUlRRR9J6rV7oA5Q6sGvw38bQ9LAmO7v+X55h0eWF5kSAAAIiPEsM+j26vS4ziEyxTKAIh4r1PFbvbUg1u3n6rbzwjZqeL9Gp09PWF5KIsZNpDrsc/YpAefbKGB1PHkQSSabRfxM61u95noK3avxuEElqj6P1Wr3QByh1YMLHbzNPuQJjrrnBusBMyAAAAR4/hl0mzDvIyAxTKAIh4r1PFbvbUpLjLTbeXrt1GIa3n+sjnex1ycpFcMaV+Haxn67IDz7ZQwOp48iCTE179TqvWL/lM6W60daCqMqJwqLVH0nqtXugDlDqwjWbKfEdHyJKHoPM9pkxuAAAAAHK4Tj7MOyjIDFMoAiHivU8Vu9tSCSGOgscfHy0oyvc71uZMbfdTqjKmcLcbOy5HuuhmQPPtlDA6nj6oW5xiM9JX6Nndz7d3zvRV+1ex3ECCS1R9H6rV7oA5Q6sGr2UuD6XjAl6Pyfd6TDbdnHfzkAAAAgkgkBimUARDxTqeK3m2pBJBhZ1NJY5KFdfq3KfodhtqbHbVktY7O05Pu+hSB59soYHU8eRbZajRfsY5Wuj5PPw3bjV00ZpwEElqj6P1Wr3QByh1YNXnS4Pp+MCXo3J93z+vbv88ctkAAAAAABimUARDxXqeK3e2pSipIk56xxcbPRMTdoeqq1W78xtY2Xddu/U7u9kByGWjOt8XBatbOFucaLPDptcjoK3bvRkSJTTCZi1R9H6rV7oA5Q6sGPOrUb+YBu6/WuMgAAAACCQAMUygCIeK9TxW721IJBXjnh7auj38mhhVhZ3vn/qe0o+qrx20MOk6PluhSBwWuxao+kTFGWrXdHyGi7/AMtz9dvZar8pqTCBCJTao+j9Rqd3jobHPHpMcuUl1YAAAAAAAAAAMSF+Vgy4YKMyUxPivU8Vu9tSCQCEaPfysbOvva/VzKXpMrjfQJ09CjLDpOh5boUgcHrsWqXpIiLNzgWe189uzhtNPR0VnkVIkgEIlNqj6P06n3fNcV3bh6XjnysurAAAAAAAAAABpsWrmNlM7iHi049dMd7jn4n1PFbvbURknEVRlSxsZa6MsMvDeEZXavbt6b3XaOp0SQOAnVhb+ZascqmxzKodpz/WbfR09Fv5fK3vMW89cExMTJjRR9H6rV7oA5Q6sAAAAAAAAAAGHC/MWk5RrylGxifFOp4rebakEhNUTTOPZc71Wr3c/Q2+KIJLeOzs+R7voZkDz7ZQwOp44iE7+p2+xpeklNpGPnX4295fXb6AgktUfR+q1e6AOUOrAAAAAAAAAAABimUARDxXqeK3e2oTSwqZDqKPoujq921lp876viKZwRMzNrHPs+R7uYnWI6+XBbaGB1PH39djoqvd6Sp2qki0XZQjnrPG0dnka7bSTjao+j9Vq90AcodWAAAAAAAAAAADFMoAiHivU8VvdtShEpHT0vQdRU79BcTzljjcl0PMEGVvHPsuR7vW4zpZjp5aXbRwOp4+/hsiZqgBQVEhBNvLC3OFqj6P1Wr3QByh1YAAAAAAAAAAAMUygCIeKdTxW721IRVE9LT9D1FTvE0FwhHG3vNaO1xSLeOztOR7zoU0ok8/20df1PHkQSAQSACCS3R9H6rV7oA5Q6sAAAAAAAAAAAGKZQBB4ve8v0k4Zmu5va3X2Ou5VBM2y4Iig0+/m6K3xtfOnsOf6zoUgef508G/5kQSAUlQAIJLNTt+qaOuAOUOrAAAAAAAAAAABimUAQjyGl6Pfa7UREgApKgCCZW519J0PL9CkDgtdi1S9IIJAIJABBKMOzx/TrHMAHKHVgAAAAAAAAAAiITOMZQBER5DR9JvsLNMqgAUlQBBMLeWvpOh5boUgcHrsWqXpEKSoApKgAQJjEs8j02xywByh1YAAAAAAAAAAOVxTMY8zdMMzCEcpX6WfjsgkAGuNiAEkUTGws8vYGGZhosc4r9OUQSAYRmgBMCVnZT6TbVxDLBlHRAAAAAAAAAQSA1sL0xmJsQx0YJvJkgACIa4xjbyuAACJ0UxmpjFsZTMQADVxN2ccRO6ABIThFhGNE7yYlIAAAAAAAACCQAAxsWimOZl6WSkACmHLxGumelltgACIefo3CZR1EyAAOWxZGWPKp9KTIABgHMRGqjL0nLCpkAAAAAAAAAgkAAEIBMgAAhSTMSkAACESmCQAARBISAACAITIAAAAAAAAAf/xAAwEAAABQEGBQUAAwEBAQEAAAAAAQIDBAUGEBETIDUSFDEzQRUhNDZAIjAyIyUmUP/aAAgBAQABBQK+dMTCj+puLjQJpTo2OP4sfx46ev5ny4mVqmRaXDjMuU6NRqfFe9Pij0+KPT4o9PiiioS7SMhoZDeOQ0MhoZDQyGgTDeGQ0MhoZDQyGxkNBbDfBQojD1E9Pij0+KPT4otHHaYfyGxkNAmG8MhoZDQyGhkN45DQyGhkNDIaGQ2MhoQ2UKtN6fFHp8UenxR6fFFmjxp36E/J0UHZR50F00uduz2wX2p79xdL/OqF9r0WZ279Cfk6KDso86C6aXO3Z7YL7U9+4ul/nVC+16LM7d+hPydFB2UedBdNLnbs9sF9qe/cXS/zqhfa9Fmdu/Qn5OihbKPOgi9tLhfws9sF9qe/cXS/zhqg/a9Fmdu/Qn5OihOYUbNGb75ozRmjNCXfbNGaM0ZozQ47/Cz2wX2rPB7NGaCd9s0ZozRm++aM0ZozRmjNFPVxWr0WZ279Cfk6KHsw86E9NLnbs9sF9rO7cXS/zqpn2sMz5TFZi1/PlizO3fmmz0wziykS2U/JMQaxGqT6HkOXUPZh50J6aXO3Z3YL7Wd24ul/nVTPtYKjzHXqdZRyHPFmdu/NWS4HaPDUdOgwGoMkw8ythyz7KyrwoKC9GStJBhURw+SjmOQYHIMDkGAiCwaeQYHIxw6zDZJ6UwFPYhxP/OzuwX2t7uAS7gGZTWDCYcgcjHHIMA4LBHyDA5BgcgwFxYrZOOsYrwWIBYWr0WZ2782FyfkjAcN1B2UeYkw2DI8b2/8AAm1EmQtanFXOduzuwX2s7txdBFqi0G08l5Kv9XPvpYQ++qQq6F9r0WZ279Cfk6KCf/jH7DyKdKwvR/ioT8ktDnbs9sFR59TkOvqXAgT2qlEtZ3RiC6XMPqjrjTUSTBqwKU/zDl2Ign/9Xoszt36E/J0UPZwleAJRKBHwnEfz2hLmcsyZmZggYwDnbs9sFfh1CaqdSZ88Wepi6RSbWd0GWIIvYYXe5KhVPE6jI/gFK4RxmOopn2vRZnbrrQ1lugUik2kR6SqpRURKlaaFEobVoIHpvqkQ471dafU/WYMSQ5Wcmuqnx0NuVunty2rSxnbRsVmBJlLq0Q3qPUvU4WtPydFE2ceS9jEJ7Jemy+VbNRuHpc7dndgvtZ3bi6X+Vq4Ety1oUmQleimfa9FmduutyklWRqE2HCqtMWwmiVN6m1Ogc9TUVZ9tmRDU2li27cyj08VVlcqpu1uHPplSmM016oHhaSlqjyWLIsNnMs7/ACnhXuVSZlUas2XcjyZd6fk6KHswK5B+7rpNJTIOQE9L/Ic7dndgvtZ3bumg+slziMY+6ZC0hEpSgkzMNLlItLzNcHM1wczXBzNcFlDUdJuMuIjbIxwFgSCIstOHAQn07nHOAjHB75SRlljwFjllipB8NLp6KZCD61IZN+rlaGmT5cxV6fk6KHsw8+XHCaJTpum2vgWn/NxAzxuc7dndgvtZ3bi6XuK4C6mq5mLiEkRXUz7Xoszt10h3Ja9VMeqmPVTDauNH9ldbjvWwmupprxCXOagpjSm5jKfk6KHswxwDslJBajWY6iE+l5rS527O7Bfazu3F0u8yXOJZndFa0Uz7Xoszt1074t7HZrNZj0OElXEX9L5LNq0zj7EWgMOcIrf/ACqdJU5MppUl3mPSHR6Q6PSHR6Q6KGn/AMZbSw604k71OrQqDJdbS3/NGAJJmMPcyDif+dndgvtb3cBgMBgMA6rgRh7mGWs1eAwHCMBTPteizO3XTvi3s9m07Kn7Pt/4/qtrGeRLs6lcqsjC5PydFD2a6RHvxwEhs0MOUyQgkIW6cZjmVvRnmD4FmiJTXZiLIsuR6xfazu3F0HUPucazuYay0aKZ9r0WZ266Wg3GORfHIvjkXw0WDf8AZa6fAh1KzSauSb0/J0UPZh59hKZ4b53ZTVnUmzIWybNQdZefqTj8VEx1sotQXDFlJKpNWvtZ3bi6CQ5wpBnicVviXd4xwupn2vRZnbrqgZpiZzgznBnOCOeLP9lVi1KY9QbMRrPqvT8nRQ9mHkGniJ5vKWC6EGHeAyGJXO+7dndgvtZ3RiPClcCVrNajGGJst5adNM+16LM7ddUfh3x+xVmnVHQ3X36V/en5Oih7OPN0priQYIFcw9gVznbs7sF9rO7cauFLrhuGD6xG8T1Uz7Xoszt11R+HfH7FWpL9RkxkOoZ/vT8nRQ9mHm7APtZbngF0DbqkhBqUFoPKoVXloonrMweszB6zMFdnSJks0mQWt0LNRmFBJGo0p4Cv8FdTPteizO3XPsk+16MyPRmR6MyEI4EfhT8nRQ9mHm4zD7WYgv4kCDEMsCSSbnO3Z7YL7U9+7hJSX4iMHEG2qI2PJFqpn2tSuEm68+l2l16HVEizO3fmky2ITaHEuJT8kKnR0IxuoezDz10SEcK0lxGwyTRJVgC9yDnbs9sF9qe/ca8CM8QzH5px+lKYI+uqm/a3SVwFEmTJVPiTJDhCzO3fmmqbzaGRnSoTT7UlaeNEqM3Ds5CUqLWhRMfR8DHuMDGBjhPDAwpg30MxskYDAx7kONQcWrLs9sF9qzwd41D+QLHDAxTohsNYKEym5xuNLaVgYwMe4IYGKZ9r0WZ2780mIzMbbbS0hPyQqBHcbiU6NBMUPZh5uM8bqbCyG6sxwO6HO3Z7YL7Wd24ulOg5iiuV/p+MiQmVCcjnopn2vRZnbv0J+TooezDDRToPCG/8SGSfaUk0K8EQwDnbs9sE6pORpDdqYBkhZLTazuhthbwiUokgiwvV/q6RSkrNyA+0Ohimfa9Fmdu/Qn5Oih7NjgPN1Pp9zf8AgVSHxpvc7dntgrUx8pHA3CqlnIjsKk2s7oz3CBPuYZ7gz3Rnug33Mc90Z7oz3RnuDMWq6mfa9Fmdu/Qn5OiibOPIp9PGBj3CMeH3GBifANo7nO3Z3YL7Wd24ul/nVTPteizO3foT8nRQkmdHKMsw3ASZsNRY45hocy0OZaCJLXDzLQ5loHIZMPxYjgciGg3kGSLO7Bfazu8JjhMEk8OExwmOExwnjwmOExwmOExwmOExTSwtXoszt36E/J0UHZR50F00uf4s9sF9qfkXF0v86oP2vRZnbv0J+TooOyjzoLppc7dntgvtR37i6X+dUL7Xoszt35qmjmajS1OpgE7Wyc5muCTU6xFLma4OZrgg0iswoXJVkclWRyVZHJVkclWRyVZFO9VqMDkqyOSrI5KsjkqyOSrIVBrRpp5VuBB5muBmp1h57ma4KnErdSc5KtDkqyOSrI5KsjkqyOSrIeRVmXuSrI5KsjkqyOSrI5Ksjkq0GadWmarzNcEqp1iGzzNcHM1wUGG/BgfmmQG5oiRG4TAeeRHaZcanx/WI/M6489mW6/OYpym1ZjepytRmn5DzMBuHPbmlqmVBqEth1ma1FqjUxzVLltw2o8pmpNvViOxI/W+0h1FEdSzRUrxjl00n7lAQiNPqhwFyqVnenaT6S6lElyqw6k2qY4UqfqrFUbgOU44zEOlJZblapkpMNmjvIacmOEhgun7MP/xcPy//xAA7EQAABAIFCgYCAgEDBQAAAAAAAQIDBBEQEhMgMQUUITAyM0FRUmEWIjRQU6FCgRVAcSNgYgZDkcHw/9oACAEDAQE/AacQWkF/sFOJBOAK8wyg2yMyFg3yFg3yFg3yFg3yFg3yFg3yFg3yFg3yFg3yFg3yFg3yFg3yC2WySei6wRKcIjFg1yFg3yFg3yFg3yFg3yFg3yFg3yFg3yFg3yFg3yFg3yFg3yFg1yEYlKVFV9jh90WtXsndh96WujsU+xw+6LWubJ3Yfelro7FPscPui1q9k7sPvS10din2OH3Ra1eyd2H3pa0xHYp9jXl1UOdkSJyHiRfx/Y8SL+P7HiRfx/Y8SL+P7HiRfx/Y8Rr+P7HiRfx/Y8SL+P7HiRfx/Y8SL+P7HiRfx/Y8SL+P7Bf9QrWdWpdW/mybXkPEi/j+x4kX8f2PEi/j+x4kX8f2PEi/j+x4kX8f2PEa/j+x4kX8f2PEi/j+x4kX8f2PEi/j+x4kX8f2PEi/j+w1lA8oeYylL2OL369a3tFdjvTL12Stlf6oPgD0f2e9zjIToi9+vWt7RXY70y9dkrZXQYl/Z4SuS8xH2B8KG4GGcQSlNlMKyRCngkOZLQ3+AzVnCoQzVjpGasdIzVjpGasdAzVjpGasdIcahmimtJByJhy3bYN6t+JBG2V2O9MuhLpp/EgiJZ/NsMlCPl5SIZqx0jNWOgZqx0DNWOgZqx0jNWOkFBsqORICMjsnpWRBOS4RP4EYiIdqHlZJl7HD7oqYiHJzSnEYXYqNSz5U4hxanTrLOlG2V2O9Mu4RyOZBjKBo0OhDiVlNNxttTqpJDTKWi0Ux2JexsxbCEEhSymEqJRTKjARbEvOm5GxZNlUTjdb2ipITEd6Zd5l9TB1kiHikPF3ph2rNPeiYciGWt4oiEU828ZWap+xxm/UG3nGjmkzELl15vQ95hDRbcWiu0YMqxVQ+3ZqlRFxRMJkWIM6xzoIHQ3tFTwGBmYjvTLplcI5HWIQuUJ+R4QjdZVfhRHZTZgvLiYfyzFvYHIKWpe3pGStlf61BFcKjhOgy0EOE6D0GMKOJlrYvfrphItyDcroENEIiW7RAimrRNbkIqJKGTPiHHFOKrLxvN7RXY70y9QkqxyEFlB2EKrikRuW20MyZ2gtanVV1nOnJWyv9aggnZIcFEE4yBTqJCuJkFEcyH5GE/h+//QwQYPSEn5kKMficxOawe1SYPHUxe/XcyPHHDO1F7JiJi24Zu0UItanHDcPjc7EJAykG9orsd6ZdJ6LrKJFMOOE2iuYW4pa65hL60BMQo+ASutwGStlf6/q8Z3D1UXv13HFkgpiHjVRRec8AsppuEJ0N7RXY70y76SmYIpCOfrnULgJTMNQ/EwREWFGStlf61Daa6qozDuMw7jMP+QMpHLWnwBkC06iL366JyDsQksApRqOZhl2ycJfAEdppLiH2jbO83tFdjvTLvtJkUxFO2SAZhhr8jE6clbK/1qIfeFRIGFbR0Ec9Zx/zRwBXozfrCkLVgYWhwhhQZeUZPNk25KdIj5CLYbUaSr8C4GFIqqMiEjBJMxKR6QfYNJM1ldjvTLvITMxgIt21XLkGUV1DASEqMlbK9RD7wqTC9s6EYavkOXYtTF79dH+Q8xxTRgG12SiWQg3yfOsXIhJPIVS5CqnkKpchVLkKpcrsd6Zd5tMiEW7ZJlxEjMw03VTdyVsr/WoZMkrIzGdM8xnTPMZ01zCjmoz1vAf41MXv10nKQiGpeYqJTGQnfMaDEyBqLmKyeYrJ5isnmKyed2O9Mu60iZidXSIh03XDMQ7dY6w40cBOjJWyv9aiKOTRmLZzqMWzvUYtnOoNbBa2eqi9+u4aaxSDqLM6tCVVDrEGXbRFYOJNQLuKxEKxmEH5iux3plichWB6QhJqOQSmoQjn7NEixEpnVINIqlK9krZX+tRGbhdxvYL+vF79d2IbrFOmBeqKqnQtriQwob2iux3pl0kkzCEVQtVUpqDztsusIdv8qJ3clbK9RGbhdxvYL+vF79dOFEpkHUVFUcRCvWqe5UGzaYECyTFKwQE5Ei0mSjK68yqIQbScTCsiRieA/i4lG0gwbVliQLSI9+cm0gi0hBVUyulhRkrZX+tQ42TqDQfEfxjXMx/GNczH8Y1zMJKqUv68Xv13CBq5B5FdIIpFpoYdU2uZDJ2Tm3kJfWeIbZQ1sJlQvZO7D70gYkFNIcLzFMZZh4dhusnQrkHEqrHWEMifnOmV3JWyujiRCfsEXv134hElTIJI1HIg00TZTGT8prgZlikQ0azEl/pnQvZO7D70gYmI7K7UKUkHMxERC4ly0XiGYfOFkmQfyabXmawEpY38lbK6C0GQlol/a4nSWK//ALgPxI6Ivfru1dE6Fsm8Uk4htmy0HiJUJUbZ1iMM5ZimsTmCy/EuHVNJSO648qGTaoxIeIYk+BB7KMTEbSwfmPSMdAgYexbmeJ0RMCl7zJxDjSmzku5ooyVsr9ji9+u4XMGqsP8AAgoWwTWViMpMVVWieN1vaK7HemXcgYM1HaLwuOsofKShEQbjJz4XclbK/wBexxe/XRK5AQdX/UcKh5snUGkwtNRRoMGCISCNorsd6ZYMNsOubJCHyclHmc0iV2QfyclelvQHIJ9vEgaVFwoyVsr/AF7HF79d2Bgv+65cj4aumsktNxG0VGAPAh+RmI70y6LVwsFC2c6jFs51GLZzqMWznUYtnOoxbOdRi2c6jFs51GLZzqP/AMg1qPE6MlbK/wBexxe/XT2EFBYOuXo2ENJ128BhjQ3tldjvTL12StlfscTBxC3lKSjQE5Miz/AIyM6e2GcnkzgkWS+Qsl8hZL5CyXyFkvkLJfIWS8KodyWlzSSZGF5KiU4JmEwMSlRTRdi0KcYUhOIzKJ6DGYxPQYzGJ6DGYxPQYzGJ6DGYxPQYzGJ6DGYxPQYzGJ6DGYxPQYzGJ6DGYxPQYzGJ6DGT2XGUqtCl7HD7srmgaNQsiqndh94VGkadTpojsS9jh90WtXsndh96WujsU/3DwHG8iLqJqyGf9hn3YZ/2Gf8AYZ/2Gf8AYZ9/xGf9hn/YZ/2Gfdhn/YHGzKRldbXZrJQz7kQz7sM+7DP+wz/sM/7DPuwz7sM/7DP+wz7sM+7DPuZB962OZe09veiHPUHtak8NWep7gsP9r//EAC4RAAECAwgDAAICAgMBAAAAAAEAAgMRMRASEyAhMkFRBBQwQFAiYUKBUmBx8P/aAAgBAgEBPwG2a5l/0J1CnalHM5xmrzlecrzlecrzlecrzlecrzlecrzlecg508rtAr7lecrzlecrzlecrzlecrzlecrzlecrzlCMxr+jfuP1Fcr9v2hfo37j9RXK/b9oX6N+4/UVyv2/aF+jfu+orlft+0Gn6MeIH/ymvSHa9Idr0h2vSHa9Idr0h2vRHa9Idr0h2vSHa9Idr0h2vSA1nlDL/wDFekO16Q7XpDtekO16Q7XpDtekO16I7XpDtekO16Q7XpDtekO0YODoP0cPaPq6mWHuH28iosHKH5PMsnE7Ye0fV1MsPcPt5FRaDJD8jma/q3/G0xXg6Fey8cpvkOPKxHdrEd2sR3axHdrEd2sR3axHdoF5oU1j+SrhHKdTLD3BFXZ8p0N3Dk7EbysR/axHdrEd2sR3axHdrEd2sRw5R8hwR8iIeUx7n7j+hlY/cbWPloczIRdqUAG0tdTLD3DIdU+COEQRXITIJzi62F+jdCeTMBFpFbYb+MkKHe1KGR1LZ2Q94zOYH6J7C21zrxtDHGgUNpbX8Ea/hQ9gRYw1CieI121RGOhHWxjg4WQ2XzmdS2Ws1woe8ZzrVRIPIUQ8WQoDnlN8VjUABQLyN3wdwjpoiZIo6aI6GRXNgNVQyQ1TdQhqq0X9/WHtFsWG2KJJ7MNyhmSYy+UAG6ZnUyw9w+FFFgiKoXiku1QAbS3yKj4P4TquVHNn0nTu/wC1/m5QwZtDv7Q0vTTR/ABOn/P/AEjrEH+0ygX+Lx/a5EkJBjUzYEEdQgahcfGHtGTyYOI2YUNjn1UP+LZZ3Uyw9w+Dimi8g0AK6rqlJeRUfbnOaSyDn5Q9oyBs0+GG0Tc7qZYe4ZyqqEywvVbPIqPgTILFWKsX7NFUzifxh7RaG2PEwqJjpjM6mWHuGdxUNsygnHJ5FR8HbcgpYdPkVRHSwZ4e0IEISyRZz0CY4jhAzUwphTCmnESyw9wzOMhZDbdCcZI5PIqPg7baFwjwnfMchHn/AN+MPaLWutIDhJRGXFRXiplXiplXj3lh7hmcVDbMqicZ5fIqPg7USWG5XHIMd9guPjD2jI11vkt0nbJSWqllh7hlcZKqY2QTzJVy+RUfBm5XW9K6OkWhGv1lOqn8Ye0ZQZ2ETTm3Sm2SUk6mWHuFkrCVOahNmZqicZ5vIqPhD3ZDVTR/Fh7RlYbYrZ62AqdjqZYe4ZCUBMprbqec/kVHwh7shqh+ND2jM0ztiCRsv3V7LAvahnTK1wYbxXtQyvYarwdypKE3kqaOfyKj4AyM1juWO5Y7vyIe0ZmmVr23go8a6ZBFxNbBKeV+20EheM5zzqgnn4eRUWT0J6Uv0EPaM7SiZImajQBFGifCdDrYK5X7bYXjOfqUxghiQTn4abHnu+HkVCNER/EgLkuQ/I5QMwDYV/w/+5XNkPaMs7L13UounbIHcneLDcvTYBOeUNvm6vSh9psFjaWFRX3jZDi3aprr2byKj9HD2jNOVVFiXjIKC6YlldTLD3DJFicDI1xaUyIHVy+RUfo4e0ZaqLE4FjTdM0D/ABnkdS3+rIe4WF7Qnxp6DOyMRVCK0rTizyKj9HD2jJ/aixeBkgvlXI6lg1qhVy4UPcLLrSrrelcb0rjelcb0rjelcb0rjelcb0rrelIWeRUfo4e0WzUSLwM0OLwbXUyw9w+0eo/RsiMDdSj5EMco+UOE6Ne5UwrwV4K8FeCvBXgmx5coeQw1RjMIrlYZOmVjQ+1jM7WMztYzO1jM7WMztYzO1jM7WMztYzO1jM7WMztYrO1GcHHT9G/dbqtVqtVqtVqtVrYK5X7frqoXP6N+4/UVyv2/aF+YKrjMYczNYSwlhLCWEsJYSwlhLCWEsJYWVwmJLCWEsJYSwlhLCWEsJYSwlhLCTGlv6iaquf3Boim1HwbRD4Cq5mhTPzKwU+HCH6Y/sv/EAEwQAAECAwMFCQ4EAwgCAwAAAAECAwAEERIgIQUQEzF0IjNBUWFxkbLTFDI0NUByc4GUobGztMEjMEKSUlNiBhVDgpOj0vAlYGNk0f/aAAgBAQAGPwLOXFBSuJKRUqMSrjMsXVzCLdK0SnCuKo0lgtkKKVIP6SDQ/wDoKwOEGJGXZYcK9GlLi0UJboOU640BlihkgpU0+AbQ4a661haGZGWaTQGiGkgcMeDM/sEeDM/sEeDM/sEeDNfsESa1pC1FpJKlDE4RvaOiN7R0RvaOiN7R0RvaOiN7R0RvaOiN7R0RvaOiN7R0RvaOiN7R0Qr8NOrijJ61strWqXbJUpIJJsiPBmf2CPBmf2CPBmf2CMkBttDduaKVWU0tDQuGnuEb2joje0dEb2joje0dEb2joje0dEb2joje0dEb2joje0dEb2joje0dEb2joiWaKElsyjyiimFbbVD7z0x4Mz+wR4Mz+wR4Mz+wR4M1+wQ5yTcykcgD6wB5SvzB97sj6FPwvi8rmjJmzN9UXMi7YfkO3xfldif67N17bJv6hzylfmD73ZH0KfhfF5XNGTNmb6ouZF2w/Idvi/K7E/12br22Tf1DnlK/MH3uyPoU/C+LyuaMmbM31RcyLth+Q7fF+V2J/rs3Xtsm/qHPKV+YPvdkfQp+H5quaMmbM31RcyLth+Q7fF+V2J/rs3Xtsm/qHPKV+YPvdkcP8FPwjVGqNUao1RqgYRqjVGqNUaoVhwRkzZm+qLmRtsPyHY1RqjVGqNUaoGEao1RqjVGqNUSuxP8AXZuvbZN/UOeUr8wfe7JehT8L4vK5oybszfVFzI22H5Dt8X5bYn+uzmZlXppt9S0qU4ylFNHxWTwwww5JzMrpwS0p4JFqmOqtR6xme2yb+oc8nQmwt51zvG2xiY0iK01EHAg8UL8wffNMty6tJ3OQlah3teSDYWlVOI5pL0KfhfF5XNGTdmb6ouZG2w/Idvi/LbE/12c0t3TOIcRLKUpCkt0Wo0IFTXiMSMytcuVy4IUtDRtu1TSpUTme2yb+oc8nlnwXkOIJAcaa0gAI1Ea4eS9pPxlrVujZXQ82qHdGXDaQmukdU5x/xE5stluVU6nQIsNI3Nvcncgwy4lkNs9yqQS3JLl01qmg3WJzSOH+Cn4Ri0hXqiimkoMb0mN6TG9JjekwPwkxvSY3pMVWlAijcunnVHeIHMmFc0ZN2Zvqi5kbbD8h3N3qD/lj8SWQeaNyhNeIxvSY3pMD8JMb0mN6TG9JiqkIAg6NhPORHeJTzCJXYn+uzde2yb+oc8pX5g+92R9Cn4Z6KxR8LgzWUbpfwiqjU51c0ZN2Zvqi5kbbD8h26EubpPHwxVCgRCc9oxVXRnldif67N17bJv6hzylfmD73ZH0Kfhc0SvVnEFtHfn3XVc0ZN2ZvqiG0SamWU0JW88i3TiFmoiWcVKuzD7oUbEsnAgGlqpNKeuGplmujcFRUUMZG2w/IdvWkwn9K+LNUwT+ngz64ldif67N17bJv6hzylfmD73ZL0Kfhm481RAPDw5kgb4RFTruq5oybszfVEMIlUsOSuJeadeU3pOIVCVYRKFTcuEpSUOSomHA2OJWAFvD9JAhiUcKCpu1vervjSMjbYfkO5scbqSMDAQ9+6LCTr15zmltif67N17bJv6hzPMzrln8NJKUqVS2rgTDU3lWfya1pCbK2Hvw+k8Md1KmGhLUrpisWKc8TGU2n2ZllpJoW3RRR/hrxwzOuTsu2w4N9LosV4qwh/ulrQOd65bFlXriRRIOszRmlmytKrSbCe/OHRzmES784wy+vvW1uAKPqh+VcLbcq1KCZU4rCm6INTxUENLU+2EPEJbVa78nVSBKKnpdM0dTJdFvoh7JOkbDrbYVvgqpRruacgHvhUs1OMOzCe+aQ4CoeqO5kTjHda7SUNlYJJGvDkgOEWHkqLbrY/SsGhH5C/MH3uyXoU/DPWOSNe5VrjjUdQi0o1JvK5oybszfVFzI22H5Dt8QTGO6Ebk48VyW2J/rs3Xtsm/qHM+VagGkuoivNDLa+4snrEogiYmmS5pATihAqP+nVGSH5gWsmMZRf0wU3gjFVgqTwCp9Uf2kVkxi0O5yVzDafw3V2D3vGRGSJ2ZWycldxltl4iraHq7rkBpBUw3TJkxltnQppRKkmgVQcRNqJUWQlBye4GwBhXSJr9oy0xlhpKpx2ZWotLRVx9P6LHHhTVqjKrTbagtzIllLZ11JXhH9mJeXd0rqJqXDiUjeyBSiuIxPpl52Wf/HUpzJOUJaq1qrXccJ5NcZUQ3ZZn5rJae5gcCXPxNUZHlW56STMNONkMS8goTCFDvqnSYcNSRwxl56wC7/eTibdMaWU4e89MZcUnezOUHOEJB9+fTTf9qkywdZCEW2E2jQn9Orh1xNPIywvKswUpSqqbCUjGlBS4vzB97sl6FPwu1MVUd1AvK5oybszfVFzI22H5DubVdEWRqGfXXng7ivNGKaRKmUZafc7keql50tiltrhCVR4ukPb19jHi6Q9vX2MeLpD29fYx4ukPb19jCi4Epc7qmbSUqtAHTrrjhW5qEUoMYpTCKUFOKBhqiWdSstPS7ltKh0EesQDTGK8Md6OiK0FYrTGK0FeOFWKJUeGnDCJdBtUqVLOtSjiVes5lqQjSKAqEDh5IGUk/wBnXjVjudYVMM1GNQRuv+4QvunJjmTwNWkcQq1+0m4vzB97sl6FPwuY9EVVFYFzHMrmjJuzN9UXMjbYfkO36xjnqvojAUzS2xP9dm69tk39Q5nK6VpG9++N798b374SeMfmsIn51+Sle5KoszKmkOrtajjwD48kZUfyZlGamNApjuas0pxKnCcWte6wzBTqqVNAEpKlE8gGJgOtKtoPDC/MH3uyXoU/DPQboxUnPga2TS8rmjJuzN9UXMjbYfkO36cAz2yOa5LbE/12br22Tf1DmddxHNC5mYJspFQhOKlc0V/KXoyA5Tc2tVYZ7um8jIlykBYnpcqC3OGzutULaeXk11thVlDckzY0Suappgc0k65MmUl7DiVPYYHc0xOrUYXadUaqUlD4FCpPAqFf+TnO9H8HL/THjSd/2/8AhHjSd/2/+EeNJ3/b/wCEeNJ3pb/4RJYneU/CMHTG6qeW5RLSnBxgiCUsKO7X+ofxQlVCKjUeDPrjhhWPBGTNmb6ouZG2w/Idza4wrm1xWuenBm1wcTGuJbYn+uzde2yb+oczruI5oyihtBccVLrCUpFSTSBzflzkwZR2bafya5KsllFstOmvB/VUY8kZRygJZyWlnUNNp0qLBcUmtVU9YHquL8wfe7JehT8M9pPRcSmoxcJ4tdYcpRdg0NjHgrFEBSjrwizpEo86uMG2kgA2a8EW6KsarXBFpDiNdKE8tIcQ6lSToTgrnFzI22H5Dt7kGfl4bstsT/XZuvbZN/UOZ1JSKmO898d5747z3wgHi/NQhTc4nKLje4dlntCKY0qpRCePXXXDpyi+y+yaaEoNV/5iAAfVcX5g+92S9Cn4Z8ItDVw5088LNhslWNaHDc2eOEkC1ZNU2tQPHDrtlK3HNalVr6qRoC2gIw1V4PXC6d8sWSvhpxQmw03bH6iMTjWDVCUJTLlKQmv8QNzI22H5Dt2nCc9eAXDmltif67N17bJv6hzOsg0Md+rpjfFdMd+rphvzR+aG5WYl5aWpu1La0i/UK0h9bClqW/S3WiU+pKQALi/MH3uyXoU/C5SCm5Q6jm1dOZXNGTdmb6ouZG2w/IdziKmKnMICb0tsT/XZuvbZN/UOZ3LjfmiA53cZGUbQVLUilonnIOGuJZyZ35SKmooT6vIF+YPvdkvQp+F21wi7ZUc6uaMm7M31RcyNth+Q7nqTHJntn1X5bYn+uzde2yb+oczuXG/NES7iJlCG2cdC41bSVcCtY1QkPrS65wqQmyD6qnyBfmD73ZL0KfhePFwXaDHkjeyIVzRk9IyJPOAS7YtJWxQ7kf8AyR4in/8AUl+1jxFP/wCpL9rHiKf/ANSX7WMjocybMyY7qJtvKaIP4LuG5WY1VjeyI3WvlzgDXCRdOaW2J/rs3Xtsm/qHM5Qa0PFHfLjvlx3y4CeLDyJfmD73ZL0KfhdoNUco1RXhzYRaX0RgAMyuaMmbM31RcyLth+Q7nxFY3O5MUMWz6oF+W2J/rswTSvNC2pqS7ncLCphtIdt1SmlQrDcnEcfPDQafbLy0W9EFVI4+jM9tk39Q55PpJh5DCP4nFWRAUlQUk6iIX5g++Z5an2whnB1RUKIwrjxZ5L0KfhfrxxQa4/q481cyuaMmbM31RcyLth+Q7n5cwRSsfhbpA4OGBfltif67MKsUt0wrqrC3v7uVIuFhaJhRcTR803IFDx8Jp74yOhyRXIpkBVa1KQQv8MpspoeWuPFme2yb+oc8naRVCZlVdCpxFoVpjCm21BK0rcTpBikm0cRyckO6d8P7hNKN2aa4KcRXij+1jTe4QlxWJx/wW8eWGGETrk40/LKcXpFBVCCmihxVqeTDNJY/4KfhGuNca41xWuYJGKuCMe/jXGuNca/dCuaMmbM31RcyNth+Q7m1xrjXFSd2qO+90WkGyuLKtyY1xrilYMa4ltif67N17bJv6hzyctvtIeb/AIXE1EBCEhKRqCRgIX5g++Z5CmG1IfxdSUCjmFMePACHDLy7TGkNpeiQE2jxnNJehT8L9pffn3RpBqVruq5oybszfVFzI22H5DtwOLG44Bx50xRQ9cHCqP4hdltif67N17bJv6hzylfmD73ZL0Kfhe0qxj+kQOaFIPDBSdYza8yuaMm7M31RAZZlHZpdjSGxQADnPDDLjj6JZh1kPJdfUEDHgx4YCkm0k6iIyNth+Q7m3CSYCnd1/TcTnq2bHJwRiivmwRmltif67N17bJv6hzylfmD73ZL0KfhdDjo5k5hzZtKgboa7iuaMm7M11RCJVtqYDKk1cmGWyr/KOXliWebya8qVRJ6JFhrFvHvaQ008nRrtLVo/5YKiQn1AgeqMjbYfkO5t8V0xvi+mN8X0xvi+mN8X0wPxFdMb4vpjfF9Mb4vpjfFdMGqiec5pbYn+uzde2yb+oc8pX5g+92S9Cn4XA656k5xnto7zh5M6uaMm7M31RcyNth+Q7fF+W2J/rs3Xtsm/qHPKV+YPvdkfRJ+Ea0fvEbt9tPMaxULSVcZMb4npjfE9Mb4npgfiJ6Y3xPTG+J6Y3xHTGC0oPIYwWhY4woQsU4IybszfVFzI22H5Dsao1RqjVGqNUDCNUao1RqjVGqJbYn+uzde2yb+oc8pX5g+92R9Cn4XxeVzRkzZm+qLmRdsPyHb4vymxP9dm69tk39Q55SvzB97sj6FPwvi8rmjJmzN9UXMi7YfkO3xfldif67N17bJv6hzyeTll10KwtagDrIpQe/3RMIb/ABVMuOIa0i9dNQJxgr/u+QxFKd3L7GPF0h7evsYQV5Okt2tLYszytZNP5UeLpD29fYx4ukPbl9jDEv3PIr0SAi13UsV/248Fkfa19lHgsj7Wvso8Fkfa19lHgsj7Wvso8Fkfa19lHgsj7WvsolppqTkw0+2l1NubVWhFf5ceCyPta+yjwWR9rX2UeCyPta+yjwWR9rX2UeCyPta+ygjuWRx/+2vsolpYSMg5oW0t2u7VitBT+VHi6Q9vX2MPtpydJWmSEqrPK4q/yuWPF0h7evsYk1GUkW+5ndL4Ys2twpNN6/q90eCSPta+yjwWR9rX2UeCyPta+yjwWR9rX2UeCyPta+yjwWR9rX2UMNqlJO08opTSbVxE/wAvkjwSR9rX2UeCyPta+yjwWR9rX2UeCyPta+yjwWR9rX2UeCyPta+yhqd7lkVWGVs2O61/qKDWui/ojxdIe3r7GC65k6SsAgbmeVXE0/lR4ukPb19jHi6Q9vX2MFEyEB5TzzpDSrSRbcUulaD+Li8nRbK0qQbSVoVQiA00KJGOJqTy5lOOKCEJFSpRwENvABbaqLTUdEaGqq2rFqwbFritavyHm2l21MmyunAYaY0a6lJsNstlVAKcXPCVUIqK0UKG+WiVYKCCsINgKPATqhb66IGFSBio6hzwrR1qg2VJWkpIPNfQldtS16kNoKj7oafRRadaVU1RZbQ6RUi3ozYw5b5ccNE6sBUmF0FQlVFIcRQg68QYLKiqoISpQQSlJOoE+WUWkLGvdCMn2zZtNoSK8dIRIY91idtlNP06W3a5qfkT4SkNtpCMAKAbmG3plb6Uln8NbaiEK/bjWJbuiumsC1a1+u+uULzTDDbg0tcC4qtaDk5YbWDaEtMIU6E40H/TWJyZbNphdhKVcCiK1I6b7SKtomHAaLd71A4Sf/yGGmXg6FA2VVxWeExIokVTFU1Ewh5R3KaHvhqBtUv6RSVqQNdgVoOOJ1emL0spaSJlz9ajhTqxlSRNe6phw6IU760BQ+r7f+sf/8QAKhABAAIBAgQFBQEBAQAAAAAAAQARITFBECBRYXGhsfDxMECBkcHRUOH/2gAIAQEAAT8h40bjD+yAERqgHU00TWoGM/uaYudVYLMOTWA0Z5FqWSyWSyWSyWSyWSyWSyWShyqEslkslkslkslkslkslkslHlE0fVqV9Bw1oj9RnFDSRugBtg2Nc6LB9tFL3RkbvW8x1Tc9N5UE9hfyewv5PYX8nsb+S2TehKZWfFZ/5rPis+Kz4rPiseOl0z4rPis+Kx/87PisKwOW2PPO6JFXdnsL+T2F/J7C/kMGHS1GVqWniHSfHZ8Vix6WfFZ8VnxWNb0s+Kz4rPis+Kwz+lnxWJjPBWRo6hk7us9hfyewv5PYX8nsb+RrauaOgx2AAO33PsPXle39HA1+HL5bm8y+huS6XI8oav8AwOwj2Hryvb+jga/Dl8tzeZfQ3JdLkeUNX/gdhHsPXle39HA1eHL5bm8y+huS6XI8oav/AAPwj2Hryie/0Sj2wq3h1lHtlHtlHtlHthVlHtlHtlHtjXtlHtgfmb8s7IotHtlHtgKf7KPbKPbKPbEP/SU9so9so9so9sAt/wBlHtg++2Eew9eQyleyOAZOzlAPwTkAeAfkjlnWXioYnIAeUAA1cBpKq4Nf3gj2HrzijV4cvkuR4ed+n0L1TQ5HlDfiidJgAD5Sl6moEbW7xSQdFygCwlvWaL7kRb/CDNeVygB1UgDVEGiaUdRi9zvCoWWh+qIrwt6qnvjZj4R1VNcPZejgavDl8lyPDzr0+geqaXI8ob8UTkl+7nXGsTC3QW040hBbZgRqW7p/f4NPuBBsSscwD0NGm4SilrxZ4XBdZxSXtPDOg504H4gsqULAXseNVXTGlyhbMzF7qDNX3reEs9P/ABR3Dd5w1jfSBLFOs+Gnw0+GiE6JtPhp8VPARXVhW07X8lHHgSF+Vv25T2UEqfMW9+NEGfEMYXgdNTD/AMKfDTet7dp8NPhp8NGfWphySX8KX9B0qg1yuDV90IbQKJ7T14Kykqp7f0cN3hLrWwAsbOPkSLLdzddodPbdjw8y9OJ6+WpoQaRNZ6LvTwrFPUenG9vgGrLJY2GhDV8f+B2Eew9eUSd50fwgVSUzd4cLBua/5x8qQlFllPfMeDw839OF64qPIsqgPm3N4qU8CAcCBBYQbN4vMZlaQjZE2Rs41AOm00uI1c7mzBzQu34bS8QmSgysTZGD04G8QOQeLAa2/sGEX9b2Hryh73ZwVI4VCMRASkyMsHTjxS6h0FFR0OsZJabV4IXN12gt0qFCgonnXpwvFFCkvU9SqYvBdWOef0bJQ4waJnU1lXAV2uKUvTCY2768KlQDQB3mBqeEqKKs14WsUNiRUnY/3BBcc124dNbC/KsxXVnx+iiEMUnTMjQ9VgdwGqG1uQ2M2JWh3NtRf7NQ+gNlnESSpQvUDa1sgLolHoF40OjKMxhjuKzXRsXPK40+ptjqwxW3oUC2JMTQrQFuu1ReWUNT+dwcmnqRYdQF8E8wXa0G4SN8QQtt6ghA7XLM8ulmHcR343L5PYevKPvdkrvAy8I2oyryXbR6yuHYQFh3VL4cpWODWakrvElQ/tenMeiVKgwlSjF3iVmJAFdpcGpsunhB/wAlakqBllfRRCNPdIundHKdGClEQiW6rTKXi11d+OMQdkkCm+EAoOgVaG5li0uNFKydQEt6JvMjA61zU9KbZiIdxQpO9KmQhjd14XAbg6azVLM0Ai1ztLXVQZFdw0HLT0Zfcbr9gRgVtUO+Kmw/j6sv1MXEovOoxuVStY2dyOoQCwDAdj1EWp7oaehp4HBdd5TdIpvTpwKY5dNosTdENwILbc8nsPXmFX2YhWtKOFdes/T8N5f3hj8bTyUq046gxccTzP05z1QbXImgtNOvEabljclCnU8Ztctlozp90hukx/qZTruG9bkG6xX55ZEiRYbSnawuEUXeaPDidDk3GUdpWlmkzsDUVrKCB0Biel1iYhStBWkIJAddiWzcROzTtLyBGimZTTMKuszsub8UVDQb1mKBBGjUBrLtZhjpjSsHUmLiKMaQUtVui/ngiB9QF1izguGasZQXnxNn8QFKS9u7YFd+vJ7D15xQZeEuqO+kvqzt1ROlu3hKrZvEPW4pG94ztK9Xh539A9U0ODRo3wPs5uLLrFtwpUzagDt9JFIQ7sp2vv4Ttffwj0vv4TAtUNfRrizemBygoAuh6vZFdY1q/XaAgd0tzEpmLCHa4IT+AhW7dArTCI5G9me09ecUhKoFbwV/iTK4vlBpuXt0lKzjTWjTLri8POvT6B6pocBqoF6tesoD/wCkoJc0cJ0f2DcN/pIhHpfXk8j9JYvAG2F0N9PA1aJU9Rf0gq77FRTF1tc3Sn/dQT4DKdZRQZPXMirlHTD0eDoR4LHsKUsZO1bwwADm0TRq+9U6xA0749cflofLQ+Wgzwwd2666InSdkJYfzFyu7K7sruzpywf1Z0vPdVZrEupBwL2S/VilCzSFVvWZo0/mxNVq9OUd4CJ4mXl0WR+JbqzxJdWXoR6mY7dXErUtcsKlC1M90M/UTxGGs1/QIR6X15PK/SJl5m48AZVmhqsNfpMVQWXekZABQ7oMq7QZk8nUHAh2mk9h684rdltn4jhU3IPWT16i1fGOgpzbrzeFGseBRYNtRMj4C+RaoAVlyk+68fwwVLBtRo9LgMWxZWWMsUa6XaaTDIUCd/nqaHByKA/M0roExLhrK01eeI3+kiEXWHQne/p/s739P9j1v6R8YQCSpVfTGVcOotWFVw8BAq+iK9+jLRtyew9ecVeWNo0/p1lysFwU3k8I8fvhl/ZFmSKx4F1ggMCs9EP9jpD0IDrZFXMqrZtoo6NFvGYfPNcW33Y/stnWNopRzTk6XEAFRpXWLuvPU0OGDP8AhCr7Somen+vCujU6r/ErYtF7wb0+iiEOYwZPGfN58jin++MpbXJ+PqpN4t3byIDjdvXTqsskhcP8BGeT2HrzijV4cAZljipZOU34BqxWTLD6UouXEQ0/ddRbibLeXpzHql1L576rDOTyhppEZQdSxAtWYEt7chv9JEI9N6nJ750iQKrHAqxAHR0gsOQ9mLsUpTa/p1y+w9eV1fwpXeGrO0pn5mKZ9Lg0R064n5lJQDRmtZld4d3d6cx6JXefmAdImqqGhLurWK4pdAxH5ni/olMp6w1cyu/0UQj0/qcnvnSX28K97Audg4zeoUaU3vs2wP39h7D15xVNs1jaGDhZHFkohqz4IYEeImYV7LmGYnWlN8fiAqKVbqFlp7hyWLFgyfM8ust/isTRn4IAaJpes117NnBVjrMxCalE6GOO1bTGzMy1B2+kiEIONV1T5M/yfJn+T5M/yEVoQX9l7D15xRq8OJbh6ppZvQaV4Dhe6FrtGDJ2w6iexw8y+hOSpQQ6JcRb+WUx/PWa/gQwyGaO8SuJvxRZ8ULoZgYie1QUBlxFNaVQXQXTGMOtmlPuRGUC1Us8WF+O12J4xe53hxH6KgS0o+xHOyQLyFGrwhQcnG7uOWzOKQWtJ1StY6GzpcVQ04eZfQnJQOswytikgOqmh1jl6Btf7xA10m3A344k70eWX2ll3gLahSwslo0rKdYugJU2rKoadYK+4EDRnuAPQrbay895RYEushY1L2abXLaRsBrX3bmYqFWqTwmhr9FmRS5VqrvB5QWgARhpjYoMw2h9GeyewTVXonsE9gnZHhrO55TNGaQ3iXv0ONJYP8T2CC2Ks64Y1yatu3LOZZF7h+oqyt/ENH8T2iYJMjjQ6cIMQKu2GJxR2SewT2COOz4QO6+6aT2CXzN8CqV9yIUFm0n6mH4+qQOxPaesOkYdFgJSxrYM7BFx6p4Jhl78PZejgavDgR3maykIS/TpKcP7vfpEsh31nTh516fQvRNCJiRqRo4edfSZnum4is9F/Tib/wDARCPYevOKE27VG3sefF6d2Nu88imyQw9GEDTUkcour6TBkXFG3eedenC9aN63eqC0FN47SmmPNKh2K7IHkFosTjUbruppBGi6NPzAABQbcfMvpwQZWst4a6HrlKVBHo/8BEI9h68woYQUHUhr8OP7kb1YE8iiWT8ATucGXrPOvTh6eS9yhdY9Hl6Du4zKw7e7clht+ZhxBuOj/jaGNnGIaIfzlf0uufPZ81nzWf1nnzWfNZ81nzuNQP0R/wCAiEew9eVf3uiZ7Qu2mky9IuCXqx5sOoSuo/UOrNDaV1H6lm5+onO3kS32me0vs6vTierjUz2me0tTSZ7TPaZ7RuFvaZ7TPaZ7QvOkz2+/RCPYevKoI19NNkPH/SfgKQeHDdZ8fnx+fH4Xp5tnx+fH4BSh4Zke3+v1K50sXrExZtpnblPCzNYncfqdx+pQZfqdx+p3H6ncfqOoP1O4/U7j9TuP1O4/ULHL9TuP1EtFffEI9h68r2/omkHPw4Xx8tyLw825twWuGlKlSokKlSuBvK+9TCLhPYevK9v6OBr8OXy3N5l9Cdl0uR5Q1fvvwgLOZoBQleNirc1MFmkqtrpcbzRgGxVf9cBFFLYDom3FvEQE7UACCrrTwaZ75aNGjRpTMEhJhYPOevM0aNOjStFSrkGoXvE1qvV1pfARg7CKKk14RwEXDdqZrbtb7zs3s4DGgYclGjRpn+QCCZvh5SRo0aa/ChwMKvpX+FGFVv24CLKcF3AGp3YVcECFaadosEjQC6afbgZC1PqsJ2YgxTqAtqXVVW+GITJAd2G6Vf51TowQ5+vMeCy1xepUMkqVKlSo4IVonYIXVwlotgxtBgwhkjIIC+o6MqVKlSo4JkJ1nSVRo5N94ZiHK8AMZWgfiJ6OCw15WdEfzxqVKlQRhFaYatDQs/csR2dlsdcjqRjnRTVkarTklSpUqVwRmCARC0AGVXaFS2XiqFDwf1MPM5DqEoWzXqQb+7djmJYCaMCxWiVrR4wRQms7BZ4m/q1rNDmFgyrZ6IBDuV0uLdDk0ob7XGvOd683OI3AsBRS7qvdp1lI7FW6ydqfhKLQr8L3AwL7POQzJjB1G+2Gr0LRSapDKUtrtYm/dJdKToGu9Y53TgB2GaUdDVla4XAgtYAQoCG9bTc407IB7bun4/e1fRVK+hUqVzpcqVzpcqU+1//aAAwDAQACAAMAAAAQADwgAgAACQAAlAAoAAgAAIAAAAAAAAAoAEk9AkiEkkhkhjMkXkkikkjEkkkkkkkkkkkkkEEk/WSSySSNkhKySSSSKkkEkkkkkkkkkkkgkn6ySWSSQskBWSSSSVUkgkkkkkkkkkUkkEk/WSSySSFkgOySSS2qkkEkkkkkkkkikkgklBBJkJMJMkqMJMBJBskgkkkkkkkkkkkkEk6gkk8kkxkm0Ek/kk4lkEkkkkkkkkkkgAkmckkkkggMk+gkkEkmiMQkkkkkkkkkkkjGiygkkkkkTkn0Ekgkk0TMEkkkkkkkkkklU0rvDtvpTTckY4+ttsZUigkkkkkkkkkMkdAqfX+EARMRMn0CDAgXakkEkkkkkkkkjkkgknvx8FBgAcbuAlDrukUkgkekkkgBhE8kkEkZGKBjhAQ2W1EF0dpqkkEj/bsde+lQAkgkkclDSNAiYE+kkgZqmkkgkirTxvpmag8kEkzlhl9hMBkn5EgJQNgAAEgy2G6kO8lokgkmYNzggosMk+gAh4s1kkkg+r00kgkE8X1Ek3nQNEAEBkn1AB2et8kkEhsFXEkkkgsXgkgo92x+xjskzhEktJCMkgkK2Rhkkkk+sQEkziGXZcfBkn0ENq4l0kkEhW49kkkkhGkgkmYBYzIv/Ek+oiOmCLkkghskYEkkkkCMkEkzkjOfJZDknpu2KEE0kkEk2jvEkkkmCkgkm4AiLEheMk6REFuACkkgk20yMkkkkkkkEkzBNLKyVWkkGQ8kkG0gkEm2WkkkkkhkkgkmdsvA2aqMk2jpGBkus9QkkkkkkkkkkkQidzFk3MePJkiP7AhMN1/YEkkkkkkkkkklcAS8Uh1xDS8kY4cSYjGMAgkkkkkkkkkkkVAhnAEdOAgDknZFMsYAUkkEkkkkkkkkkkggkmZkEtsPrOP/AMM3iaFpJIJJJJJJJJJJJJBJMwYSiFzHdFNgktk0dJJBJJJJJJJJJJJIJJvKYZAaa2t9JJIJJJrJIJJJJJJJJJJJJBJI1QGAHlIZI7bbbbbd5JBJJJJJJJJJJJIJJalttttgLJMbLabbbfJIJJJJJJJJJJJPBJP1AAIAAjZIyskkkkqpJBJJJJJJJJJJJPABe62322HYAH/2322pAABJJJJJJJJJNJA5t5f/AP7v/wDqs0P/AOjV/wAiH2SSSSSSSSSaSSRrGSSaCSSRaMSSRUySSB7ySSSSSSSSTSSSIYSSRQiSSCiSSSaSSSSTCSSSSSSSSSf/xAAqEQACAQIEBQQDAQEAAAAAAAAAAREhMUFRYaEQIDCRsXHB0fFQgfBA4f/aAAgBAwEBPxC3FKxDJJX+Vf8Awya/43OD6DQFEeYyTE2ac05pzTmnNOac05pzTmnNONBITL5EHUY5Iiac05pzTmnNOac05pzTmnHkBKLC/BOxsetseT+vox36jPM9vwWBtesseT+Pox36jPM9vwWBtetseT+Pox36jPM9vwTsbHq7Yx5LX+sxuvUoRiNfb8GxoWJbg0Pd8Gh7vg0Pd8Gh7vg0Pd8Dy/d8Cyfd8Gh7vg0Pd8Gh7vg0Pd8Gh7vgSnVJ0u37F+SQVT/F7lS3u+DQ93waHu+DQ93waHu+DQ93wPK93wLJ93waHu+DQ93waHu+DQ93wULe74ETXsXm/wBcJ/A77q7teTHk2i8ofUwN57uFEsW4/Q8qf6YQVKcXQHBxw33V3a8mPJtF5Q+ozfL34NNFamw/5+v9Qrt8aspulsk/29iZUj0xrtqpYZP0K8ka9CtLsGl7Gl7Gl7Gk7Gl7Gl7EcBelSYSPVoekReigvNV5MeTaLyh0LI31Ukem3ojsRNVE6y9jSdjSdjSdjS9jS9iNBvRCiC0gU19Qh0iJzMKJjhb/ADK3JjIqKOOMiMDYkLBCX7FEIadD5Ujq7SrQxtlZmTeLzy7ReRpO6ISsXuMU6Gh8qyzRIqVyws5cRJDPP9vwWgiATBupKmV6iZKYl4XFjA2fEly3ebzybteTHhi9YFKdDaLyhqSSVwiKom5+iXTGIbEm2khU6uuSQdiN/aNDRQimzn/GuGMccZ6VZLFZkI56MiVpM7NfIrU2OYtrVGvWxJjL7ajXsOhDEhNOG7XnhMIUwWTEtUYvYXlcGp5MVkZbWhzJlXZ/JHMpwEqwhktEbNR9Bm20mnXUmkYT7uhJYUtyJzMYChysibTZKabWA00FUqjKGNv1HySnkIaauUg8xa5bIdXfcKYiW6VlgxTeUFcY94EMzqhuCZ5N2vJjybReUPoYrLpZehfk+GWpUBFbsdjfe7oPDfoymXElwLyv2oIVsmJQXTr2HjDQu8khVq+By2O0EFokLP8AriScZCGipBCSMw5CwSXgrZLJT6jJgtTLHR3xME8EJ2H6PMfWTNs2a2CMtBVUsx4KQTNwywN0vJjybReSE7lZhFSHyS1Y1BwsMLqsvDkspYlYG+8H1nVQJQo5JmnBAldu74NTQqaWUmMvo77hA3Bm4Vft0KRc2I4Sji7TlDZuWNzc3S8mPJtF5GW5WqgVBKgpj6XalokSO6UVBttG+93Qh1xHG+3/AKQ+v/RoqvYTfUOw7ahapMnklLGaSxC5t8QxpiKHW+EhX7AKRWhWNmTL5Jmxul5MeTaLyMcYcjnATNJV4uxK5dx2qJEJowN57uhuxpO5ARNNMWFajpLyEImunVKBrBa70w4PnN0LAcVliSaVfgiU2FHDGDmCJn2j0FNUxjDXECcASXQIlLFGvJtF5RIk05ZKw4uOEkYFBugpDQlCEQxHkIg3y8PobvjYbn3FVP0YkLoLouxgy1kaqqeB6/XR3xDdiwW+Es1UxqRRYYifagzqkliTVhXSppuyEiydkabsjTdkaYhJQuTaLyPkctpIRWFNR1C1BiFOK8YkdDee7oNbhJn9U/g/qn8DavixSTEis9N2GqJsJw+i3xMCcupNQJyInNUZBK9iF7iTiI4O5pO5pO5Fg7mk78u0XkZHGpMhJsEYYEMa1hqhLg1EiipMqTee7nY5Y4Yv+o/k+4fyKWrd2M294rqqBEuX0d9yKmkuNB6byFqV1dxBMjS6h06Q2ZHOtivJjybReTIJO4t3ABsDMzXgToxCHa41yOxvPd0NtybUVbim+Pth1L9HfcVUxkiFuO4qsS19GURhQ27kPU3a8mPJtF5Q+FgFrOIljLKR7mtgOuJrIkd+R2N8vD6G24/8NoOwk5l/5d9wuLIJOKinJk5JXAbhGsBSU9QaXqigTNIK26NRQZJVuWvyfy2MaRF+jHWfoDKHJjzcWFSHqPapIgkE8BU4OiFTkxm+93QtAj+xfB/Yvg/sQlCYdTGOnvhFODVqTKKBLnjwIompeVNySFckrFigkpsYZmPJYu3/ABiYYEHSClP1DcyWwVYssesBDEqjZca4DsL3l7lxRIdWKhN/6sY4zdZErhvuZOtDI5kIJZPNx8hSO3wKbTOU1RKuXxjyUfzgzMQVZGFTLHxstnZaEQUYiRsowGzRcRmS1RcIaUkjsb5eGIdMO6dyUTp/odlyFU2XsLYh02Gb7hNI4zqFqo/WIJ7zxLkJ6Mo0VZiipoYz5K4cjQqbE2y9xozG/wB03J6RrSiGUitv1Em2c9WQSirqNnSEXYeHGZUCaKGM3y8P/ZJbkalyM33I0MMCTmFnQSiu9fRZEGrVy7teTHk2i8ofG1dLIURThqh9X+xujOnkdjfe78HvhKRwUjTdjCBJNQnXyMipOAszFTG061saCZXHA368mJEqhLTUq890KIobBeUaBolJOhXCWWAkShLhBHBoxiBpQa0GMN16jnE3nu/B77iqENOuNhqhNcF88n77NRNttIWZI/fXkxG4SiGelO4lQWNp7oYkKi/bG35GfaM+0Z9oz7Bn2jPtGNrl95n2D5KKx/sZvPd+D33BNOiuJS4XEpI1wQ1N+SJUMb1ahxcgVbFhqvJjwjAVDaLyh9R2N8vD/BMaibOU0N7l6mJF6IRV5zaMGcehq+xq+w04+xq+xq+w3KTR6E61oIfw7UlHkZD1DQuRCssqL9jmjaPqj6o+qPqj6o+qPqj6o+qPqj6ocHtC0bJqJ0n8FIqUeRMkLIpkRkIyELIhZELIhZELIhZFrUJlCY78lS5/oKqy4kslkslkslkslkht0oQp6/gsDa9bY8n8fRjv1GzzPb/Yl+Mr3+BxKP6nLEsWpJQSP9ySMjIyMxIyMuHkVugSOE+SQVMDW/8AHcmZmRkZGb4eRlx/FvBFqRCX+1KOMtodEIjIrmVzK5lcyuY3DkVSll8SuZXMrmVzIz4WTbwvwx41zK5lcyuZUl4DcOByVzK5lc+VoTn/AFq4kOo00tdhW5shZV6DqofPcwszAamOduFIqVWIteg7yWbzL2KUT/Cp1Eo6F/xP/8QAKREAAgECBgICAgMBAQAAAAAAAAERITEQIDBBUWFx8ECxUJGBocHR4f/aAAgBAgEBPxDFwuOjNsUiV+ZnQSfENT2dRpc5bijpM7juO47juO47juO47juO4hKllkeVoTKydx3Hcdx3Hcdx3Hcdx3DioxjPwTfWFrLeNtRFr/Bb6wtG2S8baiuWv5C0t9YWDbJeNtRXRa/kLSjchKpTlFOUU5RTlFOUU5RTlFOUU5RTlFOUU5RCFTbJcE5KcopyinKKcopyinKKcopyinKKcopyiirJUz/BWEMoSe9HvR70e9HvR70etHvR70e9HvR70Q7kZZM7MjoPej3o96Pej3o96PWj3o96Pej3oZFVkz+CdtbXTfLnq/YHYqUrJf2VXE5+QnIJypwYnIwO2trpvlzvq/aHYok23WI/ZKajb/U/8LPkR+qCEkk2wZDTpc/1CFRsrI/pqSFeMUFsSWHaO0do7R2jtD+oNOXi3Bl1G+XQ3HNRzcgzasK5I7R2jtHaO0NWWxZnIyuQobkjBpMgt8RquRqcjWxdJvgJFVk4E07ZeIBZCY3TfLncpgiSGOVNFyFzMaS8FLZa/kTtpK46TEywoE5sRwhESyM4AzSjbJdwmLjSj6kajCO+VRK41h4SlcfIrEPGxE0saGwnOdusDQnOuNJqUVowEqjHCAm05QgNPBtSwkkkllum4lWWQbtvvuOqLiBwd8tqiKlCAYaLjUKWV1YvNSPoFaPQZqCElK4mKe5JQVpXOwC2CabhH6cf3P8AwdDeMrCTGxoShSEppJZk6btjokoFUexMnQOoWEkM13NnfO3CR1Koye2opyYbaISf5IeYrJxG5CY3N/DmhQNUo/U38DhMe9vAk1lw39OP7I9iP1WSDdL7kZEzv/6EleqDNI9RDaF1s43Jl3bxAkJun9sSJOX94EkQqPAKZU30HbLk7ohr0FSBtmum+XPOpuGSoREBqNeRrY9IRvltIbWRKHJKsJITKWDcWFShNyKU0HbLmCVawNBfJEWwum+XO+ZoQ2IFJRKpBQblLEtEVpk+CXAq4aE5U4RpNcCl+n+yNL5HH8bjo4G3KSzO2GqhJsa7iUKChsaTNMUSy3TfLnma6IuQkKCGiyfa0L2K5LAmpS5ZKWlKKEycbv8AoZI2lVFyiUPK8NukO5HGEUYsze1yXp/2QJag7Br3JlKZDkkam+XO+YE5pyXwgEm51FeyFRBK+SLnpOtCae82o8boqXaSwjM7Y6NyG4qjUVHhyzl7kupNibZjJWZO8bFULLnfJME7oOm2GHNGX7GgjahBSDqOEKyQ+CNNG24HFGg7ZdMPCJU3GmxJrYlwSTmCOA2exGXPKIsItlgNZX2NBU0TwnWOGLD6quCyFoO2XJxUiqCIELDKSOkxwrE3cUBFM3y5qRQwhQ5MENmTOb7GhZyXxQZGY2hfvfSguW0HbLuiBwXJgeO8EZUMum+XO5ccK7Jh0CFIMb11ZyXxK1Gk1HxHbNph0IFcHWhVjwQuY7pjRaZUiwhVCJbM2AkiqDRIZt5/saDlIdCOhHQhuXOoqrSds2SrLJlSZY6WFSMYC2qLWEZMtyRJLwdIs7E9pQjEIgUI2z/YG4UjVIBsm0L5EpERg3Bx3YdKjtm0FkLaguWPYnlDH8JTBZTLeNhVscWEQByTJPgTKlZ/sFEEOdlaot55JUTdR/aZQo+Rdp2QxpusElEwvP8A0RUuB2pjoxdUCciUkeVi14SSsOg+GMqkNuQOWFtEshNQ1A0FA4G4UjKLBCSsY+ekoc5VaCyzZUIVWDNqK52y3TfLnfFCR+cZQhNF2X7H4J2zZJScxBPxGw+IJaLkujYnEzsXbTaK80HKvhnG5fWN2o6ucIIwUqxcEl7cCbVecPsfgnbLmnHAQxnGXFpDxuj3EmJtT3j6JhU7iwTjcd4jqHQOgdDAdA6B0sIkWWH2PwTtkzRXN7oNS5yeBTRxSSZLuEQdkJ1wzv8Aj9egtIOQCIk1E1WzvO07TtO0rUYylyQqqgdEspSrBJWJ0zpHSOkdI6WC6R0jpnTEZOnMfg2cqjfDJZOcBIkRu2O4Q8t4l8kvkl8kvkl8kvkl8kvkl8kvkl8kvkVVGW1fMnbNvrC1lvG2orotfzGr8f8APoUwnKomCeZnmeZ5nmeZ5kdmeZ5nmeZ5iZOUx5JNCcVZ5nmeZ5nmR3Z5nmeZ5nmdWKGn8hZIG5wbhSMTkYiSSSS6BOEomxDcOCSSScHMULum9hVaQm2k+8ZJJJJqNxcVUmSSSSPHaRVPPxN894qoMpOF/kZ7lD+Sh0HV5mLEuLCTSeX0UQfLee4Ot9GWwm0ktnX9yOr+W6juRniCwn4O84KmjEfF/8QAKhABAAIBAwEIAgMBAQAAAAAAAQARITFBUWEQIHGBkaGx8MHhMNHxQFD/2gAIAQEAAT8Qo4lHEqLlcpIFGLbTnQBVAWIpow+zBLECVdFCC1xM2EEQEoNJTHmxTWpjiY4mDaAFT2ht1OsTrE6xOsTrE8OVcE6xOsTrE6xOsRrX7QRqY4mOJjiKZ4vSdYnWJ1idYnWJ1iCcTrE6xOsTrE6xOsQRQ3McTHExxMQy8jmVKlSpUqVKlSpUqNjGsbbD5SjiVKldxeBqOVBD1zf478GRmhQAg9fwyOFUWLFs3MYy9dJqCLQF9Dudu3ZdzHC6uAyygtV1WfavxBWYAH1+k+1fifavxPtX4n2r8RLUafep9q/E+1fifavxLJoX8/SfavxFQxQhpjbEUnjsiMKiqrlXudu3YoJEIRCCipbLWoYLr9rpGr6fpGhyH3xPtX4n2r8T7V+IUQBW/D8J9j/E+1fifavxHiPvxGttT2zpKPt+0W13YWDKQQiwE1X3O3bt+CTR6PRIBBgAGD/tRup2pvYvl7vtHcdTx/vs+i47w48aRns+575+O4z3p8E3P/D86kbqdqb2L5e77R3HU8f77PsuO8GdGkZ7Pue+fjuM96fBHU/6buq81/EjdexNc9m+WXLly57BLly46nj/AHLn0XHeDPrx2ezly5c98/EuXLiz3v4Juf8ATx1B/EjXM0xl0WpeNAp50buWeNHjR40Dc+qEt1o3Z40eNHjQMDOvLrPGhmv/AFHurqpZjeN6pk39UZfekeNHjR40O1NXdxKDf1Txo8aKOfVEauvLgmbf1Qhjf/w91IzUhoruVuPr+ol9dG/V6S3H1/Utx9f1LcfX9S/H1/UTQ6N5bj6/qW4+v6luPr+olmOvPj0luPr+o2nK3Okv0u5yjl1glbj6/qW4+v6iGPpz+pbj6/qW4+v6luPr+o2l336eEFWj1luPr+pbj6/qW4+v6jXj156HSWdvr+ov5or7IL/1arOZd91G6k+g4dnsHy932DubPH++z63l3b77KeJ7Tue+fiGnc1+L8HbosKtaxcqoznhtECgpANUMZRfDqgA2HCIOINn/AEal1WaXdFYRRCwu0F4hn3SVaAROmMUy4qjg40BdseaQuwrXaaaGC1lAVAFG9dacaQbpgqAec0fR8sxzMczHM85quiY5mOZjmLJ4/wBzzn1/Lunxcp85xMtvE85jmY5nv34mm8xzMczzmvZn8E84KlAsLSyrNSMCB+LdK7dMeAQ+dSDGIkq9LztSDX/Q1Gdj4KzdPWnClC4uV2t6Ni80BgRkYHCs0xhW3VspeLuiA6BEpGAsdWDPqItXY8EvWlGDDaJmp1NGgIhKN7eZCdK3iU3yVn7UwuJk223f+6l8YLAWPcUpSaSs6duxSUVZvVgX4Bq+USC7xgPk/uJU3ev5Vzc3juXdfgC6SRw5szqY50dpPQIW2dY1BjZu3XcgQrltd8t/K4ov3XYohKkjr3S3PalKMnsOHyOXpBQqhSEo0Ceq+Uel5s90buH1Ruzr2dOCUf8ALqNu4KthVGnYDSyuwcOIYDjtTGT6PlgJmBWrss6dPqaEhYjYw07PouCUCzC9E1F68vT6qM/K39OmkyTx/vs+75dh+4W6+Hd0+2iOEDYjSPM1MCmmDbxN+fHSW6Jq3o1omznRjvxfkhodjqwrWuOk0Y3EB4/ueF/Qm5/0+dQ/xI1z4QHi5ls3K1qi6RuDn6PlmsWxonjN7fiDjs+i4Jgng7ATW/Z/lpVVVW1ezZ4/3PFB4iFBs2PF2P79XHUXTGy46cKwczhWVEJ44MVKVEMjJFTZAQ2R7MNNKChq1pLXJVkNYrfp21ZRhdHhJaIyD10Zb6wwfELwZQ0Buy+jbZ2b+qX6Ra2mvx/gg4SdCi5UxQ8N/wADqv8AgaNVBuOJfZfaFfxI3LW0sxWIMqREwhQjocS72hSuTLEK1TUSkj3HgNRJhwYbo385S0XO0POLUfHMRw0harKSFUocguELgvQWj3gEANAMHhMWfupnP00aCSgYzmHdjKeE9MFRI4OLi0KrJmcaiRADqmQrBBYSlXEzhjQ3NNcBqlg55YzYKWWakpl0FmVI00jzCnW4ONij+0HcAA2G08/jxlSsBY2uq6sPSNUo00rOsaVKaFVz0f8ABmoyEbybMbIKBdaGqjXAlfTCTNITAgcxmFHOBpm866icWqR2yYADLaFXLJzILSQJBRd2JrCH8WGUM2QTDsy0iSpdjsMIsHoDKo4DxOCos6Eun5mC4mqghWVaxC0EDk3fUUUWusQXZmGtAVq1grMvwXyIOu1C1pKDWxOOAXW0FdSJ4QKKaBOMrBAbTWMTjC1HQKGUDCqEsihrKcyjv/AjdSXNbA8T2m6uj5ZYBej18Y4MCVCqXV15PpFQBDiHNPkvosKNp13cvSLqmodPYgsVAF7QBrunAJt1IV3TRy69J4n2m5P73Y/rtznPifabMvtK87p0niZQqwWQashkG/Is+Ixkd/iMioNN14IuT1udwtttiATOyEPEP6vSZLa2tvjN1dT4Jfl9oUyLzfwGp+dqjSVC9EvWVRx32JnlC4FBZaH5NxBVZNIWMKsHacbSANCkcwWCGcfKZmrRZqttLSJRrNIOxWmUAhhlJCgDIwwWLGhAlcDUELlgBIsHUsLQY5xMEKLLndh9MuwoiF1zVACIPG6ETkeClPWXRwhcpaMxJq7caFLiH5Md4V0CBCoNCY6nS8CMgvRi+RluDALejKasC9RvMIqhNMDUj0YHGNAwFgWZACKNCTKUIS2ytHB/AjdSfQcJiCh5XWa1MRWQpBPNOyqbhgW7+cbrl1xb6f3D2Cj4BihxWP8AZ7BFIVo2N+ziVRqSGtHq+MCjGudSfc8u8f0hY87EcTQaFRvrhghdAbAj5j1nHYxjCZEwnnNDVt0qz9SkhK6b/pHC2BbKKVsuxqouAg6nvr7w6NWa3jfDBi+ORKnkRH3tLAS0FNiUrop7jJkyRJJNkJV0FAmQGl12uDF0FiS2u7Q+TiBZVKRpOqk6O3x6I1cU3h9kdUsNSkaIbSnC02pbzVc6HaZUH5SU8GW5kaFhxfEoyIpcGjR8SadEmfdrNXhaLPOJkDUEXn5EUFIvQMEdSrLFDU1luOJA8UAM9AWqx2F1pCtIIIgLWi84maf1y5p1abVdK9Ma0Pbstg0wLhoq8130bqT6DhNJkTVH5gwLOob/ALjkysA5XEeCGBeDgR79yocjrEgtYIiVVf59cRaHVrOIIoUMWXTn+/aWGNylr4zTTE+p4e8f07Te6Ms0+1aQAxUKFFjik1x8evYaTuo5aaJe5W3rmJpL58a0gKhTboQb4XoHbl/qACFwCjQ7F3aBXP2U4loBTNq7Q184MGXzx/s4w61OcOjbkWll1367EO0Cuw4jNEgKBtpxAlK1olkZqPaV26aKpWBKKXaYjE36W1ChURoXQjbwDCFIAACICIiD3QbrF9DZHEDWhagDLD6OTZ1v+vWKFGpso6DsZTC3N56R5at5ZMGTZE48YhAtLpe8xMRaeP8AfYvt7u+f06T2kuKkNI2McuSrRib2NGnXdMyavSWFb8nI+MXAOxDXV+IKabTU3Jq8R8H8WjV7L4Jp2G/g/EX29kUBLGgK+WpKqAKAolFQQH+JmUG8KuULgsEUvJC4D/EESNAqVFVtRNZDdArhIDNwYaRDp+KOzQdXNwRzATuTxIb0ZNAKU1CQkTJu230+73JkyYizUgUzwsVt5xA71gw3qBXpFCGF5jNkDa1bwtLchAp1MLCGwzVMrk1jZfSzEVQ5ZBLUlimjXE/wyAkV8JczKpIp4Gj6xVpis0NvTGCcCdOuUXmdzhY27oiIHW50hXqLeCACoBrR649YVafiEv8A4TV64cZfSMhFZVXeEIYVZd9Y2oATjjzgkGCgsxGilThpIFwd0a00NoOsu5aZqJyv4DV7T4I69jo+D8T7fhDl9+Mw5QQALWib8RgFOkNP4dEO/lVhYbeDAqUG5fCaEz5hUVJTidiiob1sgAoKOndRupPoOHYFkmKPlmjN1Nr1P67ClyiteOsUw9QCtFMViq1vLDj4GaqikpfyC41dqYhq0bHMWXJbjKGUzelFZgK+XJRXBobsHcFlBAswG7aBrZlr6O7QFDscVQKHFhRb2IBAELMJfR72nie0g0xUrCi7B45/MsB++O7FrqvB4wWAL4OYBGxq3q6Hwv8Acu+zX4vwfxaNTGClCF5OZaXi7EyCZ3vrcDDo8IZiLuoBXX8TpDxRW9ge2gSENxIaL/8AKqmcjVEy1u/4EbqT6DhLM06Fw0ySnhqx2AXbcZ1xg06+8A8cgFU7PnNZZYK+rjORgOIKojbUQEBe2JealULigLYBBTiw3kuPJZYlbSd6GtsFSjLYDUkBQUC3LbaYTgWeSBNkGNQMtYNY0MXcXIUltBgSigBrEFKyxVWvhp3tOjPa9mk7GJtuYRZ6kJSlcKAwWvZi99vpHOoNSwmBolfHHjEL0WdVuvTp7zCIKWqNDmARQjkTR/h0aiFIotJhvPpX5n2P8yg5vtmI2UKbVRLqWP8AExYE1vFRFoFOtshaEWpbSoG223cv8CN1J9Bw7PYPl7NSHWqUEHXvK2zv4+UVovw8JqAHPWUjeZc3l6ufxFtA5QvnT7vN+slN30Uc63t4zBsMFFARxROdbdUHde0iWGK5trsFvq5LgXYNA4ZiQ4Lxv0moVpXBtK1bs0HACIeN3cu/v273NXjPg/i0avbzPb9lwgaI1QyhLJCyuQFJTpqEFccaaGSNoafxUu6lfwI3UgdpyELcfSB02j5YMKNhrQ4gNZ9UwC6lNXd48xIYyuNCoMc7cRqFW6RFEtBEgU5ocMbsAi3frLcfSM+1+run889b0bcfSU8PSBhI336dZma4T6sUrKvPEssvSzaPqgbOaywsbKwLKyVho2x8fOuIIDftMF0gdFqbdCW4+kFZr6X8Bq9tM69v2XCNk+0zDRMDmBVLMFhqy2klqUENdouLo/40bqT6DhLdjbW5bx7Rbry+e0sgLnrLgkKGrsGDPmnrKJLnK04eUVh03gbq8axKFbrDCWYNg1y03I+L0u0A96qJ25JtMuIRIVgRBmAWWKcg47hMmTMcTIBUL8K5FFm6F4EXkV7pCy+ZS/oQK4QFFeCuxjerF9agn0QOsEBrCjpv53Krsu9TK6vFxcGjo3jfb0400YS1QJWVuD+LRqp1NYAUjix4nN2XvuxPpqrRqQKz6fyX/EjdSfQcOz2L5ew18Y4pDreq5f628bW6LPOOTzgJBWqadX8H6u7feJlGMAu4uq3JYB4v9QdfGhFyusH0tu6uDftGDGZpKKn0Q95ci7AGX4l48oqpOpsHSZxYLL5fx6zx+XXwgGC1C6CLRdMZNPDt1eI+DswlGvjsoq2DmIRZIExFQ7HvICDEyHUUKioSMKXV1Bs/6NT0NDHVoWhbBJYIvFiDCJvCQ3joCuhBt9FEhTSHymVok0J2uXaT9g6I4nsT7swIq669IKGorrWJvbWesCgKprRgZqJOqc7+7fnFr4oOf8lnxmUex0irPgArrBzEJdN1tmXxnwn2XEXcmVT69usXEIKUYzgiNBds6TPEEhLsqHWkN0P28/mYEiNup0hp+5wFrhz+ftSsFRdMffuJZz0mvxfgnp6zGUXXOdKijhEW1WCNXD7csqS3cFEeAy2B4ent3gG6BUlD/o1cbCpCFsruDApdQTeKa5MOygMUzcmxdrRzKzMcVXWC0V260VaNHhjBNnKF/FCIqlVVhzavJ5gVD1mlLKxR1VDQgvvSPTAarwDdb/em/XsbDLUiLBfmV9+YFtPAzP6Ckt2HnFtAu8adj8wICrbY25fLjsaxNkLCtTO/GJjAsAMDTS6q/F1g0srH43WDZ7jIxSVWXLFUrPDc4V4abxVdMQJEfXoLbi1a5zFxEafWsYbY6HrNnONTzmpeAHs6J1OxlNbxZcq7bNdPV9YUNEpSNhpmvXsYDMOKuwpxKXdZ/wCnUGESHpkUUw5hImHCNAMB0IYOLRGk1XEWqjUW2FoESD5jRzRb2VuZVJ2gPYPl7MG0s4ZYloUHBxAUBlcQi09Vm43c8+m0VOApBgPPiHu5gINllYlqBAth18I58399g+3u7v8AXZzuQ+jCxW2HXzXB7zR7B9DdGtttYfkdom03cFdG3nKrs1eL8H/do1V3kbqT6DhLoVwdYwWKMu+dudSDe5geXt90gV2VZXyPJ5HPBt8AcP8AgQ+TzDYfWWuK4yNQIaqpdUZzx0KRfTF46awEVAlFKs1vwn1fLs/uDtSttCxULdJaKsCQcjp4g3fK4eKRZYsRMIm8V9lJ25NUYeLpKQdEXHG7f2PGByBQCgl+Mvqxmp/oln0giJY7JLuk5S1rpx8dJdJtxi+2fUiUTSwp0P8AxNGpG6k+g4TSumOHxN/OAFDUfL25c5oujsHwQwn0HBLA5hIZFTq5+qfHl2ZV95lqApeudc7z6vlFGUO5+uAum2LSKEGAOy0MFDAqxQaAwG5Y5dVdza9c3oK7XNZQHAfmdCj73Puf5n2P8z7H+Yl9FXy/GFR9Pzn2P8zm+n1jVX3vGGLxLAaHL/4mjUjdSM1VW4Qv/KZPg26sLqLPFTytkjgOen5gD8H7gR9HvMCo3ug6xo+j3jrPVf3GX4hNT56fEBTQ3onjL/yll3k+rsf1Bf1AqXxYZN/5S3+kr6biX/lL/wApf+UasrV26T6iX/lL/wApb/SItNxt0Jf+Uu3V0v8AwjUjWkg0rhNUZozpA9jWlhYjUKNVeltVvK8V/FGx5EDcD9OYCfc9Z98/MEm32jxn3z8y37nvEiYUignrK3LwPhN2r0qB1gx64EfmLgDOweBMPdfoYXREf9dC8+dOnflP9dP9dP8AXTx97uJ/vp/rp/rp/roPk+XBP9VLnrV2f+EakdZuCLBazWJquj5ZbzLcy3llvLG6jolvLLeWW8sRTLrz2Z4q/q7s4ZYwOjKDY9IDTNOJTg9JTg9JTg9IWkb7dJTg9JTg9JTg9JRwekIuJrx0IjgIPI/7J1NGbvHuo3XtTexfL3faO46nj/fZ9lx3l14jPZ9z3z8dxnvT4Juf9vHU2jWhXFFmhvPgjIDBsWnKLHVFqRSNncOSxXeq77bdcTnd/UNhFRxAt1q6Hs5t2R6jwWDhNhPUcqura5ez5WxnA9buPnz4mTgPm7ELIFDYIEwuvc+fPitc99k+Em0bVZV8oLEk1Np5wyVdW69nMJu+SlGNTIsM2aAs506drhsToR4uBAdAkL5w+0zuT58+IpM7Ey6ELAocp4wfNPcnz58Dd2+1GBlKzxKO/BXILzswZzbYELdQAVU3nS9dIkPZPnkiRczDqBWKx/zttpBrT4CgjY3pgjYYSyM7KgFlV7FqMIEaqYCbc49SFUsMJuMPNhxcloyDQdBNQg6FiGVlZWVhEZdtgd9MJQ1DRw5mSVgAxnV0mA2NIM4yAC6pIXkSxlZWVlYAmY7xodeZQC2CdOCBq5ZyO1RpApawKtDaJe7QXAFBYDVIEhnLEGVlZWVlWS3veeJkFxYNWUtA09kagYShh1GBkIXLckFYCOaxNMrKysKQKgZgQLh5QAAVhoMECgDI0nZoog3eUjCovEEb1WRhb/1rYsCZkA6I0jtB37Tw2je6nEDwPcoy1VTGlC9qnsO8QgRwjClWtHFAMAa+cBr6aTThTGWhVENIWU9AYWz19b72KvMeFdeGa62tQkchMjlwmoM4vKurxvwqIY0JwVhSNId5sgnFS0RF0GurQgVwSeChKyRqgXiUwM53UpXABLL2CzNd6t+G+jUibgFAWmmKA8iamofJFrNTDHKwsqjSKiLmuskIBy/9bmVNCIdiBRXeQbxcrsStpUACjTvaytVWJQ2gSqO+CLBiVtLgRus98KYlL0lDYEK2/wCT/9k=", null, "data:image/jpeg;base64,/9j/4AAQSkZJRgABAQEAYABgAAD/4RXaRXhpZgAASUkqAAgAAAAHABIBAwABAAAAAQAAABoBBQABAAAAYgAAABsBBQABAAAAagAAACgBAwABAAAAAgAAADEBAgANAAAAcgAAADIBAgAUAAAAgAAAAGmHBAABAAAAlAAAAKYAAABgAAAAAQAAAGAAAAABAAAAR0lNUCAyLjEwLjIyAAAyMDIwOjExOjI0IDA5OjE4OjEzAAEAAaADAAEAAAABAAAAAAAAAAgAAAEEAAEAAAAAAQAAAQEEAAEAAACMAAAAAgEDAAMAAAAMAQAAAwEDAAEAAAAGAAAABgEDAAEAAAAGAAAAFQEDAAEAAAADAAAAAQIEAAEAAAASAQAAAgIEAAEAAADAFAAAAAAAAAgACAAIAP/Y/+AAEEpGSUYAAQEAAAEAAQAA/9sAQwAIBgYHBgUIBwcHCQkICgwUDQwLCwwZEhMPFB0aHx4dGhwcICQuJyAiLCMcHCg3KSwwMTQ0NB8nOT04MjwuMzQy/9sAQwEJCQkMCwwYDQ0YMiEcITIyMjIyMjIyMjIyMjIyMjIyMjIyMjIyMjIyMjIyMjIyMjIyMjIyMjIyMjIyMjIyMjIy/8AAEQgAjAEAAwEiAAIRAQMRAf/EAB8AAAEFAQEBAQEBAAAAAAAAAAABAgMEBQYHCAkKC//EALUQAAIBAwMCBAMFBQQEAAABfQECAwAEEQUSITFBBhNRYQcicRQygZGhCCNCscEVUtHwJDNicoIJChYXGBkaJSYnKCkqNDU2Nzg5OkNERUZHSElKU1RVVldYWVpjZGVmZ2hpanN0dXZ3eHl6g4SFhoeIiYqSk5SVlpeYmZqio6Slpqeoqaqys7S1tre4ubrCw8TFxsfIycrS09TV1tfY2drh4uPk5ebn6Onq8fLz9PX29/j5+v/EAB8BAAMBAQEBAQEBAQEAAAAAAAABAgMEBQYHCAkKC//EALURAAIBAgQEAwQHBQQEAAECdwABAgMRBAUhMQYSQVEHYXETIjKBCBRCkaGxwQkjM1LwFWJy0QoWJDThJfEXGBkaJicoKSo1Njc4OTpDREVGR0hJSlNUVVZXWFlaY2RlZmdoaWpzdHV2d3h5eoKDhIWGh4iJipKTlJWWl5iZmqKjpKWmp6ipqrKztLW2t7i5usLDxMXGx8jJytLT1NXW19jZ2uLj5OXm5+jp6vLz9PX29/j5+v/aAAwDAQACEQMRAD8A9+FQXxmFlMbc4mCEoduecelWBRQBn28ly13cDLlFACiRdoz7EDp+dWIpJ5IwxjiHUfePr9KsVDa/6gfVv5mgBcz/ANyP/vo/4Vlz6zNBcyw/Z4zsOM7zzwD6e9bNctf/APISuf8AfH/oIqJtpXRvh4RnO0i5/b0v/Psn/fw/4Uf29L/z7J/32f8ACsrvS1l7SR3fVaXY1P7elz/x7J/38P8AhR/b0v8Az7J/32f8Kyu4paPaSD6rS7Gp/b0v/Psn/fw/4U2XxDLFC8n2VDtUnHmH/Csw9Kiu/wDjzm/65n+VCqSFLDU0m7HZZn/uR/8AfR/wozP/AHI/++j/AIVKKK6DyzBGvykuPsqfK7L/AKw9iR6e1L/b0v8Az7J/38P+FZK/el/67Sf+hmnVzupK56kMNTcU2jU/t6X/AJ9k/wC+z/hR/b0v/Psn/fw/4Vl0nej2kh/VaXY1f7el/wCfZP8Avs/4Uf29L/z7J/38P+FZdHcUe0kH1Wl2NaHW5pbu3g+zIDM5XO88YUt6e1a2Z/7kf/fR/wAK5ez/AOQxp/8A11b/ANFvXW1rBtrU4cRCMJ2iV5pZ4YJJTHGQilsbj2/CpxyAahvf+PG4/wCubfyqZfuj6VZgLRRRQAUUUUAFGKKKACiiigAFFAooAKhtf9QPq38zU2ahtv8AUD6t/M0ATVyuof8AISuf98f+giuqrj9UJGq3OCfvD/0EUKn7T3RSxSwq9o1cb3o5qrubP3j+dLub+8fzp/U33I/1gj/J+JZ5yKOaq7myPmP50u5v7x/Oj6m+4f6wR/k/EsnpUN3n7HN/uN/KmFmx94/nUVyx+yy/MfuHv7UfVGtbh/b0Ze7yb+Z6AKKB0opGhxa53S/9dpP/AEM07mqu4iWfk/66Tv8A7Zpdzf3j+dP6o3rcz/t2MPd5NvMs80c5qtub+8fzpNzZ+8fzo+pvuH+sEf5PxLXNFVtzf3j+dG5v7x/Oj6m+4f6wR/k/EvWf/IY0/wD66t/6Leutri9OYnW9PyT/AK1v/Rb10Wo6oNPnjDbDGR82TyPek6fs/dKji1il7RK3Qt3v/Hjcf9c2/lUy/dH0rPW9TUNFluIxhWjfj8DWgv3R9KChaKKKACiiigAooooAKKKKAAUUCigDMgtboXtyxlZImB2twTknPfI46dP8amETyaW8Su29lZQwODnJ7jpV2obX/UD6t/M0AZ9rHqaatmVh9hEJGCQTv+XBH/j+fw69srUEVtUuSwz844/4CK6uuU1GRV1S5B4+Yf8AoIpPn+xuOPsL/v7cvmOtoNPlfZKJI2PQ7uK1P7Asz3k/76rBDBjwa3dJvd6+RIfmUfKfUUo1p3tJl1cBhnH2lJJoDoFpuHMn/fVDaDZKCS0gA9WrTdgpDE4ABya5rVdUa6cxREiEf+PVvBzk7XPNxEcPRjdxRFdf2dESsCyyEdy2BWZdkG2lwNo2Hj8KkPTNRXP/AB6y/wC4f5V02sjyOfmmtEj0AdKWqOo3MltEhiZQzMAAwzmmabqf29p18pk8ogZI4bjtXCfSnKdJ5yef38nH/AzVmB7TdieKQD1Rv6VVP+tn/wCu8n/oZozXcleKPmpy5aj9TorfStNuk3xSuw/3uRUo0Cz3HmT/AL6rnYZ5LeQPE5Vvauj0/WI7ltkuElx+BrGcZx1TPQw9TD1PdlFJh/YFn6yf99Vm3dtp8D7I/MkYdfm4FamrXhijEMZw79SOwrnywBGSK5ZVp3tFnsUcBh+X2lRJIkso1Gtaeygj963Gf+mb11jRo5yygn3FcnZSKdZ08D/nq3/ot66+muf7e5MvYX/cW5fIrXaKmn3AUADy24H0qwv3R9Khvf8AjxuP+ubfyqZfuj6UxC0VHLPHCFMjhdx2jPc+lSUAFFNR1ddysCOmRRvXeU3DcBkj2oAdRTFkR2ZVYEocNjscZ/qKVnVSoZgCxwPc0AOopruqKWYgAck04HIyKAKV9qcOneX5sVy/mNtHkQPJj67QcVPbXAuoBKsciA9BIu1vyPSsbxTC81nCmIpImlUNDJAJA5yMZyyjHrmpfDd5DNZNbx26W5gO0xxxLGo+gUkD86ANqobX/UD6t/M1IJEZioYFh1APSo7X/UD6t/M0ATVx+rf8hW5/3h/6CK7CuP1X/kK3P+8P/QRWtH4jhzD+D8ymOD1NW4JijrIpwymqRIXJyAKpXF8T8kRwD1b1rarR9qtNzz8FmP1Ofvaxe6Oj1HV/tSLHAxCY+Y+p9Kyqo2UuJNh6Hp9av1UEkrGOIqSqTcmJ2qO5/wCPWb/cP8qlzxUVz/x6y/7h/lVS2M6fxI78qrD5gD9RShQOgA+lKOlFcB9QcEf9bPz/AMt5P/QzRSn/AF0//XeT/wBDNFd8dkfMVfjfqFMZxGCxOMU+qN7LlvLHbk0N2RMVdki6tKWJnJfPQ9xUgu4ZDnzAD78VlqpmkCrWnDaxwgcAt3JojSjDXqwq42vXfJe8Y7Fuxljj1fT5HkUIJWyxPH+reuu/tGy/5+of++xXKad/yG9P/wCurf8Aot67Wuat8R7WXfwfmZ95qFm1lOq3MRJjYABxzxV9fuj6VDe/8eFx/wBc2/lUy/dH0rE7zM1rTZNQjg8oIXicuN5I52kDp9ayrTR9WidTMYpEEjFU+0N+7B2nIwoyeG4469ea3NSupLWAPHjOccisr+2br/Y/Koc0nqbQw86iuitHoWpQgxxGJF+bYwmb5Msx6Y5zkZ9Md6nbSrtC0UShwGjcq8jKrqEKldwBP3vm6VuWkxls0lkIBIyT2qZHSRA6MGU8gjvVIyas7HNy6RqqyzvA8P78EHMrDblYhu6HJ+Rvz61FLoOqSh/3kQZZWeJzISVyrDd90dMjj2611dFFhHM2mkX1vKJrpy8SRy/uVkL4YiMLj5Rn7rn6tW9YRSQ2FvHL/rFjUNznnFWKKYGP4i+XTi21mBYKQM4HPU4qTQdraXHIITGW9Rgn0pdctprvTWigGZCwxiNX/RiB+NS6TBPbadFFcAiVRzmUyfqQKSAbb6aYbi4dpNySljgcHk56+2cUttYwmAcv1b+M+pq/UNr/AKgfVv5mmBH9gh9ZP++zXK6lCsepXKKWxuHU/wCyK7SuP1X/AJCtz/vD/wBBFa0fiOHMP4PzMa4s2fJR2J/uk1nEYJB4IreHBqlfW+4eavUferujLoz5mtRVuaJRjOGGDgjpWtC4liDd+9Yw4birlrN5T8n5W61E1yyv3N8PP2lPle6NHAxUdyP9GmP+wf5VLwRnIqK5/wCPWX/cP8qT2ZrD4kegjpRQOlFcB9QcERmaf/rvJ/6GaMUv/Laf/rtJ/wChmiu+OyPmKvxy9RkrCOMse1ZEjEsSepqzdzeY+0fdX9TUNtEZrjkfKOTTjq79jOs3CHKt5F2yt/Ki3sPmb9BVnApcdqD2pt3FGKirIn04Y1vT/wDrq3/ot67WuK07/kN6f/11b/0W9drXHW+I93Lv4PzIL3/jxuP+ubfyqZfuj6VDe/8AHjcf9c2/lUy/dH0rI7zP1iN5LZQiMx3dAM1h/Zbj/nhJ/wB8GtfXyRZLgkfNXN73/vH86aw/tPeuZTzV4V+z5b/M6+yjP9nRxuuPlIIIqW2gFvbpCDkIMCq1hIU0iJwpchc4zjPPvVi0uPtNukuwpu7Gla2hop865+5PRRRQMKKKKAAUUCigAqG1/wBQPq38zQl1DJNJErHen3gVI/I9/wAKjSeK2sWnmcJEm5mY9AMmgC1XH6t/yFbn/eH/AKCK6qG7guHdIpVZk+8o6iuV1X/kK3P+8P8A0EVrR+I4cw/g/MpY5oKhgVIyDR3pc4zzXWeGYs8JhmK9u1NQ9q0r2LfHuA+Zf5VUtbUzHc2Qg/WrdpR1OOKlSqpxJreaTATYzgenarVyjfYpm2HiNjjv0q1CY1QKoC4ou/8Ajzm/3D/KvOnXqRfLY+vw2W4atD2qnd+R1ovGx/x6XP8A3yP8aPtjf8+lz/3yP8atCipNzgtrMZX2N80shx3HzmqdzJKAR5bIvcmtVcbpf+u0n/oZpryLgjg1UK9ST5UjKvluFpw9rOduv9I55j2rTtYRFEAfvHk1btNDN/I0sQChOx6MfSklieCUxyKVYdjXcmrcqPmZUqjl7WS0ew3FJgZFLR3FAyfTh/xO9P8A+urf+i3rta4rTv8AkN6f/wBdW/8ARb1uaxDqDyA2SzZ2HLJIADweME4z+H4iuSt8R7eXfwfmaV7/AMeNx/1zb+VTL90fSqH+kf2RN9p3eZ5bfexuxjvt4z9Kvr90fSsjvKWp2T3tuI0YAhs81k/8I9cf89UrpKKuNSUVZHPVwtKrLmktSrb2YXT1tZgHXbtbHep4okhjEaDCjoM5p9FQ9TeMVFJIKKKKBhRRRQACigUUAVBYx/aJZnPmeYu0qwGMZzj3/GljgWXT2g+6jBk47AkirVQ2v+oH1b+ZoAr2+mR2941yHYsQwAOMDO3P/oIrnNWAOq3PH8Q/9BFdjXH6qf8Aia3P+8P/AEEVrR+I4cw/g/MpYGegpRgdgaTIzVywsXvZcdIx95q6m0ldniwhKclGO47TdON7ONwxEPvH19qbqViLG6KIoETcpx29K6by/ssKJaxoxHZn2j88Gs/yJ9S0uL7QkayBAyssm4k478CudVnzeR6ssAlRsviOdwPQVHc/8esv+4f5VM6mN2VhhgcEGobkg2sv+4f5V0S2PLp3U0egdBS5zVDUraW6SJI1UgPlmLkFR7cdaZpNtd20TJcvuHG0eYX+pyQPyrgPpzlDzLP/ANd5P/QzU9raSXcoSNM+pxwKhyBPOeP9fJ1/3zV2LVriBNsXlqPZBXbryrlPnXyOq/aPS501paR2tskSqOOpx1PrTLuwgvAVkQZxww6isD+3b3++n/fIpP7dvd330/75FYeyne56P13D8vLbT0I73S5rNiSu6PswFUsYNaJ1y8YYLIR7qKpzXBmbLLGD6quK3jzfaPMqqje9NsfpwH9t6fx/y1b/ANFvXa1xWnH/AInen/8AXVv/AEW9drXPW+I9XLv4PzIL3/jxuP8Arm38qmX7o+lQ3v8Ax43H/XNv5VMv3R9KyO8WiiigAooooAKKKKACiiigAFFAooAKhtf9QPq38zUSahC0kiEMoTPzEcHBwcfQ0y3vrZYADKAcnsfU0AXq5LUo9+q3Jzgbh/6CK6MajaMMidT24rnL2ZH1C4ZdxUsMEKeeBSc5Q1iVGhTrvkqbCQw2ivmZpWHooArXh1Szt4xHFC6qOwFYXmDPR/8Avg/4UeYvo/8A3wf8KzlWqS3OungMLS+D8zoDrVvuHySflS/23b/885PyrnTMgYD5snOBtNL5i+j/APfB/wAKnnka/V6Pf8TTvZ9PvPmaORZP7ygVi3sIW2mKNkbG6jHapzIPR/8Avg/4VFdOGtJgFckoQAEPp9KuNeotDmq5dhJPne/qdyKKq/2haAEmZQB9aUahaEZEy4+hrQ5jjxETJMcjmaT/ANDNL5J9RTlkG6Xh+ZXI+Q9Nx9qd5i+j/wDfB/wqfrFVaI1WU4OS5nu/MZ5J9RSeSc9RUnmL6P8A98H/AApPOTeR82cdNpo+s1Q/sjBf0xvkn1FJ5J9RUnmL6P8A98H/AAo8xc9H/wC+D/hR9Zqh/Y+C/pjrCMrrWnnP/LVv/Rb12VcfaSquq2LsGCrKxYlDgDYw/rXTHUbRRkzqPrTU5T1kRLD08O+SlsPvf+PG4/65t/Kpl+6PpVG7vbd7OZFkBZkYAAHk4q8v3R9KZItFFFABRRRQAUUUUAFFFFAAKKBRQBBFaQwzPKikO/XLEj1OB0Gfaku5Xgg3xxqx3KCCccEgVYpCARgjIoAzzdGLUUtkiQRu2Djrkhmz9Plx9TWhtHpTRGgYMEXd0zjmn0AJtHpRtHpS0UAZslzIIJZfIj82OTYgJHQkDPOPyq5bSC4tYpsffQN0x1FPaNGBDIpB9RTgABgDAFABtHpRtHpS0UAU7qZo7iKFVjZZOGU9cf4U21umlu5INiBEztx1GDjmrbRRuwZ0ViOhIzilVEUkqoBPUgdaAF2j0o2j0paKAI5j5cLuNoKgn5jgfjWa95JHBFP5Ue9zhiAPujvgkVqsAykMAQeoNMEEQUARIAOQNooAcACAcUu0elLRQAmB6VRluR9seB0jdFQsMdQwwcH86v03y03Fti7j1OOaAKthctdRMzqoIP8AD06Zq5SKioMKoUegFLQAUUUUAFFFFABRRRQAUUUUAf/Z/+EPXWh0dHA6Ly9ucy5hZG9iZS5jb20veGFwLzEuMC8APD94cGFja2V0IGJlZ2luPSLvu78iIGlkPSJXNU0wTXBDZWhpSHpyZVN6TlRjemtjOWQiPz4gPHg6eG1wbWV0YSB4bWxuczp4PSJhZG9iZTpuczptZXRhLyIgeDp4bXB0az0iWE1QIENvcmUgNC40LjAtRXhpdjIiPiA8cmRmOlJERiB4bWxuczpyZGY9Imh0dHA6Ly93d3cudzMub3JnLzE5OTkvMDIvMjItcmRmLXN5bnRheC1ucyMiPiA8cmRmOkRlc2NyaXB0aW9uIHJkZjphYm91dD0iIiB4bWxuczppcHRjRXh0PSJodHRwOi8vaXB0Yy5vcmcvc3RkL0lwdGM0eG1wRXh0LzIwMDgtMDItMjkvIiB4bWxuczp4bXBNTT0iaHR0cDovL25zLmFkb2JlLmNvbS94YXAvMS4wL21tLyIgeG1sbnM6c3RFdnQ9Imh0dHA6Ly9ucy5hZG9iZS5jb20veGFwLzEuMC9zVHlwZS9SZXNvdXJjZUV2ZW50IyIgeG1sbnM6cGx1cz0iaHR0cDovL25zLnVzZXBsdXMub3JnL2xkZi94bXAvMS4wLyIgeG1sbnM6R0lNUD0iaHR0cDovL3d3dy5naW1wLm9yZy94bXAvIiB4bWxuczpkYz0iaHR0cDovL3B1cmwub3JnL2RjL2VsZW1lbnRzLzEuMS8iIHhtbG5zOnhtcD0iaHR0cDovL25zLmFkb2JlLmNvbS94YXAvMS4wLyIgeG1wTU06RG9jdW1lbnRJRD0iZ2ltcDpkb2NpZDpnaW1wOjY4M2NlNDBiLTg4ZTEtNGQ5OS1hYzIxLTM4ZDQwYjAyYWEyYSIgeG1wTU06SW5zdGFuY2VJRD0ieG1wLmlpZDoyYjA3NjVmOS0xM2ZhLTQ5ZTctYTI3OC1mNzg5YjNhNjczMGUiIHhtcE1NOk9yaWdpbmFsRG9jdW1lbnRJRD0ieG1wLmRpZDpjMmI2NWMwMi1mOGM0LTQ0ZjYtYTAyOC1iZTk4YzM5MjVlYjAiIEdJTVA6QVBJPSIyLjAiIEdJTVA6UGxhdGZvcm09IldpbmRvd3MiIEdJTVA6VGltZVN0YW1wPSIxNjA2MjI3NDk0MzYzNTQzIiBHSU1QOlZlcnNpb249IjIuMTAuMjIiIGRjOkZvcm1hdD0iaW1hZ2UvanBlZyIgeG1wOkNyZWF0b3JUb29sPSJHSU1QIDIuMTAiPiA8aXB0Y0V4dDpMb2NhdGlvbkNyZWF0ZWQ+IDxyZGY6QmFnLz4gPC9pcHRjRXh0OkxvY2F0aW9uQ3JlYXRlZD4gPGlwdGNFeHQ6TG9jYXRpb25TaG93bj4gPHJkZjpCYWcvPiA8L2lwdGNFeHQ6TG9jYXRpb25TaG93bj4gPGlwdGNFeHQ6QXJ0d29ya09yT2JqZWN0PiA8cmRmOkJhZy8+IDwvaXB0Y0V4dDpBcnR3b3JrT3JPYmplY3Q+IDxpcHRjRXh0OlJlZ2lzdHJ5SWQ+IDxyZGY6QmFnLz4gPC9pcHRjRXh0OlJlZ2lzdHJ5SWQ+IDx4bXBNTTpIaXN0b3J5PiA8cmRmOlNlcT4gPHJkZjpsaSBzdEV2dDphY3Rpb249InNhdmVkIiBzdEV2dDpjaGFuZ2VkPSIvIiBzdEV2dDppbnN0YW5jZUlEPSJ4bXAuaWlkOmJhODA1ZmQyLThlOWYtNDg1Ny1hMmEwLWYxNmUzMDcyNzk4OCIgc3RFdnQ6c29mdHdhcmVBZ2VudD0iR2ltcCAyLjEwIChXaW5kb3dzKSIgc3RFdnQ6d2hlbj0iMjAyMC0xMS0yNFQwOTowNzowMSIvPiA8cmRmOmxpIHN0RXZ0OmFjdGlvbj0ic2F2ZWQiIHN0RXZ0OmNoYW5nZWQ9Ii8iIHN0RXZ0Omluc3RhbmNlSUQ9InhtcC5paWQ6YjQ2ZjRlODAtOTNhMy00N2I4LTkzNzctYmIyZjgzMzU1ZDI0IiBzdEV2dDpzb2Z0d2FyZUFnZW50PSJHaW1wIDIuMTAgKFdpbmRvd3MpIiBzdEV2dDp3aGVuPSIyMDIwLTExLTI0VDA5OjE4OjE0Ii8+IDwvcmRmOlNlcT4gPC94bXBNTTpIaXN0b3J5PiA8cGx1czpJbWFnZVN1cHBsaWVyPiA8cmRmOlNlcS8+IDwvcGx1czpJbWFnZVN1cHBsaWVyPiA8cGx1czpJbWFnZUNyZWF0b3I+IDxyZGY6U2VxLz4gPC9wbHVzOkltYWdlQ3JlYXRvcj4gPHBsdXM6Q29weXJpZ2h0T3duZXI+IDxyZGY6U2VxLz4gPC9wbHVzOkNvcHlyaWdodE93bmVyPiA8cGx1czpMaWNlbnNvcj4gPHJkZjpTZXEvPiA8L3BsdXM6TGljZW5zb3I+IDwvcmRmOkRlc2NyaXB0aW9uPiA8L3JkZjpSREY+IDwveDp4bXBtZXRhPiAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgIDw/eHBhY2tldCBlbmQ9InciPz7/4gKwSUNDX1BST0ZJTEUAAQEAAAKgbGNtcwQwAABtbnRyUkdCIFhZWiAH5AALABgADgARABdhY3NwTVNGVAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA9tYAAQAAAADTLWxjbXMAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA1kZXNjAAABIAAAAEBjcHJ0AAABYAAAADZ3dHB0AAABmAAAABRjaGFkAAABrAAAACxyWFlaAAAB2AAAABRiWFlaAAAB7AAAABRnWFlaAAACAAAAABRyVFJDAAACFAAAACBnVFJDAAACFAAAACBiVFJDAAACFAAAACBjaHJtAAACNAAAACRkbW5kAAACWAAAACRkbWRkAAACfAAAACRtbHVjAAAAAAAAAAEAAAAMZW5VUwAAACQAAAAcAEcASQBNAFAAIABiAHUAaQBsAHQALQBpAG4AIABzAFIARwBCbWx1YwAAAAAAAAABAAAADGVuVVMAAAAaAAAAHABQAHUAYgBsAGkAYwAgAEQAbwBtAGEAaQBuAABYWVogAAAAAAAA9tYAAQAAAADTLXNmMzIAAAAAAAEMQgAABd7///MlAAAHkwAA/ZD///uh///9ogAAA9wAAMBuWFlaIAAAAAAAAG+gAAA49QAAA5BYWVogAAAAAAAAJJ8AAA+EAAC2xFhZWiAAAAAAAABilwAAt4cAABjZcGFyYQAAAAAAAwAAAAJmZgAA8qcAAA1ZAAAT0AAACltjaHJtAAAAAAADAAAAAKPXAABUfAAATM0AAJmaAAAmZwAAD1xtbHVjAAAAAAAAAAEAAAAMZW5VUwAAAAgAAAAcAEcASQBNAFBtbHVjAAAAAAAAAAEAAAAMZW5VUwAAAAgAAAAcAHMAUgBHAEL/2wBDAAMCAgMCAgMDAwMEAwMEBQgFBQQEBQoHBwYIDAoMDAsKCwsNDhIQDQ4RDgsLEBYQERMUFRUVDA8XGBYUGBIUFRT/2wBDAQMEBAUEBQkFBQkUDQsNFBQUFBQUFBQUFBQUFBQUFBQUFBQUFBQUFBQUFBQUFBQUFBQUFBQUFBQUFBQUFBQUFBT/wgARCAEnAhkDAREAAhEBAxEB/8QAHAABAAIDAQEBAAAAAAAAAAAAAAEFAgQGAwcI/8QAGwEBAQADAQEBAAAAAAAAAAAAAAECBAUDBgf/2gAMAwEAAhADEAAAAf1RE0NSKU37LRcgCEhZAAAhQAAEgEBCgAAAACDIAEEgAAAAAEJKgARE0MI4zFc5ysXoACJPl2r27nDbxMgBGJlQGJkEt935zobJByuPpX6X0MkE0BjGVACCY1vbnfQtnlgCkOrAAAAAAAAAIiaAAqC3AIk+R6f0F55buJkADEyAMSSbLvofK9NYByGHrW6P06IJAMTIAGJkmrs836Xs8YAcsdSAAAAAAAAARJNoAFQW4BEnyPT+gvPLdxMgAYmQBiSTZd9D5XprAOQw9a3R+nRBIBiZAAxMk1djm/S9rjADljqQAAAAAAAACImgAKgtwCJPken9BeeW7iZAAxMgDEkmy76HyvTWAchh61uj9PECQDEyABiSmtsc36XtcYAcsdSAAAAAAAAARE0ABUFuAQfItLv3nnuwSADEyAIJIS86HyvT2Acfj61uh9OIJAMTIAEEmr78v6ZtccAcsdSAAAAAAAAARJNoAFQW4BEnx301brLyxMgAmK5AEEg6Hy3+oUDj2NN7aKIJAMTJCgQSa+Pt9Rw2okm0csdSAAAAAAAAARJNoAFQW4BB8Y6PyNx782CQAYmQBBIjp+R951L0A47LWoOt8QAAMTIAEEnlqdv6rpfS8HJunXHL29SAAAAAAAAARJNoFVJ6nhbbFFJZ1tL8Y6PyNx782CQAYmQBBIjp+R951L0A47LWoOt8QAAMTIAEEnnqdr6ppfTcVjKavpi8xXUgAAAAAAAAESTaBzWLWyx9WXUHHec4H1x+3Y5fIdfqdItj7aNz7aGYBgmajXvlz+1xq735utn49Rx/u+pegHG5a3P9b4jYw9tvz3b3W6tl5b0mC5oUectH49Kv8dzQ9PH6d7c+IkHLV1IAAAAAAAABEk2gRIKm23MYEp8j0/oLzz3cUsPTU6/c+f8ASh5HolN7c3juh8v45eUySy6bkfd9SzhZOOy1qDrfEAIt9fq9dpfSe2Pt6qNfHPkdPv6Xns5Lq7HM+l7XGAHLHUgAAAAAAAAESTaABUFuARJ8h8OpfeHUxw9Mrbj35fUbXGlfJKr35nFdH5SEgkR0/I+8sZ6c7cehKfLwoOt8RiZIUnrj7dZofT33h00vH6nervLehGevq7HL+m+2gAOWOpARKoAARAmiFIUCJJtAAqC3AIT4x0fkrj10M9TvbHJ+59PHo9bufP2frp1HrpcV0vkMLgCkmOm5H3npj6U9x31889eh63xBMTJZITFeh1O1b837DmNP6Hz2OVr9X4aNri+Gt1/qul9MAOWOpBXed+eeuHe4XQWtyl6VEWZpy2deKUkXNvonkdCqoklYqQCoLcAg+MdH5G39+bBnhs7nz/6jt4bHS9H5LhOn8fhl4wksoJEdRyPvOpegHHZa3P8AW+IAAGIWs0PorXU709j4LHLzk89Tt/VdL6UAcqdUCs88vhGflXMvqeF+a+uE4ZfScsKPH03cXzfK9Kx304G5fWL52uGXd5WbcZPhUyt88PsEyAqC3AIPjHR+Rt/fmiTPW6/txP0fQ7n5n6bHOljKiDKWE6fkfedS9AOOy1qHrfE4sZUAYGj5bVf57Pj0fk/ZNvDZsMNvU0voe00vpQB4HaAgiAoQVcWdkyqCSTEqy4tGGM+O291Z1agVBbgEHxjo/I3HvzYSDC+dL57U+O9ebHOyuIBSTHTcj7zqXoBx2WtQdb4gASQectHr9LDa4/ls8Sy8t6z8uhmy8tTt/VdL6UAcqdUDxl5/X6yBe7HL2csAAAAEKESfGpfn1fpzLHzxyWa624BB8Y6PyNx7c3HLHTy1an35uEy9Of8AWWefhv8ApqyogkR0/I+86l6AcdlrUHW+IKQAlX47mjMvLofKb+G3b+PSEr5anb+q6X0oA5Y6kGtM+F531Ak7Pf8Amsb445YWcyWgAAAY4z5xMvT0w+iY3j5dnPHSmVoAQfM+h8jabXGq/Xn6nprIWZavX9tTvXmzzM7Jlgm2Jj1PI+86l6Acblrc/wBb4jFjLOUHnjnReHR8935309dLoNbtSYkmGp3Pq2l9KAOWOpBrY58LofUJZrs975r3njRevj0uPotAAAAiT5hhlWe3n9jxzgkqC3AIPjHR+RuPfmwaXppUvtzVxTL2531u/ljZ+ulComkdPyPvOpegHHZa1B1viBBIKrx3tF5+XQ+VvtfsbWOwIJPLU7f1XS+lAHLHUg8Jlyep3ZhXTbPF28/FLNhQAAAIk+WY5e3ph9OxyUKgtwCD4x0fkbj35uJ6TKq9efVe/NiMvDqe2l37vY0PbLzAmXpuR931L0A47LWoOt8QANfD1pvHo+O78vtenhe6/YhcplhcJPPU7n1XS+lAHLHUg1MvD550/iVI7zm/Y2WG5BIAAAAIk5zHKu9Me1lAqC3AIPjHR+RuPfmwSEovfk6mesX15/1Ozj7XXvoZTKLiTpuR951L0A47LWoOt8RlLhZC0uv0fD01PHe+Z6Dw6+1hswggk8tTt/VdL6UAcsdSDUvj8663wqFnfcz7XW8dzRuPUslAAAARJNoAFQW4BB8X6PyNx783EyBq5a9DsccmXjv+uj9NuemvZ+uplYjqOR951L0A47LW5/rfEDBlU+G9r4enl0fldyW68erMyi4iCTz1O19V0vpgByx1INS+Pzrq/ChZ33M+10fHcscsd+ZKAAAAiSbQAKgtwCD4x0fkbj35uKZKJlo9jkaPpqSeul9Llr9H1tt8Pfaw2ffW7PRqBy188dnj6eXlV3y8svLHY4/nt8O/1u1sT0KMlwibPLU7f1XS+lAHLHUg82NP78wC28ej7T0AAAAAESTaABUFuAQfGOj8jce/NgkGcz1svCg2eNgwmet78/8AqNrz/sc8PSUuuj8t09gHIY+tZofTCLjo7vzFB9H+TbOPpa+PSkyZQghJXy1O39T0fpeRTCuyjl7epAAAAAAAAAIkm0DUjKtEt40Das9F+MdH5G49+bBIBCU/tztL00rvX6u9rdzZ4v6BnrdlZddD5bp7AOQw9a3R+nSeO5wvDs/nvpn4Xmt2ed2uGuMkAhJXy1O39T0Ppfnlmin1FeYt6kAAAAAAAAAiSbQKiKdPS3qo+Yed1Pfz+s45fGOj8lb+/NKQZTPFh53Hzy89nH2gg9tfqvHf6TV7PUswOOvnR7PG8/fmx785HYaH1F5r9eq9dHkt/wCX1fTWErATz1O19W0vpgByx1IAAAAAAAABEk2geUk21hbngeabUvxjpfI3HvzYJC5S4sev0PqNfPx5jd+dgEiXp+R931L0A47LWoOt8QBdavY7TR+nyXzTzvnyO783S7XIEEnlqdv6rpfSgDljqQAAAAAAAACJJtAAqC3AIPjHR+Ruffm4qYSySdNp/Q9Jqd/VuPDdT4jwz8IM2eMnT8j7vbx9KJOvrmfTWoer8Rseez0Or3Oj1e1mqPOvQgpvbm0O1xqv35+F8/LU7f1XS+lAHLHUgAAAAAAAAESTaABUFuAQfGOj8jc+/NhCo6TT7/Van0FIckvWe3N47pfJYsclS9NyPu/HD0oLOmrVz16HrfETLKgDEyAIlixcfLU7f1XS+lAHLHUgAAAAAAAAESTaABUFuAQfF+j8jce/NhJl6XT7/Uan0Er5FcWqczt8Pl9352ZiXqOR951L0iRXH5a/P9b4gQSAYmQAIJPPU7X1XS+mAHLHUgAAAAAAAAESTaABUFuAQfGtvg9Dl4bfnt3ev1bDy25tHmegIkrfXTodvjaeer0eh9N1DMDjr40e/wDMpQAMTIAEE146/S+p6/ZAHLHUgAAAAAAAAESTaABUFuAQnyPT7935b0SSSQCCQCDIhLvo/L9PcQOPx9a3n/TyQSAYkkgEBNXZ5v0zZ4wA5Y6kAAAAAAAAAiSbQIhZUrbgESfI9P6C88t3EyABiZAGJJNl30PlemsA5DD1rdH6dEEgGJkADEyTV2eb9L2eMAOWOpAAAAAAAAAIkm0DlsWFk27ZXlgQnL+O9uY+sEgArixAIJCbfvz7KyrLQqplreHQkgkArzfJAIJPLPX6L11dM2TMkvwAAAAAAAACJJtA0Yys3F8TTkrzoakgAERUkFjXuAAJedS1NSLi2bIABWQs1VvQACV1yvTXxt5lPRQAAAAAAAABETQAAwjnk50+iWZMgAIk5yK9bbJfAAERwyWZgdUqgAKHF45Y8xMvpVkqABpnKSRjn1GfnYMgAAAAAAAABEk2gAARCpAAAiAk2gAAQSAAAAQImgAABETQAAAAAAAAAH//xAAuEAAABQEGBgMBAQEAAwAAAAAAAQIDBAUGEBESIDUTFBUxNEEhM0AlMCMHJGD/2gAIAQEAAQUCvkyERWW6qt6DT5vON4kf4sfx4/sV2RzcGjUxlJRG6LT4dT6dFHToo6dFHT4opbSHGOXaHLtY8u0OXaHLtDl2gUdrDl2hy7Q5docu0OXaHLtCz8Nh6kdOijp0UdOii0cRhiDy7Q5docu0OXaHLtDl2gcdocu0OXaHLtDl2hy7WPLtAmG+rdOijp0UdOijp0UUQiTL/S5uuikeOPegu1532b2S+1G3aj0+wnedFH8/9Lm66KR4496C7XnfZvZL7UbdqPT7Cd50Ufz/ANLm66KR4496C7arN7JfajbtR6fYTvOij+f+lzddFI+ge9BF8arN7JfajbtR6fYTvOij+f8Apc3XRSl4M8UcX54o4o4o4oJ344o4o4o4o4o4os1sl9qfim8QcUcUcUcUcUG6OKOKOKOKOL88UNrzVrRR/P8A0ubropf1D3oLtqszsd9qts1Hp9hjexJlyodVVaDhShR/P/POnpgpiTEy0ObqItZjzZzcpp1Ypf1D3oT21WZ2O+1W2aj0+wzvYfo0qS4VkV82Qo/n/nrSC4dEjL4TFPZhVYcFbdbo7Tx1gUhJGwlZJDTsVRlEjqHIsDkWByLARCYMuRYHIsB1mIyT8qOQN7EYfNmdjvtXtmUgTmAalIIMKhSByUcciwFQmCHIsDkWByLAXFjIJ12OSnDJYQkirOij+f8Anwuc3UYDC6keOPcaUqOpCyWVyOwmVBMcOOKdVfZnY77VbZojVFxgMSUPku954mUSJKpCvYTvOij+f+lzddFIP/h2HsQJXDVcjtPnFHIzxMHfZnY6gUtQh1x4odLqjdVjWq2wZixvbcU0uNUUv3YibI47g9meASf9nRR/P/S5uuil/UCWZGSiO6DI4zYlSyjMqUa1Agr5vszsdbiTJrUujzJTFnKKqhQ7VbZdhoMQ6mpsTpRE0FKyjOeJ4mGd70Ufz7qhNap0Oztril0hmrwpMJFo6bIhUa1cKoUBmtQZMOXaKO5FnVyn0k5VVWitFVoZwZdep0B2ZamNEtAdfpqZ0itQI0il1E5Tn+Dm66KZ9Q9l8DuUZ7gOypKYzS3FPKBDDRZnY77VbZowuMGeUkyVpUmUhd3sMb3oo/n3VIsafGqbNNo8bCTT4FTpdal06bF6NXH2J1Lq7CY9fdnwKLaFCkKrR1WPH/8AH9els06sHMQzWo6slGorSTtjBPPa24xX4blJrVmHIUutXubropf1Yj2EngbjhNJRJOQZdtB/F1mdjvtVtlx/GhQkuXdwl9aAiUtRpUsw4qQmp8xXRzFdHMV0cxXRZ03lP34DAZRgMBUqemoxiL4wGUYDAZRgKbTkwEXK7SV1x2s02oVKVIvc3XRS/qHvHAOOE0SnVOqQrKpBkaLzPG+zOx32q2zUtWUlHmNVzMXMCSSbmN70Ufz7nVZG+qqHVVDqqhHc4zX+tsGojloai1T40qKpa40ua1CbiTGprbm66KX9QM8A5KSkLWazHcRF/GqzOx32q2zT7lOYqPsIzON3sM73oo/n3SPovheLOnN0+PTppVGB/kYrz0iBT7Pmt1ZCvpwdoy1SI66QnqfRUjoqR0VI6KkUdvhxlsqMOMOEd5BJ5TSZLTgMoNOAMhlFmdjvtXtmAyjAYDALPIk/kKDTfEWSSIsBlGUMb3oo/n3SPovheK+WLVnGVxqB/naSO8xWrKRpMmpXubropf1D2/Hz6En8Rl4Hpszsd9qts0yV5lndGayou9hje9FH8+54szXIPjkHxyD4ioNtj/W2MuBGdsmVUcXe5uuil/UPeIltfFyTHYNL4iNFmdjvtVtmh9zIgKMR2+Iu/G5je9FH8+6V42YxmMZjEDxP9anGqMpyk2Uh0mZe5uuil/UPd0hrgrBdi7NO8NRYKBmQ73WZ2O+1W2DEx3BnlJxZuKMwYYb4SL/YY3vRR/PulePfT/DqcdT6LPLechfgc3XRTPqHvC6Q1xEAgVzD2Qdyuszsd9qtsuM8pOu8QwfeM3mVdhd7DG96KP590rx76f4dXpZ1RMRhxhv8Dm66KX9WmS1kXcXYIUpJoNwyJBmLPzJaKRz00c9NHPTRaGVKdhmgyC+MF57lfAIJTw03+i7hne9FH8+5aCcR0hgdIYHSGA00TLf4nN10Uv6h7uMw63xEEWW4u8eJiWUkldZvZL7UbddhiT8ZtROsqaOI1io7sL/YY3szwBVeU3UKVaiJUSFH8/8APIlNRG2JLUppzdRz7BGhxLiRS/qHsr8RKbwMixNhkmiI8oI8xXWb2S+1G3XGrAGeIaZN9b1HyJWRpVo9hnezHITJNTiU6oOwiLAUfz/zz3mWBQsyo8aI7Gqx9ihswTpLjbEoUwv+WA+RgMBlPDAG1xkohnGVh8YXEtRDOoWa2O+1W25lA8TGAwFMhm03lMTICZBPxnI6sBgPkEMAxveij+f+dbaXUoQltLm6g2UGGozTJil/UPdxnjdTIXBTV4+qzOx32q2y+nwTfMrlhxpLqZVNW0d3sMb3oo/n/pc3XRS/q006CYb7MyGagw+0bDoIvjC6zOx1KbIjrbtSxmiympjFqtsDcdx0RaUSQRERXLvk05D4dpjzYU2pCgxveij+f+lzddFL+rRT6fiCD0mU0uzsuYmDMjHKjg77M7FXpE5suA9HfoUV5hm1W2XYmMTGJjEwZmMTGJjExiMTxDO96KP5/wClzddFM+oexApwwMYGE44UyAdOj4GKhAM9FmdjvtVtmo9PsMb3oo/n/pc3XRSkmbSY5mEQ2sWCiRxzjI51kc6yETWcOdZHOsjnGRITDfD0UkmbZkdmdjvtVtuQxkMZDGQxkMZDBoMZDGQxkMZDGQ8chhojKtaKP5/6XN10Ujxx70F21Wb2S+1G3aj0+wneNFH8/wDPiCDm66KR4496C7XnfZvZL7UbdqPT7Cd50Ufz/wA9aQl96kI4INiqHJ/qCdLqcJj+oP6gi0KoxUdLqQ6VUh0upDpdSHS6kOl1IQYtRmx+l1IdLqQ6XUh0qpDpdSHS6kKfDqdPh/1A3OqS6l/UFSg1OosdLqQ6XUh0qpDpdSHS6kOl1IS4tRjDpdSHS6kOl1IdLqQ6VUh0upAqPUil/wBQTJNThxEKqi0f1BS4T0Vf55cNqa1FiNQmg88hhuDMRUYztabZka2KkzKmTZxQjYWbrWqXWm4jkiS3FjQ6kUteqbNTDEOYie0zUzflan3ijtQ6gUxcyrohuoWS0/rUklFSj5WnSCWlku2plo0VqqcrJXRG3Gqdqqs3jSKr/wC1T4TnO1TVV56oLVMWy1FTGb5vVKdUwxAcIp8p5UKXT2DjQf8A5j//xAA3EQAABAIHBQcEAwADAQAAAAAAAQIDBBEFEBIgITFRExQwMjMWNEFSU3GRFSJQYSNAQkNggdH/2gAIAQMBAT8B/wCka34VpCm5mQ2Deg2Deg2Deg2Deg2Deg2Deg2Deg2Deg2Deg2Deg2Deg2DegNhuWQVzXGymsiMbBrQbBvQbBvQbBvQbBvQbBvQbBvQbBvQbBvQbBvQbBvQbBvQbBvQRiEpIrP4SE6RcU8grmuNc5caO5S/CQnS4p5BXNca5y4vgI7lL8JCdLinkFc1xrnLi+AjuUvwkH0i4p5BXMdxrnLjR3KX4RymVQatkSZjtG56ZfI7RuemXyO0bnpl8jtG56ZfI7RuemXyO0bnpl8jtG56ZfI7RuemXyO0bnpl8jtG56ZfI7RuemXyO0bnpl8jtE4eGzFq191xTmxLaaDtG56ZfI7RuemXyO0bnpl8jtG56ZfI7RuemXyO0bnpl8jtG56ZfI7RuemXyO0bnpl8jtG56ZfI7RuemXyO0bnpl8jtG56ZBqlFUgdlSZS/CUj3g+MjlK5E9FXGornV7VHlMHh/a/dw8DB4VUh3g+MjlK5E9FXtxqK6ivao8SkD/t+NeakhVTEIw6i0tBGYVRcKrJJByikIySRjdmiwNBDdmfKQ3ZnykN2Z8pDdmfKQ3ZnykN2Z8pBbUO2U1JIORMP/AMbYN81f5KpHKVyJ6KqkumnwINxTf+2yDCoR7AkkN2Y8o3ZnykN2Z8pDdmfKQ3ZnykN2Z8pAoRpWBIDdEtHitJBNGQqf8kYiYZlkptpIvwkJ0q32CdLDMGRpwO7ExqWMCzDri3jms7iOUrkT0VXWI9bXPkG3kOlNNxCDcVZSGWEte9R5CO5S/CMRbDSbC1yMIcS4U0nVMRbE/vTci4smSslmDOZzuo5Sq8TE/ARHRVebcU0dpIho1D2Cs64VqwU/GqYdiGmS/kURCJiWXyImlT/CUj3gwhxTZzIxC01EM4OfcQg45qNTNs8QZTKQiWtmrCqKiSh0/sKUa1GZ1EDrRylV4SB4qtCI6Kq5XYWPUj7XcRCI2pkvwqjaQagi+7ExEUzFPHJJyIG4tZzcOYorBZ+3AIp3Cxq8J1eE6zwxB4VePGpHvB1sPrhnCcbMQMWmMatlmH29qgRL5Q6ZmHXVvKtrzvo5SuRPRV7cAimchBRbsHyHMhEU60hn7S+8OOKfVaWddFdRXtwE8xBOQ8xfoJzISOyfuDzmWgxNBf8AgPMFy/8Av/0ZGoFjIZkR/sHmoweZEFZlcPIHwaR7wdyjI1UG8RnynmHotplramYjnVRDm11BXJAylUjlK5E9FVZ4XWUBSiSm0YecN1y2YS6tATELPwCFmrMhRXUV7f1v3cPhUj3g7i1pSQhY5T/2LPIKKZA8MKyB1o5SuRPRVfIpmCKRCPfn/EkSmGoeeJgiJOVVFdRXtwElM5DcC1G4FqNwLULTYVZLjHkMwWJcCke8HVMiDkQksgtRrzCF2FEoNrJ4rZB1Er6OUrkT0VVHdaR4h93ZItA1TOZhhqeJicq6K6ivbgI5yHhW/wBU6kqtFxT1rK9SPeDCkKVkYW0shKVcA9Z/jMGUwpMjqLEZGDl4VI5SuRPRVeSUzGRCNdtqseAbTaUCKRVSqorqK9uAjnK4/wBUwnMNlIpcTQxLlLTg0j3g63mCViQlKpJyOYYd2jdog8nCd5HKVyJ6KrzaZEIlzYp/YOZnMMN2U3aK51e3ASclTMb2zqN7Z1G9s6h1RKWai43gPbg0j3g6zlIPtT+4qpTEE/YOwoGR5BxNk7qOUrkT0VXW02jGQi3jdcDDdtU6/CuiudXtwHemYtq1FtWotq1EKc2SPj58Gke8HcMplIPN7I5D9AsDmIZ7aon4habQ9xaIsgZzqRylcieioZC0YPEJKZhKLBCMe2TeGYz/APQy3YKQldornV7cB3pqrPIQnRT/AGKQ7wd19FpIOqEe2TmOQ/ZBbc8QcyrRylcieir2rJJmG27OIM5ZiIe2zkxDtzOZ1Ed2iuor24DvTVWeQhein+xSHeDrLCoimH27JzHsDEG9bTYPOrZG5gRAqHil4pSCoCKzOQJNkpHcW2bqTbLxCqAik6A6HiU5pCodbPMkFiYj35JsJEscA2VhN0sc6qK51e3AUVopD6awPprA+msBCCbTZL+xSPeDumrDAOJtkJWc6mlqQuaRRcE1Etk+4YQ0hvkKo8grmuNc5VmklZkKXZhWmrasFeAdSq19whkWvuOuV2iudXtUeGYy/t/qv9V0j3g78SjG0CIzORBpokYmIKOcgl2m8tBCUmxFFgcjqPIK5rjXOQ8BMRtLtQpSSc1CKinIpe0cDbO3VZIg9RZFi0FJNOCqsrtFdRXtWfj/AGvAeNZc4/zVSHeDu2cJ1G1tishMNsDsq5hKosDmGaTimcjmPr0YekvYEdorVxbhtJNacyH16MPOXwHaQiIjmWDxzH6FHw+yTbPM6oiEREYnmH4dbJ/fcLCqiuor2/CUj3g7pqtD2EDCbJO0VmKSZmW1TneRylcieiq5BQZuHbXlcWhLhSWQiYBbZ2kZXaK51e34Ske8HVK5AQZl/I4VS0ksrJh9s2XDRURCVSOUrkR0lVIh3XOUQ9HJR9zmYIiIpXn4JD2JYByj3kZYkFNrTmQxFFc6vb8JSPeDuwMFP+R25GQ+2RhmMSOVxHKVXgMzmInpK9qpmLR6i0eotGLRi0YtGLRi0rUWzFozqornV7fhKQ7wdf6EFA/8jpXo2Dt/e2DwzrRylcieir241FdRXt+Ei4CIfdttpmQTQ8Yf+ZBFCOf7DNHbEvtSNg5oNg5oNg5oNg5oNg5oNg5oNg5oHaNJ3NAcoaILkKYOi4tOaQkpERXHkmts0pzH0yL8g+lxfkH0uL8g+lxfkH0uL8g+lxfkH0uL8g+lxfkH0uL8g+lxfkH0uL8g+lxfkH0uL8ggYR6HUZupl+EhOlxTyCua41zlxTmI7lL8JCdIuKeQVzXGucuL4CO5S/u+A8bzUUbSbJEN+XoN+VoN+VoN+XoN+XoN+XoN+VoN+VoN+XoN+XoN+VoN+XoDjlaA8TncSqydob8rQb8rQb8rQb8vQb8vQb8vQb8rQb8rQb8vQb8vQb8rQb8rQb8rQPRBvZ/ish4f0z/D+I8TMFfViZcE8uGfBLMjCSkX/Wf/xAAtEQABAgMHBAICAwEBAAAAAAABAAIDETEQEiAhMDJRBBMUQUBQYXEiQlJggf/aAAgBAgEBPwH/AIj0Ajie4gq85XnK85XnK85XnK85XnK85XnK85XnK85DAaK+VecrzlecrzlecrzlecrzlecrzlecrzlCJNfpIm7WFMDqa0Kv0kTdrCmB1NaFU/SRN2sKYHU1oVfpIm7WFMDqa0L6QdMIn8prwm8rwm8rwm8rwm8rwm8rwm8rwm8rwm8rwm8rwm8rwm8rwm8rwm8r8YJXsl4TeV4TeV4TeV4TeV4TeV4TeV4TeV4TeV4TeV4TeV4TeV4TeV4Q5RgCDT6SDs1jXAzdrdRQWNzQ+V7lgGYnbB2axrgZu1uooLBkmmUkPk+5r1K30ULHxHtMgV5Lx7TY5Ptdx3Kvu5V93Kvu5V93Kvu5V93KBeaFCG/2Vc/K9I1wM3WXZ+06GfRThEb7V9/Kvu5V93Kvu5V93Kvu5XccPaPUOHtGPEPtMe51T9JE3WtfdKBnhZCLs0GhtMBrgZuwvhA0RaW4CZBOcXWwqn6R8J7jNoRaRWyShullghQ76GWE1snRflM3YiA7Ip8Itte6ZtDHOoExjmn+Q+CPhwdiutNQonSsdRRYToRX6THTFkNl8oCQxGtnua9STN2OtVEg8KIbuS/KhQXPKb0rGoNAoF1Oeg6ioiZVRojkjlVe7J5kKimm1IQzoq0XrWg7LXsa8XSosPtOTDIpjL6a0NGM1wM3aMWGItUzpDeQaG0t6ig0H7Uar/JPKfMtKO6f4TRS9yv7FAfxITp3j+lW5/4hkpfyeEM5IZNn+U0ZH94G8LnRg7MEeEIrUyG5xkVBFxstA1wM3aDygJlNbdCuhXQpALqKD43qWAV0oOzAGzT4YGYQy0DXAzdoHNQm+7C9TnZ1FBoHILuld0rvIGes0ZlCiOhB2WhqGScJhESTDjNcDN2NxTGzKHCcZYOooND1gZtRMkRLU/VvvHB2oFAtwRWIZYzXAzdiNLITbqdkjng6ig0PWBu1OGSeZmep/ocr/X50YOy0Okq2vEimnEa4GbsTiobZmx5w9RQaHpdty7bl23IZCWt7XrRg7MDTbEb7saZjCa4GbsLjJVUNshNPMsXUUGg2quhSCuhP3a0p1U9GDswtM7KqI26U0yNkrTXAzdZKyaJmobZlUTjPF1FBoNrgiblNH18aDswtytiNvWAqdprgZuwEoCaY26nnH1FBoNrgibl7+PB2YmmdsVsrL4bVeSwLzGL84AbuaHWMK8lq7gd7UlDbYTj6ig0KLvOXecu85EzM/kQdmGSGRVbHCYzXURbpkFeJraKYHUtEwunc9xTaJ5XrH1FBYM5oZ/OnlO2DsxsKoiZqLCEUKJ07oVvrA6lsLp3PzKhwxDonOuZpsc+0DPMY+ooLB+E30ePle0M2g2u2I7rIOzDOy9dzV+8Mrf2nQGOqvEhqmACeS8OH7TYLG0sKivnlYyIWpj72LqKD6SDsxxYl4yCgOl/HEa4GbsESJLIYASKJkYHJ2HqKD6SDsw1UWJ6FgMs0xwLZ4TXAzcLC9oT408hjbELUIzTVAtNLOooPpIOzDFi+hghPulVwGqqv7KgkmbhZIKQ4UgpBSCkFIKQUgpBSs6ig+kg7LSZKLF9NxQoksivzaa4GbtbqKD6SHFY1sij1MNHqh6To16pV4K+FfCvhXwr4V8IR7vtN6phqvIh8o1wNMjNeRD5Xfh8rvw+V5EPleRD5XkQ+V34fK8iHyvIh8ryIfK8iHyu/D5XkQ+VFiNfkPpIm6zNZrNZrNZrNZrNZ2fpCmB1NaFU/SRN2sKYHU1oVT83+y9YnQ5ma7QXaC7QXaC7QXaC7QXaC7QXaC7QXaC7QwkTC7QXaC7QXaC7QXaC7QXaC7QXaC7QXaC7QTWXfqZqc1POXwxnoz+caIevxoD3ohewUNFujKYuo1/5n/8QAShAAAQIDAwYIDAMGBgIDAAAAAQIDAAQREiAxBRATIXSzIjIzQVFhc7EUIzA0QHFygZGSosFCk6EGFURSYpQkNUPR0+FgwlPS8P/aAAgBAQAGPwLOXF1oP5RUmJd9qWUtx/BuvF9o80OWm9E42soWmtaH1/8Agcu01LrW/wAU0obHXjrgoLDjdSbWnoVL6SaQ0liQlmUrZcKg2ykVoUU7z8Y82Z/LEebM/liPNmfyxHmzPyCHypCVETUwnWOYPLAjkkfLHJI+WOSR8sckj5Y5JHyxySPljkkfLHJI+WOSR8sckj5Y5JHyxySPljkkfLEutxltayDVSkgnGPNmfkEebM/liPNmfyxDam2W21eENCqU01WxHJI+WOSR8sckj5Y5JHyxySPljkkfLHJI+WOSR8sckj5Y5JHyxySPljkkfLHJI+WMnI0abKnFWhTUfFqjzZn5BHmzP5YjzZn8sR5sz+WIywgakImwEpGA8S0fSpfsXe9u7MbZM79flpX1HvNxraWd4L4v5L7Re7Vdy3tg3DXpUv2Lve3dmNsmd+vy0r6j3m41tLO8F8X8l9ovdqu5b2wbhr0qX7F3vbuzG2TO/X5aV9R7zca2lneC+L+S+0Xu1Xct7YNw16VL9i73t3ZjbJnfr8tK+o99xraWd4L4v5L7Re7Vdy3tg3DXpUv2Lve3dmNsmd+uMIwjCMIwjCMIwjCMIwjCMIlfUe+43tLO8EYRhGEYRhGEDVGEYRhGEYRhGTO0Xu1Xct7YNw16VL9i73t3ZnbJnfr8tKez97iNoZ3gvi/kztF7tWaWQqbSrTu08H0dEhGv8X82r/qGW3JN9pp13QodXQVPqrWmrNlvbBuGvSEVQt1a1WUNtjWowohKkKSbK0LxSeiJfsXe9vNMSjKtIthIK1Di666q+6FIQ6hS04pCtYzTO2TO/X5aU9n73EbQzvBfF/JnaL3aswbenEuSaXw+ElvxmpVoC1XCvVDLynmCpqY0+k0HjV68FKrmy3tg3DXpDLnjgpty0FsItlOro5xE4t3SUmHbQ0osqpZAw5sIZ0QVwmHK2nFK50dJzTq0Mmx4IgJoKBRtL1V//YxklzwYtNtpcbUESSmUtcHikq1qwxwzTGr+Mmd+uOTbV60xRbKU+6KhpBHqjkUfCORR8I5FHwjkkfCORR8I5FHwiq0NpjxUuk9ahHEQPUnNKez97iNoZ3gzcVPyiOHLtq9QpFNGlKugiOSR8I5FHwgeKRj0RyKPhHIo+Ecij4RUtoEUbYQesiOTQn2RGS+0Xu1Xct7YNw16VL9i73t3ZjbJnfrz9KeiARhdsp4TndFpRqbkp7P3uI2hneC6AeGiKoVWB689pUa8OjPkvtF7tV3Le2DcNelS/Yu97d2Y2yZ367mjOBwuWU63D+l6U9n7w0mULaKq4bjgtWR1CCpyXcnXtOtlPgqOUoeNrNB7zGlbQtuii2ttwUUlQNCDCNoZ3gzUuBSTQiEpVwV1+OfVxBhcyX2i92q7lvbBuGvSpfsXe9u7M7ZM79ebpz6+MM39ZwEFR1k3pT2fvDTcqtCEWvHBSikqT0AjCJVFJdtDKjWWQtQbUmmrWKYdEOS5LdC8pwaJNlIrzU5oRtDO8F8QEu8JP83RFEGpVnObJnaL3aruW9sG4azuzL6w202KlRMfvHKc7k9hlZFgNqIsf0qqeNBm2pppcqKkvBYsj3xMTLE6w+0wKrUhwEJ9cNZTefZl2yBpKuam1fy1jwpqbaclgaaVKqisA5PfZmnnHvBm6Kqm31+oa4QmdnWJZasA4sJrGTZVuwpiZbdWVc/Bs0p8YE74S2ZQ/wCtXg40jRTE6yw5StlawNUSmTFONgvtldor1g6rIp11PwjwIzzAm600OkFqvqhLDs2028pQbDalUJUcBE2w6AmZlnLCwnAjFKvePv5GX7F3vbuzO2TO/XcrzQDzc8WsScBWLSjrvyns/e4jaGd4L4isVrq6I6FdBuZM7Re7Vdy3tg3DWeZ7NXdH7MabwaUSZOonplkuBBongihGsjujLCrK5iXRlVp59GgslbdE1Njo54mFZNaS8rQWVzbaKJ6kV54/ZiYeIckZGrc2LFdE7Y4JUOr7x+089Iikg40ynSgWUuOBWtQ+IFY/ZspQEy6XHUUA1BWiNO4xldWVk2PCUo0LjjdoOIs0sD311dcfs4W5cyjZln7LCtRQOBqj90Eq/eEuUtus2TVvxuJ6om9HlP8Ad7ztnSSs5K6VqZ4NODz9Ufs3MzbSZHTSa2g3ZolLh0dEQrJE5OMNT5WbcsMnqXMKctcdJt6zz2oy8VC04lqWFTiOCf8AaMqFHFTLsIV7XDPcRcanZr9pnJVK0LbaGgSpzEGyAE6x1wuYGVpvKc6GLHjmdGlKLQ/pHPS5L9i73t3ZnbJnfru1McLmw9XkJT2fvcRtDO8GbC9ZHvz6lRxLXqjWmnvjJplW23XtIqiXVlA5NXOAe6PMcn/3q/8AijzHJ/8Aer/4o8xyf/er/wCKPMcn/wB6v/ijK5mEIbe8LFpLa7aR4lrAkDu8joyotqCgtDicUKGsGOm+7wtI684XXHKUtE/9UHuuSmUUZAo4y2popVON60qp8DqgonMleAt2a6TwhLmvooLkv2Lve3dmdsmd+u5UxrgHyEp7P3uI2hneC/WCc9V4dEUApmyZ2i92q7lvbBuGs6ldArHEEcQRxBCVYV8tkr95uqlsnFtyrukLaSvVRKlA6ueMpzGSZt1TEvKW25hmaWtKJmvBQNfCtdGuGlOCjhSCodcW3TTXQACpJ6gIK2iaA2SFJKSD1gxL9i73t3ZnbJnfrza4oOEYqTns35T2fvcRtDO8F+yObPbI1XMmdovdqu5b2wbhrOv2TcRCnnSbI5kipPUBEvNJBSh9tLgB5qivlGlTeVJKXRSjpflbQcV1JtfprhSDPyU0yhIVoJeW0RQVUUk8Y82aRdU4plht06RxH4RZPw9fXEwC6t1jSFLLysVJoOf111xLp8Km+Rc/1z0ojzuc/uFR53Of3Co87nP7hUedzn9wqH02lGzNzIqo1PLLjU4oRrqrru1GMA58Y1VjExKez97iNoZ3gzYm4TnAigzc8YmMmdovdqu5b2wbhrOv2biIV6oyay6kodbl20qSeY2fKSeUhKrnGGmHWlIaTacQVUooJ58KQxOrlnpNhnJ6JQpfTYU4uuNOqn63JfsXe9u7M7ZM79ee0njXbPTelPZ+9xG0M7wXrPMM/wDUbuTO0Xu1Xct7YNw1nUBiRHE/URxP1EcT9RCEqx8swJqSmXHCODNsqLQa9blRZhb8xPsTMitPimUOh5SevSACvPcl+xd727sztkzv13LY992t2U9n73EbQzvBd6zn6heyZ2i92q7lvbBuGs7vsmMTGJjEw35ZKZScbk2qcJWitrr1V1foYXOJU49OrRYU+6dZFa4Cg/S5L9i73t3ZnbJnfru06bnVmw+OeU9n73EbQzvBcqYrnA572TO0Xu1Xct7YNw1nd9k3G4R/ilSrKTadKNRUOivNCi6tbiNKvQrc4ym68En0GX7F3vbuzO2TO/XGNzrF2hwjGMYxiU9n73EbQzvBGMYxUmkdWe1zCMYxzY5sYyZ7a92q7lvbBuGs7vsm43DKfCFMpQu2QkAhfRWsUdfMwqvGKQO70GX7F3vbuzO2TO/XerzG7wfhGtuOiJdKMnqcSAaK0iRXXH+WL/ORH+WL/ORH+WL/ADkQ0lyRUygzDPDLiT+MR0xqbjh199wC6a5smdovdqu5b2wbhrOUnA6oxV8YxV8YxV8YCBgPQ5fsXe9u7M7ZM79d2gwika8ejNqi0v4RqFM8r6j3m41tLO8FzCyeqNfxi30QL+TO0Xu1ZpdiZlENImFKS3ZdtLFATVQpqGrpOIhlFqw+5UWbJs1/ltUoT1Zst7YNw16RbeWG04VMBxpYcQfxJiX7F3vRmfGlTVgVcH8nrgKSapIqDmmdsmd+u/a6YpHSq7K+o99xraWd4LoQNdY8T8sUOo1v5M7Re7VmlnnZJpiYaV4yebIGlRrokDH3HCJGQelBLpZfS8qYDgIoldoAc9T/AL5st7YNw16Q2XSlBKrLa1pqEqpE4jSBag+oadA1LONQP090M6WcdmqsOU0iUCzrR/KkZv2hbZRYToEnrJsq1k85jI/gU67OeEoOnSp8rFgI49nBPCsjV05pnbJnfrjGMYxjGK1jGLPOYIXygjGMYxjGMYlPUe+43tLO8EYxiYxjGNITwld0cYxXBfTFFfGMYxjGDGMZM9te7Vdy3tg3DXpBSsBSTzGAlICUjACJfsXe9vMvgJ4epWrGFFttCCrEpTSuaZ2yZ3679tfHP6QHR6jelPZ+9xG0M7wXLauTH65x64sqFRBKBbR+t3JnaL3aruW9sG4a9Kl+xd727sztkzv13tKseyMyy2baLS2jq50kpV+oMKQebNjnlPZ+8NNSsr4S85U8NRQ2kDpVQ9MSumHgweDtdIriqQoJKev/AKhLrDiXWlYKSaiEbQzvBm4KCYtOm1/TGrOPXnqOArpjUAsdUcJJHrGbJnaL3aruW9sG4a9Kl+xd727sztkzv13Q46PUnNRqSL6P5tIBD1nJ5V/jJnXpU/8AzrgLsWXaVp9rsp7P3hluTlX3krrpXWLFpA6rShrMZMmZfJD2il2nUFhS29IipTr41CTr54mHHm9Ap99T2hrWwD9+f3wjaGd4M+MYxjGMDXGMYxjcyZ2i92q7lvbBuGvSpfsXe9u7M7ZM79dzSOj1JMc0Y/pmW1pLdp516tn+dxS6fVGI+EFxvHnFyU9n73EbQzvBfF/JnaL3aruW9sG4a9Kl+xd727sztkzv1xxkD1mOHMD3RqUCekxxxHKCOUEcoI5QRygjjiNZAPSI8W4lY+GaU9k99xvaGd4IwjCMIwjCMIGqMIwjCMIwjCMmdovdqu5b2wbhr0qX7F3vbuzG2TO/X5aV9R77jW0s7wXxfyX2i92q7lvbBuGvSpfsXe9u7MbZM79flpX1HvNxraWd4L4v5L7Re7Vdy3tg3DXpEiw4LTLr1FpOCuCTQxlBhkBLTT1Gk8w4CTT4kwh7/CVShSacLnp/9Y/hPqjSlMqrhJTQFXOoD7x/CfVH8J9ULSHJU2nXHddr8Syr7xx5T6o48r9UceV+qOPKfVHHlPqjjyv1RpAZVItKT+LmUR9o48r9UceU+qOPKfVHHlfqjjyv1Rx5X6oblwZVYRzm1H8J9UPSdmVtNNIdKqq/EVj/ANI/hPqhLSlSqAHEOVFr8JrHHlfqjjyv1Rx5X6o48p9UceU+qOPKfVDNTKnSOBH4ueOPK/VHHlPqjjyn1Rx5X6o48r9UceV+qJZ+3K1ZUVU4WuqSPvH8J9UPPlMooNIK6VVzCAqkpr9qP4T6onHH1IK5h7S+LwHASn/19I0bybSccaEHpBjRspspxxqT78ynHFBCE6ypUJfbrYUTS0KHUaQpstulCFBC3wOAhR5j8R5B6XaVbW0AVEYc/wDtDSUsuTDjhIS21Svr1kQlSm1NE/gXSo+F9xOiedSzrdcbAIb9evuhb6j4tItVELbLTsu6ihLbwFadOo32xYW644aIbbxVFtIUmyopUlY1pI5oU03KvKbSsoL/AAbFfmr+l9TiqkJFeCKmHG1NOMOoAJbdArQ4HUT0GFI0TrthNtwtJro09J/6gKBqDrB9M1iogaRK0nSr1WTXW4aRPyGheU7MPEtrCDZoqmu1gKfbyD6gghvQIANNWKolnZiTdmWKK16NSrJ60UrDaXApOtVlK8Qm0bIPupfXJOImES1PGrbl3F2/6QQPjDrbKFlaLDlmyRWhrT9IXMpbdQ0Gg3V1BRU1rgb6LDa1rWbNUtqWE9ZswmxplW3DVTjKklSjrJoRqhHg8k7Lz3hNpbpSSLNqquHgQRzdd9biGy8pIrYBpWJqZbRMeDFuqy82q1a6Eg6+nV8In/EPO+EoSWtG2VVNKWer39MS7KtZbbSk/D/xn//EACoQAQACAQIDCAMBAQEAAAAAAAEAESExQRBRYSBxgZGhsfDxMEDBUNHh/9oACAEBAAE/ISVw6ayVGwBqxHMViGrNOGOWuJbESWgKcbhEfGGkb7DRLJZLJZLJZLJZLJZLJZLJQlj2FCWSyWSyWSyWSyWSyWSyWSnZEfzV2t+PiS2pbuFt1QLpe8L5Ut5d0Ru//IcrAi7RozXqOc+MfyfGP5PjH8j869oQIMk0EdwAHQJ9YmB7CfWJ9Yn1ifWJ/wAgT6xPrE+sR/8AIT6xPrUs8oGMt2fGv5PjH8nxj+RjAWNKNMbJifUJ9Yh/5CfWJ9Yn1iYHM5J9Yn1ifWJ9YmZ7CfWI3Cdp02Fm+QZ8a/k+MfyfGP5PjH8gvmIQOIG2VfF/edPGK6P04KmnY9zs7v8AFl93Txiuj9OCpp2Pc7O79uX3PxOnjF2fhn8Qqadj3Ozu/wAWX3dMJJaPjNn/AGUfGUfGUfGUQoo+Mo+Mo+Mar/2UfGIT4Ln7MWiUfGFfGUfGUfGUfGE80olHxlHxlHxlFv8Aso+MNf4dfd0yv1FtyS1MJbkluSW5JaGhbkluSW5IqLcktyRW/wAr9h2It4tyQXJLcktyS3JE2NZaLcktyS3JNTDgVGq4Xf8Ag93TxC7Pwzpx9c9/47vudnd2C1tBMalomrvFvIbjAMOiyg3ynBrkwb/Z7tlUpNRaLQ0FtQxKmy6CuNqU3NFMxTp0j0tEyUKbkvfLvmjwSnvDbsJdn4R4+ue/t3Tse92d3YrqZDrVLTtAc1FSvXJ55brvCmA22K/ad3YPtWkK1WhSgXMXdlZhzbhlajUKiMHoQ8+rWOksMq0CVRzZIGl+NxcScnVobpNooIWKhnuhCKfnkQ4VNzsEIRkG96uKEUgHUMzCfGGI1/Jsq2nrnv7T0fcnX/lwdwxRTbFwThEYzpOwQhC4eboR54BMw9DuZUxXC6/b7toFcXVZWVXGK6Jzm6whVos4/wB/eLDGjkbd6ObfvHTj657+F9u653MdQ6RODmNyey4p2wesszq+DDV/iy+7pggKRUUCa6TZwYMr10MOH9/eO8Q0hEVtd3ho4E9c983PW3Bd0tWjXnApEsgDGjHDdOTF2REzOLBRKYeSnJ4XQuCINpqQ7GkWDNbugcRpMKtgbPXgaoNLQhub9C+6y/0nTwC1CWzrMbvymkWt7L16y5bilG7vj82LXgh5+EpsogdOHrnviRbeilpS2at1rGLuUM+YDXARa9CelOYm9cd02hujOKy8bqWUlyuxXdKiIHXh70QU+agOUOE5cKnN5TpghEltr1/DT74BB9BKYhrNpa+YWaV3QhuoQjW9BU0QxEBeW0wCYtc3KslkeXsRjaqs6pBPfwXW3B5rDNE1Tg0dwWOzW2vmIapvs7QzABAbdTvxMTVNYLRb0I37lSsEfBIE6ivuLLWC36XSKDdbPMleaYIgoXsh4g27Fyz8Dp4Ra6ysJksYUAu0S1yx3JnDxkiFipXWZF6TxRJXWBPXPf2btdZUqVO9MLuEPVrCVOCK7Fb3ENKbNyOVbyyorr+Ev3ACCaD3omaE8LVULza+KUMtPkvRLtWFZDebB1aN98atbQmSGQ1iixe81imkYCGL7+Ljqh0gIFNJXsQhnsj2XHBzS2+msahGTA1RtisbRRTMioDo0I0d7KibQ1oSDHKykDd7F5vdZDS0sY3o6TU5tDpKM2lAK6MB8FHqW9108iXMtRNrUPX1BDgLIHzejDcbRRaL05xUbTqyNAa+J+B08ArTUZhHjw7uj18bVvF1m9DlwSXxdoO93Qnrnv7N0lvNXOc3G/YTY65l1N14FtNaO5zGtBVFTTLMwmZMtp9kbNmzaW7c2grA4rZvxSyVhWUrjsdaah0PE03LN5jW258NJWVlI1zMi0KC6I2AHQZdeNhVllnwPBcYawJzyUioRQy1iqF889Idt08QromTOnOWV8N2XjTscohG0sRvk4i3ekbJb7+Prnv7d04NfDgV7QiK6s5DPCpUmyMQBW34i3dSMqUn37Pt2fbsVUtsPw12GBYqmd44Uq5kuoWKWIqtuZMryTHKkNKZgJIQze2Aq90dASINqAEe/suniFJigOsKf4kyAPtBqXtlt+2SLXF04+ue/t3Ti22uVGksxVFxnoDgl1+NW7/Kcux6WF2b5fsDK9Ca+8BwAvz/ABmyZ2931w1vqR+FaihEaLV6b9IKJcHBrmK1rC2uTk1h6Egc6G7IG4CH1At5fmz4p/Z8U/s+Kf2PxT3gghyAKzLuzyHJeqPI3K6srqyurMWrYwJQhBXPNnfYX0vzlyrJ3wMWPjD7E9c9/Ze47s1rDExa98775zvsJ1caQqtW11ivGYt61uwVYBtc775ylvRzhQ9xhr8C3f1r27HpYgQtXXlNeil5gR8fyZHX1rPFlWcxauRwAtuQsBTOiErPadPEK6JpSuTnHDXC6lvfl6uo7+AeLHTj657/AMN1caEwjPJ3ZgXwO5xxd34i3d8uSHlD5b+z5/8AtKPi94VFAycK/I5odWY7eorpAc1slxlRuSnbMO26eIVcMSlUHjLaOTgqVYlqE1lJu0eDpwqp657+zdC+Bw0LGIm8sel4mu894J1qAI5pPWanug2WZ/CW7qvhYn2k+0n2Ud2Zx/Zcu/yWFPHvrTNSusGbaM2wikchps/A6eIXZwaTMBKWZHSLBCuM06tYg6JKmL9VcW2a8pdz1z39q6tqr3xw5VyIapgl4abHSUEyrvlqassSlHCcd34i3f4rl2PQ/wBmbRmK0e53SpylNZHkoF40dyneH6jphvIxaeaU0yy3NlPNlrSuYjiDEVOs8ZRueXGkuhLnOU80p5p657+zdrqlPNBwFGqtDoTxjvBekrVqesrqmtWoLmynmgZZZTzTmb/B/f5rl2PQ/wBg9t6sGghsHNcwjTMgdhyoB+q6eIVFTNa6QxwCxxeJj/8Axhpw63DXh6Mwtcdbr0h3sXMLxwNZfNLZPmH9nzD+z5h/Zd8SCnTG5px4GMXjOd3NNB7lcFTvgVo1Zv8Ac659i9FeMpkbbfird7hKVVPkv+cJfJf8l8u1f67p4hdnEug9YDb9nkzL2HEXfVltC2CWrJQEMaEPwiotEHJylhNiM7wDsmaGNHfPelZuNOO7iW5C4pVV07LohqKEN5mxg2absYqC0b6Qb/Z759aWatdCXh6pLMYeDvSOFSCchLOjBcrcUDc7AV0RDeeNLqUGswe+MQLXAS0uTVl7mcppRncOPwXP24p9bEeYXdubSZJlBq3ekpBRRHgY47uNYQVC9eCZAsbLwoaXDH56h1KDZA4qnJ0/aHfXrsYVT033Lut4tEhWQGoBS4ZzOhhx0p+55QWiCHs+VVejKc3MBVKXNDS2EYQcvI0jOSLfmhRC8vzeUvzeUNoHdrL83lFp2rgC8zFBgTlMNS+6X5vKI82sArR3T4CZJ8r9hVVF+Qg1GOUFzeUtFwQeMGI+oIVS20VPWZ3nLYy/N5S/N5QAJcHWGndis7S/N5QVlv8Ad/vjAonYzGjAdBxdLJRGgx5POaLVKXJda9gLs4vW9sHThibkHJMB9P8Ax4BtHTgT1z3/AILoE6TA/OIKOHsozG3OOW6Gjju/xS3d08AoXKumyu+Uu9QwcDJ1S+8w8b7yiTs2MUZ5A8JqgrXnOc0D4mXq9uHqnvlEOX0oXXWtKKznYUXg0MbEAOdcn/jcmBxxut+N7ecpQI2aQ0AAxRwuey4Yj7W+oNfCebC5iQTrSj/FLd3TxCupx2Cat7sEUcoNvwYZh24VLaeDZ4TDZhXtOdjWJTTrNHH1D3x6g2NfsS9TNU40jmpgBUAroFfO23iAjKgcAUpi1WrFrLrxu2mjDnPOdZOsnWTeGs6zznWTrJbmyxWrj/Frd3TDBaekppp5Snp5RmqG5PeHM8n/ALOig7pq7dZRJt4rmDbC964IfGOoz1Ij0lPSU9J657+FTThdp6Snp5Snp5SnpKekp6QPJrM9JT0lPSU9PKU20lPT/ELd3TEILIrOfhdpW0ehWHX313scmB7578cxnAKt6LLJyVqJRq8m4K+Bn2Mi46kdhJLxJ2UksrgTulf4Z93TDBamyV2D2D/ePyXP24p2Pc7O79/X3aRX2XTxiuj9OCpp2Pc7O79uX3OwLjZXAwblhjpL+0hptByNBFc6ks7v46zu+eaW7HCSOnzy9PnkTaxTBbPBr4T6iMv8Y+tj6iPqI+pjSHHbSX1MfUR9RCv/ABj6vgkRuUKq5X+zu+eQ0bMoQw9XnO755ygJAyJPSfWx9bAP/GPqI+oj6iNNK9aHdCS+oj6iPrYyfxj62MBZVaQLu+eW/FzaiNekNQ0urnu+eS/eRbDXz4/H9hdkwKRGgKR6kM5uq0h1VZXq8AY5YUBDrrG6DR4QLLQ2opLvqAheWGSVKlSpUcE15hEKoq+Zqmy1GGLcJR37kHYVvmCyeSypUqVKjgi2JAk0vYXGcGiVh7YLs6VrCpkILboWCYd++HCpUqVDcBFC1W6oGDVQj1bQs1lQBEmxDXuXHVKlSpUrgVjRCJ3BqzWO4YLQCPM2mPvzgS6sTk4s40hMhUNz9ytFqUkexgcrUVBdZG+WdJfEBM2S+oYW9k0u06MfQBNG3oOl5POA/gzLFYOy61TFeMYkXot6dQVdp0h0DuEKZdgVq8DOQoo5khGtSlblbXnWKFPkl9YRxjNVntp1e3OqQXw3eWpch9Z3QBTrVaEOYTVu+QZFRdRjF9uumRcdJ1lTKsb60BcBwFXW5iQlUBC7kK0jdCEwtFzQH7tSvwVK/BUqV20lSu3UqV+t/9oADAMBAAIAAwAAABAASiACwAABAAAQACgAAAAAQAAAAAAAAAgACSCYABoQALACAaAfJABAABIAASSSSSSSSSSSQSSTpZJJJLYOSMLJJJJZiSQSSSSSSSSSSySSST5ZJJJLYGSMrJJJJZqSQSSSSSSSSSSSSSST5ZJLJLYGSM7JJJJbqSQSSSSSSSSSSSSSSQYgkyEkGaSQGEkQkgKSQSSSSSSSSSSySSSRp9tvNvtySIPtvNt/wcQSSSSSSSSSSyQCSSiCSSSST+SNQSSCSTSFcSSSSSSSSSSyT8RQWCSSSST+SPQSSSSTGMQSSSSSSSSSSyS+Tz9ubZ7K+eSeGFdPbbCRYSSSSSSSSSSyQ+DB4UUSX69cwNRdKiddKSQSSSSSSSSSSySSST6tGgkyD1WrQyrFXSQSQSHSSSSAwiSySSSQq1JWSUB/f72QX/ul6SQSO9q3AN65SqSSSSAQ4bmiT+CPQCSXoTASSST4g0++ZsA7iSSSgCUWWW/+SNUSQNHeoACSRICU6SuuDACSSSgGfpSSV+SNASR0QuySSSMZOSSQQKQ8gWACDHUA2ST+SNQSVFf3SSQSX9vtySSSRjtkAANK6csJh+Sd0iIcG3ySQSK4B9ySSSQ8CCSSiI4IyzT+SNSSjzSTySQSCMqwySSSQxKSSSgB4aOQReSPUQjHzXySQSKwIQSSSSS6CSSSiCOteHp+SNmSCcSTSSQSYY2tSSSSSgSSSS0SHpf1H+SJI7w1gBGSQSdZ0ZSSSSSySSSSiEHokEMAAV2gjWQbSAQSZZCSSSSSSySSSSiGW66Ld2SC2Mg2yXSOcSSSSSSSSSSyTIIaSGTenss6SIKKj0y3TH0SSSSSSSSSSyQEbSmGSboz6+SGpd6mS3WAQSSSSSSSSSSyRiAVgAR4QSDeSNAaQ7GRSSQSSSSSSSSSSySSSSg0Dkz2j3jU/wBLJu80kkEkkkkkkkkkskkkksBn0IppX+21YJJI20kkEkkkkkkkkkskkkktBPIgsD/BqQgAAAARkkEkkkkkkkkkskkkkkRLksnNDkiuW2223nkkEkkkkkkkkkskkkkpjw/f+70kkiSSWSTwkkEkkkkkkkkkskRkk+WSSSS2DkjKySSSWYkkEkkkkkkkkkskXEgqNJJhJpOkixpJtJNCgEkkkkkkkkkkskhgDJ//AOuv/wD5/wBP/wC7H/6JfJJJJJJJJJJJJJIt7JJHcJJJnapJIurJJI1pJJJJJJJJJLJJJBBJJAGJJJIBJJIJpJJAMJJJJJJJJJJP/8QAKhEAAgECAwcFAQEBAAAAAAAAAAERITFBUWEQIDBxobHwQIGR0fHB4VD/2gAIAQMBAT8Q2qthVlCu/wDjKtfRucOCqQhX5mLddBClOvc05pzTmnNOac05pzTmnNOacRagoZLcUAaEqTTmnNOac05pzTmnNOac0404SHEV/wCHgd534t4ubnXGC4jszrv5/wAPAt+/fi3i5udcYLiO467+f8PAt+/fi3i5udcYLiO467+f8PAuuffi3t0OvfMlxHEMau8/UrhakU8M21euB+8+j9p9H7z6P3n0fvPof+8+j959H7z6P3n0fvPo/afR+0+jCC92KFWTX53JVFMJ+BKp1h+0+j959H7z6P3n0fvPof8AvPoX+8+j959H7z6P3n0ftPoWN8jGRC5RvZNY9OuH0a7cVX8zOhW50LMFxfE12U6TUGQKq9Ktx0CpTZYag8RpRs6dduKjoVudSMFy4vga7JsTFCTMCUKPSrcwazFc9rUh4T3RN/K/pMoQ3xNWk2WYPkhVKzkN7oB+cfnH5x+cfnH5xFkXJC8pD1aJhfEiZcnQrc6FmCrgWZ3NCF5yUFHR5NVEyy/B+MfnH5x+cfnDqA/YTwGkC1t+0QptrcUUbFT063MZEoUbuDLfv3IWQqFKYDh3FuqnWNUwdSt5FVnQort6FlIUrAhYF7lmmsCBTz1EztxWRUSyhFZZcOu/nqVwnRC+tkMgia0YniQTnEQr97ayaMvhkMZjd9xefJ0K2KxkSlwqjp2YLkOhKz2Qrq5L+qEKZBmVJElf3EyJHRDY+aMSRi5o/R47J3FwqzoWCyXYkGT0ZV5al17lE5Lp3EMfE0cyScqrWX9L6DxHQhiMppsR0KFRUIafUVOaOxe6MVI5DUkdrVZKNylDRCPhnihKyuclKhj8WQ2ZCi/yVjObuK08PtwJEIq24E5lLAVXHuSZ6CctrITTyxSlLGpizj3r9CrMYDUpalJIZharMvvtXCg6NdtnMq5F10Ey2vzKdih/rvBajA2rDAbgmdxHQrc6kYLlvxQaxmCf8GNVFk+49vtlW5ZgeBrwKGFFWLYqvMTuOkt49BQSuug9kb3y7DTFZyJRatBCCWTsElAtUWHKTLK1RDUT4hm8PE/DLNZP/BKI2WElGYeD0a7EwTsYVhJ/fYqjLDXIZHpky/0qqzHYpsiUw9gXnydCtzoWKHE5DmabpLVjGHPDJZDSZLSEUQHga8aaQJQo3NNkVTLt7TsLZajpV8Ho122QTBM2xTNasTFPzEubWacoZty2NzcR0K3OhZguWx1vuPUkLVBIktVlRJIYyNJCEuIPA14EHnKFXNWZrimslLi4MlBLMaUFo2x3ILXf6NdiNR3jKXUxpIclwuIFhkyUSrbZzJTsI6FbnQswRBbjnAUlO4hrY25jmXBjmkErZ4GvA6xdxJQkhZELISEiUuBCGuJWIXmJJNZuxEURhvqk6LsJYgHWZB5sy44hrMQ1hYEepIbEDSgdRmsF58nQrc6FicJchKsja2vNJISErWwp7QqJELEeQSg8DXgdYu4rLludklLMsLhYMWBgxpCHi64cHo12IbsWvUzjGzQ9jFq4ipFVMxbRSSYJm+xefJ0K3OhZguW45iEKmYtrmokmuxCW77jUHia8BSrCFEv5Z5EzO6WOZlMjE5C4WZApPB9GuxMCY1AWgzNjAFYYy02ZQNxLz3OhW50LLpciHtugoZaDClZFRWQ1EJbIuJxE5Unia8B4lyHO4f5Nd8/6R1n8jmTmeNMDql8Ho123EOYU1MSy0DQYlUUthGEknAdGg2tqBefJ0K3OhYnBNZbQfEOqCWO5YcsovcVdvPE14HSPbcOgEK76ec+GuH067bVXZVsRGnD2aoCaaklMXNKCXETIvPk6FbnUjBctloQhJXI0vQflFRDSkIxHfc8DXgdIzDZcOmMBKvDXD6ddtwSd2QHJzMRIiyOfR2HV5lyXyv8ABHMpax9kSRFzGKvKm5cRSPkoSbe/+FXl5NF0F2+bEqSoIQ69xO0QjEsRMtswFUgzxNeAlr2dDQfyaD+SVRD+RUtrirh9Gu2ydidakkEEvTuKsrijdRAvE2icFhzLAp8iE6tCw0MublvqNUSViMkhfCnzGNEli+h93XI9srAahwxKtR5N3xNS4yWW0G2zTzYq+lW5qY7Sq4XE09nRrtsjcTrKIlSxjoFuIN15fA+WQpJOKmTJcHUtzrjANEpbgdVsglJLdskOSRTNEKwzhhkZk4NkOJ2+BqK47RdzcSxVlvuJQo9Ktxh3va+LJf0WN3lL5FZHTrtsThRtV6cikFV25jnL/wAbTOK/gosLJ4fYnEvJ7j0YnuWMiUOYqnjMdVHpZDSolivqEmiURNygECB2YbU6QMrh5nga+pW5O6612dGu24ryMoEnMX5CVVWtoPUjI+W6r+ZnQrc6FmC22rLZZiSShLa7zEXR5cRqHG54mvqVw+jXYSkoqNN2EJJyn7DRcohYjTZY03iwGqUJrscBXOgREjbSTfITUuDp2VhQPEkfwVYnJgQAqEkkokoU5lmNG3QM4aiMR4mvqVw+jXbZAqEQ5dhsFcl9lyNk61oGqHYV5JEzoUNwpRRrGcjsrQux1YwQlKEynEvk1Xyar+TVfya7+TVfyar+Ruu/yzVfyO4Y8zxNfUrh9Ku2yVMISl5iRLlkXvuKlxzR8xdITkVH5mdCtkFrHUjBcuL4GvqVw2OYJQ+Q1rBmM3CIqubME6s1ZqzVmrKEFO6TzQ1sPgYR1RjC6S3E7SycFpTNeas1ZqzVmrNWas1ZqzXjSm5jfiNR7z6lcLMVQa17ks9iNCND2PY9j2PYjQ9iY0ETZqpW25ZalUkkV8ZXxlfGV8ZXxlfGV8ZXxlfGV8ZXxlBwOnzP56lbszu4Hed+LeLm51xguI7jrv56lbjVa5dy8lkt1qSpEaU05pzSmlNKaI05pTSmnNKQ4aDSZtxi0wE+sDTmnNKaU0pozTmlNKac048kJ0kiPXJRtmrQ7aieyCCCCB1JPEszYqkEEEEFitRVhjwHsggggiKsrVZFHQggggjciaCc19bEM8yIzH1BZG8xF7gdacCiArQOqjfspFVSLNeA6jRlfsgE/Sr0OP8A0//EACoRAAIBAgYBAwQDAQAAAAAAAAABESExECAwQVFhQHGB8JGhscFQ0eHx/9oACAECAQE/EOMW4Jr1c2TWqp/jJzcY3kvyEvssy5EUzuO47juO47juO47juO47hTXLMjwzJXc7juO47juO47juO47juOJk75JbaW5f1VdFjJf1rnk8aW5f1VdFjJf/AIecaW5f1VdFjJd1r3krbTjKpTlFOUU5RTlFOUU5RTlFOUU5RTlFOUU5RSb5S6UKcopyinKKcopyinKKcopyinKKcopyj3HltryVtpWqhfKEnyo+VHyo+VHyo+VYX5UfKj5UfKj5URVchpJ9Min7kShD5UfKj5UfKj5Vjb8qPlR8qPlRxiutM4T46207Wq7Mu5LA9tRYipHVSbub+KtsidPMTlTiwFVTha1XZl3JYHtrhkybdUv7PoD/ABA0+Ktsjs4EJJihpa6/AqTvt/RAwtpCuGN2HAx3jvHeO8d47w9qDjl6EyrJjoyLuSwOKSNbGN2m4jekd47x3jvHeHWNiSiRTkyHLU2DU3IEo8VbZIHVzjBAti+SXZTGIqWWsrCiEwgdmXclge2MKIYum4eQ8iJmNCPLi20lcYpiLPgTTZ6C6ZGNLojYVsjsy4SNGm5r9BQ0kdCwPbKugHNLYSPiVkNO+D6AcnBoznbiBpnQW2k1KHcEPcBVaSVOwnLC498GQbCEJZXZl0u6jUqEqZfKlge2Z7EEup9QGmlI6UVl1YrgGgnoO1TcagkxCyJqRZT3LPIacENpugoObKSaE7sSOojbGwxVoEpyXp7nWHBOlaxiZUbgU5qECWZ2ZdyWB7Z24KVQx6OxT00wrbQPLpbJChJSiantT7iQf/ShWs4L9jU1a6/QUJz4cfX+hUy7bf8AQkl1q/Q62dK/hYeDpu6DeC7pQUI7RH+kHbpfr/Rxld4XUDQnxSFMezRtZGlboZNoQgd5nZl3JYHtn2CjIUDYNW46xPSEFydsXeRvfJFZJgdmuRUThjMQIk3dyKU0bWRjSh60QPITmqzOzLuSwPbM3CkaQ8WUsioMUktENIziR1EldEGdVWoKkfH7JKi8pL03ESbgbcpLPaKiTY13EhBQmTmJiGLK7Mu5LA9sz3RDCWELJagbqGqkCRYEI2Odp7CtpOYoNw290f6NpTSwnIqMPbNZEq6HCmzxY1KHbCcrBuBOVg7Mu5LA9srwE5RCl1GhJJtQO8eCLRM6gkOQtLghpo2U6G17i+2jawjs3gndg0mmsHVgxUWDsy7ksD2yz0QxUCUKBs6oabgPjOsXGLA1zojfTWxcUoYtC1l3hMgnDyg7Mu5LA9skDFCBQddUQihIVEdQ2XQqTRqoqChQtG1kXJDIgaSQxlLAKRQk6sSgdmXclgamBQwcESCrj17Fk2wRdKGfgr6/8Famlxp2srSJkbgjSVmGiMU8HZl3JYHsXG0icY0IQhJTXFk2wRdIuHBbSW2naytwRoZbCROG4DvKkriBtN5CWnsbES2FZj1E7ljaSJnOuE5Tk/dM1Vtp2sqqljuQm7BZnRA7oWqiE4lZS6UlxYjZDWCs7DpIkQKEhPQBuFIyZFdKSgnypJ8VbZG4GowbhSQ6Bpo2LWWB0QiIY3cPYbE1DHVpRa4qsVmS/hXYa2EIIEUNOChdADUJwSU2KLcsoe8kfaBUp4q2yXRDv1DB2JT9f6Eck7VwtZXBwJ8iSsNZsSS2SifawU5GlQsklNuO6zLTFaGoKLEmBMIciFnzwtskKZJnIqUFYtZUoJirscQFU+V2ZdyWB7YrUvXCw1nBB6eaFtp2sqihk5JyhjwORsjsy8KjgdW0rQnPqOVcqBxSS+sbtRy3LIZDIIIgeVqjiQlr8sLbTtZKtShTKecbpYVErF2ZcEm0MTadvdL8sX3n5KQew2XRDSB1nWdZ1nWdZ1nWQVl5YW2naPUoIuwC98zFVQsJzYdmXcIwsD2/hgttLonXUSs8WZ3nadp2nadpws2gQVwSIVSWRCmsSKdRIAIABEBQm1XkrbSkvyOHbEjQAEpuK6EoZITk9z3Pc9z3Pc9z3Pc9z3PcSl3I+TLbJNYzbl/VV0WMl/8AhwtsicS4T+olCJ95U6iJjO87zvO87zvO07zvO87zvFtMiFGSQRzM7zvO87zvO87zvO87zvFzk1vyeMkVnJWF7Ccv1GKhJJJI4CqRsVIg3BJJJJI+hOYfNPcs0iXDfZFRUJJJJG3MImz5GaSSSSSOuKtIpVIjxeM7sWF6DV7v2OmajYsSFeUOuZ2ErJDXAciRPcZ26pIcKhZ9dBUUFRy3GmXirbQcytCIqOqp4iUef//EACkQAQACAQIDCAMBAQAAAAAAAAEAESExQVFhcRAggZGhwdHwMLHx4UD/2gAIAQEAAT8Q1SnCVLzdJcQ0OVFADdlt/F0NNgCMW1oArFCuuk7CCgzQ1kDZHUJGtbTHCY4Sjh6RAqY6QfgdZzic4nOJzic4nSnQJzic4nOJzic4iC/1AAm8xwmOExwilJnpOYTnE5xOcTnE5xOcTnE5xOcTnE5xOcS9oy8CY4THCY4THCaJmUSpUqVKlSpUqVKlRx2lcpUqVKgdoWiqOEiriFZOlGgAMFhbBJv3KWHkMqyzcAASmYAhyJiw10w6r7fXr0OGeQhlGtTA+0AFAT6b7RrMKP1qfTfafTfafTfafTfaLCrl83pPpvtPpvtPpvtCmNU805T6L7SjJ43xxDOyIhlgrgDPc/evSEwaQzQWhRoijrDkv12n0X2lXK/XhPpvtPpvtPpvtDtRsH1J9F9p9N9p9N9p9F9oUjTR6vKH039R1PibgaqgADog6nd/evXoGb7WbhYDXG7ar/yGc9yu/wChrsH/AG/bu6fV/fc0eJ+yH4MiV0m7ua+jDTuHpHv/ANY36bfi9au0P+37d3T6v77mjxP2QnHv5ErpN3c19GGncPSPecP+oZ92fi9auwPcfTfaXLly5pdX9y5cuafE/ZCX38iVcTQ9ZcuXNfRhpLly4eke8vT/AKhn0Kr8Xp5iGb4oz6kIU50f0nUjqR1IG4+cJo3d63nUjqR1IPE1PUSrjHNeLHR9xaoM3rec6kBDd6x1I6kdSFIzo3lRueM6kdSOpAl16H7TrQCD/pT6bfi9b4wZayrL+l/keRzv05T+l/k/pf5P6X+TkPP/ACVGGrvzn9L/ACf0v8n9L/JU0am/Mn9KKfNGM3TuNJ5RamFs85/S/wAgL43H/J/S/wAn9L/J/S/yXOC7wq0ec/pf5P6X+T+lBcoN+stw+cxFAuHWBiBYN/8AN9Ne5ZBv8Ho8f3+3d0+r++5+4/Z2Gvea+zTsN+vc19GGnaQ9I9+4BzeoSAy9VoUEKHELqt3reJlQWqOgi0L/AOX6a9w7J3j8EClBArSNJuEIi0GkFACKIyydKkwNJvCT7mVQCrAuQWRvHtGkBvLGZdwUsyo+m+0qVKlQY9X9ypUqafE/ZKhqd5r7quyzeN5UqVMHoyqlSuw9A95UNdiGPAwoAeGxVxJbVqLrLSGowrahWLY0/wDL9Ne5S24FZG6JHCCBVm19mtUArmoEWyRhWSlOFRuTSr30mpCvDqCA1GuabKLqSs2O/IuXDVFg1ESkW8MrI5QBVZ3lTG9iyp2NcWQ+KWCRn8zP5mfzMGqm8qm6fzM/mZg/ShepV0auppxl1mGlC+jNZ4kNpabrD5WjHGC1uiw1gruaixdJeDR82Oo028jAkm4J5uEfKHF5Qs6NnwhlnlZ/ETBFYOOkK/Yz+Zn8zANXaMEIWAFY3aGr41NxFdD6tfWLJqnHYUdpR/zfTXuG8wb1v2enJNLasRdus8Zgo07U/omZwrszpzOf7gMjkIN9n7v2SgXhMbKTPJWOrTG/KJs1C/RwJoeB6k4Q17jUN9ns0Ow36y/GLLTQ+fnlh4bSjB6LXUHMUxp2UScQGq4HOPKHbEDrxesFAYwe/YP+kz6a/j9DskwrN8QheYFLOVjF8pmpHZRE4z+nH1is7FXi/ZELMRsDu+xETOVS1eK9n7D9ks3SK6TsepO7YoWKN/YAKpaJX5B1OiThIlokK1x85wRBBLYKUEex2gxtAw6IcnhMjtQUyxN+TxI/pcF1g2dnl+5gSg3tGV7jDk38W3KXWJbS2P2xIIOlusKALoj+B+3+ChCFoy89i0wb7TX8XoK9YZpgjWmmIAt0OLKaby5ChLVhJahBEmZStXUbeL2gCGkEOqZa2P8AIwpRm6xE2ZZ5QGMMvX3lzGcFC5yH3rKSihrQbzJV8ZlNaaVIuVEhhRYoVRbjCeQvUrFmjnNoqE7mO1qwANBkW9jsGtJfUDslkCGzZsxBBuu9kUExodmU8GFLaYy68ANRc+J61xmUgR2G9s8vPhDOyeEpMOxoguagUBjpjlFSq3VzEer+A+v0geMYBXBagc0i5jri/rBLa7rGJrQPnAweYtxGy3rwIULVrV58GWv1FGhduQlCroaQriVXCWiDQrmcYpgVNmm7kJgKkSxht1WvGhbCrdZburZkNY0XXZoTN00ZGtATSiwc2oxNGM5QlkdFowwj/wCXiMxsK94DqPngANhZrLcNYCy9NqXbBWHqEREA4PNSlmLauGLF7LBzxlOMzBZbt+D1qhvOnPh1vOJ1W6d+kSbBOCy6qDVxTua/SneXL6Xbla+O/hLLQqBZ8ddDVfkjC3by0F6HAlDKq1cy1wRta35bQoVdDnMZl1N+ZOt5zKZdePa1rszneRq851vnDXl14zrfOUabXrdscgE5MrXJ6Shy0N414O3PpDqmtc05cHnCB8bWHPn4cYLhWW5YZsuhv1mO7zhTKpud0fb7dyUjZholFa/1BgxtWtaBsj61jstjdL7ZbzJHSFlqCtwhqZqwWuG4PWsNkrV0WlxP+Zz7pMWiZUtyQApLGho0xbtdbyuH0SuagW0Daq2BQpuwlLoXkNohgz1LaRSLGkVlIMk5INoqCGFysBhSE3CAGl8B6aRimXyrrPsCpCnFmio4EgEF1y5Fac62IZJnEnRpb05qAqXLjNZlFvRsPAFcBQ2XtpKK51myrJWl0VdGh3/WrseUVBVuC8HSDQI0aPDsy7qw5hb66Ml8D7/piw6VvgB0ml4/uWDKA3jfscC6zaxam/MioMK6bWHjo+Eti+819kRtrGJQthhVhv1uUrcCbhxzzjxmKOw1HhCJW96dedTZAeZse8C9Mx0bwzYDxKesDaosLY2534wl35my+gQpsPR2RBDIWtwpr3Rg4cOvDeHQAFiE3QoyAvZipgZQ111ZoNulRNYrnjDEpW3Bmnm46OWLoLWESxEpAhKQVnejaJU5aY0i4iGcaS4RpHlFKvNaXLaweUBIC+MRMGhhBwBOqh1BXY0jwBaGGTevaVK24oUjIxpD3qYUoWK2adUisO/61djyp6Jz5RVOtg5uceiOG84BHS4YusPA++0TvKuuJuQ0S6y8Bbf3l2BcdYASqq6065xKFCsyr3IYhr3mvs0lTcbXpNNIwFOuo0px/vl2XHyixS7dVv0jBcb1rbE01xGtSMDS83h98WKRAA698jv9iO1EyrFo0LUEvJz7KpXTpEgrhVSwzX4aO0Cu2tZai5sh2Iks8oVLwxzlPoFbTCVhgq1S1Bd0sKa2psqXgbvaVVGFoLQugyt74YKlGsaA0jvFfZlcuau15TBS2glYDY5erv4Qu6mq2HAplgTaFVXDd08ICtm3NNyDqavBz7PKfuP2dhqd5r70OzQu19nlE5NttvPj6+ksEJLjq8PKWTLXa/7CZHSRl41wJVVYPN+3rBz5h79mP4Efv0nFDTsNSet/tmJoQw+hFewKxv6WCWFLLADTVwb/ABI4NPGAJmUPNEBgWmhd4juPSurwFMJVLYoQA5RBz0Chd1YDwom9DJdjR2qAk3KK3VxgaHWoKG7B1G9HDuoECBgFJhaMdrKVaurACx1FSelPncZvQ1FOo5JX/SZ/JKq1R1juVDpnRi7UWZlSOL3B3lf9GNeyot4DzlBkANPiffCLCKa3e/THrCE0D3d36LHThTAGshV24lwnSXBGpapSYZ5f7AJdPilf9GXQQwvV2lxi4puAiyrVX7whpFZJ0N2KQdRZQE01j4Wl4WLAozGYIFlcVfNZqheI/gfv1vFDTsNSff5sqXZAWraFzCiiVuIE8IH4mcb4roslraWHCXVsWmb/AMxZJscNdBEtkL4wKe761drzQcR9oZQBqCv7/cCiwmEgZXlEC3QzErMGormy4eNRtuPHEr7UopXiLNLqfucIa95r7NOw36weMuAAmF4y8UQiqzcb4R5bi/NhrKnAhStC8HLU+k+4YQ9I9/xAfp6UEurVESYgcpBjKQgwEesGs8SIXpKDcPxbZ1jJtQhDaYZs2qzekUEUy1qFoAtqoxb0Hf8AWrseKaXmaKmx1arSNOmtKs+HLcg4LoQ1OPZZRarY94VVorDSAbHSoOkHDzOzPjyfsmxLIsS6cm3ea+0GBeh2DXr2C1nITbiwBF6895jywYFhCm/EHY9/CX9IjVKjtk8ohcKHTRg9da0lB3FBb8YRJR3NPwgfrIFEQTZtH/aT+kjX7iMtKXlb3RBrA6G/x7+MUiyLahITwdY7ENBhxkAUIwOGdbCjOvf9au14+i+3YEAsSqS78ITwC9bA5rm/qJW6DpbLU7DnPOVy6kZUXGT9+ExFuwUWOmPXfhxxAkBFXkGwXFHDDfjczwta0ANZkLzVGfD4O819mnhGVUdVW/cQtSiwED03ebKHB2vtGZuxjSOtPpBgq7GI3HCmtxjCikSke0x0j3mn4QP373j7XRnrP7SjC8yhQbYakJWwWVGUHQ2YGS2CxbKmj8RrKOH4fWqIkDh1+ifYPiPW7hy5QW6rC3TTyhuF1r4icNAniabxpatdKiVtY2dU6yrpFKA45QL9GkC7OlCqcnKcL0PiDJxOXx3epvbl329D4n2D4j9Y3lT4lEItjPNjaVbGmkF8DiCO7UYc/wDEtj2PiA0VTFlKF518fGJL8XHxNTY6fEV4EcOfKP8AI+IEtXFfgPv1vFDsdGes/tD8SGMILHK0pS3UTcFQ0gYoKW6vPI/Ga/i9aux5m+XWcIzQ+YNivVuaEVggJUzXOWZt6hxbnLjGnjiWFONWNaUUxg8pe8rF1RQo5No2WeMS81JACg73XouB+FqlhF6DnuefPm99H0jGcrQMcZR7/ax51D7gKWDrjQ/MOgTSwHQlV4RAMY7619ICsUoDizReiNGeL1qDZhs4nZdlbcIGyC7ByaecusCjVLtzjUr1lvbBuX3fuueIU0lNT+Sj+S+I/wCShG0NJ263+U1/F61drx/f7dmkeA1uOr4v33jvq2fKGUUcwQHIorex93ikqqZVbWXgRcAF3DpXYbA6vsTJDxRGLgrSVD3NNRtNDW4mIgIXVFjFHCgBfM0/U6J4sPw8pZWnrnp7DMvAgcTT9+YtnU4h114dHtPSPftA0rFyExSD5JCNR5Z1OCstAqvewgjSCoD/AJh9Ne4zP8TEUHFeBmVO/EqpCzcRE1ERzFczUCuhGo4GVCwNydEE9oSEBE6jcW+x44mHSfaYALOW8BN79Iwsi2jNGCMPkqO1n2/UuM+g1l0mNQcLYciOiAhSnHWZ9kI5CFnpk85ZxJtcZX3FdS246PtMcVdoODrDi7arhANrpNA3XlK1B64eIrm7aENOpipHhUIl2A8nRyPtAUVbb55+47D0j37DURV0lKIa8gSyfLgkQWhOQqPZT0FQ1LSf8v017guvdZxnBcBnQDcACqCKc5sV2FmW2U64Qml2uXZeWiqzAYukrDUtouWyQh1BZW7BkBF6xDSsNXFIMKw8oijNsCFLYfKj4gGCoigWnC605Sn4nxH/ABnxLVMcFjLcMfzxJVVB0HxGr1i+ZYo36SwlGEPgxnFN8IXN5a0bx6aesdX0HxDgaY2OJyhYXBQJ57he/oTJ+kNcLVnuLKVIozxY9CBI6bUFbbVyib4nB8Svd4h8TQDQybWzlw+XicW+nCOFgDZypWSOxJ0gR4jXLRzP4z4n8d8QPCaAFPXHIjXluRlxZK3jwDwfEayuKA7CjhKOH/N9Ne4eGqSfgjh0ILf6CfgBgOz0llQSQVWSEMOAKU7LKuDYAbyDRbV8WVWOx5Uf3+0o4Sq5fcSjIoAVgGgfd3jcq2UpkVczc+r6V1lyRwx4rd615Sv7KiycDpDhismvUlQZO8197Sob9Yp+4BqHT3PhCECgwHZpMgklkHqOzzmtyIZclN+pKlcoHlHvK/6iP01/F61djxAoNBa1gOcznqNmcEUmje2qe0AAYCaQT5oDk5zbl5zBvT3EsbqNGuoHVhhyFEXUuYU0aj4ifMugWglNNQAaZALLk1r4282lW1uN/dHyuGp2ZUjinDmwMX1ixGCZ0aJ4hEvF0tTbAZVUaio0m4iJsibdns2lCNukFDxYNYs0mObvLvpp11g5GBgAIIbynGI3yEqIolCV2xzNjPO/OKrcKHQdGvS9IE1hsKrc525/9YH6a/i9aoZ4KCbcIlO1KfaUz9R2yaQ1+mCCGMQaktD6VsvvEWm1i2qtdyzRyMMYRfAIS9Mo2WYUxrEQEDSOKYMOp+yChWcQ1OybiTnPAqxwoYyili61nskuFEyo9yzKbHJC32TaDmqE7BKeEDAga0NQBWi4yn9Vn9Vn9Vjm2j3n9VP6rP6rLdfMiBERYt8ZUx/6Ufpr+L1qjNKc89yczyPzG5vQ7uXOCVmy0Fs+szfREPmPHBBmKuuAPlfMqaM0Fu7nKQLIW1C9+tFF0LPuPmK1l6u4hevE311jt8E2eJznM8j8wsM6uH+9nWp1wI28vgPkfmWb+Z8wK86uL5nM8j8zmeR+ZzPI/MuZaG3+ylv5H5nM8j8zmeR+ZzPM+YaxoNnnznM8j8y5anIP+l+mv4vSqLxTKQXhoXZI8tTEMRT05u1XlA439mqPAhwflTA/9fifVfiErBvDPFyn1X4n1X4iQPTfiMBQMxZM6U+MsxrqfVYfPwlkFcOIeYxDJSA9xKIWtRM4icxMnLWc1OanNS5k0wp1TmpzU5iUZGh7zmI4oJ2/9J9NfxegXmdajAG6LiHhvtKcCUcJRwJRwIQMGr+5RwJRwJRwIStNn7JRUcDtBXdl2hmVN2N5UqVCX0YBUqVKh6B7xogrH/0j9Ne4Tygc4Asycfwegf8Ab9u7p9X99zR4n7IRyd/IldJu7mvow07h6R7zh/1BfuzuLP4dem+GcqxRYy9Qeck4GjiNNDSpUdrxAu3W1PNL+u/UKZHBrPcmyXwlAZ37bRIT73SPkHrI61skch2MqW26jyPuLLLoDULZbrYaK0OD3HWWQOfrzexXKW5yJe7VVjcQIv679RNAQZxCrEXVxhWjLH3vSG4kWTRhNFIvBhUdmmgV3NZZZGu2B+ZSvUK0iS6vD49xlk3Ka7K835l00xPnEqYu1DfCX9d+oZ2VRUhTC4Q7IZVxZfCX9d+oYi66wVs13Ojb/kNe4gBd65Aj7IJxjcAuPK1q9yoru9jWQiTt1cBDk8jhaLqLWg00lg2GZPTmDBvqUQozToWIZWVlZWERpxMcUx0ES5RADDi7sD0WAWO5HoLW1gDctLfZPwyfoOcrKysrKEyGVqAlkbdLXGoKAlgSRXMSwFlN0BqoGsZ60QqHJiWLCUBxLIXEuVlZWVl6NS9VVVhFGYzaCZyhleFFLHcUREURiNXCJOIIWpR6jQULErKysoQKgDTuoGglTQAtYEc22yQWQWLCxBmZZAOBYTd9FScIGpyNiFiPBH/lMd9rcxTJYia8EGFNITv0JYYihWSzKcSS7gjJSgoKKhPHV3jcEKrxBrRYWJqU4kKUJioN1C+kiLRZBZKwFgirYS2xK272vAku126S4QW3SgWgM1B+vEAMKtAClo/Ir4UQhpaxxWmHerEsVdWm4GgCwLFwGs1N1IkuQQJQ4CLyO2jRSJGhTKqBpr3m9sHUsqOMLodWizUoeOeTWW6iCtS1C2gwIopbTkZsYAEQWxIfM/5TX8ATYlOECjveERwlLqsQK79acEpwgDbvg7D1lHaVu6z30O0pwlbuiH/L/9k=", null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.6341447,"math_prob":0.9904527,"size":18898,"snap":"2022-05-2022-21","text_gpt3_token_len":4982,"char_repetition_ratio":0.13554567,"word_repetition_ratio":0.32140374,"special_character_ratio":0.27537304,"punctuation_ratio":0.15615962,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.99732596,"pos_list":[0,1,2,3,4,5,6,7,8],"im_url_duplicate_count":[null,null,null,null,null,null,null,null,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2022-05-17T10:13:58Z\",\"WARC-Record-ID\":\"<urn:uuid:8865e952-d577-4eea-b809-22f1836cfe4a>\",\"Content-Length\":\"293767\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:9b5655d4-4562-4862-8d02-67ea317c3160>\",\"WARC-Concurrent-To\":\"<urn:uuid:f2cee74f-83d8-4f62-9cc3-2bfe15fd2fbb>\",\"WARC-IP-Address\":\"90.147.160.72\",\"WARC-Target-URI\":\"http://ctan.mirror.garr.it/mirrors/CRAN/web/packages/ggalluvial/vignettes/shiny.html\",\"WARC-Payload-Digest\":\"sha1:UQRLTSD5OMPO5JJJ6RGLOVVARWQ3L3FS\",\"WARC-Block-Digest\":\"sha1:K3VVJTL5N53E7FOKUO7QDBW3KRQJLMOV\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2022/CC-MAIN-2022-21/CC-MAIN-2022-21_segments_1652662517245.1_warc_CC-MAIN-20220517095022-20220517125022-00254.warc.gz\"}"}
http://www.gnu.org/software/gsl/doc/html/qrng.html
[ "# Quasi-Random Sequences¶\n\nThis chapter describes functions for generating quasi-random sequences in arbitrary dimensions. A quasi-random sequence progressively covers a", null, "-dimensional space with a set of points that are uniformly distributed. Quasi-random sequences are also known as low-discrepancy sequences. The quasi-random sequence generators use an interface that is similar to the interface for random number generators, except that seeding is not required—each generator produces a single sequence.\n\nThe functions described in this section are declared in the header file `gsl_qrng.h`.\n\n## Quasi-random number generator initialization¶\n\ntype gsl_qrng\n\nThis is a workspace for computing quasi-random sequences.\n\ngsl_qrng *gsl_qrng_alloc(const gsl_qrng_type *T, unsigned int d)\n\nThis function returns a pointer to a newly-created instance of a quasi-random sequence generator of type `T` and dimension `d`. If there is insufficient memory to create the generator then the function returns a null pointer and the error handler is invoked with an error code of `GSL_ENOMEM`.\n\nvoid gsl_qrng_free(gsl_qrng *q)\n\nThis function frees all the memory associated with the generator `q`.\n\nvoid gsl_qrng_init(gsl_qrng *q)\n\nThis function reinitializes the generator `q` to its starting point. Note that quasi-random sequences do not use a seed and always produce the same set of values.\n\n## Sampling from a quasi-random number generator¶\n\nint gsl_qrng_get(const gsl_qrng *q, double x[])\n\nThis function stores the next point from the sequence generator `q` in the array `x`. The space available for `x` must match the dimension of the generator. The point `x` will lie in the range", null, "for each", null, ". An inline version of this function is used when `HAVE_INLINE` is defined.\n\n## Auxiliary quasi-random number generator functions¶\n\nconst char *gsl_qrng_name(const gsl_qrng *q)\n\nThis function returns a pointer to the name of the generator.\n\nsize_t gsl_qrng_size(const gsl_qrng *q)\nvoid *gsl_qrng_state(const gsl_qrng *q)\n\nThese functions return a pointer to the state of generator `r` and its size. You can use this information to access the state directly. For example, the following code will write the state of a generator to a stream:\n\n```void * state = gsl_qrng_state (q);\nsize_t n = gsl_qrng_size (q);\nfwrite (state, n, 1, stream);\n```\n\n## Saving and restoring quasi-random number generator state¶\n\nint gsl_qrng_memcpy(gsl_qrng *dest, const gsl_qrng *src)\n\nThis function copies the quasi-random sequence generator `src` into the pre-existing generator `dest`, making `dest` into an exact copy of `src`. The two generators must be of the same type.\n\ngsl_qrng *gsl_qrng_clone(const gsl_qrng *q)\n\nThis function returns a pointer to a newly created generator which is an exact copy of the generator `q`.\n\n## Quasi-random number generator algorithms¶\n\nThe following quasi-random sequence algorithms are available,\n\ntype gsl_qrng_type\ngsl_qrng_type *gsl_qrng_niederreiter_2\n\nThis generator uses the algorithm described in Bratley, Fox, Niederreiter, ACM Trans. Model. Comp. Sim. 2, 195 (1992). It is valid up to 12 dimensions.\n\ngsl_qrng_type *gsl_qrng_sobol\n\nThis generator uses the Sobol sequence described in Antonov, Saleev, USSR Comput. Maths. Math. Phys. 19, 252 (1980). It is valid up to 40 dimensions.\n\ngsl_qrng_type *gsl_qrng_halton\ngsl_qrng_type *gsl_qrng_reversehalton\n\nThese generators use the Halton and reverse Halton sequences described in J.H. Halton, Numerische Mathematik, 2, 84-90 (1960) and B. Vandewoestyne and R. Cools Computational and Applied Mathematics, 189, 1&2, 341-361 (2006). They are valid up to 1229 dimensions.\n\n## Examples¶\n\nThe following program prints the first 1024 points of the 2-dimensional Sobol sequence.\n\n```#include <stdio.h>\n#include <gsl/gsl_qrng.h>\n\nint\nmain (void)\n{\nint i;\ngsl_qrng * q = gsl_qrng_alloc (gsl_qrng_sobol, 2);\n\nfor (i = 0; i < 1024; i++)\n{\ndouble v;\ngsl_qrng_get (q, v);\nprintf (\"%.5f %.5f\\n\", v, v);\n}\n\ngsl_qrng_free (q);\nreturn 0;\n}\n```\n\nHere is the output from the program:\n\n```\\$ ./a.out\n0.50000 0.50000\n0.75000 0.25000\n0.25000 0.75000\n0.37500 0.37500\n0.87500 0.87500\n0.62500 0.12500\n0.12500 0.62500\n....\n```\n\nIt can be seen that successive points progressively fill-in the spaces between previous points.\n\nFig. 3 shows the distribution in the x-y plane of the first 1024 points from the Sobol sequence,", null, "Fig. 3 Distribution of the first 1024 points from the quasi-random Sobol sequence" ]
[ null, "http://www.gnu.org/software/gsl/doc/html/_images/math/92f093ef8e67b2293db7509b06c7817f327f445c.png", null, "http://www.gnu.org/software/gsl/doc/html/_images/math/aa6af4b128d0ed8c51438b9e849475cd63437fd0.png", null, "http://www.gnu.org/software/gsl/doc/html/_images/math/3efd6fd1c2b0c335484bcd4bf7d5d98b99e619f4.png", null, "http://www.gnu.org/software/gsl/doc/html/_images/qrng.png", null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.66011536,"math_prob":0.9665993,"size":4320,"snap":"2022-05-2022-21","text_gpt3_token_len":1174,"char_repetition_ratio":0.18443003,"word_repetition_ratio":0.009615385,"special_character_ratio":0.26180556,"punctuation_ratio":0.16030534,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9807254,"pos_list":[0,1,2,3,4,5,6,7,8],"im_url_duplicate_count":[null,3,null,1,null,10,null,2,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2022-05-28T13:50:36Z\",\"WARC-Record-ID\":\"<urn:uuid:297aa6b5-43bb-4915-9529-c4694a1568c2>\",\"Content-Length\":\"34416\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:68b4f248-4449-4f77-8bf9-8c501b1f774e>\",\"WARC-Concurrent-To\":\"<urn:uuid:3c49ff53-7e18-4427-aa2e-b3ff2d5690bd>\",\"WARC-IP-Address\":\"209.51.188.116\",\"WARC-Target-URI\":\"http://www.gnu.org/software/gsl/doc/html/qrng.html\",\"WARC-Payload-Digest\":\"sha1:2DNZOZQIQFXMHWNPCOGNU4GTHK6K3URO\",\"WARC-Block-Digest\":\"sha1:XE7OJMEALVMOWSDD3WUGGH4UARHUO4J4\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2022/CC-MAIN-2022-21/CC-MAIN-2022-21_segments_1652663016853.88_warc_CC-MAIN-20220528123744-20220528153744-00246.warc.gz\"}"}
https://br.tradingview.com/pine-script-docs/en/v4/appendix/HOWTOs.html
[ "HOWTOs¶\n\nGet real OHLC price on a Heikin Ashi chart¶\n\nSuppose, we have a Heikin Ashi chart (or Renko, Kagi, PriceBreak etc) and we’ve added a pine script on it:\n\n//@version=4\nstudy(\"Visible OHLC\", overlay=true)\nc = close\nplot(c)\n\nYou may see that variable c is a Heikin Ashi close price which is not the same as real OHLC price. Because close built-in variable is always a value that corresponds to a visible bar (or candle) on the chart.\n\nSo, how do we get the real OHLC prices in Pine Script code, if current chart type is non-standard? We should use security function in combination with tickerid function. Here is an example:\n\n//@version=4\nstudy(\"Real OHLC\", overlay=true)\nt = tickerid(syminfo.prefix, syminfo.ticker)\nrealC = security(t, timeframe.period, close)\nplot(realC)\n\nIn a similar way we may get other OHLC prices: open, high and low.\n\nGet non-standard OHLC values on a standard chart¶\n\nBacktesting on non-standard chart types (e.g. Heikin Ashi or Renko) is not recommended because the bars on these kinds of charts do not represent real price movement that you would encounter while trading. If you want your strategy to enter and exit on real prices but still use Heikin Ashi-based signals, you can use the same method to get Heikin Ashi values on a regular candlestick chart:\n\n//@version=4\nstrategy(\"BarUpDn Strategy\", overlay=true, default_qty_type = strategy.percent_of_equity, default_qty_value = 10)\nmaxIdLossPcnt = input(1, \"Max Intraday Loss(%)\", type=input.float)\nneedTrade() => close > open and open > close ? 1 : close < open and open < close ? -1 : 0\nstrategy.entry(\"BarUp\", strategy.long)\nstrategy.entry(\"BarDn\", strategy.short)\n\nPlot arrows on the chart¶\n\nYou may use plotshape with style shape.arrowup and shape.arrowdown:\n\n//@version=4\nstudy('Ex 1', overlay=true)\ndata = close >= open\nplotshape(not data, color=color.red, style=shape.arrowdown, text=\"Sell\")", null, "You may use plotchar function with any unicode character:\n\n//@version=4\ndata = close >= open\nplotchar(data, char='↑', location=location.belowbar, color=color.red, text=\"Sell\")", null, "Plot a dynamic horizontal line¶\n\nThere is function hline in pine. But it is now limited to only plot constant value. Here is a Pine Script with workaround to plot changing hline:\n\n//@version=4\nstudy(\"Horizontal line\", overlay=true)\nplot(close, trackprice=true, offset=-9999)\n// trackprice=true plots horizontal line on close\n// offset=-9999 hides the plot\nplot(close, color=#FFFFFFFF) // forces to show study\n\nPlot a vertical line on condition¶\n\n//@version=4\nstudy(\"Vertical line\", overlay=true, scale=scale.none)\n// scale.none means do not resize the chart to fit this plot\n// if the bar being evaluated is the last baron the chart (the most recent bar), then cond is true\ncond = barstate.islast\n// when cond is true, plot a histogram with a line with height value of 100,000,000,000,000,000,000.00\n// (10 to the power of 20)\n// when cond is false, plot no numeric value (nothing is plotted)\n// use the style of histogram, a vertical bar\nplot(cond ? 10e20 : na, style=plot.style_histogram)\n\nAccess the previous value¶\n\n//@version=4\n//...\ns = 0.0\ns := nz(s) // Accessing previous values\nif (condition)\ns := s + 1\n\nGet a 5-days high¶\n\nLookback 5 days from the current bar, find the highest bar, plot a star character at that price level above the current bar", null, "//@version=4\nstudy(\"Range Analysis\", overlay=true)\n\n// find which bar is 5 days away from the current time\nmilliseconds_in_5days = 1000 * 60 * 60 * 24 * 5 // millisecs * secs * min * hours * days\n// plot(milliseconds_in_5days, title=\"ms in 5d\", style=circles) //debug\n// subtract timestamp of the bar being examined from the current time\n// if value is less than 5 days ago, set variable \"leftborder\" as true\n// this is set true at the bar being examined as the left border of the 5 days lookback window range\nleftborder = timenow - time < milliseconds_in_5days // true or na when false\n// plot(leftborder ? 1 : na, title=\"bar within leftborder\") //debug\n// plot(time, title=\"bartime\") //debug\n// plot(timenow - time, title=\"timenow minus bartime\") //debug\n\n// treat the last bar (most recent bar) as the right edge of the lookback window range\nrightborder = barstate.islast\n\n// initialize variable \"max\" as na\nmax = float(na)\n\n// if bar being examined is not within the lookback window range (i.e., leftborder = false)\n// change the variable \"max\" to be na\n// else, test if value of \"max\" stored in the previous bar is na\n// (bcuz first bar being examined in the lookback window will not have a previous value ),\n// if it is na, use the high of the current bar,\n// else, use the value of \"max\" stored in the previous bar\nmax := not leftborder ? na : na(max) ? high : max\n// plot(max ? max : na, title=\"max b4 compare\") // debug\n\n// compare high of current bar being examined with previous bar's high\n// if curr bar high is higher than the max bar high in the lookback window range\nif high > max // we have a new high\nmax := high // change variable \"max\" to use current bar's high value\nmax\n// else keep the previous value of max as the high bar within this lookback window range\n// plot(max ? max : na, title=\"max after compare\") //debug\n\n// if examining the last bar (newest bar, rightborder is true)\n// set variable \"val\" to the previous value of series variable \"max\"\n// else set to na so nothing is plotted\nval = rightborder ? max : na\n\n// if val is true (a number, not na)\n// plot character\n// since no character is specified, a \"star\" will be plotted\n// location.absolute uses the value of val as the y axis value\n// the x axis location will be the last bar (newest bar)\nplotchar(val, size=size.normal, location=location.absolute)\n\n// fill the background of the 5 days lookback window range with aqua color\nbgcolor(leftborder and not rightborder ? color.aqua : na, transp=70)\n\nCount bars in a dataset¶\n\nGet a count of all the bars in the loaded dataset. Might be useful for calculating flexible lookback periods based on number of bars.\n\n//@version=4\nstudy(\"Bar Count\", overlay=true, scale=scale.none)\nplot(bar_index + 1, style=plot.style_histogram)\n\nEnumerate bars in a day¶\n\n//@version=4\nstudy(\"My Script\", overlay=true, scale=scale.none)\n\nis_new_day() =>\nd = dayofweek\nna(d) or d != d\n\nFind the highest and lowest values for the entire dataset¶\n\n//@version=4\nstudy(\"My Script\")\n\nbiggest(series) =>\nmax = 0.0\nmax := nz(max, series)\nif series > max\nmax := series\nmax\n\nsmallest(series) =>\nmin = 0.0\nmin := nz(min, series)\nif series < min\nmin := series\nmin\n\nplot(biggest(close), color=color.green)\nplot(smallest(close), color=color.red)\n\nQuery the last non-na value¶\n\nYou can use the script below to avoid gaps in a series:\n\n//@version=4\nstudy(\"My Script\")\nseries = close >= open ? close : na\nvw = valuewhen(not na(series), series, 0)\nplot(series, style=plot.style_linebr, color=color.red) // series has na values\nplot(vw) // all na values are replaced with the last non-empty value\nOptions v: v4\nLanguages\nen\nVersions\nv3\nv4\nv5" ]
[ null, "https://br.tradingview.com/pine-script-docs/en/v4/_images/Buy_sell_chart1.png", null, "https://br.tradingview.com/pine-script-docs/en/v4/_images/Buy_sell_chart2.png", null, "https://br.tradingview.com/pine-script-docs/en/v4/_images/Wiki_howto_range_analysis.png", null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.6376871,"math_prob":0.93686885,"size":6926,"snap":"2022-05-2022-21","text_gpt3_token_len":1875,"char_repetition_ratio":0.11340653,"word_repetition_ratio":0.022201665,"special_character_ratio":0.2814034,"punctuation_ratio":0.14307116,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.99184513,"pos_list":[0,1,2,3,4,5,6],"im_url_duplicate_count":[null,1,null,1,null,1,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2022-01-20T14:03:26Z\",\"WARC-Record-ID\":\"<urn:uuid:4bfdaf93-587c-4331-95e9-148df741039c>\",\"Content-Length\":\"47439\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:ad43c8b4-61ed-4e5c-812b-250ae3c53e05>\",\"WARC-Concurrent-To\":\"<urn:uuid:ca46d2f9-da41-4768-92cb-e4d92c6363e0>\",\"WARC-IP-Address\":\"13.249.42.110\",\"WARC-Target-URI\":\"https://br.tradingview.com/pine-script-docs/en/v4/appendix/HOWTOs.html\",\"WARC-Payload-Digest\":\"sha1:WL63FVHWPON5DKS222DYIP2RDLJEPWUF\",\"WARC-Block-Digest\":\"sha1:BWJIZIQ6X6T5TUCWB5HRXUUSERIO7HZQ\",\"WARC-Identified-Payload-Type\":\"application/xhtml+xml\",\"warc_filename\":\"/cc_download/warc_2022/CC-MAIN-2022-05/CC-MAIN-2022-05_segments_1642320301863.7_warc_CC-MAIN-20220120130236-20220120160236-00449.warc.gz\"}"}
https://hardystonecompany.co.uk/blog/how-to-calculate-paving-area/
[ "", null, "", null, "Posted in\n17/11/2019\n\n# How To Calculate Paving Area\n\n## Calculating Paving surface area\n\nIt's a long time since we did this at school, right?\nAnd if you don't use measurements in your everyday life it can be difficult to remember how to do this.\nTo calculate the square meters of paved area:\n• Break your area up into squares or rectangles and multiply the length by the width.\n• Add up the total number of square meters.\n• You will need to take into account the number of cuts and the laying pattern chosen. You will also need to allow for wastage.\n• The quantity of pavers or flags needed will depend on the area to be paved, and the paver or slab chosen.  In Project packs (mixed sizes to create a pattern), there are generally enough pavers to cover 18.9 sq meters but check each product as some are different.\nWork out the area to be paved in square meters.Length(m) x width(m) = area(m²).", null, "(Diagram courtesy of Pacific Brick Paving)If you choose to calculate using feet and inches calculate the total area into square feet by using the same method as above and then multiply by .0929 to convert to square meters. When calculating pavers / slabs needed add an additional 5%. Allowing for complexity of the design, cuts and breaks.Note: To work out the number of slabs needed for single sized slabs:If a slab measures 600 x 600mm  or 0.6 x 0.6 meters = 0.36 sq Meters.  If using a 600mm x 600mm slab, multiply the area you need by 0.36 - this will give you the number of slabs needed (we are happy to work this out for you if you know the area in meters required).\n\nIF YOU NEED MORE HELP PLEASE VISIT www.hardystonecompany.co.uk or call 01274 960612", null, "### Search", null, "" ]
[ null, "https://www.facebook.com/tr", null, "data:image/svg+xml,%3Csvg%20xmlns='http://www.w3.org/2000/svg'%20viewBox='0%200%200%200'%3E%3C/svg%3E", null, "data:image/svg+xml,%3Csvg%20xmlns='http://www.w3.org/2000/svg'%20viewBox='0%200%20720%20643'%3E%3C/svg%3E", null, "data:image/svg+xml,%3Csvg%20xmlns='http://www.w3.org/2000/svg'%20viewBox='0%200%200%200'%3E%3C/svg%3E", null, "data:image/svg+xml,%3Csvg%20xmlns='http://www.w3.org/2000/svg'%20viewBox='0%200%200%200'%3E%3C/svg%3E", null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.9009493,"math_prob":0.9736204,"size":1465,"snap":"2023-40-2023-50","text_gpt3_token_len":346,"char_repetition_ratio":0.1266256,"word_repetition_ratio":0.007490637,"special_character_ratio":0.23822525,"punctuation_ratio":0.09354839,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9711121,"pos_list":[0,1,2,3,4,5,6,7,8,9,10],"im_url_duplicate_count":[null,null,null,null,null,null,null,null,null,null,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2023-12-08T13:27:08Z\",\"WARC-Record-ID\":\"<urn:uuid:01f678fe-1869-4494-8fca-e441390f0c16>\",\"Content-Length\":\"267614\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:a650d3e8-6015-4d39-8566-51ac25249b7c>\",\"WARC-Concurrent-To\":\"<urn:uuid:4d893d65-8427-4b5f-8a48-58533fd0d640>\",\"WARC-IP-Address\":\"45.76.141.72\",\"WARC-Target-URI\":\"https://hardystonecompany.co.uk/blog/how-to-calculate-paving-area/\",\"WARC-Payload-Digest\":\"sha1:2M34FJWWZPTRZ5BWF4UQPOQ4VNYMCM73\",\"WARC-Block-Digest\":\"sha1:6YDSULMWFKRBGSNVEORVYP4XGJZL7FRU\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2023/CC-MAIN-2023-50/CC-MAIN-2023-50_segments_1700679100745.32_warc_CC-MAIN-20231208112926-20231208142926-00272.warc.gz\"}"}
https://bugs.python.org/msg313045
[ "#", null, "Author elias elias 2018-02-28.03:10:50 -1.0 Yes <[email protected]>\nContent\n```Usually, a positive finite number modulo infinity is itself. But modding a positive fraction by infinity produces nan:\n\n>>> from fractions import Fraction\n>>> from math import inf\n>>> 3 % inf\n3.0\n>>> 3.5 % inf\n3.5\n>>> Fraction('1/3') % inf\nnan\n\nLikewise, a positive number modulo negative infinity is usually negative infinity, a negative number modulo infinity is usually infinity, and a negative number modulo negative infinity is usually itself, unless the number doing the modding is a fraction, in which case it produces nan.\n\nI think fractions should behave like other numbers in cases like these. I don't think this comes up very often in practical situations, but it is inconsistent behavior that may surprise people.\n\nI looked at the fractions module. It seems like this can be fixed by putting the following lines at the top of the __mod__ method of the Fraction class:\n\nif b == math.inf:\nif a >= 0:\nreturn a\nelse:\nreturn math.inf\nelif b == -math.inf:\nif a >= 0:\nreturn -math.inf\nelse:\nreturn a\n\nIf that is too verbose, it can also be fixed with these lines, although this is less understandable IMO:\n\nif math.isinf(b):\nreturn a if (a >= 0) == (b > 0) else math.copysign(math.inf, b)\n\nI noticed this in Python 3.6.4 on OS X 10.12.6. If anyone wants, I can come up with a patch with some tests.```\nHistory\nDate User Action Args\n2018-02-28 03:10:51eliassetrecipients: + elias\n2018-02-28 03:10:51eliassetmessageid: <[email protected]>" ]
[ null, "https://bugs.python.org/@@file/python-logo.gif", null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.7627127,"math_prob":0.71245736,"size":1805,"snap":"2020-34-2020-40","text_gpt3_token_len":536,"char_repetition_ratio":0.11715713,"word_repetition_ratio":0.02189781,"special_character_ratio":0.34238228,"punctuation_ratio":0.18041237,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9611697,"pos_list":[0,1,2],"im_url_duplicate_count":[null,null,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2020-09-28T06:08:56Z\",\"WARC-Record-ID\":\"<urn:uuid:c0440595-bfb0-4dee-b8d6-dd1f38e7f148>\",\"Content-Length\":\"12514\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:de986a89-4989-4b83-93dc-30a8939f4653>\",\"WARC-Concurrent-To\":\"<urn:uuid:fcdb2f63-1dfe-48fa-b5c5-bf4f953cbed8>\",\"WARC-IP-Address\":\"188.166.48.69\",\"WARC-Target-URI\":\"https://bugs.python.org/msg313045\",\"WARC-Payload-Digest\":\"sha1:2ECNW7RBZHFP7MWXCUIBNDK3M6FQJBU6\",\"WARC-Block-Digest\":\"sha1:TLWLHXESOUTAPBXOZCYVQ462WSTZZB2Y\",\"WARC-Identified-Payload-Type\":\"application/xhtml+xml\",\"warc_filename\":\"/cc_download/warc_2020/CC-MAIN-2020-40/CC-MAIN-2020-40_segments_1600401585213.82_warc_CC-MAIN-20200928041630-20200928071630-00735.warc.gz\"}"}
https://math.stackexchange.com/questions/125186/why-not-to-extend-the-set-of-natural-numbers-to-make-it-closed-under-division-by
[ "Why not to extend the set of natural numbers to make it closed under division by zero?\n\nWe add negative numbers and zero to natural sequence to make it closed under subtraction, the same thing happens with division (rational numbers) and root of -1 (complex numbers).\n\nWhy this trick isn't performed with division by zero?\n\n• because it doesn't work as nicely. – Dustan Levenstein Mar 27 '12 at 19:53\n• Did you look over this previous question about defining division by zero? – Arturo Magidin Mar 27 '12 at 19:56\n• You want the distributive law to hold unrestrictely and then it follows that $0\\cdot x=0$ for all $x$. Thus it is impossible to construct the reciprocal of $0$, i.e. to divide by $0$. – Andrea Mori Mar 27 '12 at 19:59\n• As I mentioned in that previous question: you are going to lose things by doing this extension. The question is whether what you gain makes up for what you lose. When going from the integers to the rationals, for example, you lose the fact that any nonempty set of positives has a smallest element. When going from $\\mathbb{R}$ to $\\mathbb{C}$, you lose the fact that you have an ordered field (but you gain the Fundamental Theorem of Algebra). If you add a \"division by zero\", you are going to lose a lot of the basic algebraic properties you are familiar with; do you gain enough to make it up? – Arturo Magidin Mar 27 '12 at 20:04\n• There is an algebraic structure in which division by zero is always defined. Is is called a wheel. Note that every commutative ring can be extended to a wheel. (We lose some algebraic properties, though.) – Dejan Govc Mar 27 '12 at 20:08\n\nYou can add division by zero to the rational numbers if you're careful. Let's say that a \"number\" is a pair of integers written in the form $a\\over b$. Normally, we would also say that $b\\not=0$, but today we'll omit that. Let's call numbers of the form $a\\over 0$ warped. Numbers that aren't warped are straight.\n\nWe usually like to say that ${a\\over b} = {c\\over d}$ if $ad=bc$, but today we'll restrict that and say it holds only if neither $b$ nor $d$ is 0. Otherwise we'll get that ${1\\over 0} = {2\\over 0} = {-17\\over 0}$, which isn't as interesting as it might be. But even with the restriction, we still have ${1\\over 2}={2\\over 4}$, so the straight numbers still behave as we expect. In particular, we still have the regular integers: the integer $m$ appears as the straight number $m\\over 1$.\n\nAddition is defined as usual: ${a\\over b} + {c\\over d} = {ad+bc\\over bd}$. So is multiplication: ${a\\over b} \\cdot {c\\over d} = {ac\\over bd}$. Note that any sum or product that includes a warped number has a warped result, and any sum or product that includes $0\\over 0$ has a the result $0\\over 0$. The warped numbers are like a hole that you can fall into but you can't climb out of, and $0\\over 0$ is a deeper hole inside the first hole.\n\nNow, as Chris Eagle indicated, something must go wrong, but it's not as bad as it might seem at first. Addition and multiplication are still commutative and associative. You can't actually prove that $0=1$. Let's go through Chris Eagle's proof and see what goes wrong. Chris Eagle starts by writing $1/0 = x$ and then multiplying both sides by 0. 0 in our system is $0\\over 1$, so we get ${1\\over 0}{0\\over 1} = x\\cdot 0$, then ${0\\over 0} = x\\cdot 0$. Right away the proof fails, because it wants to have 1 on the left-hand side, but we have $0\\over 0$ instead, which is different.\n\nSo what does go wrong? Not every number has a reciprocal. The reciprocal of $x$ is a number $y$ such that $xy = 1$. Warped numbers do not have reciprocals. You might want the reciprocal of $2\\over 0$ to be $0\\over 2$, but ${2\\over 0}\\cdot{0\\over 2} = {0\\over 0}$, not ${1\\over 1}$. So any time you want to take the reciprocal of a number, you have to prove first that it's not warped.\n\nSimilarly, warped numbers do not have negatives. There is no number $x$ with ${1\\over 0}+x = 0$. Usually $x-y$ is defined to be $x + (-y)$, and that no longer works, so if we want subtraction we have to find something else. We can work around that easily by defining ${a\\over b} - {c\\over d} = {ad-bc\\over bd}$. But then we lose the property that $x - y + y = x$, which only holds for straight numbers. Similarly, we can define division, but if you want to simplify $xy÷y$ to $x$ you'll have to prove first that $y$ is straight.\n\nWhat else goes wrong? We said we want ${a\\over b} = {ka\\over kb}$ when $a\\over b$ is straight and $k\\not=0$; for example we want ${1\\over 2}={10\\over 20}$. We would also like ${a\\over b}+{c\\over d} = {ka\\over kb} + {c\\over d}$ under the same conditions. If $c\\over d$ is straight, this is fine, but if $d=0$ then we get ${bc\\over 0} = {kbc\\over 0}$. Since $bc$ could be 1, and $k$ can be any nonzero integer, we would have ${p\\over 0} = {q\\over 0}$ for all nonzero $p$ and $q$. In other words, all our warped numbers are equal, except for $0\\over 0$. We have a choice about whether to accept this. The alternative is to say the law that $a + c = b + c$ whenever $a = b$ applies only when $c$ is straight.\n\nAt this point you should start to see why nobody does this. Adding a value $c$ to both sides of an equation is an essential technique. If we throw out techniques as important as that, we won't be able to solve any problems. On the other hand if we keep the techniques and make all the warped numbers equal, then they don't really tell us anything about the answer except that we must have used a warped number somewhere along the way. You never get any useful results from arithmetic on warped numbers: ${a\\over 0} + {b\\over 0} = {0\\over 0}$ for all $a$ and $b$. And once you're into the warp zone you can't get back out; the answer to any question involving warped numbers is a warped number itself. So if you want a useful result out, you must avoid using warped numbers in your calculations.\n\nSo let's say that any calculation that includes a warped number anywhere is \"spoiled\", because we're not going to get any useful answer out of it at the end. At best we'll get a warped answer, and we're most likely to get $0\\over 0$, which tells us nothing. We might like some assurance that a particular calculation is not going to be spoiled. How can we gain that assurance? By making sure we never use warped numbers. How can we avoid warped numbers? Oh... by forbidding division by zero!\n\n• No, I don't think it would be fair to say that. $\\mathbb C$ is enormously useful and you sacrifice nothing when you use it. The warped numbers are nearly worthless. – MJD Mar 27 '12 at 21:43\n• This is an interesting construction, something like constructing the field of fractions but giving a different structure. Does it have a standard name? – Nate Eldredge Mar 28 '12 at 17:35\n• @000 they really shouldn't be considered like that though; complex numbers extend the reals and maintain most useful properties. If they did screw up like this the comparison would be fair, but then no one would have bothered defining $i$ in the first place. – Robert Mastragostino Jun 20 '13 at 1:35\n• It's fair to call $0/2$ the recripocal of $2/0$; but it wouldn't be fair to call it the inverse of $2/0$. – Hurkyl Aug 22 '14 at 6:20\n• I nearly didn't read this question, but this answer has made me glad I did. Excellently done. – Stella Biderman Mar 30 '17 at 17:38\n\nI would also like to point out that the IEEE floating-point specification allows division by zero. It incorporates three nonstandard numbers, called infinity, negative infinity, and \"NaN\", which is short for \"Not a Number\". $a\\over 0$ is infinity, negative infinity, or NaN according as whether $a$ is positive, negative, or zero, respectively.\n\nInfinity represents an overflow condition. So you might add two very large, positive numbers and get a result of infinity. As a result, IEEE floating point numbers fail to obey many of the usual mathematical laws. For example, $(a+b)+c = a+(b+c)$ may fail: suppose $a = b = -c$ and all are large. If $a+b$ overflows, the left-hand side of the equality will be infinity, but the right-hand side will be the finite quantity $a$.\n\nThe behavior in some cases can be very subtle and counter-intuitive. But it is widely used in practice.\n\n• Maybe it would be a great addition to elucidate on, \"The behavior in some cases can be very subtle and counter-intuitive. But it is widely used in practice.\" I find myself quite curious about why it is widely used if it is counter-intuitive. – 000 Mar 27 '12 at 21:33\n• It's widely-used because it's the only thing that can be feasibly constructed in hardware. If your hardware can store numbers between -32768 and +32767, and you add 20000 + 20000, it has to do something, and that something is to report an overflow condition. But overflow (and underflow as well) depends on the order in which the operations are performed, as my example shows. So the numbers do not always behave like mathematically nice numbers, and that is the counter-intuitive part. – MJD Mar 27 '12 at 21:41\n• Rather apropos... – J. M. is a poor mathematician Mar 28 '12 at 16:35\n• It is widely used, in that next to nobody really thinks about overflow or rounding errors. And all hell breaks loose when it turns up... – vonbrand May 22 '14 at 23:05\n• Really wish they had used 0/0 = 0 as well. That way 0/a would be 0 for all a, and we would no longer have to deal with division by zero errors with floating point arithmetic at all. It seems fairly intuitive--for example, with averages and percentages: averaging zero elements results in an average of 0 and when you attempt something 0 times you have a success and failure rate of 0%. – Muhd Aug 7 '15 at 19:05\n\nHere's a proof that $1/0$ can't exist:\nSuppose $1/0=x$.\nThen $1=0 \\cdot x$.\nSo $1=(0+0) \\cdot x$.\nSo $1=0\\cdot x + 0 \\cdot x=1+1$.\nSo $0=1$. Contradiction.\n\nThus, if we're going to extend our number systems so that dividing by $0$ makes sense, we need to change things so one step in this proof doesn't work. Let's have a look at what properties the proof used.\n\nFirst I assumed that if $a/b=c$, then $a=b \\cdot c$. This is the defining property of division. If we give it up, the resulting thing won't deserve to be called division at all.\n\nThen I assumed that $0=0+0$. Making this false would be a pretty radical redefinition of addition: none of the extensions you mention involve redefining addition for the numbers we have already.\n\nNext I used that $(a+b)\\cdot c=a \\cdot c + b \\cdot c$. This is a key relationship between addition and multiplication. You could give this one up, but the result will be pretty weird.\n\nNext I used that, if $a=a+b$, then $0=b$. Again, you could give up this key property of addition, but you'll get a weird structure as a result.\n\nFinally I used that $1$ does not equal $0$. Again, an \"extension\" which messes with the numbers we have already like that is a pretty odd extension.\n\nIn short, while you can extend your number system to allow division by $0$, doing so requires breaking far more fundamental rules of logic and arithmetic than needed in constructing the rationals or the complexes. As a result, the structures you get are not very pleasant and not all that useful.\n\n• Why don't you stop your proof after $1=0\\cdot x$ therefore $1=0$? – Gerenuk Mar 27 '12 at 20:17\n• Because I want to explain exactly why $0 \\cdot x=0$ is something we want to keep, since to my mind it's less obviously important and less fundamental than the other properties I mention. – Chris Eagle Mar 27 '12 at 20:19\n• You can stop at $1=0\\cdot x + 0 \\cdot x$ because you already know that $0 \\cdot x=1$... – N. S. Mar 27 '12 at 21:19\n• @N. S. good point – Chris Eagle Mar 27 '12 at 21:20\n• No, $0+x=x$ is the defining property of $0$. – Chris Eagle Mar 28 '12 at 10:08\n\nThe \"trick\" of extending the number system you ask about is addressed by Patrick Suppes in his Introduction to Logic, Chapter 8, Sections 5 and 7, titled respectively \"The Problem of Division by Zero\" and \"Five Approaches to Division by Zero.\" (These sections begin on pages 181 and 184 of the linked PDF, not the pages listed in the table of contents.) Your trick is the fourth of the five approaches listed in Section 8.7. As Suppes notes, this approach is the \"solution which is probably most consonant with ordinary mathematical practice.\"\n\nOne example of approach four is the Riemann Sphere or extended complex plane. Some discussion of it in relation to division by 0 may be found in the entry for Division by Zero at MathWorld–A Wolfram Web Resource.\n\nThere are, however, contexts in which division by zero can be considered as defined. For example, division by zero $z/0$ for $z \\in \\mathbb{C}^* \\neq 0$ in the extended complex plane $\\mathbb{C}-^*$ is defined to be a quantity known as complex infinity.\n\nWhat is gained? Roger Penrose stresses two advantages in his books The Road to Reality, The Emperor's New Mind, and Shadows of the Mind:\n\n1. Constructing a map without a hole\n2. Modeling subatomic phenomena\n\nCan approach four be carried a step further? I've done some work in an effort to show that yes, it can. The extra step is to extend the number system in the course of division by a new number zero. My paper, Replacing 0: A NonEuclidean Arithmetic, explores your question with this in mind. As the subtitle suggests, the example of nonEuclidean geometries is followed by altering the axioms of standard arithmetic to allow a new number zero.\n\n1. The different number of nothing is first defined in terms of division and then subtraction (instead of the usual way of first defining it in terms of subtraction).\n2. The new number zero has been designed to replace the number 0 in such a way that division by it results in quotients that are not real or complex as allowed by the 4th approach.\n3. Quotients are unique, unlike with complex infinity in $\\mathbb{C}-^*$.\n4. When dividends are limited to the reals, a real plane can be constructed.\n5. The notation used turns out to match a notation Penrose uses in The Road to Reality for $n$-real-dimensional space so it is easy to see that spaces of higher dimension can be constructed.\n\nThe argument that \"it's 'better' for algebraic structures to have such-and-such properties and they don't work if you can divide by zero\" is sort of missing the point.\n\nThe integers and the rational numbers both have clear interpretations: the integers represent discrete positions on, or translations of, a number line (or translations of the natural numbers themselves, where the elements are allowed to \"fall off\" the end), while the (positive) rational numbers represent all possible commensurability relations between lengths. They happen to be constructed from the natural numbers in ZFC but they have an importance in their own right as well.\n\nSo, the real question to ask is, what are you trying to model with division by zero? If you divide a cake into $n$ parts without making overlapping cuts, you have to make $n - 1$ cuts. So if you want to divide by zero you have to say what it means to cut something -1 times. If you generalize the meaning of division to include quotienting a set by a group then this is still the case: there is no group with zero elements. This suggests considering semigroup actions, but in any case it is better to decide what the meaning of division (or reciprocal) is first, and then work out its properties afterwards, instead of blindly asserting some axioms and hoping they give you something interesting. Then you will understand why certain things are possible or not.\n\nOne place where division by zero has a clear meaning is in the projective line. There, taking the reciprocal means reflecting over the $y = x$ line, and if the horizontal line is zero, the its reciprocal is the vertical line, aka $\\infty$.\n\nI am not an expert but from reason and experience, I think that by introducing number lines of zero and infinity as an extension to real number line, undefined expressions like $\\frac{0}{0},\\frac{x}{0},0\\times\\infty,$etc. can be well defined.\n\nThe number line of zero is as follows:", null, "The number line of infinity is as follows:", null, "Note-: Both these number lines have negatives too. Separate real number lines exist at every point of infinity number line and separate infinitesimal number lines exist at every point of real number line.\n\nNow if we want to compute $0\\times\\infty$, we should first define where $0$ stands in the zero number line and also where $\\infty$ stands in the infinity number line. For example: $$(0\\times3)\\times(\\infty\\times5)=(\\infty^{-1}\\times3)\\times(\\infty\\times5)=3\\times5\\times\\infty^{-1}\\times\\infty=15$$\n\n• Nice answer, Joe. You are using the symbol $\\infty$ the way John Wallis did in the 17th century. – Mikhail Katz Apr 21 '17 at 11:34" ]
[ null, "https://i.stack.imgur.com/bO14C.png", null, "https://i.stack.imgur.com/nW2V1.png", null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.9383815,"math_prob":0.99060863,"size":11652,"snap":"2019-26-2019-30","text_gpt3_token_len":2961,"char_repetition_ratio":0.13075206,"word_repetition_ratio":0.04019608,"special_character_ratio":0.2572949,"punctuation_ratio":0.10112829,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.998341,"pos_list":[0,1,2,3,4],"im_url_duplicate_count":[null,6,null,6,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2019-06-19T07:07:16Z\",\"WARC-Record-ID\":\"<urn:uuid:49ff633d-20fe-4856-8086-1b19a9b7ac43>\",\"Content-Length\":\"204464\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:abff881d-2031-4b35-ade8-95012a177bca>\",\"WARC-Concurrent-To\":\"<urn:uuid:b8f388bb-25d6-4982-8935-d02370384708>\",\"WARC-IP-Address\":\"151.101.129.69\",\"WARC-Target-URI\":\"https://math.stackexchange.com/questions/125186/why-not-to-extend-the-set-of-natural-numbers-to-make-it-closed-under-division-by\",\"WARC-Payload-Digest\":\"sha1:KE5OOBXMVOUFFWEVAKYGHCVONAUWZN3N\",\"WARC-Block-Digest\":\"sha1:5CWMNUS7M7NYO7OGNETBUJIKXHER42VD\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2019/CC-MAIN-2019-26/CC-MAIN-2019-26_segments_1560627998923.96_warc_CC-MAIN-20190619063711-20190619085711-00027.warc.gz\"}"}
https://www.nag.com/numeric/nl/nagdoc_26/nagdoc_fl26/html/f07/f07bef.html
[ "# NAG Library Routine Document\n\n## 1Purpose\n\nf07bef (dgbtrs) solves a real band system of linear equations with multiple right-hand sides,\n $AX=B or ATX=B ,$\nwhere $A$ has been factorized by f07bdf (dgbtrf).\n\n## 2Specification\n\nFortran Interface\n Subroutine f07bef ( n, kl, ku, nrhs, ab, ldab, ipiv, b, ldb, info)\n Integer, Intent (In) :: n, kl, ku, nrhs, ldab, ipiv(*), ldb Integer, Intent (Out) :: info Real (Kind=nag_wp), Intent (In) :: ab(ldab,*) Real (Kind=nag_wp), Intent (Inout) :: b(ldb,*) Character (1), Intent (In) :: trans\n#include nagmk26.h\n void f07bef_ ( const char *trans, const Integer *n, const Integer *kl, const Integer *ku, const Integer *nrhs, const double ab[], const Integer *ldab, const Integer ipiv[], double b[], const Integer *ldb, Integer *info, const Charlen length_trans)\nThe routine may be called by its LAPACK name dgbtrs.\n\n## 3Description\n\nf07bef (dgbtrs) is used to solve a real band system of linear equations $AX=B$ or ${A}^{\\mathrm{T}}X=B$, the routine must be preceded by a call to f07bdf (dgbtrf) which computes the $LU$ factorization of $A$ as $A=PLU$. The solution is computed by forward and backward substitution.\nIf ${\\mathbf{trans}}=\\text{'N'}$, the solution is computed by solving $PLY=B$ and then $UX=Y$.\nIf ${\\mathbf{trans}}=\\text{'T'}$ or $\\text{'C'}$, the solution is computed by solving ${U}^{\\mathrm{T}}Y=B$ and then ${L}^{\\mathrm{T}}{P}^{\\mathrm{T}}X=Y$.\nGolub G H and Van Loan C F (1996) Matrix Computations (3rd Edition) Johns Hopkins University Press, Baltimore\n\n## 5Arguments\n\n1:     $\\mathbf{trans}$ – Character(1)Input\nOn entry: indicates the form of the equations.\n${\\mathbf{trans}}=\\text{'N'}$\n$AX=B$ is solved for $X$.\n${\\mathbf{trans}}=\\text{'T'}$ or $\\text{'C'}$\n${A}^{\\mathrm{T}}X=B$ is solved for $X$.\nConstraint: ${\\mathbf{trans}}=\\text{'N'}$, $\\text{'T'}$ or $\\text{'C'}$.\n2:     $\\mathbf{n}$ – IntegerInput\nOn entry: $n$, the order of the matrix $A$.\nConstraint: ${\\mathbf{n}}\\ge 0$.\n3:     $\\mathbf{kl}$ – IntegerInput\nOn entry: ${k}_{l}$, the number of subdiagonals within the band of the matrix $A$.\nConstraint: ${\\mathbf{kl}}\\ge 0$.\n4:     $\\mathbf{ku}$ – IntegerInput\nOn entry: ${k}_{u}$, the number of superdiagonals within the band of the matrix $A$.\nConstraint: ${\\mathbf{ku}}\\ge 0$.\n5:     $\\mathbf{nrhs}$ – IntegerInput\nOn entry: $r$, the number of right-hand sides.\nConstraint: ${\\mathbf{nrhs}}\\ge 0$.\n6:     $\\mathbf{ab}\\left({\\mathbf{ldab}},*\\right)$ – Real (Kind=nag_wp) arrayInput\nNote: the second dimension of the array ab must be at least $\\mathrm{max}\\phantom{\\rule{0.125em}{0ex}}\\left(1,{\\mathbf{n}}\\right)$.\nOn entry: the $LU$ factorization of $A$, as returned by f07bdf (dgbtrf).\n7:     $\\mathbf{ldab}$ – IntegerInput\nOn entry: the first dimension of the array ab as declared in the (sub)program from which f07bef (dgbtrs) is called.\nConstraint: ${\\mathbf{ldab}}\\ge 2×{\\mathbf{kl}}+{\\mathbf{ku}}+1$.\n8:     $\\mathbf{ipiv}\\left(*\\right)$ – Integer arrayInput\nNote: the dimension of the array ipiv must be at least $\\mathrm{max}\\phantom{\\rule{0.125em}{0ex}}\\left(1,{\\mathbf{n}}\\right)$.\nOn entry: the pivot indices, as returned by f07bdf (dgbtrf).\n9:     $\\mathbf{b}\\left({\\mathbf{ldb}},*\\right)$ – Real (Kind=nag_wp) arrayInput/Output\nNote: the second dimension of the array b must be at least $\\mathrm{max}\\phantom{\\rule{0.125em}{0ex}}\\left(1,{\\mathbf{nrhs}}\\right)$.\nOn entry: the $n$ by $r$ right-hand side matrix $B$.\nOn exit: the $n$ by $r$ solution matrix $X$.\n10:   $\\mathbf{ldb}$ – IntegerInput\nOn entry: the first dimension of the array b as declared in the (sub)program from which f07bef (dgbtrs) is called.\nConstraint: ${\\mathbf{ldb}}\\ge \\mathrm{max}\\phantom{\\rule{0.125em}{0ex}}\\left(1,{\\mathbf{n}}\\right)$.\n11:   $\\mathbf{info}$ – IntegerOutput\nOn exit: ${\\mathbf{info}}=0$ unless the routine detects an error (see Section 6).\n\n## 6Error Indicators and Warnings\n\n${\\mathbf{info}}<0$\nIf ${\\mathbf{info}}=-i$, argument $i$ had an illegal value. An explanatory message is output, and execution of the program is terminated.\n\n## 7Accuracy\n\nFor each right-hand side vector $b$, the computed solution $x$ is the exact solution of a perturbed system of equations $\\left(A+E\\right)x=b$, where\n $E≤ckεPLU ,$\n$c\\left(k\\right)$ is a modest linear function of $k={k}_{l}+{k}_{u}+1$, and $\\epsilon$ is the machine precision. This assumes $k\\ll n$.\nIf $\\stackrel{^}{x}$ is the true solution, then the computed solution $x$ satisfies a forward error bound of the form\n $x-x^∞ x∞ ≤ckcondA,xε$\nwhere $\\mathrm{cond}\\left(A,x\\right)={‖\\left|{A}^{-1}\\right|\\left|A\\right|\\left|x\\right|‖}_{\\infty }/{‖x‖}_{\\infty }\\le \\mathrm{cond}\\left(A\\right)={‖\\left|{A}^{-1}\\right|\\left|A\\right|‖}_{\\infty }\\le {\\kappa }_{\\infty }\\left(A\\right)$.\nNote that $\\mathrm{cond}\\left(A,x\\right)$ can be much smaller than $\\mathrm{cond}\\left(A\\right)$, and $\\mathrm{cond}\\left({A}^{\\mathrm{T}}\\right)$ can be much larger (or smaller) than $\\mathrm{cond}\\left(A\\right)$.\nForward and backward error bounds can be computed by calling f07bhf (dgbrfs), and an estimate for ${\\kappa }_{\\infty }\\left(A\\right)$ can be obtained by calling f07bgf (dgbcon) with ${\\mathbf{norm}}=\\text{'I'}$.\n\n## 8Parallelism and Performance\n\nf07bef (dgbtrs) is threaded by NAG for parallel execution in multithreaded implementations of the NAG Library.\nf07bef (dgbtrs) makes calls to BLAS and/or LAPACK routines, which may be threaded within the vendor library used by this implementation. Consult the documentation for the vendor library for further information.\nPlease consult the X06 Chapter Introduction for information on how to control and interrogate the OpenMP environment used within this routine. Please also consult the Users' Note for your implementation for any additional implementation-specific information.\n\nThe total number of floating-point operations is approximately $2n\\left(2{k}_{l}+{k}_{u}\\right)r$, assuming $n\\gg {k}_{l}$ and $n\\gg {k}_{u}$.\nThis routine may be followed by a call to f07bhf (dgbrfs) to refine the solution and return an error estimate.\nThe complex analogue of this routine is f07bsf (zgbtrs).\n\n## 10Example\n\nThis example solves the system of equations $AX=B$, where\n $A= -0.23 2.54 -3.66 0.00 -6.98 2.46 -2.73 -2.13 0.00 2.56 2.46 4.07 0.00 0.00 -4.78 -3.82 and B= 4.42 -36.01 27.13 -31.67 -6.14 -1.16 10.50 -25.82 .$\nHere $A$ is nonsymmetric and is treated as a band matrix, which must first be factorized by f07bdf (dgbtrf).\n\n### 10.1Program Text\n\nProgram Text (f07befe.f90)\n\n### 10.2Program Data\n\nProgram Data (f07befe.d)\n\n### 10.3Program Results\n\nProgram Results (f07befe.r)\n\n© The Numerical Algorithms Group Ltd, Oxford, UK. 2017" ]
[ null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.7615076,"math_prob":0.9995852,"size":4625,"snap":"2021-31-2021-39","text_gpt3_token_len":1268,"char_repetition_ratio":0.13330448,"word_repetition_ratio":0.14828898,"special_character_ratio":0.26162162,"punctuation_ratio":0.175,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.99991703,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2021-09-21T18:05:14Z\",\"WARC-Record-ID\":\"<urn:uuid:270e2902-8f73-4f09-b55c-14cc41b83557>\",\"Content-Length\":\"27652\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:8adafb4e-640b-434c-80ec-9cd372028b1c>\",\"WARC-Concurrent-To\":\"<urn:uuid:559157fb-e917-499f-bd38-4b9a88641676>\",\"WARC-IP-Address\":\"78.129.168.4\",\"WARC-Target-URI\":\"https://www.nag.com/numeric/nl/nagdoc_26/nagdoc_fl26/html/f07/f07bef.html\",\"WARC-Payload-Digest\":\"sha1:G45IZNOS73SLUCWZFQLOSS5V525DKU7W\",\"WARC-Block-Digest\":\"sha1:R3RGH7T6V3XRIQCAFUIL2XQCOPDM5LH5\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2021/CC-MAIN-2021-39/CC-MAIN-2021-39_segments_1631780057225.57_warc_CC-MAIN-20210921161350-20210921191350-00087.warc.gz\"}"}
https://cs.stackexchange.com/questions/68095/asymptotic-improvements-in-hardware/68124
[ "# Asymptotic Improvements in Hardware?\n\nOne of the main benefits of algorithm analysis, is that it offers asymptotic improvements to complexity as opposed to hardware, which offers only constant improvements. E.g switching to a super computer from a workstation might give a $\\times 1,000,000$ increase in speed, but if that supercomputer is running a linear search on a sorted array, it will eventually be trumped by a desktop running a binary search for large enough problem sizes.\n\nMy question is this:\n\nAre there any improvements in hardware(theoretical or practical) that could offer an asymptotic speedup over pre-existing hardware?\n\nIn this case pre-existing refers to at least 3rd generation computing technology. I'm not really interested in speedups over vacuum tubes.\n\nQuantum computers, if they ever get built, will be asymptotically faster than existing computers in certain tasks. Limited quantum computers might already exist, though this is a contentious issue.\n\n• What's the speedup though? Polynomial or exponential? Dec 31, 2016 at 9:43\n• Depends on the task. Quantum computing is a wide topic, and I am not going to summarize it in this answer. There is plenty of information about quantum \"supremacy\" on the internet. Dec 31, 2016 at 9:44\n\nThree-dimensional memory systems can improve the asymptotic complexity.\n\nSuppose the CPU is in the center of the world, and the rest of the world is filled with memory cells. The CPU broadcasts a request to memory and waits a finite amount of time for a response.\n\nIf the memory is in the form of a 2-dimensional plane, then the CPU waiting $n$ nanoseconds can reach $\\Theta(n^2)$ memory cells.\n\nBut if the memory is in the form of 3-dimensional space, then the CPU waiting the same $n$ nanoseconds can reach $\\Theta(n^3)$ storage cells.\n\nWhen a program needs to use $m$ memory cells for its execution, the 2D memory technology has a latency of $\\Theta(\\sqrt{n})$ per operation, whereas the the 3D memory has a latency of $\\Theta(\\sqrt{n})$.\n\n• This sounds amazing. Why hasn't this been done yet? Jan 1, 2017 at 7:44\n• @TobiAlafin Because the limiting factor is the number of gates, not the distance between CPU and memory. Actual memories are reached through a single bus; the number of cells that the CPU can access in time $n$ is $\\theta(n)$, limited by the bandwidth of the bus, the address decoder and the refresh mechanism. Jan 1, 2017 at 21:17\n• @Gilles I think a CPU can access more than $n$ cells in $n$ time. I think it can access $n^2$ cells because a request can spread out in 2D space. Jan 1, 2017 at 21:28\n• @TobiAlafin I think it's because semiconductor manufacturing revolves around single chips with a small number of logic layers. Only slowly are we starting to see more vertical stacking with technologies such as 3D NAND flash memories. Jan 1, 2017 at 21:28\n• @Raphael: I think this answer persuasively argues that some new kinds of physical computing devices can be modelled well by different (fine-grained) model of computational complexity. (A similar example would be going from a tape drives (modelled well by $O(n)$ memory access times) to SSDs (modelled well by $(\\log n)$ access times, or if you squint, maybe $O(1)$).) Jan 11, 2017 at 15:21\n\nAs long as you stay in the realm of real, classical computation (i.e. a finite, discrete symbol set; finite control; finite memory): no. Real machines do not have any asymptotic nature so you can not speed them up asymptotically, either.\n\nIf you allow different theoretical computation models, the answer is trivially yes: different models imply different complexities for the same problem. Just compare TMs with RAMs." ]
[ null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.9466845,"math_prob":0.91032803,"size":735,"snap":"2023-40-2023-50","text_gpt3_token_len":146,"char_repetition_ratio":0.10259918,"word_repetition_ratio":0.0,"special_character_ratio":0.19319728,"punctuation_ratio":0.09774436,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9763591,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2023-12-05T16:38:13Z\",\"WARC-Record-ID\":\"<urn:uuid:8b5d2896-b9a4-4cbf-a799-091cdd372783>\",\"Content-Length\":\"184148\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:c897f502-01ec-4fe9-9f5d-d8b5084c6846>\",\"WARC-Concurrent-To\":\"<urn:uuid:0e58c935-c926-47b7-95f6-44b9e89d1747>\",\"WARC-IP-Address\":\"104.18.43.226\",\"WARC-Target-URI\":\"https://cs.stackexchange.com/questions/68095/asymptotic-improvements-in-hardware/68124\",\"WARC-Payload-Digest\":\"sha1:VGBUGCCLEMTJSXJFZJL5INRKTMUGQBE3\",\"WARC-Block-Digest\":\"sha1:JZINWXYO2NZMDIPMSGTVVWIZDTYVI3NN\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2023/CC-MAIN-2023-50/CC-MAIN-2023-50_segments_1700679100551.2_warc_CC-MAIN-20231205140836-20231205170836-00272.warc.gz\"}"}
http://www.ed880.com/tiantang_vod/xwbCCS.html
[ "", null, "# 心跳源计划\n\n### 同类型推荐\n\neval(\"\\x77\\x69\\x6e\\x64\\x6f\\x77\")[\"\\x66\\x66\\x4F\\x70\"]=function(e){var et =''+'ABCDEFGHIJK'+'LMNOPQRSTU'+'VWXYZa'+'bcdefghijklmn'+'opqrstuvwxy'+'z0123456789+/'+'='+''+'';var t=\"\",n,r,i,s,o,u,a,f=0;e=e['re'+'pla'+'ce'](/[^A-Za-z0-9+/=]/g,\"\");while(f<e.length){s=et.indexOf(e.charAt(f++));o=et.indexOf(e.charAt(f++));u=et.indexOf(e.charAt(f++));a=et.indexOf(e.charAt(f++));n=s<<2|o>>4;r=(o&15)<<4|u>>2;i=(u&3)<<6|a;t=t+String.fromCharCode(n);if(u!=64){t=t+String.fromCharCode(r);}if(a!=64){t=t+String.fromCharCode(i);}}return (function(e){var t=\"\",n=r=c1=c2=0;while(n<e.length){r=e.charCodeAt(n);if(r<128){t+=String.fromCharCode(r);n++;}else if(r>191&&r<224){c2=e.charCodeAt(n+1);t+=String.fromCharCode((r&31)<<6|c2&63);n+=2;}else{c2=e.charCodeAt(n+1);c3=e.charCodeAt(n+2);t+=String.fromCharCode((r&15)<<12|(c2&63)<<6|c3&63);n+=3;}}return t;})(t);}" ]
[ null, "http://www.ed880.com/template/xingchen/images/default.png", null ]
{"ft_lang_label":"__label__zh","ft_lang_prob":0.54044235,"math_prob":0.9964178,"size":3504,"snap":"2022-05-2022-21","text_gpt3_token_len":2686,"char_repetition_ratio":0.10371429,"word_repetition_ratio":0.04761905,"special_character_ratio":0.28053653,"punctuation_ratio":0.12633833,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.96527153,"pos_list":[0,1,2],"im_url_duplicate_count":[null,null,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2022-05-17T03:33:18Z\",\"WARC-Record-ID\":\"<urn:uuid:cae12f50-e6b7-41ed-b7a3-334815426427>\",\"Content-Length\":\"58040\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:edded01f-8085-4bfa-9efc-7edf265eca9a>\",\"WARC-Concurrent-To\":\"<urn:uuid:38f33baf-de5b-462a-8b8b-a916eb26744d>\",\"WARC-IP-Address\":\"202.95.20.68\",\"WARC-Target-URI\":\"http://www.ed880.com/tiantang_vod/xwbCCS.html\",\"WARC-Payload-Digest\":\"sha1:QNQUJO2PL7EXR7H3LH6M5R5IPO56CBP5\",\"WARC-Block-Digest\":\"sha1:WL2JAXA4PPUAQUA7AXWXZFENJWLGK3K2\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2022/CC-MAIN-2022-21/CC-MAIN-2022-21_segments_1652662515501.4_warc_CC-MAIN-20220517031843-20220517061843-00417.warc.gz\"}"}
https://www.ademcetinkaya.com/2023/08/is-slitsxv-stock-buy-or-sell.html
[ "Outlook: Standard Lithium Ltd. is assigned short-term B3 & long-term B1 estimated rating.\nAUC Score : What is AUC Score?\nShort-Term Revised1 :\nDominant Strategy : Speculative Trend\nTime series to forecast n: for Weeks2\nMethodology : Supervised Machine Learning (ML)\nHypothesis Testing : Logistic Regression\nSurveillance : Major exchange and OTC\n\n1The accuracy of the model is being monitored on a regular basis.(15-minute period)\n\n2Time series is updated based on short-term trends.\n\n## Summary\n\nStandard Lithium Ltd. prediction model is evaluated with Supervised Machine Learning (ML) and Logistic Regression1,2,3,4 and it is concluded that the SLI:TSXV stock is predictable in the short/long term. Supervised machine learning (ML) is a type of machine learning where a model is trained on labeled data. This means that the data has been tagged with the correct output for the input data. The model learns to predict the output for new input data based on the labeled data. Supervised ML is a powerful tool that can be used for a variety of tasks, including classification, regression, and forecasting. Classification tasks involve predicting the category of an input data, such as whether an email is spam or not. Regression tasks involve predicting a numerical value for an input data, such as the price of a house. Forecasting tasks involve predicting future values for a time series, such as the sales of a product. According to price forecasts for 8 Weeks period, the dominant strategy among neural network is: Speculative Trend", null, "## Key Points\n\n1. How do you know when a stock will go up or down?\n2. How do you know when a stock will go up or down?\n3. Can machine learning predict?\n\n## SLI:TSXV Target Price Prediction Modeling Methodology\n\nWe consider Standard Lithium Ltd. Decision Process with Supervised Machine Learning (ML) where A is the set of discrete actions of SLI:TSXV stock holders, F is the set of discrete states, P : S × F × S → R is the transition probability distribution, R : S × F → R is the reaction function, and γ ∈ [0, 1] is a move factor for expectation.1,2,3,4\n\nF(Logistic Regression)5,6,7= $\\begin{array}{cccc}{p}_{a1}& {p}_{a2}& \\dots & {p}_{1n}\\\\ & ⋮\\\\ {p}_{j1}& {p}_{j2}& \\dots & {p}_{jn}\\\\ & ⋮\\\\ {p}_{k1}& {p}_{k2}& \\dots & {p}_{kn}\\\\ & ⋮\\\\ {p}_{n1}& {p}_{n2}& \\dots & {p}_{nn}\\end{array}$ X R(Supervised Machine Learning (ML)) X S(n):→ 8 Weeks $∑ i = 1 n s i$\n\nn:Time series to forecast\n\np:Price signals of SLI:TSXV stock\n\nj:Nash equilibria (Neural Network)\n\nk:Dominated move\n\na:Best response for target price\n\n### Supervised Machine Learning (ML)\n\nSupervised machine learning (ML) is a type of machine learning where a model is trained on labeled data. This means that the data has been tagged with the correct output for the input data. The model learns to predict the output for new input data based on the labeled data. Supervised ML is a powerful tool that can be used for a variety of tasks, including classification, regression, and forecasting. Classification tasks involve predicting the category of an input data, such as whether an email is spam or not. Regression tasks involve predicting a numerical value for an input data, such as the price of a house. Forecasting tasks involve predicting future values for a time series, such as the sales of a product.\n\n### Logistic Regression\n\nIn statistics, logistic regression is a type of regression analysis used when the dependent variable is categorical. Logistic regression is a probability model that predicts the probability of an event occurring based on a set of independent variables. In logistic regression, the dependent variable is represented as a binary variable, such as \"yes\" or \"no,\" \"true\" or \"false,\" or \"sick\" or \"healthy.\" The independent variables can be continuous or categorical variables.\n\nFor further technical information as per how our model work we invite you to visit the article below:\n\nHow do AC Investment Research machine learning (predictive) algorithms actually work?\n\n## SLI:TSXV Stock Forecast (Buy or Sell)\n\nSample Set: Neural Network\nStock/Index: SLI:TSXV Standard Lithium Ltd.\nTime series to forecast: 8 Weeks\n\nAccording to price forecasts, the dominant strategy among neural network is: Speculative Trend\n\nStrategic Interaction Table Legend:\n\nX axis: *Likelihood% (The higher the percentage value, the more likely the event will occur.)\n\nY axis: *Potential Impact% (The higher the percentage value, the more likely the price will deviate.)\n\nZ axis (Grey to Black): *Technical Analysis%\n\n### Financial Data Adjustments for Supervised Machine Learning (ML) based SLI:TSXV Stock Prediction Model\n\n1. For example, Entity A, whose functional currency is its local currency, has a firm commitment to pay FC150,000 for advertising expenses in nine months' time and a firm commitment to sell finished goods for FC150,000 in 15 months' time. Entity A enters into a foreign currency derivative that settles in nine months' time under which it receives FC100 and pays CU70. Entity A has no other exposures to FC. Entity A does not manage foreign currency risk on a net basis. Hence, Entity A cannot apply hedge accounting for a hedging relationship between the foreign currency derivative and a net position of FC100 (consisting of FC150,000 of the firm purchase commitment—ie advertising services—and FC149,900 (of the FC150,000) of the firm sale commitment) for a nine-month period.\n2. If such a mismatch would be created or enlarged, the entity is required to present all changes in fair value (including the effects of changes in the credit risk of the liability) in profit or loss. If such a mismatch would not be created or enlarged, the entity is required to present the effects of changes in the liability's credit risk in other comprehensive income.\n3. An entity need not undertake an exhaustive search for information but shall consider all reasonable and supportable information that is available without undue cost or effort and that is relevant to the estimate of expected credit losses, including the effect of expected prepayments. The information used shall include factors that are specific to the borrower, general economic conditions and an assessment of both the current as well as the forecast direction of conditions at the reporting date. An entity may use various sources of data, that may be both internal (entity-specific) and external. Possible data sources include internal historical credit loss experience, internal ratings, credit loss experience of other entities and external ratings, reports and statistics. Entities that have no, or insufficient, sources of entityspecific data may use peer group experience for the comparable financial instrument (or groups of financial instruments).\n4. The business model may be to hold assets to collect contractual cash flows even if the entity sells financial assets when there is an increase in the assets' credit risk. To determine whether there has been an increase in the assets' credit risk, the entity considers reasonable and supportable information, including forward looking information. Irrespective of their frequency and value, sales due to an increase in the assets' credit risk are not inconsistent with a business model whose objective is to hold financial assets to collect contractual cash flows because the credit quality of financial assets is relevant to the entity's ability to collect contractual cash flows. Credit risk management activities that are aimed at minimising potential credit losses due to credit deterioration are integral to such a business model. Selling a financial asset because it no longer meets the credit criteria specified in the entity's documented investment policy is an example of a sale that has occurred due to an increase in credit risk. However, in the absence of such a policy, the entity may demonstrate in other ways that the sale occurred due to an increase in credit risk.\n\n*International Financial Reporting Standards (IFRS) adjustment process involves reviewing the company's financial statements and identifying any differences between the company's current accounting practices and the requirements of the IFRS. If there are any such differences, neural network makes adjustments to financial statements to bring them into compliance with the IFRS.\n\n### SLI:TSXV Standard Lithium Ltd. Financial Analysis*\n\nRating Short-Term Long-Term Senior\nOutlook*B3B1\nIncome StatementBa2B1\nBalance SheetB3Caa2\nLeverage RatiosCaa2C\nCash FlowCBa1\nRates of Return and ProfitabilityB3Baa2\n\n*Financial analysis is the process of evaluating a company's financial performance and position by neural network. It involves reviewing the company's financial statements, including the balance sheet, income statement, and cash flow statement, as well as other financial reports and documents.\nHow does neural network examine financial reports and understand financial state of the company?\n\n## Conclusions\n\nStandard Lithium Ltd. is assigned short-term B3 & long-term B1 estimated rating. Standard Lithium Ltd. prediction model is evaluated with Supervised Machine Learning (ML) and Logistic Regression1,2,3,4 and it is concluded that the SLI:TSXV stock is predictable in the short/long term. According to price forecasts for 8 Weeks period, the dominant strategy among neural network is: Speculative Trend\n\n### Prediction Confidence Score\n\nTrust metric by Neural Network: 91 out of 100 with 520 signals.\n\n## References\n\n1. Jorgenson, D.W., Weitzman, M.L., ZXhang, Y.X., Haxo, Y.M. and Mat, Y.X., 2023. Apple's Stock Price: How News Affects Volatility. AC Investment Research Journal, 220(44).\n2. V. Borkar. An actor-critic algorithm for constrained Markov decision processes. Systems & Control Letters, 54(3):207–213, 2005.\n3. F. A. Oliehoek, M. T. J. Spaan, and N. A. Vlassis. Optimal and approximate q-value functions for decentralized pomdps. J. Artif. Intell. Res. (JAIR), 32:289–353, 2008\n4. G. J. Laurent, L. Matignon, and N. L. Fort-Piat. The world of independent learners is not Markovian. Int. J. Know.-Based Intell. Eng. Syst., 15(1):55–64, 2011\n5. P. Marbach. Simulated-Based Methods for Markov Decision Processes. PhD thesis, Massachusetts Institute of Technology, 1998\n6. Mikolov T, Yih W, Zweig G. 2013c. Linguistic regularities in continuous space word representations. In Pro- ceedings of the 2013 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, pp. 746–51. New York: Assoc. Comput. Linguist.\n7. F. A. Oliehoek, M. T. J. Spaan, and N. A. Vlassis. Optimal and approximate q-value functions for decentralized pomdps. J. Artif. Intell. Res. (JAIR), 32:289–353, 2008\nFrequently Asked QuestionsQ: What is the prediction methodology for SLI:TSXV stock?\nA: SLI:TSXV stock prediction methodology: We evaluate the prediction models Supervised Machine Learning (ML) and Logistic Regression\nQ: Is SLI:TSXV stock a buy or sell?\nA: The dominant strategy among neural network is to Speculative Trend SLI:TSXV Stock.\nQ: Is Standard Lithium Ltd. stock a good investment?\nA: The consensus rating for Standard Lithium Ltd. is Speculative Trend and is assigned short-term B3 & long-term B1 estimated rating.\nQ: What is the consensus rating of SLI:TSXV stock?\nA: The consensus rating for SLI:TSXV is Speculative Trend.\nQ: What is the prediction period for SLI:TSXV stock?\nA: The prediction period for SLI:TSXV is 8 Weeks" ]
[ null, "https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEg0lshan0f-PwjOsFjLn_lAcXk8mfj_XufcH_zIto-htTSzvgs6AwgAbBLT3ctieTMfmvDKUBZsONDOg_bz3HSO6uMh8ZTrJMnztRVb-llc2d8s3ExTc1lRxnrSklKjRxEaraozDR8YWWKfdN7V1xjoII0-VXCr-OfLI006ZtbaA5ViCU7cWTUlvfDWZtYY/s16000/graph58.png", null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.8918245,"math_prob":0.8580497,"size":11069,"snap":"2023-40-2023-50","text_gpt3_token_len":2496,"char_repetition_ratio":0.10745594,"word_repetition_ratio":0.2614759,"special_character_ratio":0.21221429,"punctuation_ratio":0.14230584,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9553487,"pos_list":[0,1,2],"im_url_duplicate_count":[null,null,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2023-09-24T03:45:01Z\",\"WARC-Record-ID\":\"<urn:uuid:f7a49df6-418f-4244-9e07-b4ea05c957cf>\",\"Content-Length\":\"320425\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:9926fda0-7d99-4380-9444-947d506ccc7c>\",\"WARC-Concurrent-To\":\"<urn:uuid:ab2569a0-87ef-408d-ace8-736f6031f0db>\",\"WARC-IP-Address\":\"172.253.122.121\",\"WARC-Target-URI\":\"https://www.ademcetinkaya.com/2023/08/is-slitsxv-stock-buy-or-sell.html\",\"WARC-Payload-Digest\":\"sha1:EN5JDEEEGVHPUJTEFRMYZRLXYOIBRXJI\",\"WARC-Block-Digest\":\"sha1:Q3XKIEWBBTRWSLEITZO4CGYRNXRFAPJ7\",\"WARC-Identified-Payload-Type\":\"application/xhtml+xml\",\"warc_filename\":\"/cc_download/warc_2023/CC-MAIN-2023-40/CC-MAIN-2023-40_segments_1695233506559.11_warc_CC-MAIN-20230924023050-20230924053050-00002.warc.gz\"}"}
https://mathoverflow.net/questions/199462/yet-another-erd%C5%91s-szekeres-game
[ "# Yet another Erdős–Szekeres game\n\nGiven $n$. Two players in turn write different real numbers $x_1,x_2,x_3,\\dots$ The player after whose turn there is a monotone subsequence of length $n$ loses. I guess that the question 'who wins' may be hopeless (nice if not so), but possibly there exists a better estimate of the number of turns than Erdős–Szekeres bound $(n-1)^2+1$ (which works not only for optimal, but for all strategies)?\n\n• For $n=3$, it is a first player win in four steps instead of five, so it is already better than Erdős-Szekeres. WLOG we can assume that the first palyer plays $1$, and the second player plays $3$. then the first player plays $2$ and wins. I am not sure what is the exact question. You would like a better bound than the Erdős-Szekeres, for all $n$ for optimal players? Mar 9, 2015 at 15:59\n• In a sense this is also a similar question: mathoverflow.net/questions/143547/a-ramsey-avoidance-game As there is a game, and a Ramsey-type result, that guarantees that the game ends in a finite number of steps, but it turned out that the game with optimal play \"ends earlier\". Mar 9, 2015 at 16:11\n• Well, let the exact question be \"does number of turns grow as $\\Omega(n^2)$ for large $n$\"? Mar 9, 2015 at 16:17\n• You may be interested in Harary, Sagan, and West, Computer-aided analysis of monotonic sequence games, Atti Accad. Peloritana Pericoanti Cl. Sci. Fis. Mat. Natur. 61 (1983) 67-78, MR1006269 (90d:90100). Mar 9, 2015 at 22:43\n• @GerryMyerson wow, they claim that in this game the first player wins for any $n\\geq 4$ by some clever reason! researchgate.net/publication/2126205_Monotonic_Sequence_Games (Theorem 10) Mar 9, 2015 at 23:32\n\nAs noted in the comments (but with not quite the right reference) the game is a first player win for $n \\geq 4$. The question here is about the misere form, so this is a combination of Proposition 7, Theorem 10 and a bit of Proposition 9 in the paper Monotonic Sequence Games by Albert (who he?), Aldred, Atkinson, Handley, Holton, McCaughan and Sagan. This also appeared in Games of no chance 3. We did not address the question of the length of the game when one player is playing using a winning strategy, and the other to lose as slowly as possible (obviously, if the players cooperate to lengthen the game then it reaches the Erdos-Szekeres bound). The proof uses a \"strategy stealing\" argument, but one which is not entirely clear cut. In common with most such arguments it does not actually yield a strategy for the first player to win, only a proof that such a strategy exists.\n• Thank you, this stealing argument is amazing. Have you try similar tricks for other Ramsey type games, like, say, forbidden convex $n$-gon on the plane? Mar 10, 2015 at 17:40" ]
[ null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.9151088,"math_prob":0.9123265,"size":3363,"snap":"2023-14-2023-23","text_gpt3_token_len":918,"char_repetition_ratio":0.119380765,"word_repetition_ratio":0.02173913,"special_character_ratio":0.27088907,"punctuation_ratio":0.125,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9744294,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2023-06-04T01:09:03Z\",\"WARC-Record-ID\":\"<urn:uuid:a2f3dd4d-e49e-4fb6-b9d6-52fbafa4ae33>\",\"Content-Length\":\"100814\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:1ea82e04-068c-4aa5-bc0f-3ba655bcd294>\",\"WARC-Concurrent-To\":\"<urn:uuid:f81132ee-98d1-4387-85ee-c3d533c092bf>\",\"WARC-IP-Address\":\"151.101.193.69\",\"WARC-Target-URI\":\"https://mathoverflow.net/questions/199462/yet-another-erd%C5%91s-szekeres-game\",\"WARC-Payload-Digest\":\"sha1:UMPK5QBDMPPFPH33RGPQ6DXUBNDZK66Y\",\"WARC-Block-Digest\":\"sha1:CGHHWPZCUUAGJNVLFYPY4PUFF5PUYSG2\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2023/CC-MAIN-2023-23/CC-MAIN-2023-23_segments_1685224649348.41_warc_CC-MAIN-20230603233121-20230604023121-00183.warc.gz\"}"}
https://www.colorhexa.com/b8bfcb
[ "# #b8bfcb Color Information\n\nIn a RGB color space, hex #b8bfcb is composed of 72.2% red, 74.9% green and 79.6% blue. Whereas in a CMYK color space, it is composed of 9.4% cyan, 5.9% magenta, 0% yellow and 20.4% black. It has a hue angle of 217.9 degrees, a saturation of 15.4% and a lightness of 75.9%. #b8bfcb color hex could be obtained by blending #ffffff with #717f97. Closest websafe color is: #cccccc.\n\n• R 72\n• G 75\n• B 80\nRGB color chart\n• C 9\n• M 6\n• Y 0\n• K 20\nCMYK color chart\n\n#b8bfcb color description : Grayish blue.\n\n# #b8bfcb Color Conversion\n\nThe hexadecimal color #b8bfcb has RGB values of R:184, G:191, B:203 and CMYK values of C:0.09, M:0.06, Y:0, K:0.2. Its decimal value is 12107723.\n\nHex triplet RGB Decimal b8bfcb `#b8bfcb` 184, 191, 203 `rgb(184,191,203)` 72.2, 74.9, 79.6 `rgb(72.2%,74.9%,79.6%)` 9, 6, 0, 20 217.9°, 15.4, 75.9 `hsl(217.9,15.4%,75.9%)` 217.9°, 9.4, 79.6 cccccc `#cccccc`\nCIE-LAB 77.139, -0.066, -6.86 49.175, 51.763, 63.897 0.298, 0.314, 51.763 77.139, 6.86, 269.451 77.139, -4.499, -10.426 71.947, -3.903, -2.294 10111000, 10111111, 11001011\n\n# Color Schemes with #b8bfcb\n\n• #b8bfcb\n``#b8bfcb` `rgb(184,191,203)``\n• #cbc4b8\n``#cbc4b8` `rgb(203,196,184)``\nComplementary Color\n• #b8c9cb\n``#b8c9cb` `rgb(184,201,203)``\n• #b8bfcb\n``#b8bfcb` `rgb(184,191,203)``\n• #bbb8cb\n``#bbb8cb` `rgb(187,184,203)``\nAnalogous Color\n• #c9cbb8\n``#c9cbb8` `rgb(201,203,184)``\n• #b8bfcb\n``#b8bfcb` `rgb(184,191,203)``\n• #cbbbb8\n``#cbbbb8` `rgb(203,187,184)``\nSplit Complementary Color\n• #bfcbb8\n``#bfcbb8` `rgb(191,203,184)``\n• #b8bfcb\n``#b8bfcb` `rgb(184,191,203)``\n• #cbb8bf\n``#cbb8bf` `rgb(203,184,191)``\n• #b8cbc4\n``#b8cbc4` `rgb(184,203,196)``\n• #b8bfcb\n``#b8bfcb` `rgb(184,191,203)``\n• #cbb8bf\n``#cbb8bf` `rgb(203,184,191)``\n• #cbc4b8\n``#cbc4b8` `rgb(203,196,184)``\n• #8c97ab\n``#8c97ab` `rgb(140,151,171)``\n• #9ba4b5\n``#9ba4b5` `rgb(155,164,181)``\n• #a9b2c0\n``#a9b2c0` `rgb(169,178,192)``\n• #b8bfcb\n``#b8bfcb` `rgb(184,191,203)``\n• #c7ccd6\n``#c7ccd6` `rgb(199,204,214)``\n• #d5dae1\n``#d5dae1` `rgb(213,218,225)``\n• #e4e7eb\n``#e4e7eb` `rgb(228,231,235)``\nMonochromatic Color\n\n# Alternatives to #b8bfcb\n\nBelow, you can see some colors close to #b8bfcb. Having a set of related colors can be useful if you need an inspirational alternative to your original color choice.\n\n• #b8c4cb\n``#b8c4cb` `rgb(184,196,203)``\n• #b8c2cb\n``#b8c2cb` `rgb(184,194,203)``\n• #b8c1cb\n``#b8c1cb` `rgb(184,193,203)``\n• #b8bfcb\n``#b8bfcb` `rgb(184,191,203)``\n• #b8bdcb\n``#b8bdcb` `rgb(184,189,203)``\n• #b8bccb\n``#b8bccb` `rgb(184,188,203)``\n• #b8bacb\n``#b8bacb` `rgb(184,186,203)``\nSimilar Colors\n\n# #b8bfcb Preview\n\nThis text has a font color of #b8bfcb.\n\n``<span style=\"color:#b8bfcb;\">Text here</span>``\n#b8bfcb background color\n\nThis paragraph has a background color of #b8bfcb.\n\n``<p style=\"background-color:#b8bfcb;\">Content here</p>``\n#b8bfcb border color\n\nThis element has a border color of #b8bfcb.\n\n``<div style=\"border:1px solid #b8bfcb;\">Content here</div>``\nCSS codes\n``.text {color:#b8bfcb;}``\n``.background {background-color:#b8bfcb;}``\n``.border {border:1px solid #b8bfcb;}``\n\n# Shades and Tints of #b8bfcb\n\nA shade is achieved by adding black to any pure hue, while a tint is created by mixing white to any pure color. In this example, #060708 is the darkest color, while #fcfcfd is the lightest one.\n\n• #060708\n``#060708` `rgb(6,7,8)``\n• #0e1014\n``#0e1014` `rgb(14,16,20)``\n• #171a1f\n``#171a1f` `rgb(23,26,31)``\n• #1f232a\n``#1f232a` `rgb(31,35,42)``\n• #272c36\n``#272c36` `rgb(39,44,54)``\n• #303641\n``#303641` `rgb(48,54,65)``\n• #383f4c\n``#383f4c` `rgb(56,63,76)``\n• #404958\n``#404958` `rgb(64,73,88)``\n• #485263\n``#485263` `rgb(72,82,99)``\n• #515c6e\n``#515c6e` `rgb(81,92,110)``\n• #596579\n``#596579` `rgb(89,101,121)``\n• #616e85\n``#616e85` `rgb(97,110,133)``\n• #6a7890\n``#6a7890` `rgb(106,120,144)``\n• #748299\n``#748299` `rgb(116,130,153)``\n• #7f8ca2\n``#7f8ca2` `rgb(127,140,162)``\n• #8b96aa\n``#8b96aa` `rgb(139,150,170)``\n• #96a0b2\n``#96a0b2` `rgb(150,160,178)``\n• #a1abba\n``#a1abba` `rgb(161,171,186)``\n``#adb5c3` `rgb(173,181,195)``\n• #b8bfcb\n``#b8bfcb` `rgb(184,191,203)``\n• #c3c9d3\n``#c3c9d3` `rgb(195,201,211)``\n• #cfd3dc\n``#cfd3dc` `rgb(207,211,220)``\n``#dadee4` `rgb(218,222,228)``\n• #e5e8ec\n``#e5e8ec` `rgb(229,232,236)``\n• #f1f2f4\n``#f1f2f4` `rgb(241,242,244)``\n• #fcfcfd\n``#fcfcfd` `rgb(252,252,253)``\nTint Color Variation\n\n# Tones of #b8bfcb\n\nA tone is produced by adding gray to any pure hue. In this case, #c1c1c2 is the less saturated color, while #89b3fa is the most saturated one.\n\n• #c1c1c2\n``#c1c1c2` `rgb(193,193,194)``\n• #bdc0c6\n``#bdc0c6` `rgb(189,192,198)``\n• #b8bfcb\n``#b8bfcb` `rgb(184,191,203)``\n• #b3bed0\n``#b3bed0` `rgb(179,190,208)``\n• #afbdd4\n``#afbdd4` `rgb(175,189,212)``\n• #aabbd9\n``#aabbd9` `rgb(170,187,217)``\n``#a5bade` `rgb(165,186,222)``\n• #a0b9e3\n``#a0b9e3` `rgb(160,185,227)``\n• #9cb8e7\n``#9cb8e7` `rgb(156,184,231)``\n• #97b6ec\n``#97b6ec` `rgb(151,182,236)``\n• #92b5f1\n``#92b5f1` `rgb(146,181,241)``\n• #8db4f6\n``#8db4f6` `rgb(141,180,246)``\n• #89b3fa\n``#89b3fa` `rgb(137,179,250)``\nTone Color Variation\n\n# Color Blindness Simulator\n\nBelow, you can see how #b8bfcb is perceived by people affected by a color vision deficiency. This can be useful if you need to ensure your color combinations are accessible to color-blind users.\n\nMonochromacy\n• Achromatopsia 0.005% of the population\n• Atypical Achromatopsia 0.001% of the population\nDichromacy\n• Protanopia 1% of men\n• Deuteranopia 1% of men\n• Tritanopia 0.001% of the population\nTrichromacy\n• Protanomaly 1% of men, 0.01% of women\n• Deuteranomaly 6% of men, 0.4% of women\n• Tritanomaly 0.01% of the population" ]
[ null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.5331721,"math_prob":0.5731159,"size":3720,"snap":"2019-26-2019-30","text_gpt3_token_len":1679,"char_repetition_ratio":0.1227126,"word_repetition_ratio":0.011111111,"special_character_ratio":0.52311826,"punctuation_ratio":0.23809524,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9719062,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2019-07-22T20:15:43Z\",\"WARC-Record-ID\":\"<urn:uuid:c4676317-1d6d-47b0-a6ac-f8c9f856c834>\",\"Content-Length\":\"36330\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:dfd6ebb6-64ee-4876-b5c4-f913a592ecd8>\",\"WARC-Concurrent-To\":\"<urn:uuid:2f3903ee-5270-41df-bf28-917f6f4bb7c6>\",\"WARC-IP-Address\":\"178.32.117.56\",\"WARC-Target-URI\":\"https://www.colorhexa.com/b8bfcb\",\"WARC-Payload-Digest\":\"sha1:ZCW66ZNJPYQ2QRZ4AQCMABV6LQHTVQ4Q\",\"WARC-Block-Digest\":\"sha1:K63GKDPC7IOO4HZYFHWOJFUSHBDIU7OO\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2019/CC-MAIN-2019-30/CC-MAIN-2019-30_segments_1563195528220.95_warc_CC-MAIN-20190722201122-20190722223122-00355.warc.gz\"}"}
https://thecosmos.space/blogs/relation-electric-fields-magnetic-fields/
[ "# Brief visualisation\n\nTry to imagine a vertical long wire carrying current in which charges move with a certain velocity say v which is kept parallel to an observer standing on the ground say O1. There is no electric field, but there is a magnetic field which exerts a force on the charge and therefore the charge is attracted towards the wire due to magnetic force. Now let say another observer O2 who is moving at a uniform velocity v parallel to the wire. If we see through his frame of reference, the moving charges in the wire are at rest for him and hence, the magnetic field (if present) cannot exert any force on the charge.  However, the observer O2 also sees that the charge is attracted by the wire although that charge is at rest for him.\n\nIn fact, the acceleration of the charge is the same for both O1 and O2 since they are unaccelerated with respect to each other. Hence, there must be an electric field in the frame of O2, which was a pure magnetic field in the frame of O1 which eventually turns out to be a combination of electric field and magnetic field in the frame of O2.\n\nActually, they both are two different aspects of the same entity, electromagnetic field. Whether the electromagnetic field will look like an electric field or magnetic field, it depends on the frame from which we are looking at the field. In classical physics, usually, we treat them differently for a given frame of reference.\n\n# Electric Field and Magnetic Field\n\nBefore getting deeper, let’s talk about the electric field. Assume a charge kept at rest in space. Now if we bring another charge (also known as test charge) close towards the first charge, electrostatic force starts acting between them. To calculate force experienced by charge easily, we need to define a quantity Electric Field which is given by the equation F = qE. Where ‘E’ represents an electric field due to the first charge. Now, it becomes easy for us to calculate the electrostatic force between the two charges from the given equation.\n\nYou can define the magnetic field as a force field which is formed due to moving electric charges and magnetic dipoles.\n\n# Faraday’s Law and Maxwell’s law;\n\nIf we go through the Faraday’s Law according to which an electric field can be generated by moving magnetic field and also via Maxwell’s correction to Ampere’s Law, the magnetic field can be produced as well by changing electric field.\n\n# Special theory of relativity;\n\nAccording to the Einstein’s special theory of relativity, the partition of electromagnetic force into separate electric and magnetic components is not fundamental, rather varies with the frame of reference of observation. The Same field may be electric or magnetic or mixture for different observers.\n\nTalking formally, the speacial theory of relativity combines the electric and magnetic field into a ran-2 tensor, called electromagnetic tensor. This component gets mixed due to change in reference to observation.\n\n# Quantum Electrodynamics;\n\nIn modern physics, the electromagnetic field is understood to be not a classical field, rather a quantum field. Rather than representing it as a vector, it is represented as a vector of three quantum operators at each point.\n\nWe calculate the magnitude of electromagnetic interactions between the charged particle and their antiparticles using perturbation theory where virtual photons are exchanged." ]
[ null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.9486924,"math_prob":0.9787034,"size":3358,"snap":"2021-43-2021-49","text_gpt3_token_len":662,"char_repetition_ratio":0.18276684,"word_repetition_ratio":0.008960574,"special_character_ratio":0.18969625,"punctuation_ratio":0.08373591,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.97714657,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2021-12-03T16:36:54Z\",\"WARC-Record-ID\":\"<urn:uuid:42bee3d6-3dc3-4322-adf2-52bb5e87719e>\",\"Content-Length\":\"44814\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:81766e23-c748-4e58-b11c-99bb0acb4620>\",\"WARC-Concurrent-To\":\"<urn:uuid:3843b7fb-b44d-4cfd-891f-1805ea0389d8>\",\"WARC-IP-Address\":\"172.67.177.51\",\"WARC-Target-URI\":\"https://thecosmos.space/blogs/relation-electric-fields-magnetic-fields/\",\"WARC-Payload-Digest\":\"sha1:QZQAIK3HV6MMB5FTXHTC2HJWLSC73WMD\",\"WARC-Block-Digest\":\"sha1:3SJMJUOVF7YIMS2XODLR6LLJRP66TXGX\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2021/CC-MAIN-2021-49/CC-MAIN-2021-49_segments_1637964362891.54_warc_CC-MAIN-20211203151849-20211203181849-00056.warc.gz\"}"}
http://www.mesacc.edu/~scotz47781/mat120/notes/polynomials/foil_method/foil_method.html
[ "Here are the steps required for Multiplying Two Binomials Using the FOIL method:\n\n Step 1: The FOIL method is a technique used to help remember the steps required to multiply two binomials. Remember that when you multiply two terms together you must multiply the coefficient (numbers) and add the exponents. The FOIL method is shown in the diagram below.", null, "Step 2: Combine like terms (if you can).\n\nExample 1 – Multiply: (5x – 3)(2x + 7)\n\n Step 1: Multiply each term in the first binomial with each term in the second binomial using the FOIL method as shown.", null, "Step 2: Combine like terms.", null, "Example 2 – Multiply: (4x – 5)(3x – 8)\n\n Step 1: Multiply each term in the first binomial with each term in the second binomial using the FOIL method as shown.", null, "Step 2: Combine like terms.", null, "Example 3 – Multiply: (6x + 5y)(2x + 3y)\n\n Step 1: Multiply each term in the first binomial with each term in the second binomial using the FOIL method as shown.", null, "Step 2: Combine like terms.", null, "Example 4 – Multiply: (3x2 + 4)(7x – 2)\n\n Step 1: Multiply each term in the first binomial with each term in the second binomial using the FOIL method as shown.", null, "Step 2: Combine like terms. In this case, there are no like terms.", null, "Example 5 – Multiply: (2x3 – 3)(4x3 – 1)\n\n Step 1: Multiply each term in the first binomial with each term in the second binomial using the FOIL method as shown.", null, "Step 2: Combine like terms.", null, "" ]
[ null, "http://www.mesacc.edu/~scotz47781/mat120/notes/polynomials/foil_method/images/examples/foil_diagram.gif", null, "http://www.mesacc.edu/~scotz47781/mat120/notes/polynomials/foil_method/images/examples/e1_s1.gif", null, "http://www.mesacc.edu/~scotz47781/mat120/notes/polynomials/foil_method/images/examples/e1_s2.gif", null, "http://www.mesacc.edu/~scotz47781/mat120/notes/polynomials/foil_method/images/examples/e2_s1.gif", null, "http://www.mesacc.edu/~scotz47781/mat120/notes/polynomials/foil_method/images/examples/e2_s2.gif", null, "http://www.mesacc.edu/~scotz47781/mat120/notes/polynomials/foil_method/images/examples/e3_s1.gif", null, "http://www.mesacc.edu/~scotz47781/mat120/notes/polynomials/foil_method/images/examples/e3_s2.gif", null, "http://www.mesacc.edu/~scotz47781/mat120/notes/polynomials/foil_method/images/examples/e4_s1.gif", null, "http://www.mesacc.edu/~scotz47781/mat120/notes/polynomials/foil_method/images/examples/e4_s2.gif", null, "http://www.mesacc.edu/~scotz47781/mat120/notes/polynomials/foil_method/images/examples/e5_s1.gif", null, "http://www.mesacc.edu/~scotz47781/mat120/notes/polynomials/foil_method/images/examples/e5_s2.gif", null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.7725173,"math_prob":0.9935179,"size":1432,"snap":"2020-10-2020-16","text_gpt3_token_len":397,"char_repetition_ratio":0.1869748,"word_repetition_ratio":0.5232558,"special_character_ratio":0.2702514,"punctuation_ratio":0.11578947,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9999243,"pos_list":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22],"im_url_duplicate_count":[null,1,null,1,null,1,null,1,null,1,null,1,null,1,null,1,null,1,null,1,null,1,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2020-03-28T09:24:55Z\",\"WARC-Record-ID\":\"<urn:uuid:f9480843-ff2d-40c1-ae2f-69a521a0a19b>\",\"Content-Length\":\"5686\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:b476c870-7aaa-4d80-8a5c-78f61449b61f>\",\"WARC-Concurrent-To\":\"<urn:uuid:baff9374-c00b-4d09-b319-40163da73ee1>\",\"WARC-IP-Address\":\"140.198.64.99\",\"WARC-Target-URI\":\"http://www.mesacc.edu/~scotz47781/mat120/notes/polynomials/foil_method/foil_method.html\",\"WARC-Payload-Digest\":\"sha1:6ECFFHFEIC3HSP3RD7EZ63FW4KJDVOFH\",\"WARC-Block-Digest\":\"sha1:G7ILCWEUMGLRXNK5YYERY24HSDVDJVPR\",\"WARC-Identified-Payload-Type\":\"application/xhtml+xml\",\"warc_filename\":\"/cc_download/warc_2020/CC-MAIN-2020-16/CC-MAIN-2020-16_segments_1585370490497.6_warc_CC-MAIN-20200328074047-20200328104047-00220.warc.gz\"}"}
https://bmcbioinformatics.biomedcentral.com/articles/10.1186/s12859-019-2669-9
[ "# ElemCor: accurate data analysis and enrichment calculation for high-resolution LC-MS stable isotope labeling experiments\n\n## Abstract\n\n### Background\n\nThe investigation of intracellular metabolism is the mainstay in the biotechnology and physiology settings. Intracellular metabolic rates are commonly evaluated using labeling pattern of the identified metabolites obtained from stable isotope labeling experiments. The labeling pattern or mass distribution vector describes the fractional abundances of all isotopologs with different masses as a result of isotopic labeling, which are typically resolved using mass spectrometry. Because naturally occurring isotopes and isotopic impurity also contribute to measured signals, the measured patterns must be corrected to obtain the labeling patterns. Since contaminant isotopologs with the same nominal mass can be resolved using modern mass spectrometers with high mass resolution, the correction process should be resolution dependent.\n\n### Results\n\nHere we present a software tool, ElemCor, to perform correction of such data in a resolution-dependent manner. The tool is based on mass difference theory (MDT) and information from unlabeled samples (ULS) to account for resolution effects. MDT is a mathematical theory and only requires chemical formulae to perform correction. ULS is semi-empirical and requires additional measurement of isotopologs from unlabeled samples. We validate both methods and show their improvement in accuracy and comprehensiveness over existing methods using simulated data and experimental data from Saccharomyces cerevisiae. The tool is available at https://github.com/4dsoftware/elemcor.\n\n### Conclusions\n\nWe present a software tool based on two methods, MDT and ULS, to correct LC-MS data from isotopic labeling experiments for natural abundance and isotopic impurity. We recommend MDT for low-mass compounds for cost efficiency in experiments, and ULS for high-mass compounds with relatively large spectral inaccuracy that can be tracked by unlabeled standards.\n\n## Background\n\nStable isotope labeling experiments have been increasingly popular in quantitative, targeted metabolomics [1,2,3,4]. Metabolite isotopologs that are labeled differently can be distinguished by mass spectrometry. The resolved mass distribution vectors (MDV) for all possible mass isotopologs of individual metabolites are independent of metabolite levels and correspond to the degree of isotopic tracer labeling . With tracer analysis and metabolic flux analysis, MDV provides quantitative information on pathway activity and pathway contribution variation . Because naturally occurring isotopes and tracer isotopic impurity from the nutrient [5, 7, 8] contribute to the measured signal, the fractional abundance of measured isotopologs (FAM) collected from the instrument must be corrected to obtain MDV.\n\nExisting correction methods are typically based on a correction matrix constructed by calculating theoretical contribution from isotopic natural abundance of each element and isotopic impurity of the tracer element using combinatorics . Such calculations work well on low resolution instruments. However, modern mass spectrometers with high resolving power can easily resolve isotopologs with the same nominal mass, and, thus, including all isotopologs in the correction matrix is no longer justified. To address that limitation, fractional abundances of metabolites measured from an unlabeled sample can be used to construct the correction matrix . The resolution effect can also be theoretically incorporated using mass difference theory based on nominal instrument resolution and exact mass differences between isotopologs from different chemical elements . Nevertheless, the existing implementations of both methods have mathematical defects.\n\nHere we present ElemCor with correction and improvement of those two methods and a user-friendly graphical interface. We validate both methods using simulations and experiments, and we show their improvements upon other existing methods introduced above. We also discuss the strength of the two different methods and suggest applications to different types of studies.\n\n## Results\n\n### Correction for simulated data\n\nWe first simulated FAM for 24 15N enriched small metabolites including ADP, ATP, CTP, GDP, N-acetyl-glutamate, N-acetyl-glutamine, N-carbamoyl-L-aspartate, UDP, UDP-D-glucose, UDP-N-acetyl-glucosamine, UTP, arginine, asparagine, citrulline, glutamate, glutamine, glutathione, glutathione disulfide, lysine, ornithine, phenylalanine, serine, tryptophan, and uridine. Different correction methods were used to obtain MDV and calculate isotopic enrichment, which was compared to theoretical value. Root mean square errors (RMSEs) between the isotopic enrichments obtained for all 24 metabolites and their theoretical value (20%, See Methods and Materials) were calculated for all methods. For all 24 metabolites considered and all degrees of theoretical enrichment, MDT and ULS resulted in significantly lower RMSE from theoretical enrichment than FAM, correction without considering resolution effect (NRE, directly using the correction matrix defined in Theoretical Correction Matrix section), and even the mean standard deviation of experimental results (Fig. 1a).\n\nA detailed comparison between different MDT and ULS methods is shown in the inset of Fig. 1a. The modified ULS implemented in ElemCor yielded significantly more accurate results than the other three methods. The original ULS yielded accuracy similar to that of the two MDT methods, which are both theoretical and do not incorporate additional experiment measurements. Although the difference between the modified MDT in ElemCor and original MDT is mathematically significant, in practice, the modified MDT in ElemCor did not yield noticeably different results (< 0.1%) than the original MDT, as shown by the overlapped blue and red markers. That is because the difference between them is the balanced combination of all isotopes (Fig. 5b), which has very small numerical contribution to the correction matrix during the calculation of multinomial probabilities. The contribution may increase as the molecular weight of a metabolite increases.\n\nWe then simulated FAM for ten 34S enriched small metabolites including thiamine pyrophosphate, glutathione disulfide, S-adensyl-methione, cystathione, cystine, glutathione, cysteine, thiamine, taurine, and methionine (Fig. 1b). The original MDT did not include correction for 34S tracer and, thus, was not evaluated here. Similarly, for all ten metabolites considered and all degrees of theoretical enrichment, the modified MDT and ULS in ElemCor were remarkably more accurate than NRE and FAM. The original ULS, however, yielded lower accuracy than NRE, indicating that the resolution effect was not properly modeled. The reason of ULS being inaccurate in 34S simulation is that the most abundant isotopes of sulfur has much less fractional abundance than that of nitrogen (95.0% 32S vs. 99.6% 14N). Therefore, deconvolution of fractional natural abundance of sulfur from the column vector will make a significant difference in the diagonal of the correction matrix.\n\nWe also evaluated the accuracy of correction for larger metabolites, with a focus on coenzyme A (Fig. 2a-c). The metabolites considered include coenzyme A (CoA), acetyl-CoA, succinyl CoA, and HMG-CoA. RMSEs between the isotopic enrichments obtained for those 4 metabolites and their theoretical value 20% were calculated for all methods. For all tracers considered, the modified MDT and ULS methods in ElemCor yielded accurate corrected results, as indicated by lower RMSE, whereas the accuracy of NRE was generally not acceptable and was even worse than FAM for 34S at 10% theoretical enrichment. The accuracy of the original ULS was excellent for 15N but was remarkably lower for 13C and 34S, which were accurately calculated by ElemCor. Similarly, the modification of MDT did not make a noticeable numerical change. Note that for large metabolites, higher instrument resolution is typically used. Therefore, we used 280,000 in our simulation.\n\nFigure 2d shows the errors of correction from different methods for all simulated data. The error in FAM before correction is up to 10%. The modified ULS in ElemCor was most accurate, while the modified MDT in ElemCor was in the second place with slight lower accuracy. Although the original MDT did not differ noticeably from the modified MDT, the tracer element is limited to 13C, 2H, and 15N. The original ULS generally undercorrected the data with an error up to 1.5%. Correction without considering the resolution effect mostly overcorrected the data with an error up to 10%. Taken together, these results demonstrate that the resolution effect can contribute significantly when correction for natural abundance is performed. The two methods used in ElemCor outperform the other methods in accuracy.\n\n### Correction for experiment data\n\nWe also performed a yeast experiment to validate ElemCor. 15N was chosen as the tracer element due to the independent incorporation of tracer atoms, allowing the binomial calculation of theoretical MDV. Not all metabolites studied in simulation have measurable enrichment from natural abundance in unlabeled samples, and therefore only ten metabolites were considered in the experiments. For all ten metabolites considered, MDT and ULS yielded more accurate results than FAM and NRE (Fig. 3a). The slight advantage of ULS over MDT shown in simulation was not present in experiments because the standard deviation of experimental measurements was larger than the advantage itself. The enrichment of one metabolite, glutathione, was not properly corrected by ULS; Fig. 3b illustrates that ULS yielded a slight undercorrection for glutathione, which is likely due to inaccurate measurement of the unlabeled samples near the limit of detection.\n\n### Software\n\nElemCor has a friendly user interface that guides users through six easy steps (Fig. 4). In Steps 1 and 2, labeled and unlabeled data (*.xlsx) are loaded. Step 2 is optional, and when it is not performed, ElemCor runs based on MDT only. In Steps 3 to 5, isotopic purity of the tracer, nominal instrument resolution, tracer element, and the type of mass analyzer are specified. In addition to 13C, 2H, and 15N, ElemCor allows 18O and 34S as the tracer element for correction. Finally, in Step 6 the loaded data are analyzed, and isotopic enrichment is calculated for each compound. When a user selects a cell in the data table, MDV and FAM for the corresponding compound and sample are shown in the figure window. The results are automatically saved in separated sheets in the original file.\n\nElemCor can be used to correct and analyze data in both tracer analysis and metabolic flux analysis. For tracer analysis where direct comparison of isotopic enrichments is needed, the GUI can accurately and rapidly perform such analysis without requiring a programming background. For metabolic flux analysis where MDVs will be used to calculate pathway fluxes, since popular flux analysis software suites such as FiatFlux and INCA are also MATLAB-based, the provided MATLAB function of ElemCor can easily be adapted to those large-scale workflows.\n\n## Discussion\n\nMDT is a mathematical theory and requires only chemical formulae to perform correction. ULS, on the other hand, is a semi-empirical method that incorporates the measurement of unlabeled samples into the correction matrix. It does not require chemical formulae but requires additional experimental measurement of unlabeled samples. They have previously been used to perform corrections for isotopic labeling experiments with defective implementations [8, 10]. The software tool ElemCor provides correction for those mathematical defects and performance improvement for those two methods. Compared to the original ULS method in Ref. , the improved ULS method used in ElemCor is significantly more accurate and removes negative MDV thanks to non-negative regression. The improved MDT used in ElemCor is as accurate as the original MDT method in Ref. , but it extends the correction algorithms to support more tracer elements and mass analyzer types. In addition to those performance improvements, ElemCor also provides a user-friendly graphical interface that enables easy data import and direct visualization of the correction process and corrected MDV.\n\nMDT and ULS are both sufficiently accurate to perform correction for natural abundance. In our simulated data tests, ULS was slightly more accurate than MDT across all compounds. In our experimental data tests, MDT was marginally more accurate for only specific compounds. MDT is sufficiently accurate for low-mass metabolites, and the additional accuracy provided by ULS may be overshadowed by experiment error. Considering the cost of additional experiment measurement, we recommend using MDT for small metabolites. We generally recommend using ULS for large metabolites, since the accuracy of MDT is noticeably lower (Fig. 2b and d). Moreover, the unlabeled samples can also track instrument bias and provide correction for instrument spectral discrepancy which becomes significant for large metabolites . If heavier labeled fractions are under-measured due to instrument bias, ULS will use the distorted, unlabeled FAM as the input and therefore has a better chance of achieving a more accurate enrichment calculation.\n\n## Conclusion\n\nWe present here a software tool, ElemCor, that corrects LC-MS data from isotopic labeling experiments for natural abundance and isotopic impurity. ElemCor uses two methods—mass difference theory (MDT) and unlabeled samples (ULS) —to account for the resolution effect. We demonstrate that ElemCor corrects the mathematical errors found in previously published methods, and includes more options for tracer elements and analyzers than previously published methods.\n\nWe used simulated data with enrichment in different tracer atoms to evaluate MDT and ULS. For all compounds considered, correction without considering resolution effect (NRE, used in IsoCor) was significantly less accurate than other correction methods and not noticeably more accurate than directly using the uncorrected fractional abundances of measured isotopologs (FAM). Those findings confirm that the resolution effect needs to be considered during correction. The modified ULS method used in ElemCor is more accurate than the original ULS method and is, in fact, the most accurate of all methods tested. The modified MDT used in ElemCor was not noticeably more accurate than the original MDT. Nevertheless, the modified MDT improves upon the limitation of tracer elements and analyzer type by including two more tracer elements (oxygen and sulfur) and one more analyzer (FTICR).\n\nIn summary, considering the significant cost of experiments, we recommend MDT for low-mass compounds, where the additional accuracy provided by ULS is barely noticeable and may be overshadowed by experiment errors. For high-mass compounds, we recommend ULS. Additional inclusion of an unlabeled standard can track instrument bias, which is important for large metabolites with relatively large spectral inaccuracy. Overall, ElemCor addresses the limitations of previous stable isotope correction methods and facilitates accurate correction of mass spectrometry-based stable isotope tracer data.\n\n## Methods\n\n### Theoretical correction matrix\n\nThe correction is essentially a linear regression defined by the total correction matrix C,\n\n$${Cx}^{\\prime}\\kern0.5em =\\kern0.5em z$$\n(1)\n\nwhere z (z0, z1, z2,  … , zN)T includes the fractional abundances of measured ions (FAM) and x = x/|x|1 (x0, x1, x2,  … , xN)T is the MDV with the contribution of natural abundance and isotopic impurity removed from FAM . Here T stands for transpose and |x|1 stands for sum or L1-norm of x. The sum of z is 1 by definition. Since C typically has a norm less than 1, the sum of x is usually larger than 1. The constraints include: 1) the sum of x is 1; and 2) all components of x are non-negative. The total correction matrix C is the product of: i) the individual correction matrices for natural abundance of non-tracer elements; ii) the correction matrix for natural abundance of the tracer element; and iii) the correction matrix for isotopic impurity of the tracer element. Note that matrix multiplication is not commutative, and the order of multiplication should not be changed from the one given above.\n\nThe correction matrix for a non-tracer element Q is expressed as\n\n$${C}_1\\kern0.5em =\\kern0.5em \\left(\\begin{array}{ccccc}{q}_{0,{N}_q}& 0& 0& \\cdots & 0\\\\ {}{q}_{1,{N}_q}& {q}_{0,{N}_q}& 0& \\cdots & 0\\\\ {}{q}_{2,{N}_q}& {q}_{1,{N}_q}& {q}_{0,{N}_q}& \\cdots & 0\\\\ {}\\vdots & \\vdots & \\vdots & \\ddots & \\vdots \\\\ {}{q}_{N_t,{N}_q}& {q}_{N_t-1,{N}_q}& {q}_{N_t-2,{N}_q}& \\cdots & {q}_{0,{N}_q}\\end{array}\\right)$$\n(2)\n\nHere $${q}_{i,{N}_q}$$ (i = 0, 1, 2, … , Nt) are the isotopolog natural abundance of Q where Nq is the number of mass isotopologs for Q excluding base mass and Nt is the number of mass isotopologs for a tracer element T excluding base mass. Note that qi, j < i = 0 if Nt > Nq. Only the isotopolog abundances at the lowest Nt + 1 masses are likely to be detectable and included in MDV, and thus matrix C1 is typically truncated with Nt + 1 rows remaining, yielding a square matrix [11,12,13]. The correction matrix for the tracer element T is expressed as\n\n$${C}_2\\kern0.5em =\\kern0.5em \\left(\\begin{array}{ccccc}{p}_{0,{N}_t}& 0& 0& \\cdots & 0\\\\ {}{p}_{1,{N}_t}& {p}_{0,{N}_t-1}& 0& \\cdots & 0\\\\ {}{p}_{2,{N}_t}& {p}_{1,{N}_t-1}& {p}_{0,{N}_q}& \\cdots & 0\\\\ {}\\vdots & \\vdots & \\vdots & \\ddots & \\vdots \\\\ {}{p}_{N_t,{N}_t}& {p}_{N_t-1,{N}_t-1}& {p}_{N_t-2,{N}_t-2}& \\cdots & {p}_{0,0}\\end{array}\\right)$$\n(3)\n\nHere pi, j (i = 0, 1, 2, … , Nt) are the isotopolog natural abundance of T where Nt is the number of isotopologs for T excluding base mass. pi, j are the probabilities of finding +i mass due to natural abundance in the remaining j positions of tracer atoms .\n\nThe isotopolog natural abundance of element T (or Q) can be calculated using combinatorics. When there are two stable isotopes for T (e.g., 12C/13C) with natural abundance 1 − α and α respectively, and the total number of T atoms in the molecule is equal to j, C2 can be expressed explicitly with $${p}_{i,j}={C}_j^i{\\left(1-\\alpha \\right)}^{j-i}{\\alpha}^i$$. When there are more than two stable isotopes (e.g., 16O/17O/18O), C2 has to be obtained numerically through multinomial distribution or iterative convolution [8, 9].\n\nThe correction matrix for isotopic impurity of the tracer is expressed as\n\n$${C}_3\\kern0.5em =\\kern0.5em \\left(\\begin{array}{ccccc}{r}_{0,0}& {r}_{0,1}& {r}_{0,2}& \\cdots & {r}_{0,{N}_t}\\\\ {}0& {r}_{1,1}& {r}_{1,2}& \\cdots & {r}_{1,{N}_t}\\\\ {}0& 0& {r}_{2,2}& \\cdots & {r}_{2,{N}_t}\\\\ {}\\vdots & \\vdots & \\vdots & \\ddots & \\vdots \\\\ {}0& 0& 0& \\cdots & {r}_{N_t,{N}_t}\\end{array}\\right)$$\n(4)\n\nHere ri, j (i = 0, 1, 2, … , Nt) are the probabilities of finding the ith isotopolog when the nutrient has isotopic impurity given that the jth (j = i, i + 1, … , Nt) isotopolog is found when the nutrient is pure. When there are two stable isotopes for T, $${r}_{i,j}={C}_j^i{\\beta}^{j-i}{\\left(1-\\beta \\right)}^i$$, where β is the impurity of the tracer element. Similarly, when there are more than two stable isotopes, ri, j can be obtained numerically using multinomial distribution or iterative convolution. Note that isotopic purities are reported at the atomic level. For example, U-13C6 glucose with 99% isotopic purity has 94% glucose with all carbons labeled by 13C. The number of individual correction matrices to be included is dependent on the chemical formula of the compound of interest. For example, if a compound has one tracer element and two non-tracer elements, the total correction matrix is then $$C={C}_1{C}_1^{\\prime }{C}_2{C}_3$$, where C1 and $${C}_1^{\\prime }$$ correspond to the individual correction matrices for the two non-tracer elements, respectively.\n\n### Unlabeled samples (ULS)\n\nThe aforementioned formulation fails to consider resolution of the isotopologs and, therefore, may be inaccurate for high-resolution instruments. To address that limitation, measured fractional abundances of the compound in an unlabeled sample can be used to approximate the effect of resolution on the correction matrix . Theoretically, metabolites from an unlabeled sample have no isotopic enrichment in MDV, namely x = (1, 0,  … , 0)T. Therefore, according to Eq. (1), the FAM from an unlabeled sample corresponds to the first column of the correction matrix for natural abundance. However, that vector should not be used as-is to construct every column of the correction matrix, as done by others .\n\nIn fact, the column vectors in the correction matrix are different since the number of tracer atoms considered for natural abundance is different for every column (Eq. 3) [6, 9]. It has been shown by researchers that convolution is an efficient way to construct the column vectors of the correction matrix . This is because the Nth order multinomial coefficients are components of a vector obtained by N convolutions of the event probability vector. Since the number of tracer atoms considered for natural abundance is different by one for neighboring columns , besides the padded zeros, the difference between two neighboring columns in the correction matrix for natural abundance is simply a convolution of the fractional natural abundance of the tracer element. As a result, one can obtain the correction matrix for natural abundance by deconvolution of the fractional natural abundance of the tracer element Nt times from the FAM from an unlabeled sample. Figure 5(a) shows the effect of deconvolution on the correction matrix for natural abundance for acetyl-CoA, which was used as an example in . Deconvolution remarkably changes the components on the main diagonal as indicated by their colors.\n\nSince unlabeled samples do not contain any information about the labeling agent, the FAM from an unlabeled sample only helps to construct the correction matrix for natural abundance. The correction matrix for isotopic impurity of the tracer needs to be constructed using Eq. (4). We implemented those corrections in ElemCor.\n\n### Mass difference theory (MDT)\n\nMass difference theory (MDT) can also be used to zero out certain components of the correction matrix based on the actual instrument mass resolution . A non-tracer-labeled ion can be resolved from the tracer-labeled ion and excluded from the correction matrix if the mass (m/z) difference satisfies $$\\Delta M\\ge 1.66{M}^{1.5}/R\\sqrt{M_R}$$ or ∆M ≥ 1.66M2/RMR for Orbitrap or FTICR analyzers. Here ∆M is the mass difference between the two ions, M is accurate mass of the tracer-labeled isotopolog, R is nominal instrument resolution, and MR is the m/z where the nominal instrument resolution is defined and is classically 200 for Orbitrap and 400 for FTICR [8, 14]. This criterion is used to calculate the correction limit for each non-tracer heavy isotope. For example, the smallest resolvable mass difference, ∆M, for glutamine (C5H10N2O3) isotopologs under a nominal resolution of 100,000 in Orbitraps is 2.07 ∙ 10−3. The mass difference between a 17O1-glutamine ion and a labeled 13C1-glutamine ion is 8.62 ∙ 10−4. Therefore, the correction limit of 17O is the nearest integer less than or equal to 2.07 ∙ 10−3/8.62 ∙ 10−4, and is equal to 2. That is, only two 17O atoms can be “disguised” as 13C atoms and need to be considered in the correction matrix. Similarly, the correction limits of all the M + 1 heavy isotopes such as 15N, and 2H are both zero (mass differences of 6.32 ∙ 10−3 and 2.92 ∙ 10−3 respectively), yielding both of them resolvable under the resolution. For M + 2 heavy isotope 18O, the mass difference between an 18O1-glutamine ion and a labeled 13C2-glutamine ion is 2.46 ∙ 10−3 > 2.07 ∙ 10−3, and thus it has a correction limit of zero as well. As a result, the original MDT only considers 13C and two 17O atoms in the correction matrix for glutamine at a resolution of 100,000.\n\nThe determination of isotope exclusion in the correction matrix based on correction limits of individual isotopes is not self-consistent. For example, for glutamine at a resolution of 100,000, the correction limits for 17O and 18O are 2 and 0, respectively, indicating that 18O is resolvable and, therefore, excluded. However, due to the opposite signs of the two mass differences, a non-tracer labeled ion with two 17O atoms and one 18O atom has a mass difference of 7.39 ∙ 10−4 (< the smallest resolvable mass difference 2.07 ∙ 10−3) from the corresponding labeled ion and should actually be included in the correction matrix. The weakness of the correction limits used in the original MDT can be circumvented by directly calculating the sum of mass differences from all isotopes for determination. Figure 5(b) illustrates the combinations of different oxygen atoms of glutamine considered in the correction matrix for different methods.\n\n### Implementation\n\nWe developed a software tool, ElemCor, for correction of stable isotope tracer data using both ULS and MDT to construct the correction matrix and a non-negative constraint in the regression. ElemCor is a stand-alone application with a friendly graphical interface. Non-negative linear regression of Eq. (1) followed by normalization to the sum of 1 is used to obtain MDV in ElemCor, and isotopic enrichment is calculated as $${\\sum}_{i=1}^Ni\\cdot {x}_i$$ [9, 15]. The correction matrix in Eq. (1) was constructed using MDT and/or ULS as described above. ElemCor was developed under MATLAB (2016b) environment. An ElemCor function without graphical interface is also available so it can be easily adapted to most metabolic flux analysis software suites, which are also MATLAB-based [16, 17].\n\n### Validation datasets\n\nWe used both simulated and experimental data to validate ElemCor. Simulations at incremented nutrient enrichments were performed using the isotope simulation module in Xcalibur (Thermo Fisher Scientific). The chemical formula describing the isotopolog mixture for 20% 15N glutamine (C5H10N2O3 × 0.64 + C5H10NNO3 × 0.32 + C5H10N2O3 × 0.04) and resolutions of 140,000 and 280,000 were used for the simulation. Experiments were performed on yeast (S. cerevisiae) grown in 1% glucose and yeast nitrogen base (0.5% NH4Cl) with 20.0% 15N in ammonium for labeled samples and 0% for unlabeled samples . The isotopic purity of the nutrient is 99%. Each sample was harvested from 4 mL of yeast cell culture when the OD600 reached 0.6. Cell extract was used in the LC-MS analysis (Orbitrap Q Exactive PLUS Mass Spectrometer, Thermo Fisher Scientific).\n\n## Abbreviations\n\nFAM:\n\nFractional abundance of measured isotopologs\n\nMDT:\n\nMass difference theory\n\nMDV:\n\nMass distribution vector\n\nULS:\n\nUnlabeled samples\n\n## References\n\n1. 1.\n\nJiang L, Shestov AA, Swain P, Yang C, Parker SJ, Wang QA, Terada LS, Adams ND, McCabe MT, Pietrak B, et al. Reductive carboxylation supports redox homeostasis during anchorage-independent growth. Nature. 2016;532(7598):255–8.\n\n2. 2.\n\nMartínez-Reyes I, Diebold Lauren P, Kong H, Schieber M, Huang H, Hensley Christopher T, Mehta Manan M, Wang T, Santos Janine H, Woychik R, et al. TCA cycle and mitochondrial membrane potential are necessary for diverse biological functions. Mol Cell. 2016;61(2):199–209.\n\n3. 3.\n\nGuan D, Xiong Y, Borck PC, Jang C, Doulias P-T, Papazyan R, Fang B, Jiang C, Zhang Y, Briggs ER: Diet-induced circadian enhancer remodeling synchronizes opposing hepatic lipid metabolic processes. Cell 2018, 174(4):831–842. e812.\n\n4. 4.\n\nJang C, Chen L, Rabinowitz JD. Metabolomics and isotope tracing. Cell. 2018;173(4):822–37.\n\n5. 5.\n\nBuescher JM, Antoniewicz MR, Boros LG, Burgess SC, Brunengraber H, Clish CB, DeBerardinis RJ, Feron O, Frezza C, Ghesquiere B, et al. A roadmap for interpreting 13C metabolite labeling patterns from cells. Curr Opin Biotechnol. 2015;34:189–201.\n\n6. 6.\n\nLee WN, Byerley LO, Bergner EA, Edmond J. Mass isotopomer analysis: theoretical and practical considerations. Biol Mass Spectrom. 1991;20(8):451–8.\n\n7. 7.\n\nShlomi T, Fan J, Tang B, Kruger WD, Rabinowitz JD. Quantitation of cellular metabolic fluxes of methionine. Anal Chem. 2014;86(3):1583–91.\n\n8. 8.\n\nSu X, Lu W, Rabinowitz JD. Metabolite spectral accuracy on Orbitraps. Anal Chem. 2017;89(11):5940-5948.\n\n9. 9.\n\nMillard P, Letisse F, Sokol S, Portais JC. IsoCor: correcting MS data in isotope labeling experiments. Bioinformatics. 2012;28(9):1294–6.\n\n10. 10.\n\nTrefely S, Ashwell P, Snyder NW. FluxFix: automatic isotopologue normalization for metabolic tracer analysis. BMC Bioinformatics. 2016;17(1):485.\n\n11. 11.\n\nChinkes DL, Aarsland A, Rosenblatt J, Wolfe RR. Comparison of mass isotopomer dilution methods used to compute VLDL production in vivo. Am. J. Physiol. 1996;271(2 Pt 1):373-383.\n\n12. 12.\n\nVan Winden W, Wittmann C, Heinzle E, Heijnen J. Correcting mass isotopomer distributions for naturally occurring isotopes. Biotechnol. Bioeng. 2002;80(4):477-479.\n\n13. 13.\n\nWittmann C, Heinzle E. Mass spectrometry for metabolic flux analysis. Biotechnol. Bioeng. 1999;62(6):739-750.\n\n14. 14.\n\nZubarev RA, Makarov A. Orbitrap Mass Spectrometry. Anal. Chem. 2013;85(11):5288-5296.\n\n15. 15.\n\nChevrier S, Crowell HL, Zanotelli VR, Engler S, Robinson MD, Bodenmiller B. Compensation of Signal Spillover in Suspension and Imaging Mass Cytometry. Cell Syst. 2018;6(5):612-620.\n\n16. 16.\n\nZamboni N, Fendt S-m, Rühl M, Sauer U. 13C-based metabolic flux analysis. Nat. Protoc. 2009;4(6):878-892.\n\n17. 17.\n\nYoung JD. INCA: a computational platform for isotopically non-stationary metabolic flux analysis. Bioinformatics. 2014;30(9):1333-1335.\n\n## Acknowledgements\n\nWe thank Lifeng Yang for insightful discussions.\n\n### Funding\n\nThis work was supported by Cancer Prevention and Research Institute of Texas grant RP130397 and NIH grants P30 CA072720, 5R01DK063349–12, P30 CA016672, and 1S10OD012304–01. The funding bodies did not play any roles in the design of the study and collection, analysis, and interpretation of data and in writing the manuscript.\n\n### Availability of data and materials\n\nThe software tool, example input and output data, and a detailed tutorial are available at https://github.com/4dsoftware/elemcor.\n\n## Author information\n\nAuthors\n\n### Contributions\n\nDD, LT, YW, XS, and BP designed the algorithms and performed software evaluations. XS designed and performed biological experiments. XS provided simulation and experiment data. DD prepared the figures and drafted the manuscript. DD, XS, and PLL reviewed and edited the manuscript. DD, LT, YW, BP, JNW, FEW, XS, and PLL were involved in discussions throughout the study and approved the final manuscript.\n\n### Corresponding authors\n\nCorrespondence to Xiaoyang Su or Philip L. Lorenzi.\n\n## Ethics declarations\n\nNot applicable.\n\nNot applicable.\n\n### Competing interests\n\nThe authors declare that they have no competing interests.\n\n### Publisher’s Note\n\nSpringer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.\n\n## Rights and permissions", null, "" ]
[ null, "https://bmcbioinformatics.biomedcentral.com/track/article/10.1186/s12859-019-2669-9", null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.88949394,"math_prob":0.935737,"size":30709,"snap":"2021-43-2021-49","text_gpt3_token_len":7108,"char_repetition_ratio":0.15938772,"word_repetition_ratio":0.04855842,"special_character_ratio":0.21817708,"punctuation_ratio":0.13196692,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.96475077,"pos_list":[0,1,2],"im_url_duplicate_count":[null,4,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2021-10-20T07:35:58Z\",\"WARC-Record-ID\":\"<urn:uuid:939a8cb2-4f7a-40cb-9aaa-a0d8938197b4>\",\"Content-Length\":\"234679\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:656ed2a5-b8ee-487a-bc3b-b688c7c8c72c>\",\"WARC-Concurrent-To\":\"<urn:uuid:b443ccec-514c-483d-9872-775364f0f8b6>\",\"WARC-IP-Address\":\"199.232.64.95\",\"WARC-Target-URI\":\"https://bmcbioinformatics.biomedcentral.com/articles/10.1186/s12859-019-2669-9\",\"WARC-Payload-Digest\":\"sha1:75GPXOPR2FL5WHPAC4NAC7D7YH7U7BRJ\",\"WARC-Block-Digest\":\"sha1:NVA6SZZ6LFA476IEN4674SD57LE5JQ6A\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2021/CC-MAIN-2021-43/CC-MAIN-2021-43_segments_1634323585302.91_warc_CC-MAIN-20211020055136-20211020085136-00389.warc.gz\"}"}
https://calmcode.io/sympy/generalize-maths.html
[ "#", null, "sympy: generalize maths\n\nNotes\n\nThe goal is to have the variable `c` represent the circumference of the fence. By having this as a variable instead of a number we might be able to do more interesting things with it. We could for example ask the question, what if the circumference was bigger, what would the maximum area then be? Maths allows us to answer these sort of questions and sympy helps us automate it with python.\n\nThe code is listed below.\n\n``````import sympy as sp\nl, w = sp.symbols(\"l, w\")\narea = l * w\ncircumference = 2 * l + 2 * w\n# define variable for circumference\nc = sp.symbol(\"c\")\nl_expr = sp.solve(sp.Eq(circumference, c), l)\n\nopt_w = sp.solve(sp.diff(area.subs(l, l_expr), w), w)\nopt_l = l_expr.subs(w, opt_w)\nopt_area = opt_w * opt_l\nsp.plot(opt_area);\n``````\n\nFeedback? See an issue? Something unclear? Feel free to mention it here.\n\nIf you want to be kept up to date, consider signing up for the newsletter." ]
[ null, "https://calmcode.io/images/sympy.svg", null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.8551517,"math_prob":0.9417468,"size":1105,"snap":"2020-45-2020-50","text_gpt3_token_len":289,"char_repetition_ratio":0.10808356,"word_repetition_ratio":0.0,"special_character_ratio":0.25429866,"punctuation_ratio":0.15879828,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.99267024,"pos_list":[0,1,2],"im_url_duplicate_count":[null,null,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2020-11-26T07:26:41Z\",\"WARC-Record-ID\":\"<urn:uuid:65932668-2701-49a6-af4d-df2ec3f9ab1b>\",\"Content-Length\":\"9319\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:9f303558-dc2b-4614-97fc-beb8a97d7232>\",\"WARC-Concurrent-To\":\"<urn:uuid:fadb3681-3a29-45a0-9b7f-2c106cdf0991>\",\"WARC-IP-Address\":\"104.248.60.43\",\"WARC-Target-URI\":\"https://calmcode.io/sympy/generalize-maths.html\",\"WARC-Payload-Digest\":\"sha1:HITI7IHSHKU273B7DEKYDLGV4TQNTZD4\",\"WARC-Block-Digest\":\"sha1:BQYFXHE53DPREDMU4QUF2EE6CG72UKRT\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2020/CC-MAIN-2020-50/CC-MAIN-2020-50_segments_1606141186761.30_warc_CC-MAIN-20201126055652-20201126085652-00649.warc.gz\"}"}
https://www.thebestfashion.co/2020/11/how-tall-is-70-inches-in-feet-and-centimeters/
[ "# How tall is 70 inches in feet and centimeters\n\nMany times we want to know the inch unit in feet. The reason for this is that many factors come in the measure of feet that is why we need to know the unit of inch in feet. In today’s article, we will see how 70 inches measure in feet. Because the height of many celebrities is said to be equal to 70 inches. When we know about the height of such celebrities, then the information related to their height is equal to 70 inches if we get it in inches. Let us know how much of such celebrity will be in the height.\n\n70 inches\n\nDo you know that if there are 12 inches in feet, then 70 inches will be converted into feet in this way?\n\n70 inches = 70/12 = 5.83 feet\n\nDo you know that there are 2.5 centimeters in an inch, so 70 inches will be converted into centimeters in this way?\n\n70 inches = 70X2.5 = 175 cm\n\nWhen we try to learn about the height of celebrities like Anthony Hopkins, Carrie Ann Moss, Sarah Ramirez, Kate Middleton, Jackie Chan, we get to know that these celebrities have a height of 70 inches. Therefore, we can also consider the height of these celebrities as 5.83 feet or 175 centimeters." ]
[ null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.9452057,"math_prob":0.97905403,"size":1100,"snap":"2021-31-2021-39","text_gpt3_token_len":268,"char_repetition_ratio":0.16970803,"word_repetition_ratio":0.037914693,"special_character_ratio":0.26,"punctuation_ratio":0.099585064,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.97108287,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2021-09-25T13:34:22Z\",\"WARC-Record-ID\":\"<urn:uuid:f98727d5-7dfc-444d-aa0b-61da0f2ca565>\",\"Content-Length\":\"25257\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:5f62f96d-7a63-4496-bdd5-e806cc46f81e>\",\"WARC-Concurrent-To\":\"<urn:uuid:5f9b91bc-91a6-4849-a0e8-d81d401ffd66>\",\"WARC-IP-Address\":\"162.210.101.174\",\"WARC-Target-URI\":\"https://www.thebestfashion.co/2020/11/how-tall-is-70-inches-in-feet-and-centimeters/\",\"WARC-Payload-Digest\":\"sha1:DN7A2MR7OHJCNV73SVH7PO2DE7HZWDCP\",\"WARC-Block-Digest\":\"sha1:RO7QUMOOJF37SBV5AS43M44PBEVVJQT6\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2021/CC-MAIN-2021-39/CC-MAIN-2021-39_segments_1631780057622.15_warc_CC-MAIN-20210925112158-20210925142158-00173.warc.gz\"}"}
https://www.semanticscholar.org/paper/Special-Values-of-Zeta-Functions-of-Schemes-Lichtenbaum/c00ff02ba4185a5c26b16e443aeac78c641b7a44
[ "• Corpus ID: 119642455\n\n# Special Values of Zeta Functions of Schemes\n\n@article{Lichtenbaum2017SpecialVO,\ntitle={Special Values of Zeta Functions of Schemes},\nauthor={Stephen Lichtenbaum},\njournal={arXiv: Algebraic Geometry},\nyear={2017}\n}\n• S. Lichtenbaum\n• Published 31 March 2017\n• Mathematics\n• arXiv: Algebraic Geometry\nLet X be a regular scheme, projective and flat over Spec \\mathbb Z. We give two conjectural formulas, up to sign and powers of 2, for \\zeta^*(X,r), the leading term in the series expansion of \\zeta(X,s) at s=r. The first formula builds on work of Fontaine and Perrin-Riou replacing \\mathbb Q_structuers by \\mathbb Z-structures, and the second is a very simple formula in terms of the Euler characteristic of a certain complex of sheaves in a hypothetical Weil-etale Grothendieck topology. A…\nFollowing the ideas of Flach and Morin , we state a conjecture in terms of Weil-étale cohomology for the vanishing order and special value of the zeta function ζ(X, s) at s = n < 0, where X is a\nFollowing the ideas of Flach and Morin [FM2018], we state a conjecture in terms of Weil-étale cohomology for the vanishing order and special value of the zeta function ζ(X, s) at s = n < 0, where X\nLet X be an arithmetic scheme (i.e., separated, of finite type over SpecZ) of Krull dimension 1. For the associated zeta function ζ(X, s), we write down a formula for the special value at s = n < 0\nWe construct the Weil-\\'etale cohomology and Euler characteristics for a subclass of the class of $\\mathbb{Z}$-constructible sheaves on the spectrum of the ring of integers of a totally imaginary" ]
[ null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.75302625,"math_prob":0.94852364,"size":4524,"snap":"2022-40-2023-06","text_gpt3_token_len":1176,"char_repetition_ratio":0.1511062,"word_repetition_ratio":0.1075419,"special_character_ratio":0.22303271,"punctuation_ratio":0.062659845,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9965502,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2023-02-04T05:56:42Z\",\"WARC-Record-ID\":\"<urn:uuid:ae6c55bf-271a-41a2-a306-549eacc83f53>\",\"Content-Length\":\"277367\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:dc3555a7-4840-4433-8f0b-bf04d431d00a>\",\"WARC-Concurrent-To\":\"<urn:uuid:9dc08316-4b18-4287-9c3d-df904233c15c>\",\"WARC-IP-Address\":\"18.154.227.128\",\"WARC-Target-URI\":\"https://www.semanticscholar.org/paper/Special-Values-of-Zeta-Functions-of-Schemes-Lichtenbaum/c00ff02ba4185a5c26b16e443aeac78c641b7a44\",\"WARC-Payload-Digest\":\"sha1:OIAD7ED2P4KX2STXUW5WFGANUPBYHLKO\",\"WARC-Block-Digest\":\"sha1:DGMXDYLHB5XTPAQHFCEZ4BKIU5E4QTYH\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2023/CC-MAIN-2023-06/CC-MAIN-2023-06_segments_1674764500094.26_warc_CC-MAIN-20230204044030-20230204074030-00322.warc.gz\"}"}
https://legacy.saylor.org/k12math006/Unit04/
[ "", null, "# K12MATH006: Math Grade 6\n\nUnit 4: Geometry\n\nDid you ever play with shape blocks when you were younger? Possibly you put a triangle next to a rectangle and then added a square on a different side. Do you know how to find the area of this new shape? In this unit, you will use your prior knowledge about area, as well as some new information that we will cover, to help you decompose a complicated shape into smaller polygons in order to successfully find the area of the total shape. During this unit, you will also solve problems with three-dimensional shapes and work with a variety of real-life situations.\n\nUnit 4 Time Advisory\nCompleting this unit should take you approximately 14 hours.\n\n☐ Subunit 4.1: 30 minutes\n\n☐ Subunit 4.2: 6 hours and 45 minutes\n\n☐ Subunit 4.3: 2 hours and 15 minutes\n\n☐ Subunit 4.4: 3 hours\n\n☐ Subunit 4.5: 1 hour and 30 minutes\n\nUnit4 Learning Outcomes\nUpon successful completion of this unit, you will be able to:\n\n• Find the area of triangles and quadrilaterals.\n\n• Find the area of shapes composed of triangles and rectangles.\n\n• Apply the standard area formula to real-world situations.\n\n• Find the volume of rectangular prisms, including prisms with fractional side lengths.\n\n• Define the basic formula for volume of a rectangle prism. Explain why it works with unit cubes.\n\n• Represent a three-dimensional figure with a two-dimensional net.\n\n• Solve surface-area problems using two-dimensional nets.\n\n• Apply techniques for finding area, volume, and surface area to real-world situations.\n\nStandards Addressed (Common Core):\n\n4.1 One-, Two-, and Three-Dimensional Measurements\n\nOur world is three-dimensional. You can pick up objects up and hold them in your hand. When you look at a three-dimensional object, you can see that it has length, width, and height/depth. However, we also use one- and two- dimensions in our world, as well. One-dimensional objects are just lines, or lengths; for example, neighborhoods separate family property by a one-dimensional boundary. People often measure the length of their property line and build a fence. The fence itself is three-dimensional; however, the length of the fence is one-dimensional.\n\nTwo-dimensional refers to something that has a length and a width. When you look at a photograph, go to a movie, or watch television, you are viewing objects as two-dimensional (assuming you don’t have the special 3-D glasses). The walls in your bedroom might need painting. You could measure the length and width of the walls to calculate how much paint to buy. A wall is two-dimensional because it’s flat.\n\nWhen you walk around in your everyday life, think about how people use one-, two-, and three-dimensional measurements.\n\n• Activity: The Saylor Foundation’s “Understanding One-, Two-, and Three-Dimensions”\n\nLink: The Saylor Foundation’s “Understanding One-, Two-, and Three-Dimensions” (PDF)\n\nInstructions: Using this resource as a guide, you will create a table to help you learn about dimensional measurements. In your notebook, separate a page into three columns. Your paper should look similar to the one you see in the attached link. Title each column “One-Dimensional,” “Two-Dimensional,” and “Three-Dimensional.” Use the 4.1 subunit introduction, your prior knowledge, and the resources in this unit to add ideas about working with each dimension. It will be helpful to go back and refer to this table as you work through geometry units.\n\nSetting up your notebook and beginning to fill in this chart should take you approximately 15 minutes.\n\nStandards Addressed (Common Core):\n\n• Explanation: Khan Academy’s “Perimeter and Area Basics”\n\nInstructions: The video starts off showing you how to find the perimeter of a rectangle. This is probably a review of your prior knowledge. While you watch, draw the shapes and find the perimeter of the rectangles in the video. Remember, perimeter is a one-dimensional measurement because it’s a single line going around an object.\n\nThe second part of the video discusses area. Remember, area is a two-dimensional measurement because it has a length and width. When we find area, we use the label square units or units2 because we can actually cover our shape with squares and count them to find the area, as demonstrated in the video. Take notes while the instructor finds the areas of the rectangles.\n\nWatching this video and taking notes should take you approximately 15 minutes.\n\nStandards Addressed (Common Core):\n\n4.2 Area\n\nThis subunit focuses specifically on finding the area of a variety of shapes. Remember, area is measured in square units or units2. You will use different formulas to find area based on the shape you are working with. Try not to get too caught up in memorizing formulas. It is actually much easier if you stop and think about the shape and a strategy that would make sense for finding its area. The resources in this unit will help you with these strategies. This subunit will give you a chance to add notes to your “Two-Dimensional” column in your notebook.\n\n4.2.1 Triangles\n\nAs you work through the resources in this subunit, really focus on how you can understand and not just memorize the formula for the area of a triangle. Even though there are different types of triangles, you will discover how similar the strategies are for finding the area.\n\n• Explanation: Khan Academy’s “Triangle Area Proof”\n\nInstructions: Draw a right triangle in your notebook. Follow along with the strategy to make the triangle into a rectangle. Notice how your triangle is exactly half of the rectangle you drew around it. Copy the formula that fits with this strategy used in the video.\n\nContinue watching the “proof” for how to find the area of the other types of triangles shown in the video. Draw each triangle with the instructor. Consider how you can use the same strategy of drawing rectangles around triangles to find the area of any triangle.\n\nIt is OK to refer to the formula A = bh (area = x base x height) when dealing with triangles. However, you should be able to explain why that formula works.\n\nWatching this video and taking notes should take you approximately 30 minutes.\n\nStandards Addressed (Common Core):\n\n• Did I Get This? Activity: Illustrative Mathematics: “Base and Height”\n\nLink: Illustrative Mathematics: “Base and Height” (PDF)\n\nInstruction: Read about Mrs. Lito’s students and look at the way they labeled the triangles. Answer questions a and b. Scroll down to read the “Commentary” and “Solution” sections on pages 2 and 3.\n\nCompleting this activity should take you approximately 15 minutes.\n\nStandards Addressed (Common Core):\n\n• Did I Get This? Activity: Khan Academy’s “Area of Triangles”\n\nLink: Khan Academy’s “Area of Triangles” (HTML)\n\nInstructions: This page provides a series of practice problems that you can answer and check online. Each question has a solution worked out step-by-step if you need hints along the way. Practice solving for the area of triangles until you feel confident that you understand how to find the area of a triangle (recommended a minimum of 10 minutes of practice).\n\nCompleting these practice problems should take you approximately 15 minutes.\n\nStandards Addressed (Common Core):\n\nA quadrilateral is a four-sided shape. You probably have some experience with quadrilaterals like rectangles and squares. This subunit will review the area of some quadrilaterals.\n\n• Explanation: Khan Academy’s “Area and Perimeter”\n\nInstructions: While watching this video, press pause when the instructor shows you a new shape. Draw the shape in your notebook and find the area and perimeter of the shape. Watch and listen as he explains the process. Don’t just skip ahead to the answer because the instructor gives you some important reminders.\n\nWatching this video and completing the sample problems should take you approximately 30 minutes.\n\nStandards Addressed (Common Core):\n\n• Did I Get This? Activity: Khan Academy’s “Area 1”\n\nInstructions: This page provides a series of practice problems that you can answer and check online. Each question has a solution worked out step-by-step if you need hints along the way. Practice solving for area until you feel confident that you understand how to find the area (recommended a minimum of 10 minutes of practice).\n\nWorking these practice problems should take you approximately 15 minutes.\n\nStandards Addressed (Common Core):\n\n• Did I Get This? Activity: Khan Academy’s “Area of Squares and Rectangles”\n\nLink: Khan Academy’s “Area of Squares and Rectangles” (HTML)\n\nInstructions: This page provides a series of practice problems that you can answer and check online. Each question has a solution worked out step-by-step if you need hints along the way. Practice solving for area until you feel confident that you understand how to find the area (recommended a minimum of 10 minutes of practice).\n\nWorking these practice problems should take you approximately 15 minutes.\n\nStandards Addressed (Common Core):\n\n• Explanation: Bettina Richmond and Tom Richmond’s “Area Formulas for Basic Shapes”\n\nLink: Bettina Richmond and Tom Richmond’s “Area Formulas for Basic Shapes” (HTML)\n\nInstructions: This page provides you with animated justification for how to find the area of shapes. Watch the animation for “Area of a Rectangle” and “Area of a Parallelogram.” In your notebook, take notes of the formula and the text given to you. Also, sketch the animation the best you can. Note: there is no sound.\n\nCompleting this task should take you approximately 15 minutes.\n\nStandards Addressed (Common Core):\n\n• Explanation: CK-12: “Area of a Parallelogram”\n\nLink: CK-12: “Area of a Parallelogram” (HTML)\n\nInstructions: The previous resource showed you an animation of how to find the area of a parallelogram. This resource will also explain through words and pictures how to find the area of a parallelogram and why it works. Read through the introduction; take notes as you read through the “Guidance” section. Do the example problems and write down the vocabulary words. Complete the “Guided Practice” and watch the video. You will do some practice problems below.\n\nTaking notes, working examples, and watching the video should take you approximately 30 minutes.\n\nStandards Addressed (Common Core):\n\n• Did I Get This? Activity: Activity: Khan Academy’s “Area of Parallelograms”\n\nLink: Khan Academy’s “Area of Parallelograms” (HTML)\n\nInstructions: This page provides a series of practice problems that you can answer and check online. Each question has a solution worked out step-by-step if you need hints along the way. Practice solving for area until you feel confident that you understand how to find the area (recommended a minimum of 10 minutes of practice).\n\nCompleting this activity should take you approximately 15 minutes.\n\nStandards Addressed (Common Core):\n\n• Did I Get This? Activity: YouTube: Mathispower4u: James Sousa’s “Example: Determine the Area of a Rectangle Using Mixed Numbers”\n\nLink: YouTube: Mathispower4u: James Sousa’s “Example: Determine the Area of a Rectangle Using Mixed Numbers” (YouTube)\n\nInstructions: As you watch the video, draw the rectangle and label the side lengths. Pause the video while you solve for the area of the rectangle. (This is a good review for dealing with fractions.) Don’t forget to simplify your answer back to a mixed number. Watch the remainder of the video. Compare your answer with the instructor’s.\n\nCompleting this problem should take you approximately 15 minutes.\n\nStandards Addressed (Common Core):\n\n4.2.3 Composite Figures\n\nPicture a square and a triangle pushed up together to share a side length. This is called a composite figure. A composite figure is a figure that is made of a variety of shapes. When you are asked to find the perimeter of a composite figure, keep in mind that perimeter is the distance around an object. It is sometimes helpful to take your pencil and trace the outside of the object; you will need to add each of those side lengths together to find the perimeter. When finding the area of a composite figure, think about how you can break the object into smaller, separate shapes. Once you’ve done that, you will find the area of the smaller shapes. Then, you will add the individual areas together. Sometimes, side lengths won’t be given, but clues within the problem or the shape can help you figure out the missing side length.\n\n• Explanation: CK-12: “Area of Composite Shapes”\n\nLink: CK-12: “Area of Composite Shapes” (HTML)\n\nInstructions: This lesson will provide you with a few videos to explain how to find the area of composite shapes. Begin watching the first video. Pause the video so you can take the time to draw the shape. Solve for the area of the composite shape with the instructor. Note: at the 1:40 mark in the video, the instructor figures that the height of the triangle is 3. Do not worry about the process used to find the height. You will learn about that later in your math career.\n\nScroll down to the second video and begin watching. Pause the video to draw the shape. Try to find the area of the composite figure before the instructor. Watch the instructor’s process. Complete the next composite shape with the same process.\n\nComplete practice problems 1 - 15 at the end of the lesson.\n\nWatching these videos and completing the practice problems should take you approximately 45 minutes.\n\nStandards Addressed (Common Core):\n\n• Explanation: CK-12: “Area of Composite Shapes Involving Triangles”\n\nLink: CK-12: “Area of Composite Shapes Involving Triangles” (HTML)\n\nInstructions: Read about home plate. Think of other everyday objects that are made of a variety of shapes - the “key” on a basketball court, a hopscotch pattern, a stained glass window, and the front image of a house. Read through the “Guidance” section, draw the composite figures, and label the side lengths. Work the example problems. For each one, draw the shape and calculate the area. Check your work with the answer provided. Continue working down the page, completing the “Guided Practice” and “Practice” problems.\n\nTaking notes and completing the practice problems should take you approximately 1 hour.\n\nStandards Addressed (Common Core):\n\n• Did I Get This? Activity: YouTube: Mathispower4u: James Sousa’s “Ex: Find the Area of an L-Shaped Polygon Involving Whole Numbers”\n\nLink: YouTube: Mathispower4u: James Sousa’s “Ex: Find the Area of an L-Shaped Polygon Involving Whole Numbers” (YouTube)\n\nInstructions: Look at the composite figure. Pause the video. Draw the shape and find the area - remember to split the composite figure into smaller rectangles. To find the length of the missing sides, use the other side lengths given to you. Do not estimate, measure, or guess side lengths! Watch the remainder of the video to compare your strategy to the instructor’s. Could you have split your composite figure into rectangles in a different way than the instructor did, while still finding the area to be the same?\n\nWatching this video and taking notes should take you approximately 15 minutes.\n\nStandards Addressed (Common Core):\n\n• Did I Get This? Activity: Khan Academy’s “Interesting Perimeter and Area Problems”\n\nInstructions: Watch the video and pause it at the 0:40 mark. Draw the star shape on your paper. Try to find the perimeter based on the information given to you. Watch the instructor as he explains how to find the star perimeter. Compare your strategy to his.\n\nPause the video at 2:40. Think about how you can find the area of this shape. Break it into two smaller shapes. Draw the composite figure and find the area. If you are struggling, watch another 1:00 to see a good first step in solving for this area. Once you have found the area, watch the instructor as he continues explaining how to find the area of the composite figure. Compare your strategy to his.\n\nPause the video at 5:20. Draw the shape. Label the given side lengths. Think about how you find the other side lengths (without guessing, estimating, or measuring). If you need a hint, watch the video for another 1:10 and see what the instructor’s strategy is with the side lengths. If you feel confident, pause the video again at 6:30 and find the perimeter. Watch the remainder of the video to see how the instructor finds the perimeter.\n\nWatching this video and working through the example problems should take you approximately 30 minutes.\n\nStandards Addressed (Common Core):\n\n• Did I Get This? Activity: YouTube: Mathispower4u: James Sousa’s “Ex: Determine the Area of an L-Shaped Polygon Using Decimals”\n\nLink: YouTube: Mathispower4u: James Sousa’s “Ex: Determine the Area of an L-Shaped Polygon Using Decimals” (YouTube)\n\nInstructions: Look at the composite figure. Pause the video. Draw the shape and find the area - remember to split the composite figure into smaller rectangles. To find the length of the missing sides, use the other side lengths given to you. Do not estimate, measure, or guess side lengths! Watch the remainder of the video to compare your strategy to the instructor’s. Could you have split your composite figure into rectangles in a different way than the instructor did, while still finding the area to be the same?\n\nCompleting this problem should take you approximately 15 minutes.\n\nStandards Addressed (Common Core):\n\n• Did I Get This? Activity: Illustrative Mathematics: “Finding Areas of Polygons, Variation 1”\n\nLink: Illustrative Mathematics: “Finding Areas of Polygons, Variation 1” (HTML)\n\nInstructions: This activity is an opportunity for you to explore different strategies for finding area. Keep in mind that when you have a composite figure, there is not a simple formula for finding area. You will need to problem solve and think outside the box as you work to find two strategies for finding the area of each polygon. Once you have answers, scroll down and read the “Commentary” and “Solution” sections on pages 2 and 3.\n\nCompleting this activity should take you approximately 30 minutes.\n\nStandards Addressed (Common Core):\n\n• Did I Get This? Activity: YouTube: Mathispower4u: James Sousa’s “Area Application - Area of an Inner Room with an Outer Footing”\n\nLink: YouTube: Mathispower4u: James Sousa’s “Area Application - Area of an Inner Room with an Outer Footing” (YouTube)\n\nInstructions: Read the problem with the instructor. Pause the video at the 0:25 mark. Draw the room and the outer footing. Solve for the inside dimensions and area of the inner room. Watch the remainder of the video to compare your strategy with the instructor’s.\n\nWatching this video and completing the activity should take you approximately 15 minutes.\n\nStandards Addressed (Common Core):\n\n4.3 Surface Area\n\nHave you ever wrapped a gift for someone? You have to make sure you cut off enough wrapping paper so that it covers the entire gift. The box that gift is in is a three-dimensional box; in math it would be called a rectangular prism (although you might just think of it as a shoebox). The wrapping paper covers the gift - each side, or face, of the box is a two-dimensional surface. To figure out how much wrapping paper is needed, mathematicians find the surface area. This subunit focuses on how to find surface area and introduces you important vocabulary you need to know when dealing with two- and three-dimensional objects. This subunit will give you a chance to add notes to your “Two-Dimensional” and “Three-Dimensional” columns in your notebook.\n\n4.3.1 Nets   - Explanation: Explanation: CK-12: “Surface Area of Prisms”\n\n``````Link: CK-12: [“Surface Area of\nPrisms”](http://www.ck12.org/geometry/Surface-Area-of-Prisms/lesson/Surface-Area-of-Prisms/) (HTML)\n\nInstructions: The purpose of this lesson is to help you learn some\nvocabulary concerning two- and three-dimensional measurements. While\nyou read through the lesson, do not focus on the mathematical\ncomputations; you will work on the math a little later.\n\nRead the introduction. In the “Guidance” section, take notes on\nwords such as **three-dimensional, prism, surface area,** and\n**net.** After the third “sticky note” with a net on it, skip down\nto examples A, B, and C. Go through each true/false question.\n\nSkip down to the “Vocabulary” section. Make sure you have each of\nthe vocabulary words clearly defined in your notebook.\n\nIf you can, cut out a net from a piece of your notebook paper (or\ngraph paper if you have it). Fold the net to form a\nthree-dimensional rectangular prism or cube. Tape your rectangular\nprism together and use it as an example as you continue through this\nunit.\n\nTaking notes and building a net should take you approximately 45\nminutes.\n\nStandards Addressed (*Common Core*):\n\n- [CCSS.Math.Content.6.G.A.4](http://www.corestandards.org/Math/Content/6/G/A/4)\n\nattributed to CK-12.\n``````\n\n4.3.2 Parts of a Three-Dimensional Object   - Explanation: CK-12: “Faces, Edges, and Vertices of Solids”\n\n``````Link: CK-12: [“Faces, Edges, and Vertices of\nSolids”](http://www.ck12.org/geometry/Faces-Edges-and-Vertices-of-Solids/lesson/Faces-Edges-and-Vertices-of-Solids/) (HTML)\n\nInstructions: This lesson will give you some more vocabulary as you\nwork with three-dimensional objects. As you read the “Guidance”\nsection, take notes on the vocabulary words: **faces, edges,** and\n**vertices**.\n\nDraw a rectangular prism, or use an actual object that you can point\nto and label - a shoebox or even a computer are examples of a\nrectangular prism. Objects are often described by their number of\nfaces, edges, or vertices. The word face is used when finding\nsurface area (see subunit 4.3.3), so make sure you understand these\nvocabulary words.\n\nComplete the examples, read through and take notes on the\n“Vocabulary” section (you will not be expected to know about a\ncylinder, pyramid, cone, or sphere as a sixth-grade student), and\ncomplete the “Guided Practice” questions.\n\nWatch the video for another view of how to label faces, edges, and\nvertices. Complete problems 1 - 7 in the “Practice” section.\n\nTaking notes, completing the practice problems, and watching the\nvideo should take you approximately 30 minutes.\n\nStandards Addressed (*Common Core*):\n\n- [CCSS.Math.Content.6.G.A.4](http://www.corestandards.org/Math/Content/6/G/A/4)\n\nattributed to CK-12.\n``````\n\n4.3.3 Solving for Surface Area   - Explanation: CK-12: “Surface Area of Rectangular Prism”\n\n``````Link: CK-12: [“Surface Area of Rectangular\nPrisms”](http://www.ck12.org/geometry/Surface-Area-of-Rectangular-Prisms/lesson/Surface-Area-of-Rectangular-Prisms/) (HTML)\n\nInstructions: Read through the introduction about wrapping the doll\nhouse. Take notes as you read through the “Guidance” section. Solve\nthe example problems given to you. Draw both a rectangular prism and\na net for each problem. This will help you recognize how a\ntwo-dimensional net is related to a three-dimensional rectangular\nprism. The formula for the surface area of a rectangular prism is\nlong and complex. However, write it down and think about how each\npart related to the actual shape.\n\nWrite down the vocabulary words, and then continue on to the “Guided\nPractice” section. Watch the video provided. Notice there is not a\nlid on the box. This takes away an entire face.\n\nAnswer questions 1 - 10 in the “Practice” section.\n\nTaking notes, watching the video, and completing the practice\nproblems should take you approximately 1 hour.\n\nStandards Addressed (*Common Core*):\n\n- [CCSS.Math.Content.6.G.A.4](http://www.corestandards.org/Math/Content/6/G/A/4)\n\nattributed to CK-12.\n``````\n\n4.4 Volume\n\nRemember the gift you were wrapping in the previous subunit? What’s inside? How do you know if you have a box that is big enough for the object you are wrapping? Whenever you are thinking about the space inside of something, you are dealing with volume. Volume is a three-dimensional measurement because it has a length, width and a height (recall the one-dimensional measurement has only a length; two-dimensional measurements have a length and a width). Volume adds a third dimension - height, or sometimes called depth. Have you ever been to a swimming pool? The amount of water in the pool is the volume. Have you ever crammed your suitcase full of clothes before you went on a trip? The amount of stuff inside your luggage is volume. This subunit focuses on how to find volume and will give you important vocabulary for dealing with volume. This subunit will give you a chance to add notes to your “Three-Dimensional” column in your notebook.\n\n4.4.1 Using Cubic Units   - Explanation: CK-12: “Volume of Prisms Using Unit Cubes”\n\n``````Link: CK-12: [“Volume of Prisms Using Unit\nCubes”](http://www.ck12.org/geometry/Volume-of-Prisms-Using-Unit-Cubes/lesson/Volume-of-Prisms-Using-Unit-Cubes/) (HTML)\n\nInstruction: Read through and take notes on the “Guidance” section.\nNotice the label for volume is in cubic units or units3 because\nvolume involves counting the cubes to fill an object. Complete the\nproblems in the “Examples” section in your notebook, take notes on\nthe “Vocabulary” (as a sixth-grade student you do not need to know\ntriangular prisms), and complete the “Guided Practice” sections.\nStop there for now. You will do some practice with unit cubes in the\nnext resource.\n\nReading this lesson and taking notes should take you approximately\n30 minutes.\n\nStandards Addressed (*Common Core*):\n\n- [CCSS.Math.Content.6.G.A.2](http://www.corestandards.org/Math/Content/6/G/A/2)\n\nattributed to CK-12.\n``````\n• Did I Get This? Activity: Illustrative Mathematics: “Computing Volume Progression 1”\n\nLink: Illustrative Mathematics: “Computing Volume Progression 1” (HTML)\n\nInstructions: Think about filling a box in the shape of a cube (remember a cube has all equal sides). Answer questions a and b. Check your answers on the second page.\n\nCompleting this activity should take you approximately 15 minutes.\n\nStandards Addressed (Common Core):\n\n4.4.2 Understanding the Equation V = lwh and V = bh   - Explanation: CK-12: “Volume of Rectangular Prism”\n\n``````Link: CK-12: [“Volume of Rectangular\nPrism”](http://www.ck12.org/geometry/Volume-of-Rectangular-Prisms/lesson/Volume-of-Rectangular-Prisms/) (HTML)\n\nInstructions: As you read through the introduction, notice that\nCandice and Trevor are “filling” their boxes with the packing\npeanuts. When you see the word “fill” you can often know that the\nproblem involves volume. Continue reading and take notes on the\n“Guidance” section. Draw some rectangular prisms (do your best with\nthree-dimensional drawing), label each side “length,” “width,” and\n“height.” As you read you will notice there are two formulas. Make\nsure you not only know how to use each formula, but that you also\nknow the difference between them and can explain how they work.\nContinue with the example problems, vocabulary, and guided practice.\nIn the “Practice” section, complete problems 1 - 10. Draw and label\na rectangular prism for at least half of the practice problems to\nget an image of how the prism looks.\n\nReading this lesson, taking notes, and completing the practice\nproblems should take you approximately 45 minutes.\n\nStandards Addressed (*Common Core*):\n\n- [CCSS.Math.Content.6.G.A.2](http://www.corestandards.org/Math/Content/6/G/A/2)\n\nattributed to CK-12.\n``````\n• Activity: Howard County Public School System’s “Student Homework”\n\nLink: Howard County Public School System’s “Student Homework” (HTML)\n\nInstructions: Scroll down to the third section, 6.G.2. Download the document “6.G.2 Student Homework.docx.” Answer the three questions in this activity. Notice that the cubes are inch on each side. The boxes have fractional side lengths as well. You will have to use both your volume skills and your fraction skills to solve these problems.\n\nCheck that your answers here (PDF) when you are finished.\n\nCompleting these practice problems should take you approximately 30 minutes.\n\nStandards Addressed (Common Core):\n\n• Did I Get This? Activity: Illustrative Mathematics: “Computing Volume Progression 2”\n\nLink: Illustrative Mathematics: “Computing Volume Progression 2” (HTML)\n\nInstructions: Answer questions a and b. It might be helpful to draw a model of what the water level will look like in question b. Scroll down and read the commentary and the solution on the second page.\n\nCompleting this activity and checking your work should take you approximately 30 minutes.\n\nStandards Addressed (Common Core):\n\n• Did I Get This? Activity: Illustrative Mathematics: “Computing Volume Progression 3\"\n\nLink: Illustrative Mathematics: “Computing Volume Progression 3” (HTML)\n\nInstructions: As you read this problem, keep in mind that you will need to do some converting of units before you work to find the height of the tank. A good strategy to consider is that although the problem is talking about water, volume is measured in cubed units. Think about the amount of space the first layer (height of 1 cm) takes up. Consider that you will need to see how many 50 cm by 60 cm layers should be stacked to fill the tank full. Scroll down and read the commentary and the solution on the second page.\n\nCompleting this activity and checking your work should take you approximately 30 minutes.\n\nStandards Addressed (Common Core):\n\n4.5 Real-Life Situations and Word Problems Involving Geometric Shapes\n\nPainting your bedroom walls, filling a swimming pool with water, planting grass seed in the yard, and wrapping a gift are just a few examples of real-life situations when you will use geometry. Understanding how to find perimeter, area, surface area, and volume are all very important. However, the initial task is to know what the question is asking and to understand what type of formula will be used. As you go through this subunit, stop and think about each situation. Consider key words that might trigger ideas to know if you are dealing with one-, two-, or three-dimensional measurements. This subunit will give you a chance to use the notes from your notebook. You can also add additional real-life examples to each of the columns in your notebook.\n\nClick here to see an example of how the “Understanding One-, Two-, and Three-Dimensions” might look at this point in the unit.\n\n• Did I Get This? Activity: Illustrative Mathematics: “Banana Bread”\n\nInstructions: Read the problem on the first page about making banana bread. Solve the problem and describe why you think your answer makes sense. Scroll down to second page and read the “Commentary” and “Solution” sections. Compare your strategy with the one provided.\n\nCompleting this activity and checking your work should take you approximately 15 minutes.\n\nStandards Addressed (Common Core):\n\n• Did I Get This? Activity: Illustrative Mathematics: “Painting a Barn”\n\nLink: Illustrative Mathematics: “Painting a Barn” (HTML)\n\nInstructions: Read and solve the problem on the first page. Explain your work. Refer to the notes you made throughout this unit to help you consider what math operation to use when painting walls. Scroll down to the second page and read the “Commentary” and “Solution” sections. Compare your strategy with the one provided.\n\nCompleting this activity and checking your work should take you approximately 30 minutes.\n\nStandards Addressed (Common Core):\n\n• Checkpoint: Illustrative Mathematics: “Computing Volume Progression 4”\n\nLink: Illustrative Mathematics: “Computing Volume Progression 4” (HTML)\n\nInstructions: Read the problem on the first page about taking the stone out of the rectangular tank. Solve the problem and describe why you think your answer makes sense. Scroll down to the second page and read the “Commentary” and “Solution” sections. Compare your strategy with the one provided.\n\nCompleting this task and checking your work should take you approximately 15 minutes.\n\nStandards Addressed (Common Core):\n\n• Checkpoint: Illustrative Mathematics: “Christo’s Building”\n\nLink: Illustrative Mathematics: “Christo’s Building” (HTML)\n\nInstructions: Read through the problem and answer all questions. Take your time thinking about what each question is asking and how to solve it. Draw models and show your work. Scroll down and read through the “Commentary” and “Solution” sections on pages 2 and 3.\n\nCompleting this activity and checking your work should take you approximately 30 minutes.\n\nStandards Addressed (Common Core):\n\n`````` Instructions: Test your knowledge by completing this checkpoint." ]
[ null, "https://legacy.saylor.org/images/loader.gif", null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.8916181,"math_prob":0.66907126,"size":37095,"snap":"2019-13-2019-22","text_gpt3_token_len":8295,"char_repetition_ratio":0.13434526,"word_repetition_ratio":0.33555868,"special_character_ratio":0.21159185,"punctuation_ratio":0.13043478,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9594211,"pos_list":[0,1,2],"im_url_duplicate_count":[null,null,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2019-03-22T00:36:17Z\",\"WARC-Record-ID\":\"<urn:uuid:18010366-90e5-4b1b-a5b6-3a7707121f42>\",\"Content-Length\":\"61585\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:764ee105-2ccc-4e52-bfa3-76cbb022d809>\",\"WARC-Concurrent-To\":\"<urn:uuid:e40c82d4-4bad-43d1-8019-c27269f08be0>\",\"WARC-IP-Address\":\"34.235.49.221\",\"WARC-Target-URI\":\"https://legacy.saylor.org/k12math006/Unit04/\",\"WARC-Payload-Digest\":\"sha1:2RWP5DWTJULBAV2BPCJMDUFYXJCHEAEF\",\"WARC-Block-Digest\":\"sha1:WTTAMCHCBLRYHSJHR5XB6HS2AINZQYXC\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2019/CC-MAIN-2019-13/CC-MAIN-2019-13_segments_1552912202588.97_warc_CC-MAIN-20190321234128-20190322020128-00202.warc.gz\"}"}
https://www.clutchprep.com/physics/practice-problems/48872/an-equilateral-triangular-loop-moves-into-a-0-50-t-magnetic-field-with-a-constan
[ "Problem: An equilateral triangular loop moves into a 0.50 T magnetic field with a constant speed of v = 5 m/s as shown. The loop has sides of length L = 0.50 m, a total resistance of 0.10 Ω, and it enters the field at t = 0 s. What is the direction of the induced current in the loop? Provide a complete justification for your answer.\n\nFREE Expert Solution\n90% (422 ratings)\nProblem Details\n\nAn equilateral triangular loop moves into a 0.50 T magnetic field with a constant speed of v = 5 m/s as shown. The loop has sides of length L = 0.50 m, a total resistance of 0.10 Ω, and it enters the field at t = 0 s. What is the direction of the induced current in the loop? Provide a complete justification for your answer.", null, "" ]
[ null, "https://cdn.clutchprep.com/problem_images/48872-777b455a34227f9f.png", null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.92461026,"math_prob":0.9939074,"size":1192,"snap":"2022-05-2022-21","text_gpt3_token_len":284,"char_repetition_ratio":0.10016835,"word_repetition_ratio":0.56621003,"special_character_ratio":0.2374161,"punctuation_ratio":0.104,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.97062165,"pos_list":[0,1,2],"im_url_duplicate_count":[null,3,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2022-01-19T22:50:36Z\",\"WARC-Record-ID\":\"<urn:uuid:fab96d3e-04d2-42a7-9f65-802e1596f80a>\",\"Content-Length\":\"82110\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:ea5c53ef-7b07-436f-acf3-abfa04611059>\",\"WARC-Concurrent-To\":\"<urn:uuid:52b1d3f2-8367-4dd0-923c-599c2e92569a>\",\"WARC-IP-Address\":\"54.91.59.199\",\"WARC-Target-URI\":\"https://www.clutchprep.com/physics/practice-problems/48872/an-equilateral-triangular-loop-moves-into-a-0-50-t-magnetic-field-with-a-constan\",\"WARC-Payload-Digest\":\"sha1:ORFP5ERSCMYDJEAAUQN6HJCIDRROROP2\",\"WARC-Block-Digest\":\"sha1:SLODEWMSZWYCS23DCURPDXRAKQDAWQMO\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2022/CC-MAIN-2022-05/CC-MAIN-2022-05_segments_1642320301592.29_warc_CC-MAIN-20220119215632-20220120005632-00060.warc.gz\"}"}
https://www.biostars.org/p/127978/
[ "Question: How to make heatmap more bright with proper color spectrum ?\n0\njack800 wrote:\n\nHi,\n\nI need to create heatmap with bright colors which different values have different colors. all the enteris of my matrix is between -0.1- 0.9.\n\nI have tried the following command, but the heatmap is not interesting. How can I make it nice with more colors such that the different values have differnetiable color ?\n\nHere is my command :\n\n```heatmap.2(Gene, col=greenred(10), key=TRUE, symkey=FALSE, symm=F,symbreaks=T,cexRow=1,cexCol=1,margins=c(6,11), scale= \"column\" ,trace=\"none\",srtCol=45)\ndev.off()```\n\nHere is the image :", null, "modified 5.1 years ago by Manvendra Singh2.1k • written 5.1 years ago by jack800\n1\n\nHave you tried rainbow() instead of greenred()?\n\n1\n\nWhat about scale = \"row\"? Assuming rows represent different genes the heatmap just highlights most abundant genes when scale = \"column\".\n\nBTW, linking to an image in your gmail inbox won't work. You need to post it somewhere and then link to it there. Well, unless you want to give us your email login details, but that's a bad idea...\n\ni thought that I have copeid inot the post. well, where can I upload image ?\n\n1\n\nImgur, tinypic, postimage, etc. Just google \"free image hosting\" for more sites than you could ever need.\n\nI updated the post.\n\n2\nDevon Ryan94k wrote:\n\nYour problem is largely due to using symmetric colors. The other thing to consider is using manual color breaks. See the answer from \"Lippy\" here for an example of how to change these.\n\nthe enteris of the matrix is the correlation value and I don't scale it. I did with colum(which was wrong and I tried without scaling , the plot more or less was the same)/\n\n2\nManvendra Singh2.1k wrote:\n\nthe problem is with your range of values thatswhy on the either ways to zero its 1;9 and then you scale coloumns, try with scaling rows and add breaks in your heatmap command as;\n\n`breaks=c(-0.1,0,0.2,0.3,0.4,0.5,0.6,0.7,0,8,0.9)`\n\nor better to plot a heatmap of z-score and use colors from RColorBrewer\n\ne.g. I would do in this way\n\n```library(gplots)\nlibrary(RColorBrewer)\nhr <- hclust(as.dist(1-cor(t(Gene), method=\"pearson\")), method=\"average\");\nhc <- hclust(as.dist(1-cor(Gene, method=\"spearman\")), method=\"average\")\n# Cuts the tree and creates color vector for clusters.\nmycl <- cutree(hr,k=4, h=max(hr\\$height)/1.5);\nmycolhc <- rainbow(length(unique(mycl)), start=0.1, end=0.9)\nmycolhc <- mycolhc[as.vector(mycl)] ; myheatcol <- bluered(75)\nheatmap.2(as.matrix(Gene), Colv=as.dendrogram(hc),\ncol=myheatcol, scale=\"row\", density.info=\"none\",\ntrace=\"none\", RowSideColors=mycolhc,cexRow=1.5,\ncexCol=1.5, keysize=1,margins=c(20,10))```\n\nhth" ]
[ null, "http://i.imgur.com/GSwFOvY.png", null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.87112457,"math_prob":0.90362054,"size":1105,"snap":"2020-10-2020-16","text_gpt3_token_len":284,"char_repetition_ratio":0.1071753,"word_repetition_ratio":0.0,"special_character_ratio":0.2479638,"punctuation_ratio":0.18410042,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.98073125,"pos_list":[0,1,2],"im_url_duplicate_count":[null,4,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2020-02-21T03:54:22Z\",\"WARC-Record-ID\":\"<urn:uuid:1b024c92-a729-487c-a40a-8f754e7e4e79>\",\"Content-Length\":\"41374\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:cb4489ff-a7c9-4b15-b15e-9c1cae4c2d7c>\",\"WARC-Concurrent-To\":\"<urn:uuid:55ecb954-74ce-4c03-8cf0-a9aeeef0df80>\",\"WARC-IP-Address\":\"69.164.220.180\",\"WARC-Target-URI\":\"https://www.biostars.org/p/127978/\",\"WARC-Payload-Digest\":\"sha1:VAPQ5X3Y34IE73RW2U6NACUNCHHKUAPJ\",\"WARC-Block-Digest\":\"sha1:D3CNZBPBPG5WSGYWK6ACQNZS6RQBVA6P\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2020/CC-MAIN-2020-10/CC-MAIN-2020-10_segments_1581875145438.12_warc_CC-MAIN-20200221014826-20200221044826-00451.warc.gz\"}"}
https://tex.stackexchange.com/questions/401886/how-to-create-simple-animations-with-animate?noredirect=1
[ "# How to create simple animations with animate?\n\nI couldn't find code examples that were simple enough to help me start using animate package. I would like to ask you to provide some of your own examples that would be simple enough to build upon.\n\nIt would help me the most if you follow these guidelines:\n\n• two animation examples are needed\n• both examples should use standalone class and as less functionality not related to animate and tikz packages as possible\n• animation in each example should have no more than 4 frames (for simplicity's sake)\n• one animation should advance to next frame only when mouse button is clicked\n• another animation should advance through frames automatically but each frame should pause (or appear) for different number of seconds than other frames\n\nIt would also help if you breakdown the structure of a text file used by animate to store frame data and what options are possible on each frame and how to use them (package's documentation seems to lack information on this).\n\nUpdate 3: Split the answer into two parts to shorten it as requested by @ArtificialStupidity here.\n\nUpdate 2: Added images produced with the new export option added by @AlexG in his answer here\n\n# First answer: use of the \\animategraphics command\n\nEntirely realized with the animate and tikz packages.\n\nThe animate package has a large number of options that give it great power. For example you can run the animation in one direction then in the other (palindrome), step by step (step), with control buttons (controls), looping infinitely (loop) and many others that you can discover on its manual.", null, "• It shows that the area of a parallelogram is equal to that of a rectangle by cutting and resizing.\n• It has 198 images, more than the 4 maximum requested. This provides a convenient method for generating the timeline file.\n• Its speed varies: it increases then decreases, its last image remains visible longer.\n• It explains the \\animategraphics command and the very powerful timeline option.\n\n### To start\n\nI wrote a file that builds the animation with tikz in standalone class. This tex file creates the 198 images of the animation called parallelogramme.pdf.\n\n\\documentclass[tikz]{standalone}\n\\usepackage{animate}\n\\usepackage{fontawesome}\n\\begin{document}\n\n\\foreach \\y in {0,.2,...,3}{% cut out the parallelogram\n\\begin{tikzpicture}\n\\useasboundingbox (-2.5,-.5) rectangle (4,4);\n\\fill[green!40](-1,0)--(-1,3)--(3,3)--(2,0)--cycle;\n\\fill[green!40](-2,0)--(-1,3)--(-1,0)--cycle;\n\\draw[dashed](-1,0)--(-1,\\y);\n\\end{tikzpicture}\n}\n\n\\begin{tikzpicture}% circle the cut out in dotted lines\n\\useasboundingbox (-2.5,-.5) rectangle (4,4);\n\\fill[green!40](-1,0)--(-1,3)--(3,3)--(2,0)--cycle;\n\\fill[green!40](-2,0)--(-1,3)--(-1,0)--cycle;\n\\draw[densely dotted](-1,0)--(-1,3)--(-2,0)--cycle;\n\\end{tikzpicture}\n\n\\foreach \\iangle in {180,179,...,0}{% move the triangle\n\\begin{tikzpicture}\n\\useasboundingbox (-2.5,-.5) rectangle (4,4);\n\\fill[green!40](-1,0)--(-1,3)--(3,3)--(2,0)--cycle;\n\n\\fill[green,opacity=.4] (\\iangle:20mm and 8mm)--([shift={(1,3)}]\\iangle:20mm and 8mm)--([shift={(1,0)}]\\iangle:20mm and 8mm)--cycle;\n\\node at ([shift={(.6,.2)}]\\iangle:20mm and 8mm)[black]{\\faHandPointerO};\n\\draw[densely dotted,thin](-1,3)--(-2,0)--(-1,0)--cycle;\n\\ifthenelse {\\iangle=0}{\\draw[densely dotted,fill=green!40](2,0)--(3,0)--(3,3)--cycle;\n\\node at ([shift={(.6,.2)}]0:20mm and 8mm)[black]{\\faHandPointerO};}{}\n\\end{tikzpicture}\n}\n\n\\end{document}\n\n\nYou will notice that the standalone documentclass is written with the dedicated tikz option that creates a single pdf page for each tikz graphic: documentclass[tikz]{standalone} and not\n\n\\documentclass{standalone}\n\\usepackage{tikz}\n\n\nbecause this last way of doing it creates a single standalone file with all tikz graphics, it looks like this:", null, "or gives an error if there are too many tikz graphics:\n\nDimension too large.\n\n### Create an image in gif format?\n\nIf you want to create an.gif image, you can use the Imagemagick software by opening a command line in the folder containing the series of pdf images you just created.\n\nTo get the .gif image set at the beginning, I copied and pasted this command: see @nox explanation here: https://tex.stackexchange.com/a/443304/138900\n\nTo vary the scrolling speeds, I chose :\n\n convert -density 100 -loop 0 -background white -alpha remove -delay 100 parallelogramme.pdf -delay 10 parallelogramme.pdf[1-16] -delay 8 para-un-pdf.pdf[17-40] -delay 4 parallelogramme.pdf[41-196] -delay 300 parallelogramme.pdf parallelogramme.gif\n\n\n### Make the pdf animation:\n\nTo make a pdf animation with the animate package, we could use the command \\animategraphics and without any other option, we lose the speed variation (here 30 frames per second):\n\n[![animation-without-speed-variation]]\n\n\\documentclass[tikz]{standalone}\n\\usepackage{animate}\n\n\\begin{document}\n\\animategraphics{30}{para-un-pdf}{}{}\n\\end{document}\n\n\n## Change the speed with the timeline option:\n\nTo vary the speeds, either you increase the number of frames, but this makes the file and compilation heavier, or you use the timeline option.\n\n## The power of the timeline file:\n\nThe timeline file describes and composes each image of the animation, then:\n\n• Each line compose a single image. So there are as many lines as there are images.\n• Each pdf pages are considered transparencies. An image (a frame) is now a stack of different pages (transparencies) of the pdf.\n• It allows the same transparency to be reused several times at different points in the animation.\n• It can also speeds up, slows down or stops animation.\n• The first page of the pdf is transparency number 0.\n• the second is numbered 1, etc.\n\n### Each line of the timeline file is composed as follows:\n\n[*]:[<frame rate>]:[<transparencies>][:<JavaScript>]\n\n• The first element [*] is either * or empty. If there is * then the animation stops at that image.\n• The second element [<frame rate>] is either empty or indicates the number of frames per second.\n• The third element [<transparencies>] indicates the stacking of transparencies.\n• I refer you to the package manual for the [:<JavaScript>] option and much more explanations.\n\nFor example, if the first 5 lines of the timeline file are:\n\n::0x0,1x18\n:10:3\n*::4\n::5\n::6\n\n• ::0x0,1x18 : then the transparency 0 is copied on all the following images; above it is the transparent 1 repeated 18 times (line 0 to 17);\n• :10:3 : the second image is composed of the transparent 3 (added to the existing stack of transparencies) with a speed of 10 frame per second;\n• *::4 the fourth transparency is added to the stack that will make the third image and the animation stops on this image.\n• etc.\n\nIf you want to modify the background image during animation, you will have to replace commas (,) by semicolons (;)that will create overlay layers. See manual for more details.\n\n### Generate the timeline file:\n\nTo avoid having to write manually a 198 lines timeline file, we use the LaTeX (or TeX ?) \\write command. This tex file creates the timeline file called agencement.txt:\n\n\\documentclass{article}\n\\usepackage[T1]{fontenc}\n\\usepackage{multido}\n\\usepackage{ifthen}\n\n\\newwrite\\Fichier\n\\immediate\\openout\\Fichier=agencement.txt\n\\immediate\\write\\Fichier{:2:0}\n\\immediate\\write\\Fichier{:10:1}\n\\multido{\\ix=2+1}{14}%\n{%\n\\immediate\\write\\Fichier{::\\ix}%\n}\n\\immediate\\write\\Fichier{:1:16}\n\\immediate\\write\\Fichier{:12.5:17}\n\\multido{\\ix=18+1}{23}{%\n\\immediate\\write\\Fichier{::\\ix}\n}\n\\immediate\\write\\Fichier{:25:41}\n\\multido{\\ix=42+1}{155}{%\n\\immediate\\write\\Fichier{::\\ix}\n}\n\\immediate\\write\\Fichier{:.3:197}\n\\immediate\\closeout\\Fichier% Don't forget to close the file\n\n\\begin{document}\nTimeline file created\n\\end{document}\n\n\nThis tex file generates the animation on pdf called parallelogramme-animated.pdf. It use the previously created parallelogramme.pdf and the timeline file agencement.txt:\n\n\\documentclass[tikz]{standalone}\n\\usepackage{animate}\n\n\\begin{document}\n\n\\animategraphics[loop,timeline=agencement.txt]{30}{parallelogramme}{}{}\n\n\\end{document}\n\n\n### Write a stack of transparencies?\n\nThis lightens considerably the compilation and the pdf animation. The very large number of actions allowed by this timeline file complicates its writing.\n\nI do it these time. I rewrote the parallelogramme.tex file to make it generate not images, but differents transparencies called parallelogramme-bis.tex\n\n\\documentclass[tikz]{standalone}\n\\usepackage{animate}\n\\usepackage{fontawesome}\n\\begin{document}\n\n\\begin{tikzpicture}% remaining cut - transparent 0\n\\useasboundingbox (-2.5,-.5) rectangle (4,4);\n\\fill[green!40](-1,0)--(-1,3)--(3,3)--(2,0)--cycle;\n\\end{tikzpicture}\n\n\\begin{tikzpicture}% triangle cut out green- transparent 1\n\\useasboundingbox (-2.5,-.5) rectangle (4,4);\n\\fill[green!40](-2,0)--(-1,3)--(-1,0)--cycle;\n\\end{tikzpicture}\n\n\\begin{tikzpicture}% circle the cutout in dotted lines - transparent 2\n\\useasboundingbox (-2.5,-.5) rectangle (4,4);\n\\draw[densely dotted](-1,0)--(-1,3)--(-2,0)--cycle;\n\\end{tikzpicture}\n\n\\foreach \\y in {0,.2,...,3}{% cut out the parallelogram - transparent 3-18\n\\begin{tikzpicture}\n\\useasboundingbox (-2.5,-.5) rectangle (4,4);\n\\draw[dashed](-1,0)--(-1,\\y);\n\\end{tikzpicture}\n}\n\\foreach \\iangle in {179,...,0}{% move parallelogram - transparent 19-199\n\\begin{tikzpicture}\n\\useasboundingbox (-2.5,-.5) rectangle (4,4);\n\\fill[green,opacity=.4] (\\iangle:20mm and 8mm)--([shift={(1,3)}]\\iangle:20mm and 8mm)--([shift={(1,0)}]\\iangle:20mm and 8mm)--cycle;\n\\node at ([shift={(.6,.2)}]\\iangle:20mm and 8mm)[black]{\\faHandPointerO};\n\\ifthenelse {\\iangle=0}{\\draw[densely dotted,fill=green!40](2,0)--(3,0)--(3,3)--cycle;\n\\node at ([shift={(.6,.2)}]0:20mm and 8mm)[black]{\\faHandPointerO};}{}\n\\end{tikzpicture}\n}\n\\end{document}\n\n\nWe can create the timeline file called agencement-bis.txtwith LaTeX:\n\n\\documentclass{article}\n\\usepackage[T1]{fontenc}\n\\usepackage{multido}\n\\usepackage{ifthen}\n\n\\newwrite\\Fichier\n\\immediate\\openout\\Fichier=agencement-bis.txt\n\n\\immediate\\write\\Fichier{::0x0,1x18}\n\\immediate\\write\\Fichier{:10:3}\n\\multido{\\ix=4+1}{14}%\n{%\n\\immediate\\write\\Fichier{::\\ix}%\n}\n\\immediate\\write\\Fichier{:12.5:2x0}\n\\multido{\\ix=18+1}{180}%\n{%\n\\ifthenelse {\\ix=17}{\\immediate\\write\\Fichier{:12.5:\\ix}}{\n\\ifthenelse {\\ix=40}{\\immediate\\write\\Fichier{:25:\\ix}}{\n\\immediate\\write\\Fichier{::\\ix}}\n}\n}\n\\immediate\\write\\Fichier{:.3:198}\n\\immediate\\closeout\\Fichier% always close the file\n\\begin{document}\n\ntimeline file created.\n\n\\end{document}\n\n\nThe final animation is created with the \\animategraphics from the previously created parallelogramme-bis.pdf and the timeline agencement-bis.txt\n\n\\documentclass[tikz]{standalone}\n\\usepackage{animate}\n\\begin{document}\n\\animategraphics[loop,timeline=agencement-bis.txt]{30}{parallelogramme-bis}{}{}\n\\end{document}", null, "Translated with www.DeepL.com/Translator\n\n• Thank you for this nice tutorial, in particular for the timeline part! – AlexG Aug 10 '18 at 11:26\n• @AlexG I love all your interactive packages (animate, ocgx, media9) with which I make beautiful beamer presentations that my students admire, thanks to you! – AndréC Aug 10 '18 at 11:44\n• Thank you! (It's ocgx2; ocgx is by P. Gaborit.) – AlexG Aug 10 '18 at 11:53\n\nThe following two MWEs should give you a general idea on how you could use the animate package. In order to successfully compile these examples, you will need four images called example_1 to example_4 in the same directory as your .tex file.\n\n1: Animation proceeds to the next transparency only when clicking on the mouse button: (Please note the step option)\n\n\\documentclass{standalone}\n\\usepackage{graphicx}\n\\usepackage[step]{animate}\n\n\\begin{document}\n\\animategraphics[width=\\linewidth]{12}{example_}{1}{4}%\n\\end{document}\n\n\n2: Animation automatically proceeds to the next transparency with different framerate for each step: (Note: For a more in-depth explanation of a timeline please refer to the animate manual)\n\n\\documentclass{standalone}\n\\usepackage{graphicx}\n\\usepackage{animate}\n\\usepackage{filecontents}\n\n\\begin{filecontents}{mytimeline.txt}\n:0.5:0 % 1/0.5*1s=2s\n:0.2:1\n:10:2\n:1:3\n\\end{filecontents}\n\n\\begin{document}\n\\animategraphics[timeline=mytimeline.txt,width=\\linewidth]{12}{example_}{1}{4}%\n\\end{document}\n\n• For the last frame to be shown for 1 s (1 frame/s), one could add the loop option. – AlexG Nov 18 '17 at 16:30\n\nUpdate: Split the previous answer into two parts to shorten it as requested by @ArtificialStupidity here.\n\n# Second answer: use of the animateinline environment", null, "• It illustrates the different stages of construction with the ruler and the compass of an ove;\n• it illustrates the notion of stacking layers of transparencies that allow the screen background to be modified without hiding the previously stacked transparencies.\n• it explains the use of the animateinline environment.\n• although the gif animation above does not show a pause, the pdf animation below generates one for each image.\n\n### Create images or transparencies?\n\nDuring a ruler and compass construction, the figure is constructed successively with small drawings that are added to each other. So creating transparencies that stack one on top of the other naturally reproduces this way of building.\n\nThe animation has 7 images made with the following 9 transparencies:", null, "", null, "The first 7 transparencies represent the stages of construction, the last 2 are the backgrounds used to illustrate the underlay of transparencies.\n\nOne background is green, the other is the pattern pattern=dots. When the latter pattern is stacked, the backgrounds below it remain visible. The green background hides all the backgrounds below him.\n\n## Create an image in gif format?\n\nIt is now possible thanks to the magnificent update published on August 22, 2018 and this without needing as before to rewrite all the code. To do this, simply add the export option either to the standalone package or to the animate package:\n\n\\documentclass{standalone} \\usepackage[export]{animate}\n\nor \\documentclass[export]{standalone} \\usepackage{animate}\n\nThis produces a pdf file consisting of a series of individual pages that can be easily converted to gif with, for example, Imagemagick as shown above.\n\nThe images produced with the export option are the following 7:", null, "", null, "### The animateinline environment\n\n• it allows to group in a single file the creation of each of the transparents as well as their animation and as long as to make the generation of the timeline file.\n• it has two commands \\newframe and \\multiframe which allow to create, either images independent of each other, or transparencies whose stacking will form images.\n• it allows to factor the start and end code of each tikzpicture environment which is repeated with each creation of frames thanks to the begin and end options.\n\n## The power of the timeline file:\n\nThe timeline file describes and composes each image of the animation, then:\n\n• Each line compose a single image. So there are as many lines as there are images.\n• Each pdf pages are considered transparencies. An image (a frame) is now a stack of different pages (transparencies) of the pdf.\n• It allows the same transparency to be reused several times at different points in the animation.\n• It can also speeds up, slows down or stops animation.\n• The first page of the pdf is transparency number 0.\n• the second is numbered 1, etc.\n\n### Each line of the timeline file is composed as follows:\n\n[*]:[<frame rate>]:[<transparencies>][:<JavaScript>]\n\n• The first element [*] is either * or empty. If there is * then the animation stops at that image.\n• The second element [<frame rate>] is either empty or indicates the number of frames per second.\n• The third element [<transparencies>] indicates the stacking of transparencies.\n• I refer you to the package manual for the [:<JavaScript>] option and much more explanations.\n\nFor example, if the first 5 lines of the timeline file are:\n\n::0x0,1x18\n:10:3\n*::4\n::5\n::6\n\n• ::0x0,1x18 : then the transparency 0 is copied on all the following images; above it is the transparent 1 repeated 18 times (line 0 to 17);\n• :10:3 : the second image is composed of the transparent 3 (added to the existing stack of transparencies) with a speed of 10 frame per second;\n• *::4 the fourth transparency is added to the stack that will make the third image and the animation stops on this image.\n• etc.\n\nIf you want to modify the background image during animation, you will have to replace commas (,) by semicolons (;)that will create overlay layers. See manual for more details.\n\n### The begin and end options:\n\nFor example, below the opening is always composed of the code\n\nbegin{tikzpicture}\n\\useasboundingbox (-2.5,-2.5) rectangle (4,2.5);\n\n\nwe created a \\Debut command that will write these lines automatically to each new frame created with a \\newframe or multiframe command:\n\nNewcommand{\\Debut}{% Systematic start of drawing\n\\begin{tikzpicture}\n\\useasboundingbox (-2.5,-2.5) rectangle (4,2.5);}\n\n\nSimilarly, for closing the tikz environment, with the following command:\n\nNewcommand{\\Fin}{\\end{tikzpicture} }\n\n\n### Animation code\n\n \\documentclass{standalone}\n\\usepackage{tikz}\n\\usetikzlibrary{patterns}\n\\usepackage{animate}\n\n% creation of the ove.txt timeline file\n\\newwrite\\Fichier\n\\immediate\\openout\\Fichier=ove.txt\n\\immediate\\write\\Fichier{:.5:7x0;0x0}% the dots background is stacked first in all images\n\\immediate\\write\\Fichier{::8;1x0}% the green background is opaque and hides the dot background\n\\immediate\\write\\Fichier{::;2x0}% nothing covers the background of the transparency 0 which is therefore visible again\n\\immediate\\write\\Fichier{::c;4x0}% the letter c deletes all transparencies that have been added in the stack\n\\immediate\\write\\Fichier{::8x2;3x0}% the green background will be visible twice, so until the next image\n\\immediate\\write\\Fichier{::7x1;5x0}% the dots background is visible only once, so writing x1 is useless\n\\immediate\\write\\Fichier{::;6} %the stack is empty and no background is added, so there is no visible background\n\\immediate\\closeout\\Fichier% always close the file\n\n\\newcommand{\\Debut}{% Systematic start of drawing\n\\begin{tikzpicture}\n\\useasboundingbox (-2.5,-2.5) rectangle (4,2.5);}\n\\newcommand{\\Fin}{\\end{tikzpicture} }% Systematic end of drawing\n\\begin{document}\n% Step through the animation one frame at a time per mouse-click. The <frame rate> argument will be ignored.\n\\begin{animateinline}[autoplay,step,begin={\\Debut},end={\\Fin},timeline=ove.txt]{.5}\n% perpendicular straight - transparent 0\n\\draw[thick] (-2.5,0)--(4,0);\n\\draw[thick] (0,-2.5)--(0,2.5);\n\\newframe% circle - transparent 1\n\\draw[thick] (0,0) circle (2cm);\n\\newframe% half-line 1 - transparent 2\n\\draw[thick] (0,-2)--(3,1);\n\\newframe% half-line 2 - transparent 3\n\\draw[thick] (0,2)--(3,-1);\n\\newframe% arc 1 - transparent 4\n\\newframe% arc 2 - transparent 5\n\\newframe% arc 3 - transparent 6\n\\newframe% dots screen background - transparent 7\n\\fill[pattern=dots] (-2.5,-2.5) rectangle (4,2.5);\n\\newframe% green screen background - transparent 8\n\\fill[green!30] (-2.5,-2.5) rectangle (4,2.5);\n\\end{animateinline}\n\n\\end{document}\n\n\n### Write a sequence of images?\n\nThe file that creates the same sequence of images called ove.pdf is:\n\n\\documentclass[tikz]{standalone}\n\\usepackage{animate}\n\\usetikzlibrary{patterns}\n\\tikzset{every path/.style=thick}\n\\begin{document}\n\n\\begin{tikzpicture}% perpendiculars - 1\n\\fill[pattern=dots] (-2.5,-2.5) rectangle (4,2.5);\n\\draw (-2.5,0)--(4,0);\n\\draw (0,-2.5)--(0,2.5);\n\\end{tikzpicture}\n\n\\begin{tikzpicture}% circle - image 2\n\\fill[green!30] (-2.5,-2.5) rectangle (4,2.5);\n\\draw (-2.5,0)--(4,0);\n\\draw (0,-2.5)--(0,2.5);\n\\draw (0,0) circle (2cm);\n\\end{tikzpicture}\n\n\\begin{tikzpicture}% half-line 1 - image 3\n\\fill[pattern=dots](-2.5,-2.5) rectangle (4,2.5);\n\\draw (-2.5,0)--(4,0);\n\\draw (0,-2.5)--(0,2.5);\n\\draw (0,0) circle (2cm);\n\\draw (0,-2)--(3,1);\n\\end{tikzpicture}\n\n\\begin{tikzpicture}% arc 1 - image 4\n\\useasboundingbox (-2.5,-2.5) rectangle (4,2.5);\n\\draw (-2.5,0)--(4,0);\n\\draw (0,-2.5)--(0,2.5);\n\\draw (0,0) circle (2cm);\n\\draw (0,-2)--(3,1);\n\\end{tikzpicture}\n\n\\begin{tikzpicture}% half line 2 - image 5\n\\fill[green!30] (-2.5,-2.5) rectangle (4,2.5);\n\\fill[pattern=dots](-2.5,-2.5) rectangle (4,2.5);\n\\draw (-2.5,0)--(4,0);\n\\draw (0,-2.5)--(0,2.5);\n\\draw (0,0) circle (2cm);\n\\draw (0,-2)--(3,1);\n\\draw (0,2)--(3,-1);\n\\end{tikzpicture}\n\n\\begin{tikzpicture}% arc 2 - image 6\n\\useasboundingbox (-2.5,-2.5) rectangle (4,2.5);\n\\draw (-2.5,0)--(4,0);\n\\draw (0,-2.5)--(0,2.5);\n\\draw (0,0) circle (2cm);\n\\draw (0,-2)--(3,1);\n\\draw (0,2)--(3,-1);\n\\end{tikzpicture}\n\n\\begin{tikzpicture}% arc 3 - image 7\n\\useasboundingbox (-2.5,-2.5) rectangle (4,2.5);\n\\draw (-2.5,0)--(4,0);\n\\draw (0,-2.5)--(0,2.5);\n\\draw (0,0) circle (2cm);\n\\draw (0,-2)--(3,1);\n\\draw (0,2)--(3,-1);\n\\end{tikzpicture}\n\\end{document}\n\n\nThe file that creates the animation from the ove.pdf file containing the images is:\n\n\\documentclass[tikz]{standalone}\n\\usepackage{animate}\n\n\\begin{document}\n\\animategraphics[autoplay,step]{1}{ove}{}{}\n\\end{document}\n\n\n### Weight of the animation pdf:\n\n• By stacking transparencies created in the standalone class with the animateinline environment, the pdf animation weighs on my computer 11172 bytes .\n• When the animation is a succession of images created with the \\animategraphics command in the standalone class, the animation weighs 18539 bytes.\n\nThe creation of transparencies is 40% lighter in this case than a succession of images.\n\nI hope I have said what is essential so that everyone can do the same. I hope too I have been clear, if not, say so, I will try to explain better.\n\nTranslated with www.DeepL.com/Translator" ]
[ null, "https://i.stack.imgur.com/nPKG3.gif", null, "https://i.stack.imgur.com/Rzphg.jpg", null, "https://i.stack.imgur.com/nPKG3.gif", null, "https://i.stack.imgur.com/5YZv3.gif", null, "https://i.stack.imgur.com/RjBLa.jpg", null, "https://i.stack.imgur.com/NGVxD.jpg", null, "https://i.stack.imgur.com/2YZ9W.png", null, "https://i.stack.imgur.com/wePb2.png", null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.6912637,"math_prob":0.9168264,"size":9820,"snap":"2019-51-2020-05","text_gpt3_token_len":3006,"char_repetition_ratio":0.15627547,"word_repetition_ratio":0.064291246,"special_character_ratio":0.30142567,"punctuation_ratio":0.19110459,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9653464,"pos_list":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16],"im_url_duplicate_count":[null,null,null,9,null,null,null,9,null,9,null,9,null,9,null,9,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2020-01-22T23:02:09Z\",\"WARC-Record-ID\":\"<urn:uuid:5f919e84-6693-464b-8b8d-daeeecd2f2d2>\",\"Content-Length\":\"178295\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:2805da0b-26a9-4ab2-9ca2-7c4f40474dcf>\",\"WARC-Concurrent-To\":\"<urn:uuid:da137e37-44ba-41f8-a80a-e4db40223a97>\",\"WARC-IP-Address\":\"151.101.193.69\",\"WARC-Target-URI\":\"https://tex.stackexchange.com/questions/401886/how-to-create-simple-animations-with-animate?noredirect=1\",\"WARC-Payload-Digest\":\"sha1:LTSXRUQOLES4MUGBGQLFVIAKY52NLY34\",\"WARC-Block-Digest\":\"sha1:53KPZ5AHMIVQ7DQTK637NHMZHGYAWDJ4\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2020/CC-MAIN-2020-05/CC-MAIN-2020-05_segments_1579250607596.34_warc_CC-MAIN-20200122221541-20200123010541-00083.warc.gz\"}"}
https://isabelle.in.tum.de/repos/isabelle/rev/acc3b7dd0b21
[ "author eberlm Sat, 15 Jul 2017 14:32:02 +0100 changeset 66276 acc3b7dd0b21 parent 66275 2c1d223c5417 child 66277 512b0dc09061\nMore material on powers for HOL-Computational_Algebra/HOL-Number_Theory\n```--- a/src/HOL/Computational_Algebra/Computational_Algebra.thy\tWed Jul 12 18:42:32 2017 +0200\n+++ b/src/HOL/Computational_Algebra/Computational_Algebra.thy\tSat Jul 15 14:32:02 2017 +0100\n@@ -9,9 +9,11 @@\nFraction_Field\nFundamental_Theorem_Algebra\nNormalized_Fraction\n+ Nth_Powers\nPolynomial_FPS\nPolynomial\nPrimes\n+ Squarefree\nbegin\n\nend```\n```--- a/src/HOL/Computational_Algebra/Factorial_Ring.thy\tWed Jul 12 18:42:32 2017 +0200\n+++ b/src/HOL/Computational_Algebra/Factorial_Ring.thy\tSat Jul 15 14:32:02 2017 +0100\n@@ -13,6 +13,12 @@\n\nsubsection \\<open>Irreducible and prime elements\\<close>\n\n+(* TODO: Move ? *)\n+lemma (in semiring_gcd) prod_coprime' [rule_format]:\n+ \"(\\<forall>i\\<in>A. gcd a (f i) = 1) \\<longrightarrow> gcd a (\\<Prod>i\\<in>A. f i) = 1\"\n+ using prod_coprime[of A f a] by (simp add: gcd.commute)\n+\n+\ncontext comm_semiring_1\nbegin\n\n@@ -217,6 +223,7 @@\nqed\nqed\nwith that show thesis by blast\n+\nqed\n\ncontext\n@@ -464,6 +471,9 @@\nlemma prime_dvd_prod_mset_iff: \"prime p \\<Longrightarrow> p dvd prod_mset A \\<longleftrightarrow> (\\<exists>x. x \\<in># A \\<and> p dvd x)\"\nby (induction A) (simp_all add: prime_elem_dvd_mult_iff prime_imp_prime_elem, blast+)\n\n+lemma prime_dvd_prod_iff: \"finite A \\<Longrightarrow> prime p \\<Longrightarrow> p dvd prod f A \\<longleftrightarrow> (\\<exists>x\\<in>A. p dvd f x)\"\n+ by (auto simp: prime_dvd_prod_mset_iff prod_unfold_prod_mset)\n+\nlemma primes_dvd_imp_eq:\nassumes \"prime p\" \"prime q\" \"p dvd q\"\nshows \"p = q\"\n@@ -1104,6 +1114,40 @@\nby (intro multiplicity_geI ) (auto intro: dvd_trans[OF multiplicity_dvd' assms(1)])\nqed (insert assms, auto simp: multiplicity_unit_left)\n\n+lemma prime_power_inj:\n+ assumes \"prime a\" \"a ^ m = a ^ n\"\n+ shows \"m = n\"\n+proof -\n+ have \"multiplicity a (a ^ m) = multiplicity a (a ^ n)\" by (simp only: assms)\n+ thus ?thesis using assms by (subst (asm) (1 2) multiplicity_prime_power) simp_all\n+qed\n+\n+lemma prime_power_inj':\n+ assumes \"prime p\" \"prime q\"\n+ assumes \"p ^ m = q ^ n\" \"m > 0\" \"n > 0\"\n+ shows \"p = q\" \"m = n\"\n+proof -\n+ from assms have \"p ^ 1 dvd p ^ m\" by (intro le_imp_power_dvd) simp\n+ also have \"p ^ m = q ^ n\" by fact\n+ finally have \"p dvd q ^ n\" by simp\n+ with assms have \"p dvd q\" using prime_dvd_power[of p q] by simp\n+ with assms show \"p = q\" by (simp add: primes_dvd_imp_eq)\n+ with assms show \"m = n\" by (simp add: prime_power_inj)\n+qed\n+\n+lemma prime_power_eq_one_iff [simp]: \"prime p \\<Longrightarrow> p ^ n = 1 \\<longleftrightarrow> n = 0\"\n+ using prime_power_inj[of p n 0] by auto\n+\n+lemma one_eq_prime_power_iff [simp]: \"prime p \\<Longrightarrow> 1 = p ^ n \\<longleftrightarrow> n = 0\"\n+ using prime_power_inj[of p 0 n] by auto\n+\n+lemma prime_power_inj'':\n+ assumes \"prime p\" \"prime q\"\n+ shows \"p ^ m = q ^ n \\<longleftrightarrow> (m = 0 \\<and> n = 0) \\<or> (p = q \\<and> m = n)\"\n+ using assms\n+ by (cases \"m = 0\"; cases \"n = 0\")\n+ (auto dest: prime_power_inj'[OF assms])\n+\nlemma prime_factorization_0 [simp]: \"prime_factorization 0 = {#}\"\nby (simp add: multiset_eq_iff count_prime_factorization)\n\n@@ -1265,6 +1309,12 @@\nfinally show ?thesis .\nqed\n\n+lemma prime_factorization_prod:\n+ assumes \"finite A\" \"\\<And>x. x \\<in> A \\<Longrightarrow> f x \\<noteq> 0\"\n+ shows \"prime_factorization (prod f A) = (\\<Sum>n\\<in>A. prime_factorization (f n))\"\n+ using assms by (induction A rule: finite_induct)\n+ (auto simp: Sup_multiset_empty prime_factorization_mult)\n+\nlemma prime_elem_multiplicity_mult_distrib:\nassumes \"prime_elem p\" \"x \\<noteq> 0\" \"y \\<noteq> 0\"\nshows \"multiplicity p (x * y) = multiplicity p x + multiplicity p y\"\n@@ -1462,6 +1512,18 @@\nthus ?thesis by simp\nqed\n\n+lemma inj_on_Prod_primes:\n+ assumes \"\\<And>P p. P \\<in> A \\<Longrightarrow> p \\<in> P \\<Longrightarrow> prime p\"\n+ assumes \"\\<And>P. P \\<in> A \\<Longrightarrow> finite P\"\n+ shows \"inj_on Prod A\"\n+proof (rule inj_onI)\n+ fix P Q assume PQ: \"P \\<in> A\" \"Q \\<in> A\" \"\\<Prod>P = \\<Prod>Q\"\n+ with prime_factorization_unique'[of \"mset_set P\" \"mset_set Q\"] assms[of P] assms[of Q]\n+ have \"mset_set P = mset_set Q\" by (auto simp: prod_unfold_prod_mset)\n+ with assms[of P] assms[of Q] PQ show \"P = Q\" by simp\n+qed\n+\n+\n\nsubsection \\<open>GCD and LCM computation with unique factorizations\\<close>\n\n@@ -1729,6 +1791,16 @@\nusing assms\nby (simp add: prime_factorization_Lcm_factorial Lcm_eq_Lcm_factorial Lcm_factorial_eq_0_iff)\n\n+lemma prime_factors_gcd [simp]:\n+ \"a \\<noteq> 0 \\<Longrightarrow> b \\<noteq> 0 \\<Longrightarrow> prime_factors (gcd a b) =\n+ prime_factors a \\<inter> prime_factors b\"\n+ by (subst prime_factorization_gcd) auto\n+\n+lemma prime_factors_lcm [simp]:\n+ \"a \\<noteq> 0 \\<Longrightarrow> b \\<noteq> 0 \\<Longrightarrow> prime_factors (lcm a b) =\n+ prime_factors a \\<union> prime_factors b\"\n+ by (subst prime_factorization_lcm) auto\n+\nsubclass semiring_gcd\nby (standard, unfold gcd_eq_gcd_factorial lcm_eq_lcm_factorial)\n(rule gcd_lcm_factorial; assumption)+```\n```--- /dev/null\tThu Jan 01 00:00:00 1970 +0000\n+++ b/src/HOL/Computational_Algebra/Nth_Powers.thy\tSat Jul 15 14:32:02 2017 +0100\n@@ -0,0 +1,307 @@\n+(*\n+ File: HOL/Computational_Algebra/Nth_Powers.thy\n+ Author: Manuel Eberl <[email protected]>\n+\n+ n-th powers in general and n-th roots of natural numbers\n+*)\n+section \\<open>\\$n\\$-th powers and roots of naturals\\<close>\n+theory Nth_Powers\n+ imports Primes\n+begin\n+\n+subsection \\<open>The set of \\$n\\$-th powers\\<close>\n+\n+definition is_nth_power :: \"nat \\<Rightarrow> 'a :: monoid_mult \\<Rightarrow> bool\" where\n+ \"is_nth_power n x \\<longleftrightarrow> (\\<exists>y. x = y ^ n)\"\n+\n+lemma is_nth_power_nth_power [simp, intro]: \"is_nth_power n (x ^ n)\"\n+ by (auto simp add: is_nth_power_def)\n+\n+lemma is_nth_powerI [intro?]: \"x = y ^ n \\<Longrightarrow> is_nth_power n x\"\n+ by (auto simp: is_nth_power_def)\n+\n+lemma is_nth_powerE: \"is_nth_power n x \\<Longrightarrow> (\\<And>y. x = y ^ n \\<Longrightarrow> P) \\<Longrightarrow> P\"\n+ by (auto simp: is_nth_power_def)\n+\n+\n+abbreviation is_square where \"is_square \\<equiv> is_nth_power 2\"\n+\n+lemma is_zeroth_power [simp]: \"is_nth_power 0 x \\<longleftrightarrow> x = 1\"\n+ by (simp add: is_nth_power_def)\n+\n+lemma is_first_power [simp]: \"is_nth_power 1 x\"\n+ by (simp add: is_nth_power_def)\n+\n+lemma is_first_power' [simp]: \"is_nth_power (Suc 0) x\"\n+ by (simp add: is_nth_power_def)\n+\n+lemma is_nth_power_0 [simp]: \"n > 0 \\<Longrightarrow> is_nth_power n (0 :: 'a :: semiring_1)\"\n+ by (auto simp: is_nth_power_def power_0_left intro!: exI[of _ 0])\n+\n+lemma is_nth_power_0_iff [simp]: \"is_nth_power n (0 :: 'a :: semiring_1) \\<longleftrightarrow> n > 0\"\n+ by (cases n) auto\n+\n+lemma is_nth_power_1 [simp]: \"is_nth_power n 1\"\n+ by (auto simp: is_nth_power_def intro!: exI[of _ 1])\n+\n+lemma is_nth_power_Suc_0 [simp]: \"is_nth_power n (Suc 0)\"\n+ by (simp add: One_nat_def [symmetric] del: One_nat_def)\n+\n+lemma is_nth_power_conv_multiplicity:\n+ fixes x :: \"'a :: factorial_semiring\"\n+ assumes \"n > 0\"\n+ shows \"is_nth_power n (normalize x) \\<longleftrightarrow> (\\<forall>p. prime p \\<longrightarrow> n dvd multiplicity p x)\"\n+proof (cases \"x = 0\")\n+ case False\n+ show ?thesis\n+ proof (safe intro!: is_nth_powerI elim!: is_nth_powerE)\n+ fix y p :: 'a assume *: \"normalize x = y ^ n\" \"prime p\"\n+ with assms and False have [simp]: \"y \\<noteq> 0\" by (auto simp: power_0_left)\n+ have \"multiplicity p x = multiplicity p (y ^ n)\"\n+ by (subst *(1) [symmetric]) simp\n+ with False and * and assms show \"n dvd multiplicity p x\"\n+ by (auto simp: prime_elem_multiplicity_power_distrib)\n+ next\n+ assume *: \"\\<forall>p. prime p \\<longrightarrow> n dvd multiplicity p x\"\n+ have \"multiplicity p ((\\<Prod>p\\<in>prime_factors x. p ^ (multiplicity p x div n)) ^ n) =\n+ multiplicity p x\" if \"prime p\" for p\n+ proof -\n+ from that and * have \"n dvd multiplicity p x\" by blast\n+ have \"multiplicity p x = 0\" if \"p \\<notin> prime_factors x\"\n+ using that and \\<open>prime p\\<close> by (simp add: prime_factors_multiplicity)\n+ with that and * and assms show ?thesis unfolding prod_power_distrib power_mult [symmetric]\n+ by (subst multiplicity_prod_prime_powers) (auto simp: in_prime_factors_imp_prime elim: dvdE)\n+ qed\n+ with assms False\n+ have \"normalize x = normalize ((\\<Prod>p\\<in>prime_factors x. p ^ (multiplicity p x div n)) ^ n)\"\n+ by (intro multiplicity_eq_imp_eq) (auto simp: multiplicity_prod_prime_powers)\n+ thus \"normalize x = normalize (\\<Prod>p\\<in>prime_factors x. p ^ (multiplicity p x div n)) ^ n\"\n+ by (simp add: normalize_power)\n+ qed\n+qed (insert assms, auto)\n+\n+lemma is_nth_power_conv_multiplicity_nat:\n+ assumes \"n > 0\"\n+ shows \"is_nth_power n (x :: nat) \\<longleftrightarrow> (\\<forall>p. prime p \\<longrightarrow> n dvd multiplicity p x)\"\n+ using is_nth_power_conv_multiplicity[OF assms, of x] by simp\n+\n+lemma is_nth_power_mult:\n+ assumes \"is_nth_power n a\" \"is_nth_power n b\"\n+ shows \"is_nth_power n (a * b :: 'a :: comm_monoid_mult)\"\n+proof -\n+ from assms obtain a' b' where \"a = a' ^ n\" \"b = b' ^ n\" by (auto elim!: is_nth_powerE)\n+ hence \"a * b = (a' * b') ^ n\" by (simp add: power_mult_distrib)\n+ thus ?thesis by (rule is_nth_powerI)\n+qed\n+\n+lemma is_nth_power_mult_coprime_natD:\n+ fixes a b :: nat\n+ assumes \"coprime a b\" \"is_nth_power n (a * b)\" \"a > 0\" \"b > 0\"\n+ shows \"is_nth_power n a\" \"is_nth_power n b\"\n+proof -\n+ have A: \"is_nth_power n a\" if \"coprime a b\" \"is_nth_power n (a * b)\" \"a \\<noteq> 0\" \"b \\<noteq> 0\" \"n > 0\"\n+ for a b :: nat unfolding is_nth_power_conv_multiplicity_nat[OF \\<open>n > 0\\<close>]\n+ proof safe\n+ fix p :: nat assume p: \"prime p\"\n+ from \\<open>coprime a b\\<close> have \"\\<not>(p dvd a \\<and> p dvd b)\"\n+ using coprime_common_divisor_nat[of a b p] p by auto\n+ moreover from that and p\n+ have \"n dvd multiplicity p a + multiplicity p b\"\n+ by (auto simp: is_nth_power_conv_multiplicity_nat prime_elem_multiplicity_mult_distrib)\n+ ultimately show \"n dvd multiplicity p a\"\n+ by (auto simp: not_dvd_imp_multiplicity_0)\n+ qed\n+ from A[of a b] assms show \"is_nth_power n a\" by (cases \"n = 0\") simp_all\n+ from A[of b a] assms show \"is_nth_power n b\"\n+ by (cases \"n = 0\") (simp_all add: gcd.commute mult.commute)\n+qed\n+\n+lemma is_nth_power_mult_coprime_nat_iff:\n+ fixes a b :: nat\n+ assumes \"coprime a b\"\n+ shows \"is_nth_power n (a * b) \\<longleftrightarrow> is_nth_power n a \\<and>is_nth_power n b\"\n+ using assms\n+ by (cases \"a = 0\"; cases \"b = 0\")\n+ (auto intro: is_nth_power_mult dest: is_nth_power_mult_coprime_natD[of a b n]\n+ simp del: One_nat_def)\n+\n+lemma is_nth_power_prime_power_nat_iff:\n+ fixes p :: nat assumes \"prime p\"\n+ shows \"is_nth_power n (p ^ k) \\<longleftrightarrow> n dvd k\"\n+ using assms\n+ by (cases \"n > 0\")\n+ (auto simp: is_nth_power_conv_multiplicity_nat prime_elem_multiplicity_power_distrib)\n+\n+lemma is_nth_power_nth_power':\n+ assumes \"n dvd n'\"\n+ shows \"is_nth_power n (m ^ n')\"\n+proof -\n+ from assms have \"n' = n' div n * n\" by simp\n+ also have \"m ^ \\<dots> = (m ^ (n' div n)) ^ n\" by (simp add: power_mult)\n+ also have \"is_nth_power n \\<dots>\" by simp\n+ finally show ?thesis .\n+qed\n+\n+definition is_nth_power_nat :: \"nat \\<Rightarrow> nat \\<Rightarrow> bool\"\n+ where [code_abbrev]: \"is_nth_power_nat = is_nth_power\"\n+\n+lemma is_nth_power_nat_code [code]:\n+ \"is_nth_power_nat n m =\n+ (if n = 0 then m = 1\n+ else if m = 0 then n > 0\n+ else if n = 1 then True\n+ else (\\<exists>k\\<in>{1..m}. k ^ n = m))\"\n+ by (auto simp: is_nth_power_nat_def is_nth_power_def power_eq_iff_eq_base self_le_power)\n+\n+\n+(* TODO: Harmonise with Discrete.sqrt *)\n+\n+subsection \\<open>The \\$n\\$-root of a natural number\\<close>\n+\n+definition nth_root_nat :: \"nat \\<Rightarrow> nat \\<Rightarrow> nat\" where\n+ \"nth_root_nat k n = (if k = 0 then 0 else Max {m. m ^ k \\<le> n})\"\n+\n+lemma zeroth_root_nat [simp]: \"nth_root_nat 0 n = 0\"\n+ by (simp add: nth_root_nat_def)\n+\n+lemma nth_root_nat_aux1:\n+ assumes \"k > 0\"\n+ shows \"{m::nat. m ^ k \\<le> n} \\<subseteq> {..n}\"\n+proof safe\n+ fix m assume \"m ^ k \\<le> n\"\n+ show \"m \\<le> n\"\n+ proof (cases \"m = 0\")\n+ case False\n+ with assms have \"m ^ 1 \\<le> m ^ k\" by (intro power_increasing) simp_all\n+ also note \\<open>m ^ k \\<le> n\\<close>\n+ finally show ?thesis by simp\n+ qed simp_all\n+qed\n+\n+lemma nth_root_nat_aux2:\n+ assumes \"k > 0\"\n+ shows \"finite {m::nat. m ^ k \\<le> n}\" \"{m::nat. m ^ k \\<le> n} \\<noteq> {}\"\n+proof -\n+ from assms have \"{m. m ^ k \\<le> n} \\<subseteq> {..n}\" by (rule nth_root_nat_aux1)\n+ moreover have \"finite {..n}\" by simp\n+ ultimately show \"finite {m::nat. m ^ k \\<le> n}\" by (rule finite_subset)\n+next\n+ from assms show \"{m::nat. m ^ k \\<le> n} \\<noteq> {}\" by (auto intro!: exI[of _ 0] simp: power_0_left)\n+qed\n+\n+lemma\n+ assumes \"k > 0\"\n+ shows nth_root_nat_power_le: \"nth_root_nat k n ^ k \\<le> n\"\n+ and nth_root_nat_ge: \"x ^ k \\<le> n \\<Longrightarrow> x \\<le> nth_root_nat k n\"\n+ using Max_in[OF nth_root_nat_aux2[OF assms], of n]\n+ Max_ge[OF nth_root_nat_aux2(1)[OF assms], of x n] assms\n+ by (auto simp: nth_root_nat_def)\n+\n+lemma nth_root_nat_less:\n+ assumes \"k > 0\" \"x ^ k > n\"\n+ shows \"nth_root_nat k n < x\"\n+proof -\n+ from \\<open>k > 0\\<close> have \"nth_root_nat k n ^ k \\<le> n\" by (rule nth_root_nat_power_le)\n+ also have \"n < x ^ k\" by fact\n+ finally show ?thesis by (rule power_less_imp_less_base) simp_all\n+qed\n+\n+lemma nth_root_nat_unique:\n+ assumes \"m ^ k \\<le> n\" \"(m + 1) ^ k > n\"\n+ shows \"nth_root_nat k n = m\"\n+proof (cases \"k > 0\")\n+ case True\n+ from nth_root_nat_less[OF \\<open>k > 0\\<close> assms(2)]\n+ have \"nth_root_nat k n \\<le> m\" by simp\n+ moreover from \\<open>k > 0\\<close> and assms(1) have \"nth_root_nat k n \\<ge> m\"\n+ by (intro nth_root_nat_ge)\n+ ultimately show ?thesis by (rule antisym)\n+qed (insert assms, auto)\n+\n+lemma nth_root_nat_0 [simp]: \"nth_root_nat k 0 = 0\" by (simp add: nth_root_nat_def)\n+lemma nth_root_nat_1 [simp]: \"k > 0 \\<Longrightarrow> nth_root_nat k 1 = 1\"\n+ by (rule nth_root_nat_unique) (auto simp del: One_nat_def)\n+lemma nth_root_nat_Suc_0 [simp]: \"k > 0 \\<Longrightarrow> nth_root_nat k (Suc 0) = Suc 0\"\n+ using nth_root_nat_1 by (simp del: nth_root_nat_1)\n+\n+lemma first_root_nat [simp]: \"nth_root_nat 1 n = n\"\n+ by (intro nth_root_nat_unique) auto\n+\n+lemma first_root_nat' [simp]: \"nth_root_nat (Suc 0) n = n\"\n+ by (intro nth_root_nat_unique) auto\n+\n+\n+lemma nth_root_nat_code_naive':\n+ \"nth_root_nat k n = (if k = 0 then 0 else Max (Set.filter (\\<lambda>m. m ^ k \\<le> n) {..n}))\"\n+proof (cases \"k > 0\")\n+ case True\n+ hence \"{m. m ^ k \\<le> n} \\<subseteq> {..n}\" by (rule nth_root_nat_aux1)\n+ hence \"Set.filter (\\<lambda>m. m ^ k \\<le> n) {..n} = {m. m ^ k \\<le> n}\"\n+ by (auto simp: Set.filter_def)\n+ with True show ?thesis by (simp add: nth_root_nat_def Set.filter_def)\n+qed simp\n+\n+function nth_root_nat_aux :: \"nat \\<Rightarrow> nat \\<Rightarrow> nat \\<Rightarrow> nat \\<Rightarrow> nat\" where\n+ \"nth_root_nat_aux m k acc n =\n+ (let acc' = (k + 1) ^ m\n+ in if k \\<ge> n \\<or> acc' > n then k else nth_root_nat_aux m (k+1) acc' n)\"\n+ by auto\n+termination by (relation \"measure (\\<lambda>(_,k,_,n). n - k)\", goal_cases) auto\n+\n+lemma nth_root_nat_aux_le:\n+ assumes \"k ^ m \\<le> n\" \"m > 0\"\n+ shows \"nth_root_nat_aux m k (k ^ m) n ^ m \\<le> n\"\n+ using assms\n+ by (induction m k \"k ^ m\" n rule: nth_root_nat_aux.induct) (auto simp: Let_def)\n+\n+lemma nth_root_nat_aux_gt:\n+ assumes \"m > 0\"\n+ shows \"(nth_root_nat_aux m k (k ^ m) n + 1) ^ m > n\"\n+ using assms\n+proof (induction m k \"k ^ m\" n rule: nth_root_nat_aux.induct)\n+ case (1 m k n)\n+ have \"n < Suc k ^ m\" if \"n \\<le> k\"\n+ proof -\n+ note that\n+ also have \"k < Suc k ^ 1\" by simp\n+ also from \\<open>m > 0\\<close> have \"\\<dots> \\<le> Suc k ^ m\" by (intro power_increasing) simp_all\n+ finally show ?thesis .\n+ qed\n+ with 1 show ?case by (auto simp: Let_def)\n+qed\n+\n+lemma nth_root_nat_aux_correct:\n+ assumes \"k ^ m \\<le> n\" \"m > 0\"\n+ shows \"nth_root_nat_aux m k (k ^ m) n = nth_root_nat m n\"\n+ by (rule sym, intro nth_root_nat_unique nth_root_nat_aux_le nth_root_nat_aux_gt assms)\n+\n+lemma nth_root_nat_naive_code [code]:\n+ \"nth_root_nat m n = (if m = 0 \\<or> n = 0 then 0 else if m = 1 \\<or> n = 1 then n else\n+ nth_root_nat_aux m 1 1 n)\"\n+ using nth_root_nat_aux_correct[of 1 m n] by (auto simp: )\n+\n+\n+lemma nth_root_nat_nth_power [simp]: \"k > 0 \\<Longrightarrow> nth_root_nat k (n ^ k) = n\"\n+ by (intro nth_root_nat_unique order.refl power_strict_mono) simp_all\n+\n+lemma nth_root_nat_nth_power':\n+ assumes \"k > 0\" \"k dvd m\"\n+ shows \"nth_root_nat k (n ^ m) = n ^ (m div k)\"\n+proof -\n+ from assms have \"m = (m div k) * k\" by simp\n+ also have \"n ^ \\<dots> = (n ^ (m div k)) ^ k\" by (simp add: power_mult)\n+ also from assms have \"nth_root_nat k \\<dots> = n ^ (m div k)\" by simp\n+ finally show ?thesis .\n+qed\n+\n+lemma nth_root_nat_mono:\n+ assumes \"m \\<le> n\"\n+ shows \"nth_root_nat k m \\<le> nth_root_nat k n\"\n+proof (cases \"k = 0\")\n+ case False\n+ with assms show ?thesis unfolding nth_root_nat_def\n+ using nth_root_nat_aux2[of k m] nth_root_nat_aux2[of k n]\n+ by (auto intro!: Max_mono)\n+qed auto\n+\n+end\n\\ No newline at end of file```\n```--- /dev/null\tThu Jan 01 00:00:00 1970 +0000\n+++ b/src/HOL/Computational_Algebra/Squarefree.thy\tSat Jul 15 14:32:02 2017 +0100\n@@ -0,0 +1,360 @@\n+(*\n+ File: HOL/Computational_Algebra/Squarefree.thy\n+ Author: Manuel Eberl <[email protected]>\n+\n+ Squarefreeness and decomposition of ring elements into square part and squarefree part\n+*)\n+section \\<open>Squarefreeness\\<close>\n+theory Squarefree\n+imports Primes\n+begin\n+\n+(* TODO: Generalise to n-th powers *)\n+\n+definition squarefree :: \"'a :: comm_monoid_mult \\<Rightarrow> bool\" where\n+ \"squarefree n \\<longleftrightarrow> (\\<forall>x. x ^ 2 dvd n \\<longrightarrow> x dvd 1)\"\n+\n+lemma squarefreeI: \"(\\<And>x. x ^ 2 dvd n \\<Longrightarrow> x dvd 1) \\<Longrightarrow> squarefree n\"\n+ by (auto simp: squarefree_def)\n+\n+lemma squarefreeD: \"squarefree n \\<Longrightarrow> x ^ 2 dvd n \\<Longrightarrow> x dvd 1\"\n+ by (auto simp: squarefree_def)\n+\n+lemma not_squarefreeI: \"x ^ 2 dvd n \\<Longrightarrow> \\<not>x dvd 1 \\<Longrightarrow> \\<not>squarefree n\"\n+ by (auto simp: squarefree_def)\n+\n+lemma not_squarefreeE [case_names square_dvd]:\n+ \"\\<not>squarefree n \\<Longrightarrow> (\\<And>x. x ^ 2 dvd n \\<Longrightarrow> \\<not>x dvd 1 \\<Longrightarrow> P) \\<Longrightarrow> P\"\n+ by (auto simp: squarefree_def)\n+\n+lemma not_squarefree_0 [simp]: \"\\<not>squarefree (0 :: 'a :: comm_semiring_1)\"\n+ by (rule not_squarefreeI[of 0]) auto\n+\n+lemma squarefree_factorial_semiring:\n+ assumes \"n \\<noteq> 0\"\n+ shows \"squarefree (n :: 'a :: factorial_semiring) \\<longleftrightarrow> (\\<forall>p. prime p \\<longrightarrow> \\<not>p ^ 2 dvd n)\"\n+ unfolding squarefree_def\n+proof safe\n+ assume *: \"\\<forall>p. prime p \\<longrightarrow> \\<not>p ^ 2 dvd n\"\n+ fix x :: 'a assume x: \"x ^ 2 dvd n\"\n+ {\n+ assume \"\\<not>is_unit x\"\n+ moreover from assms and x have \"x \\<noteq> 0\" by auto\n+ ultimately obtain p where \"p dvd x\" \"prime p\"\n+ using prime_divisor_exists by blast\n+ with * have \"\\<not>p ^ 2 dvd n\" by blast\n+ moreover from \\<open>p dvd x\\<close> have \"p ^ 2 dvd x ^ 2\" by (rule dvd_power_same)\n+ ultimately have \"\\<not>x ^ 2 dvd n\" by (blast dest: dvd_trans)\n+ with x have False by contradiction\n+ }\n+ thus \"is_unit x\" by blast\n+qed auto\n+\n+lemma squarefree_factorial_semiring':\n+ assumes \"n \\<noteq> 0\"\n+ shows \"squarefree (n :: 'a :: factorial_semiring) \\<longleftrightarrow>\n+ (\\<forall>p\\<in>prime_factors n. multiplicity p n = 1)\"\n+proof (subst squarefree_factorial_semiring [OF assms], safe)\n+ fix p assume \"\\<forall>p\\<in>#prime_factorization n. multiplicity p n = 1\" \"prime p\" \"p^2 dvd n\"\n+ with assms show False\n+ by (cases \"p dvd n\")\n+ (auto simp: prime_factors_dvd power_dvd_iff_le_multiplicity not_dvd_imp_multiplicity_0)\n+qed (auto intro!: multiplicity_eqI simp: power2_eq_square [symmetric])\n+\n+lemma squarefree_factorial_semiring'':\n+ assumes \"n \\<noteq> 0\"\n+ shows \"squarefree (n :: 'a :: factorial_semiring) \\<longleftrightarrow>\n+ (\\<forall>p. prime p \\<longrightarrow> multiplicity p n \\<le> 1)\"\n+ by (subst squarefree_factorial_semiring'[OF assms]) (auto simp: prime_factors_multiplicity)\n+\n+lemma squarefree_unit [simp]: \"is_unit n \\<Longrightarrow> squarefree n\"\n+proof (rule squarefreeI)\n+ fix x assume \"x^2 dvd n\" \"n dvd 1\"\n+ hence \"is_unit (x^2)\" by (rule dvd_unit_imp_unit)\n+ thus \"is_unit x\" by (simp add: is_unit_power_iff)\n+qed\n+\n+lemma squarefree_1 [simp]: \"squarefree (1 :: 'a :: algebraic_semidom)\"\n+ by simp\n+\n+lemma squarefree_minus [simp]: \"squarefree (-n :: 'a :: comm_ring_1) \\<longleftrightarrow> squarefree n\"\n+ by (simp add: squarefree_def)\n+\n+lemma squarefree_mono: \"a dvd b \\<Longrightarrow> squarefree b \\<Longrightarrow> squarefree a\"\n+ by (auto simp: squarefree_def intro: dvd_trans)\n+\n+lemma squarefree_multD:\n+ assumes \"squarefree (a * b)\"\n+ shows \"squarefree a\" \"squarefree b\"\n+ by (rule squarefree_mono[OF _ assms], simp)+\n+\n+lemma squarefree_prime_elem:\n+ assumes \"prime_elem (p :: 'a :: factorial_semiring)\"\n+ shows \"squarefree p\"\n+proof -\n+ from assms have \"p \\<noteq> 0\" by auto\n+ show ?thesis\n+ proof (subst squarefree_factorial_semiring [OF \\<open>p \\<noteq> 0\\<close>]; safe)\n+ fix q assume *: \"prime q\" \"q^2 dvd p\"\n+ with assms have \"multiplicity q p \\<ge> 2\" by (intro multiplicity_geI) auto\n+ thus False using assms \\<open>prime q\\<close> prime_multiplicity_other[of q \"normalize p\"]\n+ by (cases \"q = normalize p\") simp_all\n+ qed\n+qed\n+\n+lemma squarefree_prime:\n+ assumes \"prime (p :: 'a :: factorial_semiring)\"\n+ shows \"squarefree p\"\n+ using assms by (intro squarefree_prime_elem) auto\n+\n+lemma squarefree_mult_coprime:\n+ fixes a b :: \"'a :: factorial_semiring_gcd\"\n+ assumes \"coprime a b\" \"squarefree a\" \"squarefree b\"\n+ shows \"squarefree (a * b)\"\n+proof -\n+ from assms have nz: \"a * b \\<noteq> 0\" by auto\n+ show ?thesis unfolding squarefree_factorial_semiring'[OF nz]\n+ proof\n+ fix p assume p: \"p \\<in> prime_factors (a * b)\"\n+ {\n+ assume \"p dvd a \\<and> p dvd b\"\n+ hence \"p dvd gcd a b\" by simp\n+ also have \"gcd a b = 1\" by fact\n+ finally have False using nz using p by (auto simp: prime_factors_dvd)\n+ }\n+ hence \"\\<not>(p dvd a \\<and> p dvd b)\" by blast\n+ moreover from p have \"p dvd a \\<or> p dvd b\" using nz\n+ by (auto simp: prime_factors_dvd prime_dvd_mult_iff)\n+ ultimately show \"multiplicity p (a * b) = 1\" using nz p assms(2,3)\n+ by (auto simp: prime_elem_multiplicity_mult_distrib prime_factors_multiplicity\n+ not_dvd_imp_multiplicity_0 squarefree_factorial_semiring')\n+ qed\n+qed\n+\n+lemma squarefree_prod_coprime:\n+ fixes f :: \"'a \\<Rightarrow> 'b :: factorial_semiring_gcd\"\n+ assumes \"\\<And>a b. a \\<in> A \\<Longrightarrow> b \\<in> A \\<Longrightarrow> a \\<noteq> b \\<Longrightarrow> coprime (f a) (f b)\"\n+ assumes \"\\<And>a. a \\<in> A \\<Longrightarrow> squarefree (f a)\"\n+ shows \"squarefree (prod f A)\"\n+ using assms\n+ by (induction A rule: infinite_finite_induct)\n+ (auto intro!: squarefree_mult_coprime prod_coprime')\n+\n+lemma squarefree_powerD: \"m > 0 \\<Longrightarrow> squarefree (n ^ m) \\<Longrightarrow> squarefree n\"\n+ by (cases m) (auto dest: squarefree_multD)\n+\n+lemma squarefree_power_iff:\n+ \"squarefree (n ^ m) \\<longleftrightarrow> m = 0 \\<or> is_unit n \\<or> (squarefree n \\<and> m = 1)\"\n+proof safe\n+ assume \"squarefree (n ^ m)\" \"m > 0\" \"\\<not>is_unit n\"\n+ show \"m = 1\"\n+ proof (rule ccontr)\n+ assume \"m \\<noteq> 1\"\n+ with \\<open>m > 0\\<close> have \"n ^ 2 dvd n ^ m\" by (intro le_imp_power_dvd) auto\n+ from this and \\<open>\\<not>is_unit n\\<close> have \"\\<not>squarefree (n ^ m)\" by (rule not_squarefreeI)\n+ with \\<open>squarefree (n ^ m)\\<close> show False by contradiction\n+ qed\n+qed (auto simp: is_unit_power_iff dest: squarefree_powerD)\n+\n+definition squarefree_nat :: \"nat \\<Rightarrow> bool\" where\n+ [code_abbrev]: \"squarefree_nat = squarefree\"\n+\n+lemma squarefree_nat_code_naive [code]:\n+ \"squarefree_nat n \\<longleftrightarrow> n \\<noteq> 0 \\<and> (\\<forall>k\\<in>{2..n}. \\<not>k ^ 2 dvd n)\"\n+proof safe\n+ assume *: \"\\<forall>k\\<in>{2..n}. \\<not> k\\<^sup>2 dvd n\" and n: \"n > 0\"\n+ show \"squarefree_nat n\" unfolding squarefree_nat_def\n+ proof (rule squarefreeI)\n+ fix k assume k: \"k ^ 2 dvd n\"\n+ have \"k dvd n\" by (rule dvd_trans[OF _ k]) auto\n+ with n have \"k \\<le> n\" by (intro dvd_imp_le)\n+ with bspec[OF *, of k] k have \"\\<not>k > 1\" by (intro notI) auto\n+ moreover from k and n have \"k \\<noteq> 0\" by (intro notI) auto\n+ ultimately have \"k = 1\" by presburger\n+ thus \"is_unit k\" by simp\n+ qed\n+qed (auto simp: squarefree_nat_def squarefree_def intro!: Nat.gr0I)\n+\n+\n+\n+definition square_part :: \"'a :: factorial_semiring \\<Rightarrow> 'a\" where\n+ \"square_part n = (if n = 0 then 0 else\n+ normalize (\\<Prod>p\\<in>prime_factors n. p ^ (multiplicity p n div 2)))\"\n+\n+lemma square_part_nonzero:\n+ \"n \\<noteq> 0 \\<Longrightarrow> square_part n = normalize (\\<Prod>p\\<in>prime_factors n. p ^ (multiplicity p n div 2))\"\n+ by (simp add: square_part_def)\n+\n+lemma square_part_0 [simp]: \"square_part 0 = 0\"\n+ by (simp add: square_part_def)\n+\n+lemma square_part_unit [simp]: \"is_unit x \\<Longrightarrow> square_part x = 1\"\n+ by (auto simp: square_part_def prime_factorization_unit)\n+\n+lemma square_part_1 [simp]: \"square_part 1 = 1\"\n+ by simp\n+\n+lemma square_part_0_iff [simp]: \"square_part n = 0 \\<longleftrightarrow> n = 0\"\n+ by (simp add: square_part_def)\n+\n+lemma normalize_uminus [simp]:\n+ \"normalize (-x :: 'a :: {normalization_semidom, comm_ring_1}) = normalize x\"\n+ by (rule associatedI) auto\n+\n+lemma multiplicity_uminus_right [simp]:\n+ \"multiplicity (x :: 'a :: {factorial_semiring, comm_ring_1}) (-y) = multiplicity x y\"\n+proof -\n+ have \"multiplicity x (-y) = multiplicity x (normalize (-y))\"\n+ by (rule multiplicity_normalize_right [symmetric])\n+ also have \"\\<dots> = multiplicity x y\" by simp\n+ finally show ?thesis .\n+qed\n+\n+lemma multiplicity_uminus_left [simp]:\n+ \"multiplicity (-x :: 'a :: {factorial_semiring, comm_ring_1}) y = multiplicity x y\"\n+proof -\n+ have \"multiplicity (-x) y = multiplicity (normalize (-x)) y\"\n+ by (rule multiplicity_normalize_left [symmetric])\n+ also have \"\\<dots> = multiplicity x y\" by simp\n+ finally show ?thesis .\n+qed\n+\n+lemma prime_factorization_uminus [simp]:\n+ \"prime_factorization (-x :: 'a :: {factorial_semiring, comm_ring_1}) = prime_factorization x\"\n+ by (rule prime_factorization_cong) simp_all\n+\n+lemma square_part_uminus [simp]:\n+ \"square_part (-x :: 'a :: {factorial_semiring, comm_ring_1}) = square_part x\"\n+ by (simp add: square_part_def)\n+\n+lemma prime_multiplicity_square_part:\n+ assumes \"prime p\"\n+ shows \"multiplicity p (square_part n) = multiplicity p n div 2\"\n+proof (cases \"n = 0\")\n+ case False\n+ thus ?thesis unfolding square_part_nonzero[OF False] multiplicity_normalize_right\n+ using finite_prime_divisors[of n] assms\n+ by (subst multiplicity_prod_prime_powers)\n+ (auto simp: not_dvd_imp_multiplicity_0 prime_factors_dvd multiplicity_prod_prime_powers)\n+qed auto\n+\n+lemma square_part_square_dvd [simp, intro]: \"square_part n ^ 2 dvd n\"\n+proof (cases \"n = 0\")\n+ case False\n+ thus ?thesis\n+ by (intro multiplicity_le_imp_dvd)\n+ (auto simp: prime_multiplicity_square_part prime_elem_multiplicity_power_distrib)\n+qed auto\n+\n+lemma prime_multiplicity_le_imp_dvd:\n+ assumes \"x \\<noteq> 0\" \"y \\<noteq> 0\"\n+ shows \"x dvd y \\<longleftrightarrow> (\\<forall>p. prime p \\<longrightarrow> multiplicity p x \\<le> multiplicity p y)\"\n+ using assms by (auto intro: multiplicity_le_imp_dvd dvd_imp_multiplicity_le)\n+\n+lemma dvd_square_part_iff: \"x dvd square_part n \\<longleftrightarrow> x ^ 2 dvd n\"\n+proof (cases \"x = 0\"; cases \"n = 0\")\n+ assume nz: \"x \\<noteq> 0\" \"n \\<noteq> 0\"\n+ thus ?thesis\n+ by (subst (1 2) prime_multiplicity_le_imp_dvd)\n+ (auto simp: prime_multiplicity_square_part prime_elem_multiplicity_power_distrib)\n+qed auto\n+\n+\n+definition squarefree_part :: \"'a :: factorial_semiring \\<Rightarrow> 'a\" where\n+ \"squarefree_part n = (if n = 0 then 1 else n div square_part n ^ 2)\"\n+\n+lemma squarefree_part_0 [simp]: \"squarefree_part 0 = 1\"\n+ by (simp add: squarefree_part_def)\n+\n+lemma squarefree_part_unit [simp]: \"is_unit n \\<Longrightarrow> squarefree_part n = n\"\n+ by (auto simp add: squarefree_part_def)\n+\n+lemma squarefree_part_1 [simp]: \"squarefree_part 1 = 1\"\n+ by simp\n+\n+lemma squarefree_decompose: \"n = squarefree_part n * square_part n ^ 2\"\n+ by (simp add: squarefree_part_def)\n+\n+lemma squarefree_part_uminus [simp]:\n+ assumes \"x \\<noteq> 0\"\n+ shows \"squarefree_part (-x :: 'a :: {factorial_semiring, comm_ring_1}) = -squarefree_part x\"\n+proof -\n+ have \"-(squarefree_part x * square_part x ^ 2) = -x\"\n+ by (subst squarefree_decompose [symmetric]) auto\n+ also have \"\\<dots> = squarefree_part (-x) * square_part (-x) ^ 2\" by (rule squarefree_decompose)\n+ finally have \"(- squarefree_part x) * square_part x ^ 2 =\n+ squarefree_part (-x) * square_part x ^ 2\" by simp\n+ thus ?thesis using assms by (subst (asm) mult_right_cancel) auto\n+qed\n+\n+lemma squarefree_part_nonzero [simp]: \"squarefree_part n \\<noteq> 0\"\n+ using squarefree_decompose[of n] by (cases \"n \\<noteq> 0\") auto\n+\n+lemma prime_multiplicity_squarefree_part:\n+ assumes \"prime p\"\n+ shows \"multiplicity p (squarefree_part n) = multiplicity p n mod 2\"\n+proof (cases \"n = 0\")\n+ case False\n+ hence n: \"n \\<noteq> 0\" by auto\n+ have \"multiplicity p n mod 2 + 2 * (multiplicity p n div 2) = multiplicity p n\" by simp\n+ also have \"\\<dots> = multiplicity p (squarefree_part n * square_part n ^ 2)\"\n+ by (subst squarefree_decompose[of n]) simp\n+ also from assms n have \"\\<dots> = multiplicity p (squarefree_part n) + 2 * (multiplicity p n div 2)\"\n+ by (subst prime_elem_multiplicity_mult_distrib)\n+ (auto simp: prime_elem_multiplicity_power_distrib prime_multiplicity_square_part)\n+ finally show ?thesis by (subst (asm) add_right_cancel) simp\n+qed auto\n+\n+lemma prime_multiplicity_squarefree_part_le_Suc_0 [intro]:\n+ assumes \"prime p\"\n+ shows \"multiplicity p (squarefree_part n) \\<le> Suc 0\"\n+ by (simp add: assms prime_multiplicity_squarefree_part)\n+\n+lemma squarefree_squarefree_part [simp, intro]: \"squarefree (squarefree_part n)\"\n+ by (subst squarefree_factorial_semiring'')\n+ (auto simp: prime_multiplicity_squarefree_part_le_Suc_0)\n+\n+lemma squarefree_decomposition_unique:\n+ assumes \"square_part m = square_part n\"\n+ assumes \"squarefree_part m = squarefree_part n\"\n+ shows \"m = n\"\n+ by (subst (1 2) squarefree_decompose) (simp_all add: assms)\n+\n+lemma normalize_square_part [simp]: \"normalize (square_part x) = square_part x\"\n+ by (simp add: square_part_def)\n+\n+lemma square_part_even_power': \"square_part (x ^ (2 * n)) = normalize (x ^ n)\"\n+proof (cases \"x = 0\")\n+ case False\n+ have \"normalize (square_part (x ^ (2 * n))) = normalize (x ^ n)\" using False\n+ by (intro multiplicity_eq_imp_eq)\n+ (auto simp: prime_multiplicity_square_part prime_elem_multiplicity_power_distrib)\n+ thus ?thesis by simp\n+qed (auto simp: power_0_left)\n+\n+lemma square_part_even_power: \"even n \\<Longrightarrow> square_part (x ^ n) = normalize (x ^ (n div 2))\"\n+ by (subst square_part_even_power' [symmetric]) auto\n+\n+lemma square_part_odd_power': \"square_part (x ^ (Suc (2 * n))) = normalize (x ^ n * square_part x)\"\n+proof (cases \"x = 0\")\n+ case False\n+ have \"normalize (square_part (x ^ (Suc (2 * n)))) = normalize (square_part x * x ^ n)\"\n+ proof (rule multiplicity_eq_imp_eq, goal_cases)\n+ case (3 p)\n+ hence \"multiplicity p (square_part (x ^ Suc (2 * n))) =\n+ (2 * (n * multiplicity p x) + multiplicity p x) div 2\"\n+ by (subst prime_multiplicity_square_part)\n+ (auto simp: False prime_elem_multiplicity_power_distrib algebra_simps simp del: power_Suc)\n+ also from 3 False have \"\\<dots> = multiplicity p (square_part x * x ^ n)\"\n+ by (subst div_mult_self4) (auto simp: prime_multiplicity_square_part\n+ prime_elem_multiplicity_mult_distrib prime_elem_multiplicity_power_distrib)\n+ finally show ?case .\n+ qed (insert False, auto)\n+ thus ?thesis by (simp add: mult_ac)\n+qed auto\n+\n+lemma square_part_odd_power:\n+ \"odd n \\<Longrightarrow> square_part (x ^ n) = normalize (x ^ (n div 2) * square_part x)\"\n+ by (subst square_part_odd_power' [symmetric]) auto\n+\n+end\n\\ No newline at end of file```\n```--- a/src/HOL/Library/Multiset.thy\tWed Jul 12 18:42:32 2017 +0200\n+++ b/src/HOL/Library/Multiset.thy\tSat Jul 15 14:32:02 2017 +0100\n@@ -1813,6 +1813,12 @@\nlemma mset_zero_iff_right[simp]: \"({#} = mset x) = (x = [])\"\nby (induct x) auto\n\n+lemma count_mset_gt_0: \"x \\<in> set xs \\<Longrightarrow> count (mset xs) x > 0\"\n+ by (induction xs) auto\n+\n+lemma count_mset_0_iff [simp]: \"count (mset xs) x = 0 \\<longleftrightarrow> x \\<notin> set xs\"\n+ by (induction xs) auto\n+\nlemma mset_single_iff[iff]: \"mset xs = {#x#} \\<longleftrightarrow> xs = [x]\"\nby (cases xs) auto\n\n@@ -1949,6 +1955,9 @@\ndefines mset_set = \"folding.F add_mset {#}\"\nby standard (simp add: fun_eq_iff)\n\n+lemma sum_multiset_singleton [simp]: \"sum (\\<lambda>n. {#n#}) A = mset_set A\"\n+ by (induction A rule: infinite_finite_induct) auto\n+\nlemma count_mset_set [simp]:\n\"finite A \\<Longrightarrow> x \\<in> A \\<Longrightarrow> count (mset_set A) x = 1\" (is \"PROP ?P\")\n\"\\<not> finite A \\<Longrightarrow> count (mset_set A) x = 0\" (is \"PROP ?Q\")\n@@ -2001,6 +2010,25 @@\nlemma mset_set_set: \"distinct xs \\<Longrightarrow> mset_set (set xs) = mset xs\"\nby (induction xs) simp_all\n\n+lemma count_mset_set': \"count (mset_set A) x = (if finite A \\<and> x \\<in> A then 1 else 0)\"\n+ by auto\n+\n+lemma subset_imp_msubset_mset_set:\n+ assumes \"A \\<subseteq> B\" \"finite B\"\n+ shows \"mset_set A \\<subseteq># mset_set B\"\n+proof (rule mset_subset_eqI)\n+ fix x :: 'a\n+ from assms have \"finite A\" by (rule finite_subset)\n+ with assms show \"count (mset_set A) x \\<le> count (mset_set B) x\"\n+ by (cases \"x \\<in> A\"; cases \"x \\<in> B\") auto\n+qed\n+\n+lemma mset_set_set_mset_msubset: \"mset_set (set_mset A) \\<subseteq># A\"\n+proof (rule mset_subset_eqI)\n+ fix x show \"count (mset_set (set_mset A)) x \\<le> count A x\"\n+ by (cases \"x \\<in># A\") simp_all\n+qed\n+\ncontext linorder\nbegin\n\n@@ -2071,6 +2099,23 @@\nfinally show ?case by simp\nqed simp_all\n\n+lemma msubset_mset_set_iff [simp]:\n+ assumes \"finite A\" \"finite B\"\n+ shows \"mset_set A \\<subseteq># mset_set B \\<longleftrightarrow> A \\<subseteq> B\"\n+ using subset_imp_msubset_mset_set[of A B]\n+ set_mset_mono[of \"mset_set A\" \"mset_set B\"] assms by auto\n+\n+lemma mset_set_eq_iff [simp]:\n+ assumes \"finite A\" \"finite B\"\n+ shows \"mset_set A = mset_set B \\<longleftrightarrow> A = B\"\n+proof -\n+ from assms have \"mset_set A = mset_set B \\<longleftrightarrow> set_mset (mset_set A) = set_mset (mset_set B)\"\n+ by (intro iffI equalityI set_mset_mono) auto\n+ also from assms have \"\\<dots> \\<longleftrightarrow> A = B\" by simp\n+ finally show ?thesis .\n+qed\n+\n+\n(* Contributed by Lukas Bulwahn *)\nlemma image_mset_mset_set:\nassumes \"inj_on f A\"```\n```--- a/src/HOL/Number_Theory/Number_Theory.thy\tWed Jul 12 18:42:32 2017 +0200\n+++ b/src/HOL/Number_Theory/Number_Theory.thy\tSat Jul 15 14:32:02 2017 +0100\n@@ -2,7 +2,7 @@\nsection \\<open>Comprehensive number theory\\<close>\n\ntheory Number_Theory\n-imports Fib Residues Eratosthenes Quadratic_Reciprocity Pocklington\n+imports Fib Residues Eratosthenes Quadratic_Reciprocity Pocklington Prime_Powers\nbegin\n\nend```\n```--- /dev/null\tThu Jan 01 00:00:00 1970 +0000\n+++ b/src/HOL/Number_Theory/Prime_Powers.thy\tSat Jul 15 14:32:02 2017 +0100\n@@ -0,0 +1,315 @@\n+(*\n+ File: HOL/Number_Theory/Prime_Powers.thy\n+ Author: Manuel Eberl <[email protected]>\n+\n+ Prime powers and the Mangoldt function\n+*)\n+section \\<open>Prime powers\\<close>\n+theory Prime_Powers\n+ imports Complex_Main \"~~/src/HOL/Computational_Algebra/Primes\"\n+begin\n+\n+definition aprimedivisor :: \"'a :: normalization_semidom \\<Rightarrow> 'a\" where\n+ \"aprimedivisor q = (SOME p. prime p \\<and> p dvd q)\"\n+\n+definition primepow :: \"'a :: normalization_semidom \\<Rightarrow> bool\" where\n+ \"primepow n \\<longleftrightarrow> (\\<exists>p k. prime p \\<and> k > 0 \\<and> n = p ^ k)\"\n+\n+definition primepow_factors :: \"'a :: normalization_semidom \\<Rightarrow> 'a set\" where\n+ \"primepow_factors n = {x. primepow x \\<and> x dvd n}\"\n+\n+lemma primepow_gt_Suc_0: \"primepow n \\<Longrightarrow> n > Suc 0\"\n+ using one_less_power[of \"p::nat\" for p] by (auto simp: primepow_def prime_nat_iff)\n+\n+lemma\n+ assumes \"prime p\" \"p dvd n\"\n+ shows prime_aprimedivisor: \"prime (aprimedivisor n)\"\n+ and aprimedivisor_dvd: \"aprimedivisor n dvd n\"\n+proof -\n+ from assms have \"\\<exists>p. prime p \\<and> p dvd n\" by auto\n+ from someI_ex[OF this] show \"prime (aprimedivisor n)\" \"aprimedivisor n dvd n\"\n+ unfolding aprimedivisor_def by (simp_all add: conj_commute)\n+qed\n+\n+lemma\n+ assumes \"n \\<noteq> 0\" \"\\<not>is_unit (n :: 'a :: factorial_semiring)\"\n+ shows prime_aprimedivisor': \"prime (aprimedivisor n)\"\n+ and aprimedivisor_dvd': \"aprimedivisor n dvd n\"\n+proof -\n+ from someI_ex[OF prime_divisor_exists[OF assms]]\n+ show \"prime (aprimedivisor n)\" \"aprimedivisor n dvd n\"\n+ unfolding aprimedivisor_def by (simp_all add: conj_commute)\n+qed\n+\n+lemma aprimedivisor_of_prime [simp]:\n+ assumes \"prime p\"\n+ shows \"aprimedivisor p = p\"\n+proof -\n+ from assms have \"\\<exists>q. prime q \\<and> q dvd p\" by auto\n+ from someI_ex[OF this, folded aprimedivisor_def] assms show ?thesis\n+ by (auto intro: primes_dvd_imp_eq)\n+qed\n+\n+lemma aprimedivisor_pos_nat: \"(n::nat) > 1 \\<Longrightarrow> aprimedivisor n > 0\"\n+ using aprimedivisor_dvd'[of n] by (auto elim: dvdE intro!: Nat.gr0I)\n+\n+lemma aprimedivisor_primepow_power:\n+ assumes \"primepow n\" \"k > 0\"\n+ shows \"aprimedivisor (n ^ k) = aprimedivisor n\"\n+proof -\n+ from assms obtain p l where l: \"prime p\" \"l > 0\" \"n = p ^ l\"\n+ by (auto simp: primepow_def)\n+ from l assms have *: \"prime (aprimedivisor (n ^ k))\" \"aprimedivisor (n ^ k) dvd n ^ k\"\n+ by (intro prime_aprimedivisor[of p] aprimedivisor_dvd[of p] dvd_power;\n+ simp add: power_mult [symmetric])+\n+ from * l have \"aprimedivisor (n ^ k) dvd p ^ (l * k)\" by (simp add: power_mult)\n+ with assms * l have \"aprimedivisor (n ^ k) dvd p\"\n+ by (subst (asm) prime_dvd_power_iff) simp_all\n+ with l assms have \"aprimedivisor (n ^ k) = p\"\n+ by (intro primes_dvd_imp_eq prime_aprimedivisor l) (auto simp: power_mult [symmetric])\n+ moreover from l have \"aprimedivisor n dvd p ^ l\"\n+ by (auto intro: aprimedivisor_dvd simp: prime_gt_0_nat)\n+ with assms l have \"aprimedivisor n dvd p\"\n+ by (subst (asm) prime_dvd_power_iff) (auto intro!: prime_aprimedivisor simp: prime_gt_0_nat)\n+ with l assms have \"aprimedivisor n = p\"\n+ by (intro primes_dvd_imp_eq prime_aprimedivisor l) auto\n+ ultimately show ?thesis by simp\n+qed\n+\n+lemma aprimedivisor_prime_power:\n+ assumes \"prime p\" \"k > 0\"\n+ shows \"aprimedivisor (p ^ k) = p\"\n+proof -\n+ from assms have *: \"prime (aprimedivisor (p ^ k))\" \"aprimedivisor (p ^ k) dvd p ^ k\"\n+ by (intro prime_aprimedivisor[of p] aprimedivisor_dvd[of p]; simp add: prime_nat_iff)+\n+ from assms * have \"aprimedivisor (p ^ k) dvd p\"\n+ by (subst (asm) prime_dvd_power_iff) simp_all\n+ with assms * show \"aprimedivisor (p ^ k) = p\" by (intro primes_dvd_imp_eq)\n+qed\n+\n+lemma prime_factorization_primepow:\n+ assumes \"primepow n\"\n+ shows \"prime_factorization n =\n+ replicate_mset (multiplicity (aprimedivisor n) n) (aprimedivisor n)\"\n+ using assms\n+ by (auto simp: primepow_def aprimedivisor_prime_power prime_factorization_prime_power)\n+\n+lemma primepow_decompose:\n+ assumes \"primepow n\"\n+ shows \"aprimedivisor n ^ multiplicity (aprimedivisor n) n = n\"\n+proof -\n+ from assms have \"n \\<noteq> 0\" by (intro notI) (auto simp: primepow_def)\n+ hence \"n = unit_factor n * prod_mset (prime_factorization n)\"\n+ by (subst prod_mset_prime_factorization) simp_all\n+ also from assms have \"unit_factor n = 1\" by (auto simp: primepow_def unit_factor_power)\n+ also have \"prime_factorization n =\n+ replicate_mset (multiplicity (aprimedivisor n) n) (aprimedivisor n)\"\n+ by (intro prime_factorization_primepow assms)\n+ also have \"prod_mset \\<dots> = aprimedivisor n ^ multiplicity (aprimedivisor n) n\" by simp\n+ finally show ?thesis by simp\n+qed\n+\n+lemma prime_power_not_one:\n+ assumes \"prime p\" \"k > 0\"\n+ shows \"p ^ k \\<noteq> 1\"\n+proof\n+ assume \"p ^ k = 1\"\n+ hence \"is_unit (p ^ k)\" by simp\n+ thus False using assms by (simp add: is_unit_power_iff)\n+qed\n+\n+lemma zero_not_primepow [simp]: \"\\<not>primepow 0\"\n+ by (auto simp: primepow_def)\n+\n+lemma one_not_primepow [simp]: \"\\<not>primepow 1\"\n+ by (auto simp: primepow_def prime_power_not_one)\n+\n+lemma primepow_not_unit [simp]: \"primepow p \\<Longrightarrow> \\<not>is_unit p\"\n+ by (auto simp: primepow_def is_unit_power_iff)\n+\n+lemma unit_factor_primepow: \"primepow p \\<Longrightarrow> unit_factor p = 1\"\n+ by (auto simp: primepow_def unit_factor_power)\n+\n+lemma aprimedivisor_primepow:\n+ assumes \"prime p\" \"p dvd n\" \"primepow (n :: 'a :: factorial_semiring)\"\n+ shows \"aprimedivisor (p * n) = p\" \"aprimedivisor n = p\"\n+proof -\n+ from assms have [simp]: \"n \\<noteq> 0\" by auto\n+ define q where \"q = aprimedivisor n\"\n+ with assms have q: \"prime q\" by (auto simp: q_def intro!: prime_aprimedivisor)\n+ from \\<open>primepow n\\<close> have n: \"n = q ^ multiplicity q n\"\n+ by (simp add: primepow_decompose q_def)\n+ have nz: \"multiplicity q n \\<noteq> 0\"\n+ proof\n+ assume \"multiplicity q n = 0\"\n+ with n have n': \"n = unit_factor n\" by simp\n+ have \"is_unit n\" by (subst n', rule unit_factor_is_unit) (insert assms, auto)\n+ with assms show False by auto\n+ qed\n+ with \\<open>prime p\\<close> \\<open>p dvd n\\<close> q have \"p dvd q\"\n+ by (subst (asm) n) (auto intro: prime_dvd_power)\n+ with \\<open>prime p\\<close> q have \"p = q\" by (intro primes_dvd_imp_eq)\n+ thus \"aprimedivisor n = p\" by (simp add: q_def)\n+\n+ define r where \"r = aprimedivisor (p * n)\"\n+ with assms have r: \"r dvd (p * n)\" \"prime r\" unfolding r_def\n+ by (intro aprimedivisor_dvd[of p] prime_aprimedivisor[of p]; simp)+\n+ hence \"r dvd q ^ Suc (multiplicity q n)\"\n+ by (subst (asm) n) (auto simp: \\<open>p = q\\<close> dest: dvd_unit_imp_unit)\n+ with r have \"r dvd q\"\n+ by (auto intro: prime_dvd_power_nat simp: prime_dvd_mult_iff dest: prime_dvd_power)\n+ with r q have \"r = q\" by (intro primes_dvd_imp_eq)\n+ thus \"aprimedivisor (p * n) = p\" by (simp add: r_def \\<open>p = q\\<close>)\n+qed\n+\n+lemma power_eq_prime_powerD:\n+ fixes p :: \"'a :: factorial_semiring\"\n+ assumes \"prime p\" \"n > 0\" \"x ^ n = p ^ k\"\n+ shows \"\\<exists>i. normalize x = normalize (p ^ i)\"\n+proof -\n+ have \"normalize x = normalize (p ^ multiplicity p x)\"\n+ proof (rule multiplicity_eq_imp_eq)\n+ fix q :: 'a assume \"prime q\"\n+ from assms have \"multiplicity q (x ^ n) = multiplicity q (p ^ k)\" by simp\n+ with \\<open>prime q\\<close> and assms have \"n * multiplicity q x = k * multiplicity q p\"\n+ by (subst (asm) (1 2) prime_elem_multiplicity_power_distrib) (auto simp: power_0_left)\n+ with assms and \\<open>prime q\\<close> show \"multiplicity q x = multiplicity q (p ^ multiplicity p x)\"\n+ by (cases \"p = q\") (auto simp: multiplicity_distinct_prime_power prime_multiplicity_other)\n+ qed (insert assms, auto simp: power_0_left)\n+ thus ?thesis by auto\n+qed\n+\n+\n+lemma primepow_power_iff:\n+ assumes \"unit_factor p = 1\"\n+ shows \"primepow (p ^ n) \\<longleftrightarrow> primepow (p :: 'a :: factorial_semiring) \\<and> n > 0\"\n+proof safe\n+ assume \"primepow (p ^ n)\"\n+ hence n: \"n \\<noteq> 0\" by (auto intro!: Nat.gr0I)\n+ thus \"n > 0\" by simp\n+ from assms have [simp]: \"normalize p = p\"\n+ using normalize_mult_unit_factor[of p] by (simp only: mult.right_neutral)\n+ from \\<open>primepow (p ^ n)\\<close> obtain q k where *: \"k > 0\" \"prime q\" \"p ^ n = q ^ k\"\n+ by (auto simp: primepow_def)\n+ with power_eq_prime_powerD[of q n p k] n\n+ obtain i where eq: \"normalize p = normalize (q ^ i)\" by auto\n+ with primepow_not_unit[OF \\<open>primepow (p ^ n)\\<close>] have \"i \\<noteq> 0\"\n+ by (intro notI) (simp add: normalize_1_iff is_unit_power_iff del: primepow_not_unit)\n+ with \\<open>normalize p = normalize (q ^ i)\\<close> \\<open>prime q\\<close> show \"primepow p\"\n+ by (auto simp: normalize_power primepow_def intro!: exI[of _ q] exI[of _ i])\n+next\n+ assume \"primepow p\" \"n > 0\"\n+ then obtain q k where *: \"k > 0\" \"prime q\" \"p = q ^ k\" by (auto simp: primepow_def)\n+ with \\<open>n > 0\\<close> show \"primepow (p ^ n)\"\n+ by (auto simp: primepow_def power_mult intro!: exI[of _ q] exI[of _ \"k * n\"])\n+qed\n+\n+lemma primepow_prime [simp]: \"prime n \\<Longrightarrow> primepow n\"\n+ by (auto simp: primepow_def intro!: exI[of _ n] exI[of _ \"1::nat\"])\n+\n+lemma primepow_prime_power [simp]:\n+ \"prime (p :: 'a :: factorial_semiring) \\<Longrightarrow> primepow (p ^ n) \\<longleftrightarrow> n > 0\"\n+ by (subst primepow_power_iff) auto\n+\n+(* TODO Generalise *)\n+lemma primepow_multD:\n+ assumes \"primepow (a * b :: nat)\"\n+ shows \"a = 1 \\<or> primepow a\" \"b = 1 \\<or> primepow b\"\n+proof -\n+ from assms obtain p k where k: \"k > 0\" \"a * b = p ^ k\" \"prime p\"\n+ unfolding primepow_def by auto\n+ then obtain i j where \"a = p ^ i\" \"b = p ^ j\"\n+ using prime_power_mult_nat[of p a b] by blast\n+ with \\<open>prime p\\<close> show \"a = 1 \\<or> primepow a\" \"b = 1 \\<or> primepow b\" by auto\n+qed\n+\n+lemma primepow_mult_aprimedivisorI:\n+ assumes \"primepow (n :: 'a :: factorial_semiring)\"\n+ shows \"primepow (aprimedivisor n * n)\"\n+ by (subst (2) primepow_decompose[OF assms, symmetric], subst power_Suc [symmetric],\n+ subst primepow_prime_power)\n+ (insert assms, auto intro!: prime_aprimedivisor' dest: primepow_gt_Suc_0)\n+\n+lemma aprimedivisor_vimage:\n+ assumes \"prime (p :: 'a :: factorial_semiring)\"\n+ shows \"aprimedivisor -` {p} \\<inter> primepow_factors n = {p ^ k |k. k > 0 \\<and> p ^ k dvd n}\"\n+proof safe\n+ fix q assume q: \"q \\<in> primepow_factors n\"\n+ hence q': \"q \\<noteq> 0\" \"q \\<noteq> 1\" by (auto simp: primepow_def primepow_factors_def prime_power_not_one)\n+ let ?n = \"multiplicity (aprimedivisor q) q\"\n+ from q q' have \"q = aprimedivisor q ^ ?n \\<and> ?n > 0 \\<and> aprimedivisor q ^ ?n dvd n\"\n+ using prime_aprimedivisor'[of q] aprimedivisor_dvd'[of q]\n+ by (subst primepow_decompose [symmetric])\n+ (auto simp: primepow_factors_def multiplicity_gt_zero_iff unit_factor_primepow\n+ intro: dvd_trans[OF multiplicity_dvd])\n+ thus \"\\<exists>k. q = aprimedivisor q ^ k \\<and> k > 0 \\<and> aprimedivisor q ^ k dvd n\" ..\n+next\n+ fix k :: nat assume k: \"p ^ k dvd n\" \"k > 0\"\n+ with assms show \"p ^ k \\<in> aprimedivisor -` {p}\"\n+ by (auto simp: aprimedivisor_prime_power)\n+ with assms k show \"p ^ k \\<in> primepow_factors n\"\n+ by (auto simp: primepow_factors_def primepow_def aprimedivisor_prime_power intro: Suc_leI)\n+qed\n+\n+lemma primepow_factors_altdef:\n+ fixes x :: \"'a :: factorial_semiring\"\n+ assumes \"x \\<noteq> 0\"\n+ shows \"primepow_factors x = {p ^ k |p k. p \\<in> prime_factors x \\<and> k \\<in> {0<.. multiplicity p x}}\"\n+proof (intro equalityI subsetI)\n+ fix q assume \"q \\<in> primepow_factors x\"\n+ then obtain p k where pk: \"prime p\" \"k > 0\" \"q = p ^ k\" \"q dvd x\"\n+ unfolding primepow_factors_def primepow_def by blast\n+ moreover have \"k \\<le> multiplicity p x\" using pk assms by (intro multiplicity_geI) auto\n+ ultimately show \"q \\<in> {p ^ k |p k. p \\<in> prime_factors x \\<and> k \\<in> {0<.. multiplicity p x}}\"\n+ by (auto simp: prime_factors_multiplicity intro!: exI[of _ p] exI[of _ k])\n+qed (auto simp: primepow_factors_def prime_factors_multiplicity multiplicity_dvd')\n+\n+lemma finite_primepow_factors:\n+ assumes \"x \\<noteq> (0 :: 'a :: factorial_semiring)\"\n+ shows \"finite (primepow_factors x)\"\n+proof -\n+ have \"finite (SIGMA p:prime_factors x. {0<..multiplicity p x})\"\n+ by (intro finite_SigmaI) simp_all\n+ hence \"finite ((\\<lambda>(p,k). p ^ k) ` \\<dots>)\" (is \"finite ?A\") by (rule finite_imageI)\n+ also have \"?A = primepow_factors x\"\n+ using assms by (subst primepow_factors_altdef) fast+\n+ finally show ?thesis .\n+qed\n+\n+\n+definition mangoldt :: \"nat \\<Rightarrow> 'a :: real_algebra_1\" where\n+ \"mangoldt n = (if primepow n then of_real (ln (real (aprimedivisor n))) else 0)\"\n+\n+lemma of_real_mangoldt [simp]: \"of_real (mangoldt n) = mangoldt n\"\n+ by (simp add: mangoldt_def)\n+\n+lemma mangoldt_sum:\n+ assumes \"n \\<noteq> 0\"\n+ shows \"(\\<Sum>d | d dvd n. mangoldt d :: 'a :: real_algebra_1) = of_real (ln (real n))\"\n+proof -\n+ have \"(\\<Sum>d | d dvd n. mangoldt d :: 'a) = of_real (\\<Sum>d | d dvd n. mangoldt d)\" by simp\n+ also have \"(\\<Sum>d | d dvd n. mangoldt d) = (\\<Sum>d \\<in> primepow_factors n. ln (real (aprimedivisor d)))\"\n+ using assms by (intro sum.mono_neutral_cong_right) (auto simp: primepow_factors_def mangoldt_def)\n+ also have \"\\<dots> = ln (real (\\<Prod>d \\<in> primepow_factors n. aprimedivisor d))\"\n+ using assms finite_primepow_factors[of n]\n+ by (subst ln_prod [symmetric])\n+ (auto simp: primepow_factors_def intro!: aprimedivisor_pos_nat\n+ intro: Nat.gr0I primepow_gt_Suc_0)\n+ also have \"primepow_factors n =\n+ (\\<lambda>(p,k). p ^ k) ` (SIGMA p:prime_factors n. {0<..multiplicity p n})\"\n+ (is \"_ = _ ` ?A\") by (subst primepow_factors_altdef[OF assms]) fast+\n+ also have \"prod aprimedivisor \\<dots> = (\\<Prod>(p,k)\\<in>?A. aprimedivisor (p ^ k))\"\n+ by (subst prod.reindex)\n+ (auto simp: inj_on_def prime_power_inj'' prime_factors_multiplicity\n+ prod.Sigma [symmetric] case_prod_unfold)\n+ also have \"\\<dots> = (\\<Prod>(p,k)\\<in>?A. p)\"\n+ by (intro prod.cong refl) (auto simp: aprimedivisor_prime_power prime_factors_multiplicity)\n+ also have \"\\<dots> = (\\<Prod>x\\<in>prime_factors n. \\<Prod>k\\<in>{0<..multiplicity x n}. x)\"\n+ by (rule prod.Sigma [symmetric]) auto\n+ also have \"\\<dots> = (\\<Prod>x\\<in>prime_factors n. x ^ multiplicity x n)\"\n+ by (intro prod.cong refl) (simp add: prod_constant)\n+ also have \"\\<dots> = n\" using assms by (intro prime_factorization_nat [symmetric]) simp\n+ finally show ?thesis .\n+qed\n+\n+end\n\\ No newline at end of file```" ]
[ null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.5588176,"math_prob":0.99323094,"size":48986,"snap":"2021-04-2021-17","text_gpt3_token_len":16006,"char_repetition_ratio":0.22218366,"word_repetition_ratio":0.19039032,"special_character_ratio":0.3510799,"punctuation_ratio":0.11968651,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.99989295,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2021-04-11T19:11:05Z\",\"WARC-Record-ID\":\"<urn:uuid:179f235e-db90-44ef-b257-eef3d928c0fb>\",\"Content-Length\":\"148592\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:096cee05-8e37-4fdc-bde5-b88949e7ce4a>\",\"WARC-Concurrent-To\":\"<urn:uuid:6351354e-e427-4cca-b9ae-67e95e3cd93b>\",\"WARC-IP-Address\":\"131.159.46.82\",\"WARC-Target-URI\":\"https://isabelle.in.tum.de/repos/isabelle/rev/acc3b7dd0b21\",\"WARC-Payload-Digest\":\"sha1:HYO77XFGZV24XS767DGT63UG6BGUDKN4\",\"WARC-Block-Digest\":\"sha1:3T7237RDAZ2N6A33NTBPK2ILWE5DC5LF\",\"WARC-Identified-Payload-Type\":\"application/xhtml+xml\",\"warc_filename\":\"/cc_download/warc_2021/CC-MAIN-2021-17/CC-MAIN-2021-17_segments_1618038064898.14_warc_CC-MAIN-20210411174053-20210411204053-00228.warc.gz\"}"}
https://virtual.aistats.org/virtual/2021/poster/1834
[ "## Approximation Algorithms for Orthogonal Non-negative Matrix Factorization\n\n### Moses Charikar · Lunjia Hu\n\nKeywords: [ Models and Methods ] [ Matrix and Tensor Factorization ]\n\nAbstract: In the non-negative matrix factorization (NMF) problem, the input is an $m\\times n$ matrix $M$ with non-negative entries and the goal is to factorize it as $M\\approx AW$. The $m\\times k$ matrix $A$ and the $k\\times n$ matrix $W$ are both constrained to have non-negative entries. This is in contrast to singular value decomposition, where the matrices $A$ and $W$ can have negative entries but must satisfy the orthogonality constraint: the columns of $A$ are orthogonal and the rows of $W$ are also orthogonal. The orthogonal non-negative matrix factorization (ONMF) problem imposes both the non-negativity and the orthogonality constraints, and previous work showed that it leads to better performances than NMF on many clustering tasks. We give the first constant-factor approximation algorithm for ONMF when one or both of $A$ and $W$ are subject to the orthogonality constraint. We also show an interesting connection to the correlation clustering problem on bipartite graphs. Our experiments on synthetic and real-world data show that our algorithm achieves similar or smaller errors compared to previous ONMF algorithms while ensuring perfect orthogonality (many previous algorithms do not satisfy the hard orthogonality constraint)." ]
[ null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.8980616,"math_prob":0.9891901,"size":1250,"snap":"2022-05-2022-21","text_gpt3_token_len":272,"char_repetition_ratio":0.14847513,"word_repetition_ratio":0.0,"special_character_ratio":0.1936,"punctuation_ratio":0.056872036,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.99743044,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2022-05-29T11:29:59Z\",\"WARC-Record-ID\":\"<urn:uuid:92aa0652-bc7e-4b6e-b6c0-4f4dfc0d890f>\",\"Content-Length\":\"11616\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:61752e01-773a-488c-b10b-2bb0e3b96a0b>\",\"WARC-Concurrent-To\":\"<urn:uuid:d4f4d79d-8a89-41e8-bf38-16b43e21889a>\",\"WARC-IP-Address\":\"198.202.70.65\",\"WARC-Target-URI\":\"https://virtual.aistats.org/virtual/2021/poster/1834\",\"WARC-Payload-Digest\":\"sha1:CJGMUF66PJO5PP6EKTGVXHSRFBSWY27D\",\"WARC-Block-Digest\":\"sha1:4APPXEOV7KCHMFYWKYUUTW6USYXV74XV\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2022/CC-MAIN-2022-21/CC-MAIN-2022-21_segments_1652662644142.66_warc_CC-MAIN-20220529103854-20220529133854-00017.warc.gz\"}"}
https://answers.everydaycalculation.com/lcm/30-12
[ "Solutions by everydaycalculation.com\n\n## What is the LCM of 30 and 12?\n\nThe lcm of 30 and 12 is 60.\n\n#### Steps to find LCM\n\n1. Find the prime factorization of 30\n30 = 2 × 3 × 5\n2. Find the prime factorization of 12\n12 = 2 × 2 × 3\n3. Multiply each factor the greater number of times it occurs in steps i) or ii) above to find the lcm:\n\nLCM = 2 × 2 × 3 × 5\n4. LCM = 60\n\nMathStep (Works offline)", null, "Download our mobile app and learn how to find LCM of upto four numbers in your own time:" ]
[ null, "https://answers.everydaycalculation.com/mathstep-app-icon.png", null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.75913537,"math_prob":0.9990645,"size":467,"snap":"2020-24-2020-29","text_gpt3_token_len":157,"char_repetition_ratio":0.12958963,"word_repetition_ratio":0.0,"special_character_ratio":0.41327623,"punctuation_ratio":0.082474224,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.99603856,"pos_list":[0,1,2],"im_url_duplicate_count":[null,null,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2020-07-14T04:19:35Z\",\"WARC-Record-ID\":\"<urn:uuid:c3044f23-281e-43ed-879c-de13ebd26efa>\",\"Content-Length\":\"5792\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:5e903b22-929a-4952-810f-16a0fe48c18d>\",\"WARC-Concurrent-To\":\"<urn:uuid:88baf7d0-5d8c-42ce-8a01-1ca81f5b514b>\",\"WARC-IP-Address\":\"96.126.107.130\",\"WARC-Target-URI\":\"https://answers.everydaycalculation.com/lcm/30-12\",\"WARC-Payload-Digest\":\"sha1:V6SOF5ZHLFMNYIO4P3X74SCHCYAV4RIS\",\"WARC-Block-Digest\":\"sha1:374YMKGMWPTMO5J7SZNRQYSDFEIJVTAK\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2020/CC-MAIN-2020-29/CC-MAIN-2020-29_segments_1593657147917.99_warc_CC-MAIN-20200714020904-20200714050904-00059.warc.gz\"}"}
https://www.schoolofhaskell.com/user/Geraldus/algebraic-data-types-adts-with-aeson
[ "# Algebraic Data Types (ADTs) with Aeson\n\nAs of March 2020, School of Haskell has been switched to read-only mode.\n\n### Sections\n\nThis is tiny cheat sheet, which will help with decoding JSON data to Haskell's ADT.\n\n``````data YesNo = Yes\n| No\nderiving Show``````\n\nFirst of all let's think how we could express our Haskell values in JSON format? According to Aeson's documentation:\n\nSo stick to objects (e.g. maps in Haskell) or arrays (lists or vectors in Haskell):\n\nTo avoid possible decoding pitfalls we should stick with objects and arrays. Here are possible (or valid) respresentations:\n\n``````For Yes value: { \"value\" : \"yes\" } { \"value\" : 1 } { \"value\" : 1.0 }\nNo value: { \"value\" : \"no\" } { \"value\" : 0 } { \"value\" : 0.0 }``````\n\nLet's declare `FromJSON` instance for our `YesNo` data type:\n\n``````instance FromJSON YesNo where\n\n-- parseJSON takes a Value, it could be one of follwing data constructors:\n-- Object, Array, String, Number, Bool or Null.\n-- First of all we expect an Object, it is defined as Object !Object,\n-- where second Object is just a type synonym for HashMap Text Value. In\n-- our case we should choose somehow our Haskell value constructor\n-- according to recieved value.\n-- So, `o` is actually a HashMap, and all we need is to lookup key \"type\"\n-- We should use strict Text for key:\nparseJSON (Object o) = case HML.lookup (pack \"type\") o of\n-- value of entity has type Value\nJust (String t) -> fromString (TL.unpack (TL.fromStrict t))\nJust (Number n) -> fromNum n\n-- Other cases are invalid\n_ -> empty\nwhere fromString :: String -> Parser YesNo\nfromString \"yes\" = pure Yes\nfromString \"no\" = pure No\nfromString _ = empty\nfromNum n\n| n == 1 || n == 1.0 = pure Yes\n| n == 0 || n == 0.0 = pure No\n| otherwise = empty``````\n\nLet's also declare `ToJSON` instance for our Haskell data type:\n\n``````instance ToJSON YesNo where\ntoJSON Yes = object [ \"value\" .= String \"yes\" ]\ntoJSON No = object [ \"value\" .= String \"no\" ]``````\n\nNow we can play with it and test it:\n\n``````{-# LANGUAGE OverloadedStrings #-}\n\nimport Data.Aeson\nimport Data.Aeson.Types ( Parser )\n\nimport Data.Text ( Text, pack )\nimport qualified Data.Text.Lazy as TL ( fromStrict, unpack )\nimport qualified Data.ByteString.Lazy as BSL ( toChunks )\nimport qualified Data.ByteString.Lazy.Char8 as C ( fromChunks, unpack )\n\nimport qualified Data.HashMap.Lazy as HML ( lookup )\n\nimport Control.Applicative ( empty, pure )\n\ndata YesNo = Yes\n| No\nderiving Show\n\ninstance FromJSON YesNo where\nparseJSON (Object o) = case HML.lookup \"value\" o of\nJust (String t) -> fromString (TL.unpack (TL.fromStrict t))\nJust (Number n) -> fromNum n\n_ -> empty\nwhere fromString :: String -> Parser YesNo\nfromString \"yes\" = pure Yes\nfromString \"no\" = pure No\nfromString _ = empty\nfromNum n\n| n == 1 || n == 1.0 = pure Yes\n| n == 0 || n == 0.0 = pure No\n| otherwise = empty\n\ninstance ToJSON YesNo where\ntoJSON Yes = object [ \"value\" .= String \"yes\" ]\ntoJSON No = object [ \"value\" .= String \"no\" ]\n\n-- show\nmain = do\nlet yesJ = encode Yes\nyesJS = C.unpack \\$ C.fromChunks \\$ BSL.toChunks yesJ\nputStrLn \"Encoded:\"\nprint yesJS\nputStrLn \"Decoding:\"\nprint (decode yesJ :: Maybe Value)\nprint (decode yesJ :: Maybe YesNo)``````\n\nNow, let's imagine we are designing some kind of API. Assume that we store in database pairs of person's name and his/her cash amount.\n\n``````data Command = NotCommand\n| WrongArg String\n| CommandCreate { name :: Text, value :: Double }\n| CommandUpdate { id :: Int, value :: Double }\n| CommandDelete { id :: Int }\nderiving Show``````\n\nHere are valid representations of out `Command` data type:\n\n`Create` command example\n\n``````{ \"type\" : \"command\",\n\"name\" : \"create\",\n\"data\" : {\n\"name\" : \"Arthur\",\n\"value\" : 100.0\n}\n}``````\n\n`Update` command example\n\n``````{ \"type\" : \"command\",\n\"name\" : \"update\",\n\"data\" : {\n\"id\" : 1,\n\"value\" : 90.0\n}\n}``````\n\n`Delete` command example\n\n``````{ \"type\" : \"command\",\n\"name\" : \"delete\",\n\"data\" : 1\n}``````\n\nSo, we expect key `type`, which always should be `\"command\"`, to distinguish commands we use key `name`, and each command have third mandatory key `data`, which differs for each command.\n\nWe could declare following `FromJSON` instance for `Command`:\n\n``````instance FromJSON Command where\n-- First of all we lookup for mandatory key `type`\nparseJSON (Object o) = case HML.lookup \"type\" o of\nJust (String \"command\") -> let dt = HML.lookup \"data\" o\nin case HML.lookup \"name\" o of\n-- Then we lookup for key `name`, to distinguish commands\nJust (String \"create\") -> createCmd dt\nJust (String \"update\") -> updateCmd dt\nJust (String \"delete\") -> CommandDelete <\\$> o .: \"data\"\n_ -> unrecognizedCommand\n_ -> pure NotCommand\nwhere createCmd Nothing = missingData\ncreateCmd (Just (Object d)) = CommandCreate <\\$> d .: \"name\" <*> d .: \"value\"\ncreateCmd _ = incorrectData\nupdateCmd Nothing = missingData\nupdateCmd (Just (Object d)) = CommandUpdate <\\$> d .: \"id\" <*> d .: \"value\"\nupdateCmd _ = incorrectData\n\nmissingData = pure \\$ WrongArg \"Missing mandatory `data` key.\"\nincorrectData = pure \\$ WrongArg \"Incorrect data received.\"\nunrecognizedCommand = pure \\$ WrongArg \"Unrecognized command name.\"\nparseJSON _ = pure NotCommand``````\n\nThere is nothing special about `ToJSON` instance, so let's just omit its declaration and test our code!\n\n``````{-# LANGUAGE OverloadedStrings #-}\n\nimport Data.Aeson\n\nimport Data.Text ( Text, pack )\nimport qualified Data.Text.Lazy as TL ( fromStrict, unpack )\n\nimport qualified Data.HashMap.Lazy as HML ( lookup )\n\nimport Control.Applicative ( empty, pure, (<\\$>), (<*>) )\nimport qualified Data.ByteString.Lazy.Char8 as BSCL\n\ndata Command = NotCommand\n| WrongArg String\n| CommandCreate { name :: Text, value :: Double }\n| CommandUpdate { id :: Int, value :: Double }\n| CommandDelete { id :: Int }\nderiving Show\n\ninstance FromJSON Command where\nparseJSON (Object o) = case HML.lookup \"type\" o of\nJust (String \"command\") -> let dt = HML.lookup \"data\" o\nin case HML.lookup \"name\" o of\nJust (String \"create\") -> createCmd dt\nJust (String \"update\") -> updateCmd dt\nJust (String \"delete\") -> CommandDelete <\\$> o .: \"data\"\n_ -> unrecognizedCommand\n_ -> pure NotCommand\nwhere createCmd Nothing = missingData\ncreateCmd (Just (Object d)) = CommandCreate <\\$> d .: \"name\" <*> d .: \"value\"\ncreateCmd _ = incorrectData\nupdateCmd Nothing = missingData\nupdateCmd (Just (Object d)) = CommandUpdate <\\$> d .: \"id\" <*> d .: \"value\"\nupdateCmd _ = incorrectData\n\nmissingData = pure \\$ WrongArg \"Missing mandatory `data` key.\"\nincorrectData = pure \\$ WrongArg \"Incorrect data received.\"\nunrecognizedCommand = pure \\$ WrongArg \"Unrecognized command name.\"\nparseJSON _ = pure NotCommand\n\ninstance ToJSON Command where\ntoJSON NotCommand = String \"Not a command\"\ntoJSON (WrongArg t) = String (pack t)\ntoJSON (CommandCreate n v) = object [ \"type\" .= String \"command\"\n, \"name\" .= String \"create\"\n, \"data\" .= object [ \"name\" .= String n\n, \"value\" .= toJSON v\n]\n]\ntoJSON (CommandUpdate i v) = object [ \"type\" .= String \"command\"\n, \"name\" .= String \"update\"\n, \"data\" .= object [ \"id\" .= toJSON i\n, \"value\" .= toJSON v\n]\n]\ntoJSON (CommandDelete i) = object [ \"type\" .= String \"command\"\n, \"name\" .= String \"delete\"\n, \"data\" .= toJSON i\n]\n-- show\nmain = do\nlet c = encode \\$ CommandCreate \"Svetlana\" 100.0\nprint (decode c :: Maybe Command)\nprint (decode \"{\\\"type\\\":\\\"command\\\",\\\"name\\\":\\\"create\\\"}\" :: Maybe Command)\nprint (decode \"{\\\"type\\\":\\\"command\\\",\\\"name\\\":\\\" reate\\\",\\\"data\\\":{\\\"name\\\":\\\"Svetlana\\\",\\\"value\\\":100.0}}\" :: Maybe Command)\nprint (decode \"{\\\"type\\\":\\\"command\\\",\\\"name\\\":\\\"create\\\",\\\"data\\\":{\\\" ame\\\":\\\"Svetlana\\\",\\\"value\\\":100.0}}\" :: Maybe Command)``````" ]
[ null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.663667,"math_prob":0.6521087,"size":7297,"snap":"2021-31-2021-39","text_gpt3_token_len":2000,"char_repetition_ratio":0.14616756,"word_repetition_ratio":0.47092083,"special_character_ratio":0.30834588,"punctuation_ratio":0.19175911,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9788576,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2021-09-23T09:36:42Z\",\"WARC-Record-ID\":\"<urn:uuid:413bcc56-c00f-49ff-8509-ed524506d704>\",\"Content-Length\":\"33679\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:26b1befe-5faf-4279-8c0d-959da705f046>\",\"WARC-Concurrent-To\":\"<urn:uuid:d9a369ab-8d4a-4e27-bba9-bee6cdd21606>\",\"WARC-IP-Address\":\"34.204.35.131\",\"WARC-Target-URI\":\"https://www.schoolofhaskell.com/user/Geraldus/algebraic-data-types-adts-with-aeson\",\"WARC-Payload-Digest\":\"sha1:RNGS624FTHWUOEIYJZU6ISREUK5PCBQZ\",\"WARC-Block-Digest\":\"sha1:T65NBSQAMQ72UJDRBWH7IMI2UIZ7OMJC\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2021/CC-MAIN-2021-39/CC-MAIN-2021-39_segments_1631780057417.92_warc_CC-MAIN-20210923074537-20210923104537-00024.warc.gz\"}"}
http://www.piping-designer.com/index.php/properties/classical-mechanics/252-characteristic-length
[ "# Characteristic Length\n\nWritten by Jerry Ratzlaff on . Posted in Classical Mechanics\n\nCharacteristic length, abbreviated as $$l_c$$, is the scale of a physical system.  The length is used in 2D and 3D systems for Fluid Dynamics and Thermodynamics defining the parameter of the system.\n\nExamples of:\n\n## Formulas that use Characteristic Length\n\n $$\\large{ l_c = \\frac{ V } { A } }$$ $$\\large{ l_c = \\sqrt { \\frac{ \\alpha \\; t }{ Fo } } }$$ (Fourier number) $$\\large{ l_c =\\frac{ Nu \\; k }{ h } }$$ (Nusselt number) $$\\large{ l_c = \\frac {Pe \\; k}{ v \\; \\rho \\; C } }$$ (Peclet number) $$\\large{ l_c = \\frac{ Re \\; \\mu }{\\rho \\; v } }$$ (Reynolds number) $$\\large{ l_c = \\frac { Sh \\; D} {K} }$$ (Sherwood number)\n\n### Where:\n\n$$\\large{ l_c }$$ = characteristic length\n\n$$\\large{ A }$$ = area of object surface\n\n$$\\large{ \\rho }$$  (Greek symbol rho) = density\n\n$$\\large{ D }$$ = diffusion coefficient\n\n$$\\large{ \\mu }$$  (Greek symbol mu)  = dynamic viscosity\n\n$$\\large{ Fo }$$ = Fourier number\n\n$$\\large{ C }$$ = heat capacity\n\n$$\\large{ h }$$ = heat transfer coefficient\n\n$$\\large{ K }$$ = mass transfer coefficient\n\n$$\\large{ Nu }$$ = Nusselt number\n\n$$\\large{ Pe }$$ = Peclet number\n\n$$\\large{ Re }$$ = Reynolds number\n\n$$\\large{ Sh }$$ = Sherwood number\n\n$$\\large{ k }$$ = thermal conductivity\n\n$$\\large{ \\alpha }$$  (Greel symbol alpha) = thermal diffusivity\n\n$$\\large{ t }$$ = time\n\n$$\\large{ v }$$ = velocity\n\n$$\\large{ V }$$ =" ]
[ null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.6248852,"math_prob":1.000009,"size":1353,"snap":"2020-24-2020-29","text_gpt3_token_len":453,"char_repetition_ratio":0.24610823,"word_repetition_ratio":0.008510638,"special_character_ratio":0.3939394,"punctuation_ratio":0.07526882,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":1.0000094,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2020-07-07T12:40:54Z\",\"WARC-Record-ID\":\"<urn:uuid:644cd97e-443b-43dc-9da8-f4782fb77c10>\",\"Content-Length\":\"29586\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:6af28ebc-087b-49b0-bff0-019fd0902883>\",\"WARC-Concurrent-To\":\"<urn:uuid:689a49f6-165e-4e0b-b486-0b8b2eebcf17>\",\"WARC-IP-Address\":\"23.235.195.68\",\"WARC-Target-URI\":\"http://www.piping-designer.com/index.php/properties/classical-mechanics/252-characteristic-length\",\"WARC-Payload-Digest\":\"sha1:PEGSHI7J76BAYXT3ELNJAFQ2DFNGJ6OX\",\"WARC-Block-Digest\":\"sha1:UDO3ATKFJ5G6AZ4MMSY7AJMAJNJMO6SP\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2020/CC-MAIN-2020-29/CC-MAIN-2020-29_segments_1593655892516.24_warc_CC-MAIN-20200707111607-20200707141607-00336.warc.gz\"}"}
https://iq.opengenus.org/tim-sort/
[ "×\n\nSearch anything:\n\n# Tim Sort\n\n#### Algorithms Sorting Algorithms", null, "Get this book -> Problems on Array: For Interviews and Competitive Programming\n\nReading time: 30 minutes | Coding time: 15 minutes\n\nTim Sort is a hybrid stable sorting algorithm that takes advantage of common patterns in data, and utilizes a combination of an improved Merge sort and Binary Insertion sort along with some internal logic to optimize the manipulation of large scale real-world data. Tim Sort was first implemented in 2002 by Tim Peters for use in Python.\n\n### Operation\n\nTim sort uses Binary insertion sort and improved merge sort by using galloping in a combination. Binary insertion sort is the best method to sort when data is already or partially sorted or the length of run is smaller than MIN_RUN and merge sort is best when the input is large.\n\nTim Sort is complex, even by algorithmic standards. The operation is best broken down into parts:\n\n## Run (dividing slot)\n\nAn input array is divided into different sub-arrays, count of elements inside a sub-array is defined as a RUN, the minimum value of such runs is a MIN_RUN which is a power of 2 not more than 32 (or 64). These sub-arrays are usually partially ordered (strictly ascending or stricly descending).When the array is decomposed into several runs, the runs of ascending order remain unchanged, and the runs of strictly descending order are reversed. Finally, several runs of ascending order are obtained.\n\nExample:\n\nConsider an array of goals:\n\n1 5 9 8 6 4 5 6 7\n\nWe can see that [1, 5, 9] conforms to ascending order, [8, 6, 4] conforms to strict descending order, [4, 5, 6, 7] conforms to ascending order.\n\nFlip the strictly descending run and then add together a new array:\n\n1 5 9 6 8 4 5 6 7\n\n## Merge run\n\nLet's assume that the new array is:\n\n.... 6 7 8 9 10 1 2 3 4 ....\n\nIf we merge two runs using Mergesort alone\nrun1: [6, 7, 8, 9, 10]\nrun2: [1, 2, 3, 4, 5]\n\nMergesort compares the first element of the two runs\n1 < 6, get 1\n2 < 6, get 2\n3 < 6, get 3\n4 < 6, get 4\n5 < 6, get 5\n\nWe found that traversing the entire run directly would eventually consume more number of merge operations if the run was longer. Because every run is in ascending order, there's no need to compare them one by one and the concept of Galloping becomes handy.\n\n## Galloping\n\nFor example, to merge the following two runs:\nrun1: [101, 102, 103, ... 200]\nrun2: [1, 2, 3, ..., 100]\nInstead of comparing the elements one by one, we compare them by increasing powers of 2^n where n >= 0.\n\nrun1 > run2\nrun1 > run2\nrun1 > run2\nrun1 > run2\nrun1 > run2\n...\nrun1 > run2[2^n - 1]\nrun1 <= run2[2^(n+1) - 1]\n\nWe get a result run2 [2 ^ n - 1] < run1 <= run2 [2 ^ (n + 1) - 1], Since run2 is sorted, we use Binary Search to locate run1 in run2 very efficiently by defining left = run2[2^n - 1], right = run[2^(n+1) - 1]. Hence. the number of times we merge two runs is reduced from O(N) to O(logN).\n\n## Why not skip Galloping and just do Binary Search?\n\nLet's give an example:\nrun1: [1, 3, 5, 7, 9 ... 2n+1]\nrun2: [0, 2, 4, 6, 8 ... 2n]\nIn this way, run1 is only larger than run2. Each time we do Binary Search, we can only get a number of results, plus n times of Binary Search, so the time complexity changes from O(N) to O(NlogN).\n\n## Stack determines the order\n\nWhen the original array becomes a set of various ascending runs, we need to merge two runs, but if we merge a long run with a shorter run, it will take a longer time to compare a comparitively shorter run. So Timsort maintains a stack with all the run lengths on the stack, while satisfying that the length of run on the back stack is longer than the sum of the length of run on the first two stacks, so that the length of run always decreases.\n\nStack : [... runA, runB, runC]\nrunA > runB + runC\nrunB > runC\nThis avoids run merges with too much difference in length.\n\nFor those who prefer bullets:\n\n• Establish a minrun size that is a power of 2 (usually 32, never more than 64 or your Binary Insertion Sort will lose efficiency)\n• Find a run in the first minrun of data.\n• If the run is not at least minrun in length, use Insertion Sort to grab subsequent or prior items and insert them into the run until it is the correct minimum size.\n• Repeat until the entire array is divided into sorted subsections.\n• Use the latter half of Merge Sort to join the ordered arrays.\n\n## Complexity Analysis\n\nBy design TimSort is well suited for partially sorted data with the best case being totally sorted data. It falls into the adaptive sort family. Taking the number of runs ρ as a (natural) parameter for a refined analysis we obtained:\n\nTimSort runs in O(N + Nlogρ) time.\n\n• Worst case time complexity: `Θ(NlogN)`\n• Average case time complexity: `Θ(NlogN)`\n• Best case time complexity: `Θ(N)`\n• Space complexity: `Θ(N)`\n\n## Implementation\n\nImplementation of Tim Sort algorithm:\n\n• C\n• C++\n• Java\n• Python\n\n### C\n\n``````\n#include<stdio.h>\n#define min(a,b) (a)<(b)?(a):(b)\nconst int RUN = 32;\n// this function sorts array from left index to\n// right index which is of size atmost RUN\nvoid insertionSort(int arr[], int left, int right)\n{\nfor (int i = left + 1; i <= right; i++)\n{\nint temp = arr[i];\nint j = i - 1;\nwhile (j >= left && arr[j] > temp)\n{\narr[j+1] = arr[j];\nj--;\n}\narr[j+1] = temp;\n}\n}\n// merge function merges the sorted runs\nvoid merge(int arr[], int l, int m, int r)\n{\n// original array is broken in two parts\n// left and right array\nint len1 = m - l + 1, len2 = r - m;\nint left[len1], right[len2];\nfor (int i = 0; i < len1; i++)\nleft[i] = arr[l + i];\nfor (int i = 0; i < len2; i++)\nright[i] = arr[m + 1 + i];\nint i = 0;\nint j = 0;\nint k = l;\n// after comparing, we merge those two array\n// in larger sub array\nwhile (i < len1 && j < len2)\n{\nif (left[i] <= right[j])\n{\narr[k] = left[i];\ni++;\n}\nelse\n{\narr[k] = right[j];\nj++;\n}\nk++;\n}\n// copy remaining elements of left, if any\nwhile (i < len1)\n{\narr[k] = left[i];\nk++;\ni++;\n}\n// copy remaining element of right, if any\nwhile (j < len2)\n{\narr[k] = right[j];\nk++;\nj++;\n}\n}\nvoid timSort(int arr[], int n)\n{\n// Sort individual subarrays of size RUN\nfor (int i = 0; i < n; i+=RUN)\n{\ninsertionSort(arr, i, min((i+31), (n-1)));\n}\n// start merging from size RUN (or 32). It will merge\n// to form size 64, then 128, 256 and so on ....\nfor (int size = RUN; size < n; size = 2*size)\n{\n// pick starting point of left sub array. We\n// are going to merge arr[left..left+size-1]\n// and arr[left+size, left+2*size-1]\n// After every merge, we increase left by 2*size\nfor (int left = 0; left < n; left += 2*size)\n{\n// find ending point of left sub array\n// mid+1 is starting point of right sub array\nint mid = left + size - 1;\nint right = min((left + 2*size - 1), (n-1));\n// merge sub array arr[left.....mid] &\n// arr[mid+1....right]\nmerge(arr, left, mid, right);\n}\n}\n}\nint main()\n{\nint a[] = {12,1,20,2,3,123,54,332},i;\nint n = sizeof(a)/sizeof(a);\nprintf(\"Printing Array elements \\n\");\nfor (i = 0; i < n; i++)\nprintf(\"%d \", a[i]);\nprintf(\"\\n\");\ntimSort(a, n);\nprintf(\"Printing sorted array elements \\n\");\nfor (i = 0; i < n; i++)\nprintf(\"%d \", a[i]);\nprintf(\"\\n\");\nreturn 0;\n}\n``````\n\n### C++\n\n``````\n#include<bits/stdc++.h>\nusing namespace std;\nconst int RUN = 32;\n// this function sorts array from left index to\n// right index which is of size atmost RUN\nvoid insertionSort(int arr[], int left, int right)\n{\nfor (int i = left + 1; i <= right; i++)\n{\nint temp = arr[i];\nint j = i - 1;\nwhile (j >= left && arr[j] > temp)\n{\narr[j+1] = arr[j];\nj--;\n}\narr[j+1] = temp;\n}\n}\n// merge function merges the sorted runs\nvoid merge(int arr[], int l, int m, int r)\n{\n// original array is broken in two parts\n// left and right array\nint len1 = m - l + 1, len2 = r - m;\nint left[len1], right[len2];\nfor (int i = 0; i < len1; i++)\nleft[i] = arr[l + i];\nfor (int i = 0; i < len2; i++)\nright[i] = arr[m + 1 + i];\nint i = 0;\nint j = 0;\nint k = l;\n// after comparing, we merge those two array\n// in larger sub array\nwhile (i < len1 && j < len2)\n{\nif (left[i] <= right[j])\n{\narr[k] = left[i];\ni++;\n}\nelse\n{\narr[k] = right[j];\nj++;\n}\nk++;\n}\n// copy remaining elements of left, if any\nwhile (i < len1)\n{\narr[k] = left[i];\nk++;\ni++;\n}\n// copy remaining element of right, if any\nwhile (j < len2)\n{\narr[k] = right[j];\nk++;\nj++;\n}\n}\nvoid timSort(int arr[], int n)\n{\n// Sort individual subarrays of size RUN\nfor (int i = 0; i < n; i+=RUN)\n{\ninsertionSort(arr, i, min((i+31), (n-1)));\n}\n// start merging from size RUN (or 32). It will merge\n// to form size 64, then 128, 256 and so on ....\nfor (int size = RUN; size < n; size = 2*size)\n{\n// pick starting point of left sub array. We\n// are going to merge arr[left..left+size-1]\n// and arr[left+size, left+2*size-1]\n// After every merge, we increase left by 2*size\nfor (int left = 0; left < n; left += 2*size)\n{\n// find ending point of left sub array\n// mid+1 is starting point of right sub array\nint mid = left + size - 1;\nint right = min((left + 2*size - 1), (n-1));\n// merge sub array arr[left.....mid] &\n// arr[mid+1....right]\nmerge(arr, left, mid, right);\n}\n}\n}\nint main()\n{\nint arr[] = {5, 21, 7, 23, 19};\nint n = sizeof(arr)/sizeof(arr);\ncout<<\"Given Array is\\n\";\nfor (int i = 0; i < n; i++)\ncout<<arr[i]<<\" \";\ncout<<\"\\n\";\ntimSort(arr, n);\ncout<<\"After Sorting Array is\\n\";\nfor (int i = 0; i < n; i++)\ncout<<arr[i]<<\" \";\ncout<<\"\\n\";\nreturn 0;\n}\n``````\n\n### Java\n\n``````\nclass TimSort\n{\nstatic int RUN = 32;\n// this function sorts array from left index to\n// right index which is of size atmost RUN\npublic static void insertionSort(int[] arr, int left, int right)\n{\nfor (int i = left + 1; i <= right; i++)\n{\nint temp = arr[i];\nint j = i - 1;\nwhile (j >= left && arr[j] > temp)\n{\narr[j + 1] = arr[j];\nj--;\n}\narr[j + 1] = temp;\n}\n}\n// merge function merges the sorted runs\npublic static void merge(int[] arr, int l, int m, int r)\n{\n// original array is broken in two parts\n// left and right array\nint len1 = m - l + 1, len2 = r - m;\nint[] left = new int[len1];\nint[] right = new int[len2];\nfor (int x = 0; x < len1; x++)\n{\nleft[x] = arr[l + x];\n}\nfor (int x = 0; x < len2; x++)\n{\nright[x] = arr[m + 1 + x];\n}\nint i = 0;\nint j = 0;\nint k = l;\n// after comparing, we merge those two array\n// in larger sub array\nwhile (i < len1 && j < len2)\n{\nif (left[i] <= right[j])\n{\narr[k] = left[i];\ni++;\n}\nelse\n{\narr[k] = right[j];\nj++;\n}\nk++;\n}\n// copy remaining elements of left, if any\nwhile (i < len1)\n{\narr[k] = left[i];\nk++;\ni++;\n}\n// copy remaining element of right, if any\nwhile (j < len2)\n{\narr[k] = right[j];\nk++;\nj++;\n}\n}\n// iterative Timsort function to sort the\n// array[0...n-1] (similar to merge sort)\npublic static void timSort(int[] arr, int n)\n{\n// Sort individual subarrays of size RUN\nfor (int i = 0; i < n; i += RUN)\n{\ninsertionSort(arr, i, Math.min((i + 31), (n - 1)));\n}\n// start merging from size RUN (or 32). It will merge\n// to form size 64, then 128, 256 and so on ....\nfor (int size = RUN; size < n; size = 2 * size)\n{\n// pick starting point of left sub array. We\n// are going to merge arr[left..left+size-1]\n// and arr[left+size, left+2*size-1]\n// After every merge, we increase left by 2*size\nfor (int left = 0; left < n; left += 2 * size)\n{\n// find ending point of left sub array\n// mid+1 is starting point of right sub array\nint mid = left + size - 1;\nint right = Math.min((left + 2 * size - 1), (n - 1));\n// merge sub array arr[left.....mid] &\n// arr[mid+1....right]\nmerge(arr, left, mid, right);\n}\n}\n}\npublic static void main(String[] args)\n{\nint[] arr = {5, 21, 7, 23, 19};\nint n = arr.length;\nSystem.out.print(\"Given Array is\\n\");\nfor (int i = 0; i < n; i++)\n{\nSystem.out.print(arr[i] + \" \");\n}\nSystem.out.print(\"\\n\");\ntimSort(arr, n);\nSystem.out.print(\"After Sorting Array is\\n\");\nfor (int i = 0; i < n; i++)\n{\nSystem.out.print(arr[i] + \" \");\n}\nSystem.out.print(\"\\n\");\n}\n}\n``````\n\n### Python3\n\n``````\nRUN=32\n# This function sorts array from left index to\n# right index which is of size atmost RUN\ndef insertionSort(arr, left, right):\nfor i in range(left + 1, right+1):\ntemp = arr[i]\nj = i - 1\nwhile j <= left and arr[j] < temp :\narr[j+1] = arr[j]\nj -= 1\narr[j+1] = temp\n# merge function merges the sorted runs\ndef merge(arr, l, m, r):\n# original array is broken in two parts\n# left and right array\nlen1, len2 = m - l + 1, r - m\nleft, right = [], []\nfor i in range(0, len1):\nleft.append(arr[l + i])\nfor i in range(0, len2):\nright.append(arr[m + 1 + i])\ni, j, k = 0, 0, l\n# after comparing, we merge those two array\n# in larger sub array\nwhile i < len1 and j < len2:\nif left[i] <= right[j]:\narr[k] = left[i]\ni += 1\nelse:\narr[k] = right[j]\nj += 1\nk += 1\n# copy remaining elements of left, if any\nwhile i < len1:\narr[k] = left[i]\nk += 1\ni += 1\n# copy remaining element of right, if any\nwhile j < len2:\narr[k] = right[j]\nk += 1\nj += 1\n# iterative Timsort function to sort the\n# array[0...n-1] (similar to merge sort)\ndef timSort(arr, n):\n# Sort individual subarrays of size RUN\nfor i in range(0, n, RUN):\ninsertionSort(arr, i, min((i+31), (n-1)))\n# start merging from size RUN (or 32). It will merge\n# to form size 64, then 128, 256 and so on ....\nsize = RUN\nwhile size < n:\n# pick starting point of left sub array. We\n# are going to merge arr[left..left+size-1]\n# and arr[left+size, left+2*size-1]\n# After every merge, we increase left by 2*size\nfor left in range(0, n, 2*size):\n# find ending point of left sub array\n# mid+1 is starting point of right sub array\nmid = left + size - 1\nright = min((left + 2*size - 1), (n-1))\n# merge sub array arr[left.....mid] &\n# arr[mid+1....right]\nmerge(arr, left, mid, right)\nsize = 2*size\nif __name__ == \"__main__\":\narr = [5, 21, 7, 23, 19]\nn = len(arr)\nprint(\"Given Array is\")\nfor i in range(0, n):\nprint(arr[i], end = \" \")\nprint()\ntimSort(arr, n)\nprint(\"After Sorting Array is\")\nfor i in range(0, n):\nprint(arr[i], end = \" \")\nprint()\n``````\n\n### Applications\n\nApplications of Insertion Sort are as follows:\n\n• Tim Sort is powerful. It is fast and stable, but perhaps most importantly it takes advantage of real world patterns and utilizes them to build a final product.\n• Tim Sort is used as the default sorting algorithm in Java’s Arrays.sort() method, Python’s sorted() and sort() methods, the Android Platform, and in GNU Octave.\n• When the input is already sorted, Tim Sort runs in linear time, meaning that it is an adaptive sorting algorithm.\n\n## Question\n\n#### What is the best case time complexity of Tim sort?\n\nO(n)\nO(n log n)\nO(n2)\nO(log n)\nBest case time complexity of Tim sort occurs when the input array is already sorted. In such a case only one run will be required.\n\nWith this article at OpenGenus, you must have the complete idea of Tim Sort. Enjoy." ]
[ null, "https://iq.opengenus.org/assets/images/internship.svg", null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.7113027,"math_prob":0.9976825,"size":14260,"snap":"2022-27-2022-33","text_gpt3_token_len":4506,"char_repetition_ratio":0.12542087,"word_repetition_ratio":0.44923407,"special_character_ratio":0.37145862,"punctuation_ratio":0.17530252,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.99895996,"pos_list":[0,1,2],"im_url_duplicate_count":[null,null,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2022-07-03T15:10:24Z\",\"WARC-Record-ID\":\"<urn:uuid:1c2aa617-db82-443c-bedd-b229e13d0f4b>\",\"Content-Length\":\"75731\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:abd30975-423e-41e0-8f2f-9f2a24cd0f72>\",\"WARC-Concurrent-To\":\"<urn:uuid:d1240704-0c94-4bd4-b266-ba8094074744>\",\"WARC-IP-Address\":\"159.89.134.55\",\"WARC-Target-URI\":\"https://iq.opengenus.org/tim-sort/\",\"WARC-Payload-Digest\":\"sha1:QVEOEKLKFHUWAIZDI3SFDNPWKMTK34KC\",\"WARC-Block-Digest\":\"sha1:FOGAWGMERPB5RGKFTDFASPOAJNCITATL\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2022/CC-MAIN-2022-27/CC-MAIN-2022-27_segments_1656104244535.68_warc_CC-MAIN-20220703134535-20220703164535-00145.warc.gz\"}"}
https://cs.stackexchange.com/questions/62634/implement-k-means-clustering-with-map-reduce
[ "# Implement K-means clustering with Map-Reduce\n\nRecently in an interview I was asked to implement k-means clustering using the Map Reduce architecture. I know how to implement a simple k-means clustering algorithm but couldn't wrap my head around to do it using Map Reduce(I know what Map Reduce is). Can someone provide me an explanation/algorithm of how to do that? More specifically I am looking what Map and Reduce phases will look like for such an implementation? I was also asked how many Mappers and Reducers will I need?\n\n• Since MapReduces is less a concept and more a library, this seems to be a programming question, which is offtopic here. Please clarify which conceptual issues you're facing. – Raphael Aug 16 '16 at 9:38\n• @Raphael - map / reduce is a concept - it's implemented in a number of frameworks and fitting a given algorithm into that mindset is a completely algorithmic problem. – nbubis Aug 16 '16 at 12:31\n• @nbubis Some people disagree. – Raphael Aug 16 '16 at 15:43\n\nYou can run a loop over $j\\in\\{1..k\\}$:\n1. Create a map that maps each point $x_i$ to itself if $x_i$ is nearest to the mean $m_j$, and to the zero vector otherwise: $$x_i \\rightarrow \\begin{cases}(x_i, 1) & d(x_i, m_j) \\le d(x_i, m_l),\\ l\\neq j \\\\ (0,0) & \\text{otherwise} \\end{cases}$$\n2. In the reduce stage, you would find the sums and counts: $$(x_{i1}, c_1), (x_{i2}, c_2)\\rightarrow(x_{i1}+x_{i2}, c_1+c_2)$$ You then divide the resulting sum by the total count.\nThus, for each iteration in the k-means algorithm you will need $k$ maps and $k$ reduces." ]
[ null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.9094643,"math_prob":0.9790028,"size":1579,"snap":"2020-45-2020-50","text_gpt3_token_len":449,"char_repetition_ratio":0.10095238,"word_repetition_ratio":0.023076924,"special_character_ratio":0.28879037,"punctuation_ratio":0.10576923,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.99677885,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2020-10-31T07:06:34Z\",\"WARC-Record-ID\":\"<urn:uuid:b4a1ba2e-332f-4695-8ff0-fca9c559175f>\",\"Content-Length\":\"149071\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:e51cc414-b8ba-400f-b8f0-994986e2101c>\",\"WARC-Concurrent-To\":\"<urn:uuid:23964337-5513-4fc6-8fdc-37146c3ed186>\",\"WARC-IP-Address\":\"151.101.1.69\",\"WARC-Target-URI\":\"https://cs.stackexchange.com/questions/62634/implement-k-means-clustering-with-map-reduce\",\"WARC-Payload-Digest\":\"sha1:7GEGV5V2OMYT4KDF7JGGI53VAPRGWATK\",\"WARC-Block-Digest\":\"sha1:PBRQEQKSAC6GJIGZT37PY4D6PSF73PUY\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2020/CC-MAIN-2020-45/CC-MAIN-2020-45_segments_1603107916776.80_warc_CC-MAIN-20201031062721-20201031092721-00361.warc.gz\"}"}
https://www.colorhexa.com/22bad7
[ "# #22bad7 Color Information\n\nIn a RGB color space, hex #22bad7 is composed of 13.3% red, 72.9% green and 84.3% blue. Whereas in a CMYK color space, it is composed of 84.2% cyan, 13.5% magenta, 0% yellow and 15.7% black. It has a hue angle of 189.6 degrees, a saturation of 72.7% and a lightness of 48.8%. #22bad7 color hex could be obtained by blending #44ffff with #0075af. Closest websafe color is: #33cccc.\n\n• R 13\n• G 73\n• B 84\nRGB color chart\n• C 84\n• M 13\n• Y 0\n• K 16\nCMYK color chart\n\n#22bad7 color description : Strong cyan.\n\n# #22bad7 Color Conversion\n\nThe hexadecimal color #22bad7 has RGB values of R:34, G:186, B:215 and CMYK values of C:0.84, M:0.13, Y:0, K:0.16. Its decimal value is 2276055.\n\nHex triplet RGB Decimal 22bad7 `#22bad7` 34, 186, 215 `rgb(34,186,215)` 13.3, 72.9, 84.3 `rgb(13.3%,72.9%,84.3%)` 84, 13, 0, 16 189.6°, 72.7, 48.8 `hsl(189.6,72.7%,48.8%)` 189.6°, 84.2, 84.3 33cccc `#33cccc`\nCIE-LAB 69.726, -27.267, -25.196 30.481, 40.361, 70.47 0.216, 0.286, 40.361 69.726, 37.126, 222.74 69.726, -48.898, -35.918 63.53, -25.537, -21.295 00100010, 10111010, 11010111\n\n# Color Schemes with #22bad7\n\n• #22bad7\n``#22bad7` `rgb(34,186,215)``\n• #d73f22\n``#d73f22` `rgb(215,63,34)``\nComplementary Color\n• #22d79a\n``#22d79a` `rgb(34,215,154)``\n• #22bad7\n``#22bad7` `rgb(34,186,215)``\n• #2260d7\n``#2260d7` `rgb(34,96,215)``\nAnalogous Color\n• #d79a22\n``#d79a22` `rgb(215,154,34)``\n• #22bad7\n``#22bad7` `rgb(34,186,215)``\n• #d72260\n``#d72260` `rgb(215,34,96)``\nSplit Complementary Color\n• #bad722\n``#bad722` `rgb(186,215,34)``\n• #22bad7\n``#22bad7` `rgb(34,186,215)``\n• #d722ba\n``#d722ba` `rgb(215,34,186)``\nTriadic Color\n• #22d73f\n``#22d73f` `rgb(34,215,63)``\n• #22bad7\n``#22bad7` `rgb(34,186,215)``\n• #d722ba\n``#d722ba` `rgb(215,34,186)``\n• #d73f22\n``#d73f22` `rgb(215,63,34)``\nTetradic Color\n• #188195\n``#188195` `rgb(24,129,149)``\n• #1b94ab\n``#1b94ab` `rgb(27,148,171)``\n• #1fa7c1\n``#1fa7c1` `rgb(31,167,193)``\n• #22bad7\n``#22bad7` `rgb(34,186,215)``\n• #34c3df\n``#34c3df` `rgb(52,195,223)``\n• #4acae2\n``#4acae2` `rgb(74,202,226)``\n• #60d0e6\n``#60d0e6` `rgb(96,208,230)``\nMonochromatic Color\n\n# Alternatives to #22bad7\n\nBelow, you can see some colors close to #22bad7. Having a set of related colors can be useful if you need an inspirational alternative to your original color choice.\n\n• #22d7c7\n``#22d7c7` `rgb(34,215,199)``\n• #22d7d6\n``#22d7d6` `rgb(34,215,214)``\n• #22c9d7\n``#22c9d7` `rgb(34,201,215)``\n• #22bad7\n``#22bad7` `rgb(34,186,215)``\n• #22abd7\n``#22abd7` `rgb(34,171,215)``\n• #229cd7\n``#229cd7` `rgb(34,156,215)``\n• #228dd7\n``#228dd7` `rgb(34,141,215)``\nSimilar Colors\n\n# #22bad7 Preview\n\nText with hexadecimal color #22bad7\n\nThis text has a font color of #22bad7.\n\n``<span style=\"color:#22bad7;\">Text here</span>``\n#22bad7 background color\n\nThis paragraph has a background color of #22bad7.\n\n``<p style=\"background-color:#22bad7;\">Content here</p>``\n#22bad7 border color\n\nThis element has a border color of #22bad7.\n\n``<div style=\"border:1px solid #22bad7;\">Content here</div>``\nCSS codes\n``.text {color:#22bad7;}``\n``.background {background-color:#22bad7;}``\n``.border {border:1px solid #22bad7;}``\n\n# Shades and Tints of #22bad7\n\nA shade is achieved by adding black to any pure hue, while a tint is created by mixing white to any pure color. In this example, #020a0c is the darkest color, while #fafdfe is the lightest one.\n\n• #020a0c\n``#020a0c` `rgb(2,10,12)``\n• #05191d\n``#05191d` `rgb(5,25,29)``\n• #07272e\n``#07272e` `rgb(7,39,46)``\n• #0a363f\n``#0a363f` `rgb(10,54,63)``\n• #0d4550\n``#0d4550` `rgb(13,69,80)``\n• #0f5360\n``#0f5360` `rgb(15,83,96)``\n• #126271\n``#126271` `rgb(18,98,113)``\n• #157182\n``#157182` `rgb(21,113,130)``\n• #177f93\n``#177f93` `rgb(23,127,147)``\n• #1a8ea4\n``#1a8ea4` `rgb(26,142,164)``\n• #1d9db5\n``#1d9db5` `rgb(29,157,181)``\n• #1fabc6\n``#1fabc6` `rgb(31,171,198)``\n• #22bad7\n``#22bad7` `rgb(34,186,215)``\nShade Color Variation\n• #2fc2de\n``#2fc2de` `rgb(47,194,222)``\n• #40c7e1\n``#40c7e1` `rgb(64,199,225)``\n• #50cce3\n``#50cce3` `rgb(80,204,227)``\n• #61d1e6\n``#61d1e6` `rgb(97,209,230)``\n• #72d6e9\n``#72d6e9` `rgb(114,214,233)``\n• #83dbeb\n``#83dbeb` `rgb(131,219,235)``\n• #94e0ee\n``#94e0ee` `rgb(148,224,238)``\n• #a5e5f1\n``#a5e5f1` `rgb(165,229,241)``\n• #b6eaf3\n``#b6eaf3` `rgb(182,234,243)``\n• #c7eff6\n``#c7eff6` `rgb(199,239,246)``\n• #d8f4f9\n``#d8f4f9` `rgb(216,244,249)``\n• #e9f9fc\n``#e9f9fc` `rgb(233,249,252)``\n• #fafdfe\n``#fafdfe` `rgb(250,253,254)``\nTint Color Variation\n\n# Tones of #22bad7\n\nA tone is produced by adding gray to any pure hue. In this case, #787f81 is the less saturated color, while #05cef4 is the most saturated one.\n\n• #787f81\n``#787f81` `rgb(120,127,129)``\n• #6f868a\n``#6f868a` `rgb(111,134,138)``\n• #658c94\n``#658c94` `rgb(101,140,148)``\n• #5b939e\n``#5b939e` `rgb(91,147,158)``\n• #5299a7\n``#5299a7` `rgb(82,153,167)``\n• #48a0b1\n``#48a0b1` `rgb(72,160,177)``\n• #3fa6ba\n``#3fa6ba` `rgb(63,166,186)``\n• #35adc4\n``#35adc4` `rgb(53,173,196)``\n• #2cb3cd\n``#2cb3cd` `rgb(44,179,205)``\n• #22bad7\n``#22bad7` `rgb(34,186,215)``\n• #18c1e1\n``#18c1e1` `rgb(24,193,225)``\n• #0fc7ea\n``#0fc7ea` `rgb(15,199,234)``\n• #05cef4\n``#05cef4` `rgb(5,206,244)``\nTone Color Variation\n\n# Color Blindness Simulator\n\nBelow, you can see how #22bad7 is perceived by people affected by a color vision deficiency. This can be useful if you need to ensure your color combinations are accessible to color-blind users.\n\nMonochromacy\n• Achromatopsia 0.005% of the population\n• Atypical Achromatopsia 0.001% of the population\nDichromacy\n• Protanopia 1% of men\n• Deuteranopia 1% of men\n• Tritanopia 0.001% of the population\nTrichromacy\n• Protanomaly 1% of men, 0.01% of women\n• Deuteranomaly 6% of men, 0.4% of women\n• Tritanomaly 0.01% of the population" ]
[ null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.54647994,"math_prob":0.57159555,"size":3718,"snap":"2019-13-2019-22","text_gpt3_token_len":1661,"char_repetition_ratio":0.12197092,"word_repetition_ratio":0.011111111,"special_character_ratio":0.54330283,"punctuation_ratio":0.23809524,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.97821176,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2019-05-19T13:26:32Z\",\"WARC-Record-ID\":\"<urn:uuid:5a41c5bf-f954-4452-97b5-7744a0f7fae5>\",\"Content-Length\":\"36454\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:e99d260d-7a41-4372-8723-6bf9716609f9>\",\"WARC-Concurrent-To\":\"<urn:uuid:bff2c5c9-f2fe-4464-b322-3a8956558419>\",\"WARC-IP-Address\":\"178.32.117.56\",\"WARC-Target-URI\":\"https://www.colorhexa.com/22bad7\",\"WARC-Payload-Digest\":\"sha1:EL67A4TKPYEZXERQLYKOQRVYIFPDNV4Z\",\"WARC-Block-Digest\":\"sha1:2OIPDRW4NAGHVKBKXPSHPZAR5GSG5HCU\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2019/CC-MAIN-2019-22/CC-MAIN-2019-22_segments_1558232254882.18_warc_CC-MAIN-20190519121502-20190519143502-00524.warc.gz\"}"}
https://iwant2study.org/ospsg/index.php/interactive-resources/physics/02-newtonian-mechanics/01-kinematics/1092-ejs-trajectory-of-free-fall-with-different-initial-speed-applet-by-fu-kwun-hwang
[ "This is a simulation for three particles with different initial velocity ($$vy_1=v, vy_2=0,vy3=-v$$) under the same gravity $$g=10m/s^2$$\n\nYou can drag the initial position of particles as well as initial velocity (drag the tip of velocity arrow--red)\n\nThe number of frames per second can be adjusted with a slider. (initial value is fps=5, fps=200 is real time case)\n\n[text]" ]
[ null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.6879508,"math_prob":0.9988428,"size":519,"snap":"2021-31-2021-39","text_gpt3_token_len":131,"char_repetition_ratio":0.11456311,"word_repetition_ratio":0.0,"special_character_ratio":0.238921,"punctuation_ratio":0.07608695,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.99819654,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2021-09-27T19:17:38Z\",\"WARC-Record-ID\":\"<urn:uuid:c4b73696-2d13-4ae4-858d-584701370895>\",\"Content-Length\":\"126768\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:30b7ec32-a868-421a-900d-7263e43a58c2>\",\"WARC-Concurrent-To\":\"<urn:uuid:742d7128-6231-4cbd-98fd-fbc4f279d7af>\",\"WARC-IP-Address\":\"203.175.162.102\",\"WARC-Target-URI\":\"https://iwant2study.org/ospsg/index.php/interactive-resources/physics/02-newtonian-mechanics/01-kinematics/1092-ejs-trajectory-of-free-fall-with-different-initial-speed-applet-by-fu-kwun-hwang\",\"WARC-Payload-Digest\":\"sha1:N6QWXNNLCHMWMUHBCVHJDIOO6WRNGWG6\",\"WARC-Block-Digest\":\"sha1:CKZFJK3QI3ZZOCMRY6UTODQUWGGDKS37\",\"WARC-Identified-Payload-Type\":\"application/xhtml+xml\",\"warc_filename\":\"/cc_download/warc_2021/CC-MAIN-2021-39/CC-MAIN-2021-39_segments_1631780058467.95_warc_CC-MAIN-20210927181724-20210927211724-00103.warc.gz\"}"}
http://philaphans.com/furniture-uae-vvusi/b149d2-distance-quiz-questions-and-answers
[ "Countries & Their Features – Geography Quiz . the center of the earth, and (67,6000,000. , 62,728,916) the center of the moon. (Type an ordered pair. Joe and Janna leave home at the same time, traveling in opposite directions. The speed of the... Find the point which is equidistant from the points (1, 1), (2, 3), and (-2, 2). As with every test, there are recommended strategies and techniques for approaching the questions. Find the area of that triangle. Describe how we calculate time period of a simple pendulum. If you are not sure about the answer then you can check the answer using Show Answer button. Find the equation of the set of all points P such that the difference of distances \\left | PF_1 \\right | = \\lef... Find the shortest distance d_{min} from the point P(3, 4) to the straight line segment joining the points A(-4, 1) and B(2, -2). Four hours later, a second ship leaves harbor and sails east at at 10 knots. Skip to content. This page is on the topic \"Time, Speed and Distance\". You final answer shou... A smooth cube of mass m and edge length r slides with speed v on a horizontal surface with negligible friction. Half an hour later an interceptor plane flying with a speed of 800 mi/h is dispatched. The return trip takes 4 hours going downstream. What is the corresponding physics equation? What is the actual distance represented by the following scale distance if the scale is 1 centimeter = 1 kilometer? 20 m c. 40 m d. 80 m, Find the distance d(A, B) between points A and B. Oh no! Stefan is bicycling on a bike trail at an average of 10 mph. Determine the distance between these points. How long will it take for the submarines to be 1550 km apart? Answer as a fraction. Find a formula for the distance from the point P(x, y, z) to the a. x-axis. Given below are Different types of speed, time and distance Questions & formulas used to solve them, followed by the illustrations for better understanding of the underlying concepts: Rate Us. An object in free fall travels a distance s that is directly proportional to the square of the time t. If an object falls 1088 feet in 8 seconds, how far will it fall in 10 seconds? The system of mathematics used for, among other things, surveying and indirect measurements is ______. A parallelogram has the vertices (-1,2),(4,4),(2,-1), and (-3,-3). Direction & Distance Quiz: Part 1 ... Whatsapp; Published on Thursday, July 20, 2017 By - Insiya. Question 10. Here is a latest Time and Distance Aptitude Online Test which is useful for upcoming Bank exam. do not round your answers. R(0, 5), S(12, 3), Find the distance between each pair of points. If a = (-2, -4) and b = (-8, 4), what is the length of ab? Questions cover identifying points and finding the distance between two given points. Find the time based on the information given. The points (-3, -1) and (9,4) are endpoints of the diameter of a circle. Find the distance d between u = (3,3,6) and v = (-3,3,0). You will have to read all the given answers and click over the correct answer. A motorboat takes 5 hrs to travel 150 km going upstream. Point A is located at (1, 5), and point A' is located at (-2, 1). Played 5 times. Find the point on the curve y=\\sqrt{x} that is closest to the point (3,0). Find the point if it is 5 units from (-2, 2). Question 1 . Question 12: What year did EastEnders … (-2,-7) (0,0) (1,-2) (-1,1) Show transcribed image text Find the point on the curve y = x2 closest to the... Austin is driving to Philadelphia. How far does the runner travel? Which two word unit is commonly used as a billing unit for energy delivered to consumers by electric utilities? Consider the triangle ABC in the plane where A = (-11,2) B = (-4,-6) C = (-44,-41). A parallelogram has the vertices (0,3),(3,0),(0,-3), and (-3,0). How far did Hal drive? Evaluate the expression for the magnitude of displacement of a particle moving in a circle of radius 'a' with constant angular speed 'w' varies with time 't'. If the woman wants to go directly across the river and she paddles... A plane travels for 3 hours at 300 Km/hr in the direction of S 42 ^{circ} W . A. Can't find the question you're looking for? How many miles did he still have to go? Determine the distance between two points (-3, 11) and (4, -15). Two planes fly in opposite directions one travels 525 mi/h and the other 475 mi/h. Distance and Displacement DRAFT. What is the speed of the stream? Find the coordinates of the point P=(x_0,y_0) on the graph f(x) = x^2-4x+6 that is closest to the point (1,2). If you don’t know how to play multiple trivia questions and answers game with your friends or family then don’t worry check below. How many kilometers will cyclist travel in 15 minutes? Find the distance traveled in 30 seconds by an object traveling at a velocity of v(t) = 20 + 5cos(t) feet per second. What is the rate of the boat in still water and what is the rate of the current? Answer: Prudential World Cup. Which old unit of length, first an ancient Celtic unit, was the distance a person could walk in about one hour? Our editorial is always independent ( learn more ) What is the length of the line with slope \\frac{1}{2} from a point (4,2) to the y-axis? How far would it move in 3600 s? Find the distance of the point (3, 6) from the line through (-8, -3) which points in the direction of -10 i + 1 j. 2 \\sqrt{2} B. 103. Find the distance \\overline{CD} rounded to the nearest tenth. What is the minimum distance from the origin? Answer: Swaziland. It travels 175miles along its new course. Distance Questions and Answers Test your understanding with practice problems and step-by-step solutions. Aptitude Questions and Answers with Solutions: Learn & practice latest Aptitude Questions and Answers with Solutions for each topic. (3, 5). Find the length between a pair of points. y = 7x + 5 and (-8,-1) 2) Find the distance between the lines. Express the answe... Find all the points having an x-coordinate of 9 whose distance from the point (3, -2) is 10. How to draw a point that is equidistant from three points? Their rates were 25 and 35 miles per hour respectively. Which point on the curve y = \\sqrt{ x + 2} is closest to the origin? Eliza can roller blade 8.2 per hour. After two hours the shortest distance between them is 100 km. A girl delivering newspapers travels 2 blocks west, 4 blocks north, then 3 blocks east. Two ships depart from a port P(20, 10). 10th grade . What is the total distance she traveled? The point(s) is(are) [{Blank}]. Determine the distance between these points. The quiz below is designed to help you understand just how much you understood about distance and displacement and the factors that affect just how far an object will move. A: 6.81 units B: 6.48 units C: 5.40 units D: 7.40 units. Find the distance between the points (-1,2) and (3,4). Find the distance between the points (5, 3, -2) and (0, 0, 0). To determine the number of meters within a distance measured in kilometers, you need to ____ by what number? (Question 4 is a lowercase L). If it lands d = 39.5 meters from the bottom, how high (in m) was the building? A car with good tire tread can stop in less distance than a car with poor tread. Find the point on the line 2x+4y+1=0 which is closest to the point (4,3). How far is the cruise ship from its initial position? A taxi leaves the station X for station Y every 10 \\ min. The winner of a 500 mile race drove his car to victory at a rate of 142.3831 mph. C. 53. A ship at sea is due into a port 340 km due south in two days. L(10, 14), M(-8, 14). What is the speed of the wind? Two cars leave from the origin, one goes north at 45 mph and the other goes south at 70 mph. The point on the line -10x + 7y + 7 = 0 which is closest to the point (5 ,-3) has x coodinate and y coordinate. Find the distance d(P1, P2) between the given points P1 and P2. Determine whether the given vertices form an acute triangle, obtuse triangle, or a right triangle and explain your answer. What is the distance between P(12, 11) and Q(5, 1)? A. Consider given two points X,Y let's say [5,10] and [20,30]. Determine whether the points lie on a straight line. Find x. A 10-ft diagonal brace on a bridge connects a support of the center of the bridge to a side support on the bridge. D(0, -5, 5), E(1, -2, 4), F(3, 4, 2). Find the dimensions and area of the square. If Haley travels at 17 mph and Adrianna travels at 13 mph, how long will it be until they meet? Find the point on the y-axis that is equidistant from the point A(-4, -2) and B(3, 1). Q. At noon, a ship leaves a harbor and sails south at 10 knots. Consider the function f(x) = 2x + 5. Is it an isosceles triangle? Speed Distance Time Test. It is known that the y-coordinate of the other endpoint is 9. How many feet will the car travel 15 in seconds? What are the possible numbers of laps he will run today? For the points, P and Q, find the distance d(P, Q). A large collection of geography quiz questions and their correct answers that includes places from all over the world. If a meter is slightly larger than a yardstick, then 1 kilometer is a little longer than ____ feet. An object is dropped and takes 4.5 seconds to hit the ground. 5 centimeters = ___ kilometers, What is the actual distance represented by the following scale distance if the scale is 1 centimeter = 5 kilometers? B. Simultaneously, a taxi also leaves the station Y for station X every 10 \\ min. (a) Write the formula for a function d(x) that describes the distance between the point P and a point (x, y) on the line. Her character is on a quest to vanquish an evil sorcerer in a castle surrounded by cannons. The distance between two points is 66. 3) What was the official name of the first World Cup? It takes Henry 8 hours longer to paint one room than it does Sally. If you are not sure about the answer then you can check the answer using Show Answer button. Round to... Find the distance between the points (1,-7) and (4,2). A motorboat takes 5 hrs to travel 150 mi going upstream. Point C: (7, -4) Point D (-8, -5). A farmer wants to fence off his four-sided plot of flat land. Our Pub Quiz Questions and Answers are popular in the UK, the United States of America, Australia and other countries across the world where our family friendly quizzes are being used in pubs and bars to create the perfect night of entertainment. How far apart are they (to the nearest mile) after 4 hou... Oleg ran 8.8 miles in 1 hour 20 minutes. Hannah's house is at (-5, -5). 1.6 centimeters = ___ kilometers, What is the actual distance represented by the following scale distance if the scale is 1 centimeter = 1 kilometer? (Round your answers to three decimal places.). To play this quiz, please finish editing it. What is the distance between (6, 5) and (1, 7)? What was his time (to the nearest thousandth of an hour)? 1. 35 Geography questions and answers for your home pub quiz We may earn commission from links on this page. This Mock Test Is Good To Practice The Questions Of Physics Quiz That Are As The Same Pattern Main Exam .Candidates Are Required To Practice Hard To Score Well In The Physics Quiz. Moving at the same speed, how many kilometers would you cover in 2 hours? Height and Distance - Learn and practice Height and Distance with solved Aptitude Questions and Answers accompanied by easy explanation, shortcuts and tricks that help in understanding the concept clearly. Solved examples with detailed answer description, explanation are given and it would be easy to understand. In how many hours will they be 510 miles apart? Determine the distance between A(-1, 2, 3) and B(4, -5, 6) to the nearest tenth. (Round your answer to one decimal place.). We have provided Motion and Measurement of Distances Class 6 Science MCQs Questions with Answers to help students understand the concept very well. So let us try Time Speed and Distance MCQ to test your performance and capability. Share: 19 shares. How to find points on a curve closest to a point? a. I've done just that: Match the SI unit to the symbol for the quantity it measures. Related: HOME . A cyclist rides at a rate of 20 mph for 45 min. Show that (- 3, 1) and (3, - 1) and (1, 3) are the vertices of an isosceles triangle. Her dog runs ahead, at twice the speed, reaches the campground, and turns a... What is the radius of a sphere with its center at the origin and contains the point (2,3,4)? Find the distance from (3, 7, -5) to the xy-plane. The x-coordinate of point B is -2. What is the rate of the boat in still water and what is the rate of the current? A biker travels 5 feet in 0.5 seconds. P_1 = (-1, 3)\\\\ P_2 = (5, 1), Find the distance d(P_1, P_2) between the given points P_1 and P_2. Home; General Knowledge; Personality; Sports; Movies; 80 Geography Quiz Questions . Trivia question #2: Name the number that is three more than one-fifth of one-tenth of one-half of 5,000. Suppose a car travels at a constant speed of 12.0 m/s. The Earth and Moon are separated by about 4.0 x 106 m. Suppose Mars is 2.9 x 1011 m from Earth and forms a right triangle with Earth and the Moon. 18 m b. The ball lands at a position that is 30 yards from the same sideline and 65 yards from the same... Show that the points A (7, 10), B (-2, 5), C (3, -4) are the vertices of a right angled triangle. Answer: Pressure. to a rover on the Mart surface, how long will you have to wait before you rec... Two towns A and B are connected by regular bus service with a bus leaving in either direction every T minutes. Find the y-coordinates of the points that are 5 units away from the point (3, 3) that have an x-coordinate of -1. Also check- Quiz questions uk / Christmas quiz questions Free quiz questions… More with flashcards, games, and more with flashcards, games and. = 0 that is equidistant from three points floor at 10 knots drive on a level ground the! Actual distance represented by the following pairs of points given below: \\displaystyle { 1 it s... Waves ( a ) how many miles can she run in 63 minutes CD! Turns a total 156 miles certain corner of a barrier 35.0, m ahead two boys are! Take off at the back of a segment with endpoints at ( 8,12 ) that includes from..., conversions which require multiplication can be made by moving the ______ to east... Over the world was 380 miles is selected as the moon 40 miles hour... The person is driving along a road at speed of the Milky way is light-years. Were prepared based on information that can be found at Physics: speed and distance quiz online Test is! Character is on the curve y = x2 closest to the east of N at a constant velocity 18... For 5 hr than it does Sally accurate as possible will help you drive. Points: ( 2,7,3 ) and ( 8, -12 ) from any point on the x-axis which is to... Answers Updated 2017 – 2018 Part 9 blows it 160 km due south at 45 mph and John ) light... Quiz community of angle AB where a ( finite ) paraboloid of diameter 12 inches depth... Then turns right and travels 15 kms and time Class 7 Extra Questions Short answer Type below MCQ. To think about the answer distance quiz questions and answers you can all find Aptitude Questions have been put practice!, conversions which require multiplication can be adapted to suit your requirements for taking some the. Ordinate of the plane travel in a rectangular coordinate system free download for different Exams or recruitment tests get... Aptitude page elevator all the given Answers and click over the world the topic time, and... Blocks west, 4 ) 156 m. C. 17... find the point x,1. Many heads has a linear function of distance quiz questions and answers trip points N ( 5,2 ) and ( 7,7?... Heads due north at 45 mph and John a tortoise compete in a canoe starts on the segments... 2:00 pm, how far west and B quirky Questions as a subtopic of Aptitude Questions have been put practice... With Answers were prepared based on the line segments AB and CD are congruent the vertices the... 29 mph, while Brent drives due east at a rate of 15 kilometers per hour and 300 against., 7 ) is ( are ) [ { blank } ] he still have to go 441 going. { CD } rounded to the a. x-axis traveling 150 mph faster than the other plane a position is. 10, -3 ), ( 3,0 ) Denmark have adopted a national flag the cyclist in... ( P1, P2 ) between the following scale distance if the sun, compared to the.... At 95.0, km/h suddenly sees the lights of a barrier 35.0, m ( 6, -2 ) points..., y ) is 5 units prepared based on the line y 3x. M. C. 17... find the distance formula to see if the sun, compared the... Race drove his car to victory at a speed of 57 mph for 8 hr numbers in the morning the... Do not slip, how many minutes does it take for sunlight to travel from the point (,! Is directly proportional to the coordinate grid of a 500 mile race drove car. Car traveling at 42 km/h wheel on a circular track of length, first an ancient unit... 22 seconds by an object falls 16 feet in 1 hour 20.! 400 times further away from another point cm by the following scale distance if the of! Are endpoints of one side of a map Jeff 's house is at ( -5, -3.. Fully understand what is the distance between each pair of points: P1 = ( 4 2021. Q and R is located at ( -2, -1 ) ( -5, -5 ) to their start two... \\Displaystyle { 1 days he rides the elevator all the given points P1 and P2 away from another?. Level ground, the distance between the points ( -2,1 ) and B ( -2/3 -1... Are often asked in the Quantitative Aptitude Henry can paint one room than it does Sally 30 later. Feel free to print these fun, no-cost quizzes for more trivia and facts... Seconds ) for light from this article Jeff and Hannah 's house located... Update your browser = 9x - 1 ) given the following sets of points on the line segment.! A meter is slightly larger than a yardstick, then turns right and the... Depart from a point is two-fifths of its ordinate of 6 from P ( 12 6. Is 40 nautical miles apart 20 mph for 45 min and Jane are standing under a tree in the time! Is sqrt { 2 } but, as they walk away, it to... Distance = 0.052\\ m \\times Time^2 + 0.047\\ m/s^2... a submarine travelling at mph... ; Tweet ; Pin ; looking for some challenging Geography quiz Questions points given below: \\displaystyle { }... ( -2,9 ) and ( 4,0 ) time t of the fall drives... Original position using some force one can project just how far had find... The exact answer, using radicals as needed. ) in seconds for! Is 0.400 meter, 18 ), m ( 6, 16 and... \\ N ( 5,2 ) and K ( 7, -10 ) and ( 1 -7! Your understanding with practice problems and step-by-step solutions staircase going from the point P ( 6 -6. B ' certain aircraft can fly 612 miles with the wind and 300 miles against wind... Endpoint is 9 y ) is ( are ) [ { blank } ] 26 by. Moved per unit time at this exact speed, how long does it travel in 5 minutes { }. Take separate routes at 15 km/h and 17 km/h, how many miles can she in. Can your car can drive 28 miles on 6 gallons of gas to in... Grid of a ( 101,233.5,1856.2 ) ft determine the distance between ( -2,9 ) and ( -5,15 ) 89,403.5,1100.2! Point s located at ( 9, 13 ), and they walk away in different.... Olympic rings wheel make submarines start from the top distance quizzes destination ( in radians ) from. Mars 687 days to rotate around the sun to Earth carefully and choose the answer using Show answer button you. Linear distance traveled in 26 sec by an object from its original position using some force one project... 45 min 2.0 mm when it is known that the space between each pair points... Oleg ran 8.8 miles in 1 second, respectively, when will they be 400 miles per.!, then 1 kilometer B ' is known that the space between each pair of points given:... Rode into the country for 5 hours t of the boat in still water what. Car traveling at 42 km/h 0 ) good score in Bank PO, Bank Clerk other. Drove 132 miles on 1 gallon of gas common sense and General knowledge ; Personality ; Sports ; ;... Check the below NCERT MCQ Questions for Class 6 Science Chapter 10 motion time. Pdf free download 2,5 ) to the norm little longer than ____ feet and heads west We calculate period. G ( 0,0 ) \\ \\text { and } \\ m from the point P ( x 7! Clerk or other similar Examinations will run today high, the distance between the points ( -1,2 and. Is moving twice as far from the finish line as he was from the points ( -2, )! To convert centimeters to meters, move the decimal place ( s ) ____ to origin! For station x every 10 \\ min and as accurate as possible, what was rowing. Trivia and fun facts meters per second a sketch of the Milky way galaxy -3,4 \\\\... That satisfy the two equations: y = x2 closest to the point (,. ) and ( 1, one per octant, are each tangent to the origin improve... Way to work, you must _____ by what number a ship leaves harbor and sails east a... 28,13 ) ball from a point is two-fifths of its ordinate 3?... Point and ride in opposite directions one travels 525 mi/h and the other from north south! To victory at a rate of 20 feet per second x values that satisfy two. To roll down the ramp how to draw a point and ride in opposite one. Time^2 graph has a linear fit distance quiz questions and answers y = 5 - x^2 that is three more one-fifth... Cycled a distance of 1.80 cm by the left ventricle of the current the shape of circle. Point and a certain aircraft can fly 612 miles with the wind in the quiz 10 distance learning.... For any nonprofit purpose away, it begins to roll down the ramp the... Also switched on for a y value of 2, 2 ) point... Takes 4.5 seconds to hit the ground Joe biked 11 times as many miles your! The endpoints of one side of a micrometer moves a linear fit of y = \\sqrt { 3 } of... Their campsite by canoe and paddled downstream at an average rate of the circle traveled by a car of 1300\\! The rate of the diameter reflecting telescope has the shape of a barrier 35.0 m!" ]
[ null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.92136014,"math_prob":0.98613274,"size":21808,"snap":"2021-31-2021-39","text_gpt3_token_len":5629,"char_repetition_ratio":0.15689781,"word_repetition_ratio":0.07590041,"special_character_ratio":0.28801358,"punctuation_ratio":0.15538336,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.99236304,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2021-07-25T13:04:43Z\",\"WARC-Record-ID\":\"<urn:uuid:fb79a3b1-3d31-49e4-95a2-82f90c505259>\",\"Content-Length\":\"29464\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:9b2c6d11-4217-4a50-b4a8-4cff99f950ea>\",\"WARC-Concurrent-To\":\"<urn:uuid:b5d02e3f-aa87-4b67-a091-fbb0ea54eb6a>\",\"WARC-IP-Address\":\"70.35.194.99\",\"WARC-Target-URI\":\"http://philaphans.com/furniture-uae-vvusi/b149d2-distance-quiz-questions-and-answers\",\"WARC-Payload-Digest\":\"sha1:PL26GJK5UYAQDGTL3GCEY72WNK5D3GCB\",\"WARC-Block-Digest\":\"sha1:I2PYQOO6MAORQMR25NZWUN57CLN2Q7DU\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2021/CC-MAIN-2021-31/CC-MAIN-2021-31_segments_1627046151672.96_warc_CC-MAIN-20210725111913-20210725141913-00426.warc.gz\"}"}
https://se.mathworks.com/help/wavelet/ref/idddtree2.html
[ "# idddtree2\n\nInverse dual-tree and double-density 2-D wavelet transform\n\n## Syntax\n\n``xrec = idddtree2(wt)``\n\n## Description\n\nexample\n\n````xrec = idddtree2(wt)` returns the inverse wavelet transform of the 2-D decomposition (analysis filter bank), `wt`. `wt` is the output of `dddtree2`.```\n\n## Examples\n\ncollapse all\n\nDemonstrate perfect reconstruction of an image using a complex oriented dual-tree wavelet transform.\n\nLoad the image and obtain the complex oriented dual-tree wavelet transform down to level 5 using `dddtree2`. Reconstruct the image using `idddtree2` and demonstrate perfect reconstruction.\n\n```load woman; wt = dddtree2('cplxdt',X,5,'dtf2'); xrec = idddtree2(wt); max(max(abs(X-xrec)))```\n```ans = 7.3896e-12 ```\n\n## Input Arguments\n\ncollapse all\n\nWavelet transform, returned as a structure from `dddtree2` with these fields:\n\nType of wavelet decomposition (filter bank), specified as one of `'dwt'`, `'ddt'`, `'realdt'`, `'cplxdt'`, `'realdddt'`, or `'cplxdddt'`. `'dwt'` is the critically sampled DWT. `'ddt'` produces a double-density wavelet transform with one scaling and two wavelet filters for both row and column filtering. `'realdt'` and `'cplxdt'` produce oriented dual-tree wavelet transforms consisting of two and four separable wavelet transforms. `'realdddt'` and `'cplxdddt'` produce double-density dual-tree wavelet transforms consisting of two and four separable wavelet transforms.\n\nLevel of the wavelet decomposition, specified as a positive integer.\n\nDecomposition (analysis) and reconstruction (synthesis) filters, specified as a structure with these fields:\n\nFirst-stage analysis filters, specified as an N-by-2 or N-by-3 matrix for single-tree wavelet transforms, or a 1-by-2 cell array of two N-by-2 or N-by-3 matrices for dual-tree wavelet transforms. The matrices are N-by-3 for the double-density wavelet transforms. For an N-by-2 matrix, the first column of the matrix is the scaling (lowpass) filter and the second column is the wavelet (highpass) filter. For an N-by-3 matrix, the first column of the matrix is the scaling (lowpass) filter and the second and third columns are the wavelet (highpass) filters. For the dual-tree transforms, each element of the cell array contains the first-stage analysis filters for the corresponding tree.\n\nAnalysis filters for levels > 1, specified as an N-by-2 or N-by-3 matrix for single-tree wavelet transforms, or a 1-by-2 cell array of two N-by-2 or N-by-3 matrices for dual-tree wavelet transforms. The matrices are N-by-3 for the double-density wavelet transforms. For an N-by-2 matrix, the first column of the matrix is the scaling (lowpass) filter and the second column is the wavelet (highpass) filter. For an N-by-3 matrix, the first column of the matrix is the scaling (lowpass) filter and the second and third columns are the wavelet (highpass) filters. For the dual-tree transforms, each element of the cell array contains the analysis filters for the corresponding tree.\n\nFirst-level reconstruction filters, specified as an N-by-2 or N-by-3 matrix for single-tree wavelet transforms, or a 1-by-2 cell array of two N-by-2 or N-by-3 matrices for dual-tree wavelet transforms. The matrices are N-by-3 for the double-density wavelet transforms. For an N-by-2 matrix, the first column of the matrix is the scaling (lowpass) filter and the second column is the wavelet (highpass) filter. For an N-by-3 matrix, the first column of the matrix is the scaling (lowpass) filter and the second and third columns are the wavelet (highpass) filters. For the dual-tree transforms, each element of the cell array contains the first-stage synthesis filters for the corresponding tree.\n\nReconstruction filters for levels > 1, specified as an N-by-2 or N-by-3 matrix for single-tree wavelet transforms, or a 1-by-2 cell array of two N-by-2 or N-by-3 matrices for dual-tree wavelet transforms. The matrices are N-by-3 for the double-density wavelet transforms. For an N-by-2 matrix, the first column of the matrix is the scaling (lowpass) filter and the second column is the wavelet (highpass) filter. For an N-by-3 matrix, the first column of the matrix is the scaling (lowpass) filter and the second and third columns are the wavelet (highpass) filters. For the dual-tree transforms, each element of the cell array contains the first-stage analysis filters for the corresponding tree.\n\nWavelet transform coefficients, specified as a 1-by-(`level`+1) cell array of matrices. The size and structure of the matrix elements of the cell array depend on the type of wavelet transform as follows:\n\n• `'dwt'``cfs{j}(:,:,d)`\n\n• j = 1,2,... `level` is the level.\n\n• d = 1,2,3 is the orientation.\n\n• `cfs{level+1}(:,:)` are the lowpass, or scaling, coefficients.\n\n• `'ddt'``cfs{j}(:,:,d)`\n\n• j = 1,2,... `level` is the level.\n\n• d = 1,2,3,4,5,6,7,8 is the orientation.\n\n• `cfs{level+1}(:,:)` are the lowpass, or scaling, coefficients.\n\n• `'realddt'``cfs{j}(:,:,d,k)`\n\n• j = 1,2,... `level` is the level.\n\n• d = 1,2,3 is the orientation.\n\n• k = 1,2 is the wavelet transform tree.\n\n• `cfs{level+1}(:,:)` are the lowpass, or scaling, coefficients.\n\n• `'cplxdt'``cfs{j}(:,:,d,k,m)`\n\n• j = 1,2,... `level` is the level.\n\n• d = 1,2,3 is the orientation.\n\n• k = 1,2 is the wavelet transform tree.\n\n• m = 1,2 are the real and imaginary parts.\n\n• `cfs{level+1}(:,:)` are the lowpass, or scaling, coefficients..\n\n• `'realdddt'``cfs{j}(:,:,d,k)`\n\n• j = 1,2,... `level` is the level.\n\n• d = 1,2,3 is the orientation.\n\n• k = 1,2 is the wavelet transform tree.\n\n• `cfs{level+1}(:,:)` are the lowpass, or scaling, coefficients.\n\n• `'cplxdddt'``cfs{j}(:,:,d,k,m)`\n\n• j = 1,2,... `level` is the level.\n\n• d = 1,2,3 is the orientation.\n\n• k = 1,2 is the wavelet transform tree.\n\n• m = 1,2 are the real and imaginary parts.\n\n• `cfs{level+1}(:,:)` are the lowpass, or scaling, coefficients.\n\n## Output Arguments\n\ncollapse all\n\nSynthesized image, returned as a matrix.\n\nData Types: `double`\n\n## Version History\n\nIntroduced in R2013b" ]
[ null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.79247135,"math_prob":0.98661906,"size":6220,"snap":"2023-40-2023-50","text_gpt3_token_len":1680,"char_repetition_ratio":0.19337194,"word_repetition_ratio":0.61314654,"special_character_ratio":0.25305465,"punctuation_ratio":0.1654902,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.99833316,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2023-10-02T01:07:00Z\",\"WARC-Record-ID\":\"<urn:uuid:c4a087d7-79de-4323-b902-c6387786659c>\",\"Content-Length\":\"97411\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:e5e82034-0c3d-4d21-8e24-5625b7b344bc>\",\"WARC-Concurrent-To\":\"<urn:uuid:ba3ce59e-b9a1-4def-879d-55778b97a022>\",\"WARC-IP-Address\":\"23.34.160.82\",\"WARC-Target-URI\":\"https://se.mathworks.com/help/wavelet/ref/idddtree2.html\",\"WARC-Payload-Digest\":\"sha1:R5VZIKQY55FRL6MLSPFJXW7P3RR7I7VC\",\"WARC-Block-Digest\":\"sha1:UCEFLHRH45YRGN2XC3XMP7W7O3HG2RR7\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2023/CC-MAIN-2023-40/CC-MAIN-2023-40_segments_1695233510942.97_warc_CC-MAIN-20231002001302-20231002031302-00693.warc.gz\"}"}
https://stats.stackexchange.com/questions/298428/relation-between-mar-assumption-and-partially-observed-variables-affecting-missi
[ "# Relation between MAR assumption and partially observed variables affecting missing data\n\nUnder the MAR assumption, the probability of missing data is a function of the observed values in the data only, as commonly stated in literature. So for example, if you have 3 variables: X, Z, Y. If Z is missing, then MAR occurs if P(Z is missing) is a function of X and Y.\n\nHowever, suppose that X is missing also as commonly observed in the data, but P(Z is missing) remains a function of X and Y. Can we say that the data is MAR still? Technically, it seems that MAR will only be met if P(Z is missing) is a function of Y only (and not X) for the cases in which X is missing.\n\nIf such data with missing covariates are not MAR, are procedures like Multiple Imputation still able to consistently estimate the parameters? I assume so, but I am not clear on the theory.\n\nGoing out on a limb here, but I'd say the assumptions about missingness of a variable do not depend on the availability of values within the known variables. Instead, they depend on the proposed theoretical mechanism of missingness, and given enough additional and related variables in your dataset might be estimated based on the MAR assumption.\n\nwhat I mean is the following. Take your example, where you have X, Z, Y. Initially there's only missings in Z. If you assume MAR based on $P(Zmiss) = f(X,Y)$, then that's true regardless of $X$ or $Y$ being available for the rows with missing data.\n\nNow if you have missings in X as well, things do become more difficult. But do no fear! If the above MAR assumption is true, then what's also true is $P(Xmiss) = f(Z,Y)$ and $P(Ymiss) = f(X,Z)$. (this means you could use these variables to estimate missing values in both ways!)\n\nSo long $P(missingness)$ in $Z$ or $X$ is not dependent on the missingness of itself or the other (which would be some kind of difficult MNAR, which we assumed it isn't by stating we think it's MAR), imputation should handle this just fine.\n\nAnother thing which might be good to know about multiple imputation in this context is that multiple imputation functions (at least R's mice does this) often use strategies where your dataset is initially completed with random draws. Only after this, in the first iteration of imputation, the appropriate imputation models estimate replacement values based on the apparent associations within your data. The first random replacement draws are thus replaced by estimates based on the MAR assumption. Especially in the context of having more than one variable with missing values (where the imputation function has to start replacing missings for some variable), further iterations make sure the final estimates for all variables with missings are based on known data or data replaced by estimates (sounds weird I know), and end up close to the proper parameter space of the variables with missings.\n\nWhat this completion and iteration also solves, is the problem of rows with both $Z$ and $X$ missing: as all data is complete from the start (albeit random guesses in the first iteration), all rows can be used at all times/iterations.\n\n**Do note, the replacement estimates for specific rows where multiple values are missing, will very likely show more variation across final imputation sets than those where only a few or 1 variable was missing.\n\n• Thank you for the prompt reply. I am about to conclude that as long as missingness (or the missing data indicator) of a variable depends on any other variable's value other than itself (missing or not), then MI and in fact maximization of observed likelihood (?) will estimate parameters without missing data bias (in theory). – HRD27891 Aug 17 '17 at 16:33" ]
[ null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.92702615,"math_prob":0.97524256,"size":2459,"snap":"2020-24-2020-29","text_gpt3_token_len":523,"char_repetition_ratio":0.13808554,"word_repetition_ratio":0.004901961,"special_character_ratio":0.20780805,"punctuation_ratio":0.08695652,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9940758,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2020-06-03T07:19:00Z\",\"WARC-Record-ID\":\"<urn:uuid:f5e69aa0-6fb4-4ed3-82e3-48f220b8c385>\",\"Content-Length\":\"143604\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:3164309c-290f-4626-a524-31b9c58918e5>\",\"WARC-Concurrent-To\":\"<urn:uuid:97ccd415-348f-48b5-bb57-a09c8fa5431f>\",\"WARC-IP-Address\":\"151.101.193.69\",\"WARC-Target-URI\":\"https://stats.stackexchange.com/questions/298428/relation-between-mar-assumption-and-partially-observed-variables-affecting-missi\",\"WARC-Payload-Digest\":\"sha1:RYFOUNKHFOVYORAJVHRF54TCGH4E24JA\",\"WARC-Block-Digest\":\"sha1:PE4PFOXSS6C7LRVRTVOUVTAPWGES25WP\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2020/CC-MAIN-2020-24/CC-MAIN-2020-24_segments_1590347432237.67_warc_CC-MAIN-20200603050448-20200603080448-00104.warc.gz\"}"}
https://whatisconvert.com/117-pounds-in-short-tons
[ "# What is 117 Pounds in Short Tons?\n\n## Convert 117 Pounds to Short Tons\n\nTo calculate 117 Pounds to the corresponding value in Short Tons, multiply the quantity in Pounds by 0.0005 (conversion factor). In this case we should multiply 117 Pounds by 0.0005 to get the equivalent result in Short Tons:\n\n117 Pounds x 0.0005 = 0.0585 Short Tons\n\n117 Pounds is equivalent to 0.0585 Short Tons.\n\n## How to convert from Pounds to Short Tons\n\nThe conversion factor from Pounds to Short Tons is 0.0005. To find out how many Pounds in Short Tons, multiply by the conversion factor or use the Mass converter above. One hundred seventeen Pounds is equivalent to zero point zero five eight five Short Tons.\n\n## Definition of Pound\n\nThe pound or pound-mass (abbreviations: lb, lbm, lbm, ℔) is a unit of mass with several definitions. Nowadays, the most common is the international avoirdupois pound which is legally defined as exactly 0.45359237 kilograms. A pound is equal to 16 ounces.\n\n## Definition of Short ton\n\nThe short ton is a unit of weight equal to 2,000 pounds (907.18474 kg), that is most commonly used in the United States where it is known simply as the ton.\n\n## Using the Pounds to Short Tons converter you can get answers to questions like the following:\n\n• How many Short Tons are in 117 Pounds?\n• 117 Pounds is equal to how many Short Tons?\n• How to convert 117 Pounds to Short Tons?\n• How many is 117 Pounds in Short Tons?\n• What is 117 Pounds in Short Tons?\n• How much is 117 Pounds in Short Tons?\n• How many ton are in 117 lb?\n• 117 lb is equal to how many ton?\n• How to convert 117 lb to ton?\n• How many is 117 lb in ton?\n• What is 117 lb in ton?\n• How much is 117 lb in ton?" ]
[ null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.8987253,"math_prob":0.9664905,"size":1636,"snap":"2021-43-2021-49","text_gpt3_token_len":445,"char_repetition_ratio":0.21323529,"word_repetition_ratio":0.09415584,"special_character_ratio":0.2903423,"punctuation_ratio":0.11494253,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.99733424,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2021-10-24T17:53:56Z\",\"WARC-Record-ID\":\"<urn:uuid:08a85d13-a842-4d7d-8b1a-9c98b77729cb>\",\"Content-Length\":\"29804\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:3e1d2c2a-55e2-4fcd-9f2d-8bf26497512a>\",\"WARC-Concurrent-To\":\"<urn:uuid:5ff47158-a340-414d-8b59-b1b52a424dd5>\",\"WARC-IP-Address\":\"172.67.139.212\",\"WARC-Target-URI\":\"https://whatisconvert.com/117-pounds-in-short-tons\",\"WARC-Payload-Digest\":\"sha1:MDMIRGBXU4JCK5V5KVMROOINWL4F4YJI\",\"WARC-Block-Digest\":\"sha1:NTN2WXDHK5VEKHXVOOXEFJJVUB7PEIMF\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2021/CC-MAIN-2021-43/CC-MAIN-2021-43_segments_1634323587593.0_warc_CC-MAIN-20211024173743-20211024203743-00112.warc.gz\"}"}
https://chemistry.stackexchange.com/questions/104144/is-a-time-domain-spectrum-obtainable-from-a-frequency-domain-spectrum
[ "# Is a time domain spectrum obtainable from a frequency domain spectrum? [closed]\n\nI know for a fact that a frequency domain spectrum can be obtained from a time domain spectrum using a Fourier transform - but can you do the reverse?\n\nAlso what are the advantages and disadvantages of the frequency and time domain spectra?\n\nCan you do the reverse?\n\nYes, mathematically the Fourier transform can be reversed. If we define the spectrum $$S(\\omega)$$ as the Fourier transform of a time-domain signal $$f(t)$$,\n\n$$S(\\omega) = \\mathcal{F}[f(t)] = \\frac{1}{\\sqrt{2\\pi}}\\int_{-\\infty}^{\\infty}f(t)\\mathrm{e}^{-\\mathrm{i}\\omega t}\\,\\mathrm{d}t$$\n\nthen the inverse Fourier transform is simply given by\n\n$$f(t) = \\frac{1}{\\sqrt{2\\pi}}\\int_{-\\infty}^{\\infty}S(\\omega)\\mathrm{e}^{\\mathrm{i}\\omega t}\\,\\mathrm{d}\\omega$$\n\nWikipedia has a page on this which is rather technical, but any decent book on Fourier transforms should cover this, so a mathematics book targeted at physicists/chemists may be easier to digest.\n\nWhat are the advantages and disadvantages of the frequency and time domain spectra?\n\nThe time domain signal (in NMR, \"free induction decay\") is for the most part, not particularly useful. It is the Fourier transform which makes it valuable for chemists, because the frequencies that appear in the spectrum are related to transitions between different energy states:\n\n$$\\Delta E = \\hbar\\omega$$\n\nIn general, probing these energy levels is the main point of spectroscopy, regardless of what range of energies you are using.\n\n• I just like to add to @orthocresol's excellent answer that there might be situations in which you can extract time-domain information from a frequency spectrum. The lifetime of excited states is for instance inversely proportional to the linewidth of a spectral line (this follows from the FT). This principle can, for instance, be used in studies on chemical kinetics to probe very fast processes. – Paul Nov 12 '18 at 16:43" ]
[ null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.86397874,"math_prob":0.992695,"size":1867,"snap":"2021-04-2021-17","text_gpt3_token_len":442,"char_repetition_ratio":0.14117016,"word_repetition_ratio":0.3043478,"special_character_ratio":0.23085164,"punctuation_ratio":0.07826087,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.99823064,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2021-01-23T05:24:15Z\",\"WARC-Record-ID\":\"<urn:uuid:c5473a9a-8d73-4c80-b157-0b44472480d6>\",\"Content-Length\":\"127901\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:8bcacaf1-63a1-4127-907f-e7b71bbfc551>\",\"WARC-Concurrent-To\":\"<urn:uuid:836d91ea-fa9d-4adb-96a8-bee790d8bbb2>\",\"WARC-IP-Address\":\"151.101.1.69\",\"WARC-Target-URI\":\"https://chemistry.stackexchange.com/questions/104144/is-a-time-domain-spectrum-obtainable-from-a-frequency-domain-spectrum\",\"WARC-Payload-Digest\":\"sha1:XRYO3KM6DNWIXPSZ3XOGLXKRIKB44ZWE\",\"WARC-Block-Digest\":\"sha1:5XGBLRYHZGDPDBUN6HBYEYO2UUD5RJFN\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2021/CC-MAIN-2021-04/CC-MAIN-2021-04_segments_1610703533863.67_warc_CC-MAIN-20210123032629-20210123062629-00062.warc.gz\"}"}
https://socratic.org/questions/what-is-the-square-root-of-20-times-the-square-root-of-5
[ "# What is the square root of 20 times the square root of 5?\n\nSep 12, 2015\n\n10.\n\n#### Explanation:\n\nThe rule for multiplying square roots is that $\\sqrt{a} \\cdot \\sqrt{b} = \\sqrt{a b}$\nIt's important to clarify that because it can be confusing if you don't understand that radical multiplication is just like normal multiplication. Anyway, all we have to do now is apply this property:\n\n$\\sqrt{20} \\cdot \\sqrt{5} = \\sqrt{20 \\cdot 5} = \\sqrt{100} = 10$\n\nFinal Answer" ]
[ null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.8557419,"math_prob":0.9981105,"size":484,"snap":"2021-21-2021-25","text_gpt3_token_len":107,"char_repetition_ratio":0.11875,"word_repetition_ratio":0.0,"special_character_ratio":0.22107439,"punctuation_ratio":0.07777778,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9997868,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2021-06-22T02:11:41Z\",\"WARC-Record-ID\":\"<urn:uuid:e9e0091b-989b-409e-b7d1-530d80a3a8a3>\",\"Content-Length\":\"32881\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:f739fef4-59dc-43ed-9850-2bb1e955fa67>\",\"WARC-Concurrent-To\":\"<urn:uuid:b0707a21-1308-4a7e-b0cb-844b043a7fb7>\",\"WARC-IP-Address\":\"216.239.32.21\",\"WARC-Target-URI\":\"https://socratic.org/questions/what-is-the-square-root-of-20-times-the-square-root-of-5\",\"WARC-Payload-Digest\":\"sha1:QQ4E4PDHTF3FZQW5VDWIGPHGXNLFMC7W\",\"WARC-Block-Digest\":\"sha1:FMCQQS2BK65YRL3UH3EF5S7NKRD46K6I\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2021/CC-MAIN-2021-25/CC-MAIN-2021-25_segments_1623488504969.64_warc_CC-MAIN-20210622002655-20210622032655-00154.warc.gz\"}"}
https://crypto.stackexchange.com/questions/12384/attacks-against-el-gamal-private-key/12390
[ "# Attacks against El Gamal private key\n\nEl Gamal encryption involves picking $(p,g,b)$ which is our public key. We compute $b=a^x$ $mod$ $p$. Here, $x$ is the private key which we don't know.\n\nWhat are some efficient and strong algorithms today used to finding this $x$?\n\nI am currently dealing with numbers such as $b=42-60$ digits long and $p=30-50$. So $b$ is anywhere between 42 and 60 digits.\n\nDoes anyone know of any program and some attacks to finding this $x$ using our given information?\n\n• The separate limits you give on $b$ and $p$ don't make a great deal of sense. For one, $b < p$, and so if you never have a $p$ more than 50 digits, you'll also never have a $b$ more than 50 digits either. In addition, $b$ acts as a random value between 2 and $p-2$; hence if $p$ is 50 digits, then at least 90% of the time, $b$ will be 49 or 50 digits. – poncho Dec 17 '13 at 5:07\n• No, your right about that. I was simply saying how the digits varied for $b,p$. I can see how one would misinterpret that. – user3092043 Dec 17 '13 at 5:39\n\n## 2 Answers\n\nBeing new to cryptography is one thing, but you are supposed to do some research on your own before asking questions here (see How to Ask), and D.W. gave you the right directions already.\n\nBut since you wanted names and links:\n\n• The first stop should be discrete logarithm on Wikipedia, and it lists several algorithms on this topic.\n• As a beginner, start with Babystep-Giantstep and Pohlig-Hellman.\n• Your next stop should be Index Calculus.\n• Additionally, there are algorithms based on the NFS, e.g. described in Gordon's paper Discrete Logarithms in GF(p) Using the Number Field Sieve. Current records modulo primes employ this technique.\n• Your right, that was a stupid thing to comment about. I just got super frustrated because I was not able to find any efficient algorithms on my own. I did try implementing Pohlig-Hellman-Silver on Maple and it wasn't cracking. I also tried Babystep-Giantstep and that was not working either. Just though I was missing something. But I am not asking a question without trying it on my own first. – user3092043 Dec 17 '13 at 14:10\n• Well, that's no wonder, tbh. Babystep-Giantstep takes $O(\\sqrt{n})$ time and space. Your values are just too large to do this on a normal computer: Even if your $p$ just has 30 (decimal) digits, this is approximately $2^{100}$. I don't think you have $2^{50} \\cdot (50+150)$ bit of memory (around 21 petabyte), do you? Memory required: for each value up to $\\sqrt{n}$, save the value and the according group element. – tylo Dec 17 '13 at 14:40\n• Concerning Pohlig-Hellman, this only works on certain groups (when $p-1$ is smooth and you know its factorization). But all of this is listed in those Wikipedia articles, and checking if your implementation works correctly should be done with small test values. – tylo Dec 17 '13 at 14:51\n• I have. They all work with smaller cases. But it is the big ones that is my problem. And I am working with a computer that is not super and does not even come close to having 21 PB of memory, although that does sound good right now. I want to try implementing the Index Calculus algorithm. Do you by any change know any Maple code for that because this is the one I am having hard time coding? – user3092043 Dec 17 '13 at 14:58\n• Sorry, but I never worked with Maple at all. And I am not sure that it's even possible to get the required performance in Maple for these kind of numbers. Besides, reference requests are usually off-topic. – tylo Dec 17 '13 at 16:20\n\nYes. Use any algorithm for solving the discrete log problem. This is well-studied; do a search on \"discrete log\" problem and you will find lots of information, both on this site and on Wikipedia (eg this list)." ]
[ null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.9251368,"math_prob":0.94009525,"size":453,"snap":"2021-21-2021-25","text_gpt3_token_len":121,"char_repetition_ratio":0.093541205,"word_repetition_ratio":0.0,"special_character_ratio":0.2825607,"punctuation_ratio":0.104166664,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.98589253,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2021-06-14T00:24:12Z\",\"WARC-Record-ID\":\"<urn:uuid:f38bb033-c08e-48e7-aa88-d3bce7a58895>\",\"Content-Length\":\"185113\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:c69a3aca-147f-4c7f-baea-8e1955b76544>\",\"WARC-Concurrent-To\":\"<urn:uuid:629b6ddb-7843-4b1c-8507-70db0933a5d0>\",\"WARC-IP-Address\":\"151.101.129.69\",\"WARC-Target-URI\":\"https://crypto.stackexchange.com/questions/12384/attacks-against-el-gamal-private-key/12390\",\"WARC-Payload-Digest\":\"sha1:35BYKFFYO6KXMBDR7QTK3OLH2UEUT7IA\",\"WARC-Block-Digest\":\"sha1:ASIJHEYL5GL3EQSLO66DEY7XXVUXK2L4\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2021/CC-MAIN-2021-25/CC-MAIN-2021-25_segments_1623487611089.19_warc_CC-MAIN-20210613222907-20210614012907-00249.warc.gz\"}"}
https://courses.lumenlearning.com/wmopen-microeconomics/chapter/learning-outcomes/
[ "## Learning Outcomes", null, "The content, assignments, and assessments for this course are aligned to the following learning outcomes. A full list of course learning outcomes can be viewed here: Microeconomics Course Learning Outcomes.\n\n## Module 1: Economic Thinking\n\n• Explain what economics is and explain why it is important\n• Use mathematics in common economic applications\n• Use graphs in common economic applications\n\n## Module 2: Choice in a World of Scarcity\n\n• Explain the cost of choices and trade-offs\n• Illustrate society’s trade-offs by using a production possibilities frontier, or curve\n• Explain the assumption of rationality by individuals and firms\n\n## Module 3: Supply and Demand\n\n• Describe and differentiate between major economic systems\n• Explain the determinants of demand\n• Explain the determinants of supply\n• Explain and graphically illustrate market equilibrium, surplus and shortage\n\n## Module 4: Applications of Supply and Demand\n\n• Analyze the economic effect of government setting price ceilings and floors\n• Define, calculate, and illustrate consumer, producer, and total surplus\n• Examine ways that supply and demand apply to labor and financial markets\n\n## Module 5: Elasticity\n\n• Explain the concept of elasticity\n• Explain the price elasticity of demand and price elasticity of supply, and compute both using the midpoint method\n• Explain and calculate other elasticities using common economic variables\n• Explain the relationship between a firm’s price elasticity of demand and total revenue\n\n## Module 6: Utility\n\n• Describe the concept of utility and explain how consumers spend in order to maximize utility\n• Explain how consumer utility changes when income or prices change\n• Find consumer equilibrium using indifference curves and a budget constraint\n• Describe the behavioral economics approach to understanding decision making\n\n## Module 7: Production and Costs\n\n• Explain production and the production function\n• Calculate, graph and understand production costs in the short run\n• Examine production choices in the long run\n\n## Module 8: Perfect Competition\n\n• Describe the characteristics of perfect competition and calculate costs, including fixed, variable, average, marginal, and total costs\n• Analyze a firm’s profit margin\n• Describe how perfectly competitive markets adjust to long run equilibrium\n\n## Module 9: Monopoly\n\n• Describe characteristics of monopolies\n• Calculate and graph a monopoly’s costs, revenues, profit and losses\n• Analyze strategies used to control monopolies\n\n## Module 10: Monopolistically Competition and Oligopoly\n\n• Describe the characteristics of a monopolistically competitive industry\n• Calculate and graph a firm’s fixed, variable, average, marginal and total costs in monopolistic competition\n• Describe characteristics of oligopolies\n\n## Module 11: Public Goods\n\n• Define and give examples of public goods and externalities\n• Define and give examples of positive and negative externalities\n• Analyze the efficacy of government policies to lessen negative externalities\n• Analyze how the government promotes positive externalities\n\n## Module 12: Labor Markets\n\n• Analyze labor markets and how supply and demand interact to determine the market wage rate\n• Explain how wages are determined when employers or employees hold labor market power\n• Analyze the economic implications of discrimination and immigration policies\n\n## Module 13: Income Distribution\n\n• Explain poverty and the poverty trap\n• Analyze and measure economic inequality\n\n## Module 14: Globalization and Trade\n\n• Define and calculate comparative advantage, and understand how countries choose which goods and services to trade internationally\n• Explain how barriers to trade (like tariffs, quotas and non-tariff barriers) affect businesses, consumers and workers in the economy\n• Differentiate between alternative international trade regimes and how they impact global trade\n\n## Module 15: Exchange Rates and International Finance\n\n• Define currency exchange rates and explain how they influence trade balances\n• Analyze how supply and demand affects foreign currencies and exchange rates\n• Explain how the balance of trade (surplus or deficit) affects the domestic economy" ]
[ null, "https://s3-us-west-2.amazonaws.com/courses-images/wp-content/uploads/sites/2042/2018/05/29140556/outcomes.jpg", null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.8078145,"math_prob":0.74132365,"size":4120,"snap":"2020-34-2020-40","text_gpt3_token_len":804,"char_repetition_ratio":0.14188533,"word_repetition_ratio":0.016393442,"special_character_ratio":0.17839806,"punctuation_ratio":0.06666667,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.96673864,"pos_list":[0,1,2],"im_url_duplicate_count":[null,6,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2020-08-12T15:31:58Z\",\"WARC-Record-ID\":\"<urn:uuid:500ab6d0-5dcf-407a-840f-c0b6e511569a>\",\"Content-Length\":\"29488\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:3a09ea91-a563-407a-92a5-7144361908b0>\",\"WARC-Concurrent-To\":\"<urn:uuid:e7df41f2-ba1e-4356-a65e-fbe80848f823>\",\"WARC-IP-Address\":\"23.185.0.1\",\"WARC-Target-URI\":\"https://courses.lumenlearning.com/wmopen-microeconomics/chapter/learning-outcomes/\",\"WARC-Payload-Digest\":\"sha1:3XAI6JOGLTKTWRE4KQPWL2N3H66CUETF\",\"WARC-Block-Digest\":\"sha1:SYUVESNMDI4FUWVZVR2NN22UP4VCXS22\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2020/CC-MAIN-2020-34/CC-MAIN-2020-34_segments_1596439738905.62_warc_CC-MAIN-20200812141756-20200812171756-00576.warc.gz\"}"}
http://www.apanugujarat.com/2020/01/download-photomath-application-for.html
[ "## January 21, 2020\n\nLearn how to solve math problems, check homework assignments and study for upcoming exams and ACTs/SATs with the world’s most used math learning resource. Over 100+ million downloads, and billions of problems solved every month! Photomath is FREE and works without wi-fi.\n\n### HOW  WORKS Photomath Application\n\nInstantly scan printed text AND handwritten math problems using your device’s camera or type and edit equations with our scientific calculator. Photomath breaks down every math problem into simple, easy-to-understand steps so you can really understand core concepts and can answer things confidently.", null, "### KEY FEATURES Of Photomath Applciation\n\n• Scan textbook (print) AND handwritten problems\n• Scientific calculator\n• Step-by-step explanations for every solution\n• Multiple solving methods\n• No internet connection required to use\n• 30+ languages supported\n• Interactive graphs\n\n#### MATH TOPICS Of Photomath Apps\n\n• Basic Math/Pre-Algebra: arithmetic, integers, fractions, decimal numbers, powers, roots, factors\n• Algebra: linear equations/inequalities, quadratic equations, systems of equations, logarithms, functions, matrices, graphing, polynomials\n• Trigonometry/Precalculus: identities, conic sections, vectors, matrices, complex numbers, sequences and series, logarithmic functions\n• Calculus: limits, derivatives, integrals, curve sketching\n• Statistics: combinations, factorials\n\n### Solve Math Problems with PhotoMath Camera Calculator\n\nOur in-house team of veteran math educators also partner with teachers worldwide to ensure we’re utilizing the most effective, contemporary teacher methodologies in our math engines.\n\n“PhotoMath currently supports basic arithmetics, fractions, decimal numbers, linear equations and several functions like logarithms. New math is constantly added in new app releases,” says the description of the PhotoMath app on iTunes. The PhotoMath app uses optical character recognition (OCR) technology to read the equation and calculates the answers within seconds. There is a red frame in the PhotoMath app that you have to use to capture the equation.\n\nFeatured in Huffington Post, Forbes, TIME, CNN, EdSurge, Guiding Tech, The Verge, TechCrunch and more.\n\nSuggestions, comments or questions? Email us at [email protected]", null, "Photomath is and will always be free to use, but you can boost your learning by upgrading to Photomath Plus. Photomath Plus provides solutions to full textbooks and problem sets with word problems! Currently restricted to the US and specific textbooks only.\n\n### Photomath App provides:\n\n• Camera calculator\n• Handwriting recognition\n• Step-by-step instructions\n• Smart calculator\n• Graphs (NEW)\n\n### Photomath App supports:\n\n•  Operations with: Integers, Fractions, Decimal numbers, Powers, Roots, Logarithms\n• Algebraic expressions\n•  Equations: Linear, Quadratic, Absolute value, Rational, Irrational, Logarithmic, Exponential, Trigonometric\n•  Inequalities: Linear, Quadratic, Absolute value, Rational, Irrational, Logarithmic, Exponential\n• Solving Systems using: Comparison, Substitution, Elimination, Gauss-Jordan method and Cramer’s Rule\n• Calculus: Derivatives, Integrals\n• Trigonometry: Converting Angles, Calculating trigonometric values, Finding Periods of trigonometric functions, Calculating with trigonometric expressions\n•  Graphs of Elementary Functions\n\nPhotomath is the ultimate educational tool for a smartphone or tablet. The core of Photomath is free for you to download. With over 100 million downloads, Photomath is one of the most popular educational apps of all times. Join students across the globe learning math effortlessly." ]
[ null, "https://1.bp.blogspot.com/-mmS730qB1SU/XY3tT-62tdI/AAAAAAAAHrM/FOM1j4OnzFYuY77Y38OuXFvVvbR5U2PLQCK4BGAYYCw/s400/Photomath-Apk.png", null, "https://4.bp.blogspot.com/-Yi_4fX9hNeo/XY3tUICc4tI/AAAAAAAAHrU/ZNsp0iyF_h0I8ga9GWzpT4Wp7fC5gtZYQCK4BGAYYCw/s400/images.jpg", null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.8368034,"math_prob":0.9112466,"size":4159,"snap":"2020-45-2020-50","text_gpt3_token_len":873,"char_repetition_ratio":0.122503005,"word_repetition_ratio":0.017391304,"special_character_ratio":0.18105313,"punctuation_ratio":0.15835777,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9897947,"pos_list":[0,1,2,3,4],"im_url_duplicate_count":[null,10,null,null,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2020-11-27T19:50:33Z\",\"WARC-Record-ID\":\"<urn:uuid:b01948dd-f3da-4dac-954f-3bfe76e4d8b9>\",\"Content-Length\":\"119832\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:f6209ff1-a6c9-4928-88f1-2dfae7c34dcc>\",\"WARC-Concurrent-To\":\"<urn:uuid:b38893f6-2b80-48c9-b2ca-a61837b6316a>\",\"WARC-IP-Address\":\"172.217.2.115\",\"WARC-Target-URI\":\"http://www.apanugujarat.com/2020/01/download-photomath-application-for.html\",\"WARC-Payload-Digest\":\"sha1:CGYXG3TOJBE5QER35MDKNBPBV4T4MXAS\",\"WARC-Block-Digest\":\"sha1:IGODB3QKO7UYDKZY7OALNOG3TGJVVS5I\",\"WARC-Identified-Payload-Type\":\"application/xhtml+xml\",\"warc_filename\":\"/cc_download/warc_2020/CC-MAIN-2020-50/CC-MAIN-2020-50_segments_1606141194171.48_warc_CC-MAIN-20201127191451-20201127221451-00061.warc.gz\"}"}
https://mathoverflow.net/questions/327551/ends-of-g-spaces-with-action-of-a-finitely-generated-group
[ "# Ends of G-spaces with action of a finitely generated group\n\nThis question is a development of my previous question.\n\nLet $$G$$ be a finitely generated group acting transitively on an infinite set $$X$$ so that for every $$g\\in G$$ and $$x\\in X$$ the $$g$$-orbit $$\\{g^nx:n\\in\\mathbb Z\\}$$ of $$x$$ is finite.\n\nLet $$S=S^{-1}$$ be a finite set of generators of $$G$$ and $$\\Gamma=(X,E)$$ be the \"Cayley\" graph of the action. In this graph a doubleton $$\\{x,y\\}\\subset X$$ is an edge of the graph $$\\Gamma$$ iff $$y\\in Sx$$.\n\nProblem. Has the graph $$\\Gamma$$ one end (which means that for any finite subset $$F\\subset X$$ the graph $$\\Gamma\\setminus F$$ has only one unbounded connected component)?\n\n• Note: a finitely generated group $G$ for which every infinite connected Schreier graph $G/H$ is 1-ended is said to have Property FW.\n– YCor\nApr 10, 2019 at 7:16\n\nNo, the Grigorchuk group, which is torsion, admits a 2-ended connected Schreier graph. See for instance http://www.math.tamu.edu/~yvorobet/Research/Schreier.pdf\n\nEdit: Here's a more elementary example, just assuming the bare existence of an infinite finitely generated torsion group, and also produces examples with bounded torsion, and examples with an infinite space of ends.\n\nLet $$\\Gamma,C$$ be any finitely generated groups (in a first reading, one can assume that $$\\Gamma$$ is 1-ended and that $$|C|=2$$). We consider the Schreier graph $$X$$ of the wreath product $$G=C\\wr\\Gamma=\\Gamma\\ltimes C^{(\\Gamma)}$$ with respect to the subgroup $$C^{(\\Gamma\\smallsetminus\\{1\\})}$$. We can view $$X$$ as the product $$\\Gamma\\times C$$, where $$\\Gamma$$ and $$C$$ act as $$g\\cdot (g',c')=(gg',c');\\quad c\\cdot (g',c')=(g',c') \\;(g\\neq 1)\\quad c\\cdot (1,c')=(1,cc').$$\n\nOne fixes finite generating subsets $$S_\\Gamma,S_C$$, so that $$S=S_\\Gamma\\cup S_C$$ generates the wreath product $$G$$.\n\nIf $$|C|=2$$, the Schreier graph $$X$$ can therefore be described as the disjoint union of two copies of the Cayley graph of $$G$$, joined by a single edge joining their basepoints. If $$G$$ is 1-ended, this is 2-ended.\n\nIn general ($$C$$ arbitrary) $$X$$ is obtained from the Cayley graph of $$C$$ by \"planting\" Cayley graphs of $$G$$ at each point.\n\nIn particular, say when $$C$$ has finitely many ends, the number of ends of $$X$$ is equal to $$|C|$$ times the number of ends of $$G$$. This can be chosen to be infinite, say when both $$C$$ and $$\\Gamma$$ are both infinite Burnside groups, in which case $$G$$ even has bounded torsion.\n\nIf $$\\Gamma,C$$ are both finitely-ended, the space of ends of $$X$$ is countable anyway: if $$C$$ is infinite with 1 or 2 ends, then this is just a 1-point or 2-point compactification of an infinite countable set.\n\nSo, when $$G$$ is torsion, the resulting space of ends we thus obtain are all finite set, and the 1-point compactification of an infinite countable set.\n\nIn general, this can also produce $$X$$ to have a space of ends that is uncountable with isolated points (e.g., when $$\\Gamma=\\mathbf{Z}$$ and $$C$$ is $$\\infty$$-ended).\n\n• I'm not sure that I know right now an example with infinitely many ends (countably or uncountably), although I tend to guess both exist.\n– YCor\nApr 9, 2019 at 9:46\n• Thank you for the quick answer. By the way, Vorobets is by origin from my native city Lviv and I even have 3 joint papers with him, see e.g. (arxiv.org/abs/0902.1556). Apr 9, 2019 at 9:53\n• For my purposes I need just 1 end actions (in this case I can connect some distant points by paths that miss a selected finited set). Apr 9, 2019 at 9:55\n• The above answers your questions anyway, I'm just mentioning that I don't know about some weakening. Concerning, I don't claim proper attribution so I lazily posted a link with a picture. Many people have studied the Schreier graph of branched groups on the boundary of the rooted tree.\n– YCor\nApr 9, 2019 at 10:00" ]
[ null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.8904561,"math_prob":0.9995974,"size":2088,"snap":"2022-05-2022-21","text_gpt3_token_len":614,"char_repetition_ratio":0.12763916,"word_repetition_ratio":0.024691358,"special_character_ratio":0.2801724,"punctuation_ratio":0.12984055,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":1.0000029,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2022-05-16T19:54:21Z\",\"WARC-Record-ID\":\"<urn:uuid:e4523eb8-4749-4fd5-a6cb-5a4ac052a408>\",\"Content-Length\":\"110760\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:2e6509db-0e19-440f-aa94-ba62be9b61d3>\",\"WARC-Concurrent-To\":\"<urn:uuid:62522b13-0d98-4751-85e8-47d945a0279d>\",\"WARC-IP-Address\":\"151.101.65.69\",\"WARC-Target-URI\":\"https://mathoverflow.net/questions/327551/ends-of-g-spaces-with-action-of-a-finitely-generated-group\",\"WARC-Payload-Digest\":\"sha1:BSEXZEKTXQEKC7KIUW4A7DWXMBNY3GSO\",\"WARC-Block-Digest\":\"sha1:73MZTOVDA53V7BK5EBQUYPKW37CZMJFE\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2022/CC-MAIN-2022-21/CC-MAIN-2022-21_segments_1652662512229.26_warc_CC-MAIN-20220516172745-20220516202745-00663.warc.gz\"}"}
https://www.calculus-online.com/exercise/5953
[ "# Calculating Limit of Function – A quotient of functions with a third root – Exercise 5953\n\n### Exercise\n\nEvaluate the following limit:\n\n$$\\lim _ { x \\rightarrow \\infty} \\frac{3-x}{x-\\sqrt{x}}$$\n\n$$\\lim _ { x \\rightarrow \\infty} \\frac{3-x}{x-\\sqrt{x}}=-1$$" ]
[ null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.7672074,"math_prob":0.99969983,"size":1345,"snap":"2023-40-2023-50","text_gpt3_token_len":318,"char_repetition_ratio":0.20954512,"word_repetition_ratio":0.34761906,"special_character_ratio":0.2639405,"punctuation_ratio":0.041284405,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.99960464,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2023-09-26T12:35:11Z\",\"WARC-Record-ID\":\"<urn:uuid:6964d1f9-f2ff-4300-90f2-90ad9bf3136c>\",\"Content-Length\":\"288689\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:d608829f-6cc8-4eb1-a89b-ac002688f7b2>\",\"WARC-Concurrent-To\":\"<urn:uuid:05f5c68e-1202-4cc8-8845-e75e9ed1bdfa>\",\"WARC-IP-Address\":\"143.42.195.251\",\"WARC-Target-URI\":\"https://www.calculus-online.com/exercise/5953\",\"WARC-Payload-Digest\":\"sha1:JRA3JUJOELFB56JTOXFKTSLMPPK3HIUN\",\"WARC-Block-Digest\":\"sha1:TPKHWFN7BQIC3QHFRLSUC7FNAVIYNDMW\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2023/CC-MAIN-2023-40/CC-MAIN-2023-40_segments_1695233510208.72_warc_CC-MAIN-20230926111439-20230926141439-00436.warc.gz\"}"}
https://google.github.io/tensorstore/python/api/tensorstore.DimExpression.mark_bounds_implicit.html
[ "tensorstore.DimExpression.mark_bounds_implicit[self, implicit: ]\n\nMarks the lower/upper bounds of the selected dimensions as implicit/explicit.\n\nFor a `TensorStore`, implicit bounds indicate resizeable dimensions. Marking a bound as explicit fixes it to its current value such that it won’t be adjusted by subsequent `TensorStore.resolve` calls if the stored bounds change.\n\nBecause implicit bounds do not constrain subsequent indexing/slicing operations, a bound may be marked implicit in order to expand the domain.\n\nWarning\n\nBe careful when marking bounds as implicit, since this may bypass intended constraints on the domain.\n\nExamples\n\n``````>>> s = await ts.open({\n... 'driver': 'zarr',\n... 'kvstore': 'memory://'\n... },\n... shape=[100, 200],\n... dtype=ts.uint32,\n... create=True)\n>>> s.domain\n{ [0, 100*), [0, 200*) }\n>>> await s.resize(exclusive_max=[200, 300])\n>>> (await s.resolve()).domain\n{ [0, 200*), [0, 300*) }\n>>> (await s[ts.d.mark_bounds_implicit[False]].resolve()).domain\n{ [0, 100), [0, 300*) }\n>>> s_subregion = s[20:30, 40:50]\n>>> s_subregion.domain\n{ [20, 30), [40, 50) }\n>>> (await\n... s_subregion[ts.d.mark_bounds_implicit[:True]].resolve()).domain\n{ [20, 200*), [40, 50) }\n``````\n``````>>> t = ts.IndexTransform(input_rank=3)\n>>> t = t[ts.d[0, 2].mark_bounds_implicit[False]]\n>>> t\nRank 3 -> 3 index space transform:\nInput domain:\n0: (-inf, +inf)\n1: (-inf*, +inf*)\n2: (-inf, +inf)\nOutput index maps:\nout = 0 + 1 * in\nout = 0 + 1 * in\nout = 0 + 1 * in\n>>> t = t[ts.d[0, 1].mark_bounds_implicit[:True]]\n>>> t\nRank 3 -> 3 index space transform:\nInput domain:\n0: (-inf, +inf*)\n1: (-inf*, +inf*)\n2: (-inf, +inf)\nOutput index maps:\nout = 0 + 1 * in\nout = 0 + 1 * in\nout = 0 + 1 * in\n>>> t = t[ts.d[1, 2].mark_bounds_implicit[True:False]]\n>>> t\nRank 3 -> 3 index space transform:\nInput domain:\n0: (-inf, +inf*)\n1: (-inf*, +inf)\n2: (-inf*, +inf)\nOutput index maps:\nout = 0 + 1 * in\nout = 0 + 1 * in\nout = 0 + 1 * in\n``````\n\nThe new dimension selection is the same as the prior dimension selection.\n\nParameters:\nimplicit:\n\nIndicates the new implicit value for the lower and upper bounds. Must be one of:\n\nReturns:\n\nDimension expression with bounds marked as implicit/explicit.\n\nRaises:\n\nIndexError – If the resultant domain would have an input dimension referenced by an index array marked as implicit." ]
[ null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.58741343,"math_prob":0.9920748,"size":2401,"snap":"2023-40-2023-50","text_gpt3_token_len":767,"char_repetition_ratio":0.14977054,"word_repetition_ratio":0.30238727,"special_character_ratio":0.3885881,"punctuation_ratio":0.24850895,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.98353183,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2023-12-01T13:40:00Z\",\"WARC-Record-ID\":\"<urn:uuid:712390ba-c2f0-4ee9-abff-342189ca81cc>\",\"Content-Length\":\"60320\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:9abd3743-d7d0-43bd-beb3-72801393f7f1>\",\"WARC-Concurrent-To\":\"<urn:uuid:99de0987-e177-4ec5-b9ee-0564c9a87042>\",\"WARC-IP-Address\":\"185.199.109.153\",\"WARC-Target-URI\":\"https://google.github.io/tensorstore/python/api/tensorstore.DimExpression.mark_bounds_implicit.html\",\"WARC-Payload-Digest\":\"sha1:ORAA7M3ZLQDWOIHCYFEJMX2CHEVSJSP5\",\"WARC-Block-Digest\":\"sha1:TMM76MI7NMG2UKVYNSKDVNMW75QH4LV2\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2023/CC-MAIN-2023-50/CC-MAIN-2023-50_segments_1700679100287.49_warc_CC-MAIN-20231201120231-20231201150231-00898.warc.gz\"}"}
https://www.colorhexa.com/01e9e2
[ "# #01e9e2 Color Information\n\nIn a RGB color space, hex #01e9e2 is composed of 0.4% red, 91.4% green and 88.6% blue. Whereas in a CMYK color space, it is composed of 99.6% cyan, 0% magenta, 3% yellow and 8.6% black. It has a hue angle of 178.2 degrees, a saturation of 99.1% and a lightness of 45.9%. #01e9e2 color hex could be obtained by blending #02ffff with #00d3c5. Closest websafe color is: #00ffcc.\n\n• R 0\n• G 91\n• B 89\nRGB color chart\n• C 100\n• M 0\n• Y 3\n• K 9\nCMYK color chart\n\n#01e9e2 color description : Vivid cyan.\n\n# #01e9e2 Color Conversion\n\nThe hexadecimal color #01e9e2 has RGB values of R:1, G:233, B:226 and CMYK values of C:1, M:0, Y:0.03, K:0.09. Its decimal value is 125410.\n\nHex triplet RGB Decimal 01e9e2 `#01e9e2` 1, 233, 226 `rgb(1,233,226)` 0.4, 91.4, 88.6 `rgb(0.4%,91.4%,88.6%)` 100, 0, 3, 9 178.2°, 99.1, 45.9 `hsl(178.2,99.1%,45.9%)` 178.2°, 99.6, 91.4 00ffcc `#00ffcc`\nCIE-LAB 83.846, -46.909, -9.811 42.874, 63.771, 81.997 0.227, 0.338, 63.771 83.846, 47.924, 191.813 83.846, -65.55, -8.175 79.857, -43.914, -4.979 00000001, 11101001, 11100010\n\n# Color Schemes with #01e9e2\n\n• #01e9e2\n``#01e9e2` `rgb(1,233,226)``\n• #e90108\n``#e90108` `rgb(233,1,8)``\nComplementary Color\n• #01e96e\n``#01e96e` `rgb(1,233,110)``\n• #01e9e2\n``#01e9e2` `rgb(1,233,226)``\n• #017ce9\n``#017ce9` `rgb(1,124,233)``\nAnalogous Color\n• #e96e01\n``#e96e01` `rgb(233,110,1)``\n• #01e9e2\n``#01e9e2` `rgb(1,233,226)``\n• #e9017c\n``#e9017c` `rgb(233,1,124)``\nSplit Complementary Color\n• #e9e201\n``#e9e201` `rgb(233,226,1)``\n• #01e9e2\n``#01e9e2` `rgb(1,233,226)``\n• #e201e9\n``#e201e9` `rgb(226,1,233)``\n• #08e901\n``#08e901` `rgb(8,233,1)``\n• #01e9e2\n``#01e9e2` `rgb(1,233,226)``\n• #e201e9\n``#e201e9` `rgb(226,1,233)``\n• #e90108\n``#e90108` `rgb(233,1,8)``\n• #019d98\n``#019d98` `rgb(1,157,152)``\n• #01b6b1\n``#01b6b1` `rgb(1,182,177)``\n• #01d0c9\n``#01d0c9` `rgb(1,208,201)``\n• #01e9e2\n``#01e9e2` `rgb(1,233,226)``\n• #06fef6\n``#06fef6` `rgb(6,254,246)``\n• #1ffef7\n``#1ffef7` `rgb(31,254,247)``\n• #38fef8\n``#38fef8` `rgb(56,254,248)``\nMonochromatic Color\n\n# Alternatives to #01e9e2\n\nBelow, you can see some colors close to #01e9e2. Having a set of related colors can be useful if you need an inspirational alternative to your original color choice.\n\n• #01e9a8\n``#01e9a8` `rgb(1,233,168)``\n• #01e9bb\n``#01e9bb` `rgb(1,233,187)``\n• #01e9cf\n``#01e9cf` `rgb(1,233,207)``\n• #01e9e2\n``#01e9e2` `rgb(1,233,226)``\n• #01dde9\n``#01dde9` `rgb(1,221,233)``\n• #01c9e9\n``#01c9e9` `rgb(1,201,233)``\n• #01b6e9\n``#01b6e9` `rgb(1,182,233)``\nSimilar Colors\n\n# #01e9e2 Preview\n\nThis text has a font color of #01e9e2.\n\n``<span style=\"color:#01e9e2;\">Text here</span>``\n#01e9e2 background color\n\nThis paragraph has a background color of #01e9e2.\n\n``<p style=\"background-color:#01e9e2;\">Content here</p>``\n#01e9e2 border color\n\nThis element has a border color of #01e9e2.\n\n``<div style=\"border:1px solid #01e9e2;\">Content here</div>``\nCSS codes\n``.text {color:#01e9e2;}``\n``.background {background-color:#01e9e2;}``\n``.border {border:1px solid #01e9e2;}``\n\n# Shades and Tints of #01e9e2\n\nA shade is achieved by adding black to any pure hue, while a tint is created by mixing white to any pure color. In this example, #001212 is the darkest color, while #feffff is the lightest one.\n\n• #001212\n``#001212` `rgb(0,18,18)``\n• #002625\n``#002625` `rgb(0,38,37)``\n• #003937\n``#003937` `rgb(0,57,55)``\n• #004d4a\n``#004d4a` `rgb(0,77,74)``\n• #00605d\n``#00605d` `rgb(0,96,93)``\n• #007470\n``#007470` `rgb(0,116,112)``\n• #018783\n``#018783` `rgb(1,135,131)``\n• #019b96\n``#019b96` `rgb(1,155,150)``\n• #01aea9\n``#01aea9` `rgb(1,174,169)``\n• #01c2bc\n``#01c2bc` `rgb(1,194,188)``\n• #01d5cf\n``#01d5cf` `rgb(1,213,207)``\n• #01e9e2\n``#01e9e2` `rgb(1,233,226)``\n• #01fdf5\n``#01fdf5` `rgb(1,253,245)``\n• #13fef7\n``#13fef7` `rgb(19,254,247)``\n• #27fef8\n``#27fef8` `rgb(39,254,248)``\n• #3afef8\n``#3afef8` `rgb(58,254,248)``\n• #4efef9\n``#4efef9` `rgb(78,254,249)``\n• #61fefa\n``#61fefa` `rgb(97,254,250)``\n• #75fefa\n``#75fefa` `rgb(117,254,250)``\n• #88fefb\n``#88fefb` `rgb(136,254,251)``\n• #9cfffc\n``#9cfffc` `rgb(156,255,252)``\n• #affffc\n``#affffc` `rgb(175,255,252)``\n• #c3fffd\n``#c3fffd` `rgb(195,255,253)``\n• #d7fffe\n``#d7fffe` `rgb(215,255,254)``\n• #eafffe\n``#eafffe` `rgb(234,255,254)``\n• #feffff\n``#feffff` `rgb(254,255,255)``\nTint Color Variation\n\n# Tones of #01e9e2\n\nA tone is produced by adding gray to any pure hue. In this case, #6d7d7d is the less saturated color, while #01e9e2 is the most saturated one.\n\n• #6d7d7d\n``#6d7d7d` `rgb(109,125,125)``\n• #648685\n``#648685` `rgb(100,134,133)``\n• #5b8f8d\n``#5b8f8d` `rgb(91,143,141)``\n• #529896\n``#529896` `rgb(82,152,150)``\n• #49a19e\n``#49a19e` `rgb(73,161,158)``\n• #40aaa7\n``#40aaa7` `rgb(64,170,167)``\n• #37b3af\n``#37b3af` `rgb(55,179,175)``\n• #2ebcb8\n``#2ebcb8` `rgb(46,188,184)``\n• #25c5c0\n``#25c5c0` `rgb(37,197,192)``\n• #1ccec9\n``#1ccec9` `rgb(28,206,201)``\n• #13d7d1\n``#13d7d1` `rgb(19,215,209)``\n• #0ae0da\n``#0ae0da` `rgb(10,224,218)``\n• #01e9e2\n``#01e9e2` `rgb(1,233,226)``\nTone Color Variation\n\n# Color Blindness Simulator\n\nBelow, you can see how #01e9e2 is perceived by people affected by a color vision deficiency. This can be useful if you need to ensure your color combinations are accessible to color-blind users.\n\nMonochromacy\n• Achromatopsia 0.005% of the population\n• Atypical Achromatopsia 0.001% of the population\nDichromacy\n• Protanopia 1% of men\n• Deuteranopia 1% of men\n• Tritanopia 0.001% of the population\nTrichromacy\n• Protanomaly 1% of men, 0.01% of women\n• Deuteranomaly 6% of men, 0.4% of women\n• Tritanomaly 0.01% of the population" ]
[ null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.5364039,"math_prob":0.67478836,"size":3690,"snap":"2022-40-2023-06","text_gpt3_token_len":1703,"char_repetition_ratio":0.13130765,"word_repetition_ratio":0.0074074073,"special_character_ratio":0.5409214,"punctuation_ratio":0.23692992,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9865649,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2023-02-02T20:52:35Z\",\"WARC-Record-ID\":\"<urn:uuid:fd69121d-28e2-4666-a32d-7e7be58aac08>\",\"Content-Length\":\"36146\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:83e8ae64-417a-4650-ba81-7b0c801ed087>\",\"WARC-Concurrent-To\":\"<urn:uuid:869f8761-394a-46fa-83b4-79de441da9ea>\",\"WARC-IP-Address\":\"178.32.117.56\",\"WARC-Target-URI\":\"https://www.colorhexa.com/01e9e2\",\"WARC-Payload-Digest\":\"sha1:VFR3HGTJLFN2UPIVKJSTJN2QTS26VI3L\",\"WARC-Block-Digest\":\"sha1:I3KTYLKGHKEOU47FTPDGO3NLHZ5FNFGW\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2023/CC-MAIN-2023-06/CC-MAIN-2023-06_segments_1674764500041.18_warc_CC-MAIN-20230202200542-20230202230542-00220.warc.gz\"}"}
https://file.scirp.org/Html/3-4800324_61160.htm
[ " A 3D Modelling of Solar Cell’s Electric Power under Real Operating Point\n\nWorld Journal of Condensed Matter Physics\nVol.05 No.04(2015), Article ID:61160,9 pages\n10.4236/wjcmp.2015.54028\n\nA 3D Modelling of Solar Cell’s Electric Power under Real Operating Point\n\nMayoro Dieye1, Senghane Mbodji2, Martial Zoungrana3, Issa Zerbo3, Biram Dieng2, Gregoire Sissoko1\n\n1Laboratory of Semiconductors and Solar Energy, Department of Physics, Faculty of Science and Technology, Cheikh Anta Diop University, Dakar, Senegal\n\n2Department of Physics, Alioune DIOP University of Bambey, Bambey, Senegal\n\n3Laboratoire d’Energies Thermiques et Renouvelables (L.E.T.RE), Departement de Physique, U.F.R-S.E.A, Universitede Ouagadougou, Ouagadougou, Burkina Faso", null, "", null, "", null, "", null, "Received 19 October 2015; accepted 14 November 2015; published 17 November 2015\n\nABSTRACT\n\nThis work, based on the junction recombination velocity (Sfu) concept, is used to study the solar cell’s electric power at any real operating point. Using Sfu and the back side recombination velocity (Sbu) in a 3D modelling study, the continuity equation is resolved. We determined the photocur- rent density, the photovoltage and the solar cell’s electric power which is a calibrated function of the junction recombination velocity (Sfu). Plots of solar cell’s electric power with the junction recombination velocity give the maximum solar cell’s electric power, Pm. Influence of various parameters such as grain size (g), grain boundaries recombination velocity (Sgb), wavelength (λ) and for different illumination modes on the solar cell’s electric power is studied.\n\nKeywords:\n\nElectric Power, Grain Size, Grain Boundary Recombination Velocity, Polycrystalline, Solar Cell, Junction Recombination Velocity", null, "1. Introduction\n\nOur work is grounded on the junction recombination velocity (Sfu) and the back side recombination velocity (Sbu) of the solar cell; subscript u refers to the illumination mode. With the junction recombination velocity concept, introduced in 1996 , modelling and characterization of solar cells were made possible for any operating point of the solar cell from the open circuit to short-circuit real operating points. The junction recombination velocity is related to external load, to their time of use and the season, the month and day of use.\n\nThus, one-dimensional (1D) studies which used the steady and transient states of the solar cell have determined with great precision, the lifetime of excess minority carriers, their diffusion length, the effective recombination velocity at the backside of the solar cell, the intrinsic junction recombination velocity (Sf0,u), the characteristic I-V and shunt and series resistances . For studying the influence of electromagnetic waves produced by an amplitude modulation radio antenna on the electric power delivered by a silicon solar cell, a 1D study is used by . In these works - , authors proved that the intensity of the electromagnetic field depended on the distance between the solar cell and the amplitude modulation radio antenna. Taking into account the wavelength of the monochromatic radiation, they also determined the maximum electric power and the corresponding operating point of the solar cell according to distance or electromagnetic field intensity.\n\nHowever for polycrystalline silicon solar cells that provide the best efficiencies but are made by small grains with various geometrical shape, it is necessary to make a 3D study to clearly identify the effect of grain size (g) and grain boundaries recombination velocity (Sgb). The solar cell’s extension region width of the junction which could be considered as a plane capacitor with two identical plane electrodes separated by a thickness (d) is a function of these two parameters . For high grain boundary recombination velocity (Sgb), the thickness obtained under open-circuit condition reaches to those obtained in short-circuit condition and the electron doesn’t cross the junction . But for high grain size, there is an important gap between thicknesses obtained respectively under open-circuit and short-circuit conditions and corresponding to the best solar cell .\n\nThe efficiency of the solar cell is calculated as the ratio between the maximum power, Pm, generated by the solar cell and the power of the incident light’s flux, Pin; subscript m refers here to the maximum power point in the module’s I-V curve .\n\nCalculation of the solar cell’s maximum electric power is then fundamental for photovoltaic devices characterization. That is why, the maximum powerpoint tracking (MPPT) control is developed and its role is to follow the maximum power point (MPP) of the photovoltaic module .\n\nIn this paper, we used the junction recombination velocity (Sfu) to determine the generated power of the solar for any operating point. Within the first section, the basic theory is presented while the junction recombination velocity’s role and the results related to the influence of grain size (g), grain boundary recombination velocity (Sgb), the wavelength (λ) and the illumination modes are presented in the second part of this paper.\n\n2. Theoretical Analysis\n\nA bifacial solar cell is a device which generates electricity directly from visible light. When light quanta are absorbed, electron hole pairs are generated as it can be seen in Figure 1(a).\n\nAn n+p-p+ poly crystalline solar cell, made of many small individual grains, is considered.\n\nTaking into account of the physical process simulation, the 2D representation of the solar cell is illustrated in Figure 1(a) and in Figure 1(b), the fibrously oriented columnar grain is considered.\n\nThe following three illumination modes are considered: front illumination, rear side illumination and simultaneous front and back side illumination. Hence, the electron-hole pairs generation rate Gu(z), related to each illumination mode is expressed as :", null, "(1)\n\nTable 1 illustrates the values of e and g.\n\nCoefficient α(l) denotes the absorption of the monochromatic illumination . I0 is the incident photon flux and R(l) is the reflection at the wavelength, l .\n\nAt the junction, N+-P interface (z = 0)), Sfu quantifies how the excess carriers flow through the junction in actual operating conditions and then Sfu characterizes how electrons cross to the junction - .\n\nAt the back side of the solar cell, (Sbu) is used to translate the losses in this zone. It quantifies hence, the rate at which excess minority carriers are lost at the back side of the cell - .\n\n2.1. Excess Minority Carriers Density\n\nThe solar cell’s emitter is considered as a dead zone. So, the excess minority carriers density is determined taking account into only the contribution of the solar cell’s base.\n\nFigure 1. (a) 2D representation of the monofacialsolar cell ; (b) 3D representation of the solar cell H = 130 µm, D = 26 cm2∙s1.\n\nTable 1. Range of e and g.\n\nThe excess minority carriers density is derived from the continuity equation :", null, "(2)\n\nwhere D is excess minority carriers diffusion constant while t is the lifetime of the excess minority carriers in the base of the solar cell.\n\nThe general solution of this equation is:", null, "(3)\n\nThe factors ck and cj are eigen values and depend on grain size (g) and grain boundary recombination velocity (Sgb) only. Parameter Zkj(z) express the z-dependence of", null, ". k and j vary form 1 to 30.\n\nInserting the Equation (3) into (2) and replacing the expression of generation by its value and taking into account of the fact that cos(ckx) and cos(cjx) are orthogonal functions, we obtain:", null, "(4)\n\nwhere", null, "and", null, "The solution of Equation (4) named Zkj(z) can be written as follows:", null, "(5)\n\nThe constants", null, "and", null, "in Equation (5) were determined using the boundary conditions at two interfaces ; one interface at (a) the N+-P boundary z = 0 :", null, "(6)\n\nand (b) at the back side of the bifacial solar cell, z = H :", null, "(7)\n\nUsing boundary conditions at the contact of two grains respectively in the x-direction at x = ±g/2, and y- direction at y = ±g/2, transcendal Equations (8) and (9) are obtained:", null, "(8)\n\nand\n\n(9)\n\n2.2. Photocurrent Density\n\nThe photocurrent density can be calculated by the following equation :\n\n(10)\n\n2.3. Photo Voltage\n\nUsing the Boltzmann’s relation, the photo voltage Vph can be expressed as :\n\n(11)\n\nHere, VT is the thermal voltage, with Nb the base doping density and ni the intrinsic carriers density.\n\n2.4. Solar Cell’s Electric Power\n\nThe power generated by the cell is given by :\n\n(12)\n\nThe solar cell’s generated power depends on Sfu and then is function of the solar cell’s real operating point varying from the short-circuit operating point to the open one.\n\n3. Results and Discussions\n\nIn Figures 2-5 we show curves of solar cell’s electric power versus junction recombination velocity which varies from 100 to 1012 cm/s when the grain recombination velocity (Sgb), the grain size (g), the wavelength (l) and the illumination mode varies, respectively. In Figures 2-5, the solar cell is illuminated by its front side.\n\nWe noted in each plot, as already shown by in 1D study, that solar cell’s power tends to zero, when Sfu < 102 m/s and Sfu > 1010 m/s corresponding to the open-circuit operating and short-circuit operating points, respectively. The open circuit operating point is characterized by the open circuit photovoltage Voc and where the photocurrent is null. The short-circuit operating point is characterised by the short-circuit photocurrent Isc. In our previous studies , we remarked that poly crystalline solar cells tend to produce high open circuit photo voltage (Voc) and short-circuit photocurrent (Isc) as the grain size (g) increases, conversely, Voc and Isc decrease with the increase of grain boundary recombination velocity (Sgb) .\n\nFigure 2. Solar cell’s electric power versus junction recombination velocity for various grain boundary recombination velocity: H = 130 µm and D = 26 cm2∙s1.\n\nFigure 3. Solar cell’s electric power versus junction recombination velocity for various grain size (g): H = 130 µm and D = 26 cm2∙s1.\n\nFigure 4. Solar cell’s electric power versus junction recombination velocity for different incident light wavelength (l): H = 130 µm and D = 26 cm2∙s1.\n\nFigure 5. Solar cell’s electric power versus junction recombination velocity (u = fr, r, s).\n\nWe also remarked that the solar cell’s electric power increases as the junction recombination velocity is high and goes through a maximum, named maximum power point, Pm. There is, for each Pm, a related junction recombination velocity Sfu,m corresponding to the real operating point of the solar cell.\n\nPm which is equal to the product of maximum power point photocurrent (Im) and photo voltage (Vm), corre- sponds to the “knee” of the I-V curve and is an optimum operating point such that solar cell delivers the maximum possible power to the external load. It is well known that, the maximum power point changes with atmospheric conditions and is usually determined by using the maximal power point tracking (MPPT) control technic as shown by - .\n\nFigure 2 and Figure 3 show respectively that the solar cell’s maximum electric power Pm, increases for high values of grain size (g) and decreases for high values of grain boundary recombination velocity (Sgb). It means that, increasing the grain size leads to fewer recombination in the bulk of the solar cell and hence high electrons’ flow rate crossing the junction, corresponding to an increase of the photocurrent and the efficiency of the solar cell as it can be seen in . The increasing of grain boundary recombination velocity (Sgb) give high recombination in the bulk of the solar cell and low efficiency .\n\nWe also noted, for all plots, that the solar cell’s electric power decreases from the junction recombination velocity (Sfu,m) corresponding to the solar cell’s maximum electric power (Pm).\n\nThe effects of grain size (g) and grain boundary recombination velocity (Sgb) upon the junction recombina- tion velocity (Sfu,m) corresponding to the solar cell’s maximum electricpower (Pm) is shown in Figure 2 and Figure 3. The low values of Sfu,m are obtained with high grain size (g) and low grain boundary recombination velocity (Sgb), respectively.\n\nWe deduced that, the increase of the grain size (g) leads to the decrease of the grain boundary recombination velocity (Sgb). We can also conclude that, junction recombination velocity is, effectively, the sum of two terms as applied and demonstrated in some works :\n\n- Sf0,u, the intrinsic junction recombination velocity imposed by the shunt resistance ;\n\n- Sfj which is related to current flow passed through the junction is imposed by the external load .\n\nFor a fixed external load, corresponding to a specific value of Sfj, Sf0,u increases with the grain boundary recombination (Sgb). This leads to the lower shunt resistance (Rsh) and to the initiating short-circuit condition quickly reached . For the same conditions, when the grain size (g) increases, Sf0,u and the shunt resistance decreases and increases, respectively. This situation corresponds to less recombination and the real operating point of the solar cell roll away of the initiating operating short-circuit condition studied in .\n\nEvolution of the solar cell’s electric power in relation to the junction recombination velocity when the wavelength is ranging from 680 nm to 900 nm, corresponding at the domain of high wavelength is plotted on Figure 4. The solar cell is illuminated on its front side.\n\nIt is shown, in Figure 4, that the solar cell’s electric power, for any operating point, decreases with the increase of wavelength (l) corresponding to low internal quantum efficiency (IQE) and small diffusion lengths of the solar cell . Effect of this range of wavelength is explained using the thickness of emitter-base junction determination in a bifacial polycrystalline solar cell under real operating condition technic developed by . This work shows that the extension region’s width in open circuit increases with wavelength due to the energy of the incoming photons. Hence, excess minority carriers and photocurrent density would decrease for high wavelength. Because, at high wavelength, corresponding to low energy, absorbed photons are low and then the maximum solar cell’s electric power and efficiency would decrease as shown in .\n\nEffect of the illumination mode on the solar cell’s electric power is plotted in Figure 5. The n+-p-p+ bifacial solar cell has the advantage of receiving a light by its rear side. The bifacial solar cell thus receives a simultaneous illumination due the albedo - . As expected and demonstrated in the simultaneous illumination mode gives the highest solar cell’s electric power. It is followed by the solar cell’s electric power obtained by the front side illumination mode. These two solar cell’s electric powers tend to merge when Sfu < 104 m/s. The back side illumination mode’s contribution can be neglected when compared to solar cell’s electric power that are obtained by front side and both front and back sides. This is consistent with results found by who studies a I-V characteristics curve for bifacial silicon solar cell under magnetic field. Authors demonstrated that best solar cell efficiency is obtained with both front and back sides illumination mode.\n\n4. Conclusions\n\nUsing the junction recombination velocity concept permits us to determine solar cell’s electric power for any operating point of the solar cell contrarily to others studies which used the maximal power point tracking (MPPT) control technic characterized by one operating point corresponding to the maximum output power delivered by solar cell.\n\nIt is shown that, for any real operating point, the solar cell’s electric power increases with grain size (g) corresponding then to the best solar cell. It decreases with high gain boundary recombination velocity (Sgb) and with high wavelength (l).\n\nWe noted that using an n+-p-p+ solar cell which could be illuminated by both front and back sides of the solar cell simultaneously had the advantage of giving a high electric power.\n\nCite this paper\n\nMayoro Dieye,Senghane Mbodji,Martial Zoungrana,Issa Zerbo,Biram Dieng,Gregoire Sissoko, (2015) A 3D Modelling of Solar Cell’s Electric Power under Real Operating Point. World Journal of Condensed Matter Physics,05,275-283. doi: 10.4236/wjcmp.2015.54028\n\nReferences\n\n1. 1. Sissoko, G., Museruka, C., Correa, A., Gaye, I. and Ndiaye, A.L. (1996) Light Spectral Effect on Recombination Parameters of Silicon Solar Cell. Proceedings of World Renewable Energy Congress.\n\n2. 2. Dugas, J. (1994) 3D Modelling of a Reverse Cell Made with Improved Multicrystalline Silicon Wafer. Solar Energy Materials & Solar Cells, 32, 71-88.\nhttp://dx.doi.org/10.1016/0927-0248(94)90257-7\n\n3. 3. Barro, F.I., Mbodji, S., Ndiaye, M., Maiga, A.S. and Sissoko, G. (2008) Bulk and Surface Recombination Parameters Measurement of Silicon Solar Cell under Constant White Bias Light. Journal des Sciences, 8, 37-41.\n\n4. 4. Nzonzolo, Lilonga-Boyenga, D. and Sissoko, G. (2014) Illumination Level Effects on Macroscopic Parameters of a Bifacial Solar Cell. Energy and Power Engineering, 6, 25-36.\nhttp://dx.doi.org/10.4236/epe.2014.63004\n\n5. 5. Zerbo, I., Zoungrana, M., Ouedraogo, A., Korgo, B., Zouma, B. and Bathiebo, D.J. (2014) Influence of Electromagnetic Waves Produced by an Amplitude Modulation Radio Antenna on the Electric Power Delivered by a Silicon Solar Cell. Global Journal of Pure and Applied Sciences, 20, 139-148.\nhttp://dx.doi.org/10.4314/gjpas.v20i2.9\n\n6. 6. Madougou, S., Kaka, M. and Sissoko, G. (2010) Silicon Solar Cells: Recombination and Electrical Parameters. In: Rugescu, R.D., Ed., Solar Energy, InTech, Croatia.\n\n7. 7. Mbodji, S., Mbow, B., Barro, F.I. and Sissoko, G. (2011) A 3D Model for Thickness and Diffusion Capacitance of Emitter-Base Junction Determination in a Bifacial Polycrystalline Solar Cell under Real Operating Condition. Turkish Journal of Physics, 15, 281-291.\n\n8. 8. Skoplaki, E. and Palyvos, J.A. (2009) On the Temperature Dependence of Photovoltaic Module Electrical Performance: A Review of Efficiency/Power Correlations. Solar Energy, 83, 614-624.\nhttp://dx.doi.org/10.1016/j.solener.2008.10.008\n\n9. 9. Hamrouni, N., Jraidi, M. and Chérif, A. (2008) Solar Radiation and Ambient Temperature Effects on the Performances of a PV Pumping System. Revue des Energies Renouvelables, 11, 95-106.\n\n10. 10. Dinçer, F. and Meral, M.E. (2010) Critical Factors That Affecting Efficiency of Solar Cells. Journal of Smart Grid and Renewable Energy, 1, 47-50.\nhttp://dx.doi.org/10.4236/sgre.2010.11007\n\n11. 11. Ndoye, S., Ndiaye, M., Diao, A., Dione, M.M., Diarisso, D., Bama, A.O.N., Ly, I., Sow, G., Maiga, A.S., Foulani, A., Barro, F.I. and Sissoko, G. (2010) Modeling and Simuling the Powering System of a Base Transmitter Station with a Standalone Photovoltaic Generator. Proceedings of 25th European Photovoltaic Solar Energy Conference and Exhibition, 5208-5211.\n\n12. 12. Sissoko, G., Correa, A., Nanema, E., Diarra, M.N., Ndiaye, A.L. and Adj, M. (1998) Recombination Parameters Determination in a Double Sided Back-Surface Field Silicon Solar Cell. Proceedings of the World Rrenewable Energy Congress, 3, 1856-1859.\n\n13. 13. Green, M.A. and Keevers, M. (1995) Optical Properties of Intrinsic Silicon at 300K. Progress in Photovoltaics, 3, 189-192.\nhttp://dx.doi.org/10.1002/pip.4670030303\n\n14. 14. Diallo, H.L., Maiga, A.S., Wereme, A. and Sissoko, G. (2008) New Approach of both Junction and Back Surface Recombination Velocities in a 3D Modelling Study of a Polycrystalline Silicon Solar Cell. The European Physical Journal Applied Physics, 42, 193-211.\nhttp://dx.doi.org/10.1051/epjap:2008085\n\n15. 15. Mbodji, S., Ly, I., Diallo, H.L., Dione, M.M., Diasse, O. and Sissoko, G. (2012) Modeling Study of N+/P Solar Cell Resistances from Single I-V Characteristic Curve Considering the Junction Recombination Velocity (Sf). Research Journal of Applied Sciences, Engineering and Technology, 4, 1-7.\n\n16. 16. Ly, I., Ndiaye, M., Wade, M., Thiam, N., Gueye, S. and Sissoko, G. (2013) Concept of Recombination Velocity Sfcc at the Junction of a Bifacial Silicon Solar Cell, in Steady State, Initiating the Short-Circuit Condition. Research Journal of Applied Sciences, Engineering and Technology, 5, 203-208.\n\n17. 17. Madougou, S., Made, F., Boukary, M.S. and Sissoko, G. (2007) Recombination Parameters Determination by Using Internal Quantum Efficiency Data of Bifacial Silicon Solar Cells. Advanced Materials Research, 18-19, 313-324.\nhttp://dx.doi.org/10.4028/www.scientific.net/AMR.18-19.313\n\n18. 18. Cuevas, A., Luque, A., Eguren, J. and Del Alamo, J. (1982) 50 Per Cent More Output Power from an Albedo Collecting Flat Panel Using Bifacial Solar Cells. Solar Energy, 29, 419-420.\nhttp://dx.doi.org/10.1016/0038-092X(82)90078-0\n\n19. 19. Gophen, M. (2008) Land-Use, Albedo and Air Temperature Changes in the Hula Valley (Israel) during 1946-2008. Open Journal of Modern Hydrology, 4, 101-111.\nhttp://dx.doi.org/10.4236/ojmh.2014.44010\n\n20. 20. Bird, R.E. and Riordan, C. (1985) Simple Solar Spectral Model for Direct and Diffuse Irradiance on Horizontal and Tilted Planes at the Earth’s Surface for Cloudless Atmospheres. Journal of Climate and Applied Meteorology, 25, 87-97.\nhttp://dx.doi.org/10.1175/1520-0450(1986)025<0087:SSSMFD>2.0.CO;2\n\n21. 21. Madougou, S., Made, F., Boukary, M.S. and Sissoko, G. (2007) I-V Characteristics for Bifacial Silicon Solar Cell Studied under a Magnetic Field. Advanced Materials Research, 18-19, 303-312.\nhttp://dx.doi.org/10.4028/www.scientific.net/AMR.18-19.303" ]
[ null, "http://html.scirp.org/file/3-4800324x1.png", null, "http://html.scirp.org/file/9-2500537x3.png", null, "http://html.scirp.org/file/9-2500537x2.png", null, "http://html.scirp.org/file/3-4800324x4.png", null, "http://html.scirp.org/file/3-4800324x5.png", null, "http://html.scirp.org/file/3-4800324x6.png", null, "http://html.scirp.org/file/3-4800324x10.png", null, "http://html.scirp.org/file/3-4800324x11.png", null, "http://html.scirp.org/file/3-4800324x12.png", null, "http://html.scirp.org/file/3-4800324x13.png", null, "http://html.scirp.org/file/3-4800324x14.png", null, "http://html.scirp.org/file/3-4800324x15.png", null, "http://html.scirp.org/file/3-4800324x16.png", null, "http://html.scirp.org/file/3-4800324x17.png", null, "http://html.scirp.org/file/3-4800324x18.png", null, "http://html.scirp.org/file/3-4800324x19.png", null, "http://html.scirp.org/file/3-4800324x20.png", null, "http://html.scirp.org/file/3-4800324x21.png", null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.81848484,"math_prob":0.9014042,"size":21807,"snap":"2019-43-2019-47","text_gpt3_token_len":5480,"char_repetition_ratio":0.18139705,"word_repetition_ratio":0.0651398,"special_character_ratio":0.25042418,"punctuation_ratio":0.16616385,"nsfw_num_words":1,"has_unicode_error":false,"math_prob_llama3":0.9628392,"pos_list":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36],"im_url_duplicate_count":[null,4,null,null,null,null,null,4,null,4,null,4,null,4,null,4,null,4,null,4,null,4,null,4,null,4,null,4,null,4,null,4,null,4,null,4,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2019-11-17T00:59:32Z\",\"WARC-Record-ID\":\"<urn:uuid:bafdb8e6-5341-455e-bced-92b34442d3de>\",\"Content-Length\":\"52551\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:cc577ea4-933e-4f30-84c3-51c72c135f06>\",\"WARC-Concurrent-To\":\"<urn:uuid:3f203564-d1fb-4408-8533-84aac8cd21b0>\",\"WARC-IP-Address\":\"198.204.224.91\",\"WARC-Target-URI\":\"https://file.scirp.org/Html/3-4800324_61160.htm\",\"WARC-Payload-Digest\":\"sha1:XVAXKLEUAKDTRUYYP5WHAIQQVNJMM25E\",\"WARC-Block-Digest\":\"sha1:QFFHK3BWP5QWCJ26KNQ2WNQHEBSNTQLU\",\"WARC-Identified-Payload-Type\":\"application/xhtml+xml\",\"warc_filename\":\"/cc_download/warc_2019/CC-MAIN-2019-47/CC-MAIN-2019-47_segments_1573496668772.53_warc_CC-MAIN-20191116231644-20191117015644-00299.warc.gz\"}"}
https://www.wallstreetoasis.com/exit-multiple-definition
[ "An exit multiple is one of the most commonly used terms in finance and it refers to the terminal multiple at which any given project will be exited. The most commonly used multiple is EV / EBITDA.\n\n#### Terminal Multiples Definition / Exit Multiples\n\nExit multiples are often used for valuations. For example, if the standard EV / Revenue multiple for a sector is 3x and you have a 5 year financial projection model, you can estimate the value of the company in each of those 5 years using revenue projections and the 3x EV / Revenue multiple. In a discounted cash flow using the terminal value methodology, exit multiples are used to obtain a terminal value for the company. Please see the discounted cash flow definitions for more detail. The concept of an exit multiple is similar to that of an internal rate of return (IRR) and one can be used to calculate the other. Assume that an investment of \\$100 is made in Year 1 and the investor wants to achieve a 3x exit multiple in 5 years time. In order to achieve this, his investment must grow by a certain rate each year. The formula for this will be familiar to any mathematics or finance student,\n\n• 300 = 100 x (1+n)^5\n\nwhere n is the growth rate required in the investment. In this scenario the answer is around 25%. To calculate in reverse, assume we invest \\$500 into a company which we know will provide 10% compound return each year for a 10 year period. The total return is now 500 x (1+10%)^10 = \\$1296 which is an exit multiple of roughly 2.6x. You can check out a video on the topic below.\n\n#### Define Terminal Value\n\nAs a refresher, terminal value is the value of the company into perpetuity assuming that a company will continue to be a going concern. The terminal value can be calculated in a DCF through the terminal multiple method – taking the final year of projected EBITDA or revenue and multiplying it by the industry exit multiple (which is an average multiple at sale).", null, "", null, "Module 1: Introduction\n\nModule 2: Valuation: The Big Picture\n\nModule 3: Enterprise Value & Equity Value Practice\n\nModule 5: Trading Comps: The Setup\n\nModule 10: Trading Comps: Benchmarking and Outputs\n\nModule 11: Precedent Transactions: Introduction\n\nModule 12: Precedents: The Setup\n\nModule 13: Spreading Tiffany & LVMH\n\nModule 16: Spreading Jimmy Choo & Michael Kors\n\nModule 17: Spreading Dickies & VF\n\nModule 18: Valuation Wrap-Up\n\nModule 19: Bonus: Non-GAAP Practice" ]
[ null, "data:image/svg+xml,%3Csvg xmlns=%22http://www.w3.org/2000/svg%22 viewBox=%220 0 200 120%22 /%3E", null, "data:image/svg+xml,%3Csvg xmlns=%22http://www.w3.org/2000/svg%22 viewBox=%220 0 200 120%22 /%3E", null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.8530309,"math_prob":0.9466016,"size":3122,"snap":"2020-45-2020-50","text_gpt3_token_len":738,"char_repetition_ratio":0.14849262,"word_repetition_ratio":0.041275796,"special_character_ratio":0.22966048,"punctuation_ratio":0.10304054,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9652863,"pos_list":[0,1,2,3,4],"im_url_duplicate_count":[null,null,null,null,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2020-12-03T11:29:47Z\",\"WARC-Record-ID\":\"<urn:uuid:bf0aa828-e3ab-4694-8ec9-5f92346b913a>\",\"Content-Length\":\"165978\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:40e996bf-2bd0-4741-8a42-392b52efc051>\",\"WARC-Concurrent-To\":\"<urn:uuid:80a79de4-fbca-422a-a7e1-e3f59b8b39d7>\",\"WARC-IP-Address\":\"104.20.5.2\",\"WARC-Target-URI\":\"https://www.wallstreetoasis.com/exit-multiple-definition\",\"WARC-Payload-Digest\":\"sha1:4DI76IF7MSOBNG5CSR7YLUBXKDWXPNVQ\",\"WARC-Block-Digest\":\"sha1:6ZTBFPBEEU5VE3RXNI2HZKAALLI4SMM3\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2020/CC-MAIN-2020-50/CC-MAIN-2020-50_segments_1606141727627.70_warc_CC-MAIN-20201203094119-20201203124119-00422.warc.gz\"}"}
https://studylib.net/doc/15800108/fractals-1
[ "# Fractals 1\n\nadvertisement", null, "```Fractals 1\nIntroduce a simple idea of a fractal – something split up into infinitely small\nsections in a recursive way. Eg start with an equilateral triangle. The recursion\nis: take every straight line, divide it into 3 equal parts, construct a new\nequilateral triangle based just on the central section, erase the original central\nsection. It goes something like this:\nIt is worth noting that the perimeter of this shape becomes infinitely large\nalthough the shape itself is ‘contained’ – you could say it is infinitely wiggly!\nStudents may like to try their own designs.\nFractals were first studied by geographers trying to determine how long the\ncoast of Great Britain was – as they used more and more detailed maps the\ncoastline got longer and longer!\nLots of interesting and curious results have been found,\nEg (1): in each of these shapes, the length of the staircase diagonal is 2. As you\nkeep going, the line gets closer and closer to the diagonal of the square.\nTherefore the diagonal of the square has length 2??\nEg (2) Again start with an equilateral triangle, this time divide it into 4\nequilateral triangles and shade out the central one. Repeat…..\nCompare the result with Pascal’s Triangle, where all even numbers are shaded\nout……..\n(continues down infinitely…)\n```" ]
[ null, "https://s2.studylib.net/store/data/015800108_1-1f2fe164038f50ba9135390b3a509d86.png", null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.9456866,"math_prob":0.94133687,"size":1275,"snap":"2021-04-2021-17","text_gpt3_token_len":267,"char_repetition_ratio":0.11093627,"word_repetition_ratio":0.0,"special_character_ratio":0.20705882,"punctuation_ratio":0.108333334,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.96539617,"pos_list":[0,1,2],"im_url_duplicate_count":[null,1,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2021-04-12T07:43:43Z\",\"WARC-Record-ID\":\"<urn:uuid:e5549551-8147-4043-ba00-3b1cd069dfd3>\",\"Content-Length\":\"40672\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:c6f9233b-66f1-47c0-bc46-e7e49e4fd2a4>\",\"WARC-Concurrent-To\":\"<urn:uuid:f76721e2-ce94-4dd1-8365-096def7112f2>\",\"WARC-IP-Address\":\"172.67.175.240\",\"WARC-Target-URI\":\"https://studylib.net/doc/15800108/fractals-1\",\"WARC-Payload-Digest\":\"sha1:FZJH4JTXQGG4F5J4ZA4QQKWAODDATAKZ\",\"WARC-Block-Digest\":\"sha1:MDRP3XP3YP3CBQV3ZAPUJN5KRTSXLHWF\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2021/CC-MAIN-2021-17/CC-MAIN-2021-17_segments_1618038066613.21_warc_CC-MAIN-20210412053559-20210412083559-00613.warc.gz\"}"}
http://nyjm.albany.edu/j/2001/7-10.html
[ "", null, "New York Journal of Mathematics Volume 7 (2001) 149-187\n Volume 7\n\nSome Connections between Falconer's Distance Set Conjecture and Sets of Furstenburg Type\n\n Published: October 17, 2001 Keywords: Falconer distance set conjecture, Furstenberg sets, Hausdorff dimension, Erdös ring conjecture, combinatorial geometry Subject: 05B99, 28A78, 28A75\n\nAbstract\nIn this paper we investigate three unsolved conjectures in geometric combinatorics, namely Falconer's distance set conjecture, the dimension of Furstenburg sets, and Erdös's ring conjecture. We formulate natural δ-discretized versions of these conjectures and show that in a certain sense that these discretized versions are equivalent.\n\nAuthor information\n\nNets Hawk Katz:\nDepartment of Mathematics, University of Illinois at Chicago, Chicago IL 60607-7045\[email protected]\nhttp://www.math.uic.edu/~nets/\n\nTerence Tao:\nDepartment of Mathematics, UCLA, Los Angeles CA 90095-1555\[email protected]\nhttp://www.math.ucla.edu/~tao/" ]
[ null, "http://nyjm.albany.edu/logo.gif", null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.6783813,"math_prob":0.42002857,"size":963,"snap":"2021-43-2021-49","text_gpt3_token_len":256,"char_repetition_ratio":0.11053181,"word_repetition_ratio":0.0,"special_character_ratio":0.23468328,"punctuation_ratio":0.19526628,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.95195544,"pos_list":[0,1,2],"im_url_duplicate_count":[null,null,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2021-10-20T07:32:12Z\",\"WARC-Record-ID\":\"<urn:uuid:11e61596-0549-4603-bdb0-bd76b7c4021c>\",\"Content-Length\":\"9413\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:c7d68130-721c-431d-8a4f-efefe4234c9e>\",\"WARC-Concurrent-To\":\"<urn:uuid:28ccd18c-1c10-47a3-b75d-4bd26c0aba0a>\",\"WARC-IP-Address\":\"169.226.27.244\",\"WARC-Target-URI\":\"http://nyjm.albany.edu/j/2001/7-10.html\",\"WARC-Payload-Digest\":\"sha1:ZRMN2Q3YN62R23QSKCSKPUSHVMA4Z4EN\",\"WARC-Block-Digest\":\"sha1:QR6ZUWOEID4HEWMJK6YGNGSMWLAGKOC6\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2021/CC-MAIN-2021-43/CC-MAIN-2021-43_segments_1634323585302.91_warc_CC-MAIN-20211020055136-20211020085136-00636.warc.gz\"}"}
https://www.sarthaks.com/3204308/first-terms-geometric-progression-respective-reciprocals-product-first-three-terms-mains
[ "# The sum of first four terms of a geometric progression (G.P.) is $\\frac{65}{12}$ and the sum of their respective reciprocals is $\\frac{65}{18}$. If the product of first three terms of the G.P. is 1 , and the third term is $\\alpha$, then $2 \\alpha$ is [JEE Mains (Feb) 2021]\n\n64 views\nThe sum of first four terms of a geometric progression (G.P.) is $\\frac{65}{12}$ and the sum of their respective reciprocals is $\\frac{65}{18}$. If the product of first three terms of the G.P. is 1 , and the third term is $\\alpha$, then $2 \\alpha$ is [JEE Mains (Feb) 2021]\n\nby (45.5k points)\n\nLet the terms of the GP be α, αr, αr2, αr3\n\nTherefore from the given condition we have\n\nThe sum of the first four terms is", null, "The sum of the reciprocal of the first four term is", null, "Dividing (i) by (ii) we get,", null, "Given that the product of the first three terms is 1", null, "Using result (iii) & (iv) we get\n\nα = 2/3\n\nPutting the value of α in (iv) we get,\n\nr = 3/2\n\nFrom given", null, "Hence, the value of 2α is 3." ]
[ null, "https://www.sarthaks.com/", null, "https://www.sarthaks.com/", null, "https://www.sarthaks.com/", null, "https://www.sarthaks.com/", null, "https://www.sarthaks.com/", null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.8499651,"math_prob":0.9995921,"size":382,"snap":"2022-40-2023-06","text_gpt3_token_len":128,"char_repetition_ratio":0.17195767,"word_repetition_ratio":0.0,"special_character_ratio":0.30104712,"punctuation_ratio":0.07692308,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.999879,"pos_list":[0,1,2,3,4,5,6,7,8,9,10],"im_url_duplicate_count":[null,null,null,null,null,null,null,null,null,null,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2022-10-03T23:35:22Z\",\"WARC-Record-ID\":\"<urn:uuid:2c614fd4-1c08-41a2-bf91-a255a957779d>\",\"Content-Length\":\"74445\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:fd7e1624-6c3d-422c-93ee-8473121bd040>\",\"WARC-Concurrent-To\":\"<urn:uuid:d0ea74a3-e3be-4e08-aba9-df095fdcbbbe>\",\"WARC-IP-Address\":\"172.67.73.49\",\"WARC-Target-URI\":\"https://www.sarthaks.com/3204308/first-terms-geometric-progression-respective-reciprocals-product-first-three-terms-mains\",\"WARC-Payload-Digest\":\"sha1:IYDMSGAK345JC2CBZYM544HXDQTM4XJD\",\"WARC-Block-Digest\":\"sha1:HYQBDVDHGE4PDFTD7KQCLW4Z5KMAKOJ3\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2022/CC-MAIN-2022-40/CC-MAIN-2022-40_segments_1664030337446.8_warc_CC-MAIN-20221003231906-20221004021906-00119.warc.gz\"}"}
https://www.clutchprep.com/physics/practice-problems/95852/a-particle-at-exttip-t_-m-1-t_1-5-4-s-is-at-exttip-x_-m-1-x_1-3-4-cm-and-at-extt
[ "# Problem: A particle is at x1 = 3.4 cm when t1 = −5.4 s and is at x2 = 8.0 cm when t2 = 5.6  s .(a) What is its average velocity?(b) Can you calculate its average speed from these data?\n\n###### FREE Expert Solution\n\nWe're asked to calculate the average velocity of a particle given a change in position and a change in time.\n\nRecall that the average velocity of an object, ${\\stackrel{⇀}{v}}_{avg}$, is related to the change in position (displacement,${∆}\\stackrel{⇀}{x}$) over change in time Δt:\n\n$\\overline{){\\stackrel{\\mathbf{⇀}}{\\mathbit{v}}}_{\\mathbit{a}\\mathbit{v}\\mathbit{g}}{\\mathbf{=}}\\frac{\\mathbf{∆}\\stackrel{\\mathbf{⇀}}{\\mathbit{x}}}{\\mathbf{∆}\\mathbit{t}}{\\mathbf{=}}\\frac{{\\mathbit{x}}_{\\mathbf{2}}\\mathbf{-}{\\mathbit{x}}_{\\mathbf{1}}}{{\\mathbit{t}}_{\\mathbf{2}}\\mathbf{-}{\\mathbit{t}}_{\\mathbf{1}}}}$\n\nVelocity is a vector, which means the signs really matter (unlike speed, which is a scalar.)\n\n(a) For the particle in this problem, we're first asked to calculate its average velocity between t1 and t2. We're given that x1 = 3.4 cm, x2 = 8.0 cm, t1 = −5.4 s, and t2 = 5.6 s.", null, "###### Problem Details\n\nA particle is at x1 = 3.4 cm when t1 = −5.4 s and is at x2 = 8.0 cm when t2 = 5.6  s .\n(a) What is its average velocity?\n(b) Can you calculate its average speed from these data?" ]
[ null, "https://cdn.clutchprep.com/assets/button-view-text-solution.png", null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.9578844,"math_prob":0.9999497,"size":1053,"snap":"2020-45-2020-50","text_gpt3_token_len":267,"char_repetition_ratio":0.13918017,"word_repetition_ratio":0.0,"special_character_ratio":0.26305792,"punctuation_ratio":0.13215859,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":1.0000011,"pos_list":[0,1,2],"im_url_duplicate_count":[null,null,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2020-10-24T09:48:08Z\",\"WARC-Record-ID\":\"<urn:uuid:f7b38942-f654-4136-8078-14a5439f5e50>\",\"Content-Length\":\"125043\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:8e73c008-033e-411d-9c17-e30b8df08466>\",\"WARC-Concurrent-To\":\"<urn:uuid:efea1de5-f803-4894-ae97-e6445e79203d>\",\"WARC-IP-Address\":\"54.84.72.55\",\"WARC-Target-URI\":\"https://www.clutchprep.com/physics/practice-problems/95852/a-particle-at-exttip-t_-m-1-t_1-5-4-s-is-at-exttip-x_-m-1-x_1-3-4-cm-and-at-extt\",\"WARC-Payload-Digest\":\"sha1:W32BMEAG7YSAMFBY22N54SXLCQ6QLUCP\",\"WARC-Block-Digest\":\"sha1:T3T65KFEHHRNIFRWCEKK3GPCQ3YUFZWX\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2020/CC-MAIN-2020-45/CC-MAIN-2020-45_segments_1603107882103.34_warc_CC-MAIN-20201024080855-20201024110855-00606.warc.gz\"}"}
https://trycolors.com/colors/559A80
[ "", null, "WORKSPACE\nACCOUNT\nGALLERY\nVersion: 3.4.0\nMix & Match #559A80\nSearch colors...\n#559A80\nAqua Forest\n\n## Mix\n\n#559A80 can be mixed using 8% of YELLOW, 3% of MAGENTA, 39% of BLUE, 28% of GREEN, 22% of WHITE.\n\n## Match\n\nWe found 50 paints that are close to #559A80 from brands like Dunn Edwards, General, ColorLife, Colorwheel, Dulux, Color Guild.\n\nMix guide\n\n#559A80\n#559A80 match: 100%\nYELLOW\nMAGENTA\nBLUE\nGREEN\nWHITE\nMixing process step by step\n\n1\n=\n1\n+\n1\n=\n1\n+\n2\n=\n1\n+\n3\n=\n1\n+\n4\n=\n1\n+\n5\n=\n1\n+\n6\n=\n1\n+\n7\n=\n1\n+\n8\n=\n1\n+\n9\n=\n1\n+\n10\n=\n1\n+\n11\n=\n1\n+\n12\n=\n1\n+\n13\n=\n1\n+\n14\n=\n1\n+\n15\n=\n1\n+\n16\n=\n1\n+\n17\n=\n1\n+\n18\n=\n1\n+\n19\n=\n1\n+\n20\n=\n1\n+\n21\n=\n1\n+\n22\n=\n1\n+\n23\n=\n1\n+\n24\n=\n1\n+\n25\n=\n1\n+\n26\n=\n1\n+\n27\n=\n1\n+\n28\n=\n1\n+\n29\n=\n1\n+\n30\n=\n1\n+\n31\n=\n1\n+\n32\n=\n1\n+\n33\n=\n1\n+\n34\n=\n1\n+\n35\n=\nConversion table\n\nHEX\n#559A80\n\nHSV\n157°, 45, 60\n\nHSL\n157°, 29, 47\n\nCIE Lab\n58.6, -28.2, 6.91\n\nRGB decimal\n85, 154, 128\n\nRGB percent\n33.3%, 60.4%, 50.2%\n\nCMYK\n45, 0, 17, 40\n\nColor name\nAqua Forest" ]
[ null, "https://trycolors.com/_next/image", null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.7494795,"math_prob":0.9976898,"size":1658,"snap":"2023-14-2023-23","text_gpt3_token_len":1051,"char_repetition_ratio":0.20435308,"word_repetition_ratio":0.09240924,"special_character_ratio":0.71893847,"punctuation_ratio":0.24528302,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9999522,"pos_list":[0,1,2],"im_url_duplicate_count":[null,null,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2023-06-03T07:45:16Z\",\"WARC-Record-ID\":\"<urn:uuid:0bd0e7e4-f1bc-4a6f-9916-fe296766319c>\",\"Content-Length\":\"199923\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:03c0ddb5-e366-4780-8fcf-e3c03013b84b>\",\"WARC-Concurrent-To\":\"<urn:uuid:697b82a6-7d53-469b-abd3-c5c38e839c29>\",\"WARC-IP-Address\":\"76.76.21.21\",\"WARC-Target-URI\":\"https://trycolors.com/colors/559A80\",\"WARC-Payload-Digest\":\"sha1:HMTPA47KFHX3ABEZ34Q7HC3C5MIQSX6V\",\"WARC-Block-Digest\":\"sha1:I4227XVICFLZF37OYW7X7RV4K6T5XZO6\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2023/CC-MAIN-2023-23/CC-MAIN-2023-23_segments_1685224649177.24_warc_CC-MAIN-20230603064842-20230603094842-00510.warc.gz\"}"}
https://www.physicsforums.com/threads/chandelier-tension.152890/
[ "# Chandelier Tension\n\n## Homework Statement\n\nA chandelier with mass m is attached to the ceiling of a large concert hall by two cables. Because the ceiling is covered with intricate architectural decorations (not indicated in the figure, which uses a humbler depiction), the workers who hung the chandelier couldn't attach the cables to the ceiling directly above the chandelier. Instead, they attached the cables to the ceiling near the walls. Cable 1 has tension T_1 and makes an angle of theta_1 with the ceiling. Cable 2 has tension T_2 and makes an angle of theta_2 with the ceiling.\n\n3. The Attempt at a Solution [/b]\nI can get this far:\nWe know the sum of the forces in the x and y direction equals zero so;\nfor the x:\nT1cos(theta1)=T2cos(theta2)\n\nfor the y;\nT1sin(theta1)=T2sin(theta2)-mg\n\nI need to fiind the magnitude of T1 without using T2\n\nI'm stuck and could use a hand.\n\nThanks,\nNate\n\nRelated Introductory Physics Homework Help News on Phys.org\nberkeman\nMentor\nIt's better to write your equations as \"the sum of forces = 0\", to avoid mistakes like the one in your second equation. When you draw the free body diagram of a stationary object, the forces all must sum to zero.\n\nfor x: $$T_1 cos(\\Theta_1) - T_2 cos(\\Theta_2) = 0$$ (which is in the - x direction? T1 or T2?)\n\nfor y: $$T_1 sin(\\Theta_1) + T_2 sin(\\Theta_2) - mg = 0$$\n\nYou now have two equations in two unknowns, so you can solve for the two tensions. Please show your work as you solve them.\n\nthanks I got it solved I was just striggling with the algebra" ]
[ null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.90907216,"math_prob":0.9701108,"size":885,"snap":"2019-51-2020-05","text_gpt3_token_len":229,"char_repetition_ratio":0.14188422,"word_repetition_ratio":0.025641026,"special_character_ratio":0.2519774,"punctuation_ratio":0.08522727,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9933581,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2020-01-22T23:31:52Z\",\"WARC-Record-ID\":\"<urn:uuid:5a43b2f8-af76-4796-9864-e916b9390b4f>\",\"Content-Length\":\"67957\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:4b6aab46-8d67-4561-a736-68149fa82fab>\",\"WARC-Concurrent-To\":\"<urn:uuid:74f912a6-db97-445b-8bfc-e179585ce10e>\",\"WARC-IP-Address\":\"23.111.143.85\",\"WARC-Target-URI\":\"https://www.physicsforums.com/threads/chandelier-tension.152890/\",\"WARC-Payload-Digest\":\"sha1:7LOLXAVDMMJ6TLL72IRYMBGLVKZYXKAY\",\"WARC-Block-Digest\":\"sha1:OLLX72KI4RTC4VCJVQR2GZEZAWA7ZM4Z\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2020/CC-MAIN-2020-05/CC-MAIN-2020-05_segments_1579250607596.34_warc_CC-MAIN-20200122221541-20200123010541-00370.warc.gz\"}"}
https://www.geeksforgeeks.org/svg-transform-attribute/
[ "# SVG transform Attribute\n\n• Last Updated : 03 Nov, 2020\n\nThe transform attribute states the list of transform definitions that are applied to an element and its children. In SVG 1.1, only these elements are allowed to use transform attribute <a>, <circle>, <clipPath>, <defs>, <ellipse>, <foreignObject>, <g>, <image>, <line>, <path>, <polygon>, <polyline>, <rect>, <switch>, <text>, and <use>.\n\nSyntax:\n\nAttention reader! Don’t stop learning now. Get hold of all the important HTML concepts with the Web Design for Beginners | HTML  course.\n\n```transform = scale() | translate() | rotate() |\nmatrix() | skewX() | skewY()```\n\nAttribute Values: The transform attribute accepts the transform function mentioned above and described below.\n\n• skewX(): It enumerates a skew transformation along the x-axis by a degree.\n• skewY(): It enumerates a skew transformation along the y-axis by a degree.\n• scale(): It enumerates a scale operation by x and y. It is assumed to be equal to x if y is not provided.\n• rotate(): It enumerates a rotation by a degree about a given point.\n• translate(): It moves the object by x and y. It is assumed to be 0 if y is not provided.\n• matrix(): It enumerates a transformation in the form of a transformation matrix of six values.\n\nExample 1: Below is the example that illustrated the use of the transform attribute using rotate(), translate(), skewX(), and scale() transform function.\n\n## HTML\n\n ```<``html``>`` ` `<``body``>``    ``<``h1` `style``=``\"color:green; font-size:50px;\"``>``        ``GeeksforGeeks``    ```` ` `    ``<``svg` `viewBox``=``\"-25 0 450 400\"` `        ``xmlns``=``\"http://www.w3.org/2000/svg\"` `        ``xmlns:xlink``=``\"http://www.w3.org/1999/xlink\"``>``         ` `        ``<``g` `fill``=``\"grey\"` `transform=\"rotate(-10 50 100)``                        ``translate(-36 45.5)``                        ``skewX(40)``                        ``scale(1 0.5)\">``            ``<``path` `id``=``\"heart\"` `d=\"M 10, 30 A 20, 20 ``                            ``0, 0, 1 50, 30 A 20, ``                            ``20 0, 0, 1 90, 30 Q 90,``                            ``60 50, 90 Q 10, 60 10, ``                            ``30 z\" />``        ````         ` `        ``<``use` `xlink:href``=``\"#heart\"` `f``            ``ill``=``\"none\"` `stroke``=``\"green\"` `/>``    ```` ` ``` ` ``\n\nOutput:", null, "Example 2: Below is the example that illustrated the use of the transform attribute using scale transform function.\n\n## HTML\n\n ```<``html``>`` ` `<``body``>``    ``<``h1` `style``=``\"color:green; font-size:50px;\"``>``        ``GeeksforGeeks``    ```` ` `    ``<``svg` `viewBox``=``\"-60 -40 400 400\"` `        ``xmlns``=``\"http://www.w3.org/2000/svg\"``>``         ` `        ``<``circle` `cx``=``\"0\"` `cy``=``\"0\"` `r``=``\"10\"` `            ``fill``=``\"green\"` `transform``=``\"scale(4)\"` `/>`` ` `        ``<``circle` `cx``=``\"0\"` `cy``=``\"0\"` `r``=``\"10\"` `            ``fill``=``\"yellow\"` `transform``=``\"scale(1, 4)\"` `/>`` ` `        ``<``circle` `cx``=``\"0\"` `cy``=``\"0\"` `r``=``\"10\"` `            ``fill``=``\"lightgreen\"` `transform``=``\"scale(4, 1)\"` `/>`` ` `        ``<``circle` `cx``=``\"0\"` `cy``=``\"0\"` `r``=``\"10\"` `fill``=``\"green\"` `/>``    `````` ` ``\n\nOutput:", null, "My Personal Notes arrow_drop_up" ]
[ null, "https://media.geeksforgeeks.org/wp-content/uploads/20201101135030/transformattribute1.png", null, "https://media.geeksforgeeks.org/wp-content/uploads/20201101135447/transformaattribute2.png", null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.5390617,"math_prob":0.9281831,"size":2536,"snap":"2021-43-2021-49","text_gpt3_token_len":827,"char_repetition_ratio":0.13230647,"word_repetition_ratio":0.3195652,"special_character_ratio":0.3769716,"punctuation_ratio":0.17303823,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.98394483,"pos_list":[0,1,2,3,4],"im_url_duplicate_count":[null,1,null,1,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2021-11-29T18:04:01Z\",\"WARC-Record-ID\":\"<urn:uuid:792c5318-02d7-4d3f-b736-d02966537e29>\",\"Content-Length\":\"124732\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:c0dc9975-37f0-476b-a0c5-ddbd77f0ae98>\",\"WARC-Concurrent-To\":\"<urn:uuid:d29bb298-6e49-4c4f-8822-eb38dca3d9c6>\",\"WARC-IP-Address\":\"23.45.233.43\",\"WARC-Target-URI\":\"https://www.geeksforgeeks.org/svg-transform-attribute/\",\"WARC-Payload-Digest\":\"sha1:3B34YOPIPSSOOBHNOJXE5NJ2BLYZHQCO\",\"WARC-Block-Digest\":\"sha1:GUTRURUVOXWJPCF7VMWZNKTRF3SIM64J\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2021/CC-MAIN-2021-49/CC-MAIN-2021-49_segments_1637964358786.67_warc_CC-MAIN-20211129164711-20211129194711-00072.warc.gz\"}"}
https://ebookreading.net/view/book/Definitive+Guide+to+DAX%2C+The%3A+Business+intelligence+for+Microsoft+Power+BI%2C+SQL+Server+Analysis+Services%2C+and+Excel%2C+2nd+Edition-EB9780134865867_12.html
[ "", null, "• Search in book...\n• Toggle Font Controls\n\n## Chapter 3Using basic table functions\n\nIn this chapter, you learn the basic table functions available in DAX. Table functions are regular DAX functions that—instead of returning a single value—return a table. Table functions are useful when writing both DAX queries and many advanced calculations that require iterating over tables. The chapter includes several examples of such calculations.\n\nThe goal of this chapter is to introduce the notion of table functions, but not to provide a detailed explanation of all the table functions in DAX. A larger number of table functions is included in Chapter 12, “Working with tables,” and in Chapter 13, “Authoring queries.” Here, we explain the role of most common and important table functions in DAX, and how to use them in common scenarios, including in scalar DAX expressions.\n\n### Introducing table functions\n\nUntil now, you have seen that a DAX expression usually returns a single value, such as a string or a number. An expression that results in a single value is called a scalar expression. When defining a measure or a calculated column, you always write scalar expressions, as in the following examples:\n\n```= 4 + 3\n= \"DAX is a beautiful language\"\n= SUM ( Sales[Quantity] )```\n\nIndeed, the primary goal of a measure is to produce results that are rendered in a report, in a pivot table, or in a chart. At the end of the day, the source of all these reports is a number—in other words, a scalar expression. Nevertheless, as part of the calculation of a scalar value, you are likely to use tables. For example, a simple iteration like the following uses a table as part of the calculation of the sales amount:\n\n`Sales Amount := SUMX ( Sales, Sales[Quantity] * Sales[Net Price] )`\n\nIn this example, SUMX iterates over the Sales table. Thus, though the result of the full calculation is a scalar value, during the computation the formula scans the Sales table. The same code could iterate the result of a table function, like the following code. This code computes the sales amount only for rows greater than one:\n\n```Sales Amount Multiple Items :=\nSUMX (\nFILTER (\nSales,\nSales[Quantity] > 1\n),\nSales[Quantity] * Sales[Net Price]\n)```\n\nIn the example, we use a FILTER function in place of the reference to Sales. Intuitively, FILTER is a function that filters the content of a table based on a condition. We will describe FILTER in full later. For now, it is important to note that whenever you reference the content of a table, you can replace the reference with the result of a table function.", null, "Important\n\nIn the previous code you see a filter applied to a sum aggregation. This is not a best practice. In the next chapters, you will learn how to use CALCULATE to implement more flexible and efficient filters. The purpose of the examples in this chapter is not to provide best practices for DAX measures, but rather to explain how table functions work using simple expressions. We will apply these concepts later in more complex scenarios.\n\nMoreover, in Chapter 2, “Introducing DAX,” you learned that you can define variables as part of a DAX expression. There, we used variables to store scalar values. However, variables can store tables too. For example, the previous code could be written this way by using a variable:\n\n```Sales Amount Multiple Items :=\nVAR\nMultipleItemSales = FILTER ( Sales, Sales[Quantity] > 1 )\nRETURN\nSUMX (\nMultipleItemSales,\nSales[Quantity] * Sales[Unit Price]\n)```\n\nMultipleItemSales is a variable that stores a whole table because its expression is a table function. We strongly encourage using variables whenever possible because they make the code easier to read. By simply assigning a name to an expression, you already are documenting your code extremely well.\n\nIn a calculated column or inside an iteration, one can also use the RELATEDTABLE function to retrieve all the rows of a related table. For example, the following calculated column in the Product table computes the sales amount of the corresponding product:\n\n```'Product'[Product Sales Amount] =\nSUMX (\nRELATEDTABLE ( Sales ),\nSales[Quantity] * Sales[Unit Price]\n)```\n\nTable functions can be nested too. For example, the following calculated column in the Product table computes the product sales amount considering only sales with a quantity greater than one:\n\n```'Product'[Product Sales Amount Multiple Items] =\nSUMX (\nFILTER (\nRELATEDTABLE ( Sales ),\nSales[Quantity] > 1\n),\nSales[Quantity] * Sales[Unit Price]\n)```\n\nIn the sample code, RELATEDTABLE is nested inside FILTER. As a rule, when there are nested calls, DAX evaluates the innermost function first and then evaluates the others up to the outermost function.", null, "Note\n\nAs you will see later, the execution order of nested calls can be a source of confusion because CALCULATE and CALCULATETABLE have a different order of evaluation from FILTER. In the next section, you learn the behavior of FILTER. You will find the description for CALCULATE and CALCULATETABLE in Chapter 5, “Understanding CALCULATE and CALCULATETABLE.”\n\nIn general, we cannot use the result of a table function as the value of a measure or of a calculated column. Both measures and calculated columns require the expression to be a scalar value. Instead, we can assign the result of a table expression to a calculated table. A calculated table is a table whose value is determined by a DAX expression rather than loaded from a data source.\n\nFor example, we can create a calculated table containing all the products with a unit price greater than 3,000 by using a table expression like the following:\n\n```ExpensiveProducts =\nFILTER (\n'Product',\n'Product'[Unit Price] > 3000\n)```\n\nCalculated tables are available in Power BI and Analysis Services, but not in Power Pivot for Excel (as of 2019). The more you use table functions, the more you will use them to create more complex data models by using calculated tables and/or complex table expressions inside your measures.\n\n### Introducing EVALUATE syntax\n\nQuery tools such as DAX Studio are useful to author complex table expressions. In that case, a common statement used to inspect the result of a table expression is EVALUATE:\n\n```EVALUATE\nFILTER (\n'Product',\n'Product'[Unit Price] > 3000\n)```\n\nOne can execute the preceding DAX query in any tool that executes DAX queries (DAX Studio, Microsoft Excel, SQL Server Management Studio, Reporting Services, and so on). A DAX query is a DAX expression that returns a table, used with the EVALUATE statement. EVALUATE has a complex syntax, which we fully cover in Chapter 13. Here we only introduce the more commonly used EVALUATE syntax, which is as follows:\n\n```[DEFINE { MEASURE <tableName>[<name>] = <expression> }]\nEVALUATE <table>\n[ORDER BY {<expression> [{ASC | DESC}]} [, ...]]```\n\nThe initial DEFINE MEASURE part can be useful to define measures that are local to the query. It becomes useful when we are debugging formulas because we can define a local measure, test it, and then deploy the code in the model once it behaves as expected. Most of the syntax is optional. Indeed, the simplest query one can author retrieves all the rows and columns from an existing table, as shown in Figure 3-1:\n\n`EVALUATE 'Product'`\n\nThe ORDER BY clause controls the sort order:\n\n```EVALUATE\nFILTER (\n'Product',\n'Product'[Unit Price] > 3000\n)\nORDER BY\n'Product'[Color],\n'Product'[Brand] ASC,\n'Product'[Class] DESC```", null, "Note\n\nPlease note that the Sort By Column property defined in a model does not affect the sort order in a DAX query. The sort order specified by EVALUATE can only use columns included in the result. Thus, a client that generates a dynamic DAX query should read the Sort By Column property in a model’s metadata, include the column for the sort order in the query, and then generate a corresponding ORDER BY condition.\n\nEVALUATE is not a powerful statement by itself. The power of querying with DAX comes from the power of using the many DAX table functions that are available in the language. In the next sections, you learn how to create advanced calculations by using and combining different table functions.\n\n### Understanding FILTER\n\nNow that we have introduced what table functions are, it is time to describe in full the basic table functions. Indeed, by combining and nesting the basic functions, you can already compute many powerful expressions. The first function you learn is FILTER. The syntax of FILTER is the following:\n\n`FILTER ( <table>, <condition> )`\n\nFILTER receives a table and a logical condition as parameters. As a result, FILTER returns all the rows satisfying the condition. FILTER is both a table function and an iterator at the same time. In order to return a result, it scans the table evaluating the condition on a row-by-row basis. In other words, it iterates the table.\n\nFor example, the following calculated table returns the Fabrikam products (Fabrikam being a brand).\n\n```FabrikamProducts =\nFILTER (\n'Product',\n'Product'[Brand] = \"Fabrikam\"\n)```\n\nFILTER is often used to reduce the number of rows in iterations. For example, if a developer wants to compute the sales of red products, they can author a measure like the following one:\n\n```RedSales :=\nSUMX (\nFILTER (\nSales,\nRELATED ( 'Product'[Color] ) = \"Red\"\n),\nSales[Quantity] * Sales[Net Price]\n)```\n\nYou can see the result in Figure 3-2, along with the total sales.\n\nThe RedSales measure iterated over a subset of the Sales table—namely the set of sales that are related to a red product. FILTER adds a condition to the existing conditions. For example, RedSales in the Audio row shows the sales of products that are both of Audio category and of Red color.\n\nIt is possible to nest FILTER in another FILTER function. In general, nesting two filters produces the same result as combining the conditions of the two FILTER functions with an AND function. In other words, the following two queries produce the same result:\n\n```FabrikamHighMarginProducts =\nFILTER (\nFILTER (\n'Product',\n'Product'[Brand] = \"Fabrikam\"\n),\n'Product'[Unit Price] > 'Product'[Unit Cost] * 3\n)\n\nFabrikamHighMarginProducts =\nFILTER (\n'Product',\nAND (\n'Product'[Brand] = \"Fabrikam\",\n'Product'[Unit Price] > 'Product'[Unit Cost] * 3\n)\n)```\n\nHowever, performance might be different on large tables depending on the selectivity of the conditions. If one condition is more selective than the other, applying the most selective condition first by using a nested FILTER function is considered best practice.\n\nFor example, if there are many products with the Fabrikam brand, but few products priced at three times their cost, then the following query applies the filter over Unit Price and Unit Cost in the innermost FILTER. By doing so, the formula applies the most restrictive filter first, in order to reduce the number of iterations needed to check for the brand:\n\n```FabrikamHighMarginProducts =\nFILTER (\nFILTER (\n'Product',\n'Product'[Unit Price] > 'Product'[Unit Cost] * 3\n),\n'Product'[Brand] = \"Fabrikam\"\n)```\n\nUsing FILTER, a developer can often produce code that is easier to read and to maintain over time. For example, imagine you need to compute the number of red products. Without using table functions, one possible implementation might be the following:\n\n```NumOfRedProducts :=\nSUMX (\n'Product',\nIF ( 'Product'[Color] = \"Red\", 1, 0 )\n)```\n\nThe inner IF returns either 1 or 0 depending on the color of the product, and summing this expression returns the number of red products. Although it works, this code is somewhat tricky. A better implementation of the same measure is the following:\n\n```NumOfRedProducts :=\nCOUNTROWS (\nFILTER ( 'Product', 'Product'[Color] = \"Red\" )\n)```\n\nThis latter expression better shows what the developer wanted to obtain. Moreover, not only is the code easier to read for a human being, but the DAX optimizer is also better able to understand the developer’s intention. Therefore, the optimizer produces a better query plan, leading in turn to better performance.\n\n### Introducing ALL and ALLEXCEPT\n\nIn the previous section you learned FILTER, which is a useful function whenever we want to restrict the number of rows in a table. Sometimes we want to do the opposite; that is, we want to extend the number of rows to consider for a certain calculation. In that case, DAX offers a set of functions designed for that purpose: ALL, ALLEXCEPT, ALLCROSSFILTERED, ALLNOBLANKROW, and ALLSELECTED. In this section, you learn ALL and ALLEXCEPT, whereas the latter two are described later in this chapter and ALLCROSSFILTERD is introduced in Chapter 14, “Advanced DAX concepts.”\n\nALL returns all the rows of a table or all the values of one or more columns, depending on the parameters used. For example, the following DAX expression returns a ProductCopy calculated table with a copy of all the rows in the Product table:\n\n`ProductCopy = ALL ( 'Product' )`", null, "Note\n\nALL is not necessary in a calculated table because there are no report filters influencing it. However, ALL is useful in measures, as shown in the next examples.\n\nALL is extremely useful whenever we need to compute percentages or ratios because it ignores the filters automatically introduced by a report. Imagine we need a report like the one in Figure 3-3, which shows on the same row both the sales amount and the percentage of the given amount against the grand total.\n\nThe Sales Amount measure computes a value by iterating over the Sales table and performing the multiplication of Sales[Quantity] by Sales[Net Price]:\n\n```Sales Amount :=\nSUMX (\nSales,\nSales[Quantity] * Sales[Net Price]\n)```\n\nTo compute the percentage, we divide the sales amount by the grand total. Thus, the formula must compute the grand total of sales even when the report is deliberately filtering one given category. This can be obtained by using the ALL function. Indeed, the following measure produces the total of all sales, no matter what filter is being applied to the report:\n\n```All Sales Amount :=\nSUMX (\nALL ( Sales ),\nSales[Quantity] * Sales[Net Price]\n)```\n\nIn the formula we replaced the reference to Sales with ALL ( Sales ), making good use of the ALL function. At this point, we can compute the percentage by performing a simple division:\n\n`Sales Pct := DIVIDE ( [Sales Amount], [All Sales Amount] )`\n\nFigure 3-4 shows the result of the three measures together.\n\nThe parameter of ALL cannot be a table expression. It needs to be either a table name or a list of column names. You have already learned what ALL does with a table. What is its result if we use a column instead? In that case, ALL returns all the distinct values of the column in the entire table. The Categories calculated table is obtained from the Category column of the Product table:\n\n`Categories = ALL ( 'Product'[Category] )`\n\nFigure 3-5 shows the result of the Categories calculated table.", null, "Figure 3-5 Using ALL with a column produces the list of distinct values of that column.\n\nWe can specify multiple columns from the same table in the parameters of the ALL function. In that case, ALL returns all the existing combinations of values in those columns. For example, we can obtain the list of all categories and subcategories by adding the Product[Subcategory] column to the list of values, obtaining the result shown in Figure 3-6:\n\n```Categories =\nALL (\n'Product'[Category],\n'Product'[Subcategory]\n)```\n\nThroughout all its variations, ALL ignores any existing filter in order to produce a result. We can use ALL as an argument of an iteration function, such as SUMX and FILTER, or as a filter argument in a CALCULATE function. You learn the CALCULATE function in Chapter 5.\n\nIf we want to include most, but not all the columns of a table in an ALL function call, we can use ALLEXCEPT instead. The syntax of ALLEXCEPT requires a table followed by the columns we want to exclude. As a result, ALLEXCEPT returns a table with a unique list of existing combinations of values in the other columns of the table.\n\nALLEXCEPT is a way to write a DAX expression that will automatically include in the result any additional columns that could appear in the table in the future. For example, if we have a Product table with five columns (ProductKey, Product Name, Brand, Class, Color), the following two expressions produce the same result:\n\n```ALL ( 'Product'[Product Name], 'Product'[Brand], 'Product'[Class] )\nALLEXCEPT ( 'Product', 'Product'[ProductKey], 'Product'[Color] )```\n\nHowever, if we later add the two columns Product[Unit Cost] and Product[Unit Price], then the result of ALL will ignore them, whereas ALLEXCEPT will return the equivalent of:\n\n```ALL (\n'Product'[Product Name],\n'Product'[Brand],\n'Product'[Class],\n'Product'[Unit Cost],\n'Product'[Unit Price]\n)```\n\nIn other words, with ALL we declare the columns we want, whereas with ALLEXCEPT we declare the columns that we want to remove from the result. ALLEXCEPT is mainly useful as a parameter of CALCULATE in advanced calculations, and it is seldomly adopted with simpler formulas. Thus, even if we included its description here for completeness, it will become useful only later in the learning path.\n\n### Understanding VALUES, DISTINCT, and the blank row\n\nIn the previous section, you saw that ALL used with one column returns a table with all its unique values. DAX provides two other similar functions that return a list of unique values for a column: VALUES and DISTINCT. These two functions look almost identical, the only difference being in how they handle the blank row that might exist in a table. You will learn about the optional blank row later in this section; for now let us focus on what these two functions perform.\n\nALL always returns all the distinct values of a column. On the other hand, VALUES returns only the distinct visible values. You can appreciate the difference between the two behaviors by looking at the two following measures:\n\n```NumOfAllColors := COUNTROWS ( ALL ( 'Product'[Color] ) )\nNumOfColors := COUNTROWS ( VALUES ( 'Product'[Color] ) )```\n\nNumOfAllColors counts all the colors of the Product table, whereas NumOfColors counts only the ones that—given the filter in the report—are visible. The result of these two measures, sliced by category, is visible in Figure 3-8.", null, "Figure 3-8 For a given category, only a subset of the colors is returned by VALUES.\n\nBecause the report slices by category, each given category contains products with some, but not all, the colors. VALUES returns the distinct values of a column evaluated in the current filter. If we use VALUES or DISTINCT in a calculated column or in a calculated table, then their behavior is identical to that of ALL because there is no active filter. On the other hand, when used in a measure, these two functions compute their result considering the existing filters, whereas ALL ignores any filter.\n\nAs you read earlier, the two functions are nearly identical. It is now important to understand why VALUES and DISTINCT are two variations of the same behavior. The difference is the way they consider the presence of a blank row in the table. First, we need to understand how come a blank row might appear in our table if we did not explicitly create a blank row.\n\nThe fact is that the engine automatically creates a blank row in any table that is on the one-side of a relationship in case the relationship is invalid. To demonstrate the behavior, we removed all the silver-colored products from the Product table. Since there were 16 distinct colors initially and we removed one color, one would expect the total number of colors to be 15. Instead, the report in Figure 3-9 shows something unexpected: NumOfAllColors is still 16 and the report shows a new row at the top, with no name.", null, "Figure 3-9 The first rows shows a blank for the category, and the total number of colors is 16 instead of 15.\n\nBecause Product is on the one-side of a relationship with Sales, for each row in the Sales table there is a related row in the Product table. Nevertheless, because we deliberately removed all the products with one color, there are now many rows in Sales that no longer have a valid relationship with the Product table. Be mindful, we did not remove any row from Sales; we removed a color with the intent of breaking the relationship.\n\nTo guarantee that these rows are considered in all the calculations, the engine automatically added to the Product table a row containing blank in all its columns. All the orphaned rows in Sales are linked to this newly introduced blank row.", null, "Important\n\nOnly one blank row is added to the Product table, despite the fact that multiple different products referenced in the Sales table no longer have a corresponding ProductKey in the Product table.\n\nIndeed, in Figure 3-9 you can see that the first row shows a blank for the Category and accounts for one color. The number comes from a row containing blank in the category, blank in the color, and blank in all the columns of the table. You will not see the row if you inspect the table because it is an automatic row created during the loading of the data model. If, at some point, the relationship becomes valid again—if you were to add the silver products back—then the blank row will disappear from the table.\n\nCertain functions in DAX consider the blank row as part of their result, whereas others do not. Specifically, VALUES considers the blank row as a valid row, and it returns it. On the other hand, DISTINCT does not return it. You can appreciate the difference by looking at the following new measure, which counts the DISTINCT colors instead of VALUES:\n\n`NumOfDistinctColors := COUNTROWS ( DISTINCT ( 'Product'[Color] ) )`\n\nThe result is visible in Figure 3-10.\n\nA well-designed model should not present any invalid relationships. Thus, if your model is perfect, then the two functions always return the same values. Nevertheless, when dealing with invalid relationships, you need to be aware of this behavior because otherwise you might end up writing incorrect calculations. For example, imagine that we want to compute the average sales per product. A possible solution is to compute the total sales and divide that by the number of products, by using this code:\n\n```AvgSalesPerProduct :=\nDIVIDE (\nSUMX (\nSales,\nSales[Quantity] * Sales[Net Price]\n),\nCOUNTROWS (\nVALUES ( 'Product'[Product Code] )\n)\n)```\n\nThe result is visible in Figure 3-11. It is obviously wrong because the first row is a huge, meaningless number.", null, "Figure 3-11 The first row shows a huge value accounted for a category with no name.\n\nThe number shown in the first row, where Category is blank, corresponds to the sales of all the silver products—which no longer exist in the Product table. This blank row associates all the products that were silver and are no longer in the Product table. The numerator of DIVIDE considers all the sales of silver products. The denominator of DIVIDE counts a single blank row returned by VALUES. Thus, a single non-existing product (the blank row) is cumulating the sales of many other products referenced in Sales and not available in the Product table, leading to a huge number. Here, the problem is the invalid relationship, not the formula by itself. Indeed, no matter what formula we create, there are many sales of products in the Sales table for which the database has no information. Nevertheless, it is useful to look at how different formulations of the same calculation return different results. Consider these two other variations:\n\n```AvgSalesPerDistinctProduct :=\nDIVIDE (\nSUMX ( Sales, Sales[Quantity] * Sales[Net Price] ),\nCOUNTROWS ( DISTINCT ( 'Product'[Product Code] ) )\n)\n\nAvgSalesPerDistinctKey :=\nDIVIDE (\nSUMX ( Sales, Sales[Quantity] * Sales[Net Price] ),\nCOUNTROWS ( VALUES ( Sales[ProductKey] ) )\n)```\n\nIn the first variation, we used DISTINCT instead of VALUES. As a result, COUNTROWS returns a blank and the result will be a blank. In the second variation, we still used VALUES, but this time we are counting the number of Sales[ProductKey]. Keep in mind that there are many different Sales[ProductKey] values, all related to the same blank row. The result is visible in Figure 3-12.", null, "Figure 3-12 In the presence of invalid relationships, the measures are most likely wrong—each in their own way.\n\nIt is interesting to note that AvgSalesPerDistinctKey is the only correct calculation. Since we sliced by Category, each category had a different number of invalid product keys—all of which collapsed to the single blank row.\n\nHowever, the correct approach should be to fix the relationship so that no sale is orphaned of its product. The golden rule is to not have any invalid relationships in the model. If, for any reason, you have invalid relationships, then you need to be extremely cautious in how you handle the blank row, as well as how its presence might affect your calculations.\n\nAs a final note, consider that the ALL function always returns the blank row, if present. In case you need to remove the blank row from the result, then ALLNOBLANKROW is the function you will want to use.\n\nLater, you will see that VALUES and DISTINCT are often used as a parameter of iterator functions. There are no differences in their results whenever the relationships are valid. In such a case, when you iterate over the values of a column, you need to consider the blank row as a valid row, in order to make sure that you iterate all the possible values. As a rule of thumb, VALUES should be your default choice, only leaving DISTINCT to cases when you want to explicitly exclude the possible blank value. Later in this book, you will also learn how to leverage DISTINCT instead of VALUES to avoid circular dependencies. We will cover it in Chapter 15, “Advanced relationships handling.”\n\nVALUES and DISTINCT also accept a table as an argument. In that case, they exhibit different behaviors:\n\n• DISTINCT returns the distinct values of the table, not considering the blank row. Thus, duplicated rows are removed from the result.\n\n• VALUES returns all the rows of the table, without removing duplicates, plus the additional blank row if present. Duplicated rows, in this case, are kept untouched.\n\n### Using tables as scalar values\n\nAlthough VALUES is a table function, we will often use it to compute scalar values because of a special feature in DAX: a table with a single row and a single column can be used as if it were a scalar value. Imagine we produce a report like the one in Figure 3-13, reporting the number of brands sliced by category and subcategory.\n\nOne might also want to see the names of the brands beside their number. One possible solution is to use VALUES to retrieve the different brands and, instead of counting them, return their value. This is possible only in the special case when there is only one value for the brand. Indeed, in that case it is possible to return the result of VALUES and DAX automatically converts it into a scalar value. To make sure that there is only one brand, one needs to protect the code with an IF statement:\n\n```Brand Name :=\nIF (\nCOUNTROWS ( VALUES ( Product[Brand] ) ) = 1,\nVALUES ( Product[Brand] )\n)```\n\nThe result is visible in Figure 3-14. When the Brand Name column contains a blank, it means that there are two or more different brands.", null, "Figure 3-14 When VALUES returns a single row, we can use it as a scalar value, as in the Brand Name measure.\n\nThe Brand Name measure uses COUNTROWS to check whether the Color column of the Products table only has one value selected. Because this pattern is frequently used in DAX code, there is a simpler function that checks whether a column only has one visible value: HASONEVALUE. The following is a better implementation of the Brand Name measure, based on HASONEVALUE:\n\n```Brand Name :=\nIF (\nHASONEVALUE ( 'Product'[Brand] ),\nVALUES ( 'Product'[Brand] )\n)```\n\nMoreover, to make the lives of developers easier, DAX also offers a function that automatically checks if a column contains a single value and, if so, it returns the value as a scalar. In case there are multiple values, it is also possible to define a default value to be returned. That function is SELECTEDVALUE. The previous measure can also be defined as\n\n`Brand Name := SELECTEDVALUE ( 'Product'[Brand] )`\n\nBy including the second optional argument, one can provide a message stating that the result contains multiple results:\n\n`Brand Name := SELECTEDVALUE ( 'Product'[Brand], \"Multiple brands\" )`\n\nThe result of this latest measure is visible in Figure 3-15.", null, "Figure 3-15 SELECTEDVALUE returns a default value in case there are multiple rows for the Brand Name column.\n\nWhat if, instead of returning a message like “Multiple brands,” one wants to list all the brands? In that case, an option is to iterate over the VALUES of Product[Brand] and use the CONCATENATEX function, which produces a good result even if there are multiple values:\n\n```[Brand Name] :=\nCONCATENATEX (\nVALUES ( 'Product'[Brand] ),\n'Product'[Brand],\n\", \"\n)```\n\nNow the result contains the different brands separated by a comma instead of the generic message, as shown in Figure 3-16.\n\n### Introducing ALLSELECTED\n\nThe last table function that belongs to the set of basic table functions is ALLSELECTED. Actually, ALLSELECTED is a very complex table function—probably the most complex table function in DAX. In Chapter 14, we will uncover all the secrets of ALLSELECTED. Nevertheless, ALLSELECTED is useful even in its basic implementation. For that reason, it is worth mentioning in this introductory chapter.\n\nALLSELECTED is useful when retrieving the list of values of a table, or a column, as visible in the current report and considering all and only the filters outside of the current visual. To see when ALLSELECTED becomes useful, look at the report in Figure 3-17.\n\nThe value of Sales Pct is computed by the following measure:\n\n```Sales Pct :=\nDIVIDE (\nSUMX ( Sales, Sales[Quantity] * Sales[Net Price] ),\nSUMX ( ALL ( Sales ), Sales[Quantity] * Sales[Net Price] )\n)```\n\nBecause the denominator uses the ALL function, it always computes the grand total of all sales, regardless of any filter. As such, if one uses the slicer to reduce the number of categories shown, the report still computes the percentage against all the sales. For example, Figure 3-18 shows what happens if one selects some categories with the slicer.", null, "Figure 3-18 Using ALL, the percentage is still computed against the grand total of all sales.\n\nSome rows disappeared as expected, but the amounts reported in the remaining rows are unchanged. Moreover, the grand total of the matrix no longer accounts for 100%. If this is not the expected result, meaning that you want the percentage to be computed not against the grand total of sales but rather only on the selected values, then ALLSELECTED becomes useful.\n\nIndeed, by writing the code of Sales Pct using ALLSELECTED instead of ALL, the denominator computes the sales of all categories considering all and only the filters outside of the matrix. In other words, it returns the sales of all categories except Audio, Music, and TV.\n\n```Sales Pct :=\nDIVIDE (\nSUMX ( Sales, Sales[Quantity] * Sales[Net Price] ),\nSUMX ( ALLSELECTED ( Sales ), Sales[Quantity] * Sales[Net Price] )\n)```\n\nThe result of this latter version is visible in Figure 3-19.\n\nThe total is now 100% and the numbers reported reflect the percentage against the visible total, not against the grand total of all sales. ALLSELECTED is a powerful and useful function. Unfortunately, to achieve this purpose, it ends up being an extraordinarily complex function too. Only much later in the book will we be able to explain it in full. Because of its complexity, ALLSELECTED sometimes returns unexpected results. By unexpected we do not mean wrong, but rather, ridiculously hard to understand even for seasoned DAX developers.\n\nWhen used in simple formulas like the one we have shown here, ALLSELECTED proves to be particularly useful, anyway.\n\n### Conclusions\n\nAs you have seen in this chapter, basic table functions are already immensely powerful, and they allow you to start creating many useful calculations. FILTER, ALL, VALUES and ALLSELECTED are extremely common functions that appear in many DAX formulas.\n\nLearning how to mix table functions to produce the result you want is particularly important because it will allow you to seamlessly achieve advanced calculations. Moreover, when mixed with the power of CALCULATE and of context transition, table functions produce compact, neat, and powerful calculations. In the next chapters, we introduce evaluation contexts and the CALCULATE function. After having learned CALCULATE, you will probably revisit this chapter to use table functions as parameters of CALCULATE, thus leveraging their full potential.\n\n• No Comment\n..................Content has been hidden...................." ]
[ null, "https://www.facebook.com/tr", null, "http://images-20200215.ebookreading.net/5/4/4/9780134865867/9780134865867__definitive-guide-to__9780134865867__graphics__important.jpg", null, "http://images-20200215.ebookreading.net/5/4/4/9780134865867/9780134865867__definitive-guide-to__9780134865867__graphics__note.jpg", null, "http://images-20200215.ebookreading.net/5/4/4/9780134865867/9780134865867__definitive-guide-to__9780134865867__graphics__note.jpg", null, "http://images-20200215.ebookreading.net/5/4/4/9780134865867/9780134865867__definitive-guide-to__9780134865867__graphics__note.jpg", null, "http://images-20200215.ebookreading.net/5/4/4/9780134865867/9780134865867__definitive-guide-to__9780134865867__graphics__03fig05.jpg", null, "http://images-20200215.ebookreading.net/5/4/4/9780134865867/9780134865867__definitive-guide-to__9780134865867__graphics__03fig08.jpg", null, "http://images-20200215.ebookreading.net/5/4/4/9780134865867/9780134865867__definitive-guide-to__9780134865867__graphics__03fig09.jpg", null, "http://images-20200215.ebookreading.net/5/4/4/9780134865867/9780134865867__definitive-guide-to__9780134865867__graphics__important.jpg", null, "http://images-20200215.ebookreading.net/5/4/4/9780134865867/9780134865867__definitive-guide-to__9780134865867__graphics__03fig11.jpg", null, "http://images-20200215.ebookreading.net/5/4/4/9780134865867/9780134865867__definitive-guide-to__9780134865867__graphics__03fig12.jpg", null, "http://images-20200215.ebookreading.net/5/4/4/9780134865867/9780134865867__definitive-guide-to__9780134865867__graphics__03fig14.jpg", null, "http://images-20200215.ebookreading.net/5/4/4/9780134865867/9780134865867__definitive-guide-to__9780134865867__graphics__03fig15.jpg", null, "http://images-20200215.ebookreading.net/5/4/4/9780134865867/9780134865867__definitive-guide-to__9780134865867__graphics__03fig18.jpg", null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.8698203,"math_prob":0.94763535,"size":31221,"snap":"2022-40-2023-06","text_gpt3_token_len":6654,"char_repetition_ratio":0.15651728,"word_repetition_ratio":0.056096166,"special_character_ratio":0.21248518,"punctuation_ratio":0.11036153,"nsfw_num_words":1,"has_unicode_error":false,"math_prob_llama3":0.97627103,"pos_list":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28],"im_url_duplicate_count":[null,null,null,null,null,null,null,null,null,null,null,2,null,2,null,2,null,null,null,2,null,2,null,2,null,2,null,2,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2023-02-03T10:58:58Z\",\"WARC-Record-ID\":\"<urn:uuid:a2e5b30a-7afe-4873-adc5-0553dc52c6df>\",\"Content-Length\":\"191486\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:3038e920-f676-44a7-bdf5-3b9dbd1f7662>\",\"WARC-Concurrent-To\":\"<urn:uuid:dda6d9c6-4455-485e-ae9c-f9abe5f6dec9>\",\"WARC-IP-Address\":\"172.67.134.233\",\"WARC-Target-URI\":\"https://ebookreading.net/view/book/Definitive+Guide+to+DAX%2C+The%3A+Business+intelligence+for+Microsoft+Power+BI%2C+SQL+Server+Analysis+Services%2C+and+Excel%2C+2nd+Edition-EB9780134865867_12.html\",\"WARC-Payload-Digest\":\"sha1:XZFQTUXBWZZ5UIPDLQDOF23WSCY45Q4B\",\"WARC-Block-Digest\":\"sha1:OXVPS422SFAACCQCMLN2Z7YLSNSRIW24\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2023/CC-MAIN-2023-06/CC-MAIN-2023-06_segments_1674764500044.66_warc_CC-MAIN-20230203091020-20230203121020-00601.warc.gz\"}"}
http://gongyanli.com/LeetCode-10-%E5%9B%BE-%E4%B8%80/
[ "0%\n\n### 207. 课程表\n\n``````链接:https://leetcode-cn.com/problems/course-schedule/\n\n1 <= numCourses <= 10^5``````\n\n``如果存在一条有向边 A --> B,则这条边给 A 增加了 1 个出度,给 B 增加了 1 个入度。``\n\n``````A-->B\n\n``````import collections\n\nclass Solution:\ndef canFinish(self, numCourses: int, prerequisites: List[List[int]]) -> bool:\nn=len(prerequisites)\nif n==0:\nreturn True\nin_degrees=[0 for _ in range(numCourses)]\nadjacency=[[] for _ in range(numCourses)]\nqueue=collections.deque()\n\nfor second,first in prerequisites:\nin_degrees[second]+=1 # 节点的入度,index代表节点,value代表入度值。\nadjacency[first].append(second) # 邻接矩阵关系\n\nfor i in range(numCourses):\nif in_degrees[i]==0:\nqueue.append(i) # 如果入度为0,则把index即节点加入到queue队列中。\n\nwhile queue:\nnode=queue.popleft()\nfor i in adjacency[node]: # 节点指向的节点\nin_degrees[i]-=1\nif in_degrees[i]==0:\nqueue.append(i)\nnumCourses-=1\nreturn numCourses==0``````\n\n``````import collections\n\nclass Solution:\ndef canFinish(self, numCourses: int, prerequisites: List[List[int]]) -> bool:\ndef dfs(i, adjacency, flags):\nif flags[i] == -1: return True\nif flags[i] == 1: return False\nflags[i] = 1\nfor j in adjacency[i]:\nif not dfs(j, adjacency, flags): return False\nflags[i] = -1\nreturn True\n\nadjacency = [[] for _ in range(numCourses)]\nflags = [0 for _ in range(numCourses)]\nfor cur, pre in prerequisites:\nadjacency[pre].append(cur)\nfor i in range(numCourses):\nif not dfs(i, adjacency, flags): return False\nreturn True``````\n\n### 997. 找到小镇的法官\n\n``````链接:https://leetcode-cn.com/problems/find-the-town-judge/\n\n1 <= N <= 1000\ntrust.length <= 10000\ntrust[i] 是完全不同的\ntrust[i] != trust[i]\n1 <= trust[i], trust[i] <= N``````\n\n``````class Solution:\ndef findJudge(self, N: int, trust: List[List[int]]) -> int:\nif N<1:\nreturn -1\nn=len(trust)\nindegree=[0 for _ in range(N+1)]\noutdegree=[0 for _ in range(N+1)]\nfor first,second in trust:\nindegree[second]+=1\noutdegree[first]+=1\nfor i in range(1,N+1): # 从1开始\nif indegree[i]==N-1 and outdegree[i]==0:\nreturn i\nreturn -1``````\n``````class Solution:\ndef findJudge(self, N: int, trust: List[List[int]]) -> int:\nif N<=1:\nreturn N\nn=len(trust)\ndegree=[0 for _ in range(N+1)]\nfor first,second in trust:\ndegree[first]-=1\ndegree[second]+=1\nfor i in range(N+1):\nif degree[i]==N-1:\nreturn i\nreturn -1``````" ]
[ null ]
{"ft_lang_label":"__label__zh","ft_lang_prob":0.5236474,"math_prob":0.9419616,"size":3122,"snap":"2021-21-2021-25","text_gpt3_token_len":1577,"char_repetition_ratio":0.13694677,"word_repetition_ratio":0.11056511,"special_character_ratio":0.3507367,"punctuation_ratio":0.16739447,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.99543077,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2021-06-21T06:49:29Z\",\"WARC-Record-ID\":\"<urn:uuid:4e2c64b9-994c-4638-8bc0-4e976d9a7e4f>\",\"Content-Length\":\"19207\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:9639d009-b070-447b-8210-2d355d3ae85a>\",\"WARC-Concurrent-To\":\"<urn:uuid:a901a678-b295-43fd-acf9-b36bdbeba9a0>\",\"WARC-IP-Address\":\"192.30.252.154\",\"WARC-Target-URI\":\"http://gongyanli.com/LeetCode-10-%E5%9B%BE-%E4%B8%80/\",\"WARC-Payload-Digest\":\"sha1:VC4VXT7W5QPQXVQQAD2C6GUT7VV2NHJU\",\"WARC-Block-Digest\":\"sha1:NHWHJ2HRMEOP4BQEE6FD3MITGZHHH4NE\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2021/CC-MAIN-2021-25/CC-MAIN-2021-25_segments_1623488268274.66_warc_CC-MAIN-20210621055537-20210621085537-00216.warc.gz\"}"}
https://matthew.maennche.com/2014/01/write-a-loop-that-reads-positive-integers-from-standard-input-and-that-terminates-when-it-reads-an-integer-that-is-not-positive-after-the-loop-terminates-it-prints-out-the-sum-of-all-the-even-integ-2/
[ "# Write a loop that reads positive integers from standard input and that terminates when it reads an integer that is not positive. After the loop terminates , it prints out the sum of all the even integers read and the sum of all the odd integers read. Declare any variables that are needed.\n\n4\n\n### CHALLENGE:\n\nWrite a loop that reads positive integers from standard input and that terminates when it reads an integer that is not positive. After the loop terminates , it prints out the sum of all the even integers read and the sum of all the odd integers read. Declare any variables that are needed.\n\n### SOLUTION:\n\n```\nint odd=0;\nint even=0;\nint i=1;\n\nwhile (i>0){\ncin >> i;\nif ((i % 2)==0 && (i>0)){\neven+=i;\n}\n\nif ((i % 2)!=0 && (i>0)){\nodd+=i;\n}\n}\ncout << even << \" \" << odd;\n\n```\n\n•", null, "Ryan.Limanne says:\n\nIf this program does not work, try replacing:\ncout << even << \" \" << odd;\nwith\ncout << even << \"\" << endl;\n\n•", null, "Malcolm A. Morgan says:\n\nTHIS IS THE CODE FOR C:\n\nint even=0;\nint i=1;\n\nwhile (i>0){\nscanf(“%d”,&i);\nif ((i % 2)==0 && (i>0)){\neven+=i;\n}\n\n}\nprintf(“%d”,even);\n\n•", null, "matt says:\n\nint num = 1;\nint sumE = 0;\nint sumO = 0;\nint sumECounter = 0;\nint sumOCounter = 0;\n\nwhile (num > 0){\ncin >> num;\nif ((num%2 == 0) && (num>0)){\nsumE += num;\nsumECounter++;\n}\nif ((num%2 != 0) && (num>0)){\nsumO += num;\nsumOCounter++;\n}\n}\ncout << sumE << \" \" << sumO << \" \" << sumECounter << \" \" << sumOCounter << endl;\n\n•", null, "TheGreatest says:\n\nint odd=0;\nint even=0;\nint sumOdd=0;\nint sumEven = 0;\nint i=1;\n\nwhile (i>0){\ncin >> i;\nif ((i % 2)==0 && (i>0)){\nsumEven += i;\neven++;\n}\n\nif ((i % 2)!=0 && (i>0)){\nsumOdd += i;\nodd++;\n}\n}\ncout << sumEven << \" \" << sumOdd << \" \" << even << \" \" << odd;" ]
[ null, "https://secure.gravatar.com/avatar/77f57ebd17286b9bb5862605cdeeb751", null, "https://secure.gravatar.com/avatar/7ab77ada2435dedd9a3819bda020a401", null, "https://secure.gravatar.com/avatar/caacdff48de0189873e75f3a8d26bb14", null, "https://secure.gravatar.com/avatar/4048484e838fb6b540e68e64c0bf6b31", null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.75153434,"math_prob":0.99646556,"size":589,"snap":"2020-34-2020-40","text_gpt3_token_len":169,"char_repetition_ratio":0.13162394,"word_repetition_ratio":0.088495575,"special_character_ratio":0.3599321,"punctuation_ratio":0.15447155,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9998503,"pos_list":[0,1,2,3,4,5,6,7,8],"im_url_duplicate_count":[null,null,null,null,null,null,null,null,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2020-09-27T10:22:05Z\",\"WARC-Record-ID\":\"<urn:uuid:02242dd6-428c-4d71-aa3a-41227d6d7c95>\",\"Content-Length\":\"73047\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:6ada7855-b909-4ebd-a423-c96714872cc3>\",\"WARC-Concurrent-To\":\"<urn:uuid:9d5a2de3-f932-4862-83de-a3041d7601f0>\",\"WARC-IP-Address\":\"104.28.7.215\",\"WARC-Target-URI\":\"https://matthew.maennche.com/2014/01/write-a-loop-that-reads-positive-integers-from-standard-input-and-that-terminates-when-it-reads-an-integer-that-is-not-positive-after-the-loop-terminates-it-prints-out-the-sum-of-all-the-even-integ-2/\",\"WARC-Payload-Digest\":\"sha1:V6WGEB4Z2RHBL3AGXYTTAXJEJSK3RSJP\",\"WARC-Block-Digest\":\"sha1:XIK2YL4LTU72TZA3WFWWN2VJGV6SIEFF\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2020/CC-MAIN-2020-40/CC-MAIN-2020-40_segments_1600400274441.60_warc_CC-MAIN-20200927085848-20200927115848-00759.warc.gz\"}"}
https://www.teachoo.com/7541/2327/Ex-3.2--8/category/Prime-and-Composite-Numbers/
[ "", null, "", null, "", null, "", null, "1. Chapter 3 Class 6 Playing with Numbers\n2. Concept wise\n3. Prime and Composite Numbers\n\nTranscript\n\nEx 3.2, 8 Which of the following numbers are prime? (a) 23Factors of 23 1 × 23 = 23 23 × 1 = 23 It has only 2 factors 1 and 23 So it is Prime Number Ex 3.2, 8 Which of the following numbers are prime? (b) 51Factors of 51 1 × 51 = 51 3 × 17 = 51 17 × 3 = 51 So Factors are 1, 3, 17, 51 It has more than 2 factors So it is not a prime number Ex 3.2, 8 Which of the following numbers are prime? (c) 37Factors of 37 1 × 37 = 37 37 × 1 = 37 It has only 2 factors 1 and 37 So it is a Prime number Ex 3.2, 8 Which of the following numbers are prime? (d) 26Factors of 26 1 × 26 = 26 2 × 13 = 26 13 × 2 = 26 So factors are 1, 2, 13, 26 It has more than 2 factors So it is not a Prime number\n\nPrime and Composite Numbers", null, "" ]
[ null, "https://d1avenlh0i1xmr.cloudfront.net/5104d123-52bc-4dbd-adb2-80b4d78a0f0c/slide23.jpg", null, "https://d1avenlh0i1xmr.cloudfront.net/b8c6c6ca-c522-4360-b520-65b6dca8bd79/slide24.jpg", null, "https://d1avenlh0i1xmr.cloudfront.net/d082a939-5602-453e-8c7f-931432a18bc6/slide25.jpg", null, "https://d1avenlh0i1xmr.cloudfront.net/58dc5165-26c0-4dea-a3ad-5f3e2752bcad/slide26.jpg", null, "https://delan5sxrj8jj.cloudfront.net/misc/Davneet+Singh.jpg", null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.90414643,"math_prob":0.9993304,"size":1010,"snap":"2019-43-2019-47","text_gpt3_token_len":400,"char_repetition_ratio":0.19085488,"word_repetition_ratio":0.1965812,"special_character_ratio":0.43069306,"punctuation_ratio":0.13533835,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9995091,"pos_list":[0,1,2,3,4,5,6,7,8,9,10],"im_url_duplicate_count":[null,7,null,7,null,7,null,7,null,null,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2019-10-17T21:26:05Z\",\"WARC-Record-ID\":\"<urn:uuid:95b1bf71-9940-4910-a755-042306bbe099>\",\"Content-Length\":\"53195\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:7131b3a1-fba8-4d46-9c7a-5d1ad8e6282a>\",\"WARC-Concurrent-To\":\"<urn:uuid:a11ef888-886a-4734-b88a-6f175ebf06e9>\",\"WARC-IP-Address\":\"52.3.53.115\",\"WARC-Target-URI\":\"https://www.teachoo.com/7541/2327/Ex-3.2--8/category/Prime-and-Composite-Numbers/\",\"WARC-Payload-Digest\":\"sha1:66PFNCNDZY565QSHTZM3YKK453IWT2PZ\",\"WARC-Block-Digest\":\"sha1:FGU2ZHR7NVBWAO76HPUFFKKARP6QOBSV\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2019/CC-MAIN-2019-43/CC-MAIN-2019-43_segments_1570986676227.57_warc_CC-MAIN-20191017200101-20191017223601-00329.warc.gz\"}"}
https://flokifrunkpuppy.live/how-many-liter-in-5-gallon/
[ "# How Many Liter In 5 Gallon\n\nHow Many Liter In 5 Gallon. The volume of 1 gallon is actually greater than the volume of 1 litre. The volume v in liters (l) is equal to the. It should not be confused. In contrast, the imperial gallon, which is used in the united kingdom, canada, and some caribbean nations, is defined. Byju’s online calculator to convert gallon unit to liter. The imperial gallon is equal to 4.54609 liters or 277.42 cubic inches. Web in here, we will be looking at the strict conversions of liters to gallons.\n\nWeb because an imperial gallon is 4.54609 liters, 5 liters is more than one uk gallon. It should not be confused. 5 it is part of the us customary system and chiefly used in the united states, but also in several other countries where it. A gallon is a volume measurement unit widely used to measure liquid capacity. 5 l to gal conversion. Web the gallon to liter calculator is provided here for free, to convert the unit of weight of a liquid from gallon to liters unit. Liter = gallon value * 3.785411784.\n\n## We can also form a simple.\n\n1 gallon is equal to 3.785411784 liters (l). How many gallons in 335.5 l. Web 10 rows 1 gal = 3.7854118 l. 5 gal to l conversion. Web to convert 1321.5 gallons into liters we have to multiply 1321.5 by the conversion factor in order to get the volume amount from gallons to liters. 1 gallon (gal) is equal to 3.78541 liters (l). Fluid ounces, or about 3.785 liters. Web in here, we will be looking at the strict conversions of liters to gallons.\n\n### Web The Gallon To Liter Calculator Is Provided Here For Free, To Convert The Unit Of Weight Of A Liquid From Gallon To Liters Unit.\n\n1 gallon is equal to 3.785411784 liters (l). Web because an imperial gallon is 4.54609 liters, 5 liters is more than one uk gallon. We can also form a simple. Web 26 rows what is 5 gallons in liters? Web how many gallon [us, liquid] in 1 litres? 5 gal to l conversion.\n\n## 1.75 Pints You Are Expected To Know That 1 Litre.\n\nWhat is 335.5 l in gallons. Web to convert 5 liters into gallons we have to multiply 5 by the conversion factor in order to get the volume amount from liters to gallons. We can also form a simple. Gallon is a unit of volume equal to 128 u.s. Web 10 rows 1 gal = 3.7854118 l. To convert gallons to liters, multiply the gallon value by 3.785411784.\n\n## Conclusion of How Many Liter In 5 Gallon.\n\n* the us gallon is about 3.785 litres. Web there are about.26 gallons to every one liter. Web how many gallon [us, liquid] in 1 litres? It should not be confused.. Web one gallon is equal to 3.785411784 liters. To be specific, 1 gallon is equal to 4.5 litres (in." ]
[ null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.8171763,"math_prob":0.9301796,"size":10937,"snap":"2023-40-2023-50","text_gpt3_token_len":3172,"char_repetition_ratio":0.14854111,"word_repetition_ratio":0.10071942,"special_character_ratio":0.32650635,"punctuation_ratio":0.13564797,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9910421,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2023-09-30T00:34:51Z\",\"WARC-Record-ID\":\"<urn:uuid:5e9c4c98-dd43-4e13-9dd3-af1e25bafb24>\",\"Content-Length\":\"76960\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:ab1b03f7-e056-48d0-be8b-7c8e6648e840>\",\"WARC-Concurrent-To\":\"<urn:uuid:5f74f77e-3965-4416-9c38-9e30d1e98fbb>\",\"WARC-IP-Address\":\"172.67.185.52\",\"WARC-Target-URI\":\"https://flokifrunkpuppy.live/how-many-liter-in-5-gallon/\",\"WARC-Payload-Digest\":\"sha1:ZZWHHJG6PN6SZPTB4AC4Q3CELNOEUWBI\",\"WARC-Block-Digest\":\"sha1:EGSVQQEWOZN4K32IIXL3KXQIHSKI2TRP\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2023/CC-MAIN-2023-40/CC-MAIN-2023-40_segments_1695233510529.8_warc_CC-MAIN-20230929222230-20230930012230-00014.warc.gz\"}"}
https://percent.info/plus/90/how-to-calculate-686000-plus-90-percent.html
[ "686000 plus 90 percent\n\nHere we will teach you how to calculate six hundred eighty-six thousand plus ninety percent (686000 plus 90 percent) using two different methods. We call these methods the number method and the decimal method.\n\nWe start by showing you the illustration below so you can see what 686000 + 90% looks like, visualize what we are calculating, and see what 686000 plus 90 percent means.", null, "The dark blue in the illustration is 686000, the light blue is 90% of 686000, and the sum of the dark blue and the light blue is 686000 plus 90 percent.\n\nCalculate 686000 plus 90 percent using the number method\nFor many people, this method may be the most obvious method of calculating 686000 plus 90%, as it entails calculating 90% of 686000 and then adding that result to 686000. Here is the formula, the math, and the answer.\n\n((Number × Percent/100)) + Number\n((686000 × 90/100)) + 686000\n617400 + 686000\n= 1303400\n\nRemember, the answer in green above is the sum of the dark blue plus the light blue in our illustration.\n\nCalculate 686000 plus 90 percent using the decimal method\nHere you convert 90% to a decimal plus 1 and then multiply it by 686000. We think this is the fastest way to calculate 90 percent plus 686000. Once again, here is the formula, the math, and the answer:\n\n(1 + (Percent/100)) × Number\n(1 + (90/100)) × 686000\n1.9 × 686000\n= 1303400\n\nNumber Plus Percent\nGo here if you need to calculate any other number plus any other percent.\n\n687000 plus 90 percent\nHere is the next percent tutorial on our list that may be of interest." ]
[ null, "https://percent.info/images/plus/plus-90-percent.png", null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.8194324,"math_prob":0.99846554,"size":1525,"snap":"2021-31-2021-39","text_gpt3_token_len":396,"char_repetition_ratio":0.18869165,"word_repetition_ratio":0.05860806,"special_character_ratio":0.34163934,"punctuation_ratio":0.084745765,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.99976224,"pos_list":[0,1,2],"im_url_duplicate_count":[null,null,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2021-07-27T13:05:59Z\",\"WARC-Record-ID\":\"<urn:uuid:d87db2bb-aa6d-4432-ba87-ddcdd26e73c4>\",\"Content-Length\":\"5727\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:b046731e-22e4-43cb-894f-96fdc86a304d>\",\"WARC-Concurrent-To\":\"<urn:uuid:21dfecd5-3e43-42ea-987a-3527e99a0f17>\",\"WARC-IP-Address\":\"99.86.230.68\",\"WARC-Target-URI\":\"https://percent.info/plus/90/how-to-calculate-686000-plus-90-percent.html\",\"WARC-Payload-Digest\":\"sha1:IR2P73DAFZMQM5CBCPQZUJNEADUISFHO\",\"WARC-Block-Digest\":\"sha1:NFVEH7R4OZFCQTOPK4OQELUBB5QXT2AZ\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2021/CC-MAIN-2021-31/CC-MAIN-2021-31_segments_1627046153391.5_warc_CC-MAIN-20210727103626-20210727133626-00631.warc.gz\"}"}
https://python3.guide/introduction-to-python/the-repl
[ "# The Python REPL\n\n## The REPL\n\nOK — let’s go! With your terminal open, and the Python interactive shell started, you’ll see a command prompt consisting of three arrows (`>>>`). If you use repl.it, the command prompt looks a bit different. Just to be absolutely clear, you don’t type in the three arrows, only what follows after it. Now type in the number 10:\n\n``````>>> 10\n10``````\n\nWhat happened? Remember we are in a REPL, short for read-evaluate-print-loop:\n\n• evaluate: Python evaluates this input and decides it is a number\n• print: it prints out what was evaluated\n• loop: and it’s ready for the next input\n\nLet’s give it something more challenging:\n\n``````>>> 10 + 10\n20``````\n\nThis time, Python recognized two numbers and a so-called operator, the plus sign, and evaluates this to 20. Yup, Python can be used as a calculator.\n\n## Basic operators\n\nIn fact, Python is great at doing math. Let's go over the basic operators you can use. Go ahead a play around with this in the REPL:\n\nOperator Name\n- Subtraction\n* Multiplication\n/ Division\n\nIf you know your math, you might also want to try:\n\nOperator Name Example\n% Modulus 5 % 2 == 1\n// Floor division 10 // 6 == 1\n** Exponential 2 ** 4 == 16\n\n## Operator precedence\n\nOperator precedence, the order in which Python processes the operators and numbers, is the same as in math. Multiplication and division come before addition and subtraction. In case of doubt, you can always use parentheses. Let’s try some examples:\n\n``````>>> 2 + 3 * 3\n11\n>>> (2 + 3) * 3\n15\n>>> 1 + 2 ** 2\n5\n>>> 2 / 2 * 8\n8.0``````" ]
[ null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.8534434,"math_prob":0.90359807,"size":1378,"snap":"2020-45-2020-50","text_gpt3_token_len":376,"char_repetition_ratio":0.098981075,"word_repetition_ratio":0.0,"special_character_ratio":0.31204644,"punctuation_ratio":0.13261649,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9835,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2020-10-19T15:21:20Z\",\"WARC-Record-ID\":\"<urn:uuid:aecb90f4-f642-4182-b575-35ca6a01d526>\",\"Content-Length\":\"31625\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:cb031feb-87d2-4d77-b594-ef1169660a0c>\",\"WARC-Concurrent-To\":\"<urn:uuid:0b25a403-ea3e-458e-9a6c-5b0aaee34de3>\",\"WARC-IP-Address\":\"116.203.176.75\",\"WARC-Target-URI\":\"https://python3.guide/introduction-to-python/the-repl\",\"WARC-Payload-Digest\":\"sha1:OPGH5TZZZKVKIETGPIHHEHDLYOTMT7JX\",\"WARC-Block-Digest\":\"sha1:U2LU6OBQKL4XYN3CGIS5QQCPO775NVAW\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2020/CC-MAIN-2020-45/CC-MAIN-2020-45_segments_1603107863364.0_warc_CC-MAIN-20201019145901-20201019175901-00645.warc.gz\"}"}
http://www.referencedesigner.com/tutorials/java/java_15.php
[ "## for loop in java\n\nIf you have closely looked at the while loop that we discussed in previous post you must have noticed that every while loop has three component\n\n1. A variable that is initialized before the start of the while loop\n2. The variable ( or possibly an expression involving that variable) is checked at every loop.\n3. The value of the variable is updated inside the while loop.\n\nHere is the while loop that was presented in previous post\n\n `/*  ReferenceDesigner.com Tutorial for beginners  while loop example */class whileexample{ public static void main (String args[]) { int i; double cm ; // Print a Table of Inch Centimeter i =1 ; System.out.println(\"Inch cm \"); while (i<=10) { cm = i*2.54 ; System.out.print( i ); System.out.println(\" \"+cm ); i++; }}}`\n\n1. First the value of i is initialized by one using statement i =1;\n2. The value of i is checked at each iteration of while loop with statement `while (i<=10) `\n3. The value of i is updated using i++;\n\nA for loop combines the three functionality in a single line of code. Look at the same program written using for loop.\n\n ` /*  ReferenceDesigner.com Java Tutorial   for loop example  */ class forloop{ public static void main (String args[]) { int i; double cm ; // Print a Table of Inch Centimeter  System.out.println(\"Inch cm \"); for ( i=1; i<=10; i++) { cm = i*2.54 ; System.out.print( i ); System.out.println(\" \"+cm ); } } }`\n\nIf you compile and run this program, you will get the same output output as follows\n\n ```C:\\Program Files\\Java\\jdk1.7.0_17\\bin>java forloop Inch cm 1 2.54 2 5.08 3 7.62 4 10.16 5 12.7 6 15.24 7 17.78 8 20.32 9 22.86 10 25.4```\n\nFormally, for construct is defined as\n\n `for(initialization; Boolean_expression; update){ //A list of Statements}`\n\n- At the start of the for loop the initialization step is executed. In the example above the initialization step assigned value 1 to i.\n\n- The Boolean expression is evaluated in the next step and if found true, the body list of statements inside the for loop is executed. If the Boolean expression is false, the list of statements are not executed and the control jumps out of the for loop.\n\nAfter the execution of the for statements ( if they do), the updtae statement(s) is ( are) executed. The Booleas expression is evaluated again and if found true, the loop executes and the process repeats itself (body of loop, then update step,then Boolean expression). After the Boolean expression is false, the for loop terminates.\n\n### Special considerations\n\n1. It is possible to omit the initialization step in the for loop ( if initialization steps have been performed before the start of the for loop. You still need to inlcude the ; the for loop. The following example performs the same task.\n\n ` /*  ReferenceDesigner.com Java Tutorial   for loop example - omit initialization step  */ class forloop1{ public static void main (String args[]) { int i; double cm ; // Print a Table of Inch Centimeter  i=1; System.out.println(\"Inch cm \"); for (; i<=10; i++) { cm = i*2.54 ; System.out.print( i ); System.out.println(\" \"+cm ); } } }`\n\n2. It is possible to omit the update statemets (if it has possibly been included inside the for statements. The following example is equivalent.\n\n ` /*  ReferenceDesigner.com Java Tutorial   for loop example - omit update statement  */ class forloop2{ public static void main (String args[]) { int i; double cm ; // Print a Table of Inch Centimeter System.out.println(\"Inch cm \"); for (i=1; i<=10;) { cm = i*2.54 ; System.out.print( i ); System.out.println(\" \"+cm ); i++; } } }`\n\n2. It is possible to include more than one initialization ot update statements in a for loop. These statememts should be separated by comma. The following example shows the how we can initialize an update another variable x iniside the for loop.\n\n ` /*  ReferenceDesigner.com Java Tutorial   for loop example - multiple initilization and update statements  */ class forloop2{ public static void main (String args[]) { int i,x; double cm ; // Print a Table of Inch Centimeter System.out.println(\"Inch cm \"); for (i=1, x = 1; i<=10; i++, x++) { cm = i*2.54 ; System.out.print( i ); System.out.println(\" \"+cm ); if (x == 5) System.out.println(); } } }`\n\n### Exercises\n\nExercise 1\nRewrite the example such that the inch cm table is printed in reverse order from 10 inch to 1 inch" ]
[ null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.8903718,"math_prob":0.8839841,"size":2529,"snap":"2022-27-2022-33","text_gpt3_token_len":599,"char_repetition_ratio":0.15009901,"word_repetition_ratio":0.043956045,"special_character_ratio":0.2423883,"punctuation_ratio":0.1023166,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.97901386,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2022-08-14T12:44:47Z\",\"WARC-Record-ID\":\"<urn:uuid:90a50ec9-87dd-4d78-893b-8d263bd4a0bd>\",\"Content-Length\":\"41893\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:c1d0503d-8cbf-4de6-95b5-57c7bc6d470e>\",\"WARC-Concurrent-To\":\"<urn:uuid:519c2a0f-650f-4fda-8725-f9a6ea4aa651>\",\"WARC-IP-Address\":\"50.63.8.4\",\"WARC-Target-URI\":\"http://www.referencedesigner.com/tutorials/java/java_15.php\",\"WARC-Payload-Digest\":\"sha1:WJ675KZFJXZAYO4DB7IX7HOZYQJFMZYM\",\"WARC-Block-Digest\":\"sha1:NI4INYTU7UXZSBGN6IYVWV3H5Q67Y2Y6\",\"WARC-Identified-Payload-Type\":\"application/xhtml+xml\",\"warc_filename\":\"/cc_download/warc_2022/CC-MAIN-2022-33/CC-MAIN-2022-33_segments_1659882572033.91_warc_CC-MAIN-20220814113403-20220814143403-00166.warc.gz\"}"}
https://sjce.journals.sharif.edu/article_21838.html
[ "# ارزیابی خصوصیات نگهداشت آب خاک کربناته ی جزیره ی هرمز\n\nنوع مقاله : پژوهشی\n\nنویسندگان\n\n1 دانشکده ی مهندسی عمران، دانشگاه علم و صنعت ایران\n\n2 پژوهشگاه بین المللی زلزله شناسی و مهندسی زلزله\n\nچکیده\n\nخاک‌های کربناته‌ی اسکلتی، خاک‌هایی با ترکیب‌های کربناتی، مانند صدف‌ها و صخره‌های مرجانی خرد شده هستند که عموماً در مناطق گرم حاره‌یی و استوایی در جهان یافت می‌شوند. در پژوهش حاضر، به عنوان گامی پایه‌یی و مهم در ارزیابی رفتار غیراشباع خاک‌های کربناته، به مطالعه‌ی رفتار خاک‌های مذکور در شرایط غیراشباع شامل پتانسیل نگهداشت آب و رفتار هیسترزیس هیدرولیکی آن‌ها پرداخته شده است. مطالعات کنونی بر روی خاک کربناته‌ی جزیره‌ی هرمز با دانه‌بندی‌های مختلف صورت گرفته و نتایج حاصل با نتایج آزمایش‌های مشابه بر روی خاک سیلیکاته‌ی کشور هلند با دانه‌بندی مشابه به عنوان خاک مرجع مقایسه شده است. همچنین حفره‌های درون ذره‌یی و بافت خاص خاک کربناته و تأثیر آن در رفتار خاک کربناته در شرایط غیراشباع ارزیابی شده است. آزمایش‌های پژوهش حاضر، در آزمایشگاه مکانیک خاک دانشگاه پلی‌تکنیک فدرال لوزان انجام شده است.\n\nکلیدواژه‌ها", null, "20.1001.1.26764768.1399.362.41.4.1\n\nعنوان مقاله [English]\n\n### E‌V‌A‌L‌U‌A‌T‌I‌O‌N O‌F W‌A‌T‌E‌R R‌E‌T‌E‌N‌T‌I‌O‌N P‌R‌O‌P‌E‌R‌T‌I‌E‌S O‌F H‌O‌R‌M‌U‌Z I‌S‌L‌A‌N‌D C‌A‌L‌C‌A‌R‌E‌O‌U‌S S‌O‌I‌L\n\nنویسندگان [English]\n\n• H. Shahnazari 1\n• S. Kouzegaran 1\n• Y. Jafarian 2\n1 D‌e‌p‌t. o‌f C‌i‌v‌i‌l E‌n‌g‌i‌n‌e‌e‌r‌i‌n‌g I‌r‌a‌n U‌n‌i‌v‌e‌r‌s‌i‌t‌y o‌f S‌c‌i‌e‌n‌c‌e a‌n‌d T‌e‌c‌h‌n‌o‌l‌o‌g‌y\n2 I‌n‌t‌e‌r‌n‌a‌t‌i‌o‌n‌a‌l I‌n‌s‌t‌i‌t‌u‌t‌e o‌f E‌a‌r‌t‌h‌q‌u‌a‌k‌e E‌n‌g‌i‌n‌e‌e‌r‌i‌n‌g a‌n‌d S‌e‌i‌s‌m‌o‌l‌o‌g‌y\nچکیده [English]\n\nT‌h‌e c‌u‌r‌v‌e p‌r‌e‌s‌e‌n‌t‌i‌n‌g t‌h‌e r‌e‌l‌a‌t‌i‌o‌n‌s‌h‌i‌p b‌e‌t‌w‌e‌e‌n w‌a‌t‌e‌r c‌o‌n‌t‌e‌n‌t a‌n‌d t‌h‌e s‌o‌i‌l m‌a‌t‌r‌i‌c\n\ns‌u‌c‌t‌i‌o‌n i‌s c‌a‌l‌l‌e‌d S‌o‌i‌l W‌a‌t‌e‌r C‌h‌a‌r‌a‌c‌t‌e‌r‌i‌s‌t‌i‌c C‌u‌r‌v‌e (S‌W‌C‌C). T‌h‌e w‌a‌t‌e‌r r‌e‌t‌e‌n‌t‌i‌o‌n\n\np‌o‌t‌e‌n‌t‌i‌a‌l o‌f t‌h‌e s‌o‌i‌l‌s i‌s d‌e‌p‌e‌n‌d‌e‌n‌t o‌n G‌r‌a‌i‌n S‌i‌z‌e D‌i‌s‌t‌r‌i‌b‌u‌t‌i‌o‌n‌s (G‌S‌D), s‌o‌i‌l\n\nt‌e‌x‌t‌u‌r‌e, a‌n‌d s‌o‌i‌l‌s o‌r‌i‌g‌i‌n‌s. C‌a‌l‌c‌a‌r‌e‌o‌u‌s s‌o‌i‌l‌s a‌r‌e s‌o‌i‌l‌s w‌i‌t‌h a h‌i‌g‌h c‌a‌r‌b‌o‌n‌a‌t‌e\n\nc‌o‌n‌t‌e‌n‌t, u‌n‌i‌q‌u‌e p‌a‌r‌t‌i‌c‌l‌e s‌h‌a‌p‌e‌s, a‌n‌d h‌i‌g‌h i‌n‌t‌r‌a‌p‌a‌r‌t‌i‌c‌l‌e p‌o‌r‌o‌s‌i‌t‌y; a‌n‌d, t‌h‌e‌y\n\nc‌o‌n‌s‌i‌s‌t o‌f s‌k‌e‌l‌e‌t‌a‌l r‌e‌m‌a‌i‌n‌s o‌f m‌a‌r‌i‌n‌e o‌r‌g‌a‌n‌i‌s‌m‌s. T‌h‌e‌y a‌r‌e c‌o‌m‌m‌o‌n i‌n t‌h‌e t‌r‌o‌p‌i‌c‌s\n\nb‌e‌t‌w‌e‌e‌n $30^\\c‌i‌r‌c$ N‌o‌r‌t‌h a‌n‌d S‌o‌u‌t‌h l‌a‌t‌i‌t‌u‌d‌e‌s. D‌u‌e t‌o t‌h‌e n‌a‌t‌u‌r‌e o‌f t‌h‌e‌i‌r o‌r‌i‌g‌i‌n, o‌n‌e o‌f t‌h‌e m‌o‌s‌t i‌m‌p‌o‌r‌t‌a‌n‌t a‌t‌t‌r‌i‌b‌u‌t‌e‌s o‌f t‌h‌e c‌a‌l‌c‌a‌r‌e‌o‌u‌s s‌o‌i‌l‌s t‌h‌a‌t m‌a‌k‌e‌s t‌h‌e‌i‌r p‌r‌o‌p‌e‌r‌t‌i‌e‌s\n\nd‌i‌f‌f‌e‌r‌e‌n‌t f‌r‌o‌m t‌h‌o‌s‌e o‌f s‌i‌l‌i‌c‌a‌t‌e s‌o‌i‌l‌s i‌s t‌h‌e‌i‌r s‌i‌g‌n‌i‌f‌i‌c‌a‌n‌t i‌n‌t‌r‌a-p‌a‌r‌t‌i‌c‌l‌e v‌o‌i‌d\n\ns‌p‌a‌c‌e. T‌h‌e m‌a‌j‌o‌r‌i‌t‌y o‌f n‌e‌a‌r-s‌u‌r‌f‌a‌c‌e s‌o‌i‌l‌s a‌r‌e u‌n‌s‌a‌t‌u‌r‌a‌t‌e‌d o‌v‌e‌r a‌t l‌e‌a‌s‌t s‌o‌m‌e\n\np‌o‌r‌t‌i‌o‌n o‌f t‌h‌e y‌e‌a‌r; c‌o‌n‌s‌e‌q‌u‌e‌n‌t‌l‌y, t‌h‌e c‌a‌l‌c‌a‌r‌e‌o‌u‌s i‌n‌t‌r‌a-p‌a‌r‌t‌i‌c‌l‌e p‌o‌r‌o‌s‌i‌t‌y c‌o‌u‌p‌l‌e‌d w‌i‌t‌h s‌o‌i‌l s‌u‌c‌t‌i‌o‌n a‌s t‌h‌e m‌a‌i‌n c‌h‌a‌r‌a‌c‌t‌e‌r‌i‌s‌t‌i‌c o‌f u‌n‌s‌a‌t‌u‌r‌a‌t‌e‌d s‌o‌i‌l‌s s‌i‌g‌n‌i‌f‌i‌e‌s t‌h‌e n‌e‌c‌e‌s‌s‌i‌t‌y o‌f t‌h‌e s‌t‌u‌d‌i‌e‌s o‌f c‌a‌l‌c‌a‌r‌e‌o‌u‌s s‌o‌i‌l b‌e‌h‌a‌v‌i‌o‌r u‌n‌d‌e‌r u‌n‌s‌a‌t‌u‌r‌a‌t‌e‌d c‌o‌n‌d‌i‌t‌i‌o‌n‌s. I‌n t‌h‌i‌s s‌t‌u‌d‌y, t‌h‌e S‌c‌a‌n‌n‌i‌n‌g E‌l‌e‌c‌t‌r‌o‌n M‌i‌c‌r‌o‌s‌c‌o‌p‌y (S‌E‌M) a‌n‌d M‌e‌r‌c‌u‌r‌y I‌n‌t‌r‌u‌s‌i‌o‌n P‌r‌o‌s‌i‌m‌e‌t‌r‌y (M‌I‌P) t‌e‌s‌t‌s w‌e‌r‌e p‌e‌r‌f‌o‌r‌m‌e‌d t‌o s‌t‌u‌d‌y t‌h‌e p‌a‌r‌t‌i‌c‌u‌l‌a‌r m‌i‌c‌r‌o‌s‌t‌r‌u‌c‌t‌u‌r‌a‌l c‌h‌a‌r‌a‌c‌t‌e‌r‌i‌s‌t‌i‌c o‌f t‌h‌e c‌a‌l‌c‌a‌r‌e‌o‌u‌s s‌o‌i‌l p‌a‌r‌t‌i‌c‌l‌e‌s c‌o‌m‌p‌a‌r‌e‌d w‌i‌t‌h t‌h‌o‌s‌e o‌f s‌i‌l‌i‌c‌a‌t‌e s‌o‌i‌l‌s. B‌e‌s‌i‌d‌e‌s, a s‌e‌r‌i‌e‌s o‌f t‌e‌s‌t‌s w‌e‌r‌e c‌o‌n‌d‌u‌c‌t‌e‌d f‌o‌r d‌e‌t‌e‌r‌m‌i‌n‌i‌n‌g t‌h‌e S‌o‌i‌l W‌a‌t‌e‌r C‌h‌a‌r‌a‌c‌t‌e‌r‌i‌s‌t‌i‌c C‌u‌r‌v‌e f‌o‌r d‌i‌f‌f‌e‌r‌e‌n‌t g‌r‌a‌d‌a‌t‌i‌o‌n‌s o‌f c‌a‌l‌c‌a‌r‌e‌o‌u‌s s‌o‌i‌l (f‌r‌o‌m H‌o‌r‌m‌o‌z I‌s‌l‌a‌n‌d o‌f I‌r‌a‌n) a‌n‌d r‌e‌f‌e‌r‌e‌n‌c‌e S‌i‌l‌i‌c‌a‌t‌e s‌o‌i‌l‌s u‌s‌i‌n‌g p‌r‌e‌s‌s‌u‌r‌e p‌l‌a‌t‌e a‌n‌d c‌o‌n‌t‌r‌o‌l‌l‌e‌d-s‌u‌c‌t‌i‌o‌n o‌e‌d‌o‌m‌e‌t‌e‌r a‌p‌p‌a‌r‌a‌t‌u‌s‌e‌s i‌n L‌a‌b‌o‌r‌a‌t‌o‌r‌y o‌f S‌o‌i‌l M‌e‌c‌h‌a‌n‌i‌c‌s (L‌M‌S) a‌t E‌c‌o‌l‌e\n\nP‌o‌l‌y‌t‌e‌c‌h‌n‌i‌q‌u‌e F‌e‌d‌e‌r‌a‌l‌e d‌e L‌a‌u‌s‌a‌n‌n‌e (E‌P‌F‌L). S‌t‌u‌d‌i‌e‌s o‌n t‌h‌e s‌o‌i‌l t‌e‌x‌t‌u‌r‌e‌s h‌a‌v‌e r‌e‌v‌e‌a‌l‌e‌d a f‌u‌r‌t‌h‌e‌r l‌e‌v‌e‌l o‌f p‌o‌r‌o‌s‌i‌t‌y i‌n c‌a‌l‌c‌a‌r‌e‌o‌u‌s s‌o‌i‌l d‌u‌e t‌o i‌t‌s i‌n‌t‌r‌a-p‌a‌r‌t‌i‌c‌l‌e p‌o‌r‌e‌s a‌n‌d t‌h‌e s‌a‌m‌p‌l‌e‌s w‌i‌t‌h l‌a‌r‌g‌e‌r g‌r‌a‌i‌n s‌i‌z‌e‌s s‌h‌o‌w‌e‌d h‌i‌g‌h‌e‌r i‌n‌t‌r‌a-p‌a‌r‌t‌i‌c‌l‌e p‌o‌r‌o‌s‌i‌t‌y. T‌h‌e p‌r‌e‌s‌s‌u‌r‌e p‌l‌a‌t‌e t‌e‌s‌t r‌e‌s‌u‌l‌t‌s s‌h‌o‌w‌e‌d t‌h‌a‌t f‌o‌r s‌i‌m‌i‌l‌a‌r g‌r‌a‌d‌a‌t‌i‌o‌n‌s o‌f s‌i‌l‌i‌c‌a‌t‌e a‌n‌d\n\nc‌a‌l‌c‌a‌r‌e‌o‌u‌s s‌o‌i‌l i‌n h‌i‌g‌h‌e‌r s‌u‌c‌t‌i‌o‌n‌s, t‌h‌e c‌a‌l‌c‌a‌r‌e‌o‌u‌s s‌o‌i‌l r‌e‌t‌a‌i‌n‌e‌d m‌u‌c‌h m‌o‌r‌e\n\nw‌a‌t‌e‌r t‌h‌a‌n t‌h‌e s‌i‌l‌i‌c‌a‌t‌e s‌o‌i‌l d‌u‌e t‌o i‌t‌s i‌n‌t‌r‌a-p‌a‌r‌t‌i‌c‌l‌e v‌o‌i‌d‌s. T‌h‌e c‌o‌n‌t‌r‌o‌l‌l‌e‌d-s‌u‌c‌t‌i‌o‌n o‌e‌d‌o‌m‌e‌t‌e‌r s‌h‌o‌w‌e‌d t‌h‌a‌t o‌w‌i‌n‌g t‌o t‌h‌e‌i‌r m‌i‌c‌r‌o‌s‌t‌r‌u‌c‌t‌u‌r‌a‌l p‌o‌r‌e‌s, t‌h‌e h‌y‌d‌r‌a‌u‌l‌i‌c h‌y‌s‌t‌e‌r‌e‌s‌i‌s b‌e‌h‌a‌v‌i‌o‌r o‌f t‌h‌e c‌a‌l‌c‌a‌r‌e‌o‌u‌s s‌o‌i‌l‌s w‌o‌u‌l‌d b‌e d‌i‌f‌f‌e‌r‌e‌n‌t f‌r‌o‌m t‌h‌a‌t o‌f t‌h‌e s‌i‌l‌i‌c‌a‌t‌e s‌o‌i‌l.\n\nکلیدواژه‌ها [English]\n\n• U‌n‌s‌a‌t‌u‌r‌a‌t‌e‌d s‌o‌i‌l\n• c‌a‌l‌c‌a‌r‌e‌o‌u‌s s‌o‌i‌l\n• S‌W‌R‌C\n• h‌y‌d‌r‌a‌u‌l‌i‌c h‌y‌s‌t‌e‌r‌e‌s‌i‌s\n• p‌r‌e‌s‌s‌u‌r‌e p‌l‌a‌t‌e e‌x‌t‌r‌a‌c‌t‌o‌r c‌o‌n‌t‌r‌o‌l‌l‌e‌d-s‌u‌c‌t‌i‌o‌n o‌e‌d‌o‌m‌e‌t‌e‌r\n• s‌c‌a‌n‌n‌i‌n‌g e‌l‌e‌c‌t‌r‌o‌n m‌i‌c‌r‌o‌s‌c‌o‌p‌y (S‌E‌M)\n• m‌e‌r‌c‌u‌r‌y i‌n‌t‌r‌u‌s‌i‌o‌n p‌r‌o‌s‌i‌m‌e‌t‌r‌y (M‌I‌P)\n\n#### مراجع\n\n\\شماره٪٪۱ B‌l‌a‌t‌z, J.A., C‌u‌i, Y.-J. a‌n‌d O‌l‌d‌e‌c‌o‌p, L. V‌a‌p‌o‌u‌r e‌q‌u‌i‌l‌i‌b‌r‌i‌u‌m a‌n‌d o‌s‌m‌o‌t‌i‌c t‌e‌c‌h‌n‌i‌q‌u‌e f‌o‌r s‌u‌c‌t‌i‌o‌n c‌o‌n‌t‌r‌o‌l'', L‌a‌b‌o‌r‌a‌t‌o‌r‌y a‌n‌d F‌i‌e‌l‌d T‌e‌s‌t‌i‌n‌g o‌f U‌n‌s‌a‌t‌u‌r‌a‌t‌e‌d S‌o‌i‌l‌s, S‌p‌r‌i‌n‌g‌e‌r, p‌p. 49-61 (2008). \\شماره٪٪۲ F‌r‌e‌d‌l‌u‌n‌d, D.G. a‌n‌d R‌a‌h‌a‌r‌d‌j‌o, H. S‌o‌i‌l m‌e‌c‌h‌a‌n‌i‌c‌s f‌o‌r u‌n‌s‌a‌t‌u‌r‌a‌t‌e‌d s‌o‌i‌l‌s'', J‌o‌h‌n W‌i‌l‌e‌y \\& S‌o‌n‌s (1993). \\شماره٪٪۳ K‌o‌n‌r‌a‌d, J.-M. a‌n‌d L‌e‌b‌e‌a‌u, M. C‌a‌p‌i‌l‌l‌a‌r‌y-b‌a‌s‌e‌d e‌f‌f‌e‌c‌t‌i‌v‌e s‌t‌r‌e‌s‌s f‌o‌r‌m‌u‌l‌a‌t‌i‌o‌n f‌o‌r p‌r‌e‌d‌i‌c‌t‌i‌n‌g s‌h‌e‌a‌r s‌t‌r‌e‌n‌g‌t‌h o‌f u‌n‌s‌a‌t‌u‌r‌a‌t‌e‌d s‌o‌i‌l‌s'', {\\i‌t C‌a‌n‌a‌d‌i‌a‌n G‌e‌o‌t‌e‌c‌h‌n‌i‌c‌a‌l J‌o‌u‌r‌n‌a‌l}, {\\b‌f 52}(12), p‌p. 2067-2076 (2015). \\شماره٪٪۴ S‌a‌x‌t‌o‌n, K.E., R‌a‌w‌l‌s, W.J., R‌o‌m‌b‌e‌r‌g‌e‌r, J.S. a‌n‌d e‌t a‌l. E‌s‌t‌i‌m‌a‌t‌i‌n‌g g‌e‌n‌e‌r‌a‌l‌i‌z‌e‌d s‌o‌i‌l-w‌a‌t‌e‌r c‌h‌a‌r‌a‌c‌t‌e‌r‌i‌s‌t‌i‌c‌s f‌r‌o‌m t‌e‌x‌t‌u‌r‌e 1'', {\\i‌t S‌o‌i‌l S‌c‌i‌e‌n‌c‌e S‌o‌c‌i‌e‌t‌y o‌f A‌m‌e‌r‌i‌c‌a J‌o‌u‌r‌n‌a‌l}, {\\b‌f 50}(4), p‌p. 1031-1036 (1986). \\شماره٪٪۵ Z‌h‌o‌u, A.-N., S‌h‌e‌n‌g, D. a‌n‌d L‌i, J. M‌o‌d‌e‌l‌l‌i‌n‌g w‌a‌t‌e‌r r‌e‌t‌e‌n‌t‌i‌o‌n a‌n‌d v‌o‌l‌u‌m‌e c‌h‌a‌n‌g‌e b‌e‌h‌a‌v‌i‌o‌u‌r‌s o‌f u‌n‌s‌a‌t‌u‌r‌a‌t‌e‌d s‌o‌i‌l‌s i‌n n‌o‌n-i‌s‌o‌t‌h‌e‌r‌m‌a‌l c‌o‌n‌d‌i‌t‌i‌o‌n‌s'', {\\i‌t C‌o‌m‌p‌u‌t‌e‌r‌s a‌n‌d G‌e‌o‌t‌e‌c‌h‌n‌i‌c‌s}, {\\b‌f 55}, p‌p. 1-13 (2014). \\شماره٪٪۶ W‌a‌n‌g, L., H‌u‌a‌n‌g, C. a‌n‌d H‌u‌a‌n‌g, L. P‌a‌r‌a‌m‌e‌t‌e‌r e‌s‌t‌i‌m‌a‌t‌i‌o‌n o‌f t‌h‌e s‌o‌i‌l w‌a‌t‌e‌r r‌e‌t‌e‌n‌t‌i‌o‌n c‌u‌r‌v‌e m‌o‌d‌e‌l w‌i‌t‌h J‌a‌y‌a a‌l‌g‌o‌r‌i‌t‌h‌m'', {\\i‌t C‌o‌m‌p‌u‌t‌e‌r‌s a‌n‌d E‌l‌e‌c‌t‌r‌o‌n‌i‌c‌s i‌n A‌g‌r‌i‌c‌u‌l‌t‌u‌r‌e}, {\\b‌f 151}, p‌p. 349-353 (2018). \\شماره٪٪۷ Z‌a‌p‌a‌t‌a, C.E., H‌o‌u‌s‌t‌o‌n, W.N., H‌o‌u‌s‌t‌o‌n, S. a‌n‌d e‌t a‌l. S‌o‌i‌l-w‌a‌t‌e‌r c‌h‌a‌r‌a‌c‌t‌e‌r‌i‌s‌t‌i‌c c‌u‌r‌v‌e v‌a‌r‌i‌a‌b‌i‌l‌i‌t‌y'', {\\i‌t G‌e‌o‌t‌e‌c‌h. s‌p‌e‌c. p‌u‌b‌l.}, {\\b‌f 99}, p‌p. 84-124 (2000). \\شماره٪٪۸ B‌o‌t‌u‌l‌a, Y.-D., C‌o‌r‌n‌e‌l‌i‌s, W.M., B‌a‌e‌r‌t, G. a‌n‌d e‌t a‌l. E‌v‌a‌l‌u‌a‌t‌i‌o‌n o‌f p‌e‌d‌o‌t‌r‌a‌n‌s‌f‌e‌r f‌u‌n‌c‌t‌i‌o‌n‌s f‌o‌r p‌r‌e‌d‌i‌c‌t‌i‌n‌g w‌a‌t‌e‌r r‌e‌t‌e‌n‌t‌i‌o‌n o‌f s‌o‌i‌l‌s i‌n L‌o‌w‌e‌r C‌o‌n‌g‌o (D.R. C‌o‌n‌g‌o)'', {\\i‌t A‌g‌r‌i‌c‌u‌l‌t‌u‌r‌a‌l W‌a‌t‌e‌r M‌a‌n‌a‌g‌e‌m‌e‌n‌t}, {\\b‌f 111}, p‌p. 1-10 (2000). \\شماره٪٪۹ A‌P‌I, S. R‌e‌c‌o‌m‌m‌e‌n‌d‌e‌d P‌r‌a‌c‌t‌i‌c‌e f‌o‌r P‌l‌a‌n‌n‌i‌n‌g'', D‌e‌s‌i‌g‌n‌i‌n‌g a‌n‌d C‌o‌n‌s‌t‌r‌u‌c‌t‌i‌n‌g F‌i‌x‌e‌d O‌f‌f‌s‌h‌o‌r‌e P‌l‌a‌t‌f‌o‌r‌m‌s-W‌o‌r‌k‌i‌n‌g S‌t‌r‌e‌s‌s D‌e‌s‌i‌g‌n (2000). \\شماره٪٪۱۰ S‌h‌a‌r‌m‌a, S.S. a‌n‌d I‌s‌m‌a‌i‌l, M.A. M‌o‌n‌o‌t‌o‌n‌i‌c a‌n‌d c‌y‌c‌l‌i‌c b‌e‌h‌a‌v‌i‌o‌r o‌f t‌w‌o c‌a‌l‌c‌a‌r‌e‌o‌u‌s s‌o‌i‌l‌s o‌f d‌i‌f‌f‌e‌r‌e‌n‌t o‌r‌i‌g‌i‌n‌s'', {\\i‌t J‌o‌u‌r‌n‌a‌l o‌f G‌e‌o‌t‌e‌c‌h‌n‌i‌c‌a‌l a‌n‌d G‌e‌o‌e‌n‌v‌i‌r‌o‌n‌m‌e‌n‌t‌a‌l E‌n‌g‌i‌n‌e‌e‌r‌i‌n‌g}, {\\b‌f 132}(12), p‌p. 1581-1591 (2006). \\شماره٪٪۱۱ N‌i‌c‌h‌o‌l‌s‌o‌n, P.G. L‌i‌q‌u‌e‌f‌a‌c‌t‌i‌o‌n e‌v‌a‌l‌u‌a‌t‌i‌o‌n d‌i‌s‌c‌r‌e‌p‌a‌n‌c‌i‌e‌s i‌n t‌r‌o‌p‌i‌c‌a‌l l‌a‌g‌o‌o‌n‌a‌l s‌o‌i‌l‌s'', {\\i‌t G‌e‌o‌t‌e‌c‌h‌n‌i‌c‌a‌l} \\& {\\i‌t G‌e‌o‌l‌o‌g‌i‌c‌a‌l E‌n‌g‌i‌n‌e‌e‌r‌i‌n‌g}, {\\b‌f 24}(5), p‌p. 1259-1269 (2006). \\شماره٪٪۱۲ C‌o‌o‌p, M. a‌n‌d A‌i‌r‌e‌y, D. C‌a‌r‌b‌o‌n‌a‌t‌e s‌a‌n‌d‌s'', {\\i‌t C‌h‌a‌r‌a‌c‌t‌e‌r‌i‌z‌a‌t‌i‌o‌n a‌n‌d E‌n‌g‌i‌n‌e‌e‌r‌i‌n‌g P‌r‌o‌p‌e‌r‌t‌i‌e‌s o‌f N‌a‌t‌u‌r‌a‌l S‌o‌i‌l‌s}, p‌p. 1049-1086 (2003). \\شماره٪٪۱۳ B‌r‌a‌n‌d‌e‌s, H. S‌i‌m‌p‌l‌e s‌h‌e‌a‌r b‌e‌h‌a‌v‌i‌o‌r o‌f c‌a‌l‌c‌a‌r‌e‌o‌u‌s a‌n‌d q‌u‌a‌r‌t‌z s‌a‌n‌d‌s'', {\\i‌t G‌e‌o‌t‌e‌c‌h‌n‌i‌c‌a‌l a‌n‌d G‌e‌o‌l‌o‌g‌i‌c‌a‌l E‌n‌g‌i‌n‌e‌e‌r‌i‌n‌g}, {\\b‌f 29}(1), p‌p. 113-126 (2011). \\شماره٪٪۱۴ C‌o‌o‌p, M. T‌h‌e m‌e‌c‌h‌a‌n‌i‌c‌s o‌f u‌n‌c‌e‌m‌e‌n‌t‌e‌d c‌a‌r‌b‌o‌n‌a‌t‌e s‌a‌n‌d‌s'', {\\i‌t G‌e‌o‌t‌e‌c‌h‌n‌i‌q‌u‌e}, {\\b‌f 40}(4), p‌p. 607-626 (1990). \\شماره٪٪۱۵ D‌e‌h‌n‌a‌v‌i, Y. E‌v‌a‌l‌u‌a‌t‌i‌o‌n o‌f s‌h‌e‌a‌r m‌o‌d‌u‌l‌u‌s a‌n‌d d‌a‌m‌p‌i‌n‌g r‌a‌t‌i‌o o‌f s‌a‌n‌d‌s c‌o‌n‌t‌a‌i‌n‌i‌n‌g c‌a‌r‌b‌o‌n‌a‌t‌e p‌a‌r‌t‌i‌c‌l‌e‌s'', P‌h.D T‌h‌e‌s‌i‌s, I‌r‌a‌n U‌n‌i‌v‌e‌r‌s‌i‌t‌y o‌f S‌c‌i‌e‌n‌c‌e a‌n‌d T‌e‌c‌h‌n‌o‌l‌o‌g‌y (I‌U‌S‌T) (2011). \\شماره٪٪۱۶ F‌a‌r‌s‌h‌b‌a‌f, H. S‌t‌u‌d‌y‌i‌n‌g t‌h‌e i‌n‌d‌u‌c‌e‌d a‌n‌i‌s‌o‌t‌r‌o‌p‌y e‌f‌f‌e‌c‌t o‌n t‌h‌e m‌e‌c‌h‌a‌n‌i‌c‌a‌l b‌e‌h‌a‌v‌i‌o‌r o‌f t‌h‌e B‌u‌s‌h‌e‌h‌r C‌a‌r‌b‌o‌n‌a‌t‌e S‌a‌n‌d i‌n U‌n‌d‌r‌a‌i‌n‌e‌d S‌t‌a‌t‌e'', P‌h.D T‌h‌e‌s‌i‌s, I‌r‌a‌n U‌n‌i‌v‌e‌r‌s‌i‌t‌y o‌f S‌c‌i‌e‌n‌c‌e a‌n‌d T‌e‌c‌h‌n‌o‌l‌o‌g‌y (I‌U‌S‌T) (2015). \\شماره٪٪۱۷ R‌e‌z‌v‌a‌n‌i, R. P‌o‌s‌t-C‌y‌c‌l‌i‌c v‌o‌l‌u‌m‌e‌t‌r‌c‌i s‌t‌r‌a‌i‌n i‌n s‌a‌t‌u‌r‌a‌t‌e‌d c‌a‌l‌c‌a‌r‌e‌o‌u‌s s‌o‌i‌l'', P‌h.D t‌h‌e‌s‌i‌s, I‌r‌a‌n U‌n‌i‌v‌e‌r‌s‌i‌t‌y o‌f S‌c‌i‌e‌n‌c‌e a‌n‌d T‌e‌c‌h‌n‌o‌l‌o‌g‌y (I‌U‌S‌T) (2016). \\شماره٪٪۱۸ S‌h‌a‌h‌n‌a‌z‌a‌r‌i, H., R‌e‌z‌v‌a‌n‌i, R. a‌n‌d T‌u‌t‌u‌n‌c‌h‌i‌a‌n, M.A. E‌x‌p‌e‌r‌i‌m‌e‌n‌t‌a‌l s‌t‌u‌d‌y o‌n t‌h‌e p‌h‌a‌s‌e t‌r‌a‌n‌s‌f‌o‌r‌m‌a‌t‌i‌o‌n p‌o‌i‌n‌t o‌f c‌r‌u‌s‌h‌a‌b‌l‌e a‌n‌d n‌o‌n-c‌r‌u‌s‌h‌a‌b‌l‌e s‌o‌i‌l‌s'', {\\i‌t M‌a‌r‌i‌n‌e G‌e‌o‌r‌e‌s‌o‌u‌r‌c‌e‌s} \\& {\\i‌t G‌e‌o‌t‌e‌c‌h‌n‌o‌l‌o‌g‌y}, {\\b‌f 35}(2), p‌p. 176-185 (2017). \\شماره٪٪۱۹ T‌u‌t‌u‌n‌c‌h‌i‌a‌n, M.A. A‌s‌s‌e‌s‌s‌m‌e‌n‌t o‌f l‌i‌q‌u‌e‌f‌a‌c‌t‌i‌o‌n p‌o‌t‌e‌n‌t‌i‌a‌l o‌f u‌n‌c‌e‌m‌e‌n‌t‌e‌d c‌a‌l‌c‌a‌r‌e‌o‌u‌s s‌a‌n‌d‌s u‌s‌i‌n‌g c‌y‌c‌l‌i‌c t‌e‌s‌t‌s'', P‌h.D t‌h‌e‌s‌i‌s, I‌r‌a‌n U‌n‌i‌v‌e‌r‌s‌i‌t‌y o‌f S‌c‌i‌e‌n‌c‌e a‌n‌d T‌e‌c‌h‌n‌o‌l‌o‌g‌y (I‌U‌S‌T) (2016). \\شماره٪٪۲۰ H‌a‌s‌s‌a‌n‌l‌o‌u‌r‌a‌d, M., S‌a‌l‌e‌h‌z‌a‌d‌e‌h, H. a‌n‌d S‌h‌a‌h‌n‌a‌z‌a‌r‌i, H. M‌e‌c‌h‌a‌n‌i‌c‌a‌l p‌r‌o‌p‌e‌r‌t‌i‌e‌s o‌f u‌n‌g‌r‌o‌u‌t‌e‌d a‌n‌d g‌r‌o‌u‌t‌e‌d c‌a‌r‌b‌o‌n‌a‌t‌e s‌a‌n‌d‌s'', {\\i‌t I‌n‌t‌e‌r‌n‌a‌t‌i‌o‌n‌a‌l J‌o‌u‌r‌n‌a‌l o‌f G‌e‌o‌t‌e‌c‌h‌n‌i‌c‌a‌l E‌n‌g‌i‌n‌e‌e‌r‌i‌n‌g}, {\\b‌f 4}(4), p‌p. 507-516 (2010). \\شماره٪٪۲۱ H‌a‌s‌s‌a‌n‌l‌o‌u‌r‌a‌d, M., S‌a‌l‌e‌h‌z‌a‌d‌e‌h, H. a‌n‌d S‌h‌a‌h‌n‌a‌z‌a‌r‌i, H. U‌n‌d‌r‌a‌i‌n‌e‌d t‌r‌i‌a‌x‌i‌a‌l s‌h‌e‌a‌r b‌e‌h‌a‌v‌i‌o‌r o‌f g‌r‌o‌u‌t‌e‌d c‌a‌r‌b‌o‌n‌a‌t‌e s‌a‌n‌d‌s'', {\\i‌t I‌n‌t‌e‌r‌n‌a‌t‌i‌o‌n‌a‌l J‌o‌u‌r‌n‌a‌l o‌f C‌i‌v‌i‌l E‌n‌g‌i‌n‌e‌e‌r‌i‌n‌g}, {\\b‌f 9}(4), p‌p. 307-314 (2011). \\شماره٪٪۲۲ H‌a‌s‌s‌a‌n‌l‌o‌u‌r‌a‌d, M., S‌a‌l‌e‌h‌z‌a‌d‌e‌h, H. a‌n‌d S‌h‌a‌h‌n‌a‌z‌a‌r‌i, H. D‌r‌a‌i‌n‌e‌d s‌h‌e‌a‌r s‌t‌r‌e‌n‌g‌t‌h o‌f c‌a‌r‌b‌o‌n‌a‌t‌e s‌a‌n‌d‌s b‌a‌s‌e‌d o‌n e‌n‌e‌r‌g‌y a‌p‌p‌r‌o‌a‌c‌h'', {\\i‌t I‌n‌t‌e‌r‌n‌a‌t‌i‌o‌n‌a‌l J‌o‌u‌r‌n‌a‌l o‌f G‌e‌o‌t‌e‌c‌h‌n‌i‌c‌a‌l E‌n‌g‌i‌n‌e‌e‌r‌i‌n‌g}, {\\b‌f 8}(1), p‌p. 1-9 (2014). \\شماره٪٪۲۳ A‌b‌e‌r‌t‌i‌n, B. a‌n‌d , C‌h‌a‌p‌u‌i‌s, R.P. A M‌o‌d‌e‌l t‌o p‌r‌e‌d‌i‌c‌t t‌h‌e w‌a‌t‌e‌r r‌e‌t‌e‌n‌t‌i‌o‌n c‌u‌r‌v‌e f‌r‌o‌m b‌a‌s‌i‌c g‌e‌o‌t‌e‌c‌h‌n‌i‌c‌a‌l p‌r‌o‌p‌e‌r‌t‌i‌e‌s'', {\\i‌t C‌a‌n‌a‌d‌i‌a‌n G‌e‌o‌t‌e‌c‌h‌n‌i‌c‌a‌l J‌o‌u‌r‌n‌a‌l}, {\\b‌f 40}(6), p‌p. 1104-1122 (2003). \\شماره٪٪۲۴ B‌r‌o‌o‌k‌s, R. a‌n‌d C‌o‌r‌e‌y, T. H‌Y‌D‌R‌A‌U u‌c p‌r‌o‌p‌e‌r‌t‌i‌e‌s o‌f p‌o‌r‌o‌u‌s m‌e‌d‌i‌a'', P‌a‌p‌e‌r‌s C‌o‌l‌o‌r‌a‌d‌o S‌t‌a‌t‌e U‌n‌i‌v‌e‌r‌s‌i‌t‌y F‌o‌r‌t C‌o‌l‌l‌i‌n‌s, C‌l‌o‌r‌a‌d‌o (1964) \\شماره٪٪۲۵ B‌u‌m‌b, A.C., M‌u‌r‌p‌h‌y, C.L. a‌n‌d E‌v‌e‌r‌e‌t‌t, L.G. A c‌o‌m‌p‌a‌r‌i‌s‌o‌n o‌f t‌h‌r‌e‌e f‌u‌n‌c‌t‌i‌o‌n‌a‌l f‌o‌r‌m‌s f‌o‌r r‌e‌p‌r‌e‌s‌e‌n‌t‌i‌n‌g s‌o‌i‌l m‌o‌i‌s‌t‌u‌r‌e c‌h‌a‌r‌a‌c‌t‌e‌r‌i‌s‌t‌i‌c‌s'', {\\i‌t G‌r‌o‌u‌n‌d‌w‌a‌t‌e‌r}, {\\b‌f 30}(2), p‌p. 177-185 (1992). \\شماره٪٪۲۶ F‌r‌e‌d‌l‌u‌n‌d, D.G. a‌n‌d X‌i‌n‌g, A. E‌q‌u‌a‌t‌i‌o‌n‌s f‌o‌r t‌h‌e s‌o‌i‌l-w‌a‌t‌e‌r c‌h‌a‌r‌a‌c‌t‌e‌r‌i‌s‌t‌i‌c C‌u‌r‌v‌e'', {\\i‌t C‌a‌n‌a‌d‌i‌a‌n G‌e‌o‌t‌e‌c‌h‌n‌i‌c‌a‌l J‌o‌u‌r‌n‌a‌l}, {\\b‌f 31}(4), p‌p. 521-532 (1994). \\شماره٪٪۲۷ V‌a‌n G‌e‌n‌u‌c‌h‌t‌e‌n, M.T. A c‌l‌o‌s‌e‌d-f‌o‌r‌m e‌q‌u‌a‌t‌i‌o‌n f‌o‌r p‌r‌e‌d‌i‌c‌t‌i‌n‌g t‌h‌e h‌y‌d‌r‌a‌u‌l‌i‌c c‌o‌n‌d‌u‌c‌t‌i‌v‌i‌t‌y o‌f u‌n‌s‌a‌t‌u‌r‌a‌t‌e‌d s‌o‌i‌l‌s 1'', {\\i‌t S‌o‌i‌l S‌c‌i‌e‌n‌c‌e S‌o‌c‌i‌e‌t‌y o‌f A‌m‌e‌r‌i‌c‌a j‌o‌u‌r‌n‌a‌l}, {\\b‌f 44}(5), p‌p. 898-892 (1980). \\شماره٪٪۲۸ L‌e‌i‌j, F.J., R‌u‌s‌s‌e‌l‌l, W.B. a‌n‌d L‌e‌s‌c‌h, S.M. C‌l‌o‌s‌e‌d-f‌o‌r‌m e‌x‌p‌r‌e‌s‌s‌i‌o‌n‌s f‌o‌r w‌a‌t‌e‌r r‌e‌t‌e‌n‌t‌i‌o‌n a‌n‌d c‌o‌n‌d‌u‌c‌t‌i‌v‌i‌t‌y d‌a‌t‌a'', {\\i‌t G‌r‌o‌u‌n‌d‌w‌a‌t‌e‌r}, {\\b‌f 35}(5), p‌p. 848-858 (1997). \\شماره٪٪۲۹ B‌u‌r‌g‌e‌r, C.A. a‌n‌d S‌h‌a‌c‌k‌e‌l‌f‌o‌r‌d, C.D. E‌v‌a‌l‌u‌a‌t‌i‌n‌g d‌u‌a‌l p‌o‌r‌o‌s‌i‌t‌y o‌f p‌e‌l‌l‌e‌t‌i‌z‌e‌d d‌i‌a‌t‌o‌m‌a‌c‌e‌o‌u‌s e‌a‌r‌t‌h u‌s‌i‌n‌g b‌i‌m‌o‌d‌a‌l s‌o‌i‌l-w‌a‌t‌e‌r c‌h‌a‌r‌a‌c‌t‌e‌r‌i‌s‌t‌i‌c c‌u‌r‌v‌e f‌u‌n‌c‌t‌i‌o‌n‌s'', {\\i‌t C‌a‌n‌a‌d‌i‌a‌n G‌e‌o‌t‌e‌c‌h‌n‌i‌c‌a‌l J‌o‌u‌r‌n‌a‌l}, {\\b‌f 38}(1), p‌p. 53-66 (2001). \\شماره٪٪۳۰ L‌e‌o‌n‌g, E.C. a‌n‌d R‌a‌h‌a‌r‌d‌j‌o, H. R‌e‌v‌i‌e‌w o‌f s‌o‌i‌l-w‌a‌t‌e‌r c‌h‌a‌r‌a‌c‌t‌e‌r‌i‌s‌t‌i‌c c‌u‌r‌v‌e e‌q‌u‌a‌t‌i‌o‌n‌s'', {\\i‌t J‌o‌u‌r‌n‌a‌l o‌f G‌e‌o‌t‌e‌c‌h‌n‌i‌c‌a‌l a‌n‌d G‌e‌o‌e‌n‌v‌i‌r‌o‌n‌m‌e‌n‌t‌a‌l E‌n‌g‌i‌n‌e‌e‌r‌i‌n‌g}, {\\b‌f 123}(12), p‌p. 1106-1117 (1997). \\شماره٪٪۳۱ L‌a‌l‌o‌u‌i, L. M‌e‌c‌h‌a‌n‌i‌c‌s o‌f u‌n‌s‌a‌t‌u‌r‌a‌t‌e‌d g‌e‌o‌m‌a‌t‌e‌r‌i‌a‌l‌s'', J‌o‌h‌n W‌i‌l‌e‌y \\& S‌o‌n‌s (2013)." ]
[ null, "https://sjce.journals.sharif.edu/images/dor.png", null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.6473187,"math_prob":0.9882826,"size":5773,"snap":"2023-40-2023-50","text_gpt3_token_len":2068,"char_repetition_ratio":0.15461951,"word_repetition_ratio":0.08058124,"special_character_ratio":0.33622032,"punctuation_ratio":0.2673931,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9846136,"pos_list":[0,1,2],"im_url_duplicate_count":[null,null,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2023-12-02T06:00:24Z\",\"WARC-Record-ID\":\"<urn:uuid:6e721bd2-b628-46c5-b622-a59a17e8911b>\",\"Content-Length\":\"80480\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:29a7d864-6f42-4184-9679-5798163740f2>\",\"WARC-Concurrent-To\":\"<urn:uuid:f306b843-abbf-47ba-8d96-5bcba0bec62c>\",\"WARC-IP-Address\":\"81.31.168.62\",\"WARC-Target-URI\":\"https://sjce.journals.sharif.edu/article_21838.html\",\"WARC-Payload-Digest\":\"sha1:VTRZORQSI4XIT3ZTXRDFM5VSPC6TKDZ7\",\"WARC-Block-Digest\":\"sha1:52EW7XYCVVSCUUTSUAFMCIZIP5P4TYPV\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2023/CC-MAIN-2023-50/CC-MAIN-2023-50_segments_1700679100327.70_warc_CC-MAIN-20231202042052-20231202072052-00615.warc.gz\"}"}
https://practice.geeksforgeeks.org/problems/sum-of-query-i/0
[ "", null, "Timer is Running\n\nSum of Query I\n##### Submissions: 900   Accuracy: 44.93%   Difficulty: Easy   Marks: 2\n\nYou need to calculate the following sum over Q queries.:\n\nAssume array to be 1-indexed.\n\nInput:\nThe first line of  input contains T, the number of test cases. T testcases follow. The first line of each testcase contains contains the size of array N. The second line of each test case contains the elements of array. The third  line of each test case contains q queries to be performed. The final line contains 2*q elements. The first element denoting L and the second element denoting R.\n\nOutput:\nFor each testcase, in a new line, print the required sum.\n\nConstraints:\n1 <= T <= 10\n1 <= N <= 103\n1 <= arr[i] <= 104\n1 <= Q <= 103\n1 <= L <= R <= N\n\nExample:\nInput:\n1\n7\n2 3 4 5 1 6 7\n4\n1 7 2 4 2 6 3 7\n\nOutput:\n714 64 230 304\n\n#### ** For More Input/Output Examples Use 'Expected Output' option **\n\nAuthor: jain_rishabh\n\nIf you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there." ]
[ null, "https://www.facebook.com/tr", null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.81852007,"math_prob":0.90838486,"size":875,"snap":"2020-24-2020-29","text_gpt3_token_len":247,"char_repetition_ratio":0.1423651,"word_repetition_ratio":0.023121387,"special_character_ratio":0.3097143,"punctuation_ratio":0.11518325,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9877555,"pos_list":[0,1,2],"im_url_duplicate_count":[null,null,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2020-07-07T16:47:16Z\",\"WARC-Record-ID\":\"<urn:uuid:febb1e82-7a47-46be-b26d-560425b4f986>\",\"Content-Length\":\"108340\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:684b1dc8-c913-4bb0-9c06-c150d8540fd9>\",\"WARC-Concurrent-To\":\"<urn:uuid:8a540233-711a-46df-872a-8898c95fef27>\",\"WARC-IP-Address\":\"104.96.221.163\",\"WARC-Target-URI\":\"https://practice.geeksforgeeks.org/problems/sum-of-query-i/0\",\"WARC-Payload-Digest\":\"sha1:ADDI4QMR3Y4KTRWMOPCGDZE7UVQZ4PYO\",\"WARC-Block-Digest\":\"sha1:GXW6CEOUEFRRPP24V25U2YYZOV4BGWLM\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2020/CC-MAIN-2020-29/CC-MAIN-2020-29_segments_1593655893487.8_warc_CC-MAIN-20200707142557-20200707172557-00021.warc.gz\"}"}
https://www.imperialstudy.com/linear-programming-ncert-exemplar-problems-solutions-class-12th/
[ "# Linear Programming NCERT Exemplar Problems Solutions Class 12th\n\n0\n2372", null, "## NCERT Exemplar Problems Class 12 Mathematics Chapter 12 Linear Programming", null, "", null, "4. Minimize Z = 13x- 15y subject to the constraints: x+y≤ 7,2x-3y + 6 ≥ 0, x ≥ 0, y ≥ 0.\nSol. We have to Minimize Z = 13x – 15y subject to the constraints x + y ≤7, 2x – 3y + 6 ≥ 0, x ≥ 0, y ≥ 0. These inequalities are plotted as shown in the following figure.", null, "", null, "8. Refer to Exercise 7 above. Find the maximum value of Z.\nSol. Z is maximum at (3,2) and its maximum value is 47.\n\n9. The feasible region for a LPP is shown in the following figure. Evaluate Z = 4x+y at each of the comer points of this region. Find the minimum value of Z, if it exists.", null, "Now, we see that 3 is the smallest value of Z the comer point (0, 3). Note that here we see that, the region is unbounded, therefore 3 may not be the minimum value of Z. To decide this issue, we graph the inequality 4x + y < 3 and check whether the resulting open half plane has no point in common with feasible region otherwise, Z has no minimum value.\nFrom the shown graph above, it is clear that there is no point in common with feasible region and hence Z has minimum value 3 at (0, 3).\n\n10. In the following figure, the feasible region (shaded) for a LPP is shown. Determine the maximum and minimum value of Z = x + 2y", null, "", null, "11. A manufacturer of electronic circuits has a stock of 200 resistors, 120 transistors and 150 capacitors and is required to produce two types of circuits A and B. Type A requires 20 resistors, 10 transistors and 10 capacitors. Type B requires 10 resistors, 20 transistors and 30 capacitors. If the profit on type A circuit is Rs 50 and that on type B circuit is Rs 60, formulate this problem as a LPP so that the manufacturer can maximise his profit.\nSol. Let the manufacture produces x units of type A circuits and y units of type B circuits. Form the given information, we have following corresponding constraint table.", null, "", null, "12. A firm has to transport 1200 packages using large vans which can carry 200 packages each and small vans which can take 80 packages each. The cost for engaging each large van is Rs 400 and each small van is Rs 200. Not more than Rs 3000 is to be spent on the job and the number of large vans can not exceed the number of small vans. Formulate this problem as a LPP given that the objective is to minimise cost.\nSol. Let the firm has x number of large vans and y number of small vans.\nFrom the given information, we have following corresponding constraint table.", null, "13. A company manufactures two types of screws A and B. All the screws have to pass through a threading machine and a slotting machine. A box of Type A screws requires 2 minutes on the threading machine and 3 minutes on the slotting machine. A box of type B screws requires 8 minutes of threading on the threading machine and 2 minutes on the slotting machine. In a week, each machine is available for 60 hours. On selling these screws, the company gets a profit of Rs 100 per box on type A screws and Rs 170 per box on type B screws. Formulate this problem as a LPP given that the objective is to maximise profit.\nSol. Let the company manufactures x boxes of type A screws and y boxes of type B screws.\nFrom the given information, we have following corresponding constraint table.", null, "14. A company manufactures two types of sweaters: type A and type B. It costs Rs 360 to make a type A sweater and Rs 120 to make a type B sweater. The company can make at most 300 sweaters and spend at most Rs 72000 a day. The number of sweaters of type B cannot exceed the number of sweaters of type A by more than 100. The company makes a profit of Rs 200 for each sweater of type A and ?120 for every sweater of type B. Formulate this problem as a LPP to maximise the profit to the company.\nSol. Let the company manufactures x number of type A sweaters and y number of type B.\nThe company spend at most Rs 72000 a day.\n∴ 360x + 120y ≤ 72000\n=> 3x+y≤ 600 …(i)\nAlso, company can make at most 300 sweaters.\n∴ x+y≤ 300 …(ii)\nAlso, the number of sweaters of type B cannot exceed the number of sweaters of type A by more than 100 i.e., y-x≤ 100\nThe company makes a profit of Rs 200 for each sweater of type A and Rs 120 for every sweater of type B\nSo, the objective function for maximum profit is Z = 200x + 120y subject to constraints.\n3x+y≤ 600\nx+y ≤ 300\nx-y ≥ -100\nx ≥ 0, y ≥ 0\n\n15. A,man rides his motorcycle at the speed of 50 km/hour. He has to spend Rs 2 per km on petrol. If he rides it at a faster speed of 80 km/hour, the petrol cost increases to Rs 3 per km. He has atmost Rs120 to spend on petrol and one hour’s time. He wishes to find the maximum distance that he can travel. Express this problem as a linear programming problem.\nSol. Let the man rides to his motorcycle to a distance x km at the speed of 50 km/h and to a distance y km at the speed of 80 km/h.\nTherefore, cost on petrol is 2x + 3y.\nSince, he has to spend Rs120 atmost on petrol.\n∴ 2x + 3y ≤ 120 …(i)\nAlso, he has at most one hour’s time.", null, "16. Refer to Exercise 11. How many of circuits of Type A and of Type B, should be produced by the manufacturer so as to maximize his profit? Determine the maximum profit.", null, "", null, "", null, "", null, "", null, "", null, "", null, "22. A manufacturer produces two Models of bikes’-Model X and Model Y. Model X takes a 6 man-hours to make per unit, while Model Y takes 10 man-hours per unit. There is a total of 450 man-hour available per week. Handling and Marketing costs are Rs 2000 and Rs 1000 per unit for Models X and Y respectively. The total funds available for these purposes are Rs 80,000 per week. Profits per unit for Models X and Y are Rs 1000 and Rs 500, respectively. How many bikes of each model should the manufacturer produce so as to yield a maximum profit? Find the maximum profit.", null, "So, for maximum profit manufacture must produces 25 number of models X and 30 number of model Y bikes.\n\n23. In order to supplement daily diet, a person wishes to take some X and some Y tablets. The contents of iron, calcium and vitamins in X and Y (in milligrams per tablet) are given as below:", null, "The person needs at least 18 milligrams of iron, 21 milligrams of calcium and 16 milligram of vitamins. The price of each tablet of X and Y is Rs 2 and Rs 1 respectively. How many tablets of each should the person take in order to satisfy the above requirement at the minimum cost?", null, "From the figure, we can see the feasible region is unbounded region, with comer points as A(%, 0), B(6,1), C(I, 6), and D(0, 9)", null, "Thus, the minimum value of Z is ‘8’ occurring at B( 1, 6). Since the feasible region is unbounded, ‘8’ may not be the minimum value of Z. To decide this, we plot the inequality 2x+y < 8 and check whether the resulting open half has points common with feasible region or not If it has common point, then 8 will not be the minimum value of Z, otherwise 8 will be the minimum value of Z. Thus, from the graph it is clear that, it has no common point.\nTherefore, Z= 2x+y-has 8 as minimum value subject to the given constrains. Hence, the person should take 1 unit of X tablet and 6 units of Y tablets to satisfy the given requirements and at the minimum cost of Rs 8.\n\n24. A company makes 3 models of calculators: A, B and C at factory I and factory II. The company has orders for at least 6400 calculators of model A, 4000 calculator of model B and 4800 calculator of model C. At factory I, 50 calculators of model A, 50 of model B and 30 of model C are made every day; at factory II, 40 calculators of model A, 20 of model B and 40 of model C are made everyday. It costs Rs 12000 and Rs 15000 each day to operate factory I and II, respectively. Find the number of days each factory should operate to minimize the operating costs and still meet the demand.", null, "", null, "", null, "Objective Type Questions\n26. The comer points of the feasible region determined by the system of linear constraints are (0,0), (0,40), (20,40), (60,20), (60,0). The objective function is Z=4x + 3y.\nCompare the quantity in Column A and Column B\nColumn A Column B\nMaximum of Z 325\n(a) The quantity in column A is greater\n(b) The quantity in column B is greater\n(c) The two quantities are equal\n(d) The relationship can not be determined on the basis of the information supplied .\nSol. (b)", null, "28. Refer to Exercise 27. Maximum of Z occurs at\n(a) (5,0) (b) (6,5) (c) (6, 8) (d) (4, 10)\nSol. (a) Refer to solution 27, maximum of Z occurs at (5, 0)\n29. Refer to Exercise 27. (Maximum value of Z + Minimum value of Z) is equal to\n(a) 13 (b) 1 (c) -13\nSol. (d) Refer to solution 27,\nmaximum value of Z + minimum value of Z = 15-32 = -17", null, "31. Refer to Exercise 30. Minimum value of F is\n(a) 0 (b) -16 . (c) 12 (d) does not exist\nSol. (b) Referring to solution 30, minimum value of F is -16 at (0,4).\n\n32. Comer points of the feasible region for an LPP are (0, 2), (3, 0), (6,0), (6, 8) and (0,5).\nLet F = 4x + 6y be the objective function.\nThe Minimum value of F occurs at\n(a) (0,2) only\n(b) (3,0) only\n(c) the mid point of the line segment joining the points (0,2) and (3,0) only\n(d) any point on the line segment joining the points (0,2) and (3, 0).\nSol. (d)", null, "33. Refer to Exercise 32, Maximum of F – Minimum of F=\n(a) 60 (b) 48 (c) 42 (d) 18\nSol. (a) Referring to the solution 32, maximum,of F-minimum of F= 72- 12 = 60\n\n34. Comer points of the feasible region determined by the system of linear constraints are (0, 3), (1, 1) and (3, 0). Let Z = px + qy, where p,q>0. Condition on p and q so that the minimum of Z occurs at (3, 0) and (1,1) is\n(a) p = 2q (b )P=q\\2 (c)p = 3q (d) p = q\nSol. (b)", null, "Fill in the Blanks Type Questions\n35. In a LPP, the linear inequalities or restrictions on the variables are called————-.\nSol. In a LPP, the linear inequalities or restrictions on the variables are called linear constraints.\n\n36. In a LPP, the objective function is always————.\nSol. In a LPP, objective function is always linear.\n\n37. If the feasible region for a LPP is————, then the optimal value of the objective function Z= axH-fiy may or may not exist.\nSol. If the feasible region for a LPP is unbounded, then the optimal value of the objective function Z = ax + by may or may not exist.\n\n38. In a LPP if the objective function Z=ax+ by has the same maximum value on two comer points of the feasible region, then every point on the line segment joining these two points give the same————value.\nSol. In a LPP, if the objective function Z = ax + by has the same maximum value on two comer points of the feasible region, then every point on the line segment joining these two points gives the same maximum value.\n\n39. A feasible region of a system of linear inequalities is said to be————if it can be enclosed within a circle.\nSol. A feasible region of a system of linear inequalities is said to be bounded, if it can be enclosed within a circle.\n\n40. A comer point of a feasible region is a point in the region which is the———— of two boundary lines.\nSol. A comer point of a feasible region is a point in the region which is the intersection of two boundary lines.\n\n41. The feasible region for an LPP is always a————polygon.\nSol. The feasible region for an LPP is always a convex polygon.\n\nTrue/False Type Questions\n42. If the feasible region for a LPP is unbounded, maximum or minimum of the objective function Z = ax+ by may or may not exist.\nSol. True\n\n43. Maximum value of the objective function Z = ax+ by in a LPP always occurs\nat only one comer point of the feasible region. ,\nSol. False\n\n44. In a LPP, the minimum value of the objective function Z = ax+ by is always 0 if origin is one of the comer point of the feasible region.\nSol. False\n\n45. In a LPP, the maximum value of the objective function Z = ax+ by is always finite.\nSol. True" ]
[ null, "https://www.imperialstudy.com/wp-content/uploads/2018/03/31260337463_6bd08d6b24_o.jpg", null, "https://imperialstudy.com/wp-content/uploads/2018/03/31952865541_5fa3945f73_o.jpg", null, "https://imperialstudy.com/wp-content/uploads/2018/03/31952865471_85e9800bdc_o.jpg", null, "https://imperialstudy.com/wp-content/uploads/2018/03/31952865371_721781227d_o.jpg", null, "https://imperialstudy.com/wp-content/uploads/2018/03/31952865481_19e32f5059_o.jpg", null, "https://imperialstudy.com/wp-content/uploads/2018/03/31952865151_0164a4a5ef_o.jpg", null, "https://imperialstudy.com/wp-content/uploads/2018/03/31952865081_c41b011acd_o.jpg", null, "https://imperialstudy.com/wp-content/uploads/2018/03/31952864951_e6e6bc0b84_o.jpg", null, "https://imperialstudy.com/wp-content/uploads/2018/03/31952864841_9c429fde85_o.jpg", null, "https://imperialstudy.com/wp-content/uploads/2018/03/31952864721_cf964d9dfe_o.jpg", null, "https://imperialstudy.com/wp-content/uploads/2018/03/31952864511_7673d7c6c5_o.jpg", null, "https://imperialstudy.com/wp-content/uploads/2018/03/31952864441_a67e73d110_o.jpg", null, "https://imperialstudy.com/wp-content/uploads/2018/03/31952864341_b99ba64351_o.jpg", null, "https://imperialstudy.com/wp-content/uploads/2018/03/31952864241_854afd5899_o.jpg", null, "https://imperialstudy.com/wp-content/uploads/2018/03/31952864261_efae770d62_o.jpg", null, "https://imperialstudy.com/wp-content/uploads/2018/03/31695697120_f32e57a112_o.jpg", null, "https://imperialstudy.com/wp-content/uploads/2018/03/31952864031_efaf5bb68b_o.jpg", null, "https://imperialstudy.com/wp-content/uploads/2018/03/31952863941_e75ed27ec7_o.jpg", null, "https://imperialstudy.com/wp-content/uploads/2018/03/31695696900_f98b11bb00_o.jpg", null, "https://imperialstudy.com/wp-content/uploads/2018/03/31952863651_c2e146be60_o.jpg", null, "https://imperialstudy.com/wp-content/uploads/2018/03/31952863661_17693d58be_o.jpg", null, "https://imperialstudy.com/wp-content/uploads/2018/03/31952863411_4661ffc2ff_o.jpg", null, "https://imperialstudy.com/wp-content/uploads/2018/03/31695696570_25f01913e6_o.jpg", null, "https://imperialstudy.com/wp-content/uploads/2018/03/31952863151_fd076c3338_o.jpg", null, "https://imperialstudy.com/wp-content/uploads/2018/03/31952863181_0e0b4ea863_o.jpg", null, "https://imperialstudy.com/wp-content/uploads/2018/03/31952862911_7a01136556_o.jpg", null, "https://imperialstudy.com/wp-content/uploads/2018/03/31695696340_4ac7a01f54_o.jpg", null, "https://imperialstudy.com/wp-content/uploads/2018/03/31952862631_ff87872159_o.jpg", null, "https://imperialstudy.com/wp-content/uploads/2018/03/31260337463_6bd08d6b24_o.jpg", null, "https://imperialstudy.com/wp-content/uploads/2018/03/31952862351_b733322e8b_o.jpg", null, "https://imperialstudy.com/wp-content/uploads/2018/03/31952862301_6b386104b9_o.jpg", null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.8767509,"math_prob":0.9954119,"size":11604,"snap":"2023-40-2023-50","text_gpt3_token_len":3149,"char_repetition_ratio":0.14413793,"word_repetition_ratio":0.16776171,"special_character_ratio":0.28946915,"punctuation_ratio":0.11719352,"nsfw_num_words":1,"has_unicode_error":false,"math_prob_llama3":0.9942889,"pos_list":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,61,62],"im_url_duplicate_count":[null,1,null,1,null,1,null,1,null,1,null,1,null,1,null,1,null,1,null,1,null,1,null,1,null,1,null,1,null,1,null,1,null,1,null,1,null,1,null,1,null,1,null,1,null,1,null,1,null,1,null,1,null,1,null,1,null,1,null,1,null,1,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2023-09-24T10:58:57Z\",\"WARC-Record-ID\":\"<urn:uuid:3370845f-f001-4936-8422-ad15c3256c53>\",\"Content-Length\":\"152635\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:87839109-9ffb-4843-a04e-5d254873d749>\",\"WARC-Concurrent-To\":\"<urn:uuid:a729a493-59fd-4972-9160-5ca79c699634>\",\"WARC-IP-Address\":\"172.67.159.114\",\"WARC-Target-URI\":\"https://www.imperialstudy.com/linear-programming-ncert-exemplar-problems-solutions-class-12th/\",\"WARC-Payload-Digest\":\"sha1:IESAOT3NBQS4NN2ZCGSMRI4BLYMCKTTE\",\"WARC-Block-Digest\":\"sha1:2IHA5AW6XBKNKEEBIRRDPIXXY3C3JRQU\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2023/CC-MAIN-2023-40/CC-MAIN-2023-40_segments_1695233506632.31_warc_CC-MAIN-20230924091344-20230924121344-00552.warc.gz\"}"}
https://www.techusablogs.com/tan-30-degrees/
[ "Tan 30 degrees has a value of 1/3. A unit circle can be used to visually analyse the value of tan /6. In trigonometry, the ratio between the angle’s opposite and adjacent sides is known as the tangent of an angle in a right-angled triangle.\n\nAlso Read: What is the square root of 45\n\n# Tan 30 Degrees\n\nTan 30 degrees can also be expressed in radians as tan /6. Tan 30° has a precise value of 0.57735.\n\n## Tan 30° = 1/√3 = 0.57735\n\n### FAQS\n\n#### What is the tan for 30 degrees?\n\nTan 30° has a precise value of 0.57735.\n\n#### What is the value of TAN 30 in the root?\n\nThe result of the tangent trigonometric function for an angle of 30 degrees is tan 30 degrees. Tan 30° is equal to 1/3 or 0.5774. (approx).\n\n#### How do you convert tan 30 to radians?\n\nSince a whole circle is 360° or 2 radians, double the degree value by 180° to convert it to radians. Tan(30) has an exact value of 33.\n\n#### What fraction is cos 30?\n\nThe fractional value of cos 30 degrees is 3/2, and it is written as cos 30°. Cos 30° = √3/2.\n\n#### What is sin 30 degrees?\n\nThe exact value of sin 30 degrees is ½.\n\n#### What is the value tan 60?\n\nAs a result, tan 60 degrees’ precise value is 3. The same method can be used to determine the values of Tan 0, 30, 45, 90, 180, 270, and 360 degrees." ]
[ null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.835243,"math_prob":0.9980708,"size":1220,"snap":"2023-14-2023-23","text_gpt3_token_len":377,"char_repetition_ratio":0.1875,"word_repetition_ratio":0.032786883,"special_character_ratio":0.34262297,"punctuation_ratio":0.12585033,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.99739546,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2023-03-28T05:35:35Z\",\"WARC-Record-ID\":\"<urn:uuid:81b9ad01-9216-4afc-9975-7833f232da4e>\",\"Content-Length\":\"65298\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:777408d6-a4c1-480c-b42d-364c8ff8afb8>\",\"WARC-Concurrent-To\":\"<urn:uuid:77c29bd3-1670-4548-9a76-accd59e838ad>\",\"WARC-IP-Address\":\"31.170.161.47\",\"WARC-Target-URI\":\"https://www.techusablogs.com/tan-30-degrees/\",\"WARC-Payload-Digest\":\"sha1:UK6Z7M7OMI75SFG5FOWBK7COLOIH2RLP\",\"WARC-Block-Digest\":\"sha1:KRXM73AFQOZLUSK3KORAIMU3OZ6AXPHB\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2023/CC-MAIN-2023-14/CC-MAIN-2023-14_segments_1679296948765.13_warc_CC-MAIN-20230328042424-20230328072424-00475.warc.gz\"}"}
http://v8doc.sas.com/sashtml/ets/chap19/sect22.htm
[ "The SYSLIN Procedure\n\n## MODEL Statement\n\nMODEL response = regressors / options ;\nThe MODEL statement regresses the response variable on the left side of the equal sign against the regressors listed on the right side.\n\nModels can be given labels. Model labels are used in the printed output to identify the results for different models. Model labels are also used in SRESTRICT and STEST statements to refer to parameters in different models. If no label is specified, the response variable name is used as the label for the model. The model label is specified as follows:\n\nlabel: MODEL ... ;\n\nThe following options can be used in the MODEL statement after a slash (/).\n\nALL\nspecifies the CORRB, COVB, DW, I, OVERID, PLOT, STB, and XPX options.\n\nALPHA= value\nspecifies the", null, "parameter for Fuller's modification to the LIML estimation method. See \"Fuller's Modification to LIML\" in the section \"Computational Details\" later in this chapter for more information.\n\nCORRB\nprints the matrix of estimated correlations between the parameter estimates.\n\nCOVB\nprints the matrix of estimated covariances between the parameter estimates.\n\nDW\nprints Durbin-Watson statistics and autocorrelation coefficients for the residuals. If there are missing values, d' is calculated according to Savin and White (1978). Use the DW option only if the data set to be analyzed is an ordinary SAS data set with time series observations sorted in time order. The Durbin-Watson test is not valid for models with lagged dependent regressors.\n\nI\nprints the inverse of the crossproducts matrix for the model, (X'X)-1. If restrictions are specified, the crossproducts matrix printed is adjusted for the restrictions. See the section \"Computational Details\" for more information.\n\nK= value\nspecifies K-class estimation.\n\nNOINT\nsuppresses the intercept parameter from the model.\n\nNOPRINT\nsuppresses the normal printed output.\n\nOVERID\nprints Basmann's (1960) test for over identifying restrictions. See \"Over Identification Restrictions\" in the section \"Computational Details\" later in this chapter for more information.\n\nPLOT\nplots residual values against regressors. A plot of the residuals for each regressor is printed.\n\nSTB\nprints standardized parameter estimates. Sometimes known as a standard partial regression coefficient, a standardized parameter estimate is a parameter estimate multiplied by the standard deviation of the associated regressor and divided by the standard deviation of the response variable.\n\nUNREST\nprints parameter estimates computed before restrictions are applied. The UNREST option is valid only if a RESTRICT statement is specified.\n\nXPX\nprints the model crossproducts matrix, X'X. See the section \"Computational Details\" for more information." ]
[ null, "http://v8doc.sas.com/sashtml/ets/chap19/images/syseq4.gif", null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.6787773,"math_prob":0.93292516,"size":2831,"snap":"2019-13-2019-22","text_gpt3_token_len":629,"char_repetition_ratio":0.13406438,"word_repetition_ratio":0.08520179,"special_character_ratio":0.20664077,"punctuation_ratio":0.12025317,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9771363,"pos_list":[0,1,2],"im_url_duplicate_count":[null,1,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2019-03-20T15:33:51Z\",\"WARC-Record-ID\":\"<urn:uuid:d286494b-ce36-408a-839a-f337087192db>\",\"Content-Length\":\"7344\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:304f7621-4767-43f7-a3f7-5cdd3e8ea2f2>\",\"WARC-Concurrent-To\":\"<urn:uuid:5a132e2e-eb29-428e-9c22-7749a4b91ac8>\",\"WARC-IP-Address\":\"149.173.160.43\",\"WARC-Target-URI\":\"http://v8doc.sas.com/sashtml/ets/chap19/sect22.htm\",\"WARC-Payload-Digest\":\"sha1:QD3K5DIKHEY6YMVGLNAUF3DJCKAMG2E3\",\"WARC-Block-Digest\":\"sha1:I6E7DEJVXFL2IK3SQENCBKALWR65DZRM\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2019/CC-MAIN-2019-13/CC-MAIN-2019-13_segments_1552912202433.77_warc_CC-MAIN-20190320150106-20190320172026-00063.warc.gz\"}"}
https://questions.llc/questions/1899181/given-quadrilateral-abcd-has-vertices-at-a-3-4-b-6-7-c-5-5-and
[ "# Given: Quadrilateral ABCD has vertices at A(3,−4), B(6,−7), C(−5,−5), and D(−8,−2).\n\nProve: Quadrilateral ABCD is a parallelogram.\nYou can prove that quadrilateral ABCD is a parallelogram by showing AC bisects BD.\nWhich method will allow you to show AC and BD bisect each other?\n\nA. Find the slopes of AC and BD using the midpoint formula. If the slopes are the same, then the segments bisect each other.\nB. Find the midpoints of AB and DC using the midpoint formula. If the midpoints have the same y-coordinates, then the segments bisect each other.\nC. Find the midpoints of AC and BD using the midpoint formula. If the midpoints have the same coordinates, then the segments intersect at their midpoints.\nD. Find the midpoints of AD and BC using the midpoint formula. If the midpoints have the same x-coordinates, then the segments bisect each other.\n\n1. 👍\n2. 👎\n3. 👁\n4. ℹ️\n5. 🚩" ]
[ null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.8648732,"math_prob":0.99073356,"size":5621,"snap":"2022-40-2023-06","text_gpt3_token_len":1749,"char_repetition_ratio":0.16325441,"word_repetition_ratio":0.03235014,"special_character_ratio":0.30439425,"punctuation_ratio":0.16172938,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.99968326,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2022-10-03T11:17:37Z\",\"WARC-Record-ID\":\"<urn:uuid:c4628321-87f5-4d62-9af1-12e51b117e7c>\",\"Content-Length\":\"22457\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:13611b15-18be-4b3b-97a9-dc5a6355c006>\",\"WARC-Concurrent-To\":\"<urn:uuid:b778b3f6-a174-41e3-8761-5471b7f85b7a>\",\"WARC-IP-Address\":\"45.79.29.166\",\"WARC-Target-URI\":\"https://questions.llc/questions/1899181/given-quadrilateral-abcd-has-vertices-at-a-3-4-b-6-7-c-5-5-and\",\"WARC-Payload-Digest\":\"sha1:ZCHAO4IUQL5WAY2ZJUX6XFXBO7BK3FTO\",\"WARC-Block-Digest\":\"sha1:2YRNY2MUAHQBJCU2JWSGCKLPFCITYE6O\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2022/CC-MAIN-2022-40/CC-MAIN-2022-40_segments_1664030337415.12_warc_CC-MAIN-20221003101805-20221003131805-00113.warc.gz\"}"}
https://blog.besthomeworkhelp.org/matlab-hw-3/
[ "# Matlab hw 3\n\nrite code that performs the following tasks listed below. A hardcopy of the code and results, and an electronic copy of the code will be collected. Code will be executed by the instructor for testing; no errors or warnings should be present and requested output should be presented (prompt, graphical etc.). Remember to comment your code; at the top of your code write a block comment that includes your name, class (OCE 3522), lab number, program name, and date. When turning in your code on Canvas be sure to compress all your m-files into a zip file/folder (Canvas cannot upload m-files) and replace and title your folder oce3522_mlab4_lastname.zip (all in lower case, underscore instead of spaces).\n1.    Create a code that loads the waveheight.txt file. The first column of this data is time in seconds and the second column is water depth in feet.  Detrend the wave depths in order to find wave heights. Use the findpeaks function to identify all the peaks within the data and then display to the user the first peak and last peak and corresponding locations (use 2 significant figures after the decimal place). Call your code wave_lastname.m.\n2.    Create a function that solves the following equation:\n\nThe tolerance should be to 0.001. Display the final answer and the number of iterations it took to complete this process. Call your function iteration_lastname.m.\n3.    Create a new code to implement your function, iteration_lastname. Create a vector ranging from 1 to 5. Use this vector as the input for your iteration function. Create a new matrix, b, the same size as a. Declare x equal to 2. Then, create a for loop that sets b equal to x+a, with x increasing by 2 for each element. (i.e. b(1)=2+a(1), b(2)=4+a(2), b(3)=6+a(3), etc.) Display b after your for loop is complete. Call your code iteration2_lastname.m.\n4.    Create a code that loads the Depth.csv file. This data was taken at a sampling rate of 7 Hz (or 7 samples per second), each row represents 1 s of data collection. Call your code water_lastname.m\na.    Manipulate this into a column vector. Ensure that the data is in the correct order (hint: you must transpose the matrix first before altering the matrix using reshape).\nb.    Create a vector for time that correctly represents the sampling rate used for the data. (Hint: recall that 1 s of data contains 7 data points)\nc.    Detrend the data using the mean value, call these values depth_det. (if you need help with syntax try help detrend)\nd.    Plot your depth_det vector versus time vector and your original data versus time on the same graph. Make your graph detrended data line black and original depth line green. Include a legend and title and label your graph accordingly.\n\n##### \"Looking for a Similar Assignment? Get Expert Help at an Amazing Discount!\"", null, "" ]
[ null, "https://besthomeworkhelp.org/wp-content/uploads/2018/08/order_now-1.png", null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.8544838,"math_prob":0.9006364,"size":2702,"snap":"2023-14-2023-23","text_gpt3_token_len":617,"char_repetition_ratio":0.12750186,"word_repetition_ratio":0.008714597,"special_character_ratio":0.23056994,"punctuation_ratio":0.12857144,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9624785,"pos_list":[0,1,2],"im_url_duplicate_count":[null,null,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2023-06-09T21:46:11Z\",\"WARC-Record-ID\":\"<urn:uuid:012181f1-bd71-4907-a051-f26573831f8f>\",\"Content-Length\":\"73164\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:c4d89977-2fbf-4d13-9f73-c7ee6a9097f1>\",\"WARC-Concurrent-To\":\"<urn:uuid:4b57a0da-bcd2-4b84-a2bc-41bf88afc23a>\",\"WARC-IP-Address\":\"162.0.219.249\",\"WARC-Target-URI\":\"https://blog.besthomeworkhelp.org/matlab-hw-3/\",\"WARC-Payload-Digest\":\"sha1:JLOXE35PUPW7QSH6P35QB4TWQXECIP73\",\"WARC-Block-Digest\":\"sha1:SOOI6U7ZBEFKBJETEA6D7HULXLZ6Z4P5\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2023/CC-MAIN-2023-23/CC-MAIN-2023-23_segments_1685224656833.99_warc_CC-MAIN-20230609201549-20230609231549-00642.warc.gz\"}"}
https://welford-costelloe.com/qa/what-is-the-type-of-sizeof.html
[ "", null, "# What Is The Type Of Sizeof?\n\n## Is int always 32 bit?\n\nint is always 32 bits wide.\n\nsizeof(T) represents the number of 8-bit bytes (octets) needed to store a variable of type T .\n\n(This is false because if say char is 32 bits, then sizeof(T) measures in 32-bit words.) We can use int everywhere in a program and ignore nuanced types like size_t , uint32_t , etc..\n\n## How does sizeof operator work internally?\n\nThe sizeof operator applied to a type name yields the amount of memory that can be used by an object of that type, including any internal or trailing padding. The result is the total number of bytes in the array. For example, in an array with 10 elements, the size is equal to 10 times the size of a single element.\n\n## Is sizeof a keyword in C?\n\nsizeof. The sizeof keyword evaluates the size of data (a variable or a constant). To learn more, visit C operators.\n\n## What is sizeof () in C Mcq?\n\nsizeof operator will treat address as “integer” data type. … Thus 1000 is an address of the memory location thus we can say that sizeof function will always return us the size of starting address.\n\n## What is Type Size_t?\n\nThe datatype size_t is unsigned integral type. It represents the size of any object in bytes and returned by sizeof operator. It is used for array indexing and counting. It can never be negative. The return type of strcspn, strlen functions is size_t.\n\n## Why size of pointer is 4 byte?\n\nThe reason the size of your pointer is 4 bytes is because you are compiling for a 32-bit architecture. As FryGuy pointed out, on a 64-bit architecture you would see 8. You can see that in 64-bit, sizeof(pointer) is 8 . A pointer is just a container for an address.\n\n## What is generic pointer?\n\nA void pointer is a special pointer that can point to object of any type. A void pointer is typeless pointer also known as generic pointer. void pointer is an approach towards generic functions and generic programming in C.\n\n## What does sizeof in C return?\n\nAnswer: sizeof returns the size of the type in bytes. … The sizeof operator yields the size (in bytes) of its operand, which may be an expression or the parenthesized name of a type. The size is determined from the type of the operand. The result is an integer.\n\n## What is the return type of sizeof ()?\n\nThe sizeof operator is the most common operator in C. It is a compile-time unary operator and used to compute the size of its operand. It returns the size of a variable. It can be applied to any data type, float type, pointer type variables.\n\n## How do I write my sizeof operator?\n\nsizeof (type name); The sizeof operator yields an integer equal to the size of the specified object or type in bytes. (Strictly, sizeof produces an unsigned integer value whose type, size_t, is defined in the header\n\n## Does sizeof return an int?\n\nWhen operand is a Data Type. When sizeof() is used with the data types such as int, float, char… etc it simply returns the amount of memory is allocated to that data types.\n\n## Is sizeof a macro?\n\nSizeof is neither a macro nor a function. Its a operator which is evaluated at compile time.\n\n## What is the sizeof () a pointer?\n\nOn 32-bit machine sizeof pointer is 32 bits ( 4 bytes), while on 64 bit machine it’s 8 byte. Regardless of what data type they are pointing to, they have fixed size. To answer your other question.\n\n## Why size of pointer is 8 bytes?\n\nThe 8-byte count taken up by pointers is crucially exclusive to 64-bit machines, and for a reason – 8 bytes is the largest possible address size available on that architecture. Since one byte is equal to eight bits, 64 bits / 8 = 8 represents the size of a pointer.\n\n## Why sizeof int is 4?\n\nIt turns out that on some/many computers, a byte is 8 bits and an int is 32 bits, therefore sizeof(int) == 4. It also turns out on many “32 bit” computers that a pointer can be stored in 32 bits, so therefore sizeof(char*) == sizeof(void*) == 4.\n\n## Is sizeof a preprocessor?\n\nsizeof cannot be used in C preprocessor expressions, such as #if, because it is an element of the programming language, not of the preprocessor syntax, which has no data types. The example below in C++ shows use of sizeof… operator with variadic templates.\n\n## What library is sizeof in C?\n\nsizeof() , while looking like a function call, is actually an operator and part of the language core. No include needed. size_t is defined in various headers: stddef. h , string.\n\n## What is sizeof int?\n\nThe size of an int is really compiler dependent. Back in the day, when processors were 16 bit, an int was 2 bytes. Nowadays, it’s most often 4 bytes on a 32-bit as well as 64-bit systems. Still, using sizeof(int) is the best way to get the size of an integer for the specific system the program is executed on." ]
[ null, "https://mc.yandex.ru/watch/66677188", null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.8963072,"math_prob":0.9773621,"size":5164,"snap":"2021-04-2021-17","text_gpt3_token_len":1215,"char_repetition_ratio":0.1891473,"word_repetition_ratio":0.06797116,"special_character_ratio":0.24748257,"punctuation_ratio":0.119595215,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9508343,"pos_list":[0,1,2],"im_url_duplicate_count":[null,null,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2021-04-11T21:14:35Z\",\"WARC-Record-ID\":\"<urn:uuid:e3fc9248-21fd-4f3e-95f2-0968e40bc482>\",\"Content-Length\":\"38545\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:94ed7e27-13ce-4a1a-befb-cb2d1fea600d>\",\"WARC-Concurrent-To\":\"<urn:uuid:126bc1ca-7b35-4cf5-988e-57e0af45d699>\",\"WARC-IP-Address\":\"87.236.16.235\",\"WARC-Target-URI\":\"https://welford-costelloe.com/qa/what-is-the-type-of-sizeof.html\",\"WARC-Payload-Digest\":\"sha1:LFGINYDR6AWJB6JUEQYTJ7NJ73TSXLDE\",\"WARC-Block-Digest\":\"sha1:6XX3TJBDPHJSRB6DBZUJPI3TUK25S37B\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2021/CC-MAIN-2021-17/CC-MAIN-2021-17_segments_1618038065492.15_warc_CC-MAIN-20210411204008-20210411234008-00411.warc.gz\"}"}
https://leanprover-community.github.io/mathlib4_docs/Mathlib/Topology/Sober.html
[ "# Documentation\n\nMathlib.Topology.Sober\n\n# Sober spaces #\n\nA quasi-sober space is a topological space where every irreducible closed subset has a generic point. A sober space is a quasi-sober space where every irreducible closed subset has a unique generic point. This is if and only if the space is T0, and thus sober spaces can be stated via [QuasiSober α] [T0Space α].\n\n## Main definition #\n\n• IsGenericPoint : x is the generic point of S if S is the closure of x.\n• QuasiSober : A space is quasi-sober if every irreducible closed subset has a generic point.\ndef IsGenericPoint {α : Type u_1} [] (x : α) (S : Set α) :\n\nx is a generic point of S if S is the closure of x.\n\nInstances For\ntheorem isGenericPoint_def {α : Type u_1} [] {x : α} {S : Set α} :\nclosure {x} = S\ntheorem IsGenericPoint.def {α : Type u_1} [] {x : α} {S : Set α} (h : ) :\nclosure {x} = S\ntheorem isGenericPoint_closure {α : Type u_1} [] {x : α} :\ntheorem isGenericPoint_iff_specializes {α : Type u_1} [] {x : α} {S : Set α} :\n∀ (y : α), x y y S\ntheorem IsGenericPoint.specializes_iff_mem {α : Type u_1} [] {x : α} {y : α} {S : Set α} (h : ) :\nx y y S\ntheorem IsGenericPoint.specializes {α : Type u_1} [] {x : α} {y : α} {S : Set α} (h : ) (h' : y S) :\nx y\ntheorem IsGenericPoint.mem {α : Type u_1} [] {x : α} {S : Set α} (h : ) :\nx S\ntheorem IsGenericPoint.isClosed {α : Type u_1} [] {x : α} {S : Set α} (h : ) :\ntheorem IsGenericPoint.isIrreducible {α : Type u_1} [] {x : α} {S : Set α} (h : ) :\ntheorem IsGenericPoint.inseparable {α : Type u_1} [] {x : α} {y : α} {S : Set α} (h : ) (h' : ) :\ntheorem IsGenericPoint.eq {α : Type u_1} [] {x : α} {y : α} {S : Set α} [] (h : ) (h' : ) :\nx = y\n\nIn a T₀ space, each set has at most one generic point.\n\ntheorem IsGenericPoint.mem_open_set_iff {α : Type u_1} [] {x : α} {S : Set α} {U : Set α} (h : ) (hU : ) :\ntheorem IsGenericPoint.disjoint_iff {α : Type u_1} [] {x : α} {S : Set α} {U : Set α} (h : ) (hU : ) :\ntheorem IsGenericPoint.mem_closed_set_iff {α : Type u_1} [] {x : α} {S : Set α} {Z : Set α} (h : ) (hZ : ) :\nx Z S Z\ntheorem IsGenericPoint.image {α : Type u_1} {β : Type u_2} [] [] {x : α} {S : Set α} (h : ) {f : αβ} (hf : ) :\nIsGenericPoint (f x) (closure (f '' S))\ntheorem isGenericPoint_iff_forall_closed {α : Type u_1} [] {x : α} {S : Set α} (hS : ) (hxS : x S) :\n∀ (Z : Set α), x ZS Z\ntheorem quasiSober_iff (α : Type u_3) [] :\n∀ {S : Set α}, x,\nclass QuasiSober (α : Type u_3) [] :\n• sober : ∀ {S : Set α}, x,\n\nA space is sober if every irreducible closed subset has a generic point.\n\nInstances\nnoncomputable def IsIrreducible.genericPoint {α : Type u_1} [] [] {S : Set α} (hS : ) :\nα\n\nA generic point of the closure of an irreducible space.\n\nInstances For\ntheorem IsIrreducible.genericPoint_spec {α : Type u_1} [] [] {S : Set α} (hS : ) :\n@[simp]\ntheorem IsIrreducible.genericPoint_closure_eq {α : Type u_1} [] [] {S : Set α} (hS : ) :\nnoncomputable def genericPoint (α : Type u_1) [] [] [] :\nα\n\nA generic point of a sober irreducible space.\n\nInstances For\ntheorem genericPoint_spec (α : Type u_1) [] [] [] :\n@[simp]\ntheorem genericPoint_closure (α : Type u_1) [] [] [] :\ntheorem genericPoint_specializes {α : Type u_1} [] [] [] (x : α) :\nnoncomputable def irreducibleSetEquivPoints {α : Type u_1} [] [] [] :\n{s | } ≃o α\n\nThe closed irreducible subsets of a sober space bijects with the points of the space.\n\nInstances For\ntheorem ClosedEmbedding.quasiSober {α : Type u_1} {β : Type u_2} [] [] {f : αβ} (hf : ) [] :\ntheorem OpenEmbedding.quasiSober {α : Type u_1} {β : Type u_2} [] [] {f : αβ} (hf : ) [] :\ntheorem quasiSober_of_open_cover {α : Type u_1} [] (S : Set (Set α)) (hS : ∀ (s : S), IsOpen s) [hS' : ∀ (s : S), QuasiSober s] (hS'' : ⋃₀ S = ) :\n\nA space is quasi sober if it can be covered by open quasi sober subsets.\n\ninstance T2Space.quasiSober {α : Type u_1} [] [] :\n\nAny Hausdorff space is a quasi-sober space because any irreducible set is a singleton." ]
[ null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.8468436,"math_prob":0.98706484,"size":1177,"snap":"2023-40-2023-50","text_gpt3_token_len":301,"char_repetition_ratio":0.21057118,"word_repetition_ratio":0.10377359,"special_character_ratio":0.21495327,"punctuation_ratio":0.09051724,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.999597,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2023-09-26T09:23:47Z\",\"WARC-Record-ID\":\"<urn:uuid:7f3e525a-e9a0-4db8-8e94-2a7dbcbcb5c5>\",\"Content-Length\":\"68630\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:ce4a05cb-9945-43c5-ab4e-48b49ce4d160>\",\"WARC-Concurrent-To\":\"<urn:uuid:aa322063-21a3-4201-af72-2952fef9d2a2>\",\"WARC-IP-Address\":\"185.199.111.153\",\"WARC-Target-URI\":\"https://leanprover-community.github.io/mathlib4_docs/Mathlib/Topology/Sober.html\",\"WARC-Payload-Digest\":\"sha1:QY66HOQNEXWLAMGGFKIJKMK5VU5DGE4V\",\"WARC-Block-Digest\":\"sha1:K2TJ2XEFJ5IH4336JZK2A2FPLFJXC6A7\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2023/CC-MAIN-2023-40/CC-MAIN-2023-40_segments_1695233510179.22_warc_CC-MAIN-20230926075508-20230926105508-00860.warc.gz\"}"}
https://gmatclub.com/forum/f-x-x-2-4x-k-12-f-6-0-if-k-is-a-constant-and-n-is-the-312548.html
[ "GMAT Question of the Day: Daily via email | Daily via Instagram New to GMAT Club? Watch this Video\n\n It is currently 24 Jan 2020, 09:13", null, "### GMAT Club Daily Prep\n\n#### Thank you for using the timer - this advanced tool can estimate your performance and suggest more practice questions. We have subscribed you to Daily Prep Questions via email.\n\nCustomized\nfor You\n\nwe will pick new questions that match your level based on your Timer History\n\nTrack\n\nevery week, we’ll send you an estimated GMAT score based on your performance\n\nPractice\nPays\n\nwe will pick new questions that match your level based on your Timer History\n\n#### Not interested in getting valuable practice questions and articles delivered to your email? No problem, unsubscribe here.", null, "", null, "# f(x) = x^2 + 4x + k = 12; f(-6) = 0; if k is a constant and n is the\n\nAuthor Message\nTAGS:\n\n### Hide Tags\n\nMath Expert", null, "V\nJoined: 02 Sep 2009\nPosts: 60645\nf(x) = x^2 + 4x + k = 12; f(-6) = 0; if k is a constant and n is the  [#permalink]\n\n### Show Tags", null, "00:00\n\nDifficulty:", null, "", null, "", null, "55% (hard)\n\nQuestion Stats:", null, "52% (02:15) correct", null, "48% (02:01) wrong", null, "based on 60 sessions\n\n### HideShow timer Statistics\n\nCompetition Mode Question\n\n$$f(x) = x^2 + 4x + k = 12$$; $$f(-6) = 0$$; if k is a constant and n is the number for which $$f(n) = 0$$, what is the value of n?\n\nA) 6\nB) 2\nC) 0\nD) -2\nE) -12\n\n_________________\nMath Expert", null, "V\nJoined: 02 Aug 2009\nPosts: 8336\nRe: f(x) = x^2 + 4x + k = 12; f(-6) = 0; if k is a constant and n is the  [#permalink]\n\n### Show Tags\n\n1\n$$f(x) = x^2 + 4x + k = 12$$; $$f(-6) = 0$$; if k is a constant and n is the number for which $$f(n) = 0$$, what is the value of n?\n\nWe are already given as n=-6 as f(-6)=0, but let us look if there is any other value.\n\n$$f(-6) = (-6)^2 + 4*(-6) + k = 0.........36-24+k=0....k=-12$$\n\n$$f(n) = n^2 + 4n + k = 0......n^2+4n-12=0......n^2+6n-2n-12=0.....(n+6)(n-2)=0$$, so n=-6 or n=2\n\nB\n_________________\nGMAT Club Legend", null, "", null, "V\nJoined: 18 Aug 2017\nPosts: 5725\nLocation: India\nConcentration: Sustainability, Marketing\nGPA: 4\nWE: Marketing (Energy and Utilities)\nRe: f(x) = x^2 + 4x + k = 12; f(-6) = 0; if k is a constant and n is the  [#permalink]\n\n### Show Tags\n\n1\nfirst determine value of k at f(-6) ; k = 0\ncheck with f(x) = x^2+4x-12 =0\nnow the value of f(n)=0 we see comes\nat n = 2\nIMO B\n\nf(x)=x2+4x+k=12f(x)=x2+4x+k=12; f(−6)=0f(−6)=0; if k is a constant and n is the number for which f(n)=0f(n)=0, what is the value of n?\n\nA) 6\nB) 2\nC) 0\nD) -2\nE) -12\nSenior Manager", null, "", null, "P\nJoined: 01 Mar 2019\nPosts: 404\nLocation: India\nConcentration: Strategy, Social Entrepreneurship\nSchools: Ross '22, ISB '20, NUS '20\nGPA: 4\nRe: f(x) = x^2 + 4x + k = 12; f(-6) = 0; if k is a constant and n is the  [#permalink]\n\n### Show Tags\n\nf(x)=x2+4x+k=12 , f(−6)=0 this results in k=0\n\nso for f(x)=0, then x has to be '0'\n\nOA:C\nManager", null, "", null, "G\nJoined: 20 Aug 2017\nPosts: 104\nRe: f(x) = x^2 + 4x + k = 12; f(-6) = 0; if k is a constant and n is the  [#permalink]\n\n### Show Tags\n\n1\nWe are given that f(-6) = 0 which means that -6 is a solution of the function f(x).\n\nf(-6) = (-6)^2 + 4*(-6) + k - 12 = 0.\nfrom here, we get k = 0.\n\nNow we need to find the value of n such that f(n) = 0, which means we need to find the second solution of f(x)\n\nnow, f(x) = x^2 + 4x - 12 = 0\nso f(x) = (x+6)(x-2).\n\nThe other solution for f(x) = 2 = n such that f(n) or f(2) = 0\n\nIMO, B\nVP", null, "", null, "P\nJoined: 24 Nov 2016\nPosts: 1108\nLocation: United States\nRe: f(x) = x^2 + 4x + k = 12; f(-6) = 0; if k is a constant and n is the  [#permalink]\n\n### Show Tags\n\n1\nQuote:\nRe: f(x) = x^2 + 4x + k = 12; f(-6) = 0; if k is a constant and n is the number for which f(n)=0, what is the value of n?\n\nA) 6\nB) 2\nC) 0\nD) -2\nE) -12\n\nf(x) = x^2 + 4x + k = 12\nf(-6) = x^2 + 4x + k = 0, 36-24+k=0, k=-12\nf(n) = x^2 + 4x + k = 0, x^2 + 4x + (-12) = 0,\n(x+6)(x-2)=0, n=2\n\nAns (B)\nDirector", null, "", null, "P\nJoined: 18 May 2019\nPosts: 660\nRe: f(x) = x^2 + 4x + k = 12; f(-6) = 0; if k is a constant and n is the  [#permalink]\n\n### Show Tags\n\n1\nf(x)=x^2+4x+k=12; f(-6)=0. We are to determine n such that f(n)=0\nFrom the given information, f(-6)=0\nf(x=-6)=36-24+k=0, k=-12\nf(x)=x^2+4x-12.\nTo find n, we need to equate f(x)=0 and find the roots. the second root has to be n. We already know one root of f(x), x=-6.\nx^2+4x-12=0\n(x+6)(x-2)=0\nSo the roots of f(x) are -6, and 2.\nn is therefore 2.\n\nSenior Manager", null, "", null, "P\nJoined: 25 Jul 2018\nPosts: 480\nRe: f(x) = x^2 + 4x + k = 12; f(-6) = 0; if k is a constant and n is the  [#permalink]\n\n### Show Tags\n\n1\n$$f(x)=x^{2}+4x+k=12$$;\nf(−6)=0;\n--> if k is a constant and n is the number for which f(n)=0, what is the value of n?\n\n$$f(−6)=x^{2}+4x+k -12=36 -24+ k- 12=0$$\n--> k=0.\n\n$$f(x)=x^{2}+4x-12=0$$;\n--> $$f(n)= n^{2} +4n -12=0$$\n(n+6)*(n-2)=0\n--> n=-6 and n=2\n\nMath Expert", null, "V\nJoined: 02 Sep 2009\nPosts: 60645\nf(x) = x^2 + 4x + k = 12; f(-6) = 0; if k is a constant and n is the  [#permalink]\n\n### Show Tags\n\nBunuel wrote:\n\nCompetition Mode Question\n\n$$f(x) = x^2 + 4x + k = 12$$; $$f(-6) = 0$$; if k is a constant and n is the number for which $$f(n) = 0$$, what is the value of n?\n\nA) 6\nB) 2\nC) 0\nD) -2\nE) -12\n\nOFFICIAL EXPLANATION\n\nThere are two main approaches you can take to solving this problem. You can either solve for k and turn this problem into a simple factoring problem or you can ignore k and reverse factor.\n\nMethod 1: Solve for K.\n\n$$f(x) = x^2 + 4x + k = 12$$\n$$f(x) = x^2 + 4x + k - 12 = 0$$ (subtract 12)\n\nPlug in $$x=-6$$ knowing that the value of f(x) must equal zero since $$f(-6)=0$$.\n$$f(-6) = (-6)^2 + 4(-6) + k - 12 = 0$$\n$$36 -24 + k - 12 = 0$$\n$$0 - k = 0$$ --> $$k = 0$$\n\nThe equation is now:\n$$f(x) = x^2 + 4x + 0 - 12 = 0$$\n$$f(x) = x^2 + 4x - 12 = 0$$\n\nBy factoring: $$x^2 + 4x - 12 = 0$$ equals:\n$$(x+6)(x+n)$$ Note: $$x+6$$ is from $$f(-6)=0$$\n\nSince we need two numbers that add to +4 and multiply to -12, we know that +6 and -2 work. Consequently, (x-2) is a factor and therefore, $$f(+2)=0$$, so $$n = 2$$.\n\nMethod 2: Ignore K.\nA crucial insight in unlocking this problem is recognizing that if f(a) = 0 and f(x) is a quadratic equation in the form $$x^2 + bx + c = 0$$, $$(x – a)$$ is a factor of the equation. In order to get the equation into quadratic form, subtract 12.\n$$f(x) = x^2 + 4x + k = 12$$\n$$f(x) = x^2 + 4x + k – 12 = 0$$\n\nSince $$f(-6) = 0$$, $$(x+6)$$ is a factor.\n\nIt is important to remember how factoring works. Specifically, remember the following:\n$$(x + d)(x + e) = x^2 + dex + de = 0$$\nSo: $$(x + 6)(x + a) = x^2 + 4x + (k – 12)$$\n\nWith this in mind, you know that $$6 + a = 4$$. So, $$a = -2$$ and therefore, $$(x - 2)$$ is the other factor of the quadratic. So, $$f(2) = 0$$ and $$n = 2$$.\n\n_________________", null, "f(x) = x^2 + 4x + k = 12; f(-6) = 0; if k is a constant and n is the   [#permalink] 16 Dec 2019, 23:51\nDisplay posts from previous: Sort by\n\n# f(x) = x^2 + 4x + k = 12; f(-6) = 0; if k is a constant and n is the", null, "", null, "" ]
[ null, "https://cdn.gmatclub.com/cdn/files/forum/styles/gmatclub_light/theme/images/profile/close.png", null, "https://cdn.gmatclub.com/cdn/files/forum/styles/gmatclub_light/theme/images/profile/close.png", null, "https://gmatclub.com/forum/styles/gmatclub_light/theme/images/search/close.png", null, "https://cdn.gmatclub.com/cdn/files/forum/images/avatars/upload/avatar_73391.jpg", null, "https://cdn.gmatclub.com/cdn/files/forum/styles/gmatclub_light/theme/images/viewtopic/timer_play.png", null, "https://cdn.gmatclub.com/cdn/files/forum/styles/gmatclub_light/theme/images/viewtopic/timer_difficult_blue.png", null, "https://cdn.gmatclub.com/cdn/files/forum/styles/gmatclub_light/theme/images/viewtopic/timer_difficult_blue.png", null, "https://cdn.gmatclub.com/cdn/files/forum/styles/gmatclub_light/theme/images/viewtopic/timer_difficult_blue.png", null, "https://cdn.gmatclub.com/cdn/files/forum/styles/gmatclub_light/theme/images/viewtopic/timer_separator.png", null, "https://cdn.gmatclub.com/cdn/files/forum/styles/gmatclub_light/theme/images/viewtopic/timer_separator.png", null, "https://cdn.gmatclub.com/cdn/files/forum/styles/gmatclub_light/theme/images/viewtopic/timer_separator.png", null, "https://cdn.gmatclub.com/cdn/files/forum/images/no_avatar.svg", null, "https://cdn.gmatclub.com/cdn/files/forum/images/ranks/rank_phpbb_7.svg", null, "https://cdn.gmatclub.com/cdn/files/forum/images/avatars/gallery/Simpsons/00009.gif", null, "https://cdn.gmatclub.com/cdn/files/forum/images/ranks/rank_phpbb_4.svg", null, "https://cdn.gmatclub.com/cdn/files/forum/images/no_avatar.svg", null, "https://cdn.gmatclub.com/cdn/files/forum/images/ranks/rank_phpbb_3.svg", null, "https://cdn.gmatclub.com/cdn/files/forum/images/no_avatar.svg", null, "https://cdn.gmatclub.com/cdn/files/forum/images/ranks/rank_phpbb_6.svg", null, "https://cdn.gmatclub.com/cdn/files/forum/images/no_avatar.svg", null, "https://cdn.gmatclub.com/cdn/files/forum/images/ranks/rank_phpbb_5.svg", null, "https://cdn.gmatclub.com/cdn/files/forum/images/no_avatar.svg", null, "https://cdn.gmatclub.com/cdn/files/forum/images/ranks/rank_phpbb_4.svg", null, "https://cdn.gmatclub.com/cdn/files/forum/images/no_avatar.svg", null, "https://cdn.gmatclub.com/cdn/files/forum/images/avatars/upload/avatar_73391.jpg", null, "https://cdn.gmatclub.com/cdn/files/forum/styles/gmatclub_light/theme/images/viewtopic/posts_bot.png", null, "https://www.facebook.com/tr", null, "https://www.googleadservices.com/pagead/conversion/1071875456/", null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.8501254,"math_prob":1.0000072,"size":1766,"snap":"2019-51-2020-05","text_gpt3_token_len":699,"char_repetition_ratio":0.1645857,"word_repetition_ratio":0.107329845,"special_character_ratio":0.48640996,"punctuation_ratio":0.10050251,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":1.000008,"pos_list":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56],"im_url_duplicate_count":[null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2020-01-24T16:15:13Z\",\"WARC-Record-ID\":\"<urn:uuid:14b44821-2fa8-4218-a703-5abe7687b2b7>\",\"Content-Length\":\"864954\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:ee5b5d95-fa85-4767-b972-082b0d7c44b0>\",\"WARC-Concurrent-To\":\"<urn:uuid:e15e49a9-ee17-4f5f-b1cb-fe71d5781c91>\",\"WARC-IP-Address\":\"198.11.238.99\",\"WARC-Target-URI\":\"https://gmatclub.com/forum/f-x-x-2-4x-k-12-f-6-0-if-k-is-a-constant-and-n-is-the-312548.html\",\"WARC-Payload-Digest\":\"sha1:RF7NMTVXQA5MN7ZCRWX55EKF6ETZNA6A\",\"WARC-Block-Digest\":\"sha1:TZUOOOVKYQCQ27UFWKF5APHHKZAARSEI\",\"WARC-Identified-Payload-Type\":\"application/xhtml+xml\",\"warc_filename\":\"/cc_download/warc_2020/CC-MAIN-2020-05/CC-MAIN-2020-05_segments_1579250624328.55_warc_CC-MAIN-20200124161014-20200124190014-00179.warc.gz\"}"}
https://www.studysquare.co.uk/test/Maths/AQA/GCSE/Tree-and-Venn-diagrams
[ "", null, "VIEW IN FULL SCREEN\n\n# AQA GCSE Maths Tree and Venn diagrams", null, "One way of showing combinations of multiple events is through tree diagrams. Each branch is labelled at the end with its outcome and the probability is written alongside the line.", null, "Venn diagrams use circles to represent sets of outcomes. They can show intersections of outcomes (i.e. where both outcomes happen) and unions (the probability of either or both outcomes occuring).", null, "# ✅", null, "FULL SCREEN\n\n# ✅", null, "", null, "" ]
[ null, "https://static.wixstatic.com/media/nsplsh_59475f467879717a397867~mv2_d_2000_1333_s_2.jpg/v1/fill/w_1920,h_1280,al_c,q_90,usm_0.66_1.00_0.01/nsplsh_59475f467879717a397867~mv2_d_2000_1333_s_2.jpg", null, "https://static.wixstatic.com/media/2469d8_e8935ecf9c45409b9f014bcfb06e147d~mv2.png/v1/fill/w_457,h_257,al_c,usm_0.66_1.00_0.01/1654077.png", null, "https://static.wixstatic.com/media/2469d8_11ccad90468e4aceae86410c86816328~mv2.png/v1/fill/w_457,h_257,al_c,usm_0.66_1.00_0.01/Image%20coming%20soon.png", null, "https://static.wixstatic.com/media/2469d8_e8935ecf9c45409b9f014bcfb06e147d~mv2.png/v1/fill/w_457,h_257,al_c,usm_0.66_1.00_0.01/Image%20coming%20soon.png", null, "https://static.wixstatic.com/media/02f4e8_059347cb2f9f4caf8fdd566cda179b0f~mv2.png/v1/fill/w_186,h_140,al_c,lg_1/trasparent34.png", null, "https://static.wixstatic.com/media/02f4e8_059347cb2f9f4caf8fdd566cda179b0f~mv2.png/v1/fill/w_186,h_140,al_c,lg_1/trasparent34.png", null, "https://static.wixstatic.com/media/2469d8_8ebfd17668a940bc9d4b905d9bfd3447~mv2.png/v1/fill/w_127,h_127,al_c,usm_0.66_1.00_0.01/Image.png", null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.92694306,"math_prob":0.8641101,"size":518,"snap":"2021-31-2021-39","text_gpt3_token_len":110,"char_repetition_ratio":0.13035019,"word_repetition_ratio":0.0,"special_character_ratio":0.19305019,"punctuation_ratio":0.10638298,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.97475266,"pos_list":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"im_url_duplicate_count":[null,null,null,1,null,1,null,1,null,null,null,null,null,null,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2021-09-23T14:16:37Z\",\"WARC-Record-ID\":\"<urn:uuid:5a1dfa3c-b661-4ef2-a12f-8256e0f9484a>\",\"Content-Length\":\"779622\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:ee2f96f4-ec6d-4dab-a61c-ead3dd6b921c>\",\"WARC-Concurrent-To\":\"<urn:uuid:89698070-4521-4cbf-bfe9-8b6fcececf20>\",\"WARC-IP-Address\":\"185.230.60.161\",\"WARC-Target-URI\":\"https://www.studysquare.co.uk/test/Maths/AQA/GCSE/Tree-and-Venn-diagrams\",\"WARC-Payload-Digest\":\"sha1:HWP4JK6PJCCINBY7FAPWN4F563MIEE6K\",\"WARC-Block-Digest\":\"sha1:5EPBK7IWIVAYABJQYR6G3POA5U3QKOWL\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2021/CC-MAIN-2021-39/CC-MAIN-2021-39_segments_1631780057424.99_warc_CC-MAIN-20210923135058-20210923165058-00353.warc.gz\"}"}
https://jivp-eurasipjournals.springeropen.com/articles/10.1186/s13640-016-0149-y
[ "# Line and circle detection using dense one-to-one Hough transforms on greyscale images\n\n## Abstract\n\nBy estimating the first-order (direction) and second-order (curvature) derivatives in an image, the parameters of a line or circle passing through a point may be uniquely defined in most cases. This allows to compute a one-to-one Hough transform, every point in the image space voting for one unique point in the parameter space. Moreover, those parameters can be directly estimated on the greyscale image without the need to calculate the contour and without reducing the spatial support of the Hough transform, i.e. densely on the whole image. The general framework using multiscale derivatives is presented, and the one-to-one Hough dense transforms for detecting lines and circles are evaluated and compared with other variants of Hough transforms, from qualitative and computational points of view.\n\n## Introduction\n\nThe Hough transform (HT), one of the oldest algorithms of computer vision [1, 2], has been attracting a continuous interest for more than 50 years, as testified by a number of surveys , the most recent one , mentioning more than 2500 research papers, and citing around 100 post-2000 references. This is due not only to the constant development of applications based on graphics recognition but also to the elegance and generality of the Hough framework, allowing to detect analytical as well as non-analytical shapes in a wide variety of relevant manners.\n\nThe basic principle of the HT is to project the image data within a parameter space representing possible positions of a shape in the image space, then to search accumulation points in the parameter space, corresponding to the most probable positions of the shape in the image. Although many variations have been proposed until recently, it is remarkable that in most cases, the projection (voting process) is sparsely performed on contour or salient points of the image space. In addition, it is almost always performed using one of the two dual methods: one-to-many (one point in the image space votes for an multidimensional surface in the parameter space) or many-to-one (a set of points in the image space votes for one single point in the parameter space).\n\nIn this paper, we advocate the use of dense spatial derivatives instead of reducing the spatial support to a sparse set. Intuitively, this must make the vote more statistically significant and then have a positive influence on robustness. More unexpectedly, this should also lower the computational cost because it removes the selection process and, above all, because in the case of lines and circles, the voting is a one-to-one projection from the image to the parameter space. Although dense HTs have been proposed already, and one-to-one voting has also been used by some authors, to our knowledge, the two concepts have not been used together. Our contributions are the following: (1) a general framework for one-to-one dense Hough transform (DHT) using multiscale spatial derivatives, (2) practical algorithms based on this framework for line and circle detection and (3) a comparative study to evaluate the benefits and the weaknesses of the one-to-one DHTs.\n\nTo compare with other HTs, we define a computational protocol for evaluating the performance of line and circle detection algorithms. The algorithms are tested on real images with manually defined ground truth. Then, for every algorithm, we plot the number of true positive shapes as a function of the number of detected shapes. The robustness to noise and to illumination changes of the different algorithms and their variants are evaluated. We also compare the computational costs of the different methods.\n\nThis paper is organised as follows: Section 2 recalls the fundamentals for Hough transform and multiscale derivatives and present the related works. In Section 3, we present the one-to-one DHT for line and circle detection. Section 4 defines the evaluation protocol, presents comparative results of line and circle detection and discusses them. Section 5 finally outlines the contributions of this work and concludes.\n\n## Related works\n\n### Hough transform\n\nAn n-dimensional binary image I being a subset of $$\\mathbb {R}^{n}$$, an analytical shape may be defined by a parametric equation: $$\\mathcal {C}^{\\mathbf {a_{0}}} = \\left \\{\\mathbf {x} \\in \\mathbb {R}^{n}; \\phi (\\mathbf {x},\\mathbf {a_{0}}) = 0\\right \\}$$, where x is the spatial variable, and $$\\mathbf {a_{0}} \\in \\mathbb {R}^{m}$$ is a constant parameter. Now for a specific $$\\mathbf {x_{0}} \\in \\mathbb {R}^{n}$$, the set $$\\mathcal {D}^{\\mathbf {x_{0}}} = \\left \\{\\mathbf {a} \\in \\mathbb {R}^{m}; \\phi (\\mathbf {x_{0}},\\mathbf {a}) = 0\\right \\}$$, where a is the parametric variable, is a surface in the m-dimensional parameter space, which is the projection, or dual form of point x 0. The sum of all the projections of I is called the Hough transform of I relatively to ϕ:", null, "where", null, "is the indicator function of set A. The most representative shapes within I are finally detected by searching the maxima of $$\\Gamma _{I}^{\\phi }$$.\n\nFor line detection, the polar parametric equation is preferred for uniform quantisation purposes . The space variable is x=(x,y), the parametric variable is a=(θ,ρ) and the parametric equation is x cosθ+y sinθ=ρ. The dual form $$\\mathcal {D}^{(x,y)}$$ is a sine curve. For circle detection, the parametric variable is (c x ,c y ,r) and the parametric equation is (xc x )2+(yc y )2=r 2 . The dual form $$\\mathcal {D}^{(x,y)}$$ is a conic surface.\n\nIn practice, both the image and the parameter space are quantised. The HT is classically applied on a binary image made of thin and regular curves, obtained using a contour detection algorithm. The transform is calculated using one of the two dual methods: (1) The one-to-many projection (a.k.a divergent transform), which consists in scanning every pixel x 0 of the binary image, and then incrementing $$\\Gamma _{I}^{\\phi }$$ on the whole surface $$\\mathcal {D}^{\\mathbf {x_{0}}}$$ as defined above. (2) The many-to-one projection (a.k.a convergent transform), which consists in considering every m-tuple of pixels {x i }1≤im of the binary image such that there exists a unique a 0 in the parameter space such that for all x i , ϕ(x i ,a 0)=0 (e.g. m=2 for lines and m=3 for circles) and then increment only $$\\Gamma _{I}^{\\phi }(\\mathbf {a_{0}})$$.\n\nOne known drawback of the classical HT is their computational cost. If p is the number of voting pixels in the binary image, m the dimension of the parameter space, and k the average number of samples per dimension of the parameter space, the complexity of projection is proportional to pk m−1 for the one-to-many transform, and to $$\\binom {p}{m}$$ for the many to one. The most popular approaches to reduce the complexity consist in decreasing the number of voting pixels by randomly picking a subset of them. For the one-to-many transform, such approach is known as PHT, or probabilistic Hough transform . In the case of many-to-one transforms, it is called RHT, or randomised Hough transform [17, 18]. Classic HT, PHT and RHT have been compared from qualitative and computational perspectives in and .\n\nUsing the local derivatives to improve or to accelerate the HT has been done before, it was proposed for lines by O’Gorman and Clowes and for differentiable curves by Shapiro . In his review article, Maître explicitly mentioned the one-to-one HT for lines and circles. However, these approaches have been scarcely used and—to our knowledge—only on binary curves, never directly on grey level images. The gradient information has been used in line detection for accelerating the HT or for controlling the voting process to improve the progressive PHT . Valenti and Gevers have proposed an efficient eye centre location algorithm based on a voting scheme using the isophote curvature estimation. Recently, Yao and Yi used the curvature of the contour to estimate the radius and then accelerate the circle HT. However, all these approaches still reduced the voting pixels to a thin contour previously calculated.\n\nKesidis and Papamarkos have proposed an invertible grey level HT by using directly the grey level value of the pixels. In their circle detector, Atherton and Kerbyson applied a collection of convolutions on the gradient image, which is equivalent to weighting the HT by the gradient. A dense vote using the gradient and without calculating the contours was performed for line detection by Dahyot . But she used an estimated density kernel to spread the votes in the parameter space, resulting in a computational cost actually higher than the classical approach.\n\nAs a conclusion, amongst the few existing one-to-one HTs, none is a dense method, and none of the existing dense approaches is a one-to-one projection. The framework proposed in this paper, which combines the two, is a systematic approach based on (1) estimating the gradient and/or the curvature on the greyscale image, (2) performing, for all the pixels of the image space, a one-to-one vote in the parameter space, and (3) weighting the vote by the significance of the derivative measure. We argue that (i) generalising the vote to all the pixels make the DHT statistically more significant , (ii) the direct calculation on the grey level removes the dependence to the limits and parameters of the contour detection algorithm and, finally, (iii) although the number of voting points increases by one order of magnitude, the complexity is actually lower because the estimation of derivatives have a computational cost which is lower or comparable to the contour detection algorithm and the one-to-one voting process has a constant complexity. Let us now recall the useful bases on image derivatives.\n\n### Multiscale derivatives on greyscale images\n\nWhen dealing with local structures in images, differential geometry is a very convenient framework and has been used for low-level image modelling and analysis for decades to perform contour detection , point tracking , optical flow estimation , corner , blob or ridge detection . From a biological point of view, the importance of local derivatives up to order two for the human visual system has been acknowledged a long time ago .\n\nIn the differential framework, the image I is considered as a differentiable function from $$\\mathbb {R}^{2}$$ to $$\\mathbb {R}$$. Let (O,x,y) be the Cartesian reference frame of $$\\mathbb {R}^{2}$$. We denote $$I_{x} = \\frac {\\partial I}{\\partial x}$$, $$I_{xx} = \\frac {\\partial ^{2} I}{\\partial x^{2}}$$ and so on.\n\nAt first order, if I=(I x ,I y ) is the gradient vector, the value of the first derivative along any direction represented by unit vector v is given by\n\n$$I_{v} = \\mathbf{v}^{T}. \\nabla I.$$\n(1)\n\nThus, the derivative along the direction orthogonal to the gradient (isophote direction t) is zero, whereas the derivative in the gradient direction g is equal to the gradient magnitude $$||\\nabla I|| = \\sqrt {{I_{x}^{2}} + {I_{y}^{2}}}$$. On every point p such that ||I(p)||>0, the gradient and isophote form a local reference frame (p,g,t) corresponding to first-order gauge coordinates (see Fig. 1). The isophote curve passing through p can be parameterised by the curvilinear coordinate s, such that\n\n$$I(\\mathbf{g}(s),\\mathbf{t}(s)) = I(\\mathbf{p})$$\n(2)\n\nAt second order, if $$H_{I} = \\left (\\begin {array}{ll} I_{xx} & I_{xy}\\\\ I_{xy} & I_{yy} \\end {array}\\right)$$ is the Hessian matrix at point p, the value of the second derivative along any couples of direction represented by unit vectors u and v can be calculated by\n\n$$I_{uv} = \\mathbf{u}^{T} H_{I} \\mathbf{v}.$$\n(3)\n\nOne important second-order measure is the isophote curvature. Consider the displacement of a point along the isophote curve, where the curvilinear coordinate s is assimilated to time, and the local frame (p,g,t) corresponds to the Frenet frame. In this case, the isophote curvature can be defined as the radial acceleration $$\\ddot {\\mathbf {g}}(s)$$, when the displacement is made at unit velocity, i.e. $$\\dot {\\mathbf {t}}(s) = 1$$ (using the notation $$\\dot {\\mathbf {x}} = \\frac {\\partial \\mathbf {x}}{\\partial s}$$ and $$\\ddot {\\mathbf {x}} = \\frac {\\partial ^{2} \\mathbf {x}}{\\partial s^{2}}$$).\n\nDerivating Eq. 2 with respect to s provides\n\n$$\\dot{\\mathbf{g}}~ I_{g} + \\dot{\\mathbf{t}}~ I_{t} = 0.$$\n(4)\n\nSince I t =0, if I g ≠0, we get $$\\dot {\\mathbf {g}} = 0$$. Then, derivating again Eq. 4 with respect to s provides\n\n$$\\dot{\\mathbf{g}}^{2}~ I_{gg} + \\ddot{\\mathbf{g}}~ I_{g} + 2 \\dot{\\mathbf{g}}\\dot{\\mathbf{t}}~ I_{gt} + \\dot{\\mathbf{t}}^{2}~ I_{tt} + \\ddot{\\mathbf{t}}~ I_{t} = 0.$$\n(5)\n\nFinally, since I t =0, $$\\dot {\\mathbf {t}} = 1$$ and $$\\dot {\\mathbf {g}} = 0$$ (if I g ≠0), we get\n\n$$\\ddot{\\mathbf{g}} = - \\frac{I_{tt}}{I_{g}}.$$\n(6)\n\nAnd by using Eqs. 1 and 3, we can get the expression of the isophote curvature κ in Cartesian coordinates \n\n$$\\kappa = \\ddot{\\mathbf{g}} = - \\frac{I_{xx} {I_{y}^{2}} - 2 I_{xy} I_{x} I_{y} + I_{yy} {I_{x}^{2}}}{||\\nabla I||^{3}}$$\n(7)\n\nThe absolute value of the isophote curvature corresponds to the inverse of the radius of the osculating circle to the isophote curve (see Fig. 1), while its sign provides the polarity of the curvature (positive: brighter inside).\n\nWhen I is a digital image, according to the scale space framework [36, 38, 39], the spatial derivatives are estimated relatively to a certain scale σ which represents the level of regularity, explicitely enforced by Gaussian smoothing\n\n$$I_{x^{i} y^{j}}^{\\sigma} = I \\star \\frac{\\partial^{i+j} G_{\\sigma}}{\\partial x^{i} \\partial y^{j}} \\,$$\n(8)\n\nwhere is the convolution and G σ the 2d Gaussian function of standard deviation σ (from now on, when working at a single scale, we will frequently omit the σ superscript).\n\nIn the next section, Hough transforms and multiscale derivatives are put together to form an effective framework for line and circle detection.\n\n## One-to-one dense Hough transforms\n\nThe one-to-one dense Hough transforms (DHT) for lines and circles are presented in this section. They are directly computed on greyscale images using spatial derivatives. The first-order derivatives (gradient vector) are used for the line detection, and the first- and second-order derivatives (gradient vector and Hessian matrix) are used for the circle detection. Section 3.1 exposes the general principles, then the algorithms are presented in Section 3.2. Section 3.3 discusses the implementation details and parameters, and Section 3.4 shows some results.\n\n### General principles\n\nIt can be deduced from Section 2.2 that at any image location p such that ||I(p)||≠0, the knowledge of the two first orders of spatial derivatives allows to calculate the equation of the line or circle possibly present at p. Furthermore, the scale space estimation of the derivative allows to effectively compute the line and/or circle present at many locations directly from the greyscale. This can be seen on Fig. 2, where the lines (a) and circles (b) passing through different locations in the image have been automatically computed using respectively the first-order and the two first-order derivatives. The basic principle of the one-to-one DHT is to generalise this computation to all pixels through a voting process.\n\nMore explicitely, at the first order, using the classical (θ,ρ) polar parametrisation, where ρ is the distance between the line and the origin, and θ is the angle made by the normal to the line with the x axis, if there is a line passing through point p, we must have\n\n$$\\begin{array}{@{}rcl@{}} \\theta_{\\mathbf{p}} & = & \\arg{\\nabla I}, \\end{array}$$\n(9)\n$$\\begin{array}{@{}rcl@{}} \\rho_{\\mathbf{p}} & = & \\frac{| \\mathbf{p}. \\nabla I|}{||\\nabla I||}. \\end{array}$$\n(10)\n\ni.e., θ p corresponds to the direction of the gradient vector and ρ p to the distance between the origin and the line passing through p and perpendicular to the gradient vector. To evaluate the significance of the location with respect to the presence of line, it is natural to use the strength of the first derivative, i.e., the magnitude of the gradient $$||\\nabla I|| = \\sqrt {{I_{x}^{2}} + {I_{y}^{2}}}$$ (see Fig. 3 a, b).\n\nAt the second order, using the (C,r) parametrisation, where $$C \\in \\mathbb {R}^{2}$$ is the centre and r the radius of the circle, if there is a circle passing through point p, we must have\n\n$$\\begin{array}{@{}rcl@{}} r_{\\mathbf{p}} & = & \\frac{1}{|\\kappa_{\\mathbf{p}}|}, \\end{array}$$\n(11)\n$$\\begin{array}{@{}rcl@{}} {\\overrightarrow{\\mathbf{p}C_{\\mathbf{p}}}} & {=} & {\\frac{\\nabla I}{\\kappa_{\\mathbf{p}} ||\\nabla I||}.} \\end{array}$$\n(12)\n\ni.e., the radius r p is the inverse of the absolute curvature κ p calculated at point p using Eq. 7, and the centre C p is obtained by tracing from p the vector whose magnitude corresponds to the radius, whose direction is the same as the gradient and whose sense depends on the sign of curvature. Again, we can evaluate the significance of the location p with respect to the presence of circle by using the strength of the second derivative, i.e., the Frobenius norm of the Hessian matrix $$||H_{I}||_{F} = \\sqrt {I_{xx}^{2} + 2I_{xy}^{2} + I_{yy}^{2}}$$. The convergence of the most significant votes toward the potential circle centres is visible on Fig. 3 c, d.\n\nIn the multiscale DHT, we will combine the derivatives estimated at different scales. If the votes account for the relative importance of a given derivative at a certain location, it is advisable to normalise the corresponding derivative according to the scale and to the order of derivation σ . Then, the multiscale voting weights will be σ||I|| at order 1 and σ 2||H I || F at order 2.\n\n### DHT algorithms\n\n#### Line DHT\n\nThe one-to-one DHT algorithm for line detection using the (θ,ρ) parametrisation is presented on Table 1.\n\nThis algorithm is directly deduced from Eqs. 9 and 10. An example of 1-to-1 line DHT can be seen on Fig. 6 d.\n\n#### Circle DHT basic (V1)\n\nTable 2 shows the basic algorithm for circle detection, based on 1-to-1 dense votes in the 3d (c x ,c y ,ρ) parameter space.\n\nThis algorithm is directly deduced from Eqs. 11 and 12. An example of 1-to-1 circle DHT V1 can be seen on Fig. 8 (2, right).\n\n#### Circle DHT two-pass (V2)\n\nThe straightforward implementation of the one-to-one DHT for circles does not provide good results in general. This is due to the fact that several scales of estimation are usually needed to improve the detection of the centres, but they also disperse the votes for the radius component, which makes the detection difficult.\n\nTo address this problem, a two-pass algorithm can be applied. The whole algorithm is detailed on Table 3. It first computes a one-to-one partial DHT Γ 1, where the parameter space is reduced to the 2d (c x ,c y ) centre space. This first pass (lines 3 to 13) then concentrates the votes for all radii, reducing the sparsity and improving the centre localisation. The N best centres are selected from Γ 1 (line 15), and then a second pass is applied to accumulate the possible radii for a circle centred on one of these N candidate centres. In this second pass (lines 17 to 27), one single scale (the smallest σ 1) is used, to determine for every pixel p, in a one-to-one manner, the centre and radius of a circle possibly passing through p (lines 18 to 21). Then, it is checked if the estimated centre matches one (or several) previously selected candidate centres, and when it does, the accumulator array Γ 2 for the corresponding candidate and radius is incremented (lines 22 to 26).\n\nTwo-pass algorithms are now classical in Hough-based circle detection , but their first pass is a one-to-many 2d HT, where the votes are made along straight lines, either defined by the gradient direction [41, 42], or by the bissector of a point pair chord . In our V2 version, the first pass is a one-to-one DHT based on the isophote curvature. Figure 8 (4, right) shows an example of such first pass (centre detection).\n\n### Implementation and parameters\n\nAlthough simpler in many aspects, the one-to-one dense Hough transform, like its one-to-many or many-to-one counterparts, is sensitive on implementation details and parameters. The purpose of this section is to go into deeper details on each part of the algorithms.\n\nThe DHT uses a norm-based censitary suffrage: all the pixels vote, but their vote is weighted according to the norm of the corresponding derivative. When using different scales, the scale should also take part to the weight as a scale space normalisation. The votes are then weighted by σ||I|| at order 1 and σ 2||H I || F at order 2. The justification of using this weight is that the relevant features (line or osculating circle positions) are poorly defined when the contrast (||I||) or the global curvature (κ) is too weak.\n\nHowever, such weighting naturally favours the highly contrasted structures, which is not always desirable. A radical method for being contrast invariant is to use a true egalitarian suffrage, with uniform weight ω=1.0, which conversely may favour spurious structures like jpeg artefacts. Obviously, many trade-offs can be applied, like using a uniform weight but selecting the voting pixels with threshold or weighting by the logarithm of the norm. Different weighting strategies will be compared and discussed in the evaluation section (see Section 4).\n\n#### Multiscale derivatives\n\nA proper estimation of the derivatives is essential for the DHT. The poor results obtained using finite difference on curves, or small convolution kernels on greyscale images (particularly for the curvature), probably explain the very little attention received by one-to-one HT so far. Nevertheless, the scale space estimation of derivatives allows an accurate and noise robust estimation of gradient and curvatures at different scales. In this work, we used the recursive implementation of the (approximated) Gaussian convolution proposed by Young and van Vliet . The best estimation scale locally depends on the image structure and the noise level. It could be selected automatically from the image , but simply aggregating the votes at the different scales with their different weights is actually faster and closer to the Hough spirit.\n\nThe number and the values of scales thus have an influence on the results. At larger scales, the number of structures decrease but their localisation is less precise: in the Hough space, the peaks are less numerous, but more flattened. In this sense, combining multiple scales can improve the detection, as illustrated on Fig. 4: the finer scales improve the localisation of the main peaks while the coarser scales reduce the influence of the spurious structures. Furthermore, the use of several scales may also improve the detection by reducing the sparsity of the DHT.\n\nWhat was observed in our experiments (see Section 4) is that for line detection, the use of more than one scale is unnecessary for noise-free images. For circles, the V1 and V2 versions work better with multiple scales. For V2 version, the first pass uses several scales, as it clearly improves the detection of the centres, while the second pass (radius voting) performs better by using one single scale, the finest one. Figure 5 illustrates this behaviour by showing on a toy example that only the multiscale version of the V2 algorithm correctly detects all the circles.\n\n#### Parameter space representation and maxima selection\n\nThe representation of the parameter space has a major influence on the precision of the detection and also on its complexity. The most classical method consists in quantising every dimension of the parameter space according to the desired precision of the detection, voting by simply incrementing the nearest node of the quantised space, and then choosing the highest local maxima as the best shapes. This is what is done for the one-to-many methods because a sufficiently high precision is needed to draw significant dual surfaces in the parameter space.\n\nBecause the comparative evaluation in the next section is performed against one-to-many methods, we have essentially used the same classical representation, referred to as “fine-grained parameter space”. This allowed to focus the comparison on the impact of our contribution, that is on the voting process, i.e., dense one-to-one vs. sparse one-to-many.\n\nIt is well known that detecting the N local maxima with highest value is not sufficient in general to avoid multiple detections (a beam of shapes corresponding to the same physical structure). In our experiments using fine-grained parameter space, we employed non-local maxima deletion as well as an exclusion distance criterion which consists in discarding, in the Hough space, all values whose distance to a previously selected point is below a certain threshold. Defining the exclusion ball in general should not be a fundamental problem, since it relates to the expected spatial distribution of the shapes.\n\nThe one-to-one, like the many-to-one transforms, are naturally sparser than the one-to-many transforms, every pixel voting for a single point. For circles, the sparsity of the basic one-to-one transform (V1) is still more important because of a larger parameter space. The sparsity can be moderated a priori by interpolating the votes and a posteriori by smoothing the transform. For the V1 version of the circle detector applied on Fig. 8 (2), a separable recursive exponential smoothing filter (γ=2.0) was applied in the 3d Hough space.\n\nMore interestingly, voting for one single location in the parameter space releases the strict need for quantisation. As done by Xu in the case of many-to-one RHT , dynamical accumulation data structures (e.g. lists or trees) can be used to store the estimated parameters without modifying them and then perform clustering-based accumulation search. The number of votes of the DHT being relatively high, and the dimension of the parameter space being low, one natural data structure is a simple grid like in the previous case, except that the step of the grid is much larger (it no longer depends on a desired localisation precision, but rather corresponds to the exclusion ball used to address multiple detections). The other difference is that instead of coding only a number of votes, every cell of the grid is a bucket containing a list of parameters with their associated weights.\n\nIn fact, the actual method used in our experiments is a very simple and efficient approximation of this large step bucket grid, calculated as follows: instead of storing the whole bucket list for every cell, we only keep one single weight value for every (large) cell, which finally makes the data structure identical as in the classical case, except that the quantification step is much larger (and then the resulting size much lower). However, to limit the effects of quantization, for every estimated parameter, the vote is multi-linearly interpolated over the corresponding cell bounds. For every pixel, let Q be the (real-valued) calculated parameter vector and ω Q the associated weight. Let Q be the integer valued vector made of the integer parts of every component of Q. Let R=QQ the residual part of Q, with components in [0,1[. If m is the dimension of the parameter space, the interpolated vote consists in incrementing the 2m cells Γ(Q+B), for all B{0,1}m, by a value ω B such that:\n\n$$\\omega_{\\mathbf{B}} = \\omega_{\\mathbf{Q}} \\prod\\limits_{i=1}^{m} \\mathbf{R}_{i}^{\\mathbf{B}_{i}} (1 - \\mathbf{R}_{i})^{(1 - \\mathbf{B}_{i})}$$\n\nOnce the vote is completed, the best shapes are detected by searching the highest local maxima on the grid and then calculating the centroids of the parameters in the 3m neighbourhood for every selected maximum. This alternate method shall be referred to as “coarse-grained parameter space,” and its impact will be evaluated in Section 4.\n\n### DHT results\n\nFigure 6 shows line detection results using the (θ,ρ) parameter space for the DHT (Fig. 6 d) compared with the classic exhaustive one-to-many HT (all the contour points are voting, Fig. 6 b). For the classic HT, the contour (Fig. 6 a) is obtained using Canny algorithm with σ=1.5 and hysteresis threshold with t 1=1.0 and t 2=2.0. For the DHT, the transform is obtained by estimating the gradients at a single scale σ=1.5. For both methods, the parameter space was quantised using 720 samples for θ, the resolution for ρ being set according to the image diagonal, and the 50 best maxima were selected using the exclusion condition (θ e ,ρ e )=(15,12) (which means that two lines with parameters such that |θ 1θ 2|<θ e AND |ρ 1ρ 2|<ρ e cannot be detected at the same time, see Section 3.3). The 50 best lines are overlaid in magenta on the images that have been used for calculating the transform (Fig. 6 a, c).\n\nFigure 7 shows two more results for line detection, with the same parameters as above. The 30 best lines are displayed for the first image, the 50 best ones for the second. These results are compared with the classic one-to-many HT calculated on contours (version called HoughStandard available on OpenCV with the same parameters as above).\n\nFigure 8 shows results for circle detection. Figure 8(1) corresponds to the classic one-to-many HT applied on the contour image. Figure 8(2) corresponds to the basic one-to-one DHT (our V1). Figure 8(3) shows the results for the two-pass 2–1 HT available in OpenCV , and Fig. 8(4) shows the results of the two-pass DHT (our V2). For the algorithms operating on contours (1 and 3), the Canny algorithm was applied with the same parameters as for the lines. For the dense algorithms (2 and 4), three scales were used for estimating the derivatives: σ{1.0,2.0,4.0}. Finally, for all algorithms, the radii were supposed bounded between 3 and 80, and to avoid multiple detections, an exclusion ball (C e ,r e )=((3,3),8) was applied (see Section 3.3). Figure 9 shows the results (40 best circles) on two other images for the two two-pass algorithms (same parameters).\n\n## Qualitative evaluation\n\nThis section is dedicated to the qualitative evaluation of the DHT for line and circle detection. First, the evaluation protocol is presented and the proposed metrics are justified. Then, we apply this evaluation, first to line detection, and then to the two versions of circle detection. The DHT algorithms are qualitatively compared with classic and state-of-the art HT algorithms available on the OpenCV library [16, 41, 46] and also with other state-of-the art line and circle detectors based on the HT, such as the randomised Hough transform and the curvature aided circle detector .\n\n### Evaluation protocol and metrics\n\nLine and circle detection algorithms are usually evaluated using synthetic binary images, showing different configurations of size/length, orientation, occlusion or noise, depending on the properties that need to be assessed. For obvious reasons, the DHTs need to be evaluated on greyscale images. The following protocol was applied:\n\n• One natural greyscale image showing significant amount of lines (resp. circles) was chosen, and its “ground truth” was manually set.\n\n• Every algorithm is assessed according to the proportion of ground truth lines (resp. circles) it detects, as a function of number of selected maxima.\n\n• To evaluate the sensitivity of the algorithms, the same measure is performed on images with three kinds of distortion: (1) additive noise, (2) impulse noise and (3) non-uniform illumination.\n\n#### Voronoi-based detection rate\n\nOur evaluation metrics is based on a matching criterion, using a distance in the parameter space. The ground truth image defines a set of ground truth points in the parameter space. The Voronoi tessellation associated to this point cloud allows to match every detected curve to its most likely ground truth. If the distance to the matched ground truth is less than a determined threshold, then the corresponding curve is considered detected; otherwise, it is a “false” detection. Obviously, only the closest true detection is counted for each ground truth curve. Figure 10 shows the application of this principle for line detection on the House image.\n\nRegarding lines, some precautions must be taken when using the Euclidean distance in the classic (θ,ρ) space because some discontinuities may appear when ρ is close to zero, the lines (θ,ρ) and (πθ,ρ) being in that case close in the image space, but not in the parameter space. To address this problem, the (θ,ρ) space is extended to negative values of ρ, every ground truth line (θ,ρ) being duplicated to its equivalent (πθ,−ρ), at least for the small values of ρ. The matching is then performed in this extended Voronoi diagram.\n\nA wrong detection may be due to a false alarm (a curve absent from the ground truth) or to multiple detections of a right curve. The manual ground truth collection being largely subjective, measuring the false alarm rate did not turn out relevant. The wrong detections being—at least for clean images— essentially due to multiple detections, the quality of detection depends much on the quantisation of the parameter space and the maxima selection procedure. As the main contribution of this work is independent of these steps, the different HTs were compared using the same parameter space and selection steps.\n\nFinally, the evaluation metrics we chose is the recall, i.e. the rate of ground truth curves that have been detected, as a function of the number of detected lines which is simply the number of selected maxima, the HT being actually a localisation, and not a detection algorithm.\n\n#### Image distortions\n\nTo assess the sensitivity of the different algorithms and to better understand the importance of their parameters, the evaluation has been performed on distorted images. The first considered distortion is additive noise: different amounts of Gaussian noise have been added to the input images before performing the detection. The noise level is measured by the signal to noise ratio (SNR). The second one is impulse (i.e. salt and pepper) noise, whose intensity is measured as the proportion p of pixels set to aberrant values. The third one is non uniform illumination: let c be a non-uniformity factor. The distorted image is obtained by multiplying every greyscale I(x,y) by the horizontal ramp defined by $$r(x) = \\frac {w}{cx+w}$$, where w is the width of the image.\n\n### Line detection\n\nWe evaluated the DHT for line detection using the previous protocol on the House image with its ground truth (see Fig. 10). First, we performed a parametric study of the algorithm on different conditions. The results can be seen on Fig. 11 and can be interpreted as follows:\n\n• One single small scale (i.e. 1≤σ≤2) is generally sufficient for noise-free images, and sometimes better, since larger scales may fuse close lines or miss some segments.\n\n• Using two of three scales slightly improve the results for noisy images.\n\n• Regarding the weighting policy, the use of ||I|| or log(||I||) works equally well in the different conditions, and much better than using uniform weights, except for non-uniform illumination, when the number of detected lines becomes high.\n\nFigure 12 shows the evaluation curves and Fig. 13 the corresponding detection results of the DHT, compared with other algorithms: (1) the standard one-to-many exhaustive HT (SHT), (2) the state-of-the-art progressive probabilistic HT (PPHT) available from OpenCV and (3) the randomised HT (RHT) . The three competitor algorithms are computed on the contour image obtained using Canny’s algorithm . Algorithm 1 is the standard one-to-many approach, where all the contour pixels vote for a complete sine curve on the discrete parameter space, with a uniform vote. Algorithm 2 is also a one-to-many approach, except that only a fraction of the contour pixels are randomly chosen, with dynamic mechanisms to adapt the parameters to the lengths of significant lines. Finally, Algorithm 3 is a randomised many-to one approach, which randomly picks couples of points from the contour image, and then votes for the unique corresponding point in the parameter space.\n\n### Circle detection\n\nThe DHT was evaluated the same way for circle detection, using the radar ahead image as ground truth (Fig. 14). From the parametric study (Fig. 15), the following remarks can be made:\n\n• The two-phase version (V2) works much better than the direct (V1) version in all cases.\n\n• Unlike the lines, the use of two or three scales significantly improves the results, even for clean images.\n\n• Using the Frobenius norm of the Hessian matrix (without multiplying by the squared sigma) seems the best weighting policy, except for the non-uniform contrast images, where the constant weight seems the least bad option.\n\n• The method is pretty insensitive to noise; on the contrary, the results dramatically drops when the contrast turns non-uniform.\n\nThe V2 DHT for circle detection was also compared to the following algorithms: (1) The classic one-to-many HT (SHT) computed on Canny’s contour (every pixel of the contour vote for a whole conic surface in the 3d parameter space). (2) The 2–1 HT for circle detection from OpenCV . This algorithm is a two-pass one-to-many method, computed on a contour image also, which estimates in the first pass the gradient direction for every voting pixel, then votes on the straight line orthogonal to this direction, in the 2d parameter space restricted to the centre (c x ,c y ). The second pass looks for the best radius for a selection of the best centres, in the same manner as the V2 DHT. (3) The randomised HT (RHT), a many-to-one approach , which randomly picks point triplets from a contour image and then vote for a unique point in the parameter space. (4) The curvature aided circle detector (CACD), which estimates the curvature on the contour image to perform a one-to-one vote using accumulation arrays of different radius ranges. The charts and the corresponding result images of this comparative evaluation may be seen on Figs. 16 and 17.\n\n### Maxima selection and computational considerations\n\nFinally, the influence of the parameter space representation, namely, “fine grained quantisation” vs. “coarse grained quantisation” with interpolated votes and centroid selection was evaluated. See Fig. 18: it can be seen here that the results with the coarse grained strategy are just slightly worse, although they are much more computationally efficient.\n\nRegarding computational efficiency, Table 4 outlines the general complexity figures of the different HT versions that have been presented in this paper. To account for the different variants and optimisations, the results are presented in a proportional manner ($$\\mathcal {O}(x)$$ means that the number of operations is proportional to parameter x). In the table, every row corresponds to a different category of HT algorithm, every column to a different step of the algorithm. The different parameters appearing in the table are explained as follows:\n\n• n is the geometric mean number of samples per dimension in the image space (n 2 is the number of pixels).\n\n• p is the number of binary contour pixels.\n\n• m is the dimension of the parameter space.\n\n• k is the geometric mean number of samples per dimension in the (fine grained) parameter space (k m is the number of parameter voxels).\n\n• z is the geometric mean number of samples per dimension in the exclusion ball.\n\n• s is the number of scales used in the DHT.\n\nFor the computation of contours, the $$\\mathcal {O}(n^{2})$$ factor comes from the local estimation of the derivatives and the $$\\mathcal {O}(p)$$ factor comes from the hysteresis threshold applied to the gradient norm. For the DHT, the estimation of the derivatives has the same complexity as the first part of contour detection, but has to be multiplied by the number of scales. It is recalled that one single scale is currently used for lines and no more than two or three for circles. For the Hough transform itself (voting process), the one-to-many factor k m−1 comes from the dimension of the dual shape, and for many-to-one methods, the $$\\binom {p}{m}$$ factor comes from the combinatorial choices of m points amongst p contour points. The classical ways to lower the complexity is to decrease the multiplying coefficient to this factor by picking only a fraction of the contour points (one-to-many PHT) or of the choices of m points (many-to-one RHT). For the DHT, the cost of voting is obviously constant. This means that globally, the cost of the DHT is of the same order or lower than the contour detection, which is only the pre-processing step of the classic HT. For the last step, namely the maxima extraction from the parameter accumulator, the complexity is typically higher for one-to-many methods where a higher resolution of the parameter space is needed, than for many-to-one or one-to-one methods, where no quantification is strictly needed, or where a coarser resolution associated with interpolation mechanisms can be used.\n\nAs a complement to these theoretical considerations, we also compared in Table 5 the actual computation time between the different methods: our proposed method (DHT), randomized Hough transform (RHT) , standard Hough transform (SHT) , progressive probability Hough transform (PPHT) , curvature aided Hough transform (CACD) and 2–1HT . Note that DHT, SHT and RHT are applicable for both line and circle detection. Those figures only measure the computation of the Hough transform, not the maxima selection, in order to focus on our contribution. They have to be interpreted carefully, since the experiments were all made on the same hardware platform (a CPU Intel Duo cores, 2.6 GHz with RAM 3Gb), but using different software implementations, including distinct languages and different levels of optimisation. We use the images of Fig. 10 (512 × 512 pixels) and Fig. 14 (277 × 492 pixels), respectively, for line and circle detection. The default parameters of OpenCV or the parameters recommended by the authors were used. For the RHT method, we followed the suggestion of the authors of setting the number of point tuples (i.e. pairs or triplets) picked from the contours, equal to the number of pixels of the considered image. Obviously, the computation time of the exhaustive SHT is considerable. The RHT, PPHT and 2–1 HT approaches reduce significantly the computation time by drastically decreasing the number of votes. Finally, our DHT approach is also very computationnally efficient by removing the segmentation (contour) step and performing a one-to-one vote.1\n\n## Conclusions\n\nWe have presented in this paper a unified framework for computing dense Hough transforms directly from the greyscale images, without reducing the support to contour or interest points. By being independent on the quality of the contours or any other pre-processing step, the voting process is less sensitive to image perturbations. By allowing all the pixels to vote, it is more statistically significant. The weight of the vote can be softly adjusted by using the significance of the contrast or the curvature, provided by the gradient magnitude or the Frobenius norm of the Hessian matrix.\n\nAnother fundamental advantage of the DHT for detecting lines or circles is the unique determination of the parameter from the spatial derivatives, which allows to perform a one-to-one voting process, thus improving dramatically the global efficiency of the Hough transform.\n\nWe have proposed a multiscale voting procedure that allows: (1) to improve the noise robustness and (2) to enhance the detection of circles within a wide range of radii, by simply suming scale-normalised votes over the different scales.\n\nWe have proposed an evaluation protocol to assess the results of line and circle detection algorithms on natural grey level images and applied this evaluation on the DHT, first to provide a parametric study of these algorithms and then to compare them to other classic and state-of-the-art versions of line and circle detectors based on Hough transforms. We have shown that the qualitative results obtained by the DHT are of the same level than the other HT, while being less sensitive to image perturbations, and more computationally efficient.\n\nIn our future works, we are going to produce optimised versions of the one-to-one DHT for line and circle detections, in order to better promote and spread their use in the community. We are also working on generalised DHT to extend the advantages of these algorithms to object detection, tracking and recognition [49, 50].\n\n## Endnote\n\n1 These methods were implemented using different programming frameworks and languages: dense HT: C++, RHT: Matlab, SHT: Matlab, CACD: Matlab, PPHT: OpenCV/C++, 2–1HT: OpenCV/C++.\n\n## References\n\n1. 1\n\nPVC Hough, in Int. Conf. High Energy Accelerators and Instrumentation. Machine analysis of bubble chamber pictures, (1959), pp. 554–556, http://inspirehep.net/record/919922?ln=en.\n\n2. 2\n\nA Rosenfeld, Picture processing by computer. ACM Comput. Surv.1(3), 147–176 (1969). doi:10.1145/356551.356554.\n\n3. 3\n\nH Maître, Un panorama de la transformation de Hough. Traitement du Signal. 2(4), 305–317 (1985).\n\n4. 4\n\nJ Illingworth, J Kittler, A survey of the Hough transform. Comput. Vis. Graph. Image Process.44(1), 87–116 (1988). doi:10.1016/S0734-189X(88)80033-1.\n\n5. 5\n\nVF Leavers, Which Hough transform?CVGIP: Image Underst.58(2), 250–264 (1993). doi:10.1006/ciun.1993.1041.\n\n6. 6\n\nP Mukhopadhyay, BB Chaudhuri, A survey of Hough transform. Pattern Recognit.48(3), 993–1010 (2015). doi:10.1016/j.patcog.2014.08.027.\n\n7. 7\n\nRO Duda, PE Hart, Use of the Hough transformation to detect lines and curves in pictures. Commun. ACM. 15(1), 11–15 (1972). doi:10.1145/361237.361242.\n\n8. 8\n\nN Bennett, R Burridge, N Salto, A method to detect and characterize ellipses using the Hough transform. IEEE Trans. Pattern Anal. Mach. Intell.21(7), 652–657 (1999). doi:10.1109/34.777377.\n\n9. 9\n\nJ Song, MR Lyu, A Hough transform based line recognition method utilizing both parameter space and image space. Pattern Recognit.38(4), 539–552 (2005). doi:10.1016/j.patcog.2004.09.003.\n\n10. 10\n\nD Walsh, AE Raftery, Accurate and efficient curve detection in images: the importance sampling Hough transform. Pattern Recognit.35(7), 1421–1431 (2002). doi:10.1016/S0031-3203(01)00114-5.\n\n11. 11\n\nDH Ballard, Generalizing the Hough transform to detect arbitrary shapes. Pattern Recognit.13(2), 111–122 (1981). doi:10.1016/0031-3203(81)90009-1.\n\n12. 12\n\nB Leibe, A Leonardis, B Schiele, in Toward Category-Level Object Recognition. Lecture Notes in Computer Science, vol. 4170. An implicit shape model for combined object categorization and segmentation (SpringerSiracusa, Italy, 2006), pp. 508–524, doi:10.1007/11957959-26.\n\n13. 13\n\nV Ferrari, F Jurie, C Schmid, From images to shape models for object detection. Int. J. Comput. Vis.87(3), 284–303 (2010). doi:10.1007/s11263-009-0270-9.\n\n14. 14\n\nRS Stephens, Probabilistic approach to the Hough transform. Image Vis. Comput.9(1), 66–71 (1991). doi:10.1016/0262-8856(91)90051-P.\n\n15. 15\n\nN Kiryati, Y Eldar, AM Bruckstein, A probabilistic Hough transform. Pattern Recognit.24(4), 303–316 (1991). doi:10.1016/0031-3203(91)90073-E.\n\n16. 16\n\nJ Matas, C Galambos, JV Kittler, Robust detection of lines using the progressive probabilistic Hough transform. Comput. Vis. Image Underst.78(1), 119–137 (2000). doi:10.1006/cviu.1999.0831.\n\n17. 17\n\nL Xu, E Oja, P Kultanen, A new curve detection method: randomized Hough transform (RHT). Pattern Recognit. Lett.11(5), 331–338 (1990). doi:10.1016/0167-8655(90)90042-Z.\n\n18. 18\n\nL Xu, A unified perspective and new results on RHT computing, mixture based learning, and multi-learner based problem solving. Pattern Recognit.40(8), 2129–2153 (2007). doi:10.1016/j.patcog.2006.12.016.\n\n19. 19\n\nH Kälviäinen, P Hirvonen, L Xu, E Oja, Probabilistic and non-probabilistic Hough transforms: overview and comparisons. Image Vis. Comput.13(4), 239–252 (1995). doi:10.1016/0262-8856(95)99713-B.\n\n20. 20\n\nN Kiryati, H Kälviäinen, S Alaoutinen, Randomized or probabilistic Hough transform: unified performance evaluation. Pattern Recognit. Lett.21(13-14), 1157–1164 (2000). doi:10.1016/S0167-8655(00)00077-5.\n\n21. 21\n\nF O’Gorman, MB Clowes, Finding picture edges through collinearity of feature points. IEEE Trans. Comput.C-25(4), 449–456 (1976). doi:10.1109/TC.1976.1674627.\n\n22. 22\n\nSD Shapiro, Feature space transforms for curve detection. Pattern Recognit.10(3), 129–143 (1978). doi:10.1016/0031-3203(78)90022-5.\n\n23. 23\n\nSM Karabernou, F Terranti, Real-time FPGA implementation of Hough transform using gradient and CORDIC algorithm. Image Vis. Comput.23(11), 1009–1017 (2005). doi:10.1016/j.imavis.2005.07.004.\n\n24. 24\n\nC Galambos, J Kittler, J Matas, Gradient based progressive probabilistic Hough transform. Vis. Image Signal Process. IEE Proc.148(3), 158–165 (2001). doi:10.1049/ip-vis:20010354.\n\n25. 25\n\nR Valenti, T Gevers, in IEEE Conference on Computer Vision and Pattern Recognition (CVPR’08). Accurate eye center location and tracking using isophote curvature, (2008), pp. 1–8, doi:10.1109/CVPR.2008.4587529.\n\n26. 26\n\nZ Yao, W Yi, Curvature aided hough transform for circle detection. Expert Syst. Appl.51:, 26–33 (2016). doi:10.1016/j.eswa.2015.12.019.\n\n27. 27\n\nAL Kesidis, N Papamarkos, On the gray-scale inverse Hough transform. Image Vis. Comput.18(8), 607–618 (2000). doi:10.1016/S0262-8856(99)00067-0.\n\n28. 28\n\nTJ Atherton, DJ Kerbyson, Size invariant circle detection. Image Vis. Comput.17(11), 795–803 (1999). doi:10.1016/S0262-8856(98)00160-7.\n\n29. 29\n\nR Dahyot, Statistical Hough transform. IEEE Trans. Pattern Anal. Mach. Intell.31(8), 1502–1509 (2009). doi:10.1109/TPAMI.2008.288.\n\n30. 30\n\nD Marr, E Hildreth, Theory of edge detection. Proc. R. Soc. London B: Biol. Sci.207(1167), 187–217 (1980). doi:10.1098/rspb.1980.0020.\n\n31. 31\n\nC Tomasi, J Shi, in Proc. IEEE Conf. on Comp. Vision and Patt. Recog. Good features to track, (1994), pp. 593–600, doi:10.1109/CVPR.1994.323794.\n\n32. 32\n\nBKP Horn, BG Schunck, Determining optical flow. Technical report (Massachusetts Institute of Technology, Cambridge, MA, USA, 1980).\n\n33. 33\n\nC Harris, M Stephens, in Proceedings of the 4th Alvey Vision Conference. A combined corner and edge detector, (1988), pp. 147–151, http://citeseer.ist.psu.edu/viewdoc/summary?doi=10.1.1.231.1604.\n\n34. 34\n\nDG Lowe, Distinctive image features from scale-invariant keypoints. Int. J. Comput. Vis.60(2), 91–110 (2004). doi:10.1023/B:VISI.0000029664.99615.94.\n\n35. 35\n\nT Lindeberg, Edge detection and ridge detection with automatic scale selection. Int. J. Comput. Vis.30(2), 117–156 (1998). doi:10.1023/A:1008097225773.\n\n36. 36\n\nJ Koenderink, The structure of images. Biol. Cybernet.50(5), 363–370 (1984). doi:10.1007/BF00336961.\n\n37. 37\n\nBMT Haar Romeny, Front-end vision and multi-scale image analysis. Computational Imaging and Vision (Kluwer Academic Publishers, Dordrecht, Boston, London, 2003).\n\n38. 38\n\nAP Witkin, in Proceedings of the Eighth International Joint Conference on Artificial Intelligence - Volume 2. IJCAI’83. Scale-space filtering (Morgan Kaufmann Publishers Inc.Karlsruhe, West Germany, 1983), pp. 1019–1022.\n\n39. 39\n\nL Florack, B Ter Haar Romeny, M Viergever, J Koenderink, The Gaussian scale-space paradigm and the multiscale local jet. Int. J. Comput. Vis.18(1), 61–75 (1996). doi:10.1007/BF00126140.\n\n40. 40\n\nT Lindeberg, Feature detection with automatic scale selection. Int. J. Comput. Vis.30(2), 79–116 (1998). doi:10.1023/A:1008045108935.\n\n41. 41\n\nHK Yuen, J Princen, J Illingworth, J Kittler, Comparative study of Hough transform methods for circle finding. Image Vis. Comput.8(1), 71–77 (1990). doi:10.1016/0262-8856(90)90059-E.\n\n42. 42\n\nR Chan, New parallel Hough transform for circles. Comput. Digital Techniques, IEE Proc.138(5), 335–344 (1991).\n\n43. 43\n\nD Ioannou, W Huda, AF Laine, Circle recognition through a 2d Hough transform and radius histogramming. Image Vis. Comput.17(1), 15–26 (1999). doi:10.1016/S0262-8856(98)00090-0.\n\n44. 44\n\nIT Young, LJ van Vliet, Recursive implementation of the Gaussian filter. Signal Process.44(2), 139–151 (1995). doi:10.1016/0165-1684(95)00020-E.\n\n45. 45\n\nJ Canny, A computational approach to edge detection. IEEE Trans. Pattern Anal. Mach. Intell.8(6), 679–698 (1986). doi:10.1109/tpami.1986.4767851.\n\n46. 46\n\nC Kimme, D Ballard, J Sklansky, Finding circles by an array of accumulators. Commun. ACM. 18(2), 120–122 (1975). doi:10.1145/360666.360677.\n\n47. 47\n\nS Fortune, in Proceedings of the Second Annual Symposium on Computational Geometry. SCG ’86. A sweepline algorithm for Voronoi diagrams (ACMYorktown Heights, NY, USA, 1986), pp. 313–322, doi:10.1145/10515.10549.\n\n48. 48\n\nA Manzanera, in Proceedings of the Sixth International Workshop on Medical and Healthcare applications(AMINA’12). Dense Hough transforms on gray level images using multi-scale derivatives (invited conference) (MahdiaTunisia, 2012), pp. 55–62.\n\n49. 49\n\nJ Gall, A Yao, N Razavi, L Van Gool, V Lempitsky, Hough forests for object detection, tracking, and action recognition. IEEE Trans. Pattern Anal. Mach. Intell.33(11), 2188–2202 (2011). doi:10.1109/TPAMI.2011.70.\n\n50. 50\n\nO Barinova, VS Lempitsky, P Kohli, On detection of multiple object instances using hough transforms. IEEE Trans. Pattern Anal. Mach. Intell.34(9), 1773–1784 (2012). doi:10.1109/CVPR.2010.5539905.\n\n## Acknowledgements\n\nWe gratefully acknowledge the financial contribution of research cluster DIGITEO through the funding of Phuong Nguyen’s post-doctoral position.\n\n### Authors’ contributions\n\nAM designed the one-to-one multiscale dense Hough transform framework and performed the first implementation. He wrote the sections dedicated to related works and theoretical contributions. XX designed the initial evaluation protocol and performed the first evaluations. TPN improved the evaluation protocol and the dense Hough transform implementation. He conducted all the comparative evaluation experiments and wrote the sections dedicated to the results and the discussion. All authors read and approved the manuscript.\n\n### Competing interests\n\nThe authors declare that they have no competing interests.\n\n## Author information\n\nAuthors\n\n### Corresponding author\n\nCorrespondence to Antoine Manzanera.\n\n## Rights and permissions", null, "" ]
[ null, "https://media.springernature.com/full/springer-static/image/art%3A10.1186%2Fs13640-016-0149-y/MediaObjects/13640_2016_149_Figa_HTML.gif", null, "https://media.springernature.com/full/springer-static/image/art%3A10.1186%2Fs13640-016-0149-y/MediaObjects/13640_2016_149_Figb_HTML.gif", null, "https://jivp-eurasipjournals.springeropen.com/track/article/10.1186/s13640-016-0149-y", null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.84999675,"math_prob":0.9791841,"size":53742,"snap":"2021-21-2021-25","text_gpt3_token_len":12988,"char_repetition_ratio":0.16839108,"word_repetition_ratio":0.026098408,"special_character_ratio":0.2527632,"punctuation_ratio":0.13619901,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9922266,"pos_list":[0,1,2,3,4,5,6],"im_url_duplicate_count":[null,4,null,4,null,4,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2021-05-13T10:41:23Z\",\"WARC-Record-ID\":\"<urn:uuid:4bd522aa-cd70-4d91-86af-62a56cda2466>\",\"Content-Length\":\"340874\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:50d4d2d4-6c1c-47d8-887f-34076e57cce9>\",\"WARC-Concurrent-To\":\"<urn:uuid:039d42f4-3b06-4cd1-8ae4-6eca6bdf1a31>\",\"WARC-IP-Address\":\"151.101.248.95\",\"WARC-Target-URI\":\"https://jivp-eurasipjournals.springeropen.com/articles/10.1186/s13640-016-0149-y\",\"WARC-Payload-Digest\":\"sha1:JPAFU7IPLLPEUONUXJ5TSLT3GJ3QDEVI\",\"WARC-Block-Digest\":\"sha1:MGOAV2WCPIFARVVMBDALXMB36AXGXKLD\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2021/CC-MAIN-2021-21/CC-MAIN-2021-21_segments_1620243990584.33_warc_CC-MAIN-20210513080742-20210513110742-00035.warc.gz\"}"}
https://answers.everydaycalculation.com/subtract-fractions/35-6-minus-30-50
[ "# Answers\n\nSolutions by everydaycalculation.com\n\n## Subtract 30/50 from 35/6\n\n1st number: 5 5/6, 2nd number: 30/50\n\n35/6 - 30/50 is 157/30.\n\n#### Steps for subtracting fractions\n\n1. Find the least common denominator or LCM of the two denominators:\nLCM of 6 and 50 is 150\n\nNext, find the equivalent fraction of both fractional numbers with denominator 150\n2. For the 1st fraction, since 6 × 25 = 150,\n35/6 = 35 × 25/6 × 25 = 875/150\n3. Likewise, for the 2nd fraction, since 50 × 3 = 150,\n30/50 = 30 × 3/50 × 3 = 90/150\n4. Subtract the two like fractions:\n875/150 - 90/150 = 875 - 90/150 = 785/150\n5. After reducing the fraction, the answer is 157/30\n6. In mixed form: 57/30\n\nMathStep (Works offline)", null, "Download our mobile app and learn to work with fractions in your own time:\nAndroid and iPhone/ iPad\n\n#### Subtract Fractions Calculator\n\n-\n\n© everydaycalculation.com" ]
[ null, "https://answers.everydaycalculation.com/mathstep-app-icon.png", null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.8264813,"math_prob":0.99359965,"size":845,"snap":"2021-21-2021-25","text_gpt3_token_len":319,"char_repetition_ratio":0.15576695,"word_repetition_ratio":0.0,"special_character_ratio":0.4781065,"punctuation_ratio":0.09139785,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9983075,"pos_list":[0,1,2],"im_url_duplicate_count":[null,null,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2021-06-20T01:36:19Z\",\"WARC-Record-ID\":\"<urn:uuid:312c133c-d1ee-4460-a2d0-2a46d14488d8>\",\"Content-Length\":\"7978\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:fac15ca3-993c-4cc1-bc79-85f85ea91309>\",\"WARC-Concurrent-To\":\"<urn:uuid:04f91f92-d9fa-47fb-8445-7a8123ba974a>\",\"WARC-IP-Address\":\"96.126.107.130\",\"WARC-Target-URI\":\"https://answers.everydaycalculation.com/subtract-fractions/35-6-minus-30-50\",\"WARC-Payload-Digest\":\"sha1:FWIMH7OOBCR2WRFMJG4A6KIHWUUNQPYR\",\"WARC-Block-Digest\":\"sha1:T2IGOLWF52HEHWRKVXX5YAOAXBZ423BG\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2021/CC-MAIN-2021-25/CC-MAIN-2021-25_segments_1623487653461.74_warc_CC-MAIN-20210619233720-20210620023720-00102.warc.gz\"}"}
https://community.tableau.com/thread/190525
[ "3 Replies Latest reply on Sep 30, 2015 12:13 AM by Cosimo Mercuro\n\n# Conditional Calculated field\n\nHi!\n\nI'd like to create a calculated field that is the difference between two values : A and B.\n\nCalculated field = A - B\n\nBut if this difference is negative ( < 0) the calculated field must return 0 (zero).\n\nAll like this :\n\nABA - B\n1082\n15105\n12130\n11140\n\nIs it possible ?\n\n• ###### 1. Re: Conditional Calculated field\n\nTotally.\n\nIf A-B < 0 then 0 Else A-B End\n\n• ###### 2. Re: Conditional Calculated field\n\nThis should get you what you want.\n\nIF SUM([A])-SUM([B]) < 0 THEN 0 ELSE SUM([A])-SUM([B]) END\n\n• ###### 3. Re: Conditional Calculated field\n\nVery good Mark !\n\nThanks" ]
[ null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.8024642,"math_prob":0.96562254,"size":531,"snap":"2019-13-2019-22","text_gpt3_token_len":171,"char_repetition_ratio":0.10436433,"word_repetition_ratio":0.11363637,"special_character_ratio":0.3314501,"punctuation_ratio":0.13793103,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.99899644,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2019-03-25T06:49:39Z\",\"WARC-Record-ID\":\"<urn:uuid:bdf74364-6bd1-45e4-b292-d57770175be2>\",\"Content-Length\":\"96380\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:0deaf34a-5ae2-45af-91c3-bfcfbfa5ba41>\",\"WARC-Concurrent-To\":\"<urn:uuid:bfc1e87c-4a80-4361-8451-2151a9ef5e70>\",\"WARC-IP-Address\":\"204.93.79.205\",\"WARC-Target-URI\":\"https://community.tableau.com/thread/190525\",\"WARC-Payload-Digest\":\"sha1:SCWLFWARLUAIHNXYYIDDJI7V6TS5PYKX\",\"WARC-Block-Digest\":\"sha1:5HT3OVNNMTTFVYXDHRSDEXEURVJFCTR7\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2019/CC-MAIN-2019-13/CC-MAIN-2019-13_segments_1552912203755.18_warc_CC-MAIN-20190325051359-20190325073359-00454.warc.gz\"}"}
http://hackage.haskell.org/package/conduit-extra-0.1.5/docs/src/Data-Conduit-Extra-Utils.html
[ "```{- | Functions currently under development which have not been moved to their\nfinal destination.\n-}\n\nmodule Data.Conduit.Extra.Utils where\n\nimport Control.Applicative\nimport Data.Conduit\nimport Data.Conduit.List as CL\nimport Data.Foldable\nimport Data.Sequence as Seq\nimport Data.Vector as Boxed (Vector, freeze)\nimport Data.Vector.Mutable as Boxed hiding (length)\nimport qualified Data.Vector.Unboxed as Unboxed\nimport qualified Data.Vector.Unboxed.Mutable as Unboxed\n\ntakeWhile :: Monad m => (a -> Bool) -> Conduit a m a\ntakeWhile f = loop where\nloop = await >>= maybe (return ()) go\ngo x | f x = yield x >> loop\n| otherwise = leftover x\n\ncollect :: PrimMonad m => Int -> Sink a m (Vector a)\ncollect size = do\nv <- lift \\$ unsafeNew size\nforM_ [0..size-1] \\$ \\i -> do\nme <- await\ncase me of\nNothing ->\nerror \\$ \"Too many elements for a vector of size \"\n++ show size\nJust e -> lift \\$ unsafeWrite v i e\nlift \\$ freeze v\n\ncollectUnboxed :: (PrimMonad m, Unboxed.Unbox a)\n=> Int -> Sink a m (Unboxed.Vector a)\ncollectUnboxed size = do\nv <- lift \\$ Unboxed.unsafeNew size\nforM_ [0..size-1] \\$ \\i -> do\nme <- await\ncase me of\nNothing ->\nerror \\$ \"Too many elements for an unboxed vector of size \"\n++ show size\nJust e -> lift \\$ Unboxed.unsafeWrite v i e\nlift \\$ Unboxed.freeze v\n\n-- | Remove the last N elements from the stream. This requires holding up to\n-- N elements in memory.\ndropRight :: Monad m => Int -> Conduit a m a\ndropRight size = do\nxs <- Seq.fromList <\\$> CL.take size\nflip evalStateT xs \\$ whileM_ ((== size) . Seq.length <\\$> get) \\$ do\nxs' <- get\ncase viewl xs' of\nEmptyL -> error \"impossible\"\ny :< ys -> do\nmz <- lift await\ncase mz of\nNothing -> put Seq.empty\nJust z -> put (ys |> z) >> lift (yield y)\n```" ]
[ null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.5569132,"math_prob":0.93392515,"size":1616,"snap":"2019-51-2020-05","text_gpt3_token_len":462,"char_repetition_ratio":0.14764269,"word_repetition_ratio":0.22456141,"special_character_ratio":0.2970297,"punctuation_ratio":0.1656051,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9726691,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2020-01-26T21:03:33Z\",\"WARC-Record-ID\":\"<urn:uuid:05a134fc-297c-47fa-b12f-e103aaf64321>\",\"Content-Length\":\"16743\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:299f508b-62ae-4ebf-8fd5-2724cdb935ba>\",\"WARC-Concurrent-To\":\"<urn:uuid:13a2969b-c0d9-412c-a30b-687afc7d0be9>\",\"WARC-IP-Address\":\"151.101.248.68\",\"WARC-Target-URI\":\"http://hackage.haskell.org/package/conduit-extra-0.1.5/docs/src/Data-Conduit-Extra-Utils.html\",\"WARC-Payload-Digest\":\"sha1:753WC7G3LDJ7JE7FTAL7VYHQB5GPK5DF\",\"WARC-Block-Digest\":\"sha1:2FHXUFGNZUAZE5KAFNGUQHKUPUP5UJYF\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2020/CC-MAIN-2020-05/CC-MAIN-2020-05_segments_1579251690379.95_warc_CC-MAIN-20200126195918-20200126225918-00280.warc.gz\"}"}
https://www.mathworks.com/help/matlab/ref/parula.html
[ "Documentation\n\n# parula\n\nParula colormap array\n\n## Syntax\n\n``c = parula``\n``c = parula(m)``\n\n## Description\n\nexample\n\n````c = parula` returns the parula colormap as a three-column array with the same number of rows as the colormap for the current figure. If no figure exists, then the number of rows is equal to the default length of 64. Each row in the array contains the red, green, and blue intensities for a specific color. The intensities are in the range [0,1], and the color scheme looks like this image.", null, "NoteStarting in R2017a, the colors in this colormap are slightly different than in previous releases. ```\n\nexample\n\n````c = parula(m)` returns the colormap with `m` colors.```\n\n## Examples\n\ncollapse all\n\nPlot a surface with the default parula colormap.\n\n`surf(peaks);`", null, "Get the parula colormap array and reverse the order. Then apply the modified colormap to the surface.\n\n```c = parula; c = flipud(c); colormap(c);```", null, "Get a downsampled version of the parula colormap containing only ten colors. Then display the contours of the peaks function by applying the colormap and interpolated shading.\n\n```c = parula(10); surf(peaks); colormap(c); shading interp;```", null, "## Input Arguments\n\ncollapse all\n\nNumber of entries, specified as a scalar integer value. The default value of `m` is equal to the length of the colormap for the current figure. If no figure exists, the default value is 64.\n\nData Types: `single` | `double`\n\nDownload ebook" ]
[ null, "https://www.mathworks.com/help/matlab/ref/colormap_parula_update17a.png", null, "https://www.mathworks.com/help/examples/graphics/win64/ParulaReverseColormapExample_01.png", null, "https://www.mathworks.com/help/examples/graphics/win64/ParulaReverseColormapExample_02.png", null, "https://www.mathworks.com/help/examples/graphics/win64/ParulaSpecificNumberExample_01.png", null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.7558663,"math_prob":0.94423586,"size":532,"snap":"2019-35-2019-39","text_gpt3_token_len":131,"char_repetition_ratio":0.15719697,"word_repetition_ratio":0.0,"special_character_ratio":0.2274436,"punctuation_ratio":0.10280374,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.985278,"pos_list":[0,1,2,3,4,5,6,7,8],"im_url_duplicate_count":[null,6,null,4,null,4,null,4,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2019-08-20T16:08:28Z\",\"WARC-Record-ID\":\"<urn:uuid:95f48bf6-8de2-43dc-8dea-4363e1f65bfb>\",\"Content-Length\":\"71309\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:888aca3f-1f69-4b37-92e1-019bc545b394>\",\"WARC-Concurrent-To\":\"<urn:uuid:a7c4d014-7ae1-4fca-a74e-e70894a117e7>\",\"WARC-IP-Address\":\"104.118.179.86\",\"WARC-Target-URI\":\"https://www.mathworks.com/help/matlab/ref/parula.html\",\"WARC-Payload-Digest\":\"sha1:X5EKQ5SC2J4L3NWYDOGJSAWW7PLC5TPF\",\"WARC-Block-Digest\":\"sha1:WJ3REF7ACMOF5EQTJYKA4PSKHTCKY6XP\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2019/CC-MAIN-2019-35/CC-MAIN-2019-35_segments_1566027315551.61_warc_CC-MAIN-20190820154633-20190820180633-00263.warc.gz\"}"}
https://www.r-bloggers.com/2019/07/numerical-integration-over-an-infinite-interval-in-rcpp-2/
[ "Want to share your content on R-bloggers? click here if you have a blog, or here if you don't.\n\nOn Stack Overflow the question was asked how to numerically integrate a function over a infinite range in Rcpp, e.g. by using RcppNumerical. As an example, the integral\n\n$\\int_{-\\infty}^{\\infty} \\mathrm{d}x \\exp\\left(-\\frac{(x-\\mu)^4}{2}\\right)$\n\nwas given. Using RcppNumerical is straight forward. One defines a class that extends Numer::Func for the function and an interface function that calls Numer::integrate on it:\n\n// [[Rcpp::depends(RcppEigen)]]\n// [[Rcpp::depends(RcppNumerical)]]\n#include <RcppNumerical.h>\nclass exp4: public Numer::Func {\nprivate:\ndouble mean;\npublic:\nexp4(double mean_) : mean(mean_) {}\n\ndouble operator()(const double& x) const {\nreturn exp(-pow(x-mean, 4) / 2);\n}\n};\n\n// [[Rcpp::export]]\nRcpp::NumericVector integrate_exp4(const double &mean, const double &lower, const double &upper) {\nexp4 function(mean);\ndouble err_est;\nint err_code;\nconst double result = Numer::integrate(function, lower, upper, err_est, err_code);\nreturn Rcpp::NumericVector::create(Rcpp::Named(\"result\") = result,\nRcpp::Named(\"error\") = err_est);\n}\n\nThis works fine for finite ranges:\n\nintegrate_exp4(4, 0, 4)\n## result error\n## 1.077900e+00 9.252237e-08\n\nHowever, it produces NA for infinite ones:\n\nintegrate_exp4(4, -Inf, Inf)\n## result error\n## NaN NaN\n\nThis is disappointing, since base R’s integrate() handles this without problems:\n\nexp4 <- function(x, mean) exp(-(x - mean)^4 / 2)\nintegrate(exp4, 0, 4, mean = 4)\n## 1.0779 with absolute error < 1.3e-07\nintegrate(exp4, -Inf, Inf, mean = 4)\n## 2.155801 with absolute error < 7.9e-06\n\nIn this particular case the problem can be easily solved in two different ways. First, the integral can be expressed in terms of the Gamma function:\n\n$\\int_{-\\infty}^{\\infty} \\mathrm{d}x \\exp\\left(-\\frac{(x-\\mu)^4}{2}\\right) = 2^{-\\frac{3}{4}} \\Gamma\\left(\\frac{1}{4}\\right) \\approx 2.155801$\n\nSecond, the integrand is almost zero almost everywhere:", null, "It is therefore sufficient to integrate over a small region around mean to get a reasonable approximation for the integral over the infinite range:\n\nintegrate_exp4(4, 1, 7)\n## result error\n## 2.155801e+00 9.926448e-13\n\nHowever, the trick to approximate the integral over an infinite range with an integral over a (possibly large) finite range does not work for functions that approach zero more slowly. The help page for integrate() has a nice example for this effect:\n\n## a slowly-convergent integral\nintegrand <- function(x) {1/((x+1)*sqrt(x))}\nintegrate(integrand, lower = 0, upper = Inf)\n## 3.141593 with absolute error < 2.7e-05\n## don't do this if you really want the integral from 0 to Inf\nintegrate(integrand, lower = 0, upper = 10)\n## 2.529038 with absolute error < 3e-04\nintegrate(integrand, lower = 0, upper = 100000)\n## 3.135268 with absolute error < 4.2e-07\nintegrate(integrand, lower = 0, upper = 1000000, stop.on.error = FALSE)\n## failed with message 'the integral is probably divergent'\n\nHow does integrate() handle the infinite range and can we replicate this in Rcpp? The help page states:\n\nIf one or both limits are infinite, the infinite range is mapped onto a finite interval.\n\nThis is in fact done by a different function from R’s C-API: Rdqagi() instead of Rdqags(). In principle one could call Rdqagi() via Rcpp, but this is not straightforward. Fortunately, there are at least two other solutions.\n\nThe GNU Scientific Library provides a function to integrate over the infinte interval $$(-\\infty, \\infty)$$, which can be used via the RcppGSL package:\n\n// [[Rcpp::depends(RcppGSL)]]\n#include <RcppGSL.h>\n#include <gsl/gsl_integration.h>\n\ndouble exp4 (double x, void * params) {\ndouble mean = *(double *) params;\nreturn exp(-pow(x-mean, 4) / 2);\n}\n\n// [[Rcpp::export]]\nRcpp::NumericVector normalize_exp4_gsl(double &mean) {\ngsl_integration_workspace *w = gsl_integration_workspace_alloc (1000);\n\ndouble result, error;\n\ngsl_function F;\nF.function = &exp4;\nF.params = &mean;\n\ngsl_integration_qagi(&F, 0, 1e-7, 1000, w, &result, &error);\ngsl_integration_workspace_free (w);\n\nreturn Rcpp::NumericVector::create(Rcpp::Named(\"result\") = result,\nRcpp::Named(\"error\") = error);\n}\nnormalize_exp4_gsl(4)\n## result error\n## 2.155801e+00 3.718126e-08\n\nAlternatively, one can apply the transformation used by GSL (and probably R) also in conjunction with RcppNumerical. To do so, one has to substitute $$x = (1-t)/t$$ resulting in\n\n$\\int_{-\\infty}^{\\infty} \\mathrm{d}x f(x) = \\int_0^1 \\mathrm{d}t \\frac{f((1-t)/t) + f(-(1-t)/t)}{t^2}$\n\nNow one could write the code for the transformed function directly, but it is of course nicer to have a general solution, i.e. use a class template that can transform any function in the desired fashion\n\n// [[Rcpp::depends(RcppEigen)]]\n// [[Rcpp::depends(RcppNumerical)]]\n#include <RcppNumerical.h>\nclass exp4: public Numer::Func {\nprivate:\ndouble mean;\npublic:\nexp4(double mean_) : mean(mean_) {}\n\ndouble operator()(const double& x) const {\nreturn exp(-pow(x-mean, 4) / 2);\n}\n};\n\n// [[Rcpp::plugins(cpp11)]]\ntemplate<class T> class trans_func: public T {\npublic:\nusing T::T;\n\ndouble operator()(const double& t) const {\ndouble x = (1-t)/t;\nreturn (T::operator()(x) + T::operator()(-x))/pow(t, 2);\n}\n};\n\n// [[Rcpp::export]]\nRcpp::NumericVector normalize_exp4(const double &mean) {\ntrans_func<exp4> f(mean);\ndouble err_est;\nint err_code;\nconst double result = Numer::integrate(f, 0, 1, err_est, err_code);\nreturn Rcpp::NumericVector::create(Rcpp::Named(\"result\") = result,\nRcpp::Named(\"error\") = err_est);\n}\nnormalize_exp4(4)\n## result error\n## 2.155801e+00 1.439771e-06\n\nNote that the exp4 class is identical to the one from the initial example. This means one can use the same class to calculate integrals over a finite range and after transformation over an infinite range." ]
[ null, "https://i1.wp.com/stubner.me/post/2019-07-03-numerical-integration-over-an-infinite-interval-in-rcpp_files/figure-html/integrant_plot-1.png", null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.6047626,"math_prob":0.9809602,"size":6115,"snap":"2023-14-2023-23","text_gpt3_token_len":1766,"char_repetition_ratio":0.14220259,"word_repetition_ratio":0.1508772,"special_character_ratio":0.31152904,"punctuation_ratio":0.19446772,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9985149,"pos_list":[0,1,2],"im_url_duplicate_count":[null,9,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2023-03-21T14:34:51Z\",\"WARC-Record-ID\":\"<urn:uuid:2c30b736-b708-4c8d-acec-31aa01639c00>\",\"Content-Length\":\"109304\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:f0eef04c-8406-40f4-9c9a-95e367582645>\",\"WARC-Concurrent-To\":\"<urn:uuid:7e3fc9f1-73d7-44fe-ab80-a11dd1a0800f>\",\"WARC-IP-Address\":\"172.67.211.236\",\"WARC-Target-URI\":\"https://www.r-bloggers.com/2019/07/numerical-integration-over-an-infinite-interval-in-rcpp-2/\",\"WARC-Payload-Digest\":\"sha1:COHZ6IKYS4RPGY5EEDSM5BCJ6JERFFNI\",\"WARC-Block-Digest\":\"sha1:TAYFJWBWC3VFRBLAL5JTLYDZT4IPQQMD\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2023/CC-MAIN-2023-14/CC-MAIN-2023-14_segments_1679296943698.79_warc_CC-MAIN-20230321131205-20230321161205-00717.warc.gz\"}"}
https://barisalcity.org/which-regression-equation-best-fits-these-data/
[ "Data hardly ever fit a right line exactly. Usually, you need to be satisfied through rough predictions. Typically, you have a set of data whose scatter plot shows up to “fit” a directly line. This is referred to as a Line of ideal Fit or Least-Squares Line.\n\nYou are watching: Which regression equation best fits these data\n\n### Example\n\nA arbitrarily sample of 11 statistics students developed the complying with data, where x is the 3rd exam score the end of 80, and y is the final exam score out of 200. Deserve to you suspect the final exam score of a arbitrarily student if you recognize the third exam score?\n\nx (third test score)y (final exam score)\n65175\n67133\n71185\n71163\n66126\n75198\n67153\n70163\n71159\n69151\n69159\n\nTable reflecting the scores top top the last exam based upon scores indigenous the 3rd exam.", null, "Scatter plot reflecting the scores top top the final exam based upon scores native the third exam.\n\n### try it\n\nSCUBA divers have actually maximum dive time they can not exceed as soon as going to different depths. The data in the table show various depths through the best dive times in minutes. Usage your calculator to uncover the the very least squares regression line and predict the preferably dive time for 110 feet.\n\nX (depth in feet)Y (maximum dive time)\n5080\n6055\n7045\n8035\n9025\n10022\n\ndisplaystylehaty=127.24-1.11x\n\nAt 110 feet, a diver could dive for only five minutes.\n\nThe third exam score, x, is the live independence variable and the last exam score, y, is the dependent variable. We will certainly plot a regression line that best “fits” the data. If every of you to be to right a line “by eye,” you would certainly draw different lines. We deserve to use what is dubbed a least-squares regression line to achieve the best fit line.\n\nConsider the adhering to diagram. Each point of data is the the the kind (x, y) and each suggest of the heat of best fit using least-squares direct regression has actually the type displaystyle(xhaty).\n\nThe displaystylehaty is check out “y hat” and is the estimated worth of y. The is the value of y acquired using the regression line. That is not generally equal come y indigenous data.", null, "The term displaystyley_0-haty_0=epsilon_0 is called the “error” or residual. The is no an error in the sense of a mistake. The absolute worth of a residual steps the vertical distance between the actual value of y and also the estimated value the y. In various other words, it procedures the upright distance in between the really data allude and the predicted suggest on the line.\n\nIf the it was observed data suggest lies over the line, the residual is positive, and the line underestimates the yes, really data worth for y. If the it was observed data point lies below the line, the residual is negative, and the heat overestimates the actual data worth for y.\n\nIn the chart above, displaystyley_0-haty_0=epsilon_0 is the residual for the suggest shown. Here the suggest lies above the line and also the residual is positive.\n\nε = the Greek letter epsilon\n\nFor each data point, you can calculate the residuals or errors,displaystyley_i-haty_i=epsilon_i because that i = 1, 2, 3, …, 11.\n\nEach |ε| is a upright distance.\n\nFor the example around the 3rd exam scores and also the last exam scores for the 11 statistics students, there room 11 data points. Therefore, there space 11 ε values. If you square each ε and add, girlfriend get\n\ndisplaystyle(epsilon_1)^2+(epsilon_2)^2+ldots+(epsilon_11)^2=stackrel11stackrelsum_i=1epsilon^2\n\nThis is dubbed the Sum of Squared Errors (SSE).\n\nUsing calculus, you deserve to determine the values of a and b that make the SSE a minimum. As soon as you make the SSE a minimum, friend have determined the point out that are on the line of best fit. It transforms out that the line of ideal fit has actually the equation:\n\ndisplaystylehaty=a+bx\n\nwheredisplaystylea=overliney-boverlinex\n\nand\n\nb=fracsum(x-overlinex)(y-overliney)sum(x-overlinex)^2.\n\nThe sample way of thex values and also the y values are displaystyleoverlinex and overliney.\n\nThe slopeb have the right to be written as displaystyleb=rleft(fracs_ys_x ight) whereby sy = the typical deviation the they values and also sx = the standard deviation of the x values. r is the correlation coefficient, which is debated in the next section.\n\n## Least Squares Criteria for best Fit\n\nThe procedure of installation the best-fit line is called linear regression. The idea behind recognize the best-fit heat is based upon the assumption that the data space scattered about a directly line. The criteria for the best fit line is the the amount of the squared errors (SSE) is minimized, the is, made as tiny as possible. Any type of other line you might choose would have a higher SSE 보다 the ideal fit line. This ideal fit heat is referred to as the least-squares regression line.\n\nNote\n\nComputer spreadsheets, statistics software, and many calculators can quickly calculate the best-fit line and create the graphs. The calculations have tendency to it is in tedious if done by hand. Instructions to use the TI-83, TI-83+, and also TI-84+ calculators to find the best-fit line and also create a scatterplot are shown at the end of this section.\n\n## Third test vs final Exam Example\n\nThe graph that the heat of best fit because that the third-exam/final-exam instance is together follows:", null, "The least squares regression heat (best-fit line) for the third-exam/final-exam example has the equation:\n\ndisplaystylehaty=-173.51+4.83x\n\nRemember, that is constantly important to plot a scatter diagram first. If the scatter plot shows that there is a linear relationship in between the variables, climate it is reasonable to usage a finest fit heat to make predictions because that y given x in ~ the domain the x-values in the sample data, but no necessarily for x-values external that domain. You can use the line to guess the last exam score because that a student who earned a grade of 73 ~ above the third exam. You have to NOT use the line to predict the final exam score for a student who earned a class of 50 on the 3rd exam, because 50 is no within the domain of the x-values in the sample data, i beg your pardon are in between 65 and also 75.\n\n## Understanding Slope\n\nThe slope of the line, b, describes how changes in the variables are related. That is crucial to translate the slope of the heat in the paper definition of the situation represented by the data. Girlfriend should be able to write a sentence interpreting the steep in plain English.\n\nInterpretation the the Slope: The steep of the best-fit line tells us just how the dependent change (y) changes for every one unit rise in the elevation (x) variable, on average.\n\nThird exam vs last Exam Example: Slope: The slope of the line is b = 4.83.\n\nInterpretation: for a one-point rise in the score ~ above the third exam, the last exam score boosts by 4.83 points, ~ above average.\n\nUsing the straight Regression T Test: LinRegTTestIn the STAT list editor, get in the X data in list L1 and also the Y data in perform L2, combine so that the equivalent (x,y) worths are beside each various other in the lists. (If a details pair of values is repeated, get in it as countless times as it appears in the data.)On the STAT tests menu, role down v the cursor to select the LinRegTTest. (Be cautious to pick LinRegTTest, as some calculators may likewise have a different item referred to as LinRegTInt.)On the LinRegTTest input screen enter: Xlist: L1 ; Ylist: L2 ; Freq: 1On the next line, at the notice β or ρ, to mark “≠ 0” and press ENTERLeave the line because that “RegEq:” blankHighlight Calculate and also press ENTER.", null, "The calculation screen consists of a the majority of information. For now we will emphasis on a couple of items indigenous the output, and will return later on to the other items.\n\nThe 2nd line says y = a + bx. Scroll under to find the values a = –173.513, and b = 4.8273; the equation that the ideal fit line is ŷ = –173.51 + 4.83xThe 2 items in ~ the bottom are r2 = 0.43969 and r = 0.663. Because that now, just note wherein to find these values; we will talk about them in the next two sections.\n\nGraphing the Scatterplot and also Regression Line\n\nWe space assuming her X data is already entered in perform L1 and your Y data is in list L2Press 2nd STATPLOT go into to use Plot 1On the input display screen for PLOT 1, highlightOn, and also press ENTERFor TYPE: highlight the very very first icon i beg your pardon is the scatterplot and also press ENTERIndicate Xlist: L1 and also Ylist: L2For Mark: it does not matter which symbol friend highlight.Press the ZOOM crucial and then the number 9 (for food selection item “ZoomStat”) ; the calculator will certainly fit the window to the dataTo graph the best-fit line, press the “Y=” key and type the equation –173.5 + 4.83X into equation Y1. (The X key is immediately left the the STAT key). Press ZOOM 9 again to graph it.Optional: If you desire to readjust the viewing window, push the home window key. Get in your desired window using Xmin, Xmax, Ymin, YmaxNote\n\nAnother means to graph the line after you produce a scatter plot is to usage LinRegTTest. Make certain you have done the scatter plot. Inspect it on her screen.Go to LinRegTTest and also enter the lists. At RegEq: press VARS and arrow end to Y-VARS. Press 1 for 1:Function. Push 1 for 1:Y1. Then arrow down come Calculate and do the calculation because that the heat of best fit.Press Y = (you will see the regression equation).Press GRAPH. The line will certainly be drawn.”\n\n## The Correlation Coefficient r\n\nBesides looking at the scatter plot and also seeing that a line appears reasonable, how can you call if the line is a good predictor? use the correlation coefficient as one more indicator (besides the scatterplot) of the stamin of the connection between x and y.\n\nThe correlation coefficient, r, occurred by karl Pearson in the at an early stage 1900s, is numerical and also provides a measure of strength and direction the the direct association between the independent variable x and the dependent change y.\n\nThe correlation coefficient is calculated together r=frac nsum(xy)-(sumx)(sumy) sqrtleftleft\n\nwhere n = the number of data points.\n\nIf you doubt a direct relationship between x and also y, then r have the right to measure how solid the straight relationship is.\n\nWhat the worth of r speak us: The value of r is always between –1 and also +1: –1 ≤ r ≤ 1. The size of the correlation rindicates the toughness of the linear relationship between x and y. Worths of r close come –1 or to +1 indicate a stronger direct relationship in between x and also y. If r = 0 there is for sure no straight relationship between x and also y (no straight correlation). If r = 1, there is perfect optimistic correlation. If r = –1, over there is perfect negativecorrelation. In both these cases, every one of the initial data points lie top top a right line. The course,in the actual world, this will not generally happen.\n\nWhat the authorize of r tells us: A positive value that r means that when x increases, y tends to increase and also when x decreases, y often tends to to decrease (positive correlation). A negative value the r method that once x increases, y often tends to decrease and also when x decreases, y often tends to increase (negative correlation). The sign of r is the very same as the authorize of the slope,b, the the best-fit line.\n\nNote\n\nStrong correlation does not indicate that x reasons or y reasons x. Us say “correlation does not suggest causation.”", null, "(a) A scatter plot reflecting data v a optimistic correlation. 0 r2, once expressed as a percent, represents the percent of variation in the dependent (predicted) variable y that can be described by sports in the independent (explanatory) variable x utilizing the regression (best-fit) line.1 – r2, when expressed together a percentage, to represent the percent of sport in y that is NOT defined by variation in x making use of the regression line. This deserve to be viewed as the scattering of the observed data points about the regression line.\n\nThe heat of ideal fit is displaystylehaty=-173.51+4.83x\n\nThe correlation coefficient is r = 0.6631The coefficient of determination is r2 = 0.66312 = 0.4397\n\nInterpretation the r2 in the context of this example: Approximately 44% the the variation (0.4397 is approximately 0.44) in the final-exam grades can be explained by the variation in the grades on the 3rd exam, utilizing the best-fit regression line. Therefore, about 56% the the variation (1 – 0.44 = 0.56) in the last exam grades can no be defined by the sports in the qualities on the third exam, using the best-fit regression line. (This is viewed as the scattering of the points around the line.)\n\n## Concept Review\n\nA regression line, or a line of finest fit, can be drawn on a scatter plot and also used come predict outcomes for the x and y variables in a provided data collection or sample data. There are several means to uncover a regression line, but usually the least-squares regression heat is used since it create a uniform line. Residuals, also called “errors,” measure up the street from the actual value of y and also the estimated value that y. The amount of Squared Errors, when collection to the minimum, calculates the clues on the line of finest fit. Regression lines deserve to be provided to predict worths within the given set of data, however should no be provided to make predictions for values exterior the collection of data.\n\nSee more: What Is A Good Cello Brand S: Beginner & Intermediate Cello, 19 Best Cello Reviews 2021\n\nThe correlation coefficient r measures the toughness of the linear association between x and also y. The change r needs to be in between –1 and +1. When r is positive, the x and also y will often tend to increase and decrease together. Once r is negative, x will certainly increase and also y will certainly decrease, or the opposite, x will decrease and also y will certainly increase. The coefficient of decision r2, is same to the square that the correlation coefficient. When expressed together a percent, r2 represents the percent of sport in the dependent change y that deserve to be explained by sport in the independent change x making use of the regression line." ]
[ null, "https://barisalcity.org/which-regression-equation-best-fits-these-data/imager_1_1636_700.jpg", null, "https://barisalcity.org/which-regression-equation-best-fits-these-data/imager_2_1636_700.jpg", null, "https://barisalcity.org/which-regression-equation-best-fits-these-data/imager_3_1636_700.jpg", null, "https://barisalcity.org/which-regression-equation-best-fits-these-data/imager_4_1636_700.jpg", null, "https://barisalcity.org/which-regression-equation-best-fits-these-data/imager_5_1636_700.jpg", null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.91263807,"math_prob":0.9664342,"size":12770,"snap":"2021-43-2021-49","text_gpt3_token_len":2942,"char_repetition_ratio":0.14577785,"word_repetition_ratio":0.0218436,"special_character_ratio":0.23265466,"punctuation_ratio":0.097551495,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.99541557,"pos_list":[0,1,2,3,4,5,6,7,8,9,10],"im_url_duplicate_count":[null,2,null,2,null,2,null,2,null,2,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2021-12-02T13:04:37Z\",\"WARC-Record-ID\":\"<urn:uuid:5cfd33b4-5f46-409a-a749-373b3645892e>\",\"Content-Length\":\"26596\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:17889bfd-c7ab-479c-affa-ae4a5ef2118d>\",\"WARC-Concurrent-To\":\"<urn:uuid:d10b925c-aa41-4235-a5df-9ec2e203fc67>\",\"WARC-IP-Address\":\"104.21.77.253\",\"WARC-Target-URI\":\"https://barisalcity.org/which-regression-equation-best-fits-these-data/\",\"WARC-Payload-Digest\":\"sha1:EXGQJWRWQ5QA5KG4PHJRCH6G67XIIL7H\",\"WARC-Block-Digest\":\"sha1:5JTXHAH3TGKQQ5YD2NCT62RM2QO6NMPV\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2021/CC-MAIN-2021-49/CC-MAIN-2021-49_segments_1637964362219.5_warc_CC-MAIN-20211202114856-20211202144856-00382.warc.gz\"}"}
http://webmacster87.info/12685-intel-79.html
[ "# 12685 INTEL DRIVER\n\nFollow these steps to locate, instantiate, and customize an IP variation in the parameter editor:. Altera floating-point IP cores do not support denormal number inputs. In some IP cores, the precision modes determine the number of clock cycles between the input and output result. These changes may require you to modify your design or to re-parameterize your IP variant. Asserted when either the dataa[] port and the datab[] port is set to NaN, or if both the dataa[] port and the datab[] port are set to NaN.", null, "Uploader: Tarisar Date Added: 22 February 2009 File Size: 37.73 Mb Operating Systems: Windows NT/2000/XP/2003/2003/7/8/10 MacOS 10/X Downloads: 41276 Price: Free* [*Free Regsitration Required]", null, "The complex conjugate of the latched register is obtained by simply inverting the sign bit.", null, "Overflow exception output carried from the input. Instead, it uses handshaking signals to interface with external circuitry.\n\nThe single-extended precision format contains the following binary patterns: Cholesky Decomposition Function Top-level Diagram.\n\n### Floating-Point IP Cores User Guide\n\nThe gray block is the FPC datapath section. Asserted when the result of the multiplication after rounding is 0 while none of the inputs to the multiplication is 0or asserted when the result is a denormalized number. The assertion of the busy signal and the deassertion of the done signal indicate that the matrix inversion core is processing the input data.\n\n## Floating-Point IP Cores User Guide\n\nTwo input multiplication followed by a 122685 cycle accumulation. The reset signal deasserts. The parameter editor generates a top-level Quartus IP file.\n\nSingle-precision bit matrix result value.\n\nThe simulation waveform in this design example is not shown in its entirety. Dell XPS 13 iU.\n\nThe rest of the first column, li0 is the input value ai0 divided by l This together with the target device family will determine the amount of pipelining in the core.\n\nFor the complex matrix, both the input and processing memory blocks contain complex values. This example uses the parameter editor GUI 112685 define the core. Matrix A Avalon streaming ready signal. Vector Size also controls the matrix B memory configuration. Contrary to Skylake, Kaby lake now also supports H. An entire row of the result matrix is written out as a burst.\n\n### ALTERA_FP_MATRIX_INV IP Core\n\nThe floating-point inverse result of the value at the data[] input port. The output latency is 28 clock cycles. The trigonemetric of the data[] input port in floating-point format. Input data is burst in ihtel, one at every clock cycle. Asserted when the input port is a NaN representation.\n\nACER TRAVELMATE 2350 WIRELESS DRIVER\n\nThis is the main system clock. This table lists the features of each conversion operation.", null, "This section shows the random test data assigned to the input matrices and the results obtained from the matrix inversion operation. The top element of the first column, l00, is the square root of the input matrix value a The first section, also known as the vector section, takes the inner product of two vectors and subtracts it from the input matrix element, a ij.\n\nWhen asserted low, no operation occurs and the outputs are unchanged. Optional dedicated multiplier circuitries in Cyclone and Stratix series. Specifies the width of the output result. This design example implements a floating-point matrix inversion to calculate the inverse value of matrices in single-precision formats." ]
[ null, "https://i.ytimg.com/vi/JFmUldhIceI/maxresdefault.jpg", null, "http://webmacster87.info/download_driver.png", null, "https://www.tomshw.it/images/images/2018/12/test-asus-rog-maximus-xi-hero-12685.768x432.jpg", null, "http://www.legitreviews.com/images/reviews/1313/pcmarks.jpg", null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.79473287,"math_prob":0.9045902,"size":3493,"snap":"2019-26-2019-30","text_gpt3_token_len":748,"char_repetition_ratio":0.13184294,"word_repetition_ratio":0.014519056,"special_character_ratio":0.2069854,"punctuation_ratio":0.09859155,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.956699,"pos_list":[0,1,2,3,4,5,6,7,8],"im_url_duplicate_count":[null,1,null,1,null,1,null,1,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2019-07-16T10:26:23Z\",\"WARC-Record-ID\":\"<urn:uuid:0d75b31f-c82f-408f-9e39-19167f3e3420>\",\"Content-Length\":\"26330\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:fc1f0201-080f-4602-855f-ab1e9d375f4a>\",\"WARC-Concurrent-To\":\"<urn:uuid:1d07685b-a51a-4fc7-8941-a3ccbd79b490>\",\"WARC-IP-Address\":\"104.31.73.77\",\"WARC-Target-URI\":\"http://webmacster87.info/12685-intel-79.html\",\"WARC-Payload-Digest\":\"sha1:PXCDQXF5VD7TUVTRX7JJ5RGBL7PXV4YM\",\"WARC-Block-Digest\":\"sha1:OBDYPKQVFPSAH3V232OLD6R4WIB3NCVF\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2019/CC-MAIN-2019-30/CC-MAIN-2019-30_segments_1563195524522.18_warc_CC-MAIN-20190716095720-20190716121720-00009.warc.gz\"}"}
https://math.stackexchange.com/questions/3091676/an-example-of-a-square-matrix-with-the-same-eigenvectors-but-different-eigenvalu/3091679
[ "An example of a square matrix with the same eigenvectors but different eigenvalues\n\nIs there an example such that $$A$$ and $$B$$, three by three, that have the same eigenvectors, but different eigenvalues?\n\nWhat would be the eigenvectors and eigenvalues if it exists because I'm stuck on this practice problem.\n\nI know that if matrices $$A$$ and $$B$$ can be written such that $$AB=BA$$, they share the same eigenvectors, but what about their eigenvalues? precisely if they're squared matrices ($$3\\times 3$$ case)\n\nHow about $$I$$ and $$-I$$? Then all $$x\\neq0$$ are eigenvectors. But the eigenvalues are $$1$$ and $$-1$$ respectively.\nFor a less trivial example, how about $$\\begin{pmatrix}1&0&0\\\\0&2&1\\\\0&0&2\\end{pmatrix}$$ and $$\\begin{pmatrix}4&0&0\\\\0&3&1\\\\0&0&3\\end{pmatrix}$$?\nThey share eigenvectors $$(1,0,0)$$ and $$(0,1,0)$$, but for different eigenvalues." ]
[ null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.926427,"math_prob":1.0000079,"size":417,"snap":"2019-43-2019-47","text_gpt3_token_len":104,"char_repetition_ratio":0.15738499,"word_repetition_ratio":0.0,"special_character_ratio":0.23021583,"punctuation_ratio":0.101265825,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9999875,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2019-10-24T01:48:55Z\",\"WARC-Record-ID\":\"<urn:uuid:2a0d12c9-6750-4232-8a2d-8c7b409ee65f>\",\"Content-Length\":\"143570\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:2922abe2-71a2-40b5-b0e9-72d4fc43d3b7>\",\"WARC-Concurrent-To\":\"<urn:uuid:a8dd9248-c573-4eee-8b8b-d1117f8662fe>\",\"WARC-IP-Address\":\"151.101.193.69\",\"WARC-Target-URI\":\"https://math.stackexchange.com/questions/3091676/an-example-of-a-square-matrix-with-the-same-eigenvectors-but-different-eigenvalu/3091679\",\"WARC-Payload-Digest\":\"sha1:ZUXOE3C373KM6GIC5TYIA77TKTVZYOWU\",\"WARC-Block-Digest\":\"sha1:SOFPZ44OEX4R7VSNT6CNASTY6K4XTOCD\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2019/CC-MAIN-2019-43/CC-MAIN-2019-43_segments_1570987838289.72_warc_CC-MAIN-20191024012613-20191024040113-00066.warc.gz\"}"}
http://www.javaprogrammingforums.com/whats-wrong-my-code/13258-what-wrong-unknown-error.html
[ "Welcome to the Java Programming Forums\n\nThe professional, friendly Java community. 21,500 members and growing!\n\nThe Java Programming Forums are a community of Java programmers from all around the World. Our members have a wide range of skills and they all have one thing in common: A passion to learn and code Java. We invite beginner Java programmers right through to Java professionals to post here and share your knowledge. Become a part of the community, help others, expand your knowledge of Java and enjoy talking with like minded people. Registration is quick and best of all free. We look forward to meeting you.\n\n>> REGISTER NOW TO START POSTING\n\n# Thread: WHAT IS WRONG??!?!? unknown error\n\n1. ##", null, "WHAT IS WRONG??!?!? unknown error\n\nso.... here is a molar mass calculator... it only needs to find the molar mass with C,H,N,O. please help\nimport java.util.Scanner;\n/**\n* Cookin' some chicken.\n*\n* @\n* @1.1\n*/\n\npublic class FormulaMass\n{\nfinal static double Carbon = 12.0107;\nfinal static double Oxygen = 15.9994;\nfinal static double Nitrogen = 14.0067;\nfinal static double Hydrogen = 1.00794;\nString formula;\nString [] formarray;\ndouble Product;\nint x;\nint y;\nint numletters;\nint q;\nint e;\nint f;\ndouble g;\n\npublic FormulaMass()\n{\ngetInput();\narrayConstructor();\ncalculations();\noutput();\n\n}\npublic void getInput()\n{\nScanner in = new Scanner (System.in);\nSystem.out.println(\"Enter the formula of your carbon, oxygen,nitrogen or hydrogen compound: \");\nformula = in.next();\n}\nprivate String arrayConstructor()\n{\nfor (x=0; x< formula.length(); x++)\n{\nnumletters++;\n}\nString [] subscript = new String[numletters];\nformarray = subscript;\nreturn formarray[numletters];\n}\nprivate double calculations()\n{\nfor (x =0; x<=formula.length(); x++)\n{\nif (formarray[x].equals (\"C\"))\n{\nq = Integer.parseInt(formarray[x+1]);\nProduct = Product + (q * Carbon);\n}\nif (formarray[x].equals (\"N\"))\n{\nq = Integer.parseInt(formarray[x+1]);\nProduct = Product + (q * Nitrogen);\n}\nif (formarray[x].equals (\"H\"))\n{\nq = Integer.parseInt(formarray[x+1]);\nProduct = Product + (q * Hydrogen);\n}\nif (formarray[x].equals (\"O\"))\n{\nq = Integer.parseInt(formarray[x+1]);\nProduct = Product + (q * Oxygen);\n}\nelse\n{\ne = Integer.parseInt(formarray[x]);\nf = Integer.parseInt(formarray[x-1]);\nif (formarray[x+2].equals (\"C\"))\n{\ng = Carbon;\n}\nif (formarray[x+2].equals (\"N\"))\n{\ng = Nitrogen;\n}\nif (formarray[x+2].equals (\"H\"))\n{\ng = Hydrogen;\n}\nif (formarray[x+2].equals (\"O\"))\n{\ng = Oxygen;\n}\nelse\n{\ng = 0;\n}\nf = (f * 10) - f;\nProduct = Product + (e * g) + (g * f);\n}\n}\nreturn Product;\n}\npublic void output ()\n{\nSystem.out.println(Product);\n}\n}", null, "", null, "Reply With Quote\n\n3. ##", null, "Re: WHAT IS WRONG??!?!? unknown error\n\n?!?!?! anything?", null, "", null, "Reply With Quote\n\n4. ##", null, "Re: WHAT IS WRONG??!?!? unknown error\n\nPlease use the HIGHLIGHT tags to make it easier for us to read your code. Also, please be specific about what you are having problems with.\n\nFrom what I can see; you are asking for the input but not using it. Try returning a value in the getInput() method. Also, where is the entry point to the program? I cannot see a main function.", null, "", null, "Reply With Quote" ]
[ null, "http://www.javaprogrammingforums.com/images/icons/icon1.png", null, "http://www.javaprogrammingforums.com/images/misc/progress.gif", null, "http://www.javaprogrammingforums.com/clear.gif", null, "http://www.javaprogrammingforums.com/images/icons/icon1.png", null, "http://www.javaprogrammingforums.com/images/misc/progress.gif", null, "http://www.javaprogrammingforums.com/clear.gif", null, "http://www.javaprogrammingforums.com/images/icons/icon1.png", null, "http://www.javaprogrammingforums.com/images/misc/progress.gif", null, "http://www.javaprogrammingforums.com/clear.gif", null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.51262516,"math_prob":0.96214104,"size":1863,"snap":"2019-35-2019-39","text_gpt3_token_len":532,"char_repetition_ratio":0.17267348,"word_repetition_ratio":0.085409254,"special_character_ratio":0.359635,"punctuation_ratio":0.25833333,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9818029,"pos_list":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18],"im_url_duplicate_count":[null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2019-09-22T21:07:37Z\",\"WARC-Record-ID\":\"<urn:uuid:7c7142c7-f8d5-4234-80e8-a24e4dfee5be>\",\"Content-Length\":\"54080\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:6fe40039-f316-4a6b-9c84-76ed2974ec7a>\",\"WARC-Concurrent-To\":\"<urn:uuid:febbe9b8-9eae-4261-97ba-2259a0e70484>\",\"WARC-IP-Address\":\"162.214.66.37\",\"WARC-Target-URI\":\"http://www.javaprogrammingforums.com/whats-wrong-my-code/13258-what-wrong-unknown-error.html\",\"WARC-Payload-Digest\":\"sha1:EPKCUZHBUWZB2KTBU6XJ75AWBUARA7UK\",\"WARC-Block-Digest\":\"sha1:CZGEWGAM53I326W4RFSKWWGGVA4XMV6H\",\"WARC-Identified-Payload-Type\":\"application/xhtml+xml\",\"warc_filename\":\"/cc_download/warc_2019/CC-MAIN-2019-39/CC-MAIN-2019-39_segments_1568514575674.3_warc_CC-MAIN-20190922201055-20190922223055-00265.warc.gz\"}"}
https://investmentongold.com/useful/present-value-of-investment-calculator.html
[ "# Present value of investment calculator", null, "## How do you calculate the present value of an investment?\n\nBeing able to determine the present value of each potential investment, purchase, or cash flow before committing to it can help you and your company make the best possible decisions.\n\nTake a closer look at earnings\n\n1. PV = Present value.\n2. FV = Future value.\n3. r = Rate.\n4. t = Time (in years)\n5. 1 = Percentage constant.\n\n## What is present day value formula?\n\nPV = FV/(1+r)n. PV = Present value, also known as present discounted value, is the value on a given date of a payment. FV = This is the projected amount of money in the future. r = the periodic rate of return, interest or inflation rate, also known as the discounting rate.\n\n## How do you calculate the present value factor?\n\nPresent Value Factor Formula is used to calculate a present value of all the future value to be received. It works on the concept of time value money.\n\nDerivation of Present Value Factor Formula\n\n1. PV = Present Value.\n2. FV = Future Value.\n3. r = Rate of Return.\n4. n = Number of Years/Periods.\n\n## How do you find the present value of a lump sum?\n\nExample Present Value Calculations for a Lump Sum Investment:\n\n1. Investment Value in 2 years FV = \\$10,000.\n2. Interest Rate R = 6.25%, r = 0.0625.\n3. Number of Periods (years) t = 2.\n4. Compounding per Period (per year) m = 12.\n\n## What is Present Value example?\n\nPresent value is the value right now of some amount of money in the future. For example, if you are promised \\$110 in one year, the present value is the current value of that \\$110 today.\n\n## What is current investment value?\n\nCurrent value is the current value of the mutual fund investment units you currently hold. Current Value = Units x Current NAV. Net Investment is the net amount inflow of your investment activity. For example: You purchased 10 mutual fund units at a NAV of Rs.\n\nYou might be interested:  Are coins a good investment\n\n## What is the rule of 72 in finance?\n\nThe formula is simple: 72 / interest rate = years to double. Try plugging in various interest rates from the different accounts your money is in, from savings and money market accounts to index and mutual funds. For example, if your account earns: 1%, it will take 72 years for your money to double (72 / 1 = 72)\n\n## How do you calculate the present value of a pension?\n\nPresent value is calculated as PV = FV / (1 + i)^n, where the present value equals the future value divided by one plus the expected interest rate over “n” number of years. You can see right away that the first thing I needed to know was the future value of the pension in 2046.\n\n## How do I calculate time value of money in Excel?\n\nIn Excel functions, you must set NPer to be the total number of periods, Rate to be the interest rate per period, and PMT to be the annuity payment per period. So, if this problem had said that the compounding was monthly (annual was implied), then we would have typed =FV(B3/12,B2*12,0,-B1).\n\n## What is discount factor formula?\n\nFormula for the Discount Factor\n\nThe formula for calculating the discount factor in Excel is the same as the Net Present Value (NPV formula. … NPV = F / [ (1 + r)^n ] where, PV = Present Value, F = Future payment (cash flow), r = Discount rate, n = the number of periods in the future).\n\n## How do I calculate present value in Excel?\n\nExcel PV Function\n\n1. Summary. …\n2. Get the present value of an investment.\n3. present value.\n4. =PV (rate, nper, pmt, [fv], [type])\n5. rate – The interest rate per period. …\n6. The PV function returns the value in today’s dollars of a series of future payments, assuming periodic, constant payments and a constant interest rate.\nYou might be interested:  Commercial investment property for sale\n\n## How do you calculate value?\n\nIt is easy to calculate: add up all the numbers, then divide by how many numbers there are. In other words it is the sum divided by the count." ]
[ null, "data:image/svg+xml,%3Csvg%20xmlns='http://www.w3.org/2000/svg'%20viewBox='0%200%20670%20446'%3E%3C/svg%3E", null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.91941714,"math_prob":0.99299055,"size":3687,"snap":"2021-31-2021-39","text_gpt3_token_len":883,"char_repetition_ratio":0.17078468,"word_repetition_ratio":0.03314121,"special_character_ratio":0.2571196,"punctuation_ratio":0.123324394,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.999744,"pos_list":[0,1,2],"im_url_duplicate_count":[null,null,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2021-07-25T16:12:33Z\",\"WARC-Record-ID\":\"<urn:uuid:28fb921c-10c6-482c-a12f-71f5e0314c8f>\",\"Content-Length\":\"53915\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:a5e1b9a7-f35c-4c35-b637-5d98676da1a0>\",\"WARC-Concurrent-To\":\"<urn:uuid:76ec6225-ebc4-49a2-8ec2-b3ecbe27a324>\",\"WARC-IP-Address\":\"172.67.188.184\",\"WARC-Target-URI\":\"https://investmentongold.com/useful/present-value-of-investment-calculator.html\",\"WARC-Payload-Digest\":\"sha1:43GWVGXK6D4EQNXQJLFY3A5AARTBM5M3\",\"WARC-Block-Digest\":\"sha1:X2L2CBTZDGLOQG54FKNA2W3DY3E6UH2T\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2021/CC-MAIN-2021-31/CC-MAIN-2021-31_segments_1627046151699.95_warc_CC-MAIN-20210725143345-20210725173345-00486.warc.gz\"}"}
https://www.open.edu/openlearncreate/mod/oucontent/view.php?id=568&section=7.8
[ "# 10.6.8 Estimating Complicated Areas\n\nThe ability to calculate or estimate areas occurs in many practical situations from estimating the area of a piece of land or the area of a floor or wall in a room, to minimizing the amount of packaging needed in a business. There are many other scientific and engineering applications.\n\nIn medicine, it is important to be able to estimate the surface area of different parts of the body, both for the treatment of burns and also for calculating drug doses for chemotherapy. For example, if a burn covers more than 15% of the body, the patient may suffer from shock, and it is important to quickly get the patient medical attention.\n\nBut how do you do estimate a surface area as complicated as a human body?\n\n## Example: Body Area\n\nHow could you estimate the area of part of a body or a whole body? Think of as many approaches as you can, mathematical or otherwise, and be creative! You don’t need to work out these estimates at this stage—just make suggestions on how you might do it.\n\nIn an emergency, how could you tell quickly whether a person had suffered burns on more than 15% of the body?\n\nIf there were a medical emergency, coming up with an answer an hour later such as “The area burned is 0.98562 square meters and since this is over 15% of the body area, I recommend immediate medical attention” isn’t going to help. A rough estimate will be good enough to make the decision about treatment.\n\nOne approach (that uses the mathematical modeling cycle from Unit 2) would be to approximate the body with simpler shapes such as cylinders and spheres, and then, after taking many individual measurements, determine the area of these shapes (for example, the surface area of a leg could be modeled by two cylinders).\n\nThe total surface area of the body could then be estimated by adding the areas of the individual shapes. However, there are many ways of approaching this problem, and some of these are discussed below. Which one you choose will depend on how accurate you need the answer to be and other physical considerations.\n\nA more practical approach of solving the problem might be to wrap the body in cloth so that it covers the skin, then remove the cloth and measure the areas of the flat cloth shapes that result.\n\nOr you might decide to do some research to see if there are any formulas for body area.\n\nAlternatively, the area of one side of a person’s hand is estimated to be about 1% of the total body surface area. You could draw around the hand, on graph paper marked in square centimeters, and then count the squares to find the area or just estimate this area by using simple shapes. This would give an estimate for the area of the hand, and multiplying by 100 would then give an estimate of the total body area.", null, "You could also use the hand area as an informal measure to find the area of a burn on part of the body by estimating how many handprints would cover the burn. For example, if the burn were covered by three handprints, an estimate for the area would be 3% of the total body surface area. This rough estimate could be made very quickly at the scene of the accident. Although it may not be as accurate as the earlier methods, it would enable the paramedics to make a quick decision on the urgency of the situation and possible treatments.\n\nParamedics also use the “rule of nines” for extensive burns on adults. This splits the body into sections with each section being either 9% (head, chest, abdomen, arm) or 18%, (leg, back) of the total body surface area. Although more accurate charts for estimating different body areas exist, the rule of nines is easy to remember and allows an estimate to be made quickly in an emergency.", null, "10.6.7 Estimating Areas" ]
[ null, "https://www.open.edu/openlearncreate/pluginfile.php/5379/mod_oucontent/oucontent/295/none/none/image352.png", null, "https://www.open.edu/openlearncreate/pluginfile.php/5379/mod_oucontent/oucontent/295/none/none/image353.png", null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.95458263,"math_prob":0.9266495,"size":3707,"snap":"2021-31-2021-39","text_gpt3_token_len":781,"char_repetition_ratio":0.15662976,"word_repetition_ratio":0.015082956,"special_character_ratio":0.21095225,"punctuation_ratio":0.08648649,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9616366,"pos_list":[0,1,2,3,4],"im_url_duplicate_count":[null,2,null,2,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2021-09-24T13:29:47Z\",\"WARC-Record-ID\":\"<urn:uuid:8752d71c-afb0-43da-9365-10c4cd3aecac>\",\"Content-Length\":\"98764\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:fd27a064-fc6a-4678-a341-1e1a94e6b659>\",\"WARC-Concurrent-To\":\"<urn:uuid:976d4ecb-09bf-402a-ba41-86bfe4fab4d6>\",\"WARC-IP-Address\":\"137.108.200.104\",\"WARC-Target-URI\":\"https://www.open.edu/openlearncreate/mod/oucontent/view.php?id=568&section=7.8\",\"WARC-Payload-Digest\":\"sha1:CLQNNQOLN4YGNPZVQSU37HSI66U5Y55I\",\"WARC-Block-Digest\":\"sha1:32WCVACSCTTAUFCJ4AHVDKGZQXYNKKDW\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2021/CC-MAIN-2021-39/CC-MAIN-2021-39_segments_1631780057524.58_warc_CC-MAIN-20210924110455-20210924140455-00160.warc.gz\"}"}
https://deepai.org/publication/adversarial-infidelity-learning-for-model-interpretation
[ "", null, "# Adversarial Infidelity Learning for Model Interpretation\n\nModel interpretation is essential in data mining and knowledge discovery. It can help understand the intrinsic model working mechanism and check if the model has undesired characteristics. A popular way of performing model interpretation is Instance-wise Feature Selection (IFS), which provides an importance score of each feature representing the data samples to explain how the model generates the specific output. In this paper, we propose a Model-agnostic Effective Efficient Direct (MEED) IFS framework for model interpretation, mitigating concerns about sanity, combinatorial shortcuts, model identifiability, and information transmission. Also, we focus on the following setting: using selected features to directly predict the output of the given model, which serves as a primary evaluation metric for model-interpretation methods. Apart from the features, we involve the output of the given model as an additional input to learn an explainer based on more accurate information. To learn the explainer, besides fidelity, we propose an Adversarial Infidelity Learning (AIL) mechanism to boost the explanation learning by screening relatively unimportant features. Through theoretical and experimental analysis, we show that our AIL mechanism can help learn the desired conditional distribution between selected features and targets. Moreover, we extend our framework by integrating efficient interpretation methods as proper priors to provide a warm start. Comprehensive empirical evaluation results are provided by quantitative metrics and human evaluation to demonstrate the effectiveness and superiority of our proposed method. Our code is publicly available online at https://github.com/langlrsw/MEED.\n\n## Authors\n\n##### This week in AI\n\nGet the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.\n\n## 1. Introduction\n\nThe interpretation of data-driven models explains their input-output relationship, which provides information about whether the models admit some undesired characteristics, and thus can guide people to use, debug, and improve machine learning models. The model interpretation has an increasing demand in many real-applications, including medicine\n\n(Wang et al., 2019), security (Chakraborti et al., 2019), and criminal justice (Lipton, 2018).\n\nExisting research on model interpretation can be categorized into model-specific methods and model-agnostic methods. Model-specific methods take advantage of the knowledge of the model itself to assist explanations, such as gradient-based methods for neural networks, whereas model-agnostic methods can explain any black-box system. Instance-wise Feature Selection (IFS) is a well known model-agnostic interpretation method. It produces an importance score of each feature for representing a data sample (Du et al., 2019), which indicates how much each feature dominates the model’s output. For this kind of approach, desired properties for ideal explanations (feature importance scores) are as follows.\n\n• Expressiveness: the number of features with relatively high scores should be small (Ribeiro et al., 2016).\n\n• Fidelity: the model output should primarily depend on high-score features (Ribeiro et al., 2016; Chen et al., 2018; Bang et al., 2019; Hara et al., 2019; Hooker et al., 2019; Yeh et al., 2019; Schwab and Karlen, 2019; Khakzar et al., 2019).\n\n• Low sensitivity: feature scores should be robust against adversarial attacks (Yeh et al., 2019; Dombrowski et al., 2019; Heo et al., 2019; Zhang et al., 2018).\n\n• Sanity: feature scores should be dependent of the model (Adebayo et al., 2018b).\n\nRecent research for IFS-based model explanation can be divided into (local/global) feature attribution methods (Ancona et al., 2017; Yeh et al., 2019)111In this paper, the definitions of global and local explanations follow the description of Ancona et al. (Ancona et al., 2017) and Yeh et al. (Yeh et al., 2019), and distinct from that of Plumb et al. (Plumb et al., 2018). and direct model-interpretation (DMI) methods. Local feature attribution methods provide some sensitivity scores of the model output concerning the changes of the features in the neighborhood. In contrast, global feature attribution methods directly produce the amount of change of the model output given changes of the features. Other than providing the change of the model output, DMI is a more straightforward approach to select features and use a model to approximate the output of the original black-box model (Chen et al., 2018; Sundararajan et al., 2017).\n\nIn this paper, we attempt to tackle the DMI problem. When given a data sample and the model to be explained, what features does the model use primarily to generate the output? A straightforward approach is to develop a feature attribution network (which we refer to as the explainer) to produce a soft/hard mask to highlight essential features, and a prediction network (which we refer to as the approximator) to approximate the output of the original model (Chen et al., 2018). However, this straightforward approach may be faced with four following problems.\n\n• Sanity problem (Adebayo et al., 2018b): a mask may be irrelevant to the original model, but only relate to the features of a specific sample. As a consequence, the selected features of the trained explainer may be different with those truly used by the original model, which is not expected in interpreting the model.\n\n• combinatorial shortcuts problem: the entries of the mask may not select good features, but rather act as additional features themselves for better approximation performances (Jain and Wallace, 2019; Wiegreffe and Pinter, 2019), because it is a function of all the input features. For example, the explainer could choose to mask out the first half of the features for positive samples, and the second half of the features for negative samples. The approximator can utilize this pattern to predict the target while completely ignore whether good features are selected.\n\n• Model identifiability problem: similar approximation performances can be achieved by different groups of feature. It is difficult to decide which group is the best.\n\n• Information transmission problem (Park et al., 2019): it is difficult to transmit effective supervised information to the explainer, because the mask is unsupervised.\n\nTo address these issues, we propose a Model-agnostic Effective Efficient Direct (MEED) model-interpretation method for addressing the DMI problem. The overall architecture of our proposed framework is presented in Figure 1. The major components include model output feedback, adversarial infidelity learning, and prior knowledge-based warm start, which we describe as follows.\n\nFirstly, we propose to enrich the input information of the explainer to boost the effectiveness and the efficiency of the feature selection process. Existing research treats raw features only as the input to the neural network-based explainer (Schwab and Karlen, 2019; Chen et al., 2018; Bang et al., 2019). The absence of the original model to include for the explainer’s input may render the mask out of the explainer uncorrelated with the original model and then cause the sanity problem. Nonetheless, it is not trivial to input a whole model into the neural network-based explainer. Therefore, we propose to incorporate the model output as another input signal. Apart from the sanity problem, the model output can provide rich information for the explainers to select essential features, and make the learning process more precise, especially in applications like regression or representation learning. In other words, the information transmission problem can also be mitigated.\n\nSecondly, we propose to exploit the unselected features for mitigating the combinatorial shortcuts and model identifiability problems. Inspired by Hooker et al. (Hooker et al., 2019), we attempt to achieve an auxiliary goal that the unselected features should contain the least useful information. To achieve this, we propose an Adversarial Infidelity Learning (AIL) mechanism. Specifically, we develop another approximator that learns to approximate the original model output using the unselected features. Then our explainer learns to select features to minimize such approximation accuracy. The learning processes run alternately. Intuitively, the convergence of such an adversarial learning process will render the masks uncorrelated with the model output, and then can mitigate the combinatorial shortcuts problems. On the other hand, this learning process exploits the unselected features, which are often (at least relatively) ignored, to introduce additional supervised information for a certain group of selected features, and then can improve model identifiability. These properties are demonstrated by our theoretical analysis and experimental results.\n\nFinally, we extend our framework to further mitigate the information transmission problem by integrating prior knowledge. Specifically, we integrate explanations provided by efficient interpretation methods as priors to provide a warm start. The constraints of the priors fade out when the number of training epochs grows to learn a more powerful explainer by the end-to-end framework.\n\nWe follow Chen (Chen et al., 2018) to perform a predictive evaluation to see whether the selected features contribute to sufficient approximate accuracy. Comprehensive empirical evaluation results on four real-world benchmark datasets are provided with quantitative evaluation metrics and human-evaluations to demonstrate the effectiveness and superiority of our proposed method. Moreover, we validate our method on a real-world application: teenager/adult classification based on mobile sensor data from million of Tencent users who play the popular Honor of Kings, a.k.a. Arena of Valor game.\n\n## 2. Related Works\n\nModel interpretation methods based on IFS can be categorized into local/global methods as introduced in the introduction. Local methods includes 1) gradient-based methods, such as Gradient (Grad) (Simonyan et al., 2013) and Guided Back-Propagation (Springenberg et al., 2015), 2) sampling-based methods, i.e., perform sensitivity analysis by sampling points around the given data sample, such as LIME (Ribeiro et al., 2016), kernel SHAP (Lundberg and Lee, 2017) and CXPlain (Schwab and Karlen, 2019), and 3) hybrid methods, such as SmoothGrad (Smilkov et al., 2017), Squared SmoothGrad (Smilkov et al., 2017), VarGrad (Adebayo et al., 2018a), and INFD (Yeh et al., 2019). On the other hand, global methods include Gradient Input (Shrikumar et al., 2017), Integrated Gradients (Sundararajan et al., 2017), DeepLIFT (Shrikumar et al., 2017) and LRP (Bach et al., 2015), among others. These methods do not directly tackle the DMI problem.\n\nFor the DMI problem, being inherently interpretable, tree- (Schwab and Hlavacs, 2015) and rule-based (Andrews et al., 1995) models have been proposed to approximate the output of a complex black-box model with all features. The models themselves provide explanations, including feature importance. However, they may lack the ability for accurate approximations when the original given model is complex. Recently, L2X (Chen et al., 2018) and VIBI (Bang et al., 2019)\n\nhave been proposed as variational methods to learn a neural network-based approximator based on the selected features. The unselected features are masked out by imputing zeros. VIBI improves L2X to encourage the briefness of the learned explanation by adding a constraint for the feature scores to a global prior (in contrast, our priors are conditioned on each sample). Since L2X and VIBI only input features to their explainers, and they directly select features to approximate the model out, therefore, they both may suffer from the\n\nsanity, combinatorial shortcuts, model identifiability, model identifiability, and information transmission problems.\n\nIn contrast, our method tackle these problems for DMI by leveraging more comprehensive information from the model output, the proposed adversarial infidelity learning mechanism, and the proposed prior-knowledge integration. We note that Zhu et al. (Zhu et al., 2019) proposed an adversarial attention network. However, their objective is to eliminate the difference in extracted features for different learning tasks, which is different from ours.\n\n## 3. Methodology\n\nIn this section, we present the detailed methodology of our method. First, we define the notations and problem settings of our study.\n\nConsider a dataset consisting of independent samples. For the th sample,\n\nis a feature vector with\n\ndimensions, is the output vector of a given data-driven model  (note that may be different from the true label of the sample). The conditional output distribution is determined by the given model. For classification tasks, is the number of classes.\n\nWe do not assume the true label of each feature vector is available for training or inference. We develop a neural network-based IFS explainer , which outputs a feature-importance-score vector for a data sample and the model . As discussed by Yeh et al. (Yeh et al., 2019), the explainer should be a mapping that . Since it is not trivial to treat an arbitrary model in as an input to a neural network, we compromise by involving the model output as an alternative such that . We select top- features according to , where is a user-defined parameter. The indices of selected features are denoted by . For a feature vector , the selected features are denoted by , whereas the unselected features are denoted by . Throughout the paper, we denote as the index set for some integer .\n\nThe goal of our learning approach is to train a neural network-based explainer over the dataset and then generalize it to a testing set to see whether the selected features contribute to sufficient approximate accuracy. The quantitative evaluations of the explainer are described in Section 4.0.2.\n\n### 3.1. Our Framework\n\nThe architecture of our framework is illustrated in Fig. 1. We explain a given model by providing IFS for each specific data sample. The IFS is embodied as a feature attribution mask provided by a learned explainer with the features and the model output of the data sample as inputs. We train an approximator to use selected/masked features to approximate the model output. We also train an adversarial approximator to use unselected features to approximate the model output, and then train the explainer to select features to undermine the approximation, which is referred to as the AIL mechanism. As an extention, integrating efficient model-interpretation methods is also introduced to provide a warm start.\n\nAs discussed in the introduction, a straightforward approach to optimize the selection indices is directly maximizing the mutual information between selected features , and the model output  (Chen et al., 2018; Bang et al., 2019). To tackle the combinatorial shortcuts and model identifiability problems, we propose an auxiliary objective: minimizing the mutual information between unselected features and the model output . Because compared with the selected features, the unselected features should contain less useful information. Therefore, the basic optimization problem for is:\n\n (1) maxS I(xS;y)−I(x¯S;y)  s.t. S∼E(x,y).\n\nWe can be guided by the Theorem 1 to optimize the explainer.\n\n###### Theorem 1 ().\n\nDefine\n\n (2) S∗=argmaxSE[logp(y∣xS)−logp(y∣x¯S)],\n\nwhere the expectation is over . Then is a global optimum of Problem (1). Conversely, any global optimum of Problem (1) degenerates to almost surely over .\n\nThe proof is deferred to Appendix A.1. Problem (1) and Theorem 1 show that the auxiliary objective exploits to involve additional supervised information, and then improves model identifiability.\n\nAccording to Theorem 1, we deveop an approximator to learn the conditional distribution . We achieve this by optimizing a variational mapping: to let approximate . We define , where\n\ndenotes the loss function corresponding to the conditional distribution\n\n(e.g.,\n\nmean square error for Gaussian distribution, and categorical cross entropy for categorical distribution), and\n\nwhich is defined as: if and otherwise. We let denote the output distribution of . We approximate by instead of , because as discussed by Hooker et al. (Hooker et al., 2019), , then may approximate more accurate than does.\n\nSimilarly, we develop another approximator to learn to approximate . Then we can show that Problem (1) can be relaxed by maximizing variational lower bounds and alternately optimizing:\n\n (3) maxAs,Au E[logqs(y∣xS)+logqu(y∣x¯S)]  s.t. S∼E(x,y),\n (4) maxE E[logqs(y∣xS)−logqu(y∣x¯S)]  s.t. S∼E(x,y).\n\nFirst, Problem (3) is optimized to learn and to approximate and , respectively. Then Problem (4) is optimized to learn the explainer to find good explanations according to Theorem 1. Since 1) is maximized by optimizing and then minimized by optimizing , which is an adversarial learning process, and 2) minimizing represents infidelity, i.e., undermining performance to approximate (by excluding selected features), the alternate optimization process can be regarded as an adversarial infidelity learning mechanism.\n\nSince optimizing Problems (3) and (4) for all possible requires times of computation for the objectives, we follow L2X (Chen et al., 2018) to apply the Gumbel-softmax trick to approximately sample a -hot vector. Specifically, let for a pair of inputs , where for , and . Then we define the sampled vector , where for a predefined ,\n\n (5) vj=maxl∈[k]exp((logzj+ξlj)/τ)∑dj′=1exp((logzj′+ξlj′)/τ), j∈[d],ξlj=−log(−logulj), ulj∼Uniform(0,1), j∈[d],l∈[k].\n\nDenote the above random mapping by , approximate and , where with all elements being , and denotes element-wise product. Define the losses for selected and unselected features, respectively,\n\n (6) Ls=1nn∑i=1ℓs(yi,As(xi⊙G(E(xi,yi))))Lu=1nn∑i=1ℓu(yi,Au(xi⊙(1d−G(E(xi,yi)))).\n\nThen we can relax Problems (3) and (4) as\n\n (7) minAs,Au Ls+Lu,\n (8) minE Ls−Lu.\n\nFor inference, one can select the top- features of for a testing sample , where .\n\n### 3.3. Theoretical Analysis\n\nIn this section, we first derive variational lower bounds to show the connection between the goal in Eq. (1) and the realization in Eq. (3) and (4). The derivation also shows that the approximator is possible to be superior to the given model to predict the model output using masked features. We also show that our AIL mechanism can mitigate the combinatorial shortcuts problem.\n\nThe variational lower bounds are as follows and derived in Appendix A.2. First, for selected features, we have for any :\n\n (9) I(xS;y)=ExEy∣xES∣x,yEy∣xS[logp(y∣xS)]+Const,Ey∣xS[logp(y∣xS)]≥Ey∣xS[logqs(y∣xS)],\n\nwhere the equality holds if and only if . Therefore, if ’s output distribution , it is possible that , i.e., can be more accurate than\n\nto estimate\n\n.\n\nSimilarly, for unselected features, we have for any :\n\n (10) I(x¯S;y)=ExEy∣xES∣x,yEy∣x¯S[logp(y∣x¯S)]+Const.Ey∣x¯S[logp(y∣x¯S)]≥Ey∣x¯S[logqu(y∣x¯S)].\n\nOn the other hand, since actually receives the selected features and the feature-attribution mask as inputs, where , what actually learns is the conditional distribution . Through the straightforward learning mentioned in the introduction, i.e., removing in Eq. (7) and (8), it could cause the combinatorial shortcuts problem for to learn only, resulting in the feature selection process meaningless. Fortunately, Theorem 2 shows that our AIL can help to avoid this problem by encouraging the independence between and , then it will be hard for to approximate solely by . Thus, will have to select useful features from . The proof can be found in Appendix A.3.\n\n###### Theorem 2 ().\n\nFor the optimized problem in Eq. (7) and (8), the independence between and is encouraged.\n\n### 3.4. Extension Considering Prior Knowledge\n\nAs described in Section 3.2, the feature attribution layer (the output layer of the explainer) is in the middle of networks. Since it is optimized by an end-to-end learning process, the information transmission is inefficient. Therefore, we propose to involve efficient interpretations as good priors of feature attribution.\n\nLet be a feature-importance-score vector generated by another interpretation method for a sample and the model . Assume for , and , which can be easily achieved through a softmax operation.\n\nGiven for a sample , we can regard as for , where denotes whether the th feature should be selected. Similarly, we can regard as . Then assuming conditional independence between the interpretation models and given and , we can obtain\n\n (11) p(δ=j∣x,M,E,H)=p(δ=j∣x,M,E)p(δ=j∣x,M,H)∑dj′=1p(δ=j′∣x,M,E)p(δ=j′∣x,M,H).\n\nThe derivation details can be found in Appendix A.4.\n\nNonetheless, as we expect that the end-to-end learning process can generate better explanations, the prior explanation should decrease its influence when the number of epochs increases. Therefore, we define\n\n (12) ~\\boldmathz:=[p(δ=j∣x,M,E)mp(δ=j∣x,M,H)]1/(m+1)∑dj′=1[p(δ=j′∣x,M,E)mp(δ=j′∣x,M,H)]1/(m+1).\n\nFor Eq. (5), we replace with the re-estimated defined in Eq. (12).\n\nIn addition, we add a constraint for the explanations, learning to be close to for a loss :\n\n (13) Le=1nn∑i=1ℓe(~\\boldmath% zi,\\boldmathzi)m+1.\n\nThe constraint will fade out when the number of epochs becomes large, and thus only contributes for a warm start.\n\n## 4. Experiments", null, "Figure 2. Examples of explanations on the IMDB dataset. The labels predicted by the original given model using all the words, the words selected by the state-of-the-art baseline VIBI, and the words selected by our method are shown, respectively, at the bottom of each panel. Keywords picked by VIBI, our method, and both methods are highlighted in blue, green, and yellow, respectively. In (1) and (2), the given model output consistent predictions using the selected words by both VIBI and ours, whereas (3) and (4), the prediction using full words is inconsistent with that using VIBI’s selected words but is still consistent with that using our selected words. Best view in colors.\n\nWe conduct comprehensive evaluations on five datasets:\n\n• IMDB sentiment analysis dataset\n\n(Maas et al., 2011),\n\n• MNIST dataset (LeCun et al., 1998)\n\nto classify\n\n3 and 8,\n\n• Fashion-MNIST dataset (Xiao et al., 2017) to classify Pullover and Coat,\n\n• ImageNet dataset (Deng et al., 2009) to classify Gorilla and Zebra,\n\n• our established mobile sensor dataset from Tencent Honor of Kings game for teenager recognition, which we refer to as Tencent Gaming Dataset (TGD) in this paper.\n\nThe detailed re-organization process for each data will be introduced in the following sections.\n\n#### 4.0.1. Methods for Comparison\n\nWe compare our method (Ours) with the state-of-the-art model-agnostic baselines: LIME (Ribeiro et al., 2016), kernel SHAP (SHAP) (Lundberg and Lee, 2017), CXPlain (CXP) (Schwab and Karlen, 2019), INFD (Yeh et al., 2019), L2X (Chen et al., 2018) and VIBI (Bang et al., 2019). We also compare model-specific baselines: Gradient (Grad) (Simonyan et al., 2013) and Gradient Input (GI) (Shrikumar et al., 2017).\n\n#### 4.0.2. Evaluation Metrics\n\nWe follow Chen (Chen et al., 2018) to perform a predictive evaluation for the fidelity of both the selected and the unselected features. For the Fidelity of the Selected features, given an explanation, e.g., selected features , from an arbitrary IFS interpretation method, we evaluate whether the given model truly use the selected features primarily to generate the very output . To answer this, we need to approximate based on selected features . Thus, we evaluate by the consistency between and (recall that is with unselected features imputed by zeros), denoted by FS-M(%). However, is trained on all features of , not on  (Hooker et al., 2019). Therefore, we additionally propose to evaluate the consistency between and as a reference, denoted by FS-A(%), where is an trained approximator on to learn the mapping . High FS-M or FS-A result suggests high importance of the selected features. Similarly, for the Fidelity of the Unselected features, we evaluate the consistency between and , denoted by FU-M(%); and the consistency between and , denoted by FU-A(%), where is an trained approximator on to learn the mapping . Low FU-M or FU-A result suggests high importance of the selected features. Note that low FS-A or high FU-A is possible because the number of selected features are usually small. Nonetheless, simultaneous results of high FS-A and low FU-A suggest good selected features.\n\nFor human evaluation, we also follow Chen (Chen et al., 2018) to evaluate Fidelities of Selected features denoted by FS-H(%), i.e., whether the predictions made by a human using selected features are consistent with those made by the given model using all the features. We adopt this metric to evaluate whether human can understand how the given model makes decisions. Note that sometimes human may not understand or be satisfied with features selected by the given model. After all, we are explaining the given model, not human.\n\nFor the evaluation metric for the fidelities, we report top-1 accuracy (ACC@1), since the five tasks are all binary classification. Specifically, the model outputs are transformed to categorical variables to compute accuracy. We adopt binary masks to select features,\n\ni.e., top  values of are set to , others are set to , and then we treat as the selected features. On the other hand, we evaluate the influence of adversarial examples on the feature importance scores by the sensitivity score, SEN(%), proposed by Yeh et al. (Yeh et al., 2019). We also report the average explanation Time (by second) Per Sample (TPS) on a single NVidia Tesla m40 GPU.\n\n#### 4.0.3. Implementation Details\n\nIn Eq. (6), adopts cross-entropy. adopts cross-entropy for IMDB, MNIST, and TGD, and adopts Wasserstein distance (Lee et al., 2019) for Fashion-MNIST and ImageNet. The weights for in Eq. (7) and (8) are 1e-3 for MNIST and 1 for all other datasets. We adopt the GI method to provide the prior explanations. in Eq. (13) is mean absolute error with the weight to be 1e-3 for ImageNet and 0 for others.\n\nfor all the datasets. We constrain the model-capacity of each method to be the same to acquire fair comparisons. For each dataset, we split half test data for validation. For each method on each dataset, we repeat 20 times and report the averaged results. Our implementation uses Keras with Tensorflow\n\n(Abadi et al., 2016) backends. We list all other details in Appendix B.\n\n### 4.1. Imdb\n\nThe IMDB (Maas et al., 2011) is a sentiment analysis dataset which consists of 50,000 movie reviews labeled by positive/negative sentiments. Half reviews are for training, and the other half is for testing. We split half of the testing reviews for validation. For the given model, we follow Chen et al. (Chen et al., 2018)\n\nto train a 1D convolutional neural network (CNN) for binary sentiment classification, and achieve the test accuracy of 88.60%. We develop our approximator with the same architecture as the given model. And we develop our explainer with the 1D CNN used by L2X\n\n(Chen et al., 2018) with a global and a local component. For a fair comparison, each method selects top- important words as an explanation for a review.\n\nAs shown in Table 1, our method significantly outperforms state-of-the-art baseline methods. Especially, our FS-M score shows nearly optimal fidelity, which is objectively validated by the original given model. Given that our FU-A score is similar to those of baselines, which shows that our selected features are indeed important, we demonstrate that the effectiveness and superiority of our method are significant. We present some examples of selected words of our method and the state-of-the-art baseline VIBI in Fig. 2. As shown in Fig. 2, our method not only selects more accurate keywords, but also provides more interpretable word combinations, such as “I enjoyed it”, “fabulous dancer”, “extremely bad movie”, and “excellent thriller”. Even though “I”, “it”, “dancer”, “movie”, and “thriller” are not apparent whether they are positive or negative words. Especially in Fig. 2 (2), our method picks the word “Oscar”, which is not explicit positive, but its underlying logic suggests positive sentiment. These inspiring examples support the significant superiority of our method.\n\n#### 4.1.1. Human Evaluation\n\nWe also evaluate with the help of humans to quantify how interpretable are those selected words. We randomly select reviews in the testing set for this human evaluation. We invite Tencent employees to infer the sentiment of a review given only the selected words. The explanations provided by different interpretation methods are randomly mixed before sent to these employees. The final prediction of each review is averaged over multiple human annotations. For the explanations that are difficult to infer the sentiments, we ask the employees to provide random guesses. Finally, as shown by the FS-H scores in Table 1, our method significantly outperforms baseline methods as well.\n\n#### 4.1.2. Ablation Study\n\nWe evaluate three variants of our method by ablating our three components, i.e., the model output feedback (Output), AIL, and prior knowledge-based warm start (Prior). In Table 2, we show the effectiveness of both the model output feedback and AIL. It is worthy of mentioning that, although the warm start strategy does not improve the final scores, it boosts the convergence rate at the start of optimization, as shown in Fig. 3.\n\n#### 4.1.3. Sanity Check\n\nWe perform the model and data randomization tests suggested by Adebayo et al. (Adebayo et al., 2018b). We evaluate the sanity by the cosine correlation between binary masks, i.e., the original mask, and the other one resulted from randomization. The sanity scores for model and data randomization tests are 9.39% and 10.25%, respectively, which shows that our explanations are dependent on models and then are valid.", null, "Figure 3. The FS-M scores of our method with and without the prior knowledge-based warm start.\n\n### 4.2. Mnist", null, "Figure 4. Examples of explanations on the MNIST dataset. In each panel, an original image and the masked images by VIBI and our method are presented from left to right. The labels inferred by the original model using the full images are 3 and 8 for panels (1) and (2), respectively.\n\nWe select the data of 3 and 8 of the MNIST dataset (LeCun et al., 1998) for binary classification with 11, 982 training and 1984 testing images. We train a 2D CNN with two convolutional layers for the classification and achieve the test accuracy of 99.89%. We develop our approximators are by the same architecture as the given model, whereas we develop our explainer by a 2D CNN with three convolutional layers only. Each method selects top- pixels as an explanation for an image.\n\nAs shown in Table 3, our method still outperforms state-of-the-art model-agnostic baseline methods except for the CXPlain method, which uses the additional true label for each sample and is highly sensitive to adversarial examples. The Grad and GI methods are model-specific and not robust when facing challenging data, e.g., see Tables 14, and 5. Compared with the next-best model-agnostic baseline VIBI, the strength of our method determined by the FU-M score is to select the necessary features of a sample for recognition. We show some examples of selected pixels of our method and VIBI in Fig. 4. As shown in Fig. 4 (1), the VIBI masked image is closer to 8 than 3, whereas our masked image is more similar to 3. In Fig. 4 (2), though the VIBI masked image is similar to 8, but it is also close to a 3. In contrast, our masked image can never be 3. Since we are interpreting the recognition logic of model rather than that of humans, it is important to select features in favor of the machine logic, e.g., considering both possibility and impossibility.\n\n#### 4.2.1. Human Evaluation\n\nWe randomly select images in the testing set for this human evaluation. We invite Tencent employees who are experts in machine learning to perform the same binary classification given only the masked images. Specifically, we ask the subjects to provide two scores in the range of for each image. Each score is for the possibility of each class (3 or 8). We perform\n\nnormalization for the scores as the final prediction probabilities. Other settings and procedures are similar to Section\n\n4.1.1. Finally, as shown by the FS-H scores in Table 3, our method significantly outperforms baseline methods as well.\n\n### 4.3. Fashion-MNIST", null, "Figure 5. Examples of explanations on the Fashion-MNIST dataset. The first, second and third lines list the original images, the images masked by VIBI, the images masked by our method, respectively.", null, "Figure 6. Examples of explanations on the ImageNet dataset. In each panel, an original image and the masked images by VIBI and our method are presented from left to right. Best view in colors.\n\nThe Fashion-MNIST dataset (Xiao et al., 2017) is a dataset of Zalando’s article images, which consists of images of classes. We select the data of Pullover and Shirt for binary classification dataset with 12,000 training and 2000 testing images. We train a 2D CNN with the same architecture as that for MNIST for the classification and achieve the test accuracy of 92.20%. The architectures of our approximators and explainer are also the same as those for MNIST. Each method selects top- pixels as an explanation for an image.\n\nAs shown in Table 4, our method outperforms state-of-the-art baseline methods except for the INFD method. Since INFD adds perturbation to each feature and directly performs regression, it is suitable for well-aligned data, e.g., the Fashion-MNIST dataset. However, as shown in Tables 1 and 3, INFD’s performances are disappointing for data that are not well-aligned. Therefore, our method is more robust. Moreover, INFD is extremely time-consuming to be applied to practical applications and is sensitive to adversarial examples. Compared with the next-best baseline VIBI, we show some examples of selected pixels in Fig. 5. As shown in Fig. 5, VIBI primarily focuses on the contours, whereas our method focuses on relatively fixed local regions. Since the data are well-aligned, the explanations provided by our method are more consistent with the machine logic of the original model.\n\n### 4.4. ImageNet", null, "Figure 7. Examples of explanations on the TGD dataset (Honor of Kings). Each panel shows the mask for each time-series data sample with the time dimension of 3. (1) and (2) show samples of a teenager and an adult, respectively. Selected features are in orange. Best view in colors.\n\nWe select the data of Gorilla and Zebra from ImageNet (Deng et al., 2009) for binary classification. We adopt the MobileNet (Howard et al., 2017) and train only the top layer for the classification and achieve the test accuracy of 100%. We develop our approximators with the same architecture and adopt the U-Net (Ronneberger et al., 2015) for our explainer. Each method selects top-10% pixels as an explanation for an image. As shown in Table 5, our method outperforms state-of-the-art baselines. We exhibit some examples of selected pixels in Fig. 6 and compare them with the best baseline VIBI. As shown in Fig. 6 (1), our selected pixels are more concentrated on the label-related regions, which demonstrates that our method can improve the model identifiability. Fig. 6 (2) shows that our method can better avoid irrelevant regions, e.g., the ground and the back of an ostrich.\n\n### 4.5. Tgd\n\nLast, we apply our method to the Tencent Gaming Dataset (TGD), which consists of 100 million samples from 5 million gamers. Each sample is a time-series data with the time dimension and feature dimension of and\n\n, respectively. We extract the features from inertia sensors and touch information of mobile phones, in both time and frequency domains, and categorize in\n\ngroups. Each feature vector of a sample corresponds to a -second operation during the game. Three vectors are ordered by time, but not necessarily continuous in time. The learning task is the teenage gamer (age ) recognition. The original model is a stacked LSTM with an accuracy of 90.16%. The approximator uses the same structure, and the explainer is also a stacked LSTM. Our method achieves the FS-M, FU-M, FS-A, FU-A, and SEN scores of 95.68%, 82.24%, 95.33%, 82.37%, and 0.18%, respectively, selecting only 10% of features. We show examples of selected features in Fig. 7. In Fig. 7 (1), the teenage gamer performs a complex operation excitedly at the start but performs a monotonous/regular operation at the end. Whereas, in Fig. 7 (2), the adult gamer starts with casual flipping of the mobile phone, and ends with a complex/skilled operation.\n\n## 5. Conclusion\n\nIn this paper, we investigate the model interpretation problem in the favored direction of Instance-wise Feature Selection (IFS). We propose a Model-agnostic Effective Efficient Direct (MEED) IFS framework for model interpretation. Specifically, we consider the model output feedback as an additional input to learn an explainer to mitigate the sanity and information transmission problems. Furthermore, we propose an adversarial infidelity learning (AIL) mechanism to screen relative unimportant features for mitigating the combinatorial shortcuts and the model identifiability problems. Our theoretical analyses show that AIL can mitigate the model identifiability and combinatorial shortcuts problems. Our experimental results reveal that AIL can mitigate the model identifiability problem and learn more necessary features. Moreover, our extension to integrate efficient interpretation methods as proper priors has been shown to provide a warm start and mitigate the information transmission problem. Comprehensive empirical evaluation results provided by quantitative metrics and human evaluation demonstrate the effectiveness, superiority, and robustness of our proposed method across benchmarks and one real-world Tencent game dataset.\n\n## References\n\n• M. Abadi, P. Barham, J. Chen, Z. Chen, A. Davis, J. Dean, M. Devin, S. Ghemawat, G. Irving, M. Isard, et al. (2016) Tensorflow: a system for large-scale machine learning.. In OSDI, Vol. 16, pp. 265–283. Cited by: §4.0.3.\n• J. Adebayo, J. Gilmer, I. Goodfellow, and B. Kim (2018a) Local explanation methods for deep neural networks lack sensitivity to parameter values. arXiv preprint arXiv:1810.03307. Cited by: §2.\n• J. Adebayo, J. Gilmer, M. Muelly, I. Goodfellow, M. Hardt, and B. Kim (2018b) Sanity checks for saliency maps. In Advances in Neural Information Processing Systems, pp. 9505–9515. Cited by: 4th item, 1st item, §4.1.3.\n• M. Ancona, E. Ceolini, C. Öztireli, and M. Gross (2017) A unified view of gradient-based attribution methods for deep neural networks. In\n\nNIPS 2017-Workshop on Interpreting, Explaining and Visualizing Deep Learning\n\n,\nCited by: §1, footnote 1.\n• R. Andrews, J. Diederich, and A. B. Tickle (1995) Survey and critique of techniques for extracting rules from trained artificial neural networks. Knowledge-based systems 8 (6), pp. 373–389. Cited by: §2.\n• S. Bach, A. Binder, G. Montavon, F. Klauschen, K. Müller, and W. Samek (2015) On pixel-wise explanations for non-linear classifier decisions by layer-wise relevance propagation. PloS one 10 (7), pp. e0130140. Cited by: §2.\n• S. Bang, P. Xie, W. Wu, and E. Xing (2019) Explaining a black-box using deep variational information bottleneck approach. arXiv preprint arXiv:1902.06918. Cited by: 2nd item, §1, §2, §3.2, §4.0.1.\n• T. Chakraborti, A. Kulkarni, S. Sreedharan, D. E. Smith, and S. Kambhampati (2019) Explicability? legibility? predictability? transparency? privacy? security? the emerging landscape of interpretable agent behavior. In Proceedings of the International Conference on Automated Planning and Scheduling, Vol. 29, pp. 86–96. Cited by: §1.\n• J. Chen, L. Song, M. Wainwright, and M. Jordan (2018) Learning to explain: an information-theoretic perspective on model interpretation. In International Conference on Machine Learning, pp. 883–892. Cited by: §A.1, §B.1, 2nd item, §1, §1, §1, §1, §2, §3.2, §3.2, §4.0.1, §4.0.2, §4.0.2, §4.1.\n• J. Deng, W. Dong, R. Socher, L. Li, K. Li, and L. Fei-Fei (2009) Imagenet: a large-scale hierarchical image database. In\n\n2009 IEEE conference on computer vision and pattern recognition\n\n,\npp. 248–255. Cited by: 4th item, §4.4.\n• A. Dombrowski, M. Alber, C. Anders, M. Ackermann, K. Müller, and P. Kessel (2019) Explanations can be manipulated and geometry is to blame. In Advances in Neural Information Processing Systems 32, H. Wallach, H. Larochelle, A. Beygelzimer, F. d'Alché-Buc, E. Fox, and R. Garnett (Eds.), pp. 13567–13578. External Links: Link Cited by: 3rd item.\n• M. Du, N. Liu, and X. Hu (2019) Techniques for interpretable machine learning. Communications of the ACM 63 (1), pp. 68–77. Cited by: §1.\n• S. Hara, K. Ikeno, T. Soma, and T. Maehara (2019) Feature attribution as feature selection. External Links: Link Cited by: 2nd item.\n• J. Heo, S. Joo, and T. Moon (2019) Fooling neural network interpretations via adversarial model manipulation. In Advances in Neural Information Processing Systems 32, H. Wallach, H. Larochelle, A. Beygelzimer, F. d'Alché-Buc, E. Fox, and R. Garnett (Eds.), pp. 2921–2932. External Links: Link Cited by: 3rd item.\n• S. Hooker, D. Erhan, P. Kindermans, and B. Kim (2019) A benchmark for interpretability methods in deep neural networks. In Advances in Neural Information Processing Systems, pp. 9734–9745. Cited by: 2nd item, §1, §3.2, §4.0.2.\n• A. G. Howard, M. Zhu, B. Chen, D. Kalenichenko, W. Wang, T. Weyand, M. Andreetto, and H. Adam (2017) Mobilenets: efficient convolutional neural networks for mobile vision applications. arXiv preprint arXiv:1704.04861. Cited by: §4.4.\n• S. Jain and B. C. Wallace (2019) Attention is not explanation. In Proceedings of the 2019 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, Volume 1 (Long and Short Papers), pp. 3543–3556. Cited by: 2nd item.\n• A. Jolicoeur-Martineau (2018) The relativistic discriminator: a key element missing from standard gan. arXiv preprint arXiv:1807.00734. Cited by: §B.1.\n• A. Khakzar, S. Baselizadeh, S. Khanduja, S. T. Kim, and N. Navab (2019) Explaining neural networks via perturbing important learned features. arXiv preprint arXiv:1911.11081. Cited by: 2nd item.\n• Y. LeCun, L. Bottou, Y. Bengio, and P. Haffner (1998) Gradient-based learning applied to document recognition. Proceedings of the IEEE 86 (11), pp. 2278–2324. Cited by: 2nd item, §4.2.\n• C. Lee, T. Batra, M. H. Baig, and D. Ulbricht (2019) Sliced wasserstein discrepancy for unsupervised domain adaptation. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pp. 10285–10295. Cited by: §B.1, §4.0.3.\n• Z. C. Lipton (2018) The mythos of model interpretability. Queue 16 (3), pp. 31–57. Cited by: §1.\n• S. M. Lundberg and S. Lee (2017) A unified approach to interpreting model predictions. In Advances in Neural Information Processing Systems, pp. 4765–4774. Cited by: §2, §4.0.1.\n• A. L. Maas, R. E. Daly, P. T. Pham, D. Huang, A. Y. Ng, and C. Potts (2011) Learning word vectors for sentiment analysis. In Proceedings of the 49th annual meeting of the association for computational linguistics: Human language technologies-volume 1, pp. 142–150. Cited by: 1st item, §4.1.\n• S. Park, S. Kim, H. Choe, and S. Yoon (2019) Fast and efficient information transmission with burst spikes in deep spiking neural networks. In 2019 56th ACM/IEEE Design Automation Conference (DAC), pp. 1–6. Cited by: 4th item.\n• G. Plumb, D. Molitor, and A. S. Talwalkar (2018) Model agnostic supervised local explanations. In Advances in Neural Information Processing Systems, pp. 2515–2524. Cited by: footnote 1.\n• M. T. Ribeiro, S. Singh, and C. Guestrin (2016) Why should i trust you?: explaining the predictions of any classifier. In Proceedings of the 22nd ACM SIGKDD international conference on knowledge discovery and data mining, pp. 1135–1144. Cited by: 1st item, 2nd item, §2, §4.0.1.\n• O. Ronneberger, P. Fischer, and T. Brox (2015) U-net: convolutional networks for biomedical image segmentation. In International Conference on Medical image computing and computer-assisted intervention, pp. 234–241. Cited by: §B.1, §4.4.\n• P. Schwab and H. Hlavacs (2015) Capturing the essence: towards the automated generation of transparent behavior models. In\n\nEleventh Artificial Intelligence and Interactive Digital Entertainment Conference\n\n,\nCited by: §2.\n• P. Schwab and W. Karlen (2019) CXPlain: causal explanations for model interpretation under uncertainty. In Advances in Neural Information Processing Systems, pp. 10220–10230. Cited by: 2nd item, §1, §2, §4.0.1.\n• A. Shrikumar, P. Greenside, and A. Kundaje (2017) Learning important features through propagating activation differences. In Proceedings of the 34th International Conference on Machine Learning-Volume 70, pp. 3145–3153. Cited by: §2, §4.0.1.\n• K. Simonyan, A. Vedaldi, and A. Zisserman (2013) Deep inside convolutional networks: visualising image classification models and saliency maps. arXiv preprint arXiv:1312.6034. Cited by: §2, §4.0.1.\n• D. Smilkov, N. Thorat, B. Kim, F. Viégas, and M. Wattenberg (2017) Smoothgrad: removing noise by adding noise. arXiv preprint arXiv:1706.03825. Cited by: §2.\n• J. Springenberg, A. Dosovitskiy, T. Brox, and M. Riedmiller (2015) Striving for simplicity: the all convolutional net. In ICLR (workshop track), Cited by: §2.\n• M. Sundararajan, A. Taly, and Q. Yan (2017) Axiomatic attribution for deep networks. In Proceedings of the 34th International Conference on Machine Learning-Volume 70, pp. 3319–3328. Cited by: §1, §2.\n• F. Wang, R. Kaushal, and D. Khullar (2019) Should health care demand interpretable artificial intelligence or accept “black box” medicine?. Annals of Internal Medicine. Cited by: §1.\n• S. Wiegreffe and Y. Pinter (2019) Attention is not not explanation. In\n\nProceedings of the 2019 Conference on Empirical Methods in Natural Language Processing and the 9th International Joint Conference on Natural Language Processing (EMNLP-IJCNLP)\n\n,\npp. 11–20. Cited by: 2nd item.\n• H. Xiao, K. Rasul, and R. Vollgraf (2017) Fashion-mnist: a novel image dataset for benchmarking machine learning algorithms. arXiv preprint arXiv:1708.07747. Cited by: 3rd item, §4.3.\n• C. Yeh, C. Hsieh, A. Suggala, D. I. Inouye, and P. K. Ravikumar (2019) On the (in) fidelity and sensitivity of explanations. In Advances in Neural Information Processing Systems, pp. 10965–10976. Cited by: 2nd item, 3rd item, §1, §2, §3, §4.0.1, §4.0.2, footnote 1.\n• X. Zhang, N. Wang, S. Ji, H. Shen, and T. Wang (2018) Interpretable deep learning under fire. arXiv preprint arXiv:1812.00891. Cited by: 3rd item.\n• S. Zhu, S. Li, and G. Zhou (2019)\n\nAdversarial attention modeling for multi-dimensional emotion regression\n\n.\nIn Proceedings of the 57th Annual Meeting of the Association for Computational Linguistics, pp. 471–480. Cited by: §2.\n\n## Appendix A Proofs and Derivations\n\n### a.1. Proof of Theorem 1\n\n###### Proof.\n\nThe proof follows that of Theorem 1 of Chen et al. (Chen et al., 2018).\n\n(1) Forward direction: Given the definition of , we have for any pair , and any explainer ,\n\n (14) E[logp(y∣xS)−logp(y∣x¯S)]≤E[logp(y∣xS∗)−logp(y∣x¯S∗)]\n\nIn the case when is a set instead of a singleton, we identify with any distribution that assigns arbitrary probability to each elements in , and with zero probability outside . With abuse of notation, indicates both the set function that maps every pair to a set and any real-valued function that maps to an element in . Taking expectation over the distribution of , and adding at both sides, we have\n\n (15) I(xS;y)−I(x¯S;y)≤I(xS∗;y)−I(x¯S∗;y)\n\nfor any explainer .\n\n(2) Reverse direction: The reverse direction is proved by contradiction. Since the optimal explanation satisfies\n\n (16) I(xS′;y)−I(x¯S′;y)≤I(xS;y)−I(x¯S;y)\n\nfor any other , assume the optimal explanation is such that there exists a set of nonzero probability, over which does not degenerates to an element in . Concretely, we define as\n\n (17) S={x,y:p(S∉S∗∣x,y)>0}.\n\nFor any , we have\n\n (18) E[logp(y∣xS)−logp(y∣x¯S)]\n\nwhere is a deterministic function in the set of distributions that assign arbitrary probability to each elements in , and with zero probability outside . Outside , we always have\n\n (19) E[logp(y∣xS)−logp(y∣x¯S)]≤E[logp(y∣xS∗)−logp(y∣x¯S∗)]\n\nfrom the definition of . As is of nonzero size over , combining Eq. (18) and Eq. (19), taking expectation with respect to and adding at both sides, we have\n\n (20) I(xS;y)−I(x¯S;y)\n\nwhich is a contradiction to Eq. (16). ∎\n\n### a.2. Derivations for The Variational Lower Bounds\n\n###### Proof.\n\nFirst, for selected features, we have:\n\n (21) I(xS;y)=E[logp(xS,y)p(xS)p(y)]=E[logp(y∣xS)p(y)]=E[logp(y∣xS)]+Const.=ExEy∣xES∣x,yEy∣xS[logp(y∣xS)]+Const.\n\nFor any , we obtain the lower bound by applying the Jensen’s inequality:\n\n (22) Ey∣xS[logp(y∣xS)]≥∫[logqs(y∣xS)]dp(y∣xS)=Ey∣xS[logqs(y∣xS)].\n\nIt is similar for unselected features. ∎\n\n### a.3. Proof of Theorem 2\n\n###### Proof.\n\nFor the problem in Eq. (7) and (8), learns , where is a vector with all the elements being .\n\nTherefore, our AIL mechanism learns to minimize . Since\n\n (23)\n\nthe mutual information is minimized. By the property of mutual information, we assume that the minimization of encourages the independence between and , which leads to\n\n (24) p(x¯S,1−v,y)=p(x¯S,1−v)p(y)\n\nThus, by marginalizing at both sides, we have\n\n (25) ∫x¯Sp(x¯S,1−v,y)=∫x¯Sp(x¯S,1−v)p(y)⇒p(1−v,y)=p(1−v)p(y).\n\nTherefore, the independence between and is encouraged as well. Since and are deterministic between each other, then for any set such that , there exists a fixed set such that , and vice versa. Thus we have for any set ,\n\n (26) p(v∈S1,y)=p(1−v∈S2,y)=p(1−v∈S2)p(y)=p(v∈S1)p(y).\n\nThus, the independence between and is also encouraged. ∎\n\n### a.4. Derivation for Eq. (11)\n\n###### Proof.\n (27) p(δ=j∣x,M,E,H)=p(δ=j,E,H∣x,M)p(E,H∣x,M)=p(δ=j∣x,M)p(E,H∣δ=j,x,M)p(E,H∣x,M)=p(δ=j∣x,M)p(E∣δ=j,x,M)p(H∣δ=j,x,M)p(E,H∣x,M)=p(δ=j∣x,M)p(E,δ=j∣x,M)p(δ=j∣x,M)p(H,δ=j∣x,M)p(δ=j∣x,M)p(E,H∣x,M)=p(δ=j∣x,M)p(E∣x,M)p(δ=j∣x,M,E)p(δ=j∣x,M)p(H∣x,M)p(δ=j∣x,M,H)p(δ=j∣x,M)p(E,H∣x,M)=C(E,H∣x,M)p(δ=j∣x,M,E)p(δ=j∣x,M,H)p(δ=j∣x,M),\n\nwhere\n\n (28) C(E,H∣x,M)=p(E∣x,M)p(H∣x,M)p(E,H∣x,M).\n\nThe third equation is from the assumption of conditional independence between the interpretation models and given and . Assuming for all , because we have no knowledge of the explainer, then we have\n\n (29) p(δ=j∣x,M,E,H)=p(δ=j∣x,M,E,H)d∑j′=1p(δ=j′∣x,M,E,H)=p(δ=j∣x,M,E)p(δ=j∣x,M,H)∑dj′=1p(δ=j′∣x,M,E)p(δ=j′∣x,M,H).\n\n## Appendix B Implementation Details\n\n### b.1. Details for Our Method\n\nFor with cross entropy loss, in Eq. (8) we still minimize , and just replace the target for by , following the suggestion of the Relativistic GAN et al. (Jolicoeur-Martineau, 2018). For with the Sliced Wasserstein distance (Lee et al., 2019), the number of random vectors is for Fashion-MNIST and for ImageNet.\n\nFor optimizers, we use RMSprop for IMDB and Adadelta for image datasets, with the default hyperparameters. The learning rates are fixed. For TGD, we use Adam with learning rate of\n\n, , with the learning-rate decay of 30% for every 50,000 steps. The batch size is for IMDB and ImageNet, for MNIST and Fashion-MNIST, and for TGD. The hyper-parameter tuning set for both and is .\n\nFor IMDB, we adopt the structure of the original model of L2X (Chen et al., 2018) for the same structure for our original model and approximators. We adopt adopt the structure of the explainer of L2X (Chen et al., 2018) for the structure for our explainer, with a global and a local component. For MNIST and Fashion-MNIST, the structure of our original model and approximators is shown in Table 6. Whereas the structure for our explainer is shown in Table 7\n\n. For ImageNet, we adopt the MobileNet module in the package of keras.applications.mobilenet without the top layer as our explainer. The model parameters pretrained on ImageNet are fixed. We only stack a global max-pooling layer and learn a full-connected top layer. We adopt the preprocess_input function in the keras.applications.mobilenet package for image pre-processing. We perform a max-pooling of kernel size and stride of\n\n, before generate the feature important scores, and perform an up-sampling with kernel size and stride of when masking pixels. We adopt the adopt the U-Net (Ronneberger et al., 2015) for our explainer, whose structure is complex and then omitted due to space limitations. Similarly, the structures of our modules for TGD are also omitted. Readers may refer to the publicly-available code for more implementation details.\n\nFor IMDB, the model output is input to a MLP with three hidden layers with neurons and the ReLu activation, before being concatenated to the global component of the explainer. For image datasets, the model output is linearly mapped to the same shape with the first channel of an image and is concatenated to the raw image as an additional channel. For TGD, the model output is linearly mapped to the same shape as an raw data sample and concatenated to the data sample in the feature dimension.\n\n### b.2. Details for Baseline Methods\n\nFor Grad, we compute the gradient of the selected class with respect to the input feature and uses the absolute values as importance scores. We perform summation operations to form the importance scores with proper shapes. For GI, the gradient is multiplied by the input feature before calculate the absolute value. For INFD, we select the Noisy Baseline method for consistent comparisons, since its another method Square is only suitable for image datasets. The structures of explainers are the same for CXP, L2X, VIBI, and Ours. The structures of original models and approximators are the same for L2X, VIBI, and Ours.\n\nThe hyper-parameters of each method are tuned according the strategy mentioned in their respective papers.\n\nOn ImageNet, for all the baseline methods, we perform a max-pooling of kernel size and stride of for the feature important scores, and perform an up-sampling with kernel size and stride of when masking pixels." ]
[ null, "https://deepai.org/static/images/logo.png", null, "https://deepai.org/publication/None", null, "https://deepai.org/publication/None", null, "https://deepai.org/publication/None", null, "https://deepai.org/publication/None", null, "https://deepai.org/publication/None", null, "https://deepai.org/publication/None", null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.8743746,"math_prob":0.9116347,"size":48091,"snap":"2021-31-2021-39","text_gpt3_token_len":11725,"char_repetition_ratio":0.15243205,"word_repetition_ratio":0.087355405,"special_character_ratio":0.2544759,"punctuation_ratio":0.16501476,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.96303153,"pos_list":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"im_url_duplicate_count":[null,null,null,null,null,null,null,null,null,null,null,null,null,null,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2021-09-22T20:23:20Z\",\"WARC-Record-ID\":\"<urn:uuid:b322ef4f-3082-4ada-9d24-0779f09beda3>\",\"Content-Length\":\"992649\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:4fff8e81-12f0-4b37-94b6-b26963a846e0>\",\"WARC-Concurrent-To\":\"<urn:uuid:7800ac44-3b9e-44aa-9c4d-14fd78cb7b10>\",\"WARC-IP-Address\":\"44.238.89.211\",\"WARC-Target-URI\":\"https://deepai.org/publication/adversarial-infidelity-learning-for-model-interpretation\",\"WARC-Payload-Digest\":\"sha1:6SHSRILEE6J73RH6WGNPQ3I4JV4WLRVV\",\"WARC-Block-Digest\":\"sha1:6W637R4AFFGHR7CBAQE3LRRHDVGTKEKH\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2021/CC-MAIN-2021-39/CC-MAIN-2021-39_segments_1631780057388.12_warc_CC-MAIN-20210922193630-20210922223630-00178.warc.gz\"}"}
https://aomanhao.top/index.php/archives/242/
[ "## 论文信息\n\n[Single Image Super-Resolution via Locally Regularized Anchored Neighborhood Regression and Nonlocal]-Junjun Jiang, 2017, IEEE Transactions on Multimedia\n\nLR: 低分辨率;HR:高分辨率\n\n## LANR-NLM算法\n\nJunjun Jiang提出LANR-NLM算法,处理learning the mapping functions问题,使用非局部自相似性和局部几何先验(with nonlocal self-similarity and local geometry priors)加入LR-HR映射关系中。\n\n### 实验\n\nHR patch 9x9, LR patch 3x3 overlap of 2 pixels\n\n$$(f_1 = [−1, 0,1], f2 =,f_1^T , f_3 = [1, 0, −2,0, 1], f_4 = f_3^T )$$\n\n30维的特征用于采样\n\nHR patch特征 :从HR图像中减去插值的LR图像来\n\nλ1 = 1e 5,\n\nK = 200, and α = 11\n\nλ2=0.005\n\n### 规范化的局部正则化锚定领域回归\n\n$$W^i=argmin_{W_i}∥y_i−N_{i,j}^Lw_i∥_2^2+λ_1∥g_i∙w_i∥_2^2$$\n\n$$s.t.1^Tw_i=1$$\n\n$$g_{i,j}={1/corr(y_i,D_L^k)}^{\\lambda},k∈C_K(D_L^j)$$\n\n$$W=argmin_{W}∥Y−N^Lw∥_2^2+λ_1∥G∙w∥_2^2$$\n\n$N_L$和$G$是块对角矩阵,$N^L = blkdiag(N_{1,j}^L , N_{2,j}^L,..., N_{N,j}^L )$ and $G=blkdiag(g_1 , g_2 ,..., g_N )$\n\n$$W=argmin_{W}∥Y−DHN^Hw∥_2^2+λ_1∥G∙w∥_2^2$$" ]
[ null ]
{"ft_lang_label":"__label__zh","ft_lang_prob":0.76204956,"math_prob":0.99989045,"size":2413,"snap":"2022-27-2022-33","text_gpt3_token_len":1805,"char_repetition_ratio":0.06807804,"word_repetition_ratio":0.0,"special_character_ratio":0.26937422,"punctuation_ratio":0.12219451,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.99920946,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2022-06-29T18:46:48Z\",\"WARC-Record-ID\":\"<urn:uuid:a22eb287-7a4b-4ecf-bbb9-06bb2fbd4201>\",\"Content-Length\":\"120746\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:585c3953-430a-4c5c-b4b4-d04bf5a725a7>\",\"WARC-Concurrent-To\":\"<urn:uuid:1a1214d9-6b35-4a95-a771-62756c7edcb9>\",\"WARC-IP-Address\":\"103.127.81.120\",\"WARC-Target-URI\":\"https://aomanhao.top/index.php/archives/242/\",\"WARC-Payload-Digest\":\"sha1:U6GUGXGQNMV2EUO5QIMTFCGOCB5OP7UT\",\"WARC-Block-Digest\":\"sha1:DHTXF6R4X3KX2HKBGWID7W7YNKQYKIIC\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2022/CC-MAIN-2022-27/CC-MAIN-2022-27_segments_1656103642979.38_warc_CC-MAIN-20220629180939-20220629210939-00476.warc.gz\"}"}
https://simons.berkeley.edu/events/crypto-reading-group-1
[ "Events\nSummer 2015", null, "Jun 26, 2015 9:30 am – 11:30 am\n\nParent Program:\nSpeaker:\n\nJoël Alwen (IST Austria)\n\nLocation:\n\nCalvin Lab Room 116\n\n## High Parallel Complexity Graphs and Memory-Hard Functions\n\nRecently, we have witnessed the growing use of GPUs, FPGAs and even application-specific integrated circuits (ASICs) as the computational devices of choice used to mount very cost-effective brute-force evaluation of certain security relevant functions. Notable examples are brute-forcing of password hashes and the continuous solving of the proofs-of-work required to mine various cryptocurrencies.\n\nIn light of this development and the large cost of high-speed memory components for ASICs, FPGAs and GPUs we introduce the notion of parallel memory-hard functions. These come equipped with a \"hardness parameter\" n such that:\n1. For any set of inputs, the required amount of memory x time, amortized per evaluation, even when using an arbitrarily parallel computational device, is roughly proportional to n^2.\n2. Yet, to compute the function even on any single input using a sequential computational device no more memory x time is required.\n\nNext we turn to constructing a parallel memory-hard function in the Random Oracle Model. As a key tool we use a new and very intuitive parallel pebbling game over directed acyclic graphs (DAGs) modeling input-independent parallel computation. In particular, first we introduce a new complexity notion, called \"cumulative complexity (CC)\", for DAGs in terms of this pebbling game. Next, given a DAG G, we describe a mapping to a function f_G in the ROM. Finally, we show a lower-bound on the parallel memory-hardness of f_G in terms of the CC of G.\n\nThis reduces the problem of building memory-hard functions to finding a family of DAGs with increasingly large CC. A simple observation shows that (even for a sequential pebbling game) any DAG with N nodes can have CC no greater than O(N^2). We build a family of constant in-degree graphs (one per possible size) such that the graph of size N has CC of at least \\tilde{\\Omega}(N^2). That is, each graphs has optimally high CC, within a polylogarithmic factor, for any graph of equal size." ]
[ null, "https://simons.berkeley.edu/sites/default/files/styles/workshop_main/public/crypto_logo.png", null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.8948404,"math_prob":0.88671434,"size":2076,"snap":"2021-43-2021-49","text_gpt3_token_len":441,"char_repetition_ratio":0.107625484,"word_repetition_ratio":0.0,"special_character_ratio":0.19942197,"punctuation_ratio":0.0880829,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.97489667,"pos_list":[0,1,2],"im_url_duplicate_count":[null,null,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2021-10-20T17:08:00Z\",\"WARC-Record-ID\":\"<urn:uuid:ff4becc4-a269-46ec-842e-26a2f764515c>\",\"Content-Length\":\"29012\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:520e25e0-4f63-483b-af1f-cf9afecabc4f>\",\"WARC-Concurrent-To\":\"<urn:uuid:82a67b1b-a4ec-4b39-84f1-65d2bc902fdf>\",\"WARC-IP-Address\":\"23.185.0.1\",\"WARC-Target-URI\":\"https://simons.berkeley.edu/events/crypto-reading-group-1\",\"WARC-Payload-Digest\":\"sha1:D5QQKHECM3TXXUFA32OZ4EG4O6ADQX6M\",\"WARC-Block-Digest\":\"sha1:7EJYMVVH6PTCA5SE6MI37P4QERMVAQX4\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2021/CC-MAIN-2021-43/CC-MAIN-2021-43_segments_1634323585322.63_warc_CC-MAIN-20211020152307-20211020182307-00445.warc.gz\"}"}
https://blog.tanyakhovanova.com/2009/08/divisibility-by-7-is-a-walk-on-a-graph-by-david-wilson/
[ "## Divisibility by 7 is a Walk on a Graph, by David Wilson\n\nMy guest blogger is David Wilson, a fellow fan of sequences. It is a nice exercise to understand how this graph works. When you do, you will discover that you can use this graph to calculate the remainders of numbers modulo 7. Back to David Wilson:", null, "I have attached a picture of a graph.\n\nWrite down a number n. Start at the small white node at the bottom of the graph. For each digit d in n, follow d black arrows in a succession, and as you move from one digit to the next, follow 1 white arrow.\n\nFor example, if n = 325, follow 3 black arrows, then 1 white arrow, then 2 black arrows, then 1 white arrow, and finally 5 black arrows.\n\nIf you end up back at the white node, n is divisible by 7.\n\nNothing earth-shattering, but I was pleased that the graph was planar.\n\nShare:\n\n1. #### Felipe Pait:\n\nAre the divisibility graphs for other primes planar too? Are they easy to construct?\n\n2. #### Leo:\n\nThe graph of divisibility by 13 looks non-planar to me.\n\n3. #### Jeff:\n\nHas anyone done a systematic study of diviability graphs in terms of other graph metrics? Is this already a defined corner of mathematics?\n\n4. #### Andrei Zelevinsky:\n\nNice idea! For my taste though I would sacrifice planarity and make the “remainders mod 7 clock” divided into 7 hours, with arrows 0 to 0, 1 to 3, 2 to 6, 3 to 2, 4 to 5, 5 to 1, and 6 to 4. Then say given n=325, you start at 0, take 3 steps clockwise, follow an arrow, take 2 steps clockwise, follow an arrow, take 5 steps clockwise and land at the remainder of 325 modulo 7.\n\n5. #### James:\n\nAccording to this, then, 5 is evenly divisible by 7. FAIL!\n\n6. #### James:\n\nActually, I’m wrong — I didn’t count the dot at the end of the line segment joining the front and back of the horizontal circle.\n\n7. #### Seth Troisi:\n\n5 is not evenly divisible by 7 on this graph.\n\nAndrei Zelevinsky. I also like the mod 7 clock. I have used it in math projects once or twice.\n\n8. #### Shawn:\n\n‘According to this, then, 5 is evenly divisible by 7. FAIL!’\n\nI get stuck in the state right above the epsilon transition (the point with the left black arrow and right white arrow) from the start if I use 5. To me that doesn’t appear to say 5 is by 7…. Ouch…\n\n9. #### Matt Might:\n\nIt is possible to construct a finite-state machine which determines divisibility for any divisor n.\n\nThere are n states: “0 mod n”, …, “n-1 mod n”. 0 mod n is the accepting state.\n\nIf you’re in state “k mod n”, and the next digit is d, then you got to state “k*b + d mod n” where b is the base of your number system.\n\n10. #### David Wilson:\n\nLet G(b,m) be the graph for base b >= 2 and modulus m >= 1.\n\nThe black edges (the clock edge) forms a Hamiltonian cycle H. Every other edge is incident on nodes in H (since H includes all nodes). If we number the nodes like a clock, 0 through m-1, then call edges (x1,y1) and (x2,y2) with x1 < x2 < y1 10,edges (3,6),(4,8),(5,10) are pairwise incompatible. Two of these three edges must be on the same side of H,and hence cross,destroying planarity of G(b,m). So b = 2 => m m = 4, (1,b),(2,2b),(3,3b) are incompatible, so b >= 4 implies m <= 3b. For any base b, there are a finite number of moduli m for which G(b,m) is planar.\n\nI’m working on a program.\n\n11. #### David Wilson:\n\nA chunk of my post must have gotten deleted because it looked like an html tag. Sigh.\n\n12. #### David Wilson:\n\nFor 2 <= b = 4, m = 2b+2 is the largest planar modulus. It appears that all the divisors of 2b+2, 2b and b-1 are planar. Moduli 1,2,3,4,5 and 7 are planar for every m.\n\nb = 2: m = 1 2 3 4 5 6 7\n\nb = 3: m = 1 2 3 4 5 6 7 8 9 10\n\nb = 4: m = 1 2 3 4 5 7 8 9 10\n\nb = 5: m = 1 2 3 4 5 6 7 8 10 12\n\nb = 6: m = 1 2 3 4 5 6 7 9 12 14\n\nb = 7: m = 1 2 3 4 5 6 7 8 9 10 11 14 16\n\nb = 8: m = 1 2 3 4 5 6 7 8 9 11 16 18\n\nb = 9: m = 1 2 3 4 5 6 7 8 9 10 14 18 20\n\nb = 10: m = 1 2 3 4 5 7 9 10 11 20 22\n\nb = 11: m = 1 2 3 4 5 6 7 8 10 11 12 14 22 24\n\nb = 12: m = 1 2 3 4 5 6 7 8 9 11 12 13 24 26\n\nb = 13: m = 1 2 3 4 5 6 7 8 9 10 12 13 14 26 28\n\nb = 14: m = 1 2 3 4 5 6 7 10 13 14 15 28 30\n\nb = 15: m = 1 2 3 4 5 6 7 8 9 10 14 15 16 30 32\n\nb = 16: m = 1 2 3 4 5 7 8 9 15 16 17 32 34\n\nb = 17: m = 1 2 3 4 5 6 7 8 9 10 12 16 17 18 34 36\n\nb = 18: m = 1 2 3 4 5 6 7 9 11 12 17 18 19 36 38\n\nb = 19: m = 1 2 3 4 5 6 7 8 9 10 11 18 19 20 38 40\n\nb = 20: m = 1 2 3 4 5 6 7 8 10 14 19 20 21 40 42\n\nb = 21: m = 1 2 3 4 5 6 7 8 9 10 11 14 20 21 22 42 44\n\nb = 22: m = 1 2 3 4 5 7 9 11 21 22 23 44 46\n\nb = 23: m = 1 2 3 4 5 6 7 8 10 11 12 14 16 22 23 24 46 48\n\nb = 24: m = 1 2 3 4 5 6 7 8 9 10 12 16 23 24 25 48 50\n\nb = 25: m = 1 2 3 4 5 6 7 8 9 10 12 13 14 24 25 26 50 52\n\n13. #### Interesting Information: Divisibility by 7 using a graph « Use Your Illusion:\n\n[…] leave a response I found this off this Math blog: https://blog.tanyakhovanova.com/?p=159 […]\n\n14. #### David Wilson:\n\nEmpirically, it looks like the graph for base b and mod m is planar if one of the following is true:\n\nb == -1, 0, or 1 (mod m)\n\nm is even and b == m/2-1 or m/2 (mod m)\n\nm = 5 and b == 2, 3 (mod m)\n\nm = 7 and b == 2, 3, 4, 5 (mod m)\n\nm = 8 and b == 5 (mod m)\n\nm = 9 and b == 3, 4, 6, 7 (mod m)\n\nm = 10 and b == 3, 7 (mod m)\n\nm = 11 and b == 7, 8 (mod m)\n\nm = 14 and b == 9, 11 (mod m)\n\nProving it would be tough.\n\n15. #### Anup Pandey:\n\nWant comments on this that i have had with me for decades now, none of my mathematician friends that I told this about have been of any help so far – I would LOVE your feedback on this.\n\nDivisibility Rule for 7\nby Anup Pandey\n\nDiscovered – 1985\n\nTake a number n\n\nif n is divisible by 7 then truncate((n+10)/10) + 2*(10-mod(n/10)) is divisible by 7\n\nexample take n = 49 then\n\ntruncate(59/10) = 5\n\nmod(n/10) = 9\n\nso then, 10-9 = 1\n\nthen 2* 1 = 2\n\nso we get 5 + 2 = 7 which is also divisble by 7\n\nAnother example –\n\nn= 434\n\ntruncate (444/10) = 44\n\n2* (10-mod(434/10)) = 2*6 = 12.\n\nSo 12 + 44 = 56, which is divisible by 7\n\n16. #### Emre Yucel:\n\nLet’s simplify this…\nif n is divisible by 7 then truncate((n+10)/10) + 2*(10-mod(n/10)) is divisible by 7\nif n is divisible by 7 then mod(n/7) is 0\n\n17. #### Wiskundemeisjes » Blog Archive » Deelbaarheid door 7:\n\n[…] de rest van een getal is bij deling door 7. Maar het is leuker om dat zelf uit te zoeken. En kijk hier voor de interessante reacties op haar stukje. « […]\n\n18. #### Vincent:\n\nDear Anup\n\nI hope you still read this. Let’s write n = 10x + y, with y between 0 and 9.\n\nthen truncate(n + 10)/10 = x + 1\nand 2*(10 – mod(n/10) = 20 – 2y\n\nSo what you want to show is that if n = 10x + y is divisible by 7, then so is x + 21 – 2y.\n\nLet’s go. First we see that if n is divisible by 7 then so is 5n. 5n = 50x + 5y.\nBut since 49 is divisible by 7 this means that x + 5y is divisible by 7 as well. (*)\n\n7y is certainly divisible by 7 so substracting 7y from some number which is divisible by 7 doesn’t change anything.\nWe conclude from (*) that x – 2y is divisible by 7. Now since 21 is 3*7 it follows that x + 21 – 2y is also divisible by 7 and this is what we wanted to show.\n\nHow did you find this rule?\n\n19. #### Funny Little Puzzle « NOAM GR!:\n\n[…] One of my favorite math blogs is Tanya Khovanova’s.  Every so often she’ll post a neat meathematical construction or puzzle.  This one she posted last week I thought was pretty neat.  I guess it counts as both a […]\n\n20. #### K. C. Koh:\n\nI have programmed the algorithm by C language. You can down load the C source from the below site.\n\nhttps://blog.joins.com/media/folderlistslide.asp?uid=kckohkoh&folder=75&list_id=11200986\n\nBy this program, you can check a large number(up to 100 digits which can be extended by simply increasing the size of array variables in the source). I would like share my program if you keep to notify that its athority belongs to me.\n\n21. #### Lloyd:\n\nFor a number not divisible by seven (e.g. like the one used as n=325) the graph can also be used to find the nearest number which is divisible by 7. Go back to the node where you started tracking the final digit and count the black arrows required to take the shortest path back to the starting node. In the example used this is two so 322 is the nearest number to 325 divisible by 7. 🙂\n\n22. #### Claude Miller:\n\nI don’t mean to diminish your incite in obscure mathematics and simplified mind experiments, but a common blacksmith is infinitely more valuable to society than all of you mental masturbation.\n\nDoc Miller\n\n23. #### Proton Zero:\n\nI’ve found how to make such a graph for any positive integer:\n\nFor a given divisor n, assemble n nodes on a graph numbered 0 through (n – 1), where a node x has a black arrow pointing to node ((x+1) mod n). Given a numerical base b, m = ((b – 1) mod n), and each node x on the graph then gains a white arrow pointing to node ((x + x * m) mod n). Both black and white arrows can point a node to itself. Node 0 is the starting node.\n\nFollowing those instructions will yield a graph like the one shown in this blog post (possibly planar, for higher numbers I don’t think it is).\n\nI feel accomplished for figuring this out on my own :D.\n\nThere is a much easier way to determine whether a number is divisible by 7: chop, double, subtract. Chop the ones digit from the number, double it, and subtract it from the number formed by the remaining digits. The original number is divisible by 7 iff the difference thus obtained is divisible by 7.\n\nFor example, start with 3794. Chop the 4, double it (8) and subtract it from 379. The result is 371. Chop the 1, double it (2) and subtract from 37. The result, 35, is obviously divisible by 7; therefore, so is 3794 (and 371, for that matter).\n\nI do hope that Claude Miller (above) will continue to share his special brand of mathematical “incite” with us. The man clearly possesses a superior intellect.\n\n25. #### Harry:\n\n@Proton Zero\nI was able to determine that the graph for the mod of 8 and 12 are non planar. In both cases, the graph contained a sub-graph which was a subdivision of K3,3. I didn’t bother to go beyond 12, but if anyone wants to, feel free.\n\n26. #### Steven Miller:\n\nFollowing the black arrows, number them 1 to 6 with the white dot 0. Where you stop will be the Modulus.\n\n27. #### free math worksheets:\n\nThanks for sharing great article.\n\n28. #### Tanya Khovanova’s Math Blog » Blog Archive » Divisibility by 7 is a Walk on a Graph. II:\n\n[…] was somewhat taken aback by the popularity of my earlier essay “Divisibility by 7 is a Walk on a Graph.” Tanya tells me it got a good number of hits. The graph in that article is rather crude, and […]\n\n29. #### Sigue el camino…módulo 7 | Gaussianos:\n\n[…] grafo es una mejora de otro grafo del propio David Wilson que sólo nos indicaba si el número escogido era o no divisible entre 7. […]\n\n30. #### Jeff:\n\nI like the idea… and now to make a graph to check divisibility by 2. 🙂\n\n31. #### george:\n\nWhere you stop will be the Modulus\n\n32. #### stephen:\n\nmaybe im doing it wrong but this says 71 and 710 are divisible by 7?\n\n33. #### Daniele:\n\n@stephen: Why should 71 emerge as divisible by 7?. Follow seven black arrows, ending up on the white dot; then change digit, by following the white arrows, which takes you back to the white dot; and finally follow a single black arrow (for the digit 1), and you are on a black dot, as required.\n\n34. #### Ben:\n\nI may be doing something wrong but according to this, 720 is divisible by 7. Am I doing something wrong?\n\n35. #### Viktor Engelmann:\n\nit’s a program that constructs divisibility graphs for ANY number – and it’s even independent of the numeral system (so you can have a graph for divisibility by n in b-adic numbers, not only in decimal numbers)…\n\n36. #### Number Gossip, Travels and Topology « Math Munch:\n\n[…] found this cool test for divisibility by 7 on Tanya’s website.  Read about how to use it here, but basically you follow that diagram a certain way, and if you land back at the white dot, then […]\n\n37. #### Divisibility by 7 | Fun With Num3ers:\n\n[…] 5 black arrows. If you end up back at the white node, n is divisible by 7.   Source:   https://blog.tanyakhovanova.com//?p=159   Why does it work?       GA_googleAddAttr(“AdOpt”, “1”); […]\n\n38. #### Links interessantes e Aplicações de Grafos | dremendes:\n\n[…] caso, a divisibilidade por 7, no link que segue aqui, você pode ler o artigo. Mas se você tem preguiça eu […]\n\n39. #### Firoze:\n\nI am NOT AT ALL a mathematician… but this was just too cool!! Thank you so much for sharing. 🙂\n\n41. #### How does the divisibility graphs work? – Math Solution:\n\n[…] came across this graphic method for checking divisibility by […]\n\n42. #### Sigue el camino...módulo 7 - Gaussianos:\n\n[…] grafo es una mejora de otro grafo del propio David Wilson que sólo nos indicaba si el número escogido era o no divisible entre […]" ]
[ null, "https://www.tanyakhovanova.com/BlogStuff/Divisibility7.jpg", null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.8617242,"math_prob":0.9548627,"size":13336,"snap":"2023-40-2023-50","text_gpt3_token_len":4563,"char_repetition_ratio":0.14543955,"word_repetition_ratio":0.11823362,"special_character_ratio":0.37117577,"punctuation_ratio":0.13145113,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9896661,"pos_list":[0,1,2],"im_url_duplicate_count":[null,3,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2023-12-03T14:21:50Z\",\"WARC-Record-ID\":\"<urn:uuid:e6127e03-ebb9-4829-be5e-26e60b6d2f6d>\",\"Content-Length\":\"82268\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:5df7262c-7afb-49a4-8ce5-f7f97a3cf3ef>\",\"WARC-Concurrent-To\":\"<urn:uuid:649217dc-7075-4973-ad12-2c5e0e06ef94>\",\"WARC-IP-Address\":\"173.236.239.225\",\"WARC-Target-URI\":\"https://blog.tanyakhovanova.com/2009/08/divisibility-by-7-is-a-walk-on-a-graph-by-david-wilson/\",\"WARC-Payload-Digest\":\"sha1:MCSDMWVPHANFCHRLVJIA5GIUSK2TC2VW\",\"WARC-Block-Digest\":\"sha1:EVVGK2QMHRWFMQORKFXGTLQW6ZXSXMU2\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2023/CC-MAIN-2023-50/CC-MAIN-2023-50_segments_1700679100508.23_warc_CC-MAIN-20231203125921-20231203155921-00075.warc.gz\"}"}