URL
stringlengths
15
1.68k
text_list
sequencelengths
1
199
image_list
sequencelengths
1
199
metadata
stringlengths
1.19k
3.08k
https://www.gradesaver.com/textbooks/math/algebra/algebra-1/chapter-4-an-introduction-to-functions-4-4-graphing-a-function-rule-practice-and-problem-solving-exercises-page-257/14
[ "## Algebra 1", null, "Equation: y=-5x+12 The general form of a linear equation is y=mx+b where m is the slope and b is the y-intercept. In the equation above the y-intercept, b, is +12 so start by plotting the point (0,12). In the equation above the slope, m, is -5 and since slope= $\\frac{rise}{run}$ you go down 5 units and to the right one unit from each point starting from the y-intercept to get the final graph." ]
[ null, "https://gradesaver.s3.amazonaws.com/uploads/solution/0974fc0c-00be-4074-a38f-ed83f1b0b1fa/result_image/1514840405.PNG", null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.90079826,"math_prob":0.99987185,"size":446,"snap":"2022-05-2022-21","text_gpt3_token_len":122,"char_repetition_ratio":0.14479639,"word_repetition_ratio":0.025316456,"special_character_ratio":0.2735426,"punctuation_ratio":0.097087376,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":1.0000013,"pos_list":[0,1,2],"im_url_duplicate_count":[null,3,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2022-05-25T03:17:15Z\",\"WARC-Record-ID\":\"<urn:uuid:622d588f-31d8-4d97-a79e-22da50bcf8ef>\",\"Content-Length\":\"81975\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:88deadc0-428a-432f-8f33-3ab91ed51efe>\",\"WARC-Concurrent-To\":\"<urn:uuid:bd2358a7-ac76-4417-89ee-77c55fb7a07e>\",\"WARC-IP-Address\":\"44.198.198.134\",\"WARC-Target-URI\":\"https://www.gradesaver.com/textbooks/math/algebra/algebra-1/chapter-4-an-introduction-to-functions-4-4-graphing-a-function-rule-practice-and-problem-solving-exercises-page-257/14\",\"WARC-Payload-Digest\":\"sha1:JWR3T3LGZ63BOYBSZB5E7KB5237TRRGR\",\"WARC-Block-Digest\":\"sha1:4TPNNMWLO7VMUXAZPQTYSYXYNL7Z5XJ5\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2022/CC-MAIN-2022-21/CC-MAIN-2022-21_segments_1652662578939.73_warc_CC-MAIN-20220525023952-20220525053952-00226.warc.gz\"}"}
https://www.programming-helper.com/snippet/5aKLkGLPfQvN6rfFEa3g
[ "Generation\n\ngenerate functionSat, 26 Nov 2022\n\n# the user also specifies the number of coin tosses at the beginning of the program. tosses a coin and then determines that did it fall on the side of the head or the writing. After the coin is tossed, write the result on the screen, that is, how many times there were heads and how many times there were writing.\n\n``````// User enters the number of coin tosses\n\n// random generator of numbers\nRandom random = new Random();\n\n// variables for counting\nint tailsCount = 0;\n\n// loop for the number of coin tosses\nfor (int i = 0; i < numberOfTosses; i++)\n{\n// random generation of numbers\nint toss = random.Next(0, 2);\n\n// increase the number of heads\nif (toss == 0)\n{" ]
[ null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.7754364,"math_prob":0.99561167,"size":902,"snap":"2022-40-2023-06","text_gpt3_token_len":216,"char_repetition_ratio":0.1714922,"word_repetition_ratio":0.045454547,"special_character_ratio":0.27161863,"punctuation_ratio":0.1497006,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9846149,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2023-01-30T04:52:25Z\",\"WARC-Record-ID\":\"<urn:uuid:97912ff7-b49f-4462-a708-b5ee3c8f1838>\",\"Content-Length\":\"27600\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:517042f3-9b80-4c94-bf18-e8510b40412c>\",\"WARC-Concurrent-To\":\"<urn:uuid:4991ba5b-e797-4589-8a6d-a800bb817316>\",\"WARC-IP-Address\":\"76.76.21.123\",\"WARC-Target-URI\":\"https://www.programming-helper.com/snippet/5aKLkGLPfQvN6rfFEa3g\",\"WARC-Payload-Digest\":\"sha1:2LLKPWRXNSEIFZAENLRPE5RDXQRJP6PA\",\"WARC-Block-Digest\":\"sha1:RJBEZT3CRKRU5KOG73BLI32Z3BEMB7ID\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2023/CC-MAIN-2023-06/CC-MAIN-2023-06_segments_1674764499801.40_warc_CC-MAIN-20230130034805-20230130064805-00337.warc.gz\"}"}
https://math.answers.com/questions/How_many_inches_are_there_in_58_centimetres
[ "", null, "", null, "", null, "", null, "0\n\n# How many inches are there in 58 centimetres?\n\nUpdated: 9/14/2023", null, "Wiki User\n\n6y ago\n\nThere are 2.54 centimetres in one inch. Therefore, rounded to two decimal places, 58 centimetres is equal to 58 / 2.54 = 22.83 inches.\n58 cm = 22.835 inches\n58 cm = 22.8 inches.\n58 cm is equal to 22.8346 inches.", null, "Wiki User\n\n6y ago", null, "", null, "", null, "Wiki User\n\n13y ago\n\n58 cm = 22.8 inches.", null, "", null, "", null, "Earn +20 pts\nQ: How many inches are there in 58 centimetres?\nSubmit\nStill have questions?", null, "", null, "Related questions\n\n### How many centimeters are there in 58 inches?\n\nThere are 2.54 centimetres in one inch. Therefore, 58 inches is equal to 58 x 2.54 = 147.32 centimetres.\n\n### What equals 58 inches?\n\n58 inches is 147.32 centimeters.\n\n### How many centimetres are in 20.5 inches?\n\nThere are 52.07 centimetres in 20.5 inches.\n\n### How many centimetres are in 6.7 inches?\n\nThere are 17.02 centimetres in 6.7 inches.\n\n### How many centimetres is 84 inches?\n\n84 inches = 213.36 centimetres\n\n### How many inches is 10 centimetres?\n\n10 centimetres = 3.9 inches\n\n58\n\n### How many inches in 58cm?\n\nBy unit of length and distance and conversion ,we can say that 1 in =2.54 cm 58 cm=22.83 in\n\n### 5 inches is how many centimetres?\n\n12.7 centimetres.\n\n### How many centimetres in 66 inches?\n\n66 inches = 167.6 centimetres\n\n### How many inches make up 10 centimetres?\n\nThere are 3.94 inches in 10 centimetres.\n\n### How many inches are in 24 inches?\n\nThere are 24 inches in 24 inches. Perhaps you are asking how many centimetres there are in 24 inches. In which case, there are 2.54 centimetres in one inch. 24 inches is equal to 24 x 2.54 = 60.96 centimetres." ]
[ null, "https://math.answers.com/icons/searchIcon.svg", null, "https://math.answers.com/icons/searchGlassWhiteIcon.svg", null, "https://math.answers.com/icons/notificationBellIcon.svg", null, "https://math.answers.com/icons/coinIcon.svg", null, "https://math.answers.com/images/avatars/default.png", null, "https://math.answers.com/images/avatars/default.png", null, "https://math.answers.com/images/avatars/default.png", null, "https://math.answers.com/icons/sendIcon.svg", null, "https://math.answers.com/images/avatars/default.png", null, "https://math.answers.com/images/avatars/default.png", null, "https://math.answers.com/icons/sendIcon.svg", null, "https://math.answers.com/icons/coinIcon.svg", null, "https://math.answers.com/icons/searchIcon.svg", null, "https://st.answers.com/html_test_assets/imp_-_pixel.png", null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.8761844,"math_prob":0.99196076,"size":1217,"snap":"2023-40-2023-50","text_gpt3_token_len":408,"char_repetition_ratio":0.2893652,"word_repetition_ratio":0.41284403,"special_character_ratio":0.3812654,"punctuation_ratio":0.1891892,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.99914485,"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,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\":\"2023-10-02T11:18:35Z\",\"WARC-Record-ID\":\"<urn:uuid:9e0f4744-3274-4ef6-a7bc-77783a5ee929>\",\"Content-Length\":\"169903\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:f2638255-8374-46d6-9aa2-6a09c5972526>\",\"WARC-Concurrent-To\":\"<urn:uuid:22329727-38b4-4ce4-b64d-d40401c8f578>\",\"WARC-IP-Address\":\"146.75.32.203\",\"WARC-Target-URI\":\"https://math.answers.com/questions/How_many_inches_are_there_in_58_centimetres\",\"WARC-Payload-Digest\":\"sha1:2DV6FC5RNQUMVHOSLZ5H5JMPJ4FUQSLI\",\"WARC-Block-Digest\":\"sha1:W5RCIO2QQR75J2PDLYLZF7QGW2HFF2TC\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2023/CC-MAIN-2023-40/CC-MAIN-2023-40_segments_1695233510994.61_warc_CC-MAIN-20231002100910-20231002130910-00100.warc.gz\"}"}
https://uk.mathworks.com/help/coder/ref/coder.wref.html
[ "# coder.wref\n\nIndicate write-only data to pass by reference\n\n## Syntax\n\n``coder.wref(arg)``\n\n## Description\n\nexample\n\n````coder.wref(arg)` indicates that `arg` is a write-only expression or variable to pass by reference to an external C/C++ function. Use `coder.wref` only inside a `coder.ceval` call. This function enables the code generator to optimize the generated code by ignoring prior assignments to `arg` in your MATLAB® code, because the external function is assumed to not read from the data. Write to all the elements of `arg` in your external code to fully initialize the memory. NoteThe C/C++ function must fully initialize the memory referenced by `coder.wref(arg)`. Initialize the memory by assigning values to every element of `arg` in your C/C++ code. If the generated code tries to read from uninitialized memory, it can cause undefined run-time behavior. See also `coder.ref` and `coder.rref`.```\n\n## Examples\n\n### Pass Array by Reference as Write-Only\n\nSuppose that you have a C function `init_array`.\n\n```void init_array(double* array, int numel) { for(int i = 0; i < numel; i++) { array[i] = 42; } }```\n\nThe C function defines the input variable `array` as a pointer to a double.\n\nCall the C function `init_array` to initialize all elements of `y` to 42:\n\n```... Y = zeros(5, 10); coder.ceval('init_array', coder.wref(Y), int32(numel(Y))); ...```\n\n### Pass Multiple Arguments as a Write-Only Reference\n\n```... U = zeros(5, 10); V = zeros(5, 10); coder.ceval('my_fcn', coder.wref(U), int32(numel(U)), coder.wref(V), int32(numel(V))); ...```\n\n### Pass Class Property as a Write-Only Reference\n\n```... x = myClass; x.prop = 1; coder.ceval('foo', coder.wref(x.prop)); ...```\n\n### Pass Structure as a Write-Only Reference\n\nTo indicate that the structure type is defined in a C header file, use `coder.cstructname`.\n\nSuppose that you have the C function `init_struct`. This function writes to the input argument but does not read from it.\n\n```#include \"MyStruct.h\" void init_struct(struct MyStruct *my_struct) { my_struct->f1 = 1; my_struct->f2 = 2; } ```\n\nThe C header file, `MyStruct.h`, defines a structure type named `MyStruct`:\n\n```#ifndef MYSTRUCT #define MYSTRUCT typedef struct MyStruct { double f1; double f2; } MyStruct; void init_struct(struct MyStruct *my_struct); #endif ```\n\nIn your MATLAB function, pass a structure as a write-only reference to `init_struct`. Use `coder.cstructname` to indicate that the structure type for `s` has the name `MyStruct` that is defined in the C header file `MyStruct.h`.\n\n```function y = foo %#codegen y = 0; coder.updateBuildInfo('addSourceFiles','init_struct.c'); s = struct('f1',1,'f2',2); coder.cstructname(s,'MyStruct','extern','HeaderFile','MyStruct.h'); coder.ceval('init_struct', coder.wref(s)); ```\n\nTo generate standalone library code, enter:\n\n```codegen -config:lib foo -report ```\n\n### Pass Structure Field as a Write-Only Reference\n\n```... s = struct('s1', struct('a', [0 1])); coder.ceval('foo', coder.wref(s.s1.a)); ...```\n\nYou can also pass an element of an array of structures:\n\n```... c = repmat(struct('u',magic(2)),1,10); b = repmat(struct('c',c),3,6); a = struct('b',b); coder.ceval('foo', coder.wref(a.b(3,4).c(2).u)); ... ```\n\n## Input Arguments\n\ncollapse all\n\nArgument to pass by reference to an external C/C++ function. The argument cannot be a class, a System object™, a cell array, or an index into a cell array.\n\nData Types: `single` | `double` | `int8` | `int16` | `int32` | `int64` | `uint8` | `uint16` | `uint32` | `uint64` | `logical` | `char` | `struct`\nComplex Number Support: Yes\n\n## Limitations\n\n• You cannot pass these data types by reference:\n\n• Class or System object\n\n• Cell array or index into a cell array\n\n• If a property has a get method, a set method, or validators, or is a System object property with certain attributes, then you cannot pass the property by reference to an external function. See Passing By Reference Not Supported for Some Properties.\n\n## Tips\n\n• If `arg` is an array, then `coder.wref(arg)` provides the address of the first element of the array. The `coder.wref(arg)` function does not contain information about the size of the array. If the C function must know the number of elements of your data, pass that information as a separate argument. For example:\n\n```coder.ceval('myFun',coder.wref(arg),int32(numel(arg)); ```\n• When you pass a structure by reference to an external C/C++ function, use `coder.cstructname` to provide the name of a C structure type that is defined in a C header file.\n\n• In MATLAB, `coder.wref` results in an error. To parametrize your MATLAB code so that it can run in MATLAB and in generated code, use `coder.target`.\n\n• You can use `coder.opaque` to declare variables that you pass to and from an external C/C++ function.\n\n## Version History\n\nIntroduced in R2011a" ]
[ null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.5762214,"math_prob":0.8184748,"size":4602,"snap":"2022-05-2022-21","text_gpt3_token_len":1179,"char_repetition_ratio":0.15593736,"word_repetition_ratio":0.034383953,"special_character_ratio":0.259887,"punctuation_ratio":0.19711043,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9825759,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2022-05-26T20:21:20Z\",\"WARC-Record-ID\":\"<urn:uuid:d4b1dba4-e3bf-48b4-8007-47fc798c5dd9>\",\"Content-Length\":\"85543\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:fa05a15c-06d9-4fe4-86cf-474828107151>\",\"WARC-Concurrent-To\":\"<urn:uuid:10029846-ea35-4428-8c1d-c227d7e1bded>\",\"WARC-IP-Address\":\"104.69.217.80\",\"WARC-Target-URI\":\"https://uk.mathworks.com/help/coder/ref/coder.wref.html\",\"WARC-Payload-Digest\":\"sha1:YWIERYGWVFDIMTO3TNDIDRC6GJ7OOKAN\",\"WARC-Block-Digest\":\"sha1:MBHHYXQB2KUPU2AYT22VAH23D3FSZ43U\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2022/CC-MAIN-2022-21/CC-MAIN-2022-21_segments_1652662625600.87_warc_CC-MAIN-20220526193923-20220526223923-00746.warc.gz\"}"}
https://www.scientistsolutions.com/forum/anatomy-and-physiology-electrophysiology/what-vm-ion-permeability-test
[ "# What is the \"Vm\" in ion permeability test?\n\n7 posts / 0 new\npangeng", null, "What is the \"Vm\" in ion permeability test?\n\nI am still new in learning this method at present.\n\nIf what I understand is right, to test the relative ion permeability of one type of ion channels, we initially use the Goldman equation. We set the permeability of one ion (like K+) as 1 normalizing other ions permeability to it.\n\nSay like we are tesitng relative permeability of [Na+], technically we need values of [Na+]i, [Na+]o, [K+]o, [K+]i and Vm to apply to the equation and calculate the value of Pna/Pk.\n\nQuesiton is: should the Vm here resting membrane potential (current=0)? In my opinion the Vm should be the balanced membrane potential when there are only two ions Na+ and K+ in the solution of both side. I am not sure which is right.\n\nlazy", null, "If I understand correctly,\n\nIf I understand correctly, you should measure the membrane potential (Vm), and then you should apply the value of membrane potential (Vm), [K]o, [K]i, {Na}o, [Na]i to the Goldman equation.\n\nFrom that, you can calculate the permeability (Pna/Pk) which is multiplied to [Na]i and [Na]o.\n\nThus, Vm is the measured membrane potential.\n\nHope this makes sense.\n\npangeng", null, "one thing I still dont\n\none thing I still dont understand.\nIf what I know is right, the membrane potential (Vm) is a combination of reversal potential of all ions (while Pk+ is dominant). So if Vm means the cellular membane potential, all the ion cencentration should be included in the GHK equation, like Cl-, Ca2+, H+, etc., but not only Na+ and K+.\n\nlazy", null, "Pcl, Pca, etc. are ignorable\n\nPcl, Pca, etc. are ignorable compare with Pna in the resting potential.\n\nYou can see the GHK equation on lemi-log graph. In the range of lower [K]o concentration, the curve gets deviation from the Nernst equation for K ion ( a straight line) because of  the Pna.\n\nHope this makes sense.\n\npangeng", null, "so does it mean when we\n\nso does it mean when we detect the permeability of Cl-, we should apply [Na]i and [Na]o in the equation?\n\nlazy", null, "If you detect the Cl\n\nIf you detect the Cl permeability in resting membrane, then you apply Pcl/Pk to GHK equation.\n\nlazy", null, "This website is explaining\n\nThis website is explaining all that you should calculate.\nFYI\n\nhttp://www.physiologyweb.com/calculators/ghk_equation_calculator.html" ]
[ null, "https://www.scientistsolutions.com/sites/default/files/pictures/no-picture.jpg", null, "https://www.scientistsolutions.com/sites/default/files/pictures/no-picture.jpg", null, "https://www.scientistsolutions.com/sites/default/files/pictures/no-picture.jpg", null, "https://www.scientistsolutions.com/sites/default/files/pictures/no-picture.jpg", null, "https://www.scientistsolutions.com/sites/default/files/pictures/no-picture.jpg", null, "https://www.scientistsolutions.com/sites/default/files/pictures/no-picture.jpg", null, "https://www.scientistsolutions.com/sites/default/files/pictures/no-picture.jpg", null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.8847313,"math_prob":0.97004294,"size":1992,"snap":"2021-43-2021-49","text_gpt3_token_len":510,"char_repetition_ratio":0.1498994,"word_repetition_ratio":0.0,"special_character_ratio":0.23293173,"punctuation_ratio":0.13012049,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9973632,"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-10-26T08:46:39Z\",\"WARC-Record-ID\":\"<urn:uuid:370e11b2-e5e5-4c19-9bef-347021f08393>\",\"Content-Length\":\"34526\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:5faa2154-b938-4e2d-8651-4432903f2470>\",\"WARC-Concurrent-To\":\"<urn:uuid:848b438d-c76d-4d9c-bb24-e6789078a47f>\",\"WARC-IP-Address\":\"143.198.1.144\",\"WARC-Target-URI\":\"https://www.scientistsolutions.com/forum/anatomy-and-physiology-electrophysiology/what-vm-ion-permeability-test\",\"WARC-Payload-Digest\":\"sha1:5ZQDH623QZZZ6L23Q7HVHXYE6D25LZXJ\",\"WARC-Block-Digest\":\"sha1:HPWJCAYQB3AWZ3OZKNT2WX7NIZWO5PSI\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2021/CC-MAIN-2021-43/CC-MAIN-2021-43_segments_1634323587854.13_warc_CC-MAIN-20211026072759-20211026102759-00139.warc.gz\"}"}
https://patents.justia.com/patent/4104729
[ "# Digital multiplier\n\nThe digital multiplier is of the add and shift type with a matrix type input in which a number of serial data words can be applied simultaneously to the multiplier enabling the multiplier to compute simultaneously the sum of a number of products. This multiplier is intended for use in digital filters and single channel coders.\n\n## Latest International Standard Electric Corporation Patents:\n\nDescription\nBACKGROUND OF THE INVENTION\n\nThe present invention relates to digital multipliers of the \"add and shift\" type such as may be used in digital filters for telecommunications systems.\n\nIn such multipliers multiplication is achieved by performing a number of addition operations using an adder with an accumulator in which the adder output is stored and shifted one bit position for each addition operation. An adder comprises a series of cells, one for each bit in a digital word, each cell having inputs for the addend and the augend and outputs for the sum and carry. A so-called \"full adder cell\" has in addition a third input to which the carry from the cell of next lesser significance may be applied.\n\nIn a known form of multiplier where, say, a parallel coefficient B is to be multiplied by an incoming serial data word C to form the product A=B.times.C in the accumulator, the multiplicand B is applied in parallel to a number of AND gates for the duration of the word C. Each bit of the word C, starting with the least significant bit, is applied to all the AND gates. If a bit of word C is a logic \"1\" then the multiplicand B is added to the accumulator (if it is a logic \"0\" nothing is added) and the contents of the accumulator are right shifted before the next bit of word C is applied to the AND gates. This continues until all the bits of word C have been applied to the gates, then the multiplication is complete. The answer A is now in the accumulator and may be extracted as required by various known methods.\n\nNegative numbers can be handled by various known simple modifications. For example, if 2's complement data is used then the most significant bit of the data has a negative weight and for this bit only the multiplicand B is subtracted from instead of added to the accumulator.\n\nIn digital filters a digitally encoded sampled signal is filtered by combining together various delayed copies of the signal through suitable weighting coefficients. In general in a digital filter it is thus necessary to form an accumulated product such as:\n\nP=(D.sub.1 .times.E.sub.1) + (D.sub.2 .times.E.sub.2) + (D.sub.3 .times.E.sub.3) . . . (D.sub.n .times.E.sub.n),\n\nwhere D.sub.1, D.sub.2 etc. are filter signal serial data words and E.sub.1, E.sub.2 etc. are the filter tap coefficients. In the simple type of multiplier described above this type of operation can only be accomplished by performing first the multiplication D.sub.1 .times.E.sub.1, storing the result, changing the coefficient E, applied in parallel to the AND gates, performing the next multiplication D.sub.2 .times.E.sub.2, adding the result to the previously stored product D.sub.1 .times.E.sub.1, storing the sum, and repeating this process as many times as required. It is obvious that it would be advantageous to be able to perform all n multiplications simultaneously and produce the product P at the end of one serial data word period rather than to have to wait for n word periods.\n\nSUMMARY OF THE INVENTION\n\nAn object of the present invention is to provide an improved digital multiplier capable of being employed in digital filters and single channel coders.\n\nA feature of the present invention is the provision of a digital multiplier providing a calculated output signal comprising: a first adder having a plurality of first adder cells; an accumulator coupled to each of the first adder cells to store the output of each of the first adder cells and to shift the stored output one bit for each addition operation; and input means coupled to the first adder cells for applying simultaneously a plurality of serial data words to the first adder cells, the input means being arranged so that each of the serial words is applied to predetermined ones of the first adder cells but no two serial words are applied to the same one of the first adder cells.\n\nBRIEF DESCRIPTION OF THE DRAWING\n\nAbove-mentioned and other features and objects of this invention will become more apparent by reference to the following description taken in conjunction with the accompanying drawing, in which:\n\nFIG. 1 is a block schematic diagram of a simple digital multiplier according to the principles of the present invention using a single full adder to perform addition operations, a single accumulator in which the sum outputs of the full-adder are simultaneously accumulated and right shifted, and a basic form of wired input matrix;\n\nFIG. 2 is a block schematic diagram of a modification of the multiplier of FIG. 1 in which the basic input matrix is modified to improve flexibility;\n\nFIG. 3 is a block schematic diagram of a fourth order recursive digital filter section which utilizes a digital multiplier having a separate accumulator and transfer register with provision for overflow detection in accordance with the principles of the present invention;\n\nFIG. 4 is a block schematic diagram of a further modification of the basic multiplier of FIG. 1 using a second full adder with a modified input matrix to enable the number of inputs to the multiplier to be increased still further; and\n\nFIG. 5 is a block schematic diagram of a complete digital multiplier for handling digital data using 2's complement and carry-save addition with separate sum and carry accumulators and separate sum and carry transfer registers in accordance with the principles of the present invention.\n\nDESCRIPTION OF THE PREFERRED EMBODIMENTS\n\nIn the simple multiplier arrangement shown in FIG. 1 a 6-stage adder ADD is constructed with \"full-adder\" cells the carry from each cell being applied to the cell of next greater significance.\n\nA 7-stage accumulator ACC receives, in stages A0 to A5, the sum outputs .SIGMA..sub.0 . . . .SIGMA..sub.5 of the adder cells. The most significant stage A6 of the accumulator receives the carry output C.sub.6 of the most significant adder cell. The contents of the accumulator stages A6 . . . A1 are fed back at the data bit rate as inputs to the adder cells of next lesser significance while the multiplier output is taken serially from stage A0 of the accumulator ACC. Each adder cell has, in addition to the carry and feedback (augend) inputs a data (addend) input which is fed via an input matrix M with serial data words D.sub.1 and D.sub.2 simultaneously. Suppose that it is desired to perform the calculation: P = 5/8D.sub.1 + 1/4D.sub.2, where 5/8 and 1/4 are fixed coefficients.\n\nThe first part of the calculation, i.e., multiplying D.sub.1 by 5/8 can be broken down into two separate operations as follows:\n\n5/8D.sub.1 = 1/2D.sub.1 + 1/8D.sub.1\n\nmultiplying D.sub.1 by 1/2 is simply effected by right-shifting D.sub.1 by one bit position while multiplying D.sub.1 by 1/8 is effected by right-shifting D.sub.1 by three bit positions. If the input I.sub.5 to the most significant cell of the adder ADD is regarded as having a weighting value of 1, i.e., it has a value of 2.degree., then to multiply D.sub.1 by 1/2 it must be fed to input I.sub.4 which has a weight of 1/2 or 2.sup.-1. To multiply D.sub.1 by 1/8 it must be fed to input I.sub.1, which has a weight of 1/8 or 2.sup.-3. When D.sub.1 is fed simultaneously to these inputs I.sub.4 and I.sub.2 the result in the accumulator ACC will be 1/2D.sub.1 + 1/8D.sub.1 = 5/8D.\n\nSimilarly D.sub.2 is fed simultaneously to input I.sub.3 and the accumulator ACC will then contain the result of P of the full calculation. It will be noted that each word is fed to one or more inputs to the adder, but that no two words are fed to the same input.\n\nIt will be appreciated that such a simple arrangement as that shown in FIG. 1 has severe limitations in practice. Greater flexibility can be obtained by using ternary coding of the coefficients. Suppose that it is desired to perform the calculation:\n\nP = 7/8D.sub.1 + 9/16D.sub.2 - 1/4D.sub.3.\n\nthis can be achieved by expressing the coefficients in a ternary code as follows:\n\n7/8 = 100100 = 1 - 1/8\n\n9/16 = 010010 = 1/2 + 1/16\n\n-1/4 = 001000 = -1/4\n\nIn this table the use of the bar, i.e., 1, indicates that the relevant bit has a negative weight. This calculation can then be performed using the arrangement shown in FIG. 2. The adder ADD and accumulator ACC are the same as in FIG. 1, but the input matrix M' is more complex, each data word being fed either direct and/or inverted (complemented) to the appropriate adder inputs.\n\nWord D.sub.1 is fed directly to input I.sub.5 and in complemented form to input I.sub.2 by means of the inverter INV. In practice what this means is that although the coefficients are expressed in a ternary code the negative weights are realized by reversing the sign of the data. Thus, in effect 7/8D.sub.1 = (11/8)D.sub.1 = 1.times.D.sub.1 + 1/8.times.(-D.sub.1). D.sub.2 + D.sub.3 are similarly fed to the input matrix M' with inversion where appropriate. Once again, it is important to note that any one adder input receives not more than one word, either direct or inverted.\n\nFurther flexibility can be achieved by using serial adders for cases where the coefficients (which can be regarded as data words) have bits which overlap, even after re-expressing them in ternary form. In other words two incoming data words are required to be fed to the same adder cell. Consider as an example the calculation:\n\nP = (D.sub.1 .times.E.sub.1) + (D.sub.2 .times.E.sub.2) + (D.sub.3 .times.E.sub.3) + (D.sub.4 .times.E.sub.4) + (D.sub.5 .times.E.sub.5)\n\nwhere the coefficients E.sub.1 -E.sub.5 have the values given below and are re-expressed in the ternary forms shown in the following table.\n\n______________________________________ VALUE TERNARY FORM ______________________________________ E.sub.1 136/256 0 0 0 1 0 0 0 1 0 0 0 E.sub.2 686/256 0 1 1 0 -1 0 -1 0 0 -1 0 E.sub.3 -796/256 -1 0 1 0 0 -1 0 0 1 0 0 E.sub.4 446/256 0 1 0 0 -1 0 0 0 0 -1 0 E.sub.5 -103/256 0 0 0 -1 0 1 0 -1 0 0 1 ##STR1## ##STR2## ______________________________________\n\nIt can be seen that in nearly every column there are two overlapping ternary bits but nowhere are there more than two. This calculation can be realized by pre-adding together two data words where they are each to be multiplied by the same weight bit. In this case the result will be formed by performing the calculation as follows:\n\nP=2.sup.2 (-D.sub.3) + 2.sup.1 (D.sub.2 +D.sub.4) + 2.degree. (D.sub.2 +D.sub.3) + 2.sup.-1 (-D.sub.5 +D.sub.1) +2.sup.-2 (-D.sub.4 -D.sub.2) + 2.sup.-3 (D.sub.5 -D.sub.3) + 2.sup.-4 (-D.sub.2) +2.sup.-5 (-D.sub.5 +D.sub.1) + 2.sup.-6 (D.sub.3) + 2.sup.-7 (-D.sub.2 -D.sub.4) + 2.sup.-8 (D.sub.5)\n\nan arrangement for performing the calculation in this manner is shown in FIG. 3. The arrangement of FIG. 3 is designed as a fourth order recursive digital filter section in which in fact D.sub.1 is the only external input and D.sub.2 - D.sub.5 are derived from the multiplier output. D.sub.2 is the multiplier output proper, and D.sub.3 - D.sub.5 are successively delayed versions of D.sub.2, in each case delayed by one word period. To perform the calculation the input I.sub.10, having the weight of 2.sup.2, receives word D.sub.3 via an inverter, input I.sub.9 receives the serial sum of words D.sub.2 and D.sub.4 produced by the serial adder cell 30, input I.sub.8 receives the serial sum of words D.sub.2 and D.sub.3 produced by serial adder cell 31 and so on. To prevent overflow in the serial adder cells the data must be pre-limited to .+-.1/2-full scale range so that on addition of any two words the sum is still within the full range.\n\nThe filter section shown in FIG. 3 is designed to work with offset binary data, that is for an N-bit word the value is: ##EQU1## where the rth bit B.sub.r is worth \"0\" or \"1\". Thus, the weighted value of that bit is -2.sup.-N-1 or +2.sup.-M+1, respectively. Sign reversal (that is multiplication by -1) is achieved by complementary (inverting) the data bits.\n\nIn a practical digital filter the output under some circumstances may exceed the allowable data range and for that case overflow protection must be provided. This can be accomplished in the following manner. When multiplication starts the least significant bits of the answer start coming from the least significant adder output. At the completion of the multiplication period the remaining most significant bits of the answer are in the accumulator (A0 - A10) and must be transferred over to a transfer register (T.sub.1 - T.sub.11) so that the accumulator can be cleared to start a new multiplication. While the multiplier is working on this new multiplication the bits in the transfer register are shifted out to complete the previous answer. In general, however, when working with fixed point arithmetic, it is necessary to limit the maximum answer to the available range expressible by the data format. In digital filters, particularly of the recursive types the answer may exceed the available data range so that if the most significant few bits of the accumulated result are simply ignored an undesirable overflow characteristic may occur leading to instability. However, by storing the bits to be dropped and checking the answer to see if the allowable range has been exceeded the multiplier can be made to saturate giving a maximum positive or negative result. This is done in the arrangement of FIG. 3 by checking the states of bits T.sub.8 to T.sub.11 in overflow detector OD to detect whether overflow will occur if T.sub.9 to T.sub.11 are dropped and using the result to control the multiplier output in an overflow correction circuit OC. If no overflow occurs then the normal output is allowed to flow out but if overflow has occurred then a maximum positive or negative data signal is substituted for the completed answer according to the sign.\n\nAnother way of achieving flexibility while adhering to the general rule stated earlier is to provide multiple inputs per stage of the multiplier using a second rank of parallel adder cells. Where there are overlapping bits in the ternary expressed coefficients the data can be fed into individual inputs without the need for serial pre-addition and, hence, pre-limiting of the data input magnitude. Such an arrangement is shown in FIG. 4.\n\nThe basic multiplier design of FIG. 4 is similar to that of the preceding figures but with the additional rank of adder cells ADD 2 preceding the final rank of adder cells ADD 1. Note that the final rank of adder cells ADD 1 has to have one more cell than the additional rank of adder cells ADD 2. The inputs to the multipliers are by way of the input matrix M\" feeding the cells of the addition rank of adder cells ADD 2.\n\nConsider the following calculation:\n\nP = 7/8D.sub.1 - 3/8D.sub.2 + 3/4D.sub.3\n\nby constructing a general purpose X-Y interconnection matrix as shown in FIG. 4 and making connections only at the appropriate crossings a very flexible arrangement results. Each input data line drives one input line directly and a second input line through a sign reverser (inverter) so that either data or minus data can be connected to give coefficients expressed in ternary. This scheme will work with any form of binary coded data, such as ordinary binary, 2's complement binary, offset-binary, negabinary (radix-2) etc., provided the logic in the sign reversers and adders is appropriate to the type of coding. Conversion between different codes can be simultaneously accomplished by feeding in appropriate conversion constants to unused inputs and inverting the polarity of data bits where necessary.\n\nIn the arrangement illustrated the least significant bit carry inputs of the adders are shown grounded. They may in fact be used (a) as extra data inputs, (b) for feeding in a rounding signal, (c) for providing an automatic clear of the accumulator ACC.\n\nThis last item can considerably simplify the hardware and timing of multipliers since it eliminates the need for individual clear elements in each accumulator cell.\n\nThe method will be described using a modified design of FIG. 4 with carry-save adders instead of fully parallel ripple or look-ahead carry types. The method can equally well be used with ripple through carry addition, but it is useful to consider a carry-save addition type which minimizes problems of logic propagation delay.\n\nFIG. 5 shows a complete multiplier design using 2's complement arithmetic and carry-save addition. This design allows two inputs per bit but this can be increased by additional ranks of ordinary or carry-save adders. Input data is routed to the adder inputs via the coefficient connection matrix M'\" previously described. Multiplication of data by -1 is achieved by inverting (complementing) the data bits. This is not strictly accurate with 2's complement data since it introduces an error of one least significant bit. This will cause a constant small error in the result. In cases where this is important the inverters can be replaced by true subtract from zero circuits or a compensation signal can be fed into an unused data input. Each carry-save adder cell is a normal full adder with three inputs each worth one unit and pseudo sum and carry outputs worth one and two units, respectively. The first rank takes two data inputs plus the fed back sum accumulator and feeds the second rank. The second rank takes the sum from the first rank plus the left shifted carry (shifted left since the carry is worth 2 units) plus the fed back carry accumulator. The outputs are loaded into the sum and carry accumulators A0-A6 and B0-B7, respectively. On feedback the sum is shifted one place right as in previous examples, but the carry shift right is neutralized by the fact that being worth twice as much as the sum it needs shifting one place left.\n\nOn completion of the multiplication the answer is the sum of the contents of the sum and carry accumulators plus the least significant bits which have flowed out the least-significant-bit-sum output through the selector and into the output delay. The contents of the sum and carry accumulators are loaded into sum and carry transfer registers SCTR and shifting begins, adding the two together in serial adder 50 and routing the result through the output delay 51. At the same time a new multiplication can start. However, since at this point the sum contained in the two transfer registers is the same as the sum contained in the two accumulators it is possible by feeding back minus the sum of the two transfer registers into the accumulators to remove the old result from the calculation without the physical necessity for clearing the accumulator cells A.sub.0 to A.sub.6 and B.sub.0 to B.sub.7. Additional refinements can include overflow detection and correction and also rounding the answer to a given number of bits.\n\nWhile I have described above the principles of my invention in connection with specific apparatus it is to be clearly understood that this description is made only by way of example and not as a limitation to the scope of my invention as set forth in the objects thereof and in the accompanying claims.\n\n## Claims\n\n1. A digital multiplier providing a calculated output signal comprising:\n\nan accumulator coupled to each of said first adder cells to store the output of each of said first adder cells and to shift said stored output one bit for each addition operation said calculated output signal being provided by said accumulator;\ninput means coupled to said first adder cells for applying simultaneously a plurality of serial data words to said first adder cells, said input means being arranged so that each of said serial words is applied to predetermined ones of said first adder cells but no two serial words are applied to the same one of said first adder cells;\nfirst means coupled to said accumulator for examining a given number of the most significant bits of said calculated output signal to determine if the complete calculated output signal value will exceed a predetermined range of values; and\nsecond means coupled to said accumulator and a given one of said first adder cells for substituting for said calculated output signal a selected one of a maximum positive and negative data signal according to the sign of said calculated output signal when the value of the latter exceeds said predetermined range of values.\n\n2. A multiplier according to claim 1, wherein said input means includes\n\nan input matrix having a plurality of column conductors and a plurality of row conductors each of said column conductors being coupled to a different one of said first adder cells and each of said row conductors being coupled to a different one of said serial words, the interconnection of each of said row conductors with said column conductors being arranged in a pattern corresponding to a predetermined digital word, said interconnection pattern for each of said row conductors being different from said interconnection pattern of every other one of said row conductors with no more than one of said row conductors having an interconnection with any one of said column conductors.\n\n3. A multiplier according to claim 2, further including:\n\nfirst means coupled to said accumulator for examining a given number of the most significant bits of said calculated output signal to determine if the complete calculated output signal value will exceed a predetermined range of values; and\nsecond means coupled to said accumulator and a given one of said first adder cells for substituting for said calculated output signal a selected one of a maximum positive and negative data signal according to the sign of said calculated output signal when the value of the latter exceeds said predetermined range of values.\n\n4. A multiplier according to claim 2, further including\n\na second adder having a plurality of second adder cells, said second adder cells being equal in number to one less than the number of said first adder cells, the output of each of said second adder cells being coupled to the input of a different one of less significant ones of said first adder cells, and wherein\nsaid input matrix couples said serial words to said second adder cells, said input matrix including\na plurality of two column conductors, each of said two column conductors being coupled to a different one of said second adder cells to enable two of said serial words that are simultaneously present on said row conductors to be serially added together to provide sum outputs at the output of certain of said second adder cells, said input matrix having not more than one of said row conductors with an interconnection with any one of said plurality of two column conductors.\n\n5. A multiplier according to claim 4 wherein\n\nfirst means coupled to said accumulator for examining a given number of the most significant bits of said calculated output signal to determine if the complete calculated output signal value will exceed a predetermined range of values; and\nsecond means coupled to said accumulator and a given one of said first adder cells for substituting for said calculated output signal a selected one of a maximum positive and negative data signal according to the sign of said calculated output signal when the value of the latter exceeds said predetermined range of values.\n\n6. A multiplier according to claim 2, further including\n\nat least one additional row conductor for each of said plurality of row conductors, each of said additional row conductors having a different one of said serial words coupled thereto, and\na plurality of complementing means each coupled to a different one of said additional row conductors for complementing the digits of an associated one of said serial words\nsaid interconnection pattern for each of said additional row conductors with said column conductors being different than said interconnection pattern of every other one of said additional row conductors with no more than one of said plurality of row conductors and said additional row conductors having an interconnection with any one of said column conductors.\n\n7. A multiplier according to claim 6, wherein\n\nfirst means coupled to said accumulator for examining a given number of the most significant bits of said calculated output signal to determine if the complete calculated output signal value will exceed a predetermined range of values; and\nsecond means coupled to said accumulator and a given one of said first adder cells for substituting for said calculated output signal a selected one of a maximum positive and negative data signal according to the sign of said calculated output signal when the value of the latter exceeds said predetermined range of values.\n\n8. A multiplier according to claim 6, further including\n\na second adder having a plurality of second adder cells, said second adder cells being equal in number to one less than the number of said first adder cells, the output of each of said second adder cells being coupled to the input of a different one of less significant ones of said first adder cells, and wherein\nsaid input matrix couples said serial words to said second adder cells, said input matrix including\na plurality of two column conductors each of said two column conductors being coupled to a different one of said second adder cells to enable two of said serial words that are simultaneously present on said row conductors to be serially added together to provide sum outputs at the output of certain of said second adder cells, said input matrix having not more than one of said row conductors with an interconnection with any one of said plurality of two column conductors.\n\n9. A multiplier according to claim 8, wherein\n\nfirst means coupled to said accumulator for examining a given number of the most significant bits of said calculated output signal to determine if the complete calculated output signal value will exceed a predetermined range of values; and\nsecond means coupled to said accumulator and a given one of said first adder cells for substituting for said calculated output signal a selected one of a maximum positive and negative data signal according to the sign of said calculated output signal when the value of the latter exceeds said predetermined range of values.\n\n10. A multiplier according to claim 8, further including\n\na sum accumulator;\na carry accumulator;\na sum transfer register;\na carry transfer register; and\na carry output from each of said second adder cells are each coupled as an input to one of said first adder cells of next greater significance than the significance of the associated one of said second adder cells;\na sum output from each of said first adder cells are each fed back as a carry input of one of said second adder cells of next lesser significance than the significance of the associated one of said first adder cells through said sum accumulator,\na carry output from each of said first adder cell is fed back to a carry input of the same one of said first adder cell through said carry accumulator,\na sum output of each of said first adder cells are coupled to said sum transfer register,\na carry output of each of said first adder cells are coupled to said carry transfer register, and\nsaid additional serial adder cell is coupled to said sum and carry transfer registers to add the contents of said sum and carry transfer registers as the contents thereof are transferred serially to an output of said multiplier.\n\n11. A digital multiplier according to claim 10, wherein\n\nfirst means coupled to said accumulator for examining a given number of the most significant bits of said calculated output signal to determine if the complete calculated output signal value will exceed a predetermined range of values; and\nsecond means coupled to said accumulator and a given one of said first adder cells for substituting for said calculated output signal a selected one of a maximum positive and negative data signal according to the sign of said calculated output signal when the value of the latter exceeds said predetermined range of values.\n\n12. A digital multiplier according to claim 10, wherein\n\nthe output of said additional serial adder cell is complemented and fed back as an input to the least significant one of said first adder cell.\n\n13. A digital multiplier according to claim 12, wherein\n\nfirst means coupled to said accumulator for examining a given number of the most significant bits of said calculated output signal to determine if the complete calculated output signal value will exceed a predetermined range of values; and\nsecond means coupled to said accumulator and a given one of said first adder cells for substituting for said calculated output signal a selected one of a maximum positive and negative data signal according to the sign of said calculated output signal when the value of the latter exceeds said predetermined range of values.\n\n14. A digital multiplier comprising:\n\ninput means for serially receiving a plurality of serial n-bit digital inputs at a predetermined clock rate for deriving a plurality of parallel n-bit serial digital inputs therefrom;\nweighting means for weighting each of said n-bit serial digital inputs with a plurality of constant coefficients, such that each of said n-bit serial digital inputs is weighted with one of said plurality of coefficients;\naccumulator means having said plurality of weighted n-bit serial digital inputs coupled thereto in parallel for adding said parallel n-bit serial inputs in parallel to obtain a calculated digital output; and\noutput means for serially coupling said calculated digital output from said accumulator at said predetermined clock rate.\n\n15. A digital multiplier in accordance with claim 14 wherein said input means includes a plurality of shift register delays each of which shift register delays being adapted to derive one of said parallel n-bit serial digital inputs.\n\n16. A digital multiplier in accordance with claim 15 wherein said weighting means includes a weighting matrix for deriving said constant coefficients, one of said constant coefficients being derived for each of said parallel n-bit serial inputs.\n\n17. A digital multiplier in accordance with claim 15 wherein the addition of said plurality of weighted parallel n-bit serial digital inputs by said accumulator to derive said calculated digital output is performed in an n-bit time duration.\n\nPatent History\nPatent number: 4104729\nType: Grant\nFiled: May 16, 1977\nDate of Patent: Aug 1, 1978\nAssignee: International Standard Electric Corporation (New York, NY)\nInventor: Michael J. Gingell (Sawbridgeworth)\nPrimary Examiner: Jerry Smith\nAttorneys: John T. O'Halloran, Jeffrey P. Morris\nApplication Number: 5/796,920\nClassifications\nCurrent U.S. Class: 364/757; 364/724\nInternational Classification: G06F 752;" ]
[ null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.9213235,"math_prob":0.93486154,"size":31463,"snap":"2021-43-2021-49","text_gpt3_token_len":6851,"char_repetition_ratio":0.18287295,"word_repetition_ratio":0.26853782,"special_character_ratio":0.21955948,"punctuation_ratio":0.10447521,"nsfw_num_words":1,"has_unicode_error":false,"math_prob_llama3":0.98302346,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2021-10-24T23:25:52Z\",\"WARC-Record-ID\":\"<urn:uuid:dc657dc9-0fd3-4e55-a9c2-cd73a92e24a0>\",\"Content-Length\":\"87951\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:61871436-07ed-4a4d-9f9f-cd4d20b4a2a9>\",\"WARC-Concurrent-To\":\"<urn:uuid:e3ee930e-12a9-4f74-9afd-754e5995581d>\",\"WARC-IP-Address\":\"52.202.107.78\",\"WARC-Target-URI\":\"https://patents.justia.com/patent/4104729\",\"WARC-Payload-Digest\":\"sha1:KV642UV6GZ4GAFNHL4LY3BFLG44J4OIZ\",\"WARC-Block-Digest\":\"sha1:JO64W7JG4ZB2D23M3OFIF3RKIOL4BKUH\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2021/CC-MAIN-2021-43/CC-MAIN-2021-43_segments_1634323587606.8_warc_CC-MAIN-20211024204628-20211024234628-00107.warc.gz\"}"}
https://www.asknumbers.com/inch-to-cm/186-inches-to-cm.aspx
[ "# How Many Centimeters in 186 Inches?\n\n186 Inches to cm converter. How many centimeters in 186 inches?\n\n186 Inches equal to 472.44 cm or there are 472.44 centimeters in 186 inches.\n\n←→\nstep\nRound:\nEnter Inch\nEnter Centimeter\n\n## How to convert 186 inches to cm?\n\nThe conversion factor from inches to cm is 2.54. To convert any value of inches to cm, multiply the inch value by the conversion factor.\n\nTo convert 186 inches to cm, multiply 186 by 2.54, that makes 186 inches equal to 472.44 cm.\n\n186 inches to cm formula\n\ncm = inch value * 2.54\n\ncm = 186 * 2.54\n\ncm = 472.44\n\nCommon conversions from 186.x inches to cm:\n(rounded to 3 decimals)\n\n• 186 inches = 472.44 cm\n• 186.1 inches = 472.694 cm\n• 186.2 inches = 472.948 cm\n• 186.3 inches = 473.202 cm\n• 186.4 inches = 473.456 cm\n• 186.5 inches = 473.71 cm\n• 186.6 inches = 473.964 cm\n• 186.7 inches = 474.218 cm\n• 186.8 inches = 474.472 cm\n• 186.9 inches = 474.726 cm\n\nWhat is a Centimeter?\n\nCentimeter (centimetre) is a metric system unit of length. The symbol is \"cm\".\n\nWhat is a Inch?\n\nInch is an imperial and United States Customary systems unit of length, equal to 1/12 of a foot. 1 inch = 2.54 cm. The symbol is \"in\".\n\nCreate Conversion Table\nClick \"Create Table\". Enter a \"Start\" value (5, 100 etc). Select an \"Increment\" value (0.01, 5 etc) and select \"Accuracy\" to round the result." ]
[ null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.7601809,"math_prob":0.99547863,"size":934,"snap":"2022-27-2022-33","text_gpt3_token_len":321,"char_repetition_ratio":0.24086021,"word_repetition_ratio":0.0,"special_character_ratio":0.44218415,"punctuation_ratio":0.18454936,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.99649525,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2022-07-05T19:27:12Z\",\"WARC-Record-ID\":\"<urn:uuid:fcc1884f-5d2e-4014-a30e-f45e337844ba>\",\"Content-Length\":\"46155\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:01ee07c1-d451-4b3c-9281-20799d7f172a>\",\"WARC-Concurrent-To\":\"<urn:uuid:6acef65c-041e-4e8b-be12-3e49d3ce7efc>\",\"WARC-IP-Address\":\"104.21.33.54\",\"WARC-Target-URI\":\"https://www.asknumbers.com/inch-to-cm/186-inches-to-cm.aspx\",\"WARC-Payload-Digest\":\"sha1:NYBAV4NGX4ZHU2B2INJPQUOM56K4YUB5\",\"WARC-Block-Digest\":\"sha1:7AMR56CGO4MOF753P7TW4VLAP5K7VZRO\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2022/CC-MAIN-2022-27/CC-MAIN-2022-27_segments_1656104597905.85_warc_CC-MAIN-20220705174927-20220705204927-00497.warc.gz\"}"}
https://help.matheass.eu/en/E201-Right-angled_Triangles.html
[ "## Right-angled Triangles\n\nA right-angled triangle is usually well defined by two properties and the right angle. The program will ask you are asked to choose two of the following elements and then to enter their values:\n\n• Catheti a and b\n• Hypotenuse c\n• Angles α and β\n• Hypotenuse segments p and q\n• Altitude h\n• Area A", null, "If you enter the values of two out of these nine properties the program computes the others.\n\n### Example 1:\n\n```Given:\n¯¯¯¯¯¯\nCathete a = 3\nHypotenuse c = 5\n\nResults :\n¯¯¯¯¯¯¯\nCathete b = 4\nAngle α = 36,869898°\nAngle β = 53,130102°\nHypot. segment p = 1,8\nHypot. segment q = 3,2\nAltitude h = 2,4\nArea A = 6```\n\n### Example 2:\n\n```Given:\n¯¯¯¯¯¯\nHypot. segment p = 1,8\nArea A = 6\n\nResults :\n¯¯¯¯¯¯¯\nCathete a = 3\nCathete b = 4\nHypotenuse c = 5\nAngle α = 36,869898°\nAngle β = 53,130102°\nHypot. segment q = 3,2\nAltitude h = 2,4\n```" ]
[ null, "https://help.matheass.eu/images/G2D-Dreieck1.png", null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.7343149,"math_prob":0.9953604,"size":819,"snap":"2023-40-2023-50","text_gpt3_token_len":273,"char_repetition_ratio":0.1411043,"word_repetition_ratio":0.14634146,"special_character_ratio":0.36630037,"punctuation_ratio":0.13294798,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.99933255,"pos_list":[0,1,2],"im_url_duplicate_count":[null,3,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2023-09-26T21:34:35Z\",\"WARC-Record-ID\":\"<urn:uuid:1c152664-ec2a-47f0-b33d-ef1d9cbff846>\",\"Content-Length\":\"3356\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:2cf34f1e-e38b-42f4-ac63-893d876eeb78>\",\"WARC-Concurrent-To\":\"<urn:uuid:d44070aa-2904-4ce7-8379-f6fdd0f0da45>\",\"WARC-IP-Address\":\"80.150.6.143\",\"WARC-Target-URI\":\"https://help.matheass.eu/en/E201-Right-angled_Triangles.html\",\"WARC-Payload-Digest\":\"sha1:GSDVB5KIUWMIKVZNGUU2C6IUBKB2747U\",\"WARC-Block-Digest\":\"sha1:VV6D2WDNDSOKHUYNFYMMLWF6PJEDSQMM\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2023/CC-MAIN-2023-40/CC-MAIN-2023-40_segments_1695233510225.44_warc_CC-MAIN-20230926211344-20230927001344-00472.warc.gz\"}"}
https://www.colorhexa.com/00c830
[ "# #00c830 Color Information\n\nIn a RGB color space, hex #00c830 is composed of 0% red, 78.4% green and 18.8% blue. Whereas in a CMYK color space, it is composed of 100% cyan, 0% magenta, 76% yellow and 21.6% black. It has a hue angle of 134.4 degrees, a saturation of 100% and a lightness of 39.2%. #00c830 color hex could be obtained by blending #00ff60 with #009100. Closest websafe color is: #00cc33.\n\n• R 0\n• G 78\n• B 19\nRGB color chart\n• C 100\n• M 0\n• Y 76\n• K 22\nCMYK color chart\n\n#00c830 color description : Strong lime green.\n\n# #00c830 Color Conversion\n\nThe hexadecimal color #00c830 has RGB values of R:0, G:200, B:48 and CMYK values of C:1, M:0, Y:0.76, K:0.22. Its decimal value is 51248.\n\nHex triplet RGB Decimal 00c830 `#00c830` 0, 200, 48 `rgb(0,200,48)` 0, 78.4, 18.8 `rgb(0%,78.4%,18.8%)` 100, 0, 76, 22 134.4°, 100, 39.2 `hsl(134.4,100%,39.2%)` 134.4°, 100, 78.4 00cc33 `#00cc33`\nCIE-LAB 70.538, -69.847, 59.9 21.186, 41.519, 9.694 0.293, 0.573, 41.519 70.538, 92.014, 139.384 70.538, -65.958, 79.644 64.436, -54.071, 36.185 00000000, 11001000, 00110000\n\n# Color Schemes with #00c830\n\n• #00c830\n``#00c830` `rgb(0,200,48)``\n• #c80098\n``#c80098` `rgb(200,0,152)``\nComplementary Color\n• #34c800\n``#34c800` `rgb(52,200,0)``\n• #00c830\n``#00c830` `rgb(0,200,48)``\n• #00c894\n``#00c894` `rgb(0,200,148)``\nAnalogous Color\n• #c80034\n``#c80034` `rgb(200,0,52)``\n• #00c830\n``#00c830` `rgb(0,200,48)``\n• #9400c8\n``#9400c8` `rgb(148,0,200)``\nSplit Complementary Color\n• #c83000\n``#c83000` `rgb(200,48,0)``\n• #00c830\n``#00c830` `rgb(0,200,48)``\n• #3000c8\n``#3000c8` `rgb(48,0,200)``\n• #98c800\n``#98c800` `rgb(152,200,0)``\n• #00c830\n``#00c830` `rgb(0,200,48)``\n• #3000c8\n``#3000c8` `rgb(48,0,200)``\n• #c80098\n``#c80098` `rgb(200,0,152)``\n• #007c1e\n``#007c1e` `rgb(0,124,30)``\n• #009524\n``#009524` `rgb(0,149,36)``\n• #00af2a\n``#00af2a` `rgb(0,175,42)``\n• #00c830\n``#00c830` `rgb(0,200,48)``\n• #00e236\n``#00e236` `rgb(0,226,54)``\n• #00fb3c\n``#00fb3c` `rgb(0,251,60)``\n• #16ff4e\n``#16ff4e` `rgb(22,255,78)``\nMonochromatic Color\n\n# Alternatives to #00c830\n\nBelow, you can see some colors close to #00c830. Having a set of related colors can be useful if you need an inspirational alternative to your original color choice.\n\n• #02c800\n``#02c800` `rgb(2,200,0)``\n• #00c80f\n``#00c80f` `rgb(0,200,15)``\n• #00c81f\n``#00c81f` `rgb(0,200,31)``\n• #00c830\n``#00c830` `rgb(0,200,48)``\n• #00c841\n``#00c841` `rgb(0,200,65)``\n• #00c851\n``#00c851` `rgb(0,200,81)``\n• #00c862\n``#00c862` `rgb(0,200,98)``\nSimilar Colors\n\n# #00c830 Preview\n\nThis text has a font color of #00c830.\n\n``<span style=\"color:#00c830;\">Text here</span>``\n#00c830 background color\n\nThis paragraph has a background color of #00c830.\n\n``<p style=\"background-color:#00c830;\">Content here</p>``\n#00c830 border color\n\nThis element has a border color of #00c830.\n\n``<div style=\"border:1px solid #00c830;\">Content here</div>``\nCSS codes\n``.text {color:#00c830;}``\n``.background {background-color:#00c830;}``\n``.border {border:1px solid #00c830;}``\n\n# Shades and Tints of #00c830\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, #000401 is the darkest color, while #effff3 is the lightest one.\n\n• #000401\n``#000401` `rgb(0,4,1)``\n• #001706\n``#001706` `rgb(0,23,6)``\n• #002b0a\n``#002b0a` `rgb(0,43,10)``\n• #003f0f\n``#003f0f` `rgb(0,63,15)``\n• #005214\n``#005214` `rgb(0,82,20)``\n• #006618\n``#006618` `rgb(0,102,24)``\n• #007a1d\n``#007a1d` `rgb(0,122,29)``\n• #008d22\n``#008d22` `rgb(0,141,34)``\n• #00a127\n``#00a127` `rgb(0,161,39)``\n• #00b42b\n``#00b42b` `rgb(0,180,43)``\n• #00c830\n``#00c830` `rgb(0,200,48)``\n• #00dc35\n``#00dc35` `rgb(0,220,53)``\n• #00ef39\n``#00ef39` `rgb(0,239,57)``\n• #04ff40\n``#04ff40` `rgb(4,255,64)``\n• #17ff4f\n``#17ff4f` `rgb(23,255,79)``\n• #2bff5e\n``#2bff5e` `rgb(43,255,94)``\n• #3fff6d\n``#3fff6d` `rgb(63,255,109)``\n• #52ff7c\n``#52ff7c` `rgb(82,255,124)``\n• #66ff8b\n``#66ff8b` `rgb(102,255,139)``\n• #7aff9a\n``#7aff9a` `rgb(122,255,154)``\n• #8dffa8\n``#8dffa8` `rgb(141,255,168)``\n• #a1ffb7\n``#a1ffb7` `rgb(161,255,183)``\n• #b4ffc6\n``#b4ffc6` `rgb(180,255,198)``\n• #c8ffd5\n``#c8ffd5` `rgb(200,255,213)``\n• #dcffe4\n``#dcffe4` `rgb(220,255,228)``\n• #effff3\n``#effff3` `rgb(239,255,243)``\nTint Color Variation\n\n# Tones of #00c830\n\nA tone is produced by adding gray to any pure hue. In this case, #5c6c60 is the less saturated color, while #00c830 is the most saturated one.\n\n• #5c6c60\n``#5c6c60` `rgb(92,108,96)``\n• #55735c\n``#55735c` `rgb(85,115,92)``\n• #4d7b58\n``#4d7b58` `rgb(77,123,88)``\n• #458354\n``#458354` `rgb(69,131,84)``\n• #3e8a50\n``#3e8a50` `rgb(62,138,80)``\n• #36924c\n``#36924c` `rgb(54,146,76)``\n• #2e9a48\n``#2e9a48` `rgb(46,154,72)``\n• #26a244\n``#26a244` `rgb(38,162,68)``\n• #1fa940\n``#1fa940` `rgb(31,169,64)``\n• #17b13c\n``#17b13c` `rgb(23,177,60)``\n• #0fb938\n``#0fb938` `rgb(15,185,56)``\n• #08c034\n``#08c034` `rgb(8,192,52)``\n• #00c830\n``#00c830` `rgb(0,200,48)``\nTone Color Variation\n\n# Color Blindness Simulator\n\nBelow, you can see how #00c830 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.5338449,"math_prob":0.85960203,"size":3655,"snap":"2023-40-2023-50","text_gpt3_token_len":1635,"char_repetition_ratio":0.13777047,"word_repetition_ratio":0.0073937154,"special_character_ratio":0.5592339,"punctuation_ratio":0.23190045,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.98379457,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2023-12-10T01:35:49Z\",\"WARC-Record-ID\":\"<urn:uuid:099ddf51-f0b3-47ea-95d4-44ef38fd8217>\",\"Content-Length\":\"36151\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:05954e16-ff5d-43a4-a150-8c7d90d98c57>\",\"WARC-Concurrent-To\":\"<urn:uuid:aab437cb-eb34-4b0d-8d73-1615d729e125>\",\"WARC-IP-Address\":\"178.32.117.56\",\"WARC-Target-URI\":\"https://www.colorhexa.com/00c830\",\"WARC-Payload-Digest\":\"sha1:SX7PYKJO54FWES3FOPY6CJN67ZHMQJ7Y\",\"WARC-Block-Digest\":\"sha1:QNCX7FAR3CAFVLPTXUSAHYWNGTQK4662\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2023/CC-MAIN-2023-50/CC-MAIN-2023-50_segments_1700679100989.75_warc_CC-MAIN-20231209233632-20231210023632-00344.warc.gz\"}"}
https://wordpress.stackexchange.com/questions/18725/custom-pagination-for-custom-post-types-by-names
[ "# Custom pagination for custom post types (by names)\n\nI have two custom post types that deal with people's names. Right now, in browsing views, it just lists them all alphabetically and the pagination breaks them down by numbers, which isn't terribly helpful when you're trying to find a specific person.\n\nSpecifically, I've been asked to create pagination links for people that look like this:\n\n• A-G\n• H-M\n• N-Q\n• R-Q\n\nMy problem - I can't figure out how I can query the custom post types by the first letter of one field. Then, I'm not sure how I can go about creating the pagination in this way. Does anybody have any suggestions? Thank you!\n\n• Interesting.. I will give it a shot but not very soon. I have a free slot after couple of days. Do share your solution if you find anything before that. Just to start look at posts_where filter to modify lookup and to do the pagination you need to play with rewrite rules, have a look at query_vars, query_posts and WP_Rewrite class. I am sure you will nail it with these things. – Hameedullah Khan May 30 '11 at 16:34\n• @mckeodm3 So what?? – kaiser Jan 12 '12 at 1:47\n\nInteresting question! I solved it by expanding the WHERE query with a bunch of post_title LIKE 'A%' OR post_title LIKE 'B%' ... clauses. You can also use a regular expression to do a range search, but I believe the database won't be able to use an index then.\n\nThis is the core of the solution: a filter on the WHERE clause:\n\nadd_filter( 'posts_where', 'wpse18703_posts_where', 10, 2 );\nfunction wpse18703_posts_where( $where, &$wp_query )\n{\nif ( $letter_range =$wp_query->get( 'wpse18703_range' ) ) {\nglobal $wpdb;$letter_clauses = array();\nforeach ( $letter_range as$letter ) {\n$letter_clauses[] =$wpdb->posts. '.post_title LIKE \\'' . $letter . '%\\''; }$where .= ' AND (' . implode( ' OR ', $letter_clauses ) . ') '; } return$where;\n}\n\n\nOf course you don't want to allow random external input in your query. That is why I have an input sanitization step on pre_get_posts, which converts two query variables into a valid range. (If you find a way to break this please leave a comment so I can correct it)\n\nadd_action( 'pre_get_posts', 'wpse18703_pre_get_posts' );\nfunction wpse18703_pre_get_posts( &$wp_query ) { // Sanitize input$first_letter = $wp_query->get( 'wpse18725_first_letter' );$last_letter = $wp_query->get( 'wpse18725_last_letter' ); if ($first_letter || $last_letter ) {$first_letter = substr( strtoupper( $first_letter ), 0, 1 );$last_letter = substr( strtoupper( $last_letter ), 0, 1 ); // Make sure the letters are valid // If only one letter is valid use only that letter, not a range if ( ! ( 'A' <=$first_letter && $first_letter <= 'Z' ) ) {$first_letter = $last_letter; } if ( ! ( 'A' <=$last_letter && $last_letter <= 'Z' ) ) { if ($first_letter == $last_letter ) { // None of the letters are valid, don't do a range query return; }$last_letter = $first_letter; }$wp_query->set( 'posts_per_page', -1 );\n$wp_query->set( 'wpse18703_range', range($first_letter, $last_letter ) ); } } The final step is to create a pretty rewrite rule so you can go to example.com/posts/a-g/ or example.com/posts/a to see all posts beginning with this (range of) letter(s). add_action( 'init', 'wpse18725_init' ); function wpse18725_init() { add_rewrite_rule( 'posts/(\\w)(-(\\w))?/?', 'index.php?wpse18725_first_letter=$matches&wpse18725_last_letter=$matches', 'top' ); } add_filter( 'query_vars', 'wpse18725_query_vars' ); function wpse18725_query_vars($query_vars )\n{\n$query_vars[] = 'wpse18725_first_letter';$query_vars[] = 'wpse18725_last_letter';\nreturn $query_vars; } You can change the rewrite rule pattern to start with something else. If this is for a custom post type, be sure to add &post_type=your_custom_post_type to the substitution (the second string, which starts with index.php). Adding pagination links is left as an exercise for the reader :-) • Just a hint: like_escape() :) – kaiser Mar 1 '12 at 22:43 This will help you getting started. I don't know how you would break the query at specific letter and then tell WP that there's another page with more letters, but the following takes 99% of the rest. Don't forget to post your solution! query_posts( array( 'orderby' => 'title' ) ); // Build an alphabet array foreach( range( 'A', 'G' ) as$letter )\n$alphabet[] =$letter;\n\nforeach( range( 'H', 'M' ) as $letter )$alphabet[] = $letter; foreach( range( 'N', 'Q' ) as$letter )\n$alphabet[] =$letter;\n\nforeach( range( 'R', 'Z' ) as $letter )$alphabet[] = $letter; if ( have_posts() ) { while ( have_posts() ) { global$wp_query, $post;$max_paged = $wp_query->query_vars['max_num_pages'];$paged = $wp_query->query_vars['paged']; if ( !$paged )\n$paged = (int) 1; the_post();$first_title_letter = (string) substr( $post->post_title, 1 ); if ( in_array($first_title_letter, $alphabet ) ) { // DO STUFF } // Pagination if ($paged !== (int) 1 )\n{\necho 'Prev: '._wp_link_page( $paged - 1 ); } while ($i = 1; count($alphabet) <$max_paged; i++; )\n{\necho $i._wp_link_page($i );\n}\nif ( $paged !==$max_paged )\n{\necho 'Next: '._wp_link_page( $paged + 1 ); echo 'Last: '._wp_link_page($max_paged );\n}\n} // endwhile;\n} // endif;\n\n• It's not tested. – kaiser May 30 '11 at 18:52\n\nAn answer using @kaiser's example, with a custom post type as a function accepting alpha start and end params. This example is obviously for a short list of items, as it does not include secondary paging. I'm posting it so you can incorporate the concept into your functions.php if you like.\n\n// Dr Alpha Paging\n// Tyrus Christiana, Senior Developer, BFGInteractive.com\n// Call like alphaPageDr( \"A\",\"d\" );\nfunction alphaPageDr( $start,$end ) {\necho \"Alpha Start\";\n$loop = new WP_Query( 'post_type=physician&orderby=title&order=asc' ); // Build an alphabet array of capitalized letters from params foreach ( range($start, $end ) as$letter )\n$alphabet[] = strtoupper($letter );\nif ( $loop->have_posts() ) { echo \"Has Posts\"; while ($loop->have_posts() ) : $loop->the_post(); // Filter by the first letter of the last name$first_last_name_letter = ( string ) substr( get_field( \"last_name\" ), 0, 1 );\nif ( in_array( $first_last_name_letter,$alphabet ) ) {\n//Show things\necho \"<img class='sidebar_main_thumb' src= '\" .\nget_field( \"thumbnail\" ) . \"' />\";\necho \"<div class='sidesbar_dr_name'>\" .\nget_field( \"salutation\" ) . \" \" .\nget_field( 'first_name' ) . \" \" .\nget_field( 'last_name' ) . \"</div>\";\necho \"<div class='sidesbar_primary_specialty ' > Primary Specialty : \" .\nget_field( \"primary_specialty\" ) . \"</div>\";\n}\nendwhile;\n}\n}\n\n\nHere is a way to do this by using the query_vars and posts_where filters:\n\npublic function range_add($aVars) {$aVars[] = \"range\";\nreturn $aVars; } public function range_where($where, $args ) { if( !is_admin() ) {$range = ( isset($args->query_vars['range']) ?$args->query_vars['range'] : false );\nif( $range ) {$range = split(',',$range);$where .= \"AND LEFT(wp_posts.post_title,1) BETWEEN '$range' AND '$range'\";\n}\n}\nreturn $where; } add_filter( 'query_vars', array('atk','range_add') ); add_filter( 'posts_where' , array('atk','range_where') ); This is not so much an answer, but more a pointer to a direction to take. This will probably have to be 100% custom - and will be very involved. You'll need to create a custom sql query (using the wpdb classs) and then for pagination you'll pass these parameters to your custom query. You'll probably need to also create new rewrite rules for this as well. Some functions to look into: add_rewrite_tag( '%byletter%', '([^/]+)'); add_permastruct( 'byletter', 'byletter' . '/%byletter%' );$wp_rewrite->flush_rules();" ]
[ null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.6093026,"math_prob":0.78201425,"size":2786,"snap":"2019-43-2019-47","text_gpt3_token_len":772,"char_repetition_ratio":0.18511862,"word_repetition_ratio":0.014423077,"special_character_ratio":0.34350324,"punctuation_ratio":0.17162472,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.964321,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2019-11-21T23:53:12Z\",\"WARC-Record-ID\":\"<urn:uuid:9ce5847e-0f05-47c4-9beb-adf1e09859e4>\",\"Content-Length\":\"169263\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:f82a6bbb-382e-4a52-9e3d-050cbfd2ff07>\",\"WARC-Concurrent-To\":\"<urn:uuid:1826a945-7ba4-4c24-97d7-8f93df7cf0d0>\",\"WARC-IP-Address\":\"151.101.129.69\",\"WARC-Target-URI\":\"https://wordpress.stackexchange.com/questions/18725/custom-pagination-for-custom-post-types-by-names\",\"WARC-Payload-Digest\":\"sha1:IA3V45W62QV6J65H3U4B63XJYWHAIW3G\",\"WARC-Block-Digest\":\"sha1:Y74YRIBGLNF3IQECUXZU6WNXZBQA3CIO\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2019/CC-MAIN-2019-47/CC-MAIN-2019-47_segments_1573496671053.31_warc_CC-MAIN-20191121231600-20191122015600-00534.warc.gz\"}"}
https://foreach.id/EN/fluids/flowratemass/ton_metric%7Cminute-to-megagram%7Csecond.html
[ "# Convert ton (metric)/minute to megagram/second (t/min to Mg/s)\n\nBatch Convert\n• megagram/second [Mg/s]\n• ton (metric)/minute [t/min]\nCopy\n_\nCopy\n• megagram/second [Mg/s]\n• ton (metric)/minute [t/min]\n\n## Ton (metric)/minute to Megagram/second (t/min to Mg/s)\n\n### Ton (metric)/minute (Symbol or Abbreviation: t/min)\n\nTon (metric)/minute is one of mass flow rate units. Ton (metric)/minute abbreviated or symbolized by t/min. The value of 1 ton (metric)/minute is equal to 16.667 kilogram/second. In its relation with megagram/second, 1 ton (metric)/minute is equal to 0.016667 megagram/second.\n\n#### Relation with other units\n\n1 ton (metric)/minute equals to 16.667 kilogram/second\n\n1 ton (metric)/minute equals to 16,667 gram/second\n\n1 ton (metric)/minute equals to 1,000,000 gram/minute\n\n1 ton (metric)/minute equals to 60,000,000 gram/hour\n\n1 ton (metric)/minute equals to 1,440,000,000 gram/day\n\n1 ton (metric)/minute equals to 1,000,000,000 milligram/minute\n\n1 ton (metric)/minute equals to 60,000,000,000 milligram/hour\n\n1 ton (metric)/minute equals to 1,440,000,000,000 milligram/day\n\n1 ton (metric)/minute equals to 1,000 kilogram/minute\n\n1 ton (metric)/minute equals to 60,000 kilogram/hour\n\n1 ton (metric)/minute equals to 1,440,000 kilogram/day\n\n1 ton (metric)/minute equals to 1.6667e-14 exagram/second\n\n1 ton (metric)/minute equals to 1.6667e-11 petagram/second\n\n1 ton (metric)/minute equals to 1.6667e-8 teragram/second\n\n1 ton (metric)/minute equals to 0.000016667 gigagram/second\n\n1 ton (metric)/minute equals to 0.016667 megagram/second\n\n1 ton (metric)/minute equals to 166.67 hectogram/second\n\n1 ton (metric)/minute equals to 1,666.7 dekagram/second\n\n1 ton (metric)/minute equals to 166,670 decigram/second\n\n1 ton (metric)/minute equals to 1,666,700 centigram/second\n\n1 ton (metric)/minute equals to 16,667,000 milligram/second\n\n1 ton (metric)/minute equals to 16,667,000,000 microgram/second\n\n1 ton (metric)/minute equals to 0.016667 ton (metric)/second\n\n1 ton (metric)/minute equals to 60 ton (metric)/hour\n\n1 ton (metric)/minute equals to 1,440 ton (metric)/day\n\n1 ton (metric)/minute equals to 66.139 ton (short)/hour\n\n1 ton (metric)/minute equals to 36.744 pound/second\n\n1 ton (metric)/minute equals to 2,204.6 pound/minute\n\n1 ton (metric)/minute equals to 132,280 pound/hour\n\n1 ton (metric)/minute equals to 3,174,700 pound/day\n\n### Megagram/second (Symbol or Abbreviation: Mg/s)\n\nMegagram/second is one of mass flow rate units. Megagram/second abbreviated or symbolized by Mg/s. The value of 1 megagram/second is equal to 1000 kilogram/second. In its relation with ton (metric)/minute, 1 megagram/second is equal to 60 ton (metric)/minute.\n\n#### Relation with other units\n\n1 megagram/second equals to 1,000 kilogram/second\n\n1 megagram/second equals to 1,000,000 gram/second\n\n1 megagram/second equals to 60,000,000 gram/minute\n\n1 megagram/second equals to 3,600,000,000 gram/hour\n\n1 megagram/second equals to 86,400,000,000 gram/day\n\n1 megagram/second equals to 60,000,000,000 milligram/minute\n\n1 megagram/second equals to 3,600,000,000,000 milligram/hour\n\n1 megagram/second equals to 86,400,000,000,000 milligram/day\n\n1 megagram/second equals to 60,000 kilogram/minute\n\n1 megagram/second equals to 3,600,000 kilogram/hour\n\n1 megagram/second equals to 86,400,000 kilogram/day\n\n1 megagram/second equals to 1e-12 exagram/second\n\n1 megagram/second equals to 1e-9 petagram/second\n\n1 megagram/second equals to 0.000001 teragram/second\n\n1 megagram/second equals to 0.001 gigagram/second\n\n1 megagram/second equals to 10,000 hectogram/second\n\n1 megagram/second equals to 100,000 dekagram/second\n\n1 megagram/second equals to 10,000,000 decigram/second\n\n1 megagram/second equals to 100,000,000 centigram/second\n\n1 megagram/second equals to 1,000,000,000 milligram/second\n\n1 megagram/second equals to 1,000,000,000,000 microgram/second\n\n1 megagram/second equals to 1 ton (metric)/second\n\n1 megagram/second equals to 60 ton (metric)/minute\n\n1 megagram/second equals to 3,600 ton (metric)/hour\n\n1 megagram/second equals to 86,400 ton (metric)/day\n\n1 megagram/second equals to 3,968.3 ton (short)/hour\n\n1 megagram/second equals to 2,204.6 pound/second\n\n1 megagram/second equals to 132,280 pound/minute\n\n1 megagram/second equals to 7,936,600 pound/hour\n\n1 megagram/second equals to 190,480,000 pound/day\n\n### How to convert Ton (metric)/minute to Megagram/second (t/min to Mg/s):\n\n#### Conversion Table for Ton (metric)/minute to Megagram/second (t/min to Mg/s)\n\nton (metric)/minute (t/min) megagram/second (Mg/s)\n0.01 t/min 0.00016667 Mg/s\n0.1 t/min 0.0016667 Mg/s\n1 t/min 0.016667 Mg/s\n2 t/min 0.033333 Mg/s\n3 t/min 0.05 Mg/s\n4 t/min 0.066667 Mg/s\n5 t/min 0.083333 Mg/s\n6 t/min 0.1 Mg/s\n7 t/min 0.11667 Mg/s\n8 t/min 0.13333 Mg/s\n9 t/min 0.15 Mg/s\n10 t/min 0.16667 Mg/s\n20 t/min 0.33333 Mg/s\n25 t/min 0.41667 Mg/s\n50 t/min 0.83333 Mg/s\n75 t/min 1.25 Mg/s\n100 t/min 1.6667 Mg/s\n250 t/min 4.1667 Mg/s\n500 t/min 8.3333 Mg/s\n750 t/min 12.5 Mg/s\n1,000 t/min 16.667 Mg/s\n100,000 t/min 1,666.7 Mg/s\n1,000,000,000 t/min 16,667,000 Mg/s\n1,000,000,000,000 t/min 16,667,000,000 Mg/s\n\n#### Conversion Table for Megagram/second to Ton (metric)/minute (Mg/s to t/min)\n\nmegagram/second (Mg/s) ton (metric)/minute (t/min)\n0.01 Mg/s 0.6 t/min\n0.1 Mg/s 6 t/min\n1 Mg/s 60 t/min\n2 Mg/s 120 t/min\n3 Mg/s 180 t/min\n4 Mg/s 240 t/min\n5 Mg/s 300 t/min\n6 Mg/s 360 t/min\n7 Mg/s 420 t/min\n8 Mg/s 480 t/min\n9 Mg/s 540 t/min\n10 Mg/s 600 t/min\n20 Mg/s 1,200 t/min\n25 Mg/s 1,500 t/min\n50 Mg/s 3,000 t/min\n75 Mg/s 4,500 t/min\n100 Mg/s 6,000 t/min\n250 Mg/s 15,000 t/min\n500 Mg/s 30,000 t/min\n750 Mg/s 45,000 t/min\n1,000 Mg/s 60,000 t/min\n100,000 Mg/s 6,000,000 t/min\n1,000,000,000 Mg/s 60,000,000,000 t/min\n1,000,000,000,000 Mg/s 60,000,000,000,000 t/min\n\n#### Steps to Convert Ton (metric)/minute to Megagram/second (t/min to Mg/s)\n\n1. Example: Convert 828 ton (metric)/minute to megagram/second (828 t/min to Mg/s).\n2. 1 ton (metric)/minute is equivalent to 0.016667 megagram/second (1 t/min is equivalent to 0.016667 Mg/s).\n3. 828 ton (metric)/minute (t/min) is equivalent to 828 times 0.016667 megagram/second (Mg/s).\n4. Retrieved 828 ton (metric)/minute is equivalent to 13.8 megagram/second (828 t/min is equivalent to 13.8 Mg/s).\n\n▸▸" ]
[ null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.6891006,"math_prob":0.9992331,"size":5993,"snap":"2021-21-2021-25","text_gpt3_token_len":2070,"char_repetition_ratio":0.35064286,"word_repetition_ratio":0.07634543,"special_character_ratio":0.40981144,"punctuation_ratio":0.13392857,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.96554625,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2021-06-24T00:17:23Z\",\"WARC-Record-ID\":\"<urn:uuid:873156ff-142d-4cf3-869c-5a5ecfd04c90>\",\"Content-Length\":\"58698\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:d8078c4b-ce4c-4a28-a584-7829ac594279>\",\"WARC-Concurrent-To\":\"<urn:uuid:f21131fc-a59e-4320-b8d1-8f8560478040>\",\"WARC-IP-Address\":\"172.67.130.66\",\"WARC-Target-URI\":\"https://foreach.id/EN/fluids/flowratemass/ton_metric%7Cminute-to-megagram%7Csecond.html\",\"WARC-Payload-Digest\":\"sha1:2OUBZKA6D6JBWNFLQ2OBEML2HUFF55SQ\",\"WARC-Block-Digest\":\"sha1:6RQEOMPNSUVTVMYCBRSJPVF5SV734IUX\",\"WARC-Identified-Payload-Type\":\"application/xhtml+xml\",\"warc_filename\":\"/cc_download/warc_2021/CC-MAIN-2021-25/CC-MAIN-2021-25_segments_1623488544264.91_warc_CC-MAIN-20210623225535-20210624015535-00510.warc.gz\"}"}
https://kr.mathworks.com/matlabcentral/cody/problems/155-all-your-base-are-belong-to-us/solutions/2271078
[ "Cody\n\n# Problem 155. All your base are belong to us\n\nSolution 2271078\n\nSubmitted on 11 May 2020 by Aron Frei\nThis solution is locked. To view this solution, you need to provide a solution of the same size or smaller.\n\n### Test Suite\n\nTest Status Code Input and Output\n1   Pass\nx = 1024; b = 2; y_correct = 10; assert(isequal(logb(x,b),y_correct))\n\nans = 10\n\n2   Pass\nx = 25; b = 5; y_correct = 2; assert(isequal(logb(x,b),y_correct))\n\nans = 2\n\n3   Pass\nx = 10000; b = 10; y_correct = 4; assert(isequal(logb(x,b),y_correct))\n\nans = 4" ]
[ null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.51025003,"math_prob":0.99705297,"size":456,"snap":"2020-34-2020-40","text_gpt3_token_len":165,"char_repetition_ratio":0.16814159,"word_repetition_ratio":0.0,"special_character_ratio":0.41885966,"punctuation_ratio":0.16666667,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9964381,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2020-08-06T22:32:08Z\",\"WARC-Record-ID\":\"<urn:uuid:2e43d40b-5693-4fcd-90dc-c129f6a505c4>\",\"Content-Length\":\"73287\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:6feeae5f-6124-4921-a752-98cbf4f8071c>\",\"WARC-Concurrent-To\":\"<urn:uuid:1b7bb3d9-bac7-48b3-a38f-11cc60dd4ec4>\",\"WARC-IP-Address\":\"23.223.252.57\",\"WARC-Target-URI\":\"https://kr.mathworks.com/matlabcentral/cody/problems/155-all-your-base-are-belong-to-us/solutions/2271078\",\"WARC-Payload-Digest\":\"sha1:7EJKV2EJ4O3FL3Y7KAVGFZYSNIP4DO3G\",\"WARC-Block-Digest\":\"sha1:D2VFXIKLN3KTGWICYYF6JUHMLO43R6RX\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2020/CC-MAIN-2020-34/CC-MAIN-2020-34_segments_1596439737039.58_warc_CC-MAIN-20200806210649-20200807000649-00357.warc.gz\"}"}
https://domainedevilotte.com/how-many-hundreds-are-in-50000-update-new/
[ "Home » How Many Hundreds Are In 50000? Update New\n\n# How Many Hundreds Are In 50000? Update New\n\nLet’s discuss the question: how many hundreds are in 50000. We summarize all relevant answers in section Q&A of website Domainedevilotte.com in category: Blog Technology. See more related questions in the comments below.\n\n## How many thousands is 50000?\n\nAnswer: 50 thousands are there in 50000.\n\n## How many hundreds are there in 52000?\n\nThere are 520 hundreds in 52,000.\n\n### How many hundreds in this number\n\nHow many hundreds in this number\nHow many hundreds in this number\n\n## How much is 50000?\n\n50,000 (fifty thousand) is the natural number that comes after 49,999 and before 50,001.\n\n50,000.\n← 49999 50000 50001 →\nCardinal fifty thousand\nOrdinal 50000th (fifty thousandth)\nFactorization 24 × 55\nGreek numeral\n\n## How many hundreds are there in 2000?\n\nThere are 20 hundreds in 2000.\n\n## How is 100 thousand written?\n\nOne Hundred Thousand in numerals is written as 100000.\n\n## How many hundreds are there in 54000?\n\n90 × 600 (54,000; 540 hundreds are in 54,000)\n\n## How many hundreds are there in 42000?\n\nHence there are 420 hundreds in 42000.\n\n## How do you read 52000?\n\n52000 in words is written as Fifty-Two Thousand.\n\n## How many hundreds are there in 423?\n\nAnswer: There are 4 hundreds in the 423.\n\n## How many hundreds are in a million?\n\n» Hundred Conversions:\n\nHundred↔Million 1 Million = 10000 Hundred.\n\n## How many hundreds are there in 7000?\n\n7000 is the same as 70 hundreds\n\nWhich pair of numbers have the same digit at the hundreds place?\n\n### Famous Dex – Japan (Prod. JGramm) [Official Lyric Video]\n\nFamous Dex – Japan (Prod. JGramm) [Official Lyric Video]\nFamous Dex – Japan (Prod. JGramm) [Official Lyric Video]\n\n## What is the English meaning of 50000?\n\n50000 in words is Fifty Thousand.\n\n## How much is 50000 in millions?\n\nSo you want to convert 50 thousands into millions? If you’re in a rush and just need the answer, the calculator below is all you need. The answer is 0.05 millions.\n\n## What is a third of 50000?\n\nPercentage Calculator: What is 3. percent of 50000? = 1500.\n\n## How many hundreds are there in 28000?\n\nNumber of hundreds in 28,000 are 280.\n\nHope it helps you.\n\n## How many hundreds are there in 6000?\n\nthere are 60 hundreds in 6000. so correct answer is ’60’ hundreds.\n\n## How many hundreds are there in 890?\n\nHence, the number of hundreds in 890 is 8.\n\n## What number is after 999999?\n\nOne million (1,000,000), or one thousand thousand, is the natural number after 999,999 and before 1,000,001.\n\n## How much is \\$100000.00 in words?\n\nTherefore, the number 100000 in words is One Hundred Thousand.\n\n## How do you write 12000000 in words?\n\n12000000 in words = twelve million\n\nAnd, you may also be interested in how to spell 15000000; check it out now!\n\n## How many hundreds are there in 56000?\n\n1.2560 hundreds are there in 2,56,000.\n\n### Rich Homie Quan – Flex (Ooh, Ooh, Ooh)\n\nRich Homie Quan – Flex (Ooh, Ooh, Ooh)\nRich Homie Quan – Flex (Ooh, Ooh, Ooh)\n\n## How many hundreds are there in 6729?\n\nAnswer. As 7 is there in the hundreds place.. Hope it helps.\n\n## How many hundreds are there in 4500?\n\n45 hundreds\n\n45*100=4,500.\n\nRelated searches\n\n• how many 100 dollar bills make 5000\n• what is 100 of 50000\n• how many hundreds are there in 60000\n• how many hundreds are there in 50000\n• 50000 divided by 100\n• how many 100 in 50000\n\n## Information related to the topic how many hundreds are in 50000\n\nHere are the search results of the thread how many hundreds are in 50000 from Bing. You can read more if you want.\n\nYou have just come across an article on the topic how many hundreds are in 50000. If you found this article useful, please share it. Thank you very much." ]
[ null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.89421076,"math_prob":0.8551793,"size":3416,"snap":"2022-27-2022-33","text_gpt3_token_len":957,"char_repetition_ratio":0.2587925,"word_repetition_ratio":0.09539474,"special_character_ratio":0.33811477,"punctuation_ratio":0.14325452,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9823691,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2022-08-10T14:00:58Z\",\"WARC-Record-ID\":\"<urn:uuid:6387be4a-96ac-4055-9f7f-ab4d205b6dfd>\",\"Content-Length\":\"109529\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:6fcc9420-bed6-4dd1-93d7-33afb7f1a695>\",\"WARC-Concurrent-To\":\"<urn:uuid:9c5ce222-bcc7-4899-b11d-6f485e7b9730>\",\"WARC-IP-Address\":\"104.21.75.236\",\"WARC-Target-URI\":\"https://domainedevilotte.com/how-many-hundreds-are-in-50000-update-new/\",\"WARC-Payload-Digest\":\"sha1:3VUHQTZIG3KJJPVWJQK2D5OZYZYAML5S\",\"WARC-Block-Digest\":\"sha1:VDQQGT5C6K2XUBJLT3AWZHVEF7LUGUVP\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2022/CC-MAIN-2022-33/CC-MAIN-2022-33_segments_1659882571190.0_warc_CC-MAIN-20220810131127-20220810161127-00098.warc.gz\"}"}
https://theuvocorp.com/a-using-the-two-upper-bounds-for-the-complementary-error-4/
[ "# A Using The Two Upper Bounds For The Complementary Error\n\nIn this problem we explore the approximations to the probability of an error, Pe, for the pair of antipodal signals shown in Figure in the presence of additive white Gaussian noise of power spectral density N0/2. The exact formula for Pe is Pe = ½ erfc (√Eb/N0). (This formula is derived in Section 6.3)\n\n(a) Using the two upper bounds for the complementary error function given in Note 3, derive the corresponding approximations to P.\n\n(b) Compare the approximations derived in part (a) for Pe to the exact formula for Eb/N0 = 9. For the exact calculation of Pe, you may use Table on the error function.", null, "", null, "Posted in Uncategorized" ]
[ null, "https://www.solutioninn.com/images2/19-E-T-E-C-S(339).PNG", null, "https://blueribbonwriters.com/wp-content/uploads/2020/01/order-supreme-essay.jpg", null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.86802685,"math_prob":0.95889515,"size":602,"snap":"2021-43-2021-49","text_gpt3_token_len":143,"char_repetition_ratio":0.12374582,"word_repetition_ratio":0.0,"special_character_ratio":0.23421927,"punctuation_ratio":0.084033616,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9977606,"pos_list":[0,1,2,3,4],"im_url_duplicate_count":[null,1,null,null,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2021-12-08T00:41:06Z\",\"WARC-Record-ID\":\"<urn:uuid:5c669385-c2d4-48ac-bda1-16db1432772f>\",\"Content-Length\":\"34556\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:3d4711f4-fb80-4ec1-a1e4-ba15e548f29a>\",\"WARC-Concurrent-To\":\"<urn:uuid:b1c72cd8-faec-4f39-b7ed-9961bd39614e>\",\"WARC-IP-Address\":\"192.64.113.86\",\"WARC-Target-URI\":\"https://theuvocorp.com/a-using-the-two-upper-bounds-for-the-complementary-error-4/\",\"WARC-Payload-Digest\":\"sha1:YNWNJQ7OCP7DYK6RMWYEKBV63CLTBHWJ\",\"WARC-Block-Digest\":\"sha1:DCAJAXTUVYQKHNU3F4PCLX7PO43ZY7DQ\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2021/CC-MAIN-2021-49/CC-MAIN-2021-49_segments_1637964363420.81_warc_CC-MAIN-20211207232140-20211208022140-00033.warc.gz\"}"}
https://www.arxiv-vanity.com/papers/1701.06118/
[ "arXiv Vanity renders academic papers from arXiv as responsive web pages so you don’t have to squint at a PDF. Read this paper on arXiv.org.\n\n# Numerical solution of space-fractional partial differential equations by a differential quadrature approach\n\nX. G. Zhu Y. F. Nie Department of Applied Mathematics, Northwestern Polytechnical University, Xi’ an 710129, P.R. China\n###### Abstract\n\nThis article aims to develop a direct numerical approach to solve the space-fractional partial differential equations (PDEs) based on a new differential quadrature (DQ) technique. The fractional derivatives are approximated by the weighted linear combinations of the function values at discrete grid points on problem domain with the weights calculated via using three types of radial basis functions (RBFs) as test functions. The method in presence is robust, straight forward to apply, and highly accurate under the condition that the shape parameters of RBFs are well chosen. Numerical tests are provided to illustrate its validity and capability.\n\n###### keywords:\nDQ method, RBFs, Fractional derivatives, Space-fractional PDEs.\njournal: Elsevier\n\n## 1 Introduction\n\nIn this study, we are mainly interested in an efficient method for numerically solving a class of space-fractional models in the following form\n\n ∂y(x,t)∂t−κ(x)∂αy(x,t)∂+xα−υ(x)∂αy(x,t)∂−xα=f(x,t),  x∈Λ,  0\n\nsubjected to the initial and boundary conditions\n\n y(x,0)=ψ(x),x∈Λ, (1.2) y(a,t)=g1(t),y(b,t)=g2(t),0\n\nwhere , , , are non-negative but do not vanish altogether. only when and only when . In Eq. (1.1), the space-fractional derivatives are defined in Caputo sense, i.e.,\n\n ∂αy(x,t)∂+xα =1Γ(2−α)∫xa∂2y(ξ,t)∂ξ2dξ(x−ξ)α−1, ∂αy(x,t)∂−xα =1Γ(2−α)∫bx∂2y(ξ,t)∂ξ2dξ(ξ−x)α−1,\n\nwith the Euler’s Gamma function .\n\nThe space-fractional PDEs describe many physical phenomena such as anomalous transport, hereditary elasticity, and chaotic dynamics Metzler and Klafter (2000); Rossikhin and Shitikova (1997); Zaslavsky (2002), while compared favorably to the integer PDEs. Since they are frequently sufficing in the absence of exact closed-form solutions, various numerical algorithms have been designed to solve them, typically including general Padé approximation Ding (2016), finite difference methods Meerschaert and Tadjeran (2006); Tian et al. (2015); Wang et al. (2010), meshless point interpolation method Liu et al. (2015), finite element methods Ervin and Roop (2006); Zhang et al. (2010), discontinuous Galerkin method Xu and Hesthaven (2014), finite volume method Hejazi et al. (2014), spline approximation method (SAM) Sousa (2011), RBF Kansa method Pang et al. (2015), polynomial and fractional spectral collocation methods Tian et al. (2014); Zayernouri and Karniadakis (2015). In Chen et al. (2010); Doha et al. (2014); Ren et al. (2013); Saadatmandi and Dehghan (2011), a series of operational matrix methods are constructed via the approximate expansions using shifted Jacobi, Chebyshev, Legendre polynomials, and Haar wavelets functions, as elements, respectively. Some analytic techniques are referred to Pandey et al. (2012); Ray (2009); Ray and Sahoo (2015); Yıldırım and Koçak (2009) and references therein.\n\nDQ method is understood as a direct numerical approach for PDEs that evaluates the derivatives via representative weighted linear combinations of function values on problem domain Bellman and Casti (1971). A group of test functions to calculate these weights can be chosen as Lagrange basis functions, RBFs, and orthogonal polynomials Chen et al. (1997); Quan and Chang (1989); Shu and Richards (1992); Wu and Shu (2002). DQ method is characterized by a few advantages such as high accuracy, low occupancy cost, truly mesh-free and the ease of programming.\n\nDue to the non-locality of fractional derivatives, a great extra computational cost is usually incurred when a conventional algorithm is applied to a fractional PDE. In this work, we propose a new RBFs based DQ method (RBF-DQM) for Eqs. (1.1)-(1.3). Using three types of RBFs as test functions, the weights are successfully determined and with them, the equation under consideration degenerates to an ordinary differential system (ODS). A time-stepping RBF-DQM is derived by introducing a difference scheme in time. The presented technique inherits the features of classic DQ methods. More importantly, it is insensitive to dimensional change, so it serves as a good alternative for the high-dimensional or the other complex fractional models arising in actual applications.\n\nThe outline is as follows. In Section 2, we give a brief description of fractional derivatives. In Section 3, the weighted coefficients are calculated by commonly used RBFs, which are required to approximate the fractional derivatives. We propose a Crank-Nicolson RBF-DQM to discretize the model problem in Section 4 and test its codes on three illustrative examples in Section 5. A conclusion is drawn in the last section.\n\n## 2 Fractional derivatives\n\nAt first, some basic definitions are introduced for preliminaries. Let ; then the following formulas\n\ndefine the left and right -th Caputo derivatives, respectively, if , where for , for , and is the floor function.\n\nThe left and right Caputo derivatives have the properties\n\nand coincide with classic derivatives with exactness to a multiplier factor :\n\n 0Dsxf(x)=∂sf(x)∂xs,∗xDsbf(x)=(−1)s∂sf(x)∂xs,\n\nwhere and . We refer the readers to Kilbas et al. (2006); Podlubny (1999) for more properties.\n\n## 3 DQ formulations based on RBFs\n\nIn the sequel, DQ formulations for fractional derivatives based on RBFs are derived. Define a lattice on but not necessarily with equally spaced points, i.e., , . In general, we always approximate the exact solution of a PDE like Eqs. (1.1)-(1.3) in the form\n\n y(x,t)≅M∑k=0δk(t)ϕk(x), (3.4)\n\nwith a set of proper basis functions . However, if\n\n ∂αϕk(xi)∂+xα =M∑j=0a(α)ijϕk(xj),  i,k=0,1,…M, (3.5) ∂αϕk(xi)∂−xα =M∑j=0b(α)ijϕk(xj),  i,k=0,1,…M, (3.6)\n\nand on acting , on both sides of Eq. (3.4), we realize that\n\n ∂αy(xi,t)∂+xα≅M∑k=0δk(t)∂αϕk(xi)∂+xα=M∑k=0δk(t)M∑j=0a(α)ijϕk(xj)≅M∑j=0a(α)ijy(xj,t), (3.7) ∂αy(xi,t)∂−xα≅M∑k=0δk(t)∂αϕk(xi)∂−xα=M∑k=0δk(t)M∑j=0b(α)ijϕk(xj)≅M∑j=0b(α)ijy(xj,t), (3.8)\n\nthanks to the linearity of the fractional derivatives, namely, Eqs. (3.7)-(3.8) are valid as along as Eqs. (3.5)-(3.6) are satisfied. The idea behind this is referred to as DQ Bellman and Casti (1971); , , , are called the weighted coefficients of fractional derivatives and will be calculated by means of typical RBFs.\n\n### 3.1 Three typical RBFs\n\nRBFs are the functions of the distance from their centers. They are popular as an effective tool to set up numerical algorithms for PDEs since the superiority of potential spectral accuracy. Here, commonly used RBFs are involved, i.e.,\n\n• Gaussians (GA):\n\nwhere , and is the shape parameter. It is worthy to note that the value should be well prescribed in computation because it has a significant impact on the approximation power of a RBFs based method.\n\n### 3.2 Weighted coefficients for fractional derivatives\n\nIn order to obtain the weighted coefficients of the left and right fractional derivatives, we substitute the RBFs into Eqs. (3.5)-(3.6) to get\n\n ∂αφk(xi)∂+xα =M∑j=0a(α)ijφk(xj),  i,k=0,1,…M, (3.9) ∂αφk(xi)∂−xα =M∑j=0b(α)ijφk(xj),  i,k=0,1,…M. (3.10)\n\nRewriting Eqs. (3.9)-(3.10) in a matrix-vector form for each grid point yields\n\n ⎛⎜ ⎜ ⎜ ⎜ ⎜⎝φ0(x0)φ0(x1)⋯φ0(xM)φ1(x0)φ1(x1)⋯φ1(xM)⋮⋮⋱⋮φM(x0)φM(x1)⋯φM(xM)⎞⎟ ⎟ ⎟ ⎟ ⎟⎠M⎛⎜ ⎜ ⎜ ⎜ ⎜ ⎜ ⎜⎝ω(α)i0ω(α)i1⋮ω(α)iM⎞⎟ ⎟ ⎟ ⎟ ⎟ ⎟ ⎟⎠=⎛⎜ ⎜ ⎜ ⎜ ⎜⎝Dαφ0(xi)Dαφ1(xi)⋮DαφM(xi)⎞⎟ ⎟ ⎟ ⎟ ⎟⎠Dαφ(xi), (3.11)\n\nwhere if whereas if , . M is the interpolation matrix only related to the nodal distribution, being nonsingular for MQ and fully positive definite for IM, GA Cheng (2012). One has\n\n M=⎛⎜ ⎜ ⎜ ⎜ ⎜ ⎜⎝ϵ√(x1−x0)2+ϵ2⋯√(xM−x0)2+ϵ2√(x0−x1)2+ϵ2ϵ⋯√(xM−x1)2+ϵ2⋮⋮⋱⋮√(x0−xM)2+ϵ2√(x1−xM)2+ϵ2⋯ϵ⎞⎟ ⎟ ⎟ ⎟ ⎟ ⎟⎠,\n\nin particular, when MQ RBFs are adopted.\n\nThere are clearly no explicit expressions for , ; fortunately, they can be approximated by numerical quadrature rules. Taking the transforms , of variables, respectively, reaches to\n\n ∂αφk(xi)∂+xα ∂αφk(xi)∂−xα\n\nA close examination reveals that both of the two formulas are the special cases of the following weakly singular integral, i.e.,\n\n ∫1−1(1−ζ)λ(1+ζ)μf(ζ)dζ,λ, μ>−1,\n\nwith , that can be handled by Gauss-Jacobi quadrature rules. , are then determined by solving Eqs. (3.11) for each and the fractional derivatives are removed from a fractional PDE by using Eqs. (3.7)-(3.8) as replacements, thus we obtain the required solution by solving a ODS instead.\n\n## 4 A time-stepping RBF-DQM for fractional PDEs\n\nIn this section, a RBF-DQM of fully discretization is derived for the space-fractional PDEs via the above direct approximations for fractional derivatives. Define a lattice on with equally spaced points , , . On substituting the weighted sums (3.7)-(3.8) into Eq. (1.1), we have\n\n ∂y(xi,t)∂t−κ(xi)M∑j=0a(α)ijy(xj,t)−υ(xi)M∑j=0b(α)ijy(xj,t)=f(xi,t),  i=0,1,⋯,M,\n\nactually being a first-order ODS. Also, denote , , for brevity. Imposing the associated constraints (1.2)-(1.3) and rewriting the ODS in matrix-vector form, a time-stepping RBF-DQM is then derived by introducing a Crank-Nicolson scheme in time, given as\n\n (I−τκA+υB2)Yn=(I+τκA+υB2)Yn−1+τHn−1/2, (4.12)\n\nwhere I is an identity matrix, , , , and A, B, are as follows\n\nwith , . We perform the procedures on the nodal distribution , , . An detailed implementation of RBF-DQM is summarized in the following flowchart\n\n• Input , , , , and allocate , .\n\n• Form M, compute by Gauss-Jacobi quadrature rules, and solve Eqs. (3.11) for each so that the weighted coefficients are found.\n\n• Do a loop from to to solve Eqs. (4.12) for each by forming A, B first and output the desirable approximation at each time step.\n\n## 5 Illustrative examples\n\nIn this part, the proposed methods, termed as MQ-DQM, IM-DQM, and GA-DQM hereinafter, are studied on three numerical examples. The shape parameter should be adjusted with the grid number , so we select for MQ, for IM, and for GA, tentatively, by references to Fasshauer (2002); Franke (1982); Xiang and Wang (2009). The numerical errors are all defined in -norm and the fractional derivatives are computed with 16 quadrature points and weights, whose values corresponding to are given as reference in A.\n\nExample 5.1. Approximate by Eq. (3.7) on with the above , whose explicit expression is , where is the hypergeometric function. The numerical results are tabulated in Table 1. As observed, the approximation improves as increases, which implies that the DQ approximations for the fractional derivatives are valid. Moreover, under the given , GA-DQM seems to be more efficient than MQ-DQM and IM-DQM.\n\nExample 5.2. Let , and ; we solve Eqs. (1.1)-(1.3) on with zero initial-boundary conditions. Table 2 displays the numerical results at when and . From the table, we find that sufficiently small errors can be achieved by MQ-DQM, IM-DQM, and GA-DQM even if a few spatial grid points are utilized and all the methods are obviously convergent by taking their own , respectively.\n\nExample 5.3. Let , , and ; we solve Eqs. (1.1)-(1.3) on with , , and . The numerical errors of SAM Sousa (2011) and our methods at are reported in Table 3, when and . It is observed from the table that MQ-DQM, IM-DQM, and GA-DQM outperform SAM in term of computational accuracy.\n\n###### Remarks 5.1.\n\nWhen is fixed, the value is crucial to the accuracy of a RBFs based method, so is RBF-DQM. A general trade-off principle demanding attention is that one can adjust to decrease the approximate errors, but need to pay for this by increasing the condition number of the interpolation matrix which may cause an algorithm to be instable Schaback (1995), so a good that balances both the accuracy and stability is anticipated in practice. Nevertheless, how to select an optimal value is technical and is being an issue deserving to investigate.\n\n## 6 Conclusion\n\nIn this research, an efficient DQ method is proposed for the space-fractional PDEs of Caputo type based on commonly used RBFs as test functions, which enjoys some properties such as high accuracy, flexibility, truly meshless, and the simplicity in implementation. Its codes are tested on three benchmark examples and the outcomes manifest that it is capable of dealing with these problems if the free parameters are well prepared. Due to its insensitivity to dimensional change, our method has potential advantages over traditional methods in finding the approximate solutions to the high-dimensional fractional equations.\n\nAcknowledgement: This research was supported by National Natural Science Foundations of China (No.11471262 and 11501450).\n\n## References\n\n• Bellman and Casti (1971) R. Bellman, J. Casti, Differential quadrature and long-term integration, J. Math. Anal. Appl. 34 (1971) 235–238.\n• Chen et al. (1997) W. Chen, A.G. Striz, C.W. Bert, A new approach to the differential quadrature method for fourth-order equations, Int. J. Numer. Meth. Eng. 40 (1997) 1941–1956.\n• Chen et al. (2010) Y.M. Chen, Y.B. Wu, Y.H. Cui, Z.Z. Wang, D.M. Jin, Wavelet method for a class of fractional convection-diffusion equation with variable coefficients, J. Comput. Sci. 1 (2010) 146–149.\n• Cheng (2012) A.H.D. Cheng, Multiquadric and its shape parameter–A numerical investigation of error estimate, condition number, and round-off error by arbitrary precision computation, Eng. Anal. Bound. Elem. 36 (2012) 220–239.\n• Ding (2016) H.F. Ding, General Padé approximation method for time-space fractional diffusion equation, J. Comput. Appl. Math. 299 (2016) 221–228.\n• Doha et al. (2014) E.H. Doha, A.H. Bhrawy, D. Baleanu, S.S. Ezz-Eldien, The operational matrix formulation of the Jacobi tau approximation for space fractional diffusion equation, Adv. Differ. Equ. 2014 (2014) 231.\n• Ervin and Roop (2006) V.J. Ervin, J.P. Roop, Variational formulation for the stationary fractional advection dispersion equation, Numer. Meth. Part. D. E. 22 (2006) 558–576.\n• Fasshauer (2002) G.E. Fasshauer, Newton iteration with multiquadratics for the solution of nonlinear PDEs, Comput. Math. Appl. 43 (2002) 423–438.\n• Franke (1982) R. Franke, Scattered data interpolation: tests of some methods, Math. Comp. 38 (1982) 181–200.\n• Hejazi et al. (2014) H. Hejazi, T. Moroney, F.W. Liu, Stability and convergence of a finite volume method for the space fractional advection-dispersion equation, J. Comput. Appl. Math. 255 (2014) 684–697.\n• Kilbas et al. (2006) A.A. Kilbas, H.M. Srivastava, J.J. Trujillo, Theory and Applications of Fractional Differential Equations, Elsevier B. V., Amsterdam, 2006.\n• Liu et al. (2015) Q. Liu, F.W. Liu, Y.T. Gu, P.H. Zhuang, J. Chen, I. Turner, A meshless method based on Point Interpolation Method (PIM) for the space fractional diffusion equation, Appl. Math. Comput. 256 (2015) 930–938.\n• Meerschaert and Tadjeran (2006) M.M. Meerschaert, C. Tadjeran, Finite difference approximations for two-sided space-fractional partial differential equations, Appl. Numer. Math. 56 (2006) 80–90.\n• Metzler and Klafter (2000) R. Metzler, J. Klafter, The random walk’s guide to anomalous diffusion: A fractional dynamics approach, Phys. Rep. 339 (2000) 1–77.\n• Pandey et al. (2012) R.K. Pandey, O.P. Singh, V.K. Baranwal, M.P. Tripathi, An analytic solution for the space-time fractional advection-dispersion equation using the optimal homotopy asymptotic method, Comput. Phys. Commun. 183 (2012) 2098–2106.\n• Pang et al. (2015) G.F. Pang, W. Chen, Z.J. Fu, Space-fractional advection-dispersion equations by the Kansa method, J. Comput. Phys. 293 (2015) 280–296.\n• Podlubny (1999) I. Podlubny, Fractional Differential Equations, Academic Press, 1999.\n• Quan and Chang (1989) J.R. Quan, C.T. Chang, New insights in solving distributed system equations by the quadrature method–I. Analysis, Comput. Chem. Eng. 13 (1989) 779–788.\n• Ray (2009) S.S. Ray, Analytical solution for the space fractional diffusion equation by two-step Adomian Decomposition Method, Commun. Nonlinear Sci. Numer. Simul. 14 (2009) 1295–1306.\n• Ray and Sahoo (2015) S.S. Ray, S. Sahoo, Analytical approximate solutions of Riesz fractional diffusion equation and Riesz fractional advection-dispersion equation involving nonlocal space fractional derivatives, Math. Method. Appl. Sci. 38 (2015) 2840–2849.\n• Ren et al. (2013) R.F. Ren, H.B. Li, W. Jiang, M.Y. Song, An efficient Chebyshev-tau method for solving the space fractional diffusion equations, Appl. Math. Comput. 224 (2013) 259–267.\n• Rossikhin and Shitikova (1997) Y.A. Rossikhin, M.V. Shitikova, Applications of fractional calculus to dynamic problems of linear and nonlinear hereditary mechanics of solids, Appl. Mech. Rev. 50 (1997) 15–67.\n• Saadatmandi and Dehghan (2011) A. Saadatmandi, M. Dehghan, A tau approach for solution of the space fractional diffusion equation, Comput. Math. Appl. 62 (2011) 1135–1142.\n• Schaback (1995) R. Schaback, Error estimates and condition numbers for radial basis function interpolation, Adv. Comput. Math. 3 (1995) 251–264.\n• Shu and Richards (1992) C. Shu, B.E. Richards, Application of generalized differential quadrature to solve two-dimensional incompressible Navier-Stokes equations, Int. J. Numer. Meth. Fluids 15 (1992) 791–798.\n• Sousa (2011) E. Sousa, Numerical approximations for fractional diffusion equations via splines, Comput. Math. Appl. 62 (2011) 938–944.\n• Tian et al. (2014) W.Y. Tian, W.H. Deng, Y.J. Wu, Polynomial spectral collocation method for space fractional advection-diffusion equation, Numer. Meth. Part. D. E. 30 (2014) 514–535.\n• Tian et al. (2015) W.Y. Tian, H. Zhou, W.H. Deng, A class of second order difference approximations for solving space fractional diffusion equations, Math. Comp. 84 (2015) 1703–1727.\n• Wang et al. (2010) H. Wang, K.X. Wang, T. Sircar, A direct finite difference method for fractional diffusion equations, J. Comput. Phys. 229 (2010) 8095–8104.\n• Wu and Shu (2002) Y.L. Wu, C. Shu, Development of RBF-DQ method for derivative approximation and its application to simulate natural convection in concentric annuli, Comput. Mech. 29 (2002) 477–485.\n• Xiang and Wang (2009) S. Xiang, K.M. Wang, Free vibration analysis of symmetric laminated composite plates by trigonometric shear deformation theory and inverse multiquadric RBF, Thin. Wall. Struct. 47 (2009) 304–310.\n• Xu and Hesthaven (2014) Q.W. Xu, J.S. Hesthaven, Discontinuous Galerkin method for fractional convection-diffusion equations, SIAM J. Numer. Anal. 52 (2014) 405–423.\n• Yıldırım and Koçak (2009) A. Yıldırım, H. Koçak, Homotopy perturbation method for solving the space-time fractional advection-dispersion equation, Adv. Water Resour. 32 (2009) 1711–1716.\n• Zaslavsky (2002) G.M. Zaslavsky, Chaos, fractional kinetics, and anomalous transport, Phys. Rep. 371 (2002) 461–580.\n• Zayernouri and Karniadakis (2015) M. Zayernouri, G.E. Karniadakis, Fractional spectral collocation methods for linear and nonlinear variable order FPDEs, J. Comput. Phys. 293 (2015) 312–338.\n• Zhang et al. (2010) H. Zhang, F. Liu, V. Anh, Galerkin finite element approximation of symmetric space-fractional partial differential equations, Appl. Math. Comput. 217 (2010) 2534–2545." ]
[ null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.8098322,"math_prob":0.96839243,"size":18625,"snap":"2020-24-2020-29","text_gpt3_token_len":5304,"char_repetition_ratio":0.14478277,"word_repetition_ratio":0.010909091,"special_character_ratio":0.3174765,"punctuation_ratio":0.21430436,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9965891,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2020-07-02T13:26:27Z\",\"WARC-Record-ID\":\"<urn:uuid:c7f1aa67-a0d4-4c8f-b408-491c1b228900>\",\"Content-Length\":\"557826\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:19cf11da-7bd1-4c65-9b94-b08532fc519e>\",\"WARC-Concurrent-To\":\"<urn:uuid:6f0bacf7-7ee2-42e8-ab21-cc9ee2f653ce>\",\"WARC-IP-Address\":\"104.28.20.249\",\"WARC-Target-URI\":\"https://www.arxiv-vanity.com/papers/1701.06118/\",\"WARC-Payload-Digest\":\"sha1:VJ3EYSKFPV5JIIW2YI7HM7EKNWWIH3EQ\",\"WARC-Block-Digest\":\"sha1:SOATB2SKE35WOFL5UIJ64A2XBP4NAWAY\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2020/CC-MAIN-2020-29/CC-MAIN-2020-29_segments_1593655878753.12_warc_CC-MAIN-20200702111512-20200702141512-00181.warc.gz\"}"}
https://answers.everydaycalculation.com/divide-fractions/3-42-divided-by-2-6
[ "Solutions by everydaycalculation.com\n\n## Divide 3/42 with 2/6\n\n3/42 ÷ 2/6 is 3/14.\n\n#### Steps for dividing fractions\n\n1. Find the reciprocal of the divisor\nReciprocal of 2/6: 6/2\n2. Now, multiply it with the dividend\nSo, 3/42 ÷ 2/6 = 3/42 × 6/2\n3. = 3 × 6/42 × 2 = 18/84\n4. After reducing the fraction, the answer is 3/14\n\nMathStep (Works offline)", null, "Download our mobile app and learn to work with fractions in your own time:" ]
[ null, "https://answers.everydaycalculation.com/mathstep-app-icon.png", null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.77565414,"math_prob":0.98030674,"size":332,"snap":"2022-27-2022-33","text_gpt3_token_len":166,"char_repetition_ratio":0.21646342,"word_repetition_ratio":0.0,"special_character_ratio":0.5060241,"punctuation_ratio":0.056818184,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9686116,"pos_list":[0,1,2],"im_url_duplicate_count":[null,null,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2022-07-05T08:37:03Z\",\"WARC-Record-ID\":\"<urn:uuid:d87317ef-2f28-4856-a765-a6d16e84a6c7>\",\"Content-Length\":\"7853\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:2751c420-f4f3-468a-9137-c3c14e4b27a5>\",\"WARC-Concurrent-To\":\"<urn:uuid:dd489718-eba4-47f6-9fe3-95631423d432>\",\"WARC-IP-Address\":\"96.126.107.130\",\"WARC-Target-URI\":\"https://answers.everydaycalculation.com/divide-fractions/3-42-divided-by-2-6\",\"WARC-Payload-Digest\":\"sha1:QB7JRVOMP6T5HLIQE3K3HYI7OCWKJVXK\",\"WARC-Block-Digest\":\"sha1:T6W2BC5MNWLMBKHNWSBI25EGOHEJ6Y2W\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2022/CC-MAIN-2022-27/CC-MAIN-2022-27_segments_1656104542759.82_warc_CC-MAIN-20220705083545-20220705113545-00007.warc.gz\"}"}
https://www.uregina.ca/science/mathstat/research/areas-expertise.html
[ "# Areas of Expertise\n\nA list of the general research areas of Department faculty is below. Further information about an individual faculty member may be found on that person's webpage.\n\n### Actuarial Mathematics\n\n• Dr. T. Bae (Financial mathematics, risk management)\n• Prof. P. Douglas (Applied stochastic modelling)\n• Prof. J.-P. Venter (Actuarial Science, Financial mathematics and investment theory, enterprise risk management, stochastic survival models)\n\n### Algebra, Discrete Mathematics, and Number Theory\n\n• Dr. S. Fallat (Linear algebra, combinatorial matrix theory)\n• Dr. A. Herman (Group theory, representation theory, algebraic combinatorics)\n• Dr. K. Meagher (Combinatorics and algebraic graph theory)\n• Dr. R. McIntosh (Computational number theory, q- hypergeometric series, mock theta functions)\n• Dr. S. A. Mojallal* (Spectral graph theory, matrix theory)\n• Dr. F. Szechtman (Group theory, Lie algebras, representation theory, linear algebra)\n• Dr. P. Vishwakarma* (Matrix analysis and positivity preservers, totally nonnegative matrices, and inverse eigenvalue problem for graphs)\n\n### Statistics and Probability Theory\n\n• Dr. D. Deng (Limit theory, generalized linear models)\n• Dr. M. Kozdron (Probability, stochastic processes, statistical physics)\n• Dr. A. Volodin (Statistical inference, limit theorems, distributions on abstract spaces, bootstrap)\n• Dr. Y. Zhao (Applied statistics and biostatistics)\n\n* Postdoctoral Fellow (PIMS)    ** Postdoctoral Fellow" ]
[ null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.72627157,"math_prob":0.89669853,"size":2258,"snap":"2022-05-2022-21","text_gpt3_token_len":575,"char_repetition_ratio":0.14773735,"word_repetition_ratio":0.0,"special_character_ratio":0.22010629,"punctuation_ratio":0.24020888,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9862994,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2022-05-25T22:07:22Z\",\"WARC-Record-ID\":\"<urn:uuid:ecd5e98f-2da4-4d43-8e2a-2d006a7ed3c3>\",\"Content-Length\":\"13627\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:0c688007-16d2-456b-9126-294d58c7d598>\",\"WARC-Concurrent-To\":\"<urn:uuid:5ac7a8dd-c445-472e-9738-7326e24f76ed>\",\"WARC-IP-Address\":\"142.3.152.9\",\"WARC-Target-URI\":\"https://www.uregina.ca/science/mathstat/research/areas-expertise.html\",\"WARC-Payload-Digest\":\"sha1:34HVIRIIXYVACNNEWY6YQKQMO6JRXWUO\",\"WARC-Block-Digest\":\"sha1:HDDZK4WIHNH6NJEPH3I4NIHTLFEZXQQ6\",\"WARC-Identified-Payload-Type\":\"application/xhtml+xml\",\"warc_filename\":\"/cc_download/warc_2022/CC-MAIN-2022-21/CC-MAIN-2022-21_segments_1652662594414.79_warc_CC-MAIN-20220525213545-20220526003545-00468.warc.gz\"}"}
https://www.mdpi.com/1996-1073/15/23/8924
[ "", null, "Font Type:\nArial Georgia Verdana\nFont Size:\nAa Aa Aa\nLine Spacing:\nColumn Width:\nBackground:\nArticle\n\n# Improved Thermal Performance of a Serpentine Cooling Channel by Topology Optimization Infilled with Triply Periodic Minimal Surfaces\n\n1\nInstitute of Turbomachinery, School of Mechanical Engineering, Shanghai Jiao Tong University, Shanghai 200240, China\n2\nDepartment of Mechanical Engineering and Science, Kyoto University, Kyoto 615-8540, Japan\n*\nAuthor to whom correspondence should be addressed.\nEnergies 2022, 15(23), 8924; https://doi.org/10.3390/en15238924\nReceived: 6 October 2022 / Revised: 21 October 2022 / Accepted: 26 October 2022 / Published: 25 November 2022\n(This article belongs to the Special Issue New Insights of Gas Turbine Cooling Systems)\n\n## Abstract\n\n:\nThe present study utilizes a density-based topology optimization method to design a serpentine channel under turbulent flow, solving a high pressure loss issue and enhancing heat transfer capability. In the topology optimization, the kε turbulence model is modified by adding penalization terms to reveal turbulence effects. Heat transfer modeling is included by setting the modified energy equation with additional terms related to topology optimization. The main objective is to minimize pressure loss while restricting heat transfer. The 2D simplified model is topologically optimized. Then, the optimal solution with intermediate results is extruded in the 3D system and interpreted with triply periodic minimal surfaces (TPMS) to further enhance heat transfer performance. Compared to the baseline serpentine channel, the optimized model infilled with the diamond-TPMS structure lowers pressure loss by 30.8% and significantly enhances total heat transfer by up to 45.8%, yielding thermal performance of 64.8% superior to the baseline. The temperature uniformity is also improved. The simulation results show that the curvatures in the optimized model with diamond-TPMS structure eliminate the large recirculation flow and low heat transfer regions. This model diminishes the effect of Dean’s vortices but promotes high turbulent kinetic energy, leading to better uniform flow and heat transfer distributions.\n\n## 1. Introduction\n\nApplications of a multipass cooling channel under turbulent flow and heat transfer enhancement themes can be found in an internal cooling gas turbine blade, microelectronic cooling, etc. Generally, the serpentine channel is a standard internal cooling scheme in practical turbine blades, effectively utilizing the coolant in the midchord region [1,2]. However, complicated flow fields induced by sharp turns after bend regions cause a nonuniform flow distribution. Rao et al. have reported that the turning regions cause more than 90% of the total pressure drop of the multipass channel. These phenomena in the serpentine channels result in highly nonuniform-flow heat transfer and high pressure loss, decreasing overall thermal performance. Therefore, it is desirable to design multipass channels that generate a lower-pressure loss while maintaining the total heat transfer and achieving better uniformity.\nIn order to control the flow field and heat transfer distribution in serpentine channels, placing the turning guide vane at the bend region is a common method that has been examined in several previous studies. Schüler et al. and Guo et al. investigated experimentally and numerically different turning guide vane designs in the multipass channel. They found that the pressure loss was reduced by about 13.4%–48.4% when using the turning guide vanes, but the heat transfer deteriorated. Similarly, Lei et al. observed that the pressure loss was largely reduced when installing the turning vane, yet heat transfer decreased because the flow separation was suppressed. This design process was based on a trial-and-error method. To achieve low pressure loss while maintaining total heat transfer in a serpentine cooling channel, various geometrical parameters were varied, causing a cost- and time-consuming design process.\nAlternatively, optimization methods can speed up and ease the designs. Layout optimization is usually divided into size, shape and topology optimization (TO). Size and shape optimizations have been used to minimize pressure loss and enhance thermal performance in heat exchangers. The results reveal that the optimal design significantly reduces the pressure drop and achieves higher thermal efficiency than the original model . However, it is observed that the design process only adjusts the positions of points or boundaries of the channel to obtain the objective functions without changing the topology of the structure. Moreover, since additive manufacturing is rapidly developed, which can compete for limitations to produce relatively complex geometries, the size and shape optimizations cannot completely exploit this manufacturing scheme’s potential. Meanwhile, finding the optimal shapes and optimizing the topology of channels can be obtained simultaneously through topology optimization. Additionally, free-form and efficient geometries can be generated, satisfying solutions for additive manufacturing. Therefore, topology optimization is a more general design method than size and shape optimizations .\nTopology optimization has been employed in different design systems covered by various disciplines. It has been well developed and affirmed widely due to competitive designs in cost and functionality under various constraints [8,9,10,11,12,13,14]. Several methods, such as the homogenization approach, the evolutionary technique, the level-set and the density approach, have been developed for implementation.\nAmong topology optimization schemes, the density-based method has gained more popularity . In the comparisons of Manuel et al. , the density-based approach yields better outcomes for most cases in terms of iteration numbers. Additionally, the density method merits rapid convergence and weak dependence on the initial guess [8,16]. Furthermore, it could be highlighted that no prior research has considered turbulent flow systems except the density-based method. The key idea of the density-based method is the penalized interpolation function, which continuously forces fictitious porous cells, including fluid and solid, to be fluid or solid subdomains. A comprehensive review and its general formulation of topology optimization can be found in previous work . Here, a brief overview of the density-based topology optimization applied in recent research on thermofluid systems is shown in Table 1.\nAs highlighted in Table 1, most previous studies are 2D models with a steady-state laminar flow regime. The FEM is the most implemented discretization method since the topology optimization initiates from solid mechanics. Moreover, it is easier for the discrete adjoint scheme to manage the FEM .\nNevertheless, only limited works on turbulent flow topology optimization have been studied, which is primarily needed in most industrial flow applications, e.g., a turboshaft engine’s turbine blade serpentine cooling channels. Several works employed a frozen turbulence assumption to simplify sensitivity analysis for the topology optimization of turbulent flows [23,24]. However, as the frozen turbulence neglects the effect of porosity in the turbulent viscosity calculation, the optimized model negatively affects the accuracy. The shortcomings of this assumption have been presented by Dilgen et al. .\nRecently, study of the turbulence effects in the topology optimization for turbulent flow has appeared. Dilgen et al. optimized many 2D and 3D complex flow channels using Spalart–Allmaras and kω turbulence models, where k denotes turbulent kinetic energy and ω is the specific dissipation rate. The results showed that the generated structure in a U-bend channel significantly reduced the pressure drop across the channel. Later, Yoon proposed the topology optimization with the FEM using the kε turbulence model, where ε is the turbulent energy dissipation. However, it is noted that the energy equation for topology optimization has not yet been found, and convective heat transfer optimization has not yet been explored in those studies.\nEven though topology optimization is an efficient tool for generating complex structures, it still causes some problems. The results of density-based topology optimization may convert a number of intermediate densities. This type of conversion causes pressure maldistribution in the cooling channel between the design and its realization by additive manufacturing, which could not explore the full performance of the optimized structure. To overcome the issues, the solid domain of the optimized model, including the intermediate results, can be fulfilled with a graded lattice structure. This method has been observed to help manage the intermediate densities in the conventional topology optimization, reduce the structure’s weight, and preserve the original design structure ; however, this approach is rarely applied to cooling channel applications.\nAmong complex lattice structures, the repeating network, called triply periodic minimal surface (TPMS), has attracted much research interest due to its compact and significant thermal properties. Additionally, the TPMS is a self-supporting structure, which has been observed to present better mechanical performance than other strut-based lattice structures . The TPMS networks have also shown better heat transfer performance in cooling channels than the lattice-frame material due to a smoother surface and larger wetted area . The TPMS, with its complex and interconnected structures, provided consistent fluid streamlines, promoting permeation . Moreover, many previous works have found that the TPMS structures considerably increase heat transfer with reasonably increased pressure loss, improving the thermal performance of the cooling channel [31,32,33].\nThis work proposes an optimized design to minimize pressure and increase heat transfer, improving the thermal performance of a serpentine cooling channel. The density-based topology optimization for the thermofluid problem under turbulent flow is firstly utilized to minimize the pressure loss while maintaining heat transfer in the serpentine cooling channel of a turbine blade. The turbulence effects are revealed by adding penalization terms in the kε turbulence model programmed by COMSOL. The functions to activate/deactivate the convective and conduction terms in the modified energy equation are also included to account for the heat transfer modeling in the topology optimization. Three-dimensional (3D) serpentine models with the TPMS structures are obtained by infilling the TPMS structures in the solid domain and the intermediate density resulted from the conventional topology optimization. The final models are resimulated in ANSYS FLUENT to show elaborated flow structure, pressure loss and heat transfer advantages over the baseline and the channel generated from the conventional topology optimization. By infilling the TPMS structures in the conventional topology optimization, the intermediate result is eliminated, the original channel structure is preserved, and the heat transfer is further increased due to the complex structure and large wetted area of the TPMS.\n\n## 2. Serpentine Model\n\n#### 2.1. Model Description\n\nThe design model is inspired by an internal cooling channel of a turboshaft heat exchanger. The channel dimension of the numerical model in this work is consistent with the experimental serpentine cooling channel for a turbine blade with short passes, studied by Guo et al. . Figure 1 illustrates the three-short-pass serpentine channel for (a) a full-scale 3D model and (b) a simplified 2D design. Each channel pass has a cross-section of 120 mm × 60 mm, yielding a hydraulic diameter (Dh) of 80 mm and an aspect ratio (AR) of 2.0. The length of all the straight passages is 245 mm, resulting in a length-to-hydraulic diameter of 3.06. Before entering the heating section, entrance and exit sections extended with a length of 300 mm are created at the channel inlet and outlet, respectively. The first turning region is designed as a rectangular shape with an inner radius of 20 mm since this region near the tip of the turbine blade suffers from a high heat load, which needs a large heat transfer area to cool. Meanwhile, the second bend near the blade platform receives a lower heat load; hence it is designed as an arc shape with outer and inner diameters of 140 and 20 mm, to reduce the total pressure loss in the channel .\nTypically, the topology optimization requires hundreds of iterations to reach the convergence of the final optimal design. Hence, to save the cost of obtaining the optimized design, the 2D design simplified from the original 3D model is firstly used in this work [19,20,21], as demonstrated in Figure 1b. An inlet boundary condition (Γin) is set as uniform velocity (Uin) with a prescribed temperature (Tin). The inlet velocity is defined based on the experimental Reynolds number (Re), as follows:\n$R e = ρ U i n D h μ$\nwhere ρ is fluid density and μ is dynamic viscosity.\nAn outlet boundary condition (Γout) is set as a zero static pressure (p0). The boundary condition of the heating surfaces on the top and bottom is imposed with uniform heat flux (q0). The remaining walls are thus set as no-slip conditions (Γwall) to surround the serpentine channel. Figure 1b also shows the design domains, in which all the heating regions inside design domains (Ωid) are evolved. Meanwhile, the extended entrance and exit of the channel set as outside design domains (Ωod) are not considered for optimization.\n\n#### 2.2. Thermofluid Modeling\n\nPrevious works have considered an incompressible flow for thermofluid topology optimization to design turbine blade cooling channels . Moreover, it has been observed that when the Mach number is less than 0.3, the deviation of the compressible and incompressible flow can be neglected. Since the maximum bulk velocity of air in the channel is lower than 15 m/s, the Mach number is less than 0.1, then incompressible and steady-state flow are assumed throughout this work.\n\n#### 2.2.1. Fluid-Flow Modeling\n\nThe continuity equation and Navier–Stokes equation assuming the incompressible steady fluid are expressed as follows:\n$ρ ∇ ⋅ u = 0$\n$ρ ( u ⋅ ∇ ) u = ∇ ⋅ [ - p I + ( μ + μ T ) ( ∇ u + ( ∇ u ) * ) ] + F$\nwhere u indicates the fluid velocity vector; $∇$ signifies the gradient operator; p denotes the pressure field; I is the identical tensor; μT is the turbulent dynamic viscosity; * is the transpose; and F represents the Brinkman friction term introduced by Borrvall and Petersson , calculated from Equation (4). Here, the body force is not exerted on the fluid outside the design domain (F = 0 in Ωod).\n$F = − [ ( α u , max − α u , min ) I u ( γ ) + α u , min ] u$\nwhere αu,max is the maximum inverse permeability of the porous medium, while αu,min is the minimum one. Iu(γ) denotes the inverse permeability interpolated function stated in Section 3.1.\nFrom Equation (5), αu,max can be defined depending on Darcy number (Da):\n$α u , max = μ D a ⋅ D h 2$\n\n#### 2.2.2. Turbulence Modeling\n\nAs the topology optimization progressively evolves the design domain to allow material distribution, modifying the turbulence model is also necessary. In the present work, the authors modify the standard kε model in COMSOL by adding penalty terms to reveal the effects of turbulence on the serpentine cooling channel for topology optimization, which is modified as follows:\n$ρ ( u ⋅ ∇ ) k = ∇ ⋅ [ ( μ + μ T σ k ) ∇ k ] + P k − ρ ε − α k ( γ ) ( k − k 0 )$\n$ρ ( u ⋅ ∇ ) ε = ∇ ⋅ [ ( μ + μ T σ ε ) ∇ ε ] + C ε 1 ε k P k − C ε 2 ρ ε 2 k − α ε ( γ ) ( ε − ε 0 )$\nThe closure coefficients and all parameters in Equations (6) and (7) are described as follows:\n$μ T = ρ C μ k 2 ε , P k = μ T [ ∇ u : ( ∇ u + ( ∇ u ) * ) ] , C ε 1 = 1.44 , C ε 2 = 1.92 , σ k = 1 , σ ε = 1$\nwhere Pk signifies the turbulent kinetic energy source term.\nThe last terms in Equations (6) and (7) are augmented to enforce k and ε to k0 and ε0 for the solid regions in the design domain. They are defined as follows :\n$α k ( γ ) ( k − k 0 ) = [ ( α k , max − α k , min ) I k ( γ ) + α k , min ] ( k − k 0 )$\n$α ε ( γ ) ( ε − ε 0 ) = [ ( α ε , max − α ε , min ) I ε ( γ ) + α ε , min ] ( ε − ε 0 )$\nwhere αk,max and αε,max are the maximum limits of the penalization for k and ε, respectively, while αk,min and αε,min are the minimum ones. Ik(γ) and Iε) are material interpolated functions in both Equations (8) and (9). Here, the values of αk,min, αε,min, k0 and ε0 are assigned to zero, while the value of αk,max and αε,max are set equal to the value of αu,max. The material interpolations are detailed in Section 3.1.\n\n#### 2.2.3. Heat Transfer Modeling\n\nThe thermal convection–diffusion equation outside the design domain is given as follows:\n$ρ c f u ∇ T - ∇ ⋅ ( k f ∇ T ) = 0$\nwhere cf denotes the fluid heat capacity, kf indicates the fluid thermal conductivity and T is the temperature field in the serpentine channel.\nIn the design domain, as the distribution of the fluid and solid domains is determined after the optimization, the authors build up the energy equation by adding the functions to control the convective and conduction terms as follows:\n$ρ c f I c ( γ ) u ∇ T - ∇ ⋅ ( k f I K ( γ ) ∇ T ) = q 0$\nwhere Ic(γ) is the function used to activate/deactivate the convective term for fluid (Ic(γ) = 1) and solid (Ic(γ) = 0). IK(γ) is used to interpolate between the thermal conductivity of the fluid and the thermal conductivity of the solid (ks). Lastly, the term q0 indicates the constant bottom wall heat flux.\nIt should be noted that q0 is the uniform heat flux applied to the heating boundaries in the 2D model. Additionally, the energy equation is weakly coupled to the fluid flow problem to obtain u; then, it substitutes the energy equation to solve T. Furthermore, the Reynolds number and heat flux applied in this work are fixed at Re = 10,000 and q0 = 1500 W/m2, respectively, because varying the velocity or the heat input in the topology optimization could change the topology of the structure in the final result [11,14].\n\n## 3. Optimization Procedures\n\nThe procedure for obtaining the optimized model with lattice structures in this study is depicted in Figure 2. Firstly, the 2D simplified model, shown in Figure 1b, is topologically optimized using the boundary conditions and governing equations described in Section 2. The optimal solid domain, including the intermediate densities, is then extruded into the 3D model and interpreted with the TPMS structures. Finally, the final designs are recalculated for comparison.\n\n#### 3.1. Topology Optimization\n\nIn this section, the details of the topology optimization process to obtain the 2D optimized structure are presented.\n\n#### 3.1.1. Material Distribution\n\nThe material distribution in the density-based method described by the design variable (γ) takes a value between 0 and 1 at any point in the design domain. Here, γ = 1 denotes free flow in the channel, while γ = 0 is solid regions. The discrete 0/1 problem is relaxed to use gradient-based methods. As the material distribution takes intermediate values (0 ≤ γ ≤ 1), this relaxation requires the interpolation of transition areas. The interpolations of the fluid flow equation in the design domain are expressed in Equations (12)–(14):\n$I u ( γ ) = q u 1 − γ q u + γ$\n$I k ( γ ) = q k 1 − γ q k + γ$\n$I ε ( γ ) = q ε 1 − γ q ε + γ$\nwhere qu, qk and qε are tuning parameters to control the function curvature.\nFor the thermal convection and conductivity, the interpolation terms Ic(γ) and IK(γ) are calculated using solid isotropic material penalization (SIMP) in Equations (15) and (16), respectively:\n$I c ( γ ) = γ n c + ( 1 − γ n c ) δ$\n$I K ( γ ) = γ n K + ( 1 − γ n K ) k s k f$\nwhere nc and nK are penalization power coefficients; δ is fixed at δ = 10−15 to avoid numerical problems when solving Equation (11) .\n\n#### 3.1.2. Problem Formulation\n\nIn this study, minimizing the pressure loss is set as the objective function (J), while the heat transfer across the serpentine channel is constrained. In minimizing the pressure loss for the cooling channel, the power dissipation within the volume is generally selected to proceed in the optimization process since it shows the flow fluctuation in the considered domain. It provides robust convergence, and better flow uniformity can be expected when minimizing this function [11,12]. The power dissipation is expressed as follows:\n$J = ∫ Ω [ ( μ + μ T ) ( ∇ u + ( ∇ u ) * ) : ∇ u + α u ⋅ u ] d Ω$\nIn prior works, the temperature through the boundary has been defined as another objective function to maximize heat transfer . This function represents the temperature gain of fluid across the channel. Since the majority of the previous work has observed that the use of the turning vanes deteriorated the heat transfer [4,5,6], the temperature constraint (C) is thus employed to restrict the heat transfer in the present work. It is written as follows:\n$C = ∫ Γ out T ( u ⋅ n ) d Γ out$\nHere, Γout is the outlet boundary, and n is the normal vector. With this expression, the heat transfer in the channel can be constrained (g) as follows:\n$g = C C r e f − 1 ≥ 0$\nwhere Cref is the reference value calculated from the conventional serpentine channel.\nHence, the mathematical optimization model is written in Equation (20):\n$g = ∫ Γ out T ( u ⋅ n ) d Γ o u t ≥ C r e f$\n$0 ≤ γ ( x ) ≤ 1 , ∀ x ∈ Ω i d$\nwhere S is the vectors with discrete state fields, R indicates the residual vector function evaluated from the discretization of the governing equations, g represents inequality constraints and x denotes the design variable vector.\n\n#### 3.1.3. Density Filter and Projection\n\nDuring the iterative process, the design variable changes independently in each cell, causing a large difference value of the design variables in the adjacent cells. In the present optimization, a partial differential equation filter is adopted to mitigate such phenomena, which is defined as follows:\n$− R min 2 ∇ 2 γ f + γ f = γ$\nwhere γf signifies a smoothed design variable. Rmin is a filter radius calculated by = 1.5 × maximum mesh size in the considered domain.\nAdditionally, a projection technique, which projects the design variable into either 0 or 1, is adopted to mitigate the intermediate results. Here, a smoothed Heaviside projection is applied as follows:\n$γ p = tanh ( β η ) + tanh ( β ( γ f − η ) ) tanh ( β η ) + tanh ( β ( 1 − η ) )$\nwhere γp is the projected design variable, β is a parameter used to control the steepness of the projection, and η denotes the projection threshold, fixed at η = 0.5 in this study.\n\n#### 3.1.4. Summary of Topology Optimization Process\n\nThe present study uses COMSOL Multiphysics to run the topology optimization process. The flow chart of the topology optimization process is demonstrated in Figure 3. After the design variables and the parameters are initialized, the governing equations are solved to attain physical variable fields. The objective and the constraint functions are then computed. If the convergence criterion is not achieved, the sensitivity is computed by the adjoint method to obtain the gradient information. The design variable field is then updated using GCMMA and regularized. When the constraint is achieved, and the relative change in the objective is less than 10−4, or after every 100 iterations, the optimization proceeds to the next continuation steps. The continuation approach is used to avoid the low-quality local minima result and ease the convergence in this optimization process . Eventually, the optimization is considered to be completed when all the continuation steps are computed.\n\n#### 3.2. Infilling Lattice Structures\n\nAfter obtaining the 2D optimized model, the optimal solid domain within the channel, including intermediate results generated by the conventional topology optimization, is extruded into the 3D model and replaced by TPMS structures. The TPMS networks are used to infill the extruded optimized model with a range of thickness according to the optimal density results. Here, the diamond and gyroid-sheet structures, as shown in Figure 4, are chosen to replace the solid domains and intermediate results of the extruded optimized model due to their excellent thermal performance [31,32,33]. The final designs are then recomputed.\n\n## 4. Results and Discussion\n\nIn this section, two main parts are presented. For the topology optimization, the problem setup and 2D simplified model validation are detailed in the first part. The optimal density distribution in the 2D optimized model is extruded into the 3D domain and fulfilled with the TPMS structures. The final designs are then recalculated and validated in the second part. The pressure drop, heat transfer and temperature uniformity are compared with the baseline serpentine channels.\n\n#### 4.1.1. Validation of the 2D Model\n\nSince the 3D channel is simplified into the 2D model to reduce the computational cost for topology optimization, the accuracy of the stated variable field obtained from 2D calculations should be satisfied . Air and copper are selected in this work for fluid and solid properties for the simulation. The boundary conditions and governing equations explained in Section 2 are used to compute the flow, turbulence effect and heat transfer. It should be marked that in COMSOL, the out-of-plane heat flux (q0) in the 2D model is equivalent to the uniform heat flux boundary in the 3D system.\nThe mesh system of the 2D and 3D models is demonstrated in Figure 5. It is suggested that the boundary layer mesh evolves during the optimization for the accurate turbulence calculation, or the mesh should be fine enough to obtain accurate and reliable results. The extra-fine mesh setting at 42,468 elements, containing mainly triangle element type, is thus generated for all 2D models, as shown in Figure 5a. Meanwhile, for the 3D model, the tetrahedral mesh is generated, and the boundary layer mesh with a prism shape is employed in the wall regions. The fine mesh system is selected at 2.38 million elements, as shown in Figure 5b.\nTo verify the discrepancy between the 2D and 3D models, averaged values of the pressure, velocity and temperature at 12 different positions are plotted in Figure 6. In all 2D cases, the results are averaged from 12-cut lines, whereas in all 3D cases, the outcomes are extracted from the planes, then averaged. Overall, the 2D results have similar trends to the 3D ones for all variables. The pressure values in Figure 6a and velocity magnitudes in Figure 6b for the 2D model are lower than in the 3D model, while the temperature values in Figure 6c are opposite. The 2D model overestimates the temperature by about 0.4%–2.5%, and the average error value is 1.6%. The temperature discrepancy between the 2D and 3D models can attribute to the limitation of a pseudo-3D model, which has also been observed in several investigations [13,19]. However, the temperature distributions that slightly decreased along the channel path are well estimated, providing similar trends among them. The variations can be acceptable for the optimization process. Therefore, comparing results with the 3D numerical model, the 2D model can be accurately employed to perform topology optimization in this work.\n\n#### 4.1.2. Optimized Structure\n\nThe initial design is a uniform density field of γ0 = 0.6. The model is evaluated through the continuation parameters, as given in Table 2, to find the optimal structure. After the simulation, the design converges to the optimized structure, as presented in Figure 7. It can be noticed that the model leaves the intermediate fields to satisfy the temperature constraint by distributing the material in the channel. The intermediate results are due to the high conductivity difference between the copper and air used in this work . For the 2D optimized design, the total pressure loss between inlet and outlet boundaries decreases by about 33.9% compared to the original 2D model, while the constraint temperature in the channel is maintained.\nThe optimal density distribution within the 2D optimized channel, including intermediate results generated by conventional topology optimization, is extracted with ranges of density filtering from 0.1 to 0.9 and extruded into the 3D model, as shown in Figure 8a. The TPMS structures are then used to infill with a range of thickness between 2–4 mm. The lowest thickness of 2 mm is specified at the density filtering of 0.9, and the thickness is increased accordingly, reaching the highest thickness of 4 mm at the density filtering of 0.1, as demonstrated in Figure 8b. The thickness range is selected based on the printable capability in an actual scale of the cooling channel for a gas turbine blade. Here, the single unit cell size of the diamond- and gyroid-sheet structures is 120 × 120 × 120 mm3.\n\n#### 4.2. 3D Model Comparisons\n\nIn this section, the optimized model extracted with a density filtering of 0.5 (TO model) is also included to compare with the baseline channel. All models and the boundary conditions are shown in Figure 9. These models are applicable at the Reynolds number Re = 10,000 and heat flux q0 = 1500 W/m2 according to the design settings in the conventional topology optimization, as mentioned in Section 2. For all cases, the channel dimensions are consistent with the baseline serpentine channel, as described in Figure 1a. The inlet and outlet boundaries are the same as the baseline channel. Here, the red zones are treated by the uniform heat flux, including the top, bottom and extruded areas from the optimization and TPMS structures. The remaining surfaces are set as no-slip walls.\nThe flow and heat transfer for all models in this section are simulated using the commercial CFD solver ANSYS FLUENT 18.0, which provides lower computational costs and consumes lesser computer memory for 3D complex cooling channels than COMSOL. The overview of mesh systems for the optimized model with the diamond-sheet structure is demonstrated as an example in Figure 10. The hybrid mesh involving tetrahedron and prism elements is created to discretize the entire domain. The tetrahedron meshes are finely dense in the small- and high-curvature regions, while the boundary layer meshes with a prism shape are used near the no-slip walls. The meshes near the wall are refined to ensure that y+ values are less than one.\n\n#### 4.2.1. 3D Model Validation\n\nFor the validation, the conventional three-short-pass smooth channel investigated by Guo et al. is used as the referee design. The SIMPLEC algorithm is utilized for the pressure–velocity coupling, and the second-order upwind method is adopted. The convergence criterion is less than 10−4 for the continuity, velocity and turbulence quantities and less than 10−6 for the energy equation .\nThree sets of the meshes at 4.95, 7.31 and 11.6 million elements are simulated to check mesh independence for the baseline channel. The numerical results are steady and converge to a certain value as the mesh elements increase. The grid convergence index (GCI) is evaluated using the spanwise-averaged surface temperature to estimate the numerical accuracy of the mesh at 7.31 million, as demonstrated in Figure 11. The line denotes the highest mesh solution, while the red bars represent the error. It is found that the maximum error of the samples is less than 0.5%, and the overall GCI value on the spanwise-averaged temperature is about 0.1%, which indicates that the numerical results are independent of the meshes. Therefore, the mesh element is selected at 7.31 million for the baseline serpentine channel, while this mesh setting is also used for the other models.\nIn order to select the turbulence model with the highest accuracy, several Reynolds-averaged Navier–Stokes equations (RANS), i.e., SST kω, realizable kε and RNG kε, are executed and compared with the baseline serpentine channel. SST means the shear stress transport turbulence model, and RNG denotes renormalization group methods. Here, the globally averaged Nusselt number of each pass ($N u ¯ ¯$) is used to compare the heat transfer with the experimental data from Guo et al. . It can be evaluated as follows:\n$N u ¯ ¯ = Q t o t A w Δ T D h k f$\nwhere Qtot denotes the total heat transfer, Aw is the wetted area, and ΔT signifies the log mean temperature difference of the heating wall, calculated as follows:\n$Δ T = ( T w − T i n ) − ( T w − T o u t ) ln ( T w − T i n T w − T o u t )$\nwhere Tw is the average wall temperature, while Tin and Tout are the inlet and outlet fluid temperatures.\nThe globally averaged Nusselt number simulated from different turbulence models for the baseline serpentine channel at the Reynolds number of 10,000 is shown in Figure 12. It should be noted that Guo et al. have found that the SST kω turbulence model could accurately simulate the heat transfer of the three-pass channel with ribs. This is because the SST kω turbulence model captures well the reattachment flow from the ribbed walls. However, in this work, SST kω and RNG kε considerably overestimates the results in the second pass by 25.9% and 21.4%, respectively. Meanwhile, the average Nusselt number simulated using realizable kε agrees well with the experimental results for all smooth passages due to correctly predicting the large recirculation flow. The mean error deviates by about 10.7% compared to the experimental data. Hence, the realizable kε turbulence model with enhanced wall treatment is selected to simulate all models in this study.\n\n#### 4.2.2. Pressure Loss\n\nThe relative pressure coefficient (Cp) is employed to characterize the pressure loss from different models. The relative pressure coefficient along the channel flow path is calculated as follows:\n$C p = p l o c − p r e f ρ U i n 2 / 2$\nwhere ploc is the local static pressure at measuring points and pref indicates the pressure value at the channel inlet.\nThe relative pressure coefficient at three different locations at the Reynolds number of 10,000 is demonstrated in Figure 13. In the first pass, as the structure for all models is the same without changing from the baseline channel, the values are comparable because the coolant flows smoothly with minor flow resistance. The losses are higher when the coolant enters the second and third passes. Here, the baseline serpentine channel causes the highest losses, followed by the TO model with the gyroid-TPMS structure. In contrast, the TO model provides the lowest values, which are lower than the baseline model by 14.5% and 44.3% for the second and third passages.\nThe friction factor calculated to compare the total pressure loss in the channel can be expressed as follows:\n$f = 2 Δ p D h ρ U i n 2 L$\nwhere Δp is calculated from the pressure at the inlet boundary minus the pressure at the outlet boundary. L is the total length of the serpentine cooling channel.\nThe friction factor for all models at the Reynolds number of 10,000 is compared in Figure 14. All cases cause lower friction loss than the baseline channel, and the TO model provides the lowest value. It can be observed that the TO model with diamond- and TO model with gyroid-TPMS structures cause slightly higher friction loss than the TO model attributed to their complex curvatures. Compared to the baseline channel, the TO model, TO model with diamond- and TO model with gyroid-TPMS structures show a friction loss reduction of 38.0%, 30.8% and 19.0%, respectively.\n\n#### 4.2.3. Heat Transfer\n\nThe globally average Nusselt number, including two turning regions, at the Reynolds number of 10,000 is presented in Figure 15. It is evident that all topology optimization models provide higher heat transfer than the baseline channel, particularly in the TO model with the diamond-TPMS structure. This result is because the heat transfer is constrained during the optimization, and the heat transfer is further increased when interpreting the intermediate results with the TPMS structures. The globally averaged Nusselt number in the TO model, TO model with diamond- and TO model with gyroid-TPMS structures are higher than in the baseline channel by about 9.6%, 21.1% and 17.6%, respectively.\nThe total Nusselt number ($N u ¯ ¯ t o t$) presents the total heat transfer performance based on the flat base heating area. The total Nusselt number includes the heat transfer contribution from all wetted surfaces, as the total heat transfer is experienced by the turbine blade’s suction and pressure walls, and it is calculated as follows:\n$N u ¯ ¯ t o t = N u ¯ ¯ ( A w A h )$\nwhere Ah is the flat heated area.\nIt is noted that the total wetted area of the TO model, TO model with diamond- and TO model with gyroid-TPMS structures are increased by 8.5%, 15.6% and 13.3% compared to the baseline channel. The total Nusselt number at the Reynolds number of 10,000 is shown in Figure 16. The total Nusselt number is higher than the globally averaged Nusselt number, particularly in the TO model with the diamond-TPMS structure. This substantial increase is because the diamond-sheet structure has a larger contact area than the TO model curvature and the gyroid-sheet structure. The total Nusselt number for the TO model, TO model with diamond- and TO model with gyroid-TPMS structures increases by 25.3%, 45.8% and 36.6%, respectively, compared to the baseline channel.\nTo show the heat transfer enhancements in the serpentine channel, the Dittus–Boelter equation is employed to normalize the globally averaged and total Nusselt numbers, defined as follows:\n$N u ¯ ¯ 0 = 0.023 R e 0.8 P r 0.4$\nwhere Pr is the Prandtl number, and the value of Pr for the air in this study is 0.7.\nThe globally averaged and total heat transfer enhancements at the Reynolds number of 10,000 are presented in Figure 17a,b, respectively. The enhanced heat transfer is observed for all models since the serpentine channels generate high heat transfer, particularly from the first turning region. Among the comparative models, the heat transfer enhancement is more evident for the TO model with diamond-TPMS structure since this model considerably increases total heat transfer in the channel.\n\n#### 4.2.4. Thermal Performance\n\nTo compare the thermal performance of the serpentine cooling channel, the heat transfer performance requires an assessment after involving friction loss. In this study, the thermal performance of the serpentine channels can be calculated as follows:\n$T P = N u ¯ ¯ t o t / N u ¯ ¯ 0 ( f / f 0 ) 1 / 3$\nwhere f0 is the Blasius correlation, defined in Equation (30):\n$f 0 = 0.316 R e − 0.25$\nThe thermal performance for all cases at the Reynolds number 10,000 is presented in Figure 18. It is evident that the baseline serpentine channel shows the lowest thermal performance due to causing the highest pressure loss and lowest heat transfer in the channel. Meanwhile, the TO model with the diamond-TPMS structure exhibits the highest value because the optimized curvatures help minimize the pressure loss in the serpentine channel, while the diamond-sheet structure enhances high heat transfer. The thermal performance for the TO model, TO model with diamond- and TO model with gyroid-TPMS structures improves by 47.0%, 64.8% and 46.5%, respectively, compared to the baseline channel.\n\n#### 4.2.5. Temperature Uniformity\n\nThe high temperature difference between leading and trailing surfaces generated in the gas turbine channel is observed when the channel rotates at high speed [1,2]. It is essential to be concerned about the temperature uniformity that affects the temperature difference on the surface. The uniformity index of temperature (θ) is introduced in this section to determine surface temperature uniformity. It can be calculated as follows:\n$θ = 1 − ∑ i = 1 n | T i − T a v g | 2 T a v g A h$\nwhere Ti denotes the local temperature, and Ai is the local area. Tavg is the average temperature of the considered region, calculated as follows:\n$T a v g = 1 A p ∑ i = 1 n T i A i$\nThe uniformity index of surface temperature for all serpentine channels at the Reynolds number of 10,000 is presented in Figure 19. In the first pass, all cases exhibit comparable values, while the uniformities drastically decrease in the second pass for the baseline model. These negative results are due to the strong turning effect at the first rectangular bend, causing nonuniform flow distribution throughout the second pass . However, the uniformities are improved in the TO model, TO model with diamond- and TO model with gyroid-TPMS structures owing to the curvatures that manipulate smoother flow distributions. For all optimized models, the temperature uniformity on the surface improves by about 4.5%–5.6% in the second passage and 0.4%–2.0% in the third passage, superior to the baseline channel.\nIn short, the optimized model infilled with the diamond-sheet structure shows the best thermal performance because it provides low pressure loss and enhances the highest heat transfer. This structure also improves the temperature uniformity throughout the channel compared to the baseline model. Therefore, this study selects the TO model with diamond-TPMS structure as the optimal serpentine channel.\n\n#### 4.3. Detailed Flow and Heat Transfer Characteristics of the Optimal Serpentine Channel\n\nAccording to the analysis of the pressure loss, heat transfer and temperature uniformity in Section 4.2, the optimized serpentine channel with diamond-sheet structure is selected to be the optimal model, and the detailed flow and heat transfer characteristics are demonstrated and compared to the baseline serpentine channel.\n\n#### 4.3.1. Flow Characteristics\n\nThe velocity distributions and streamlines on the middle section (Z = 30 mm) of the serpentine channel at the Reynolds number of 10,000 are shown in Figure 20 for (a) the baseline channel and (b) the TO model with diamond-TPMS structure. It is clearly seen that for the baseline serpentine channel, the large recirculation flow is generated at the second bend region and third passage. The high velocity can be observed at the outer wall of the third passage. These phenomena cause nonuniform distribution of the flow. Meanwhile, the recirculation flow in the TO model with the diamond-TPMS structure is eliminated, as seen in Figure 20b. The curvature in this model induces the coolant to flow near the inner wall of the second passage. The flow in the diamond-sheet structure is also distributed evenly, leading to a more uniform velocity distribution throughout the channel.\nThe pressure distribution on the middle section of the channel at the Reynolds number of 10,000 is demonstrated in Figure 21 for (a) the baseline model and (b) the TO model with diamond-TPMS structure. For the baseline channel, the high-pressure loss emerges in the two bend regions, which could be attributed to the generation of the Dean’s vortices . However, after inserting the diamond-sheet structure into the optimized serpentine channel, the pressure loss is significantly reduced. It can be observed that the pressure loss is reduced, particularly in the second passage inside the diamond-sheet structure, and the area of low pressure continues to the third passage. The TO model with the diamond-TPMS structure manipulates the fluid well, reducing the recirculation flow, which lowers the total pressure loss in the serpentine channel.\nThe flow mechanisms and turning effects can be discussed with the dimensionless turbulent kinetic energy (TKE/Uin2) and streamlines on different cross-sections of the serpentine channel, as presented in Figure 22. For both models, the turbulent kinetic energy and streamlines exhibit the same characteristics in the first passage. The higher turbulent kinetic energy values can be observed in the second and third passages.\nFor the baseline model, as shown in Figure 22a, the Dean’s vortices can be observed on the outer wall when the fluid enters the second passage on plane B3. These vortices are prominent in plane B2, while the fluid mixes at the end of the second passage, resulting in high turbulent kinetic energy in the middle region. The coolant turning into the third passage further increases the turbulent kinetic energy and continues until it leaves the channel, as seen on planes C1–C3. Even though the strong mixing flow could enhance high heat transfer, this effect causes substantial differences in the flow distribution, eventually leading to non-uniform heat transfer in the channel.\nFor the TO model with the diamond-TPMS structure, as shown in Figure 22b, the Dean’s vortices at the inner wall, as found in the baseline model, are diminished because the large solid volume of the diamond-sheet structure distributes the flow in the second passage, as demonstrated on planes B3–B1. However, the high turbulent kinetic energy areas can be observed. The main coolant is forced to flow along the curvature of the diamond-sheet structure, intensifying high turbulent kinetic energy. Moreover, the complex flow generated inside the diamond-sheet structure expands large regions of high turbulence. The turbulent kinetic energy in the third passage is also more uniform than in the baseline model. These phenomena in the TO model with the diamond-TPMS structure lead to higher heat transfer and better uniformity than in the baseline channel.\n\n#### 4.3.2. Heat Transfer Characteristics\n\nThe local Nusselt number (Nu) is employed to analyze the surface heat transfer. The local Nusselt number is evaluated from the local heat transfer coefficient based on the local wall heat flux and the local temperature difference between the wall and the corresponding fluid bulk temperatures. The Nusselt number contour at the Reynolds number of 10,000 is illustrated in Figure 23 for (a) the baseline model and (b) the TO model with diamond-TPMS structure. For the baseline channel, as presented in Figure 23a, it can be clearly seen that the low Nusselt number region near the inner wall of the second passage is considerably expanded due to the large recirculation flow. However, this low heat transfer disappears in the TO model with diamond-TPMS structure, particularly in the second passage, as shown in Figure 23b. The high-value areas can also be observed inside the diamond-sheet structure because the curved interconnected walls generate impingement flow on the surface, as shown in the enlarged view. The average heat transfer at the second passage increases by 69.8% compared to the baseline model. Moreover, as the recirculation flow is eliminated due to the curvature of the diamond-sheet structure in the second and third passages of the TO model with diamond-TPMS structure, more uniform distributions of high heat transfer can be observed. The uniform heat transfer distributions are beneficial to mitigate the local thermal stress in the gas turbine blade.\n\n## 5. Conclusions\n\nIn this work, the concept of density-based topology optimization is utilized to design the serpentine cooling channel under turbulent flow. In the topology optimization, the penalization terms are added to the kε turbulence model to reveal the turbulence effects. The functions to activate/deactivate the convective and conduction terms in the energy equation are also carried out. The main objective is to minimize the pressure drop while maintaining heat transfer. The 2D simplified models are topologically optimized. The optimized solution, including the intermediate results, is then extruded into the 3D system and infilled with TPMS structures. The final models are resimulated and validated to compare with the baseline serpentine channel. The main conclusions are drawn as follows:\n• The conventional topology optimization model achieves a lower pressure loss and provides higher heat transfer than the baseline channel. Infilling the diamond- and gyroid-sheet structures in the optimal solution, including the intermediate results of the conventional topology optimization model, further enhance high heat transfer and maintains lower pressure loss than the baseline channel.\n• The 3D optimized models with the TPMS structures provide lower pressure loss by about 19.0%–30.8% and higher total heat transfer by 36.6%–45.8%, compared to the 3D baseline channel. The optimized mode infilled with the diamond-TPMS structure is selected as the optimal serpentine channel in this study since it provides the best thermal performance, up to 64.8%, superior to the baseline channel. The temperature uniformity on the surface is also improved, particularly in the second passage.\n• The 3D optimized model with the diamond-TPMS structure significantly eliminates the recirculation flow and the low heat transfer regions at the second and third passages. This model also reduces the influence of Dean’s vortices but maintains high turbulence kinetic energy, leading to better uniform flow and heat transfer distributions.\nOverall, the method in this work provides an advanced tool to manage the intermediate results in the conventional topology optimization of turbulent flow and heat transfer systems. Complex structures generated by this approach can be fabricated with additive manufacturing. Even though the present optimization models could be employed at a specific Reynolds number and heat input, this method can be applied to design cooling channels at higher Reynolds numbers and different cooling channel shapes, achieving higher thermal performance for gas turbine blades, heat sinks for high-power electronics, etc.\n\n## Author Contributions\n\nConceptualization, K.Y. and Y.R.; methodology, K.Y., L.Y. and H.L.; software, K.Y. and H.L.; validation, K.Y., Y.R. and L.Y.; formal analysis, K.Y. and Y.R.; investigation, K.Y. and H.L.; resources, Y.R.; data curation, K.Y.; writing—original draft preparation, K.Y.; writing—review and editing, K.Y., Y.R., L.Y. and H.L.; visualization, K.Y., Y.R., L.Y. and H.L.; supervision, Y.R. and L.Y.; project administration, Y.R.; funding acquisition, Y.R. All authors have read and agreed to the published version of the manuscript.\n\n## Funding\n\nThis research was funded by the National Science and Technology Major Project, grant number 2017-III-0009-0035 and the National Natural Science Foundation of China, grant numbers 11972230 and 51676119.\n\n## Conflicts of Interest\n\nThe authors declare no conflict of interest.\n\n## Nomenclature\n\n Ah Flat heated area (m2) Ai Local area (m) Aw Wetted area (m2) AR Aspect ratio of the channel C Constraint function cf Fluid heat capacity (J/(kg K)) Cp Relative pressure coefficient Cref Reference value in constraint function Da Darcy number Dh Hydraulic diameter of the channel (m) F Fictitious body-force (N/m3) f Friction factor f0 Blasius correlation g Inequality constraints Iu, Ik, Iε, Ic, IK Material interpolated functions J Objective function k, k0 Turbulent kinetic energy of the fluid and solid domains (m2/s2) kf, ks Thermal conductivity of the fluid and solid (W/(m K)) L Total length of the serpentine channel (m) n Normal vector nc, nK Penalization power coefficients in material interpolated functions $N u ¯ ¯$, $N u ¯ ¯ t o t$ Globally and total Nusselt numbers $N u ¯ ¯ 0$ Dittus–Boelter equation Pk Turbulent kinetic energy source term (W/m3) p0 Zero static pressure (Pa) ploc Local static pressure at measuring points (Pa) pref Pressure value at the channel inlet (Pa) Pr Prandtl number Qtot Total heat transfer (W) q0 Uniform heat flux (W/m2) qu, qk, qε Tuning parameters in material interpolated functions R Residual vector function Re Reynolds number Rmin Filter radius (m) S Vectors with discrete state fields TP Thermal performance of cooling channels Tavg Average temperature of the considered surface (m2) Ti Local temperature at the consider area (K) Tin, Tout Inlet and outlet temperatures (K) Tw Average wall temperature (K) u Fluid velocity vector Uin Inlet velocity (m/s) x Design variable vector y+ Nondimensional distance from the endwall to the first element node Greek Letters αu,max, αu,min Maximum and minimum inverse permeabilities of the porous medium (Pa s/m) β Projection slope γ Design variable γf, γp Smoothed and projected design variables ε, ε0 Turbulent energy dissipation for fluid and solid regions (m2/s3) μ Dynamic viscosity (N s/m2) μT Turbulent dynamic viscosity (N s/m2) ρ Fluid density (kg/m3) η Projection threshold θ Uniformity index of temperature ω Specific rate of dissipation in the k–ω turbulence model (1/s) Γin, Γout Inlet and outlet boundary conditions Γwall No-slip boundary conditions Ωid, Ωod Inside and outside design domains\n\n## References\n\n1. Yeranee, K.; Rao, Y. A Review of Recent Studies on Rotating Internal Cooling for Gas Turbine Blades. Chin. J. Aeronaut. 2021, 34, 85–113. [Google Scholar] [CrossRef]\n2. Ekkad, S.; Singh, P. Detailed Heat Transfer Measurements for Rotating Turbulent Flows in Gas Turbine Systems. Energies 2021, 14, 39. [Google Scholar] [CrossRef]\n3. Rao, Y.; Guo, Z.; Wang, D. Experimental and Numerical Study of Heat Transfer and Turbulent Flow Characteristics in Three-Short-Pass Serpentine Cooling Channels with Miniature W-Ribs. J. Heat Transfer. 2020, 142, 121901. [Google Scholar] [CrossRef]\n4. Schüler, M.; Zehnder, F.; Weigand, B.; von Wolfersdorf, J.; Neumann, S. The Effect of Turning Vanes on Pressure Loss and Heat Transfer of a Ribbed Rectangular Two-Pass Internal Cooling Channel. J. Turbomach. 2011, 133, 021017. [Google Scholar] [CrossRef]\n5. Guo, Z.; Rao, Y.; Li, Y.; Wang, W. Experimental and Numerical Investigation of Turbulent Flow Heat Transfer in a Serpentine Channel with Multiple Short Ribbed Passes and Turning Vanes. Int. J. Therm. Sci. 2021, 165, 106931. [Google Scholar] [CrossRef]\n6. Lei, J.; Su, P.; Xie, G.; Lorenzini, G. The Effect of a Hub Turning Vane on Turbulent Flow and Heat Transfer in a Four-Pass Channel at High Rotation Numbers. Int. J. Heat Mass Transf. 2016, 92, 578–588. [Google Scholar] [CrossRef]\n7. Sun, M.; Zhang, L.; Hu, C.; Zhao, J.; Tang, D.; Song, Y. Forced Convective Heat Transfer in Optimized Kelvin Cells to Enhance Overall Performance. Energy 2022, 242, 122995. [Google Scholar] [CrossRef]\n8. Sigmund, O.; Maute, K. Topology Optimization Approaches: A Comparative Review. Struct. Multidiscip. Optim. 2013, 48, 1031–1055. [Google Scholar] [CrossRef]\n9. Li, H.; Yamada, T.; Jolivet, P.; Kondoh, T.; Furuta, K.; Nishiwaki, S. Full-Scale 3D Structural Topology Optimization Using Adaptive Mesh Refinement Based on the Level-Set Method. Finite Elem. Anal. Des. 2021, 194, 103561. [Google Scholar] [CrossRef]\n10. Li, H.; Kondoh, T.; Jolivet, P.; Furuta, K.; Yamada, T.; Zhu, B.; Zhang, H.; Izui, K.; Nishiwaki, S. Optimum Design and Thermal Modeling for 2D and 3D Natural Convection Problems Incorporating Level Set-Based Topology Optimization with Body-Fitted Mesh. Int. J. Numer. Methods Eng. 2022, 123, 1954–1990. [Google Scholar] [CrossRef]\n11. Ghasemi, A.; Elham, A. A Novel Topology Optimization Approach for Flow Power Loss Minimization across Fin Arrays. Energies 2020, 13, 1987. [Google Scholar] [CrossRef]\n12. Yeranee, K.; Rao, Y.; Yang, L.; Li, H. Enhanced Thermal Performance of a Pin-Fin Cooling Channel for Gas Turbine Blade by Density-Based Topology Optimization. Int. J. Therm. Sci. 2022, 181, 107783. [Google Scholar] [CrossRef]\n13. Behrou, R.; Pizzolato, A.; Forner-Cuenca, A. Topology Optimization as a Powerful Tool to Design Advanced PEMFCs Flow Fields. Int. J. Heat Mass Transf. 2019, 135, 72–92. [Google Scholar] [CrossRef]\n14. Zhang, B.; Gao, L. Topology Optimization of Convective Heat Transfer Problems for Non-Newtonian Fluids. Struct. Multidiscip. Optim. 2019, 60, 1821–1840. [Google Scholar] [CrossRef]\n15. Alexandersen, J.; Andreasen, C. A Review of Topology Optimisation for Fluid-Based Problems. Fluids 2020, 5, 29. [Google Scholar] [CrossRef]\n16. Manuel, M.C.E.; Lin, P.T. Heat Exchanger Design with Topology Optimization. In Heat Exchangers-Design, Experiment and Simulation; InTechOpen: London, UK, 2017. [Google Scholar]\n17. Alexandersen, J.; Sigmund, O.; Aage, N. Large Scale Three-Dimensional Topology Optimisation of Heat Sinks Cooled by Natural Convection. Int. J. Heat Mass Transf. 2016, 100, 876–891. [Google Scholar] [CrossRef]\n18. Dilgen, S.; Dilgen, C.; Fuhrman, D.; Sigmund, O.; Lazarov, B. Density Based Topology Optimization of Turbulent Flow Heat Transfer Systems. Struct. Multidiscip. Optim. 2018, 57, 1905–1918. [Google Scholar] [CrossRef]\n19. Haertel, J.; Engelbrecht, K.; Lazarov, B.; Sigmund, O. Topology Optimization of a Pseudo 3D Thermofluid Heat Sink Model. Int. J. Heat Mass Transf. 2018, 121, 1073–1088. [Google Scholar] [CrossRef]\n20. Li, H.; Ding, X.; Meng, F.; Jing, D.; Xiong, M. Optimal Design and Thermal Modelling for Liquid-Cooled Heat Sink Based on Multi-Objective Topology Optimization: An Experimental and Numerical Study. Int. J. Heat Mass Transf. 2019, 144, 118638. [Google Scholar] [CrossRef]\n21. Li, H.; Ding, X.; Jing, D.; Xiong, M.; Meng, F. Experimental and Numerical Investigation of Liquid-Cooled Heat Sinks Designed by Topology Optimization. Int. J. Therm. Sci. 2019, 146, 106065. [Google Scholar] [CrossRef]\n22. Zhang, B.; Zhu, J.; Gao, L. Topology Optimization Design of Nanofluid-Cooled Microchannel Heat Sink with Temperature-Dependent Fluid Properties. Appl. Therm. Eng. 2020, 176, 115354. [Google Scholar] [CrossRef]\n23. Othmer, C. A Continuous Adjoint Formulation for the Computation of Topological and Surface Sensitivities of Ducted Flows. Int. J. Numer. Methods Fluids 2008, 58, 861–877. [Google Scholar] [CrossRef]\n24. Ghosh, S.; Fernandez, E.; Kapat, J. Fluid-Thermal Topology Optimization of Gas Turbine Blade Internal Cooling Ducts. J. Mech. Des. 2021, 144, 051703. [Google Scholar] [CrossRef]\n25. Dilgen, C.; Dilgen, S.; Fuhrman, D.; Sigmund, O.; Lazarov, B. Topology Optimization of Turbulent Flows. Comput. Methods Appl. Mech. Eng. 2018, 331, 363–393. [Google Scholar] [CrossRef]\n26. Yoon, G. Topology Optimization Method with Finite Elements Based on the K-ε Turbulence Model. Comput. Methods Appl. Mech. Eng. 2020, 361, 15–18. [Google Scholar] [CrossRef]\n27. Alkebsi, E.A.A.; Ameddah, H.; Outtas, T.; Almutawakel, A. Design of Graded Lattice Structures in Turbine Blades Using Topology Optimization. Int. J. Comput. Integr. Manuf. 2021, 34, 370–384. [Google Scholar] [CrossRef]\n28. Wang, N.; Meenashisundaram, G.K.; Chang, S.; Fuh, J.Y.H.; Dheen, S.T.; Senthil Kumar, A. A Comparative Investigation on the Mechanical Properties and Cytotoxicity of Cubic, Octet, and TPMS Gyroid Structures Fabricated by Selective Laser Melting of Stainless Steel 316L. J. Mech. Behav. Biomed. Mater. 2022, 129, 105151. [Google Scholar] [CrossRef]\n29. Kaur, I.; Singh, P. Flow and Thermal Transport Characteristics of Triply-Periodic Minimal Surface (TPMS)-Based Gyroid and Schwarz-P Cellular Materials. Numer. Heat Transf. Part A Appl. 2021, 79, 553–569. [Google Scholar] [CrossRef]\n30. Pires, T.; Santos, J.; Ruben, R.B.; Gouveia, B.P.; Castro, A.P.G.; Fernandes, P.R. Numerical-Experimental Analysis of the Permeability-Porosity Relationship in Triply Periodic Minimal Surfaces Scaffolds. J. Biomech. 2021, 117, 110263. [Google Scholar] [CrossRef]\n31. Kim, J.; Yoo, D.J. 3D Printed Compact Heat Exchangers with Mathematically Defined Core Structures. J. Comput. Des. Eng. 2020, 7, 527–550. [Google Scholar] [CrossRef]\n32. Al-Ketan, O.; Ali, M.; Khalil, M.; Rowshan, R.; Khan, K.A.; Abu Al-Rub, R.K. Forced Convection Computational Fluid Dynamics Analysis of Architected and Three-Dimensional Printable Heat Sinks Based on Triply Periodic Minimal Surfaces. J. Therm. Sci. Eng. Appl. 2021, 13, 021010. [Google Scholar] [CrossRef]\n33. Li, W.; Yu, G.; Yu, Z. Bioinspired Heat Exchangers Based on Triply Periodic Minimal Surfaces for Supercritical CO2 Cycles. Appl. Therm. Eng. 2020, 179, 115686. [Google Scholar] [CrossRef]\n34. Borrvall, T.; Petersson, J. Topology Optimization of Fluids in Stokes Flow. Int. J. Numer. Methods Fluids 2003, 41, 77–107. [Google Scholar] [CrossRef]\n35. Lazarov, B.; Sigmund, O. Filters in Topology Optimization Based on Helmholtz-Type Differential Equations. Int. J. Numer. Methods Eng. 2011, 86, 765–781. [Google Scholar] [CrossRef]\n36. Celik, I.B.; Ghia, U.; Roache, P.J.; Freitas, C.J.; Coleman, H.; Raad, P.E. Procedure for Estimation and Reporting of Uncertainty Due to Discretization in CFD Applications. J. Fluids Eng. Trans. ASME 2008, 130, 0780011–0780014. [Google Scholar] [CrossRef]\n37. Winterton, R.H.S. Where Did the Dittus and Boelter Equation Come From? Int. J. Heat Mass Transf. 1998, 41, 809–810. [Google Scholar] [CrossRef]\nFigure 1. Numerical model of a three-short-pass serpentine channel: (a) full 3D model; (b) 2D simplified design from the 3D model.\nFigure 1. Numerical model of a three-short-pass serpentine channel: (a) full 3D model; (b) 2D simplified design from the 3D model.\nFigure 2. Overview of the procedures in this study.\nFigure 2. Overview of the procedures in this study.\nFigure 3. Flow chart of the topology optimization process.\nFigure 3. Flow chart of the topology optimization process.\nFigure 4. A single unit cell of (a) diamond-sheet structure; (b) gyroid-sheet structure for fulfilling the optimal results in this study.\nFigure 4. A single unit cell of (a) diamond-sheet structure; (b) gyroid-sheet structure for fulfilling the optimal results in this study.\nFigure 5. (a) The mesh system for 2D model validation; (b) mesh system in the 3D model.\nFigure 5. (a) The mesh system for 2D model validation; (b) mesh system in the 3D model.\nFigure 6. Comparison of the average values of the state variables between 2D and 3D at Re = 10,000: (a) pressure values; (b) velocity magnitudes; (c) temperature values.\nFigure 6. Comparison of the average values of the state variables between 2D and 3D at Re = 10,000: (a) pressure values; (b) velocity magnitudes; (c) temperature values.\nFigure 7. The optimized 2D model with intermediate results.\nFigure 7. The optimized 2D model with intermediate results.\nFigure 8. (a) 3D optimal solution including intermediate results; (b) topology optimization model infilled with lattice structures.\nFigure 8. (a) 3D optimal solution including intermediate results; (b) topology optimization model infilled with lattice structures.\nFigure 9. Models for comparison: (a) optimized model extracted with density filtering of 0.5 (TO model); (b) optimized model infilled with diamond-sheet structure (TO model with diamond-TPMS); (c) optimized model infilled with diamond-sheet structure (TO model with gyroid-TPMS).\nFigure 9. Models for comparison: (a) optimized model extracted with density filtering of 0.5 (TO model); (b) optimized model infilled with diamond-sheet structure (TO model with diamond-TPMS); (c) optimized model infilled with diamond-sheet structure (TO model with gyroid-TPMS).\nFigure 10. An example of mesh systems for the 3D models.\nFigure 10. An example of mesh systems for the 3D models.\nFigure 11. The spanwise-averaged temperature and grid convergence index on the surface of the conventional serpentine channel at Re = 10,000.\nFigure 11. The spanwise-averaged temperature and grid convergence index on the surface of the conventional serpentine channel at Re = 10,000.\nFigure 12. Comparisons of globally averaged Nusselt number in each pass for different turbulence models at Re = 10,000.\nFigure 12. Comparisons of globally averaged Nusselt number in each pass for different turbulence models at Re = 10,000.\nFigure 13. Comparisons of relative pressure coefficient for all serpentine channels at Re = 10,000.\nFigure 13. Comparisons of relative pressure coefficient for all serpentine channels at Re = 10,000.\nFigure 14. Friction factors for all serpentine channels at Re = 10000.\nFigure 14. Friction factors for all serpentine channels at Re = 10000.\nFigure 15. Globally averaged Nusselt numbers for all serpentine channels at Re = 10,000.\nFigure 15. Globally averaged Nusselt numbers for all serpentine channels at Re = 10,000.\nFigure 16. Total Nusselt numbers for all serpentine channels at Re = 10,000.\nFigure 16. Total Nusselt numbers for all serpentine channels at Re = 10,000.\nFigure 17. Heat transfer enhancements for all serpentine models at Re = 10,000: (a) globally averaged Nusselt number ratio; (b) total Nusselt number ratio.\nFigure 17. Heat transfer enhancements for all serpentine models at Re = 10,000: (a) globally averaged Nusselt number ratio; (b) total Nusselt number ratio.\nFigure 18. Thermal performances for all serpentine models at Re = 10,000.\nFigure 18. Thermal performances for all serpentine models at Re = 10,000.\nFigure 19. Temperature uniformity on the surface for all serpentine models at Re = 10,000.\nFigure 19. Temperature uniformity on the surface for all serpentine models at Re = 10,000.\nFigure 20. Velocity distributions and streamlines in the middle section of the serpentine channel: (a) baseline model; (b) TO model with diamond-TPMS structure.\nFigure 20. Velocity distributions and streamlines in the middle section of the serpentine channel: (a) baseline model; (b) TO model with diamond-TPMS structure.\nFigure 21. Pressure distributions in the middle section of the serpentine channel: (a) baseline model; (b) TO model with diamond-TPMS structure.\nFigure 21. Pressure distributions in the middle section of the serpentine channel: (a) baseline model; (b) TO model with diamond-TPMS structure.\nFigure 22. Local dimensionless turbulent kinetic energy and velocity streamline on the cross-sections in the multipass channel: (a) baseline model; (b) TO model with diamond-TPMS structure.\nFigure 22. Local dimensionless turbulent kinetic energy and velocity streamline on the cross-sections in the multipass channel: (a) baseline model; (b) TO model with diamond-TPMS structure.\nFigure 23. Nusselt number contours of the serpentine channel: (a) baseline model; (b) TO model with diamond-TPMS structure.\nFigure 23. Nusselt number contours of the serpentine channel: (a) baseline model; (b) TO model with diamond-TPMS structure.\nTable 1. An overview of density-based topology optimization in recent studies on thermofluid systems.\nTable 1. An overview of density-based topology optimization in recent studies on thermofluid systems.\nAuthorFlow RegimeStructureDiscretizationOptimizer\nAlexandersen et al. Laminar2D and 3DFEM 1MMA 3\nDilgen et al. Turbulent2D and 3DFVM 2 MMA\nHaertel et al. Laminar2DFEMGCMMA 4\nLi et al. [20,21]Laminar2DFEMSNOPT 5\nZhang et al. Laminar2DFEMGCMMA\n1 finite element method. 2 finite volume method. 3 method of moving asymptotes. 4 globally convergent method of moving asymptotes. 5 sparse nonlinear optimizer.\nTable 2. Parameters used in the 2D topology optimization process.\nTable 2. Parameters used in the 2D topology optimization process.\nParameterDaβηquqkqεncnK\nValue10−4–10−61.5–16.00.50.1–100.0010.13–53–5\n Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.\n\n## Share and Cite\n\nMDPI and ACS Style\n\nYeranee, K.; Rao, Y.; Yang, L.; Li, H. Improved Thermal Performance of a Serpentine Cooling Channel by Topology Optimization Infilled with Triply Periodic Minimal Surfaces. Energies 2022, 15, 8924. https://doi.org/10.3390/en15238924\n\nAMA Style\n\nYeranee K, Rao Y, Yang L, Li H. Improved Thermal Performance of a Serpentine Cooling Channel by Topology Optimization Infilled with Triply Periodic Minimal Surfaces. Energies. 2022; 15(23):8924. https://doi.org/10.3390/en15238924\n\nChicago/Turabian Style\n\nYeranee, Kirttayoth, Yu Rao, Li Yang, and Hao Li. 2022. \"Improved Thermal Performance of a Serpentine Cooling Channel by Topology Optimization Infilled with Triply Periodic Minimal Surfaces\" Energies 15, no. 23: 8924. https://doi.org/10.3390/en15238924\n\nNote that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here." ]
[ null, "https://px.ads.linkedin.com/collect/", null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.6464468,"math_prob":0.93095917,"size":14008,"snap":"2022-40-2023-06","text_gpt3_token_len":4345,"char_repetition_ratio":0.16659527,"word_repetition_ratio":0.05459057,"special_character_ratio":0.29119074,"punctuation_ratio":0.27443737,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9843213,"pos_list":[0,1,2],"im_url_duplicate_count":[null,null,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2023-02-01T22:15:55Z\",\"WARC-Record-ID\":\"<urn:uuid:8e3bc38f-db85-48ce-9e53-1e7499f8de2d>\",\"Content-Length\":\"396652\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:ef0354e7-7b06-49f8-a744-7be2c69b7d07>\",\"WARC-Concurrent-To\":\"<urn:uuid:39535e7c-f8f3-4e44-aa44-510c34aecc10>\",\"WARC-IP-Address\":\"104.18.24.151\",\"WARC-Target-URI\":\"https://www.mdpi.com/1996-1073/15/23/8924\",\"WARC-Payload-Digest\":\"sha1:R3XQRXUJ6GUYKD4KB2C7ZMQYV3R2253M\",\"WARC-Block-Digest\":\"sha1:M4HKYC36BFVMCU6INFHMGT66PJ4F3RCA\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2023/CC-MAIN-2023-06/CC-MAIN-2023-06_segments_1674764499953.47_warc_CC-MAIN-20230201211725-20230202001725-00359.warc.gz\"}"}
https://metanumbers.com/588552
[ "## 588552\n\n588,552 (five hundred eighty-eight thousand five hundred fifty-two) is an even six-digits composite number following 588551 and preceding 588553. In scientific notation, it is written as 5.88552 × 105. The sum of its digits is 33. It has a total of 6 prime factors and 32 positive divisors. There are 193,664 positive integers (up to 588552) that are relatively prime to 588552.\n\n## Basic properties\n\n• Is Prime? No\n• Number parity Even\n• Number length 6\n• Sum of Digits 33\n• Digital Root 6\n\n## Name\n\nShort name 588 thousand 552 five hundred eighty-eight thousand five hundred fifty-two\n\n## Notation\n\nScientific notation 5.88552 × 105 588.552 × 103\n\n## Prime Factorization of 588552\n\nPrime Factorization 23 × 3 × 137 × 179\n\nComposite number\nDistinct Factors Total Factors Radical ω(n) 4 Total number of distinct prime factors Ω(n) 6 Total number of prime factors rad(n) 147138 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 588,552 is 23 × 3 × 137 × 179. Since it has a total of 6 prime factors, 588,552 is a composite number.\n\n## Divisors of 588552\n\n32 divisors\n\n Even divisors 24 8 4 4\nTotal Divisors Sum of Divisors Aliquot Sum τ(n) 32 Total number of the positive divisors of n σ(n) 1.4904e+06 Sum of all the positive divisors of n s(n) 901848 Sum of the proper positive divisors of n A(n) 46575 Returns the sum of divisors (σ(n)) divided by the total number of divisors (τ(n)) G(n) 767.171 Returns the nth root of the product of n divisors H(n) 12.6367 Returns the total number of divisors (τ(n)) divided by the sum of the reciprocal of each divisors\n\nThe number 588,552 can be divided by 32 positive divisors (out of which 24 are even, and 8 are odd). The sum of these divisors (counting 588,552) is 1,490,400, the average is 46,575.\n\n## Other Arithmetic Functions (n = 588552)\n\n1 φ(n) n\nEuler Totient Carmichael Lambda Prime Pi φ(n) 193664 Total number of positive integers not greater than n that are coprime to n λ(n) 12104 Smallest positive number such that aλ(n) ≡ 1 (mod n) for all a coprime to n π(n) ≈ 48113 Total number of primes less than or equal to n r2(n) 0 The number of ways n can be represented as the sum of 2 squares\n\nThere are 193,664 positive integers (less than 588,552) that are coprime with 588,552. And there are approximately 48,113 prime numbers less than or equal to 588,552.\n\n## Divisibility of 588552\n\n m n mod m 2 3 4 5 6 7 8 9 0 0 0 2 0 6 0 6\n\nThe number 588,552 is divisible by 2, 3, 4, 6 and 8.\n\n• Arithmetic\n• Abundant\n\n• Polite\n\n## Base conversion (588552)\n\nBase System Value\n2 Binary 10001111101100001000\n3 Ternary 1002220100020\n4 Quaternary 2033230020\n5 Quinary 122313202\n6 Senary 20340440\n8 Octal 2175410\n10 Decimal 588552\n12 Duodecimal 244720\n16 Hexadecimal 8fb08\n20 Vigesimal 3db7c\n36 Base36 cm4o\n\n## Basic calculations (n = 588552)\n\n### Multiplication\n\nn×i\n n×2 1177104 1765656 2354208 2942760\n\n### Division\n\nni\n n⁄2 294276 196184 147138 117710\n\n### Exponentiation\n\nni\n n2 346393456704 203870561730052608 119988426847345922543616 70619428597859137404890284032\n\n### Nth Root\n\ni√n\n 2√n 767.171 83.8034 27.6979 14.2547\n\n## 588552 as geometric shapes\n\n### Circle\n\nRadius = n\n Diameter 1.1771e+06 3.69798e+06 1.08823e+12\n\n### Sphere\n\nRadius = n\n Volume 8.53971e+17 4.35291e+12 3.69798e+06\n\n### Square\n\nLength = n\n Perimeter 2.35421e+06 3.46393e+11 832338\n\n### Cube\n\nLength = n\n Surface area 2.07836e+12 2.03871e+17 1.0194e+06\n\n### Equilateral Triangle\n\nLength = n\n Perimeter 1.76566e+06 1.49993e+11 509701\n\n### Triangular Pyramid\n\nLength = n\n Surface area 5.99971e+11 2.40264e+16 480551\n\n## Cryptographic Hash Functions\n\nmd5 c271ddb95bc465647b080d8d1843b6c8 39731d286980d283d4d0a3a6626d3eaac256bed5 11da15afd31cd0ea89a6cac7dc253ea7722aa296ae2ca3859a9be642d435f9af 0df2137ad95f8b16a715d3c6228f59253dcd275516bd69cee1ad4c67cc93c5a70259a30a495413fb7bf645590f3caf7b415177ea2a5307a1194da97ddd424f42 f74609035e1559fd433ff13c631ade2f1a451c37" ]
[ null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.63130075,"math_prob":0.9862669,"size":4635,"snap":"2021-21-2021-25","text_gpt3_token_len":1624,"char_repetition_ratio":0.11876485,"word_repetition_ratio":0.033923306,"special_character_ratio":0.46752965,"punctuation_ratio":0.08025478,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9958108,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2021-06-16T07:21:37Z\",\"WARC-Record-ID\":\"<urn:uuid:2209f420-f71c-4cfb-a580-28c030e18295>\",\"Content-Length\":\"48850\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:18020814-704d-44af-ac37-21c323c36629>\",\"WARC-Concurrent-To\":\"<urn:uuid:f5416a25-8dfa-4616-8795-2542989a3da4>\",\"WARC-IP-Address\":\"46.105.53.190\",\"WARC-Target-URI\":\"https://metanumbers.com/588552\",\"WARC-Payload-Digest\":\"sha1:I7WB3CC77K4RI6QC26RWPRKGND4CSMUG\",\"WARC-Block-Digest\":\"sha1:AECQ2XTCKOFILNXGOPEMVVA3PCJL5VCL\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2021/CC-MAIN-2021-25/CC-MAIN-2021-25_segments_1623487622234.42_warc_CC-MAIN-20210616063154-20210616093154-00388.warc.gz\"}"}
https://brandonrozek.com/ta/fall2017/cpsc220/dec6/
[ "", null, "", null, "# Final Review December 6\n\n## Classes\n\nHere is how you can create a class called “Employee” with a non-default constructor (a constructor that takes parameters) and a getter and setter\n\n``````public class Employee {\n// Our private variables\nprivate String name;\nprivate double salary;\n// Non-default constructor\npublic Employee(String name, double salary) {\nthis.name = name;\nthis.salarly = salary;\n}\n// This is a getter\npublic string getName() {\nreturn name;\n}\npublic double setSalarly(double salary) {\nthis.salary = salary;\n}\n}\n``````\n\n## For Loops + Arrays\n\nFor loops are constructed in the following way\n\n`for (initialization; condition to stop; increment to get closer to condition to stop)`\n\n``````//Assume an array with variable name array is declared before\nfor (int i = 0; i < array.length; i++) {\n// This code will loop through every entry in the array\n}\n``````\n\nNote that you don’t always have to start from zero, you can start anywhere from the array.\n\n## For Loops + Arrays + Methods\n\nThis is an example of how you can take in an array in a method\n\n``````public static boolean isEven(int[] array) { // <-- Note the int[] array\nfor (int i = 0; i < array.length; i++) { // Iterate through the entire array\n// If you find an odd number, return false\nif (array[i] % 2 == 1) {\nreturn false;\n}\n}\n// If you didn't find any odd numbers, return true\nreturn true;\n}\n``````\n\n## File I/O\n\nLet’s say that you have the following file\n\n``````4\nchicken\n3\n``````\n\nAnd you want to make it so that you take the number, and print the word after it a certain number of times. For this example we would want to see the following\n\n``````chicken chicken chicken chicken\n``````\n\nHere is the code to write it\n\n``````public static void printStrings() {\nFileInputStream file = new FileInputStream(\"stuff.txt\"); // File contents are in stuff.txt\nScanner scnr = new Scanner(file); // Scanner takes in a file to read\nwhile (scnr.hasNext()) { // While there are still stuff in the file to read\nint number = scnr.nextInt(); // Grab the number\nString word = scnr.next(); // Grab the word after the number\n// Print the word number times\nfor (int i = 0; i < number; i++) {\nSystem.out.print(word);\n}\n// Put a new line here\nSystem.out.println();\n}\n\n}\n``````\n\n## Recursion\n\nLook at handout and carefully trace recursion problems\n\n## 2D Arrays\n\nDeclare a 2D int array with 4 rows and 7 columns\n\n``````int[][] dataVals = new int;\n``````\n\nA 2D array with 4 rows and 7 columns has 7 * 4 = 28 entries.\n\nIf you want to sum up all the numbers in a 2 dimensional array, do the following\n\n``````// Assume numbers is declared beforehand\nint sum = 0;\nfor (int i = 0; i < numbers.length; i++) { // Loop through every row in the 2D array\nfor (int j = 0; j < numbers[i].length; j++) { // Loop through every column in a row\n// This code now looks at one entry in a 2D array\nsum += numbers[i][j];\n}\n}\n``````" ]
[ null, "https://brandonrozek.com//img/avatar.jpg", null, "https://brandonrozek.com//img/avatar-border.svg", null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.7296745,"math_prob":0.8387951,"size":2742,"snap":"2021-04-2021-17","text_gpt3_token_len":709,"char_repetition_ratio":0.10518627,"word_repetition_ratio":0.055226825,"special_character_ratio":0.28118163,"punctuation_ratio":0.10285714,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.98945916,"pos_list":[0,1,2,3,4],"im_url_duplicate_count":[null,null,null,null,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2021-01-17T08:26:40Z\",\"WARC-Record-ID\":\"<urn:uuid:3a4ff6ef-acd6-404b-b2ff-b8881dadf282>\",\"Content-Length\":\"17419\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:c9260918-ecb4-4b49-96d6-780ddc192fe9>\",\"WARC-Concurrent-To\":\"<urn:uuid:1b96b55a-54e7-4870-b5d9-942881d2641e>\",\"WARC-IP-Address\":\"159.203.122.95\",\"WARC-Target-URI\":\"https://brandonrozek.com/ta/fall2017/cpsc220/dec6/\",\"WARC-Payload-Digest\":\"sha1:UI47RS4PUAGAU6YIMXNQVMXEIEXS7BKX\",\"WARC-Block-Digest\":\"sha1:NFRFPKHLR2ZLM7II5LP2TAUDN32PH2OY\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2021/CC-MAIN-2021-04/CC-MAIN-2021-04_segments_1610703511903.11_warc_CC-MAIN-20210117081748-20210117111748-00290.warc.gz\"}"}
https://socratic.org/questions/your-piggy-bank-has-25-coins-in-it-some-are-quarters-and-some-are-nickels-you-ha
[ "# Your piggy bank has 25 coins in it; some are quarters and some are nickels. You have $3.45. How many nickels do you have? ##### 1 Answer Mar 4, 2018 See a solution process below: #### Explanation: First, let's call the number of quarters you have: $q$And, the number of nickels you have: $n$Using these variables and the information in the problem we can write two equations: • Equation 1: $q + n = 25$• Equation 2: $0.25q + $0.05n =$3.45\n\nStep 1) Solve the first equation for $q$:\n\n$q + n = 25$\n\n$q + n - \\textcolor{red}{n} = 25 - \\textcolor{red}{n}$\n\n$q + 0 = 25 - n$\n\n$q = 25 - n$\n\nStep 2) Substitute $\\left(25 - n\\right)$ for $q$ in the second equation and solve for $n$ to find the number of nickels you have:\n\n$0.25q +$0.05n = $3.45 becomes: $0.25(25 - n) + $0.05n =$3.45\n\n($0.25 xx 25) - ($0.25 xx n) + 0.05n = $3.45 $6.25 - $0.25n + 0.05n =$3.45\n\n$6.25 + (-$0.25 + 0.05)n = $3.45 $6.25 + (-$0.20)n =$3.45\n\n$6.25 -$0.20n = $3.45 $6.25 - color(red)($6.25) -$0.20n = $3.45 - color(red)($6.25)\n\n0 - $0.20n = -$2.80\n\n-$0.20n = -$2.80\n\n(-$0.20n)/(color(red)(-)color(red)($)color(red)(0.20)) = (-$2.80)/(color(red)(-)color(red)($)color(red)(0.20))\n\n(color(red)(cancel(color(black)(-$0.20)))n)/cancel(color(red)(-)color(red)($)color(red)(0.20)) = (color(red)(cancel(color(black)(-$)))2.80)/(cancel(color(red)(-)color(red)($))color(red)(0.20))\n\n$n = \\frac{2.80}{\\textcolor{red}{0.20}}$\n\n$n = 14$\n\nYou would have 14 nickels" ]
[ null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.70101273,"math_prob":1.0000085,"size":1142,"snap":"2019-51-2020-05","text_gpt3_token_len":484,"char_repetition_ratio":0.228471,"word_repetition_ratio":0.035714287,"special_character_ratio":0.5595447,"punctuation_ratio":0.18214285,"nsfw_num_words":2,"has_unicode_error":false,"math_prob_llama3":0.9999993,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2020-01-20T11:26:36Z\",\"WARC-Record-ID\":\"<urn:uuid:6037f922-273f-45b1-ac66-00fffd39d7db>\",\"Content-Length\":\"37377\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:6df4de06-4f6e-4eb0-a2fa-7fbf2258173c>\",\"WARC-Concurrent-To\":\"<urn:uuid:73433790-06d3-4d54-bfe6-f52c0ef40fc7>\",\"WARC-IP-Address\":\"54.221.217.175\",\"WARC-Target-URI\":\"https://socratic.org/questions/your-piggy-bank-has-25-coins-in-it-some-are-quarters-and-some-are-nickels-you-ha\",\"WARC-Payload-Digest\":\"sha1:PDN7VKTEGWH5X4TK6IRBA6N2GRVBYBDZ\",\"WARC-Block-Digest\":\"sha1:YWJBHEVL4DEZXCRVKHGY7UNK2T7IBFOD\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2020/CC-MAIN-2020-05/CC-MAIN-2020-05_segments_1579250598726.39_warc_CC-MAIN-20200120110422-20200120134422-00276.warc.gz\"}"}
https://homework.cpm.org/category/ACC/textbook/gb8i/chapter/4%20Unit%205/lesson/INT1:%204.2.1/problem/4-56
[ "", null, "", null, "### Home > GB8I > Chapter 4 Unit 5 > Lesson INT1: 4.2.1 > Problem4-56\n\n4-56.\n\nIn problem 4-25 you looked at the data for a study conducted on a vitamin supplement that claims to shorten the length of the common cold. The data is shown in the table below: Homework Help ✎\n\n Number of months taking supplement $0.5$ $2.5$ $1$ $2$ $0.5$ $1$ $2$ $1$ $1.5$ $2.5$ Number of days cold lasted $4.5$ $1.6$ $3$ $1.8$ $5$ $4.2$ $2.4$ $3.6$ $3.3$ $1.4$\n1.", null, "You previously created a linear model for this data by sketching a line of best fit. Now create a model that is consistent with your classmates by determining the LSRL. Sketch the graph and the LSRL.\n\nReview the LSRL procedure in the previous lesson.\n\n2. Draw the upper and lower boundary lines on the graph following the process you used in problem 4-24. What is the equation of the upper boundary line? Of the lower boundary line?\n\nAnswer: $y = 6.16 − 1.58x$ and $y = 4.58 − 1.58x$, based on a maximum residual of $−0.79$\n\n3. Based on the upper and lower boundary lines of your model, what do you predict is the length of a cold for a person who has taken the supplement for three months? Consider the precision of the data and use an appropriate number of decimal places in your response.\n\nSince the number of days the cold lasted is decreasing as the number of months taking the supplement increases,\nit would seem the length of the cold should be between $1$ and $0.5$ days.\n\n4. How long do you predict a cold will last for a person who has taken no supplement? Interpret the y-intercept in context.\n\nSince the $y$-intercept is around $5.3$, the number of days a cold should last for a person who hasn't taken the supplement should be around $5.3$ days.\n\n5. How long do you predict a cold will last for a person who has taken six months of supplements?\n\nNegative values in this case do not make sense. Statistical models often cannot be extrapolated far beyond the edges of the data.\n\n6. If you have a cold, would you prefer a negative or positive residual?\n\n• If you have a cold, your goal would be to decrease the number of days the cold lasts. Would a positive or negative residual represent a decrease in the number of days that a cold lasts?" ]
[ null, "https://homework.cpm.org/dist/7d633b3a30200de4995665c02bdda1b8.png", null, "data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAfQAAABDCAYAAABqbvfzAAAAGXRFWHRTb2Z0d2FyZQBBZG9iZSBJbWFnZVJlYWR5ccllPAAAAyRpVFh0WE1MOmNvbS5hZG9iZS54bXAAAAAAADw/eHBhY2tldCBiZWdpbj0i77u/IiBpZD0iVzVNME1wQ2VoaUh6cmVTek5UY3prYzlkIj8+IDx4OnhtcG1ldGEgeG1sbnM6eD0iYWRvYmU6bnM6bWV0YS8iIHg6eG1wdGs9IkFkb2JlIFhNUCBDb3JlIDUuMC1jMDYxIDY0LjE0MDk0OSwgMjAxMC8xMi8wNy0xMDo1NzowMSAgICAgICAgIj4gPHJkZjpSREYgeG1sbnM6cmRmPSJodHRwOi8vd3d3LnczLm9yZy8xOTk5LzAyLzIyLXJkZi1zeW50YXgtbnMjIj4gPHJkZjpEZXNjcmlwdGlvbiByZGY6YWJvdXQ9IiIgeG1sbnM6eG1wPSJodHRwOi8vbnMuYWRvYmUuY29tL3hhcC8xLjAvIiB4bWxuczp4bXBNTT0iaHR0cDovL25zLmFkb2JlLmNvbS94YXAvMS4wL21tLyIgeG1sbnM6c3RSZWY9Imh0dHA6Ly9ucy5hZG9iZS5jb20veGFwLzEuMC9zVHlwZS9SZXNvdXJjZVJlZiMiIHhtcDpDcmVhdG9yVG9vbD0iQWRvYmUgUGhvdG9zaG9wIENTNS4xIE1hY2ludG9zaCIgeG1wTU06SW5zdGFuY2VJRD0ieG1wLmlpZDo5QzA0RUVFMzVFNDExMUU1QkFCNEYxREYyQTk4OEM5NCIgeG1wTU06RG9jdW1lbnRJRD0ieG1wLmRpZDo5QzA0RUVFNDVFNDExMUU1QkFCNEYxREYyQTk4OEM5NCI+IDx4bXBNTTpEZXJpdmVkRnJvbSBzdFJlZjppbnN0YW5jZUlEPSJ4bXAuaWlkOjlDMDRFRUUxNUU0MTExRTVCQUI0RjFERjJBOTg4Qzk0IiBzdFJlZjpkb2N1bWVudElEPSJ4bXAuZGlkOjlDMDRFRUUyNUU0MTExRTVCQUI0RjFERjJBOTg4Qzk0Ii8+IDwvcmRmOkRlc2NyaXB0aW9uPiA8L3JkZjpSREY+IDwveDp4bXBtZXRhPiA8P3hwYWNrZXQgZW5kPSJyIj8+RSTQtAAAG9JJREFUeNrsXQmYXEW1Pj09PVtmJjsBDGFXiCKKIBJ2REEQQdaARBBiFFRAnrIoyhqCgLwnEfEpPMAgggsGJG7w2MMuiuwkJDGQINmTycxklu62/r5/0ZWaur3M9GQCc/7vO1/fvrfuvXXr1q3/nFOnqhLZbFYUCoVCoVC8u1GlRaBQKBQKhRK6QqFQKBQKJXSFQqFQKBRK6AqFQqFQKJTQFQqFQqFQQlcoFAqFQqGErlAoFAqFonKoLveE2jM+uTHk+zNGjjZyj5EXqJhgQH3KyClGOo1MNbK2vzOSTWakbmWTjHp+69y2QqFQKBQW85+avvES+kaCKUaOMHK8kcWS9zQkjYzj9l1Gnuj3nCSykuxIaa1VKBQKxbvLQt9I0Gjk30YehtPA2d9tZJGRPYxs0++EnjCaRFe1NC4emSN2hUKhUCiU0MtDjZE3jRwXODaRhP5hI7f1ZyayVRmpWdMoqbb63LZCoVAoFAOFd2tQHHzcWxppChwbxt89+zsTWWOV161okkQ6oTVJoVAoFErovQA8C6OMjA0csy74nSXfn155GA6vXlcj9cuHqnWuUCgUCiX0XqDByOiIUnNu9ThCh/W+T79Z54bEa1c1SnVbjdnW/nOFQqFQKKGXi/cbeR+3Px44PtrZPrw/M1K/vDlSKxQKhUKhUEIvG/tK1IcO7CE9KXVn/v7ZyAFGNqm4dY6hautqpGZNg7rbFQqFQqGE3sv8gtDXOeTt9pMPN/Ixh9CNCS2HVJzQq7JSu3qIJDtTaqErFAqFQgm9FwBZY/z520ZWS9Sfvrdz/AjHeke6RyWaOa6iwJBzuNsTyuYKhUKhUELvFdAn/rREQ9NeN/KkkaN4bAQJ/x7+hy/8RhL+DpVk86p0taRadOy5QqFQKJTQe4NtSNog8aESzdf+RyOfolX+ZSMPSDRbHIBhbXcaaTcyuVKZQP95am2dVHelctsKhUKhUAxGQoeP+hoj1xu5yciFZZwLUv6NRIuwWMKeLdGscRdLFN3+O8lHuY800mbkdiOnSn7CmT4Sukj9imZJZHShOoVCoVAMXkLH/bBc2ywj5xg5wcjnSjgP4803owU+kvsQ8PaskYeMnGbkCu6vd44D15LMT6yIRmLUiZq19WqdKxQKhWJQE/q2Eo0hR7/3GCMLJFoGddciefymkR/zfyN/U7TO20niNhjOTizTwN9/GPmrkfMcsu+ddV6VkVR7nVS31mn/uUKhUCgGNaGDyP9l5F6J3OMdRr5n5FwjH4w55wwjrxj5G/+787dfQwsd/eZf5b46z1IHLqUicVLfzHOR6vYaqepOas1RKBQKxaAldIwXR7/3XIn6wVskcp+D4NEHfomRXbxzDpJorPkPnX2WsDHm/FEeQ/Db13j9as9CF6bDuPSLJLygS4xFns1Z4lYy1encdK+JjA5XUygUCsXgJfQvGblDIrc7VkI71sh2Rg418gKtdFjrdknUCUYmSdTX3u1c533O9uP8vZrKAYLfugKEDpwvkZv/nFIzjGj2mtUNuRnhILWrhkhVV1LXPlcoFArFRocNtR76YUbeMrKElvqJJGlMDvNFWta3GDmGFjf2wa89xchSI0NoqeM6n3KuO4q//5Ro7fPvS34WOZ/Q0ZeO6PoLmPblYpke8crmhtRr1198pSohmaT2nysUCoVi8BH6hySa8AWBaacbSUvUdw7vAJjyK0a+bmSakVVGWiVykSPgDUPVOmlZg/zv4q+d3rXOuQ/c9kdKNFY9ROjAd5nmBiN7SX4IXBCIZI/c7vlkiYS62xUKxYbH/KemayEoCqI/Xe4YKnYKyXO8kZslmhBmUyM/kshNjpXTrpNoARUExX2e5yVI7BCYwwh8m0kLf0vnHm7g22u00LMFCH0l8zSBaRUKhUKhUAvdA4aLoX97FxL19iTVZ0nMcHnDHf5Vh4hB1KOYbpGRtRJN07o/rfKmInm8yMhEEjWC69p4D1x/SMw5mF3uKp77dyN3azVQKBQKhRJ6HqMlH8X+iJHlsn4wW7kAIY+k9b41lYQPkPDx20zLf3zM+bDkEdmO/vUXjbxqZB6tfATGITjvVxK53v+uVUGhUCgUg4rQs15AWCL9jtf+TUrkMM86vyGgfzr3E9sn3WrObzWJFprtZ5z9uOHmRnYzcqCR/WJIHX3wB1GEOYGSgWC4xySKuMc1fm9kHyMLtTooFAqFYtAQet2yJvJxQjLVGelsbn9nnDb25Qg+QzLPRPSbSaZzc59Ho72iKPFkR7VUmbSZmgJGfO787DtR5bx+xlEefk/ixopqCKA7TOJd7Ql6EPaW/JKrrUyPceyH0HpXKBQKheK9T+gjX9jCsZWz0l3XJV2N7dLZtC43RrtueWN+nXCQfqpb2ke1SMfwVknXduUixhsXDZfGN0fkyD+TSsdb6WZ/d32ndAxtM+SfkM7GDllnrgXNAJO7MPocUfD/TxkvmcRZ5nqnSmkBf5b8ETX/oERD2u7UaqFQKBSK9zyh+y736vaUVLfVSMPbCE5ff4hXDu01UruqIWfNg5xxvHZ1Q2TVGx5PdhbOAqZaradXAOfAI9A+eo20jVljlIeGnMcAln7HsFbpauh8KV3XNaW7oeN2c+1rEunEeEPuXQVvkIAHAHnOol/+DpN+lsnYmWb/v8p1Xkjk1u/QaqVQKBSKjZ7QexB8jsCzBQZ0g+SjrVRrtG4KplB1jPBid3jnfCA3c1tLvQxZNCJH9u+wqSF2XCpd0w3Sv79t9JqPdA5vHZdOdVfB2x6arjVrlIzkulR2yOLmNnMcD5HoGtIxdN3IlrebFozOXb+HghKPL0i0UMxtWq0UCoVC8a4jdAJ907tLNIkMItPB2JgZDtHjz5DofHLEvdFv3SSFJ3gBE6+QaJz569ZDUN2Rst6CKl5naBb6QXcyR+5GMplU98PrRrQuXjt2ec6yr0onc3ey+WhcOFIaI8XgIJuPbFUmaxSOj1V1VafM9bHe+vz1lICsYf2wEgL3va7aolAoFIp3JaFjKVPMwY7JWjaPSYOo8usoLuCixpKoW5R4Lyzmgrnb/8fIn5z1yJO8TjThDAztZHQskU7OHvLvofvVL2/sXrPlMml934qc6z/VWifD5mwqtSuHIP0hhsBnradBGOKnsnCyT+gFACVG54RVKBQKxYCgLzPFYeKY+yUKJNu8QLodSbhYLrXZNXYlmgimVMCC/rREE8P8oKTrJLJ7GgI/VjJVMmzupjLipbHSvHCUjP77VjkyN6RdY6z1qYHz7FaXVhGFQqFQvJcJHdO3wqrdrYxzMIf6LVIZtzQmhil16taLDUE3od8ervjm18fkoutpgcOz8BGtBgqFQqEYrIR+JS30cnGERCupVQJYaAV99sVmo8MSrWfkTHlD4jkijyzwkfQuKBQKhUIxKAkds7JNjDn2N4lWTcPCK/MKWNcIT0/HHEcA3F8kWp0NU7c+GZMO1zi1xDz/l0TLtrr4tqy/trpCoVAoFO9a9CYoDv3YqcB+zNp2vOTHYWNd8wckmnvdBf7vIdHCLCE8Z+RgT+k4wciNJHEXmLK1toByYDGc1vgU/se88F/T169QKBSKwWyhfzSwL03L3J1U5d8S9XPPpcyhzCepJ0pUMtDZfatEAXg+xkq03Gop0eUnG9mV25dIFKGvUCgUCsWgtdBDEe1wky8I7P+NkT95+0DkiB6vr0D+s5JfBqYY4FU4z8i1Ro7ZCN8FFIzNJD+Gvz2QppZeiqxXnp0SnqEuxXJexzSFUMf0uG9cXEKC10tKgWV3nGtUM72ftkviZ9SrYV46me+4Z+qKKSMAK/8hRgLL8S6SwvMcWDQzvascJkuopwm+szYqyA2SH3kRum89v6EE33NrjKLdwLy0Ffh2G4qUg32uVon3YtWxXrWXUEd8FCqftTH765n3cuqEC7zXUczvGyW8W5TzFrwvFmda1k/5wn0wEqelQJ7qWX/XlHC9Jr6z9hLrr0LRKws9tPhJS4FKutaTFjbUcSQcIhO48vcP7F9sZHWJhA58zshvpW/D9SoNNFAIMkRXQ27yHInWkL+ADa2LqTyGCXv+6ciz9GLs7aWfxLT3s4GIAxq8x5n2oALpQCB38X7PeXlw5bNM/2mmfdY59jz/38HjPr7BfFwVk4ejeXxG4NhHeN2XJJr/AOWJlfWOK/IO7D0v8fbv4z0Xnvlv3vNAfsf07+exh6ic+cR5Ae9jPVbYvijwbhDvMZv32jMmz0fy/FsK1P+TmZ9rCjz7VF7nm72ou7vElAfK6RGWq0/4tzL9PwJ1Au/04zH3QnDrLyRaCvkVvtvZRd7tRL7/13gOzv2l9OwGRPndXCBfuO8nipSFfbffKpBmBtNMLXKtk5gOsUTDlKYU/WmhZ2MIvbNCefqQ00BmaG3tE9Nozab2HCLoNY5G7Fp3owNp0T0wpgzFoFLYjB6Mnfn/VeYRDc6lEi0aM9GxEDZhwybcZxeoBfHbYMVT2ABZLX8bCqam/WlMPr4i+eF7Q4rkGaMbtuS76QqUWcJpxOud/HY69cfm91iS6IWedY38xgUsDuXxVd7+/VlvhrNsXmR5oSG+nedMi7EyJ/P4ZCoSqx2PyFjHE5Ry6ppb31c639P2tIirPCX4VxKtBgjMo/W1PZ/9Uzy2wrnODvRWYA6HCQEr3JbDigIWHIJGtyWxX0GPgA+U89Ysq3JRRyXGWrJZx1BA3vYyciiVsLWO8rgd03YG6vBRVODvcu6D7+MevosMFTYowntQcPw7Xt6+4xDnElrmyOsJLG8onU85dXIrJ1+2TXHzdQzzNTNG0Z1MRWwyvYAhq34sy+Ub/BbfiCnT8/jemjYy40PxHrTQQ+iqoFtoNK2PI9kQ7BtDtLDkf+6QiA806D8q4X7PsdFMDED5X83GaIFEa7uPpxxPUsAwv9O9cgZ+xgZ/R/4iNuA2ktN0yc++57pZz2BjEfIQuKMFisUjWCI7xcmDK+PZ+LrXQgO8k5Nmd8fC/j6f3ffQxE3qkw4QKkj8Jv7+kff6MJXDHzLNZVSQfNgpi4VKneuheJjPY8t5MvfPoQJkn/dwrx52eN/Dt0jYq1incc4H+X6XkbAv9JTmDsfrcEGJ5eBiJz4b0OwoE6FvN84zVgz2/UKp2I1ltAOf78tU9A/y6rDN77leHd6dym09CXGYo1TdSDKczfLYieV3GdOc79WhfRwyv5RpbZ14gG3M9Z4HzObrvJh81Xn58pXJcY6XZq8i3w6I+rSYNJ93PAgdou52xQAQ+kBgKt1icV6GIbRKFhS5DhqDtwcg/2igPsftMyVa/jXDjxgW5ZU8dnbAbbmazzWPv3B7TqIS00wLxMeOtH58wHrbtBf5X+TkwZW5bMh90niNx+fTMsJ8BLMc5aAv+CS9Bkv4PHNYlktIpo+wrp8ZOHcij83l/0nOsTbut+X8hkN+9nlej7G0xCGkE7l9Cb0IHSyTu0ggQqKPc69+m5ZoOTiGHoV5zO+kfqzLackHvM7n9g2S78I4WnpOKLXUq8OoEyfxnYEcd2G63aiItbKePM93i/7w7xm5m+lOdK5tn/XPVBiX8ZyX6alq4/UPCTwL7v8vL1+TuB+KcqhLwN77Nf6eUEKZTQ54C1EPz1JaUgw0oW/oRUlg2V5cJE2t89HH4T5q300DUPZoHBpp3TweOD6dpPftwHtKxlhLL3M7zl39TU8Bgqvwq45VWA7K6a6B5VoT2P9bx5rsSx3awfG2LA0cn0Kiv9Xb30yLKMuyWUhLb8uY+6Sc56ktMW9Qlmx/+gOB4w+R3DeR9fvdq0g8C3jfH5dxT6Q71lEGXqVC8MF+qstx5fG04wWqLaH+LCVxAkMdi1eoWL0WOOde/m7r7NveO+biLXrAzohRxEL5Wu7UK1/p2oyKwTpes4WK+ogSPJH+PBoHSnwMgULRL4Qeck03SnhseiXRzgbxMDZSxQjIRr+jEX8wcBxW0jkFnqm/Yee1XynhaG7sn0Fr3Y+E7o7xSNh+8IXesQdo2XzMs0pgOW1HC/8fZea/EjETbzl5b+jDdWwjG+dpQUAUgsf+GmhA4SlBlwC6CeBih2v1iAq+5yaSWafk+9r9et1CIqnzvrMsLbZVtCi/U+I94fL9AOsBvAD3U2Hqr9EdWQlH2u/rELVfx0PR+weQjLO08oHhzjUk5juxdci2aU1F6sPdVJifCRwL5etAyceCvOwd+yy/ZVjyCGJDtwCi8A8t0Hb+kt/w1x3FxSrcwEyJjw1SKCpiZbkNUKjRapJ8UE9fAGviSoeQYXku4wf+ai8UljQVgNmelfgTiSJJB7rsu6T8/stNaNW6VuC32OgsCxAXgv4w8c+1THc3G3jr3kMU9GllNN7AFWwwk16D9b2YhlJilCrrceiLhZ4sUDcLwbpGf+80pCdy/3SpzOp5SckPLQzFBXQ7+xMBJe0JiVzXeEfnUvF4usg9j3eIK81fBGIhIvxyqVwAq1uXMT/FWueZP8P8WgLzyxJW7OZMm6FX5EQqP4gHedF7t+uKKJZJpwxD9WFXfjdZJ13I6j/Cy9dYenf8fPllfadThw5mHZoRk2d8n2OoKEyi9wWWOUZ9wN3/fxLFZWj/uaLfCT2k9Q7nR+AT+v5s4NNO5QSp3sCPI4TFrNCVBAgGQTBnOhbs1AEue7dhKddDcDLFByL7vyw9o5mHsnFBfy2Gtu1GBeyjtDhmUukpB3EL8/y0DEJ3yyJbobIsFWioD2KjbUdVII5hCZ9tl148R2/ec7H3D+/Xj0jGu7Px372AEjhC8gFwv+bvoxL1Ce9A6/3+CtdlfP+PxRybwW/Px3HSc8hZG7/9s5xyK/ZuE166uHNQhhO8c690lA6LYwKeDHjIEIB7tqeYjGd5tku+L38W0+9PBXtujBJyNQkdVvr/UuGCAYKA1/kyMF5DxSAk9BcC+6C9fs2z8rDvssBHBFxVwPqp7qdnRV6OYkOOhV2WD3DZ9+WDfZtKSZKNACwjuPxulsi1HipTuG2voyJzjuOt+G82pMky84358Z+UvFswUaB+FPKgDFRZHk6yhJvddjesIrmfxkb9mQrlLdGH57CW4mkkzY+TBBbFXOMztEThfXrEsW7RdQOX/cR+IPRuWq7dfKcZEtmdjlLhA11hiB9AVx2i4D9EMjy1l+82UeQcxGu8QuPCkm1XgXwlWc7IF0ZOTAmktYGHs0jCwJtMj2NHSj641QW6l+5gvUM3GQJz0RXWQkLfSqlJsaEI/a8kR/+jQXAV+o7gEkRf4BdjyBxE9KCEg6T6E8v4cR0vPYOjBgJtzsddI4XXhk94FsgvJN//Xw5gZaCf7mj+XyDR+OjeAIQxu49lYPu+OyTvUrWKRZzClw4oA+scS7FURcK6SuGh2JPfQkbyoyKg/F1c5L2Ugg5aZPUSjhOwM9+JxA/Vs+WNbo6LJBri9ouYdLYb4SXvuawCcBjLaWUF6/JKWqpryzgHwai3OSQICxf90RjG+ZyTrt3xMoUwxClnW286vPplFVeLmwsQ+h+db+JNtmeH0ZvldtHVOJb8K3z+JOuntcqhPP1Qes7SZ2daRJ5ukXyA73S2Ux9QalL0Br2xkBBA9ZeYY0fzY/lpDJkDP6FLKjUAz3ujQ2YDjVX8qEfHNFZoQOACnik9I2t7a9kulfUnl7mOjXBvrldXgTKw0elLnEbYTuoyJuacTZ3ycz0WwLiYc6ZQibya/3eSfDQxJtV5lMdhrf+A+xE1vW8FnnEFSQllHJo2eRRJqU16Dvfzgbw9zXNs95Gr6CHP+3H7C95zXeeU38H94G0q1zho8Ej0CSo2/ph7G/W+eUybMc6rD1lHWdk65t7betcOKQhW6XhM8rP8uXBHDZxHb8iD/D2f+6Gc7FqgDOyshlYpvVYpSbGhCd0O8elNANzj1EIH0ipevJGU/Rx6K+okP3TMfS/Q2g8gma8ONKC9xfW0gEAMN/XhOi1lpE1Lz0AsDEeyE7Xc5+x/mL8TAoQKIjuJ2+5qfU84SpAfXTyWFu2+TkNvXaVv0Br7jSP4/6pDin3FUsfiDAUens73PUcKj2e3jf43aFmGukg+T6JEEOTtged6vsBztffxOftSJ9P0PgBwU3/CMyDWkZxPCNSHL3h1QBzP0XHSc6w3vAC7sx17rEi+YO3b2QWP8IwU6+GZS0+DW9b4P9/zBMV5by6nV+g6Cfe3KxQlo7f91a+wgt9awCoKWfbHSt9dmO8VrGUjdj01fFikGGJUS9I6hA3Kd6Uy0dYWi9lgurOR9QYns4FLBOoUvAovelb1+ZJ3PW5FTwkaW7g1f+aR80zWL/R7wmWJvkaMrf86FYGF9LZYPMWG9Bg2pldTYRlH5RPW3WtsNF1X6eUSng4XZT+Lv2OkbxMPZfme9yPBQIGzUd/HOXkBcZQy2uFJWuoXBAh1IrevlfA0txNIdgfwHSxwjkHhCc15kKLy9Eg/fw/38N1/gs/2WYcwf05FBvVkRyp9GP+Ncd8Y5vaW5GeNBG6gVwZu9XtZHkizN89JUZl9roR8WSt9Ar/FQ6lkH+5Y578LnIeI/RlUsnBea8z1URf+UKaCrFBUlNCFHzg+kMvYKMW5YGHJ3yzR0JvVXgPUHEhf7rKmdpUjH0PLuEbcilH93c8PMkFUMmaz+hLFAtbk2bJ+P7V1B5Y6ZrsupkxDQ4CaS3hmt6xPLZBuCQndXmszkqePZ+ideMuziibz3EMCxPQyFZ63A+ckaeH5i6y8SOsObtmjqBRkJD9TnY+H+Qyb0AK8xiub5hiLtNqpey4xoovqFF7ncIcMrKcDBHaHsy/pvOOQJY5vDv26OzvvAwqDndp2ZsxzQcnBzHbbsq5d6NxnP8m7631MjyF06wIfVoa3z9az2oCVPo1K7aFU6OxznMO6jzI8V9aPTH+ZyqXr3XiLRHozy+hG716/ooLgoqlIvv7A+ngg68WmrE9xAYb30usxjnVyRoF7rIkp16GiY9EVG4jQhZYSgt8QbIbpRnciQWXo9kODfZ/0nOjEupum8eNIO/mZ1wt33Q9oSaWdRnCJlD4U6kESjjseGNd4dgO8g8tpBdg5vrtpOaCBn+OlvZ3l83AZStc0elSKWZFX0QouZLV08nqjC3gNkpJ3f2Jq3qmyflBQgiSGYw9IeEz0clpoIL6DmS8ohugT/rX07IKwjeJRJDpEem9BpegR75x2PkMhFze8J6eTIBd75DGNhNEZ4/24hPfw83gTlbOJJJkEy+D2wPtZRpJHw7405tuBBXi8971cwW8t7n2jfqPvfU/nPFiIr0p+oZQQad8Xc715VC7WluF5g7W8jazvIreAgnUWyTLlKaCnsqxQJ7Zk+T7EfS0xyuIEltFeJMc3SMx/jsnXdgXydSYV03rWtWl8f3HBhVA4v0KPwhpHMYIy9XiRMprH72ZlActeoehpcWWz5Q3/3WrX0wZ7kUmiKjjC62w25NdrtVIoFJXG/KemayEo+tVCH3x0noiN/XlaCg87UigUCoVi47HQFQqFQqFQbHzQgAuFQqFQKJTQFQqFQqFQKKErFAqFQqGoCP4jwADQNvw20jA5ogAAAABJRU5ErkJggg==", null, "https://s3-us-west-2.amazonaws.com/c3po-media-dev/files/8448b750-9f32-11e9-b4ae-b9fc2fa89dc3/calculator_original.png", null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.9274139,"math_prob":0.99745023,"size":1945,"snap":"2019-51-2020-05","text_gpt3_token_len":423,"char_repetition_ratio":0.13034518,"word_repetition_ratio":0.10364146,"special_character_ratio":0.21439588,"punctuation_ratio":0.079283886,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9919307,"pos_list":[0,1,2,3,4,5,6],"im_url_duplicate_count":[null,null,null,null,null,1,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2020-01-22T06:37:57Z\",\"WARC-Record-ID\":\"<urn:uuid:e6035f35-a0a8-4cf1-ad90-839bebb85c5b>\",\"Content-Length\":\"56474\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:6189cbaa-b3b1-4197-a7a6-f89361ccc17f>\",\"WARC-Concurrent-To\":\"<urn:uuid:d2d5ea24-5be3-4d9b-8f4e-56cec23e6302>\",\"WARC-IP-Address\":\"104.26.7.16\",\"WARC-Target-URI\":\"https://homework.cpm.org/category/ACC/textbook/gb8i/chapter/4%20Unit%205/lesson/INT1:%204.2.1/problem/4-56\",\"WARC-Payload-Digest\":\"sha1:TCH3AFLEH5IROC7GQGDERFQFZO4UUK22\",\"WARC-Block-Digest\":\"sha1:CNPUY6CVDJBHZ6FPPRZQDLR46GW6NMGD\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2020/CC-MAIN-2020-05/CC-MAIN-2020-05_segments_1579250606696.26_warc_CC-MAIN-20200122042145-20200122071145-00266.warc.gz\"}"}
https://controlentertainmentonline.com/ans/1-cos-x-identity.html
[ "# 1 Cos X Identity\n\n1 Cos X Identity. Because the two sides have been shown to be equivalent, the equation is an identity. The angle in the one plus cos double angle trigonometric identity can be represented by any symbol but it is popularly written in two different forms. 1 + cos ( 2 x) = 2 cos 2 x. 1 + cos ( 2 a) = 2 cos 2 a.", null, "Ze |á¨dâåhz\\$`x. b7su%ðxü¡_ âàþ˜õæg ù´ øùœ vóæ~i© ¯a jb—€2+ bb/ü•bøp+& rx·8„© h:ê îb÷q‰‚{â. ­ °ä¤·ª­ ! Ƒ¾¸ù© îy0ƒ üuõ µ |è u ! `†æ. —ã½½òâ¸uoñ w¦mæüêýk úî h6’‡vn ë9 +mcxž±z‰*“n þ¸i 4bq i. Learn how to solve trigonometric identities problems step by step online. The least common multiple (lcm) of a sum of algebraic fractions consists of the product of the common factors with the greatest exponent, and the uncommon. An easy way to show that this is not an identity is to plug in 0 for x. In fact, if we use the identity sin(2x) = 2sin(x)cos(x) we can show that there are no real values for which the questioned equality is true. Tan(x y) = (tan x tan y) / (1 tan x tan y). Tan(2x) = 2 tan(x) / (1.", null, "source: www.chegg.com Solved: Verify The Identity. Tan(x)/1- Cos(x) = Csc (x) (1... | Chegg.com. Because the two sides have been shown to be equivalent, the equation is an identity.", null, "source: socratic.org How do you verify the identity (sin2x)/(sinx) = 2/(secx)? | Socratic. The angle in the one plus cos double angle trigonometric identity can be represented by any symbol but it is popularly.", null, "source: socratic.org How do you verify (sin x/ (1 - cos x)) + ((1 - cos x)/ sin x) = 2csc x. 1 + cos ( 2 x) = 2 cos 2 x.", null, "source: socratic.org How do you verify this identity: (cosx)/(1+sinx) + (1+sinx)/(cosx. 1 + cos ( 2 a) = 2 cos 2 a.", null, "source: www.youtube.com Establishing a trig identity involving sin x and 1 - cos x - YouTube. Thus, the one plus cosine of double angle rule can be.", null, "source: socratic.org How do you verify the identity: (1-(cosx-sinx)^(2))/cosx=2sinx? | Socratic. Ze |á¨dâåhz\\$`x. b7su%ðxü¡_ âàþ˜õæg ù´ øùœ vóæ~i© ¯a jb—€2+ bb/ü•bøp+& rx·8„© h:ê îb÷q‰‚{â. ­ °ä¤·ª­ !", null, "source: boingboing.net This trig problem kept me up too late last night / Boing Boing. Ƒ¾¸ù© îy0ƒ üuõ µ |è u !", null, "source: socratic.org How do you simplify the identify sin^2x/(1-cosx) = 1+cosx? | Socratic. `†æ. —ã½½òâ¸uoñ w¦mæüêýk úî h6’‡vn ë9 +mcxž±z‰*“n þ¸i 4bq i.", null, "source: www.slideshare.net Unit 5.2. Learn how to solve trigonometric identities problems step by step online.", null, "source: ar.howtodoiteasy.com إذا كانت Sin x - cos x = 1/3 ، فما هي sin 3x + cos 3x؟ 2021. The least common multiple (lcm) of a sum of algebraic fractions consists of the product of the common factors with the.", null, "source: www.bartleby.com Answered: 1-cos2x/1+sinx=sinx. Prove the identity | bartleby. An easy way to show that this is not an identity is to plug in 0 for x.", null, "source: sharedocnow.blogspot.com 1 Cos X 2 - sharedoc. In fact, if we use the identity sin(2x) = 2sin(x)cos(x) we can show that there are no real values for which the.", null, "source: socratic.org How do you verify the identity (1+ sinx)/(cos x) + (cos x)/(1+sin x. Tan(x y) = (tan x tan y) / (1 tan x tan y).", null, "source: socratic.org How do you verify the identity cos t/(1-sin t) = sec t+tan t? | Socratic. Tan(2x) = 2 tan(x) / (1.", null, "source: www.chegg.com Solved: 1-8 Verify Each Identity 1. Tan ? Sin ? Cos ? = Se... | Chegg.com. By using this website, you agree to our cookie policy.", null, "source: www.youtube.com Trigonometric Identity (1 + sin x)/(1 - sin x) = (sec x + tan x)^2 CBSE. Trigonometric identities are useful whenever trigonometric functions are involved in an expression or an equation.", null, "source: socratic.org How do you verify sin^2(x) = (1/2)(1-cos2x)? | Socratic. Trigonometric identities are true for every value of variables occurring on both sides of an equation.", null, "source: socratic.org How do you prove 2sin x + sin 2 x = (2 sin^3 x) / (1 – cos x)? | Socratic. Geometrically, these identities involve certain trigonometric functions (such as sine, cosine, tangent) of one or more.", null, "source: www.youtube.com tan x + cot x = 1/(sin x cos x) verify the trig identity - YouTube. Sine, cosine and tangent are.", null, "source: www.bartleby.com Answered: tan2x(1+cos2x)=1-cos2x. Verify the… | bartleby. Is it is a open ended equation identity." ]
[ null, "https://useruploads.socratic.org/wHYm142SQyOFK0hbZhXK_mat1.jpg>", null, "https://tse4.mm.bing.net/th", null, "https://tse3.mm.bing.net/th", null, "https://tse2.mm.bing.net/th", null, "https://tse3.mm.bing.net/th", null, "https://tse3.mm.bing.net/th", null, "https://tse2.mm.bing.net/th", null, "https://tse2.mm.bing.net/th", null, "https://tse2.mm.bing.net/th", null, "https://tse1.mm.bing.net/th", null, "https://tse4.mm.bing.net/th", null, "https://tse4.mm.bing.net/th", null, "https://tse4.mm.bing.net/th", null, "https://tse4.mm.bing.net/th", null, "https://tse1.mm.bing.net/th", null, "https://tse4.mm.bing.net/th", null, "https://tse4.mm.bing.net/th", null, "https://tse2.mm.bing.net/th", null, "https://tse4.mm.bing.net/th", null, "https://tse2.mm.bing.net/th", null, "https://tse1.mm.bing.net/th", null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.7053314,"math_prob":0.9932627,"size":4153,"snap":"2022-40-2023-06","text_gpt3_token_len":1476,"char_repetition_ratio":0.14678235,"word_repetition_ratio":0.38731444,"special_character_ratio":0.3159162,"punctuation_ratio":0.15762004,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.99761325,"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],"im_url_duplicate_count":[null,1,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\":\"2022-09-28T12:03:14Z\",\"WARC-Record-ID\":\"<urn:uuid:34eb6b72-337d-4c01-b567-e04f05c47dd9>\",\"Content-Length\":\"41547\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:7877c97b-9330-4792-8ac1-025fdd2939cd>\",\"WARC-Concurrent-To\":\"<urn:uuid:7e6ec118-27f5-4dce-bcd8-752d8f78723b>\",\"WARC-IP-Address\":\"172.67.206.153\",\"WARC-Target-URI\":\"https://controlentertainmentonline.com/ans/1-cos-x-identity.html\",\"WARC-Payload-Digest\":\"sha1:S73GJFYTLMCUHCWLZUVP4LFRJDMHKNZB\",\"WARC-Block-Digest\":\"sha1:BDFET47YJTLGCLF6EFLFSOCZS2R4LT7R\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2022/CC-MAIN-2022-40/CC-MAIN-2022-40_segments_1664030335254.72_warc_CC-MAIN-20220928113848-20220928143848-00205.warc.gz\"}"}
https://nylogic.github.io/set-theory-seminar/2020/08/28/normal-ultrapowers-with-many-sets-of-ordinals.html
[ "August 28\nMiha Habič, Bard College at Simon’s Rock\nNormal ultrapowers with many sets of ordinals\n\nAny ultrapower $M$ of the universe by a normal measure on a cardinal $\\kappa$ is quite far from $V$ in the sense that it computes $V_{\\kappa+2}$ incorrectly. If GCH holds, this amounts to saying that $M$ is missing a subset of $\\kappa^+$. Steel asked whether, even in the absence of GCH, normal ultrapowers at $\\kappa$ must miss a subset of $\\kappa^+$. In the early 90s Cummings gave a negative answer, building a model with a normal measure on $\\kappa$ whose ultrapower captures the entire powerset of $\\kappa^+$. I will present some joint work with Radek Honzík in which we improved Cummings’ result to get this capturing property to hold at the least measurable cardinal.\n\nVideo" ]
[ null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.9020492,"math_prob":0.98904735,"size":777,"snap":"2020-34-2020-40","text_gpt3_token_len":205,"char_repetition_ratio":0.12807244,"word_repetition_ratio":0.0,"special_character_ratio":0.23680824,"punctuation_ratio":0.06944445,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9855111,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2020-09-26T08:46:45Z\",\"WARC-Record-ID\":\"<urn:uuid:be0a1359-577b-44c0-b007-db60ec311368>\",\"Content-Length\":\"5041\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:20bd3dd3-ca61-4f23-9039-b080bc4b60b8>\",\"WARC-Concurrent-To\":\"<urn:uuid:5721403e-eaaa-41cd-ab4f-5cd8a6ecdb3e>\",\"WARC-IP-Address\":\"185.199.109.153\",\"WARC-Target-URI\":\"https://nylogic.github.io/set-theory-seminar/2020/08/28/normal-ultrapowers-with-many-sets-of-ordinals.html\",\"WARC-Payload-Digest\":\"sha1:QKBMD2NDK2RZB6ZVXK3SLLRFSHPEYD3B\",\"WARC-Block-Digest\":\"sha1:XDO2KAGYTHWJJ7LVJYCOSBLKQQJ25XD5\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2020/CC-MAIN-2020-40/CC-MAIN-2020-40_segments_1600400238038.76_warc_CC-MAIN-20200926071311-20200926101311-00288.warc.gz\"}"}
https://www.statmodel.com/HTML_UG/chapter15v8.htm
[ "CHAPTER 15\n\nTITLE, DATA, VARIABLE, AND DEFINE COMMANDS\n\nIn this chapter, the TITLE, DATA, VARIABLE, and DEFINE commands are discussed.  The TITLE command is used to provide a title for the analysis. The DATA command is used to provide information about the data set to be analyzed.  The VARIABLE command is used to provide information about the variables in the data set to be analyzed.  The DEFINE command is used to transform existing variables and create new variables.\n\nThe TITLE command is used to provide a title for the analysis.   Following is the general format for the TITLE command:\n\n TITLE: title for the analysis\n\nThe TITLE command is not a required command.  Note that commands can be shortened to four or more letters.\n\nThe TITLE command can contain any letters and symbols except the words used as Mplus commands when they are followed by a colon.  These words are: title, data, variable, define, analysis, model, output, savedata, montecarlo, and plot.  These words can be included in the title if they are not followed by a colon.  Colons can be used in the title as long as they do not follow words that are used as Mplus commands.  Following is an example of how to specify a title:\n\nTITLE:  confirmatory factor analysis of diagnostic criteria\n\nThe title is printed in the output just before the Summary of Analysis.\n\nThe DATA command is used to provide information about the data set to be analyzed.  The DATA command has options for specifying the location of the data set to be analyzed, describing the format and type of data in the data set, specifying the number of observations and number of groups in the data set if the data are in summary form such as a correlation or covariance matrix, requesting listwise deletion of observations with missing data, and specifying whether the data should be checked for variances of zero.\n\nData must be numeric except for certain missing value flags and must reside in an external ASCII file.  There is no limit on the number of variables or observations.  The maximum record length is 10,000.  Special features of the DATA command for multiple group analysis are discussed in Chapter 14.  Monte Carlo data generation is discussed in Chapters 12 and 19.  The estimator chosen for an analysis determines the type of data required for the analysis.  Some estimators require a data set with information for each observation.  Some estimators require only summary information.\n\nThere are six DATA transformation commands.  They are used to rearrange data from a wide to long format, to rearrange data from a long to wide format, to create a binary and a continuous variable from a semicontinuous variable, to create a set of binary variables that are indicators of missing data, to create variables for discrete-time survival modeling, and to rearrange longitudinal data from a format where time points represent measurement occasions to a format where time points represent age or another time-related variable.\n\nFollowing are the options for the DATA and the DATA transformation commands:\n\n DATA: FILE IS file name; FORMAT IS format statement; FREE FREE; TYPE IS INDIVIDUAL; INDIVIDUAL COVARIANCE; CORRELATION; FULLCOV; FULLCORR; MEANS; STDEVIATIONS; MONTECARLO; IMPUTATION; NOBSERVATIONS ARE number of observations; NGROUPS = number of groups; 1 LISTWISE = ON; OFF; OFF SWMATRIX = file name; VARIANCES = CHECK; NOCHECK; CHECK DATA IMPUTATION:      IMPUTE =          NDATASETS =      SAVE =           FORMAT =      MODEL =             VALUES =      ROUNDING =           THIN = names of variables for which missing values will be imputed; number of imputed data sets; names of files in which imputed data sets are stored; format statement;                                                COVARIANCE; SEQUENTIAL; REGRESSION; values imputed data can take; number of decimals for imputed continuous  variables; k where every k-th imputation is saved; 5     F10.3 depends on analysis type   no restrictions 3   100 DATA WIDETOLONG:      WIDE =      LONG =      IDVARIABLE =      REPETITION = names of old wide format variables; names of new long format variables; name of variable with ID information; name of variable with repetition information; ID REP\n\n DATA LONGTOWIDE:      LONG =      WIDE =      IDVARIABLE =      REPETITION = names of old long format variables; names of new wide format variables; name of variable with ID information; name of variable with repetition information (values); 0, 1, 2, etc. DATA TWOPART:      NAMES =           CUTPOINT =               BINARY =      CONTINUOUS =      TRANSFORM = names of variables used to create a set of binary and continuous variables; value used to divide the original variables into a set of  binary and continuous variables; names of new binary variables; names of new continuous variables; function to use to transform new continuous variables; 0       LOG DATA MISSING:      NAMES =            BINARY = names of variables used to create a set of binary variables; names of new binary variables; TYPE = MISSING; SDROPOUT; DDROPOUT; DESCRIPTIVE = sets of variables for additional descriptive statistics separated by the | symbol; DATA SURVIVAL:      NAMES =           CUTPOINT =               BINARY = names of variables used to create a set of binary event-history variables; value used to create a set of binary event-history variables from a set of original variables; names of new binary variables; DATA COHORT:      COHORT IS      COPATTERN IS      COHRECODE =      TIMEMEASURES =           TNAMES = name of cohort variable (values); name of cohort/pattern variable (patterns); (old value = new value); list of sets of variables separated by the | symbol; list of root names for the sets of variables in TIMEMEASURES separated by the | symbol;\n\nThe DATA command is a required command.  The FILE option is a required option.  The NOBSERVATIONS option is required when summary data are analyzed.  This option is not required when individual data are analyzed.  Default settings are shown in the last column.  If the default settings are appropriate for the options that are not required, nothing needs to be specified for these options.\n\nNote that commands and options can be shortened to four or more letters.  Option settings can be referred to by either the complete word or the part of the word shown above in bold type.\n\nThe FILE option is used to specify the name and location of the ASCII file that contains the data to be analyzed.  The FILE option is required for each analysis.  It is specified for a single group analysis as follows:\n\nFILE IS c:\\analysis\\data.dat;\n\nwhere data.dat is the name of the ASCII file containing the data to be analyzed.  In this example, the file data.dat is located in the directory c:\\analysis.  If the full path name of the data set contains any blanks, the full path name must have quotes around it.\n\nIf the name of the data set is specified with a path, the directory specified by the path is checked.  If the name of the data set is specified without a path, the local directory is checked.  If the data set is not found in the local directory, the directory where the input file is located is checked.\n\nThe FORMAT option is used to describe the format of the data set to be analyzed.  Individual data can be in fixed or free format.  Free format is the default.  Fixed format is recommended for large data sets because it is faster to read data using a fixed format.  Summary data must be in free format.\n\nFor data in free format, each entry on a record must be delimited by a comma, space, or tab.  When data are in free format, the use of blanks is not allowed.  The number of variables in the data set is determined from information provided in the NAMES option of the VARIABLE command.  Data are read until the number of pieces of information equal to the number of variables is found.  The program then goes to the next record to begin reading information for the next observation.\n\nFor data in fixed format, each observation must have the same number of records.  Information for a given variable must occupy the same position on the same record for each observation.  A FORTRAN-like format statement describing the position of the variables in the data set is required.  Following is an example of how to specify a format statement:\n\nFORMAT IS 5F4.0, 10x, 6F1.0;\n\nAlthough any FORTRAN format descriptor (i.e., F, I, G, E, x, t, /, etc.) is acceptable in a format statement, most format statements use only F, t, x, and /.  Following is an explanation of how to create a FORTRAN-like format statement using these descriptors.\n\nThe F format describes the format for a real variable.  F is followed by a number.  It can be a whole number or a decimal, for example, F5.3.  The number before the decimal point describes the number of columns reserved for the variable; the number after the decimal point specifies the number of decimal places.  If the number 34234 is read with an F5.3 format, it is read as 34.234.  If the data contain a decimal point, it is not necessary to specify information about the position of the decimal point.  For example, the number 34.234 can be read with a F6 format as 34.234.\n\nThe F format can also be preceded by a number.  This number represents the number of variables to be read using that format.  The statement 5F5.3 is a shorthand way of saying F5.3, F5.3, F5.3, F5.3, F5.3.\n\nThere are three options for the format statement related to skipping columns or records when reading data:  x, t, and /.  The x option instructs the program to skip columns.  The statement 10x says to skip 10 columns and begin reading in column 11.  The t option instructs the program to go to a particular column and begin reading.  For example, t130 says to go to column 130 and begin reading in column 130.  The / option is used to instruct the program to go to the next record.  Consider the following format statements:\n\n1.  (20F4, 13F5, 3F2)\n\n2.  (3F4.1,25x,5F5)\n\n3.  (3F4.1,t38,5F5)\n\n4.  (2F4/14F4.2//6F3.1)\n\n1.  In the first statement, for each record the program reads 20 four-digit numbers followed by 13 five-digit numbers, then three two-digit numbers with a total record length of 151.\n\n2.  In the second statement, for each record the program reads three four-digit numbers with one digit to the right of the decimal, skips 25 spaces, and then reads five five-digit numbers with a total record length of 62.\n\n3.  The third statement is the same as the second but uses the t option instead of the x option.  In the third statement, for each record the program reads three four-digit numbers with one digit to the right of the decimal, goes to column 38, and then reads five five-digit numbers.\n\n4.  In the fourth statement, each observation has four records.  For record one the program reads two four-digit numbers; for record two the program reads fourteen four-digit numbers with two digits to the right of the decimal; record three is skipped; and for record four the program reads six three-digit numbers with one number to the right of the decimal point.\n\nFollowing is an example of a data set with six one-digit numbers with no numbers to the right of the decimal point:\n\n123234\n\n342765\n\n348765\n\nThe format statement for the data set above is:\n\nFORMAT IS 6F1.0;\n\nor\n\nFORMAT IS 6F1;\n\nThe TYPE option is used in conjunction with the FILE option to describe the contents of the file named using the FILE option.  It has the following settings:\n\nINDIVIDUAL        Data matrix where rows represent observations and columns represent variables\n\nCOVARIANCE     A lower triangular covariance matrix read row wise\n\nCORRELATION    A lower triangular correlation matrix read row wise\n\nFULLCOV             A full covariance matrix read row wise\n\nFULLCORR           A full correlation matrix read row wise\n\nMEANS                 Means\n\nSTDEVIATIONS   Standard deviations\n\nMONTECARLO    A list of the names of the data sets to be analyzed\n\nIMPUTATION       A list of the names of the imputed data sets to be analyzed\n\nINDIVIDUAL\n\nThe default for the TYPE option is INDIVIDUAL.  The TYPE option is not required if individual data are being analyzed where rows represent observations and columns represent variables.\n\nSUMMARY DATA\n\nThe TYPE option is required when summary data such as a covariance matrix or a correlation matrix are analyzed.  The TYPE option has six settings related to the analysis of summary data.  They are:  COVARIANCE, CORRELATION, FULLCOV, FULLCORR, MEANS, and STDEVIATIONS.  Summary data must reside in a free format external ASCII file.  The number of observations must be specified using the NOBSERVATIONS option of the DATA command.\n\nWhen summary data are analyzed and one or more dependent variables are binary or ordered categorical (ordinal), only a correlation matrix can be analyzed.  When summary data are analyzed and all dependent\nvariables are continuous, a covariance matrix is usually analyzed.  In some cases, a correlation matrix can be analyzed.\n\nA data set with all continuous dependent variables in the form of a correlation matrix, standard deviations, and means is specified as:\n\nTYPE IS CORRELATION MEANS STDEVIATIONS;\n\nThe program creates a covariance matrix using the correlations and standard deviations and then analyzes the means and covariance matrix.\n\nThe external ASCII file for the above example contains the means, standard deviations, and correlations in free format.  Each type of data must begin on a separate record even if the data fits on less than one record. The means come first; the standard deviations begin on the record following the last mean; and the entries of the lower triangular correlation matrix begin on the record following the last standard deviation.  The data set appears as follows:\n\n.4 .6 .3 .5 .5\n\n.2 .5 .4 .5 .6\n\n1.0\n\n.86  1.0\n\n.56  .76  1.0\n\n.78  .34  .48  1.0\n\n.65  .87  .32  .56  1.0\n\nor alternatively:\n\n.4 .6 .3 .5 .5\n\n.2 .5 .4 .5 .6\n\n1.0  .86  1.0 .56  .76  1.0 .78  .34  .48  1.0 .65  .87  .32  .56  1.0\n\nMONTECARLO\n\nThe MONTECARLO setting of the TYPE option is used when the data sets being analyzed have been generated and saved using either the REPSAVE option of the MONTECARLO command or by another computer program.  The file named using the FILE option of the DATA command contains a list of the names of the data sets to be analyzed and summarized as in a Monte Carlo study.  This ASCII file is created automatically when the data sets are generated and saved in a prior analysis using the REPSAVE option of the MONTECARLO command.  This file must be created by the user when the data sets are generated and saved using another computer program.  Each record of the file must contain one data set name.  For example, if five data sets are being analyzed, the contents of the file would be:\n\ndata1.dat\n\ndata2.dat\n\ndata3.dat\n\ndata4.dat\n\ndata5.dat\n\nwhere data1.dat, data2.dat, data3.dat, data4.dat, and data5.dat are the names of the five data sets generated and saved using another computer program.  All files must be in the same format.  Files saved using the REPSAVE option are in free format.\n\nWhen the MONTECARLO option is used, the results are presented in a Monte Carlo summary format.  The output includes the population value for each parameter, the average of the parameter estimates across replications, the standard deviation of the parameter estimates across replications, the average of the estimated standard errors across replications, the mean square error for each parameter (M.S.E.), 95 percent coverage, and the proportion of replications for which the null hypothesis that a parameter is equal to zero is rejected at the .05 level.  In addition, the average fit statistics and the percentiles for the fit statistics are given if appropriate.  A description of Monte Carlo output is given in Chapter 12.\n\nIMPUTATION\n\nThe IMPUTATION setting of the TYPE option is used when the data sets being analyzed have been generated using multiple imputation procedures.  The file named using the FILE option of the DATA command must contain a list of the names of the multiple imputation data sets to be analyzed.  Parameter estimates are averaged over the set of analyses.  Standard errors are computed using the average of the squared standard errors over the set of analyses and the between analysis parameter estimate variation (Rubin, 1987; Schafer, 1997).  A chi-square test of overall model fit is provided (Asparouhov & Muthén, 2008c; Enders, 2010).  The ASCII file containing the names of the data sets must be created by the user.  Each record of the file must contain one data set name.  For example, if five data sets are being analyzed, the contents of the file would be:\n\nimp1.dat\n\nimp2.dat\n\nimp3.dat\n\nimp4.dat\n\nimp5.dat\n\nwhere imp1.dat, imp2.dat, imp3.dat, imp4.dat, and imp5.dat are the names of the five data sets created using multiple imputation.\n\nThe NOBSERVATIONS option is required when summary data are analyzed.  When individual data are analyzed, the program counts the number of observations.  The NOBSERVATIONS option can, however, be used with individual data to limit the number of records used in the analysis.  For example, if a data set contains 20,000 observations, it is possible to analyze only the first 1,000 observations by specifying:\n\nNOBSERVATIONS = 1000;\n\nThe NGROUPS option is used for multiple group analysis when summary data are analyzed.  It specifies the number of groups in the analysis.  It is specified as follows:\n\nNGROUPS = 3;\n\nwhich indicates that the analysis is a three-group analysis.  Multiple group analysis is discussed in Chapter 14.\n\nLISTWISE\n\nThe LISTWISE option is used to indicate that any observation with one or more missing values on the set of analysis variables not be used in the analysis.  The default is to estimate the model under missing data theory using all available data.  To turn on listwise deletion, specify:\n\nLISTWISE = ON;\n\nSWMATRIX\n\nThe SWMATRIX option is used with TYPE=TWOLEVEL and weighted least squares estimation to specify the name and location of the file that contains the within- and between-level sample statistics and their corresponding estimated asymptotic covariance matrix.  The univariate and bivariate sample statistics are estimated using one- and two-dimensional numerical integration with a default of 7 integration points.  The INTEGRATION option of the ANALYSIS command can be used to change the default.  It is recommended to save this information and use it in subsequent analyses along with the raw data to reduce computational time during model estimation.  Analyses using this information must have the same set of observed dependent and independent variables, the same DEFINE command, the same USEOBSERVATIONS statement, and the same USEVARIABLES statement as the analysis which was used to save the information.  It is specified as follows:\n\nSWMATRIX = swmatrix.dat;\n\nwhere swmatrix.dat is the file that contains the within- and between-level sample statistics and their corresponding estimated asymptotic covariance matrix.\n\nFor TYPE=IMPUTATION, the file specified contains a list of file names.  These files contain the within- and between-level sample statistics and their corresponding estimated asymptotic covariance matrix for a set of imputed data sets.\n\nVARIANCES\n\nThe VARIANCES option is used to check that the analysis variables do not have variances of zero in the sample used for the analysis.  Checking for variances of zero is the default.  To turn off this check, specify:\n\nVARIANCES = NOCHECK;\n\nThe DATA IMPUTATION command is used when a data set contains missing values to create a set of imputed data sets using multiple imputation methodology.  Imputation refers to the estimation of missing values in a data set to create a data set without missing values.  Multiple imputation refers to the creation of several data sets where missing values have been imputed.  Multiple imputation is carried out using Bayesian estimation.  The multiple imputations are random draws from the posterior distribution of the missing values (Rubin, 1987; Schafer, 1997).  For an overview, see Enders (2010).  The multiple imputation data sets can be used for subsequent model estimation using maximum likelihood or weighted least squares estimation of each data set where the parameter estimates are averaged over the data sets and the standard errors are computed using the Rubin formula (Rubin, 1987).  A chi-square test of overall model fit is provided (Asparouhov & Muthén, 2008c; Enders, 2010).  Plausible values for latent variables in the model can be saved by specifying SAVE=FSCORES in conjunction with the FACTORS option of the SAVEDATA command.", null, "The figure above shows three ways that data imputation can be done.  The first path in the figure uses an unrestricted H1 imputation model and saves the imputed data sets for a subsequent analysis.  In this case, TYPE=BASIC is specified in the ANALYSIS command.  See Example 11.5.  To use the data sets in a subsequent analysis, specify TYPE=IMPUTATION in the DATA command.  See Example 13.13.  The second path in the figure uses an unrestricted H1 imputation model with an estimator other than BAYES.  In this case, the model is estimated immediately after the data are imputed.  See Example 11.6.  The third path in the figure uses an H0 imputation model and ESTIMATOR=BAYES. The H0 model specified in the MODEL command is used to impute the data.  See Example 11.7.\n\nIMPUTE\n\nThe IMPUTE option is used to specify the analysis variables for which missing values will be imputed.  Data can be imputed for all or a subset of the analysis variables.  These variables can be continuous or categorical.  If they are categorical a letter c in parentheses must be included after the variable name.  If a variable is on the CATEGORICAL list in the VARIABLE command, it must have a c in parentheses following its name.  A variable not on the CATEGORICAL list can have a c in parentheses following its name.  Following is an example of how to specify the IMPUTE option:\n\nIMPUTE = y1-y4 u1-u4 (c) x1 x2;\n\nwhere values will be imputed for the continuous variables y1, y2, y3, y4, x1, and x2 and the categorical variables u1, u2, u3, and u4.\n\nThe IMPUTE option has an alternative specification that is convenient when there are several variables that cannot be specified using the list function.  When c in parentheses follows the equal sign, it means that c applies to all of the variables that follow.  For example, the following IMPUTE statement specifies that the variables x1, x3, x5, x7, and x9 are categorical:\n\nIMPUTE = (c) x1 x3 x5 x7 x9;\n\nThe keyword ALL can be used to indicate that values are to be imputed for all variables in the dataset.   The ALL option can be used with the c setting, for example,\n\nIMPUTE = ALL (c);\n\nindicates that all of the variables in the data set are categorical.\n\nNDATASETS\n\nThe NDATASETS option is used to specify the number of imputed data sets to create.  The default is five.  Following is an example of how to specify the NDATASETS option:\n\nNDATASETS = 20;\n\nwhere 20 is the number of imputed data sets that will be created.  The default for the NDATASETS option is 5.\n\nSAVE\n\nThe SAVE option is used to save the imputed data sets for subsequent analysis using TYPE=IMPUTATION in the DATA command.  It is specified as follows:\n\nSAVE = impute*.dat;\n\nwhere the asterisk (*) is replaced by the number of the imputed data set.  A file is also produced that contains the names of all of the data sets.  To name this file, the asterisk (*) is replaced by the word list.\n\nThe FORMAT option is used to specify the format in which the imputed data will be saved.  All dependent and independent variables used in the analysis are saved.  In addition, all other variables that are used in conjunction with the analysis are saved as well as any variables specified using the AUXILIARY option of the VARIABLE command.  The names of the data sets along with the names of the variables saved and the format are printed in the output. The default is to save the analysis variables using a fixed format.\n\nFollowing is an example of how to specify the FORMAT option to save imputed data in a free format:\n\nFORMAT IS FREE;\n\nImputed data can also be saved in a fixed format specified by the user.  The user has the choice of which F or E format the analysis variables are saved in with the format of other saved variables determined by the program.  This option is specified as:\n\nFORMAT IS F2.0;\n\nwhich indicates that all analysis variables will be saved with an F2.0 format.\n\nMODEL\n\nThe MODEL option is used to specify the type of unrestricted H1 model to use for imputation (Asparouhov & Muthén, 2010b).  The MODEL option has three settings:  COVARIANCE, SEQUENTIAL, and REGRESSION.  The default is COVARIANCE.  The COVARIANCE setting uses a model of unrestricted means, variances, and covariances for a set of continuous variables.  The SEQUENTIAL setting uses a sequential regression method also referred to as the chained equations algorithm in line with Raghunathan et al. (2001).  The REGRESSION setting uses a model where variables with missing data are regressed on variables without missing data (Asparouhov & Muthén, 2010b).  To request the sequential regression method, specify:\n\nMODEL = SEQUENTIAL;\n\nVALUES\n\nThe VALUES option is used to provide the values for continuous variables that the imputed data can take.  The default is to put no restrictions on the values that the imputed data can take.  The values must be integers.  For example, four five-category variables not declared as categorical can be restricted to take on only the values of one through five by specifying:\n\nVALUES = y1-y4 (1-5);\n\nThe closest value to the imputed value is used.  If the imputed value is 2.7, the value 3 will be used.\n\nROUNDING\n\nThe ROUNDING option is used to specify the number of decimals that imputed continuous variables will have.  The default is three.  To request that five decimals be used, specify:\n\nROUNDING = y1-y10 (5);\n\nThe value zero is used to specify no decimals, that is, integer values.\n\nTHIN\n\nThe THIN option is used to specify which intervals in the draws from the posterior distribution are used for imputed values.  The default is to use every 100th iteration.  To request that every 200th iteration be used, specify:\n\nTHIN = 200;\n\nThere are six DATA transformation commands.  They are used to rearrange data from a wide to long format, to rearrange data from a long to wide format, to create a binary and a continuous variable from a semicontinuous variable, to create a set of binary variables that are indicators of missing data for another set of variables, to create variables for discrete-time survival modeling where a binary variable represents the occurrence of a single non-repeatable event, and to rearrange longitudinal data from a format where time points represent measurement occasions to a format where time points represent age or another time-related variable.  The DATA transformation commands are executed after the statements in the DEFINE command that come before the CLUSTER_MEAN, CENTER, and STANDARDIZE options of the DEFINE command.  The CLUSTER_MEAN, CENTER, and STANDARDIZE options are then executed in the order mentioned followed by the execution of any statements that follow them.\n\nTHE DATA WIDETOLONG COMMAND\n\nIn growth modeling an outcome measured at four time points can be represented in a data set in two ways.  In the wide format, the outcome is represented as four variables on a single record.  In the long format, the outcome is represented as a single variable using four records, one for each time point. The DATA WIDETOLONG command is used to rearrange data from a multivariate wide format to a univariate long format.\n\nWhen the data are rearranged, the set of outcomes is given a new variable name and ID and repetition variables are created.  These new variable names must be placed on the USEVARIABLES statement of the VARIABLE command if they are used in the analysis.  They must be placed after any original variables.  If the ID variable is used as a cluster variable, this must be specified using the CLUSTER option of the VARIABLE command.\n\nThe creation of the new variables in the DATA WIDETOLONG command occurs after any transformations in the DEFINE command and any of the other DATA transformation commands.  If listwise deletion is used, it occurs after the data have been rearranged.  Following is a description of the options used in the DATA WIDETOLONG command.\n\nWIDE\n\nThe WIDE option is used to identify sets of variables in the wide format data set that will be converted into single variables in the long format data set.  These variables must be variables from the NAMES statement of the VARIABLE command.  The WIDE option is specified as follows:\n\nWIDE = y1-y4 | x1-x4;\n\nwhere y1, y2, y3, and y4 represent one variable measured at four time points and x1, x2, x3, and x4 represent another variable measured at four time points.\n\nLONG\n\nThe LONG option is used to provide names for the new variables in the long format data set.  There should be the same number of names as there are sets of variables in the WIDE statement.  The LONG option is specified as follows:\n\nLONG = y | x;\n\nwhere y is the name assigned to the set of variables y1-y4 on the WIDE statement and x is the name assigned to the set of variables x1-x4.\n\nIDVARIABLE\n\nThe IDVARIABLE option is used to provide a name for the variable that provides information about the unit to which the record belongs.  In univariate growth modeling, this is the person identifier which is used as a cluster variable.  The IDVARIABLE option is specified as follows:\n\nIDVARIABLE = subject;\n\nwhere subject is the name of the variable that contains information about the unit to which the record belongs.  If an id variable is specified using the IDVARIABLE option of the VARIABLE command, the values of this variable are used for the variable specified using the IDVARIABLE option.  This option is not required.\n\nREPETITION\n\nThe REPETITION option is used to provide a name for the variable that contains information on the order in which the variables were measured.  The REPETITION option is specified as follows:\n\nREPETITION = time;\n\nwhere time is the variable that contains information on the order in which the variables were measured.  This variable assigns consecutive values starting with zero to the repetitions.  This variable can be used in a growth model as a time score variable.  This option is not required.\n\nTHE DATA LONGTOWIDE COMMAND\n\nIn growth modeling an outcome measured at four time points can be represented in a data set in two ways.  In the long format, the outcome is represented as a single variable using four records, one for each time point.  In the wide format, the outcome is represented as four variables on a single record.  The DATA LONGTOWIDE command is used to rearrange data from a univariate long format to a multivariate wide format.\n\nWhen the data are rearranged, the outcome is given a set of new variable names.  These new variable names must be placed on the USEVARIABLES statement of the VARIABLE command if they are used in the analysis.  They must be placed after any original variables.\n\nThe creation of the new variables in the DATA LONGTOWIDE command occurs after any transformations in the DEFINE command and any of the other DATA transformation commands.  Following is a description of the options used in the DATA LONGTOWIDE command.\n\nLONG\n\nThe LONG option is used to identify the variables in the long format data set that will be used to create sets of variables in the wide format data set.  These variables must be variables from the NAMES statement of the VARIABLE command.  The LONG option is specified as follows:\n\nLONG = y | x;\n\nwhere y and x are two variables that have been measured at multiple time points which are represented by multiple records.\n\nWIDE\n\nThe WIDE option is used to provide sets of names for the new variables in the wide format data set.  There should be the same number of sets of names as there are variables in the LONG statement.  The number of names in each set corresponds to the number of time points at which the variables in the long data set were measured.  The WIDE option is specified as follows:\n\nWIDE = y1-y4 | x1-x4;\n\nwhere y1, y2, y3, and y4 are the names for the variable y in the wide data set and x1, x2, x3, and x4 are the names for the variable x in the wide data set.\n\nIDVARIABLE\n\nThe IDVARIABLE option is used to identify the variable in the long data set that contains information about the unit to which each record belongs.  The IDVARIABLE option is specified as follows:\n\nIDVARIABLE = subject;\n\nwhere subject is the name of the variable that contains information about the unit to which each record belongs.  This variable becomes the identifier for each observation in the wide data set.  The IDVARIABLE option of the VARIABLE command cannot be used to select a different identifier.\n\nREPETITION\n\nThe REPETITION option is used to identify the variable that contains information about the times at which the variables in the long data set were measured.  The REPETITION option is specified as follows:\n\nREPETITION = time;\n\nwhere time is the variable that contains information about the time at which the variables in the long data set were measured.  If the time variable does not contain consecutive integer values starting at zero, the time values must be given.  For example,\n\nREPETITION = time (4 8 16);\n\nspecifies that the values 4,  8, and 16 are the values of the variable time.  The number of values should be equal to the number of variables in the WIDE option and the order of the values should correspond to the order of the variables.\n\nTHE DATA TWOPART COMMAND\n\nThe DATA TWOPART command is used to create a binary and a continuous variable from a continuous variable with a floor effect for use in two-part (semicontinuous) modeling (Duan et al., 1983; Olsen & Schafer, 2001).  One situation where this occurs is when variables have a preponderance of zeros.\n\nA set of binary and continuous variables are created using the value specified in the CUTPOINT option of the DATA TWOPART command or zero which is the default.  The two variables are created using the following rules:\n\n1.       If the value of the original variable is missing, both the new binary and the new continuous variable values are missing.\n\n2.      If the value of the original variable is greater than the cutpoint value, the new binary variable value is one and the new continuous variable value is the log of the original variable as the default.\n\n3.      If the value of the original variable is less than or equal to the cutpoint value, the new binary variable value is zero and the new continuous variable value is missing.\n\nThe new variables must be placed on the USEVARIABLES statement of the VARIABLE command if they are used in the analysis.  These variables must come after any original variables.  If the binary variables are used as dependent variables in the analysis, they must be declared as categorical using the CATEGORICAL option of the VARIABLE command.\n\nThe creation of the new variables in the DATA TWOPART command occurs after any transformations in the DEFINE command and before any transformations using the DATA MISSING command.  Following is a description of the options used in the DATA TWOPART command.\n\nNAMES\n\nThe NAMES option identifies the variables that are used to create a set of binary and continuous variables.  These variables must be variables from the NAMES statement of the VARIABLE command.  The NAMES option is specified as follows:\n\nNAMES = smoke1-smoke4;\n\nwhere smoke1, smoke2, smoke3, and smoke4 are the semicontinuous variables that are used to create a set of  binary and continuous variables.\n\nCUTPOINT\n\nThe CUTPOINT option is used to provide the value that is used to divide the original variables into a set of binary and continuous variables.  The default value for the CUTPOINT option is zero.   The CUTPOINT option is specified as follows:\n\nCUTPOINT = 1;\n\nwhere variables are created based on values being less than or equal to one or greater than one.\n\nBINARY\n\nThe BINARY option is used to assign names to the new set of binary variables.  The BINARY option is specified as follows:\n\nBINARY = u1-u4;\n\nwhere u1, u2, u3, and u4 are the names of the new set of binary variables.\n\nCONTINUOUS\n\nThe CONTINUOUS option is used to assign names to the new set of continuous variables.  The CONTINUOUS option is specified as follows:\n\nCONTINUOUS = y1-y4;\n\nwhere y1, y2, y3, and y4 are the names of the new set of continuous variables.\n\nTRANSFORM\n\nThe TRANSFORM option is used to transform the new continuous variables.  The LOG function is the default.  The following functions can be used with the TRANSFORM option:\n\nLOG                base e log                     LOG (y);\n\nLOG10                        base 10 log                  LOG10 (y);\n\nEXP                 exponential                  EXP (y);\n\nSQRT               square root                   SQRT (y);\n\nABS                 absolute value              ABS(y);\n\nSIN                  sine                              SIN (y);\n\nCOS                 cosine                          COS (y);\n\nTAN                tangent                         TAN(y);\n\nASIN               arcsine                         ASIN (y);\n\nACOS              arccosine                     ACOS (y);\n\nATAN              arctangent                    ATAN (y);\n\nNONE              no transformation\n\nThe TRANSFORM option is specified as follows:\n\nTRANSFORM = NONE;\n\nwhere specifying NONE results in no transformation of the new continuous variables.\n\nTHE DATA MISSING COMMAND\n\nThe DATA MISSING command is used to create a set of binary variables that are indicators of missing data or dropout for another set of variables.  Dropout indicators can be scored as discrete-time survival indicators or dropout dummy indicators.  The new variables can be used to study non-ignorable missing data (Little & Rubin, 2002; Muthén et al., 2011).\n\nThe new variables must be placed on the USEVARIABLES statement of the VARIABLE command if they are used in the analysis.  These variables must come after any original variables.  If the binary variables are used as dependent variables in the analysis, they must be declared as categorical using the CATEGORICAL option of the VARIABLE command.\n\nThe creation of the new variables in the DATA MISSING command occurs after any transformations in the DEFINE command and after any transformations using the DATA TWOPART command.  Following is a description of the options used in the DATA MISSING command.\n\nNAMES\n\nThe NAMES option identifies the set of variables that are used to create a set of binary variables that are indicators of missing data.  These variables must be variables from the NAMES statement of the VARIABLE command.  The NAMES option is specified as follows:\n\nNAMES = drink1-drink4;\n\nwhere drink1, drink2, drink3, and drink4 are the set of variables for which a set of binary indicators of missing data are created.\n\nBINARY\n\nThe BINARY option is used to assign names to the new set of binary variables.  The BINARY option is specified as follows:\n\nBINARY = u1-u4;\n\nwhere u1, u2, u3, and u4 are the names of the new set of binary variables.\n\nFor TYPE=MISSING, the number of binary indicators is equal to the number of variables in the NAMES statement.  For TYPE=SDROPOUT and TYPE=DDROPOUT, the number of binary indicators is one less than the number of variables in the NAMES statement because dropout cannot occur before the second time point an individual is observed.\n\nTYPE\n\nThe TYPE option is used to specify how missingness is coded.  It has three settings:  MISSING, SDROPOUT, and DDROPOUT.  The default is MISSING.  For the MISSING setting, a binary missing data indicator variable is created.  For the SDROPOUT setting, which is used with selection missing data modeling, a binary discrete-time (event-history) survival dropout indicator is created.  For the DDROPOUT setting, which is used with pattern-mixture missing data modeling, a binary dummy dropout indicator is created.  The TYPE option is specified as follows:\n\nTYPE = SDROPOUT;\n\nFollowing are the rules for creating the set of binary variables for the MISSING setting:\n\n1.      If the value of the original variable is missing, the new binary variable value is one.\n\n2.      If the value of the original variable is not missing, the new binary variable value is zero.\n\nFor the SDROPOUT and DDROPOUT settings, the set of indicator variables is defined by the last time point an individual is observed.\n\nFollowing are the rules for creating the set of binary variables for the SDROPOUT setting:\n\n1.        The value one is assigned to the time point after the last time point an individual is observed.\n\n2.        The value missing is assigned to all time points after the value of one.\n\n3.        The value zero is assigned to all time points before the value of one.\n\nFollowing are the rules for creating the set of binary variables for the DDROPOUT setting:\n\n1.      The value one is assigned to the time point after the last time point an individual is observed.\n\n2.      The value zero is assigned to all other time points.\n\nDESCRIPTIVE\n\nThe DESCRIPTIVE option is used in conjunction with TYPE=BASIC of the ANALYSIS command and the SDROPOUT and DDROPOUT settings of the TYPE option to specify the sets of variables for which additional descriptive statistics are computed.  For each variable, the mean and standard deviation are computed using all observations without missing on the variable.  Means and standard deviations are provided for the following sets of observations whose definitions are based on missing data patterns:\n\nDropouts after each time point – Individuals who drop out before the next time point and do not return to the study\n\nNon-dropouts after each time point – Individuals who do not drop out before the next time point\n\nTotal Dropouts – Individuals who are missing at the last time point\n\nDropouts no intermittent missing – Individuals who do not return to\n\nthe study once they have dropped out\n\nDropouts intermittent missing – Individuals who drop out and return\n\nto the study\n\nTotal Non-dropouts – Individuals who are present at the last time point\n\nNon-dropouts complete data – Individuals with complete data\n\nNon-dropouts intermittent missing – Individuals who have missing\n\ndata but are present at the last time point\n\nTotal sample\n\nThe first set of variables given in the DESCRIPTIVE statement is the outcome variable.  This set of variables defines the number of time points in the model.  If the other sets of variables do not have the same number of time points, the asterisk (*) is used as a placeholder.  Sets of variables are separated by the | symbol.  Following is an example of how to specify the DESCRIPTIVE option:\n\nDESCRIPTIVE = y0-y5 | x0-x5 | * z1-z5;\n\nThe first set of variables, y0-y5 defines the number of time points as six.  The last set of variables has only five measures.  An asterisk (*) is used as a placeholder for the first time point.\n\nTHE DATA SURVIVAL COMMAND\n\nThe DATA SURVIVAL command is used to create variables for discrete-time survival modeling where a binary discrete-time survival (event-history) variable represents whether or not a single non-repeatable event has occurred in a specific time period.\n\nA set of binary discrete-time survival variables is created using the following rules:\n\n1.      If the value of the original variable is missing, the new binary variable value is missing.\n\n2.      If the value of the original variable is greater than the cutpoint value, the new binary variable value is one which represents that the event has occurred.\n\n3.      If the value of the original variable is less than or equal to the cutpoint value, the new binary variable value is zero which represents that the event has not occurred.\n\n4.      After a discrete-time survival variable for an observation is assigned the value one, subsequent discrete-time survival variables for that observation are assigned the value of the missing value flag.\n\nThe new variables must be placed on the USEVARIABLES statement of the VARIABLE command if they are used in the analysis.  These variables must come after any original variables.  If the binary variables are used as dependent variables in the analysis, they must be declared as categorical using the CATEGORICAL option of the VARIABLE command.\n\nThe creation of the new variables in the DATA SURVIVAL command occurs after any transformations in the DEFINE command, the DATA TWOPART command, and the DATA MISSING command.  Following is a description of the options used in the DATA SURVIVAL command.\n\nNAMES\n\nThe NAMES option identifies the variables that are used to create a set of binary event-history variables.  These variables must be variables from the NAMES statement of the VARIABLE command.  The NAMES option is specified as follows:\n\nNAMES = dropout1-dropout4;\n\nwhere dropout1, dropout2, dropout3, and dropout4  are the variables that are used to create a set of binary event-history variables.\n\nCUTPOINT\n\nThe CUTPOINT option is used provide the value to use to create a set of binary event-history variables from a set of original variables.  The default value for the CUTPOINT option is zero.   The CUTPOINT option is specified as follows:\n\nCUTPOINT = 1;\n\nwhere variables are created based on values being less than or equal to one or greater than one.\n\nBINARY\n\nThe BINARY option is used to assign names to the new set of binary event-history variables.  The BINARY option is specified as follows:\n\nBINARY = u1-u4;\n\nwhere u1, u2, u3, and u4 are the names of the new set of binary event-history variables.\n\nTHE DATA COHORT COMMAND\n\nThe DATA COHORT command is used to rearrange longitudinal data from a format where time points represent measurement occasions to a format where time points represent age or another time-related variable.  It is available only for continuous outcomes.  Multiple cohort analysis is described in Chapter 14.\n\nThe new variables must be placed on the USEVARIABLES statement of the VARIABLE command if they are used in the analysis.\n\nThese variables must come after any original variables.  The creation of the new variables in the DATA COHORT command occurs after any transformations in the DEFINE command.  Following is a description of the options used in the DATA COHORT command.\n\nThe COHORT option is used when data have been collected using a multiple cohort design.  The COHORT option is used in conjunction with the TIMEMEASURES and TNAMES options that are described below.  Variables used with the COHORT option must be variables from the NAMES statement of the VARIABLE command.  Following is an example of how the COHORT option is specified:\n\nCOHORT IS birthyear (63 64 65);\n\nwhere birthyear is a variable in the data set to be analyzed, and the numbers in parentheses following the variable name are the values that the birthyear variable contains.  Birth years of 1963, 1964, and 1965 are included in the example below.  The cohort variable must contain only integer values.\n\nCOPATTERN\n\nThe COPATTERN option is used when data are both missing by design and have been collected using a multiple cohort design.  Variables used with the COPATTERN option must be variables from the NAMES statement of the VARIABLE command.  Following is an example of how the COPATTERN option is specified:\n\nCOPATTERN = cohort (67=y1 y2 y3 68=y4 y5 y6 69=y2 y3 y4);\n\nwhere cohort is a variable that provides information about both the cohorts included in the data set and the patterns of variables for each cohort.   In the example above, individuals in cohort 67 should have information on y1, y2, and y3; individuals in cohort 68 should have information on y4, y5, and y6; and individuals in cohort 69 should have information on y2, y3, and y4.  Individuals who have missing values on any variable for which they are expected to have information are eliminated from the analysis.  The copattern variable must contain only integer values.\n\nCOHRECODE\n\nThe COHRECODE option is used in conjunction with either the COHORT or COPATTERN options to recode the values of the cohort or copattern variable.  The COHRECODE option is specified as follows:\n\nCOHRECODE = (1=67 2=68 3=69 4=70);\n\nwhere the original values of 1, 2, 3, and 4 of the cohort or copattern  variable are recoded to 67, 68, 69, and 70, respectively.  If the COHRECODE option is used, all values of the original variable must be recoded to be included in the analysis.  Observations with values that are not recoded will be eliminated from the analysis.\n\nThe TIMEMEASURES option is used with multiple cohort data to specify the years in which variables to be used in the analysis were measured.  It is used in conjunction with the COHORT and COPATTERN options to determine the ages that are represented in the multiple cohort data set.  Variables used with the TIMEMEASURES option must be variables from the NAMES statement of the VARIABLE command.  Following is an example of how the TIMEMEASURES option is specified:\n\nTIMEMEASURES = y1 (82) y2 (84) y3 (85) y4 (88) y5 (94);\n\nwhere y1, y2, y3, y4, and y5 are original variables that are to be used in the analysis, and the numbers in parentheses following each of these variables represent the years in which they were measured.  In this situation, y1, y2, y3, y4, and y5 are the same measure, for example, frequency of heavy drinking measured on multiple occasions.\n\nThe TIMEMEASURES option can be used to identify more than one measure that has been measured repeatedly as shown in the following example:\n\nTIMEMEASURES =    y1 (82) y2 (84) y3 (85) y4 (88) y5 (94) |\n\ny6 (82) y7 (85) y8 (90) y9 (95) |\n\nx1 (83) x2(88) x3 (95);\n\nwhere each set of variables separated by the symbol | represents repeated measures of that variable.  For example, y1, y2, y3, y4, and y5 may represent repeated measures of heavy drinking; y6, y7, y8, and y9 may represent repeated measures of alcohol dependence; and x1, x2, and x3 may represent repeated measures of marital status.\n\nThe TNAMES option is used to generate variable names for the new multiple cohort analysis variables.  A root name is specified for each set of variables mentioned using the TIMEMEASURES option.  The age of the respondent at the time the variable was measured is attached to the root name.  The age is determined by subtracting the cohort value from the year the variable was measured.  Following is an example of how the TNAMES option is specified:\n\nTNAMES = hd;\n\nwhere hd is the root name for the new variables.\n\nFollowing is an example of how the TNAMES option is specified for the TIMEMEASURES and COHORT options when multiple outcomes are measured:\n\nTNAMES = hd | dep | marstat;\n\nFollowing are the variables that would be created:\n\nhd22, hd24, hd25, hd26, hd27, hd28, hd29, hd30,\n\nhd31, hd32, hd33, hd34, hd36, hd37, hd38, hd39,\n\ndep22, dep24, dep25, dep26, dep27, dep28, dep29, dep30,\n\ndep32, dep33, dep35, dep36, dep37, dep38, dep39, dep40,\n\nmarstat23, marstat25, marstat26, marstat27, marstat28\n\nmarstat30, marstat31, marstat32, marstat33, marstat35\n\nmarstat37, marstat38, marstat39, marstat40.\n\nThere is no hd variable for ages 23 and 35, no dep variable for ages 23, 31, and 34, and no marstat variable for ages 24, 29, 34, and 36 because these ages are not represented by the combination of cohort values and years of measurement.\n\nThe VARIABLE command is used to provide information about the variables in the data set to be analyzed.  The VARIABLE command has options for naming and describing the variables in the data set to be analyzed, subsetting the data set on observations, subsetting the data set on variables, and specifying missing values for each variable.\n\nFollowing are the options for the VARIABLE command:\n\n VARIABLE: NAMES ARE names of variables in the data set; USEOBSERVATIONS ARE conditional statement to select observations; all observations in data set USEVARIABLES ARE names of analysis variables; all variables in NAMES MISSING ARE variable (#); . ; * ; BLANK; CENSORED ARE names, censoring type, and inflation status for censored  dependent variables; CATEGORICAL ARE names of binary and ordered categorical (ordinal) dependent variables (model); NOMINAL ARE names of unordered categorical (nominal) dependent variables; COUNT ARE names of count variables (model); DSURVIVAL ARE names of discrete-time survival variables; GROUPING IS name of grouping variable (labels); IDVARIABLE IS name of ID variable; _RECNUM; FREQWEIGHT IS name of frequency (case) weight variable; TSCORES ARE names of observed variables with information on individually-varying times of observation; AUXILIARY = names of auxiliary variables; names of auxiliary variables (M); names of auxiliary variables (R3STEP); names of auxiliary variables (R); names of auxiliary variables (BCH); names of auxiliary variables (DU3STEP); names of auxiliary variables (DCATEGORICAL); names of auxiliary variables (DE3STEP); names of auxiliary variables (DCONTINUOUS); names of auxiliary variables (E); CONSTRAINT = names of observed variables that can be used in the MODEL CONSTRAINT command; PATTERN IS name of pattern variable (patterns); STRATIFICATION IS name of stratification variable; CLUSTER IS name of cluster variables; WEIGHT IS name of sampling weight variable;\n\n WTSCALE IS UNSCALED; CLUSTER CLUSTER; ECLUSTER; BWEIGHT name of between-level sampling weight variable; B2WEIGHT IS name of the level 2 sampling weight variable; B3WEIGHT IS name of the level 3 sampling weight variable; BWTSCALE IS UNSCALED; SAMPLE; SAMPLE REPWEIGHTS ARE names of replicate weight variables; SUBPOPULATION IS conditional statement to select subpopulation; all observations in data set FINITE = name of  variable; name of variable (FPC); name of variable (SFRACTION); name of variable (POPULATION); FPC CLASSES = names of categorical latent variables (number of latent classes); KNOWNCLASS = name of categorical latent variable with known class membership (labels); TRAINING = names of training variables; names of variables (MEMBERSHIP); names of variables (PROBABILITIES); names of variables (PRIORS); MEMBERSHIP WITHIN ARE WITHIN ARE (label) names of individual-level observed variables; names of individual-level observed variables; BETWEEN ARE BETWEEN ARE (label) names of cluster-level observed variables; names of cluster-level observed variables; SURVIVAL ARE names and time intervals for time-to-event variables; TIMECENSORED ARE   LAGGED ARE TINTERVAL IS names and values of variables that contain right censoring information; names of lagged variables (lag); name of time variable (interval); (0 = NOT 1 = RIGHT)\n\nThe VARIABLE command is a required command.  The NAMES option is a required option.  Default settings are shown in the last column.  If the default settings are appropriate for the analysis, nothing needs to be specified except the NAMES option.\n\nNote that commands and options can be shortened to four or more letters.  Option settings can be referred to by either the complete word or the part of the word shown above in bold type.\n\nThe NAMES option is used to assign names to the variables in the data set named using the FILE option of the DATA command.  This option is required.  The variable names can be separated by blanks or commas and can be up to 8 characters in length.  Variable names must begin with a letter.  They can contain only letters, numbers, and the underscore symbol.  The program makes no distinction between upper and lower case letters.  Following is an example of how the NAMES option is specified:\n\nNAMES ARE gender ethnic income educatn drink_st agedrink;\n\nVariable names are generated if a list of variables is specified using the NAMES option.  For example,\n\nNAMES ARE y1-y5 x1-x3;\n\ngenerates the variable names y1 y2 y3 y4 y5 x1 x2 x3.\n\nNAMES ARE itema-itemd;\n\ngenerates the variable names itema itemb itemc itemd.\n\nThere are options for selecting a subset of observations or variables from the data set named using the FILE option of the DATA command.  The USEOBSERVATIONS option is used to select a subset of observations from the data set.  The USEVARIABLES option is used to select a subset of variables from the data set.\n\nThe USEOBSERVATIONS option is used to select observations for an analysis from the data set named using the FILE option of the DATA command.  This option is not available for summary data.  The USEOBSERVATIONS option selects only those observations that satisfy the conditional statement specified after the equal sign.  For example, the following statement selects observations with the variable ethnic equal to 1 and the variable gender equal to 2:\n\nUSEOBSERVATIONS = ethnic EQ 1 AND gender EQ 2;\n\nOnly variables from the NAMES statement of the VARIABLE command can be used in the conditional statement of the USEOBSERVATIONS option.  Logical operators, not arithmetic operators, must be used in the conditional statement.  Following are the logical operators that can be used in conditional statements to select observations for analysis:\n\nAND    logical and\n\nOR       logical or\n\nNOT    logical not\n\nEQ       equal                                        ==\n\nNE       not equal                                  /=\n\nGE       greater than or equal to                        >=\n\nLE        less than or equal to                 <=\n\nGT       greater than                              >\n\nLT        less than                                   <\n\nAs shown above, some of the logical operators can be referred to in two different ways.  For example, equal can be referred to as EQ or ==.\n\nThe USEVARIABLES option is used to select variables for an analysis. It can be used with individual data or summary data.  Variables included on the USEVARIABLES statement can be variables from the NAMES statement of the VARIABLE command and variables created using the DEFINE command and the DATA transformation commands.  New variables created using the DEFINE command and the DATA transformation commands must be included on the USEVARIABLES statement.\n\nThe USEVARIABLES option identifies the observed dependent and independent variables that are used in an analysis.  Variables with special functions such as grouping variables do not need to be included on the USEVARIABLES statement unless they are new variables created using the DEFINE command or the DATA transformation commands.  Following is an example of how to specify the USEVARIABLES option:\n\nUSEVARIABLES ARE gender income agefirst;\n\nVariables on the USEVARIABLES statement must follow a particular order.  The order of the variables is important because it determines the order of variables used with the list function.  The set of original variables from the NAMES statement of the VARIABLE command must be listed before the set of new variables created using the DEFINE command or the DATA transformation commands.  Within the two sets of original and new variables, any order is allowed.\n\nIf all of the original variables plus some of the new variables are used in the analysis, the keyword ALL can be used as the first entry in the USEVARIABLES statement.  This indicates that all of the original variables from the NAMES statement of the VARIABLE command are used in the analysis.  The keyword ALL is followed by the names of the new variables created using the DEFINE command or the DATA transformation commands that will be used in the analysis.  Following is an example of how to specify the USEVARIABLES option for this situation:\n\nUSEVARIABLES = ALL hd1 hd2 hd3;\n\nwhere ALL refers to the total set of original variables and hd1, hd2, and hd3 are new variables created using the DEFINE command or the DATA transformation commands.\n\nThe MISSING option is used to identify the values or symbol in the analysis data set that are treated as missing or invalid.  Any numeric value and the non-numeric symbols of the period, asterisk (*), or blank can be used as missing value flags.  There is no default missing value flag.  Numeric and non-numeric missing value flags cannot be combined. The blank cannot be used as a missing value flag for data in free format.  When a list of missing value flags contains a negative number, the entries must be separated by commas.\n\nThe period (.), the asterisk (*), or the blank can be used as non-numeric missing value flags.  Only one non-numeric missing value flag can be used for a particular data set.  This missing value flag applies to all variables in the data set.  The blank cannot be used with free format data.  With fixed format data, blanks in the data not declared as missing value flags are treated as zeroes.\n\nThe following command indicates that the period is the missing value flag for all variables in the data set:\n\nMISSING ARE . ;\n\nThe blank can be a missing value flag only in fixed format data sets.  The following command indicates that blanks are to be considered as missing value flags:\n\nMISSING = BLANK;\n\nAny number of numeric values can be specified as missing value flags for the complete data set or for individual variables.  The keyword ALL can be used with the MISSING option if all variables have the same numeric value(s) as missing value flags.\n\nThe following statement specifies that the number 9 is the missing value flag for all variables in the data set:\n\nMISSING ARE ALL (9);\n\nThe following example specifies that for the variable ethnic, the numbers 9 and 99 are missing value flags, while for the variable y1, the number 1 is the missing value flag:\n\nMISSING ARE ethnic (9 99) y1 (1);\n\nThe list function can be used with the MISSING option to specify a list of missing value flags and/or a set of variables.  The order of variables in the list is determined by the order of variables in the NAMES statement of the VARIABLE command.  Values of 9, 99, 100, 101, and 102 can be declared as missing value flags for all variables in a data set by the following specification:\n\nMISSING ARE ALL (9 99-102);\n\nMissing values can be specified for a list of variables as follows:\n\nMISSING ARE gender-income (9 30 98-102);\n\nThe statement above specifies that the values of 9, 30, 98, 99, 100, 101, and 102 are missing value flags for the list of variables beginning with gender and ending with income.\n\nIf a single missing value flag is negative, it can be specified as described above.  If there are several negative missing value flags, they must be separated by commas to distinguish between the list function and a negative value.  The following example specifies that for the variable ethnic, the numbers -9 and -99 are missing value flags.\n\nMISSING ARE ethnic (-9, -99);\n\nThe list function can be used with negative missing value flags.  It is specified as:\n\nMISSING = ALL (-778- -775);\n\nThe statement above specifies that the values of -778, -777, -776, and -775 are missing value flags for all variables in the data set.\n\nAll observed dependent variables are assumed to be measured on a continuous scale unless the CENSORED, CATEGORICAL, NOMINAL, and/or COUNT options are used.  The specification of the scale of the dependent variables determines how the variables are treated in the model and its estimation.  Independent variables can be binary or continuous.   The scale of the independent variables has no influence on the model or its estimation.  The distinction between dependent and independent variables is described in Chapter 17.\n\nVariables named using the CENSORED, CATEGORICAL, NOMINAL, and/or COUNT options can be variables from the NAMES statement of the VARIABLE command and variables created using the DEFINE command and the DATA transformation commands.\n\nCENSORED\n\nThe CENSORED option is used to specify which dependent variables are treated as censored variables in the model and its estimation, whether they are censored from above or below, and whether a censored or censored-inflated model will be estimated.\n\nThe CENSORED option is specified as follows for a censored model:\n\nCENSORED ARE y1 (a) y2 (b) y3 (a) y4 (b);\n\nwhere y1, y2, y3, y4 are censored dependent variables in the analysis.  The letter a in parentheses following the variable name indicates that the variable is censored from above.  The letter b in parentheses following the variable name indicates that the variable is censored from below.  The lower and upper censoring limits are determined from the data.\n\nThe CENSORED option is specified as follows for a censored-inflated model:\n\nCENSORED ARE y1 (ai) y2 (bi) y3 (ai) y4 (bi);\n\nwhere y1, y2, y3, y4 are censored dependent variables in the analysis.  The letters ai in parentheses following the variable name indicate that the variable is censored from above and that a censored-inflated model will be estimated.  The letters bi in parentheses following the variable name indicate that the variable is censored from below and that a censored-inflated model will be estimated.  The lower and upper censoring limits are determined from the data.\n\nWith a censored-inflated model, two variables are considered, a censored variable and an inflation variable.  The censored variable takes on values for individuals who are able to assume values of the censoring point and beyond.  The inflation variable is a binary latent variable for  which the value one denotes that an individual is unable to assume any value except the censoring point.  The inflation variable is referred to by adding to the name of the censored variable the number sign (#) followed by the number 1.  In the example above, the censored variables available for use in the MODEL command are y1, y2, y3, and y4, and the inflation variables available for use in the MODEL command are y1#1, y2#1, y3#1, and y4#1.\n\nThe CATEGORICAL option is used to specify which dependent variables are treated as binary or ordered categorical (ordinal) variables in the model and its estimation and the type of model to be estimated.  Both probit and logistic regression models can be estimated for categorical variables.  For binary variables, the following IRT models can be estimated:  two-parameter normal ogive, two-parameter logistic, three-parameter logistic, and four-parameter logistic.  For ordered categorical (ordinal) variables, the following IRT models can be estimated:  generalized partial credit with logistic and graded-response with probit (normal ogive) and logistic.  For a nominal IRT model, use the NOMINAL option.\n\nFor categorical dependent variables, there are as many thresholds as there are categories minus one.  The thresholds are referred to in the MODEL command by adding to the variable name the dollar sign (\\$) followed by a number.  The threshold for a binary variable u1 is referred to as u1\\$1.  The two thresholds for a three-category variable u2 are referred to as u2\\$1 and u2\\$2.  Ordered categorical dependent variables cannot have more than 10 categories.  The number of categories is determined from the data.\n\nThe CATEGORICAL option is specified as follows:\n\nCATEGORICAL ARE u2 u3 u7-u13;\n\nwhere u2, u3, u7, u8, u9, u10, u11, u12, and u13 are binary or ordered categorical dependent variables in the analysis.  With weighted least squares and Bayes estimation, a probit model is estimated.  For binary variables, this is a two-parameter normal ogive model.  For ordered categorical (ordinal) variables, this is a graded response model.  With maximum likelihood estimation, a logistic model is estimated as the default.  For binary variables, this is a two-parameter logistic model. For ordered categorical (ordinal) variables, this is a proportional odds model which is the same as a graded response model.   Probit models can also be estimated with maximum likelihood estimation using the LINK option of the ANALYSIS command.\n\nThe CATEGORICAL option for a generalized partial credit model is specified as follows:\n\nCATEGORICAL = u1 –u3 (gpcm) u10 (gpcm);\n\nwhere the variables u1, u2, u3, and u10 are ordered categorical (ordinal) variables for which a generalized partial credit model will be estimated.  The partial credit model has c-1 step parameters for an item with c categories and one slope parameter (Asparouhov & Muthén, 2016).  The step parameters are referred to in the same way as thresholds.  The first step parameter for a three-category ordered categorical (ordinal) variable u1 is referred to as u1\\$1.  The second step parameter is referred to as u1\\$2.\n\nThe CATEGORICAL option for a three-parameter logistic model is specified as follows:\n\nCATEGORICAL = u1 –u3 (3pl) u10 (3pl);\n\nwhere the variables u1, u2, u3, and u10 are binary variables for which a three-parameter logistic model will be estimated.  The guessing parameter cannot be referred to directly.  Instead a parameter related to the guessing parameter is referred to (Asparouhov & Muthén, 2016).  This parameter is referred to as the second threshold.  The first threshold for a binary variable u1 is referred to as u1\\$1.  The second threshold is referred to as u1\\$2.\n\nThe CATEGORICAL option for a four-parameter logistic model is specified as follows:\n\nCATEGORICAL = u1 –u3 (4pl) u10 (4pl);\n\nwhere the variables u1, u2, u3, and u10 are binary variables for which a four-parameter logistic model will be estimated.  The lower asymptote (guessing) and upper asymptote parameters cannot be referred to directly.  Instead a parameter which is related to the lower asymptote (guessing) and a parameter which is related to the upper asymptote parameter are referred to (Asparouhov & Muthén, 2016).  The parameter related to the lower asymptote (guessing) parameter is referred to as the second threshold.  The parameter related to the upper asymptote parameter is referred to as the third threshold.  The first threshold for a binary variable u1 is referred to as u1\\$1.  The second threshold is referred to as u1\\$2.  The third threshold is referred to as u1\\$3.\n\nRECODING OF DEPENDENT VARIABLES\n\nThe estimation of the model for binary or ordered categorical dependent variables uses zero to denote the lowest category, one to denote the second lowest category, two to denote the third lowest category, etc.  If the variables are not coded this way in the data, they are automatically recoded as described below.  When data are saved for subsequent analyses, the recoded categories are saved.\n\nFollowing are examples of situations in which data are recoded by the program:\n\nCategories in Original Data      Categories in Recoded Data\n\n1 2 3 4                                     0 1 2 3\n\n2 3 4 5                                     0 1 2 3\n\n2 5 8 9                                     0 1 2 3\n\n0 1                                           no recode needed\n\n1 2                                           0 1\n\nIn most situations, the default recoding is appropriate.  In multiple group analysis and growth modeling, the default recoding may not be appropriate because the categories observed in the data for a variable may not be the same across groups or time.  For example, it is sometimes the case that individuals are observed in lower categories at earlier time points and higher categories at later time points.  Several variations of the CATEGORICAL option are available for these situations.  These are allowed only for maximum likelihood estimation.\n\nUsing the automatic recoding, each variable is recoded using the categories found in the data for that variable.  Following is an example of how to specify the CATEGORICAL option so that each variable is recoded using the categories found in the data for a set of variables:\n\nCATEGORICAL u1-u3 (*);\n\nwhere u1, u2, and u3 are a set of ordered categorical variables and the asterisk (*) in parentheses indicates that the categories of each variable are to be recoded using the categories found in the data for the set of variables not for each variable.  Based on the original data shown in the table below, where the rows represent observations and the columns represent variables, the set of variables are found to have four possible categories:  1, 2, 3, and 4.   The variable u1 has observed categories 1 and 2; u2 has observed categories 1, 2, and 3; and u3 has observed categories 2, 3, and 4.  The recoded values are shown in the table below.\n\n Categories in the Original Data Set Categories in the Recoded Data Set u1 u2 u3 u1 u2 u3 1 2 3 0 1 2 1 1 2 0 0 1 2 2 2 1 1 1 2 3 4 1 2 3\n\nThe CATEGORICAL option can be used to give a set of categories that are allowed for a variable or set of variables rather than having these categories determined from the data.  Following is an example of how to specify this:\n\nCATEGORICAL = u1-u3 (1-6);\n\nwhere the set of variables u1, u2, and u3 can have the categories of 1, 2, 3, 4, 5, and 6.  In this example, 1 will be recoded as 0, 2 as 1, 3 as 2, 4 as 3, 5 as 4, and 6 as 5.\n\nAnother variation of this is:\n\nCATEGORICAL = u1-u3 (2 4 6);\n\nwhere the set of variables u1, u2, and u3 can have the categories 2, 4, and 6.  In this example, 2 will be recoded as 0, 4 as 1, and 6 as 2.\n\nThe CATEGORICAL option can be used to specify that different sets of variables have different sets of categories by using the | symbol.  For example,\n\nCATEGORICAL = u1-u3 (*) | u4-u6 (2-5) | u7-u9;\n\nspecifies that for the variables u1, u2, and u3, the possible categories are taken from the data for the set of variables; for the variables u4, u5, and u6, the possible categories are 2, 3, 4, and 5; and for the variables u7, u8, and u9, the possible categories are the default, that is, the possible categories are taken from the data for each variable.\n\nNOMINAL\n\nThe NOMINAL option is used to specify which dependent variables are treated as unordered categorical (nominal) variables in the model and its estimation.  Unordered categorical dependent variables cannot have more than 10 categories.  The number of categories is determined from the data.  The NOMINAL option is specified as follows:\n\nNOMINAL ARE u1 u2 u3 u4;\n\nwhere u1, u2, u3, u4 are unordered categorical dependent variables in the analysis.\n\nFor nominal dependent variables, all categories but the last category can be referred to.  The last category is the reference category.  The categories are referred to in the MODEL command by adding to the variable name the number sign (#) followed by a number.  The three categories of a four-category nominal variable are referred to as u1#1, u1#2, and u1#3.\n\nThe estimation of the model for unordered categorical dependent variables uses zero to denote the lowest category, one to denote the second lowest category, two to denote the third lowest category, etc.  If the variables are not coded this way in the data, they are automatically recoded as described below.  When data are saved for subsequent analyses, the recoded categories are saved.\n\nFollowing are examples of situations in which data are recoded by the program:\n\nCategories in Original Data      Categories in Recoded Data\n\n1 2 3 4                                     0 1 2 3\n\n2 3 4 5                                     0 1 2 3\n\n2 5 8 9                                     0 1 2 3\n\n0 1                                           no recode needed\n\n1 2                                           0 1\n\nCOUNT\n\nThe COUNT option is used to specify which dependent variables are treated as count variables in the model and its estimation and the type of model to be estimated.  The following models can be estimated for count variables:  Poisson, zero-inflated Poisson, negative binomial, zero-inflated negative binomial, zero-truncated negative binomial, and negative binomial hurdle (Long, 1997; Hilbe, 2011).  The negative binomial models use the NB-2 variance representation (Hilbe, 2011, p. 63).  Count variables may not have negative or non-integer values.\n\nThe COUNT option can be specified in two ways for a Poisson model:\n\nCOUNT = u1 u2 u3 u4;\n\nor\n\nCOUNT = u1 (p) u2 (p) u3 (p) u4 (p);\n\nor using the list function:\n\nCOUNT = u1-u4 (p);\n\nThe COUNT option can be specified in two ways for a zero-inflated Poisson model:\n\nCOUNT = u1-u4 (i);\n\nor\n\nCOUNT = u1-u4 (pi);\n\nwhere u1, u2, u3, and u4 are count dependent variables in the analysis.  The letter i or pi in parentheses following the variable name indicates that a zero-inflated Poisson model will be estimated.\n\nWith a zero-inflated Poisson model, two variables are considered, a count variable and an inflation variable.  The count variable takes on values for individuals who are able to assume values of zero and above following the Poisson model.  The inflation variable is a binary latent variable with one denoting that an individual is unable to assume any value except zero.  The inflation variable is referred to by adding to the name of the count variable the number sign (#) followed by the number 1.  If the inflation parameter value is estimated at a large negative value corresponding to a probability of zero, the inflation part of the model is not needed.\n\nFollowing is the specification of the COUNT option for a negative binomial model:\n\nCOUNT = u1 (nb) u2 (nb) u3 (nb) u4 (nb);\n\nor using the list function:\n\nCOUNT = u1-u4 (nb);\n\nWith a negative binomial model, a dispersion parameter is estimated.  The dispersion parameter is referred to by using the name of the count variable.  If the dispersion parameter is estimated at zero, the model is a Poisson model.\n\nFollowing is the specification of the COUNT option for a zero-inflated negative binomial model:\n\nCOUNT = u1- u4 (nbi);\n\nWith a zero-inflated negative binomial model, two variables are considered, a count variable and an inflation variable.  The count variable takes on values for individuals who are able to assume values of zero and above following the negative binomial model.  The inflation variable is a binary latent variable with one denoting that an individual is unable to assume any value except zero.  The inflation variable is referred to by adding to the name of the count variable the number sign (#) followed by the number 1.  If the inflation parameter value is estimated at a large negative value corresponding to a probability of zero, the inflation part of the model is not needed.\n\nFollowing is the specification of the COUNT option for a zero-truncated negative binomial model:\n\nCOUNT = u1-u4 (nbt);\n\nCount variables for the zero-truncated negative binomial model must have values greater than zero.\n\nFollowing is the specification of the COUNT option for a negative binomial hurdle model:\n\nCOUNT = u1-u4 (nbh);\n\nWith a negative binomial hurdle model, two variables are considered, a count variable and a hurdle variable.  The count variable takes on values for individuals who are able to assume values of one and above following the truncated negative binomial model.  The hurdle variable is a binary latent variable with one denoting that an individual is unable to assume any value except zero.  The hurdle variable is referred to by adding to the name of the count variable the number sign (#) followed by the number 1.\n\nDSURVIVAL\n\nThe DSURVIVAL option is used in conjunction with the PLOT command to identify the discrete-time survival variables so that survival curves are generated.  The DSURVIVAL option is specified as follows:\n\nDSURVIVAL = u1-u4;\n\nwhere u1 to u4 are discrete-time survival variables.\n\nVARIABLES WITH SPECIAL FUNCTIONS\n\nThere are several options that are used to identify variables that have special functions.  These variables can be variables from the NAMES statement of the VARIABLE command and variables created using the DEFINE command and the DATA transformation commands.  Following is a description of these options and their specifications.\n\nThe GROUPING option is used to identify the variable in the data set that contains information on group membership when the data for all groups are stored in a single data set.  Multiple group analysis is discussed in Chapter 14.  A grouping variable must contain only integer values.  Only one grouping variable can be used.  If the groups to be analyzed are a combination of more than one variable, a single grouping variable can be created using the DEFINE command.  Following is an example of how to specify the GROUPING option:\n\nGROUPING IS gender (1=male 2 = female);\n\nThe information in parentheses after the grouping variable name assigns labels to the values of the grouping variable found in the data set.  In the example above, observations with gender equal to 1 are assigned the label male, and individuals with gender equal to 2 are assigned the label female.  These labels are used in conjunction with the MODEL command to specify model statements specific to each group.  Observations that have a value on the grouping variable that is not specified using the GROUPING option are not included in the analysis.\n\nIn situations where there are many groups, a shorthand notation can be used for the GROUPING option.  It is specified as follows:\n\nGROUPING = country (101-200 225 350-360);\n\nwhere country is the grouping variable and 101 through 200, 225, and 350 through 360 are the values of country that will be used as groups.  The values of the variable country are used as labels in group-specific MODEL commands.\n\nThe GROUPING option can be specified by mentioning only the number of groups, for example,\n\nGROUPING = country (34);\n\nwhere country is the grouping variable and the number 34 specifies that there are 34 groups.  The group values are taken from the data.  The reference group is the group with the lowest value.  Default group labels are used.  G1 is the label for the group with the lowest value, g2 is the label for the group with the next value, etc..\n\nIDVARIABLE\n\nThe IDVARIABLE option is used in conjunction with the SAVEDATA command to provide an identifier for each observation in the data set that is saved.  This is useful for merging the data with another data set.  The IDVARIABLE option is specified as follows:\n\nIDVARIABLE = id;\n\nwhere id is a variable that contains a unique numerical identifier for each observation.  The length of this variable may not exceed 16.\n\nIf a data set does not contain an identifier variable, the _RECNUM setting can be used as follows to create one:\n\nIDVARIABLE = _RECNUM;\n\nThe unique numerical identifier corresponds to the record number of the data set specified using the FILE option of the DATA command.\n\nFREQWEIGHT\n\nThe FREQWEIGHT option is used to identify the variable that contains frequency (case) weight information.  Frequency weights are used when a single record in the data set represents the responses of more than one individual.  Frequency weight values must be integers.  Frequency weights do not have to sum to the total number of observations in the analysis data set and are not rescaled in any way.  Frequency weights are available for all analysis types except TYPE=COMPLEX, TYPE=TWOLEVEL, TYPE=THREELEVEL, TYPE=CROSSCLASSIFIED, and TYPE=EFA.  With TYPE=RANDOM, frequency weights are available only with ALGORITHM=INTEGRATION.  Following is an example of how the FREQWEIGHT option is specified:\n\nFREQWEIGHT IS casewgt;\n\nwhere casewgt is the variable that contains frequency weight information.\n\nThe TSCORES option is used in conjunction with TYPE=RANDOM to identify the variables in the data set that contain information about individually-varying times of observation for the outcome in a growth model.  Variables listed in the TSCORES statement can be used only in AT statements in the MODEL command to define a growth model.  For TYPE=TWOLEVEL, ALGORITHM=INTEGRATION must be specified in the ANALYSIS command for this type of analysis.  The TSCORES option is specified as follows:\n\nTSCORES ARE a1 a2 a3 a4;\n\nwhere a1, a2, a3, and a4 are observed variables in the analysis data set that contain the individually-varying times of observation for an outcome at four time points.\n\nAuxiliary variables are variables that are not part of the analysis model.  The AUXILIARY option has three uses.  One is to identify a set of variables that is not used in the analysis but is saved for use in a subsequent analysis.  A second is to identify a set of variables that will be used as missing data correlates in addition to the analysis variables.  The third is to automatically carry out the 3-step approach of TYPE=MIXTURE.\n\nSAVED\n\nIn the first use of the AUXILIARY option, variables listed on the AUXILIARY statement are saved along with the analysis variables if the SAVEDATA command is used.  These variables can be used in graphical displays if the PLOT command is used.  If these variables are created using the DEFINE command or the DATA transformation commands, they must be listed on the USEVARIABLES statement of the VARIABLE command in addition to being listed on the AUXILIARY statement.  The AUXILIARY option is specified as follows:\n\nAUXILIARY = gender race educ;\n\nwhere gender, race, and educ are variables that are not used in the analysis but that are saved in conjunction with the SAVEDATA and/or the PLOT commands.\n\nMISSING DATA CORRELATES\n\nIn the second use of the AUXILIARY option, it is used in conjunction with TYPE=GENERAL with continuous dependent variables and maximum likelihood estimation to identify a set of variables that will be used as missing data correlates in addition to the analysis variables (Collins, Schafer, & Kam, 2001; Graham, 2003; Asparouhov & Muthén, 2008b; Enders, 2010).  This use is not available with MODINDICES, BOOTSTRAP, and models with a set of exploratory factor analysis (EFA) factors in the MODEL command.  The setting M in parentheses is placed behind the variables on the AUXILIARY statement that will be used as missing data correlates.  Following is an example of how to specify the M setting:\n\nAUXILIARY = z1-z4 (M);\n\nwhere z1, z2, z3, and z4 are variables that will be used as missing data correlates in addition to the analysis variables.\n\nAn alternative specification that is convenient when there are several variables that cannot be specified using the list function is:\n\nAUXILIARY = (M) x1 x3 x5 x7 x9;\n\nwhere all variables after (M) will be used as missing data correlates in addition to the analysis variables.\n\n3-STEP APPROACH\n\nIn the third use of the AUXILIARY option, the 3-step approach using TYPE=MIXTURE is automatically carried out.  There are eight settings of the AUXILIARY option that automatically carry out the 3-step approach.  Two of these settings are used to identify a set of variables not used in the first step of the analysis that are possible covariates in a multinomial logistic regression for a categorical latent variable.  The multimonial logistic regression uses all covariates at the same time.  Six of the settings are used to identify a set of variables not used in the first step of the analysis for which the equality of means across latent classes will be tested.  The equality of means is tested one variable at a time.  Only one of these eight settings can be used in an analysis at a time.  Only one categorical latent variable is allowed with the 3-step approach.  The manual 3-step approach in described in Asparouhov and Muthen (2014a, b).\n\nThe two settings that are used to identify a set of variables not used in the first step of the analysis that are possible covariates in a multinomial logistic regression for a categorical latent variable are R3STEP (Vermunt, 2010; Asparouhov & Muthén, 2012b) and R (Wang et al., 2005).  R3STEP is preferred.  R is superseded by R3STEP and should be used only for methods research.\n\nThe six settings that are used to identify a set of variables not used in the first step of the analysis for which the equality of means across latent classes will be tested are BCH (Bakk & Vermunt, 2015), DU3STEP (Asparouhov & Muthén, 2012b), DCATEGORICAL (Lanza et al., 2013), DE3STEP (Asparouhov & Muthén, 2012b), DCONTINUOUS (Lanza et al., 2013), and E (Asparouhov, 2007).  BCH is preferred for continuous distal outcomes.  DU3STEP should be used only when there are no class changes between the first and last steps.  DCATEGORICAL is for categorical distal outcomes.  The following settings for continuous distal outcomes, DE3STEP, DCONTINUOUS, and E, should be used only for methods research.\n\nAll of the settings are specified in the same way.  The setting in parentheses is placed behind the variables on the AUXILIARY statement that will be used as covariates in the multinomial logistic regression or for which the equality of means will be tested.  Following is an example of how to specify the R3STEP setting:\n\nAUXILIARY = race (R3STEP) ses (R3STEP) x1-x5 (R3STEP);\n\nwhere race, ses, x1, x2, x3, x4, and x5 will be used as covariates in a multinomial logistic regression in a mixture model.\n\nAn alternative specification for the eight settings that is convenient when there are several variables that cannot be specified using the list function is:\n\nAUXILIARY = (R3STEP) x1 x3 x5 x7 x9;\n\nwhere all variables after R3STEP) will be used as covariates in a multinomial logistic regression in a mixture model.\n\nFollowing is an example of how to specify more than one setting in the same AUXILIARY statement:\n\nAUXILIARY = gender age (BCH) educ ses (BCH) x1-x5 (BCH);\n\nwhere all of the variables on the AUXILIARY statement will be saved if the SAVEDATA command is used, will be available for plots if the PLOT command is used, and tests of equality of means across  latent classes will be carried out for the variables age, ses, x1, x2, x3, x4, and x5.\n\nCONSTRAINT\n\nThe CONSTRAINT option is used to identify the variables that can be used in the MODEL CONSTRAINT command.  These can be not only variables used in the MODEL command but also other variables.  All variables on the CONSTRAINT list are treated as continuous variables in the analysis.  Only variables used by the following options cannot be included:  GROUPING, PATTERN, COHORT, COPATTERN, CLUSTER, STRATIFICATION, and AUXILIARY.  Variables that are part of these options can be used in DEFINE to create new variables that can be used in the CONSTRAINT statement.  The CONSTRAINT option is not available for TYPE=RANDOM, TYPE=TWOLEVEL, TYPE=THREELEVEL, TYPE=CROSSCLASSIFIED,  TYPE=COMPLEX, and for estimators other than ML, MLR, and MLF.  The CONSTRAINT option is specified as follows:\n\nCONSTRAINT = y1 u1;\n\nwhere y1 and u1 are variables that can be used in the MODEL CONSTRAINT command.\n\nPATTERN\n\nThe PATTERN option is used when data are missing by design.  The typical use is in situations when, because of the design of the study, all variables are not measured on all individuals in the analysis.  This can occur, for example, when individuals receive different forms of a measurement instrument that contain different sets of items.  Following is an example of how the PATTERN option is specified:\n\nPATTERN IS design (1= y1 y3 y5  2= y2 y3 y4 3= y1 y4 y5);\n\nwhere design is a variable in the data set that has integer values of 1, 2, and 3.  The variable names listed after each number and the equal sign are variables used in the analysis which should have no missing values for observations with that value on the pattern variable.  For example, observations with the value of one on the variable design should have information for variables y1, y3, and y5 and have missing values for y2 and y4.  Observations with the value of three on the variable design should have information for variables y1, y4, and y5 and have missing values for variables y2 and y3.  The pattern variable must contain only integer values.  Observations that have a value for the pattern variable that is not specified using the PATTERN option are not included in the analysis.\n\nThere are several options that are used for complex survey data.  These include options for stratification, clustering, unequal probabilities of selection (sampling weights), and subpopulation analysis.  The variables used with these options can be variables from the NAMES statement of the VARIABLE command and variables created using the DEFINE command and the DATA transformation commands.  The exception is that variables used with the SUBPOPULATION option must be variables from the NAMES statement of the VARIABLE command.  Following is a description of these options and their specifications.\n\nSTRATIFICATION\n\nThe STRATIFICATION option is used with TYPE=COMPLEX to identify the variable in the data set that contains information about the subpopulations from which independent probability samples are drawn.  Following is an example of how the STRATIFICATION option is used:\n\nSTRATIFICATION IS region;\n\nwhere region is the variable that contains stratification information.\n\nThe CLUSTER option is used with TYPE=TWOLEVEL, TYPE=THREELEVEL, TYPE=CROSSCLASSIFIED, and TYPE=COMPLEX to identify the variables in the data set that contain clustering information.  One cluster variable is used for TYPE=TWOLEVEL and TYPE=COMPLEX.  Two cluster variables are used for TYPE=THREELEVEL, TYPE=CROSSCLASSIFIED, and TYPE=COMPLEX TWOLEVEL.  Three cluster variables are used for TYPE=COMPLEX THREELEVEL.\n\nFollowing is an example of how the CLUSTER option is used with TYPE=TWOLEVEL and TYPE=COMPLEX:\n\nCLUSTER IS school;\n\nwhere school is the variable that contains clustering information.\n\nFollowing is an example of how the CLUSTER option is used with TYPE=THREELEVEL:\n\nCLUSTER IS school class;\n\nwhere school and class are the variables that contain clustering information.  The cluster variable for the highest level must come first, that is, classrooms are nested in schools.\n\nFollowing is an example of how the CLUSTER option is used with TYPE=CROSSCLASSIFIED:\n\nCLUSTER = neighbor school;\n\nwhere neighbor and school are the variables that contain clustering information.  Students are nested in schools crossed with neighborhoods.\n\nFollowing is an example of how the CLUSTER option is used with TYPE=CROSSCLASSIFIED and time series analysis:\n\nCLUSTER = subject time;\n\nwhere subject and time are the variables that contain clustering information.  In cross-classified time series analysis, subject and time are crossed.  There is no nesting because each subject is observed only once at any one time.  The cluster variable for subject must precede the cluster variable for time.  Within each cluster, data must be ordered by time.\n\nTYPE=COMPLEX TWOLEVEL can be used with either two cluster variables,  one stratification and two cluster variables,  or one stratification and one cluster variable.  Following is an example of using two cluster variables:\n\nCLUSTER = school class;\n\nwhere school and class are the variables that contain clustering information.  The clusters for TYPE=TWOLEVEL are classroom.  The standard error and chi-square computations for TYPE=COMPLEX are based on school.\n\nFollowing is an example with stratification and clustering:\n\nSTRATIFICATION = region;\n\nCLUSTER = school;\n\nwhere the clusters for TYPE=TWOLEVEL are schools and the standard error and chi-square computations for TYPE=COMPLEX are based on region.\n\nTYPE=COMPLEX THREELEVEL can be used with either three cluster variables,  one stratification and three cluster variables,  or one stratification and two cluster variables.  Following is an example of how the CLUSTER option is used with TYPE=COMPLEX THREELEVEL:\n\nCLUSTER IS psu school class;\n\nwhere psu, school, and class are the variables that contain clustering information.  The cluster variable for the highest level must come first, that is, classrooms are nested in schools and schools are nested in psu’s.  The clusters for TYPE=THREELEVEL are classroom and school.  The standard error and chi-square computations for TYPE=COMPLEX are based on psu’s.\n\nWEIGHT\n\nThe WEIGHT option is used to identify the variable that contains sampling weight information for non-clustered data using TYPE=GENERAL, clustered data using TYPE=COMPLEX, and level 1 data using TYPE=TWOLEVEL and TYPE=THREELEVEL.  Sampling weights are not available for TYPE=CROSSCLASSIFIED.  Sampling weights are used when data have been collected with unequal probabilities of being selected.  Sampling weight values must be non-negative real numbers.  If the sum of the sampling weights is not equal to the total number of observations in the analysis data set, the weights are rescaled so that they sum to the total number of observations.  Sampling weights are available for all analysis types.  Sampling weights are available for ESTIMATOR=MLR, MLM, MLMV, WLS, WLSM, WLSMV, and ULS.  There are two exceptions.  They are not available for WLS when all dependent variables are continuous and are not available for MLM or MLMV for EFA.  Following is an example of how the WEIGHT option is used to identify a sampling weight variable:\n\nWEIGHT IS sampwgt;\n\nwhere sampwgt is the variable that contains sampling weight information.\n\nWTSCALE\n\nThe WTSCALE option is used with TYPE=TWOLEVEL to adjust the weight variable named using the WEIGHT option.  With TYPE=TWOLEVEL, the WEIGHT option is used to identify the variable that contains within-level sampling weight information.\n\nThe WTSCALE option has the following settings:  UNSCALED, CLUSTER,  and ECLUSTER.  CLUSTER is the default.\n\nThe UNSCALED setting uses the within weights from the data set with no adjustment.  The CLUSTER setting scales the within weights from the data set so that they sum to the sample size in each cluster.  The ECLUSTER setting scales the within weights from the data so that they sum to the effective sample size (Pothoff, Woodbury, & Manton, 1992).\n\nThe WTSCALE option is specified as follows:\n\nWTSCALE = ECLUSTER;\n\nwhere scaling the within weights so that they sum to the effective sample size is chosen.\n\nBWEIGHT\n\nThe BWEIGHT option is used with TYPE=TWOLEVEL to identify the variable that contains between-level sampling weight information.\n\nThe BWEIGHT option is specified as follows:\n\nBWEIGHT = bweight;\n\nwhere bweight is the variable that contains between-level sampling weight information.\n\nB2WEIGHT\n\nThe B2WEIGHT option is used with TYPE=THREELEVEL to identify the variable that contains level 2 sampling weight information.  Sampling weights are not available for TYPE=CROSSCLASSIFIED.\n\nThe B2WEIGHT option is specified as follows:\n\nB2WEIGHT = b2weight;\n\nwhere b2weight is the variable that contains level 2 sampling weight information.\n\nB3WEIGHT\n\nThe B3WEIGHT option is used with TYPE=THREELEVEL to identify the variable that contains level 3 sampling weight information.  Sampling weights are not available for TYPE=CROSSCLASSIFIED.\n\nThe B3WEIGHT option is specified as follows:\n\nB3WEIGHT = b3weight;\n\nwhere b3weight is the variable that contains level 3 sampling weight information.\n\nBWTSCALE\n\nThe BWTSCALE option is used in with TYPE=TWOLEVEL to adjust the between-level sampling weight variable named using the BWEIGHT option.  The BWTSCALE option is used in with TYPE=THREELEVEL to adjust the level 2 and level 3 sampling weight variables named using the B2WEIGHT and B3WEIGHT options.\n\nThe BWTSCALE option has the following settings:  UNSCALED and SAMPLE.  SAMPLE is the default.\n\nThe UNSCALED setting uses the between weights from the data set with no adjustment.  The SAMPLE option adjusts the between weights so that the product of the between and the within weights sums to the total sample size.\n\nThe BWTSCALE option is specified as follows:\n\nBWTSCALE = UNSCALED;\n\nwhere no adjustment is made to the between weights.\n\nREPWEIGHTS\n\nReplicate weights summarize information about a complex sampling design (Korn & Graubard, 1999; Lohr, 1999).  They are used to properly estimate standard errors of parameter estimates.  Replicate weights are available for TYPE=COMPLEX for continuous variables using maximum likelihood estimation and for binary, ordered categorical, and censored variables using weighted least squares estimation.  The SUBPOPULATION option is not available with replicate weights. Replicate weights can be used or generated.  When they are generated, they can be used in the analysis and/or saved (Asparouhov & Muthén, 2009b).\n\nThe REPWEIGHTS option is used to identify the replicate weight variables.  The STRATIFICATION and CLUSTER options may not be used in conjunction with the REPWEIGHTS option.  The WEIGHT option must be used. Following is an example of how to specify the REPWEIGHTS option:\n\nREPWEIGHTS = rweight1-rweight80;\n\nwhere rweight1 through rweight80 are replicate weight variables.\n\nUSING REPLICATE WEIGHTS\n\nWhen existing replicate weights are used, the REPWEIGHTS option of the VARIABLE command is used in conjunction with the WEIGHT option of the VARIABLE command and the REPSE option of the ANALYSIS command.  The sampling weights are used in the estimation of parameter estimates.  The replicate weights are used in the estimation of standard errors of parameter estimates.  The REPSE option specifies the resampling method that is used in the computation of the standard errors.\n\nGENERATING REPLICATE WEIGHTS\n\nWhen replicate weights are generated, the REPSE option of the ANALYSIS command and the WEIGHT option of the VARIABLE command along with the CLUSTER and/or the STRATIFICATION options of the VARIABLE command are used.\n\nSUBPOPULATION\n\nThe SUBPOPULATION option is used with TYPE=COMPLEX to select observations for an analysis when a subpopulation (domain) is analyzed.  If the SUBPOPULATION option is used, the USEOBSERVATIONS option cannot be used.  When the SUBPOPULATION option is used, all observations are included in the analysis although observations not in the subpopulation are assigned weights of zero (see Korn & Graubard, 1999, pp. 207-211).  The SUBPOPULATION option is not available for multiple group analysis.\n\nThe SUBPOPULATION option identifies those observations for analysis that satisfy the conditional statement specified after the equal sign and assigns them non-zero weights.  For example, the following statement identifies observations with the variable gender equal to 2:\n\nSUBPOPULATION = gender EQ 2;\n\nOnly variables from the NAMES statement of the VARIABLE command can be used in the conditional statement of the SUBPOPULATION option.  Logical operators, not arithmetic operators, must be used in the conditional statement.  Following are the logical operators that can be used in the conditional statement of the SUBPOPULATION option:\n\nAND    logical and\n\nOR       logical or\n\nNOT    logical not\n\nEQ       equal                                        ==\n\nNE       not equal                                  /=\n\nGE       greater than or equal to                        >=\n\nLE        less than or equal to                 <=\n\nGT       greater than                              >\n\nLT        less than                                   <\n\nAs shown above, some of the logical operators can be referred to in two different ways.  For example, equal can be referred to as EQ or ==.\n\nFINITE\n\nFor TYPE=COMPLEX, the FINITE option is used to identify the variable that contains the finite population correction factor, the sampling fraction, or the population size for each stratum.  If the sampling fraction or the population size for each stratum is provided, these are used to compute the finite population correction factor.  The finite population correction factor is used to adjust standard errors when clusters have been sampled without replacement (WOR) from strata in a finite population.  The finite population correction factor is equal to one minus the sampling fraction.  The sampling fraction is equal to the number of sampled clusters in a stratum divided by the number of clusters in the population for that stratum.  The population size for each stratum is the number of clusters in the population for that stratum.  The FINITE option is not available with replicate weights.\n\nThe FINITE option has three settings:  FPC, SFRACTION, and POPULATION.  FPC is used when the finite population correction factor is provided.  SFRACTION is used when the sampling fraction is provided.  POPULATION is used when the population size for each stratum is provided.  FPC is the default.  Following is an example of how the FINITE option is used to identify a finite population correction variable:\n\nFINITE IS sampfrac (SFRACTION);\n\nwhere sampfrac is the variable that contains the sampling fraction for each stratum.\n\nMIXTURE MODELS\n\nThere are three options that are used specifically for mixture models.  They are CLASSES, KNOWNCLASS, and TRAINING.\n\nThe CLASSES option is used to assign names to the categorical latent variables in the model and to specify the number of latent classes in the model for each categorical latent variable.  This option is required for TYPE=MIXTURE.  Between-level categorical latent variables must be identified as between-level variables using the BETWEEN option.\n\nFollowing is an example of how the CLASSES option is used:\n\nCLASSES = c1 (2) c2 (2) c3 (3);\n\nwhere c1, c2, and c3 are the names of the three categorical latent variables in the model.  The numbers in parentheses specify the number of classes for each categorical latent variable in the model.  The categorical latent variable c1 has two classes, c2 has two classes, and c3 has three classes.\n\nWhen there is more than one categorical latent variable in the model, there are rules related to the order of the categorical latent variables.  The order is taken from the order of the categorical latent variables in the CLASSES statement.  Because of the order in the CLASSES statement above, c1 is not allowed to be regressed on c2 in the model.  It is only possible to regress c2 on c1 and c3 on c2 or c1.  This order restriction does not apply to PARAMETERIZATION=LOGLINEAR.\n\nKNOWNCLASS\n\nThe KNOWNCLASS option is used for multiple group analysis with TYPE=MIXTURE.  The KNOWNCLASS option is used to identify the categorical latent variable for which latent class membership is known and equal to observed groups in the sample.  Only one KNOWNCLASS variable can be used.  Following is an example of how to specify the KNOWNCLASS option:\n\nKNOWNCLASS = c1 (gender = 0 1);\n\nwhere c1 is a categorical latent variable named and defined using the CLASSES option.  The information in parentheses following the categorical latent variable name defines the known classes using an observed variable.  In this example, the observed variable gender is used to define the known classes.  The first class consists of individuals with the value 0 on the variable gender.  The second class consists of individuals with the value 1 on the variable gender.\n\nFollowing is an example with many known classes that uses the list function:\n\nKNOWNCLASS =  c (country = 101-110 112 113-115);\n\nwhere c is a categorical latent variable named and defined using the CLASSES option.  The information in parentheses following the categorical latent variable name defines the known classes using an observed variable.  In this example, the observed variable country is used to define the known classes.  The first class consists of individuals with the value 101 on the variable country.  The last class consists of individuals with the value 115 on the variable country.  There are a total of 14 classes.\n\nThe KNOWNCLASS option can be specified by mentioning only the name of the observed variable that defines the known classes without giving the values of the observed variable:\n\nKNOWNCLASS = c (country);\n\nwhere c is a categorical latent variable named and defined using the CLASSES option.  In this example, the observed variable country is used to define the known classes.  The number of known classes is taken from the CLASSES option.  The values of the variable country are taken from the data.  The first class consists of individuals with the lowest value on the variable country.  The last class consists of individuals with the highest value on the variable country.\n\nThe TRAINING option is used to identify the variables that contain information about latent class membership and specify whether the information is about class membership, probability of class membership, or priors of class membership.  The TRAINING option has three settings: MEMBERSHIP, PROBABILITIES, and PRIORS.  MEMBERSHIP is the default.  Training variables can be variables from the NAMES statement of the VARIABLE command and variables created using the DEFINE command and the DATA transformation commands.  This option is available only for models with a single categorical latent variable.\n\nFollowing is an example of how the TRAINING option is used for an example with three latent classes where the training variables contain information about class membership:\n\nTRAINING = t1 t2 t3;\n\nwhere t1, t2, and t3 are variables that contain information about latent class membership.  The variable t1 provides information about membership in class 1, t2 provides information about membership in class 2, and t3 provides information about membership in class 3.  An individual is allowed to be in any class for which they have a value of one on a training variable.  An individual who is known to be in class 2 would have values of 0, 1, and 0 on t1, t2, and t3, respectively.  An individual with unknown class membership would have the value of 1 on t1, t2, and t3.  An alternative specification is:\n\nTRAINING = t1 t2 t3 (MEMBERSHIP);\n\nFractional values can be used to provide information about the probability of class membership when class membership is not estimated but is fixed at fractional values for each individual.  For example, an individual who has a probability of .9 for being in class 1, .05 for being in class 2, and .05 for being in class 3 would have t1=.9, t2=.05, and t3=.05.  Fractional training data must sum to one for each individual.\n\nFollowing is an example of how the TRAINING option is used for an example with three latent classes where the training variables contain information about probabilities of class membership:\n\nTRAINING = t1 t2 t3 (PROBABILITIES);\n\nwhere t1, t2, and t3 are variables that contain information about the probability of latent class membership.  The variable t1 provides information about the probability of membership in class 1, t2 provides information about the probability of membership in class 2, and t3 provides information about the probability of membership in class 3.\n\nPriors can be used when individual class membership is not known but when information is available on the probability of an individual being in a certain class.  For example, an individual who has a probability of .9 for being in class 1, .05 for being in class 2, and .05 for being in class 3 would have t1=.9, t2=.05, and t3=.05.  Prior values must sum to one for each individual.\n\nFollowing is an example of how the PRIORS option is used for an example with three latent classes where the training variables contain information about priors of class membership:\n\nTRAINING = t1 t2 t3 (PRIORS);\n\nwhere t1, t2, and t3 are variables that contain information about the probability of being in a certain class.  The variable t1 provides information about the probability of membership in class 1, t2 provides information about the probability of membership in class 2, and t3 provides information about the probability of membership in class 3.\n\nMULTILEVEL MODELS\n\nThere are two options specific to multilevel models.  They are WITHIN and BETWEEN.  Variables identified using the WITHIN and BETWEEN options can be variables from the NAMES statement of the VARIABLE command and variables created using the DEFINE command and the DATA transformation commands.\n\nWITHIN\n\nThe WITHIN option is used with TYPE=TWOLEVEL, TYPE=THREELEVEL, and TYPE=CROSSCLASSIFIED to identify the variables in the data set that are measured on the individual level and to specify the levels on which they are modeled.  All variables on the WITHIN list must be measured on the individual level.  An individual-level variable can be modeled on all or some levels.\n\nFor TYPE=TWOLEVEL, an individual-level variable can be modeled on only the within level or on both the within and between levels.  If a variable measured on the individual level is mentioned on the WITHIN list, it is modeled on only the within level.  It has no variance in the between part of the model. If it is not mentioned on the WITHIN list, it is modeled on both the within and between levels.  The WITHIN option is specified as follows:\n\nWITHIN = y1 y2 x1;\n\nwhere y1, y2, and x1 are variables measured on the individual level and modeled on only the within level.\n\nFor TYPE=THREELEVEL, an individual-level variable can be modeled on only level 1, on levels 1 and 2, levels 1 and 3, or on all levels.  Consider a model where students are nested in classrooms and classrooms are nested in schools. Level 1 is student; level 2 is classroom; and level 3 is school.  If a variable measured on the individual level is mentioned on the WITHIN list without a label, it is modeled on only level 1.  It has no variance on levels 2 and 3.  If it is mentioned on the WITHIN list with a level 2 cluster label, it is modeled on levels 1 and 2.  It has no variance on level 3.  If it is mentioned on the WITHIN list with a level 3 cluster label, it is modeled on levels 1 and 3.  It has no variance on level 2.  If it is not mentioned on the WITHIN list, it is modeled on all levels.\n\nFollowing is an example of how to specify the WITHIN option for TYPE=THREELEVEL:\n\nWITHIN = y1-y3 (class) y4-y6 (school) y7-y9;\n\nIn the example, y1, y2, and y3 are variables measured on the individual level and modeled on only level 1, student.  Variables modeled on only level 1 must precede variables modeled on the other levels.  Y4, y5, and y6 are variables measured on the individual level and modeled on level 1, student, and level 2, class, where class is the level 2 cluster variable.  Y7, y8, and y9 are variables measured on the individual level and modeled on level 1, student, and level 3, school, where school is the level 3 cluster variable.\n\nAn alternative specification of the WITHIN option above reverses the order of the level 2 and level 3 variables:\n\nWITHIN = y1-y3 (school) y7-y9 (class) y4-y6;\n\nVariables modeled on only level 1 must precede variables modeled on the other levels.  Another alternative specification is:\n\nWITHIN =  y1-y3;\n\nWITHIN =  (class) y4-y6;\n\nWITHIN =  (school) y7-y9;\n\nIn this specification, the WITHIN statement for variables modeled on only level 1 must precede the other WITHIN statements.  The order of the other WITHIN statements does not matter.\n\nFor TYPE=CROSSCLASSIFIED, an individual-level variable can be modeled on only level 1, on levels 1 and 2a, levels 1 and 2b, or on all levels.  Consider a model where students are nested in schools crossed with neighborhoods.   Level 1 is student; level 2a is school; and level 2b is neighborhood.  If a variable measured on the individual level is mentioned on the WITHIN list without a label, it is modeled on only level 1.  It has no variance on levels 2a and 2b.  If it is mentioned on the WITHIN list with a level 2a cluster label, it is modeled on levels 1 and 2a.  It has no variance on level 2b.  If it is mentioned on the WITHIN list with a level 2b cluster label, it is modeled on levels 1 and 2b.  It has no variance on level 2a.  If it is not mentioned on the WITHIN list, it is modeled on all levels.\n\nFollowing is an example of how to specify the WITHIN option for TYPE=CROSSCLASSIFIED:\n\nWITHIN = y1-y3 (school) y4-y6 (neighbor) y7-y9;\n\nIn the example, y1, y2, and y3 are variables measured on the individual level and modeled on only level 1, student.  Variables modeled on only level 1 must precede variables modeled on the other levels.  Y4, y5, and y6 are variables measured on the individual level and modeled on level 1, student, and level 2a, school, where school is the level 2a cluster variable.  Y7, y8, and y9 are variables measured on the individual level and modeled on level 1, student, and level 2b, neighborhood, where neighborhood is the level 2b cluster variable.\n\nBETWEEN\n\nThe BETWEEN option is used with TYPE=TWOLEVEL, TYPE=THREELEVEL, and TYPE=CROSSCLASSIFIED to identify the variables in the data set that are measured on the cluster level(s) and to specify the level(s) on which they are modeled.  All variables on the BETWEEN list must be measured on a cluster level.  A cluster-level variable can be modeled on all or some cluster levels.\n\nFor TYPE=TWOLEVEL, a cluster-level variable can be modeled on only the between level.  The BETWEEN option is specified as follows:\n\nBETWEEN = z1 z2 x1;\n\nwhere z1, z2, and x1 are variables measured on the cluster level and modeled on the between level.  The BETWEEN option is also used to identify between-level categorical latent variables with TYPE=TWOLEVEL MIXTURE.\n\nFor TYPE=THREELEVEL, a variable measured on level 2 can be modeled on only level 2 or on levels 2 and 3.  A variable measured on level 3 can be modeled on only level 3.  Consider a model where students are nested in classrooms and classrooms are nested in schools. Level 1 is student; level 2 is classroom; and level 3 is school.  If a variable measured on level 2 is mentioned on the BETWEEN list without a label, it is modeled on levels 2 and 3.  If a variable measured on level 2 is mentioned on the BETWEEN list with a level 2 cluster label, it is modeled on only level 2.  It has no variance on level 3.  A variable measured on level 3 must be mentioned on the BETWEEN list with a level 3 cluster label.  Following is an example of how to specify the BETWEEN option for TYPE=THREELEVEL:\n\nBETWEEN = y1-y3 (class) y4-y6 (school) y7-y9;\n\nIn this example, y1, y2, and y3 are cluster-level variables measured on level 2, class, and modeled on both levels 2 and 3.  Variables modeled on both levels 2 and 3 must precede variables modeled on only level 2 or level 3.  Y4, y5, and y6 are cluster-level variables measured on level 2, class, and modeled on level 2.  Y7, y8, and y9 are cluster-level variables measured on level 3 and modeled on level 3.\n\nAn alternative specification of the BETWEEN option above reverses the order of the level 2 and level 3 variables:\n\nBETWEEN = y1-y3 (school) y7-y9 (class) y4-y6;\n\nVariables modeled on both levels 2 and 3 must precede variables modeled on only level 2 or level 3.  Another alternative specification is:\n\nBETWEEN =  y1-y3;\n\nBETWEEN =  (class) y4-y6;\n\nBETWEEN =  (school) y7-y9;\n\nIn this specification, the BETWEEN statement for variables modeled on both levels 2 and 3 must precede the other BETWEEN statements.  The order of the other BETWEEN statements does not matter.\n\nFor TYPE=CROSSCLASSIFIED, a variable measured on level 2a must be mentioned on the BETWEEN list with a level 2a cluster label.  It can be modeled on only level 2a.  A variable measured on level 2b must be mentioned on the BETWEEN list with a level 2b cluster label.  It can be modeled on only level 2b.  Consider a model where students are nested in schools crossed with neighborhoods.   Level 1 is student; level 2a is school; and level 2b is neighborhood.  Following is an example of how to specify the BETWEEN option for TYPE=CROSSCLASSIFIED:\n\nBETWEEN = (school) y1-y3 (neighbor) y4-y6;\n\nIn this example, y1, y2, and y3 are cluster-level variables measured on level 2a, school, and modeled on only level 2a.  Y4, y5, and y6 are cluster-level variables measured on level 2b, neighborhood, and modeled on only level 2b.\n\nCONTINUOUS-TIME SURVIVAL MODELS\n\nThere are two options specific to continuous-time survival models.  They are SURVIVAL and TIMECENSORED.  Variables identified using the SURVIVAL and TIMECENSORED options can be variables from the NAMES statement of the VARIABLE command and variables created using the DEFINE command and the DATA transformation commands.\n\nSURVIVAL\n\nThe SURVIVAL option is used to identify the variables that contain information about time to event and to provide information about the number and lengths of the time intervals in the baseline hazard function to be used in the analysis.  The SURVIVAL option must be used in conjunction with the TIMECENSORED option.  The SURVIVAL option can be specified in five ways:  the default baseline hazard function, a non-parametric baseline hazard function, a semi-parametric baseline hazard function, a parametric baseline hazard function, and a constant baseline hazard function.\n\nThe SURVIVAL option is specified as follows when using the default baseline hazard function:\n\nSURVIVAL = t;\n\nwhere t is the variable that contains time-to-event information.  The default is either a semi-parametric baseline hazard function with ten time intervals or a non-parametric baseline hazard function.  The default is a semi-parametric baseline hazard function with ten time intervals for models where t is regressed on a continuous latent variable, for multilevel models, and for models that require Monte Carlo numerical integration.  In this case, the lengths of the time intervals are selected internally in a non-parametric fashion.  For all other models, the default is a non-parametric baseline hazard function as in Cox regression where the number and lengths of the time intervals are taken from the data and the baseline hazard function is saturated.\n\nThe SURVIVAL option is specified as follows when using a non-parametric baseline hazard function as in Cox regression:\n\nSURVIVAL = t (ALL);\n\nwhere t is the variable that contains time-to-event information and ALL is a keyword that specifies that the number and lengths of the time intervals are taken from the data and the baseline hazard is saturated.  It is not recommended to use the keyword ALL when the BASEHAZARD option of the ANALYSIS command is ON because it results in a large number of baseline hazard parameters.\n\nThe SURVIVAL option is specified as follows when using a semi-parametric baseline hazard:\n\nSURVIVAL = t (10);\n\nwhere t is the variable that contains time-to-event information.  The number in parentheses specifies that 10 intervals are used in the analysis where the lengths of the time intervals are selected internally in a non-parametric fashion.\n\nThe SURVIVAL option is specified as follows when using a parametric baseline hazard function:\n\nSURVIVAL = t (4*5 1*10);\n\nwhere t is the variable that contains time-to-event information.  The numbers in parentheses specify that four time intervals of length five and one time interval of length ten are used in the analysis.\n\nThe SURVIVAL option is specified as follows when using a constant baseline hazard function:\n\nSURVIVAL = t (CONSTANT);\n\nwhere t is the variable that contains time-to-event information and CONSTANT is the keyword that specifies a constant baseline hazard function.\n\nTIMECENSORED\n\nThe TIMECENSORED option is used in conjunction with the SURVIVAL option to identify the variables that contain information about right censoring, for example, when an individual leaves a study or when an individual has not experienced the event before the study ends.  There must be the same number and order of variables in the TIMECENSORED option as there are in the SURVIVAL option.  The variables that contain information about right censoring must be coded so that zero is not censored and one is right censored.  If they are not, this can be specified as part of the TIMECENSORED option.  The TIMECENSORED option is specified as follows when the variable is coded zero for not censored and one for right censored:\n\nTIMECENSORED = tc;\n\nThe TIMECENSORED option is specified as follows when the variable is not coded zero for not censored and one for right censored:\n\nTIMECENSORED = tc (1 = NOT 999 = RIGHT);\n\nThe value one is automatically recoded to zero and the value 999 is automatically recoded to one.\n\nLAGGED\n\nThe LAGGED option is used in time series analysis to specify the maximum lag to use for an observed variable during model estimation.  Following is an example of how to specify the LAGGED option:\n\nLAGGED = y (1);\n\nwhere y is the variable in a time series analysis and the number 1 in parentheses is the maximum lag that will be used in model estimation.  The lagged variable is referred to in the MODEL command by adding to the name of the variable an ampersand (&) and the number of the lag.  The variable y at lag one is referred to as y&1.\n\nFollowing is an example of how to specify a maximum lag of 2 for a set of variables:\n\nLAGGED = y1-y3 (2);\n\nwhere y1, y2, and y3 are variables in a time series analysis and the number 2 in parentheses is the maximum lag that will be used in model estimation.  The lagged variables are referred to in the MODEL command by adding to the name of the variable an ampersand (&) and the number of the lag.  The variable y1 at lag one is referred to as y1&1.  The variable y1 at lag two is referred to as y1&2.\n\nTINTERVAL\n\nThe TINTERVAL option is used in time series analysis to specify the time interval that is used to create a time variable when data are misaligned with respect to time due to missed measurement occasions that are not assigned a missing value flag and when measurement occasions are random.  The data set must be sorted by the time interval variable.\n\nThe time interval value represents the difference in time between two consecutive measurement occasions.   Using this value and the lowest value of the time interval variable, intervals are created that are used to create a time variable.  The first interval is the lowest value of the time interval variable plus/minus half of the time interval value.  The second interval adds the time interval value to the values of the first interval etc..  All values of the time interval variable that fall into the same interval are given the same value on the time variable.  If an interval does not contain a value, a missing value flag is assigned.  Following is an example of how to specify the TINTERVAL option:\n\nTINTERVAL = time (1);\n\nwhere time is the time interval variable and the value one is the time interval value.  If the lowest time interval variable value is one, the first three intervals are .5 to 1.5, 1.5 to 2.5, and 2.5 to 3.5.  The first three time variable values are 1, 2, and 3.  For further details, see Asparouhov, Hamaker, and Muthén (2017).\n\nThe DEFINE command is used to transform existing variables and to create new variables.  It includes several options for transforming variables including a do loop for repeating statements.  The operations available in DEFINE can be executed for all observations or selectively using conditional statements.  Transformations of existing variables do not affect the original data but only the data used for the analysis.  If analysis data are saved using the SAVEDATA command, the transformed values rather than the original values are saved.\n\nThe statements in the DEFINE command are executed one observation at a time in the order specified with one exception.   The CLUSTER_MEAN, CENTER, and STANDARDIZE options are executed in the order mentioned after all transformations specified before them in the DEFINE command and the DATA transformation commands are executed.  All statements specified after these options are then executed one observation at a time in the order specified.  These transformations use the new values from the CLUSTER_MEAN, CENTER, and STANDARDIZE options where applicable.  For example, if two variables are centered and an interaction between them is specified after the CENTER option, the interaction uses the centered variables.  Any variable listed in the NAMES option of the VARIABLE command or created in the DEFINE command can be transformed or used to create new variables.  New variables created in the DEFINE command that will be used in an analysis must be listed on the USEVARIABLES list after the original variables.  All statements specified after the CLUSTER_MEAN, CENTER and STANDARDIZE options must refer to variables used in the analysis that are listed on the USEVARIABLES list.\n\nFollowing are examples of the types of transformations available:\n\n DEFINE: variable = mathematical expression; IF (conditional statement) THEN transformation statements; _MISSING variable = MEAN (list of variables); variable = SUM (list of variables); CUT variable or list of variables (cutpoints); variable = CLUSTER_MEAN (variable); CENTER variable or list of variables (GRANDMEAN); CENTER variable or list of variables (GROUPMEAN); CENTER variable or list of variables (GROUPMEAN label); STANDARDIZE variable or list of variables; DO (number, number) expression; DO (\\$, number, number) DO (#, number, number) expression;\n\nDEFINE is not a required command.\n\nThe following logical operators can be used in DEFINE:\n\nAND                logical and\n\nOR                   logical or\n\nNOT                logical not\n\nEQ       = =       equal\n\nNE       /=         not equal\n\nGE       >=        greater than or equal to\n\nLE        <=        less than or equal to\n\nGT       >          greater than\n\nLT        <          less than\n\nAs shown above, some of the logical operators can be referred to in two different ways.  For example, equal can be referred to as EQ or = =.\n\nThe following arithmetic operations can be used in DEFINE:\n\n+          addition                                   y + x;\n\n-           subtraction                               y - x;\n\n*          multiplication                           y * x;\n\n/           division                                                y / x;\n\n**        exponentiation                         y**2;\n\n%         remainder                                remainder of y/x;\n\nThe following functions can be used in DEFINE:\n\nLOG                base e log                     LOG (y);\n\nLOG10                        base 10 log                  LOG10 (y);\n\nEXP                 exponential                  EXP (y);\n\nSQRT               square root                   SQRT (y);\n\nABS                 absolute value              ABS(y);\n\nSIN                  sine                              SIN (y);\n\nCOS                 cosine                          COS (y);\n\nTAN                tangent                         TAN(y);\n\nASIN               arcsine                         ASIN (y);\n\nACOS              arccosine                     ACOS (y);\n\nATAN              arctangent                    ATAN (y);\n\nPHI                  standard normal           PHI (y); PHI (#);\n\ndistribution function\n\nWhen a non-conditional statement is used to transform existing variables or create new variables, the variable on the left-hand side of the equal sign is assigned the value of the expression on the right-hand side of the equal sign, for example,\n\ny = y/100;\n\ntransforms the original variable y by dividing it by 100.  Non-conditional statements can be used to create new variables, for example,\n\nabuse = item1 + item2 + item8 + item9;\n\nAn individual with a missing value on any variable used on the right-hand side of the equal sign is assigned a missing value on the variable on the left-hand side of the equal sign.\n\nCONDITIONAL STATEMENTS\n\nConditional statements can also be used to transform existing variables and to create new variables.  Conditional statements take the following form:\n\nIF (gender EQ 1 AND ses EQ 1) THEN group = 1;\n\nIF (gender EQ 1 AND ses EQ 2) THEN group = 2;\n\nIF (gender EQ 1 AND ses EQ 3) THEN group = 3;\n\nIF (gender EQ 2 AND ses EQ 1) THEN group = 4;\n\nIF (gender EQ 2 AND ses EQ 2) THEN group = 5;\n\nIF (gender EQ 2 AND ses EQ 3) THEN group = 6;\n\nAn individual with a missing value on any variable used in the conditional statement is assigned a missing value on the new variable.  If no value is specified for a condition, individuals with that condition are assigned a missing value.\n\nThe _MISSING keyword can be used in DEFINE to refer to missing values.  The _MISSING keyword can be used to assign a missing value to a variable, for example,\n\nIF (y EQ 0) THEN u = _MISSING;\n\nIt can also be used as part of the condition, for example,\n\nIF (y EQ _MISSING) THEN u = 1;\n\nOPTIONS FOR DATA TRANSFORMATION\n\nThe DEFINE command has six options for data transformation.  The first option creates a variable that is the average of a set of variables.  The second option creates a variable that is the sum of a set of variables.  The third option categorizes one or several variables using the same set of cutpoints.  The fourth option creates a variable that is the average for each cluster of an individual-level variable.  The fifth option centers a variable by subtracting the grand mean or group mean from each value.  The sixth option standardizes a variable to have a mean of zero and a standard deviation of one.\n\nMEAN\n\nThe MEAN option is used to create a variable that is the average of a set of variables.  It is specified as follows:\n\nmean = MEAN (y1 y3 y5);\n\nwhere the variable mean is the average of variables y1, y3, and y5.  Averages are based on the set of variables with no missing values.  Any observation that has a missing value on all of the variables being averaged is assigned a missing value on the mean variable.\n\nThe list function can be used with the MEAN option as follows:\n\nymean = MEAN (y1-y10);\n\nwhere the variable ymean is the average of variables y1 through y10.\n\nVariables used with the MEAN option must be original variables from the NAMES statement of the VARIABLE command or temporary variables created using the DEFINE command.  The order of the variables for the list function is taken from the NAMES statement not the USEVARIABLES statement.\n\nSUM\n\nThe SUM option is used to create a variable that is the sum of a set of variables.  It is specified as follows:\n\nsum = SUM (y1 y3 y5);\n\nwhere the variable sum is the sum of variables y1, y3, and y5.  Any observation that has a missing value on one or more of the variables being summed is assigned a missing value on the sum variable.\n\nThe list function can be used with the SUM option as follows:\n\nysum =  SUM (y1-y10);\n\nwhere the variable ysum is the sum of variables y1 through y10.\n\nVariables used with the SUM option must be original variables from the NAMES statement of the VARIABLE command or temporary variables created using the DEFINE command.  The order of the variables for the list function is taken from the NAMES statement not the USEVARIABLES statement.\n\nThe CUT option categorizes a variable or list of variables using the same set of cutpoints.  More than one CUT statement can be included in the DEFINE command.  Following is an example of how the CUT option is used:\n\nCUT y1  y5-y7 (30 40);\n\nThis statement results in the variables y1, y5, y6, and y7 having three categories:  less than or equal to 30, greater than 30 and less than or equal to 40, and greater than 40, with values of 0, 1, and 2, respectively.  Any observation that has a missing value on a variable that is being cut is assigned a missing value on the cut variable.\n\nVariables used with the CUT option must be original variables from the NAMES statement of the VARIABLE command or temporary variables created using the DEFINE command.  The order of the variables for the list function is taken from the NAMES statement not the USEVARIABLES statement.\n\nCLUSTER_MEAN\n\nThe CLUSTER_MEAN option is used with TYPE=TWOLEVEL and TYPE=COMPLEX along with the CLUSTER option to create a variable that is the average of the values of an individual-level variable for each cluster.  In multiple group analysis, each group’s means are used for creating cluster means in that group.  It is specified as follows:\n\nclusmean = CLUSTER_MEAN (x);\n\nwhere the variable clusmean is the average of the values of x for each cluster.  Averages are based on the set of non-missing values for the observations in each cluster.  Any cluster for which all observations have missing values is assigned a missing value on the cluster mean variable.\n\nAll transformations specified in the DATA transformation commands or before the CLUSTER_MEAN option in the DEFINE command use the original values of the variables.  All transformations specified in the DEFINE command after the CLUSTER_MEAN option use the cluster-mean values of the variables.  To be used with the CLUSTER_MEAN option, any new variables created using the DEFINE command must be placed on the USEVARIABLES list after the original variables.  The order of the variables for the list function is taken from the USEVARIALES list.  If there is not USEVARIABLES list, the order of the variables is taken from the NAMES list.\n\nCENTER\n\nThe CENTER option is used to center continuous observed variables by subtracting the grand mean or group mean from each variable.  In multiple group analysis, each group’s means are used for centering in that group.  Grand-mean centering is available for all analyses.  Group-mean centering is available with TYPE=TWOLEVEL, TYPE=THREELEVEL, TYPE=CROSSCLASSIFIED, and TYPE=COMPLEX in conjunction with the CLUSTER option.  The CENTER option has two settings:  GRANDMEAN and GROUPMEAN.\n\nAll transformations that are specified in the DATA transformation  commands or before the CENTER option in the DEFINE command use the original values of the variables.  All transformations that are specified in the DEFINE command after the CENTER option use the centered values of the variables.  To be used with the CENTER option, any new variables created using the DEFINE command must be placed on the USEVARIABLES list after the original variables.  The order of variables for the list function is taken from the USEVARIABLES list.  If there is no USEVARIABLES list, the order of the variables is taken from the NAMES list. Any observation that has a missing value on the variable to be centered is assigned a missing value on the centered variable.\n\nGRANDMEAN\n\nGrand-mean centering subtracts the overall mean from a variable.  Grand-mean centering is available for all continuous observed variables used in an analysis.  Following is an example of how to specify grand-mean centering for TYPE=TWOLEVEL and TYPE=COMPLEX:\n\nCENTER x1-x4 (GRANDMEAN);\n\nwhere x1, x2, x3, and x4 are the variables to be centered using the overall means for these variables.\n\nFor TYPE=THREELEVEL, there are three types of grand-mean centering.  Consider a model where students are nested in classrooms and classrooms are nested in schools.  Level 1 is student; level 2 is classroom; and level 3 is school.  For variables modeled on level 1 and higher, grand-mean centering subtracts the overall mean from a variable.  For variables modeled on level 2 and higher, grand-mean centering subtracts the cluster 1, classroom, mean from a variable.  For variables modeled on level 3, grand-mean centering subtracts the cluster 2, school, mean from a variable.\n\nFollowing is an example of how to specify grand-mean centering for TYPE=THREELEVEL:\n\nCENTER x1-x4 (GRANDMEAN);\n\nwhere x1, x2, x3, and x4 are the variables to be centered using the overall means for variables modeled on level 1 and higher, the cluster 1 means for variables modeled on level 2 and higher, and the cluster 2 means for variables modeled on level 3 and higher.\n\nFor TYPE=CROSSCLASSIFIED, there are three types of grand-mean centering.  Consider a model where students are nested in schools crossed with neighborhoods.  Level 1 is student; level 2a is school; and level 2b is neighborhood.   For variables modeled on level 1 and higher, grand-mean centering subtracts the overall mean from a variable.  For variables modeled on level 2a, grand-mean centering subtracts the cluster 2a, school, mean from a variable.  For variables modeled on level 2b, grand-mean centering subtracts the cluster 2b, neighborhood, mean from a variable.\n\nFollowing is an example of how to specify grand-mean centering for TYPE=CROSSCLASSIFIED:\n\nCENTER x1-x4 (GRANDMEAN);\n\nwhere x1, x2, x3, and x4 are the variables to be centered using the overall means for variables modeled on level 1 and higher, the cluster 2a means for variables modeled on level 2a, and the cluster 2b means for variables modeled on level 2b.\n\nGROUPMEAN\n\nFor TYPE=TWOLEVEL and TYPE=COMPLEX, group-mean centering subtracts the cluster mean from a variable.  For TYPE=COMPLEX, group-mean centering is available for all continuous observed variables in an analysis.  For TYPE=TWOLEVEL, group-mean centering is available for all continuous observed variables used in an analysis that are not modeled at the highest level.  Following is an example of how to specify group-mean centering:\n\nCENTER x1-x4 (GROUPMEAN);\n\nwhere x1, x2, x3, and x4 are the variables to be centered using the cluster means for these variables.\n\nFor TYPE=THREELEVEL, group-mean centering is available for any continuous observed variable that is not modeled at the highest level.  Consider a model where students are nested in classrooms and classrooms are nested in schools.  Level 1 is student; level 2 is classroom; and level 3 is school.  For variables modeled on levels 1 and 2 and for variables modeled on only level 2, group-mean centering subtracts the cluster 2, school, mean from a variable where the cluster 2 mean is the average of the cluster 1, class, means for each level 3, school, cluster. Following is an example of how to specify cluster 2 group-mean centering:\n\nCENTER x1-x4 (GROUPMEAN school);\n\nwhere school is the cluster 2 variable and x1, x2, x3, and x4 are the variables to be centered using cluster 2 means for these variables.\n\nFor variables modeled on only level 1, both cluster 1, classroom, and cluster 2, school, group-mean centering are available.  Following is an example of how to specify group-mean centering using cluster 1 and cluster 2 means:\n\nCENTER x1-x2 (GROUPMEAN class);\n\nCENTER x3 x4 (GROUPMEAN school);\n\nIn this example, class is the cluster 1 variable and x1 and x2 are the variables to be centered using cluster 1 means for these variables.  School is the cluster 2 variable and x3 and x4 are the variables to be centered using cluster 2 means for these variables.  A variable cannot be centered using both cluster 1 and cluster 2 means.\n\nFor TYPE=CROSSCLASSIFIED, group-mean centering is available for any continuous observed variable that is not modeled at the highest level.  Consider a model where students are nested in schools crossed with neighborhoods.  Level 1 is student; level 2a is school; and level 2b is neighborhood.   For variables modeled on only level 1, group-mean centering subtracts the cluster 2a, school, mean or the cluster 2b, neighborhood mean from a variable. Following is an example of how to specify cluster 2a and 2b group-mean centering:\n\nCENTER x1-x4 (GROUPMEAN school);\n\nCENTER x5-x8 (GROUPMEAN neighbor);\n\nIn this example, school is the cluster 2a variable and x1, x2, x3, and x4 are the variables to be centered using cluster 2a means for these variables.  Neighbor is the cluster 2b variable and x5, x6, x7, and x8 are the variables to be centered using the cluster 2b means for these variables.\n\nSTANDARDIZE\n\nThe STANDARDIZE option is used to standardize continuous variables by subtracting the mean from each value and dividing each value by the standard deviation.  In multiple group analysis, each group’s means are used for standardizing in that group.  Following is an example of how the STANDARDIZE option is used:\n\nSTANDARDIZE y1 y5-y10 y14;\n\nwhere the variables y1, y5 through y10, and y14 will be standardized.  Any observation that has a missing value on the variable to be standardized is assigned a missing value on the standardized variable.\n\nAll transformations that are specified in the DATA transformation commands or before the STANDARDIZE option in the DEFINE command use the original values of the variables.  All transformations that are specified in the DEFINE command after the STANDARDIZE option use the standardized values of the variables.  To be used with the STANDARDIZE option, any new variables created using the DEFINE command must be placed on the USEVARIABLES list after the original variables.  The order of variables for the list function is taken from the USEVARIABLES list.  If there is no USEVARIABLES list, the order is taken from the NAMES list.\n\nDO\n\nThe DO option provides a do loop and a double do loop to facilitate specifying the same transformation for a set of variables.  Following is an example of how to specify a do loop:\n\nDO (1, 5) diff# = y# - x#;\n\nwhere the numbers in parentheses give the range of values the do loop will use.  The number sign (#) is replaced by these values during the execution of the do loop.  Following are the transformations that are executed based on the DO option specified above:\n\ndiff1 = y1 - x1;\n\ndiff2 = y2 - x2;\n\ndiff3 = y3 - x3;\n\ndiff4 = y4 - x4;\n\ndiff5 = y5 - x5;\n\nFollowing is an example of how to specify a double do loop where x1 is equal to 0.1 and x2 is equal to 2:\n\nDO (\\$,1,2) DO (#,1,4) y\\$# = x\\$ * u#;\n\nwhere the numbers in parentheses give the range of values the double do loop will use.  The numbers replace the symbol preceding them.  Following are the transformations that are executed based on the DO option specified above:\n\ny11 = 0.1 * u1;\n\ny12 = 0.1 * u2;\n\ny13 = 0.1 * u3;\n\ny14 = 0.1 * u4;\n\ny21 = 2 * u1;\n\ny22 = 2 * u2;\n\ny23 = 2 * u3;\n\ny24 = 2 * u4;" ]
[ null, "https://www.statmodel.com/HTML_UG/chapter15v8_files/image001.gif", null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.83981645,"math_prob":0.9501582,"size":140844,"snap":"2019-13-2019-22","text_gpt3_token_len":31546,"char_repetition_ratio":0.22654076,"word_repetition_ratio":0.35511255,"special_character_ratio":0.21501803,"punctuation_ratio":0.10463662,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9822093,"pos_list":[0,1,2],"im_url_duplicate_count":[null,2,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2019-03-19T01:31:26Z\",\"WARC-Record-ID\":\"<urn:uuid:68886035-4037-4694-a313-f938f76b89c0>\",\"Content-Length\":\"319249\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:ef82385a-3ad4-4968-b3c0-a048f69d63bc>\",\"WARC-Concurrent-To\":\"<urn:uuid:d7115f90-1347-4bbf-be09-f338725428bc>\",\"WARC-IP-Address\":\"74.208.236.37\",\"WARC-Target-URI\":\"https://www.statmodel.com/HTML_UG/chapter15v8.htm\",\"WARC-Payload-Digest\":\"sha1:C7P3L6ELQ722BZAP3X3H2HGGMFAVYFV5\",\"WARC-Block-Digest\":\"sha1:Z2JSW7633QG7B3YKZF6YQRB2ZJI6PPKH\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2019/CC-MAIN-2019-13/CC-MAIN-2019-13_segments_1552912201882.11_warc_CC-MAIN-20190319012213-20190319034213-00431.warc.gz\"}"}
https://math.stackexchange.com/questions/14160/continuous-curve-interpolating-a-list-of-points
[ "# Continuous curve interpolating a list of points\n\nI need a function (a curve -- preferably a simple one) that, given $n$ points of a 2D space ($R^2$) passes (interpolates) through all points in a smooth/continuous way.\n\nFound out that what I need is a spline, however cannot find one that behaves how I need. $n$-degree Bezier curves and B-splines don't pass through the $n$ points, just move from the first to the last one using the others as control points.\n\nA Bezier spline of $n-1$ Bezier curves (defined between each pair of adjacent points) should do the trick, but to have a smooth result I would need some control points which I don't have and don't know how to compute.\n\nAny hints?" ]
[ null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.96369904,"math_prob":0.9725629,"size":637,"snap":"2023-40-2023-50","text_gpt3_token_len":162,"char_repetition_ratio":0.12480253,"word_repetition_ratio":0.0,"special_character_ratio":0.24175824,"punctuation_ratio":0.0703125,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9977321,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2023-12-07T01:45:16Z\",\"WARC-Record-ID\":\"<urn:uuid:7715a4c0-052c-4a9f-af3e-fa084e74b2df>\",\"Content-Length\":\"144128\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:7066b205-9786-4277-a712-1ac928ccdcc3>\",\"WARC-Concurrent-To\":\"<urn:uuid:78aff7c6-c883-4124-9880-c6e7cd429ee3>\",\"WARC-IP-Address\":\"172.64.144.30\",\"WARC-Target-URI\":\"https://math.stackexchange.com/questions/14160/continuous-curve-interpolating-a-list-of-points\",\"WARC-Payload-Digest\":\"sha1:PLJZLESLFHAOZGQBTPNYDJJGFWTNKK7J\",\"WARC-Block-Digest\":\"sha1:HZNDAAP5U3KWQ4GOTFDIRB7T6FS4NZ5C\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2023/CC-MAIN-2023-50/CC-MAIN-2023-50_segments_1700679100626.1_warc_CC-MAIN-20231206230347-20231207020347-00177.warc.gz\"}"}
https://web2.0calc.com/questions/linear-inequality_13
[ "+0\n\n# linear inequality\n\n0\n173\n1\n\nFind a linear inequality with the following solution set. Each grid line represents one unit.", null, "(Give your answer in the form Ax + By >= C or Ax + By > C where A, B,  and C are integers with no common factor other than 1.)\n\nJul 4, 2022\n\n#1\n+1\n\nThe points (1,1) and (0,4)  are on the graph\n\nThe slope is    ( 4 - 1)  /( 0 -1) =  3/-1  =   -3\n\nWe either have\n\ny ≤  -3x + 4\n\nor\n\ny ≥ -3x  + 4\n\n(0,0)  makes   the first true......but this point is  not in the feasible region\n\nSo\n\ny  ≥ -3x + 4 is true\n\nSo\n\n3x + y  ≥  4", null, "", null, "", null, "Jul 4, 2022" ]
[ null, "https://web2.0calc.com/api/ssl-img-proxy", null, "https://web2.0calc.com/img/emoticons/smiley-cool.gif", null, "https://web2.0calc.com/img/emoticons/smiley-cool.gif", null, "https://web2.0calc.com/img/emoticons/smiley-cool.gif", null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.85278255,"math_prob":0.9950238,"size":458,"snap":"2023-40-2023-50","text_gpt3_token_len":159,"char_repetition_ratio":0.1123348,"word_repetition_ratio":0.01923077,"special_character_ratio":0.39082968,"punctuation_ratio":0.12612613,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.99701124,"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\":\"2023-09-30T03:21:05Z\",\"WARC-Record-ID\":\"<urn:uuid:92c91735-1be8-439b-bdc4-f2b66ade714b>\",\"Content-Length\":\"22280\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:2767d87a-2515-4c84-b2c2-01f451a5d3f5>\",\"WARC-Concurrent-To\":\"<urn:uuid:ba33a52d-d7cc-45d7-896c-c55b99cd1f79>\",\"WARC-IP-Address\":\"168.119.251.111\",\"WARC-Target-URI\":\"https://web2.0calc.com/questions/linear-inequality_13\",\"WARC-Payload-Digest\":\"sha1:CSKMGSPKY37457IMTNKOBWPFYYSRPSE5\",\"WARC-Block-Digest\":\"sha1:WWXAAJXDJ5EVLDGM6J5JMF5IWUKDPQWW\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2023/CC-MAIN-2023-40/CC-MAIN-2023-40_segments_1695233510575.93_warc_CC-MAIN-20230930014147-20230930044147-00823.warc.gz\"}"}
https://www.gradesaver.com/textbooks/science/physics/college-physics-4th-edition/chapter-5-problems-page-185/12
[ "## College Physics (4th Edition)\n\nWe can rank the flywheels in order of radial acceleration of a point at the rim, from largest to smallest: $c \\gt d \\gt a \\gt b \\gt e$\nIn general: $\\omega = \\frac{2\\pi}{T}$ $v = \\omega~r$ $a_c = \\frac{v^2}{r}$ We can find the radial acceleration of a point at the rim of each flywheel: (a) $\\omega = \\frac{2\\pi}{T} = \\frac{2\\pi}{0.0040~s} = 1571~rad/s$ $v = (1571~rad/s)(0.080~m) = 125.7~m/s$ $a_c = \\frac{(125.7~m/s)^2}{0.080~m} = 197,000~m^2/s$ (b) $\\omega = \\frac{2\\pi}{T} = \\frac{2\\pi}{0.0040~s} = 1571~rad/s$ $v = (1571~rad/s)(0.020~m) = 31.4~m/s$ $a_c = \\frac{(31.4~m/s)^2}{0.020~m} = 49,000~m^2/s$ (c) $\\omega = \\frac{2\\pi}{T} = \\frac{2\\pi}{0.0010~s} = 6283~rad/s$ $v = (6283~rad/s)(0.080~m) = 502.6~m/s$ $a_c = \\frac{(502.6~m/s)^2}{0.080~m} = 3,158,000~m^2/s$ (d) $\\omega = \\frac{2\\pi}{T} = \\frac{2\\pi}{0.0010~s} = 6283~rad/s$ $v = (6283~rad/s)(0.020~m) = 125.7~m/s$ $a_c = \\frac{(125.7~m/s)^2}{0.020~m} = 790,000~m^2/s$ (e) $\\omega = \\frac{2\\pi}{T} = \\frac{2\\pi}{0.0040~s} = 1571~rad/s$ $v = (1571~rad/s)(0.010~m) = 15.7~m/s$ $a_c = \\frac{(15.7~m/s)^2}{0.010~m} = 25,000~m^2/s$ We can rank the flywheels in order of radial acceleration of a point at the rim, from largest to smallest: $c \\gt d \\gt a \\gt b \\gt e$" ]
[ null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.62036633,"math_prob":1.0000098,"size":1246,"snap":"2019-43-2019-47","text_gpt3_token_len":603,"char_repetition_ratio":0.18599033,"word_repetition_ratio":0.4457143,"special_character_ratio":0.5770466,"punctuation_ratio":0.110119045,"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\":\"2019-11-12T23:31:10Z\",\"WARC-Record-ID\":\"<urn:uuid:10af1a52-71b0-4504-b01e-6082cea344e9>\",\"Content-Length\":\"69160\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:5bb0ef62-e1dd-417e-807c-00f8293983ba>\",\"WARC-Concurrent-To\":\"<urn:uuid:56c2510f-c056-48ae-8bea-e67528a31597>\",\"WARC-IP-Address\":\"3.90.134.5\",\"WARC-Target-URI\":\"https://www.gradesaver.com/textbooks/science/physics/college-physics-4th-edition/chapter-5-problems-page-185/12\",\"WARC-Payload-Digest\":\"sha1:4LKHPSKIOIZX52WPPXICOI3IFUIHA7ZW\",\"WARC-Block-Digest\":\"sha1:CYYP4YU73JN7V4VHR4NECBFFNBVLDCO7\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2019/CC-MAIN-2019-47/CC-MAIN-2019-47_segments_1573496665809.73_warc_CC-MAIN-20191112230002-20191113014002-00045.warc.gz\"}"}
https://rnmrtk.uchc.edu/rnmrtk/Analysis.html
[ "", null, "Analysis\n\nadump dim;l filename;l row1;i [row2;i ...]\nadump dim;l filename;l row1;i comp1;l [row2;i comp2;l ...]\n\nPerforms an ASCII dump of the specified rows along the specified dimension. The component indicators must be R or I if one of the dimensions is complex, or RR, RI, IR, or II if both are complex.\n\ninject [peaklist-file;l]\n\nAdds synthetic decaying sinusoids to the data set. All the dimensions must be in the time domain. If a peaklist file is specified, the program will record the peaks added to the data; each line of the file will contain the peak number, amplitude, and frequency in each dimension. If no peaklist file is specified, the peak list is just written to the screen.\n\nOnce invoked, the program accepts the set of commands listed below. In these commands, the symbol \"n\" stands for a dimension number (1 through 4).\n\nxpeakfit dim;l {IN or ANTI} row1;i row2;i [nignore;i] noise;f lphase;f freq;f linewidth;f coupling;f\n\nPerforms a nonlinear least-squares fit to J-modulated doublet (in- phase or anti-phase) in the time domain. Row1 is the row number to use for the fit. Row2 is a row to be co-added (subtracted for anti-phase), or 0 for none. nignore is the number of points at the start of the FID to leave out of the fit (default is 0). Noise is the RMS (real) noise level, used for tests of significance. Lphase is the linear phase correction needed. Freq is the cross peak central frequency in ppm. Linewidth is the initial estimated linewidth in Hz (0. will probably work okay). Coupling is the initial estimated coupling constant in Hz.\n\nHZ\n\nSpecify that all frequencies will be given in Hz.\n\nPPM\n\nSpecify that frequencies will be given in ppm (except for linewidths, which are always in Hz).\n\nAMP amp-low;f [amp-high;f]\n\nSet a range of amplitudes for the synthetic peaks. If amp-high is not given, it is taken to be the same as amp-low.\n\nLWn linewidth;f\n\nSet the synthetic peaks' linewidth in a dimension. The linewidth is given in Hz.\n\nFn freq-low;f [freq-high;f]\n\nSet a range for the peaks' frequencies in a dimension. If freq-high is not given, it is taken to be the same as freq-low. The frequencies can be given in Hz or ppm (see HZ and PPM).\n\nPHASEn {cphase;f [lphase;f] or cphase;i [lphase;i]}\n\nSpecify the phase correction to be used in processing a dimension. The synthetic peaks will be generated with a phase opposite to the value specified, so that when the correction is applied the peaks will be in phase.\n\nSEED seed-1;i ... seed-n;i\n\nSpecify a set of seeds (one in each dimension) for the subrandom number generator, used to produce the peaks' frequencies.\n\nNPEAKS num;i\n\nSpecify the number of peaks to generate. The maximum is 100. The amplitude range, linewidths, frequency ranges must have been set previously (see LWn, and Fn). Phase corrections (PHASEn) are optional. The program will generate this many peaks, with amplitudes evenly spaced in the given range and with frequencies distributed in the appropriate ranges according to a subrandom algorithm (see SEED). The signals will be added to the data set and printed in the peak list file.\n\nPEAK [ppm] amp;f freq-1;f ... freq-n;f\n\nSpecify an individual peak with a given amplitude and frequencies. The frequencies can be given in Hz or ppm (see the HZ and PPM commands) The linewidths must already have been set (see LWn). The peak will be added to the data set (and printed in the peak list file) immediately.\n\nSpecify the name of a sampling schedule file and the dimension(s) to which the schedule applies.  The dimensions must be contiguous in memory; all of them should have length 1 except one, which has length equal to the number of entries in the sampling schedule.\n\nThe sampling schedule file contains a list of lines, each referring to one data point.  The format of the lines is:\n\nindex-a;i index-b;i ... [nacq;i]\n\nwhere index-a, index-b, and so on give the time index for the data point in the a-, b-, etc. dimensions. Nacq is the number of \"acquisition units\" for the point; it is used to describe data in which different points are recorded using different numbers of acquisitions (phase cycles or transients).  The default value for nacq is 1.\n\nEXIT\n\nExit inject." ]
[ null, "https://rnmrtk.uchc.edu/rnmrtk/Analysis_files/shapeimage_1.jpg", null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.8583234,"math_prob":0.95448947,"size":4198,"snap":"2023-14-2023-23","text_gpt3_token_len":1027,"char_repetition_ratio":0.13376252,"word_repetition_ratio":0.053295933,"special_character_ratio":0.23034778,"punctuation_ratio":0.15021929,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9634357,"pos_list":[0,1,2],"im_url_duplicate_count":[null,1,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2023-03-24T06:42:54Z\",\"WARC-Record-ID\":\"<urn:uuid:7f5b60a1-04b5-46b8-b2e4-f246bdc58228>\",\"Content-Length\":\"17777\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:a6ca22f4-4375-4eea-acb9-a6653e7853f3>\",\"WARC-Concurrent-To\":\"<urn:uuid:976da65e-e7c8-4ed0-84aa-ffe3abaaf1db>\",\"WARC-IP-Address\":\"155.37.200.50\",\"WARC-Target-URI\":\"https://rnmrtk.uchc.edu/rnmrtk/Analysis.html\",\"WARC-Payload-Digest\":\"sha1:FOZHU5PEFK5QHBQKCF56PT6MMTVZWE4N\",\"WARC-Block-Digest\":\"sha1:O2M3WSELG3CRDBXOHHVHDNTIFIIBSBTS\",\"WARC-Identified-Payload-Type\":\"application/xhtml+xml\",\"warc_filename\":\"/cc_download/warc_2023/CC-MAIN-2023-14/CC-MAIN-2023-14_segments_1679296945248.28_warc_CC-MAIN-20230324051147-20230324081147-00702.warc.gz\"}"}
https://raresql.com/tag/missing-column-in-table-or-view/
[ "Feeds:\nPosts\n\n## SQL Server – Compare two databases schema\n\nToday, I received an email from one of my blog readers, who would like to match test and production databases. Here is a basic script to compare two databases.\n\nGiven below are the objects, script will compare in source and target databases.\n\n• Tables\n• Views\n• Stored Procedures\n• User Defined Functions\n• Triggers\n• Primary Keys\n• Indexes\n• Missing column in table or view\n• Mismatch data type in table or view\n• Missing Parameter in the stored procedure\n```Create Procedure Sp_Compare_two_database_Schema\n@Source_DB_Name nvarchar(Max),\n@Target_DB_Name varchar(Max)\n\nAs\nBEGIN\nDECLARE @SQL nvarchar(MAX)\n\nSET @Source_DB_Name=QUOTENAME(@Source_DB_Name)\nSET @Target_DB_Name=QUOTENAME(@Target_DB_Name)\n\nSET @SQL=''\n\nCREATE TABLE #Result\n(\n[Main Object Type] nvarchar(max),\n[Main Object Name] nvarchar(max),\n[Type] varchar(50),\n[Sub Object Type] nvarchar(max),\n[Sub Object Name] nvarchar(max)\n)\n\n--Match Main Objects Like Tables, view, Stored Procedure , triggers.\nSET @SQL= 'Insert into #Result Select A.[type_desc] as [Main Object Type],A.[name],''Object Missing'' as [Type]\n,A.[type_desc] as [Sub Object Type]\n,A.[name] as [Sub Object Name]\nfrom ' + @Source_DB_Name + '.sys.objects A\nWhere [Parent_object_id]=0 And A.[name] NOT IN(\nSelect [name] from ' + @Target_DB_Name + '.sys.objects)\nOrder By A.[type_desc]'\nPrint @SQL\nEXEC (@SQL)\n\n--Match Sub Objects Like Foreign Keys.\nSET @SQL= 'Insert into #Result Select A.[type_desc] as [Main Object Type],A.[name],''Object Missing'' as [Type]\n,B.[type_desc] as [Sub Object Type]\n,B.[name] as [Sub Object Name]\nfrom ' + @Source_DB_Name + '.sys.objects A\nInner Join ' + @Source_DB_Name + '.sys.objects B\nOn A.[object_id]=B.[Parent_object_id]\nWhere B.[name] NOT IN(\nSelect [name] from ' + @Target_DB_Name + '.sys.objects)\nOrder By A.[type_desc]'\nPrint @SQL\nEXEC (@SQL)\n\n--Find if any column is missing in target database.\n\nSET @SQL= ';With CteA AS (Select A.[type_desc] as [Main Object Type],A.[Name] as [Main Object Name],''Column Missing'' as [Type],B.[Name] as [Column Name]\nfrom ' + @Source_DB_Name + '.sys.objects A\nInner Join ' + @Source_DB_Name + '.sys.columns B\nOn A.[object_id] =B.[object_id]\nWhere A.[Type] In (''U'',''V'')\n)\n,CteB AS (Select A.[type_desc] as [Main Object Type],A.[Name] as [Main Object Name],''Column Missing'' as [Type],B.[Name] as [Column Name]\nfrom ' + @Target_DB_Name + '.sys.objects A\nInner Join ' + @Target_DB_Name + '.sys.columns B\nOn A.[object_id] =B.[object_id]\nWhere A.[Type] In (''U'',''V'')\n)\nInsert into #Result\nSelect A.[Main Object Type],A.[Main Object Name],A.[Type], ''Column'' as [Sub Object Type],A.[Column Name] from CTEA A\nLeft Join CTEB B On\nA.[Main Object Type]=B.[Main Object Type]\nAnd A.[Main Object Name]=B.[Main Object Name]\nAnd A.[Column Name]=B.[Column Name]\nWhere (B.[Main Object Name] is NULL OR B.[Column Name] is NULL)\nAnd A.[Main Object Name] Not In (Select [Main Object Name] from #Result A\nWhere A.[Type]=''Object Missing'')\nOrder By A.[Main Object Type],A.[Main Object Name], A.[Column Name]'\nPrint @SQL\nEXEC (@SQL)\n\n--Find if any column data type is not sync with target database.\n\nSET @SQL= ';With CteA AS (Select A.[type_desc] as [Main Object Type],A.[Name] as [Main Object Name]\n,''Data Type Difference'' as [Type],B.[Name] as [Column Name]\n,B.[system_type_id]\nfrom ' + @Source_DB_Name + '.sys.objects A\nInner Join ' + @Source_DB_Name + '.sys.columns B\nOn A.[object_id] =B.[object_id]\nWhere A.[Type] In (''U'',''V'')\n)\n,CteB AS (Select A.[type_desc] as [Main Object Type],A.[Name] as [Main Object Name],''Data Type Difference'' as [Type],B.[Name] as [Column Name],B.[system_type_id]\nfrom ' + @Target_DB_Name + '.sys.objects A\nInner Join ' + @Target_DB_Name + '.sys.columns B\nOn A.[object_id] =B.[object_id]\nWhere A.[Type] In (''U'',''V'')\n)\n\nInsert into #Result Select A.[Main Object Type],A.[Main Object Name],A.[Type], ''Column'' as [Sub Object Type], A.[Column Name] from CTEA A\nInner Join CTEB B On\nA.[Main Object Type]=B.[Main Object Type]\nAnd A.[Main Object Name]=B.[Main Object Name]\nAnd A.[Column Name]=B.[Column Name]\nWhere A.[system_type_id]<>B.[system_type_id]\nAnd A.[Main Object Name] Not In (Select [Main Object Name] from #Result A\nWhere A.[Type]=''Object Missing'')\nOrder By A.[Main Object Type],A.[Main Object Name], A.[Column Name]'\n\nPrint @SQL\nEXEC (@SQL)\n\n--Find if any parameter of the procedure is missing in target database.\n\nSET @SQL= ';With CteA AS (Select A.[type_desc] as [Main Object Type]\n,A.[Name] as [Main Object Name],''Parameter Missing'' as [Type],B.[name] as [Parameter Name]\nfrom' + @Source_DB_Name + '.sys.objects A\nInner Join ' + @Source_DB_Name + '.sys.all_parameters B On A.[object_id] =B.[Object_id]\n)\n,CteB AS (\nSelect A.[type_desc] as [Main Object Type]\n,A.[Name] as [Main Object Name],''Parameter Missing'' as [Type],B.[name] as [Parameter Name]\nfrom ' + @Target_DB_Name + '.sys.objects A\nInner Join ' + @Target_DB_Name + '.sys.all_parameters B On A.[object_id] =B.[Object_id]\n)\n\nInsert into #Result Select A.[Main Object Type],A.[Main Object Name],A.[Type]\n, ''Parameter'' as [Sub Object Type]\n, A.[Parameter Name] from CTEA A\nLeft Join CTEB B On\nA.[Main Object Type]=B.[Main Object Type]\nAnd A.[Main Object Name]=B.[Main Object Name]\nAnd A.[Parameter Name]=B.[Parameter Name]\nWhere (B.[Main Object Name] IS NULL OR B.[Parameter Name] IS NULL)\nAnd A.[Main Object Name] Not In (Select [Main Object Name] from #Result A\nWhere A.[Type]=''Object Missing'')\nOrder By A.[Main Object Type],A.[Main Object Name], A.[Parameter Name]'\nPrint @SQL\nEXEC (@SQL\n)\nSelect * from #Result A Order By A.[Main Object Type] DESC, A.[Main Object Name] ASC ,[Type] DESC\nEND\nGO\n\n--Syntax\n--Sp_Compare_two_database_Schema 'Source DatabaseName','Target DatbaseName'\n\n--Example\nSp_Compare_two_database_Schema 'Source_DB','Target_DB'\n```", null, "" ]
[ null, "https://raresql.files.wordpress.com/2012/10/compare-two-databases-1-11.png", null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.6190459,"math_prob":0.42103875,"size":5737,"snap":"2022-27-2022-33","text_gpt3_token_len":1649,"char_repetition_ratio":0.23460667,"word_repetition_ratio":0.5683544,"special_character_ratio":0.30678055,"punctuation_ratio":0.18604651,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9503667,"pos_list":[0,1,2],"im_url_duplicate_count":[null,4,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2022-06-25T04:33:04Z\",\"WARC-Record-ID\":\"<urn:uuid:8c667be6-1810-4bea-87d6-0dc49967bba2>\",\"Content-Length\":\"82801\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:85832ec8-3918-4bd2-967f-6c6695e0f516>\",\"WARC-Concurrent-To\":\"<urn:uuid:11b4aec6-701a-47d2-a6bc-f958c11adbec>\",\"WARC-IP-Address\":\"192.0.78.24\",\"WARC-Target-URI\":\"https://raresql.com/tag/missing-column-in-table-or-view/\",\"WARC-Payload-Digest\":\"sha1:ICJGYEFRUHM5QWF75BLJEATNE5ZNJ6SK\",\"WARC-Block-Digest\":\"sha1:NSGSE2CBZMRI2YNKB36XM5MYAS4H46BO\",\"WARC-Identified-Payload-Type\":\"application/xhtml+xml\",\"warc_filename\":\"/cc_download/warc_2022/CC-MAIN-2022-27/CC-MAIN-2022-27_segments_1656103034170.1_warc_CC-MAIN-20220625034751-20220625064751-00012.warc.gz\"}"}
https://brilliant.org/discussions/thread/logical-transformations-as-a-klein-4-group/
[ "# Logical Transformations as a Klein 4-Group\n\nAfter recently studying statements and their logical transformations, I was happily surprised to discover a resemblance between these transformations and a special type of group known in group theory as a Klein 4-group.\n\nFirst off, the logical transformations I was studying were the contrapositive, the converse, and the inverse. For example, if we take the statement \"If x then y\", we can transform it into:\n\n1. The contrapositive: \"If not y, then not x\",\n2. The converse: \"If y, then x\", and\n3. The inverse: \"If not x, then not y\"\n\nFor convenience, I will abbreviate these $C_P$, $C$, and $I$, and the original statement $S$.\n\nIn exploring these transformations further, I realized that instead of going from the original statement to one of the transformations, I could apply a transformation on top of a transformation.\n\nFor example, the contrapositive of the converse is the contrapositive of \"If y, then x\", which is \"If not x, then not y\".\n\nHowever, these double transformations all became other transformations! In the example above, for instance, the resulting statement is really just the inverse of the original statement. After trying out many of these double transformations, I realized that I was actually constructing a Cayley table.\n\nWithout delving to deeply into group theory, a Cayley table is a table used to show how a collection of items behave when combined in certain ways. In my case, I realized I could use a Cayley table to show how logic transformations behaved when applied more then once on a statement.\n\nI came up with the following table:\n\n $~$ $S~$ $C_P$ $C~$ $I~$ $S~$ $S~$ $C_P$ $C~$ $I~$ $C_P$ $C_P$ $S~$ $I~$ $C~$ $C~$ $C~$ $I~$ $S~$ $C_P$ $I~$ $I~$ $C~$ $C_P$ $S~$\n\nWhich has been classified, more generally, by group theorists as the Klein 4-group. Technically, this represents a transformation in any row first being applied, and then a transformation in any column being applied second with their intersection being the resulting statement. However, as is the case with this and many other types of groups, the transformations are commutative, meaning the order they are applied in does not matter.\n\nMaybe it is just me, but I thought it so fascinating that something as fundamental as logic could be described by something so abstract as group theory, and thus relating it to a host of other applications such as physics, chemistry, and Rubik's cubes!\n\nI would love any feedback anyone has on this topic. I have not been able to find anything online relating logic to group theory, so any extra information or ideas would be much appreciated!", null, "Note by David Stiff\n2 years ago\n\nThis discussion board is a place to discuss our Daily Challenges and the math and science related to those challenges. Explanations are more than just a solution — they should explain the steps and thinking strategies that you used to obtain the solution. Comments should further the discussion of math and science.\n\nWhen posting on Brilliant:\n\n• Use the emojis to react to an explanation, whether you're congratulating a job well done , or just really confused .\n• Ask specific questions about the challenge or the steps in somebody's explanation. Well-posed questions can add a lot to the discussion, but posting \"I don't understand!\" doesn't help anyone.\n• Try to contribute something new to the discussion, whether it is an extension, generalization or other idea related to the challenge.\n\nMarkdownAppears as\n*italics* or _italics_ italics\n**bold** or __bold__ bold\n- bulleted- list\n• bulleted\n• list\n1. numbered2. list\n1. numbered\n2. list\nNote: you must add a full line of space before and after lists for them to show up correctly\nparagraph 1paragraph 2\n\nparagraph 1\n\nparagraph 2\n\n[example link](https://brilliant.org)example link\n> This is a quote\nThis is a quote\n # I indented these lines\n# 4 spaces, and now they show\n# up as a code block.\n\nprint \"hello world\"\n# I indented these lines\n# 4 spaces, and now they show\n# up as a code block.\n\nprint \"hello world\"\nMathAppears as\nRemember to wrap math in $$ ... $$ or $ ... $ to ensure proper formatting.\n2 \\times 3 $2 \\times 3$\n2^{34} $2^{34}$\na_{i-1} $a_{i-1}$\n\\frac{2}{3} $\\frac{2}{3}$\n\\sqrt{2} $\\sqrt{2}$\n\\sum_{i=1}^3 $\\sum_{i=1}^3$\n\\sin \\theta $\\sin \\theta$\n\\boxed{123} $\\boxed{123}$\n\nSort by:\n\nI don't think this is a particularly surprising result, as every group of order 4 is either cyclic or isomorphic to the Vierergruppe... Obviously it's not cyclic (since each logical statement is idempotent); hence, the only thing to verify is closure and associativity of composition of \"logical transformations\" (whatever that means). There's also an application of the Vierergruppe to music composition too...\n\nI think it would be beneficial for you to add this to the Klein 4-group Wikipedia page, as well as this page, but you may want to make sure that your writing is perfect.\n\nThis is a result of the fact that inverse and converse are both C2 groups and combining both of them is equivalent to taking a direct sum on some level.\n\n- 7 months, 3 weeks ago\n\nThanks Sam. I must admit that I am not very knowledgeable in the field of group theory. When I posted this, I merely discovered a resemblance to something called the Klein-4 group which I had read about briefly.\n\n- 7 months, 3 weeks ago" ]
[ null, "https://ds055uzetaobb.cloudfront.net/brioche/avatars-2/resized/45/9f3853a5d95700c2d4b2fa03e4920f39.ecf9808c04-wyAuq3FHsk.jpg", null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.9430001,"math_prob":0.937412,"size":4049,"snap":"2020-34-2020-40","text_gpt3_token_len":870,"char_repetition_ratio":0.13003708,"word_repetition_ratio":0.0,"special_character_ratio":0.21289207,"punctuation_ratio":0.12387097,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.98422235,"pos_list":[0,1,2],"im_url_duplicate_count":[null,null,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2020-09-27T11:12:35Z\",\"WARC-Record-ID\":\"<urn:uuid:5e35810c-d895-48d7-8b86-94cd92f8c06a>\",\"Content-Length\":\"80295\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:07c32c40-c8ec-4792-b667-283c222b0d36>\",\"WARC-Concurrent-To\":\"<urn:uuid:4c0968af-8720-4f0a-9239-c4f3fb545ce6>\",\"WARC-IP-Address\":\"104.20.34.242\",\"WARC-Target-URI\":\"https://brilliant.org/discussions/thread/logical-transformations-as-a-klein-4-group/\",\"WARC-Payload-Digest\":\"sha1:WQPYLAU6XXVA3PI653SML4T35J5O3NJ7\",\"WARC-Block-Digest\":\"sha1:TPYUYP35Q34GIVZPZM7QMGGN2IOAHIC4\",\"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-00382.warc.gz\"}"}
https://aspire.eecs.berkeley.edu/publication/probably-efficient-algorithms-for-numerical-tensor-algebra/
[ "# Provably Efficient Algorithms for Numerical Tensor Algebra\n\nThis thesis targets the design of parallelizable algorithms and communication-efficient parallel schedules for numerical linear algebra as well as computations with higher-order tensors. Communication is a growing bottleneck in the execution of most algorithms on parallel computers, which manifests itself as data movement both through the network connecting different processors and through the memory hierarchy of each processor as well as synchronization between processors. We provide a rigorous theoretical model of communication and derive lower bounds as well as algorithms in this model. Our analysis concerns two broad areas of linear algebra and of tensor contractions. We demonstrate the practical quality of the new theoretically-improved algorithms by presenting results which show that our implementations outperform standard libraries and traditional algorithms.\nWe model the costs associated with local computation, communication, and synchronization. We introduce a new technique for deriving lower bounds on tradeoffs between these costs and apply them to algorithms in both dense and sparse linear algebra as well as graph algorithms. These lower bounds are attained by what we refer to as 2.5D algorithms, which we give for matrix multiplication, Gaussian elimination, QR factorization, the symmetric eigenvalue problem, and the Floyd-Warshall all-pairs shortest-paths algorithm. 2.5D algorithms achieve lower interprocessor bandwidth cost by exploiting auxiliary memory. Algorithms employing this technique are well known for matrix multiplication, and have been derived in the BSP model for LU and QR factorization, as well as the Floyd-Warshall algorithm. We introduce alternate versions of LU and QR algorithms which have measurable performance improvements over their BSP counterparts, and we give the first evaluations of their performance. For the symmetric eigenvalue problem, we give the first 2.5D algorithms, additionally solving challenges with memory-bandwidth efficiency that arise for this problem. We also give a new memory-bandwidth efficient algorithm for Krylov subspace methods (repeated multiplication of a vector by a sparse-matrix).\nThe latter half of the thesis contains algorithms for higher-order tensors, in particular tensor contractions. We introduce Cyclops Tensor Framework, which provides an automated mechanism for network-topology-aware decomposition and redistribution of tensor data. It leverages 2.5D matrix multiplication to perform tensor contractions communication-efficiently. The framework is capable of exploiting symmetry and antisymmetry in tensors and utilizes a distributed packed-symmetric storage format. Finally, we consider a theoretically novel technique for exploiting tensor symmetry to lower the number of multiplications necessary to perform a contraction via computing some redundant terms that allow preservation of symmetry and then cancelling them out with low-order cost. We analyze the numerical stability and communication efficiency of this technique and give adaptations to antisymmetric and Hermitian matrices. This technique has promising potential for accelerating coupled-cluster (electronic structure) methods both in terms of computation and communication cost.\n\nPaper\n\nPublication Date: September 2014\nConference: PhD Dissertation" ]
[ null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.9280559,"math_prob":0.8631759,"size":4191,"snap":"2020-10-2020-16","text_gpt3_token_len":695,"char_repetition_ratio":0.13494149,"word_repetition_ratio":0.4116608,"special_character_ratio":0.15437843,"punctuation_ratio":0.071875,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9837108,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2020-02-25T22:00:55Z\",\"WARC-Record-ID\":\"<urn:uuid:05dcb7c3-48e9-4b8f-b20d-081456e57946>\",\"Content-Length\":\"28950\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:0ecfbf56-39b1-4414-bccd-d31b31be6638>\",\"WARC-Concurrent-To\":\"<urn:uuid:35ebd5b8-8b91-451b-8245-16916e63123d>\",\"WARC-IP-Address\":\"128.32.37.248\",\"WARC-Target-URI\":\"https://aspire.eecs.berkeley.edu/publication/probably-efficient-algorithms-for-numerical-tensor-algebra/\",\"WARC-Payload-Digest\":\"sha1:QGXQRJYDDO4LFRWTX5SLZBRMYE64GQSA\",\"WARC-Block-Digest\":\"sha1:XVPO2TLR5WCPZLRROXWTXILTUILO7WEB\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2020/CC-MAIN-2020-10/CC-MAIN-2020-10_segments_1581875146160.21_warc_CC-MAIN-20200225202625-20200225232625-00314.warc.gz\"}"}
https://www.uoguelph.ca/registrar/calendars/undergraduate/2018-2019/c12/c12math.shtml
[ "# XII. Course Descriptions\n\n## Mathematics\n\nDepartment of Mathematics and Statistics\n\nSuggested initial course sequence:\n\n1. For students with 4U or OAC Calculus and expecting to pursue further studies in mathematics or the physical sciences: MATH*1200, MATH*1210.\n\n2. For students interested in applications to the biological sciences: MATH*1080, MATH*2080.\n\n3. For students not expecting to pursue further studies in mathematics: MATH*1030, one STAT*XXXX course.\n\nMATH*1030 Business Mathematics F,W (3-0) [0.50]\nPrimarily intended for business and economics students, this course is designed to introduce and reinforce the essential mathematical skills needed to understand, analyze, and solve mathematical problems related to business and economics. Topics covered include basic algebra; functions, including a review of exponential and logarithmic functions; sequences and series with financial applications; limits; continuity; and differential calculus including derivatives, higher order derivatives, and curve sketching.\nOffering(s): Also offered through Distance Education format.\nRestriction(s): MATH*1080, MATH*1200 Not available to students registered in the BSC program.\nDepartment(s): Department of Mathematics and Statistics\nMATH*1080 Elements of Calculus I F,W (3-1) [0.50]\nThis course provides an introduction to the calculus of one variable with emphasis on mathematical modelling in the biological sciences. The topics covered include elementary functions, sequences and series, difference equations, differential calculus and integral calculus.\nPrerequisite(s): 1 of 4U Advanced Functions, 4U Advanced Functions and Calculus or equivalent\nRestriction(s): IPS*1500, MATH*1200\nDepartment(s): Department of Mathematics and Statistics\nMATH*1160 Linear Algebra I F,W (3-0) [0.50]\nThis course provides an introduction to linear algebra in Euclidean space. Topics covered include: N-dimensional vectors, dot product, matrices and matrix operations, systems of linear equations and Gaussian elimination, linear independence, subspaces, basis and dimension, matrix inverse, matrix rank and determinant, eigenvalues, eigenvectors and diagonalization, orthogonalization and projections, linear transformations. Some fundamental proofs and applications of these topics will be included.\nPrerequisite(s): 4U Calculus and Vectors or 4U Advanced Functions\nRestriction(s): ENGG*1500, MATH*2150, MATH*2160\nDepartment(s): Department of Mathematics and Statistics\nMATH*1200 Calculus I F (3-1) [0.50]\nThis is a theoretical course intended primarily for students who expect to pursue further studies in mathematics and its applications. Topics include inequalities and absolute value; compound angle formulas for trigonometric functions; limits and continuity using rigorous definitions; the derivative and derivative formulas (including derivatives of trigonometric, exponential and logarithmic functions); Fermat's theorem; Rolle's theorem; the mean-value theorem; applications of the derivative; Riemann sums; the definite integral; the fundamental theorem of calculus; applications of the definite integral; the mean value theorem for integrals.\nPrerequisite(s): 1 of 4U Calculus and Vectors, 4U Advanced Functions and Calculus or Grade 12 Calculus\nRestriction(s): IPS*1500, MATH*1080\nDepartment(s): Department of Mathematics and Statistics\nMATH*1210 Calculus II W (3-1) [0.50]\nThis course is a continuation of MATH*1200. It is a theoretical course intended primarily for students who need or expect to pursue further studies in mathematics, physics, chemistry, engineering and computer science. Topics include inverse functions, inverse trigonometric functions, hyperbolic functions, indeterminate forms and l'Hopital's rule, techniques of integration, parametric equations, polar coordinates, Taylor and Maclaurin series; functions of two or more variables, partial derivatives, and if time permits, an introduction to multiple integration.\nPrerequisite(s): MATH*1080 or MATH*1200\nRestriction(s): IPS*1510, MATH*2080\nDepartment(s): Department of Mathematics and Statistics\nMATH*2000 Proofs, Sets, and Numbers F (3-1) [0.50]\nThis course exposes the student to formal mathematical proof, and introduces the theory of sets and number systems. Topics include relations and functions, number systems including formal properties of the natural numbers, integers, and the real and complex numbers. Equivalence relations and partial and total orders are introduced. The geometry and topology of the real number line and Cartesian plane are introduced. Techniques of formal proof are introduced including well-ordering, mathematical induction, proof by contradiction, and proof by construction. These techniques will be applied to fundamental theorems from linear algebra.\nPrerequisite(s): 1 of IPS*1500, MATH*1080, MATH*1160, MATH*1200\nDepartment(s): Department of Mathematics and Statistics\nMATH*2080 Elements of Calculus II W (3-1) [0.50]\nThis course will expand on integration techniques, and introduce students to difference and differential equations, vectors, vector functions, and elements of calculus of two or more variables such as partial differentiation and multiple integration. The course will emphasize content relevant to analyzing biological systems, and methods will be illustrated by application to biological systems.\nPrerequisite(s): 1 of IPS*1500, MATH*1080, MATH*1200\nRestriction(s): IPS*1510, MATH*1210\nDepartment(s): Department of Mathematics and Statistics\nMATH*2130 Numerical Methods W (3-1) [0.50]\nThis course provides a theoretical and practical introduction to numerical methods for approximating the solution(s) of linear and nonlinear problems in the applied sciences. The topics covered include: solution of a single nonlinear equation; polynomial interpolation; numerical differentiation and integration; solution of initial value and boundary value problems; and the solution of systems of linear and nonlinear algebraic equations.\nPrerequisite(s): 1 of IPS*1510, MATH*1210, MATH*2080\nDepartment(s): Department of Mathematics and Statistics\nMATH*2200 Advanced Calculus I F (3-0) [0.50]\nThe topics covered in this course include infinite sequences and series, power series, tests for convergence, Taylor's theorem and Taylor series for functions of one variable, planes and quadratric surfaces, limits, and continuity, differentiability of functions of two or more variables, partial differentiation, directional derivatives and gradients, tangent planes, linear approximation, Taylor's theorem for functions of two variables, critical points, extreme value problems, implicit function theorem, Jacobians, multiple integrals, and change of variables.\nPrerequisite(s): 1 of IPS*1510, MATH*1210, MATH*2080\nDepartment(s): Department of Mathematics and Statistics\nMATH*2210 Advanced Calculus II W (3-0) [0.50]\nThis course continues the study of multiple integrals, introducing spherical and cylindrical polar coordinates. The course also covers vector and scalar fields, including the gradient, divergence, curl and directional derivative, and their physical interpretation, as well as line integrals and the theorems of Green and Stokes.\nPrerequisite(s): MATH*2200\nDepartment(s): Department of Mathematics and Statistics\nMATH*2270 Applied Differential Equations F (3-1) [0.50]\nThis course covers the solution of differential equations that arise from problems in engineering and science. Topics include linear equations of first and higher order, systems of linear equations, Laplace transforms, series solutions of second-order equations, and an introduction to partial differential equations.\nPrerequisite(s): (ENGG*1500 or MATH*1160), (1 of IPS*1510, MATH*1210, MATH*2080)\nRestriction(s): MATH*2170\nDepartment(s): Department of Mathematics and Statistics\nMATH*3100 Differential Equations II W (3-1) [0.50]\nThis course continues the study of differential equations. Power series solutions around regular singular points including Bessel equations are presented. First order linear systems and their general solution by matrix methods are thoroughly covered. Nonlinear systems are introduced along with the concepts of linearization, stability of equilibria, phase plane analysis, Lyapunov's method, periodic solutions and limit cycles. Two-point boundary value problems are discussed and an introduction to linear partial differential equations and their solution by separation of variables and Fourier series is given.\nPrerequisite(s): (1 of MATH*1160, MATH*2150, MATH*2160), (MATH*2170 or MATH*2270)\nDepartment(s): Department of Mathematics and Statistics\nMATH*3130 Abstract Algebra F (3-0) [0.50]\nThis course is an introduction to abstract algebra, covering both group theory and ring theory. Specific topics covered include an introduction to group theory, permutations, symmetric and dihedral groups, subgroups, normal subgroups and factor groups. Group theory continues through the fundamental homomorphism theorem. Ring theory material covered includes an introduction to ring theory, subrings, ideals, quotient rings, polynomial rings, and the fundamental ring homomorphism theorem.\nOffering(s): Offered in even-numbered years.\nPrerequisite(s): MATH*2000, (1 of MATH*1160, MATH*2150, MATH*2160)\nDepartment(s): Department of Mathematics and Statistics\nMATH*3160 Linear Algebra II W (3-0) [0.50]\nThe topics in this course include complex vector spaces, direct sum decompositions of vector spaces, the Cayley-Hamilton theorem, the spectral theorem for normal operators and the Jordan canonical form.\nPrerequisite(s): (MATH*1160 or MATH*2160), 1.00 credits in MATH or STAT at the 2000 level or above\nDepartment(s): Department of Mathematics and Statistics\nMATH*3200 Real Analysis F (3-0) [0.50]\nThis course provides a basic foundation for real analysis. The rigorous treatment of the subject in terms of theory and examples gives students the flavour of mathematical reasoning and intuition for other advanced topics in mathematics. Topics covered include the real number line and the supremum property; metric spaces; continuity and uniform continuity; completeness and compactness; the Banach fixed-point theorem and its applications to ODEs; uniform convergence and the rigorous treatment of the Riemann integral.\nPrerequisite(s): MATH*2000, MATH*2210, (MATH*1160 or MATH*2160)\nDepartment(s): Department of Mathematics and Statistics\nMATH*3240 Operations Research F (3-0) [0.50]\nThis is a course in mathematical modelling which has applications to engineering, economics, business and logistics. Topics covered include linear programming and the simplex method, network models and the shortest path, maximum flow and minimal spanning tree problems as well as a selection of the following: non-linear programming, constrained optimization, deterministic and probabilistic dynamic programming, game theory and simulation.\nOffering(s): Offered in odd-numbered years.\nPrerequisite(s): (1 of MATH*1160, MATH*2150, MATH*2160), 0.50 credits in statistics\nCo-requisite(s): MATH*2200\nDepartment(s): Department of Mathematics and Statistics\nMATH*3260 Complex Analysis W (3-0) [0.50]\nThis course extends calculus to cover functions of a complex variable; it introduces complex variable techniques which are very useful for mathematics, the physical sciences and engineering. Topics include complex differentiation, planar mappings, analytic and harmonic functions, contour integration, Taylor and Laurent series, the residue calculus and its application to the computation of trigonometric and improper integrals, conformal mapping and the Dirichlet problem.\nPrerequisite(s): MATH*2200\nDepartment(s): Department of Mathematics and Statistics\nMATH*3510 Biomathematics W (3-0) [0.50]\nThis course will convey the fundamentals of applying mathematical modelling techniques to understanding and predicting the dynamics of biological systems. Students will learn the development, analysis, and interpretation of biomathematical models based on discrete-time and continuous-time models. Applications may include examples from population biology, ecology, infectious diseases, microbiology, and genetics.\nPrerequisite(s): (1 of MATH*1160, MATH*2150, MATH*2160), (MATH*2170 or MATH*2270)\nDepartment(s): Department of Mathematics and Statistics\nMATH*4050 Topics in Mathematics I W (3-0) [0.50]\nIn this course students will discuss selected topics at an advanced level. It is intended mainly for mathematics students in the 6th to 8th semester. Content will vary from year to year. Sample topics include: probability theory, Fourier analysis, mathematical logic, operator algebras, number theory combinatorics, philosophy of mathematics, fractal geometry, chaos, stochastic differential equations.\nOffering(s): Offered in odd-numbered years.\nPrerequisite(s): MATH*3200\nDepartment(s): Department of Mathematics and Statistics\nMATH*4060 Topics in Mathematics II W (3-0) [0.50]\nIn this course students will discuss selected topics at an advanced level as in MATH*4050, but with different choice of topic.\nOffering(s): Offered in even-numbered years.\nPrerequisite(s): MATH*3200\nDepartment(s): Department of Mathematics and Statistics\nMATH*4150 Topics in Mathematics III F,W (3-0) [0.50]\nIn this course students will discuss selected topics at an advanced level as in MATH*4050, but with different choice of topics.\nPrerequisite(s): MATH*3200\nDepartment(s): Department of Mathematics and Statistics\nMATH*4200 Advanced Analysis F (3-0) [0.50]\nThis senior course in analysis will cover basic operator theory on Hilbert spaces, including self-adjoint operators and the spectral theorem. Other topics may include weak solutions, Sobolev spaces, inverse problems, measure theoretic probability or advanced topics from linear or nonlinear functional analysis.\nPrerequisite(s): MATH*3200\nDepartment(s): Department of Mathematics and Statistics\nMATH*4240 Advanced Topics in Modeling and Optimization W (3-0) [0.50]\nThis course is a study of advanced topics in the areas of optimization and modeling. Topics may include continuous and discrete models together with techniques for their analysis and design, and optimization topics such as game theory, networks, nonlinear problems, Markov chains, queuing theory, agent-based models, computational intelligence based techniques and computational optimization techniques.\nPrerequisite(s): 0.50 credits in Mathematics at the 3000 level.\nDepartment(s): Department of Mathematics and Statistics\nMATH*4270 Partial Differential Equations F (3-0) [0.50]\nThis course focuses on first and second-order partial differential equations, with examples and applications from selected fields such as physics, engineering and biology. Topics may include the wave equation, the heat equation, Laplace's equation, linearity and separation of variables, solution by Fourier series, Bessel, Legendre and Green's functions, an introduction to the method of characteristics and Fourier transforms. The classification of linear second-order partial differential equations is discussed.\nPrerequisite(s): MATH*3100\nDepartment(s): Department of Mathematics and Statistics\nMATH*4440 Case Studies in Mathematics and Statistics W (3-0) [0.50]\nThis capstone course for the Mathematical Science major provides students with an opportunity to synthesize knowledge and utilize problem-solving skills accumulated over the course of their studies. The course will focus on case studies drawn from engineering, computer science, biology, life and physical sciences, medicine, and/or economics.\nPrerequisite(s): At least 3.0 mathematics and/or statistics credits at the 3000 level or above.\nRestriction(s): Restricted to students in the Mathematical Science major.\nDepartment(s): Department of Mathematics and Statistics\nMATH*4600 Advanced Research Project in Mathematics F,W (0-6) [1.00]\nEach student in this course will undertake an individual research project in some area of mathematics, under the supervision of a faculty member. A written report and a public presentation of the project will be required.\nRestriction(s): Approval of a supervisor and the course coordinator.\nDepartment(s): Department of Mathematics and Statistics\nUniversity of Guelph" ]
[ null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.8477388,"math_prob":0.91268426,"size":15281,"snap":"2020-45-2020-50","text_gpt3_token_len":3433,"char_repetition_ratio":0.17863455,"word_repetition_ratio":0.105525136,"special_character_ratio":0.22419998,"punctuation_ratio":0.14794521,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9969004,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2020-10-25T08:30:34Z\",\"WARC-Record-ID\":\"<urn:uuid:9a1e0038-1dda-429a-bd1e-bc36adefd44d>\",\"Content-Length\":\"58922\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:8b2b91e1-3049-4fc5-91cb-2b8af55ac353>\",\"WARC-Concurrent-To\":\"<urn:uuid:2c6b1977-7116-4008-bed6-23b3c0565a9c>\",\"WARC-IP-Address\":\"131.104.93.93\",\"WARC-Target-URI\":\"https://www.uoguelph.ca/registrar/calendars/undergraduate/2018-2019/c12/c12math.shtml\",\"WARC-Payload-Digest\":\"sha1:SGQAOO3OGYJ7EXCCWDGIEFV22ZGPX7OC\",\"WARC-Block-Digest\":\"sha1:B54VATX42JYEKPYE3TRJ255B3UJXPVEV\",\"WARC-Identified-Payload-Type\":\"application/xhtml+xml\",\"warc_filename\":\"/cc_download/warc_2020/CC-MAIN-2020-45/CC-MAIN-2020-45_segments_1603107888402.81_warc_CC-MAIN-20201025070924-20201025100924-00199.warc.gz\"}"}
http://www.nwchem-sw.org/index.php/Special:AWCforum/st/id1987/Problem_with_numerical_frequency....html
[ "", null, "Problem with numerical frequency calculation\n\nViewed 1720 times, With a total of 2 Posts\n\n Olanky Member Profile Send PM\n Clicked A Few Times", null, "Threads 2 Posts 5\n 2:31:25 PM PST - Wed, Mar 2nd 2016 Hi NWChem users, I am trying to calculate the vibration frequency of a configuration where adatom moving near the optimized position on CNT surface. I first optimized the whole stucture (221 atoms), and then restart the job with: restart cnt_5_10-p1vib set gen_hess:actlist 221 # 221st atom is the adatom set hessian:compress .true. vib ```reuse temp 1 300 animate ``` end task dft freq numerical I have two questions: 1. Even thought I put those two set directives in the restart job (as suggested in http://www.nwchem-sw.org/index.php/Special:AWCforum/st/id518/printing_hessian_with_greater...), I am still getting all atom frequencies with a 663x663 matrix. Is there any trick here to freeze the atoms in CNT and actually have only adatom moving? 2. I also tried to restart again but this time I changed the temperature to 2000 K. However, the output frequencies of normal modes are exactly the same with those at 300 K. The only difference in the output file is in this block: ```Temperature = 300.00K frequency scaling parameter = 1.0000 ``` ```Zero-Point correction to Energy = 1852.825 kcal/mol ( 2.952665 au) Thermal correction to Energy = 1856.996 kcal/mol ( 2.959312 au) Thermal correction to Enthalpy = 1857.592 kcal/mol ( 2.960261 au) ``` ```Total Entropy = 58.653 cal/mol-K - Translational = 49.102 cal/mol-K (mol. weight =2322.2348) - Rotational = 0.000 cal/mol-K (symmetry # = 1) - Vibrational = 9.551 cal/mol-K ``` ```Cv (constant volume heat capacity) = 54.633 cal/mol-K - Translational = 2.979 cal/mol-K - Rotational = 1.986 cal/mol-K - Vibrational = 49.668 cal/mol-K ``` ```Temperature = 2000.00K frequency scaling parameter = 1.0000 ``` ```Zero-Point correction to Energy = 1852.825 kcal/mol ( 2.952665 au) Thermal correction to Energy = 3162.591 kcal/mol ( 5.039911 au) Thermal correction to Enthalpy = 3166.564 kcal/mol ( 5.046242 au) ``` ```Total Entropy = 1191.330 cal/mol-K - Translational = 58.522 cal/mol-K (mol. weight =2322.2348) - Rotational = 0.000 cal/mol-K (symmetry # = 1) - Vibrational = 1132.808 cal/mol-K ``` ```Cv (constant volume heat capacity) = 1095.424 cal/mol-K - Translational = 2.979 cal/mol-K - Rotational = 1.986 cal/mol-K - Vibrational = 1090.458 cal/mol-K ``` Why are those frequencies the same at different temperature? Is there anything wrong in my procedure? Thank you so much! Longtao Edited On 2:32:01 PM PST - Wed, Mar 2nd 2016 by Olanky\n\n Sean bureaucrat Profile Send PM\n Forum Regular", null, "Threads 1 Posts 176\n 5:40:47 PM PST - Wed, Mar 2nd 2016 Please, try the following input: ```restart cnt_5_10-p1vib ``` ```set gen_hess:actlist 221 # 221st atom is the adatom set hessian:compress .true. task dft hessian numerical ``` ```geometry adatom adatom_x adatom_y adatom_z end ``` ```vib reuse temp 1 300 animate end ``` ```task dft freq ``` You need to first calculate the Hessian only for the active atom(s). Then if you want to do the frequency analysis for just that, you need to define a new geometry that contains just the active atom(s), otherwise you will get an end-of-file error. In regards to your second question, the frequencies are calculated in a harmonic approximation and there is no temperature dependence so the only change in output when the temperature is changed should be the thermochemistry analysis.\n\n Olanky Member Profile Send PM\n Clicked A Few Times", null, "Threads 2 Posts 5\n 2:56:19 PM PDT - Wed, Mar 16th 2016 Thank you for your reply, Sean. I just got chance to try today. I found if I define a new geometry with just active atom, the normal mode frequencies will all be zero. From the xyz file it's clear that the only atom in the geometry is not moving at all. The script in my first post can do the job, but it will generate thousands of xyz files. That's why it made me think if I did something wrong. I understand now to the second question, thank you! Edited On 2:57:05 PM PDT - Wed, Mar 16th 2016 by Olanky\n\n Who's here now Members 0 Guests 1 Bots/Crawler 0\n\nAWC's: 2.5.10 MediaWiki - Stand Alone Forum Extension\nForum theme style by: AWC", null, "" ]
[ null, "http://www.nwchem-sw.org/skins/gumax/blank.gif", null, "http://www.nwchem-sw.org/extensions/awc/forums/images/avatars/avatar_default.gif", null, "http://www.nwchem-sw.org/extensions/awc/forums/images/avatars/avatar_default.gif", null, "http://www.nwchem-sw.org/extensions/awc/forums/images/avatars/avatar_default.gif", null, "http://www.nwchem-sw.org/skins/gumax/blank.gif", null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.8333849,"math_prob":0.7971458,"size":1598,"snap":"2019-26-2019-30","text_gpt3_token_len":439,"char_repetition_ratio":0.08782936,"word_repetition_ratio":0.06734007,"special_character_ratio":0.2753442,"punctuation_ratio":0.11246201,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9745041,"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\":\"2019-06-24T18:52:50Z\",\"WARC-Record-ID\":\"<urn:uuid:b334c5cc-aac5-4e0a-889a-7c27e124b80f>\",\"Content-Length\":\"47330\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:76fee81d-083e-43a1-9af0-d874a4237155>\",\"WARC-Concurrent-To\":\"<urn:uuid:b39a1295-2a4a-4877-b992-8e4f1eae0f85>\",\"WARC-IP-Address\":\"192.101.105.206\",\"WARC-Target-URI\":\"http://www.nwchem-sw.org/index.php/Special:AWCforum/st/id1987/Problem_with_numerical_frequency....html\",\"WARC-Payload-Digest\":\"sha1:BUWHDUFCNFCBDZ7T52F4KSV36VGI4P2N\",\"WARC-Block-Digest\":\"sha1:ABIDECHK7LZZWHYCBTUR2PLVNTPK3ARH\",\"WARC-Identified-Payload-Type\":\"application/xhtml+xml\",\"warc_filename\":\"/cc_download/warc_2019/CC-MAIN-2019-26/CC-MAIN-2019-26_segments_1560627999620.99_warc_CC-MAIN-20190624171058-20190624193058-00103.warc.gz\"}"}
https://www.pakainfo.com/get-table-name-from-model-using-laravel-5-7-example/
[ "# Get Table name From Model using Laravel 5.7 Example\n\nToday, We want to share with you Get Table name From Model using Laravel 5.7 Example.In this post we will show you get table name from model laravel 5.7, hear for laravel get table name from model, laravel eloquent table name we will give you demo and example for implement.In this post, we will learn about How to get table name and table column names from model in Laravel 5? with an example.\n\n## Get Table name From Model using Laravel 5.7 Example\n\nThere are the Following The simple About Get Table name From Model using Laravel 5.7 Example Full Information With Example and source code.\n\nRead Also:  Get Current Url Parameter using Laravel\n\nAs I will cover this Post with live Working example to develop Get table column names as array from Eloquent model, so the get all column of a table using laravel eloquent for this example is following below.\n\n### How to return database table name in Laravel\n\n```\\$obj_item = new Item;\n\\$my_table_name = \\$obj_item->getTable();\n\nprint_r(\\$my_table_name);\n```\n\n### Get Table Name From Model in Laravel\n\n```\\$member = new Member;\n\\$table = \\$member->getTable();\nprint_r(\\$table);\n```\n\n### Get Table Column Name From Model in Laravel\n\ndefine a method in model class\n\n```<?php\nnamespace App;\nuse Illuminate\\Database\\Eloquent\\Model;\nclass Member extends Model\n{\npublic function getTableColumns() {\nreturn \\$this->getConnection()->getSchemaBuilder()->getColumnListing(\\$this->getTable());\n}\n}\n```\n\nget all columns of “members” table\n\n``` \\$member=new Member;\n\\$columns=\\$member->getTableColumns();\nprint_r(\\$columns);\n```" ]
[ null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.7246123,"math_prob":0.65873736,"size":1837,"snap":"2021-43-2021-49","text_gpt3_token_len":412,"char_repetition_ratio":0.15657392,"word_repetition_ratio":0.07168459,"special_character_ratio":0.22482309,"punctuation_ratio":0.12536444,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9750062,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2021-10-26T11:39:53Z\",\"WARC-Record-ID\":\"<urn:uuid:d0574731-3c74-4985-b283-28812a0e7d14>\",\"Content-Length\":\"91921\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:2c5a2869-104e-4964-a334-9479d27f11a5>\",\"WARC-Concurrent-To\":\"<urn:uuid:9aa7e875-6a92-4b70-8deb-339d2cf05972>\",\"WARC-IP-Address\":\"172.67.130.14\",\"WARC-Target-URI\":\"https://www.pakainfo.com/get-table-name-from-model-using-laravel-5-7-example/\",\"WARC-Payload-Digest\":\"sha1:P7S3T7RKIO425MKDLKNFR7QP3KDNOFPQ\",\"WARC-Block-Digest\":\"sha1:QRMMSRCGHZSZXYGVSIJPQEBMEZ7BIH45\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2021/CC-MAIN-2021-43/CC-MAIN-2021-43_segments_1634323587877.85_warc_CC-MAIN-20211026103840-20211026133840-00331.warc.gz\"}"}
https://tug.org/pipermail/metapost/2005-March/000329.html
[ "# [metapost] The strangest issues?\n\nDaniel H. Luecking luecking at uark.edu\nFri Mar 18 23:53:00 CET 2005\n\nOn Fri, 18 Mar 2005, Giuseppe Bilotta wrote:\n\n> Thursday, March 17, 2005 Daniel H. Luecking wrote:\n>\n> > (\\gamma(t) -\\omega(\\tau)).\\gamma'(t) = 0\n> > (\\gamma(t) -\\omega(\\tau)).\\omega'(\\tau) = 0\n>\n> > will be a minimum (or a saddle point). And minimums happen when the\n\nActually, I fogrgot to include local maxima.\n\n> > curves cross. Minimizing over the lambdas will now likely give you the\n> > crossing points. Of course, if \\gamma is a straight line, the\n> > alternative is that \\omega is a parallel line and (P1-P0) x (P3-P2) = 0.\n>\n> Well, t and \\tau are restricted to the [0,1] range and since\n> I'm for local, not global, extremal points I really don't\n> care if they are minima or maxima until I get down to\n> analyzing them. Which I cannot do if I cannot find them, of\n> course :)\n>\n> Plus, the curves \\omega and \\gamma are not entirely\n> arbitrary. While I'm trying not to put any constraints on\n> \\gamma, the endpoints of \\omega and its initial and final\n> tangents are in very well fixed relations to \\gamma.\n> Constraints on the lambdas can be also easily created so\n> that the two curves don't cross in the [0,1]^2 box, unless\n> the original curve is knotted itself or the radius is higher\n> than a critical value.\n>\n> Does this mean I only have to look at the values for which\n> t and \\tau are not differentiable?\n\nSince the two equations to be solved for t and \\tau are both cubic\nin one variable and quintic in the other, if they could be solved\nfor t and \\tau in terms of the lambdas they would be multiple-valued.\nThere would therefore be the possibility (even likelyhood) of \"branch\npoints\" where these different values come together and differential\nanalysis is impossible.\n\nAnd here we have rapidly converged to the limits of my knowledge of\nthese things.\n\n--\nDan Luecking\nDept. of Mathematical Sciences\nUniversity of Arkansas\nFayetteville, AR 72101" ]
[ null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.9083364,"math_prob":0.79565066,"size":2014,"snap":"2019-35-2019-39","text_gpt3_token_len":562,"char_repetition_ratio":0.0920398,"word_repetition_ratio":0.010989011,"special_character_ratio":0.27507448,"punctuation_ratio":0.11025641,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9755914,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2019-09-15T14:33:47Z\",\"WARC-Record-ID\":\"<urn:uuid:b2dba9a3-5254-430f-9fce-a7e71fc2b4d5>\",\"Content-Length\":\"4570\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:c3cfaf71-6470-4244-9778-175206107db6>\",\"WARC-Concurrent-To\":\"<urn:uuid:54767d4d-5ca3-4924-83c2-6e6336bf0266>\",\"WARC-IP-Address\":\"91.121.174.77\",\"WARC-Target-URI\":\"https://tug.org/pipermail/metapost/2005-March/000329.html\",\"WARC-Payload-Digest\":\"sha1:VIS7FRTLVLIRQIYSIO2BUPLHDKCULOFG\",\"WARC-Block-Digest\":\"sha1:FDDTXVXWCZRAHTGLVWAIWFJ3GL472F7P\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2019/CC-MAIN-2019-39/CC-MAIN-2019-39_segments_1568514571506.61_warc_CC-MAIN-20190915134729-20190915160729-00380.warc.gz\"}"}
http://global-123.com/product_s1006
[ "• 湖南\n• 长沙市\n• 常德市\n• 郴州市\n• 衡阳市\n• 怀化市\n• 娄底市\n• 邵阳市\n• 湘潭市\n• 湘西土家族苗族自治州\n• 益阳市\n• 永州市\n• 岳阳市\n• 张家界市\n• 株洲市\n• 山西\n• 长治市\n• 大同市\n• 晋城市\n• 晋中市\n• 临汾市\n• 吕梁市\n• 朔州市\n• 太原市\n• 忻州市\n• 阳泉市\n• 运城市\n• 安徽\n• 安庆市\n• 蚌埠市\n• 亳州市\n• 巢湖市\n• 池州市\n• 滁州市\n• 阜阳市\n• 合肥市\n• 淮北市\n• 淮南市\n• 黄山市\n• 六安市\n• 马鞍山市\n• 宿州市\n• 铜陵市\n• 芜湖市\n• 宣城市\n• 广西\n• 百色市\n• 北海市\n• 崇左市\n• 防城港市\n• 贵港市\n• 桂林市\n• 河池市\n• 贺州市\n• 来宾市\n• 柳州市\n• 南宁市\n• 钦州市\n• 梧州市\n• 玉林市\n• 河南\n• 安阳市\n• 鹤壁市\n• 焦作市\n• 开封市\n• 洛阳市\n• 漯河市\n• 南阳市\n• 平顶山市\n• 濮阳市\n• 三门峡市\n• 商丘市\n• 新乡市\n• 信阳市\n• 许昌市\n• 郑州市\n• 周口市\n• 驻马店市\n• 吉林\n• 白城市\n• 白山市\n• 长春市\n• 吉林市\n• 辽源市\n• 四平市\n• 松原市\n• 通化市\n• 延边朝鲜族自治州\n• 广东\n• 潮州市\n• 东莞市\n• 佛山市\n• 广州市\n• 河源市\n• 惠州市\n• 江门市\n• 揭阳市\n• 茂名市\n• 梅州市\n• 清远市\n• 汕头市\n• 汕尾市\n• 韶关市\n• 深圳市\n• 阳江市\n• 云浮市\n• 湛江市\n• 肇庆市\n• 中山市\n• 珠海市\n• 辽宁\n• 鞍山市\n• 本溪市\n• 朝阳市\n• 大连市\n• 丹东市\n• 抚顺市\n• 阜新市\n• 葫芦岛市\n• 锦州市\n• 辽阳市\n• 盘锦市\n• 沈阳市\n• 铁岭市\n• 营口市\n• 湖北\n• 鄂州市\n• 恩施土家族苗族自治州\n• 黄冈市\n• 黄石市\n• 荆门市\n• 荆州市\n• 直辖行政单位\n• 十堰市\n• 随州市\n• 武汉市\n• 咸宁市\n• 襄阳市\n• 孝感市\n• 宜昌市\n• 江西\n• 抚州市\n• 赣州市\n• 吉安市\n• 景德镇市\n• 九江市\n• 南昌市\n• 萍乡市\n• 上饶市\n• 新余市\n• 宜春市\n• 鹰潭市\n• 浙江\n• 杭州市\n• 湖州市\n• 嘉兴市\n• 金华市\n• 丽水市\n• 宁波市\n• 衢州市\n• 绍兴市\n• 台州市\n• 温州市\n• 舟山市\n• 青海\n• 果洛藏族自治州\n• 海北藏族自治州\n• 海东地区\n• 海南藏族自治州\n• 海西蒙古族藏族自治州\n• 黄南藏族自治州\n• 西宁市\n• 玉树藏族自治州\n• 甘肃\n• 白银市\n• 定西市\n• 甘南藏族自治州\n• 嘉峪关市\n• 金昌市\n• 酒泉市\n• 兰州市\n• 临夏回族自治州\n• 陇南市\n• 平凉市\n• 庆阳市\n• 天水市\n• 武威市\n• 张掖市\n• 贵州\n• 安顺市\n• 毕节市\n• 贵阳市\n• 六盘水市\n• 黔东南苗族侗族自治州\n• 黔南布依族苗族自治州\n• 黔西南布依族苗族自治州\n• 铜仁地区\n• 遵义市\n• 陕西\n• 安康市\n• 宝鸡市\n• 汉中市\n• 商洛市\n• 铜川市\n• 渭南市\n• 西安市\n• 咸阳市\n• 延安市\n• 榆林市\n• 西藏\n• 阿里地区\n• 昌都地区\n• 拉萨市\n• 林芝地区\n• 那曲地区\n• 日喀则地区\n• 山南地区\n• 宁夏\n• 固原市\n• 石嘴山市\n• 吴忠市\n• 银川市\n• 中卫市\n• 福建\n• 福州市\n• 龙岩市\n• 南平市\n• 宁德市\n• 莆田市\n• 泉州市\n• 三明市\n• 厦门市\n• 漳州市\n• 内蒙古\n• 阿拉善盟\n• 巴彦淖尔市\n• 包头市\n• 赤峰市\n• 鄂尔多斯市\n• 呼和浩特市\n• 呼伦贝尔市\n• 通辽市\n• 乌海市\n• 乌兰察布市\n• 锡林郭勒盟\n• 兴安盟\n• 云南\n• 保山市\n• 楚雄彝族自治州\n• 大理白族自治州\n• 德宏傣族景颇族自治州\n• 迪庆藏族自治州\n• 红河哈尼族彝族自治州\n• 昆明市\n• 丽江市\n• 临沧市\n• 怒江傈僳族自治州\n• 曲靖市\n• 思茅市\n• 文山壮族苗族自治州\n• 西双版纳傣族自治州\n• 玉溪市\n• 昭通市\n• 新疆\n• 阿克苏地区\n• 阿勒泰地区\n• 巴音郭楞蒙古自治州\n• 博尔塔拉蒙古自治州\n• 昌吉回族自治州\n• 哈密地区\n• 和田地区\n• 喀什地区\n• 克拉玛依市\n• 克孜勒苏柯尔克孜自治州\n• 直辖行政单位\n• 塔城地区\n• 吐鲁番地区\n• 乌鲁木齐市\n• 伊犁哈萨克自治州\n• 黑龙江\n• 大庆市\n• 大兴安岭地区\n• 哈尔滨市\n• 鹤岗市\n• 黑河市\n• 鸡西市\n• 佳木斯市\n• 牡丹江市\n• 七台河市\n• 齐齐哈尔市\n• 双鸭山市\n• 绥化市\n• 伊春市\n• 香港\n• 香港\n• 九龙\n• 新界\n• 澳门\n• 澳门\n• 其它地区\n• 台湾\n• 台中市\n• 台南市\n• 高雄市\n• 台北市\n• 基隆市\n• 嘉义市\n•", null, "10吨吊车价格|开封品质好的10吨吊车推荐\n\n品牌:远东重工,,\n\n出厂地:昭平县(昭平镇)\n\n报价:面议\n\n河南远东重工机械制造有限公司\n\n黄金会员:", null, "主营:吊车,随车吊,起重机,随车起重机,流动式汽车起重机\n\n•", null, "蒙古包厂家_内蒙古高质量的蒙古包生产制作工艺\n\n品牌:诺瑜玛,,\n\n出厂地:融安县(长安镇)\n\n报价:面议\n\n内蒙古诺瑜玛民族用品有限公司\n\n黄金会员:", null, "主营:蒙古包,工艺品,木质工艺家具,蒙古桌,防寒门帘\n\n•", null, "哈尔滨有口碑的哈尔滨水处理|哈尔滨过滤设备\n\n品牌:金源,金源水处理,\n\n出厂地:鱼峰区\n\n报价:面议\n\n哈尔滨金源水处理有限公司\n\n黄金会员:", null, "主营:水处理设备,过滤设备,纯水设备,水处理材料,水处理安装\n\n•", null, "优良的治疗慢性胃炎推荐,开封中医治疗慢性胃炎怎么样\n\n品牌:济生堂,,\n\n出厂地:昭平县(昭平镇)\n\n报价:面议\n\n支国顺诊所\n\n黄金会员:", null, "主营:新乡肠胃科疾病,耳鼻喉疾病,肿瘤科疾病,治疗肠胃病|耳鼻喉疾病,看肠胃病哪家好\n\n•", null, "哪里能买到实惠的二手豪沃搅拌车|回收二手搅拌车\n\n品牌:方科,,\n\n出厂地:凤山县(凤城镇)\n\n报价:面议\n\n梁山方科贸易有限公司\n\n黄金会员:", null, "主营:二手豪沃牵引车,二手欧曼牵引车,二手解放牵引车,二手三一搅拌车,二手豪沃搅拌车\n\n•", null, "东北履带板生产供货商|抚顺专业的履带板批售\n\n品牌:鑫盛,,\n\n出厂地:金秀瑶族自治县(金秀镇)\n\n报价:面议\n\n抚顺市鑫盛挖掘机配件制造有限公司\n\n黄金会员:", null, "主营:履带板,抚顺履带板,徐工4000吨履带板,德马格3200吨履带板,东北履带板生产...\n\n•", null, "新余奶茶加盟店-厦门具有口碑的茶巢加盟\n\n品牌:茶巢,,\n\n出厂地:鹿寨县(鹿寨镇)\n\n报价:面议\n\n厦门哥弟餐饮管理有限公司\n\n黄金会员:", null, "主营:奶茶加盟,茶饮加盟,茶巢,茶巢加盟,奶茶品牌加盟\n\n•", null, "职业卫生评价费用-有口碑的职业卫生检测就在鑫龙安\n\n品牌:鑫龙安,,\n\n出厂地:鹿寨县(鹿寨镇)\n\n报价:面议\n\n福建省鑫龙安检测技术有限公司\n\n黄金会员:", null, "主营:消防工程,防雷检测,消防检测,公共卫生检测,放射卫生检测与评价\n\n•", null, "泉州水果店微信平台,可靠的有赞微商城优选泉州势必成\n\n品牌:势必成,微谷教育,\n\n出厂地:鹿寨县(鹿寨镇)\n\n报价:面议\n\n泉州势必成企业管理咨询有限公司\n\n黄金会员:", null, "主营:微商起盘,微商咨询顾问,微商代运营,微商教育,微商培训\n\n•", null, "怎样才能找到好的下水道疏通|温县抽淤泥\n\n品牌:忠来,,\n\n出厂地:昭平县(昭平镇)\n\n报价:面议\n\n济源市北海忠来管道疏通服务部\n\n黄金会员:", null, "主营:管道疏通,化粪池清理,济源化粪池清理,市政管道疏通,济源管道疏通\n\n• 没有找到合适的供应商?您可以发布采购信息\n\n没有找到满足要求的供应商?您可以搜索 商务服务批发 商务服务公司 商务服务厂\n\n### 热门产品\n\n相关产品:\n10吨吊车价格 蒙古包厂家 哈尔滨过滤设备 开封中医治疗慢性胃炎怎么样 回收二手搅拌车 东北履带板生产供货商 新余奶茶加盟店 职业卫生评价费用 泉州水果店微信平台 温县抽淤泥" ]
[ null, "http://image-ali.bianjiyi.com/1/2018/0820/10/1534733449326.jpg", null, "http://www.qiye.net/Public/Images/ForeApps/grade2.png", null, "http://image-ali.bianjiyi.com/1/2018/0823/18/15350198137098.jpg", null, "http://www.qiye.net/Public/Images/ForeApps/grade2.png", null, "http://image-ali.bianjiyi.com/1/2018/0906/18/15362283984206.jpg", null, "http://www.qiye.net/Public/Images/ForeApps/grade2.png", null, "http://image-ali.bianjiyi.com//swws/2018/0824/18/5b7fdcc5516cc.jpg", null, "http://www.qiye.net/Public/Images/ForeApps/grade2.png", null, "http://image-ali.bianjiyi.com/1/2018/0818/15/15345774637793.jpg", null, "http://www.qiye.net/Public/Images/ForeApps/grade2.png", null, "http://image-ali.bianjiyi.com/1/2016/1220/16/5858e616de2e3.JPG", null, "http://www.qiye.net/Public/Images/ForeApps/grade2.png", null, "http://image-ali.bianjiyi.com/1/2018/0907/16/15363097034873.jpg", null, "http://www.qiye.net/Public/Images/ForeApps/grade2.png", null, "http://image-ali.bianjiyi.com/1/2018/0818/09/15345571254456.jpg", null, "http://www.qiye.net/Public/Images/ForeApps/grade2.png", null, "http://image-ali.bianjiyi.com/1/2019/0325/16/15535037650681.jpg", null, "http://www.qiye.net/Public/Images/ForeApps/grade2.png", null, "http://image-ali.bianjiyi.com/1/2018/0823/10/15349905273663.jpg", null, "http://www.qiye.net/Public/Images/ForeApps/grade2.png", null ]
{"ft_lang_label":"__label__zh","ft_lang_prob":0.6078255,"math_prob":0.56662154,"size":901,"snap":"2019-35-2019-39","text_gpt3_token_len":1140,"char_repetition_ratio":0.20512821,"word_repetition_ratio":0.0,"special_character_ratio":0.24417314,"punctuation_ratio":0.33755276,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.96943825,"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],"im_url_duplicate_count":[null,5,null,null,null,1,null,null,null,1,null,null,null,2,null,null,null,1,null,null,null,2,null,null,null,1,null,null,null,1,null,null,null,1,null,null,null,2,null,null,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2019-08-22T19:15:00Z\",\"WARC-Record-ID\":\"<urn:uuid:0006ea39-299d-42da-9097-b85a002b3ff7>\",\"Content-Length\":\"99824\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:8d4dc6da-4d83-483b-9051-7c9f8f8fda5f>\",\"WARC-Concurrent-To\":\"<urn:uuid:3000b89f-833a-468f-afce-fc3c5ee4b1a8>\",\"WARC-IP-Address\":\"154.80.136.30\",\"WARC-Target-URI\":\"http://global-123.com/product_s1006\",\"WARC-Payload-Digest\":\"sha1:T2WKBZ4AA3WG7B6A2ATC5HFFQQIN554D\",\"WARC-Block-Digest\":\"sha1:6DDRJYSMCJCN44U7OJH3EO7T4EZQ3SW4\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2019/CC-MAIN-2019-35/CC-MAIN-2019-35_segments_1566027317339.12_warc_CC-MAIN-20190822172901-20190822194901-00389.warc.gz\"}"}
https://de.scribd.com/document/338645568/COE10703-Designing-Cathodic-Protection-Systems-pdf
[ "Sie sind auf Seite 1von 99\n\n# Engineering Encyclopedia\n\n## Designing Cathodic Protection Systems\n\nNote: The source of the technical material in this volume is the Professional Engineering\nDevelopment Program (PEDP) of Engineering Services.\nWarning: The material contained in this document was developed for Saudi Aramco and is\nintended for the exclusive use of Saudi Aramcos employees. Any material contained\nin this document which is not already in the public domain may not be copied,\nreproduced, sold, given, or disclosed to third parties, or otherwise used in whole, or in\npart, without the written permission of the Vice President, Engineering Services, Saudi\nAramco.\n\n## Chapter : Cathodic Protection For additional information on this subject, contact\n\nFile Reference: COE10703 D.R. Catte on 873-0153\nEngineering Encyclopedia Cathodic Protection\nDesigning Cathodic Protection Systems\n\nCONTENTS PAGES\n\n## DESIGNING CATHODIC PROTECTION SYSTEMS FOR BURIED PIPELINES 1\n\nGalvanic Anode System Design for Road and Camel Crossings 2\nSaudi Aramco Engineering Standards and Drawings 2\nNumber of Galvanic Anodes Required 3\nCircuit Resistance 4\nGalvanic Anode Current Output 7\nGalvanic Anode Life 7\nExample 8\nNumber of Anodes 8\nCircuit Resistance 8\nGalvanic Anode Current Output 8\nGalvanic Anode Life 9\nImpressed Current System Design for Buried Pipelines 9\nSaudi Aramco Engineering Standards and Drawings 9\nMinimum Number of Impressed Current Anodes 12\nAnode Bed Resistance 13\nAmount of Coke Breeze Required 15\nExample 15\nMinimum Number of Impressed Current Anodes 15\nAnode Bed Resistance 16\nAmount of Coke Breeze Required 18\nDESIGNING CATHODIC PROTECTION SYSTEMS FOR ONSHORE WELL CASINGS 19\nSaudi Aramco Engineering Standards and Drawings 20\nCathodic Protection Current Requirements 23\nSurface Anode Bed Design 25\nDeep Anode Bed Design 26\nLength of the Coke Breeze Column 26\nCircuit Resistance 27\nAmount of Coke Breeze Required 28\nExample 29\nLength of the Coke Breeze Column 29\nCircuit Resistance 31\nAmount of Coke Breeze Required 31\n\n## Saudi Aramco DeskTop Standards\n\nEngineering Encyclopedia Cathodic Protection\nDesigning Cathodic Protection Systems\n\n## DESIGNING CATHODIC PROTECTION SYSTEMS FOR VESSEL AND TANK INTERIORS 32\n\nSaudi Aramco Engineering Standards and Drawings 33\nGalvanic Anode System Design for Vessel and Tank Interiors 36\nCurrent Output Per Anode 36\nNumber of Galvanic Anodes Required 37\nGalvanic Anode Life 37\nExample 38\nCurrent Output Per Anode 38\nNumber of Galvanic Anodes Required 38\nGalvanic Anode Life 38\nImpressed Current System Design for Vessel and Tank Interiors 40\nNumber of Impressed Current Anodes Required 40\nCircuit Resistance 41\nExample 42\nNumber of Impressed Current Anodes 42\nCircuit Resistance 43\nDESIGNING CATHODIC PROTECTION SYSTEMS FOR IN-PLANT FACILITIES 44\nSaudi Aramco Engineering Standards and Drawings 45\nNumber and Placement of Anodes in Distributed Anode Beds 47\nCircuit Resistance 50\nExample 52\nNumber and Placement of Impressed Current Anodes 52\nDESIGNING CATHODIC PROTECTION SYSTEMS FOR MARINE STRUCTURES 54\nSaudi Aramco Engineering Standards and Drawings 56\nGalvanic Anode System Design for Marine Structures 59\nNumber of Galvanic Anodes Required 59\nCircuit Resistance 60\nGalvanic Anode Life 60\nNumber and Spacing of Galvanic Anode Bracelets 61\nExample 62\nNumber of Anodes 62\nGalvanic Anode Life 63\nNumber and Spacing of Galvanic Anode Bracelets 63\nImpressed Current System Design for Marine Structures 64\nCorrected Current Requirement 64\nNumber of Impressed Current Anodes Required 64\nRectifier Voltage Requirement 65\n\n## Saudi Aramco DeskTop Standards\n\nEngineering Encyclopedia Cathodic Protection\nDesigning Cathodic Protection Systems\n\nExample 66\nCorrected Current Requirement 66\nNumber of Anodes Required 66\nRectifier Voltage Requirement 67\nWORK AID 1: DATA BASE, FORMULAS, AND PROCEDURES TO DESIGN CATHODIC PROTECTION\nSYSTEMS FOR BURIED PIPELINES 68\nWork Aid 1A: Data Base, Formulas, and Procedure to Design Galvanic Anode Systems for Road and Camel\nCrossings 68\nWork Aid 1B: Formulas and Procedure to Design Impressed Current Systems for Buried Pipelines 71\nWORK AID 2: FORMULAS AND PROCEDURE TO DESIGN CATHODIC PROTECTION SYSTEMS FOR\nONSHORE WELL CASINGS 75\nWORK AID 3: FORMULAS AND PROCEDURES TO DESIGN CATHODIC PROTECTION SYSTEMS\nFOR VESSEL & TANK INTERIORS 78\nWork Aid 3A: Formulas and Procedure for the Design of Galvanic Anode Systems for Vessel & Tank\nInteriors 78\nWork Aid 3B: Formulas and Procedure for the Design of Impressed Current Systems for Vessel & Tank\nInteriors 81\nFormulas 81\nWORK AID 4: FORMULAS AND PROCEDURE TO DESIGN CATHODIC PROTECTION SYSTEMS FOR\nIN-PLANT FACILITIES 83\nWORK AID 5: FORMULAS AND PROCEDURES TO DESIGN CATHODIC PROTECTION SYSTEMS\nFOR MARINE STRUCTURES 85\nWork Aid 5A: Data Base, Formulas, and Procedure for the Design of Galvanic Anode Systems for Marine\nStructures 85\nWork Aid 5B: Formulas and Procedure for the Design of Impressed Current Systems for Marine Structures\n89\nGLOSSARY 92\nAPPENDIX 1 94\nSaudi Aramco Engineering Standards 94\nSaudi Aramco Standard Drawings 94\nSaudi Aramco Material System Specifications 95\n\n## Saudi Aramco DeskTop Standards\n\nEngineering Encyclopedia Cathodic Protection\nDesigning Cathodic Protection Systems\n\n## Designing Cathodic Protection Systems for Buried Pipelines\n\nThis section is divided into two parts. The first part covers galvanic anode system designs for short pipeline\nsegments such as road and camel crossings. Galvanic anodes are used if the cathodic protection current\nrequirement is small and the soil resistivity is low. The second part will cover impressed current systems for\nburied pipelines which require much more cathodic protection current. Normally, Saudi Aramco protects\nonshore pipelines with impressed current systems.\n\nDesigns for galvanic anode and impressed current systems designs are prepared after the following has been\naccomplished:\n\n## the cathodic protection current requirements have been calculated\n\nthe effective resistivity of the soil has been determined\nthe anode bed location has been selected\nthe allowable anode bed resistance has been calculated\n\nIn Module 107.01, you calculated the current requirements for various structures. In Module 107.02, you\nselected an anode bed site based on soil resistivity, current distribution, and available utilities. You also\nrepresented proposed CP systems as equivalent electrical circuits and calculated their allowable anode bed\nresistance. In this section, you will be given the above information and other criteria that will allow you to\ndesign cathodic protection systems for buried pipelines.\n\n## Saudi Aramco DeskTop Standards 1\n\nEngineering Encyclopedia Cathodic Protection\nDesigning Cathodic Protection Systems\n\n## Galvanic Anode System Design for Road and Camel Crossings\n\nDesign standards and practices for galvanic anode systems for road and camel crossings are presented below.\nThe design of galvanic anode systems for pipelines involves determining the following:\n\n## design requirements using Saudi Aramco standards and drawings\n\nthe number of galvanic anodes required\ncircuit resistance\ngalvanic anode current output\ngalvanic anode life\n\nAfter describing these requirements and calculations, an example is provided which demonstrates the design of\na galvanic anode system for a section of pipeline.\n\n## Saudi Aramco Engineering Standards and Drawings\n\nSaudi Aramco Engineering Standard SAES-X-400 provides minimum design requirements that govern CP\nsystems for buried onshore pipelines. CP systems inside plant facilities are not included. SAES-X-400 requires\ngalvanic anodes at the following sites:\n\n## buried pipelines at paved road crossings\n\nburied pipelines at camel crossings\nshort segments of pipelines that are not part of an impressed current system\n\nSaudi Aramco uses either pre-packaged or bare magnesium anodes to protect short pipeline segments. Bare\nanodes are used only in Subkha areas. The design calculations in this module are based on construction\nstandards in Standard Drawing AA-036352 - Galvanic Anodes for Road & Camel P/L Crossings, P/L Repair\nLocations. Figures 1A, 1B, and 1C show typical galvanic anode installations from Standard Drawing AA-\n036352.\n\nBonding station\nmarker plate\n\nmin.\nThermite weld\n600 mm min.\n\n1500 mm min.\nMagnesium anodes Cross section\nTypical Galvanic Anode Installation for a Road Crossing\nFigure 1A\n\n## Saudi Aramco DeskTop Standards 2\n\nEngineering Encyclopedia Cathodic Protection\nDesigning Cathodic Protection Systems\n\nBonding station\n3600 mm marker plate\nmin.\n\nThermite weld\n\nMagnesium anodes\nCross section\n\nFigure 1B\n\nJunction box\n\nThermite weld\n\nburied\nvalve\n\nmagnesium anodes\n\nFigure 1C\n\n## the size (weight) of the anodes\n\nthe length of the pipe\nthe diameter of the pipe\n\nAt least two anodes are required for any installation. Work Aid1A provides a table from Standard Drawing\nAA-036352 and a procedure for determining the number of magnesium anodes required.\n\n## Saudi Aramco DeskTop Standards 3\n\nEngineering Encyclopedia Cathodic Protection\nDesigning Cathodic Protection Systems\n\nCircuit Resistance\n\nThe circuit resistance of the galvanic anode system, RC, is represented by the electrical circuit in Figure 2.\n\nBonding\nstation I\n\nI1 I2\n\nED\nRA1 RA2\n\nGalvanic Anodes I\nRS\n\n## Galvanic Anodes at a Road Crossing and an Equivalent Electrical Circuit\n\nFigure 2\n\nThe structure-to-electrolyte resistance is represented by RS in the electrical circuit. The anode resistances are\nRA1 and RA2. Because the anodes are connected in parallel, their equivalent resistance is obtained from the\nfollowing formula:\n\n1 1 1 1\n= + + +\nR eq R A 1 R A 2 R AN\n\nIf the anodes resistances are equal, the equivalent resistance is given by the following formula.\n\n1 RA\n= 1 + 1 + + 1 = N R eq =\nR eq R A R A R AN RA N\n\nRA = RLW + RV,\n\nwhere -\n\n## RLW = the average anode lead wire resistance in ohms\n\nRV = the anode-to-electrolyte resistance of one vertical anode in ohms\n\n## Saudi Aramco DeskTop Standards 4\n\nEngineering Encyclopedia Cathodic Protection\nDesigning Cathodic Protection Systems\n\n## Therefore, the circuit resistance is determined by the following equation:\n\nRA R + RV\nRc = R s + = R s LW\nN N\n\nFor an anode buried in chemical backfill as shown in Figure 3, the total resistance between the anode and\nelectrolyte includes (1) the resistance from the anode to the outer edge of the backfill package and (2) the\nresistance between the backfill package and the soil. The resistance from the anode to the outer edge of the\nbackfill is called the anode internal resistance. The resistance between the backfill and the soil is commonly\ncalled the anode-to-earth resistance.\n\nBag\n\n## Soil Chemical Anode\n\nbackfill\n\nAnode- Anode\nto-earth internal\nresistance resistance\n\nFigure 3\n\n## Saudi Aramco DeskTop Standards 5\n\nEngineering Encyclopedia Cathodic Protection\nDesigning Cathodic Protection Systems\n\nBecause the contribution of the anode internal resistance is very small, Saudi Aramco only considers the anode-\nto-earth resistance. The anode-to-earth resistance of a single vertical anode is calculated using the Dwight\nEquation as follows:\n\n0.159\n1\n8L\nRV = ln\nL d\n\nwhere -\n\n## RV = resistance of one vertical anode to earth in ohms\n\nr = resistivity of backfill material (or soil) in ohm-cm\nL = length of anode (or backfill column) in centimeters\nd = diameter of anode (or backfill column) in centimeters\n\nPrepackaged magnesium anodes are used in most soil installations. Therefore, L and d above will be the\nnominal length and diameter of the anode backfill package.\n\nYou can calculate the anode bed resistance of two or more vertical anodes in parallel by using the Sunde\nEquation as follows:\n\n0.159\n1 +\n8L 2L\nR=\nNL\nln\nd S (\nln 0.656 N\n\n)\nwhere -\n\nR = resistance, in ohms, of N vertical anodes in parallel and spaced S centimeters apart along a\nstraight line.\nr = soil resistivity in ohm-cm\nN = number of anodes\nL = length of anode (or backfill column) in centimeters\nd = diameter of anode (or backfill column) in centimeters\nS = anode spacing in centimeters\n\nAnodes are usually cast in the shape of a trapezoid rather than a cylinder. If an anode is installed in Subkha\nwithout a backfill package, its effective diameter must be calculated. For example, a trapezoidal anode with\nnominal 7.5 cm sides has a circumference of 4 x 7.5 cm = 30 cm. The effective diameter is 30 cm/, or 9.5\ncm.\n\n## Saudi Aramco DeskTop Standards 6\n\nEngineering Encyclopedia Cathodic Protection\nDesigning Cathodic Protection Systems\n\n## Galvanic Anode Current Output\n\nSAES-X-400 and SADP-X-100 require a calculation of the anode current output. The current output of a\ngalvanic anode system is a function of its driving potential and circuit resistance, as shown in the following\nformula:\n\nIA = ED/RC\nwhere -\n\n## IA = anode current output\n\nED = the anode driving potential\nRC = the circuit resistance\n\nThe driving potential, ED, is the difference between the anodes solution potential and the protected potential of\nthe pipeline.\n\n## Galvanic Anode Life\n\nThe life of a galvanic anode can be estimated if its weight and current output are known. The expected life of a\ngalvanic anode is given by the following equation from SADP-X-100, section 4.2, Eqn. 23.\n\nW UF\nY=\nC IA\n\nwhere -\n\n## Y = anode life in years\n\nC = actual consumption rate in kg/A-yr\nW = anode mass in kg\nIA = anode current output in amperes\nUF = utilization factor\n\nThe actual consumption rate, C, of standard and high potential magnesium anodes is 7.1 kg per ampere-year.\nAn anode needs to be replaced when there is not enough of it remaining to produce the required current. The\nutilization factor, UF, is the percentage of the anode that is consumed before it needs to be replaced. For\nmagnesium anodes, the utilization factor is 85%.\n\n## Saudi Aramco DeskTop Standards 7\n\nEngineering Encyclopedia Cathodic Protection\nDesigning Cathodic Protection Systems\n\nExample\n\nWe will use the following data to determine the number and current output of pre-packaged 27.3 kg (60 lb.)\nmagnesium anodes required to protect a 15-meter section of 12\" pipe. Use the following engineering data:\n\n## Driving potential: 0.50 V versus Cu-CuSO4\n\nStructure-to-electrolyte resistance: 2.67 ohms\nBackfill package dimensions: 8\" dia. x 84\" (20.33 cm dia. x 213.36 cm)\nSoil resistivity: 1,000 ohm-cm\nNumber of Anodes\n\nAccording to the table in Work Aid 1A, two anodes are required for 15 meters of 12\" pipe.\nCircuit Resistance\n\nThe anode-to-earth resistance of one anode is given by the Sunde Equation as shown below:\n\n0.159\nln 8L 1 + ln 0.656 N )\n2L\nRV =\nNL d S\n(\n0.159( ohm cm) 8(213.36 cm) 2(213.36)\n=\n2(213.36 cm )\nln\n20.33 cm\n1 +\n1, 500\n(ln1.312 )\nR V = 1.307 ohm\n\n## RC = 2.67 + 0.025 + 1.307 = 4.00 ohms.\n\nGalvanic Anode Current Output\n\n## I = ED/RC = 0.50/4.00 = 0.13 A. (or 0.065 A for each anode)\n\nSaudi Aramco normally uses magnesium anodes in areas where soil resistivity is less than 5,000 ohm-cm. In\n5,000 ohm-cm soil, the anode-to-earth resistance in the example above would be 6.53 ohms (five times as much\nas in 1,000 ohm-cm soil). The circuit resistance would increase to 9.21 ohms and the current output would\ndecrease as follows:\n\n## Saudi Aramco DeskTop Standards 8\n\nEngineering Encyclopedia Cathodic Protection\nDesigning Cathodic Protection Systems\n\n## Galvanic Anode Life\n\nThe expected lifetime of one 27.3 kg anode with a current output of 0.065 A in 1,000 ohm-cm soil is shown\nbelow:\n\n27.3 kg 0.85\nY=\n7.1 kg / amp yr 0.065 amp\nY = 50 years\n\nThe anode requirements, formulas, and procedure needed to design galvanic anode systems for short sections of\nburied pipelines are provided in Work Aid 1A.\n\n## Impressed Current System Design for Buried Pipelines\n\nDesign standards and practices for impressed current systems for buried pipelines are presented below. These\nstandards and practices include the following determinations:\n\n## design requirements using Saudi Aramco standards and drawings\n\nthe minimum number of impressed current anodes\nanode bed resistance (based on number of anodes and anode spacing)\nthe amount of coke breeze required\n\nAfter a discussion of the above information, an example is provided that includes a more efficient method,\nusing an anode design chart for designing impressed current anode beds.\n\n## Saudi Aramco Engineering Standard SAES-X-400 states the following:\n\nTotal circuit resistance for a rectifier CP system shall not exceed 1.0 ohm.\nTotal circuit resistance for a solar CP system shall not exceed 0.5 ohm.\nImpressed current systems shall provide a minimum negative pipe-to-soil potential of 1.2 volts\nand a maximum of 3.0 volts versus a Cu-CuSO4 half-cell.\nImpressed current anode beds shall be sized to discharge 120% of the rated current output of\nthe dc power source.\nImpressed current systems shall have a design life of 20 years.\n\nSaudi Aramco Design Practice SADP-X-100 states that surface anode beds less than 15 meters deep should\nalways be used unless they are uneconomical. Surface anode beds with watering facilities are usually more\neconomical than deep anode beds. Deep anode beds are much more expensive to install than surface anode\nbeds.\n\n## Saudi Aramco DeskTop Standards 9\n\nEngineering Encyclopedia Cathodic Protection\nDesigning Cathodic Protection Systems\n\nAnode bed design calculations are based on construction standards set by Saudi Aramco in Standard Drawing\nAA-036346, Surface Anode Bed Details. AA-036346 contains diagrams of vertical and horizontal anode\ninstallations as shown in Figure 4.\n\n## Dual vertical anodes Vertical anode\n\nin coke breeze in Subkha\n\nGravel\n600 mm\n900 mm\n\nWatering\n50 mm hole pipe\n\n4000 mm\nAnode Anode\n2100 mm\n\nCoke\nbreeze\nNative clean\nbackfill\n8000 mm\n\n150 mm\n1000 mm\nmin. dia.\n250\nmm\n\nNo. 6 AWG\n\n2100 mm\n\nFigure 4\n\n## Saudi Aramco DeskTop Standards 10\n\nEngineering Encyclopedia Cathodic Protection\nDesigning Cathodic Protection Systems\n\nImpressed current anode beds should be remote from the protected structure to provide uniform current\ndistribution. Figure 5 gives the minimum distances allowed between anode beds and buried structures. These\ncriteria cover both surface and deep anode beds.\n\n## Minimum Distance from\n\nAnode Bed Capacity Underground Structures\n35 amperes 35 meters\n50 amperes 75 meters\n100 amperes 150 meters\n150 amperes 225 meters\n\n## Minimum Anode Bed Distance from Underground Structures in SAES-X-400\n\nFigure 5\n\nSAES-X-400 states that remote surface anode beds shall be used where soil resistivity is compatible with\nsystem design requirements and economic considerations. Figure 6 shows a typical anode bed of 10 vertical\nanodes from Standard Drawing AA-036346. Additional groups of 10 anodes can be installed as required to\nrectifiers, must be separated by at least 50 meters. If the output capacity of either anode bed is greater than 50\namperes, they must be separated by at least 100 meters.\n\n## Typical group of 10 anodes Additional group of 10 as required\n\nNo . 6 AWG\nJunction\nBox\n\nTo rectifier or\nd-c power source\n\n10 anodes as required\n\nFigure 6\n\n## Saudi Aramco DeskTop Standards 11\n\nEngineering Encyclopedia Cathodic Protection\nDesigning Cathodic Protection Systems\n\n## Minimum Number of Impressed Current Anodes\n\nThere are two ways to calculate the minimum number of impressed current anodes required. One method\nconsiders the anodes maximum current output in the electrolyte and the other method considers the anodes\nconsumption rate. It is best to use the method that gives the more conservative value (the greatest number of\nanodes).\n\nTo calculate the minimum number of anodes based on the anodes maximum current density, the following\nformula is used:\n\nN = I ( dL A )\n\nwhere -\n\n## N = number of impressed current anodes\n\nI = total current required in milliamperes*\nd = anode diameter in centimeters\nL = anode length in centimeters\nA = anode maximum current density in mA/cm2 (Appendix I of SAES-X-400)\n\nTo calculate the minimum number of anodes based on the anodes consumption rate, the following formula is\nused:\n\nN = Y I C\nW\n\nwhere -\n\n## N = number of impressed current anodes\n\nY = the impressed current system design life in years\nI = total current required in amperes*\nC = anode consumption rate in kg/A-yr (Appendix I of SAES-X-400)\nW = weight of a single anode in kg\n\n* The total current required is usually multiplied by 120% to adequately size the anode bed.\n\n## Saudi Aramco DeskTop Standards 12\n\nEngineering Encyclopedia Cathodic Protection\nDesigning Cathodic Protection Systems\n\n## Anode Bed Resistance\n\nThe current output of an impressed current system is a function of the dc power source driving voltage and the\ncircuit resistance. The current output, I, is given by the following formula:\n\nI = ED/RC\nwhere -\nED = the rated voltage of the dc power source (minus 2 volts if the anodes are installed in coke\nbreeze)\nRC = the circuit resistance\n\nIn Module 107.02, we used the following formula to calculate circuit resistance, RC, of an impressed current\nsystem circuit.\n\nRC = RS + RLW + Rgb\n\nwhere -\nRS = structure-to-electrolyte resistance\nRLW = total lead wire resistance\nRgb = the anode bed resistance\n\nThe anode bed resistance, Rgb, is the total resistance of all the anodes in the anode bed. If the anodes are\nsurrounded by a coke breeze column as shown in Figure 7, the resistance between each anode and electrolyte\nincludes the anode internal resistance and the anode-to-earth resistance.\n\nGravel\n\nAnode-\nto-earth\nresistance\n\nAnode\ninternal Coke breeze\nresistance\n\nSoil Coke\nbreeze\n\nFigure 7\n\n## Saudi Aramco DeskTop Standards 13\n\nEngineering Encyclopedia Cathodic Protection\nDesigning Cathodic Protection Systems\n\nAs with galvanic anodes, the internal resistance does not add significantly to the anodes total resistance.\nTherefore, Saudi Aramco only considers the anode-to-earth resistance. You can calculate the anode-to-earth\nresistance of a single vertical impressed current anode by using the Dwight Equation as follows:\n\n0.159\n1\n8L\nRV =\nl\nn\nL d\n\nwhere -\nRV = resistance of one vertical anode to earth in ohms\nr = resistivity of soil in ohm-cm\nL = length of anode (or backfill column) in centimeters\nd = effective diameter of anode (or backfill column) in centimeters\n\nYou can calculate the anode bed resistance of two or more vertical anodes in parallel by using the Sunde\nEquation as follows:\n\n0.159\n1 + ( )\n8L 2L\nR= ln ln 0.656 N\nNL d S\n\nwhere -\nR = resistance, in ohms, of N vertical anodes in parallel and spaced S centimeters apart along a\nstraight line.\nr = soil resistivity in ohm-cm\nN = number of anodes\nL = length of anode (or backfill column) in centimeters\nd = diameter of anode (or backfill column) in centimeters\nS = anode spacing in centimeters\n\nAccording to the Sunde Equation, the anode bed resistance decreases with an increase in the number of anodes\nand/or an increase in the anode spacings. By adjusting the number and spacing of anodes, you can achieve a\ndesired anode bed resistance. The desired anode bed resistance should be less than the allowable anode bed\nresistance given by the following formula:\n\n## Ragb = Rmax - (RS + RLW )\n\nwhere -\nRagb = the allowable anode bed resistance\nRmax = the maximum allowable circuit resistance (the rectifiers rated voltage minus 2 volts,\ndivided by its rated current output)\nRS = structure-to-electrolyte resistance\nRLW = total lead wire resistance\n\n## Saudi Aramco DeskTop Standards 14\n\nEngineering Encyclopedia Cathodic Protection\nDesigning Cathodic Protection Systems\n\n## Amount of Coke Breeze Required\n\nTo calculate the net volume of coke breeze in each backfill column, the anode volume is subtracted from the\nvolume of the backfill column. This net volume is multiplied by the number of anodes and the coke breeze\ndensity to obtain the weight of coke breeze required. An extra 20% is added to cover spills and other waste.\n\nExample\n\nThe following example assumes that the structure-to-electrolyte resistance and the lead wire resistance are\nknown and the maximum allowable anode bed resistance has been determined. We will determine the number\nand spacing of anodes needed so that the anode bed resistance does not exceed the allowable anode bed\nresistance. Use the following engineering data.\n\n## CP current required: 16.5 amperes\n\nAnode material: Silicon iron\nAnode dimensions: 7.6 cm dia. x 152 cm length\nAnode consumption rate: 1 kg/A-yr\nMax. anode current density: 1 mA/cm2\nAnode weight: 50 kg\nBackfill dimensions: 20 cm dia. x 300 cm\nSoil resistivity: 5,000 ohm-cm\nAllowable anode bed resistance: 0.84 ohm\nCoke breeze density: 730 kg/m3\nMinimum Number of Impressed Current Anodes\n\nWe will design the anode bed so that it can discharge 20 amperes 120% of the 16.5 amperes required. To\nestimate the number of anodes required, multiply the total current requirement by the design life and\nconsumption rate of the anode material as follows.\n\n(\n\n)\nN = Y I C = (20 years )(20 A)(1 kg/A yr )/50 kg = 8 anodes\nW\n\nWe will use 10 anodes for the first calculation. (Using the current density method to calculate the minimum\nnumber of anodes would result in 6 anodes.)\n\n## Saudi Aramco DeskTop Standards 15\n\nEngineering Encyclopedia Cathodic Protection\nDesigning Cathodic Protection Systems\n\n## Anode Bed Resistance\n\nSubstitute 10 anodes for N, 305 cm (10 ft.) spacing for S, and the backfill dimensions into the Sunde Equation\nas follows.\n\nR=\n0.159 8L\nNL (\nln\nd\n1 + )\n2L\nS\n(ln 0.656 N)\n0.159 ( 5,000 ) 8(300) 2(300 )\n= ln 1 + ln(0.656)(10 )\n(10 )( 300 ) 20 (305 )\nR = 1.984 ohms\n\nThis anode bed resistance exceeds the maximum allowable anode bed resistance of 0.84 ohms. However,\naccording to the Sunde Equation, increasing the number of anodes can lower the resistance. If we substitute\nvalues of 20, 30, and 40 anodes for N at the 305 cm spacing, we obtain the following values.\n\n## No. of Anode Bed Resistance\n\nAnodes at 305 cm Spacing\n10 1.984\n20 1.173\n30 0.852\n40 0.677\n\nThe calculated anode bed resistance of 40 anodes installed with 305 cm spacings is less than the allowable\nresistance of 0.84 ohm. However, remember that increasing the anode spacing also decreases the anode bed\nresistance. If we repeat the calculations for spacings of 457, 610, 762, and 914 cm, (15, 20, 25, and 30 ft.) we\nobtain the following table.\n\n## No. of Anode Spacing in Centimeters\n\nAnodes 305 457 610 762 914\n10 1.984 1.658 1.494 1.396 1.331\n20 1.173 0.950 0.837 0.770 0.726\n30 0.852 0.680 0.593 0.542 0.507\n40 0.677 0.535 0.464 0.421 0.393\n\nBased on the allowable anode bed resistance of 0.84 ohms, one option appears to be 20 anodes with 610 cm\nspacings. Another option30 anodes with 457 cm spacings-would result in an anode bed resistance of 0.68\nohm. We can graph the values in the table to create a design chart as shown in Figure 8.\n\n## Saudi Aramco DeskTop Standards 16\n\nEngineering Encyclopedia Cathodic Protection\nDesigning Cathodic Protection Systems\n\n10.0\n\n305 cm spacing\n457 cm spacing\n610 cm spacing\n762 cm spacing\n914 cm spacing\nRaab\n1.0\n0.84\n\n0.5\n\n0.1\n2 10 20 30 40\nNUMBER OF ANODES\n\n## Vertical Anode Design Chart for an Impressed Current Anode Bed\n\nin Soil with a Resistivity of 5,000 ohm-cm\nFigure 8\n\nDesign charts are an efficient alternative to making several calculations for each anode bed design. The design\nchart in Figure 8 is based on a soil resistivity of 5,000 ohm-cm. To use this chart for other soil resistivities, the\nallowable anode bed resistance, Ragb, must be converted to a value that corresponds to a soil resistivity of\n5,000 ohm-cm. The Sunde Equation can be used to show that anode bed resistance is directly proportional to\nsoil resistivity as follows:\n\nR ohm cm ohm cm\n=\nR 5,000 ohm cm 5,000 ohm cm\n\nTherefore,\n\n## Saudi Aramco DeskTop Standards 17\n\nEngineering Encyclopedia Cathodic Protection\nDesigning Cathodic Protection Systems\n\nIn summary, the allowable anode bed resistance is determined for 5,000 ohm-cm soil. Then the design chart in\nFigure 8 is used to select the optimum number and spacing of anodes to achieve an anode bed resistance less\nthan or equal to the allowable anode bed resistance. Work Aid 1B provides a procedure for using a design chart\nto determine the optimum number and spacing of impressed current anodes.\n\n## Amount of Coke Breeze Required\n\nNext, we will calculate the amount of coke breeze required. Assume that the anode dimensions are 7.6 cm dia.\nx 152 cm and the coke breeze column dimensions are 20 cm. dia. x 300 cm length. First, the anode volume is\nsubtracted from the volume of the anode backfill column.\n\n## 0.09 - 0.007 = 0.083 m3.\n\nTo obtain the weight of coke breeze required, this net volume is multiplied by the number of anodes and the\ncoke breeze density. An extra 20% is added to cover spills.\n\n## (0.083 m3)(20 anodes)(730 kg/m3)(120%) = 1,454 kg\n\nThe formulas and procedure to design impressed current anode beds are provided in Work Aid 1B.\n\n## Saudi Aramco DeskTop Standards 18\n\nEngineering Encyclopedia Cathodic Protection\nDesigning Cathodic Protection Systems\n\n## Designing Cathodic Protection Systems for Onshore Well Casings\n\nSaudi Aramco cathodically protects all onshore well casings with impressed current systems. Saudi Aramcos\ngoal is to protect both well casings and associated flowlines and pipelines as an integrated system. This is\naccomplished by minimizing the use of pipeline insulating devices. If an insulation device is installed, a\nbonding box is used in case it becomes necessary to short circuit the insulator. Saudi Aramco normally uses an\nindividual impressed current system to protect each well. However, multiple wells are sometimes protected by\na single impressed current system.\n\nSaudi Aramco uses both surface and deep anode beds to protect onshore well casings. The type of anode bed\nand its location are determined by the following:\n\n## its current output capacity\n\nthe surface soil resistivity\nthe number of well casings to be protected\nthe physical layout of the wells and facilities\neconomics\n\nSaudi Aramco uses remote surface anode beds where soil resistivity is low enough for adequate current\ndistribution. Where surface soil resistivity is high, deep anode beds are used. Deep anode beds are also used in\ncongested areas such as pipeline corridors and in-plant areas to provide better current distribution.\n\nBoth surface and deep anode bed designs involve the following determinations:\n\n## design requirements using Saudi Aramco Engineering Standards and Drawings\n\ncathodic protection current requirements\n\nDescriptions of both requirements are provided in this section. After the information on cathodic protection\ncurrent requirement is presented, surface and deep anode bed designs are discussed separately. Surface anode\nbed design for a well casing is similar to surface anode bed design for a buried pipeline, which was covered in\nthe first section of this module. Therefore, this section focuses mainly on the design of deep anode beds.\n\n## Saudi Aramco DeskTop Standards 19\n\nEngineering Encyclopedia Cathodic Protection\nDesigning Cathodic Protection Systems\n\n## Saudi Aramco Engineering Standards and Drawings\n\nThe design of cathodic protection systems for onshore well casings is governed by Saudi Aramco Engineering\nStandard SAES-X-700. SAES-X-700 states the following:\n\nthe design capacity of impressed current systems shall be 50 amperes per well with uncoated\ncasings and 10 amperes per well with coated casings. The Consulting Services Department\nmay approve designs for lower capacity systems if adequate protection is verifiable.\n\na single impressed current system may be used to protect more than one well if the wells are\nless than 200 meters apart.\n\nimpressed current anode beds shall be sized to discharge 120% of the rated current output of\nthe dc power source.\n\n## impressed current systems shall have a design life of 20 years.\n\nAccording to G.I. 428.003, a minimum negative casing-to-soil potential of 1.0 volt (current off) versus Cu-\nCuSO4 is required.\n\nA minimum distance of 150 meters is required between a deep anode bed and the well casing it is to protect. A\nminimum distance of 150 meters is also required from the anode bed to plant (GOSP, etc.) perimeter fencing.\nIn addition, SAES-X-700 requires that deep anode beds are located remote from other buried structures. A\ndistance of 50 meters is required for deep anode beds with a design current output of less than 30 amperes. A\ndistance of 100 meters is required for anode beds with capacities between 30 and 50 amperes.\n\nSurface anode beds should be designed in accordance with Standard Drawing AA-036346. Scrap steel surface\nanode beds should be designed in accordance with Standard Drawing AA-036278.\n\n## Saudi Aramco DeskTop Standards 20\n\nEngineering Encyclopedia Cathodic Protection\nDesigning Cathodic Protection Systems\n\n## There are two types of deep anode beds: aquifer\n\npenetrating and non-aquifer penetrating. An aquifer Anode\npenetrating deep anode bed is shown in Figure 9. junction\nImpressed current anodes and a PVC vent pipe are box\nstrapped to 2-3/4\" steel tubing and surrounded by\ncoke breeze inside 9-5/8\" casing. A water and coke PVC vent\npipe\nbreeze slurry is pumped in the hole from the bottom\nup through the steel tubing. An individual lead wire\nPositive\nconnects each anode to the junction box. cable\nSurface from d-c\nAnode reactions with water or brine generate chlorine casing power\nsource\ngas and oxygen. If these gases cannot escape, they\nwill surround the anodes and increase the anode bed Lead wires\nresistance. The anodes are mounted on a perforated\nPVC pipe so that the gas can escape freely. Saudi\nAramco rarely uses aquifer penetrating deep anode\nbeds. Aquifer penetrating deep anode installations\nFormation\nmust be approved by Saudi Aramcos Hydrology interface\nDepartment. The Hydrology Department regulates the Pea gravel\ndrilling depth to minimize the chances of Top of coke\ncommunication between subsurface aquifers. breeze column\n2-3/4\" steel at least 6 m\ntubing above anodes\n\n9.625\" O.D.\ncasing\nCoke breeze\n\nAnode Anode\ncentralizer\n\nBottom of coke\nbreeze column\napprox. 1.5 m\nBottom of tubing below anodes\nslotted\nAA-036356\n\n## Aquifer Penetrating Deep Anode Bed from Standard\n\nDrawing AA-036356\nFigure 9\n\n## Saudi Aramco DeskTop Standards 21\n\nEngineering Encyclopedia Cathodic Protection\nDesigning Cathodic Protection Systems\n\n## Non-aquifer penetrating deep anode beds contain\n\nanodes and coke breeze without a full length of casing Anode\n(Figure 10). Saudi Aramco installs a PVC vent pipe junction\nbox\nto allow gases formed by anodic reactions to escape.\nPVC vent\nA separate loading pipe is run to the bottom of the pipe\nhole and used to pump a water slurry of coke breeze\nfrom the hole as it is filled with coke breeze. This\nprocedure allows the slurry to be pumped upward\nfrom the bottom of the well until the anodes are\nCasing\ncompletely surrounded.\n\n## The Hydrology Department regulates the acceptable Lead\n\nwires Positive\ndepth of the deep anode bed. The location of the cable\nanode bed is approved in writing. from d-c\npower\nsource\nFormation\ninterface\nPea gravel\n\nCoke\nbreeze\n\nAnode\n\nPerforated PVC\nvent pipe AA-036385\n\n## Non-Aquifer Penetrating Deep Anode Bed from\n\nStandard Drawing AA-036385.\nFigure 10\n\n## Saudi Aramco DeskTop Standards 22\n\nEngineering Encyclopedia Cathodic Protection\nDesigning Cathodic Protection Systems\n\n## Cathodic Protection Current Requirements\n\nThe current required to protect an onshore well casing depends on its environment. The operating environment\ncan be very complex. Environmental considerations include the following:\n\nwell spacing\n\nthe size, area, and depth of well casings, cementing information, and coatings (if used)\n\nprocess plants\n\nstorage tanks\n\n## hazardous or unique requirements at proposed sites\n\nCurrent requirements can be determined for a particular producing area since formation conditions and well\ncompletion methods are usually similar. Saudi Aramco uses casing potential profile techniques to determine\ncurrent requirements. Casing profiles are similar to line current surveys for buried pipelines. These tests are\nexpensive so they are not performed on every well. The tubing must be pulled so that the potential profile tool\ncan contact the internal casing wall. Saudi Aramco now uses a new logging tool which does not require the\nwell bore to be filled with a non-conducting fluid.\n\nBasically, a downhole logging tool measures the voltage (IR drop) at regular intervals in the casing. The\nlogging tool contains spring-loaded knife blades or hydraulically-activated contacts that are located several feet\napart.\n\nOnce the well bore has been prepared, the logging tool is lowered into the well. The voltage between the blades\nor contacts is measured by using a sensitive voltmeter. Readings are usually taken from the bottom to the top\nof the casing. The tool also measures casing resistance so an accurate current flow can be calculated (I=V/R).\n\n## Saudi Aramco DeskTop Standards 23\n\nEngineering Encyclopedia Cathodic Protection\nDesigning Cathodic Protection Systems\n\nCurrent that flows onto the casing is assumed to be cathodic protection current. Current that flows away from\nthe casing is assumed to be corrosion current. Current must flow onto the entire casing for it to be adequately\nprotected. Figure 11 shows how the readings are plotted and interpreted.\n\nMicrovolts\n-400 -200 0 +200 +400\n0\nBottom of\nWell surface pipe\ncasing\n\nNegative\nindicate\ncurrent\nflow down\ncasing\n\nNegative slope\nindicates\ncurrent is\nindicate current casing\nflow up casing\nPositive\nslope indicates\ncurrent is entering\nthe casing\n900\n\n1200\n\nFigure 11\n\n## Saudi Aramco DeskTop Standards 24\n\nEngineering Encyclopedia Cathodic Protection\nDesigning Cathodic Protection Systems\n\n## Surface Anode Bed Design\n\nSurface anode beds that protect well casings are designed similarly to anode beds that protect buried pipelines.\nThe number and spacing of anodes can be adjusted so that the total circuit resistance is less than the maximum\nallowable circuit resistance. As with anode beds for buried pipelines, Saudi Aramco only considers the anode-\nto-earth resistance. The resistance of a surface anode bed is given by the Sunde Equation.\n\n0.159\n1 +\n8L 2L\nR=\nNL\nln\nd S (ln 0.656 N)\n\nwhere -\n\nR = resistance, in ohms, of N vertical anodes in parallel and spaced S centimeters apart along a\nstraight line.\nr = soil resistivity in ohm-cm\nN = number of anodes\nL = length of anode (or backfill column) in centimeters\nd = diameter of anode (or backfill column) in centimeters\nS = anode spacing in centimeters\n\nThe formulas and procedure used to design surface anode beds for onshore well casings are similar to those\nused for buried pipelines, which are provided in Work Aid 1B.\n\n## Saudi Aramco DeskTop Standards 25\n\nEngineering Encyclopedia Cathodic Protection\nDesigning Cathodic Protection Systems\n\n## Deep Anode Bed Design\n\nlength of the coke breeze column (based on the number of anodes required)\ncircuit resistance\namount of coke breeze required\n\nAfter describing how the above information is determined, an example, which demonstrates the design of a\ndeep anode bed, is provided.\n\n## Length of the Coke Breeze Column\n\nThe length of the coke breeze column depends on the number and spacing of anodes in the deep anode bed.\nThe anode spacing is determined in the field. Anodes are usually vertically spaced on 5 meter centers. As with\nsurface anode beds, the number of anodes needed can be calculated by using the anodes maximum current\noutput in the electrolyte or the anodes consumption rate. It is best to use the method that gives the more\nconservative value or the greater number of anodes.\n\nTo calculate the minimum number of anodes based on the anodes maximum current density, the following\nformula is used:\nN = I/(dL x A)\n\nwhere -\nN = number of impressed current anodes\nI = total current required in milliamperes times 120%\nd = anode diameter in centimeters\nL = anode length in centimeters\nA = anode maximum current density in mA/cm2\n\nTo calculate the minimum number of anodes based on the anodes consumption rate, the following formula is\nused:\n\n(\n\nN= Y I C\nW )\nwhere -\nN = number of impressed current anodes\nY = the impressed current system design life in years\nI = total current required in amperes times 120%\nC = anode consumption rate in kg/A-yr\nW = weight of a single anode\n\n## Saudi Aramco DeskTop Standards 26\n\nEngineering Encyclopedia Cathodic Protection\nDesigning Cathodic Protection Systems\n\nCircuit Resistance\n\nThe total current output of a deep anode impressed current system is given by the formula:\n\nI = ED/RC\nwhere -\nED = the voltage capacity of the dc power source minus 2 volts\nRC = circuit resistance of the deep anode impressed current system\n\nThe circuit resistance, RC, is represented by the equivalent electrical circuit in Figure 12. For design purposes,\na deep anode bed is treated as if it were a single vertical anode.\n\nRRPL\n\nWell I\ncasing\n\nRLW\n\nED I\n\nRV\nRRNL\n\nRS\n\nFigure 12\n\n## RC = RRPL + RLW + RV + RS + RRNL\n\nwhere -\nRRPL = the resistance in the positive lead wire from the rectifier to the junction box\nRLW = the equivalent resistance of the anode lead wires in parallel\nRV = the resistance of the anode bed column as a single vertical anode\nRS = structure-to-electrolyte resistance\nRRNL = the resistance in the negative lead wire from the well casing to the rectifier\n\n## Saudi Aramco DeskTop Standards 27\n\nEngineering Encyclopedia Cathodic Protection\nDesigning Cathodic Protection Systems\n\nBecause the anode bed is treated as a single vertical anode, the anode bed resistance can be calculated by using\nthe Dwight Equation as follows:\n\n0.159 eff 8L\nRV =\nln d\n1\nL\n\nwhere -\nRV = resistance of vertical anode to earth in ohms\neff = effective soil resistivity of the interval in ohm-cm\nL = length of coke breeze column in centimeters\nd = diameter of deep anode hole in centimeters\n\nThe effective soil resistivity, eff, is the average resistivity over the interval where the anodes will be placed.\nThe soil resistivity is measured by using Geonics instruments.\n\nThe circuit resistance, RC, must be less than the maximum allowable circuit resistance. The maximum circuit\nresistance, Rmax, is given by the following formula:\n\nRmax = ED/I\nwhere -\n\n## ED = the driving voltage of the dc power source\n\nI = the current output rating of the dc power source\n\n## Amount of Coke Breeze Required\n\nNormally, the amount or weight of coke breeze required is calculated by multiplying the net volume of coke\nbreeze (plus an extra 20% because of spillage) by the coke breeze density. The net volume of coke breeze\nrequired is calculated by subtracting the volumes of the anodes and vent pipe from the total volume of the\nbackfill column. However, for our purposes, we will use the total volume of the backfill column to calculate\nthe weight of coke breeze required.\n\n## Saudi Aramco DeskTop Standards 28\n\nEngineering Encyclopedia Cathodic Protection\nDesigning Cathodic Protection Systems\n\nExample\n\nThis example will demonstrate the design of a deep anode bed to protect an onshore well casing in accordance\nwith Saudi Aramco standards and practices. Using the following data, we will design the anode bed:\n\n## Current required: 50 amperes\n\nWell casing-to-soil resistance: 0.08 ohm\nAnode material: High silicon chromium cast iron\nAnode consumption rate: 0.45 kg/A-yr\nWeight per anode: 50 kg\nAnode dimensions: 7.6 cm dia. x 152 cm length\nRectifier output rating: 50 V, 50 A\nLead wire resistance: No. 4 AWG - 0.85 x 10-3 ohm/m (rectifier to junction box and well)\nNo. 6 AWG - 1.35 x 10-3 ohm/m (anodes)\nCoke breeze density: 730 kg/m3\nDistance from rectifier to junction box: 5 meters\nDistance from rectifier to well casing: 150 meters\nDepth at top of coke breeze column: 69 meters\nDiameter of coke breeze column: 30 cm\n\n## Length of the Coke Breeze Column\n\nEight amperes of current are required to protect the well casing. According to SAES-X-700, we will design the\nsystem for 50 amperes. To estimate the number of anodes, the current required is multiplied by the design life\nand the anode consumption rate. Then the total weight is divided by the mass per anode as follows:\n\n## (20 years)(50 A)(120%)(0.45 kg/A-yr)/50 kg per anode = 11 anodes\n\nIf we use the current density formula for calculating the number of anodes needed, we get:\n\nN = I / ( dL A )\n\n=\n(50, 000 mA )(1.2)\n(7,6 cm)(152 cm )(1 mA / cm2 )\n= 16.5 anodes round up to 17anodes\n\nSince 17 anodes is the larger calculated by the two methods, we will design our anode bed with 17 anodes.\n\n## Saudi Aramco DeskTop Standards 29\n\nEngineering Encyclopedia Cathodic Protection\nDesigning Cathodic Protection Systems\n\nSeventeen high silicon chromium cast iron anodes (1.52 meters long) spaced on 5 meter centers require an\ninterval of 81.5 meters (Figure 13). Standard Drawing AA-036356 requires at least 6 m of coke breeze above\nthe anodes and a minimum of 1.5 m below the anodes. Therefore, the minimum length of this particular coke\nbreeze column is 81.5 m + 6 m + 1.5 m = 89 m.\n\nPea gravel\n\n6 m minimum\n\n0.76 m\n1\n\nCoke breeze 5m\n124 m\n2\n\n15\n\n5m\n\n16\n\n5m\n\n17\n0.76 m\n\n1.5 m minimum\n\nFigure 13\n\n## Saudi Aramco DeskTop Standards 30\n\nEngineering Encyclopedia Cathodic Protection\nDesigning Cathodic Protection Systems\n\nCircuit Resistance\n\nAssume that the Geonics instrument measured an effective soil resistivity of 2482 ohm-cm. By using eff and\ntreating the anode bed as a single anode, we can calculate the deep anode bed resistance. The anode bed is 30\ncm in diameter and 8,900 cm long. Therefore, the anode bed resistance is as follows:\n\nRV =\n( ) (\n0.159 2, 482 8 8, 900\nln )\n1 = 0.300 ohm\n8, 900 30\n\nNext, we must ensure that the total circuit resistance is less than the maximum allowable circuit resistance and\ncalculate the amount of coke breeze required. The resistance in the rectifiers negative and positive lead wires is\ncalculated as follows:\nRNLW + RPLW = (150m + 5m)(110%)(0.85 x 10-3 ohm/m) = 0.145 ohm\n\nThe following is the equivalent resistance of the lead wires from the junction box to the anodes:\n\n16\n(17 )(75 ) + i (5) meters\n\nR LW = i =0\n17 ( ( )\n120% ) 1.35 10 3 ohm m = 0.186 ohm\n\nIncluding the well casing-to-soil resistance of 0.08 ohm, the total circuit resistance is calculated as follows:\nRC = 0.300 + 0.145 + 0.186 + 0.08 = 0.711 ohm.\n\nThe total circuit resistance is less than the maximum allowable circuit resistance, Rmax.\n\n## Rmax = (50V 2V)/50 A = 0.96 ohm.\n\nAmount of Coke Breeze Required\n\n## (6.291 m3)(120%) (730kg/m3) = 5,510 kg.\n\nThe formulas and procedure to design deep anode beds are provided in Work Aid 2.\n\n## Saudi Aramco DeskTop Standards 31\n\nEngineering Encyclopedia Cathodic Protection\nDesigning Cathodic Protection Systems\n\n## Designing Cathodic Protection Systems for Vessel and Tank Interiors\n\nProduction vessels and storage tanks contain fluids that range from very corrosive hot, sour brines to\ndemineralized water or steam condensate. Sometimes, coatings alone can adequately protect vessels. In most\ncases, both coatings and cathodic protection are required to prevent corrosion.\n\nGalvanic anodes are usually the most economical choice except in very large tanks. In drinking water systems,\nwhere contamination from anode corrosion products is a concern, Saudi Aramco uses indium activated\naluminum galvanic anodes. Saudi Aramco normally uses high silicon chromium cast iron impressed current\nanodes to protect the interiors of large tanks. Whenever impressed current systems are considered, an economic\nanalysis should be performed.\n\nThis section is divided into two parts. The first part covers galvanic anode system designs for vessel and tank\ninteriors. The second part covers impressed current system designs for tank interiors. The designs for both\ntypes of CP systems include determining the following:\n\n## cathodic protection current requirement\n\ndesign requirements in accordance with Saudi Aramco Engineering Standards and Drawings\n\nIn Module 107.01, we calculated the total current requirement by multiplying the required current density from\nSAES-X-500 by the water-wetted surface area. Therefore, the designs in this section assume that the total\ncurrent requirement has been calculated. After the following description of design requirements from Saudi\nAramcos standards and drawings, methods and examples for designing galvanic and impressed current\nsystems are presented.\n\n## Saudi Aramco DeskTop Standards 32\n\nEngineering Encyclopedia Cathodic Protection\nDesigning Cathodic Protection Systems\n\n## Saudi Aramco Engineering Standards and Drawings\n\nThe design of cathodic protection systems for vessel and tank interiors is governed by Saudi Aramco\nEngineering Standard SAES-X-500. SAES-X-500 states the following:\n\nSection 4.1.1 - Cathodic protection is mandatory if the resistivity of the contents is expected to\nbe 1500 ohm-centimeter or less during the life of the tank or vessel.\n\nSection 4.3.1 - The design life of galvanic or impressed current anode systems shall be 5 years\nor the testing and inspection (T&I) period, whichever is greater.\n\nSection 4.3.2 - Galvanic anodes in dehydrator vessels shall be designed using a 20%\nefficiency factor. Designs for other wet crude handling vessels shall use an efficiency factor of\n50%.\n\nSection 4.5.1 - The steel-to-water potential shall be more negative than -0.90 V (current on)\nversus a Ag-AgCl reference electrode, or +0.15 V (current on) versus a zinc electrode.\n\nSection 4.6.3 - Aluminum and zinc anodes shall not be used if the water resistivity is more\nthan 1000 ohm-centimeters.\n\nSection 4.6.4 - Magnesium anodes shall not be used if the water resistivity is less than 500\nohm-centimeters.\n\nSection 4.6.5 - Zinc anodes shall not be used in environments where the temperature exceeds\n49 C.\n\nCathodic protection designs for tanks are based on construction standards set in the following Standard\nDrawings: AA-036354 (Water Storage Tanks Galvanic Anodes) and AA-036353 (Water Storage Tanks\nImpressed Current). The number, depth, and location of galvanic and impressed current anodes are based on\ntank size, water level variation, and water resistivity. Some diagrams from AA-036354 and AA-036353 are\nshown in Figures 14 and 15.\n\n## Saudi Aramco DeskTop Standards 33\n\nEngineering Encyclopedia Cathodic Protection\nDesigning Cathodic Protection Systems\n\nJunction box\n0.01 ohm shunt\nWeld Access\nhatch\n\nCa ble\nPoly-\npropylene\nrope\nTop View\nRe ference electrode Anode Installation Detail\naccess hole\n\nAccess\nhatch\n\nAnode\nPoly- wire\npropylene\nrope\n\n## See Anode Ca ble tie\n\nInstallation Detail\n\nSee Anode\nString Detail\n\n1.5 m\nAnode String Detail\n\nDiagrams from Standard Drawing AA-036354, Water Storage Tanks Galvanic Anodes\nFigure 14\n\n## Saudi Aramco DeskTop Standards 34\n\nEngineering Encyclopedia Cathodic Protection\nDesigning Cathodic Protection Systems\n\n## Anode Assembly Detail\n\nReference\nelectrode\n\ncable\n\nAnode\nassembly\n\nJunction\nbox\n\nTop View\n\nSee Anode\nAssembly Detail\n\nJunction box\n\nReference\nelectrode Center of h\nTank\n1/\n2h\n\nDiagrams from Standard Drawing AA-036353, Water Storage Tanks Impressed Current\nFigure 15\n\n## Saudi Aramco DeskTop Standards 35\n\nEngineering Encyclopedia Cathodic Protection\nDesigning Cathodic Protection Systems\n\n## Galvanic Anode System Design for Vessel and Tank Interiors\n\nThe design of galvanic anode systems for vessel and tank interiors includes determining the following:\n\n## the current output per anode\n\nthe number of galvanic anodes required\ngalvanic anode life\n\nAfter describing these calculations, an example, which demonstrates the design of galvanic anode systems, is\nprovided.\nCurrent Output Per Anode\n\nThe current output of a single galvanic anode in a vessel or tank is given by the following formula\n\nIA = ED/RC\nwhere -\nIA = current output of a single anode\nED = anode driving potential\nRC = circuit resistance\n\nThe circuit resistance of a single anode, RC, is represented in Figure 16 in the equivalent electrical circuit.\n\nIA\n\nRLW\nED\n\nRV\n\nGalvanic anode RS\n\nTank Galvanic Anode System and Equivalent Electrical Circuit for Each Anode\nFigure 16\n\n## Saudi Aramco DeskTop Standards 36\n\nEngineering Encyclopedia Cathodic Protection\nDesigning Cathodic Protection Systems\n\n## The circuit resistance is given by the following formula:\n\nRC = RS + RLW + RV\nwhere -\nRS = structure-to-electrolyte resistance in ohms\nRLW = the anode lead wire resistance in ohms\nRV = the anode-to-electrolyte resistance in ohms\n\nThe anode-to-electrolyte resistance of a single vertical anode, RV, is given by the Dwight Equation.\n0.159 8L\nRV = 1\nl d\nn\nL\n\nwhere -\nRV = resistance of one vertical anode to the electrolyte in ohms\nr = resistivity of the electrolyte in ohm-cm\nL = length of the anode in centimeters\nd = diameter of the anode in centimeters\nNumber of Galvanic Anodes Required\n\nThe number of galvanic anodes required is calculated by dividing the total current requirement by the current\noutput of a single galvanic anode as shown in the following equation:\n\nN = I/IA\nwhere -\nN = the number of anodes\nI = the total current required to protect the structure\nIA = the current output of a single anode\nGalvanic Anode Life\n\nThe life of a galvanic anode can be estimated if its weight and current output are known. The expected life of a\ngalvanic anode is given by the following formula:\n\nW UF\nY=\nC IA\nwhere -\nY = anode life in years\nW = anode mass in kg\nC = actual consumption rate in kg/A-yr\nIA = anode current output in amperes\nUF = Utilization factor\n\n## Saudi Aramco DeskTop Standards 37\n\nEngineering Encyclopedia Cathodic Protection\nDesigning Cathodic Protection Systems\n\nExample\n\nGiven the following engineering data, we will calculate the current output, number, and life of galvanic anodes\nrequired to protect the interior of a water storage tank.\n\n## Current required: 3.6 amperes\n\nStructure-to-electrolyte resistance: 0.042 ohms\nWater resistivity: 15 ohm-cm\nAnode: Hydral 2B\nAnode dimensions: 22 cm dia. x 22 cm\nAnode actual consumption: 4.11 kg/A-yr\nAnode weight: 22 kg\nAnode solution potential: -1.05 V versus Ag-AgCl\nRequired structure-to-electrolyte potential: -0.90 V versus Ag-AgCl\nCurrent Output Per Anode\n\n## I = ED/RC = (EA-ES)/(RS + RLW + RV)\n\nIf we calculate RV by using the Dwight Equation and insert the known values for EA, RS, and RLW, we can\ndetermine the anode current output of a single anode as a function of the structures potential as follows.\n0.159 8L\n1 =\n( )\n0.159 15 8 22\nl n ( )\n1 = 0.12 ohm\nRV = ln\nL d 22 22\n(\nI = 1.05 E S ) (0.042 + 0.024 + 0.12) = (1.05 E S) 0.186\n\n## At a negative structure potential of 0.90 volt, the anodes current output is\n\nI = (1.05-0.90)/0.186 = 0.81 A.\nNumber of Galvanic Anodes Required\n\nThe number of anodes required is 3.6 A/0.81 amperes per anode, or at least 5 anodes.\nGalvanic Anode Life\n\n## W UF 22 kg 0.85 = 5.6 years\n\nY= =\nC I A 4.11 kg / A yr 0.81 A\n\n## Saudi Aramco DeskTop Standards 38\n\nEngineering Encyclopedia Cathodic Protection\nDesigning Cathodic Protection Systems\n\nWe can develop similar performance data for this particular Hydral 2B anode in electrolytes with different\nresistivities. For example, the current output of the Hydral 2B anode in a\n10 ohm-cm electrolyte is calculated as follows.\n\nI = (1.05 E S) 0.042 + 0.024 + 10 (0.12) = (1.05 E S ) 0.15\n15\n\nBy plotting the formulas at water resistivities of 5, 10, 15 and 20 ohm-cm, we obtain the performance chart\nshown in Figure 17. The anode life is shown on the right side of the performance chart.\n\n10.0\n8.0 0.6\n\n## 6.0 De sign Parameters 0.8\n\nAnode dimensions: 22 cm dia. x 22 cm\nAnode efficiency: 96% Wt: 22 kg\n4.0 Consum. rate: 3.95 kg/amp-yr UF: 85% 1.1\nR S: 0.042 ohm RLW : 0.024 ohm\nAnode solution potential: -1.05 V vs. Ag-AgCl\n\n2.0 2.3\n\n1.0 4.5\n0.8 5.7\n\n0.6 7.6\n\n0.4 11.4\n\n0.2 22.7\n\n0.1\n0.80 0.85 0.90 0.95 1.0\nStructure Potential (volts vs. Ag-AgCl)\n\n## Performance Chart of a Hydral 2B Anode\n\nFigure 17\n\nThe formulas and procedure used to design galvanic anode systems for vessel and tank interiors are provided\nin Work Aid 3A.\n\n## Saudi Aramco DeskTop Standards 39\n\nEngineering Encyclopedia Cathodic Protection\nDesigning Cathodic Protection Systems\n\n## Impressed Current System Design for Vessel and Tank Interiors\n\nThe design of impressed current systems for vessel and tank interiors includes determining the following:\n\n## the number of impressed current anodes required\n\nthe circuit resistance\n\nAfter describing these calculations, an example, which demonstrates the design of an impressed current system\nfor a tank interior, is provided.\nNumber of Impressed Current Anodes Required\n\nThe number of anodes can be calculated based on the anodes maximum current output in the electrolyte or the\nanodes consumption rate. It is best to use the method that gives the more conservative value; that is, the\nmethod that results in the greatest number of anodes.\n\nTo calculate the minimum number of anodes based on the anodes maximum current density, the following\nformula is used:\n\nN = I/(dL x A)\nwhere -\nN = number of impressed current anodes\nI = total current required in milliamperes*\nd = anode diameter in centimeters\nL = anode length in centimeters\nA = anode maximum current density in mA/cm2\n\nTo calculate the minimum number of anodes based on the anodes consumption rate, the following formula is\nused:\n\nY I C\nN=\nW\n\nwhere -\nN = number of impressed current anodes\nY = the impressed current system design life in years\nI = total current required in amperes*\nC = anode consumption rate in kg/A-yr\nW = weight of a single anode\n\n## Saudi Aramco DeskTop Standards 40\n\nEngineering Encyclopedia Cathodic Protection\nDesigning Cathodic Protection Systems\n\nCircuit Resistance\n\nImpressed current anodes in vessels or tanks are connected in parallel as shown in Figure 18. The circuit\nresistance includes the anode resistances in parallel and the resistances in the negative and positive lead wires of\nthe rectifier.\n\nRRPL\n\nI\nI1 I2\nED\n\nRA1 RA2\nRRNL\n\nI\n\nRS\n\n## Tank Impressed Current System and Equivalent Electrical Circuit\n\nFigure 18\n\nThe equivalent resistance of N resistances in parallel is obtained from the following formula:\n\n1 1 1 1\n= + +\nR eq R A 1 R A 2 R AN\n\nIf the resistances are equal, the equivalent resistance is given by the following formula:\n\n1 = 1 + 1 + 1 = N R eq =\nRA\nR eq R A 1 R A 2 R AN RA N\n\n## Therefore, the circuit resistance is given by the formula shown below\n\nRA\nR c = R RPL + + Rs + R RNL\nN\n\nwhere -\n\n## RC = the circuit resistance of the entire impressed current system in ohms\n\nRRPL = the resistance in the positive lead wire from the rectifier to the junction box\nN = the number of impressed current anodes\nRA = the resistance of a single impressed current anode\nRS = structure-to-electrolyte resistance\nRRNL = the resistance in the negative lead wire from the structure to the rectifier\n\n## Saudi Aramco DeskTop Standards 41\n\nEngineering Encyclopedia Cathodic Protection\nDesigning Cathodic Protection Systems\n\nThe circuit resistance, RC, must be less than the maximum allowable circuit resistance given by the formula:\nRmax = ED/I\n\nwhere -\n\n## ED = the rated voltage of the dc power source\n\nI = the current output rating of the dc power source\n\nExample\n\nWe will design an impressed current system to protect a large, coated storage tank by using the following\ninformation:\n\n## Current required: 4.95 amperes\n\nStructure-to-electrolyte resistance: 0.06 ohms\nAnode lead wire resistance: 0.038 ohms\nRectifier negative lead resistance: 0.04 ohm\nRectifier positive lead resistance: 0.05 ohm\nWater resistivity: 15 ohm-cm\nAnode material: High silicon chromium cast iron\nAnode dimensions: 5.08 cm dia. x 152.4 cm (2\" dia. x 60\")\nAnode weight: 27.3 kg\nAnode maximum current density: 0.5 mA/cm2\nAnode consumption rate: 1 kg/A-yr\nRequired structure-to-electrolyte potential: -0.90 V versus Ag-AgCl\nRectifier output rating: 50 V, 50 A\n\n## Saudi Aramco DeskTop Standards 42\n\nEngineering Encyclopedia Cathodic Protection\nDesigning Cathodic Protection Systems\n\nCircuit Resistance\n\n## The resistance of the 5 anodes in parallel is given by the following formula:\n\nR A R LW + R V\n=\nN N\n\nWe can solve for RV by using the Dwight Equation for a single anode as follows.\n\nRV =\n0.159 8L\n1 =\n( ) ln (\n0.159 15 8 152.4 )\n1 = 0.07 ohm\nl\nn\nL d 152.4 5.08\n\nSubstituting all resistance values into the circuit resistance formula we obtain the following circuit resistance:\n\nR LW + R V\nR c = R RNL + + Rs + R RPL\nN\n0.038 + 0.07\nR c = 0.04 + + 0.06 + 0.05\n5\nR c = 0.17 ohm\n\nThe calculated circuit resistance is less than the maximum allowable circuit resistance, which is\n\n## Rmax = 50 V/50 A = 1.0 ohm.\n\nThe formulas and procedure used to design an impressed current system to protect the interior of a vessel or\ntank are provided in Work Aid 3B.\n\n## Saudi Aramco DeskTop Standards 43\n\nEngineering Encyclopedia Cathodic Protection\nDesigning Cathodic Protection Systems\n\n## Designing Cathodic Protection Systems For In-Plant Facilities\n\nThere are a particular set of problems involved when cathodically protecting structures within a plant area.\nHydrocarbon lines, firewater piping, buried valves, and tank bottoms are examples of critical systems, which\nrequire cathodic protection in plant areas. Some external corrosion problems are caused by the buried copper\ngrounding grid, which is designed to protect personnel in case of an electrical ground fault. Without cathodic\nprotection, buried steel piping corrodes faster because it becomes anodic to the copper grid.\n\nTank bottoms in contact with the earth are susceptible to corrosion due to moisture in the soil. Saudi Aramco\noften bonds tanks and buried structures together and cathodically protects them as a single unit. Cathodic\nprotection current is supplied by surface distributed impressed current or galvanic anode systems near tanks or\nbetween parallel pipes. This installation ensures uniform current distribution and prevents shielding.\n\nPrevious sections of this module have addressed the design of CP systems for piping and vessel and tank\ninteriors; therefore, this section focuses on CP system design for external tank bottoms. Saudi Aramco protects\nabove-ground storage tanks with close, or distributed, impressed current systems. This type of design is\napplicable in congested areas such as plants because (1) remote anode beds are electrically shielded by other\nburied structures, and (2) some buried metal in the plant does not require cathodic protection (e.g., a bare\ncopper grounding grid or rebar in foundations).\n\nThe design of impressed current systems that protect external tank bottoms involve determination of the\nfollowing:\n\n## design requirements using Saudi Aramco standards and drawings\n\nthe current required to shift the potential of the earth under the tank bottom\nthe number of impressed current anodes required\n\nAfter the following information about Saudi Aramcos standards and drawings is presented, a method and\nexample are given to demonstrate the design of impressed current systems to protect tank bottoms.\n\n## Saudi Aramco DeskTop Standards 44\n\nEngineering Encyclopedia Cathodic Protection\nDesigning Cathodic Protection Systems\n\n## Saudi Aramco Engineering Standards and Drawings\n\nThe design of cathodic protection systems for in-plant facilities is governed by Saudi Aramco Engineering\nStandard SAES-X-600. Structures which are cathodically protected include the following:\n\n## pressurized steel hydrocarbon pipelines\n\nbottoms or soil side of above ground storage tanks\nburied tanks containing hydrocarbons\nsea walls and associated anchors\nburied steel bodied valves\n\n## The design life of impressed current anode systems shall be 20 years.\n\nAnode beds shall be sized to discharge 100% of the rated current capacity of the d-c power\nsource.\nThe maximum system operating voltage shall be 100 volts with a maximum circuit resistance\nof 1 ohm or less.\nDesigns for systems connected to plant ground, rebar in concrete, and other underground\nstructures shall provide distributed anodes.\n\nThe minimum structure-to-soil potentials of in-plant structures are listed in Figure 19.\n\n## Structure Required Potential\n\nCurrent On\nBuried plant piping -0.85 volt or more negative versus CuSO4 electrode\n\nTank bottom external -1.00 volt or more negative versus C uSO4 at periphery\n-0.85 volt or more negative versus permanent CuS O4\n+0.20 volt or less positive versus permanent Zn\n-0.35 volt change in structure potential vs CuS O4\nSea walls (water side) -0.90 volt or more negative versus AgCl electrode\nSea walls (soil side) -0.85 volt or more negative versus CuSO4 electrode\n\nFigure 19\n\n## Saudi Aramco DeskTop Standards 45\n\nEngineering Encyclopedia Cathodic Protection\nDesigning Cathodic Protection Systems\n\nCathodic protection designs for tanks are based on construction standards set in Standard Drawing AA-036355-\nTank Bottom Impressed Current Details. AA-036355 requires a distance between the anodes and the tank of\nabout one-quarter of the tanks radius. The minimum distance is 3 meters and the maximum distance is 10\nmeters. Also, the maximum separation between distributed anodes is 20 meters. Some diagrams from AA-\n\nV+\n036355 are shown in\nFigure 20.\n\nRRLW\n=R\nR\nC +R\nRPL+\nRNL\nN\nDiagrams from Standard Drawing AA-036355, Tank Bottom Impressed Current Details\nFigure 20\n\n## Saudi Aramco DeskTop Standards 46\n\nEngineering Encyclopedia Cathodic Protection\nDesigning Cathodic Protection Systems\n\n## Number and Placement of Anodes in Distributed Anode Beds\n\nSaudi Aramco uses distributed anode beds in congested areas where electrical shielding prevents the use of\nremote anode bed installations. Normally, high silicon chromium cast iron anodes are used. Distributed anode\nsystems are designed so that the structure to be protected is within the area of influence that surrounds each\nanode (Figure 21). The idea of this type of design is to change the potential of the earth around the structure.\nThe earth within the area of influence of each current-discharging anode will be positive with respect to remote\nearth. There is a limited area of the tank bottom where the net potential difference between the tank bottom and\nadjacent soil will be sufficient to attain cathodic protection. Note in the figure that although a single anode\nmay cathodically protect the tank periphery closest to it, the anode cannot adequately protect the rest of the\ntank.\n\n## Assume tank-to-soil Anode\n\npotential is -0.5 V Protected area header\nbefore energizing of tank bottom cable\nanode.\n\nEarth potential\nchange after anode\nis energized\n\n-1.0\n\n## Protected potential of tank center\n\n-0.85\nto tank-to-earth potential\nbefore anode is energized.\n\nTank Tank\nwall\ncenter\n\n-0.5\n8 6 4 2 0 2 4 6 8\nDistance from Tank Periphery to Tank Center (Meters)\n\nFigure 21\n\n## Saudi Aramco DeskTop Standards 47\n\nEngineering Encyclopedia Cathodic Protection\nDesigning Cathodic Protection Systems\n\nIt must be remembered that the earth potential change is additive for all the anodes that cause a change (see\nFigure 22). Hence, the earth potential shift at a given point on the tank bottom must include the potential shift\ncaused by neighboring anodes. For example, if the earth potential shift at a given point is 0.2 volt from one\nanode and 0.1 volt from a neighboring anode, then the total earth potential change would be 0.3 volt.\n\n## Earth potential shift\n\ncaused by anode Impressed\ncurrent anode\n\nStorage tank\n\nJunction box\n\n## Additive Effect of Distributed Anodes\n\nFigure 22\n\nTo determine the spacing between anodes, there will be some geometry involved to be sure that an adequate\npotential shift is achieved at all points along the protected structure. Since the separation between anodes\ncannot exceed 20 meters, divide the circumference of the distributed anode system by 20 meters to determine\nthe total number of anodes. Round up to the nearest number of anodes.\n\n## Saudi Aramco DeskTop Standards 48\n\nEngineering Encyclopedia Cathodic Protection\nDesigning Cathodic Protection Systems\n\nThe amount of earth potential change depends on (1) the size and shape of each anode, (2) the anodes position\nrelative to the structure to be protected, (3) the current flow, and (4) the soil resistivity. According to SADP-X-\n100, Section 18.3.7, the earth potential shift is given by the following formulas:\n\n## (1) For a single vertical anode\n\n0.5 I L2 + X 2 + L\nVx = ln , (see Figure 23).\nL X\n\n## (2) For a single horizontal anode\n\nVx =\nI\nl n\n(0.5L )2 + X 2 + h 2 + 0.5L\nL X 2 + h2\n\nwhere -\nVX = earth potential change at the center of the tank in volts\nI = current flow in amperes\nr = soil resistivity in ohm-cm\nL = anode length in cm\nX = horizontal distance from the anode to the center of the tank in cm (Figure 23)\nh = depth of burial to centerline of anode in cm\n\nsource\n\nh Anode\n\nX L\nTank\ncenter\n\nFigure 23\n\n## Saudi Aramco DeskTop Standards 49\n\nEngineering Encyclopedia Cathodic Protection\nDesigning Cathodic Protection Systems\n\nCircuit Resistance\n\nImpressed current anodes around a tank are connected in parallel as shown in Figure 24. Saudi Aramco\nnormally uses high silicon chromium cast iron anodes.\n\ntank wall\n\nAnode\njunction box\n\nRectifier\n\npower source cable ring\n\nRRPL RCBL\n\nI\nI1 I2 I3 IN\nED\n\nRRNL\nRA1 RA2 RA3 ... RAN\n\nRS\n\nFigure 24\n\n## Saudi Aramco DeskTop Standards 50\n\nEngineering Encyclopedia Cathodic Protection\nDesigning Cathodic Protection Systems\n\nThe circuit resistance of the impressed current system is given by the following formula:\n\nRA\nR C = R RPL + RCBL + + R S + R RNL\nN\n\nwhere -\nRC = the circuit resistance of the entire impressed current system\nRRPL = the resistance in the positive lead wire from the rectifier to the junction box\nRCBL = the resistance in the header cable\nN = the number of impressed current anodes\nRA = the resistance of a single impressed current anode\nRS = structure-to-electrolyte resistance\nRRNL = the resistance in the negative lead wire from the structure to the rectifier\n\n## The resistance, RA, is given by the following formula:\n\nRA = RLW + RV,\nwhere -\nRLW = the anode lead wire resistance in ohms\nRV = the anode-to-electrolyte resistance in ohms\n\nThe anode lead wire resistance, RLW, is very small and can be ignored. Therefore, RA is equal to the anode-\nto-electrolyte resistance of a single vertical anode, which is given by the Dwight Equation.\n\n0.159\n1\n8L\nRA = R V =\nl d\nn\nL\n\nwhere -\nRV = resistance of one vertical anode to the electrolyte in ohms\nr = resistivity of the electrolyte in ohm-cm\nL = length of the backfill in centimeters\nd = diameter of the backfill in centimeters\n\nFor high resistivity soils like those found in Saudi Arabia, RV is much greater than the sum of the other\nresistances. Therefore, RRPL, RRNL, RCBL, and RS, can be ignored.\n\n## Saudi Aramco DeskTop Standards 51\n\nEngineering Encyclopedia Cathodic Protection\nDesigning Cathodic Protection Systems\n\nExample\n\nGiven the following engineering data, we will design an impressed current system to protect a bare tank\nbottom.\n\n## Anode material: High silicon chromium cast iron\n\nAnode dimensions: 7.6 cm dia. x 152 cm (backfill, 20 cm dia. x 180 cm)\nTank dimensions: 30 m diameter\nTank native potential: -0.5 V vs. CuSO4 electrode\nSoil resistivity: 2,000 ohm-cm\nRectifier output rating: 50 V, 35 A\nNumber and Placement of Impressed Current Anodes\n\nAccording to Standard Drawing AA-036355, the distance from the anodes to the tank wall should be\napproximately one-quarter of the tank radius. In the case of a 30 m dia. tank (15 m radius), the anodes will be\nplaced at a distance of 0.25 x 15 or 3.75 meters from the tank wall (see\nFigure 25). The radius of the system is, therefore, 15 + 3.75 or 18.75 m. The circumference of the circle at\nwhich the anodes will be located can be calculated as follows:\n\nC = 2r = 2(18.75) = 118 m\n\nAllowing a maximum separation of 20 m between each anode, we will need 118/20 = 5.9 or 6 anodes as a\nminimum number of anodes.\n\nCable Ring\n\n15 m Vertical Anode\nr\n\n## Anode junction box\n\nNe gative return lead to rectifier\n\nFigure 25\n\n## Saudi Aramco DeskTop Standards 52\n\nEngineering Encyclopedia Cathodic Protection\nDesigning Cathodic Protection Systems\n\nUsing the equation for earth potential shift for a single vertical anode, calculate the current needed to give a\ntotal of shift of 0.35 volts at the center of the tank from all six anodes.\n\n0.5 I 2000 2 2\nVx = 0.35 V = l n 180 + 1875 + 180\n180 1875\n\n1000 I 2064\n0.35 V = ln\n180 1875\n( )(\n= I 1.768 l n 1.107 )\n( )( )\n0.35 V = I 1.768 0.1014 I = 1.95 amperes\n\nThis is the current that will shift the potential by 0.35 volts at the center of the tank. The formulas and\nprocedure that are used to calculate current required to shift earth potential are provided in Work Aid 4.\n\nTo complete the design, it is necessary to determine the total current requirement for the tank bottom and use\nsufficient anodes to assure a 20 year design life.\n\n## Current needed for tank bottom:\n\n(30)\n2\nd 2 2\nI= 0.02 A / m = 0.02 = 14.1 amperes\n4 4\n\nSAES-X-600 requires sufficient anodes to discharge the rectifier amperage rating without exceeding the\nmaximum anode current density. The current output for a single anode should not exceed:\n\n## I = dL x 1 mA/cm2 = (7.6)(152) x 1.0\n\nI = 3629 mA or 3.6 amperes\n\nThe rectifier output is 35 amperes. Therefore, the minimum number of anodes needed is\n35 3.6 = 9.7 anodes. Use 10 anodes.\n\n## Saudi Aramco DeskTop Standards 53\n\nEngineering Encyclopedia Cathodic Protection\nDesigning Cathodic Protection Systems\n\n## Designing Cathodic Protection Systems For Marine Structures\n\nSaudi Aramco cathodically protects the entire submerged surface area of marine structures (see Figure 26).\nThis submerged surface area extends from the base of the structure to the Indian Spring Mean High Tide Level.\nTo calculate the current required to protect the structure, you must know the following:\n\n## the area of steel which is immersed in sea water\n\nthe area of steel which is immersed below the mud line\nthe actual or anticipated number of well casings\nany insulated or unprotected foreign structures\nand the required current density for the specific environment\n\nSplash zone\nWater line\n\nImmersed zone\n\nMud line\n\nOffshore Platform\nFigure 26\n\nThe immersed surface areas can be calculated from drawings and specifications of the structure or obtained\nfrom the structure designer.\n\n## Saudi Aramco DeskTop Standards 54\n\nEngineering Encyclopedia Cathodic Protection\nDesigning Cathodic Protection Systems\n\nThis section is divided into two parts. The first part covers galvanic anode system designs for marine\nstructures. Saudi Aramco cathodically protects all marine structures and pipelines with galvanic anodes. The\nsecond part covers impressed current systems. Impressed current systems are used when ac power is available.\nWhen used with a galvanic anode system, an impressed current system is intended as the primary system. The\ngalvanic anode system is used as a backup for the following two reasons:\n\n## 1) To protect the structure until the impressed current system is energized.\n\n2) To protect the structure when electrical power is interrupted. Power can be interrupted during break\ndowns or during scheduled shutdowns.\n\nThe designs for both types of CP systems involve determination of design requirements by using Saudi Aramco\nEngineering Standards and Drawings. Therefore, after the following information about Saudi Aramcos\nstandards and drawings, methods and examples for designing galvanic and impressed current systems are\ndescribed separately.\n\n## Saudi Aramco DeskTop Standards 55\n\nEngineering Encyclopedia Cathodic Protection\nDesigning Cathodic Protection Systems\n\n## The design of cathodic protection systems for marine structures is governed by\n\nSAES-X-300. SAES-X-300 states the following:\n\nGalvanic anode systems, when used alone, shall have a design life of 25 years.\nGalvanic anode systems accompanied by impressed current systems shall have a design life of\n10 years and the impressed current system shall have a design life of 15 years.\nThe cathodic protection system shall achieve a minimum structure-to-electrolyte potential of -\n0.90 volt versus Ag-AgCl over the entire structure.\n\nSaudi Aramco requires the following current densities in the immersed surface areas.\n\nCoated Uncoated\n\n## Seawater structures 10.0* 50.0*\n\nStructures in mud or soil 10.0 20.0\nMarine pipelines (coated) 2.5 --\n\n## * Higher current density may be required depending on turbulence and/or velocity.\n\nCathodic protection designs for offshore structures are based on construction standards set in the following\nStandard Drawings: AA-036348 (Galvanic and Impressed Current Anodes on Offshore Structures), AA-036409\n(Replacement of Galvanic Anodes on Offshore Structures and Risers), and AA-036335 (Half Shell Bracelet\nType Anode for Pipe Sizes 4\" Through 60\"). Standard Drawing AA-036335 states that the maximum spacing\nfor all sizes of anode bracelets shall be 150 meters. Some diagrams from AA-036348, AA-036409, and AA-\n036335 are shown in Figures 27 and 28.\n\n## Saudi Aramco DeskTop Standards 56\n\nEngineering Encyclopedia Cathodic Protection\nDesigning Cathodic Protection Systems\n\ncoating\nremoved\n\nwelded to pipe\nAA-036335\n\n## Mean Sea Level Galvanic Anode Bracelet\n\nfor Submarine Pipelines\n\nPipeline Riser\n\nAnodes laid on\nsea bed under\npile structure\n\nAA-036409\n\nAA-036409\n\nFigure 27\n\n## Saudi Aramco DeskTop Standards 57\n\nEngineering Encyclopedia Cathodic Protection\nDesigning Cathodic Protection Systems\n\nNylon\nStrapping\nGalvanic\nanodes\nImpressed\ncurrent anode\n\nDielectric\nImpressed shield\ncurrent anodes\n\nJunction Box.\n\n## 2\" PVC Coated\n\nConduit\n1-1/2\" Conduit\n\nMain Deck\nJunction Box Mounting for\nImpressed Current Anode Cables AA-036348\n\nFigure 28\n\n## Saudi Aramco DeskTop Standards 58\n\nEngineering Encyclopedia Cathodic Protection\nDesigning Cathodic Protection Systems\n\n## Galvanic Anode System Design for Marine Structures\n\nSaudi Aramco uses indium-doped aluminum alloy or zinc-tin-doped aluminum alloy galvanic anodes to protect\nmarine structures. Galvanic anodes are usually installed at least 30 cm (1 ft.) from the structure. A calcareous\nbuild-up forms on the structure as it polarizes. This build-up increases the current distribution of the anodes.\nGalvanic anode bracelets are used to protect marine pipelines.\n\nThe design of galvanic anode systems for marine structures (such as platforms, mooring buoys, etc.) involves\ndetermining the following:\n\n## the number of galvanic anodes required\n\ngalvanic anode life\n\nThe design of galvanic anode systems for marine pipelines involves determining the following:\n\n## the number of galvanic anode bracelets required\n\nthe spacing of the bracelets\n\nAfter describing these calculations, an example, which demonstrates the design of a galvanic anode system for\na marine platform and pipeline, is provided.\nNumber of Galvanic Anodes Required\n\nThe number of anodes needed to protect a marine structure depends on the total current required and the current\noutput per anode. In Module 107.01, we calculated the total current requirement by multiplying the required\ncurrent density from SAES-X-300 by the immersed surface area of the marine structure. The total number of\nanodes is calculated by using the following equation:\n\nN = I/IA\nwhere -\nN = the number of anodes\nI = the total current required to protect the structure\nIA = the current output of a single anode\n\n## Saudi Aramco DeskTop Standards 59\n\nEngineering Encyclopedia Cathodic Protection\nDesigning Cathodic Protection Systems\n\nAccording to SADP-X-100, Eqn. 20, the current output from a single anode, IA, can be found using the\nfollowing equation:\n\nIA = ED/RC,\nwhere -\nIA = anode current output in amperes\nED = the anode driving potential in volts versus Ag-AgCl\nRC = the circuit resistance in ohms\nCircuit Resistance\n\n## The circuit resistance, RC , is given by the following equation:\n\nRC = RS + RV\nwhere -\nRS = the structure-to-electrolyte resistance (for offshore structures, this is negligible)\nRV = the anode-to-electrolyte resistance\n\nFor galvanic anodes on marine structures, the Dwight Equation is used to calculate RV.\n\n0.159\n1\n8L\nRV =\nl\nn\nL d\n\nwhere -\nr = the electrolyte (seawater) resistivity in ohm-cm\nL = the length of the anode in centimeters\nd = the diameter of the anode in centimeters or the circumference divided by for non-\ncylindrical shapes\nGalvanic Anode Life\n\nThe anodes must last over the design life of the system. The anode life is given by the following equation.\nW UF\nY=\nC IA\n\nwhere -\nY = anode life in years\nW = mass of one anode in kg\nUF = utilization factor\nC = actual consumption rate in kg/A-yr\nIA = current output of one anode in amperes\n\n## Saudi Aramco DeskTop Standards 60\n\nEngineering Encyclopedia Cathodic Protection\nDesigning Cathodic Protection Systems\n\n## Number and Spacing of Galvanic Anode Bracelets\n\nThe number of anode bracelets required to protect a marine pipeline is calculated as follows.\n\nN = L/150 m\nwhere -\nN = the number of anode bracelets\nL = length of the pipeline\n\nThe anode bracelets must last over the design life of the pipeline. The anode life is given by the following\nequation.\n\nY = W UF\nC IA\nwhere -\nY = anode life in years\nW = net weight of one anode bracelet in kg\nUF = utilization factor\nC = actual consumption rate in kg/A-yr\nIA = current output of one anode in amperes\n\nThe net weight per bracelet, W, can be obtained from Standard Drawing AA-036335 (see also Work Aid 5A).\nThe current requirement for one anode bracelet, IA, can be calculated by diving the total current requirement by\nthe number of anode bracelets.\n\nAn alternative method involves calculating the current output of a single anode bracelet by dividing the driving\npotential of the galvanic anode material by the circuit resistance. As shown previously, the circuit resistance is\nequivalent to the anode-to-electrolyte resistance because the structure-to-electrolyte resistance is negligible. For\nbracelet type anodes, the following equation from Design Practice SADP-X-100 (Eqn. 22, p. 33) is used to\ncalculate the anode-to-electrolyte resistance.\n\n0.315\nRA =\nA\nwhere -\nRA = the anode-to-electrolyte resistance for bracelet type anodes\nr = the electrolyte resistivity in ohm-cm\nA = the exposed surface area of the anode in cm2\n\nThen, the number of anodes can be calculated by dividing the total current requirement by the current output of\na single anode bracelet.\n\n## Saudi Aramco DeskTop Standards 61\n\nEngineering Encyclopedia Cathodic Protection\nDesigning Cathodic Protection Systems\n\nExample\n\nWe will calculate the number of Galvalum III anodes needed to protect an offshore platform and a coated\nmarine pipeline. Assume that an impressed current system will also be installed to protect the platform. We\nwill use the following information to design the platforms galvanic anode system.\n\n## Current required: 250 amperes\n\nGalvalum III solution potential: -1.09 V versus Ag-AgCl\nGalvalum III anode dimensions: 28 cm x 28 cm x 304.8 cm (11\" x 11\" x 120\")\nGalvalum III anode weight: 566 kg (1,245 lbs.)\nGalvalum III consumption rate: 3.46 kg/A-yr\nWater resistivity: 15 ohm-cm\nRequired structure potential: -0.90 V versus Ag-AgCl\nNumber of Anodes\n\nThe current output of each anode is given by the equation I = ED/RA. The driving potential of the Galvalum III\nanode is\n\n## ED = 1.09 V - 0.90 V = 0.19 V versus Ag-AgCl.\n\nTo calculate the anode-to-electrolyte resistance of the anode, we must insert its dimensions and the water\nresistivity into the Dwight Equation. The effective diameter of the anode is\n\n## Therefore, the anode-to-electrolyte resistance is\n\nRV =\n0.159 8L\nl n 1 =\n( ) ( )\n0.159 15 ln 8 304.8 1 = 0.025 ohm\nL d 304.8 35.7\n\nand the current output of a single Galvalum III anode on the platform is\n\n## Saudi Aramco DeskTop Standards 62\n\nEngineering Encyclopedia Cathodic Protection\nDesigning Cathodic Protection Systems\n\n## The lifetime of one anode is\n\nW UF (\n566 kg .85 )( )\nY= = = 18 years\nCIA ( )(\n3.46 kg amp yr 7.6 amp )\nThis is greater than the design lifetime of 10 years.\n\nNow, using the following information, we will calculate the current requirement and number of Galvalum III\nanodes needed to protect the coated marine pipeline:\n\n## Length of pipeline: 4.5 km\n\nPipe diameter: 45.7 cm\nCurrent required: 14 amperes\nGalvalum III consumption rate: 3.46 kg/A-yr\n\n## N = 4500 m/150 m = 30 bracelets.\n\nNow we will make sure that the anodes will last over the design lifetime of 10 years. According to Standard\nDrawing AA-036335 (see table in Work Aid 5A), the net anode material weight of a bracelet for a 45.7 cm\ndiameter pipeline is 61 kg. Therefore, the lifetime of one anode bracelet is calculated as follows:\n\nY=\nW UF (61 kg )(0.85)\nC I (3.46 kg amp yr )(14 amps 30 bracelets) =\n= 32 years\n\nThe formulas and procedure used to design galvanic anode systems for marine structures and offshore pipelines\nare provided in Work Aid 5A.\n\n## Saudi Aramco DeskTop Standards 63\n\nEngineering Encyclopedia Cathodic Protection\nDesigning Cathodic Protection Systems\n\n## Impressed Current System Design for Marine Structures\n\nThe driving potentials of impressed current anodes are much greater than galvanic anodes. Therefore, fewer\nimpressed current anodes are required to provide the same amount of current. However, their placement is\nmore critical to achieve adequate current distribution. An impressed current anode will tend to over-protect\nareas close to it and under-protect more remote areas. To improve the current distribution of impressed current\nanodes, the following methods are sometimes used:\nAn insulating shield is installed on the structure near impressed current anodes.\nImpressed current anodes are separated from the structure by at least 1.5 m.\n\nThe design of impressed current systems for marine structures involves determining:\nthe corrected current required\nthe number of impressed current anodes required\nthe rectifier voltage requirement\n\nAfter describing these calculations, an example, which demonstrates the design of an impressed current system\nto protect a marine platform, is provided.\nCorrected Current Requirement\n\nImpressed current anodes are considered 67-80% as effective as galvanic anodes. In the Arabian Gulf, 75%\neffectiveness is used in most design calculations. Therefore, we must modify the current requirement as\nfollows:\n\n## ICorr = I(1 + (100% %Efficiency)/100)\n\nwhere -\nICorr = corrected total current requirement for an impressed current system\nI = total current requirement for galvanic anode systems\nEfficiency = efficiency of the impressed current anodes\nNumber of Impressed Current Anodes Required\n\nThe number of impressed current anodes is calculated based on the maximum anode current output as follows:\nN = ICorr/IA\nwhere -\nICorr = corrected total current requirement for an impressed current system\nIA = the maximum current output of one impressed current anode\n\nThe maximum current output is the maximum current density of the anode material multiplied by the anode\nsurface area.\n\n## Saudi Aramco DeskTop Standards 64\n\nEngineering Encyclopedia Cathodic Protection\nDesigning Cathodic Protection Systems\n\n## Rectifier Voltage Requirement\n\nSaudi Aramco sizes the rectifier to meet the total current requirement of the anodes based on a rectifier\nefficiency of 67%. The rectifier output voltage is given by the following formula:\n\nE = ICorrRC/Efficiency\n\n## The total circuit resistance, RC, is given by the following formula:\n\nR V + R LW\nR C = R RPL + R RNL +\nN\n\nwhere -\nRC = the circuit resistance of the entire impressed current system\nRRPL = the resistance in the positive lead wire from the rectifier to the junction box\nRRNL = the resistance in the negative lead wire from the structure to the rectifier\nN = the number of impressed current anodes\nRV = the resistance of a single impressed current anode (Dwight Equation)\nRLW = anode lead wire resistance\n\nNote that the structure-to-electrolyte resistance, RS, is omitted from the formula for RC. This is because RS is\nnegligible in seawater.\n\n## Saudi Aramco DeskTop Standards 65\n\nEngineering Encyclopedia Cathodic Protection\nDesigning Cathodic Protection Systems\n\nExample\n\nWe will design an impressed current system to protect the previous offshore platform for which we designed a\ngalvanic anode system. However, assume that the platform is also electrically bonded to four conductor pipes.\n\n## Current required for platform: 251 amperes\n\nAnode material: Platinized niobium\nAnode dimensions: 7.6 dia x 76.2 cm (3\" dia. x 30\")\nAnode max. current output density: 40 mA/cm2\nWater resistivity: 15 ohm-cm\nAnode lead wire: No. 2 AWG, 50 meters long\nLead wire resistance: 0.531 x 10-3 ohm/m\nTotal resistance in both rectifier lead wires: 0.02 ohm\nCurrent requirement for conductor pipes: 3 amperes each\n\n## Corrected Current Requirement\n\nThe total current requirement for the platform and conductor pipes is\n\n## I = 251 A + (4)(3 A) = 263 A.\n\nThe corrected current required for an impressed current system is calculated as follows:\n\n## Saudi Aramco DeskTop Standards 66\n\nEngineering Encyclopedia Cathodic Protection\nDesigning Cathodic Protection Systems\n\n## Rectifier Voltage Requirement\n\nThe output voltage is given by the equation E = ICorrRC. The total circuit resistance, RC, is calculated as\nfollows: (Remember, RS is negligible in seawater)\n\nR V + R LW\nR C = R RPL + R RNL +\nN\n\nThe anode-to-electrolyte resistance, RV, is calculated using the Dwight Equation as follows:\n\nRV =\n0.159 8L\n1 =\n( ) ln (\n0.159 15 8 76.2 )\n\n1 = 0.11 ohm\nl\nn\nL d 76.2 7.6\n\n## RLW = (50 m)(0.531 x 10-3 ohm/m) = 0.03 ohm.\n\nThe total resistance in the rectifier lead wires, RRPL + RRNL, is 0.02 ohm. Therefore, the circuit resistance is\n\n## RC = 0.02 + (0.11 + 0.03)/5 = 0.05 ohm.\n\nAllowing for a rectifier efficiency of 67%, the voltage requirement of the rectifier is\n\n## E = ICorrRC/Eff = (329 A)(0.05 ohms)/0.67 = 25 volts.\n\nFormulas and procedures used to design impressed current systems for marine structures are provided in Work\nAid 5B.\n\n## Saudi Aramco DeskTop Standards 67\n\nEngineering Encyclopedia Cathodic Protection\nDesigning Cathodic Protection Systems\n\n## Work Aid 1: Data Base, Formulas, and Procedures to Design Cathodic\n\nProtection Systems for Buried Pipelines\n\nThis Work Aid provides formulas, and procedures to design galvanic and impressed current systems for buried\npipelines.\n\nWork Aid 1A: Data Base, Formulas, and Procedure to Design Galvanic Anode Systems for\n\nThis Work Aid provides requirements from Standard Drawing AA-036352, formulas, and a procedure for\ndetermining the number, circuit resistance, current output, and design life of galvanic anodes used to protect\nburied pipelines.\n\n## Dia. of Pipe (inches)\n\nPipe Length (meters) Up to 6\" Up to 12\" Up to 24\" Up to 36\" Over 36\"\n15 2 2 2 2 4\n30 2 2 4 4 6\n45 2 4 4 6 8\n60 2 4 6 8 10\n75 4 6 8 10 10\n90 4 6 10 10 12\n\nNOTES:\n\n## 1. Minimum number of anodes shall always be 2, regardless of pipe length or diameter.\n\n2. 100 lb. anodes are to be used only in Subkha areas. When substituting 100 lb. anodes for 60 lb.\nanodes, reduce anode quantity by one-half from that noted in table.\n\n3. One-half of the anodes shall be located on either side of crossing where practical on existing pipelines.\n\n## Saudi Aramco DeskTop Standards 68\n\nEngineering Encyclopedia Cathodic Protection\nDesigning Cathodic Protection Systems\n\nFormulas\n\n## Galvanic Anode Current Output\n\nIA = ED/RC\nwhere -\nIA = anode current output (amperes)\nED = driving potential of the galvanic anode (volts)\nRC = circuit resistance (ohms)\n\nCircuit Resistance\n\nR LW + R V\nRC = R S +\nN\nwhere -\nRC = circuit resistance (ohms)\nRS = the structure-to-soil resistance (ohms)\nRLW = the lead wire resistance (ohms)\nRV = the resistance of a single vertical anode to earth (ohms)\nN = the number of anodes\n\n## Dwight Equation (for a single vertical anode)\n\n0.159\n1\n8L\nRS =\nl\nn\nL d\nwhere -\nRV = resistance of vertical anode to earth in ohms\nr = resistivity of soil in ohm-cm\nL = length of anode (or backfill column) in centimeters\nd = diameter of anode (or backfill column) in centimeters\n\n## Galvanic Anode Life\n\nW UF\nY=\nC IA\nwhere -\nY = life in years\nW = anode mass in kg\nUF = utilization factor\nC = actual consumption rate in kg/A-yr\nIA = anode current output in amperes\n\n## Saudi Aramco DeskTop Standards 69\n\nEngineering Encyclopedia Cathodic Protection\nDesigning Cathodic Protection Systems\n\nProcedure\n\n## 1.1 Obtain the dimensions of buried pipe section.\n\n1.2 If using 60 lb. anodes, find number of anodes for pipe diameter and length in the Table at the\nbeginning of this Work Aid.\n\n## 2.1 Obtain the following information:\n\nanode dimensions (in centimeters)\nchemical backfill package dimensions (in centimeters)\nsoil resistivity\n\n2.2 If the anode is bare, determine the working diameter of the galvanic anode.\nIf anode is cylindrical, use its diameter (in centimeters)\nIf anode is not cylindrical, calculate its effective diameter (circumference/3.14).\n\n2.3 Calculate the anode-to-earth resistance by inserting the values for soil resistivity and the\nbackfill dimensions into the Dwight Equation. In Subkha, where no backfill package is used,\ninsert the anode dimensions.\n\n2.4 Divide the sum of the lead wire resistance and anode-to-earth resistance by the number of\nanodes. Add this resistance to the structure-to-electrolyte resistance to calculate the circuit\nresistance.\n\n## 3.0 Calculate the anode current output.\n\n3.1 Divide the anode driving potential by the circuit resistance calculated in Step 2.4.\n\n## 4.1 Obtain the following information:\n\nanode mass in kg\nanode utilization factor\nactual anode consumption rate in kg/A-yr\n\n4.2 Substitute the anode current output from Step 3.1 and the values from Step 4.1 into the\nGalvanic Anode Life formula and calculate the anode life.\n\n## Saudi Aramco DeskTop Standards 70\n\nEngineering Encyclopedia Cathodic Protection\nDesigning Cathodic Protection Systems\n\nWork Aid 1B: Formulas and Procedure to Design Impressed Current Systems for Buried\nPipelines\n\nThis Work Aid provides formulas and procedures to calculate the number and spacing of impressed current\nanodes and the volume of coke breeze needed for the anode bed. This procedure assumes that you have\ndetermined the current requirement and allowable anode bed resistance.\n\nFormulas\n\n## Minimum Number of Anodes Based on Anode Maximum Current Density\n\nN = I/(dL x A)\n\nwhere -\nN = number of impressed current anodes\nI = total current required in milliamperes times 120%\nd = anode diameter in centimeters\nL = anode length in centimeters\nA = anode maximum current density in mA/cm2\n\n## Minimum Number of Anodes Based on Anode Consumption Rate\n\nY I C\nN=\nW\nwhere -\nN = number of impressed current anodes\nY = the impressed current system design life in years\nI = total current required in amperes times 120%\nC = anode consumption rate in kg/A-yr\nW = weight of a single anode in kg\n\n## Ragb = Rmax - (RS + RLW)\n\nwhere -\nRagb = the allowable anode bed resistance\nRmax = the maximum allowable circuit resistance (the rectifiers rated voltage minus\n2 volts, divided by its rated current output)\nRS = structure-to-electrolyte resistance\nRLW = total lead wire cable resistance\n\n## Saudi Aramco DeskTop Standards 71\n\nEngineering Encyclopedia Cathodic Protection\nDesigning Cathodic Protection Systems\n\n## Sunde Equation (for multiple vertical anodes in parallel)\n\n0.159\n1 + (l n 0.656N\n)\n8L 2L\nR= l n\nNL d S\n\nwhere -\nR = resistance, in ohms, of N anodes in parallel and spaced S centimeters apart along a straight\nline.\n= soil resistivity in ohm-cm\nN = number of anodes\nL = length of anode (or backfill column) in centimeters\nd = diameter of anode (or backfill column) in centimeters\nS = anode spacing in centimeters\n\nCorrected Allowable Anode Bed Resistance (for use with Design Chart A in this Work Aid)\n\nR5000 = R(5,000/)\nwhere -\n\n## R5000 = allowable anode bed resistance corresponding to 5,000 ohm-cm soil\n\nR = allowable anode bed resistance of soil with resistivity of ohm-cm\n= soil resistivity in ohm-cm\n\n## Saudi Aramco DeskTop Standards 72\n\nEngineering Encyclopedia Cathodic Protection\nDesigning Cathodic Protection Systems\n\nProcedure\n\n## 1.1 Obtain the following information:\n\nanode material\nanode weight (in kg)\nanode consumption rate\ncoke breeze backfill column dimensions (in centimeters)\nsoil resistivity (in ohm-cm)\ncurrent required\nallowable anode bed resistance\nstructure-to-electrolyte resistance\n\n1.2 Calculate the minimum number of anodes required by using the anode current density formula\nand anode consumption rate formula. Use the largest number of anodes calculated from the\ntwo formulas. Round up to the nearest multiple of 10.\n\n## 2.0 Determine the anode bed resistance.\n\n2.1 If the allowable anode bed resistance (Ragb) is not available, calculate Ragb by using the\nAllowable Anode Bed Resistance Formula.\n\n2.2 Correct the allowable anode bed resistance, Ragb, for soil with resistivity other than 5000\nohm-cm by using the Corrected Allowable Anode Bed Resistance formula.\n\n2.3 Use Design Chart A in Figure 30 to determine the optimum number and spacing of anodes so\nthat Rgb is less than the corrected value of Ragb. Ensure that the number of anodes is greater\nthan the minimum number from Step 1.2.\n\n3.0 Calculate the weight of coke breeze needed for the anode bed.\n\n## 3.1 Obtain the following information:\n\nanode diameter and length (in centimeters)\ncoke breeze column dimensions\ncoke breeze density\n\n3.2 Subtract the volume of one anode from the volume of the backfill column to obtain the net\nvolume of coke breeze.\n\n## Saudi Aramco DeskTop Standards 73\n\nEngineering Encyclopedia Cathodic Protection\nDesigning Cathodic Protection Systems\n\n3.3 Multiply the net volume of coke breeze by 1.2 (for spillage) and by the number of anodes\nfrom Step 3.2.\n\n3.4 Multiply the total volume of backfill by the density of the coke breeze.\n\n10.0\nBackfill Column:\n7.0 L = 300 cm\nd = 20 cm\n5.0 = 5,000 ohm-cm\n\n## 3.0 305 cm spacing\n\n457 cm spacing\n2.0 610 cm spacing\n762 cm spacing\n914 cm spacing\n1.0\n\n0.7\n0.5\n\n0.3\n\n0.1\n2 10 20 30 40\nNumber of Anodes\n\nDesign Chart A\nFigure 30\n\n## Saudi Aramco DeskTop Standards 74\n\nEngineering Encyclopedia Cathodic Protection\nDesigning Cathodic Protection Systems\n\n## Work Aid 2: Formulas and Procedure to Design Cathodic Protection\n\nSystems for Onshore Well Casings\n\nThis Work Aid provides formulas and procedures to design impressed current deep anode beds to protect\nonshore well casings. This procedure assumes that you have determined the current requirement and allowable\nanode bed resistance.\n\nFormulas\n\n## Minimum Number of Anodes Based on Anode Maximum Current Density\n\nN = I/(dL x A)\nwhere -\nN = number of impressed current anodes\nI = total current required in milliamperes times 120%\nd = anode diameter in centimeters\nL = anode length in centimeters\nA = anode maximum current density in mA/cm2\n\n## Minimum Number of Anodes Based on Anode Consumption Rate\n\nY I C\nN=\nW\nwhere -\nN = number of impressed current anodes\nY = the impressed current system design life in years\nI = total current required in amperes times 120%\nC = anode consumption rate in kg/A-yr\nW = weight of a single anode\n\nCircuit Resistance\n\n## RC = RRPL + RLW + RV + RS + RRNL\n\nwhere -\nRC = circuit resistance\nRRPL = the resistance in the positive lead wire from the rectifier to the junction box\nRLW = the equivalent resistance of the anode lead wires (the sum of the individual lead wire\nresistances divided by the number of lead wires)\nRV = the resistance of the anode bed as a single vertical anode\nRS = structure-to-electrolyte resistance\nRRNL the resistance in the negative lead wire from the well casing to the rectifier\n\n## Saudi Aramco DeskTop Standards 75\n\nEngineering Encyclopedia Cathodic Protection\nDesigning Cathodic Protection Systems\n\n0.159 eff 8L\nRV = 1\nl d\nn\nL\n\nwhere -\n\n## RV = resistance of vertical anode to earth in ohms\n\neff = effective soil resistivity of the interval in ohm-cm\nL = length of the coke breeze column in centimeters\nd = diameter of deep anode hole in centimeters\n\nVC = (d2/4)H\n\nwhere -\n\n## d = diameter of the coke breeze column in meters\n\nH = height of the coke breeze column in meters\n\nProcedure\n\n## 1.1 Obtain the following information:\n\nanode material\nanode diameter and length (in centimeters) and weight (in kg)\nanode consumption rate\ncurrent required\nanode spacing\n\n1.2 Calculate the minimum number of anodes required by using the anode current density formula\nand anode consumption rate formula. Use the largest number of anodes calculated from the\ntwo formulas.\n\n1.3 Calculate the length of the coke breeze column. Allow at least 6 meters above the top anode\nand at least 1.5 meters below the bottom anode for the coke breeze backfill.\n\n## Saudi Aramco DeskTop Standards 76\n\nEngineering Encyclopedia Cathodic Protection\nDesigning Cathodic Protection Systems\n\n## 2.1 Obtain the following information:\n\neffective soil resistivity from Geonics measurement\nlength of coke breeze column (from Step 1.3)\ndiameter of coke breeze column\nmaximum allowable circuit resistance\nstructure-to-electrolyte resistance\n\n2.2 Calculate the deep anode bed resistance by inserting the effective soil resistivity and the\ndimensions of the coke breeze column into the Dwight Equation.\n\n2.3 Multiply the total length of the rectifier lead wires by both the lead wire resistance (in ohm/m)\nand 110%.\n\n2.4 Divide the total length of the anode lead wires by the number of lead wires. Multiply this\namount by the lead wire resistance (in ohm/m) and 120%.\n\n2.5 Add the resistances from Steps 2.2, 2.3, and 2.4 to the well casing-to-soil resistance. Make\nsure that this total circuit resistance is less than the maximum allowable circuit resistance,\nRmax. Rmax = (rectifier rated voltage - 2 volts)/ rectifier rated current output.\n\n## 3.1 Obtain the following information:\n\ncoke breeze density\ncoke breeze column dimensions\n\n3.2 Calculate the volume of coke breeze using the provided formula. Multiply the volume of coke\nbreeze by 120% (for spillage).\n\n3.3 Multiply the volume of coke breeze by the coke breeze density to obtain the weight of coke\nbreeze required.\n\n## Saudi Aramco DeskTop Standards 77\n\nEngineering Encyclopedia Cathodic Protection\nDesigning Cathodic Protection Systems\n\n## Work Aid 3: Formulas and Procedures to Design Cathodic Protection\n\nSystems for Vessel & Tank Interiors\n\nThis Work Aid provides formulas and procedures to design galvanic and impressed current systems for the\ninterior of tanks and vessels.\n\nWork Aid 3A: Formulas and Procedure for the Design of Galvanic Anode Systems for\nVessel & Tank Interiors\nFormulas\n\n## Current Output of a Galvanic Anode in a Vessel or Tank\n\n1 1\nI = ED = ED\nRC R S + R LW + R V\nwhere -\nI = current output of the anode(s)\nED = anode driving potential\nRC = circuit resistance\nRS = structure-to-electrolyte resistance\nRLW = resistance of a single anode lead wire\nRV = the anode-to-electrolyte resistance of a single anode\n\n## Dwight Equation (for a single vertical anode)\n\n0.159\n1\n8L\nRV =\nl\nn\nL d\nwhere -\nRV = anode-to-electrolyte resistance of a single anode in ohms\n= electrolyte resistivity\nL = anode length in centimeters\nd = anode diameter in centimeters\n\n## Anode Life (galvanic anode)\n\nY W\nUF\nC I A\nwhere -\nY = life in years\nW = anode mass in kg\nUF = utilization factor\nC = actual consumption rate in kg/A-yr\nIA = anode current output in amperes\n\n## Saudi Aramco DeskTop Standards 78\n\nEngineering Encyclopedia Cathodic Protection\nDesigning Cathodic Protection Systems\n\nProcedure\n\n## 1.0 Calculate the current output per anode.\n\n1.1 If you have the manufacturers performance chart for the anode, locate the protected potential\nof the structure on the horizontal or X axis. Move vertically up the chart until you intersect\nthe curve for the water resistivity of interest. Move horizontally along the chart and read the\nvalue of the anodes current output on the vertical or Y axis. Go to Step 2.1.\n\nCAUTION: Performance charts are developed based on specific design parameters. You must be sure\nthat the performance chart you use was developed for your particular situation.\n\n1.2 If you do not have the manufacturers performance chart, obtain the following information:\ntotal current required to protect the tank or vessel\nelectrolyte resistivity\nanode material\nanode diameter and length (in centimeters)\nmaximum allowable circuit resistance\nstructure-to-electrolyte resistance\n\n1.3 Insert the anode dimensions and water resistivity into the Dwight Equation to\ncalculate the anode-to-electrolyte resistance.\n\n1.4 Add the structure-to-electrolyte resistance, anode lead wire resistance, and the anode-to-\nelectrolyte resistance from Step 1.3 to calculate the circuit resistance.\n\n1.5 Subtract the required potential of the structure from the solution potential of the galvanic\nanode to calculate the driving potential of the anode.\n\n1.6 Divide the driving potential from Step 1.5 by the circuit resistance from Step 1.4 to calculate\nthe current output of a single galvanic anode.\n\n## 2.0 Determine the number of galvanic anodes.\n\n2.1 Divide the total current required by the anode current output from Step 1.6 to calculate the\nnumber of anodes required. Round up to the nearest integer.\n\n## Saudi Aramco DeskTop Standards 79\n\nEngineering Encyclopedia Cathodic Protection\nDesigning Cathodic Protection Systems\n\n## 3.1 Obtain the following information:\n\nanode mass in kg\nanode utilization factor\nanode actual consumption rate\n\n3.2 Divide the product of the anode mass and utilization factor by the product of the anode\nconsumption rate and anode current output calculated in Step 1.6.\n\n## Saudi Aramco DeskTop Standards 80\n\nEngineering Encyclopedia Cathodic Protection\nDesigning Cathodic Protection Systems\n\nWork Aid 3B: Formulas and Procedure for the Design of Impressed Current Systems for\nVessel & Tank Interiors\n\nFormulas\n\n## Minimum Number of Anodes Based on Anode Maximum Current Density\n\nN = I/(dL x A)\n\nwhere -\nN = number of impressed current anodes\nI = total current required in milliamperes times 120%\nd = anode diameter in centimeters\nL = anode length in centimeters\nA = anode maximum current density in mA/cm2\n\n## Minimum Number of Anodes Based on Anode Consumption Rate\n\nY I C\nN=\nW\nwhere -\nN = number of impressed current anodes\nY = the impressed current system design life in years\nI = total current required in amperes times 120%\nC = anode consumption rate in kg/A-yr\nW = weight of a single anode\n\nCircuit Resistance\n\nR LW + R V\nR C = R RPL + + R S + R RNL\nN\nwhere -\nRC = the circuit resistance of the entire impressed current system\nRRPL = the resistance in the positive lead wire from the rectifier to the junction box\nN = the number of impressed current anodes\nRLW = anode lead wire resistance\nRV = the anode-to-electrolyte resistance of a single anode\nRS = structure-to-electrolyte resistance\nRRNL = the resistance in the negative lead wire from the structure to the rectifier\n\n## Saudi Aramco DeskTop Standards 81\n\nEngineering Encyclopedia Cathodic Protection\nDesigning Cathodic Protection Systems\n\n## Dwight Equation (for a single vertical anode)\n\n0.159\n1\n8L\nRV =\nl\nn\nL d\nwhere -\nRV = anode-to-electrolyte resistance of a single anode in ohms\n= electrolyte resistivity\nL = anode length in centimeters\nd = anode diameter in centimeters\n\nProcedure\n\n## 1.1 Obtain the following information:\n\ntotal current required to protect the tank or vessel\nanode material and dimensions\nmaximum current density of the anode\n\n1.2 Calculate the minimum number of anodes required by using the anode current density formula\nand anode consumption rate formula. Use the largest number of anodes calculated from the\ntwo formulas. Round up to the nearest integer.\n\n## 2.1 Obtain the following information:\n\nstructure-to-electrolyte resistance\nrectifier to junction box lead wire resistance\nresistance in the lead wire from the tank or vessel to the rectifier\nwater resistivity\nrectifier voltage and current output ratings\n2.2 Calculate the anode-to-electrolyte resistance of a single anode by inserting the anode\ndimensions and the water resistivity into the Dwight Equation.\n2.3 Divide the sum of the lead wire resistance and the anode-to-electrolyte resistance by the\nnumber of anodes calculated in Step 1.2. To this resistance, add the structure-to-electrolyte\nresistance and the resistances in the positive and negative lead wires of the rectifier. This will\ngive you the total circuit resistance of the impressed current system.\n2.4 Divide the rated voltage of the rectifier by its output current rating to calculate the maximum\nallowable circuit resistance. Ensure that the circuit resistance you calculated in Step 2.3 is less\nthan the maximum allowable circuit resistance.\n\n## Saudi Aramco DeskTop Standards 82\n\nEngineering Encyclopedia Cathodic Protection\nDesigning Cathodic Protection Systems\n\n## Work Aid 4: Formulas and Procedure to Design Cathodic Protection\n\nSystems for In-Plant Facilities\n\nThis Work Aid provides formulas and procedures to design impressed current systems to protect the bottom\nexterior of storage tanks using the earth potential shift formula.\n\nFormulas\n\n## For a single vertical anode\n\n0.5 I L2 + X 2 + L\nVx = ln\nL X\n\n## For a single horizontal anode\n\nI\nl n\n(0.5L )2 + X 2 + h 2 + 0.5L\nVx =\nL X 2 + h2\n\nwhere -\nVX = earth potential change at the tank center (volts)\nI = current flow (amperes)\n= soil resistivity (ohm-cm)\nL = anode backfill length (cm)\nX = horizontal distance from the anode to the center of the tank (cm)\nh = depth of burial to centerline of anode (cm)\n\n## Saudi Aramco DeskTop Standards 83\n\nEngineering Encyclopedia Cathodic Protection\nDesigning Cathodic Protection Systems\n\nProcedure\n\n## 1.0 Determine the number and location of impressed current anodes.\n\n1.1 Select the location of the anodes within one-quarter of the tank radius from the tank wall\naccording to Standard Drawing AA-036355.\n\n1.2 Add the distance between one anode and the tank to the tank radius to obtain the radius of the\n\n1.3 Divide the anode header cable length by 20 m to obtain the minimum number of anodes\nrequired.\n\n## 2.1 Obtain the following information:\n\naverage tank native potential\nsoil resistivity\nanode and anode backfill dimensions\ndistance between the anodes and tank center\n\n2.2 Substitute the soil resistivity, anode distance, anode backfill length, and required earth\npotential shift (0.35 volts according to Saudi Aramco Standards) into the earth potential shift\nformula for a single vertical anode and solve for the current I, required.\n\n2.3 Divide the current flow by the number of anodes to obtain the estimated current required from\neach anode.\n\n3.0 Calculate the current required to protect the tank based on surface area and required current density.\n\n## Saudi Aramco DeskTop Standards 84\n\nEngineering Encyclopedia Cathodic Protection\nDesigning Cathodic Protection Systems\n\n## Work Aid 5: Formulas and Procedures to Design Cathodic Protection\n\nSystems for Marine Structures\n\nThis Work Aid provides formulas and procedures to design galvanic anode and impressed current systems to\nprotect offshore platforms and submerged pipelines.\n\nWork Aid 5A: Data Base, Formulas, and Procedure for the Design of Galvanic Anode\nSystems for Marine Structures\n\nThis Work Aid provides requirements from Standard Drawing AA-036335, formulas, and a procedure for\ndetermining the number, circuit resistance, current output, and design life of galvanic anodes used to protect\nmarine platforms and pipelines.\n\nHALF SHELL ANODE BRACELET TYPE ANODE FOR PIPE SIZES 4\" THROUGH 60\"\n\n## Pipe Size Net Weight Nominal Weight\n\n10.2 cm (4\") NB 16 kg 24 kg\n15.2 cm (6\") NB 23 kg 31 kg\n20.3 cm (8\") NB 30 kg 39 kg\n25.4 cm (10\") NB 36 kg 46 kg\n30.5 cm (12\") NB 41 kg 51 kg\n35.6 cm (14\") OD 50 kg 61 kg\n40.6 cm (16\") OD 54 kg 66 kg\n45.7 cm (18\") OD 61 kg 74 kg\n50.8 cm (20\") OD 68 kg 82 kg\n55.9 cm (22\") OD 75 kg 89 kg\n61.0 cm (24\") OD 82 kg 96 kg\n66.0 cm (26\") OD 86 kg 109 kg\n71.1 cm (28\") OD 91 kg 116 kg\n76.2 cm (30\") OD 95 kg 120 kg\n81.3 cm (32\") OD 100 kg 127 kg\n86.4 cm (34\") OD 104 kg 132 kg\n91.4 cm (36\") OD 109 kg 138 kg\n106.7 cm (42\") OD 129 kg 161 kg\n116.8 cm (46\") OD 143 kg 177 kg\n121.9 cm (48\") OD 167 kg 184 kg\n132.1 cm (52\") OD 161 kg 204 kg\n152.4 cm (60\") OD 186 kg 230 kg\n\n## Saudi Aramco DeskTop Standards 85\n\nEngineering Encyclopedia Cathodic Protection\nDesigning Cathodic Protection Systems\n\nFormulas\n\n## Current Output of a Galvanic Anode\n\nIA = ED/RC\nwhere -\nIA = anode current output in amperes\nED = the anode driving potential in volts versus Ag-AgCl\nRC = the circuit resistance in ohms\n\n## Circuit Resistance of a Galvanic Anode\n\nRC = RS + RA = RA\nwhere -\nRC = Circuit resistance in ohms\nRS = the structure-to-electrolyte resistance (approximately zero)\nRA = the anode-to-electrolyte resistance\n\nDwight Equation\n0.159\n1\n8L\nRA = R V =\nl d\nn\nL\nwhere -\n= the electrolyte resistivity in ohm-cm\nL = the length of the anode in centimeters\nd = the diameter of the anode in centimeters or the circumference\ndivided by p for non-cylindrical shapes\n\n## Number of Galvanic Anodes Required\n\nN = I/IA\nwhere -\nN = the number of anodes\nI = the total current required to protect the structure\nIA = the current output of a single anode\n\nY = W UF\nC IA\nwhere -\nY = anode life in years\nW = anode mass in kg\nUF = Utilization factor\nC = actual consumption rate in kg/A-yr\nIA = current output of one anode in amperes\n\n## Saudi Aramco DeskTop Standards 86\n\nEngineering Encyclopedia Cathodic Protection\nDesigning Cathodic Protection Systems\n\nProcedure\n\n## 1.1 Obtain the following information:\n\nplatform surface area in seawater in m2\ncurrent density required in seawater in mA/m2\nplatform surface area below mud line in m2\ncurrent density required in mud in mA/m2\n\n1.2 To calculate the total current requirement, multiply the immersed surface area of the structure\nin seawater by Saudi Aramcos current density requirement. Multiply the surface area of the\nstructure below the mud line by Saudi Aramcos current density requirement. Add the two\ncurrent requirements together.\n\n## 2.1 Obtain the following information:\n\nanode solution potential in volts versus Ag-AgCl\nanode dimensions in centimeters\nanode weight in kg\nseawater resistivity in ohm-cm\nanode consumption rate in kg/A-yr\nanode utilization factor\ngalvanic anode design life in years\n\n2.2 If the anode is not cylindrical, determine its effective diameter by dividing its circumference\nby . Calculate the anode-to-electrolyte resistance of the anode by inserting its effective\ndiameter, length, and the electrolyte resistivity into the Dwight Equation.\n\n2.3 Subtract the required potential of the structure from the solution potential of the anode to\ncalculate the anode driving potential. Divide the anode driving potential by the anode-to-\nelectrolyte resistance from Step 2.2 to determine the current output of a single anode.\n\n2.4 Divide the total current required by the anode current output from Step 2.3 to calculate the\nnumber of anodes required. Round up to the nearest integer.\n\n## Saudi Aramco DeskTop Standards 87\n\nEngineering Encyclopedia Cathodic Protection\nDesigning Cathodic Protection Systems\n\n2.5 Insert the weight of a single anode, utilization factor, consumption rate, and current output\nfrom Step 2.3 into the Galvanic Anode Lifetime formula. Ensure that the anode life is greater\nthan the required design life. If the anode life is less than the required design life, multiply\nthe number of anodes from Step 2.4 by the ratio of the design lifetime and calculated lifetime.\nThe result is the proper number of anodes required for the design life of the cathodic\nprotection system.\n\n3.0 Calculate the number of galvanic anode bracelets for marine pipelines.\n\n## 3.1 Obtain the following information:\n\npipeline surface area in seawater in m2\npipeline length in meters\npipeline diameter in cm\nanode consumption rate in kg/A-yr\nanode utilization factor\nanode design life in years\n\n3.2 To calculate the pipelines current requirement, multiply its surface area by Saudi Aramcos\nrequired current density of 2.5 mA/m2.\n\n3.3 Divide the length of the pipeline by 150 meters to calculate the number of anode bracelets\nrequired.\n\n3.4 Divide the total current requirement by the number of anode bracelets to calculate the current\noutput per anode bracelet. Locate the net weight anode weight per bracelet in the table\nprovided in this Work Aid.\n\n3.5 Verify that the anode bracelet will last over the required design life. Substitute the anode\nconsumption rate, current output, utilization factor, and net weight of anode material into the\ngalvanic anode life formula and solve for Y.\n\n## Saudi Aramco DeskTop Standards 88\n\nEngineering Encyclopedia Cathodic Protection\nDesigning Cathodic Protection Systems\n\nWork Aid 5B: Formulas and Procedure for the Design of Impressed Current Systems for\nMarine Structures\nFormulas\n\n## ICorr = I(1 + (100% - %Efficiency)/100)\n\nwhere -\nICorr = corrected total current requirement for an impressed current system\nI = total current requirement (multiply total surface area by Saudi Aramcos current\ndensity requirement)\nEfficiency = efficiency of the impressed current anodes\n\n## Minimum Number of Anodes Based on Anode Maximum Current Density\n\nN = ICorr/(dL x A)\nwhere -\nN = number of impressed current anodes\nICorr = corrected total current requirement for an impressed current system in mA\nd = anode diameter in centimeters\nL = anode length in centimeters\nA = anode maximum current density in mA/cm2\n\nCircuit Resistance\n\nR V + R LW\nR C = R RPL + R RNL +\nN\nwhere -\nRC = the circuit resistance of the entire impressed current system\nRRPL = the resistance in the positive lead wire from the rectifier to the junction box\nRRNL = the resistance in the negative lead wire from the structure to the rectifier\nN = the number of impressed current anodes\nRV = the resistance of a single impressed current anode (Dwight Equation)\n\n## Saudi Aramco DeskTop Standards 89\n\nEngineering Encyclopedia Cathodic Protection\nDesigning Cathodic Protection Systems\n\nDwight Equation\n0.159\n1\n8L\nRA = R V =\nl d\nn\nL\nwhere -\nRA = The anode-to-electrolyte resistance\n= the electrolyte resistivity in ohm-cm\nL = the length of the anode in centimeters\nd = the diameter of the anode in centimeters or the circumference divided by for non-\ncylindrical shapes\n\nProcedure\n\n## 1.0 Calculate the corrected current requirement.\n\n1.1 Add the current required to protect any conductor pipe and unprotected pipelines to the current\nrequired to protect the structure.\n\n1.2 Use the Current Requirement for Impressed Current Systems formula to calculate the corrected\ncurrent requirement.\n\n## 2.1 Obtain the following information:\n\nanode dimensions in centimeters\nanode maximum current density\n\n2.2 Calculate the minimum number of anodes required by using the anode current density\nformula. Round up to the nearest integer.\n\n## 3.1 Obtain the following information:\n\nanode dimensions in centimeters\nseawater resistivity in ohm-cm\n\n## Saudi Aramco DeskTop Standards 90\n\nEngineering Encyclopedia Cathodic Protection\nDesigning Cathodic Protection Systems\n\n3.2 Calculate the anode-to-electrolyte resistance of a single anode by inserting the anode\ndimensions and the seawater resistivity into the Dwight Equation.\n\n3.3 Divide the sum of the lead wire resistance and the anode-to-electrolyte resistance by the\nnumber of anodes calculated in Step 2.2. To this resistance, add the resistances in the positive\nand negative lead wires of the rectifier. This will give you the total circuit resistance of the\nimpressed current system.\n\n3.4 To calculate the voltage requirement of the rectifier, multiply the corrected current by the\ncircuit resistance. Divide this result by the rectifier efficiency to determine the actual voltage\nrequirement.\n\n## Saudi Aramco DeskTop Standards 91\n\nEngineering Encyclopedia Cathodic Protection\nDesigning Cathodic Protection Systems\n\nGLOSSARY\n\nanode internal resistance The resistance from the anode to the outer edge of the backfill.\n\nanode-to-earth resistance The resistance between the anode, or backfill, and the soil.\n\n## backfill A low resistance, moisture-retaining material immediately surrounding a\n\nburied impressed current anode for the purpose of increasing the effective\narea of contact with the soil and thus reducing the resistance to earth.\nCalcined petroleum coke backfill is commonly used as backfill for deep and\nsurface anode beds in Saudi Aramco.\n\nconductor pipe Tubular members through which oil or gas wells are drilled and then through\nwhich casing and tubing are inserted and often grouted into place.\n\ncurrent density The direct current per unit are generally expressed as amperes per square\nmeter or milliamperes per square meter. Current density to achieve cathodic\nprotection varies depending on the environment and metal being protected.\n\ndeep anode bed A type of anode bed that uses a drilled vertical hole to contain\nimpressed current anodes.\n\ninsulated flange A flanged joint used to electrically isolate pipelines and systems. The flange\nfaces and securing bolts are electrically insulated from each other by\n\npolarization The change of potential of a metal surface resulting from the passage of\ncurrent to or from an electrolyte.\n\nprotective potential A term used in cathodic protection to define the minimum potential required\nto suppress corrosion. Protective potential depends on the structure metal\nand the environment.\n\nremote earth The area(s) in which the structure-to-earth potential change is negligible with\nchange in reference electrode position away from the structure.\n\n## Saudi Aramco DeskTop Standards 92\n\nEngineering Encyclopedia Cathodic Protection\nDesigning Cathodic Protection Systems\n\nshielding The act of preventing or diverting cathodic protection current from reaching a\nstructure. Shielding may be caused by a non-metallic barrier or by metallic\nstructures that surround the structure to be protected.\n\n## structure-to- electrolyte The potential difference between a buried or immersed metallic\n\npotential structure and the electrolyte surrounding it, measured with a\nreference electrode in contact with the electrolyte.\n\nsurface anode bed A type of anode bed that uses vertically or horizontally placed impressed\ncurrent or galvanic anodes.\n\nutilization factor The factor determined by the amount of anode material consumed when the\nanode can no longer deliver the current required.\n\n## Saudi Aramco DeskTop Standards 93\n\nEngineering Encyclopedia Cathodic Protection\nDesigning Cathodic Protection Systems\n\nAPPENDIX 1\n\n## SAES-B-068 Electrical Area Classification\n\nSAES-P-100 Basic Electrical Design Criteria\nSAES-P-107 Overhead Power Distribution (SCECO Standard)\nSAES-P-111 Grounding\nSAES-Q-001 Criteria for Design and Construction of Concrete Structures\nSAES-X-300 Cathodic Protection Marine Structures\nSAES-X-400 Cathodic Protection of Buried Pipelines\nSAES-X-500 Cathodic Protection Vessel and Tank Internals\nSAES-X-600 Cathodic Protection In-Plant Facilities\nSAES-X-700 Cathodic Protection of Onshore Well Casings\nGI 482.002 Commissioning Procedures for Cathodic Protection Installations\n\n## AB-036008 Lidan anode - Pile Mounted\n\nAA-036069 Galvanic Anodes at Thrust Anchors\nAA-036108 Offshore Negative Terminal Box\nAB-036272 Deep Anode Bed Steel Cased Hole\nAB-036274 Junction Box 5-Terminal\nAB-036275 Junction Box 12-Terminal\nAA-036276 Splice Box; Multi-Purpose Details\nAA-036277 Bond Box 5-Terminal\nAA-036278 Deep Anode Bed Scrap Steel\nAA-036280 Photovoltaic Power System\nAA-036304 Pile Mounted Anodes for Offshore\nAA-036335 Half Shell Bracelet Type Anode, for Pipe Sizes 4\" through 60\"\nAA-036336 Half Shell Bracelet Type Anode, for Pipe Sizes 26\" through 48\"\nAA-036346 Surface Anode Bed Details Horizontal and Vertical Anodes\nAA-036347 Junction Box 20-Terminal\nAA-036348 Anode Installation Details Galvanic and Impressed, Offshore Structures\nAA-036349 Bond Box 3-Terminal\nAA-036350 Bond Box 2-Terminal\nAA-036351 Marker Plate Details\n\n## Saudi Aramco DeskTop Standards 94\n\nEngineering Encyclopedia Cathodic Protection\nDesigning Cathodic Protection Systems\n\nAA-036352 Galvanic Anodes for Road and Camel P/L Crossings, P/L Repair Locations, Installations\nand Details\nAA-036353 Water Storage Tanks Impressed Current\nAA-036354 Water Storage Tanks Galvanic Anodes\nAA-036355 Tank Bottom Impressed Current Details\nAA-036356 Deep Anode Bed Details, Aquifer Penetrating\nAA-036378 Rectifier Installation Details\nAB-036381 Thermite Welding of Cables to Pipelines & Structures\nAA-036384 Junction Box, Offshore Anode\nAA-036385 Deep Anode Bed Details, Non-Aquifer Penetrating\nAA-036409 Replacement Galvanic Anodes for Offshore Structures & P/Ls\nAB-036478 Magnesium Anode Installation at P/L Repair Locations Layout & Details\nAC-036524 Galvanic Anode Details Submarine Pipelines\nAB-036540 Mounting Support Details for Junction Boxes\nAB-036558 Standard Insulating Assemblies for Ring Joint Flanges with Gask-O-Seal Filler Gaskets\nAA-036674 Bonding Methods for Onshore Pipelines and Flow Lines\nAA-036675 Direct Buried Electric D-C Cathodic Protection Positive or Negative Cable\nAA-036761 Lead Silver Anode Seabed Installation Details\nAC-036762 Crude and Product Tank Internal Galvanic Anode Installation\nAA-036782 Bond Box, 2-Terminal for Insulating Devices\nAE-036785 Symbols for Cathodic Protection\nAB-036787 Road Crossings Installation In Plant (Plastic Envelope)\nAB-036907 Test Stations For Buried Pipelines, Pipeline Kilometer Markers\n\n## 02-AMSS-008 Insulating Spools and Joints\n\n17-AMSS-004 Constant Voltage Rectifiers\n17-AMSS-005 Phase Controlled Rectifiers\n17-AMSS-006 Galvanic Anodes\n17-AMSS-007 Impressed Current Anodes\n17-AMSS-008 Cathodic Protection Junction Boxes\n17-AMSS-012 Photovoltaic Power Supply\n17-AMSS-017 Cathodic Protection Cables" ]
[ null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.8475086,"math_prob":0.93914264,"size":81395,"snap":"2019-51-2020-05","text_gpt3_token_len":19606,"char_repetition_ratio":0.21282451,"word_repetition_ratio":0.23085444,"special_character_ratio":0.22600897,"punctuation_ratio":0.08695362,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.96101457,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2019-12-11T09:30:00Z\",\"WARC-Record-ID\":\"<urn:uuid:ef7d26d1-30aa-48a4-ab8d-bf3f31d90845>\",\"Content-Length\":\"607493\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:3d55c0fc-7a22-4501-8b2e-9da66648a28e>\",\"WARC-Concurrent-To\":\"<urn:uuid:52be5258-98c1-4c1c-a746-4b86da3be2d9>\",\"WARC-IP-Address\":\"151.101.250.152\",\"WARC-Target-URI\":\"https://de.scribd.com/document/338645568/COE10703-Designing-Cathodic-Protection-Systems-pdf\",\"WARC-Payload-Digest\":\"sha1:UVGHMUBZ4HE7E6IWNGS42JUDGYLNAT7H\",\"WARC-Block-Digest\":\"sha1:67TMHGXUGI6C3NDETBHFKXDLEHXH6TJP\",\"WARC-Identified-Payload-Type\":\"application/xhtml+xml\",\"warc_filename\":\"/cc_download/warc_2019/CC-MAIN-2019-51/CC-MAIN-2019-51_segments_1575540530452.95_warc_CC-MAIN-20191211074417-20191211102417-00498.warc.gz\"}"}
https://artofproblemsolving.com/wiki/index.php?title=2021_AMC_10A_Problems/Problem_2&diff=cur&oldid=152470
[ "# Difference between revisions of \"2021 AMC 10A Problems/Problem 2\"\n\n## Problem\n\nPortia's high school has", null, "$3$ times as many students as Lara's high school. The two high schools have a total of", null, "$2600$ students. How many students does Portia's high school have?", null, "$\\textbf{(A)} ~600 \\qquad\\textbf{(B)} ~650 \\qquad\\textbf{(C)} ~1950 \\qquad\\textbf{(D)} ~2000\\qquad\\textbf{(E)} ~2050$\n\n## Solution 1 (Two Variables)\n\nThe following system of equations can be formed with", null, "$p$ representing the number of students in Portia's high school and", null, "$l$ representing the number of students in Lara's high school.", null, "$$p=3l$$", null, "$$p+l=2600$$ Substituting", null, "$p$ with", null, "$3l$ we get", null, "$4l=2600$. Solving for", null, "$l$, we get", null, "$l=650$. Since we need to find", null, "$p$ we multiply", null, "$650$ by 3 to get", null, "$p=1950$, which is", null, "$\\boxed{\\text{C}}$\n\n-happykeeper\n\n## Solution 2 (One Variable)\n\nSuppose Lara's high school has", null, "$x$ students, so Portia's high school has", null, "$3x$ students. We have", null, "$x+3x=2600,$ or", null, "$4x=2600.$ The answer is", null, "$$3x=2600\\cdot\\frac 34=650\\cdot3=\\boxed{\\textbf{(C)} ~1950}.$$\n\n~MRENTHUSIASM\n\n## Solution 3 (Arithmetic)\n\nClearly,", null, "$2600$ is", null, "$4$ times the number of students in Lara's high school. Therefore, Lara's high school has", null, "$2600\\div4=650$ students, and Portia's high school has", null, "$650\\cdot3=\\boxed{\\textbf{(C)} ~1950}$ students.\n\n~MRENTHUSIASM\n\n## Solution 4 (Answer Choices)\n\n### Solution 4.1 (Quick Inspection)\n\nThe number of students in Portia's high school must be a multiple of", null, "$3.$ This eliminates", null, "$\\textbf{(B)},\\textbf{(D)},$ and", null, "$\\textbf{(E)}.$ Since", null, "$\\textbf{(A)}$ is too small (as it is clear that", null, "$600+\\frac{600}{3}<2600$), we are left with", null, "$\\boxed{\\textbf{(C)} ~1950}.$\n\n~MRENTHUSIASM\n\n### Solution 4.2 (Plug in the Answer Choices)\n\nFor", null, "$\\textbf{(A)},$ we have", null, "$600+\\frac{600}{3}=800\\neq2600.$ So,", null, "$\\textbf{(A)}$ is incorrect.\n\nFor", null, "$\\textbf{(B)},$ we have", null, "$650+\\frac{650}{3}=866\\frac{2}{3}\\neq2600.$ So,", null, "$\\textbf{(B)}$ is incorrect.\n\nFor", null, "$\\textbf{(C)},$ we have", null, "$1950+\\frac{1950}{3}=2600.$ So,", null, "$\\boxed{\\textbf{(C)} ~1950}$ is correct.\n\nFor completeness, we will check answer choices", null, "$\\textbf{(D)}$ and", null, "$\\textbf{(E)}:$\n\nFor", null, "$\\textbf{(D)},$ we have", null, "$2000+\\frac{2000}{3}=2666\\frac{2}{3}\\neq2600.$ So,", null, "$\\textbf{(D)}$ is incorrect.\n\nFor", null, "$\\textbf{(E)},$ we have", null, "$2050+\\frac{2050}{3}=2733\\frac{1}{3}\\neq2600.$ So,", null, "$\\textbf{(E)}$ is incorrect.\n\n~MRENTHUSIASM\n\n## Video Solution 1 (Very Fast & Simple)\n\n~ Education, the Study of Everything\n\n## Video Solution 2 (Setting Variables)\n\nhttps://youtu.be/qNf6SiIpIsk?t=119 ~ThePuzzlr\n\n## Video Solution 3 (Solving by Equation)\n\nhttps://www.youtube.com/watch?v=aOpgeMfvUpE&list=PLexHyfQ8DMuKqltG3cHT7Di4jhVl6L4YJ&index=1 ~North America Math Contest Go Go Go\n\n- pi_is_3.14\n\n~savannahsolver\n\n~IceMatrix\n\n~MathWithPi\n\n## See Also\n\n 2021 AMC 10A (Problems • Answer Key • Resources) Preceded byProblem 1 Followed byProblem 3 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 All AMC 10 Problems and Solutions\n\nThe problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions.", null, "Invalid username\nLogin to AoPS" ]
[ null, "https://latex.artofproblemsolving.com/7/c/d/7cde695f2e4542fd01f860a89189f47a27143b66.png ", null, "https://latex.artofproblemsolving.com/5/9/2/592c1d4eacb3ec769d6ac9542733c10632610d91.png ", null, "https://latex.artofproblemsolving.com/8/8/9/889914608a80f5ba7125667dde3bfbf29ec8465b.png ", null, "https://latex.artofproblemsolving.com/3/6/f/36f73fc1312ee0349b3f3a0f3bd9eb5504339011.png ", null, "https://latex.artofproblemsolving.com/9/b/2/9b25f8e64b484493fda944d25cad453423041fe6.png ", null, "https://latex.artofproblemsolving.com/8/c/2/8c2224957ef77b34e819f72306e49697a7add896.png ", null, "https://latex.artofproblemsolving.com/7/6/c/76ca5c7bf28e15fd26b38ca7a83517cc5dafd198.png ", null, "https://latex.artofproblemsolving.com/3/6/f/36f73fc1312ee0349b3f3a0f3bd9eb5504339011.png ", null, "https://latex.artofproblemsolving.com/a/f/5/af57acfc26978b74b5963281e2f5d429c603ec6f.png ", null, "https://latex.artofproblemsolving.com/4/1/a/41a0fb451822fa5eb2485e2390c6fe48a3995367.png ", null, "https://latex.artofproblemsolving.com/9/b/2/9b25f8e64b484493fda944d25cad453423041fe6.png ", null, "https://latex.artofproblemsolving.com/3/4/d/34dda92cfded6bf774dca50cc7dfd335ff14ac81.png ", null, "https://latex.artofproblemsolving.com/3/6/f/36f73fc1312ee0349b3f3a0f3bd9eb5504339011.png ", null, "https://latex.artofproblemsolving.com/1/2/0/12060badf8be82c1d7ae05f240e571d68f73ddfa.png ", null, "https://latex.artofproblemsolving.com/0/d/a/0daac625561034d18f4bc8b117594c8f8b7d029d.png ", null, "https://latex.artofproblemsolving.com/8/2/b/82b317654f901a9c8f56585721a617396d3b050c.png ", null, "https://latex.artofproblemsolving.com/2/6/e/26eeb5258ca5099acf8fe96b2a1049c48c89a5e6.png ", null, "https://latex.artofproblemsolving.com/7/0/e/70e634348f8df9eaeac4ced35db64d08a906532e.png ", null, "https://latex.artofproblemsolving.com/f/2/b/f2b17f0e825eb38388061086330fa3b4cb60fed3.png ", null, "https://latex.artofproblemsolving.com/7/c/0/7c0dd638ef39ea978ccedb3adbe7735d89c66264.png ", null, "https://latex.artofproblemsolving.com/5/2/7/52729c61ad5ca8860187c085e632e263b615531b.png ", null, "https://latex.artofproblemsolving.com/5/9/2/592c1d4eacb3ec769d6ac9542733c10632610d91.png ", null, "https://latex.artofproblemsolving.com/c/7/c/c7cab1a05e1e0c1d51a6a219d96577a16b7abf9d.png ", null, "https://latex.artofproblemsolving.com/8/c/1/8c1ec159e1633a486adc4411b15fe0dee478cd86.png ", null, "https://latex.artofproblemsolving.com/b/1/6/b1605a89cd360dc0c15faf3c366085d28b9dfc8b.png ", null, "https://latex.artofproblemsolving.com/9/3/0/93032f1ab8b685d84a767a2fde0d9006a464b5e4.png ", null, "https://latex.artofproblemsolving.com/d/b/3/db3d47a1e5ac7ba055b88723e7e6c7db2e72bb24.png ", null, "https://latex.artofproblemsolving.com/5/7/2/5729ea372cb53da5f2596d6f802dbd34914d4322.png ", null, "https://latex.artofproblemsolving.com/a/4/6/a46f6af01fcf3bb5f6cac2316bc4de9bb3906bec.png ", null, "https://latex.artofproblemsolving.com/2/1/3/21384c6df99d7db936d94d0f2014f6718650159c.png ", null, "https://latex.artofproblemsolving.com/3/7/9/3793240d4ccd62821fc9f0f420182088b415dc97.png ", null, "https://latex.artofproblemsolving.com/c/b/3/cb3db983b534373488fba3fdfaf7b692194bb301.png ", null, "https://latex.artofproblemsolving.com/1/b/4/1b46344f947595ce8f3729b0fc25ac83a2a993c2.png ", null, "https://latex.artofproblemsolving.com/a/4/6/a46f6af01fcf3bb5f6cac2316bc4de9bb3906bec.png ", null, "https://latex.artofproblemsolving.com/a/5/d/a5d19752c57bc1e73b61c9b9940635a708e80943.png ", null, "https://latex.artofproblemsolving.com/c/2/0/c207d53a84eea4b01a0de9036a448ab18e77523a.png ", null, "https://latex.artofproblemsolving.com/b/7/1/b7193f66028e13f331d53ff5e6942c4b05587465.png ", null, "https://latex.artofproblemsolving.com/3/e/0/3e0177d15168f7b1af172ddb1ebd4ae8d56b1aea.png ", null, "https://latex.artofproblemsolving.com/7/b/5/7b583493d14662fc3b8962fe775144b5629f3b6a.png ", null, "https://latex.artofproblemsolving.com/1/2/7/1275a96c34a834c443017b09a196d9e5e43e73ad.png ", null, "https://latex.artofproblemsolving.com/b/3/0/b305929a95b53f14a0ad53eba1d8560626e1f28b.png ", null, "https://latex.artofproblemsolving.com/4/e/e/4eef08d75ba5c901ddd7d94d0f68108144784222.png ", null, "https://latex.artofproblemsolving.com/2/d/6/2d6d83615701ee2c7146b42a9ddaec6d734aca3b.png ", null, "https://latex.artofproblemsolving.com/f/d/e/fdea85f61f1b90ac74de216a95ecad4bc4269274.png ", null, "https://latex.artofproblemsolving.com/b/3/0/b305929a95b53f14a0ad53eba1d8560626e1f28b.png ", null, "https://latex.artofproblemsolving.com/7/a/e/7ae69570c458db7421453f5388296ee0a31fb370.png ", null, "https://latex.artofproblemsolving.com/2/4/c/24cf8646e6c72faafe05376d3646127facd27e89.png ", null, "https://latex.artofproblemsolving.com/7/5/e/75e41e3cd48cee2c6866cfbb4386a8e99d3482f5.png ", null, "https://wiki-images.artofproblemsolving.com//8/8b/AMC_logo.png", null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.7015943,"math_prob":0.99904335,"size":5060,"snap":"2021-21-2021-25","text_gpt3_token_len":1657,"char_repetition_ratio":0.17662184,"word_repetition_ratio":0.24038461,"special_character_ratio":0.30691698,"punctuation_ratio":0.10022779,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.99950016,"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,63,64,65,66,67,68,69,70,71,72,73,74,75,76,77,78,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,98],"im_url_duplicate_count":[null,null,null,null,null,7,null,null,null,null,null,4,null,4,null,null,null,4,null,4,null,null,null,4,null,null,null,null,null,4,null,null,null,null,null,null,null,6,null,6,null,4,null,null,null,null,null,6,null,6,null,null,null,8,null,null,null,null,null,4,null,6,null,null,null,4,null,null,null,10,null,4,null,null,null,10,null,4,null,4,null,null,null,2,null,null,null,4,null,null,null,null,null,4,null,null,null,null,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2021-06-20T06:54:18Z\",\"WARC-Record-ID\":\"<urn:uuid:4d99bb09-4014-4933-8080-3d8627eb315b>\",\"Content-Length\":\"65392\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:c7b3d6e0-023c-4609-8550-b936bb514e26>\",\"WARC-Concurrent-To\":\"<urn:uuid:3a4d27df-af0c-4ae4-b5c8-1fefa18be3dc>\",\"WARC-IP-Address\":\"104.26.10.229\",\"WARC-Target-URI\":\"https://artofproblemsolving.com/wiki/index.php?title=2021_AMC_10A_Problems/Problem_2&diff=cur&oldid=152470\",\"WARC-Payload-Digest\":\"sha1:GP4VASBND3HO4SS5EK645CLNQDBZMN7Q\",\"WARC-Block-Digest\":\"sha1:2GKR7GVBFAFWJLLFP74GDTDKRTMQL6TD\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2021/CC-MAIN-2021-25/CC-MAIN-2021-25_segments_1623487658814.62_warc_CC-MAIN-20210620054240-20210620084240-00094.warc.gz\"}"}
https://www.lcaoutreach.org/habitability-of-planets-2/sidebar-integrating-the-planck-equation-over-a-selected-waveband/
[ "# Sidebar. Integrating the Planck equation over a selected waveband\n\nSidebar. Integrating the Planck equation over a selected waveband.\n\nStars act essentially as blackbodies, in the distribution of their electromagnetic radiation into various wavelengths. So do most parts of planetary surfaces – soils, rocks, vegetation (if any), inhabitants (if any). It’s important to know how much energy goes into different wavebands:\n\n• For sunlight / starlight to drive photosynthesis by organisms that are the primary producers, that is, the organisms that capture energy usable by all other organisms by making high-energy compounds such as sugars:\n• Only a certain range of wavelengths is usable by these organisms. On Earth the dominant green plants use radiation with wavelengths in the range from 400 nanometers (nm) to 700 nm. Some bacteria can use light down as far as 850 nm. There are very strong reasons from the photophysics of molecules for this restriction, as noted in the text in the discussion of the wonder molecule, chlorophyll. Longer wavelengths don’t have enough energy content per photon to move electrons among molecules. Shorter wavelengths in the ultraviolet can be damaging to DNA; plants synthesize flavonoids and other protectants.\n• So, we want to calculate what fraction of the star’s energy at the planet is in the good photosynthetically active region. Really, it’s the number of photons or the photon flux density, which I explain shortly.\n• We also want to calculate the flux density of photons in the damaging UV region. Together with the knowledge of the UV-shielding compounds in the planet’s atmosphere, we can estimate a safety margin.\n• For thermal infrared radiation, TIR, which is the means by which the planet surface (and all the organisms on it) gets rid of absorbed energy to balance the energy budget:\n• There is a total radiant energy emitted, with a flux density proportional to the fourth power of the absolute temperature, I = σT4, and more accurately with an emissivity factor less than 1.0, εσT4. Often, the emissivity is very close to 1.0 so we can just apply a total factor – say, ε = 0.96 for most stuff on Earth, including our own skin.\n• Sometimes the distribution among wavebands within the TIR is important. This is critical in calculating the greenhouse effect because the greenhouse gases in the atmosphere all absorb in fairly narrow but important bands. Knowing the emissivities in various TIR bands can also be important in usingTIR fluxes measured remotely to infer the surface temperature accurately. This is readily done on Earth, less so on Mars.\n\nFor energy balance, it’s the energy in a waveband that can be absorbed that counts – photons are “weighted” in significance by their energy content, proportional to their frequency or the inverse of their wavelength. A photon of blue light at, say, 440 nm, has 50% more energy than a photon of red light at 660 nm. For photosynthesis, all absorbed photons count the same. A photon of blue light creates an electronically excited state of chlorophyll that within a picosecond or so relaxes to another excited state of lower energy, the same state created by absorbing a photon of red light. Thus, in photosynthesis, it’s the number of photons, not their energy content, that counts. The common measure of radiation for studies of photosynthesis is the photosynthetic photon flux density, or PPFD, quoted in (micro) moles of photons (Avogadro’s number of photons) per square meter per second. For other biophysical reactions such as skin tanning or reddening or mutagenesis for skin cancer or similar effects in plants, the case is similar – the number counts within each narrow waveband, with one or more wavebands for each target molecule in us or other organisms, such as DNA or flavonoid protectants that can be overwhelmed.\n\nWe may examine two cases – radiation from the Sun reaching the Earth, and radiation for the much cooler star, Proxima Centauri, our nearest neighbor star, reaching its planet b, or Proxima Centauri b (PCb). This small planet was discovered in 2016 and touted as possibly habitable because the final intensity of radiation at its surface is not too far off what the intensity of solar energy is on Earth.\n\nWe may calculate (1) the total energy flux density and (2) the flux density as number of photons per area per second, in the\n\n• UV waveband, especially UVC at 200-280 nanometers (nm), to evaluate the threat to organisms;\n• visible waveband, 400-700 nm, which is also the main waveband for photosynthesis on Earth; there is also an extension to 850 nm for minor photosynthesizers, some bacteria; and\n• selected thermal infrared wavebands where greenhouse gases absorb to trap outgoing thermal infrared radiation, thus keeping our planet warm.\n\nWe need the expression for the number of photons coming off the surface of the star’s surface.\n\n• If you wish to skip to the results, they’re at the very end here.\n\nThat law, for a blackbody such as a star approximates well, was discovered by Max Planck. There’s a lot of physics behind the expression for the number of photons per area per solid angle that a blackbody emits, within a small range of wavelengths. It inherently involves the nature of light as quantized into the discrete particles, the photons, where at a given wavelength of radiation all photons have the same discrete amount of energy, (“aitch new”) = hc/ λ. Here, h is the universal Planck’s constant, discovered, of course, by Max Planck, ν is the frequency of the light, c is the speed of light, and λ is the wavelength of light. Planck derived an expression that fit observations for the energy emitted per area per solid angle within the range of wavelengths from λ to λ+dλ. Here, is a small increment in wavelength:", null, "If you haven’t had calculus, this formula might not mean too much to you. Here, T is, of course, the absolute temperature as discussed earlier. Basically, L(λ) is the increment in energy flow from considering a small range of wavelength, . There are several universal physical constants, h, which is Planck’s constant (connected to the finding that all energy is quantized!), c, the velocity of light, and k, Boltzmann’s constant (connected to how temperature is related to energy). These all have fascinating stories of their own, which I won’t go into here. In any case, you can see that a hot star such as our Sun puts out much more energy per area than a cool star such as Proxima Centauri; the total energy output is proportional to the area under the curve for each star.\n\nWe can also express the rate in terms of the energy emitted in a range of frequencies between ν and ν+dν,", null, "For computing rates of photosynthesis (or for DNA damage from UV wavebands) we really want the number of photons, not the amount of energy. Bacteria or plants do photosynthesis with each photochemical reaction driven by a photon, irrespective of its energy as long as that energy is above a minimum (not strictly true, given different degrees of absorption at different wavelengths, but this is a start). The rate expressed in number of photons is this last equation divided by the energy of a photon,", null, "and, back to wavelength terms,", null, "If we count all photons emitted, over all frequencies (all wavelengths, all energies), we get two expressions familiar in physics. The total amount of energy emitted is", null, "The factor in front of T4 is the Stefan-Boltzmann constant, 5.67×10-8 W m-2K-4. The total number of photons emitted is", null, "Here, ζ(3) is a mathematical constant, the Riemann zeta function of 3, with a value of about 1.202 as a simple (pure) number.\n\nLet’s focus on the photon count, not the energy, for those three wavebands. We need to integrate the expression for LP(λ) over the range of wavelengths for each case. There are two basic ways to do this. The first is numerical: Divide the waveband into equal small parts – e.g., 400-410 nm, 410-420 nm, and so on – calculate LP in each small part, add them up, and multiply by the interval Δλ. This is clearly an approximation and it works well only if the interval is short enough that LP(λ) is not changing fast within the interval. It’s easy to program in any language (Python, Fortran, …) or Microsoft Excel. I have two versions of the latter, currently set up to isolate the UV, PPFD (= the visible waveband, also), and infrared. The second version uses finer steps at short wavelengths.\n\nThe second route is analytical, using exact mathematical forms derived with integral calculus. The formulas are infinite series, that is, expressions with an infinite number of terms, but the terms converge to a very accurate answer so that only a moderate number is needed. This calculation is presented nicely on one website put up by a commercial corporation, GATS, Inc., of Newport News, VA. They start by converting from wavelength to a new variable, called wavenumber, the number of wavelengths in a meter, 1/λ, given the symbol σ (not the same as the Stefan-Boltzmann constant!). They actually use σ in older units of wavelengths per cm, not per m, but I’ll stay really metric here (really “SI”).\n\nWe want to do the integration (this is calculus) over all wavenumbers from a minimum value of σ, which is 1/(850 nm) = 1/(8.5×10-7 m) = 1.176×106 m-1, to infinity. Well, that’s too far, but the number of photons of very high energy (very high wavenumber, very short wavelength) is so small that doing the integral to infinity makes very little difference. After all, we are making a guess about the lower limit that bacteria can use, anyway. The math is shown nicely one of the company’s deeper webpages. The result is", null, "Here, they defined a new variable of integration, x=100 hcσ/(kT). We can do this sum readily because only the first several terms are big enough to matter.\n\nThe results\n\nThe fluxes reported here in the 3 shortwave radiation bands are, first, in photons per square meter per second at the surface of the star. The next line converts that to moles of photons, with a mole being Avogadro’s number of them, just as for molecules expressed as moles. The line after that is again in moles but projected to the distance of the planet. For this we use the law that the intensity (flux density) falls off as 1/r2 – that is the flux density at the planet is lower than that at the star’s surface by the factor (rstar/rorbit)2. Here, rstar is the radius of the star and rorbit is the radius of the planet’s orbit around the star, taken as closely circular.", null, "There are notable comparisons.\n\n• The UV flux at Proxima Centauri b is trivially low, only 1% as high as on Earth; a cool star has a tiny fraction of its output at short wavelengths. You would not get sunburned there. You would only get fried by stellar flares and the stellar wind, which also have taken away the atmosphere. Any remanent atmosphere would also condense on the permanently cold side of the tidally-locked planet.\n• A 10% increase in stellar temperature from that of the Sun doubles the UV flux (this calculation is approximate). Hot stars are anathema for life, for this as well as for short lifetimes for evolution to occur.\n• The visible light on PCb is 1/5th as strong as on Earth, while the 10% hotter star at the same distance from Earth as our Sun is give 52% more visible light. Wear sunglasses, though not as dense as the peril-sensitive glasses in The Hitchhiker’s Guide to the Galaxy.\n• If we allow that photosynthetic organisms might use starlight to the longest wavelengths that Earth’s organisms do, then PCb catches up somewhat, getting about ½ as much useful flux density as we do on Earth. On Earth the organisms using the range 700-850 nm are in minor niches, shaded out in general by green plants.\n• Going to integration over all wavelengths to get total energy interception, we wee that PCb is not terribly cold, better than Mars (see also the main text about planetary temperatures). a 10% hotter star, alas, would cook us if the Earth were to absorb the same 71% fraction of stellar energy as it does now.\n\nI repeat here a figure from the main text, showing where the energy lies for the 3 stars. Note that the plots are all relative to the peak in the energy. The peak energy for Proxima Centauri is only 5% that for our Sun, and our Sun has a peak that’s only 60% that of the star that’s 10% hotter. If we draw the figure on the absolute energy scale, Proxima Centauri almost gets “lost in the noise.” That’s the second figure, below." ]
[ null, "https://www.lcaoutreach.org/wp-content/uploads/2021/02/word-image-30.png", null, "https://www.lcaoutreach.org/wp-content/uploads/2021/02/word-image-31.png", null, "https://www.lcaoutreach.org/wp-content/uploads/2021/02/word-image-33.png", null, "https://www.lcaoutreach.org/wp-content/uploads/2021/02/word-image-35.png", null, "https://www.lcaoutreach.org/wp-content/uploads/2021/02/word-image-37.png", null, "https://www.lcaoutreach.org/wp-content/uploads/2021/02/word-image-38.png", null, "https://www.lcaoutreach.org/wp-content/uploads/2021/02/word-image-39.png", null, "https://www.lcaoutreach.org/wp-content/uploads/2021/02/word-image-17.jpeg", null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.93172663,"math_prob":0.97110635,"size":12371,"snap":"2022-27-2022-33","text_gpt3_token_len":2779,"char_repetition_ratio":0.13293442,"word_repetition_ratio":0.008438818,"special_character_ratio":0.2185757,"punctuation_ratio":0.10851761,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9705471,"pos_list":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16],"im_url_duplicate_count":[null,2,null,2,null,2,null,2,null,2,null,2,null,2,null,2,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2022-08-17T22:33:09Z\",\"WARC-Record-ID\":\"<urn:uuid:c9b08023-3cee-42cf-86f1-6d5bbccc8f24>\",\"Content-Length\":\"59384\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:b91a0150-d289-440d-ab7f-d197dee8255c>\",\"WARC-Concurrent-To\":\"<urn:uuid:06236444-630c-4cdf-8613-4ad6276ae733>\",\"WARC-IP-Address\":\"67.205.13.137\",\"WARC-Target-URI\":\"https://www.lcaoutreach.org/habitability-of-planets-2/sidebar-integrating-the-planck-equation-over-a-selected-waveband/\",\"WARC-Payload-Digest\":\"sha1:IE62IOE3EKXKMK5NFWPS6OSJEX4VBPYE\",\"WARC-Block-Digest\":\"sha1:RTNDG5WHJXEBH4X6BCYQUQM23XE2TK7E\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2022/CC-MAIN-2022-33/CC-MAIN-2022-33_segments_1659882573118.26_warc_CC-MAIN-20220817213446-20220818003446-00580.warc.gz\"}"}
https://prepwiz.in/resource/Daily-Quiz/thursday-20-apr-23
[ "Please write your answer along with a few lines of reasoning as a comment below within the next 1 hour:\n\nIf f(x+y) = f(x)f(y) and f(6) = 4, then f(9) + f(-3) is equal to\n\n##### Nancy verma - Apr 20, 2023\n\nf(3+3)=4=f(3)^2\n\nf(3)=2,-2\n\nNow, for f(-3)=0.5,-0.5\n\nf(9)=f(6)f(3)=4*2=8 or -8\n\nf(9)+f(-3)=8.5,-8.5\n\n##### Ayushi verma - Apr 20, 2023\n\nf(6)= 4, f(3+3)=4, f(3)²=4, f(3)=±2\n\nSimilarly f(-3)=±0.5\n\nSo, f(9)+f(-3)= ±8.5" ]
[ null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.8479865,"math_prob":0.9999572,"size":638,"snap":"2023-40-2023-50","text_gpt3_token_len":335,"char_repetition_ratio":0.11829653,"word_repetition_ratio":0.13821138,"special_character_ratio":0.5626959,"punctuation_ratio":0.13366337,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.99975854,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2023-11-30T08:22:40Z\",\"WARC-Record-ID\":\"<urn:uuid:a836481d-7d76-4033-a08e-1e7a1f5443de>\",\"Content-Length\":\"40089\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:60998aff-114e-4d7d-bbb4-3de9f28832e7>\",\"WARC-Concurrent-To\":\"<urn:uuid:dda0980e-64e6-4a64-918b-7946f8fd4571>\",\"WARC-IP-Address\":\"3.108.91.190\",\"WARC-Target-URI\":\"https://prepwiz.in/resource/Daily-Quiz/thursday-20-apr-23\",\"WARC-Payload-Digest\":\"sha1:BZQXJYD62ZLJ54NDJ5PEVD2RHVZ5BZFG\",\"WARC-Block-Digest\":\"sha1:PKNKBCG65JB7VTEASV33TMWYDKWRWVWX\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2023/CC-MAIN-2023-50/CC-MAIN-2023-50_segments_1700679100172.28_warc_CC-MAIN-20231130062948-20231130092948-00335.warc.gz\"}"}
https://futureboy.us/fsp/colorize.fsp?f=XtotheXbetter.frink
[ "# XtotheXbetter.frink\n\n``` // More detailed example of graphing x^x nmin = -300 nmax = 180 denom = 101 g = new graphics g.line[nmin/denom,0,nmax/denom,0]  // Draw x axis g.line[0,-3,0,2]                   // Draw y axis // Draw negative section with points for n=nmin to 0 {    x = n/denom    if (n mod 2 == 0)       g.color[0,1,0]            // Draw green for even numerator    else       g.color[1,0,0]            // Draw red for odd numerator        g.fillRectCenter[x,-x^x,1/100,1/100] } // Draw positive section with continuous line line = new polyline for n = 0 to nmax {    x = n/denom    line.addPoint[x,-x^x] } g.color[0,0,1] g.add[line] g.show[] //g.write[\"xbetter.svg\",400,400] ```" ]
[ null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.554227,"math_prob":0.972337,"size":909,"snap":"2023-40-2023-50","text_gpt3_token_len":303,"char_repetition_ratio":0.10828729,"word_repetition_ratio":0.057142857,"special_character_ratio":0.32893288,"punctuation_ratio":0.17535545,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9913034,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2023-09-26T23:07:46Z\",\"WARC-Record-ID\":\"<urn:uuid:17ebce96-974f-4a0a-9c07-850340713304>\",\"Content-Length\":\"4179\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:d5a37d95-f509-4a6a-af73-d6c38ac0da9a>\",\"WARC-Concurrent-To\":\"<urn:uuid:f483d1f0-0b64-4887-8983-473b106e87ea>\",\"WARC-IP-Address\":\"184.96.140.167\",\"WARC-Target-URI\":\"https://futureboy.us/fsp/colorize.fsp?f=XtotheXbetter.frink\",\"WARC-Payload-Digest\":\"sha1:RGU3OC6QI27RSHJ5ZINRNC2J6SEZ5KX5\",\"WARC-Block-Digest\":\"sha1:S3UGMYBCARXYBVMBKJFDSS3M6JE26ARR\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2023/CC-MAIN-2023-40/CC-MAIN-2023-40_segments_1695233510225.44_warc_CC-MAIN-20230926211344-20230927001344-00002.warc.gz\"}"}
http://psbrno.info/force-worksheets-for-2nd-grade/motion-and-speed-worksheet-choice-image-for-kids-maths-force-energy-force-worksheets-for-2nd-grade-force-worksheet-2nd-grade-grade/
[ "# Motion And Speed Worksheet Choice Image For Kids Maths Force Energy Force Worksheets For 2nd Grade Force Worksheet 2nd Grade Grade", null, "motion and speed worksheet choice image for kids maths force energy force worksheets for 2nd grade force worksheet 2nd grade grade.\n\nworksheet for second grade reading force and motion worksheets 2nd magnetic pdf,physical science motion and forces worksheet bridge force worksheets 2nd grade pdf magnetic,similar images for push and pull forces worksheets grade library magnetic force worksheet 2nd motion pdf,force and motion worksheets 2nd grade pdf worksheet science natural resources third magnetic,force worksheet 2nd grade magnetic forces and motion activity sheet worksheets for all download free pdf,force worksheet 2nd grade and motion worksheets pdf magnet for magnetic,magnetic force worksheet 2nd grade second spelling words list week and motion worksheets pdf,force worksheet 2nd grade free and motion worksheets for magnetic pdf,force worksheet 2nd grade worksheets for forces and motion magnetic pdf,force and motion worksheets 2nd grade pdf magnetic worksheet free." ]
[ null, "http://psbrno.info/wp-content/uploads/2019/05/motion-and-speed-worksheet-choice-image-for-kids-maths-force-energy-force-worksheets-for-2nd-grade-force-worksheet-2nd-grade-grade.jpg", null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.8263197,"math_prob":0.94293725,"size":980,"snap":"2019-13-2019-22","text_gpt3_token_len":183,"char_repetition_ratio":0.3043033,"word_repetition_ratio":0.044444446,"special_character_ratio":0.16428572,"punctuation_ratio":0.06918239,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.99413896,"pos_list":[0,1,2],"im_url_duplicate_count":[null,1,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2019-05-20T15:51:11Z\",\"WARC-Record-ID\":\"<urn:uuid:71ff5c07-0ae3-430e-881d-8ea262e8fee3>\",\"Content-Length\":\"64278\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:6aa8b485-bf07-477e-a97d-e97397118f48>\",\"WARC-Concurrent-To\":\"<urn:uuid:a6dda17d-3205-43fb-8e8b-69f4d8da369b>\",\"WARC-IP-Address\":\"104.27.146.254\",\"WARC-Target-URI\":\"http://psbrno.info/force-worksheets-for-2nd-grade/motion-and-speed-worksheet-choice-image-for-kids-maths-force-energy-force-worksheets-for-2nd-grade-force-worksheet-2nd-grade-grade/\",\"WARC-Payload-Digest\":\"sha1:KUZMBADJ4R7T3Y745G3NLGWWBUHI5W7F\",\"WARC-Block-Digest\":\"sha1:6VLAQG7F2LFHCUGHKJE6KFU22WDLTNSI\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2019/CC-MAIN-2019-22/CC-MAIN-2019-22_segments_1558232256040.41_warc_CC-MAIN-20190520142005-20190520164005-00345.warc.gz\"}"}
https://www.jiskha.com/questions/292980/a-1kg-block-is-executing-simple-harmonic-motion-of-amplitude-0-1m-on-a-smooth-horizontal
[ "# PHYSICS\n\na 1kg block is executing simple harmonic motion of amplitude 0.1m on a smooth horizontal surface under the restoring force of a spring of spring constant 100N/M.A block of mass 3kg is gently placed on it at the instant it passes through the mean position .Assuming that the two blocks move togther,find the frequency and the amplitude of the motion?\n\n1. 👍 1\n2. 👎 0\n3. 👁 309\n1. Before the 3 kg weight was added, the period was\nP = 2 pi sqrt(m/k) = 0.628 s.\n\nWhen you add 3 km, the total mass is quadrupled and the period is increased by a facgtor of sqrt4 = 2. The new period is\n\nP = 1.257 s.\n\nThe new frequency is 1/P = 0.796 Hz\n\nWith the mass added at the equilibrium position, the velocity instantly drops by a factor of 4 to preserve linerar momentum. The total kinetic energy at that point is then reduced by a factor (4/1)*(1/4)^2 = 1/4\n\nWith the new reduced total energy, the pair of blocks can only have an amplitude sqrt (1/4) = 1/2 as large as before.\n\n1. 👍 0\n2. 👎 0\n\n## Similar Questions\n\n1. ### physics\n\nAn object with mass 3.0 kg is attached to a spring with spring stiffness constant k = 300 N/m and is executing simple harmonic motion. When the object is 0.020 m from its equilibrium position, it is moving with a speed of 0.55\n\nasked by Nicole on March 7, 2012\n2. ### physics\n\nA 0.20 kg object, attached to a spring with spring constant k = 10 N/m, is moving on a horizontal frictionless surface in simple harmonic motion of amplitude of 0.080 m. What is its speed at the instant when its displacement is\n\nasked by Anonymous on July 31, 2011\n3. ### college physics\n\nThree blocks of mass 1kg,2kg and 3kg move on a frictionless surface and a horizontal force 46 N acts on the 3kg block.1kg and 2kg blocks are in contact with each other while 1kg and 3kg blocks are connected by a chord. (a)\n\nasked by Sandhya on September 21, 2008\n4. ### physics\n\nA 0.20-kg object is attached to the end of an ideal horizontal spring that has a spring constant of 120 N/m. The simple harmonic motion that occurs has a maximum speed of 2.0 m/s. Determine the amplitude A of the motion.\n\nasked by Kate on January 25, 2014\n5. ### physics\n\nA clown is rocking on a rocking chair in the dark. His glowing red nose moves back and forth a distance of 0.42m exactly 30 times a minute in a simple harmonic motion. (a) what is the amplitude of this motion? (b) what is the\n\nasked by Peter on December 12, 2015\n1. ### physics\n\nA body of mass 20g is suspended from the end of a spiral spring whose force constant is 0.5N/m. The body is set into a simple harmonic motion with amplitude 0.2m. Calculate the period of the motion?\n\nasked by poppy on April 17, 2019\n2. ### Rcm sr sec school\n\nA block is on a horizontal slab which is moving horizontally with a simple harmonic motion of frequency two oscillations per second . The cofficient of static friction between the block and the slab is 0.50. How great the\n\nasked by Pawan on January 29, 2013\n3. ### physics\n\nA 2.0 kg mass is attached to the end of horizontal spring (k = 50 N/m) and set into simple harmonic motion with an amplitude of 0.10 m. What is the maximum speed of the mass? (Assume there is no friction.) A. 0.25 m/s B. 0.5 m/s\n\nasked by Idali on April 13, 2017\n4. ### Physics\n\nAt what positions is the speed of a simple harmonic oscillator half its maximum? That is, what values of x / X give v = ±vmax/2 , where X is the amplitude of the motion? Hello, I am so confused about this question. I am not\n\nasked by Elizabeth on July 24, 2016\n5. ### Physics\n\nA block is attached to a spring and set in motion on a horizontal frictionless surface by pulling the block back a distance 10cm from equilibrium. Now, replace the block with one double the mass and set the block into motion again\n\nasked by Gloria on April 13, 2016\n6. ### physics\n\nA small ball is set in horizontal motion by rolling it with a speed of 3.00 m/s across a room 12.0m long, between two walls. Assume that the collisions made with each wall are perfectly elastic and that the motion is perpendicular\n\nasked by sam on March 15, 2007" ]
[ null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.9281896,"math_prob":0.97512555,"size":3112,"snap":"2020-24-2020-29","text_gpt3_token_len":863,"char_repetition_ratio":0.13835263,"word_repetition_ratio":0.02,"special_character_ratio":0.27506426,"punctuation_ratio":0.09431138,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.994697,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2020-07-05T16:18:19Z\",\"WARC-Record-ID\":\"<urn:uuid:168d7049-5691-4dee-859b-06601299f45b>\",\"Content-Length\":\"24331\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:a4bce6d3-aba4-4ff1-8253-6b0b668bbf94>\",\"WARC-Concurrent-To\":\"<urn:uuid:78788687-94d8-4edc-821f-817073335d77>\",\"WARC-IP-Address\":\"66.228.55.50\",\"WARC-Target-URI\":\"https://www.jiskha.com/questions/292980/a-1kg-block-is-executing-simple-harmonic-motion-of-amplitude-0-1m-on-a-smooth-horizontal\",\"WARC-Payload-Digest\":\"sha1:PEDAJGUD3Q5YW3OQS6MWNHWVEHIFKUDF\",\"WARC-Block-Digest\":\"sha1:T7ZSNP2SNXNVIBCX5SPCXMHUM7UNAWNP\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2020/CC-MAIN-2020-29/CC-MAIN-2020-29_segments_1593655887377.70_warc_CC-MAIN-20200705152852-20200705182852-00391.warc.gz\"}"}
https://www.moe-chara.com/big-hyperloop-sllcu/9ec2de-postgres-cast-to-float
[ "select cast(5 as float)/2 +-----+ | ?column? Grades; Output: Illustrate the result of the above statement using the following snapshot. '5 day'::interval, I've gotten it to where it's float but I can't round it to 2 decimal places. So the challenge is to keep the cast type as float while rounding it to 2 decimal places. The TO_TIMESTAMP function converts string data into timestamps with timezone. WHEN grade~E'^\\\\d+\\$' THEN Floating-point numbers are \"useful approximations\". CAST('F' as BOOLEAN), The source argument is a number or a numeric expression that is to be rounded.. 2) n. The n argument is an integer that determines the number of decimal places after rounding.. The PostgreSQL formatting functions provide a powerful set of tools for converting various data types (date/time, integer, floating point, numeric) to formatted strings and for converting from formatted strings to specific data types. Making statements based on opinion; back them up with references or personal experience. How to round an average to 2 decimal places in PostgreSQL? PostgreSQL accepts float(1) to float(24) as selecting the real type, while float(25) to float(53) select double precision . The target data type is the data type to which the expression will get converted. 0 CAST ('2020-03-13' AS DATE), 3863. ALL RIGHTS RESERVED. people and the total salary (Float and rounded to 2 decimal places) and order by highest average salary. The single table consists of a different column with different data types and we need to store floating numbers that contain decimal points in the float column and values are not approx., so at this condition, we use float data type. Here are some examples of common types in PostgreSQL: -- Cast text to boolean. CAST('TRUE' AS BOOLEAN), The syntax is shown below: 1. SELECT CAST ( VALUE AS TYPE ) Another way to cast a value is by using the :: notation between the value … Postgresql cast double precision to numeric. The TO_DATE function in PostgreSQL is used to converting strings into dates.Its syntax is TO_DATE(text, text) and the return type is date.. Data Type Formatting Functions. Convert a STRING constant to DATE type using the following statement: SELECT My question is how can I convert bytea string to float inside a SQL function. Convert a STRING constant to timestamp type using the following statement. Goal: Display each unique job, the total average salary (FLOAT and rounded to 2 decimal places), the total 2. '222'::INTEGER, Its syntax is … Now let’s create a new table of name ‘Grades’ which will have a column named’Grade’ using CREATE TABLE statement as follows: CREATE TABLE Grades ( Function type resolution would fail for typed values that have no implicit cast to text.format_type() is dead freight while no type modifiers are added. CAST('true' AS BOOLEAN), Now, insert some data into the ‘Grades’ table using INSERT statement as follows: INSERT INTO Grades(Grade) Stack Overflow for Teams is a private, secure spot for you and ('D'); 3. The cast operator is used to convert the one data type to another, where the table column or an expression’s data type is decided to be. Efficient way to JMP or JSR to an address stored somewhere else? ('2'), Is it okay to face nail the drip edge to the fascia? True:true, ‘t’, ‘true’, ‘y’, ‘yes’, ‘1’ 2. Code language: CSS (css) Arguments. The following statement converts a string constant to an integer: CAST ('13-MAR-2020' AS DATE); 1. Naturally, it fails at this stage. 1) Cast a string to an integer example. The 0001-*.patch simply adds a regression test to numeric.sql that bits aren't lost casting from float to numeric. CAST In case the precision is a negative integer, the TRUNC()function replaces digits to the left of the decimal point. Next, let’s insert into the table all the acceptable boolean values. 4. If you are dealing with a numeric datatype, then you can first round(), then cast to float: If you are dealing with a float column, then you would need to cast the result of the aggregate function before using round() on it: If you strictly want to avoid casting away from float, you could do it like this: The point being: round() taking the number of decimal places as 2nd parameter is based on numeric (since floating point numbers are imprecise by nature). In case of processor memory, the double precision types can occupy up to 64 bit of memory. Podcast 305: What does it mean to be a “senior” software engineer. To learn more, see our tips on writing great answers. Re: Cast jsonb to numeric, int, float, bool at 2018-03-01 00:12:38 from Nikita Glukhov; Responses. INSERT INTO Grades(Grade) How would you gracefully handle this snippet to allow for spaces in directories? CAST('FALSE' as BOOLEAN), If the precision argument is a positive integer, the TRUNC()function truncates digits to the right of the decimal point. changing float->numeric casts from assignment to implicit, dangerous? We can have various cast operations in the PostgreSQL like, conversion of string to integers, conversion of string to date and date to a string also casting to Boolean, etc. CAST ('22.2' AS DOUBLE PRECISION); Convert a STRING constant to Boolean type using the following statement, where the ‘FALSE’, ‘false’, ‘f’ and ‘F’ gets converted to false, and ‘TRUE’, ‘true’, ‘t’ and ‘T’ gets converted to true as follows: SELECT Why did the design of the Boeing 247's cockpit windows change for some models? Try individually cast numerator or denominator as decimal, ... Browse other questions tagged sql postgresql casting decimal or ask your own question. ('3'), The cast to regclass is the useful part to enforce valid data types. CAST('f' as BOOLEAN), (to answer your comment above)! your coworkers to find and share information. The syntax of CAST operator’s another version is as follows as well: Syntax: Expression::type Consider the following example to understand the working of the PostgreSQL CAST: Code: SELECT '222'::INTEGER, '13-MAR-2020'::DAT… Now the Grades table will have mixed numerical and character types of rating stored. See this related case with explanation: Thanks for contributing an answer to Stack Overflow! Here are some examples of common types in PostgreSQL: -- Cast text to boolean. Function Returns Description Example; float(int) float8: convert integer to floating point: float(2) float4(int) float4: convert integer to floating point SELECT Hadoop, Data Science, Statistics & others. When converting from double precision, it is quite similar to rounding off the expression. THE CERTIFICATION NAMES ARE THE TRADEMARKS OF THEIR RESPECTIVE OWNERS. CAST('T' as BOOLEAN), Is AC equivalent over ZF to 'every fibration can be equipped with a cleavage'? The n argument is optional. Asking for help, clarification, or responding to other answers. Also, we have added some examples of PostgreSQL CAST operators to understand it in detail. Re: Cast jsonb to numeric, int, float, bool at 2018-03-01 10:20:29 … Postgres cast float 2 decimal places. In the first method, we specify the value and the targeted data type inside the parentheses of the CAST function. Earlier I converted to float in C# side. Why is my CAST not casting to float with 2 decimal places? PostgreSQL CAST examples. | |-----| | 2.5 | +-----+ Note: while I used float in the above examples, the following types will work for non-integer division: float; decimal; numeric; real; double precision [email protected]:datacomy> select cast(5 as float)/2 +-----+ | ?column? You can also go through our other related articles to learn more –, All in One Data Science Bundle (360+ Courses, 50+ projects). String to Date and Timestamp. The ROUND() function accepts 2 arguments:. The PostgreSQL provides us with the CAST operator which we can use for converting one data-type to another data type. The key point is that round() in Postgres does not allows floats (only numeric types are supported). PostgreSQL lock table is defined as a lock table for access from the user, we can lock the table from read access or write access. 1) number The numberargument is a numeric value to be truncated 2) precision The precisionargument is an integer that indicates the number of decimal places. To subscribe to this RSS feed, copy and paste this URL into your RSS reader. In … Multiply by 100 before and divide by 100 after. ('C'), CAST (grade AS INTEGER) ELSE CAST('t' as BOOLEAN); Output: Illustrate the following snapshots to understand the result of the above statement: 1. What to do? Multiplying by * float '100' achieves the cast and the multiplication in one step - because the data type resulting from avg() depends on the input, quoting the manual: numeric for any integer-type argument, double precision for a floating-point argument, otherwise the same as the argument data type. Now, Let’s have a look at the following examples, which converts one data type to another data type. Can Pluto be seen with the naked eye from Neptune when Pluto and Neptune are closest? CASE '13-MAR-2020'::DATE; Output: Illustrate the following snapshot to understand the result of the above statement. But there is an overloaded variant of round() taking a single parameter that rounds to the nearest integer. PostgreSQL also provides the :: short-hand for casting SELECT ST_SetSRID( ST_Point( -71.104, 42.315), 4326)::geography; If the point coordinates are not in a geodetic coordinate system (such as WGS84), then they must be reprojected before casting to a geography. FROM The float data type belongs under the numeric data type’s category. PostgreSQL sort by datetime asc, null first? If you ask code to round a floating-point number to two decimal places, returning another floating-point number, there's no guarantee that the closest approximation to the \"right\" answer will have only two digits to … Usually you should use the data type that best fits the representation of your data in a relational database. Or overcome your aversion against numeric and use round(numeric, int) as provided by GMB. Left outer join two levels deep in Postgres results in cartesian product, Calculating and using column average from a subquery, How to return a number with two decimal places in SQL Server without it automatically rounding. False:false, ‘f’, ‘false’, ‘n’, ‘no’, ‘0’ Let’s test boolean compatibility in Yugabyte DB by first creating a table with a boolean column. The target data type is the data type to which the expression will get converted. '5 month'::interval; 1. PostgreSQL: Show tables in PostgreSQL. By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy. The function is a useful test, but it's not a type cast.It takes text and returns text.Your examples actually only test string literals as input. ('A'), Illustrate the content of the Grades table with the help of the following snapshot and SQL statement. '1 month 3 days'::interval - Postgres traditional format for interval input; Omitting the time zone leaves you at the mercy of the Postgres server’s timezone setting, the TimeZone configuration that can be set at database-level, session-level, role-level or in the connection string, the client machine’s timezone setting, and more such factors. Use CAST to cast any argument to float. What language(s) implements function return value by assigning to the function name. I get an error saying I need to add explicit cast types which led me to attempt number 1. Quoting the manual about \"Constants\" once more: There are three kinds of implicitly-typed constants in PostgreSQL: strings, bit strings, and numbers. The boolean datatype is what PostgreSQL uses to store true, false and null values. Output: After executing the above SQL statement the PostgreSQL will give us the following error as the value contains a character in it. © 2020 - EDUCBA. Notice that the cast syntax with the cast operator (::) is PostgreSQL-specific and does not conform to the SQL standard. This website or its third-party tools use cookies, which are necessary to its functioning and required to achieve the purposes illustrated in the cookie policy. distinct(j.job_title) is most probably not doing what you may think it does. Why is “HADAT” the solution to the crossword clue \"went after\"? 1963. The precision argument is optional. 1. Here, p specifies the minimum acceptable precision in binary digits. 1) source. I used dataReader.getByte method to retrieve bytes and then Converted to float Difference between numeric, float and decimal in SQL Server. as byte array (4 bytes per one float) and encoding is Escape. ('4'); 5. In order execute the above statement correctly we have to use the following syntax where instead of DOUBLE we have to use DOUBLE PRECISION. Grade VARCHAR(1) Changing data type to float and rounding to 2 decimal digits, Skip whole row if aggregated value is null. Finally, let’s select out just the values that are TRUE, to verify it works as expected. See Type compatibility and conversion. I would be able to get corresponding bytea string using substring function. The answer depends on the actual datatype of column salary. Return Value. PostgreSQL accepts float (1) to float (24) as selecting the real type, while float (25) to float (53) select double precision. Double precision expression takes more decimal points when compared to float data types. Here we discuss Syntax, how does CAST operator works and examples to implement with proper codes and outputs. Better user experience while having a small amount of content to show. If you are dealing with a numeric datatype, then you can first round(), then cast to float: round(avg(salary), 2)::float If you are dealing with a float column, then you would need to cast the result of the aggregate function before using round() on it: Join Stack Overflow to learn, share knowledge, and build your career. ('1'), site design / logo © 2021 Stack Exchange Inc; user contributions licensed under cc by-sa. But how many times did you see applications that store dates or numbers as text or dates as integers? Caught someone's salary receipt open in its respective personal webmail in someone else's computer. The PostgreSQL CAST operator raises an error if the given value is not convertible to the target data type. The 0002-*.patch is a proof-of-concept patching float4_numeric and float8_numeric in the trivial way (just using FLT_DECIMAL_DIG and DBL_DECIMAL_DIG in place of FLT_DIG and DBL_DIG). This is the PostgreSQL SQL standard function which was used to return the values based on the start time of the current transactions in PostgreSQL. CREATE OR REPLACE FUNCTION convert_to_integer(v_input text) RETURNS INTEGER AS \\$\\$ DECLARE v_int_value INTEGER DEFAULT NULL; BEGIN BEGIN v_int_value := v_input::INTEGER; EXCEPTION WHEN OTHERS THEN RAISE NOTICE 'Invalid integer value: \"%\". By closing this banner, scrolling this page, clicking a link or continuing to browse otherwise, you agree to our Privacy Policy, New Year Offer - All in One Data Science Bundle (360+ Courses, 50+ projects) Learn More. Here’s the accepted boolean values in PostgreSQL: 1. How were four wires replaced with two wires in early telephone? Now suppose the requirement is changed where we have to store the grades in numerical format instead of character, so using the following statement we can insert numerical values in the Grades table. Certain data types require an explicit conversion to other data types using the CAST or CONVERT function. Let’s take some examples of using the CAST operator to convert a value of one type to another. The key point is that round() in Postgres does not allows floats (only numeric types are supported). CAST('false' as BOOLEAN), Eaga Trust - Information for Cash - Scam? We hope from the above article you have understood how to use the PostgreSQL CAST operator and how the PostgreSQL CAST works to convert one data type to another. DISTINCT is a syntax element - and completely useless here, only adding cost. What has Mordenkainen done to maintain the balance? SELECT If you don’t specify it, it defaults to zero (0). Thank you and it was a numeric datatype! Has the Earth's wobble around the Earth-Moon barycenter ever been observed by a spacecraft? Table 9-21 lists them. ('B'), Who must be present at the Presidential Inauguration? How would a theoretically perfect language work? This is a guide to CAST in PostgreSQL. The cast operator is used to convert the one data type to another, where the table column or an expression’s data type is decided to be. How do I provide exposition on a magic system when no character has an objective or complete understanding of it? Use the following statement to do the conversion: SELECT '5 minute'::interval, Sort by column ASC, but NULL values first? PostgreSQL provides different types of data types. In the case of handling transactions within multiple databases, the data conversion is the basic requirement which is supported by almost all programming paradigms. Here are two patches. Consider the following example for same. What are Hermitian conjugates in this context? '5 week'::interval, Use the following statement to do the conversion: Output: Illustrate the following snapshot to understand the result of the above statement: 2. Other data types can be converted implicitly, as part of another command, without using the CAST or CONVERT function. If you omit the n argument, its default value is 0. Introduction to PostgreSQL Float Data Type. The syntax of CAST operator’s another version is as follows as well: Consider the following example to understand the working of the PostgreSQL CAST: SELECT PostgreSQL also supports the SQL-standard notations float and float(p) for specifying inexact numeric types. ); 2. Difference between decimal, float and double in .NET? You could also create your own conversion function, inside which you can use exception blocks:. Mitsubishi Fault Codes Pdf, Cal State Long Beach Second Bachelors, Peel Away Paint Remover Brick, Spartacus Subtitles Season 3, Spray Helicopter For Sale, Schools For Sale Miami, Fma Envy Quotes, Opposite Of Conspicuous, Nitro Golf Pro Cart Bag, Does Big W Have Afterpay In Store, Abstract Painting With Acrylics, \"> select cast(5 as float)/2 +-----+ | ?column? Grades; Output: Illustrate the result of the above statement using the following snapshot. '5 day'::interval, I've gotten it to where it's float but I can't round it to 2 decimal places. So the challenge is to keep the cast type as float while rounding it to 2 decimal places. The TO_TIMESTAMP function converts string data into timestamps with timezone. WHEN grade~E'^\\\\d+\\$' THEN Floating-point numbers are \"useful approximations\". CAST('F' as BOOLEAN), The source argument is a number or a numeric expression that is to be rounded.. 2) n. The n argument is an integer that determines the number of decimal places after rounding.. The PostgreSQL formatting functions provide a powerful set of tools for converting various data types (date/time, integer, floating point, numeric) to formatted strings and for converting from formatted strings to specific data types. Making statements based on opinion; back them up with references or personal experience. How to round an average to 2 decimal places in PostgreSQL? PostgreSQL accepts float(1) to float(24) as selecting the real type, while float(25) to float(53) select double precision . The target data type is the data type to which the expression will get converted. 0 CAST ('2020-03-13' AS DATE), 3863. ALL RIGHTS RESERVED. people and the total salary (Float and rounded to 2 decimal places) and order by highest average salary. The single table consists of a different column with different data types and we need to store floating numbers that contain decimal points in the float column and values are not approx., so at this condition, we use float data type. Here are some examples of common types in PostgreSQL: -- Cast text to boolean. CAST('TRUE' AS BOOLEAN), The syntax is shown below: 1. SELECT CAST ( VALUE AS TYPE ) Another way to cast a value is by using the :: notation between the value … Postgresql cast double precision to numeric. The TO_DATE function in PostgreSQL is used to converting strings into dates.Its syntax is TO_DATE(text, text) and the return type is date.. Data Type Formatting Functions. Convert a STRING constant to DATE type using the following statement: SELECT My question is how can I convert bytea string to float inside a SQL function. Convert a STRING constant to timestamp type using the following statement. Goal: Display each unique job, the total average salary (FLOAT and rounded to 2 decimal places), the total 2. '222'::INTEGER, Its syntax is … Now let’s create a new table of name ‘Grades’ which will have a column named’Grade’ using CREATE TABLE statement as follows: CREATE TABLE Grades ( Function type resolution would fail for typed values that have no implicit cast to text.format_type() is dead freight while no type modifiers are added. CAST('true' AS BOOLEAN), Now, insert some data into the ‘Grades’ table using INSERT statement as follows: INSERT INTO Grades(Grade) Stack Overflow for Teams is a private, secure spot for you and ('D'); 3. The cast operator is used to convert the one data type to another, where the table column or an expression’s data type is decided to be. Efficient way to JMP or JSR to an address stored somewhere else? ('2'), Is it okay to face nail the drip edge to the fascia? True:true, ‘t’, ‘true’, ‘y’, ‘yes’, ‘1’ 2. Code language: CSS (css) Arguments. The following statement converts a string constant to an integer: CAST ('13-MAR-2020' AS DATE); 1. Naturally, it fails at this stage. 1) Cast a string to an integer example. The 0001-*.patch simply adds a regression test to numeric.sql that bits aren't lost casting from float to numeric. CAST In case the precision is a negative integer, the TRUNC()function replaces digits to the left of the decimal point. Next, let’s insert into the table all the acceptable boolean values. 4. If you are dealing with a numeric datatype, then you can first round(), then cast to float: If you are dealing with a float column, then you would need to cast the result of the aggregate function before using round() on it: If you strictly want to avoid casting away from float, you could do it like this: The point being: round() taking the number of decimal places as 2nd parameter is based on numeric (since floating point numbers are imprecise by nature). In case of processor memory, the double precision types can occupy up to 64 bit of memory. Podcast 305: What does it mean to be a “senior” software engineer. To learn more, see our tips on writing great answers. Re: Cast jsonb to numeric, int, float, bool at 2018-03-01 00:12:38 from Nikita Glukhov; Responses. INSERT INTO Grades(Grade) How would you gracefully handle this snippet to allow for spaces in directories? CAST('FALSE' as BOOLEAN), If the precision argument is a positive integer, the TRUNC()function truncates digits to the right of the decimal point. changing float->numeric casts from assignment to implicit, dangerous? We can have various cast operations in the PostgreSQL like, conversion of string to integers, conversion of string to date and date to a string also casting to Boolean, etc. CAST ('22.2' AS DOUBLE PRECISION); Convert a STRING constant to Boolean type using the following statement, where the ‘FALSE’, ‘false’, ‘f’ and ‘F’ gets converted to false, and ‘TRUE’, ‘true’, ‘t’ and ‘T’ gets converted to true as follows: SELECT Why did the design of the Boeing 247's cockpit windows change for some models? Try individually cast numerator or denominator as decimal, ... Browse other questions tagged sql postgresql casting decimal or ask your own question. ('3'), The cast to regclass is the useful part to enforce valid data types. CAST('f' as BOOLEAN), (to answer your comment above)! your coworkers to find and share information. The syntax of CAST operator’s another version is as follows as well: Syntax: Expression::type Consider the following example to understand the working of the PostgreSQL CAST: Code: SELECT '222'::INTEGER, '13-MAR-2020'::DAT… Now the Grades table will have mixed numerical and character types of rating stored. See this related case with explanation: Thanks for contributing an answer to Stack Overflow! Here are some examples of common types in PostgreSQL: -- Cast text to boolean. Function Returns Description Example; float(int) float8: convert integer to floating point: float(2) float4(int) float4: convert integer to floating point SELECT Hadoop, Data Science, Statistics & others. When converting from double precision, it is quite similar to rounding off the expression. THE CERTIFICATION NAMES ARE THE TRADEMARKS OF THEIR RESPECTIVE OWNERS. CAST('T' as BOOLEAN), Is AC equivalent over ZF to 'every fibration can be equipped with a cleavage'? The n argument is optional. Asking for help, clarification, or responding to other answers. Also, we have added some examples of PostgreSQL CAST operators to understand it in detail. Re: Cast jsonb to numeric, int, float, bool at 2018-03-01 10:20:29 … Postgres cast float 2 decimal places. In the first method, we specify the value and the targeted data type inside the parentheses of the CAST function. Earlier I converted to float in C# side. Why is my CAST not casting to float with 2 decimal places? PostgreSQL CAST examples. | |-----| | 2.5 | +-----+ Note: while I used float in the above examples, the following types will work for non-integer division: float; decimal; numeric; real; double precision [email protected]:datacomy> select cast(5 as float)/2 +-----+ | ?column? You can also go through our other related articles to learn more –, All in One Data Science Bundle (360+ Courses, 50+ projects). String to Date and Timestamp. The ROUND() function accepts 2 arguments:. The PostgreSQL provides us with the CAST operator which we can use for converting one data-type to another data type. The key point is that round() in Postgres does not allows floats (only numeric types are supported). PostgreSQL lock table is defined as a lock table for access from the user, we can lock the table from read access or write access. 1) number The numberargument is a numeric value to be truncated 2) precision The precisionargument is an integer that indicates the number of decimal places. To subscribe to this RSS feed, copy and paste this URL into your RSS reader. In … Multiply by 100 before and divide by 100 after. ('C'), CAST (grade AS INTEGER) ELSE CAST('t' as BOOLEAN); Output: Illustrate the following snapshots to understand the result of the above statement: 1. What to do? Multiplying by * float '100' achieves the cast and the multiplication in one step - because the data type resulting from avg() depends on the input, quoting the manual: numeric for any integer-type argument, double precision for a floating-point argument, otherwise the same as the argument data type. Now, Let’s have a look at the following examples, which converts one data type to another data type. Can Pluto be seen with the naked eye from Neptune when Pluto and Neptune are closest? CASE '13-MAR-2020'::DATE; Output: Illustrate the following snapshot to understand the result of the above statement. But there is an overloaded variant of round() taking a single parameter that rounds to the nearest integer. PostgreSQL also provides the :: short-hand for casting SELECT ST_SetSRID( ST_Point( -71.104, 42.315), 4326)::geography; If the point coordinates are not in a geodetic coordinate system (such as WGS84), then they must be reprojected before casting to a geography. FROM The float data type belongs under the numeric data type’s category. PostgreSQL sort by datetime asc, null first? If you ask code to round a floating-point number to two decimal places, returning another floating-point number, there's no guarantee that the closest approximation to the \"right\" answer will have only two digits to … Usually you should use the data type that best fits the representation of your data in a relational database. Or overcome your aversion against numeric and use round(numeric, int) as provided by GMB. Left outer join two levels deep in Postgres results in cartesian product, Calculating and using column average from a subquery, How to return a number with two decimal places in SQL Server without it automatically rounding. False:false, ‘f’, ‘false’, ‘n’, ‘no’, ‘0’ Let’s test boolean compatibility in Yugabyte DB by first creating a table with a boolean column. The target data type is the data type to which the expression will get converted. '5 month'::interval; 1. PostgreSQL: Show tables in PostgreSQL. By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy. The function is a useful test, but it's not a type cast.It takes text and returns text.Your examples actually only test string literals as input. ('A'), Illustrate the content of the Grades table with the help of the following snapshot and SQL statement. '1 month 3 days'::interval - Postgres traditional format for interval input; Omitting the time zone leaves you at the mercy of the Postgres server’s timezone setting, the TimeZone configuration that can be set at database-level, session-level, role-level or in the connection string, the client machine’s timezone setting, and more such factors. Use CAST to cast any argument to float. What language(s) implements function return value by assigning to the function name. I get an error saying I need to add explicit cast types which led me to attempt number 1. Quoting the manual about \"Constants\" once more: There are three kinds of implicitly-typed constants in PostgreSQL: strings, bit strings, and numbers. The boolean datatype is what PostgreSQL uses to store true, false and null values. Output: After executing the above SQL statement the PostgreSQL will give us the following error as the value contains a character in it. © 2020 - EDUCBA. Notice that the cast syntax with the cast operator (::) is PostgreSQL-specific and does not conform to the SQL standard. This website or its third-party tools use cookies, which are necessary to its functioning and required to achieve the purposes illustrated in the cookie policy. distinct(j.job_title) is most probably not doing what you may think it does. Why is “HADAT” the solution to the crossword clue \"went after\"? 1963. The precision argument is optional. 1. Here, p specifies the minimum acceptable precision in binary digits. 1) source. I used dataReader.getByte method to retrieve bytes and then Converted to float Difference between numeric, float and decimal in SQL Server. as byte array (4 bytes per one float) and encoding is Escape. ('4'); 5. In order execute the above statement correctly we have to use the following syntax where instead of DOUBLE we have to use DOUBLE PRECISION. Grade VARCHAR(1) Changing data type to float and rounding to 2 decimal digits, Skip whole row if aggregated value is null. Finally, let’s select out just the values that are TRUE, to verify it works as expected. See Type compatibility and conversion. I would be able to get corresponding bytea string using substring function. The answer depends on the actual datatype of column salary. Return Value. PostgreSQL accepts float (1) to float (24) as selecting the real type, while float (25) to float (53) select double precision. Double precision expression takes more decimal points when compared to float data types. Here we discuss Syntax, how does CAST operator works and examples to implement with proper codes and outputs. Better user experience while having a small amount of content to show. If you are dealing with a numeric datatype, then you can first round(), then cast to float: round(avg(salary), 2)::float If you are dealing with a float column, then you would need to cast the result of the aggregate function before using round() on it: Join Stack Overflow to learn, share knowledge, and build your career. ('1'), site design / logo © 2021 Stack Exchange Inc; user contributions licensed under cc by-sa. But how many times did you see applications that store dates or numbers as text or dates as integers? Caught someone's salary receipt open in its respective personal webmail in someone else's computer. The PostgreSQL CAST operator raises an error if the given value is not convertible to the target data type. The 0002-*.patch is a proof-of-concept patching float4_numeric and float8_numeric in the trivial way (just using FLT_DECIMAL_DIG and DBL_DECIMAL_DIG in place of FLT_DIG and DBL_DIG). This is the PostgreSQL SQL standard function which was used to return the values based on the start time of the current transactions in PostgreSQL. CREATE OR REPLACE FUNCTION convert_to_integer(v_input text) RETURNS INTEGER AS \\$\\$ DECLARE v_int_value INTEGER DEFAULT NULL; BEGIN BEGIN v_int_value := v_input::INTEGER; EXCEPTION WHEN OTHERS THEN RAISE NOTICE 'Invalid integer value: \"%\". By closing this banner, scrolling this page, clicking a link or continuing to browse otherwise, you agree to our Privacy Policy, New Year Offer - All in One Data Science Bundle (360+ Courses, 50+ projects) Learn More. Here’s the accepted boolean values in PostgreSQL: 1. How were four wires replaced with two wires in early telephone? Now suppose the requirement is changed where we have to store the grades in numerical format instead of character, so using the following statement we can insert numerical values in the Grades table. Certain data types require an explicit conversion to other data types using the CAST or CONVERT function. Let’s take some examples of using the CAST operator to convert a value of one type to another. The key point is that round() in Postgres does not allows floats (only numeric types are supported). CAST('false' as BOOLEAN), Eaga Trust - Information for Cash - Scam? We hope from the above article you have understood how to use the PostgreSQL CAST operator and how the PostgreSQL CAST works to convert one data type to another. DISTINCT is a syntax element - and completely useless here, only adding cost. What has Mordenkainen done to maintain the balance? SELECT If you don’t specify it, it defaults to zero (0). Thank you and it was a numeric datatype! Has the Earth's wobble around the Earth-Moon barycenter ever been observed by a spacecraft? Table 9-21 lists them. ('B'), Who must be present at the Presidential Inauguration? How would a theoretically perfect language work? This is a guide to CAST in PostgreSQL. The cast operator is used to convert the one data type to another, where the table column or an expression’s data type is decided to be. How do I provide exposition on a magic system when no character has an objective or complete understanding of it? Use the following statement to do the conversion: SELECT '5 minute'::interval, Sort by column ASC, but NULL values first? PostgreSQL provides different types of data types. In the case of handling transactions within multiple databases, the data conversion is the basic requirement which is supported by almost all programming paradigms. Here are two patches. Consider the following example for same. What are Hermitian conjugates in this context? '5 week'::interval, Use the following statement to do the conversion: Output: Illustrate the following snapshot to understand the result of the above statement: 2. Other data types can be converted implicitly, as part of another command, without using the CAST or CONVERT function. If you omit the n argument, its default value is 0. Introduction to PostgreSQL Float Data Type. The syntax of CAST operator’s another version is as follows as well: Consider the following example to understand the working of the PostgreSQL CAST: SELECT PostgreSQL also supports the SQL-standard notations float and float(p) for specifying inexact numeric types. ); 2. Difference between decimal, float and double in .NET? You could also create your own conversion function, inside which you can use exception blocks:. Mitsubishi Fault Codes Pdf, Cal State Long Beach Second Bachelors, Peel Away Paint Remover Brick, Spartacus Subtitles Season 3, Spray Helicopter For Sale, Schools For Sale Miami, Fma Envy Quotes, Opposite Of Conspicuous, Nitro Golf Pro Cart Bag, Does Big W Have Afterpay In Store, Abstract Painting With Acrylics, \">\n\n# postgres cast to float\n\nWhy is the expense ratio of an index fund sometimes higher than its equivalent ETF? A lock is very useful and important in PostgreSQL to prevent the user for modifying a single row or all tables. I've gotten to where I've rounded it 2 decimal places but it's not float. END as grade There is no function distinct(). rev 2021.1.18.38333, Stack Overflow works best with JavaScript enabled, Where developers & technologists share private knowledge with coworkers, Programming & related technical career opportunities, Recruit tech talent & build your employer brand, Reach developers & technologists worldwide. '5 hour'::interval, 9.8. Illustrate the content of the Grades table with the help of the following snapshot and SQL statement. So we will convert all values in the Grade column  of Grades table to integer type using the following statement. What is the simplest proof that the density of primes goes to zero? PostgreSQL parses string literal as record before calling cast; Casts from unknown. VALUES Now try to convert a STRING constant to DOUBLE type using the following statement: Output: After executing the above SQL statement the PostgreSQL will give us the following error as the value contains precision in it. What is the \"Ultimate Book of The Master\". PostgreSQL CURRENT_TIMESTAMP() is used to return the current date and time with time zone, it will display the time when our transaction starts. The TRUNC()function accepts two arguments. 6. VALUES [email protected]:datacomy> select cast(5 as float)/2 +-----+ | ?column? Grades; Output: Illustrate the result of the above statement using the following snapshot. '5 day'::interval, I've gotten it to where it's float but I can't round it to 2 decimal places. So the challenge is to keep the cast type as float while rounding it to 2 decimal places. The TO_TIMESTAMP function converts string data into timestamps with timezone. WHEN grade~E'^\\\\d+\\$' THEN Floating-point numbers are \"useful approximations\". CAST('F' as BOOLEAN), The source argument is a number or a numeric expression that is to be rounded.. 2) n. The n argument is an integer that determines the number of decimal places after rounding.. The PostgreSQL formatting functions provide a powerful set of tools for converting various data types (date/time, integer, floating point, numeric) to formatted strings and for converting from formatted strings to specific data types. Making statements based on opinion; back them up with references or personal experience. How to round an average to 2 decimal places in PostgreSQL? PostgreSQL accepts float(1) to float(24) as selecting the real type, while float(25) to float(53) select double precision . The target data type is the data type to which the expression will get converted. 0 CAST ('2020-03-13' AS DATE), 3863. ALL RIGHTS RESERVED. people and the total salary (Float and rounded to 2 decimal places) and order by highest average salary. The single table consists of a different column with different data types and we need to store floating numbers that contain decimal points in the float column and values are not approx., so at this condition, we use float data type. Here are some examples of common types in PostgreSQL: -- Cast text to boolean. CAST('TRUE' AS BOOLEAN), The syntax is shown below: 1. SELECT CAST ( VALUE AS TYPE ) Another way to cast a value is by using the :: notation between the value … Postgresql cast double precision to numeric. The TO_DATE function in PostgreSQL is used to converting strings into dates.Its syntax is TO_DATE(text, text) and the return type is date.. Data Type Formatting Functions. Convert a STRING constant to DATE type using the following statement: SELECT My question is how can I convert bytea string to float inside a SQL function. Convert a STRING constant to timestamp type using the following statement. Goal: Display each unique job, the total average salary (FLOAT and rounded to 2 decimal places), the total 2. '222'::INTEGER, Its syntax is … Now let’s create a new table of name ‘Grades’ which will have a column named’Grade’ using CREATE TABLE statement as follows: CREATE TABLE Grades ( Function type resolution would fail for typed values that have no implicit cast to text.format_type() is dead freight while no type modifiers are added. CAST('true' AS BOOLEAN), Now, insert some data into the ‘Grades’ table using INSERT statement as follows: INSERT INTO Grades(Grade) Stack Overflow for Teams is a private, secure spot for you and ('D'); 3. The cast operator is used to convert the one data type to another, where the table column or an expression’s data type is decided to be. Efficient way to JMP or JSR to an address stored somewhere else? ('2'), Is it okay to face nail the drip edge to the fascia? True:true, ‘t’, ‘true’, ‘y’, ‘yes’, ‘1’ 2. Code language: CSS (css) Arguments. The following statement converts a string constant to an integer: CAST ('13-MAR-2020' AS DATE); 1. Naturally, it fails at this stage. 1) Cast a string to an integer example. The 0001-*.patch simply adds a regression test to numeric.sql that bits aren't lost casting from float to numeric. CAST In case the precision is a negative integer, the TRUNC()function replaces digits to the left of the decimal point. Next, let’s insert into the table all the acceptable boolean values. 4. If you are dealing with a numeric datatype, then you can first round(), then cast to float: If you are dealing with a float column, then you would need to cast the result of the aggregate function before using round() on it: If you strictly want to avoid casting away from float, you could do it like this: The point being: round() taking the number of decimal places as 2nd parameter is based on numeric (since floating point numbers are imprecise by nature). In case of processor memory, the double precision types can occupy up to 64 bit of memory. Podcast 305: What does it mean to be a “senior” software engineer. To learn more, see our tips on writing great answers. Re: Cast jsonb to numeric, int, float, bool at 2018-03-01 00:12:38 from Nikita Glukhov; Responses. INSERT INTO Grades(Grade) How would you gracefully handle this snippet to allow for spaces in directories? CAST('FALSE' as BOOLEAN), If the precision argument is a positive integer, the TRUNC()function truncates digits to the right of the decimal point. changing float->numeric casts from assignment to implicit, dangerous? We can have various cast operations in the PostgreSQL like, conversion of string to integers, conversion of string to date and date to a string also casting to Boolean, etc. CAST ('22.2' AS DOUBLE PRECISION); Convert a STRING constant to Boolean type using the following statement, where the ‘FALSE’, ‘false’, ‘f’ and ‘F’ gets converted to false, and ‘TRUE’, ‘true’, ‘t’ and ‘T’ gets converted to true as follows: SELECT Why did the design of the Boeing 247's cockpit windows change for some models? Try individually cast numerator or denominator as decimal, ... Browse other questions tagged sql postgresql casting decimal or ask your own question. ('3'), The cast to regclass is the useful part to enforce valid data types. CAST('f' as BOOLEAN), (to answer your comment above)! your coworkers to find and share information. The syntax of CAST operator’s another version is as follows as well: Syntax: Expression::type Consider the following example to understand the working of the PostgreSQL CAST: Code: SELECT '222'::INTEGER, '13-MAR-2020'::DAT… Now the Grades table will have mixed numerical and character types of rating stored. See this related case with explanation: Thanks for contributing an answer to Stack Overflow! Here are some examples of common types in PostgreSQL: -- Cast text to boolean. Function Returns Description Example; float(int) float8: convert integer to floating point: float(2) float4(int) float4: convert integer to floating point SELECT Hadoop, Data Science, Statistics & others. When converting from double precision, it is quite similar to rounding off the expression. THE CERTIFICATION NAMES ARE THE TRADEMARKS OF THEIR RESPECTIVE OWNERS. CAST('T' as BOOLEAN), Is AC equivalent over ZF to 'every fibration can be equipped with a cleavage'? The n argument is optional. Asking for help, clarification, or responding to other answers. Also, we have added some examples of PostgreSQL CAST operators to understand it in detail. Re: Cast jsonb to numeric, int, float, bool at 2018-03-01 10:20:29 … Postgres cast float 2 decimal places. In the first method, we specify the value and the targeted data type inside the parentheses of the CAST function. Earlier I converted to float in C# side. Why is my CAST not casting to float with 2 decimal places? PostgreSQL CAST examples. | |-----| | 2.5 | +-----+ Note: while I used float in the above examples, the following types will work for non-integer division: float; decimal; numeric; real; double precision [email protected]:datacomy> select cast(5 as float)/2 +-----+ | ?column? You can also go through our other related articles to learn more –, All in One Data Science Bundle (360+ Courses, 50+ projects). String to Date and Timestamp. The ROUND() function accepts 2 arguments:. The PostgreSQL provides us with the CAST operator which we can use for converting one data-type to another data type. The key point is that round() in Postgres does not allows floats (only numeric types are supported). PostgreSQL lock table is defined as a lock table for access from the user, we can lock the table from read access or write access. 1) number The numberargument is a numeric value to be truncated 2) precision The precisionargument is an integer that indicates the number of decimal places. To subscribe to this RSS feed, copy and paste this URL into your RSS reader. In … Multiply by 100 before and divide by 100 after. ('C'), CAST (grade AS INTEGER) ELSE CAST('t' as BOOLEAN); Output: Illustrate the following snapshots to understand the result of the above statement: 1. What to do? Multiplying by * float '100' achieves the cast and the multiplication in one step - because the data type resulting from avg() depends on the input, quoting the manual: numeric for any integer-type argument, double precision for a floating-point argument, otherwise the same as the argument data type. Now, Let’s have a look at the following examples, which converts one data type to another data type. Can Pluto be seen with the naked eye from Neptune when Pluto and Neptune are closest? CASE '13-MAR-2020'::DATE; Output: Illustrate the following snapshot to understand the result of the above statement. But there is an overloaded variant of round() taking a single parameter that rounds to the nearest integer. PostgreSQL also provides the :: short-hand for casting SELECT ST_SetSRID( ST_Point( -71.104, 42.315), 4326)::geography; If the point coordinates are not in a geodetic coordinate system (such as WGS84), then they must be reprojected before casting to a geography. FROM The float data type belongs under the numeric data type’s category. PostgreSQL sort by datetime asc, null first? If you ask code to round a floating-point number to two decimal places, returning another floating-point number, there's no guarantee that the closest approximation to the \"right\" answer will have only two digits to … Usually you should use the data type that best fits the representation of your data in a relational database. Or overcome your aversion against numeric and use round(numeric, int) as provided by GMB. Left outer join two levels deep in Postgres results in cartesian product, Calculating and using column average from a subquery, How to return a number with two decimal places in SQL Server without it automatically rounding. False:false, ‘f’, ‘false’, ‘n’, ‘no’, ‘0’ Let’s test boolean compatibility in Yugabyte DB by first creating a table with a boolean column. The target data type is the data type to which the expression will get converted. '5 month'::interval; 1. PostgreSQL: Show tables in PostgreSQL. By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy. The function is a useful test, but it's not a type cast.It takes text and returns text.Your examples actually only test string literals as input. ('A'), Illustrate the content of the Grades table with the help of the following snapshot and SQL statement. '1 month 3 days'::interval - Postgres traditional format for interval input; Omitting the time zone leaves you at the mercy of the Postgres server’s timezone setting, the TimeZone configuration that can be set at database-level, session-level, role-level or in the connection string, the client machine’s timezone setting, and more such factors. Use CAST to cast any argument to float. What language(s) implements function return value by assigning to the function name. I get an error saying I need to add explicit cast types which led me to attempt number 1. Quoting the manual about \"Constants\" once more: There are three kinds of implicitly-typed constants in PostgreSQL: strings, bit strings, and numbers. The boolean datatype is what PostgreSQL uses to store true, false and null values. Output: After executing the above SQL statement the PostgreSQL will give us the following error as the value contains a character in it. © 2020 - EDUCBA. Notice that the cast syntax with the cast operator (::) is PostgreSQL-specific and does not conform to the SQL standard. This website or its third-party tools use cookies, which are necessary to its functioning and required to achieve the purposes illustrated in the cookie policy. distinct(j.job_title) is most probably not doing what you may think it does. Why is “HADAT” the solution to the crossword clue \"went after\"? 1963. The precision argument is optional. 1. Here, p specifies the minimum acceptable precision in binary digits. 1) source. I used dataReader.getByte method to retrieve bytes and then Converted to float Difference between numeric, float and decimal in SQL Server. as byte array (4 bytes per one float) and encoding is Escape. ('4'); 5. In order execute the above statement correctly we have to use the following syntax where instead of DOUBLE we have to use DOUBLE PRECISION. Grade VARCHAR(1) Changing data type to float and rounding to 2 decimal digits, Skip whole row if aggregated value is null. Finally, let’s select out just the values that are TRUE, to verify it works as expected. See Type compatibility and conversion. I would be able to get corresponding bytea string using substring function. The answer depends on the actual datatype of column salary. Return Value. PostgreSQL accepts float (1) to float (24) as selecting the real type, while float (25) to float (53) select double precision. Double precision expression takes more decimal points when compared to float data types. Here we discuss Syntax, how does CAST operator works and examples to implement with proper codes and outputs. Better user experience while having a small amount of content to show. If you are dealing with a numeric datatype, then you can first round(), then cast to float: round(avg(salary), 2)::float If you are dealing with a float column, then you would need to cast the result of the aggregate function before using round() on it: Join Stack Overflow to learn, share knowledge, and build your career. ('1'), site design / logo © 2021 Stack Exchange Inc; user contributions licensed under cc by-sa. But how many times did you see applications that store dates or numbers as text or dates as integers? Caught someone's salary receipt open in its respective personal webmail in someone else's computer. The PostgreSQL CAST operator raises an error if the given value is not convertible to the target data type. The 0002-*.patch is a proof-of-concept patching float4_numeric and float8_numeric in the trivial way (just using FLT_DECIMAL_DIG and DBL_DECIMAL_DIG in place of FLT_DIG and DBL_DIG). This is the PostgreSQL SQL standard function which was used to return the values based on the start time of the current transactions in PostgreSQL. CREATE OR REPLACE FUNCTION convert_to_integer(v_input text) RETURNS INTEGER AS \\$\\$ DECLARE v_int_value INTEGER DEFAULT NULL; BEGIN BEGIN v_int_value := v_input::INTEGER; EXCEPTION WHEN OTHERS THEN RAISE NOTICE 'Invalid integer value: \"%\". By closing this banner, scrolling this page, clicking a link or continuing to browse otherwise, you agree to our Privacy Policy, New Year Offer - All in One Data Science Bundle (360+ Courses, 50+ projects) Learn More. Here’s the accepted boolean values in PostgreSQL: 1. How were four wires replaced with two wires in early telephone? Now suppose the requirement is changed where we have to store the grades in numerical format instead of character, so using the following statement we can insert numerical values in the Grades table. Certain data types require an explicit conversion to other data types using the CAST or CONVERT function. Let’s take some examples of using the CAST operator to convert a value of one type to another. The key point is that round() in Postgres does not allows floats (only numeric types are supported). CAST('false' as BOOLEAN), Eaga Trust - Information for Cash - Scam? We hope from the above article you have understood how to use the PostgreSQL CAST operator and how the PostgreSQL CAST works to convert one data type to another. DISTINCT is a syntax element - and completely useless here, only adding cost. What has Mordenkainen done to maintain the balance? SELECT If you don’t specify it, it defaults to zero (0). Thank you and it was a numeric datatype! Has the Earth's wobble around the Earth-Moon barycenter ever been observed by a spacecraft? Table 9-21 lists them. ('B'), Who must be present at the Presidential Inauguration? How would a theoretically perfect language work? This is a guide to CAST in PostgreSQL. The cast operator is used to convert the one data type to another, where the table column or an expression’s data type is decided to be. How do I provide exposition on a magic system when no character has an objective or complete understanding of it? Use the following statement to do the conversion: SELECT '5 minute'::interval, Sort by column ASC, but NULL values first? PostgreSQL provides different types of data types. In the case of handling transactions within multiple databases, the data conversion is the basic requirement which is supported by almost all programming paradigms. Here are two patches. Consider the following example for same. What are Hermitian conjugates in this context? '5 week'::interval, Use the following statement to do the conversion: Output: Illustrate the following snapshot to understand the result of the above statement: 2. Other data types can be converted implicitly, as part of another command, without using the CAST or CONVERT function. If you omit the n argument, its default value is 0. Introduction to PostgreSQL Float Data Type. The syntax of CAST operator’s another version is as follows as well: Consider the following example to understand the working of the PostgreSQL CAST: SELECT PostgreSQL also supports the SQL-standard notations float and float(p) for specifying inexact numeric types. ); 2. Difference between decimal, float and double in .NET? You could also create your own conversion function, inside which you can use exception blocks:." ]
[ null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.81419575,"math_prob":0.8928224,"size":56041,"snap":"2021-04-2021-17","text_gpt3_token_len":12072,"char_repetition_ratio":0.140318,"word_repetition_ratio":0.97622454,"special_character_ratio":0.22253351,"punctuation_ratio":0.1290865,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.95592445,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2021-04-20T13:53:36Z\",\"WARC-Record-ID\":\"<urn:uuid:290b3690-0f29-4478-b67a-06c108689316>\",\"Content-Length\":\"110670\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:ca36789b-8ffa-46ce-9228-dbd715adb93e>\",\"WARC-Concurrent-To\":\"<urn:uuid:11bdb346-caf0-4de5-874f-c989a835f206>\",\"WARC-IP-Address\":\"104.21.85.157\",\"WARC-Target-URI\":\"https://www.moe-chara.com/big-hyperloop-sllcu/9ec2de-postgres-cast-to-float\",\"WARC-Payload-Digest\":\"sha1:Q7QWN2HQMQ2ATV2DLWQZDIMLJRMRW3FG\",\"WARC-Block-Digest\":\"sha1:UMGE4JREEM2JFFDT7YAHNYHHIXVEY2IG\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2021/CC-MAIN-2021-17/CC-MAIN-2021-17_segments_1618039398307.76_warc_CC-MAIN-20210420122023-20210420152023-00351.warc.gz\"}"}
https://answers.everydaycalculation.com/subtract-fractions/3-25-minus-8-42
[ "Solutions by everydaycalculation.com\n\nSubtract 8/42 from 3/25\n\n3/25 - 8/42 is -37/525.\n\nSteps for subtracting fractions\n\n1. Find the least common denominator or LCM of the two denominators:\nLCM of 25 and 42 is 1050\n2. For the 1st fraction, since 25 × 42 = 1050,\n3/25 = 3 × 42/25 × 42 = 126/1050\n3. Likewise, for the 2nd fraction, since 42 × 25 = 1050,\n8/42 = 8 × 25/42 × 25 = 200/1050\n4. Subtract the two fractions:\n126/1050 - 200/1050 = 126 - 200/1050 = -74/1050\n5. After reducing the fraction, the answer is -37/525\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-" ]
[ null, "https://answers.everydaycalculation.com/mathstep-app-icon.png", null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.8011778,"math_prob":0.9917561,"size":333,"snap":"2019-43-2019-47","text_gpt3_token_len":140,"char_repetition_ratio":0.20668693,"word_repetition_ratio":0.0,"special_character_ratio":0.5075075,"punctuation_ratio":0.061728396,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.99851274,"pos_list":[0,1,2],"im_url_duplicate_count":[null,null,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2019-10-20T23:44:23Z\",\"WARC-Record-ID\":\"<urn:uuid:6edf1e69-e2c6-41eb-a958-93746ae38923>\",\"Content-Length\":\"8170\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:032fe286-8dff-42ae-98b7-88efa1699033>\",\"WARC-Concurrent-To\":\"<urn:uuid:a1a1ed1f-978b-49ad-8568-59207f13bd1c>\",\"WARC-IP-Address\":\"96.126.107.130\",\"WARC-Target-URI\":\"https://answers.everydaycalculation.com/subtract-fractions/3-25-minus-8-42\",\"WARC-Payload-Digest\":\"sha1:ZETVP36CQD7DJMBNILAAUKVSBPSVY4S2\",\"WARC-Block-Digest\":\"sha1:RNCVILAXJIORIF4DRSOEUUARU4LDF4N2\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2019/CC-MAIN-2019-43/CC-MAIN-2019-43_segments_1570987750110.78_warc_CC-MAIN-20191020233245-20191021020745-00166.warc.gz\"}"}
https://help.altair.com/embedse/rootlocusanalysis.htm
[ "## Root locus analysis\n\nFor brevity, the transfer function can be denoted as GH(s), which represents a ratio of polynomials in s, and can be written as:", null, "where N(s) is the numerator polynomial and D(s) is the denominator polynomial. The root locus gain is represented as K.\n\nThe following diagram presents the structure Embed uses to perform root locus calculations:", null, "", null, "The closed-loop poles are the roots of the characteristic equation (or denominator of the closed-loop transfer function) and can be computed as the roots of:", null, "For small values of K, the closed-loop poles are approximately the roots of D(s) = 0 (the open-loop poles); and for large values of K (positive or negative), the closed-loop poles are approximately the roots of N(s) = 0 (the open-loop 0s). The root locus plot presents the paths of the closed-loop poles as the value of K varies.\n\nTo generate a root locus plot\n\n2.    Choose Analyze > Root Locus Options to define the point count resolution of the root locus gain (K) values to be investigated.\n\n3.    Choose Analyze > Root Locus to generate a root locus plot.\n\n4.    Resize or zoom in on the plot for better viewing." ]
[ null, "https://help.altair.com/embedse/ImagesExt/image35_16.png", null, "https://help.altair.com/embedse/ImagesExt/image35_17.png", null, "https://help.altair.com/embedse/ImagesExt/image35_18.png", null, "https://help.altair.com/embedse/ImagesExt/image35_19.png", null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.887592,"math_prob":0.97840375,"size":1466,"snap":"2023-40-2023-50","text_gpt3_token_len":315,"char_repetition_ratio":0.16073872,"word_repetition_ratio":0.040650405,"special_character_ratio":0.2148704,"punctuation_ratio":0.08391608,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.99545014,"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\":\"2023-09-28T00:47:07Z\",\"WARC-Record-ID\":\"<urn:uuid:095bae7d-ff50-42fc-8a09-6b7331ff55b4>\",\"Content-Length\":\"5026\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:32d80fa7-ab93-44be-b8bc-f36cdd6df192>\",\"WARC-Concurrent-To\":\"<urn:uuid:ccd6b5f4-0bfe-4c54-b275-ca61ef0e25ea>\",\"WARC-IP-Address\":\"173.225.177.121\",\"WARC-Target-URI\":\"https://help.altair.com/embedse/rootlocusanalysis.htm\",\"WARC-Payload-Digest\":\"sha1:AUWRHUTWANREMADN34YABJKFVRFUYEGU\",\"WARC-Block-Digest\":\"sha1:LYPJZYSTP4URPEUJAHDFJ6HUCJLVRC7C\",\"WARC-Identified-Payload-Type\":\"application/xhtml+xml\",\"warc_filename\":\"/cc_download/warc_2023/CC-MAIN-2023-40/CC-MAIN-2023-40_segments_1695233510334.9_warc_CC-MAIN-20230927235044-20230928025044-00225.warc.gz\"}"}
https://arxiv-export-lb.library.cornell.edu/abs/2104.02998
[ "cs.LO\n\n# Title: Parameterized Complexity of Elimination Distance to First-Order Logic Properties\n\nAbstract: The elimination distance to some target graph property P is a general graph modification parameter introduced by Bulian and Dawar. We initiate the study of elimination distances to graph properties expressible in first-order logic. We delimit the problem's fixed-parameter tractability by identifying sufficient and necessary conditions on the structure of prefixes of first-order logic formulas. Our main result is the following meta-theorem: for every graph property P expressible by a first order-logic formula \\phi\\in \\Sigma_3, that is, of the form \\phi=\\exists x_1\\exists x_2\\cdots \\exists x_r \\forall y_1\\forall y_2\\cdots \\forall y_s \\exists z_1\\exists z_2\\cdots \\exists z_t \\psi, where \\psi is a quantifier-free first-order formula, checking whether the elimination distance of a graph to P does not exceed k, is fixed-parameter tractable parameterized by k. Properties of graphs expressible by formulas from \\Sigma_3 include being of bounded degree, excluding a forbidden subgraph, or containing a bounded dominating set. We complement this theorem by showing that such a general statement does not hold for formulas with even slightly more expressive prefix structure: there are formulas \\phi\\in \\Pi_3, for which computing elimination distance is W-hard.\n Subjects: Logic in Computer Science (cs.LO); Computational Complexity (cs.CC); Discrete Mathematics (cs.DM); Data Structures and Algorithms (cs.DS) Cite as: arXiv:2104.02998 [cs.LO] (or arXiv:2104.02998v1 [cs.LO] for this version)\n\n## Submission history\n\nFrom: Petr Golovach [view email]\n[v1] Wed, 7 Apr 2021 08:55:36 GMT (57kb,D)\n\nLink back to: arXiv, form interface, contact." ]
[ null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.82281625,"math_prob":0.8912831,"size":1700,"snap":"2022-40-2023-06","text_gpt3_token_len":392,"char_repetition_ratio":0.11084906,"word_repetition_ratio":0.0,"special_character_ratio":0.21411765,"punctuation_ratio":0.110367894,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.98314553,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2022-09-25T11:40:03Z\",\"WARC-Record-ID\":\"<urn:uuid:3bfd8404-68af-48d8-8aef-acfa2b072b7c>\",\"Content-Length\":\"17332\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:e64e2789-7040-4041-9b7e-216a41d23d35>\",\"WARC-Concurrent-To\":\"<urn:uuid:85628efd-7af6-4d96-8cca-0a6dfbe500f9>\",\"WARC-IP-Address\":\"128.84.21.203\",\"WARC-Target-URI\":\"https://arxiv-export-lb.library.cornell.edu/abs/2104.02998\",\"WARC-Payload-Digest\":\"sha1:CNPUDQC3BKI6DNIEHNFUZ4XOQAVCT2UQ\",\"WARC-Block-Digest\":\"sha1:PSL4DEMPGJXE5IHXUO2VKHXW5ME3SNOA\",\"WARC-Identified-Payload-Type\":\"application/xhtml+xml\",\"warc_filename\":\"/cc_download/warc_2022/CC-MAIN-2022-40/CC-MAIN-2022-40_segments_1664030334528.24_warc_CC-MAIN-20220925101046-20220925131046-00365.warc.gz\"}"}
https://www.math-only-math.com/types-of-fractions-a.html
[ "# Types of Fractions\n\nThe various types of fractions are:\n\n1. Like Fractions:\n\nThe fractions having the same denominators are known as like fractions.\n\nWe know that fractions such as 2/5, 3/5, 5/5, 7/5, 9/5, ….etc., are like fractions.\n\n2. The same Numerator Fractions:\n\nThe factors having the same numerators are called the same numerator fractions.\n\nFractions such as 2/5, 2/7, 2/9, 2/11, …………, etc., are same numerator fractions.\n\n3. Unit Fractions:\n\nThe fractions having one (1) as their numerator are called unit fractions.\n\n1/3, 1/5, 1/7, 1/9, …………, etc., are unit fractions.\n\n4. Proper fractions:\n\nA fraction in which the denominator is greater than the numerator is called a proper fraction. We can also say that a fraction with its numerator less than the denominator is known as a proper fraction.\n\n1/2, 2/3, 4/5, 5/6, 7/10, 9/11, 11/21, 35/45, ……….., etc., are proper fractions.\n\n5. Improper Fractions:\n\nA fraction in which the denominator is smaller than or equal to its numerator is called an improper fraction. We can also say that a fraction with its numerator greater than or equal to the denominator is known as an improper fraction.\n\n5/3, 9/5, 11/7, 17/8, 21/14, 19/15, …….., etc., are improper fractions.\n\n6. Mixed Fractions:\n\nWhen an improper fraction is written as a combination of a whole number and a proper number, it becomes a mixed fraction or mixed number.\n\nAs: 6/5 = 5 + 1/5 = 5/5 + 1/5 = 1 + 1/5 = 11/5\n\n11/2, 11/4, 23/4, 35/7, 51/9, ……….., etc., are mixed fractions.\n\n(All types of fraction may be categorized into three kinds, i.e., proper, improper and mixed fraction).\n\nTypes of Fractions\n\nRelated Concept" ]
[ null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.9146925,"math_prob":0.99570346,"size":2434,"snap":"2021-31-2021-39","text_gpt3_token_len":678,"char_repetition_ratio":0.22098765,"word_repetition_ratio":0.06388206,"special_character_ratio":0.28348398,"punctuation_ratio":0.18644068,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.99593717,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2021-09-24T12:06:52Z\",\"WARC-Record-ID\":\"<urn:uuid:beb1b886-14f7-442a-ac62-1716c63b6efa>\",\"Content-Length\":\"35969\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:521a7fd4-6b47-4dc6-a738-d8d5256383ed>\",\"WARC-Concurrent-To\":\"<urn:uuid:7b7d81f3-7795-4a16-8e92-df74dc5289d3>\",\"WARC-IP-Address\":\"173.247.219.53\",\"WARC-Target-URI\":\"https://www.math-only-math.com/types-of-fractions-a.html\",\"WARC-Payload-Digest\":\"sha1:CCVHZ7VRDGNHVVKEL7J7P4ZUC7X4PQW4\",\"WARC-Block-Digest\":\"sha1:BLL2P2JCALQ445LJGFM32FAAVTVIXTOE\",\"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-00085.warc.gz\"}"}
https://www.flandershealth.us/parallel-brain/group-shape-differences-and-their-significance-tests.html
[ "## Group shape differences and their significance tests\n\nShape coordinates help us to carry out many familiar operations of ordinary scientific statistics. Figure 4.4, for example, shows two averages of points from the preceding scatter corresponding to the means for the subgroups of this data set in which we are the most interested: the average for the normal brains (the doctors') versus the average for the patients'.\n\nThe comparison in the figure began with 52 coordinates (x and y for each of 26 points) but lost four of these degrees of freedom when the forms were translated, rotated, and scaled to all fit the same sample average. The 48 dimensions of variability remaining are quite a bit more than the pooled sample size here, 12 + 13 = 25, so it is not at all obvious how to proceed with a conventional significance test for the improbability of the difference shown in the figure on a null hypothesis of no group difference.\n\nMost good morphometric data sets are of this form— more coordinates than cases—and hence much of the time spent developing this new morphometrics was devoted to the specific problem of rigorous statistical test-", null, "Figure 4.4. Procrustes mean shapes for the two subgroups of Figure 4.1.\n\ning under these conditions (cf. Bookstein, 1996). It turns out that these problems of dimensionality are much less severe than they seemed. The 48 variables remaining are not just any set of 48 measurements; they are coordinates of corresponding points that, after the Procrustes maneuver, do not vary much in location in two-dimensional Euclidean space. Their statistical analysis is thereby susceptible to a clever maneuver that was originally laid out by Colin Goodall (1991). If, for purposes of testing, we are willing to treat all the points as equivalent and, likewise, all the ways in which the shape of their configurations can vary, then we can mount a powerful test of the presence of any group difference by paying no attention to any aspect of the sample variation except net Procrustes distances of each form from the others and from the mean.\n\nThe argument begins with a suspiciously symmetric ''null model,'' according to which each point of the data set arises from the same grand mean by pure uncorre-lated Gaussian noise of the same small variance in every direction at every landmark separately. Under this model, if one has no prior knowledge about just how the shapes are likely to differ, the best statistic for testing group differences in mean shape is exactly the Procrustes distance we have just introduced, and its distribution on the null is borne in an F-ratio that can be evaluated and tested no matter how many points there are or how few specimens per group. The F in question looks just like any other F-ratio from your introductory biostatistics course: a between-group sum of squares divided by a within-group sum of squares, multiplied by an integer fraction and looked up in an F-table. In this application the integer fraction and the degrees of freedom are functions of the number of landmarks as well as the sample sizes. The formula, which is appropriate on the assumptions opening this paragraph, regardless of the number of landmarks or cases, reads as follows: The quantity" ]
[ null, "https://www.flandershealth.us/parallel-brain/images/9344_88_36.png", null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.94168735,"math_prob":0.94750893,"size":3151,"snap":"2019-43-2019-47","text_gpt3_token_len":630,"char_repetition_ratio":0.10422625,"word_repetition_ratio":0.0038022813,"special_character_ratio":0.19771501,"punctuation_ratio":0.072413795,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9864325,"pos_list":[0,1,2],"im_url_duplicate_count":[null,1,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2019-11-12T06:14:16Z\",\"WARC-Record-ID\":\"<urn:uuid:5d004557-4685-4b5a-86b9-be7908244cb0>\",\"Content-Length\":\"12845\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:e34d54c1-d776-4b7c-94be-a2a72d0b8fa6>\",\"WARC-Concurrent-To\":\"<urn:uuid:7be76471-29f8-4823-94d6-84f370b8fdbb>\",\"WARC-IP-Address\":\"104.31.78.60\",\"WARC-Target-URI\":\"https://www.flandershealth.us/parallel-brain/group-shape-differences-and-their-significance-tests.html\",\"WARC-Payload-Digest\":\"sha1:OJIC5JLMYZUPXUBRSQ7HWNBCVWM3PYKF\",\"WARC-Block-Digest\":\"sha1:NRH6HEUY6GXEZ4UR7PLINCZP4U2TO2QO\",\"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-00020.warc.gz\"}"}
https://bilakniha.cvut.cz/en/predmet4989506.html
[ "", null, "CZECH TECHNICAL UNIVERSITY IN PRAGUE\nSTUDY PLANS\n2022/2023\nUPOZORNĚNÍ: Jsou dostupné studijní plány pro následující akademický rok.\n\n# Statistics 1\n\nCode Completion Credits Range Language\nU63C3101 Z,ZK 6 2P+2C Czech\nGarant předmětu:\nTomáš Macák\nLecturer:\nTomáš Macák, Jiří Zmatlík\nTutor:\nTomáš Macák, Jiří Zmatlík\nSupervisor:\nInstitute of Economic Studies\nSynopsis:\n\nThe study results are verified by the following forms of attestation:\n\na) Credit\n\nb) Exam\n\nThe credit is awarded on completion of the requirements set by the teacher at the beginning of the semester. In the course of Statistics I, there is a minimum active participation in the 75% exercise, the preparation of the semester project in the required quality and scale, and passing the final test at the minimum level of 60%.\n\nA subsequent examination is a form of attestation that examines knowledge of student principles and practices within the topics listed below for the Statistics I subject. The exam is always written and usually supplemented by the oral part.\n\nRequirements:\n\nThe study results are verified by the following forms of attestation:\n\na) Credit\n\nb) Exam\n\nThe credit is awarded on completion of the requirements set by the teacher at the beginning of the semester. In the course of Statistics I, there is a minimum active participation in the 75% exercise, the preparation of the semester project in the required quality and scale, and passing the final test at the minimum level of 60%.\n\nA subsequent examination is a form of attestation that examines knowledge of student principles and practices within the topics listed below for the Statistics I subject. The exam is always written and usually supplemented by the oral part.\n\nSyllabus of lectures:\n\n1.Introduction to statistical issues, random variable, probability function, probability density, distribution function.\n\n2.Basic types of distribution (discrete and continuous random variables), derivation of their essential numerical characteristics.\n\n3.Numerical characteristics of random variables. Mathematical expectation of random variable, data types, mean value, variance, slope coefficient, spikes, quantal, median, modus.\n\n4.Statistical file with one argument, regression and correlation analysis, derivation of coefficients of the equation of the line, assumptions of the linear regression model.\n\n5.Nonlinear regression and correlation analysis, correlation field with the general course, addition function, determinant coefficient.\n\n6.Application utilization of regression analysis for design of experiments, factor-response, factor-to-factor interactions, „single factor change“ problems, factorial design, variance analysis.\n\n7.Statistical experimentation for two-level factors, factorial proposals 2n.\n\n8.Binary synthesis of response quantity, removal of redundant experiment factors.\n\n9.Statistical induction and its use in the management, statistical hypothesis, statistical tests, interval estimation, significance level, critical values, test criterion, type 1 and 2 error.\n\n10.Statistical hypotheses Tests (parametric), difference test of (F-test, T-test).\n\n11.The randomness test of the difference between empirical and theoretical frequencies (test א 2).\n\n12.Statistical regulation. Shewhart's control diagrams.\n\n13. Methods of multivariate analysis, external analysis, and internal analysis (principal component analysis, factor analysis, cluster analysis).\n\n14. Choice of statistical method, classification of statistical methods, problems of significance tests, Bayesian approach, computationally intensive methods.\n\nSyllabus of tutorials:\n\n1. random variable, probability function, probability density, distribution function.\n\n2.types of distribution (discrete and continuous random variables),\n\n3.numerical characteristics of random variables.\n\n4.statistical file with one argument, regression and correlation analysis\n\n5.nonlinear regression and correlation analysis\n\n6.application utilization of regression analysis for design of experiments, factor-response, factor-to-factor interactions\n\n7.statistical experimentation for two-level factors, factorial proposals 2n.\n\n8.binary synthesis of response quantity, removal of redundant experiment factors.\n\n9.statistical hypotheses Tests (parametric),\n\n10.randomness test of the difference between empirical and theoretical\n\nfrequencies\n\n11. statistical interval of reliability\n\n12.statistical regulation. - Shewhart's control diagrams.\n\n13. Methods of multivariate analysis, external analysis, and internal analysis (principal component analysis, factor analysis, cluster analysis).\n\n14. Choice of statistical method, classification of statistical methods, problems of significance tests, Bayesian approach, computationally intensive methods.\n\nStudy Objective:\n\nAfter completing the course, students will be prepared to practically apply these methods in related subjects and practical problems in the corporate environment.\n\nStudy materials:\n\nOBLIGATORY\n\nFreedman D. (2007). Statistics, Third Edition. Norton &amp; Company, Incorporated, W. W.ISBN-13: 978-0393970838\n\nRECOMMENDED\n\nKutner, M., Nachtsheim, C., Neter, J., and Li, W. (2004). Applied Linear Statistical Models, McGraw-Hill/Irwin, Homewood, IL.\n\nLIND, D., MARCHAL, W., WATHEN, S. (2015) Statistical Techniques in Business and Economics, (16th Edition). McGraw-Hill Education. ISBN-13: 978-0078020520.\n\nTRIOLA, M., F. Essentials of Statistics (5th Edition). Pearson Education 2015. ISBN-13: 978-0321924599.\n\nTufte, E. R. (2001). The Visual Display of Quantitative Information (2nd ed.) (p.178). Cheshire, CT: Graphics Press.\n\nNote:\nFurther information:\nhttps://moodle-vyuka.cvut.cz/course/view.php?id=5904\nTime-table for winter semester 2022/2023:\n 06:00–08:0008:00–10:0010:00–12:0012:00–14:0014:00–16:0016:00–18:0018:00–20:0020:00–22:0022:00–24:00 roomDEJ:424Zmatlík J.16:00–17:30(parallel nr.102)DejvicePC LabroomDEJ:424Zmatlík J.17:45–19:15(parallel nr.103)DejvicePC Lab roomDEJ:423Zmatlík J.16:00–17:30(parallel nr.102)DejvicePC LabroomDEJ:423Zmatlík J.17:45–19:15(parallel nr.103)DejvicePC Lab roomDEJ:424Zmatlík J.09:00–10:30(parallel nr.101)DejvicePC LabroomJP:B-771Macák T.16:00–17:30(lecture parallel1)Jugoslávských partyzánů 3 roomDEJ:424Zmatlík J.10:45–12:15(parallel nr.104)DejvicePC LabroomDEJ:424Zmatlík J.12:30–14:00(parallel nr.105)DejvicePC Lab\nTime-table for summer semester 2022/2023:\nTime-table is not available yet\nThe course is a part of the following study plans:\nData valid to 2023-05-31\nAktualizace výše uvedených informací naleznete na adrese https://bilakniha.cvut.cz/en/predmet4989506.html" ]
[ null, "https://bilakniha.cvut.cz/logo-cs.svg", null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.7084039,"math_prob":0.7459946,"size":6916,"snap":"2023-14-2023-23","text_gpt3_token_len":1774,"char_repetition_ratio":0.12847222,"word_repetition_ratio":0.42588496,"special_character_ratio":0.25520533,"punctuation_ratio":0.20939185,"nsfw_num_words":2,"has_unicode_error":false,"math_prob_llama3":0.9792,"pos_list":[0,1,2],"im_url_duplicate_count":[null,null,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2023-05-31T09:44:49Z\",\"WARC-Record-ID\":\"<urn:uuid:a31c8314-907d-4607-8493-d135c9b5589c>\",\"Content-Length\":\"36702\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:67a7b022-22cf-4b98-8b03-b71266acdc85>\",\"WARC-Concurrent-To\":\"<urn:uuid:ce3da175-4c0b-4806-859c-711469ff74ae>\",\"WARC-IP-Address\":\"147.32.3.35\",\"WARC-Target-URI\":\"https://bilakniha.cvut.cz/en/predmet4989506.html\",\"WARC-Payload-Digest\":\"sha1:IY6Z5PR2IZTJO3WP2OC2XCRCGRHWFRSN\",\"WARC-Block-Digest\":\"sha1:GYNMU2BNTXWKPQN54TUKMQAHZOZRJYC3\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2023/CC-MAIN-2023-23/CC-MAIN-2023-23_segments_1685224646457.49_warc_CC-MAIN-20230531090221-20230531120221-00272.warc.gz\"}"}
http://www.alljournals.cn/search.aspx?subject=mathematical_chemical&major=sx&orderby=referenced&field=author_name&q=Chen+Zongxuan&prev_q=Chen%20Zongxuan
[ "", null, "首页 | 官方网站 微博 | 高级检索\n\n 按 中文标题 英文标题 中文关键词 英文关键词 中文摘要 英文摘要 作者中文名 作者英文名 单位中文名 单位英文名 基金中文名 基金英文名 杂志中文名 杂志英文名 栏目英文名 栏目英文名 DOI 责任编辑 分类号 杂志ISSN号 检索 检索词:\n\n 收费全文 13篇 免费 2篇\n 数理化 15篇\n 2012年 1篇 2010年 1篇 2008年 2篇 2007年 1篇 2005年 1篇 2004年 1篇 2000年 2篇 1999年 1篇 1998年 1篇 1997年 2篇 1996年 1篇 1993年 1篇\n\n1.\n\n2.\nIn this article,we study the complex oscillation problems of entire solutions to homogeneous and nonhomogeneous linear difference equations,and obtain some relations of the exponent of convergence of z...  相似文献\n3.\nIn this paper, authors investigate the order of growth and the hyper order of solutions of a class of the higher order linear differential equation, and improve results of M. Ozawa^, G. Gundersen^ and J.K. Langley^, Li Chun-hong^.  相似文献\n4.\n\n5.\nIn this paper the order and the hyper-order of the solutions of higher-order homoge-neous linear differential equations is investigated.  相似文献\n6.\n\n7.\n\n8.\nThis article investigates the property of linearly dependence of solutions f(z) and f(z 2πi)for higher order linear differential equations with entire periodic coefficients.  相似文献\n9.\n\n10.\nIn this article, the authors study the growth of certain second order linear differential equation f″+A(z)f′+B(z)f=0 and give precise estimates for the hyperorder of solutions of infinite order. Under similar conditions, higher order differential equations will be considered.  相似文献\n 设为首页 | 免责声明 | 关于勤云 | 加入收藏 Copyright" ]
[ null, "http://www.alljournals.cn/ch/ext_images/logo.jpg", null ]
{"ft_lang_label":"__label__zh","ft_lang_prob":0.62491,"math_prob":0.9440669,"size":2085,"snap":"2023-40-2023-50","text_gpt3_token_len":1265,"char_repetition_ratio":0.12253724,"word_repetition_ratio":0.0,"special_character_ratio":0.26426858,"punctuation_ratio":0.12676056,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.95800406,"pos_list":[0,1,2],"im_url_duplicate_count":[null,null,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2023-09-24T14:02:46Z\",\"WARC-Record-ID\":\"<urn:uuid:d955c8ef-8cad-4d85-90a7-123409dadb3a>\",\"Content-Length\":\"45037\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:978d41a5-e6cc-4e8a-8eee-7b74b4326f91>\",\"WARC-Concurrent-To\":\"<urn:uuid:d66622c4-b4af-4efd-9154-96da785a3ac0>\",\"WARC-IP-Address\":\"119.188.250.141\",\"WARC-Target-URI\":\"http://www.alljournals.cn/search.aspx?subject=mathematical_chemical&major=sx&orderby=referenced&field=author_name&q=Chen+Zongxuan&prev_q=Chen%20Zongxuan\",\"WARC-Payload-Digest\":\"sha1:ND3WSHPASTWXOGZZ4E6LCDZW6U34J5MK\",\"WARC-Block-Digest\":\"sha1:EMMY4SAHPFOBBB7H4A3EZGRFHGCM6GIS\",\"WARC-Identified-Payload-Type\":\"application/xhtml+xml\",\"warc_filename\":\"/cc_download/warc_2023/CC-MAIN-2023-40/CC-MAIN-2023-40_segments_1695233506646.94_warc_CC-MAIN-20230924123403-20230924153403-00369.warc.gz\"}"}
https://slideplayer.com/slide/7943605/
[ "", null, "# Fractions Explained By Graeme Henchel\n\n## Presentation on theme: \"Fractions Explained By Graeme Henchel\"— Presentation transcript:\n\nFractions Explained By Graeme Henchel\n\nIndex 3/7+2/3 No diagram Adding Mixed Numbers Multiplying Fractions\nWhat is a fraction? Mixed Numbers method 1 Mixed Numbers method 2 Equivalent Fractions Special form of one Why Special form of one Finding equivalent fractions Simplifying Fractions Adding: Common denominators Adding: Different denominators Common denominators 1 Common denominators 2 ½+1/3 with diagram 1/3+1/4 with diagram ½ +2/5 with diagram 3/7+2/3 No diagram Adding Mixed Numbers Multiplying Fractions Multiplying Mixed Numbers 1 Multiplying Mixed numbers 2 Multiplying Mixed diagram Dividing Fractions Fraction Flowchart .ppt Fraction Flowchart .doc (download) Decimal Fractions Fraction<->Decimal<-> % 100 Heart (Percentages)\n\nWhat is a Fraction? A fraction is formed by dividing a whole into a number of parts I’m the NUMERATOR. I tell you the number of parts I’m the DENOMINATOR. I tell you the name of part\n\nMixed numbers to improper fractions\nConvert whole numbers to thirds Mixed number Improper fraction\n\nAnother Way to change Mixed Numbers to improper fractions\nIn short 5x3+2=17 Since 5/5=1 there are 5 fifths in each whole. So 3 wholes will have 3x5=15 fifths. Plus the 2 fifths already there makes a total of 15+2=17 fifths\n\nEquivalent fractions An equivalent fraction is one that has the same value and position on the number line but has a different denominator Equivalent fractions can be found by multiplying by a special form of 1\n\nMultiplying By a Special Form of One\nWhy does it work? Multiplying any number by 1 does not change the value 4x1=4, 9x1=9 ………. Any number divided by itself =1. Multiplying a fraction by a special form of one changes the numerator and the denominator but DOES NOT CHANGE THE VALUE\n\n1\n\nFinding equivalent fractions\nConvert 5ths to 20ths That’s 4 so I must multiply by What do we multiply 5 by to get a product of 20? Special form of 1\n\nSimplifying Fractions: Cancelling\nSimplifying means finding an equivalent fraction with the LOWEST denominator by making a special form of 1 equal to 1 1 Another way of doing this\n\nAdding Fractions with common denominators\n\nAdding Fractions with different denominators\nProblem: You can’t add fractions with different denominators without getting them ready first. They will be ready to add when they have common denominators Solution: Turn fractions into equivalent fractions with a common denominator that is find the Lowest Common Multiple (LCM) of the two denominators\n\nFinding the Lowest Common Denominator\nThe lowest common multiple of two numbers is the lowest number in BOTH lists of multiples Multiples of 2 are 2, 4, 6, 8, 10…… Multiples of 3 are 3, 6, 9, 12, ……… What is the lowest common multiple?\n\nFinding the Lowest Common Denominator\nThe lowest common multiple of two numbers is the lowest number they will BOTH divide into 2 divides into 2, 4, 6, 8….. 3 divides into 3, 6, 9…. What is the lowest number 2 and 3 both divide into?\n\nYou can’t add fractions with different denominators\n+ The Lowest Common Multiple of 2 and 3 is 6 so turn all fractions into sixths Special form of 1\n\nLowest common denominator is 10 so make all fractions tenths\n\nTurn both fractions into twelfths\n\nWhat is the lowest number BOTH 3 and 7 divide into?\nFinally the fractions are READY to add. I just have to add the numerators 9+14=23 It is 3/3 So I multiply 3/7 by 3/3 It is 7/7 So I multiply 2/3 by 7/7 What is the lowest number BOTH 3 and 7 divide into? Hmmmmm?????? What special form of 1 will change 7 to 21. Hmmmm? What special form of 1 will change 3 to 21. Hmmmm? It is 21. So that is my common denominator Now 3x3=9 and 2x7=14 Now I know the new numerators\n\nAdding Mixed Numbers Separate the fraction and the whole number sections, add them separately and recombine at the end\n\nMultiplying Fractions\n\nMultiplying Fractions\n\nMultiplying Mixed Numbers 1\nChange to Improper fractions before multiplying\n\nMultiplying Mixed numbers 2\n\nDivision of Fractions By Graeme Henchel\n\nTurn the second fraction upside down and multiply\nThe Traditional Way Turn the second fraction upside down and multiply\n\nDivision of fractions the short version\nInvert the 2nd fraction and multiply\n\nDivision with numbers only the full story\n\nAn Alternative way Convert to equivalent fractions with a common denominator and then you just divide the numerators only\n\nForm equivalent fractions with common denominators\nA visual representation Form equivalent fractions with common denominators\n\nDecisions and Actions in evaluating fraction problems\nFraction Flowchart Decisions and Actions in evaluating fraction problems Graeme Henchel\n\nFLOWCHART and Skill set\nThe following should be used with the Fraction Flow chart word doc. Download from\n\nDecision: What is the operation?\nx,÷ + , -\n\nDecision: Are there Mixed Numbers?\n+, - Decision: Are there Mixed Numbers? For example is a mixed number YES Mixed Numbers? NO\n\nACTION: Evaluate Whole numbers\n+, - Evaluate the whole number part and keep aside till later 4+3=7\n\nDecision: Are there common Denominators?\n+, - For example and have the same (common) denominator Common Denominators? YES NO\n\nAction: Find equivalent fractions\n+, - Find equivalent fractions with common (the same) denominators Multiply by a special form of 1 Multiply by a special form of 1\n\nAction: Add or Subtract the numerators\n+, - Add (or subtract) the numerators this is the number of parts 2+3=5 Keep the Common Denominator. This is the name of the fraction\n\nDecision: Is the numerator negative?\n+, - Decision: Is the numerator negative? Is numerator negative? YES NO This numerator is negative\n\nAction: Borrow a whole unit\n+, - Action: Borrow a whole unit Borrow 1 from the whole number part Write it as an equivalent fraction Add this to your negative fraction Remember to adjust your whole number total\n\nAction: Add any whole number part\n+, - Action: Add any whole number part\n\n+, - That’s All Folks\n\nDecision: Are there Mixed Numbers?\nFor example is a mixed number YES NO Mixed Numbers?\n\nAction: Change to improper fractions\nx,÷ Action: Change to improper fractions OR 4X5=20 and 20+3=23\n\nDecision: Is this a X or a ÷ problem?\n\nAction: Invert the 2nd Fraction and replace division ÷ with multiply x\nInvert the 2nd fraction and multiply\n\nDecision : Is cancelling Possible?\nx,÷ Decision : Is cancelling Possible? Do numbers in the numerators and the denominators have common factors Yes No Common factors in numerators and denominators\n\nAction Simplify by cancelling\nx,÷ Action Simplify by cancelling 1 1 ÷ 3 ÷ 5 ÷ 3 ÷ 5 2 2\n\nACTION: Multiply the numerators AND the denominators\nx,÷ ACTION: Multiply the numerators AND the denominators\n\nDecision: Is the product improper (top heavy)\nx,÷ Decision: Is the product improper (top heavy) Yes No Is the fraction improper ? (top heavy)\n\nAction: Change to a mixed Number\n\nx,÷ That’s All Folks\n\nRepresenting Decimal Fractions\n1 1 1 1 decimal point\n\nRepresenting Decimal Fractions\n1 3 5 2 decimal point\n\nConverting Fractions to decimals and %\nGraeme Henchel\n\nConversions 0.4 40% Multiply by a special form of 1 Divide 2 by 5\nFind 2÷5 Multiply by a special form of 1 Write as a decimal using place value Write as a fraction with 10 as denominator 0.4 Multiply by a special form of 1 Multiply by special form of 1 40%\n\nDivide numerator and denominator by a common factor of 2\nConversions Divide numerator and denominator by a common factor of 2 Write as a fraction with 100 as denominator then divide numerator and denominator by common factor of 20 0.4 Write as a fraction with 100 as denominator then divide numerator and denominator by common factor of 10 40%\n\n Move decimal point 2 places left\nConversions 0.4 Divide 40 by 100  Move decimal point 2 places left 40 % 40%\n\nGraeme Henchel http://hench-maths.wikispaces.com\nPercentages 100 hearts Graeme Henchel\n\nVisual representations\n100% 1% 5% 10% 20% 25% 33⅓% 50% Percent = per hundred\n\n100%=100/100\n\n1%=1/100\n\n5%=5/100=1/20\n\n10%=10/100=1/10\n\n20%=20/100=1/5\n\n25%=25/100=1/4\n\n33⅓%=33⅓/100=⅓\n\n50%=50/100=½\n\nDownload ppt \"Fractions Explained By Graeme Henchel\"\n\nSimilar presentations" ]
[ null, "https://slideplayer.com/static/blue_design/img/slide-loader4.gif", null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.83277863,"math_prob":0.9690997,"size":8209,"snap":"2022-40-2023-06","text_gpt3_token_len":2180,"char_repetition_ratio":0.20414382,"word_repetition_ratio":0.13837375,"special_character_ratio":0.2599586,"punctuation_ratio":0.077217616,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.99925554,"pos_list":[0,1,2],"im_url_duplicate_count":[null,null,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2022-09-28T09:55:50Z\",\"WARC-Record-ID\":\"<urn:uuid:ce75d182-2e5d-4610-af8a-5346b1e6a6cc>\",\"Content-Length\":\"251750\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:87f6decc-5013-4399-b422-e14a038f879e>\",\"WARC-Concurrent-To\":\"<urn:uuid:dec7d565-da61-4bf7-a74e-39944867e4c1>\",\"WARC-IP-Address\":\"88.99.70.210\",\"WARC-Target-URI\":\"https://slideplayer.com/slide/7943605/\",\"WARC-Payload-Digest\":\"sha1:AF432ZCHV224HTKELF5HGHTBTHQCEYLB\",\"WARC-Block-Digest\":\"sha1:WJVTFOGUNTG2Z4ZM2U2PAYBHDUVNDBZP\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2022/CC-MAIN-2022-40/CC-MAIN-2022-40_segments_1664030335190.45_warc_CC-MAIN-20220928082743-20220928112743-00621.warc.gz\"}"}
https://simplywall.st/stocks/us/food-beverage-tobacco/nyse-ko/coca-cola/news/the-coca-cola-company-nyseko-investors-are-paying-above-the-intrinsic-value-2/
[ "# The Coca-Cola Company (NYSE:KO) Investors Are Paying Above The Intrinsic Value\n\nToday I will be providing a simple run through of a valuation method used to estimate the attractiveness of The Coca-Cola Company (NYSE:KO) as an investment opportunity by taking the expected future cash flows and discounting them to today’s value. I will use the Discounted Cash Flows (DCF) model. It may sound complicated, but actually it is quite simple! Anyone interested in learning a bit more about intrinsic value should have a read of the Simply Wall St analysis model. If you are reading this and its not December 2018 then I highly recommend you check out the latest calculation for Coca-Cola by following the link below.\n\n### Is KO fairly valued?\n\nWe are going to use a two-stage DCF model, which, as the name states, takes into account two stages of growth. The first stage is generally a higher growth period which levels off heading towards the terminal value, captured in the second ‘steady growth’ period. In the first stage we need to estimate the cash flows to the business over the next five years. For this I used the consensus of the analysts covering the stock, as you can see below. I then discount this to its value today and sum up the total to get the present value of these cash flows.\n\n#### 5-year cash flow forecast\n\n 2019 2020 2021 2022 2023 Levered FCF (\\$, Millions) \\$8.31k \\$9.01k \\$8.91k \\$10.45k \\$9.66k Source Analyst x8 Analyst x8 Analyst x2 Analyst x1 Est @ -7.51% Present Value Discounted @ 8.59% \\$7.66k \\$7.65k \\$6.96k \\$7.51k \\$6.40k\n\nPresent Value of 5-year Cash Flow (PVCF)= US\\$36b\n\nWe now need to calculate the Terminal Value, which accounts for all the future cash flows after the five years. For a number of reasons a very conservative growth rate is used that cannot exceed that of the GDP. In this case I have used the 10-year government bond rate (2.9%). In the same way as with the 5-year ‘growth’ period, we discount this to today’s value at a cost of equity of 8.6%.\n\nTerminal Value (TV) = FCF2022 × (1 + g) ÷ (r – g) = US\\$9.7b × (1 + 2.9%) ÷ (8.6% – 2.9%) = US\\$176b\n\nPresent Value of Terminal Value (PVTV) = TV / (1 + r)5 = US\\$176b ÷ ( 1 + 8.6%)5 = US\\$117b\n\nThe total value is the sum of cash flows for the next five years and the discounted terminal value, which results in the Total Equity Value, which in this case is US\\$153b. In the final step we divide the equity value by the number of shares outstanding. If the stock is an depositary receipt (represents a specified number of shares in a foreign corporation) or ADR then we use the equivalent number. This results in an intrinsic value of \\$35.94. Relative to the current share price of \\$47.9, the stock is quite expensive and not available at a discount at this time.\n\n### Important assumptions\n\nNow the most important inputs to a discounted cash flow are the discount rate, and of course, the actual cash flows. If you don’t agree with my result, have a go at the calculation yourself and play with the assumptions. Because we are looking at Coca-Cola as potential shareholders, the cost of equity is used as the discount rate, rather than the cost of capital (or weighed average cost of capital, WACC) which accounts for debt. In this calculation I’ve used 8.6%, which is based on a levered beta of 0.800. This is derived from the Bottom-Up Beta method based on comparable companies, with an imposed limit between 0.8 and 2.0, which is a reasonable range for a stable business.\n\n### Next Steps:\n\nWhilst important, DCF calculation shouldn’t be the only metric you look at when researching a company. What is the reason for the share price to differ from the intrinsic value? For KO, I’ve compiled three key aspects you should further research:\n\n1. Financial Health: Does KO have a healthy balance sheet? Take a look at our free balance sheet analysis with six simple checks on key factors like leverage and risk.\n2. Future Earnings: How does KO’s growth rate compare to its peers and the wider market? Dig deeper into the analyst consensus number for the upcoming years by interacting with our free analyst growth expectation chart.\n3. Other High Quality Alternatives: Are there other high quality stocks you could be holding instead of KO? Explore our interactive list of high quality stocks to get an idea of what else is out there you may be missing!\n\nPS. Simply Wall St does a DCF calculation for every US stock every 6 hours, so if you want to find the intrinsic value of any other stock just search here.\n\nTo help readers see past the short term volatility of the financial market, we aim to bring you a long-term focused research analysis purely driven by fundamental data. Note that our analysis does not factor in the latest price-sensitive company announcements.\n\nThe author is an independent contributor and at the time of publication had no position in the stocks mentioned. For errors that warrant correction please contact the editor at [email protected].", null, "" ]
[ null, "https://simplywall.st/api/company/image/NYSE:KO/cover", null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.9213696,"math_prob":0.9105557,"size":4910,"snap":"2020-10-2020-16","text_gpt3_token_len":1171,"char_repetition_ratio":0.10354668,"word_repetition_ratio":0.0,"special_character_ratio":0.24745418,"punctuation_ratio":0.096969694,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.95727646,"pos_list":[0,1,2],"im_url_duplicate_count":[null,1,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2020-03-30T04:59:22Z\",\"WARC-Record-ID\":\"<urn:uuid:bfd73d3e-a157-4ddb-bf98-841691efaba6>\",\"Content-Length\":\"56111\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:4443b8d2-0ea1-4202-9c17-bac011840050>\",\"WARC-Concurrent-To\":\"<urn:uuid:17bbf7a3-e1b8-4351-9b3d-df0c2a7e7933>\",\"WARC-IP-Address\":\"104.22.58.246\",\"WARC-Target-URI\":\"https://simplywall.st/stocks/us/food-beverage-tobacco/nyse-ko/coca-cola/news/the-coca-cola-company-nyseko-investors-are-paying-above-the-intrinsic-value-2/\",\"WARC-Payload-Digest\":\"sha1:L2LXGAS6GBFSUFC46LTQFABJT2TXCK34\",\"WARC-Block-Digest\":\"sha1:X2UXVYR57KCVLGSGXDKG6PXMJREKANAI\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2020/CC-MAIN-2020-16/CC-MAIN-2020-16_segments_1585370496523.5_warc_CC-MAIN-20200330023050-20200330053050-00124.warc.gz\"}"}
https://ask.truemaths.com/question/two-sides-ab-and-bc-and-median-am-of-one-triangle-abc-are-respectively-equal-to-sides-pq-and-qr-and-median-pn-of-%CE%B4pqr-see-fig-7-40-show-thatii-%CE%B4abc-%CE%B4pqr-q3ii/
[ "Newbie\n\n# Two sides AB and BC and median AM of one triangle ABC are respectively equal to sides PQ and QR and median PN of ΔPQR (see Fig. 7.40). Show that:(ii) ΔABC ΔPQR .Q3(ii)\n\n• 0\n\nSir please help me to solve the ncert class 9th solution of chapter triangles.How I solve this question of exercise 7.3 question number 3(ii) . Find the simplest and easiest solution of this question , also give me the best solution of this question. Two sides AB and BC and median AM of one triangle ABC are respectively equal to sides PQ and QR and median PN of ΔPQR (see Fig. 7.40). Show that:(ii) ΔABC ΔPQR .\n\nShare" ]
[ null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.9122621,"math_prob":0.97458583,"size":720,"snap":"2022-40-2023-06","text_gpt3_token_len":206,"char_repetition_ratio":0.13547486,"word_repetition_ratio":0.4117647,"special_character_ratio":0.2625,"punctuation_ratio":0.1125,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.97407705,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2023-02-01T15:58:39Z\",\"WARC-Record-ID\":\"<urn:uuid:2f944179-1792-4e26-892f-36e54a5dc09d>\",\"Content-Length\":\"161024\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:0ff283e1-4e9f-40b2-b69d-65c438c6a383>\",\"WARC-Concurrent-To\":\"<urn:uuid:2229952d-1142-4048-9e25-227ce46a2b0d>\",\"WARC-IP-Address\":\"104.21.63.18\",\"WARC-Target-URI\":\"https://ask.truemaths.com/question/two-sides-ab-and-bc-and-median-am-of-one-triangle-abc-are-respectively-equal-to-sides-pq-and-qr-and-median-pn-of-%CE%B4pqr-see-fig-7-40-show-thatii-%CE%B4abc-%CE%B4pqr-q3ii/\",\"WARC-Payload-Digest\":\"sha1:IMGRQNQO5YPLAUIHKJGAF2JL2ME2SRB6\",\"WARC-Block-Digest\":\"sha1:4HEANL6SNM2FLN2PRYRHWTQUIDR7Z7FM\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2023/CC-MAIN-2023-06/CC-MAIN-2023-06_segments_1674764499946.80_warc_CC-MAIN-20230201144459-20230201174459-00241.warc.gz\"}"}
https://kr.mathworks.com/matlabcentral/cody/problems/2784-y-x/solutions/546803
[ "Cody\n\n# Problem 2784. Y=X\n\nSolution 546803\n\nSubmitted on 17 Dec 2014 by Camille Douay\nThis solution is locked. To view this solution, you need to provide a solution of the same size or smaller.\n\n### Test Suite\n\nTest Status Code Input and Output\n1   Pass\n%% x = 1; y_correct = 1; assert(isequal(setEqual(x),y_correct))\n\n2   Pass\n%% x = 5; y_correct = 5; assert(isequal(setEqual(x),y_correct))" ]
[ null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.5998832,"math_prob":0.98712736,"size":467,"snap":"2020-24-2020-29","text_gpt3_token_len":133,"char_repetition_ratio":0.14902808,"word_repetition_ratio":0.0,"special_character_ratio":0.31049252,"punctuation_ratio":0.14772727,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9654657,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2020-07-07T20:08:03Z\",\"WARC-Record-ID\":\"<urn:uuid:26ca9530-57c0-44cf-b2ae-60b42b01d181>\",\"Content-Length\":\"71714\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:a82f30dc-5e66-468c-bc71-6059ed7df2c6>\",\"WARC-Concurrent-To\":\"<urn:uuid:92f8f3b5-cc46-4132-9067-719309065885>\",\"WARC-IP-Address\":\"23.66.56.59\",\"WARC-Target-URI\":\"https://kr.mathworks.com/matlabcentral/cody/problems/2784-y-x/solutions/546803\",\"WARC-Payload-Digest\":\"sha1:Q44TO4E3UZMJBH3WDZFIDMTIPLHDACLP\",\"WARC-Block-Digest\":\"sha1:W37KM5DBCTMN2JP2EBF6T2H3W6DRXVMM\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2020/CC-MAIN-2020-29/CC-MAIN-2020-29_segments_1593655894904.17_warc_CC-MAIN-20200707173839-20200707203839-00555.warc.gz\"}"}
https://charline-picon.com/greatest-common-factor-of-21-and-33/
[ "Here is a handy little GCF Calculator that you deserve to use to discover the GCF of two numbers 21, 33 i.e. 3 the largest number that divides both the numbers exactly.\n\nYou are watching: Greatest common factor of 21 and 33\n\nGreatest typical Factor that 21 and also 33 is 3\n\nGCF(21, 33) = 3\n\nEx: number 1 - 1500 and number 2 - 20.\nGiven Inputs are 21, 33\n\nTo discover the GCF making use of the element Factorization method you simply need to list the end the prime determinants of both the numbers.\n\nPrime administer of 21 together under\n\n 3 21 7 7 1\n\nPrime factors of 21 room 3,7. Prime factorization that 21 in exponential form is:\n\n21 = 31×71Prime administer of 33 is as such\n\n 3 33 11 11 1\n\nPrime determinants of 33 room 3,11. Prime factorization of 33 in exponential type is:\n\n33 = 31×111Occurrences of usual Prime components from both the numbers 21 and also 33 is 3Therefore, GCF of 2 numbers 21 and also 33 is 3\n\nGCF the 21, 33 using Factoring Method\n\nGiven entry data is 21, 33\n\nMake a perform of components for the matching input numbers\n\nFactors the 21\n\nList of positive integer components of 21 that divides 21 there is no a remainder.\n\n1,3,7,21\n\nFactors that 33\n\nList of optimistic integer determinants of 33 the divides 33 without a remainder.\n\n1,3,11,33Figure out the highest typical factor from components of both the numbers and that is the GCF. In this case, the is 3\n\nTherefore, GCF of two numbers 21 ad 33 is 3\n\nRelated Greatest common Factor the 21\nRelated Greatest typical Factor the 33\nFrequently Asked concerns on GCF the 21 and 33\n\n1. What is the GCF of number 21 and also 33?\n\nGCF of number 21 and 33 is 3.\n\n2. Just how to uncover GCF the 21 and 33 easily?\n\nTake the assist of GCF Calculator existing and input the numbers 21, 33 in the intake field listed and tap top top the Calculate switch to avail the Greatest common Factor with thorough steps.\n\nSee more: What Is The Area Of A 10-Inch Pizza ? Pizza Comparison\n\n3. Where do I find sophisticated explanation on finding GCF of 21, 33?\n\nYou deserve to find an intricate explanation on detect GCF that 21, 33 on our page.\n\nfavorite Calculators Physics Calculator Maths Calculator Chemistry Calculator fraction Calculator Polynomial Calculator LCMGCF Calculator percent Calculator Area and Volume Calculator\nMost popular period Calculator Diamond trouble Solver weird or also Calculator Divisibility Calculator border Calculator latent Differentiation Calculator Reducing fractions Calculator fix for X fraction Calculator Domain and selection Calculator Velocity Calculator v = u + in ~ weight Conversions" ]
[ null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.82782066,"math_prob":0.991851,"size":2585,"snap":"2022-05-2022-21","text_gpt3_token_len":662,"char_repetition_ratio":0.17280124,"word_repetition_ratio":0.024229076,"special_character_ratio":0.26499033,"punctuation_ratio":0.08695652,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9984374,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2022-05-18T03:22:58Z\",\"WARC-Record-ID\":\"<urn:uuid:88ecefa5-36e9-42bb-8cd6-030464815ee1>\",\"Content-Length\":\"11746\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:9aaef0e5-8e84-4348-a7a8-aead98edb51a>\",\"WARC-Concurrent-To\":\"<urn:uuid:a2a7a14c-27e9-4cb3-95fc-c96319bd99d6>\",\"WARC-IP-Address\":\"104.21.25.20\",\"WARC-Target-URI\":\"https://charline-picon.com/greatest-common-factor-of-21-and-33/\",\"WARC-Payload-Digest\":\"sha1:SDCXXX4QYSHR4K7ZRI2JRMQRUSPUSHNX\",\"WARC-Block-Digest\":\"sha1:3FANRU7G457TSZIHNAZMUWPDWHCELOID\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2022/CC-MAIN-2022-21/CC-MAIN-2022-21_segments_1652662521041.0_warc_CC-MAIN-20220518021247-20220518051247-00375.warc.gz\"}"}
https://communities.acs.org/docs/DOC-53187
[ "# Open Quantum Physics and Environmental Heat Conversion into Usable Energy\n\nVersion 5Show Document\n\nBentham Science Publishers Ltd.\n\nExecutive Suite Y - 2\n\nPO Box 7917, Saif Zone\n\nSharjah, U.A.E.\n\n# Conversion into Usable Energy\n\nCenter of Advanced Studies in Physics\n\nInstitute of Mathematics ”Simion Stoilow” of the Romanian Academy\n\nBucharest, Romania\n\n#### Abstract:\n\nIntroduction, Pp. 1-4 (4)\nAbstract\nThis eBook is devoted to the domain of physics we call Open Quantum Physics, which seemed important for the new field of research of the environmental heat conversion into usable energy. For this research, a special mathematical tool has been used, consisting of master equations for systems of particles as Fermions, Bosons, and electromagnetic field. This effort was based on the previous results of Lindblad, Sandulescu, and Scutaru for a description of the dissipative coupling of a system of interest in accordance with the quantum principles. We used the method of Ford, Lewis, and O’Connell for reducing the total dynamics to a master equation for a system of interest. The results of our research are presented in this eBook in a more general framework of open physics.\n\nQuantum dynamics, Pp. 5-52 (48)\nAbstract\nIn this chapter, we derived some elements of quantum mechanics, which are essential for the further development of our theory: the momentum of a system of Fermions in the second quantization, the coordinate and momentum of a harmonic oscillator as a unique operator at two different moments of time, Boson and Fermion operator algebra, coherent states, the electron-field interaction, the quantization of the electromagnetic field, Boson and Fermion distributions, and densities of states in a degenerate, or a non-degenerate system of Fermions. Our starting point is the wave nature of a quantum particle, the Hamiltonian equations were obtained as group velocities in the two conjugate spaces of the wave, of the coordinates and of the momentum. In this way, the Schr¨odinger equation and the electron-field potential of interaction are obtained from quantum equations generated by the particle wave function.\n\nDissipative dynamics, Pp. 53-92 (40)\nAbstract\nIn this chapter, we describe various mechanisms and characteristics of dissipation, mostly in physical terms, as they have been perceived at the beginning. We get a microscopic understanding of temperature, and of the main dissipation effects. We obtain the entropy dynamics, according to principle two of thermodynamics, from the Pauli master equation, as the simplest description of a system defined by states, occupation probabilities, and transition probabilities. For various expansions of these probabilities as functions of coordinates, stochastic equations are obtained for the time evolutions of these coordinates. In this framework, we describe the electron and hole transport in semiconductors. We present various trials for completing a Schr¨odinger equation with dissipative terms, and the method of projection operators for a description of a system coupled to a dissipative environment.\n\nAxiomatic open quantum physics, Pp. 93-108 (16)\nAbstract\nThis chapter is devoted to Lindblad master equation, obtained by a generalization of the quantum dynamic group to a time dependent semigroup. For this equation, we present a demonstration of Alicki and Lendi, obtained by a linear approximation of the openness operator, which describes the time evolution of a system of interest in an environment. We re-obtain this equation by taking the total dynamic equation with a bilinear dissipative potential in system and environment operators, and tracing over the environment states. In this way, we get physical expressions of the dissipation coefficients, as functions of the system operators. We present the quantum theory of Sandulescu and Scutaru, where the dissipative dynamics is described by friction and diffusion processes, with coefficients which satisfy fundamental constraints.\n\nQuantum tunneling with dissipative coupling, Pp. 109-126 (18)\nAbstract\nThis chapter is devoted to quantum tunneling, as a basic quantum process, essential for important applications. Tunneling between two wells, of the double well potential of a one particle system of interest, makes sense only when a second system, capable to distinguish between the presence of the particle in a well, or in the other well, is present. The potential of interaction between such two systems is called tunneling operator. We treat a few problems of interest as tunneling in a quasi-continuum of states, the energy shift in a well by the proximity of another well, dissipation effects, and tunneling spectrum.\n\nAtom-field interaction with dissipative coupling, Pp. 127-154 (28)\nAbstract\nIn this chapter, we treat the basic quantum process of electromagnetic field propagation through an atomic system in a resonant Fabry-Perot cavity. We obtain the transmission characteristic of such a cavity, which is a basic element for a quantum heat converter. When the system is opened only by a population decay and a polarization dephasing, we get only an optical bistability characteristic. By openness according to the Lindblad- Sandulescu-Scutaru theory, we get also a coupling through environment between population and polarization, which, in some conditions, leads to an energy transfer from the disordered environment to the coherent electromagnetic field. We find that this phenomenon, which has experimental evidence, is an effect of an atom-atom coupling.\n\nMicroscopic open quantum physics, Pp. 155-190 (36)\nAbstract\nIn this chapter, we derive quantum master equations with explicit, microscopic coefficients, for the systems of interest of a superradiant semiconductor structure: the active electrons, the electromagnetic field, and the optical crystal vibrations. These vibrations determine an important retardation in the field propagation (refractive index), and a spectrum splitting (the Raman effect). For the active electrons we consider three environmental systems: the quasi-free electrons/holes of the conduction regions, the crystal lattice vibrations excited by electron transitions, and the free electromagnetic field. For the electromagnetic field, we consider the absorption by coupling to the conduction electrons/holes, and to the optical vibrations of the crystal, while these vibrations are damped by coupling with the valence electron transitions to thermally released states. For the electron-field coupling we consider the potential derived in chapter 2 from the Lorentz force, while the momentum difference is supposed to be taken by the crystal lattce. For the coupling of the crystal vibrations to the electromagnetic field and electron transitions we consider potentials obtained from the momentum conservation. For the active electrons, we find a quantum master equation with a Markovian term describing correlated transitions with the environmental particles, and a non-Markovian term given by the self-consistent field of the environmental particles. Since the dissipative environment of the electromagnetic field is contained inside the quantization volume of this field, which is taken as a unit volume, its quantum master equation includes a dissipative term of a space integral form. For the field mean values, the dissipation integral, of propagation through the dissipative environment, can be divided in two parts: an integral from the initial coordinate up to the boundary of the quantum uncertainty region, taken for a coherent wave, which describes dephasing, and an integral over the uncertainty region, which describes absorption. Similar equations are obtained for the optical vibration field. When the vibrational field is eliminated from these equations, we obtain a frequency splitting, corresponding to the Raman effect, and an absorption rate, including the absorption of the electromagnetic waves by conduction electrons/holes, and the absorption of the vibrational waves by the valence electrons, excited by the crystal deformations in the thermally released states.\n\nOpen hydrogen atom, Pp. 191-208 (18)\nAbstract\nIn this chapter, we apply our quantum master equation for a system of Fermions in free electromagnetic field to a hydrogen atom. We obtain a quantum master equation describing transitions between the eigenstates of a hydrogen atom, with coefficients depending on the hydrogen wave functions. We find that these coefficients are in agreement with published experimental data for life times of the lower excited states.\n\nQuantum heat converter, Pp. 209-230 (22)\nAbstract\nIn this chapter, we apply the theory developed in chapter 7 to a superradiant semiconductor device for the conversion of the environmental heat into coherent electromagnetic energy. The operation principle of the device is formulated in simple terms, as a superradiant flow mainly supplied by heat absorption, only a much smaller part of the energy necessary for producing this flow being supplied from outside. This mechanism seems to counter the second principle of thermodynamics, but in fact does not, because this principle refers to an atomic system, describable by the Pauli master equation, as we showed in subsection 3.2.1. Any modification of this equation, as is our case of interaction with an electromagnetic field, involves a modification of the entropy dynamics. We calculate the wave-function, the corresponding dipole moments, and the dissipation coefficients, and obtain the superradiant power in the mean field approximation. When the field propagation, coupled to the crystal optical vibration, is taken into account, we get a resonance frequency shift with the Raman frequency, and a small decrease of the superradiant power by Raman effect." ]
[ null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.9020696,"math_prob":0.94857985,"size":9700,"snap":"2019-51-2020-05","text_gpt3_token_len":1904,"char_repetition_ratio":0.14686468,"word_repetition_ratio":0.018030513,"special_character_ratio":0.1814433,"punctuation_ratio":0.113377325,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9760106,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2020-01-19T11:52:52Z\",\"WARC-Record-ID\":\"<urn:uuid:1652b4e7-cc5e-4244-bfab-1a825e6b6b6c>\",\"Content-Length\":\"86497\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:ef0a32ad-f7fd-4067-b7d6-30172f6a580f>\",\"WARC-Concurrent-To\":\"<urn:uuid:35269605-2bba-4342-84ef-241c2cefef0a>\",\"WARC-IP-Address\":\"104.94.117.123\",\"WARC-Target-URI\":\"https://communities.acs.org/docs/DOC-53187\",\"WARC-Payload-Digest\":\"sha1:VLBKV7SINMYQJJB66FHJIAS7PGEGBMIC\",\"WARC-Block-Digest\":\"sha1:4XZ7F7E4ZXM6MV46HT7AAXJOBPCVFBNV\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2020/CC-MAIN-2020-05/CC-MAIN-2020-05_segments_1579250594391.21_warc_CC-MAIN-20200119093733-20200119121733-00408.warc.gz\"}"}
https://www.vocaidapps.com/portfolio/loan-calculator/
[ "", null, "# Loan Calculator\n\n• Alexa, open loan calculator\n• calculate total payment on four thousand for sixty months at two percentage\n• calculate monthly payment on four thousand for sixty months at two percenta\n\nSimple Alexa Skill to calculate loan via doing anything. No need to take your phone out of pocket or look for a calculator in drawer every time you need to calculate loan. Just ask Alexa to open loan calculator.\n\nExample phrases:\n1. calculate total payment on four thousand for sixty months at two percentage\n2. total payment on four thousand for sixty months at two percentage\n3. calculate monthly payment on four thousand for sixty months at two percentage\n4. calculate yearly payment on four thousand for sixty months at two percentage" ]
[ null, "https://www.vocaidapps.com/wp-content/uploads/2020/06/calculator-1.png", null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.9084657,"math_prob":0.98672175,"size":934,"snap":"2023-40-2023-50","text_gpt3_token_len":189,"char_repetition_ratio":0.17526881,"word_repetition_ratio":0.28387097,"special_character_ratio":0.19593148,"punctuation_ratio":0.09195402,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.97458076,"pos_list":[0,1,2],"im_url_duplicate_count":[null,2,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2023-11-30T05:00:23Z\",\"WARC-Record-ID\":\"<urn:uuid:72942396-d4ab-4e56-bde6-a85e596a8744>\",\"Content-Length\":\"222735\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:ef1b26dc-9121-4fa7-9404-f9933296888d>\",\"WARC-Concurrent-To\":\"<urn:uuid:e5f8720b-71bb-470b-8877-04ee04339aaf>\",\"WARC-IP-Address\":\"139.162.42.65\",\"WARC-Target-URI\":\"https://www.vocaidapps.com/portfolio/loan-calculator/\",\"WARC-Payload-Digest\":\"sha1:643ACELFV5X6DW47DHLFZGQJRXMEEJM6\",\"WARC-Block-Digest\":\"sha1:ZK7BMCEB7T6G52IEXT5O5PG6BX4GK2A5\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2023/CC-MAIN-2023-50/CC-MAIN-2023-50_segments_1700679100164.87_warc_CC-MAIN-20231130031610-20231130061610-00724.warc.gz\"}"}
https://www.proprofs.com/quiz-school/story.php?title=njm4nzk5kx1x
[ "# 2013 Update Lecture One\n\n10 Questions | Attempts: 250\nShare", null, "", null, "Settings", null, "", null, "This quiz is based off the material you read in the previous lecture.\n\n• 1.\nOn a Lab Scope Voltage is measured ___________ and Time is measured __________.\n• A.\n\nVia X axis & Y Axis\n\n• B.\n\nLeft & Right\n\n• C.\n\nHorizontally & Vertically\n\n• D.\n\nVertically & Horizontally\n\n• 2.\nAccording to Ford how many calculations per second does their EEC 5 calculate?\n• A.\n\n625\n\n• B.\n\n1.5 million\n\n• C.\n\n30,000\n\n• D.\n\n150,00\n\n• 3.\nWhich handheld device has a display rate of 4 times per second?\n• A.\n\nDSO\n\n• B.\n\nLAB SCOPE\n\n• C.\n\nDMM (DIGITAL MULTI METER)\n\n• D.\n\nLOGIC PROBE\n\n• 4.\nWill a voltmeter, display signal glitches?\n• A.\n\nTrue\n\n• B.\n\nFalse\n\n• 5.\nWhich one do you like?\n• A.\n\nOption 1\n\n• B.\n\nOption 2\n\n• C.\n\nOption 3\n\n• D.\n\nOption 4\n\n• 6.\nThe voltage of an electronic signal at any point in time is called?\n• A.\n\nAmplitude\n\n• B.\n\nTrigger\n\n• C.\n\nFrequency\n\n• D.\n\nShape\n\n• 7.\nSquare signals as we often refer to them are called?\n• A.\n\nDigital Signals\n\n• B.\n\nAnalog Signals\n\n• C.\n\nVolt Signals\n\n• D.\n\nAmp Signals\n\n• 8.\nSlope, is the direction at which the trace begins.\n• A.\n\nTrue\n\n• B.\n\nFalse\n\n• 9.\n19X speed is usually for engine speed\n• A.\n\nTrue\n\n• B.\n\nFalse\n\n• 10.\nThe 3x signal is usually used for coil pack identification\n• A.\n\nTrue\n\n• B.\n\nFalse\n\n## Related Topics", null, "Back to top\n×\n\nWait!\nHere's an interesting quiz for you." ]
[ null, "https://www.proprofs.com/quiz-school/images/story_settings_gear.png", null, "https://www.proprofs.com/quiz-school/images/story_settings_gear_color.png", null, "https://www.proprofs.com/quiz-school/images/new_smiley_loader.gif", null, "https://media.proprofs.com/images/QM/user_images/1826446/1678343941.jpg", null, "https://www.proprofs.com/quiz-school/img/top.png", null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.7591723,"math_prob":0.7630347,"size":448,"snap":"2023-14-2023-23","text_gpt3_token_len":138,"char_repetition_ratio":0.16216215,"word_repetition_ratio":0.0,"special_character_ratio":0.24107143,"punctuation_ratio":0.07317073,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9664983,"pos_list":[0,1,2,3,4,5,6,7,8,9,10],"im_url_duplicate_count":[null,null,null,null,null,null,null,1,null,null,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2023-03-26T08:22:26Z\",\"WARC-Record-ID\":\"<urn:uuid:9521c787-455c-4e84-855d-a937703e1188>\",\"Content-Length\":\"312786\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:32769b19-9183-4cfb-9aab-ef4d0354f33a>\",\"WARC-Concurrent-To\":\"<urn:uuid:8ebc28da-d1f6-4474-8149-87bf21c859db>\",\"WARC-IP-Address\":\"104.26.12.111\",\"WARC-Target-URI\":\"https://www.proprofs.com/quiz-school/story.php?title=njm4nzk5kx1x\",\"WARC-Payload-Digest\":\"sha1:4XWOKBWJ7W64UJ6L4QVGOQXKYDFSUPQI\",\"WARC-Block-Digest\":\"sha1:4LRIB4RPNTLRWBNO2BHVEAYMVLAG3TPX\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2023/CC-MAIN-2023-14/CC-MAIN-2023-14_segments_1679296945440.67_warc_CC-MAIN-20230326075911-20230326105911-00765.warc.gz\"}"}
https://www.wikihow.com/Calculate-a-Zero-Coupon-Bond
[ "# How to Calculate a Zero Coupon Bond\n\nMost bonds make periodic interest payments to their owners as a return on investment and a reward for taking the risk inherent in the bond. These payments are known as coupons, because many years ago bonds would actually come with coupons that you could mail in to prompt the payment of interest. A \"zero-coupon\" bond, however, does not make interest payments. Instead, the bond holder is rewarded with an increase in the value of the bond over time. You can calculate the present value of a zero coupon bond using a formula involving the stated yield (return), the par or face value, and the time until maturity (when the bond's par or face value will be paid out to the bond holder).\n\n## Steps\n\n1. 1\nAdd 1 to the required interest rate on the bond.\n• The required interest rate or \"yield-to-maturity\" is the rate of return that a bond is presumed to require in order to entice investors to purchase the bond. Generally, bonds that are riskier will require a higher rate of return in order to attract buyers. Risks can include the potential for default (the bond issuer being unable to pay back the bond holder) or the risk of a future increase in the interest rate of new bonds, which will decrease the attractiveness (relative value) of the present bond. Also the longer the remaining time until the bond matures and pays out its final value, the riskier the bond is (simply because of the increased potential for payout problems inherent in longer periods of time).\n• For example, in analyzing a zero coupon bond, if a comparable bond (one with the same time-to-maturity and issued by an equally viable company or government) sells at face value and pays an annual interest rate of 6%, then the required rate on the zero coupon bond being considered will also be 6%. Thus, for purposes of this formula, you would add 1 to 0.06 (6%) and the result is 1.06.\n2. 2\nDetermine the number of time periods (years in this case) remaining until the bond matures.\n• For example, if the bond issuer will pay the bond holder the face value of the bond in five years, then the time-to-maturity is five.\n3. 3\nTake the sum calculated in Step 1 above and raise it to the power of the remaining time period.\n• Thus, 1.06 raised to the power of 5 equals 1.338.\n• On a calculator, you would multiply 1.06 by itself four times in succession in order to raise it to the fifth power.\n4. 4\nDivide the par (face) value of the bond by the result of the previous step.\n• The par value of the bond is the amount that the bond issuer will pay to the bond holder when the bond matures. The par value is typically \\$1,000.\n• Thus, in this example, \\$1,000 divided by 1.338 equals 747.26. This means that the present value of a zero coupon bond providing a 6% rate of return by paying out \\$1,000 at maturity is \\$747.26.\n\n## Community Q&A\n\n• How do I calculate the price of a zero coupon bond that matures in 20 years if the market interest rate is 4 percent?\n200 characters left\n\n## Warnings\n\n• Make sure that the required rate of return and the number of time periods remaining until maturity are measured in the same units of time. In the above example, the stated interest rate was an annual one, and the number of time periods until maturity was measured in years.\nThanks!\n\n## Things You'll Need\n\n• Calculator" ]
[ null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.92878944,"math_prob":0.9800368,"size":3551,"snap":"2020-34-2020-40","text_gpt3_token_len":797,"char_repetition_ratio":0.15139554,"word_repetition_ratio":0.025316456,"special_character_ratio":0.23232892,"punctuation_ratio":0.09762901,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.99541116,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2020-08-08T04:00:45Z\",\"WARC-Record-ID\":\"<urn:uuid:aacf9eb9-68c4-40e4-a1b8-540e9ed33204>\",\"Content-Length\":\"221337\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:2f83f5fe-4186-447c-92e2-98fe699a7890>\",\"WARC-Concurrent-To\":\"<urn:uuid:d65bae30-5866-42aa-bc5d-dcd66dbfff04>\",\"WARC-IP-Address\":\"199.232.66.110\",\"WARC-Target-URI\":\"https://www.wikihow.com/Calculate-a-Zero-Coupon-Bond\",\"WARC-Payload-Digest\":\"sha1:IA3NO4H5Q3SJVRPUHPDV3H6FSIWGRWVA\",\"WARC-Block-Digest\":\"sha1:UO2WP235CLJOYT6VDDQPUFW2XG623ZXM\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2020/CC-MAIN-2020-34/CC-MAIN-2020-34_segments_1596439737238.53_warc_CC-MAIN-20200808021257-20200808051257-00379.warc.gz\"}"}
https://www.universalclass.com/articles/math/pre-algebra/how-to-perform-arithmetic-operations-on-radicals.htm
[ "How to Perform Arithmetic Operations on Radicals\n\nKey Terms\n\no         Associative\n\no         Distributive\n\nObjectives\n\no         Identify additional properties of multiplication and addition (associative and distributive properties)\n\no         Simplify radical expressions when appropriate\n\nPrimer for Arithmetic Operations on Radicals\n\nWe will look carefully at how to work with radicals by way of arithmetic operations (addition, subtraction, division, and multiplication). First, we introduce a mathematical concept that may or may not be familiar to you, but that is crucial to properly understanding this topic. When we multiply two numbers, for instance, we can generally write the product as another number. For example,", null, ". But what if one of the factors is unknown or cannot be written in an exact form? Let's consider multiplication of 4 by some unknown number c.", null, "We cannot simplify this expression further or write it as a single known number (because c is unknown). Likewise, consider multiplication of 4 by an irrational number", null, ". Because we cannot write", null, "as an exact decimal or as a fraction with integers in the numerator and denominator, we cannot write the product (in this case) as an exact decimal or a fraction.", null, "Thus, the way we will treat radicals is very similar to the way we must treat unknown numbers. We will leave them (in many cases) in radical form, knowing that they correspond to a specific, known number, but in the interest of exactness, we will not attempt to evaluate the radical. The results of any arithmetic operations will, in such cases, be expressions that include radicals.\n\nRecall that we identified addition and multiplication as commutative operations. Thus, for any two numbers a and b,", null, "", null, "To aid in our look at radical operations, we can also consider some additional properties of addition and multiplication (and, by implication, subtraction and division, since these operations can be rewritten as addition and multiplication, respectively). First, we note that addition and multiplication are both associative, meaning that we can group terms or factors in any way we wish. Given three numbers a, b, and c,", null, "", null, "This property simply says that we can perform a series of additions or multiplications in any order. (Recall from our study of the order of operations that expressions in parentheses must be evaluated first-hence we express the associative property as we have above.)\n\nAdditionally, we can show that multiplication is distributive, meaning that if we multiply a number a by the sum b + c, then", null, "We can illustrate this property in a more concrete manner by considering that the product of two factors x and y can be viewed as x sets of y objects. For instance, 7 sets of 8 objects is equal to 56 objects. But 7 sets of 8 is the same as 3 sets of 8 and 4 sets of 8, or 2 sets of 8 and 5 sets of 8. Consider a graphical illustration of multiplication for this example.", null, "", null, "Note above that", null, "and that", null, ". Furthermore, according to the representation of multiplication that we have used above, not only is", null, ", but", null, ". Thus, we can see from this example that multiplication is indeed distributive.", null, "Interested in learning more? Why not take an online class in Pre-Algebra?\n\nWe can now apply these concepts and properties to our understanding of radicals.\n\nLet's say we wanted to perform the following addition:", null, "As we have discussed, the square root of a number that is not a perfect square is irrational; thus, we cannot express it exactly as either a finite decimal or a fraction containing an integer numerator and integer denominator. Note, however, that we can use the fact that multiplication is distributive:", null, ". We'll start by rewriting the radical expressions slightly-this does not change the value of the expression, however.", null, "Note that we cannot simplify this expression any further and still keep it exact. Also, note that we can omit the multiplication symbol (", null, ") whenever doing so does not affect the clarity of the expression. Thus, we will, for the most part, omit this symbol for the remainder of this article. Let's look at a couple other examples.", null, "", null, "Note that we cannot perform these operations if the numbers under the radicals are different. Thus, for instance, the expressions below cannot be further simplified.", null, "", null, "We can also multiply and divide radicals.", null, "", null, "Practice Problem: Evaluate each expression, where possible.\n\na.", null, "b.", null, "c.", null, "d.", null, "e.", null, "f.", null, "Solution: In each case, simply follow the pattern demonstrated earlier. Until you get more familiar with the operations, you may need to very carefully follow the distributive property to find sums or differences of radical expressions. Note that the expression in part a cannot be evaluated any further; the expression in part f can be only partially evaluated.\n\na.", null, "b.", null, "c.", null, "d.", null, "e.", null, "f.", null, "To aid in performing the operations above, we must often simplify radicals. To illustrate, consider the following expression.", null, "A cursory look at this expression might seem to indicate that the expression cannot be simplified any further. Nevertheless, if we simplify the radical in the second term, we will find that we can actually perform the addition. The manipulations below rely only on the rules we have discussed so far.", null, "Thus,", null, "Above, we simplified the radical expression", null, "; this process is in some ways similar to reducing a fraction to lowest terms. In simplifying a radical, we are writing an equivalent expression that is easier to work with and that often leaves less room for error. The goal of this process is to write the radical expression such that the number under the radical is not divisible by a perfect square. For instance, in the radical expression", null, ", 8 is divisible by 4, which is a perfect square. As a result, we can simplify this expression by factoring out the 4, as we did above. We then calculate the square root of 4 (which is 2), leaving only a 2 under the radical. Since 2 is not divisible by any perfect squares, the radical form", null, "is in simplest form.\n\nPractice Problem: Evaluate each radical expression, where possible.\n\na.", null, "b.", null, "c.", null, "d.", null, "e.", null, "f.", null, "Solution: Each expression requires some degree of simplification of the radical. In some cases, you may take a slightly different approach, but the answer should be the same nonetheless. Not every step of the process is shown; if you are unsure of how a particular answer is achieved, consult the examples discussed above.\n\na.", null, "b.", null, "c.", null, "", null, "", null, "d.", null, "e.", null, "f.", null, "Another case where simplification is beneficial is a radical occurring in the denominator of a fraction. Consider the quotient expression we encountered above:", null, "One (perfectly legitimate) approach to evaluating this expression is to take the square root of 16 (which is 4) and then simplify the radical in the denominator.", null, "We are left, however, with a square root in the denominator. Although this is not an incorrect result, preventing occurrences of radicals in the denominator is often beneficial. Thus, we must find a way to remove the radical from the denominator. First, let's take note of the following, where y is any number:", null, "Of course, multiplying any number by 1 yields the original number; furthermore, if the numerator and denominator of a fraction are the same, then that fraction is equal to 1. Thus, we can remove a radical from the denominator of a fraction by calculating an equivalent fraction in the manner shown below.", null, "This is the same result we obtained earlier using a different approach to evaluating this expression. Below is another example of simplifying a fraction with a radical in the denominator.", null, "Finally, note that in such cases, we can write the expression with the radical in the numerator or with the radical as a factor multiplied by a fraction.", null, "Practice Problem: Simplify each of the following fractions.\n\na.", null, "b.", null, "c.", null, "d.", null, "Solution: In each case, multiply the numerator and denominator by the radical in the denominator and evaluate. Before doing so, however, performing other simplifications may make the process easier. In part c, the result can be written either as a single fraction or as a fraction minus an integer.\n\na.", null, "b.", null, "c.", null, "d.", null, "" ]
[ null, "https://cdn.4uc.org/gmzo/406/9770449/download/images/gmz9449x12600z2407002.gif", null, "https://cdn.4uc.org/gmzo/406/9770449/download/images/gmz9449x37418z2407004.gif", null, "https://cdn.4uc.org/gmzo/406/9770449/download/images/gmz9449x85672z2407006.gif", null, "https://cdn.4uc.org/gmzo/406/9770449/download/images/gmz9449x1303z2407007.gif", null, "https://cdn.4uc.org/gmzo/406/9770449/download/images/gmz9449x87200z2407009.gif", null, "https://cdn.4uc.org/gmzo/406/9770449/download/images/gmz9449x3995z2407011.gif", null, "https://cdn.4uc.org/gmzo/406/9770449/download/images/gmz9449x3300z2407013.gif", null, "https://cdn.4uc.org/gmzo/406/9770449/download/images/gmz9449x22114z2407015.gif", null, "https://cdn.4uc.org/gmzo/406/9770449/download/images/gmz9449x21464z2407017.gif", null, "https://cdn.4uc.org/gmzo/406/9770449/download/images/gmz9449x17184z2407019.gif", null, "https://cdn.4uc.org/gmzo/406/9770449/download/images/gmz9449x79291z2407020.gif", null, "https://cdn.4uc.org/gmzo/406/9770449/download/images/gmz9449x73686z2407021.gif", null, "https://cdn.4uc.org/gmzo/406/9770449/download/images/gmz9449x2800z2407023.gif", null, "https://cdn.4uc.org/gmzo/406/9770449/download/images/gmz9449x49549z2407025.gif", null, "https://cdn.4uc.org/gmzo/406/9770449/download/images/gmz9449x56936z2407027.gif", null, "https://cdn.4uc.org/gmzo/406/9770449/download/images/gmz9449x53176z2407029.gif", null, "https://cdn.4uc.org/gmzo/406/9770449/download/images/gmz9449x94276z2407031.gif", null, "https://cdn.4uc.org/gmzo/406/9770449/download/images/gmz9449x29225z2407033.gif", null, "https://cdn.4uc.org/gmzo/406/9770449/download/images/gmz9449x72690z2407034.gif", null, "https://cdn.4uc.org/gmzo/406/9770449/download/images/gmz9449x70482z2407036.gif", null, "https://cdn.4uc.org/gmzo/406/9770449/download/images/gmz9449x57531z2407038.gif", null, "https://cdn.4uc.org/gmzo/406/9770449/download/images/gmz9449x69243z2407040.gif", null, "https://cdn.4uc.org/gmzo/406/9770449/download/images/gmz9449x62295z2407042.gif", null, "https://cdn.4uc.org/gmzo/406/9770449/download/images/gmz9449x82552z2407044.gif", null, "https://cdn.4uc.org/gmzo/406/9770449/download/images/gmz9449x73099z2407046.gif", null, "https://cdn.4uc.org/gmzo/406/9770449/download/images/gmz9449x52612z2407048.gif", null, "https://cdn.4uc.org/gmzo/406/9770449/download/images/gmz9449x97175z2407050.gif", null, "https://cdn.4uc.org/gmzo/406/9770449/download/images/gmz9449x72393z2407052.gif", null, "https://cdn.4uc.org/gmzo/406/9770449/download/images/gmz9449x2657z2407054.gif", null, "https://cdn.4uc.org/gmzo/406/9770449/download/images/gmz9449x78745z2407056.gif", null, "https://cdn.4uc.org/gmzo/406/9770449/download/images/gmz9449x40z2407058.gif", null, "https://cdn.4uc.org/gmzo/406/9770449/download/images/gmz9449x44021z2407060.gif", null, "https://cdn.4uc.org/gmzo/406/9770449/download/images/gmz9449x59713z2407062.gif", null, "https://cdn.4uc.org/gmzo/406/9770449/download/images/gmz9449x1219z2407063.gif", null, "https://cdn.4uc.org/gmzo/406/9770449/download/images/gmz9449x40482z2407065.gif", null, "https://cdn.4uc.org/gmzo/406/9770449/download/images/gmz9449x39718z2407067.gif", null, "https://cdn.4uc.org/gmzo/406/9770449/download/images/gmz9449x70199z2407069.gif", null, "https://cdn.4uc.org/gmzo/406/9770449/download/images/gmz9449x84400z2407071.gif", null, "https://cdn.4uc.org/gmzo/406/9770449/download/images/gmz9449x67770z2407073.gif", null, "https://cdn.4uc.org/gmzo/406/9770449/download/images/gmz9449x18246z2407075.gif", null, "https://cdn.4uc.org/gmzo/406/9770449/download/images/gmz9449x2539z2407077.gif", null, "https://cdn.4uc.org/gmzo/406/9770449/download/images/gmz9449x75631z2407079.gif", null, "https://cdn.4uc.org/gmzo/406/9770449/download/images/gmz9449x76092z2407081.gif", null, "https://cdn.4uc.org/gmzo/406/9770449/download/images/gmz9449x75297z2407083.gif", null, "https://cdn.4uc.org/gmzo/406/9770449/download/images/gmz9449x19633z2407085.gif", null, "https://cdn.4uc.org/gmzo/406/9770449/download/images/gmz9449x64082z2407087.gif", null, "https://cdn.4uc.org/gmzo/406/9770449/download/images/gmz9449x6560z2407089.gif", null, "https://cdn.4uc.org/gmzo/406/9770449/download/images/gmz9449x92636z2407091.gif", null, "https://cdn.4uc.org/gmzo/406/9770449/download/images/gmz9449x90324z2407093.gif", null, "https://cdn.4uc.org/gmzo/406/9770449/download/images/gmz9449x92328z2407095.gif", null, "https://cdn.4uc.org/gmzo/406/9770449/download/images/gmz9449x44326z2407097.gif", null, "https://cdn.4uc.org/gmzo/406/9770449/download/images/gmz9449x91302z2407099.gif", null, "https://cdn.4uc.org/gmzo/406/9770449/download/images/gmz9449x68480z2407101.gif", null, "https://cdn.4uc.org/gmzo/406/9770449/download/images/gmz9449x49703z2407103.gif", null, "https://cdn.4uc.org/gmzo/406/9770449/download/images/gmz9449x99802z2407105.gif", null, "https://cdn.4uc.org/gmzo/406/9770449/download/images/gmz9449x36162z2407107.gif", null, "https://cdn.4uc.org/gmzo/406/9770449/download/images/gmz9449x81245z2407109.gif", null, "https://cdn.4uc.org/gmzo/406/9770449/download/images/gmz9449x16009z2407111.gif", null, "https://cdn.4uc.org/gmzo/406/9770449/download/images/gmz9449x63165z2407113.gif", null, "https://cdn.4uc.org/gmzo/406/9770449/download/images/gmz9449x68580z2407115.gif", null, "https://cdn.4uc.org/gmzo/406/9770449/download/images/gmz9449x26529z2407117.gif", null, "https://cdn.4uc.org/gmzo/406/9770449/download/images/gmz9449x5212z2407119.gif", null, "https://cdn.4uc.org/gmzo/406/9770449/download/images/gmz9449x69165z2407121.gif", null, "https://cdn.4uc.org/gmzo/406/9770449/download/images/gmz9449x82950z2407123.gif", null, "https://cdn.4uc.org/gmzo/406/9770449/download/images/gmz9449x16209z2407125.gif", null, "https://cdn.4uc.org/gmzo/406/9770449/download/images/gmz9449x92804z2407127.gif", null, "https://cdn.4uc.org/gmzo/406/9770449/download/images/gmz9449x21026z2407129.gif", null, "https://cdn.4uc.org/gmzo/406/9770449/download/images/gmz9449x3574z2407131.gif", null, "https://cdn.4uc.org/gmzo/406/9770449/download/images/gmz9449x28786z2407133.gif", null, "https://cdn.4uc.org/gmzo/406/9770449/download/images/gmz9449x37424z2407135.gif", null, "https://cdn.4uc.org/gmzo/406/9770449/download/images/gmz9449x15525z2407137.gif", null, "https://cdn.4uc.org/gmzo/406/9770449/download/images/gmz9449x33000z2407139.gif", null, "https://cdn.4uc.org/gmzo/406/9770449/download/images/gmz9449x58615z2407141.gif", null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.9311367,"math_prob":0.98452973,"size":7638,"snap":"2021-21-2021-25","text_gpt3_token_len":1534,"char_repetition_ratio":0.16753995,"word_repetition_ratio":0.004716981,"special_character_ratio":0.19717203,"punctuation_ratio":0.12005552,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9987814,"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,63,64,65,66,67,68,69,70,71,72,73,74,75,76,77,78,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,98,99,100,101,102,103,104,105,106,107,108,109,110,111,112,113,114,115,116,117,118,119,120,121,122,123,124,125,126,127,128,129,130,131,132,133,134,135,136,137,138,139,140,141,142,143,144,145,146],"im_url_duplicate_count":[null,5,null,5,null,5,null,5,null,5,null,5,null,5,null,5,null,5,null,5,null,5,null,5,null,5,null,5,null,5,null,5,null,5,null,5,null,5,null,5,null,5,null,5,null,5,null,5,null,5,null,5,null,5,null,5,null,5,null,5,null,5,null,5,null,5,null,5,null,5,null,5,null,5,null,5,null,5,null,5,null,5,null,5,null,5,null,5,null,5,null,5,null,5,null,5,null,5,null,5,null,5,null,5,null,5,null,5,null,5,null,5,null,5,null,5,null,5,null,5,null,5,null,5,null,5,null,5,null,5,null,5,null,5,null,5,null,5,null,5,null,5,null,5,null,5,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2021-05-17T23:07:11Z\",\"WARC-Record-ID\":\"<urn:uuid:c9ef33cc-3cbd-406e-9c14-ef8a19145f6e>\",\"Content-Length\":\"165412\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:160393c2-658c-49ce-8d90-8ddf09bf2a10>\",\"WARC-Concurrent-To\":\"<urn:uuid:70c736e9-ecea-4637-9e3f-61594bafdc13>\",\"WARC-IP-Address\":\"64.147.97.242\",\"WARC-Target-URI\":\"https://www.universalclass.com/articles/math/pre-algebra/how-to-perform-arithmetic-operations-on-radicals.htm\",\"WARC-Payload-Digest\":\"sha1:GGSUQ7Q4YVFXNF5OBD7UWIILTQXO7EHF\",\"WARC-Block-Digest\":\"sha1:M7S3K76KZNYU72EHGNOUWSLOBP275CPU\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2021/CC-MAIN-2021-21/CC-MAIN-2021-21_segments_1620243991870.70_warc_CC-MAIN-20210517211550-20210518001550-00233.warc.gz\"}"}
https://www.theknowledgeroundtable.com/tutorials/differentiation-2/
[ "## Calculus Tutorial\n\n#### Intro\n\nDifferentiation of a function y = f(x)^g(x)\n\n#### Sample Problem\n\nProblem : Find the differentiation of a function defined as y = f(x)^g(x). Eg : x^x, sinx^cosx etc.\n\n#### Solution\n\nThough we can differentiate the above function by taking log on both side and then applying product rule of differentiation, there is a 2nd method which uses the formula of differentiation of power function i.e. x^n and exponential function i.e. a^x.\n\nWe will do it in two steps :\n\nStep 1. Differentiate f(x)^g(x) keeping f(x) as constant and hence function would be an exponential function. So the result would be f(x)^g(x)*ln(f(x))*g'(x) ——– (1)\n\nStep 2. Differentiate f(x)^g(x) keeping g(x) as constant and hence function would be a power function. So the result would be g(x)*f(x)^{g(x)-1}*f'(x) ———— (2)\n\nNow the final answer will be sum of expressions (1) & (2).\n\nEg. 1. Let y = x^x\ndy/dx = x^(x-1).1 + x^x*ln(x)*1\n\n2. y = sinx^cosx\ndy/dx = cosx*sinx^(cosx-1)*(cosx) + sinx^cosx*ln(sinx)*(-sinx)", null, "" ]
[ null, "https://www.theknowledgeroundtable.com/images/people-avatar.png", null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.8125109,"math_prob":0.9998085,"size":1338,"snap":"2020-45-2020-50","text_gpt3_token_len":380,"char_repetition_ratio":0.14842579,"word_repetition_ratio":0.048309177,"special_character_ratio":0.27130044,"punctuation_ratio":0.09677419,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":1.0000025,"pos_list":[0,1,2],"im_url_duplicate_count":[null,null,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2020-10-26T16:10:41Z\",\"WARC-Record-ID\":\"<urn:uuid:1bc4c959-4064-4ea7-b17f-f39f63bafbdd>\",\"Content-Length\":\"74294\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:50b30b35-2394-40c8-ac58-727ff0925391>\",\"WARC-Concurrent-To\":\"<urn:uuid:c884d8b5-f4aa-4958-9094-f47a489fb7a1>\",\"WARC-IP-Address\":\"67.205.30.144\",\"WARC-Target-URI\":\"https://www.theknowledgeroundtable.com/tutorials/differentiation-2/\",\"WARC-Payload-Digest\":\"sha1:26S24BOUTESDHSXGYK2YVV6A5Q7WPFPR\",\"WARC-Block-Digest\":\"sha1:7YB7RCNOKSRC6AIVQWGMB44VAJHXZ4EE\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2020/CC-MAIN-2020-45/CC-MAIN-2020-45_segments_1603107891428.74_warc_CC-MAIN-20201026145305-20201026175305-00279.warc.gz\"}"}
https://www.fishtanklearning.org/curriculum/math/6th-grade/multi-digit-and-fraction-computation/lesson-17/
[ "Match Fishtank is now Fishtank Learning!\n\n# Multi-Digit and Fraction Computation\n\n## Objective\n\nSolve mathematical and real-world problems using the greatest common factor and least common multiple.\n\n## Common Core Standards\n\n### Core Standards\n\n?\n\n• 6.NS.B.4 — Find the greatest common factor of two whole numbers less than or equal to 100 and the least common multiple of two whole numbers less than or equal to 12. Use the distributive property to express a sum of two whole numbers 1—100 with a common factor as a multiple of a sum of two whole numbers with no common factor. For example, express 36 + 8 as 4 (9 + 2).\n\n?\n\n• 4.OA.B.4\n\n## Criteria for Success\n\n?\n\n1. Find two numbers when given information about them, including their greatest common factor and least common multiple.\n2. Express a sum of two whole numbers with a common factor as a multiple of a sum of two relatively prime numbers. For example, express 36 + 8 as 4(9 + 2).\n3. Determine if a problem can be solved by finding the greatest common factor or the least common multiple.\n4. Solve real-world problems that involve finding the greatest common factor or the least common multiple.\n\n## Tips for Teachers\n\n?\n\n#### Remote Learning Guidance\n\nIf you need to adapt or shorten this lesson for remote learning, we suggest prioritizing Anchor Problem 2 (benefits from worked example). Find more guidance on adapting our math curriculum for remote learning here.\n\n#### Fishtank Plus\n\n• Problem Set\n• Student Handout Editor\n• Vocabulary Package\n\n## Anchor Problems\n\n?\n\n### Problem 1\n\nTwo numbers can be described with the information below:\n\n• Both numbers are less than 20.\n• The greatest common factor of the two numbers is 2.\n• The least common multiple of the two numbers is 36.\n\nWhat are the two numbers?\n\n### Problem 2\n\nJason is preparing bundles of markers and pencils for a class activity. He wants to make the greatest number of bundles that he can, with the same number of markers and pencils in each bundle. Jason has 15 markers and 35 pencils. He writes the following equation to help him make sense of his supplies:\n\n${15+35=5(3+7)}$\n\n1. What does Jason’s equation tell him about how many bundles he can make and how many markers and pencils are in each bundle?\n\n1. Mai, in another class, is also preparing bundles of markers and pencils. She has 24 markers and 36 pencils. She writes an equation and determines that she can make at most 4 bundles. Do you agree with Mai’s reasoning? Explain.\n\n${24+36=4(6+9)}$\n\n1. If you have 18 markers and 48 pencils, what is the greatest number of bundles you can make? How many markers and pencils in each bundle? Write an equation to represent this.\n\n### Problem 3\n\nThe florist can order roses in bunches of one dozen and lilies in bunches of 8. Last month she ordered the same number of roses as lilies. If she ordered no more than 100 roses, how many bunches of each could she have ordered? What is the smallest number of bunches of each that she could have ordered? Explain your reasoning.\n\n#### References\n\nIllustrative Mathematics The Florist Shop\n\nThe Florist Shop, accessed on Sept. 28, 2017, 4:42 p.m., is licensed by Illustrative Mathematics under either the CC BY 4.0 or CC BY-NC-SA 4.0. For further information, contact Illustrative Mathematics.\n\n## Problem Set\n\n?", null, "The following resources include problems and activities aligned to the objective of the lesson that can be used to create your own problem set.\n\n• Include a mix of GCF and LCM word problems; a simple search for this should generate several resources on the Internet.\n\n?\n\n### Problem 1\n\nTwo numbers less than 25 have a least common multiple of 60 and a greatest common factor of 5. What are the two numbers?\n\n### Problem 2\n\nFind the greatest common factor of the two numbers below and rewrite the sum using the distributive property.\n\n${20 + 36}$\n\n?" ]
[ null, "https://www.fishtanklearning.org/static/images/fishtankplus.f66dc874f41e.svg", null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.9339606,"math_prob":0.9255673,"size":1676,"snap":"2021-04-2021-17","text_gpt3_token_len":389,"char_repetition_ratio":0.11004785,"word_repetition_ratio":0.0070422534,"special_character_ratio":0.24343675,"punctuation_ratio":0.125,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.989968,"pos_list":[0,1,2],"im_url_duplicate_count":[null,null,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2021-01-24T09:25:19Z\",\"WARC-Record-ID\":\"<urn:uuid:27442f02-ff5b-4b0f-a966-789f5392f716>\",\"Content-Length\":\"84800\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:6f4c9d40-ba62-48c4-83e7-9f9d8eb734e0>\",\"WARC-Concurrent-To\":\"<urn:uuid:a24adb2f-880b-41c2-821c-947966e7e1e1>\",\"WARC-IP-Address\":\"172.67.184.239\",\"WARC-Target-URI\":\"https://www.fishtanklearning.org/curriculum/math/6th-grade/multi-digit-and-fraction-computation/lesson-17/\",\"WARC-Payload-Digest\":\"sha1:XTPXQZWBENKI43YOGCUICBGIW3LPL76L\",\"WARC-Block-Digest\":\"sha1:X4GM4L5HQXNU3WGPVI5KRAJCLAZMGOVA\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2021/CC-MAIN-2021-04/CC-MAIN-2021-04_segments_1610703547475.44_warc_CC-MAIN-20210124075754-20210124105754-00445.warc.gz\"}"}
https://homepages.cwi.nl/~steven/Talks/2020/02-13-xforms/calendar.html
[ "# A Calendar in XForms", null, "Steven Pemberton, CWI Amsterdam\n\n## A Month\n\nA month consists of a number of weeks of seven days, displayed as a grid. In fact there can be up to six weeks displayed for a month, if the first day of the month falls on one of the two last days of the first week.\n\n```<instance>\n<cal xmlns=\"\">\n<week><day/><day/><day/><day/><day/><day/><day/></week>\n<week><day/><day/><day/><day/><day/><day/><day/></week>\n<week><day/><day/><day/><day/><day/><day/><day/></week>\n<week><day/><day/><day/><day/><day/><day/><day/></week>\n<week><day/><day/><day/><day/><day/><day/><day/></week>\n<week><day/><day/><day/><day/><day/><day/><day/></week>\n</cal>\n</instance>```\n\n## Day numbers\n\nTo start off, we'll fill them starting from 1:\n\n```<bind ref=\"week/day\"\ncalculate=\"1 + 7*count(../preceding-sibling::week)\n+ count(preceding-sibling::day)\"/>```\n\nThis sets the day number to the week number times seven, plus the day number in the week, where both start counting from zero, plus 1. So the very first day will be numbered 1 and so on.\n\n## Display\n\n(Plus a little bit of CSS, not shown here):\n\n```<repeat ref=\"week\">\n<repeat ref=\"day\">\n<output ref=\".\"/>\n</repeat>\n</repeat>```\n\nwhich looks like this:\n\nSource\n\n## Next steps\n\n1. Decide which month will be displayed;\n2. find out what day of the week that month starts on;\n3. move the numbers up so that day 1 is in the right place;\n4. hide the days that shouldn't be displayed for the month;\n5. make it pretty.\n\nAdd some data to the instance:\n\n```<instance>\n<cal xmlns=\"\">\n<y/><m/>\n<monthlength/>\n<startday/>\n<week><day/>...\n...\n</cal>\n</instance>```\n• `y`, and `m`: the month we are interested in,\n• `monthlength`: the length of that month in days,\n• `startday`: the day of the week (from 0 to 6) that the month begins on.\n\nWe'll see how to calculate those shortly, but assume for now that that has been done.\n\n## Move day 1 up\n\nSo let's move the numbers up, so that day 1 falls on the right day of the week. To do that we change the bind that calculates the day number, so that it also subtracts the start day:\n\n```<bind ref=\"week/day\"\ncalculate=\"1 + 7*count(../preceding-sibling::week)\n+ count(preceding-sibling::day)\n- /cal/startday\"/>```\n\nSuppose the month starts on day 3 of the week, then this is what it looks like:\n\nSource\n\n## Unwanted days\n\nIf the day number is less than 1, or more than the length of the month, then output nothing, and otherwise the number.\n\n&#xa0; is a non-breaking space, and is needed because without it, on some browsers the CSS layout gets messed up.\n\n```<repeat ref=\"week\" class=\"week\">\n<repeat ref=\"day\">\n<output value=\"if(. &lt; 1 or . &gt; /cal/monthlength, '&#xa0;', .)\"\nclass=\"day\"/>\n</repeat>\n</repeat>```\n\nIt looks like this now:\n\nSource\n\n## Unwanted weeks\n\nYou can see that there's now a blank week at the end; we can easily get rid of that with a bind:\n\n`<bind ref=\"week\" relevant=\"day &lt;= /cal/monthlength\"/>`\n\nwhich says that a week is only relevant if its first day is less than or equal to the month length. Non-relevant values are never displayed:\n\nSource\n\n## Calculating the Month and its Values\n\nLet's start off initially with displaying the current month. To get that, we use the function `local-date()`, which returns the current date (plus how many hours different your timezone is from UTC):\n\nSource\n\nWe want to extract the year and month from this string, and we want to set it on initialisation of the form.\n\n## Initialising\n\nSo we add the following `action` to respond to the `xforms-ready` event:\n\n```<action ev:event=\"xforms-ready\">\n<setvalue ref=\"y\" value=\"substring-before(local-date(), '-')\"/>\n<setvalue ref=\"m\"\nvalue=\"substring-before(substring-after(local-date(), '-'), '-')\"/>\n</action>```\n\nSo the year is the substring before the first hyphen, and the month is the substring after the first hyphen, and before the second.\n\n## Month length\n\nWe add the length of each month to the instance:\n\n```<ml>31</ml><ml>28</ml><ml>31</ml><ml>30</ml><ml>31</ml><ml>30</ml>\n<ml>31</ml><ml>31</ml><ml>30</ml><ml>31</ml><ml>30</ml><ml>31</ml>```\n\nBut February changes in leap years. So we add `leap` to the instance, and calculate if the current year is a leap year (if the year is divisible by 4, but not by 100, or divisible by 400):\n\n```<bind ref=\"leap\"\ncalculate=\"if(((../y mod 4 = 0) and (../y mod 100 != 0)) or (../y mod 400 = 0), 1, 0)\"/>```\n\nand calculate February accordingly:\n\n`<bind ref=\"ml\" calculate=\"28+../leap\"/>`\n\n## Month length\n\nThis now allows us to calculate the month length of the current month:\n\n`<bind ref=\"monthlength\" calculate=\"../ml[position()=../m]\"/>`\n\nSource\n\n(Remember that we haven't calculated the true start day for the month yet, but you can play around with it, to see how the display changes.)\n\n## What Day of the Week does a Month Start On?\n\nAnswer: its day number in the year, less the 'Dominic' number for the year, plus a constant, all modulo 7 so that we get a value in the range 0 to 6.\n\nThe dominic number for any year is: 7 - ((year + floor(year ÷ 4) - century + floor(century ÷ 4) - leap) mod 7).\n\nWell, we've already calculated `leap`. Let's do the rest.\n\n## Dominic\n\nAdd century and dominic to the instance:\n\n```<bind ref=\"century\" calculate=\"floor(../year div 100)\"/>\n<bind ref=\"dominic\"\ncalculate=\"7-((../y+floor(../y div 4)-../century+floor(../century div 4)-../leap) mod 7)\"/>```\n\nNow calculate the day in the year of the first of the month:\n\n```<bind ref=\"dayinyear\"\ncalculate=\"sum(../ml[position() &lt; ../m]) + 1\"/>```\n\nThat is, add the month lengths for all months before the current month, and add one.\n\n## The real start day of the month\n\n`<bind ref=\"startday\" calculate=\"(11 + ../dayinyear - ../dominic) mod 7\"/>`\n\nSee it in action here:\n\nSource\n\nThis is the first moment we have made any decision about which weekday is the first day of the week. In this case we have used Monday; however, if your week starts with a different day, it is easy to add the necessary offset (you change that 11 to adjust).\n\n## What's Next?\n\nClearly, we need to add some decoration, like the names of the weekdays.\n\nControls to step through the calendar.\n\nYear:\n\n```<trigger appearance=\"minimal\"><label>→</label>\n<setvalue ref=\"y\" value=\". + 1\" ev:event=\"DOMActivate\"/>\n</trigger>```\n\nMonth:\n\n```<trigger appearance=\"minimal\"><label>→</label>\n<action ev:event=\"DOMActivate\">\n<setvalue ref=\"m\" value=\"if(.=12, 1, . + 1)\"/>\n<setvalue ref=\"y[../m=1]\" value=\". + 1\"/>\n</action>\n</trigger>```\n\n## Today\n\nI'll calculate it in a different way this time, just to show the options. Since `local-date()` has a fixed format, you can select fixed parts of the result:\n\n```<today><y/><m/><d/></today>\n...\n<bind ref=\"today\">\n<bind ref=\"y\" calculate=\"substring(local-date(), 1, 4)\"/>\n<bind ref=\"m\" calculate=\"substring(local-date(), 6, 2)\"/>\n<bind ref=\"d\" calculate=\"substring(local-date(), 9, 2)\"/>\n</bind>```\n\nThere is a race condition in the calculation, since `local-date` gets called three times, and the date might just change between the calls. It will hardly ever happen, but it could. So better to add `local-date` to the instance as well, and call the function just once:\n\n```<today><date/><y/><m/><d/></today>\n...\n<bind ref=\"today\">\n<bind ref=\"date\" calculate=\"local-date()\"/>\n<bind ref=\"y\" calculate=\"substring(../date, 1, 4)\"/>\n<bind ref=\"m\" calculate=\"substring(../date, 6, 2)\"/>\n<bind ref=\"d\" calculate=\"substring(../date, 9, 2)\"/>\n</bind>```\n\n## Displaying today specially\n\nNow in the main output, we will add a special class on the output element:\n\n```<repeat ref=\"week\" class=\"week\">\n<repeat ref=\"day\">\n<output value=\"if(. &lt; 1 or . &gt; /cal/monthlength, '&#xa0;', .)\"\nclass=\"{if(. = /cal/today/d and /cal/m = /cal/today/m and /cal/y = /cal/today/y,\n'today', 'day')}\"/>\n</repeat>\n</repeat>```\n\nwhich sets the class of the output to 'today' if it represents today's date, and otherwise to 'day', and we can use any CSS rules we want to display them differently:\n\nSource\n\n## Events\n\nWe will have an instance to hold events, which we will load from an external source:\n\n`<instance id=\"events\" src=\"events.xml\"/>`\n\nThis will hold our calendar events. For now a simple version:\n\n```<events>\n<event y=\"2018\" m=\"3\" d=\"20\" t=\"10:00\">Write program</event>\n<event y=\"2018\" m=\"3\" d=\"20\" t=\"13:30\">Meeting</event>\n<event y=\"2018\" m=\"3\" d=\"24\">Clocks go forward</event>\n...\n</events>```\n\n## Display with events\n\n```<repeat ref=\"week\" class=\"week\">\n<repeat ref=\"day\">\n<group class=\"{if(. = /cal/today/d and /cal/m = /cal/today/m and /cal/y = /cal/today/y, 'today', 'day')}\">\n<output value=\"if(. &lt; 1 or . &gt; /cal/monthlength, '&#xa0;', .)\"/>\n<repeat ref=\"instance('events')/event[@y=/cal/y and @m = /cal/m and @d = context()]\">\n<output class=\"event\" value=\"concat(@t, ' ', .)\"/>\n</repeat>\n</group>\n</repeat>\n</repeat>```\n\nSource\n\n`<output class=\"{if(@t='', 'dayevent', 'event')}\" value=\"concat(@t, ' ', .)\"/>`" ]
[ null, "https://homepages.cwi.nl/~steven/Talks/2017/hamleeet.jpg", null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.7788411,"math_prob":0.9404791,"size":8039,"snap":"2021-43-2021-49","text_gpt3_token_len":2314,"char_repetition_ratio":0.15955196,"word_repetition_ratio":0.04688832,"special_character_ratio":0.32628435,"punctuation_ratio":0.14691657,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.98651546,"pos_list":[0,1,2],"im_url_duplicate_count":[null,7,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2021-10-22T07:55:44Z\",\"WARC-Record-ID\":\"<urn:uuid:4d6b80ce-ffdb-4b1d-bd87-49498cace8fd>\",\"Content-Length\":\"17575\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:518d0331-c54f-4545-a3c1-0c59c2bf83b9>\",\"WARC-Concurrent-To\":\"<urn:uuid:7cb318dd-0887-4b5e-a579-63f03008aec3>\",\"WARC-IP-Address\":\"192.16.191.44\",\"WARC-Target-URI\":\"https://homepages.cwi.nl/~steven/Talks/2020/02-13-xforms/calendar.html\",\"WARC-Payload-Digest\":\"sha1:TKWJQYGKPFKTUYWKY5KNSHIYSNLQQ4LB\",\"WARC-Block-Digest\":\"sha1:P3BDCPJ2CVANZNA6KSTLEK4IYYJAZ57P\",\"WARC-Identified-Payload-Type\":\"application/xhtml+xml\",\"warc_filename\":\"/cc_download/warc_2021/CC-MAIN-2021-43/CC-MAIN-2021-43_segments_1634323585460.87_warc_CC-MAIN-20211022052742-20211022082742-00249.warc.gz\"}"}
https://physics.stackexchange.com/questions/223665/what-is-a-quasi-probability-distribution/223673
[ "# What is a quasi-probability distribution?\n\nWhat is quasi-probability distribution? Why is it important in quantum mechanics? What does \"quasi\" mean?\n\n• You might find this finance application helpful. Essentially, at least one of the 3 Kolmogorov axioms of probability is violated. In this case, a negative probability might be used to give a value to something. It seems that the price of the financial asset would be 0.5 but theoretically it can't be determined under probability distributions. Hence, there are quasiprobability distributions\n– BCLC\nDec 15, 2015 at 23:27\n\nA quasi probability distribution relaxes an axiom of probabilty. In the context of Quantum Mechanics,it is specificly the axiom of probability that requires $p_{i} \\geq 0$. So the sum of the distribution can include negative terms!" ]
[ null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.9340505,"math_prob":0.97914034,"size":2406,"snap":"2023-40-2023-50","text_gpt3_token_len":544,"char_repetition_ratio":0.1561199,"word_repetition_ratio":0.011235955,"special_character_ratio":0.20448878,"punctuation_ratio":0.11638955,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9992077,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2023-09-23T21:20:47Z\",\"WARC-Record-ID\":\"<urn:uuid:e00dc59e-e6ff-4a1e-a23c-b8ae511d714f>\",\"Content-Length\":\"158054\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:7bbbc168-2bd0-45c6-8a4e-d570d7708809>\",\"WARC-Concurrent-To\":\"<urn:uuid:f13921b3-9911-48cc-81aa-634da21eba59>\",\"WARC-IP-Address\":\"104.18.10.86\",\"WARC-Target-URI\":\"https://physics.stackexchange.com/questions/223665/what-is-a-quasi-probability-distribution/223673\",\"WARC-Payload-Digest\":\"sha1:ULXXT5BWD2CWHNI4YHEIYXIMPOH54UVR\",\"WARC-Block-Digest\":\"sha1:QVJ46IAIXFQPL2GLXSB7BZO3CYXVEPL5\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2023/CC-MAIN-2023-40/CC-MAIN-2023-40_segments_1695233506528.3_warc_CC-MAIN-20230923194908-20230923224908-00495.warc.gz\"}"}
https://jp.mathworks.com/matlabcentral/cody/problems/1336-geometry-find-circle-given-3-non-colinear-points/solutions/217876
[ "Cody\n\n# Problem 1336. Geometry: Find Circle given 3 Non-Colinear Points\n\nSolution 217876\n\nSubmitted on 15 Mar 2013 by Tim\n• Size: 24\n• This is the leading solution.\nThis solution is locked. To view this solution, you need to provide a solution of the same size or smaller.\n\n### Test Suite\n\nTest Status Code Input and Output\n1   Pass\nfor tests=1:5 xc_truth=randn; yc_truth=randn; r_truth=rand; rand_ang=randi(360,3,1)+rand(3,1); % Avoid duplicate location via rand(3,1) pts=[xc_truth+r_truth*cosd(rand_ang) yc_truth+r_truth*sind(rand_ang)]; [xc,yc,r]=find_circle(pts); %dif=[xc yc r]-[xc_truth yc_truth r_truth] assert(max(abs([xc,yc,r]-[xc_truth,yc_truth,r_truth]))<1e-6,... sprintf('Expect xc %.2f yc %.2f r %.2f Ans:%.2f %.2f %.2f',... xc_truth,yc_truth,r_truth,xc,yc,r)) end" ]
[ null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.5306806,"math_prob":0.9648918,"size":674,"snap":"2020-34-2020-40","text_gpt3_token_len":226,"char_repetition_ratio":0.18208955,"word_repetition_ratio":0.0,"special_character_ratio":0.35311574,"punctuation_ratio":0.2451613,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.98555166,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2020-09-19T10:19:58Z\",\"WARC-Record-ID\":\"<urn:uuid:a0a9af9e-458d-4a07-945c-48a9563665ba>\",\"Content-Length\":\"76498\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:39f534f5-11ca-4872-9b75-3789c9de1374>\",\"WARC-Concurrent-To\":\"<urn:uuid:766e5209-e00a-4686-8aec-ad184886b22c>\",\"WARC-IP-Address\":\"184.25.198.13\",\"WARC-Target-URI\":\"https://jp.mathworks.com/matlabcentral/cody/problems/1336-geometry-find-circle-given-3-non-colinear-points/solutions/217876\",\"WARC-Payload-Digest\":\"sha1:QQWY4DUB2ZQ34HP4VZAOBPSY5RANIAKH\",\"WARC-Block-Digest\":\"sha1:EZSE4NJXKFVXJVOYY5SVWF7PQQE4RV4S\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2020/CC-MAIN-2020-40/CC-MAIN-2020-40_segments_1600400191160.14_warc_CC-MAIN-20200919075646-20200919105646-00280.warc.gz\"}"}
https://www.dynamictutorialsandservices.org/2020/12/measure-of-central-tendency-business-statistics-notes.html
[ "# Measure of Central Tendency | Business Statistics Notes | B.Com Notes Hons & Non Hons | CBCS Pattern\n\n## Meaning of Average\n\nOne of the most important objectives of statistical analysis is to get one single value that describes the characteristics of the entire mass of data. Such a value is called the central value or an “average” or the expected value of the variables.\n\nIn the words of Croxton and Cowden, “An average value is a single value within the range of the data that is used to represent all the values in the series.”\n\nIn the words of Clark,” Average is an attempt to find one single figure to describe whole of figures.”\n\nFrom the above explanation we can say that average is a single value that represents a group of values. It depicts the characteristic of the whole group. The value of average lies between the maximum and minimum values of the series. That is why it is also called measure of central tendency.\n\nObjectives of averaging\n\nThe objective of study of averages is listed below:\n\na) To get single value that describes the characteristic of the entire group.\n\nb) To facilitate comparison of data either at a point of time or over a period of time.\n\n## Requisites of a good average\n\nThe following are the important properties which a good average should satisfy\n\n1.       It should be easy to understand.\n\n2.       It should be simple to compute.\n\n3.       It should be based on all the items.\n\n4.       It should not be affected by extreme values.\n\n5.       It should be rigidly defined.\n\n6.       It should be capable of further algebraic treatment.\n\n## Types of average\n\nAverage is divided into three main categories:\n\na) Mean which is further classified as: Arithmetic mean, Weighted Mean, Geometric Mean and Harmonic Mean.\n\nb) Median and\n\nc) Mode\n\n## Arithmetic Mean: Meaning, Properties, Merits and Demerits\n\nIt is a value obtained by adding together all the items and by dividing the total by the number of items. It is also called average. It is the most popular and widely used measure for representing the entire data by one value.\n\nArithmetic mean may be either:\n\n(i)      Simple arithmetic mean, or\n\n(ii)    Weighted arithmetic mean.\n\nProperties of arithmetic mean:\n\n1.       The sum of deviations of the items from the arithmetic mean is always zero i.e. ∑(X–X) =0.\n\n2. The Sum of the squared deviations of the items from A.M. is minimum, which is less than the sum of the squared deviations of the items from any other values.\n\n3. If each item in the series is replaced by the mean, then the sum of these substitutions will be equal to the sum of the individual items.\n\nMerits of A.M.:\n\n(i)      It is simple to understand and easy to calculate.\n\n(ii)    It is affected by the value of every item in the series.\n\n(iii)   It is rigidly defined.\n\n(iv)  It is capable of further algebraic treatment.\n\n(v)    It is calculated value and not based on the position in the series.\n\nDemerits of A.M.:\n\n(i)      It is affected by extreme items i.e., very small and very large items.\n\n(ii)    It can hardly be located by inspection.\n\n(iii)   In some cases A.M. does not represent the actual item. For example, average patients admitted in a hospital is 10.7 per day.\n\n(iv)  A.M. is not suitable in extremely asymmetrical distributions.\n\n## Geometric Mean (GM): Meaning, Uses, Merits and Demerits\n\nIt is defined as nth root of the product of n items or values. i.e., G.M. = n√ (x1. x2. x3 ……xn)\n\nMerits of G.M.:\n\n(i)      It is not affected by the extreme items in the series.\n\n(ii)    It is rigidly defined and its value is a precise figure.\n\n(iii)   It is capable of further algebraic treatment.\n\n(iv)  It is Useful in calculating index number.\n\nDemerits of G.M.:\n\n(i)    It is difficult to understand and to compute.\n\n(ii)   It cannot be computed when one of the values is 0 or negative.\n\nUses of G.M.:\n\n(i)      It is used to find average of the rates of changes.\n\n(ii)    It is Useful in measuring growth of population.\n\n(iii)   It is considered to be the best average for the construction of index numbers.\n\n## Harmonic Mean (HM): Meaning, Uses, Merits and Demerits\n\nIt is defined as the reciprocal of the arithmetic mean of the reciprocal of the individual observations.\n\n N H.M. = (1/x1 + 1/x2 + 1/x3 + ........ +1/xn)\n\nMerits of H.M.:\n\n(i)      Like AM and GM, it is also based on all observations.\n\n(ii)    It is most appropriate average under conditions of wide variations among the items of a series since it gives larger weight to smaller items.\n\n(iii)  It is capable of further algebraic treatment.\n\n(iv) It is extremely useful while averaging certain types of rates and ratios.\n\nDemerits of H.M.:\n\n(i)      It is difficult to understand and to compute.\n\n(ii)    It cannot be computed when one of the values is 0 or negative.\n\n(iii)   It is necessary to know all the items of a series before it can be calculated.\n\n(iv)  It is usually a value which may not be a member of the given set of numbers.\n\nUses of H.M.: If there are two measurements taken together to measure a variable, HM can be used. For example, tonne mileage, speed per hour. In the above example tonne mileage, tonne is one measurement and mileage is another measurement. HM is used to calculate average speed.\n\n## Median: Meaning, Merits and Demerits\n\nMedian may be defined as the size (actual or estimated) to that item which falls in the middle of a series arranged either in the ascending order or the descending order of their magnitude. It lies in the centre of a series and divides the series into two equal parts. Median is also known as an average of position.\n\nMerits of Median:\n\n(i)      It is simple to understand and easy to calculate, particularly is individual and discrete series.\n\n(ii)    It is not affected by the extreme items in the series.\n\n(iii)   It can be determined graphically.\n\n(iv)  For open-ended classes, median can be calculated.\n\n(v)    It can be located by inspection, after arranging the data in order of magnitude.\n\nDemerits of Median:\n\n(i)      It does not consider all variables because it is a positional average.\n\n(ii)    The value of median is affected more by sampling fluctuations\n\n(iii)   It is not capable of further algebraic treatment. Like mean, combined median cannot be calculated.\n\n(iv)  It cannot be computed precisely when it lies between two items.\n\n## Mode: Meaning, Merits and Demerits\n\nMode is that value a dataset, which is repeated most often in the database. In other words, mode is the value, which is predominant in the series or is at the position of greatest density. Mode may or may not exist in a series, or if it exists, it may not be unique, or its position may be somewhat uncertain.\n\nMerits of Mode:\n\n(i)      Mode is the most representative value of distribution, it is useful to calculate model wage.\n\n(ii)    It is not affected by the extreme items in the series.\n\n(iii)   It can be determined graphically.\n\n(iv)  For open-ended classes, Mode can be calculated.\n\n(v)    It can be located by inspection.\n\nDemerits of Mode:\n\n(i)      It is not based on all observations.\n\n(ii)    Mode cannot be calculated when frequency distribution is ill-defined\n\n(iii)   It is not capable of further algebraic treatment. Like mean, combined mode cannot be calculated.\n\n(iv)  It is not rigidly defined measure because several formulae to calculate mode is used.\n\n## Relationship between mean, median and mode\n\nIn a normal distribution Mean = Median = Mode. In an asymmetrical distribution median is always in the middle but mean and mode will interchange their positions or values.\n\nMode = 3 Median - 2 Mean.\n\nOr 3Median = 2Mean + Mode\n\n## Relation between arithmetic mean, geometric mean and harmonic mean\n\n1. AM is greater than equal to GM and GM is greater than equal to HM\n\nA.M. > G.M. > H.M.\n\n2. GM is the square root of product of AM and HM.\n\nGM = √ (ARITHMETIC MEAN * HARMONIC MEAN)\n\n## Which Average is to be used?\n\nNo one average is suitable for all circumstances. All average has its unique feature. The following points must be taken into consideration in selection of an appropriate average:\n\n1. The purpose which the average is designed to serve.\n\n2. Types of data available. Are they badly skewed – avoid mean, gappy around the middle – avoid median and unequal class interval – avoid mode.\n\n3. Whether or not further computations are possible?\n\n4. The typical value required in the particular problem.\n\n## Uses of various types of average\n\n1) Arithmetic Mean: AM is considered to be best average but in the below mentioned situations AM cannot be used:\n\na)      In highly skewed distributions.\n\nb)      In distribution with open-end interval.\n\nc)       Irregular difference between the range of data.\n\nd)      The arithmetic mean should not be used to average ratios and rates of change.\n\ne)      AM will be misleading when there are very large and very small items.\n\n2) Median: The median is generally the best average in open-end-grouped distributions.\n\n3) Mode: The mode is best suited where there is large frequency. Also it can be used where qualitative data is given.\n\n4) Geometric Mean: Uses of G.M.:\n\na)      It is used to find average of the rates of changes.\n\nb)      It is Useful in measuring growth of population.\n\nc)       It is considered to be the best average for the construction of index numbers.\n\n5) Harmonic Mean: When there are two measurements taken together to measure a variable, HM can be used. For example, tonne mileage, speed per hour. In the above example tonne mileage, tonne is one measurement and mileage is another measurement. HM is used to calculate average speed." ]
[ null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.8946208,"math_prob":0.9773711,"size":9289,"snap":"2022-40-2023-06","text_gpt3_token_len":2264,"char_repetition_ratio":0.13570274,"word_repetition_ratio":0.17844093,"special_character_ratio":0.22693509,"punctuation_ratio":0.12961012,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.99072653,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2022-09-29T17:25:00Z\",\"WARC-Record-ID\":\"<urn:uuid:c1369dbd-c632-4866-aa12-840f6de6353e>\",\"Content-Length\":\"403287\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:a537fbcc-27c1-4309-b092-c3987265ec1b>\",\"WARC-Concurrent-To\":\"<urn:uuid:f47e2d3a-4055-4e31-a0f6-ba62523698d9>\",\"WARC-IP-Address\":\"142.251.111.121\",\"WARC-Target-URI\":\"https://www.dynamictutorialsandservices.org/2020/12/measure-of-central-tendency-business-statistics-notes.html\",\"WARC-Payload-Digest\":\"sha1:6VMWX764OCGQQ4H2Z622ZZTPR7ZN2JY7\",\"WARC-Block-Digest\":\"sha1:4DXQEZDWXIQYXJ6UIMTN4LSB5COBIKQE\",\"WARC-Identified-Payload-Type\":\"application/xhtml+xml\",\"warc_filename\":\"/cc_download/warc_2022/CC-MAIN-2022-40/CC-MAIN-2022-40_segments_1664030335362.18_warc_CC-MAIN-20220929163117-20220929193117-00441.warc.gz\"}"}
https://avidemia.com/single-variable-calculus/review-of-fundamentals/fractions/
[ "We manipulate algebraic fractions the same way that we manipulate fractions in arithmetic.\n\n### Simplifying Fractions\n\nOne fundamental rule for manipulation of fractions is: If we multiply or divide both the numerator or denominator by the same quantity, the value of the fraction will not change provided that this quantity is nonzero, namely $\\frac{A}{B}=\\frac{AC}{BC},\\qquad\\frac{A}{B}=\\frac{\\dfrac{A}{C}}{\\dfrac{B}{C}}\\qquad(\\text{if }C\\neq0)$\n\nFor example, if we multiply both the numerator and the denominator of $(x-1)/(x+2)$ by $(x-3)$, we obtain the equivalent fraction$\\frac{x-1}{x+2}=\\frac{(x-1)(x-3)}{(x+2)(x-3)}$provided $x-3\\neq0$; that is, provided $x\\neq3$.\n\nConversely if we factor the numerator and denominator of a given fraction, we can cancel common factors from the numerator and denominator to simplify the fraction (again provided common factors are not zero). For example,\n\n$\\frac{4}{12}=\\frac{\\cancel{4}}{\\cancel{4}\\times3}=\\frac{1}{3}$\n\nand\n\n$\\frac{x^{2}-5x+6}{x^{2}-4x+3}=\\frac{(x-2)\\cancel{(x-3)}}{\\cancel{(x-3)}(x-1)}=\\frac{x-2}{x-1}\\qquad(\\text{if }x\\neq3)$\n\nExample 1\nSimplify $\\dfrac{x^{2}+x-12}{3-x}$\n\nSolution\n\n\\begin{align*}\n\\frac{x^{2}+x-12}{3-x} & =\\frac{(x+4)(x-3)}{3-x}\\\\\n& =\\frac{(x+4)\\cancel{(x-3)}}{-\\cancel{(x-3)}}\\\\\n& =-(x+4)\\\\\n& =-x-4.\n\\end{align*}\n\n### Multiplying and Dividing Fractions\n\nTo multiply or divide fractions we use the following properties of fractions:\n\n Property Restriction Description $\\dfrac{A}{B}\\cdot\\dfrac{C}{D}=\\dfrac{A\\cdot C}{B\\cdot D}$ $B\\neq0$, $D\\neq 0$ To multiply two fractions, multiply their numerators and multiply their denominators $\\dfrac{A}{B}\\div\\dfrac{C}{D}=\\frac{\\dfrac{A}{B}}{\\dfrac{C}{D}}=\\dfrac{A}{B}\\cdot\\dfrac{D}{C}$ $B\\neq0,D\\neq0$, $C\\neq 0$ To divide a fraction by another fraction, invert the divisor and then multiply the fractions.\n\nExample\n\nPerform the following operations and simplify the results\n\n(a) $\\dfrac{x^{2}-2x-3}{x^{2}+6x+9}\\cdot\\dfrac{4x+12}{x+1}$\n\n(b) $\\dfrac{x^{2}-6x+8}{x^{2}-x-6}\\div\\dfrac{x^{2}-x-12}{4x-12}$\n\nSolution\n\n(a)\n\n\\begin{align*}\n\\dfrac{x^{2}-2x-3}{x^{2}+6x+9}\\cdot\\dfrac{4x+12}{x+1} & =\\frac{(x-3)\\bcancel{(x+1)}}{(x+3)^{\\cancel{2}}}\\times\\frac{4\\cancel{(x+3)}}{\\bcancel{x+1}}\\\\\n& =\\frac{4(x-3)}{x+3},\n\\end{align*} provided $x+1\\neq0$; that is, provided $x\\neq-1$.\n\n(b)\n\n\\begin{align*}\n\\dfrac{x^{2}-6x+8}{x^{2}-x-6}\\div\\dfrac{x^{2}-x-12}{4x-12} & =\\dfrac{x^{2}-6x+8}{x^{2}-x-6}\\cdot\\dfrac{4x-12}{x^{2}-x-12}\\\\\n& =\\frac{\\bcancel{(x-4)}(x-2)}{\\cancel{(x-3)}(x+2)}\\cdot\\frac{4\\cancel{(x-3)}}{\\bcancel{(x-4)}(x+3)}\\\\\n& =\\frac{4(x-2)}{(x+2)(x+3)},\n\\end{align*} provided $x\\neq4$ and $x\\neq3$.\n\nIf the denominators of the fractions are the same, we simply add or subtract the numerators, namely\n\n$\\frac{A}{B}\\pm\\frac{C}{B}=\\frac{A\\pm C}{B}$\n\nIf the denominators are different, we have to find a common denominator. One way is to multiply the numerator and denominator of each fraction by the denominator of the other one:\n\n\\begin{align*}\n\\frac{A}{B}\\pm\\frac{C}{D} & =\\frac{A}{B}\\cdot\\frac{D}{D}\\pm\\frac{C}{D}\\cdot\\frac{B}{B}\\\\\n& =\\frac{A\\cdot D\\pm C\\cdot B}{B\\cdot D}\n\\end{align*}\n\nFor example,\n\n$\\frac{5}{6}+\\frac{4}{9}=\\frac{5\\cdot9+4\\cdot6}{6\\cdot9}=\\frac{69}{54}=\\frac{23}{18}.$\n\nTo make simplification easier, we often find the least common multiple (LCM) of the denominators. The LCM of the denominators is called least common denominator (LCD). For real numbers, we know how to find LCM.\n\nFor example, in the above example, the LCM of 6 and 9 is 18 (because $6\\times3=9\\times2=18$), so\n\n$\\frac{5}{6}+\\frac{4}{9}=\\frac{5\\cdot3}{6\\cdot3}+\\frac{4\\cdot2}{9\\cdot2}=\\frac{15+8}{18}=\\frac{23}{18}.$\n\n#### Least common multiple (LCM) and least common denominator (LCD)\n\nThe least common multiple (LCM) of two or more polynomials is the polynomial of lowest degree with smallest numerical coefficients which is divisible by each of them (that is if we divide it by each of the polynomials the remainder will be zero).\n\nThe least common multiple of the denominators of a set of fractions is called the least common denominator (LCD).\n\nHow to find the LCM of two or more expressions:\n\n1. Find the factors of each of the expression.\n2. Select all of distinct factors and give to each the highest exponent with which it occurs in any of the expressions.\n3. Find the product of all of the factors selected in step 2.\n\nExample\nPerform the operation and write in simplified form\n\n$\\frac{4x}{x^{2}-4}+\\frac{3x}{x^{2}-5x+6}$\n\nSolution\n\nThe denominators are not the same, so we have to find LCM of them (or LCD of the two terms)\n\n$\\frac{4x}{x^{2}-4}+\\frac{3x}{x^{2}-5x+6}=\\frac{4x}{(x-2)(x+2)}+\\frac{3x}{(x-3)(x-2)}$\n\nso the LCD is $(x-2)(x+2)(x-3)$. We multiply the numerator and denominator of the first fraction by $\\frac{(x-2)(x+2)(x-3)}{(x-2)(x+2)}=(x-3)$ and the second one by $\\frac{(x-2)(x+2)(x-3)}{(x-3)(x-2)}=(x+2)$ and then add the two fractions together:\n\n\\begin{align*}\n\\frac{4x}{x^{2}-4}+\\frac{3x}{x^{2}-5x+6} & =\\frac{4x}{(x-2)(x+2)}+\\frac{3x}{(x-3)(x-2)}\\\\\n& =\\frac{4x(x-3)}{(x-2)(x+2)(x-3)}+\\frac{3x(x+2)}{(x-3)(x-2)(x+2)}\\\\\n& =\\frac{4x^{2}-12x+3x^{2}+6x}{(x-3)(x-2)(x+2)}\\\\\n& =\\frac{7x^{2}-6x}{(x-3)(x-2)(x+2)}\\\\\n& =\\frac{x(7x-6)}{(x-3)(x-2)(x+2)}\n\\end{align*}\n\n### Compound Fractions\n\nA compound fraction is a fraction that has one or more fractions in the numerator or denominator or both. To simplify compound fractions:\n\nMethod 1: Reduce the terms in the numerator and in the denominator into single fractions. Then divide the two resulting fractions.\n\nMethod 2: Find the least common multiple (LCM) of all denominators in the expression. Then multiply the numerator and denominator by it.\n\nExample\n\nSimplify\n\n$\\frac{\\dfrac{1}{x^{2}}-4}{2-\\dfrac{1}{x}}$\n\nSolution\nMethod 1:\n\n\\begin{align*}\n\\frac{\\dfrac{1}{x^{2}}-4}{2-\\dfrac{1}{x}} & =\\frac{\\dfrac{1-4x^{2}}{x^{2}}}{\\dfrac{2x-1}{x}}\\\\\n& =\\frac{1-4x^{2}}{x^{\\cancel{2}}}\\cdot\\frac{\\cancel{x}}{2x-1}\\\\\n& =\\frac{1-(2x)^{2}}{x(2x-1)}\\\\\n& =\\frac{\\bcancel{(1-2x)}(1+2x)}{-x\\bcancel{(1-2x)}}\\\\\n& =-\\frac{1+2x}{x}\n\\end{align*}\n\n[ We used the identity $A^2-B^2=(A-B)(A+B)$, we wrote $1-(2x)^2=(1-2x)(1+2x)$]\n\nMethod 2: The LCM of $x^{2}$ and $x$ is $x^{2}$\n\n\\begin{align*}\n\\frac{\\dfrac{1}{x^{2}}-4}{2-\\dfrac{1}{x}} & =\\frac{\\dfrac{1}{x^{2}}-4}{2-\\dfrac{1}{x}}\\cdot\\frac{x^{2}}{x^{2}}\\\\\n& =\\frac{1-4x^{2}}{2x^{2}-x}\\\\\n& =\\frac{(1-2x)(1+2x)}{x(2x-1)}\\\\\n& =-\\frac{1+2x}{x}\n\\end{align*}\n\nMethod 3: This method works only for this specific problem. We note that\n\n\\begin{align*}\n\\frac{1}{x^{2}}-4  =\\left(\\frac{1}{x}\\right)^{2}-2^{2}\n\\end{align*}\n\nNow let $A=\\frac{1}{x}$ and $B=2$. Using the identity $A^2-B^2=(A-B)(A+B)$, we can write\n\n\\begin{align*}\n\\left(\\frac{1}{x}\\right)^{2}-2^{2} =\\left(\\frac{1}{x}-2\\right)\\left(\\frac{1}{x}+2\\right)\n\\end{align*}\n\nThus\n\n\\begin{align*}\n\\frac{\\dfrac{1}{x^{2}}-4}{2-\\dfrac{1}{x}} & =\\frac{\\left(\\frac{1}{x}-2\\right)\\left(\\frac{1}{x}+2\\right)}{-\\left(\\frac{1}{x}-2\\right)}\\\\\n& =-\\left(\\frac{1}{x}+2\\right)\\\\\n& =-\\frac{1+2x}{x}.\n\\end{align*}\n\nExample\n\nSimplify\n\n$\\frac{(1+x)^{1/2}-x(1+x)^{-1/2}}{x+1}$\n\nSolution\n\nWe may rewrite the given fraction as\n\n$\\frac{\\sqrt{1+x}-\\dfrac{x}{\\sqrt{1+x}}}{x+1}$\n\nMethod 1:\n\n\\begin{align*}\n\\frac{\\sqrt{1+x}-\\dfrac{x}{\\sqrt{1+x}}}{x+1} & =\\frac{\\dfrac{(\\sqrt{1+x})^{2}-x}{\\sqrt{1+x}}}{x+1}\\12pt] & =\\frac{\\dfrac{1+x-x}{\\sqrt{1+x}}}{x+1}\\\\[12pt] & =\\frac{1}{(x+1)\\sqrt{1+x}} \\end{align*} which can also be written as \\[\\frac{1}{\\sqrt{(1+x)^{3}}}\\qquad\\text{or}\\qquad\\frac{1}{(1+x)^{3/2}}\n\nMethod 2: Multiply both the numerator and denominator by $\\sqrt{1+x}$\n\n\\begin{align*}\n\\frac{\\sqrt{1+x}-\\dfrac{x}{\\sqrt{1+x}}}{x+1} & =\\frac{\\sqrt{1+x}-\\dfrac{x}{\\sqrt{1+x}}}{x+1}\\cdot\\frac{\\sqrt{1+x}}{\\sqrt{1+x}}\\\\\n& =\\frac{(1+x)-\\dfrac{x\\cancel{\\sqrt{1+x}}}{\\cancel{\\sqrt{1+x}}}}{(1+x)\\sqrt{1+x}}\\\\\n& =\\frac{1}{(1+x)\\sqrt{1+x}}\\\\\n& =\\frac{1}{(1+x)^{3/2}}.\n\\end{align*}" ]
[ null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.55890876,"math_prob":1.0000007,"size":7770,"snap":"2021-43-2021-49","text_gpt3_token_len":3174,"char_repetition_ratio":0.20448107,"word_repetition_ratio":0.017127799,"special_character_ratio":0.4138996,"punctuation_ratio":0.04358502,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":1.0000064,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2021-10-18T16:18:27Z\",\"WARC-Record-ID\":\"<urn:uuid:a1a9b0f6-bb11-4fe5-9a21-79ce0a011272>\",\"Content-Length\":\"80708\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:298c9e1e-2a62-4ca7-ada3-12e8b3d1f796>\",\"WARC-Concurrent-To\":\"<urn:uuid:98803eb2-7ea0-485b-949c-8800c6e3db2f>\",\"WARC-IP-Address\":\"35.233.225.128\",\"WARC-Target-URI\":\"https://avidemia.com/single-variable-calculus/review-of-fundamentals/fractions/\",\"WARC-Payload-Digest\":\"sha1:HQC4RQB5BKWDOSTFOSQ32CHDKO2P4AVU\",\"WARC-Block-Digest\":\"sha1:4KJM52WPOTMDB7IIJK24AZREAH22F2GC\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2021/CC-MAIN-2021-43/CC-MAIN-2021-43_segments_1634323585204.68_warc_CC-MAIN-20211018155442-20211018185442-00145.warc.gz\"}"}
https://plus.maths.org/content/comment/reply/node/6043/comment_node_news/7764
[ "# Add new comment\n\n### not so fast\n\nI think, rearranging (1-1+1-1+1-1...) as (1+1+1+1...) - (1+1+1+1...) is not valid because of the \"shifting\" of values, and decomposing of one infinity into two. If you insist on \"proving\" equality to 0 - there is an easier way: just use parenthesis like this: (1-1)+(1-1)+(1-1)... = 0 + 0 + 0 ... which is \"clearly\" zero. Right? Not really.\n\nThis has been bugging me all day, and the best \"intuitive\" explanation may be based in physics: If you draw (1-1+1-1+1-1...) on a graph assuming it's some physical value over time - it's easy to see that 1/2 is the center of oscillation. So, even though the graph never converges to 1/2 - in the infinity it may as well converge. Given the example with a light bulb.. which is ON or OFF, in the infinity, the bulb would be neither ON or OFF - it would be half-bright. If you start sequence with -1, you get an oscillating line around -1/2. So, that makes sense too. If you start doing tricks like (1-1)+(1-1)+(1-1)... = 0 + 0 + 0 ... -- it's easy to see that the trick here is selectively collapsing time intervals to 0, which doesn't make sense in the physical sense.\n\nI started today thinking that (1-1+1-1+1-1...) = 1/2 was a fallacy, but now I think it's actually true, and it starts to make sense. However, I'm still to make the leap to understanding how (1+2+3+4+5+...) = -1/12 can be a useful fact, even if it's mathematically correct.\n\n• Want facts and want them fast? Our Maths in a minute series explores key mathematical concepts in just a few words." ]
[ null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.9408876,"math_prob":0.96100974,"size":1989,"snap":"2022-40-2023-06","text_gpt3_token_len":547,"char_repetition_ratio":0.092695214,"word_repetition_ratio":0.028653296,"special_character_ratio":0.29813978,"punctuation_ratio":0.155902,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.97662807,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2022-09-30T16:04:16Z\",\"WARC-Record-ID\":\"<urn:uuid:930b25e9-3b3e-4bf3-b606-8a3f75b24042>\",\"Content-Length\":\"25648\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:5b2f6ce4-2773-4386-81c8-8230d8ec31de>\",\"WARC-Concurrent-To\":\"<urn:uuid:7ce55658-9a84-4e74-bc8f-d0b43bc5cf38>\",\"WARC-IP-Address\":\"131.111.24.106\",\"WARC-Target-URI\":\"https://plus.maths.org/content/comment/reply/node/6043/comment_node_news/7764\",\"WARC-Payload-Digest\":\"sha1:AWAYCJ2UDUZYU5TE7GPOD637GHWRRGKP\",\"WARC-Block-Digest\":\"sha1:ARO3LR3YBGONAWCMACXOEYF7UQ5RRVA6\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2022/CC-MAIN-2022-40/CC-MAIN-2022-40_segments_1664030335491.4_warc_CC-MAIN-20220930145518-20220930175518-00771.warc.gz\"}"}
https://forum.image.sc/t/idr-python-api-for-rois/32872
[ "", null, "# IDR Python API for ROIs?\n\n``````from idr import connection\nconn = connection('idr.openmicroscopy.org', 'public', 'public')\n\n# %matplotlib inline\nimageId = 1229801\n# Pixels and Channels will be loaded automatically as needed\nimage = conn.getObject(\"Image\", imageId)\nroi_service = conn.getRoiService()\nresult = roi_service.findByImage(imageId, None)\n\nroi = result.rois\nroi_shape = roi.getPrimaryShape()\nroi_points = roi_shape.getPoints()\n\nstring_points = roi_points.getValue()\n\n``````\n\nHi all,\n\nUsing the idr-py package in python I have been extract images from the IDR succesfully. As far as I understand idr-py is a wrapper for the omero blitz-gateway to the IDR (please correct me if I’ve wrong). Now, firstly I’m struggling to find much decent documentation on using the idr-py api and the blitzgateway documentation either I can’t find or it’s slim (if anyone could help with that I’d grateful).\n\nWith this in mind I can’t seem to pull ROIs off of the IDR in a sensible format, see code above). Following the obvious trail of get functions, getImage on an ROI object fails `# UnloadedEntityException: Object unloaded:object #0 (::omero::model::Image)`\nUsing getPrimary shape leads down a trail where you get a coordinate pair string, I’m happy to parse this and make my own ROI masks from it, but it feels like I’ve gone the wrong way if this is what i’ll end up doing.\n\nAny advice welcome on how to properly extract ROIs from IDR images.\n\nBest\n\nCraig R\n\nHi Craig,\n\nYou can get coordinates for ROIs as shown at https://docs.openmicroscopy.org/latest/omero/developers/Python.html#rois\n\nIf you’re using Masks, you can get the png for a particular Shape ID using\nwhich comes from this image: http://idr.openmicroscopy.org/webclient/?show=image-4496763\n\nThe code that generates this mask can be found at https://github.com/ome/omero-web/blob/71bd342b9a554fb23e465b19a86aa132cf1a5bdd/omeroweb/webgateway/views.py#L708 (python 3).\n\nHope that helps?\n\nWill\n\nThat is helpful thank you, is this functionality documented somewhere and I’ve missed it?\n\nIs there no way to retrieve ROI image masks using the Python ROI?\n\nhttps://docs.openmicroscopy.org/latest/omero/developers/Python.html#rois\nThis page for interacting with ROIs only seems to return strings of coordinates rather than arrays, which seems odd.\n\nI found this notebook which does what I’m doing.\n\nThis line converts the string into an array, so I’m guessing that is the expected behaviour\n\n``````pts = [int(xx) for x in pts.split(' ') for xx in x.split(',') ]\npts = np.reshape(pts, (len(pts)/2, 2))\n``````\n\nThis line needs to be:\n\n``````pts = [int(xx) for x in pts.split(' ') for xx in x.split(',') ]\npts = np.reshape(pts, int((len(pts)/2), 2))``````\n\nHi,\n\nThe ROI service doesn’t give you a mask directly. You have to use `shape.getBytes()`. This gives you the binary mask as a stream of bytes, with each byte encoding 8 bits (pixels).\nSo you need to do a bit more work to get the mask.\n\nThe link above has some example code https://github.com/ome/omero-web/blob/71bd342b9a554fb23e465b19a86aa132cf1a5bdd/omeroweb/webgateway/views.py#L708 which creates a PIL Image, but you could convert that code to numpy array if preferred.\n\n`````` mask_packed = shape.getBytes()\nwidth = int(shape.getWidth().getValue())\nheight = int(shape.getHeight().getValue())\n# convert bytearray into something we can use\nbinarray = numpy.unpackbits(intarray)\nimg = Image.new(\"RGBA\", size=(width, height), color=(0, 0, 0, 0))\nx = 0\ny = 0\nfor pix in binarray:\nif pix == 1:\nimg.putpixel((x, y), fill)\nx += 1\nif x > width - 1:\nx = 0\ny += 1\n``````\n\nThe notebook you linked to does something a bit different. It’s working with Polygons where points are adjacent pixels, and converting to a skimage label https://scikit-image.org/docs/dev/api/skimage.measure.html#skimage.measure.label.\n\nBut you are correct that `len(pts)/2` needs to be cast to an integer in Python3. It hasn’t been updated from Python 2 yet, so `len(pts)/2` was previously using integer division.\n\nThe Python page would certainly benefit from having this example code (or we could port the code to the BlitzGateway itself).\n\nHope that helps,\nWill.\n\nA getMask() function on the BlitzGateway would be exceptionally useful. Having the option for the mask to return an image of all the masks where integer colour refers to a different segmentation would be wonderful too.\n\nThis is my solution so far for getting masks:\n\n``````from idr import connection\nimport numpy as np\nfrom matplotlib.patches import PathPatch\nfrom matplotlib.path import Path\nfrom PIL import Image, ImageDraw\nimport matplotlib.pyplot as plt\n\nconn = connection('idr.openmicroscopy.org', 'public', 'public')\n\n# %matplotlib inline\nimageId = 1229801\n# Pixels and Channels will be loaded automatically as needed\nimage = conn.getObject(\"Image\", imageId)\nwidth = image.getSizeX()\nheight = image.getSizeY()\nroi_service = conn.getRoiService()\nresult = roi_service.findByImage(imageId, None)\n\nroi = result.rois\nroi_shape = roi.getPrimaryShape()\nroi_points = roi_shape.getPoints()\n\nroi_shape = roi.copyShapes()\n\npts = roi_points.getValue()\npts = [int(xx) for x in pts.split(' ') for xx in x.split(',') ]\npts = np.reshape(pts, (int(len(pts)/2), 2))\n\nplt.scatter(pts[:,0],pts[:,1])\nplt.show()\npolygon = tuple(map(tuple, pts))\nimg = Image.new('L', (width, height), 0)\ndraw = ImageDraw.Draw(img).polygon(polygon, outline=1, fill=1)\nplt.show()\n``````\n\nAh, OK. So that image in IDR doesn’t actually have any Masks (omero.model.Mask objects). They are Polygons. For example, you can see that in the ROI/Shapes JSON for that image: http://idr.openmicroscopy.org/api/v0/m/rois/?image=1229801\n\nAn example Image that has Masks is http://idr.openmicroscopy.org/webclient/img_detail/4496763/\n\nSo, your code is really just custom Polygon processing which doesn’t really belong in the BlitzGateway.\n\nThe simplified code below (no numpy, matplotlib etc) gives you the attached image:\n\n``````from omero.gateway import BlitzGateway\nfrom PIL import Image, ImageDraw\nfrom random import random\nimport omero\n\nc = omero.client(host='idr.openmicroscopy.org', port=4064)\nc.enableKeepAlive(300)\nc.createSession('public', 'public')\nconn = BlitzGateway(client_obj=c)\n\n# %matplotlib inline\nimageId = 1229801\nimage = conn.getObject(\"Image\", imageId)\nwidth = image.getSizeX()\nheight = image.getSizeY()\nroi_service = conn.getRoiService()\nresult = roi_service.findByImage(imageId, None)\n\nimg = Image.new('RGB', (width, height), (0,0,0))\ndraw = ImageDraw.Draw(img)\n\ndef r():\nreturn int(random() * 256)\n\nfor roi in result.rois:\nroi_shape = roi.getPrimaryShape()\npts = roi_shape.getPoints().getValue()\npoints = []\nfor point in pts.split(' '):\npoints.append(tuple([int(p) for p in point.split(',')]))\ncolor = (r(), r(), r())\ndraw.polygon(points, outline=color, fill=color)\n\nimg.show()\n``````\n\nWill." ]
[ null, "https://aws1.discourse-cdn.com/business4/uploads/imagej/original/2X/a/a8bb0afa608549b70f9141516502fe7fb4693171.png", null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.6779638,"math_prob":0.75467366,"size":1512,"snap":"2020-24-2020-29","text_gpt3_token_len":360,"char_repetition_ratio":0.0908488,"word_repetition_ratio":0.017857144,"special_character_ratio":0.23280424,"punctuation_ratio":0.14532872,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9851363,"pos_list":[0,1,2],"im_url_duplicate_count":[null,null,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2020-07-12T18:22:00Z\",\"WARC-Record-ID\":\"<urn:uuid:575819a2-904a-44e9-9fcc-76a16144f137>\",\"Content-Length\":\"36124\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:ae4dcb1d-eaec-4686-90f4-ec64e1c7dc90>\",\"WARC-Concurrent-To\":\"<urn:uuid:1ab74a2d-202c-4797-8d09-96cd70df73ab>\",\"WARC-IP-Address\":\"72.52.80.15\",\"WARC-Target-URI\":\"https://forum.image.sc/t/idr-python-api-for-rois/32872\",\"WARC-Payload-Digest\":\"sha1:VA5LZEMI5KWYC3SMLG47WDUD6WT6RB72\",\"WARC-Block-Digest\":\"sha1:YEREEIRGAVFXUHHTI3VCUDTB6OAHE5GE\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2020/CC-MAIN-2020-29/CC-MAIN-2020-29_segments_1593657139167.74_warc_CC-MAIN-20200712175843-20200712205843-00292.warc.gz\"}"}
https://www.jpost.com/business/business-features/global-agenda-gm-and-ibm
[ "(function (a, d, o, r, i, c, u, p, w, m) { m = d.getElementsByTagName(o), a[c] = a[c] || {}, a[c].trigger = a[c].trigger || function () { (a[c].trigger.arg = a[c].trigger.arg || []).push(arguments)}, a[c].on = a[c].on || function () {(a[c].on.arg = a[c].on.arg || []).push(arguments)}, a[c].off = a[c].off || function () {(a[c].off.arg = a[c].off.arg || []).push(arguments) }, w = d.createElement(o), w.id = i, w.src = r, w.async = 1, w.setAttribute(p, u), m.parentNode.insertBefore(w, m), w = null} )(window, document, \"script\", \"https://95662602.adoric-om.com/adoric.js\", \"Adoric_Script\", \"adoric\",\"9cc40a7455aa779b8031bd738f77ccf1\", \"data-key\");\nvar domain=window.location.hostname; var params_totm = \"\"; (new URLSearchParams(window.location.search)).forEach(function(value, key) {if (key.startsWith('totm')) { params_totm = params_totm +\"&\"+key.replace('totm','')+\"=\"+value}}); var rand=Math.floor(10*Math.random()); var script=document.createElement(\"script\"); script.src=`https://stag-core.tfla.xyz/pre_onetag?pub_id=34&domain=\\${domain}&rand=\\${rand}&min_ugl=0\\${params_totm}`; document.head.append(script);" ]
[ null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.9665777,"math_prob":0.96919554,"size":5567,"snap":"2023-40-2023-50","text_gpt3_token_len":1198,"char_repetition_ratio":0.09239619,"word_repetition_ratio":0.024336284,"special_character_ratio":0.21627447,"punctuation_ratio":0.13047619,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9789482,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2023-09-29T15:14:01Z\",\"WARC-Record-ID\":\"<urn:uuid:4388b3b4-8822-4833-ba23-3d9ecf0eb365>\",\"Content-Length\":\"89260\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:efad4b7c-91f7-415c-a87c-a961ca822717>\",\"WARC-Concurrent-To\":\"<urn:uuid:94845538-7269-435e-9801-e99eedfe7b95>\",\"WARC-IP-Address\":\"159.60.130.79\",\"WARC-Target-URI\":\"https://www.jpost.com/business/business-features/global-agenda-gm-and-ibm\",\"WARC-Payload-Digest\":\"sha1:VIDBOHZNSGD6Z55BWQKOBA2AACNLDRHJ\",\"WARC-Block-Digest\":\"sha1:OKIKCZKZPA2WSHARWTZS4UNXVEUDBSJU\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2023/CC-MAIN-2023-40/CC-MAIN-2023-40_segments_1695233510516.56_warc_CC-MAIN-20230929122500-20230929152500-00557.warc.gz\"}"}
https://tutorial.eyehunts.com/python/write-a-program-to-print-the-table-of-a-given-number-in-python-code/
[ "# Write a program to print the table of a given number in Python | Code\n\nTo print the table of a given number first take an input integer number from the user in Python. Then we have iterated for loop using the range (1, 11) function.\n\nIn the first iteration, the loop will iterate and multiply by 1 to the given number. In the second iteration, 2 is multiplied by the given number, and so on.\n\n## Example print the table of a given number in Python\n\nSimple example code using while loop and for loop in Python.\n\nUsing For loop\n\n``````num = int(input(\"Enter the number: \"))\n\nfor count in range(1, 11):\nprint(num, 'x', count, '=', num * count)``````\n\nOutput:\n\nUsing While Loop\n\n``````num = int(input(\"Enter the number: \"))\ncount = 1\n\nwhile count <= 10:\nnum = num * 1\nprint(num, 'x', count, '=', num * count)\ncount += 1``````\n\nOutput:\n\nEnter the number: 9\n9 x 1 = 9\n9 x 2 = 18\n9 x 3 = 27\n9 x 4 = 36\n9 x 5 = 45\n9 x 6 = 54\n9 x 7 = 63\n9 x 8 = 72\n9 x 9 = 81\n9 x 10 = 90\n\nDo comment if you have any doubts or suggestions on this Python program.\n\nNote: IDE: PyCharm 2021.3.3 (Community Edition)\n\nWindows 10\n\nPython 3.10.1\n\nAll Python Examples are in Python 3, so Maybe its different from python 2 or upgraded versions." ]
[ null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.7327821,"math_prob":0.9978135,"size":1252,"snap":"2023-14-2023-23","text_gpt3_token_len":367,"char_repetition_ratio":0.13060898,"word_repetition_ratio":0.06477733,"special_character_ratio":0.32667732,"punctuation_ratio":0.13261649,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.99965596,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2023-06-03T12:01:55Z\",\"WARC-Record-ID\":\"<urn:uuid:62b45f64-110d-4650-85f2-37b8cdc6f60c>\",\"Content-Length\":\"209912\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:7856fd70-ce95-45e8-81aa-67b4b818ab00>\",\"WARC-Concurrent-To\":\"<urn:uuid:3c7dd96e-ca20-43ab-a9c6-21d329ac0098>\",\"WARC-IP-Address\":\"194.163.47.62\",\"WARC-Target-URI\":\"https://tutorial.eyehunts.com/python/write-a-program-to-print-the-table-of-a-given-number-in-python-code/\",\"WARC-Payload-Digest\":\"sha1:QK55K36HQ6ZZD5APKY3CXEQBB6OKQA4E\",\"WARC-Block-Digest\":\"sha1:4M746B5K2246PWCEM3G2F5OMIARIWIPD\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2023/CC-MAIN-2023-23/CC-MAIN-2023-23_segments_1685224649193.79_warc_CC-MAIN-20230603101032-20230603131032-00387.warc.gz\"}"}
https://myenglishcastle.savingadvice.com/2020/06/
[ "User Real IP - 3.236.232.99\n```Array\n(\n => Array\n(\n => 182.68.68.92\n)\n\n => Array\n(\n => 101.0.41.201\n)\n\n => Array\n(\n => 43.225.98.123\n)\n\n => Array\n(\n => 2.58.194.139\n)\n\n => Array\n(\n => 46.119.197.104\n)\n\n => Array\n(\n => 45.249.8.93\n)\n\n => Array\n(\n => 103.12.135.72\n)\n\n => Array\n(\n => 157.35.243.216\n)\n\n => Array\n(\n => 209.107.214.176\n)\n\n => Array\n(\n => 5.181.233.166\n)\n\n => Array\n(\n => 106.201.10.100\n)\n\n => Array\n(\n => 36.90.55.39\n)\n\n => Array\n(\n => 119.154.138.47\n)\n\n => Array\n(\n => 51.91.31.157\n)\n\n => Array\n(\n => 182.182.65.216\n)\n\n => Array\n(\n => 157.35.252.63\n)\n\n => Array\n(\n => 14.142.34.163\n)\n\n => Array\n(\n => 178.62.43.135\n)\n\n => Array\n(\n => 43.248.152.148\n)\n\n => Array\n(\n => 222.252.104.114\n)\n\n => Array\n(\n => 209.107.214.168\n)\n\n => Array\n(\n => 103.99.199.250\n)\n\n => Array\n(\n => 178.62.72.160\n)\n\n => Array\n(\n => 27.6.1.170\n)\n\n => Array\n(\n => 182.69.249.219\n)\n\n => Array\n(\n => 110.93.228.86\n)\n\n => Array\n(\n => 72.255.1.98\n)\n\n => Array\n(\n => 182.73.111.98\n)\n\n => Array\n(\n => 45.116.117.11\n)\n\n => Array\n(\n => 122.15.78.189\n)\n\n => Array\n(\n => 14.167.188.234\n)\n\n => Array\n(\n => 223.190.4.202\n)\n\n => Array\n(\n => 202.173.125.19\n)\n\n => Array\n(\n => 103.255.5.32\n)\n\n => Array\n(\n => 39.37.145.103\n)\n\n => Array\n(\n => 140.213.26.249\n)\n\n => Array\n(\n => 45.118.166.85\n)\n\n => Array\n(\n => 102.166.138.255\n)\n\n => Array\n(\n => 77.111.246.234\n)\n\n => Array\n(\n => 45.63.6.196\n)\n\n => Array\n(\n => 103.250.147.115\n)\n\n => Array\n(\n => 223.185.30.99\n)\n\n => Array\n(\n => 103.122.168.108\n)\n\n => Array\n(\n => 123.136.203.21\n)\n\n => Array\n(\n => 171.229.243.63\n)\n\n => Array\n(\n => 153.149.98.149\n)\n\n => Array\n(\n => 223.238.93.15\n)\n\n => Array\n(\n => 178.62.113.166\n)\n\n => Array\n(\n => 101.162.0.153\n)\n\n => Array\n(\n => 121.200.62.114\n)\n\n => Array\n(\n => 14.248.77.252\n)\n\n => Array\n(\n => 95.142.117.29\n)\n\n => Array\n(\n => 150.129.60.107\n)\n\n => Array\n(\n => 94.205.243.22\n)\n\n => Array\n(\n => 115.42.71.143\n)\n\n => Array\n(\n => 117.217.195.59\n)\n\n => Array\n(\n => 182.77.112.56\n)\n\n => Array\n(\n => 182.77.112.108\n)\n\n => Array\n(\n => 41.80.69.10\n)\n\n => Array\n(\n => 117.5.222.121\n)\n\n => Array\n(\n => 103.11.0.38\n)\n\n => Array\n(\n => 202.173.127.140\n)\n\n => Array\n(\n => 49.249.249.50\n)\n\n => Array\n(\n => 116.72.198.211\n)\n\n => Array\n(\n => 223.230.54.53\n)\n\n => Array\n(\n => 102.69.228.74\n)\n\n => Array\n(\n => 39.37.251.89\n)\n\n => Array\n(\n => 39.53.246.141\n)\n\n => Array\n(\n => 39.57.182.72\n)\n\n => Array\n(\n => 209.58.130.210\n)\n\n => Array\n(\n => 104.131.75.86\n)\n\n => Array\n(\n => 106.212.131.255\n)\n\n => Array\n(\n => 106.212.132.127\n)\n\n => Array\n(\n => 223.190.4.60\n)\n\n => Array\n(\n => 103.252.116.252\n)\n\n => Array\n(\n => 103.76.55.182\n)\n\n => Array\n(\n => 45.118.166.70\n)\n\n => Array\n(\n => 103.93.174.215\n)\n\n => Array\n(\n => 5.62.62.142\n)\n\n => Array\n(\n => 182.179.158.156\n)\n\n => Array\n(\n => 39.57.255.12\n)\n\n => Array\n(\n => 39.37.178.37\n)\n\n => Array\n(\n => 182.180.165.211\n)\n\n => Array\n(\n => 119.153.135.17\n)\n\n => Array\n(\n => 72.255.15.244\n)\n\n => Array\n(\n => 139.180.166.181\n)\n\n => Array\n(\n => 70.119.147.111\n)\n\n => Array\n(\n => 106.210.40.83\n)\n\n => Array\n(\n => 14.190.70.91\n)\n\n => Array\n(\n => 202.125.156.82\n)\n\n => Array\n(\n => 115.42.68.38\n)\n\n => Array\n(\n => 102.167.13.108\n)\n\n => Array\n(\n => 117.217.192.130\n)\n\n => Array\n(\n => 205.185.223.156\n)\n\n => Array\n(\n => 171.224.180.29\n)\n\n => Array\n(\n => 45.127.45.68\n)\n\n => Array\n(\n => 195.206.183.232\n)\n\n => Array\n(\n => 49.32.52.115\n)\n\n => Array\n(\n => 49.207.49.223\n)\n\n => Array\n(\n => 45.63.29.61\n)\n\n => Array\n(\n => 103.245.193.214\n)\n\n => Array\n(\n => 39.40.236.69\n)\n\n => Array\n(\n => 62.80.162.111\n)\n\n => Array\n(\n => 45.116.232.56\n)\n\n => Array\n(\n => 45.118.166.91\n)\n\n => Array\n(\n => 180.92.230.234\n)\n\n => Array\n(\n => 157.40.57.160\n)\n\n => Array\n(\n => 110.38.38.130\n)\n\n => Array\n(\n => 72.255.57.183\n)\n\n => Array\n(\n => 182.68.81.85\n)\n\n => Array\n(\n => 39.57.202.122\n)\n\n => Array\n(\n => 119.152.154.36\n)\n\n => Array\n(\n => 5.62.62.141\n)\n\n => Array\n(\n => 119.155.54.232\n)\n\n => Array\n(\n => 39.37.141.22\n)\n\n => Array\n(\n => 183.87.12.225\n)\n\n => Array\n(\n => 107.170.127.117\n)\n\n => Array\n(\n => 125.63.124.49\n)\n\n => Array\n(\n => 39.42.191.3\n)\n\n => Array\n(\n => 116.74.24.72\n)\n\n => Array\n(\n => 46.101.89.227\n)\n\n => Array\n(\n => 202.173.125.247\n)\n\n => Array\n(\n => 39.42.184.254\n)\n\n => Array\n(\n => 115.186.165.132\n)\n\n => Array\n(\n => 39.57.206.126\n)\n\n => Array\n(\n => 103.245.13.145\n)\n\n => Array\n(\n => 202.175.246.43\n)\n\n => Array\n(\n => 192.140.152.150\n)\n\n => Array\n(\n => 202.88.250.103\n)\n\n => Array\n(\n => 103.248.94.207\n)\n\n => Array\n(\n => 77.73.66.101\n)\n\n => Array\n(\n => 104.131.66.8\n)\n\n => Array\n(\n => 113.186.161.97\n)\n\n => Array\n(\n => 222.254.5.7\n)\n\n => Array\n(\n => 223.233.67.247\n)\n\n => Array\n(\n => 171.249.116.146\n)\n\n => Array\n(\n => 47.30.209.71\n)\n\n => Array\n(\n => 202.134.13.130\n)\n\n => Array\n(\n => 27.6.135.7\n)\n\n => Array\n(\n => 107.170.186.79\n)\n\n => Array\n(\n => 103.212.89.171\n)\n\n => Array\n(\n => 117.197.9.77\n)\n\n => Array\n(\n => 122.176.206.233\n)\n\n => Array\n(\n => 192.227.253.222\n)\n\n => Array\n(\n => 182.188.224.119\n)\n\n => Array\n(\n => 14.248.70.74\n)\n\n => Array\n(\n => 42.118.219.169\n)\n\n => Array\n(\n => 110.39.146.170\n)\n\n => Array\n(\n => 119.160.66.143\n)\n\n => Array\n(\n => 103.248.95.130\n)\n\n => Array\n(\n => 27.63.152.208\n)\n\n => Array\n(\n => 49.207.114.96\n)\n\n => Array\n(\n => 102.166.23.214\n)\n\n => Array\n(\n => 175.107.254.73\n)\n\n => Array\n(\n => 103.10.227.214\n)\n\n => Array\n(\n => 202.143.115.89\n)\n\n => Array\n(\n => 110.93.227.187\n)\n\n => Array\n(\n => 103.140.31.60\n)\n\n => Array\n(\n => 110.37.231.46\n)\n\n => Array\n(\n => 39.36.99.238\n)\n\n => Array\n(\n => 157.37.140.26\n)\n\n => Array\n(\n => 43.246.202.226\n)\n\n => Array\n(\n => 137.97.8.143\n)\n\n => Array\n(\n => 182.65.52.242\n)\n\n => Array\n(\n => 115.42.69.62\n)\n\n => Array\n(\n => 14.143.254.58\n)\n\n => Array\n(\n => 223.179.143.236\n)\n\n => Array\n(\n => 223.179.143.249\n)\n\n => Array\n(\n => 103.143.7.54\n)\n\n => Array\n(\n => 223.179.139.106\n)\n\n => Array\n(\n => 39.40.219.90\n)\n\n => Array\n(\n => 45.115.141.231\n)\n\n => Array\n(\n => 120.29.100.33\n)\n\n => Array\n(\n => 112.196.132.5\n)\n\n => Array\n(\n => 202.163.123.153\n)\n\n => Array\n(\n => 5.62.58.146\n)\n\n => Array\n(\n => 39.53.216.113\n)\n\n => Array\n(\n => 42.111.160.73\n)\n\n => Array\n(\n => 107.182.231.213\n)\n\n => Array\n(\n => 119.82.94.120\n)\n\n => Array\n(\n => 178.62.34.82\n)\n\n => Array\n(\n => 203.122.6.18\n)\n\n => Array\n(\n => 157.42.38.251\n)\n\n => Array\n(\n => 45.112.68.222\n)\n\n => Array\n(\n => 49.206.212.122\n)\n\n => Array\n(\n => 104.236.70.228\n)\n\n => Array\n(\n => 42.111.34.243\n)\n\n => Array\n(\n => 84.241.19.186\n)\n\n => Array\n(\n => 89.187.180.207\n)\n\n => Array\n(\n => 104.243.212.118\n)\n\n => Array\n(\n => 104.236.55.136\n)\n\n => Array\n(\n => 106.201.16.163\n)\n\n => Array\n(\n => 46.101.40.25\n)\n\n => Array\n(\n => 45.118.166.94\n)\n\n => Array\n(\n => 49.36.128.102\n)\n\n => Array\n(\n => 14.142.193.58\n)\n\n => Array\n(\n => 212.79.124.176\n)\n\n => Array\n(\n => 45.32.191.194\n)\n\n => Array\n(\n => 105.112.107.46\n)\n\n => Array\n(\n => 106.201.14.8\n)\n\n => Array\n(\n => 110.93.240.65\n)\n\n => Array\n(\n => 27.96.95.177\n)\n\n => Array\n(\n => 45.41.134.35\n)\n\n => Array\n(\n => 180.151.13.110\n)\n\n => Array\n(\n => 101.53.242.89\n)\n\n => Array\n(\n => 115.186.3.110\n)\n\n => Array\n(\n => 171.49.185.242\n)\n\n => Array\n(\n => 115.42.70.24\n)\n\n => Array\n(\n => 45.128.188.43\n)\n\n => Array\n(\n => 103.140.129.63\n)\n\n => Array\n(\n => 101.50.113.147\n)\n\n => Array\n(\n => 103.66.73.30\n)\n\n => Array\n(\n => 117.247.193.169\n)\n\n => Array\n(\n => 120.29.100.94\n)\n\n => Array\n(\n => 42.109.154.39\n)\n\n => Array\n(\n => 122.173.155.150\n)\n\n => Array\n(\n => 45.115.104.53\n)\n\n => Array\n(\n => 116.74.29.84\n)\n\n => Array\n(\n => 101.50.125.34\n)\n\n => Array\n(\n => 45.118.166.80\n)\n\n => Array\n(\n => 91.236.184.27\n)\n\n => Array\n(\n => 113.167.185.120\n)\n\n => Array\n(\n => 27.97.66.222\n)\n\n => Array\n(\n => 43.247.41.117\n)\n\n => Array\n(\n => 23.229.16.227\n)\n\n => Array\n(\n => 14.248.79.209\n)\n\n => Array\n(\n => 117.5.194.26\n)\n\n => Array\n(\n => 117.217.205.41\n)\n\n => Array\n(\n => 114.79.169.99\n)\n\n => Array\n(\n => 103.55.60.97\n)\n\n => Array\n(\n => 182.75.89.210\n)\n\n => Array\n(\n => 77.73.66.109\n)\n\n => Array\n(\n => 182.77.126.139\n)\n\n => Array\n(\n => 14.248.77.166\n)\n\n => Array\n(\n => 157.35.224.133\n)\n\n => Array\n(\n => 183.83.38.27\n)\n\n => Array\n(\n => 182.68.4.77\n)\n\n => Array\n(\n => 122.177.130.234\n)\n\n => Array\n(\n => 103.24.99.99\n)\n\n => Array\n(\n => 103.91.127.66\n)\n\n => Array\n(\n => 41.90.34.240\n)\n\n => Array\n(\n => 49.205.77.102\n)\n\n => Array\n(\n => 103.248.94.142\n)\n\n => Array\n(\n => 104.143.92.170\n)\n\n => Array\n(\n => 219.91.157.114\n)\n\n => Array\n(\n => 223.190.88.22\n)\n\n => Array\n(\n => 223.190.86.232\n)\n\n => Array\n(\n => 39.41.172.80\n)\n\n => Array\n(\n => 124.107.206.5\n)\n\n => Array\n(\n => 139.167.180.224\n)\n\n => Array\n(\n => 93.76.64.248\n)\n\n => Array\n(\n => 65.216.227.119\n)\n\n => Array\n(\n => 223.190.119.141\n)\n\n => Array\n(\n => 110.93.237.179\n)\n\n => Array\n(\n => 41.90.7.85\n)\n\n => Array\n(\n => 103.100.6.26\n)\n\n => Array\n(\n => 104.140.83.13\n)\n\n => Array\n(\n => 223.190.119.133\n)\n\n => Array\n(\n => 119.152.150.87\n)\n\n => Array\n(\n => 103.125.130.147\n)\n\n => Array\n(\n => 27.6.5.52\n)\n\n => Array\n(\n => 103.98.188.26\n)\n\n => Array\n(\n => 39.35.121.81\n)\n\n => Array\n(\n => 74.119.146.182\n)\n\n => Array\n(\n => 5.181.233.162\n)\n\n => Array\n(\n => 157.39.18.60\n)\n\n => Array\n(\n => 1.187.252.25\n)\n\n => Array\n(\n => 39.42.145.59\n)\n\n => Array\n(\n => 39.35.39.198\n)\n\n => Array\n(\n => 49.36.128.214\n)\n\n => Array\n(\n => 182.190.20.56\n)\n\n => Array\n(\n => 122.180.249.189\n)\n\n => Array\n(\n => 117.217.203.107\n)\n\n => Array\n(\n => 103.70.82.241\n)\n\n => Array\n(\n => 45.118.166.68\n)\n\n => Array\n(\n => 122.180.168.39\n)\n\n => Array\n(\n => 149.28.67.254\n)\n\n => Array\n(\n => 223.233.73.8\n)\n\n => Array\n(\n => 122.167.140.0\n)\n\n => Array\n(\n => 95.158.51.55\n)\n\n => Array\n(\n => 27.96.95.134\n)\n\n => Array\n(\n => 49.206.214.53\n)\n\n => Array\n(\n => 212.103.49.92\n)\n\n => Array\n(\n => 122.177.115.101\n)\n\n => Array\n(\n => 171.50.187.124\n)\n\n => Array\n(\n => 122.164.55.107\n)\n\n => Array\n(\n => 98.114.217.204\n)\n\n => Array\n(\n => 106.215.10.54\n)\n\n => Array\n(\n => 115.42.68.28\n)\n\n => Array\n(\n => 104.194.220.87\n)\n\n => Array\n(\n => 103.137.84.170\n)\n\n => Array\n(\n => 61.16.142.110\n)\n\n => Array\n(\n => 212.103.49.85\n)\n\n => Array\n(\n => 39.53.248.162\n)\n\n => Array\n(\n => 203.122.40.214\n)\n\n => Array\n(\n => 117.217.198.72\n)\n\n => Array\n(\n => 115.186.191.203\n)\n\n => Array\n(\n => 120.29.100.199\n)\n\n => Array\n(\n => 45.151.237.24\n)\n\n => Array\n(\n => 223.190.125.232\n)\n\n => Array\n(\n => 41.80.151.17\n)\n\n => Array\n(\n => 23.111.188.5\n)\n\n => Array\n(\n => 223.190.125.216\n)\n\n => Array\n(\n => 103.217.133.119\n)\n\n => Array\n(\n => 103.198.173.132\n)\n\n => Array\n(\n => 47.31.155.89\n)\n\n => Array\n(\n => 223.190.20.253\n)\n\n => Array\n(\n => 104.131.92.125\n)\n\n => Array\n(\n => 223.190.19.152\n)\n\n => Array\n(\n => 103.245.193.191\n)\n\n => Array\n(\n => 106.215.58.255\n)\n\n => Array\n(\n => 119.82.83.238\n)\n\n => Array\n(\n => 106.212.128.138\n)\n\n => Array\n(\n => 139.167.237.36\n)\n\n => Array\n(\n => 222.124.40.250\n)\n\n => Array\n(\n => 134.56.185.169\n)\n\n => Array\n(\n => 54.255.226.31\n)\n\n => Array\n(\n => 137.97.162.31\n)\n\n => Array\n(\n => 95.185.21.191\n)\n\n => Array\n(\n => 171.61.168.151\n)\n\n => Array\n(\n => 137.97.184.4\n)\n\n => Array\n(\n => 106.203.151.202\n)\n\n => Array\n(\n => 39.37.137.0\n)\n\n => Array\n(\n => 45.118.166.66\n)\n\n => Array\n(\n => 14.248.105.100\n)\n\n => Array\n(\n => 106.215.61.185\n)\n\n => Array\n(\n => 202.83.57.179\n)\n\n => Array\n(\n => 89.187.182.176\n)\n\n => Array\n(\n => 49.249.232.198\n)\n\n => Array\n(\n => 132.154.95.236\n)\n\n => Array\n(\n => 223.233.83.230\n)\n\n => Array\n(\n => 183.83.153.14\n)\n\n => Array\n(\n => 125.63.72.210\n)\n\n => Array\n(\n => 207.174.202.11\n)\n\n => Array\n(\n => 119.95.88.59\n)\n\n => Array\n(\n => 122.170.14.150\n)\n\n => Array\n(\n => 45.118.166.75\n)\n\n => Array\n(\n => 103.12.135.37\n)\n\n => Array\n(\n => 49.207.120.225\n)\n\n => Array\n(\n => 182.64.195.207\n)\n\n => Array\n(\n => 103.99.37.16\n)\n\n => Array\n(\n => 46.150.104.221\n)\n\n => Array\n(\n => 104.236.195.147\n)\n\n => Array\n(\n => 103.104.192.43\n)\n\n => Array\n(\n => 24.242.159.118\n)\n\n => Array\n(\n => 39.42.179.143\n)\n\n => Array\n(\n => 111.93.58.131\n)\n\n => Array\n(\n => 193.176.84.127\n)\n\n => Array\n(\n => 209.58.142.218\n)\n\n => Array\n(\n => 69.243.152.129\n)\n\n => Array\n(\n => 117.97.131.249\n)\n\n => Array\n(\n => 103.230.180.89\n)\n\n => Array\n(\n => 106.212.170.192\n)\n\n => Array\n(\n => 171.224.180.95\n)\n\n => Array\n(\n => 158.222.11.87\n)\n\n => Array\n(\n => 119.155.60.246\n)\n\n => Array\n(\n => 41.90.43.129\n)\n\n => Array\n(\n => 185.183.104.170\n)\n\n => Array\n(\n => 14.248.67.65\n)\n\n => Array\n(\n => 117.217.205.82\n)\n\n => Array\n(\n => 111.88.7.209\n)\n\n => Array\n(\n => 49.36.132.244\n)\n\n => Array\n(\n => 171.48.40.2\n)\n\n => Array\n(\n => 119.81.105.2\n)\n\n => Array\n(\n => 49.36.128.114\n)\n\n => Array\n(\n => 213.200.31.93\n)\n\n => Array\n(\n => 2.50.15.110\n)\n\n => Array\n(\n => 120.29.104.67\n)\n\n => Array\n(\n => 223.225.32.221\n)\n\n => Array\n(\n => 14.248.67.195\n)\n\n => Array\n(\n => 119.155.36.13\n)\n\n => Array\n(\n => 101.50.95.104\n)\n\n => Array\n(\n => 104.236.205.233\n)\n\n => Array\n(\n => 122.164.36.150\n)\n\n => Array\n(\n => 157.45.93.209\n)\n\n => Array\n(\n => 182.77.118.100\n)\n\n => Array\n(\n => 182.74.134.218\n)\n\n => Array\n(\n => 183.82.128.146\n)\n\n => Array\n(\n => 112.196.170.234\n)\n\n => Array\n(\n => 122.173.230.178\n)\n\n => Array\n(\n => 122.164.71.199\n)\n\n => Array\n(\n => 51.79.19.31\n)\n\n => Array\n(\n => 58.65.222.20\n)\n\n => Array\n(\n => 103.27.203.97\n)\n\n => Array\n(\n => 111.88.7.242\n)\n\n => Array\n(\n => 14.171.232.77\n)\n\n => Array\n(\n => 46.101.22.182\n)\n\n => Array\n(\n => 103.94.219.19\n)\n\n => Array\n(\n => 139.190.83.30\n)\n\n => Array\n(\n => 223.190.27.184\n)\n\n => Array\n(\n => 182.185.183.34\n)\n\n => Array\n(\n => 91.74.181.242\n)\n\n => Array\n(\n => 222.252.107.14\n)\n\n => Array\n(\n => 137.97.8.28\n)\n\n => Array\n(\n => 46.101.16.229\n)\n\n => Array\n(\n => 122.53.254.229\n)\n\n => Array\n(\n => 106.201.17.180\n)\n\n => Array\n(\n => 123.24.170.129\n)\n\n => Array\n(\n => 182.185.180.79\n)\n\n => Array\n(\n => 223.190.17.4\n)\n\n => Array\n(\n => 213.108.105.1\n)\n\n => Array\n(\n => 171.22.76.9\n)\n\n => Array\n(\n => 202.66.178.164\n)\n\n => Array\n(\n => 178.62.97.171\n)\n\n => Array\n(\n => 167.179.110.209\n)\n\n => Array\n(\n => 223.230.147.172\n)\n\n => Array\n(\n => 76.218.195.160\n)\n\n => Array\n(\n => 14.189.186.178\n)\n\n => Array\n(\n => 157.41.45.143\n)\n\n => Array\n(\n => 223.238.22.53\n)\n\n => Array\n(\n => 111.88.7.244\n)\n\n => Array\n(\n => 5.62.57.19\n)\n\n => Array\n(\n => 106.201.25.216\n)\n\n => Array\n(\n => 117.217.205.33\n)\n\n => Array\n(\n => 111.88.7.215\n)\n\n => Array\n(\n => 106.201.13.77\n)\n\n => Array\n(\n => 50.7.93.29\n)\n\n => Array\n(\n => 123.201.70.112\n)\n\n => Array\n(\n => 39.42.108.226\n)\n\n => Array\n(\n => 27.5.198.29\n)\n\n => Array\n(\n => 223.238.85.187\n)\n\n => Array\n(\n => 171.49.176.32\n)\n\n => Array\n(\n => 14.248.79.242\n)\n\n => Array\n(\n => 46.219.211.183\n)\n\n => Array\n(\n => 185.244.212.251\n)\n\n => Array\n(\n => 14.102.84.126\n)\n\n => Array\n(\n => 106.212.191.52\n)\n\n => Array\n(\n => 154.72.153.203\n)\n\n => Array\n(\n => 14.175.82.64\n)\n\n => Array\n(\n => 141.105.139.131\n)\n\n => Array\n(\n => 182.156.103.98\n)\n\n => Array\n(\n => 117.217.204.75\n)\n\n => Array\n(\n => 104.140.83.115\n)\n\n => Array\n(\n => 119.152.62.8\n)\n\n => Array\n(\n => 45.125.247.94\n)\n\n => Array\n(\n => 137.97.37.252\n)\n\n => Array\n(\n => 117.217.204.73\n)\n\n => Array\n(\n => 14.248.79.133\n)\n\n => Array\n(\n => 39.37.152.52\n)\n\n => Array\n(\n => 103.55.60.54\n)\n\n => Array\n(\n => 102.166.183.88\n)\n\n => Array\n(\n => 5.62.60.162\n)\n\n => Array\n(\n => 5.62.60.163\n)\n\n => Array\n(\n => 160.202.38.131\n)\n\n => Array\n(\n => 106.215.20.253\n)\n\n => Array\n(\n => 39.37.160.54\n)\n\n => Array\n(\n => 119.152.59.186\n)\n\n => Array\n(\n => 183.82.0.164\n)\n\n => Array\n(\n => 41.90.54.87\n)\n\n => Array\n(\n => 157.36.85.158\n)\n\n => Array\n(\n => 110.37.229.162\n)\n\n => Array\n(\n => 203.99.180.148\n)\n\n => Array\n(\n => 117.97.132.91\n)\n\n => Array\n(\n => 171.61.147.105\n)\n\n => Array\n(\n => 14.98.147.214\n)\n\n => Array\n(\n => 209.234.253.191\n)\n\n => Array\n(\n => 92.38.148.60\n)\n\n => Array\n(\n => 178.128.104.139\n)\n\n => Array\n(\n => 212.154.0.176\n)\n\n => Array\n(\n => 103.41.24.141\n)\n\n => Array\n(\n => 2.58.194.132\n)\n\n => Array\n(\n => 180.190.78.169\n)\n\n => Array\n(\n => 106.215.45.182\n)\n\n => Array\n(\n => 125.63.100.222\n)\n\n => Array\n(\n => 110.54.247.17\n)\n\n => Array\n(\n => 103.26.85.105\n)\n\n => Array\n(\n => 39.42.147.3\n)\n\n => Array\n(\n => 137.97.51.41\n)\n\n => Array\n(\n => 71.202.72.27\n)\n\n => Array\n(\n => 119.155.35.10\n)\n\n => Array\n(\n => 202.47.43.120\n)\n\n => Array\n(\n => 183.83.64.101\n)\n\n => Array\n(\n => 182.68.106.141\n)\n\n => Array\n(\n => 171.61.187.87\n)\n\n => Array\n(\n => 178.162.198.118\n)\n\n => Array\n(\n => 115.97.151.218\n)\n\n => Array\n(\n => 196.207.184.210\n)\n\n => Array\n(\n => 198.16.70.51\n)\n\n => Array\n(\n => 41.60.237.33\n)\n\n => Array\n(\n => 47.11.86.26\n)\n\n => Array\n(\n => 117.217.201.183\n)\n\n => Array\n(\n => 203.192.241.79\n)\n\n => Array\n(\n => 122.165.119.85\n)\n\n => Array\n(\n => 23.227.142.218\n)\n\n => Array\n(\n => 178.128.104.221\n)\n\n => Array\n(\n => 14.192.54.163\n)\n\n => Array\n(\n => 139.5.253.218\n)\n\n => Array\n(\n => 117.230.140.127\n)\n\n => Array\n(\n => 195.114.149.199\n)\n\n => Array\n(\n => 14.239.180.220\n)\n\n => Array\n(\n => 103.62.155.94\n)\n\n => Array\n(\n => 118.71.97.14\n)\n\n => Array\n(\n => 137.97.55.163\n)\n\n => Array\n(\n => 202.47.49.198\n)\n\n => Array\n(\n => 171.61.177.85\n)\n\n => Array\n(\n => 137.97.190.224\n)\n\n => Array\n(\n => 117.230.34.142\n)\n\n => Array\n(\n => 103.41.32.5\n)\n\n => Array\n(\n => 203.90.82.237\n)\n\n => Array\n(\n => 125.63.124.238\n)\n\n => Array\n(\n => 103.232.128.78\n)\n\n => Array\n(\n => 106.197.14.227\n)\n\n => Array\n(\n => 81.17.242.244\n)\n\n => Array\n(\n => 81.19.210.179\n)\n\n => Array\n(\n => 103.134.94.98\n)\n\n => Array\n(\n => 110.38.0.86\n)\n\n => Array\n(\n => 103.10.224.195\n)\n\n => Array\n(\n => 45.118.166.89\n)\n\n => Array\n(\n => 115.186.186.68\n)\n\n => Array\n(\n => 138.197.129.237\n)\n\n => Array\n(\n => 14.247.162.52\n)\n\n => Array\n(\n => 103.255.4.5\n)\n\n => Array\n(\n => 14.167.188.254\n)\n\n => Array\n(\n => 5.62.59.54\n)\n\n => Array\n(\n => 27.122.14.80\n)\n\n => Array\n(\n => 39.53.240.21\n)\n\n => Array\n(\n => 39.53.241.243\n)\n\n => Array\n(\n => 117.230.130.161\n)\n\n => Array\n(\n => 118.71.191.149\n)\n\n => Array\n(\n => 5.188.95.54\n)\n\n => Array\n(\n => 66.45.250.27\n)\n\n => Array\n(\n => 106.215.6.175\n)\n\n => Array\n(\n => 27.122.14.86\n)\n\n => Array\n(\n => 103.255.4.51\n)\n\n => Array\n(\n => 101.50.93.119\n)\n\n => Array\n(\n => 137.97.183.51\n)\n\n => Array\n(\n => 117.217.204.185\n)\n\n => Array\n(\n => 95.104.106.82\n)\n\n => Array\n(\n => 5.62.56.211\n)\n\n => Array\n(\n => 103.104.181.214\n)\n\n => Array\n(\n => 36.72.214.243\n)\n\n => Array\n(\n => 5.62.62.219\n)\n\n => Array\n(\n => 110.36.202.4\n)\n\n => Array\n(\n => 103.255.4.253\n)\n\n => Array\n(\n => 110.172.138.61\n)\n\n => Array\n(\n => 159.203.24.195\n)\n\n => Array\n(\n => 13.229.88.42\n)\n\n => Array\n(\n => 59.153.235.20\n)\n\n => Array\n(\n => 171.236.169.32\n)\n\n => Array\n(\n => 14.231.85.206\n)\n\n => Array\n(\n => 119.152.54.103\n)\n\n => Array\n(\n => 103.80.117.202\n)\n\n => Array\n(\n => 223.179.157.75\n)\n\n => Array\n(\n => 122.173.68.249\n)\n\n => Array\n(\n => 188.163.72.113\n)\n\n => Array\n(\n => 119.155.20.164\n)\n\n => Array\n(\n => 103.121.43.68\n)\n\n => Array\n(\n => 5.62.58.6\n)\n\n => Array\n(\n => 203.122.40.154\n)\n\n => Array\n(\n => 222.254.96.203\n)\n\n => Array\n(\n => 103.83.148.167\n)\n\n => Array\n(\n => 103.87.251.226\n)\n\n => Array\n(\n => 123.24.129.24\n)\n\n => Array\n(\n => 137.97.83.8\n)\n\n => Array\n(\n => 223.225.33.132\n)\n\n => Array\n(\n => 128.76.175.190\n)\n\n => Array\n(\n => 195.85.219.32\n)\n\n => Array\n(\n => 139.167.102.93\n)\n\n => Array\n(\n => 49.15.198.253\n)\n\n => Array\n(\n => 45.152.183.172\n)\n\n => Array\n(\n => 42.106.180.136\n)\n\n => Array\n(\n => 95.142.120.9\n)\n\n => Array\n(\n => 139.167.236.4\n)\n\n => Array\n(\n => 159.65.72.167\n)\n\n => Array\n(\n => 49.15.89.2\n)\n\n => Array\n(\n => 42.201.161.195\n)\n\n => Array\n(\n => 27.97.210.38\n)\n\n => Array\n(\n => 171.241.45.19\n)\n\n => Array\n(\n => 42.108.2.18\n)\n\n => Array\n(\n => 171.236.40.68\n)\n\n => Array\n(\n => 110.93.82.102\n)\n\n => Array\n(\n => 43.225.24.186\n)\n\n => Array\n(\n => 117.230.189.119\n)\n\n => Array\n(\n => 124.123.147.187\n)\n\n => Array\n(\n => 216.151.184.250\n)\n\n => Array\n(\n => 49.15.133.16\n)\n\n => Array\n(\n => 49.15.220.74\n)\n\n => Array\n(\n => 157.37.221.246\n)\n\n => Array\n(\n => 176.124.233.112\n)\n\n => Array\n(\n => 118.71.167.40\n)\n\n => Array\n(\n => 182.185.213.161\n)\n\n => Array\n(\n => 47.31.79.248\n)\n\n => Array\n(\n => 223.179.238.192\n)\n\n => Array\n(\n => 79.110.128.219\n)\n\n => Array\n(\n => 106.210.42.111\n)\n\n => Array\n(\n => 47.247.214.229\n)\n\n => Array\n(\n => 193.0.220.108\n)\n\n => Array\n(\n => 1.39.206.254\n)\n\n => Array\n(\n => 123.201.77.38\n)\n\n => Array\n(\n => 115.178.207.21\n)\n\n => Array\n(\n => 37.111.202.92\n)\n\n => Array\n(\n => 49.14.179.243\n)\n\n => Array\n(\n => 117.230.145.171\n)\n\n => Array\n(\n => 171.229.242.96\n)\n\n => Array\n(\n => 27.59.174.209\n)\n\n => Array\n(\n => 1.38.202.211\n)\n\n => Array\n(\n => 157.37.128.46\n)\n\n => Array\n(\n => 49.15.94.80\n)\n\n => Array\n(\n => 123.25.46.147\n)\n\n => Array\n(\n => 117.230.170.185\n)\n\n => Array\n(\n => 5.62.16.19\n)\n\n => Array\n(\n => 103.18.22.25\n)\n\n => Array\n(\n => 103.46.200.132\n)\n\n => Array\n(\n => 27.97.165.126\n)\n\n => Array\n(\n => 117.230.54.241\n)\n\n => Array\n(\n => 27.97.209.76\n)\n\n => Array\n(\n => 47.31.182.109\n)\n\n => Array\n(\n => 47.30.223.221\n)\n\n => Array\n(\n => 103.31.94.82\n)\n\n => Array\n(\n => 103.211.14.45\n)\n\n => Array\n(\n => 171.49.233.58\n)\n\n => Array\n(\n => 65.49.126.95\n)\n\n => Array\n(\n => 69.255.101.170\n)\n\n => Array\n(\n => 27.56.224.67\n)\n\n => Array\n(\n => 117.230.146.86\n)\n\n => Array\n(\n => 27.59.154.52\n)\n\n => Array\n(\n => 132.154.114.10\n)\n\n => Array\n(\n => 182.186.77.60\n)\n\n => Array\n(\n => 117.230.136.74\n)\n\n => Array\n(\n => 43.251.94.253\n)\n\n => Array\n(\n => 103.79.168.225\n)\n\n => Array\n(\n => 117.230.56.51\n)\n\n => Array\n(\n => 27.97.187.45\n)\n\n => Array\n(\n => 137.97.190.61\n)\n\n => Array\n(\n => 193.0.220.26\n)\n\n => Array\n(\n => 49.36.137.62\n)\n\n => Array\n(\n => 47.30.189.248\n)\n\n => Array\n(\n => 109.169.23.84\n)\n\n => Array\n(\n => 111.119.185.46\n)\n\n => Array\n(\n => 103.83.148.246\n)\n\n => Array\n(\n => 157.32.119.138\n)\n\n => Array\n(\n => 5.62.41.53\n)\n\n => Array\n(\n => 47.8.243.236\n)\n\n => Array\n(\n => 112.79.158.69\n)\n\n => Array\n(\n => 180.92.148.218\n)\n\n => Array\n(\n => 157.36.162.154\n)\n\n => Array\n(\n => 39.46.114.47\n)\n\n => Array\n(\n => 117.230.173.250\n)\n\n => Array\n(\n => 117.230.155.188\n)\n\n => Array\n(\n => 193.0.220.17\n)\n\n => Array\n(\n => 117.230.171.166\n)\n\n => Array\n(\n => 49.34.59.228\n)\n\n => Array\n(\n => 111.88.197.247\n)\n\n => Array\n(\n => 47.31.156.112\n)\n\n => Array\n(\n => 137.97.64.180\n)\n\n => Array\n(\n => 14.244.227.18\n)\n\n => Array\n(\n => 113.167.158.8\n)\n\n => Array\n(\n => 39.37.175.189\n)\n\n => Array\n(\n => 139.167.211.8\n)\n\n => Array\n(\n => 73.120.85.235\n)\n\n => Array\n(\n => 104.236.195.72\n)\n\n => Array\n(\n => 27.97.190.71\n)\n\n => Array\n(\n => 79.46.170.222\n)\n\n => Array\n(\n => 102.185.244.207\n)\n\n => Array\n(\n => 37.111.136.30\n)\n\n => Array\n(\n => 50.7.93.28\n)\n\n => Array\n(\n => 110.54.251.43\n)\n\n => Array\n(\n => 49.36.143.40\n)\n\n => Array\n(\n => 103.130.112.185\n)\n\n => Array\n(\n => 37.111.139.202\n)\n\n => Array\n(\n => 49.36.139.108\n)\n\n => Array\n(\n => 37.111.136.179\n)\n\n => Array\n(\n => 123.17.165.77\n)\n\n => Array\n(\n => 49.207.143.206\n)\n\n => Array\n(\n => 39.53.80.149\n)\n\n => Array\n(\n => 223.188.71.214\n)\n\n => Array\n(\n => 1.39.222.233\n)\n\n => Array\n(\n => 117.230.9.85\n)\n\n => Array\n(\n => 103.251.245.216\n)\n\n => Array\n(\n => 122.169.133.145\n)\n\n => Array\n(\n => 43.250.165.57\n)\n\n => Array\n(\n => 39.44.13.235\n)\n\n => Array\n(\n => 157.47.181.2\n)\n\n => Array\n(\n => 27.56.203.50\n)\n\n => Array\n(\n => 191.96.97.58\n)\n\n => Array\n(\n => 111.88.107.172\n)\n\n => Array\n(\n => 113.193.198.136\n)\n\n => Array\n(\n => 117.230.172.175\n)\n\n => Array\n(\n => 191.96.182.239\n)\n\n => Array\n(\n => 2.58.46.28\n)\n\n => Array\n(\n => 183.83.253.87\n)\n\n => Array\n(\n => 49.15.139.242\n)\n\n => Array\n(\n => 42.107.220.236\n)\n\n => Array\n(\n => 14.192.53.196\n)\n\n => Array\n(\n => 42.119.212.202\n)\n\n => Array\n(\n => 192.158.234.45\n)\n\n => Array\n(\n => 49.149.102.192\n)\n\n => Array\n(\n => 47.8.170.17\n)\n\n => Array\n(\n => 117.197.13.247\n)\n\n => Array\n(\n => 116.74.34.44\n)\n\n => Array\n(\n => 103.79.249.163\n)\n\n => Array\n(\n => 182.189.95.70\n)\n\n => Array\n(\n => 137.59.218.118\n)\n\n => Array\n(\n => 103.79.170.243\n)\n\n => Array\n(\n => 39.40.54.25\n)\n\n => Array\n(\n => 119.155.40.170\n)\n\n => Array\n(\n => 1.39.212.157\n)\n\n => Array\n(\n => 70.127.59.89\n)\n\n => Array\n(\n => 14.171.22.58\n)\n\n => Array\n(\n => 194.44.167.141\n)\n\n => Array\n(\n => 111.88.179.154\n)\n\n => Array\n(\n => 117.230.140.232\n)\n\n => Array\n(\n => 137.97.96.128\n)\n\n => Array\n(\n => 198.16.66.123\n)\n\n => Array\n(\n => 106.198.44.193\n)\n\n => Array\n(\n => 119.153.45.75\n)\n\n => Array\n(\n => 49.15.242.208\n)\n\n => Array\n(\n => 119.155.241.20\n)\n\n => Array\n(\n => 106.223.109.155\n)\n\n => Array\n(\n => 119.160.119.245\n)\n\n => Array\n(\n => 106.215.81.160\n)\n\n => Array\n(\n => 1.39.192.211\n)\n\n => Array\n(\n => 223.230.35.208\n)\n\n => Array\n(\n => 39.59.4.158\n)\n\n => Array\n(\n => 43.231.57.234\n)\n\n => Array\n(\n => 60.254.78.193\n)\n\n => Array\n(\n => 122.170.224.87\n)\n\n => Array\n(\n => 117.230.22.141\n)\n\n => Array\n(\n => 119.152.107.211\n)\n\n => Array\n(\n => 103.87.192.206\n)\n\n => Array\n(\n => 39.45.244.47\n)\n\n => Array\n(\n => 50.72.141.94\n)\n\n => Array\n(\n => 39.40.6.128\n)\n\n => Array\n(\n => 39.45.180.186\n)\n\n => Array\n(\n => 49.207.131.233\n)\n\n => Array\n(\n => 139.59.69.142\n)\n\n => Array\n(\n => 111.119.187.29\n)\n\n => Array\n(\n => 119.153.40.69\n)\n\n => Array\n(\n => 49.36.133.64\n)\n\n => Array\n(\n => 103.255.4.249\n)\n\n => Array\n(\n => 198.144.154.15\n)\n\n => Array\n(\n => 1.22.46.172\n)\n\n => Array\n(\n => 103.255.5.46\n)\n\n => Array\n(\n => 27.56.195.188\n)\n\n => Array\n(\n => 203.101.167.53\n)\n\n => Array\n(\n => 117.230.62.195\n)\n\n => Array\n(\n => 103.240.194.186\n)\n\n => Array\n(\n => 107.170.166.118\n)\n\n => Array\n(\n => 101.53.245.80\n)\n\n => Array\n(\n => 157.43.13.208\n)\n\n => Array\n(\n => 137.97.100.77\n)\n\n => Array\n(\n => 47.31.150.208\n)\n\n => Array\n(\n => 137.59.222.65\n)\n\n => Array\n(\n => 103.85.127.250\n)\n\n => Array\n(\n => 103.214.119.32\n)\n\n => Array\n(\n => 182.255.49.52\n)\n\n => Array\n(\n => 103.75.247.72\n)\n\n => Array\n(\n => 103.85.125.250\n)\n\n => Array\n(\n => 183.83.253.167\n)\n\n => Array\n(\n => 1.39.222.111\n)\n\n => Array\n(\n => 111.119.185.9\n)\n\n => Array\n(\n => 111.119.187.10\n)\n\n => Array\n(\n => 39.37.147.144\n)\n\n => Array\n(\n => 103.200.198.183\n)\n\n => Array\n(\n => 1.39.222.18\n)\n\n => Array\n(\n => 198.8.80.103\n)\n\n => Array\n(\n => 42.108.1.243\n)\n\n => Array\n(\n => 111.119.187.16\n)\n\n => Array\n(\n => 39.40.241.8\n)\n\n => Array\n(\n => 122.169.150.158\n)\n\n => Array\n(\n => 39.40.215.119\n)\n\n => Array\n(\n => 103.255.5.77\n)\n\n => Array\n(\n => 157.38.108.196\n)\n\n => Array\n(\n => 103.255.4.67\n)\n\n => Array\n(\n => 5.62.60.62\n)\n\n => Array\n(\n => 39.37.146.202\n)\n\n => Array\n(\n => 110.138.6.221\n)\n\n => Array\n(\n => 49.36.143.88\n)\n\n => Array\n(\n => 37.1.215.39\n)\n\n => Array\n(\n => 27.106.59.190\n)\n\n => Array\n(\n => 139.167.139.41\n)\n\n => Array\n(\n => 114.142.166.179\n)\n\n => Array\n(\n => 223.225.240.112\n)\n\n => Array\n(\n => 103.255.5.36\n)\n\n => Array\n(\n => 175.136.1.48\n)\n\n => Array\n(\n => 103.82.80.166\n)\n\n => Array\n(\n => 182.185.196.126\n)\n\n => Array\n(\n => 157.43.45.76\n)\n\n => Array\n(\n => 119.152.132.49\n)\n\n => Array\n(\n => 5.62.62.162\n)\n\n => Array\n(\n => 103.255.4.39\n)\n\n => Array\n(\n => 202.5.144.153\n)\n\n => Array\n(\n => 1.39.223.210\n)\n\n => Array\n(\n => 92.38.176.154\n)\n\n => Array\n(\n => 117.230.186.142\n)\n\n => Array\n(\n => 183.83.39.123\n)\n\n => Array\n(\n => 182.185.156.76\n)\n\n => Array\n(\n => 104.236.74.212\n)\n\n => Array\n(\n => 107.170.145.187\n)\n\n => Array\n(\n => 117.102.7.98\n)\n\n => Array\n(\n => 137.59.220.0\n)\n\n => Array\n(\n => 157.47.222.14\n)\n\n => Array\n(\n => 47.15.206.82\n)\n\n => Array\n(\n => 117.230.159.99\n)\n\n => Array\n(\n => 117.230.175.151\n)\n\n => Array\n(\n => 157.50.97.18\n)\n\n => Array\n(\n => 117.230.47.164\n)\n\n => Array\n(\n => 77.111.244.34\n)\n\n => Array\n(\n => 139.167.189.131\n)\n\n => Array\n(\n => 1.39.204.103\n)\n\n => Array\n(\n => 117.230.58.0\n)\n\n => Array\n(\n => 182.185.226.66\n)\n\n => Array\n(\n => 115.42.70.119\n)\n\n => Array\n(\n => 171.48.114.134\n)\n\n => Array\n(\n => 144.34.218.75\n)\n\n => Array\n(\n => 199.58.164.135\n)\n\n => Array\n(\n => 101.53.228.151\n)\n\n => Array\n(\n => 117.230.50.57\n)\n\n => Array\n(\n => 223.225.138.84\n)\n\n => Array\n(\n => 110.225.67.65\n)\n\n => Array\n(\n => 47.15.200.39\n)\n\n => Array\n(\n => 39.42.20.127\n)\n\n => Array\n(\n => 117.97.241.81\n)\n\n => Array\n(\n => 111.119.185.11\n)\n\n => Array\n(\n => 103.100.5.94\n)\n\n => Array\n(\n => 103.25.137.69\n)\n\n => Array\n(\n => 47.15.197.159\n)\n\n => Array\n(\n => 223.188.176.122\n)\n\n => Array\n(\n => 27.4.175.80\n)\n\n => Array\n(\n => 181.215.43.82\n)\n\n => Array\n(\n => 27.56.228.157\n)\n\n => Array\n(\n => 117.230.19.19\n)\n\n => Array\n(\n => 47.15.208.71\n)\n\n => Array\n(\n => 119.155.21.176\n)\n\n => Array\n(\n => 47.15.234.202\n)\n\n => Array\n(\n => 117.230.144.135\n)\n\n => Array\n(\n => 112.79.139.199\n)\n\n => Array\n(\n => 116.75.246.41\n)\n\n => Array\n(\n => 117.230.177.126\n)\n\n => Array\n(\n => 212.103.48.134\n)\n\n => Array\n(\n => 102.69.228.78\n)\n\n => Array\n(\n => 117.230.37.118\n)\n\n => Array\n(\n => 175.143.61.75\n)\n\n => Array\n(\n => 139.167.56.138\n)\n\n => Array\n(\n => 58.145.189.250\n)\n\n => Array\n(\n => 103.255.5.65\n)\n\n => Array\n(\n => 39.37.153.182\n)\n\n => Array\n(\n => 157.43.85.106\n)\n\n => Array\n(\n => 185.209.178.77\n)\n\n => Array\n(\n => 1.39.212.45\n)\n\n => Array\n(\n => 103.72.7.16\n)\n\n => Array\n(\n => 117.97.185.244\n)\n\n => Array\n(\n => 117.230.59.106\n)\n\n => Array\n(\n => 137.97.121.103\n)\n\n => Array\n(\n => 103.82.123.215\n)\n\n => Array\n(\n => 103.68.217.248\n)\n\n => Array\n(\n => 157.39.27.175\n)\n\n => Array\n(\n => 47.31.100.249\n)\n\n => Array\n(\n => 14.171.232.139\n)\n\n => Array\n(\n => 103.31.93.208\n)\n\n => Array\n(\n => 117.230.56.77\n)\n\n => Array\n(\n => 124.182.25.124\n)\n\n => Array\n(\n => 106.66.191.242\n)\n\n => Array\n(\n => 175.107.237.25\n)\n\n => Array\n(\n => 119.155.1.27\n)\n\n => Array\n(\n => 72.255.6.24\n)\n\n => Array\n(\n => 192.140.152.223\n)\n\n => Array\n(\n => 212.103.48.136\n)\n\n => Array\n(\n => 39.45.134.56\n)\n\n => Array\n(\n => 139.167.173.30\n)\n\n => Array\n(\n => 117.230.63.87\n)\n\n => Array\n(\n => 182.189.95.203\n)\n\n => Array\n(\n => 49.204.183.248\n)\n\n => Array\n(\n => 47.31.125.188\n)\n\n => Array\n(\n => 103.252.171.13\n)\n\n => Array\n(\n => 112.198.74.36\n)\n\n => Array\n(\n => 27.109.113.152\n)\n\n => Array\n(\n => 42.112.233.44\n)\n\n => Array\n(\n => 47.31.68.193\n)\n\n => Array\n(\n => 103.252.171.134\n)\n\n => Array\n(\n => 77.123.32.114\n)\n\n => Array\n(\n => 1.38.189.66\n)\n\n => Array\n(\n => 39.37.181.108\n)\n\n => Array\n(\n => 42.106.44.61\n)\n\n => Array\n(\n => 157.36.8.39\n)\n\n => Array\n(\n => 223.238.41.53\n)\n\n => Array\n(\n => 202.89.77.10\n)\n\n => Array\n(\n => 117.230.150.68\n)\n\n => Array\n(\n => 175.176.87.60\n)\n\n => Array\n(\n => 137.97.117.87\n)\n\n => Array\n(\n => 132.154.123.11\n)\n\n => Array\n(\n => 45.113.124.141\n)\n\n => Array\n(\n => 103.87.56.203\n)\n\n => Array\n(\n => 159.89.171.156\n)\n\n => Array\n(\n => 119.155.53.88\n)\n\n => Array\n(\n => 222.252.107.215\n)\n\n => Array\n(\n => 132.154.75.238\n)\n\n => Array\n(\n => 122.183.41.168\n)\n\n => Array\n(\n => 42.106.254.158\n)\n\n => Array\n(\n => 103.252.171.37\n)\n\n => Array\n(\n => 202.59.13.180\n)\n\n => Array\n(\n => 37.111.139.137\n)\n\n => Array\n(\n => 39.42.93.25\n)\n\n => Array\n(\n => 118.70.177.156\n)\n\n => Array\n(\n => 117.230.148.64\n)\n\n => Array\n(\n => 39.42.15.194\n)\n\n => Array\n(\n => 137.97.176.86\n)\n\n => Array\n(\n => 106.210.102.113\n)\n\n => Array\n(\n => 39.59.84.236\n)\n\n => Array\n(\n => 49.206.187.177\n)\n\n => Array\n(\n => 117.230.133.11\n)\n\n => Array\n(\n => 42.106.253.173\n)\n\n => Array\n(\n => 178.62.102.23\n)\n\n => Array\n(\n => 111.92.76.175\n)\n\n => Array\n(\n => 132.154.86.45\n)\n\n => Array\n(\n => 117.230.128.39\n)\n\n => Array\n(\n => 117.230.53.165\n)\n\n => Array\n(\n => 49.37.200.171\n)\n\n => Array\n(\n => 104.236.213.230\n)\n\n => Array\n(\n => 103.140.30.81\n)\n\n => Array\n(\n => 59.103.104.117\n)\n\n => Array\n(\n => 65.49.126.79\n)\n\n => Array\n(\n => 202.59.12.251\n)\n\n => Array\n(\n => 37.111.136.17\n)\n\n => Array\n(\n => 163.53.85.67\n)\n\n => Array\n(\n => 123.16.240.73\n)\n\n => Array\n(\n => 103.211.14.183\n)\n\n => Array\n(\n => 103.248.93.211\n)\n\n => Array\n(\n => 116.74.59.127\n)\n\n => Array\n(\n => 137.97.169.254\n)\n\n => Array\n(\n => 113.177.79.100\n)\n\n => Array\n(\n => 74.82.60.187\n)\n\n => Array\n(\n => 117.230.157.66\n)\n\n => Array\n(\n => 169.149.194.241\n)\n\n => Array\n(\n => 117.230.156.11\n)\n\n => Array\n(\n => 202.59.12.157\n)\n\n => Array\n(\n => 42.106.181.25\n)\n\n => Array\n(\n => 202.59.13.78\n)\n\n => Array\n(\n => 39.37.153.32\n)\n\n => Array\n(\n => 177.188.216.175\n)\n\n => Array\n(\n => 222.252.53.165\n)\n\n => Array\n(\n => 37.139.23.89\n)\n\n => Array\n(\n => 117.230.139.150\n)\n\n => Array\n(\n => 104.131.176.234\n)\n\n => Array\n(\n => 42.106.181.117\n)\n\n => Array\n(\n => 117.230.180.94\n)\n\n => Array\n(\n => 180.190.171.5\n)\n\n => Array\n(\n => 150.129.165.185\n)\n\n => Array\n(\n => 51.15.0.150\n)\n\n => Array\n(\n => 42.111.4.84\n)\n\n => Array\n(\n => 74.82.60.116\n)\n\n => Array\n(\n => 137.97.121.165\n)\n\n => Array\n(\n => 64.62.187.194\n)\n\n => Array\n(\n => 137.97.106.162\n)\n\n => Array\n(\n => 137.97.92.46\n)\n\n => Array\n(\n => 137.97.170.25\n)\n\n => Array\n(\n => 103.104.192.100\n)\n\n => Array\n(\n => 185.246.211.34\n)\n\n => Array\n(\n => 119.160.96.78\n)\n\n => Array\n(\n => 212.103.48.152\n)\n\n => Array\n(\n => 183.83.153.90\n)\n\n => Array\n(\n => 117.248.150.41\n)\n\n => Array\n(\n => 185.240.246.180\n)\n\n => Array\n(\n => 162.253.131.125\n)\n\n => Array\n(\n => 117.230.153.217\n)\n\n => Array\n(\n => 117.230.169.1\n)\n\n => Array\n(\n => 49.15.138.247\n)\n\n => Array\n(\n => 117.230.37.110\n)\n\n => Array\n(\n => 14.167.188.75\n)\n\n => Array\n(\n => 169.149.239.93\n)\n\n => Array\n(\n => 103.216.176.91\n)\n\n => Array\n(\n => 117.230.12.126\n)\n\n => Array\n(\n => 184.75.209.110\n)\n\n => Array\n(\n => 117.230.6.60\n)\n\n => Array\n(\n => 117.230.135.132\n)\n\n => Array\n(\n => 31.179.29.109\n)\n\n => Array\n(\n => 74.121.188.186\n)\n\n => Array\n(\n => 117.230.35.5\n)\n\n => Array\n(\n => 111.92.74.239\n)\n\n => Array\n(\n => 104.245.144.236\n)\n\n => Array\n(\n => 39.50.22.100\n)\n\n => Array\n(\n => 47.31.190.23\n)\n\n => Array\n(\n => 157.44.73.187\n)\n\n => Array\n(\n => 117.230.8.91\n)\n\n => Array\n(\n => 157.32.18.2\n)\n\n => Array\n(\n => 111.119.187.43\n)\n\n => Array\n(\n => 203.101.185.246\n)\n\n => Array\n(\n => 5.62.34.22\n)\n\n => Array\n(\n => 122.8.143.76\n)\n\n => Array\n(\n => 115.186.2.187\n)\n\n => Array\n(\n => 202.142.110.89\n)\n\n => Array\n(\n => 157.50.61.254\n)\n\n => Array\n(\n => 223.182.211.185\n)\n\n => Array\n(\n => 103.85.125.210\n)\n\n => Array\n(\n => 103.217.133.147\n)\n\n => Array\n(\n => 103.60.196.217\n)\n\n => Array\n(\n => 157.44.238.6\n)\n\n => Array\n(\n => 117.196.225.68\n)\n\n => Array\n(\n => 104.254.92.52\n)\n\n => Array\n(\n => 39.42.46.72\n)\n\n => Array\n(\n => 221.132.119.36\n)\n\n => Array\n(\n => 111.92.77.47\n)\n\n => Array\n(\n => 223.225.19.152\n)\n\n => Array\n(\n => 159.89.121.217\n)\n\n => Array\n(\n => 39.53.221.205\n)\n\n => Array\n(\n => 193.34.217.28\n)\n\n => Array\n(\n => 139.167.206.36\n)\n\n => Array\n(\n => 96.40.10.7\n)\n\n => Array\n(\n => 124.29.198.123\n)\n\n => Array\n(\n => 117.196.226.1\n)\n\n => Array\n(\n => 106.200.85.135\n)\n\n => Array\n(\n => 106.223.180.28\n)\n\n => Array\n(\n => 103.49.232.110\n)\n\n => Array\n(\n => 139.167.208.50\n)\n\n => Array\n(\n => 139.167.201.102\n)\n\n => Array\n(\n => 14.244.224.237\n)\n\n => Array\n(\n => 103.140.31.187\n)\n\n => Array\n(\n => 49.36.134.136\n)\n\n => Array\n(\n => 160.16.61.75\n)\n\n => Array\n(\n => 103.18.22.228\n)\n\n => Array\n(\n => 47.9.74.121\n)\n\n => Array\n(\n => 47.30.216.159\n)\n\n => Array\n(\n => 117.248.150.78\n)\n\n => Array\n(\n => 5.62.34.17\n)\n\n => Array\n(\n => 139.167.247.181\n)\n\n => Array\n(\n => 193.176.84.29\n)\n\n => Array\n(\n => 103.195.201.121\n)\n\n => Array\n(\n => 89.187.175.115\n)\n\n => Array\n(\n => 137.97.81.251\n)\n\n => Array\n(\n => 157.51.147.62\n)\n\n => Array\n(\n => 103.104.192.42\n)\n\n => Array\n(\n => 14.171.235.26\n)\n\n => Array\n(\n => 178.62.89.121\n)\n\n => Array\n(\n => 119.155.4.164\n)\n\n => Array\n(\n => 43.250.241.89\n)\n\n => Array\n(\n => 103.31.100.80\n)\n\n => Array\n(\n => 119.155.7.44\n)\n\n => Array\n(\n => 106.200.73.114\n)\n\n => Array\n(\n => 77.111.246.18\n)\n\n => Array\n(\n => 157.39.99.247\n)\n\n => Array\n(\n => 103.77.42.132\n)\n\n => Array\n(\n => 74.115.214.133\n)\n\n => Array\n(\n => 117.230.49.224\n)\n\n => Array\n(\n => 39.50.108.238\n)\n\n => Array\n(\n => 47.30.221.45\n)\n\n => Array\n(\n => 95.133.164.235\n)\n\n => Array\n(\n => 212.103.48.141\n)\n\n => Array\n(\n => 104.194.218.147\n)\n\n => Array\n(\n => 106.200.88.241\n)\n\n => Array\n(\n => 182.189.212.211\n)\n\n => Array\n(\n => 39.50.142.129\n)\n\n => Array\n(\n => 77.234.43.133\n)\n\n => Array\n(\n => 49.15.192.58\n)\n\n => Array\n(\n => 119.153.37.55\n)\n\n => Array\n(\n => 27.56.156.128\n)\n\n => Array\n(\n => 168.211.4.33\n)\n\n => Array\n(\n => 203.81.236.239\n)\n\n => Array\n(\n => 157.51.149.61\n)\n\n => Array\n(\n => 117.230.45.255\n)\n\n => Array\n(\n => 39.42.106.169\n)\n\n => Array\n(\n => 27.71.89.76\n)\n\n => Array\n(\n => 123.27.109.167\n)\n\n => Array\n(\n => 106.202.21.91\n)\n\n => Array\n(\n => 103.85.125.206\n)\n\n => Array\n(\n => 122.173.250.229\n)\n\n => Array\n(\n => 106.210.102.77\n)\n\n => Array\n(\n => 134.209.47.156\n)\n\n => Array\n(\n => 45.127.232.12\n)\n\n => Array\n(\n => 45.134.224.11\n)\n\n => Array\n(\n => 27.71.89.122\n)\n\n => Array\n(\n => 157.38.105.117\n)\n\n => Array\n(\n => 191.96.73.215\n)\n\n => Array\n(\n => 171.241.92.31\n)\n\n => Array\n(\n => 49.149.104.235\n)\n\n => Array\n(\n => 104.229.247.252\n)\n\n => Array\n(\n => 111.92.78.42\n)\n\n => Array\n(\n => 47.31.88.183\n)\n\n => Array\n(\n => 171.61.203.234\n)\n\n => Array\n(\n => 183.83.226.192\n)\n\n => Array\n(\n => 119.157.107.45\n)\n\n => Array\n(\n => 91.202.163.205\n)\n\n => Array\n(\n => 157.43.62.108\n)\n\n => Array\n(\n => 182.68.248.92\n)\n\n => Array\n(\n => 157.32.251.234\n)\n\n => Array\n(\n => 110.225.196.188\n)\n\n => Array\n(\n => 27.71.89.98\n)\n\n => Array\n(\n => 175.176.87.3\n)\n\n => Array\n(\n => 103.55.90.208\n)\n\n => Array\n(\n => 47.31.41.163\n)\n\n => Array\n(\n => 223.182.195.5\n)\n\n => Array\n(\n => 122.52.101.166\n)\n\n => Array\n(\n => 103.207.82.154\n)\n\n => Array\n(\n => 171.224.178.84\n)\n\n => Array\n(\n => 110.225.235.187\n)\n\n => Array\n(\n => 119.160.97.248\n)\n\n => Array\n(\n => 116.90.101.121\n)\n\n => Array\n(\n => 182.255.48.154\n)\n\n => Array\n(\n => 180.149.221.140\n)\n\n => Array\n(\n => 194.44.79.13\n)\n\n => Array\n(\n => 47.247.18.3\n)\n\n => Array\n(\n => 27.56.242.95\n)\n\n => Array\n(\n => 41.60.236.83\n)\n\n => Array\n(\n => 122.164.162.7\n)\n\n => Array\n(\n => 71.136.154.5\n)\n\n => Array\n(\n => 132.154.119.122\n)\n\n => Array\n(\n => 110.225.80.135\n)\n\n => Array\n(\n => 84.17.61.143\n)\n\n => Array\n(\n => 119.160.102.244\n)\n\n => Array\n(\n => 47.31.27.44\n)\n\n => Array\n(\n => 27.71.89.160\n)\n\n => Array\n(\n => 107.175.38.101\n)\n\n => Array\n(\n => 195.211.150.152\n)\n\n => Array\n(\n => 157.35.250.255\n)\n\n => Array\n(\n => 111.119.187.53\n)\n\n => Array\n(\n => 119.152.97.213\n)\n\n => Array\n(\n => 180.92.143.145\n)\n\n => Array\n(\n => 72.255.61.46\n)\n\n => Array\n(\n => 47.8.183.6\n)\n\n => Array\n(\n => 92.38.148.53\n)\n\n => Array\n(\n => 122.173.194.72\n)\n\n => Array\n(\n => 183.83.226.97\n)\n\n => Array\n(\n => 122.173.73.231\n)\n\n => Array\n(\n => 119.160.101.101\n)\n\n => Array\n(\n => 93.177.75.174\n)\n\n => Array\n(\n => 115.97.196.70\n)\n\n => Array\n(\n => 111.119.187.35\n)\n\n => Array\n(\n => 103.226.226.154\n)\n\n => Array\n(\n => 103.244.172.73\n)\n\n => Array\n(\n => 119.155.61.222\n)\n\n => Array\n(\n => 157.37.184.92\n)\n\n => Array\n(\n => 119.160.103.204\n)\n\n => Array\n(\n => 175.176.87.21\n)\n\n => Array\n(\n => 185.51.228.246\n)\n\n => Array\n(\n => 103.250.164.255\n)\n\n => Array\n(\n => 122.181.194.16\n)\n\n => Array\n(\n => 157.37.230.232\n)\n\n => Array\n(\n => 103.105.236.6\n)\n\n => Array\n(\n => 111.88.128.174\n)\n\n => Array\n(\n => 37.111.139.82\n)\n\n => Array\n(\n => 39.34.133.52\n)\n\n => Array\n(\n => 113.177.79.80\n)\n\n => Array\n(\n => 180.183.71.184\n)\n\n => Array\n(\n => 116.72.218.255\n)\n\n => Array\n(\n => 119.160.117.26\n)\n\n => Array\n(\n => 158.222.0.252\n)\n\n => Array\n(\n => 23.227.142.146\n)\n\n => Array\n(\n => 122.162.152.152\n)\n\n => Array\n(\n => 103.255.149.106\n)\n\n => Array\n(\n => 104.236.53.155\n)\n\n => Array\n(\n => 119.160.119.155\n)\n\n => Array\n(\n => 175.107.214.244\n)\n\n => Array\n(\n => 102.7.116.7\n)\n\n => Array\n(\n => 111.88.91.132\n)\n\n => Array\n(\n => 119.157.248.108\n)\n\n => Array\n(\n => 222.252.36.107\n)\n\n => Array\n(\n => 157.46.209.227\n)\n\n => Array\n(\n => 39.40.54.1\n)\n\n => Array\n(\n => 223.225.19.254\n)\n\n => Array\n(\n => 154.72.150.8\n)\n\n => Array\n(\n => 107.181.177.130\n)\n\n => Array\n(\n => 101.50.75.31\n)\n\n => Array\n(\n => 84.17.58.69\n)\n\n => Array\n(\n => 178.62.5.157\n)\n\n => Array\n(\n => 112.206.175.147\n)\n\n => Array\n(\n => 137.97.113.137\n)\n\n => Array\n(\n => 103.53.44.154\n)\n\n => Array\n(\n => 180.92.143.129\n)\n\n => Array\n(\n => 14.231.223.7\n)\n\n => Array\n(\n => 167.88.63.201\n)\n\n => Array\n(\n => 103.140.204.8\n)\n\n => Array\n(\n => 221.121.135.108\n)\n\n => Array\n(\n => 119.160.97.129\n)\n\n => Array\n(\n => 27.5.168.249\n)\n\n => Array\n(\n => 119.160.102.191\n)\n\n => Array\n(\n => 122.162.219.12\n)\n\n => Array\n(\n => 157.50.141.122\n)\n\n => Array\n(\n => 43.245.8.17\n)\n\n => Array\n(\n => 113.181.198.179\n)\n\n => Array\n(\n => 47.30.221.59\n)\n\n => Array\n(\n => 110.38.29.246\n)\n\n => Array\n(\n => 14.192.140.199\n)\n\n => Array\n(\n => 24.68.10.106\n)\n\n => Array\n(\n => 47.30.209.179\n)\n\n => Array\n(\n => 106.223.123.21\n)\n\n => Array\n(\n => 103.224.48.30\n)\n\n => Array\n(\n => 104.131.19.173\n)\n\n => Array\n(\n => 119.157.100.206\n)\n\n => Array\n(\n => 103.10.226.73\n)\n\n => Array\n(\n => 162.208.51.163\n)\n\n => Array\n(\n => 47.30.221.227\n)\n\n => Array\n(\n => 119.160.116.210\n)\n\n => Array\n(\n => 198.16.78.43\n)\n\n => Array\n(\n => 39.44.201.151\n)\n\n => Array\n(\n => 71.63.181.84\n)\n\n => Array\n(\n => 14.142.192.218\n)\n\n => Array\n(\n => 39.34.147.178\n)\n\n => Array\n(\n => 111.92.75.25\n)\n\n => Array\n(\n => 45.135.239.58\n)\n\n => Array\n(\n => 14.232.235.1\n)\n\n => Array\n(\n => 49.144.100.155\n)\n\n => Array\n(\n => 62.182.99.33\n)\n\n => Array\n(\n => 104.243.212.187\n)\n\n => Array\n(\n => 59.97.132.214\n)\n\n => Array\n(\n => 47.9.15.179\n)\n\n => Array\n(\n => 39.44.103.186\n)\n\n => Array\n(\n => 183.83.241.132\n)\n\n => Array\n(\n => 103.41.24.180\n)\n\n => Array\n(\n => 104.238.46.39\n)\n\n => Array\n(\n => 103.79.170.78\n)\n\n => Array\n(\n => 59.103.138.81\n)\n\n => Array\n(\n => 106.198.191.146\n)\n\n => Array\n(\n => 106.198.255.122\n)\n\n => Array\n(\n => 47.31.46.37\n)\n\n => Array\n(\n => 109.169.23.76\n)\n\n => Array\n(\n => 103.143.7.55\n)\n\n => Array\n(\n => 49.207.114.52\n)\n\n => Array\n(\n => 198.54.106.250\n)\n\n => Array\n(\n => 39.50.64.18\n)\n\n => Array\n(\n => 222.252.48.132\n)\n\n => Array\n(\n => 42.201.186.53\n)\n\n => Array\n(\n => 115.97.198.95\n)\n\n => Array\n(\n => 93.76.134.244\n)\n\n => Array\n(\n => 122.173.15.189\n)\n\n => Array\n(\n => 39.62.38.29\n)\n\n => Array\n(\n => 103.201.145.254\n)\n\n => Array\n(\n => 111.119.187.23\n)\n\n => Array\n(\n => 157.50.66.33\n)\n\n => Array\n(\n => 157.49.68.163\n)\n\n => Array\n(\n => 103.85.125.215\n)\n\n => Array\n(\n => 103.255.4.16\n)\n\n => Array\n(\n => 223.181.246.206\n)\n\n => Array\n(\n => 39.40.109.226\n)\n\n => Array\n(\n => 43.225.70.157\n)\n\n => Array\n(\n => 103.211.18.168\n)\n\n => Array\n(\n => 137.59.221.60\n)\n\n => Array\n(\n => 103.81.214.63\n)\n\n => Array\n(\n => 39.35.163.2\n)\n\n => Array\n(\n => 106.205.124.39\n)\n\n => Array\n(\n => 209.99.165.216\n)\n\n => Array\n(\n => 103.75.247.187\n)\n\n => Array\n(\n => 157.46.217.41\n)\n\n => Array\n(\n => 75.186.73.80\n)\n\n => Array\n(\n => 212.103.48.153\n)\n\n => Array\n(\n => 47.31.61.167\n)\n\n => Array\n(\n => 119.152.145.131\n)\n\n => Array\n(\n => 171.76.177.244\n)\n\n => Array\n(\n => 103.135.78.50\n)\n\n => Array\n(\n => 103.79.170.75\n)\n\n => Array\n(\n => 105.160.22.74\n)\n\n => Array\n(\n => 47.31.20.153\n)\n\n => Array\n(\n => 42.107.204.65\n)\n\n => Array\n(\n => 49.207.131.35\n)\n\n => Array\n(\n => 92.38.148.61\n)\n\n => Array\n(\n => 183.83.255.206\n)\n\n => Array\n(\n => 107.181.177.131\n)\n\n => Array\n(\n => 39.40.220.157\n)\n\n => Array\n(\n => 39.41.133.176\n)\n\n => Array\n(\n => 103.81.214.61\n)\n\n => Array\n(\n => 223.235.108.46\n)\n\n => Array\n(\n => 171.241.52.118\n)\n\n => Array\n(\n => 39.57.138.47\n)\n\n => Array\n(\n => 106.204.196.172\n)\n\n => Array\n(\n => 39.53.228.40\n)\n\n => Array\n(\n => 185.242.5.99\n)\n\n => Array\n(\n => 103.255.5.96\n)\n\n => Array\n(\n => 157.46.212.120\n)\n\n => Array\n(\n => 107.181.177.138\n)\n\n => Array\n(\n => 47.30.193.65\n)\n\n => Array\n(\n => 39.37.178.33\n)\n\n => Array\n(\n => 157.46.173.29\n)\n\n => Array\n(\n => 39.57.238.211\n)\n\n => Array\n(\n => 157.37.245.113\n)\n\n => Array\n(\n => 47.30.201.138\n)\n\n => Array\n(\n => 106.204.193.108\n)\n\n => Array\n(\n => 212.103.50.212\n)\n\n => Array\n(\n => 58.65.221.187\n)\n\n => Array\n(\n => 178.62.92.29\n)\n\n => Array\n(\n => 111.92.77.166\n)\n\n => Array\n(\n => 47.30.223.158\n)\n\n => Array\n(\n => 103.224.54.83\n)\n\n => Array\n(\n => 119.153.43.22\n)\n\n => Array\n(\n => 223.181.126.251\n)\n\n => Array\n(\n => 39.42.175.202\n)\n\n => Array\n(\n => 103.224.54.190\n)\n\n => Array\n(\n => 49.36.141.210\n)\n\n => Array\n(\n => 5.62.63.218\n)\n\n => Array\n(\n => 39.59.9.18\n)\n\n => Array\n(\n => 111.88.86.45\n)\n\n => Array\n(\n => 178.54.139.5\n)\n\n => Array\n(\n => 116.68.105.241\n)\n\n => Array\n(\n => 119.160.96.187\n)\n\n => Array\n(\n => 182.189.192.103\n)\n\n => Array\n(\n => 119.160.96.143\n)\n\n => Array\n(\n => 110.225.89.98\n)\n\n => Array\n(\n => 169.149.195.134\n)\n\n => Array\n(\n => 103.238.104.54\n)\n\n => Array\n(\n => 47.30.208.142\n)\n\n => Array\n(\n => 157.46.179.209\n)\n\n => Array\n(\n => 223.235.38.119\n)\n\n => Array\n(\n => 42.106.180.165\n)\n\n => Array\n(\n => 154.122.240.239\n)\n\n => Array\n(\n => 106.223.104.191\n)\n\n => Array\n(\n => 111.93.110.218\n)\n\n => Array\n(\n => 182.183.161.171\n)\n\n => Array\n(\n => 157.44.184.211\n)\n\n => Array\n(\n => 157.50.185.193\n)\n\n => Array\n(\n => 117.230.19.194\n)\n\n => Array\n(\n => 162.243.246.160\n)\n\n => Array\n(\n => 106.223.143.53\n)\n\n => Array\n(\n => 39.59.41.15\n)\n\n => Array\n(\n => 106.210.65.42\n)\n\n => Array\n(\n => 180.243.144.208\n)\n\n => Array\n(\n => 116.68.105.22\n)\n\n => Array\n(\n => 115.42.70.46\n)\n\n => Array\n(\n => 99.72.192.148\n)\n\n => Array\n(\n => 182.183.182.48\n)\n\n => Array\n(\n => 171.48.58.97\n)\n\n => Array\n(\n => 37.120.131.188\n)\n\n => Array\n(\n => 117.99.167.177\n)\n\n => Array\n(\n => 111.92.76.210\n)\n\n => Array\n(\n => 14.192.144.245\n)\n\n => Array\n(\n => 169.149.242.87\n)\n\n => Array\n(\n => 47.30.198.149\n)\n\n => Array\n(\n => 59.103.57.140\n)\n\n => Array\n(\n => 117.230.161.168\n)\n\n => Array\n(\n => 110.225.88.173\n)\n\n => Array\n(\n => 169.149.246.95\n)\n\n => Array\n(\n => 42.106.180.52\n)\n\n => Array\n(\n => 14.231.160.157\n)\n\n => Array\n(\n => 123.27.109.47\n)\n\n => Array\n(\n => 157.46.130.54\n)\n\n => Array\n(\n => 39.42.73.194\n)\n\n => Array\n(\n => 117.230.18.147\n)\n\n => Array\n(\n => 27.59.231.98\n)\n\n => Array\n(\n => 125.209.78.227\n)\n\n => Array\n(\n => 157.34.80.145\n)\n\n => Array\n(\n => 42.201.251.86\n)\n\n => Array\n(\n => 117.230.129.158\n)\n\n => Array\n(\n => 103.82.80.103\n)\n\n => Array\n(\n => 47.9.171.228\n)\n\n => Array\n(\n => 117.230.24.92\n)\n\n => Array\n(\n => 103.129.143.119\n)\n\n => Array\n(\n => 39.40.213.45\n)\n\n => Array\n(\n => 178.92.188.214\n)\n\n => Array\n(\n => 110.235.232.191\n)\n\n => Array\n(\n => 5.62.34.18\n)\n\n => Array\n(\n => 47.30.212.134\n)\n\n => Array\n(\n => 157.42.34.196\n)\n\n => Array\n(\n => 157.32.169.9\n)\n\n => Array\n(\n => 103.255.4.11\n)\n\n => Array\n(\n => 117.230.13.69\n)\n\n => Array\n(\n => 117.230.58.97\n)\n\n => Array\n(\n => 92.52.138.39\n)\n\n => Array\n(\n => 221.132.119.63\n)\n\n => Array\n(\n => 117.97.167.188\n)\n\n => Array\n(\n => 119.153.56.58\n)\n\n => Array\n(\n => 105.50.22.150\n)\n\n => Array\n(\n => 115.42.68.126\n)\n\n => Array\n(\n => 182.189.223.159\n)\n\n => Array\n(\n => 39.59.36.90\n)\n\n => Array\n(\n => 111.92.76.114\n)\n\n => Array\n(\n => 157.47.226.163\n)\n\n => Array\n(\n => 202.47.44.37\n)\n\n => Array\n(\n => 106.51.234.172\n)\n\n => Array\n(\n => 103.101.88.166\n)\n\n => Array\n(\n => 27.6.246.146\n)\n\n => Array\n(\n => 103.255.5.83\n)\n\n => Array\n(\n => 103.98.210.185\n)\n\n => Array\n(\n => 122.173.114.134\n)\n\n => Array\n(\n => 122.173.77.248\n)\n\n => Array\n(\n => 5.62.41.172\n)\n\n => Array\n(\n => 180.178.181.17\n)\n\n => Array\n(\n => 37.120.133.224\n)\n\n => Array\n(\n => 45.131.5.156\n)\n\n => Array\n(\n => 110.39.100.110\n)\n\n => Array\n(\n => 176.110.38.185\n)\n\n => Array\n(\n => 36.255.41.64\n)\n\n => Array\n(\n => 103.104.192.15\n)\n\n => Array\n(\n => 43.245.131.195\n)\n\n => Array\n(\n => 14.248.111.185\n)\n\n => Array\n(\n => 122.173.217.133\n)\n\n => Array\n(\n => 106.223.90.245\n)\n\n => Array\n(\n => 119.153.56.80\n)\n\n => Array\n(\n => 103.7.60.172\n)\n\n => Array\n(\n => 157.46.184.233\n)\n\n => Array\n(\n => 182.190.31.95\n)\n\n => Array\n(\n => 109.87.189.122\n)\n\n => Array\n(\n => 91.74.25.100\n)\n\n => Array\n(\n => 182.185.224.144\n)\n\n => Array\n(\n => 106.223.91.221\n)\n\n => Array\n(\n => 182.190.223.40\n)\n\n => Array\n(\n => 2.58.194.134\n)\n\n => Array\n(\n => 196.246.225.236\n)\n\n => Array\n(\n => 106.223.90.173\n)\n\n => Array\n(\n => 23.239.16.54\n)\n\n => Array\n(\n => 157.46.65.225\n)\n\n => Array\n(\n => 115.186.130.14\n)\n\n => Array\n(\n => 103.85.125.157\n)\n\n => Array\n(\n => 14.248.103.6\n)\n\n => Array\n(\n => 123.24.169.247\n)\n\n => Array\n(\n => 103.130.108.153\n)\n\n => Array\n(\n => 115.42.67.21\n)\n\n => Array\n(\n => 202.166.171.190\n)\n\n => Array\n(\n => 39.37.169.104\n)\n\n => Array\n(\n => 103.82.80.59\n)\n\n => Array\n(\n => 175.107.208.58\n)\n\n => Array\n(\n => 203.192.238.247\n)\n\n => Array\n(\n => 103.217.178.150\n)\n\n => Array\n(\n => 103.66.214.173\n)\n\n => Array\n(\n => 110.93.236.174\n)\n\n => Array\n(\n => 143.189.242.64\n)\n\n => Array\n(\n => 77.111.245.12\n)\n\n => Array\n(\n => 145.239.2.231\n)\n\n => Array\n(\n => 115.186.190.38\n)\n\n => Array\n(\n => 109.169.23.67\n)\n\n => Array\n(\n => 198.16.70.29\n)\n\n => Array\n(\n => 111.92.76.186\n)\n\n => Array\n(\n => 115.42.69.34\n)\n\n => Array\n(\n => 73.61.100.95\n)\n\n => Array\n(\n => 103.129.142.31\n)\n\n => Array\n(\n => 103.255.5.53\n)\n\n => Array\n(\n => 103.76.55.2\n)\n\n => Array\n(\n => 47.9.141.138\n)\n\n => Array\n(\n => 103.55.89.234\n)\n\n => Array\n(\n => 103.223.13.53\n)\n\n => Array\n(\n => 175.158.50.203\n)\n\n => Array\n(\n => 103.255.5.90\n)\n\n => Array\n(\n => 106.223.100.138\n)\n\n => Array\n(\n => 39.37.143.193\n)\n\n => Array\n(\n => 206.189.133.131\n)\n\n => Array\n(\n => 43.224.0.233\n)\n\n => Array\n(\n => 115.186.132.106\n)\n\n => Array\n(\n => 31.43.21.159\n)\n\n => Array\n(\n => 119.155.56.131\n)\n\n => Array\n(\n => 103.82.80.138\n)\n\n => Array\n(\n => 24.87.128.119\n)\n\n => Array\n(\n => 106.210.103.163\n)\n\n => Array\n(\n => 103.82.80.90\n)\n\n => Array\n(\n => 157.46.186.45\n)\n\n => Array\n(\n => 157.44.155.238\n)\n\n => Array\n(\n => 103.119.199.2\n)\n\n => Array\n(\n => 27.97.169.205\n)\n\n => Array\n(\n => 157.46.174.89\n)\n\n => Array\n(\n => 43.250.58.220\n)\n\n => Array\n(\n => 76.189.186.64\n)\n\n => Array\n(\n => 103.255.5.57\n)\n\n => Array\n(\n => 171.61.196.136\n)\n\n => Array\n(\n => 202.47.40.88\n)\n\n => Array\n(\n => 97.118.94.116\n)\n\n => Array\n(\n => 157.44.124.157\n)\n\n => Array\n(\n => 95.142.120.13\n)\n\n => Array\n(\n => 42.201.229.151\n)\n\n => Array\n(\n => 157.46.178.95\n)\n\n => Array\n(\n => 169.149.215.192\n)\n\n => Array\n(\n => 42.111.19.48\n)\n\n => Array\n(\n => 1.38.52.18\n)\n\n => Array\n(\n => 145.239.91.241\n)\n\n => Array\n(\n => 47.31.78.191\n)\n\n => Array\n(\n => 103.77.42.60\n)\n\n => Array\n(\n => 157.46.107.144\n)\n\n => Array\n(\n => 157.46.125.124\n)\n\n => Array\n(\n => 110.225.218.108\n)\n\n => Array\n(\n => 106.51.77.185\n)\n\n => Array\n(\n => 123.24.161.207\n)\n\n => Array\n(\n => 106.210.108.22\n)\n\n => Array\n(\n => 42.111.10.14\n)\n\n => Array\n(\n => 223.29.231.175\n)\n\n => Array\n(\n => 27.56.152.132\n)\n\n => Array\n(\n => 119.155.31.100\n)\n\n => Array\n(\n => 122.173.172.127\n)\n\n => Array\n(\n => 103.77.42.64\n)\n\n => Array\n(\n => 157.44.164.106\n)\n\n => Array\n(\n => 14.181.53.38\n)\n\n => Array\n(\n => 115.42.67.64\n)\n\n => Array\n(\n => 47.31.33.140\n)\n\n => Array\n(\n => 103.15.60.234\n)\n\n => Array\n(\n => 182.64.219.181\n)\n\n => Array\n(\n => 103.44.51.6\n)\n\n => Array\n(\n => 116.74.25.157\n)\n\n => Array\n(\n => 116.71.2.128\n)\n\n => Array\n(\n => 157.32.185.239\n)\n\n => Array\n(\n => 47.31.25.79\n)\n\n => Array\n(\n => 178.62.85.75\n)\n\n => Array\n(\n => 180.178.190.39\n)\n\n => Array\n(\n => 39.48.52.179\n)\n\n => Array\n(\n => 106.193.11.240\n)\n\n => Array\n(\n => 103.82.80.226\n)\n\n => Array\n(\n => 49.206.126.30\n)\n\n => Array\n(\n => 157.245.191.173\n)\n\n => Array\n(\n => 49.205.84.237\n)\n\n => Array\n(\n => 47.8.181.232\n)\n\n => Array\n(\n => 182.66.2.92\n)\n\n => Array\n(\n => 49.34.137.220\n)\n\n => Array\n(\n => 209.205.217.125\n)\n\n => Array\n(\n => 192.64.5.73\n)\n\n => Array\n(\n => 27.63.166.108\n)\n\n => Array\n(\n => 120.29.96.211\n)\n\n => Array\n(\n => 182.186.112.135\n)\n\n => Array\n(\n => 45.118.165.151\n)\n\n => Array\n(\n => 47.8.228.12\n)\n\n => Array\n(\n => 106.215.3.162\n)\n\n => Array\n(\n => 111.92.72.66\n)\n\n => Array\n(\n => 169.145.2.9\n)\n\n => Array\n(\n => 106.207.205.100\n)\n\n => Array\n(\n => 223.181.8.12\n)\n\n => Array\n(\n => 157.48.149.78\n)\n\n => Array\n(\n => 103.206.138.116\n)\n\n => Array\n(\n => 39.53.119.22\n)\n\n => Array\n(\n => 157.33.232.106\n)\n\n => Array\n(\n => 49.37.205.139\n)\n\n => Array\n(\n => 115.42.68.3\n)\n\n => Array\n(\n => 93.72.182.251\n)\n\n => Array\n(\n => 202.142.166.22\n)\n\n => Array\n(\n => 157.119.81.111\n)\n\n => Array\n(\n => 182.186.116.155\n)\n\n => Array\n(\n => 157.37.171.37\n)\n\n => Array\n(\n => 117.206.164.48\n)\n\n => Array\n(\n => 49.36.52.63\n)\n\n => Array\n(\n => 203.175.72.112\n)\n\n => Array\n(\n => 171.61.132.193\n)\n\n => Array\n(\n => 111.119.187.44\n)\n\n => Array\n(\n => 39.37.165.216\n)\n\n => Array\n(\n => 103.86.109.58\n)\n\n => Array\n(\n => 39.59.2.86\n)\n\n => Array\n(\n => 111.119.187.28\n)\n\n => Array\n(\n => 106.201.9.10\n)\n\n => Array\n(\n => 49.35.25.106\n)\n\n => Array\n(\n => 157.49.239.103\n)\n\n => Array\n(\n => 157.49.237.198\n)\n\n => Array\n(\n => 14.248.64.121\n)\n\n => Array\n(\n => 117.102.7.214\n)\n\n => Array\n(\n => 120.29.91.246\n)\n\n => Array\n(\n => 103.7.79.41\n)\n\n => Array\n(\n => 132.154.99.209\n)\n\n => Array\n(\n => 212.36.27.245\n)\n\n => Array\n(\n => 157.44.154.9\n)\n\n => Array\n(\n => 47.31.56.44\n)\n\n => Array\n(\n => 192.142.199.136\n)\n\n => Array\n(\n => 171.61.159.49\n)\n\n => Array\n(\n => 119.160.116.151\n)\n\n => Array\n(\n => 103.98.63.39\n)\n\n => Array\n(\n => 41.60.233.216\n)\n\n => Array\n(\n => 49.36.75.212\n)\n\n => Array\n(\n => 223.188.60.20\n)\n\n => Array\n(\n => 103.98.63.50\n)\n\n => Array\n(\n => 178.162.198.21\n)\n\n => Array\n(\n => 157.46.209.35\n)\n\n => Array\n(\n => 119.155.32.151\n)\n\n => Array\n(\n => 102.185.58.161\n)\n\n => Array\n(\n => 59.96.89.231\n)\n\n => Array\n(\n => 119.155.255.198\n)\n\n => Array\n(\n => 42.107.204.57\n)\n\n => Array\n(\n => 42.106.181.74\n)\n\n => Array\n(\n => 157.46.219.186\n)\n\n => Array\n(\n => 115.42.71.49\n)\n\n => Array\n(\n => 157.46.209.131\n)\n\n => Array\n(\n => 220.81.15.94\n)\n\n => Array\n(\n => 111.119.187.24\n)\n\n => Array\n(\n => 49.37.195.185\n)\n\n => Array\n(\n => 42.106.181.85\n)\n\n => Array\n(\n => 43.249.225.134\n)\n\n => Array\n(\n => 117.206.165.151\n)\n\n => Array\n(\n => 119.153.48.250\n)\n\n => Array\n(\n => 27.4.172.162\n)\n\n => Array\n(\n => 117.20.29.51\n)\n\n => Array\n(\n => 103.98.63.135\n)\n\n => Array\n(\n => 117.7.218.229\n)\n\n => Array\n(\n => 157.49.233.105\n)\n\n => Array\n(\n => 39.53.151.199\n)\n\n => Array\n(\n => 101.255.118.33\n)\n\n => Array\n(\n => 41.141.246.9\n)\n\n => Array\n(\n => 221.132.113.78\n)\n\n => Array\n(\n => 119.160.116.202\n)\n\n => Array\n(\n => 117.237.193.244\n)\n\n => Array\n(\n => 157.41.110.145\n)\n\n => Array\n(\n => 103.98.63.5\n)\n\n => Array\n(\n => 103.125.129.58\n)\n\n => Array\n(\n => 183.83.254.66\n)\n\n => Array\n(\n => 45.135.236.160\n)\n\n => Array\n(\n => 198.199.87.124\n)\n\n => Array\n(\n => 193.176.86.41\n)\n\n => Array\n(\n => 115.97.142.98\n)\n\n => Array\n(\n => 222.252.38.198\n)\n\n => Array\n(\n => 110.93.237.49\n)\n\n => Array\n(\n => 103.224.48.122\n)\n\n => Array\n(\n => 110.38.28.130\n)\n\n => Array\n(\n => 106.211.238.154\n)\n\n => Array\n(\n => 111.88.41.73\n)\n\n => Array\n(\n => 119.155.13.143\n)\n\n => Array\n(\n => 103.213.111.60\n)\n\n => Array\n(\n => 202.0.103.42\n)\n\n => Array\n(\n => 157.48.144.33\n)\n\n => Array\n(\n => 111.119.187.62\n)\n\n => Array\n(\n => 103.87.212.71\n)\n\n => Array\n(\n => 157.37.177.20\n)\n\n => Array\n(\n => 223.233.71.92\n)\n\n => Array\n(\n => 116.213.32.107\n)\n\n => Array\n(\n => 104.248.173.151\n)\n\n => Array\n(\n => 14.181.102.222\n)\n\n => Array\n(\n => 103.10.224.252\n)\n\n => Array\n(\n => 175.158.50.57\n)\n\n => Array\n(\n => 165.22.122.199\n)\n\n => Array\n(\n => 23.106.56.12\n)\n\n => Array\n(\n => 203.122.10.146\n)\n\n => Array\n(\n => 37.111.136.138\n)\n\n => Array\n(\n => 103.87.193.66\n)\n\n => Array\n(\n => 39.59.122.246\n)\n\n => Array\n(\n => 111.119.183.63\n)\n\n => Array\n(\n => 157.46.72.102\n)\n\n => Array\n(\n => 185.132.133.82\n)\n\n => Array\n(\n => 118.103.230.148\n)\n\n => Array\n(\n => 5.62.39.45\n)\n\n => Array\n(\n => 119.152.144.134\n)\n\n => Array\n(\n => 172.105.117.102\n)\n\n => Array\n(\n => 122.254.70.212\n)\n\n => Array\n(\n => 102.185.128.97\n)\n\n => Array\n(\n => 182.69.249.11\n)\n\n => Array\n(\n => 105.163.134.167\n)\n\n => Array\n(\n => 111.119.187.38\n)\n\n => Array\n(\n => 103.46.195.93\n)\n\n => Array\n(\n => 106.204.161.156\n)\n\n => Array\n(\n => 122.176.2.175\n)\n\n => Array\n(\n => 117.99.162.31\n)\n\n => Array\n(\n => 106.212.241.242\n)\n\n => Array\n(\n => 42.107.196.149\n)\n\n => Array\n(\n => 212.90.60.57\n)\n\n => Array\n(\n => 175.107.237.12\n)\n\n => Array\n(\n => 157.46.119.152\n)\n\n => Array\n(\n => 157.34.81.12\n)\n\n => Array\n(\n => 162.243.1.22\n)\n\n => Array\n(\n => 110.37.222.178\n)\n\n => Array\n(\n => 103.46.195.68\n)\n\n => Array\n(\n => 119.160.116.81\n)\n\n => Array\n(\n => 138.197.131.28\n)\n\n => Array\n(\n => 103.88.218.124\n)\n\n => Array\n(\n => 192.241.172.113\n)\n\n => Array\n(\n => 110.39.174.106\n)\n\n => Array\n(\n => 111.88.48.17\n)\n\n => Array\n(\n => 42.108.160.218\n)\n\n => Array\n(\n => 117.102.0.16\n)\n\n => Array\n(\n => 157.46.125.235\n)\n\n => Array\n(\n => 14.190.242.251\n)\n\n => Array\n(\n => 47.31.184.64\n)\n\n => Array\n(\n => 49.205.84.157\n)\n\n => Array\n(\n => 122.162.115.247\n)\n\n => Array\n(\n => 41.202.219.74\n)\n\n => Array\n(\n => 106.215.9.67\n)\n\n => Array\n(\n => 103.87.56.208\n)\n\n => Array\n(\n => 103.46.194.147\n)\n\n => Array\n(\n => 116.90.98.81\n)\n\n => Array\n(\n => 115.42.71.213\n)\n\n => Array\n(\n => 39.49.35.192\n)\n\n => Array\n(\n => 41.202.219.65\n)\n\n => Array\n(\n => 131.212.249.93\n)\n\n => Array\n(\n => 49.205.16.251\n)\n\n => Array\n(\n => 39.34.147.250\n)\n\n => Array\n(\n => 183.83.210.185\n)\n\n => Array\n(\n => 49.37.194.215\n)\n\n => Array\n(\n => 103.46.194.108\n)\n\n => Array\n(\n => 89.36.219.233\n)\n\n => Array\n(\n => 119.152.105.178\n)\n\n => Array\n(\n => 202.47.45.125\n)\n\n => Array\n(\n => 156.146.59.27\n)\n\n => Array\n(\n => 132.154.21.156\n)\n\n => Array\n(\n => 157.44.35.31\n)\n\n => Array\n(\n => 41.80.118.124\n)\n\n => Array\n(\n => 47.31.159.198\n)\n\n => Array\n(\n => 103.209.223.140\n)\n\n => Array\n(\n => 157.46.130.138\n)\n\n => Array\n(\n => 49.37.199.246\n)\n\n => Array\n(\n => 111.88.242.10\n)\n\n => Array\n(\n => 43.241.145.110\n)\n\n => Array\n(\n => 124.153.16.30\n)\n\n => Array\n(\n => 27.5.22.173\n)\n\n => Array\n(\n => 111.88.191.173\n)\n\n => Array\n(\n => 41.60.236.200\n)\n\n => Array\n(\n => 115.42.67.146\n)\n\n => Array\n(\n => 150.242.173.7\n)\n\n => Array\n(\n => 14.248.71.23\n)\n\n => Array\n(\n => 111.119.187.4\n)\n\n => Array\n(\n => 124.29.212.118\n)\n\n => Array\n(\n => 51.68.205.163\n)\n\n => Array\n(\n => 182.184.107.63\n)\n\n => Array\n(\n => 106.211.253.87\n)\n\n => Array\n(\n => 223.190.89.5\n)\n\n => Array\n(\n => 183.83.212.63\n)\n\n => Array\n(\n => 129.205.113.227\n)\n\n => Array\n(\n => 106.210.40.141\n)\n\n => Array\n(\n => 91.202.163.169\n)\n\n => Array\n(\n => 76.105.191.89\n)\n\n => Array\n(\n => 171.51.244.160\n)\n\n => Array\n(\n => 37.139.188.92\n)\n\n => Array\n(\n => 23.106.56.37\n)\n\n => Array\n(\n => 157.44.175.180\n)\n\n => Array\n(\n => 122.2.122.97\n)\n\n => Array\n(\n => 103.87.192.194\n)\n\n => Array\n(\n => 192.154.253.6\n)\n\n => Array\n(\n => 77.243.191.19\n)\n\n => Array\n(\n => 122.254.70.46\n)\n\n => Array\n(\n => 154.76.233.73\n)\n\n => Array\n(\n => 195.181.167.150\n)\n\n => Array\n(\n => 209.209.228.5\n)\n\n => Array\n(\n => 203.192.212.115\n)\n\n => Array\n(\n => 221.132.118.179\n)\n\n => Array\n(\n => 117.208.210.204\n)\n\n => Array\n(\n => 120.29.90.126\n)\n\n => Array\n(\n => 36.77.239.190\n)\n\n => Array\n(\n => 157.37.137.127\n)\n\n => Array\n(\n => 39.40.243.6\n)\n\n => Array\n(\n => 182.182.41.201\n)\n\n => Array\n(\n => 39.59.32.46\n)\n\n => Array\n(\n => 111.119.183.36\n)\n\n => Array\n(\n => 103.83.147.61\n)\n\n => Array\n(\n => 103.82.80.85\n)\n\n => Array\n(\n => 103.46.194.161\n)\n\n => Array\n(\n => 101.50.105.38\n)\n\n => Array\n(\n => 111.119.183.58\n)\n\n => Array\n(\n => 47.9.234.51\n)\n\n => Array\n(\n => 120.29.86.157\n)\n\n => Array\n(\n => 175.158.50.70\n)\n\n => Array\n(\n => 112.196.163.235\n)\n\n => Array\n(\n => 139.167.161.85\n)\n\n => Array\n(\n => 106.207.39.181\n)\n\n => Array\n(\n => 103.77.42.159\n)\n\n => Array\n(\n => 185.56.138.220\n)\n\n => Array\n(\n => 119.155.33.205\n)\n\n => Array\n(\n => 157.42.117.124\n)\n\n => Array\n(\n => 103.117.202.202\n)\n\n => Array\n(\n => 220.253.101.109\n)\n\n => Array\n(\n => 49.37.7.247\n)\n\n => Array\n(\n => 119.160.65.27\n)\n\n => Array\n(\n => 114.122.21.151\n)\n\n => Array\n(\n => 157.44.141.83\n)\n\n => Array\n(\n => 103.131.9.7\n)\n\n => Array\n(\n => 125.99.222.21\n)\n\n => Array\n(\n => 103.238.104.206\n)\n\n => Array\n(\n => 110.93.227.100\n)\n\n => Array\n(\n => 49.14.119.114\n)\n\n => Array\n(\n => 115.186.189.82\n)\n\n => Array\n(\n => 106.201.194.2\n)\n\n => Array\n(\n => 106.204.227.28\n)\n\n => Array\n(\n => 47.31.206.13\n)\n\n => Array\n(\n => 39.42.144.109\n)\n\n => Array\n(\n => 14.253.254.90\n)\n\n => Array\n(\n => 157.44.142.118\n)\n\n => Array\n(\n => 192.142.176.21\n)\n\n => Array\n(\n => 103.217.178.225\n)\n\n => Array\n(\n => 106.78.78.16\n)\n\n => Array\n(\n => 167.71.63.184\n)\n\n => Array\n(\n => 207.244.71.82\n)\n\n => Array\n(\n => 71.105.25.145\n)\n\n => Array\n(\n => 39.51.250.30\n)\n\n => Array\n(\n => 157.41.120.160\n)\n\n => Array\n(\n => 39.37.137.81\n)\n\n => Array\n(\n => 41.80.237.27\n)\n\n => Array\n(\n => 111.119.187.50\n)\n\n => Array\n(\n => 49.145.224.252\n)\n\n => Array\n(\n => 106.197.28.106\n)\n\n => Array\n(\n => 103.217.178.240\n)\n\n => Array\n(\n => 27.97.182.237\n)\n\n => Array\n(\n => 106.211.253.72\n)\n\n => Array\n(\n => 119.152.154.172\n)\n\n => Array\n(\n => 103.255.151.148\n)\n\n => Array\n(\n => 154.157.80.12\n)\n\n => Array\n(\n => 156.146.59.28\n)\n\n => Array\n(\n => 171.61.211.64\n)\n\n => Array\n(\n => 27.76.59.22\n)\n\n => Array\n(\n => 167.99.92.124\n)\n\n => Array\n(\n => 132.154.94.51\n)\n\n => Array\n(\n => 111.119.183.38\n)\n\n => Array\n(\n => 115.42.70.169\n)\n\n => Array\n(\n => 109.169.23.83\n)\n\n => Array\n(\n => 157.46.213.64\n)\n\n => Array\n(\n => 39.37.179.171\n)\n\n => Array\n(\n => 14.232.233.32\n)\n\n => Array\n(\n => 157.49.226.13\n)\n\n => Array\n(\n => 185.209.178.78\n)\n\n => Array\n(\n => 222.252.46.230\n)\n\n => Array\n(\n => 139.5.255.168\n)\n\n => Array\n(\n => 202.8.118.12\n)\n\n => Array\n(\n => 39.53.205.63\n)\n\n => Array\n(\n => 157.37.167.227\n)\n\n => Array\n(\n => 157.49.237.121\n)\n\n => Array\n(\n => 208.89.99.6\n)\n\n => Array\n(\n => 111.119.187.33\n)\n\n => Array\n(\n => 39.37.132.101\n)\n\n => Array\n(\n => 72.255.61.15\n)\n\n => Array\n(\n => 157.41.69.126\n)\n\n => Array\n(\n => 27.6.193.15\n)\n\n => Array\n(\n => 157.41.104.8\n)\n\n => Array\n(\n => 157.41.97.162\n)\n\n => Array\n(\n => 95.136.91.67\n)\n\n => Array\n(\n => 110.93.209.138\n)\n\n => Array\n(\n => 119.152.154.82\n)\n\n => Array\n(\n => 111.88.239.223\n)\n\n => Array\n(\n => 157.230.62.100\n)\n\n => Array\n(\n => 37.111.136.167\n)\n\n => Array\n(\n => 139.167.162.65\n)\n\n => Array\n(\n => 120.29.72.72\n)\n\n => Array\n(\n => 39.42.169.69\n)\n\n => Array\n(\n => 157.49.247.12\n)\n\n => Array\n(\n => 43.231.58.221\n)\n\n => Array\n(\n => 111.88.229.18\n)\n\n => Array\n(\n => 171.79.185.198\n)\n\n => Array\n(\n => 169.149.193.102\n)\n\n => Array\n(\n => 207.244.89.162\n)\n\n => Array\n(\n => 27.4.217.129\n)\n\n => Array\n(\n => 91.236.184.12\n)\n\n => Array\n(\n => 14.192.154.150\n)\n\n => Array\n(\n => 167.172.55.253\n)\n\n => Array\n(\n => 103.77.42.192\n)\n\n => Array\n(\n => 39.59.122.140\n)\n\n => Array\n(\n => 41.80.84.46\n)\n\n => Array\n(\n => 202.47.52.115\n)\n\n => Array\n(\n => 222.252.43.47\n)\n\n => Array\n(\n => 119.155.37.250\n)\n\n => Array\n(\n => 157.41.18.88\n)\n\n => Array\n(\n => 39.42.8.59\n)\n\n => Array\n(\n => 39.45.162.110\n)\n\n => Array\n(\n => 111.88.237.25\n)\n\n => Array\n(\n => 103.76.211.168\n)\n\n => Array\n(\n => 178.137.114.165\n)\n\n => Array\n(\n => 43.225.74.146\n)\n\n => Array\n(\n => 157.42.25.26\n)\n\n => Array\n(\n => 137.59.146.63\n)\n\n => Array\n(\n => 119.160.117.190\n)\n\n => Array\n(\n => 1.186.181.133\n)\n\n => Array\n(\n => 39.42.145.94\n)\n\n => Array\n(\n => 203.175.73.96\n)\n\n => Array\n(\n => 39.37.160.14\n)\n\n => Array\n(\n => 157.39.123.250\n)\n\n => Array\n(\n => 95.135.57.82\n)\n\n => Array\n(\n => 162.210.194.35\n)\n\n => Array\n(\n => 39.42.153.135\n)\n\n => Array\n(\n => 118.103.230.106\n)\n\n => Array\n(\n => 108.61.39.115\n)\n\n => Array\n(\n => 102.7.108.45\n)\n\n => Array\n(\n => 183.83.138.134\n)\n\n => Array\n(\n => 115.186.70.223\n)\n\n => Array\n(\n => 157.34.17.139\n)\n\n => Array\n(\n => 122.166.158.231\n)\n\n => Array\n(\n => 43.227.135.90\n)\n\n => Array\n(\n => 182.68.46.180\n)\n\n => Array\n(\n => 223.225.28.138\n)\n\n => Array\n(\n => 103.77.42.220\n)\n\n => Array\n(\n => 192.241.219.13\n)\n\n => Array\n(\n => 103.82.80.113\n)\n\n => Array\n(\n => 42.111.243.151\n)\n\n => Array\n(\n => 171.79.189.247\n)\n\n => Array\n(\n => 157.32.132.102\n)\n\n => Array\n(\n => 103.130.105.243\n)\n\n => Array\n(\n => 117.223.98.120\n)\n\n => Array\n(\n => 106.215.197.187\n)\n\n => Array\n(\n => 182.190.194.179\n)\n\n => Array\n(\n => 223.225.29.42\n)\n\n => Array\n(\n => 117.222.94.151\n)\n\n => Array\n(\n => 182.185.199.104\n)\n\n => Array\n(\n => 49.36.145.77\n)\n\n => Array\n(\n => 103.82.80.73\n)\n\n => Array\n(\n => 103.77.16.13\n)\n\n => Array\n(\n => 221.132.118.86\n)\n\n => Array\n(\n => 202.47.45.77\n)\n\n => Array\n(\n => 202.8.118.116\n)\n\n => Array\n(\n => 42.106.180.185\n)\n\n => Array\n(\n => 203.122.8.234\n)\n\n => Array\n(\n => 88.230.104.245\n)\n\n => Array\n(\n => 103.131.9.33\n)\n\n => Array\n(\n => 117.207.209.60\n)\n\n => Array\n(\n => 42.111.253.227\n)\n\n => Array\n(\n => 23.106.56.54\n)\n\n => Array\n(\n => 122.178.143.181\n)\n\n => Array\n(\n => 111.88.180.5\n)\n\n => Array\n(\n => 174.55.224.161\n)\n\n => Array\n(\n => 49.205.87.100\n)\n\n => Array\n(\n => 49.34.183.118\n)\n\n => Array\n(\n => 124.155.255.154\n)\n\n => Array\n(\n => 106.212.135.200\n)\n\n => Array\n(\n => 139.99.159.11\n)\n\n => Array\n(\n => 45.135.229.8\n)\n\n => Array\n(\n => 88.230.106.85\n)\n\n => Array\n(\n => 91.153.145.221\n)\n\n => Array\n(\n => 103.95.83.33\n)\n\n => Array\n(\n => 122.178.116.76\n)\n\n => Array\n(\n => 103.135.78.14\n)\n\n => Array\n(\n => 111.88.233.206\n)\n\n => Array\n(\n => 192.140.153.210\n)\n\n => Array\n(\n => 202.8.118.69\n)\n\n => Array\n(\n => 103.83.130.81\n)\n\n => Array\n(\n => 182.190.213.143\n)\n\n => Array\n(\n => 198.16.74.204\n)\n\n => Array\n(\n => 101.128.117.248\n)\n\n => Array\n(\n => 103.108.5.147\n)\n\n => Array\n(\n => 157.32.130.158\n)\n\n => Array\n(\n => 103.244.172.93\n)\n\n => Array\n(\n => 47.30.140.126\n)\n\n => Array\n(\n => 223.188.40.124\n)\n\n => Array\n(\n => 157.44.191.102\n)\n\n => Array\n(\n => 41.60.237.62\n)\n\n => Array\n(\n => 47.31.228.161\n)\n\n => Array\n(\n => 137.59.217.188\n)\n\n => Array\n(\n => 39.53.220.237\n)\n\n => Array\n(\n => 45.127.45.199\n)\n\n => Array\n(\n => 14.190.71.19\n)\n\n => Array\n(\n => 47.18.205.54\n)\n\n => Array\n(\n => 110.93.240.11\n)\n\n => Array\n(\n => 134.209.29.111\n)\n\n => Array\n(\n => 49.36.175.104\n)\n\n => Array\n(\n => 203.192.230.61\n)\n\n => Array\n(\n => 176.10.125.115\n)\n\n => Array\n(\n => 182.18.206.17\n)\n\n => Array\n(\n => 103.87.194.102\n)\n\n => Array\n(\n => 171.79.123.106\n)\n\n => Array\n(\n => 45.116.233.35\n)\n\n => Array\n(\n => 223.190.57.225\n)\n\n => Array\n(\n => 114.125.6.158\n)\n\n => Array\n(\n => 223.179.138.176\n)\n\n => Array\n(\n => 111.119.183.61\n)\n\n => Array\n(\n => 202.8.118.43\n)\n\n => Array\n(\n => 157.51.175.216\n)\n\n => Array\n(\n => 41.60.238.100\n)\n\n => Array\n(\n => 117.207.210.199\n)\n\n => Array\n(\n => 111.119.183.26\n)\n\n => Array\n(\n => 103.252.226.12\n)\n\n => Array\n(\n => 103.221.208.82\n)\n\n => Array\n(\n => 103.82.80.228\n)\n\n => Array\n(\n => 111.119.187.39\n)\n\n => Array\n(\n => 157.51.161.199\n)\n\n => Array\n(\n => 59.96.88.246\n)\n\n => Array\n(\n => 27.4.181.183\n)\n\n => Array\n(\n => 43.225.98.124\n)\n\n => Array\n(\n => 157.51.113.74\n)\n\n => Array\n(\n => 207.244.89.161\n)\n\n => Array\n(\n => 49.37.184.82\n)\n\n => Array\n(\n => 111.119.183.4\n)\n\n => Array\n(\n => 39.42.130.147\n)\n\n => Array\n(\n => 103.152.101.2\n)\n\n => Array\n(\n => 111.119.183.2\n)\n\n => Array\n(\n => 157.51.171.149\n)\n\n => Array\n(\n => 103.82.80.245\n)\n\n => Array\n(\n => 175.107.207.133\n)\n\n => Array\n(\n => 103.204.169.158\n)\n\n => Array\n(\n => 157.51.181.12\n)\n\n => Array\n(\n => 195.158.193.212\n)\n\n => Array\n(\n => 204.14.73.85\n)\n\n => Array\n(\n => 39.59.59.31\n)\n\n => Array\n(\n => 45.148.11.82\n)\n\n => Array\n(\n => 157.46.117.250\n)\n\n => Array\n(\n => 157.46.127.170\n)\n\n => Array\n(\n => 77.247.181.165\n)\n\n => Array\n(\n => 111.119.183.54\n)\n\n => Array\n(\n => 41.60.232.183\n)\n\n => Array\n(\n => 157.42.206.174\n)\n\n => Array\n(\n => 196.53.10.246\n)\n\n => Array\n(\n => 27.97.186.131\n)\n\n => Array\n(\n => 103.73.101.134\n)\n\n => Array\n(\n => 111.119.183.35\n)\n\n => Array\n(\n => 202.8.118.111\n)\n\n => Array\n(\n => 103.75.246.207\n)\n\n => Array\n(\n => 47.8.94.225\n)\n\n => Array\n(\n => 106.202.40.83\n)\n\n => Array\n(\n => 117.102.2.0\n)\n\n => Array\n(\n => 156.146.59.11\n)\n\n => Array\n(\n => 223.190.115.125\n)\n\n => Array\n(\n => 169.149.212.232\n)\n\n => Array\n(\n => 39.45.150.127\n)\n\n => Array\n(\n => 45.63.10.204\n)\n\n => Array\n(\n => 27.57.86.46\n)\n\n => Array\n(\n => 103.127.20.138\n)\n\n => Array\n(\n => 223.190.27.26\n)\n\n => Array\n(\n => 49.15.248.78\n)\n\n => Array\n(\n => 130.105.135.103\n)\n\n => Array\n(\n => 47.31.3.239\n)\n\n => Array\n(\n => 185.66.71.8\n)\n\n => Array\n(\n => 103.226.226.198\n)\n\n => Array\n(\n => 39.34.134.16\n)\n\n => Array\n(\n => 95.158.53.120\n)\n\n => Array\n(\n => 45.9.249.246\n)\n\n => Array\n(\n => 223.235.162.157\n)\n\n => Array\n(\n => 37.111.139.23\n)\n\n => Array\n(\n => 49.37.153.47\n)\n\n => Array\n(\n => 103.242.60.205\n)\n\n => Array\n(\n => 185.66.68.18\n)\n\n => Array\n(\n => 162.221.202.138\n)\n\n => Array\n(\n => 202.63.195.29\n)\n\n => Array\n(\n => 112.198.75.226\n)\n\n => Array\n(\n => 46.200.69.233\n)\n\n => Array\n(\n => 103.135.78.30\n)\n\n => Array\n(\n => 119.152.226.9\n)\n\n => Array\n(\n => 167.172.242.50\n)\n\n => Array\n(\n => 49.36.151.31\n)\n\n => Array\n(\n => 111.88.237.156\n)\n\n => Array\n(\n => 103.215.168.1\n)\n\n => Array\n(\n => 107.181.177.137\n)\n\n => Array\n(\n => 157.119.186.202\n)\n\n => Array\n(\n => 37.111.139.106\n)\n\n => Array\n(\n => 182.180.152.198\n)\n\n => Array\n(\n => 43.248.153.72\n)\n\n => Array\n(\n => 64.188.20.84\n)\n\n => Array\n(\n => 103.92.214.11\n)\n\n => Array\n(\n => 182.182.14.148\n)\n\n => Array\n(\n => 116.75.154.119\n)\n\n => Array\n(\n => 37.228.235.94\n)\n\n => Array\n(\n => 197.210.55.43\n)\n\n => Array\n(\n => 45.118.165.153\n)\n\n => Array\n(\n => 122.176.32.27\n)\n\n => Array\n(\n => 106.215.161.20\n)\n\n => Array\n(\n => 152.32.113.58\n)\n\n => Array\n(\n => 111.125.106.132\n)\n\n => Array\n(\n => 212.102.40.72\n)\n\n => Array\n(\n => 2.58.194.140\n)\n\n => Array\n(\n => 122.174.68.115\n)\n\n => Array\n(\n => 117.241.66.56\n)\n\n => Array\n(\n => 71.94.172.140\n)\n\n => Array\n(\n => 103.209.228.139\n)\n\n => Array\n(\n => 43.242.177.140\n)\n\n => Array\n(\n => 38.91.101.66\n)\n\n => Array\n(\n => 103.82.80.67\n)\n\n => Array\n(\n => 117.248.62.138\n)\n\n => Array\n(\n => 103.81.215.51\n)\n\n => Array\n(\n => 103.253.174.4\n)\n\n => Array\n(\n => 202.142.110.111\n)\n\n => Array\n(\n => 162.216.142.1\n)\n\n => Array\n(\n => 58.186.7.252\n)\n\n => Array\n(\n => 113.203.247.66\n)\n\n => Array\n(\n => 111.88.50.63\n)\n\n => Array\n(\n => 182.182.94.227\n)\n\n => Array\n(\n => 49.15.232.50\n)\n\n => Array\n(\n => 182.189.76.225\n)\n\n => Array\n(\n => 139.99.159.14\n)\n\n => Array\n(\n => 163.172.159.235\n)\n\n => Array\n(\n => 157.36.235.241\n)\n\n => Array\n(\n => 111.119.187.3\n)\n\n => Array\n(\n => 103.100.4.61\n)\n\n => Array\n(\n => 192.142.130.88\n)\n\n => Array\n(\n => 43.242.176.114\n)\n\n => Array\n(\n => 180.178.156.165\n)\n\n => Array\n(\n => 182.189.236.77\n)\n\n => Array\n(\n => 49.34.197.239\n)\n\n => Array\n(\n => 157.36.107.107\n)\n\n => Array\n(\n => 103.209.85.175\n)\n\n => Array\n(\n => 203.139.63.83\n)\n\n => Array\n(\n => 43.242.177.161\n)\n\n => Array\n(\n => 182.182.77.138\n)\n\n => Array\n(\n => 114.124.168.117\n)\n\n => Array\n(\n => 124.253.79.191\n)\n\n => Array\n(\n => 192.142.168.235\n)\n\n => Array\n(\n => 14.232.235.111\n)\n\n => Array\n(\n => 152.57.124.214\n)\n\n => Array\n(\n => 123.24.172.48\n)\n\n => Array\n(\n => 43.242.176.87\n)\n\n => Array\n(\n => 43.242.176.101\n)\n\n => Array\n(\n => 49.156.84.110\n)\n\n => Array\n(\n => 58.65.222.6\n)\n\n => Array\n(\n => 157.32.189.112\n)\n\n => Array\n(\n => 47.31.155.87\n)\n\n => Array\n(\n => 39.53.244.182\n)\n\n => Array\n(\n => 39.33.221.76\n)\n\n => Array\n(\n => 161.35.130.245\n)\n\n => Array\n(\n => 152.32.113.137\n)\n\n => Array\n(\n => 192.142.187.220\n)\n\n => Array\n(\n => 185.54.228.123\n)\n\n => Array\n(\n => 103.233.87.221\n)\n\n => Array\n(\n => 223.236.200.224\n)\n\n => Array\n(\n => 27.97.189.170\n)\n\n => Array\n(\n => 103.82.80.212\n)\n\n => Array\n(\n => 43.242.176.37\n)\n\n => Array\n(\n => 49.36.144.94\n)\n\n => Array\n(\n => 180.251.62.185\n)\n\n => Array\n(\n => 39.50.243.227\n)\n\n => Array\n(\n => 124.253.20.21\n)\n\n => Array\n(\n => 41.60.233.31\n)\n\n => Array\n(\n => 103.81.215.57\n)\n\n => Array\n(\n => 185.91.120.16\n)\n\n => Array\n(\n => 182.190.107.163\n)\n\n => Array\n(\n => 222.252.61.68\n)\n\n => Array\n(\n => 109.169.23.78\n)\n\n => Array\n(\n => 39.50.151.222\n)\n\n => Array\n(\n => 43.242.176.86\n)\n\n => Array\n(\n => 178.162.222.161\n)\n\n => Array\n(\n => 37.111.139.158\n)\n\n => Array\n(\n => 39.57.224.97\n)\n\n => Array\n(\n => 39.57.157.194\n)\n\n => Array\n(\n => 111.119.183.48\n)\n\n => Array\n(\n => 180.190.171.129\n)\n\n => Array\n(\n => 39.52.174.177\n)\n\n => Array\n(\n => 43.242.176.103\n)\n\n => Array\n(\n => 124.253.83.14\n)\n\n => Array\n(\n => 182.189.116.245\n)\n\n => Array\n(\n => 157.36.178.213\n)\n\n => Array\n(\n => 45.250.65.119\n)\n\n => Array\n(\n => 103.209.86.6\n)\n\n => Array\n(\n => 43.242.176.80\n)\n\n => Array\n(\n => 137.59.147.2\n)\n\n => Array\n(\n => 117.222.95.23\n)\n\n => Array\n(\n => 124.253.81.10\n)\n\n => Array\n(\n => 43.242.177.21\n)\n\n => Array\n(\n => 182.189.224.186\n)\n\n => Array\n(\n => 39.52.178.142\n)\n\n => Array\n(\n => 106.214.29.176\n)\n\n => Array\n(\n => 111.88.145.107\n)\n\n => Array\n(\n => 49.36.142.67\n)\n\n => Array\n(\n => 202.142.65.50\n)\n\n => Array\n(\n => 1.22.186.76\n)\n\n => Array\n(\n => 103.131.8.225\n)\n\n => Array\n(\n => 39.53.212.111\n)\n\n => Array\n(\n => 103.82.80.149\n)\n\n => Array\n(\n => 43.242.176.12\n)\n\n => Array\n(\n => 103.109.13.189\n)\n\n => Array\n(\n => 124.253.206.202\n)\n\n => Array\n(\n => 117.195.115.85\n)\n\n => Array\n(\n => 49.36.245.229\n)\n\n => Array\n(\n => 42.118.8.100\n)\n\n => Array\n(\n => 1.22.73.17\n)\n\n => Array\n(\n => 157.36.166.131\n)\n\n => Array\n(\n => 182.182.38.223\n)\n\n => Array\n(\n => 49.14.150.21\n)\n\n => Array\n(\n => 43.242.176.89\n)\n\n => Array\n(\n => 157.46.185.69\n)\n\n => Array\n(\n => 103.31.92.150\n)\n\n => Array\n(\n => 59.96.90.94\n)\n\n => Array\n(\n => 49.156.111.64\n)\n\n => Array\n(\n => 103.75.244.16\n)\n\n => Array\n(\n => 54.37.18.139\n)\n\n => Array\n(\n => 27.255.173.50\n)\n\n => Array\n(\n => 84.202.161.120\n)\n\n => Array\n(\n => 27.3.224.180\n)\n\n => Array\n(\n => 39.44.14.192\n)\n\n => Array\n(\n => 37.120.133.201\n)\n\n => Array\n(\n => 109.251.143.236\n)\n\n => Array\n(\n => 23.80.97.111\n)\n\n => Array\n(\n => 43.242.176.9\n)\n\n => Array\n(\n => 14.248.107.50\n)\n\n => Array\n(\n => 182.189.221.114\n)\n\n => Array\n(\n => 103.253.173.74\n)\n\n => Array\n(\n => 27.97.177.45\n)\n\n => Array\n(\n => 49.14.98.9\n)\n\n => Array\n(\n => 163.53.85.169\n)\n\n => Array\n(\n => 39.59.90.168\n)\n\n => Array\n(\n => 111.88.202.253\n)\n\n => Array\n(\n => 111.119.178.155\n)\n\n => Array\n(\n => 171.76.163.75\n)\n\n => Array\n(\n => 202.5.154.23\n)\n\n => Array\n(\n => 119.160.65.164\n)\n\n => Array\n(\n => 14.253.253.190\n)\n\n => Array\n(\n => 117.206.167.25\n)\n\n => Array\n(\n => 61.2.183.186\n)\n\n => Array\n(\n => 103.100.4.83\n)\n\n => Array\n(\n => 124.253.71.126\n)\n\n => Array\n(\n => 182.189.49.217\n)\n\n => Array\n(\n => 103.196.160.41\n)\n\n => Array\n(\n => 23.106.56.35\n)\n\n => Array\n(\n => 110.38.12.70\n)\n\n => Array\n(\n => 154.157.199.239\n)\n\n => Array\n(\n => 14.231.163.113\n)\n\n => Array\n(\n => 103.69.27.232\n)\n\n => Array\n(\n => 175.107.220.192\n)\n\n => Array\n(\n => 43.231.58.173\n)\n\n => Array\n(\n => 138.128.91.215\n)\n\n => Array\n(\n => 103.233.86.1\n)\n\n => Array\n(\n => 182.187.67.111\n)\n\n => Array\n(\n => 49.156.71.31\n)\n\n => Array\n(\n => 27.255.174.125\n)\n\n => Array\n(\n => 195.24.220.35\n)\n\n => Array\n(\n => 120.29.98.28\n)\n\n => Array\n(\n => 41.202.219.255\n)\n\n => Array\n(\n => 103.88.3.243\n)\n\n => Array\n(\n => 111.125.106.75\n)\n\n => Array\n(\n => 106.76.71.74\n)\n\n => Array\n(\n => 112.201.138.85\n)\n\n => Array\n(\n => 110.137.101.229\n)\n\n => Array\n(\n => 43.242.177.96\n)\n\n => Array\n(\n => 39.36.198.196\n)\n\n => Array\n(\n => 27.255.181.140\n)\n\n => Array\n(\n => 194.99.104.58\n)\n\n => Array\n(\n => 78.129.139.109\n)\n\n => Array\n(\n => 47.247.185.67\n)\n\n => Array\n(\n => 27.63.37.90\n)\n\n => Array\n(\n => 103.211.54.1\n)\n\n => Array\n(\n => 94.202.167.139\n)\n\n => Array\n(\n => 111.119.183.3\n)\n\n => Array\n(\n => 124.253.194.1\n)\n\n => Array\n(\n => 192.142.188.115\n)\n\n => Array\n(\n => 39.44.137.107\n)\n\n => Array\n(\n => 43.251.191.25\n)\n\n => Array\n(\n => 103.140.30.114\n)\n\n => Array\n(\n => 117.5.194.159\n)\n\n => Array\n(\n => 109.169.23.79\n)\n\n => Array\n(\n => 122.178.127.170\n)\n\n => Array\n(\n => 45.118.165.156\n)\n\n => Array\n(\n => 39.48.199.148\n)\n\n => Array\n(\n => 182.64.138.32\n)\n\n => Array\n(\n => 37.73.129.186\n)\n\n => Array\n(\n => 182.186.110.35\n)\n\n => Array\n(\n => 43.242.177.24\n)\n\n => Array\n(\n => 119.155.23.112\n)\n\n => Array\n(\n => 84.16.238.119\n)\n\n => Array\n(\n => 41.202.219.252\n)\n\n => Array\n(\n => 43.242.176.119\n)\n\n => Array\n(\n => 111.119.187.6\n)\n\n => Array\n(\n => 95.12.200.188\n)\n\n => Array\n(\n => 139.28.219.138\n)\n\n => Array\n(\n => 89.163.247.130\n)\n\n => Array\n(\n => 122.173.103.88\n)\n\n => Array\n(\n => 103.248.87.10\n)\n\n => Array\n(\n => 23.106.249.36\n)\n\n => Array\n(\n => 124.253.94.125\n)\n\n => Array\n(\n => 39.53.244.147\n)\n\n => Array\n(\n => 193.109.85.11\n)\n\n => Array\n(\n => 43.242.176.71\n)\n\n => Array\n(\n => 43.242.177.58\n)\n\n => Array\n(\n => 47.31.6.139\n)\n\n => Array\n(\n => 39.59.34.67\n)\n\n => Array\n(\n => 43.242.176.58\n)\n\n => Array\n(\n => 103.107.198.198\n)\n\n => Array\n(\n => 147.135.11.113\n)\n\n => Array\n(\n => 27.7.212.112\n)\n\n => Array\n(\n => 43.242.177.1\n)\n\n => Array\n(\n => 175.107.227.27\n)\n\n => Array\n(\n => 103.103.43.254\n)\n\n => Array\n(\n => 49.15.221.10\n)\n\n => Array\n(\n => 43.242.177.43\n)\n\n => Array\n(\n => 36.85.59.11\n)\n\n => Array\n(\n => 124.253.204.50\n)\n\n => Array\n(\n => 5.181.233.54\n)\n\n => Array\n(\n => 43.242.177.154\n)\n\n => Array\n(\n => 103.84.37.169\n)\n\n => Array\n(\n => 222.252.54.108\n)\n\n => Array\n(\n => 14.162.160.254\n)\n\n => Array\n(\n => 178.151.218.45\n)\n\n => Array\n(\n => 110.137.101.93\n)\n\n => Array\n(\n => 122.162.212.59\n)\n\n => Array\n(\n => 81.12.118.162\n)\n\n => Array\n(\n => 171.76.186.148\n)\n\n => Array\n(\n => 182.69.253.77\n)\n\n => Array\n(\n => 111.119.183.43\n)\n\n => Array\n(\n => 49.149.74.226\n)\n\n => Array\n(\n => 43.242.177.63\n)\n\n => Array\n(\n => 14.99.243.54\n)\n\n => Array\n(\n => 110.137.100.25\n)\n\n => Array\n(\n => 116.107.25.163\n)\n\n => Array\n(\n => 49.36.71.141\n)\n\n => Array\n(\n => 182.180.117.219\n)\n\n => Array\n(\n => 150.242.172.194\n)\n\n => Array\n(\n => 49.156.111.40\n)\n\n => Array\n(\n => 49.15.208.115\n)\n\n => Array\n(\n => 103.209.87.219\n)\n\n => Array\n(\n => 43.242.176.56\n)\n\n => Array\n(\n => 103.132.187.100\n)\n\n => Array\n(\n => 49.156.96.120\n)\n\n => Array\n(\n => 192.142.176.171\n)\n\n => Array\n(\n => 51.91.18.131\n)\n\n => Array\n(\n => 103.83.144.121\n)\n\n => Array\n(\n => 1.39.75.72\n)\n\n => Array\n(\n => 14.231.172.177\n)\n\n => Array\n(\n => 94.232.213.159\n)\n\n => Array\n(\n => 103.228.158.38\n)\n\n => Array\n(\n => 43.242.177.100\n)\n\n => Array\n(\n => 171.76.149.130\n)\n\n => Array\n(\n => 113.183.26.59\n)\n\n => Array\n(\n => 182.74.232.166\n)\n\n => Array\n(\n => 47.31.205.211\n)\n\n => Array\n(\n => 106.211.253.70\n)\n\n => Array\n(\n => 39.51.233.214\n)\n\n => Array\n(\n => 182.70.249.161\n)\n\n => Array\n(\n => 222.252.40.196\n)\n\n => Array\n(\n => 49.37.6.29\n)\n\n => Array\n(\n => 119.155.33.170\n)\n\n => Array\n(\n => 43.242.177.79\n)\n\n => Array\n(\n => 111.119.183.62\n)\n\n => Array\n(\n => 137.59.226.97\n)\n\n => Array\n(\n => 42.111.18.121\n)\n\n => Array\n(\n => 223.190.46.91\n)\n\n => Array\n(\n => 45.118.165.159\n)\n\n => Array\n(\n => 110.136.60.44\n)\n\n => Array\n(\n => 43.242.176.57\n)\n\n => Array\n(\n => 117.212.58.0\n)\n\n => Array\n(\n => 49.37.7.66\n)\n\n => Array\n(\n => 39.52.174.33\n)\n\n => Array\n(\n => 150.242.172.55\n)\n\n => Array\n(\n => 103.94.111.236\n)\n\n => Array\n(\n => 106.215.239.184\n)\n\n => Array\n(\n => 101.128.117.75\n)\n\n => Array\n(\n => 162.210.194.10\n)\n\n => Array\n(\n => 136.158.31.132\n)\n\n => Array\n(\n => 39.51.245.69\n)\n\n => Array\n(\n => 39.42.149.159\n)\n\n => Array\n(\n => 51.77.108.159\n)\n\n => Array\n(\n => 45.127.247.250\n)\n\n => Array\n(\n => 122.172.78.22\n)\n\n => Array\n(\n => 117.220.208.38\n)\n\n => Array\n(\n => 112.201.138.95\n)\n\n => Array\n(\n => 49.145.105.113\n)\n\n => Array\n(\n => 110.93.247.12\n)\n\n => Array\n(\n => 39.52.150.32\n)\n\n => Array\n(\n => 122.161.89.41\n)\n\n => Array\n(\n => 39.52.176.49\n)\n\n => Array\n(\n => 157.33.12.154\n)\n\n => Array\n(\n => 73.111.248.162\n)\n\n => Array\n(\n => 112.204.167.67\n)\n\n => Array\n(\n => 107.150.30.182\n)\n\n => Array\n(\n => 115.99.222.229\n)\n\n => Array\n(\n => 180.190.195.96\n)\n\n => Array\n(\n => 157.44.57.255\n)\n\n => Array\n(\n => 39.37.9.167\n)\n\n => Array\n(\n => 39.49.48.33\n)\n\n => Array\n(\n => 157.44.218.118\n)\n\n => Array\n(\n => 103.211.54.253\n)\n\n => Array\n(\n => 43.242.177.81\n)\n\n => Array\n(\n => 103.111.224.227\n)\n\n => Array\n(\n => 223.176.48.237\n)\n\n => Array\n(\n => 124.253.87.117\n)\n\n => Array\n(\n => 124.29.247.14\n)\n\n => Array\n(\n => 182.189.232.32\n)\n\n => Array\n(\n => 111.68.97.206\n)\n\n => Array\n(\n => 103.117.15.70\n)\n\n => Array\n(\n => 182.18.236.101\n)\n\n => Array\n(\n => 43.242.177.60\n)\n\n => Array\n(\n => 180.190.7.178\n)\n\n => Array\n(\n => 112.201.142.95\n)\n\n => Array\n(\n => 122.178.255.123\n)\n\n => Array\n(\n => 49.36.240.103\n)\n\n => Array\n(\n => 210.56.16.13\n)\n\n => Array\n(\n => 103.91.123.219\n)\n\n => Array\n(\n => 39.52.155.252\n)\n\n => Array\n(\n => 192.142.207.230\n)\n\n => Array\n(\n => 188.163.82.179\n)\n\n => Array\n(\n => 182.189.9.196\n)\n\n => Array\n(\n => 175.107.221.51\n)\n\n => Array\n(\n => 39.53.221.200\n)\n\n => Array\n(\n => 27.255.190.59\n)\n\n => Array\n(\n => 183.83.212.118\n)\n\n => Array\n(\n => 45.118.165.143\n)\n\n => Array\n(\n => 182.189.124.35\n)\n\n => Array\n(\n => 203.101.186.1\n)\n\n => Array\n(\n => 49.36.246.25\n)\n\n => Array\n(\n => 39.42.186.234\n)\n\n => Array\n(\n => 103.82.80.14\n)\n\n => Array\n(\n => 210.18.182.42\n)\n\n => Array\n(\n => 42.111.13.81\n)\n\n => Array\n(\n => 46.200.69.240\n)\n\n => Array\n(\n => 103.209.87.213\n)\n\n => Array\n(\n => 103.31.95.95\n)\n\n => Array\n(\n => 180.190.174.25\n)\n\n => Array\n(\n => 103.77.0.128\n)\n\n => Array\n(\n => 49.34.103.82\n)\n\n => Array\n(\n => 39.48.196.22\n)\n\n => Array\n(\n => 192.142.166.20\n)\n\n => Array\n(\n => 202.142.110.186\n)\n\n => Array\n(\n => 122.163.135.95\n)\n\n => Array\n(\n => 183.83.255.225\n)\n\n => Array\n(\n => 157.45.46.10\n)\n\n => Array\n(\n => 182.189.4.77\n)\n\n => Array\n(\n => 49.145.104.71\n)\n\n => Array\n(\n => 103.143.7.34\n)\n\n => Array\n(\n => 61.2.180.15\n)\n\n => Array\n(\n => 103.81.215.61\n)\n\n => Array\n(\n => 115.42.71.122\n)\n\n => Array\n(\n => 124.253.73.20\n)\n\n => Array\n(\n => 49.33.210.169\n)\n\n => Array\n(\n => 78.159.101.115\n)\n\n => Array\n(\n => 42.111.17.221\n)\n\n => Array\n(\n => 43.242.178.67\n)\n\n => Array\n(\n => 36.68.138.36\n)\n\n => Array\n(\n => 103.195.201.51\n)\n\n => Array\n(\n => 79.141.162.81\n)\n\n => Array\n(\n => 202.8.118.239\n)\n\n => Array\n(\n => 103.139.128.161\n)\n\n => Array\n(\n => 207.244.71.84\n)\n\n => Array\n(\n => 124.253.184.45\n)\n\n => Array\n(\n => 111.125.106.124\n)\n\n => Array\n(\n => 111.125.105.139\n)\n\n => Array\n(\n => 39.59.94.233\n)\n\n => Array\n(\n => 112.211.60.168\n)\n\n => Array\n(\n => 103.117.14.72\n)\n\n => Array\n(\n => 111.119.183.56\n)\n\n => Array\n(\n => 47.31.53.228\n)\n\n => Array\n(\n => 124.253.186.8\n)\n\n => Array\n(\n => 183.83.213.214\n)\n\n => Array\n(\n => 103.106.239.70\n)\n\n => Array\n(\n => 182.182.92.81\n)\n\n => Array\n(\n => 14.162.167.98\n)\n\n => Array\n(\n => 112.211.11.107\n)\n\n => Array\n(\n => 77.111.246.20\n)\n\n => Array\n(\n => 49.156.86.182\n)\n\n => Array\n(\n => 47.29.122.112\n)\n\n => Array\n(\n => 125.99.74.42\n)\n\n => Array\n(\n => 124.123.169.24\n)\n\n => Array\n(\n => 106.202.105.128\n)\n\n => Array\n(\n => 103.244.173.14\n)\n\n => Array\n(\n => 103.98.63.104\n)\n\n => Array\n(\n => 180.245.6.60\n)\n\n => Array\n(\n => 49.149.96.14\n)\n\n => Array\n(\n => 14.177.120.169\n)\n\n => Array\n(\n => 192.135.90.145\n)\n\n => Array\n(\n => 223.190.18.218\n)\n\n => Array\n(\n => 171.61.190.2\n)\n\n => Array\n(\n => 58.65.220.219\n)\n\n => Array\n(\n => 122.177.29.87\n)\n\n => Array\n(\n => 223.236.175.203\n)\n\n => Array\n(\n => 39.53.237.106\n)\n\n => Array\n(\n => 1.186.114.83\n)\n\n => Array\n(\n => 43.230.66.153\n)\n\n => Array\n(\n => 27.96.94.247\n)\n\n => Array\n(\n => 39.52.176.185\n)\n\n => Array\n(\n => 59.94.147.62\n)\n\n => Array\n(\n => 119.160.117.10\n)\n\n => Array\n(\n => 43.241.146.105\n)\n\n => Array\n(\n => 39.59.87.75\n)\n\n => Array\n(\n => 119.160.118.203\n)\n\n => Array\n(\n => 39.52.161.76\n)\n\n => Array\n(\n => 202.168.84.189\n)\n\n => Array\n(\n => 103.215.168.2\n)\n\n => Array\n(\n => 39.42.146.160\n)\n\n => Array\n(\n => 182.182.30.246\n)\n\n => Array\n(\n => 122.173.212.133\n)\n\n => Array\n(\n => 39.51.238.44\n)\n\n => Array\n(\n => 183.83.252.51\n)\n\n => Array\n(\n => 202.142.168.86\n)\n\n => Array\n(\n => 39.40.198.209\n)\n\n => Array\n(\n => 192.135.90.151\n)\n\n => Array\n(\n => 72.255.41.174\n)\n\n => Array\n(\n => 137.97.92.124\n)\n\n => Array\n(\n => 182.185.159.155\n)\n\n => Array\n(\n => 157.44.133.131\n)\n\n => Array\n(\n => 39.51.230.253\n)\n\n => Array\n(\n => 103.70.87.200\n)\n\n => Array\n(\n => 103.117.15.82\n)\n\n => Array\n(\n => 103.217.244.69\n)\n\n => Array\n(\n => 157.34.76.185\n)\n\n => Array\n(\n => 39.52.130.163\n)\n\n => Array\n(\n => 182.181.41.39\n)\n\n => Array\n(\n => 49.37.212.226\n)\n\n => Array\n(\n => 119.160.117.100\n)\n\n => Array\n(\n => 103.209.87.43\n)\n\n => Array\n(\n => 180.190.195.45\n)\n\n => Array\n(\n => 122.160.57.230\n)\n\n => Array\n(\n => 203.192.213.81\n)\n\n => Array\n(\n => 182.181.63.91\n)\n\n => Array\n(\n => 157.44.184.5\n)\n\n => Array\n(\n => 27.97.213.128\n)\n\n => Array\n(\n => 122.55.252.145\n)\n\n => Array\n(\n => 103.117.15.92\n)\n\n => Array\n(\n => 42.201.251.179\n)\n\n => Array\n(\n => 122.186.84.53\n)\n\n => Array\n(\n => 119.157.75.242\n)\n\n => Array\n(\n => 39.42.163.6\n)\n\n => Array\n(\n => 14.99.246.78\n)\n\n => Array\n(\n => 103.209.87.227\n)\n\n => Array\n(\n => 182.68.215.31\n)\n\n => Array\n(\n => 45.118.165.140\n)\n\n => Array\n(\n => 207.244.71.81\n)\n\n => Array\n(\n => 27.97.162.57\n)\n\n => Array\n(\n => 103.113.106.98\n)\n\n => Array\n(\n => 95.135.44.103\n)\n\n => Array\n(\n => 125.209.114.238\n)\n\n => Array\n(\n => 77.123.14.176\n)\n\n => Array\n(\n => 110.36.202.169\n)\n\n => Array\n(\n => 124.253.205.230\n)\n\n => Array\n(\n => 106.215.72.117\n)\n\n => Array\n(\n => 116.72.226.35\n)\n\n => Array\n(\n => 137.97.103.141\n)\n\n => Array\n(\n => 112.79.212.161\n)\n\n => Array\n(\n => 103.209.85.150\n)\n\n => Array\n(\n => 103.159.127.6\n)\n\n => Array\n(\n => 43.239.205.66\n)\n\n => Array\n(\n => 143.244.51.152\n)\n\n => Array\n(\n => 182.64.15.3\n)\n\n => Array\n(\n => 182.185.207.146\n)\n\n => Array\n(\n => 45.118.165.155\n)\n\n => Array\n(\n => 115.160.241.214\n)\n\n => Array\n(\n => 47.31.230.68\n)\n\n => Array\n(\n => 49.15.84.145\n)\n\n => Array\n(\n => 39.51.239.206\n)\n\n => Array\n(\n => 103.149.154.212\n)\n\n => Array\n(\n => 43.239.207.155\n)\n\n => Array\n(\n => 182.182.30.181\n)\n\n => Array\n(\n => 157.37.198.16\n)\n\n => Array\n(\n => 162.239.24.60\n)\n\n => Array\n(\n => 106.212.101.97\n)\n\n => Array\n(\n => 124.253.97.44\n)\n\n => Array\n(\n => 106.214.95.176\n)\n\n => Array\n(\n => 102.69.228.114\n)\n\n => Array\n(\n => 116.74.58.221\n)\n\n => Array\n(\n => 162.210.194.38\n)\n\n => Array\n(\n => 39.52.162.121\n)\n\n => Array\n(\n => 103.216.143.255\n)\n\n => Array\n(\n => 103.49.155.134\n)\n\n => Array\n(\n => 182.191.119.236\n)\n\n => Array\n(\n => 111.88.213.172\n)\n\n => Array\n(\n => 43.239.207.207\n)\n\n => Array\n(\n => 140.213.35.143\n)\n\n => Array\n(\n => 154.72.153.215\n)\n\n => Array\n(\n => 122.170.47.36\n)\n\n => Array\n(\n => 51.158.111.163\n)\n\n => Array\n(\n => 203.122.10.150\n)\n\n => Array\n(\n => 47.31.176.111\n)\n\n => Array\n(\n => 103.75.246.34\n)\n\n => Array\n(\n => 103.244.178.45\n)\n\n => Array\n(\n => 182.185.138.0\n)\n\n => Array\n(\n => 183.83.254.224\n)\n\n => Array\n(\n => 49.36.246.145\n)\n\n => Array\n(\n => 202.47.60.85\n)\n\n => Array\n(\n => 180.190.163.160\n)\n\n => Array\n(\n => 27.255.187.221\n)\n\n => Array\n(\n => 14.248.94.2\n)\n\n => Array\n(\n => 185.233.17.187\n)\n\n => Array\n(\n => 139.5.254.227\n)\n\n => Array\n(\n => 103.149.160.66\n)\n\n => Array\n(\n => 122.168.235.47\n)\n\n => Array\n(\n => 45.113.248.224\n)\n\n => Array\n(\n => 110.54.170.142\n)\n\n => Array\n(\n => 223.235.226.55\n)\n\n => Array\n(\n => 157.32.19.235\n)\n\n => Array\n(\n => 49.15.221.114\n)\n\n => Array\n(\n => 27.97.166.163\n)\n\n => Array\n(\n => 223.233.99.5\n)\n\n => Array\n(\n => 49.33.203.53\n)\n\n => Array\n(\n => 27.56.214.41\n)\n\n => Array\n(\n => 103.138.51.3\n)\n\n => Array\n(\n => 111.119.183.21\n)\n\n => Array\n(\n => 47.15.138.233\n)\n\n => Array\n(\n => 202.63.213.184\n)\n\n => Array\n(\n => 49.36.158.94\n)\n\n => Array\n(\n => 27.97.186.179\n)\n\n => Array\n(\n => 27.97.214.69\n)\n\n => Array\n(\n => 203.128.18.163\n)\n\n => Array\n(\n => 106.207.235.63\n)\n\n => Array\n(\n => 116.107.220.231\n)\n\n => Array\n(\n => 223.226.169.249\n)\n\n => Array\n(\n => 106.201.24.6\n)\n\n => Array\n(\n => 49.15.89.7\n)\n\n => Array\n(\n => 49.15.142.20\n)\n\n => Array\n(\n => 223.177.24.85\n)\n\n => Array\n(\n => 37.156.17.37\n)\n\n => Array\n(\n => 102.129.224.2\n)\n\n => Array\n(\n => 49.15.85.221\n)\n\n => Array\n(\n => 106.76.208.153\n)\n\n => Array\n(\n => 61.2.47.71\n)\n\n => Array\n(\n => 27.97.178.79\n)\n\n => Array\n(\n => 39.34.143.196\n)\n\n => Array\n(\n => 103.10.227.158\n)\n\n => Array\n(\n => 117.220.210.159\n)\n\n => Array\n(\n => 182.189.28.11\n)\n\n => Array\n(\n => 122.185.38.170\n)\n\n => Array\n(\n => 112.196.132.115\n)\n\n => Array\n(\n => 187.156.137.83\n)\n\n => Array\n(\n => 203.122.3.88\n)\n\n => Array\n(\n => 51.68.142.45\n)\n\n => Array\n(\n => 124.253.217.55\n)\n\n => Array\n(\n => 103.152.41.2\n)\n\n => Array\n(\n => 157.37.154.219\n)\n\n => Array\n(\n => 39.45.32.77\n)\n\n => Array\n(\n => 182.182.22.221\n)\n\n => Array\n(\n => 157.43.205.117\n)\n\n => Array\n(\n => 202.142.123.58\n)\n\n => Array\n(\n => 43.239.207.121\n)\n\n => Array\n(\n => 49.206.122.113\n)\n\n => Array\n(\n => 106.193.199.203\n)\n\n => Array\n(\n => 103.67.157.251\n)\n\n => Array\n(\n => 49.34.97.81\n)\n\n => Array\n(\n => 49.156.92.130\n)\n\n => Array\n(\n => 203.160.179.210\n)\n\n => Array\n(\n => 106.215.33.244\n)\n\n => Array\n(\n => 191.101.148.41\n)\n\n => Array\n(\n => 203.90.94.94\n)\n\n => Array\n(\n => 105.129.205.134\n)\n\n => Array\n(\n => 106.215.45.165\n)\n\n => Array\n(\n => 112.196.132.15\n)\n\n => Array\n(\n => 39.59.64.174\n)\n\n => Array\n(\n => 124.253.155.116\n)\n\n => Array\n(\n => 94.179.192.204\n)\n\n => Array\n(\n => 110.38.29.245\n)\n\n => Array\n(\n => 124.29.209.78\n)\n\n => Array\n(\n => 103.75.245.240\n)\n\n => Array\n(\n => 49.36.159.170\n)\n\n => Array\n(\n => 223.190.18.160\n)\n\n => Array\n(\n => 124.253.113.226\n)\n\n => Array\n(\n => 14.180.77.240\n)\n\n => Array\n(\n => 106.215.76.24\n)\n\n => Array\n(\n => 106.210.155.153\n)\n\n => Array\n(\n => 111.119.187.42\n)\n\n => Array\n(\n => 146.196.32.106\n)\n\n => Array\n(\n => 122.162.22.27\n)\n\n => Array\n(\n => 49.145.59.252\n)\n\n => Array\n(\n => 95.47.247.92\n)\n\n => Array\n(\n => 103.99.218.50\n)\n\n => Array\n(\n => 157.37.192.88\n)\n\n => Array\n(\n => 82.102.31.242\n)\n\n => Array\n(\n => 157.46.220.64\n)\n\n => Array\n(\n => 180.151.107.52\n)\n\n => Array\n(\n => 203.81.240.75\n)\n\n => Array\n(\n => 122.167.213.130\n)\n\n => Array\n(\n => 103.227.70.164\n)\n\n => Array\n(\n => 106.215.81.169\n)\n\n => Array\n(\n => 157.46.214.170\n)\n\n => Array\n(\n => 103.69.27.163\n)\n\n => Array\n(\n => 124.253.23.213\n)\n\n => Array\n(\n => 157.37.167.174\n)\n\n => Array\n(\n => 1.39.204.67\n)\n\n => Array\n(\n => 112.196.132.51\n)\n\n => Array\n(\n => 119.152.61.222\n)\n\n => Array\n(\n => 47.31.36.174\n)\n\n => Array\n(\n => 47.31.152.174\n)\n\n => Array\n(\n => 49.34.18.105\n)\n\n => Array\n(\n => 157.37.170.101\n)\n\n => Array\n(\n => 118.209.241.234\n)\n\n => Array\n(\n => 103.67.19.9\n)\n\n => Array\n(\n => 182.189.14.154\n)\n\n => Array\n(\n => 45.127.233.232\n)\n\n => Array\n(\n => 27.96.94.91\n)\n\n => Array\n(\n => 183.83.214.250\n)\n\n => Array\n(\n => 47.31.27.140\n)\n\n => Array\n(\n => 47.31.129.199\n)\n\n => Array\n(\n => 157.44.156.111\n)\n\n => Array\n(\n => 42.110.163.2\n)\n\n => Array\n(\n => 124.253.64.210\n)\n\n => Array\n(\n => 49.36.167.54\n)\n\n => Array\n(\n => 27.63.135.145\n)\n\n => Array\n(\n => 157.35.254.63\n)\n\n => Array\n(\n => 39.45.18.182\n)\n\n => Array\n(\n => 197.210.85.102\n)\n\n => Array\n(\n => 112.196.132.90\n)\n\n => Array\n(\n => 59.152.97.84\n)\n\n => Array\n(\n => 43.242.178.7\n)\n\n => Array\n(\n => 47.31.40.70\n)\n\n => Array\n(\n => 202.134.10.136\n)\n\n => Array\n(\n => 132.154.241.43\n)\n\n => Array\n(\n => 185.209.179.240\n)\n\n => Array\n(\n => 202.47.50.28\n)\n\n => Array\n(\n => 182.186.1.29\n)\n\n => Array\n(\n => 124.253.114.229\n)\n\n => Array\n(\n => 49.32.210.126\n)\n\n => Array\n(\n => 43.242.178.122\n)\n\n => Array\n(\n => 42.111.28.52\n)\n\n => Array\n(\n => 23.227.141.44\n)\n\n => Array\n(\n => 23.227.141.156\n)\n\n => Array\n(\n => 103.253.173.79\n)\n\n => Array\n(\n => 116.75.231.74\n)\n\n => Array\n(\n => 106.76.78.196\n)\n\n => Array\n(\n => 116.75.197.68\n)\n\n => Array\n(\n => 42.108.172.131\n)\n\n => Array\n(\n => 157.38.27.199\n)\n\n => Array\n(\n => 103.70.86.205\n)\n\n => Array\n(\n => 119.152.63.239\n)\n\n => Array\n(\n => 103.233.116.94\n)\n\n => Array\n(\n => 111.119.188.17\n)\n\n => Array\n(\n => 103.196.160.156\n)\n\n => Array\n(\n => 27.97.208.40\n)\n\n => Array\n(\n => 188.163.7.136\n)\n\n => Array\n(\n => 49.15.202.205\n)\n\n => Array\n(\n => 124.253.201.111\n)\n\n => Array\n(\n => 182.190.213.246\n)\n\n => Array\n(\n => 5.154.174.10\n)\n\n => Array\n(\n => 103.21.185.16\n)\n\n => Array\n(\n => 112.196.132.67\n)\n\n => Array\n(\n => 49.15.194.230\n)\n\n => Array\n(\n => 103.118.34.103\n)\n\n => Array\n(\n => 49.15.201.92\n)\n\n => Array\n(\n => 42.111.13.238\n)\n\n => Array\n(\n => 203.192.213.137\n)\n\n => Array\n(\n => 45.115.190.82\n)\n\n => Array\n(\n => 78.26.130.102\n)\n\n => Array\n(\n => 49.15.85.202\n)\n\n => Array\n(\n => 106.76.193.33\n)\n\n => Array\n(\n => 103.70.41.30\n)\n\n => Array\n(\n => 103.82.78.254\n)\n\n => Array\n(\n => 110.38.35.90\n)\n\n => Array\n(\n => 181.214.107.27\n)\n\n => Array\n(\n => 27.110.183.162\n)\n\n => Array\n(\n => 94.225.230.215\n)\n\n => Array\n(\n => 27.97.185.58\n)\n\n => Array\n(\n => 49.146.196.124\n)\n\n => Array\n(\n => 119.157.76.144\n)\n\n => Array\n(\n => 103.99.218.34\n)\n\n => Array\n(\n => 185.32.221.247\n)\n\n => Array\n(\n => 27.97.161.12\n)\n\n => Array\n(\n => 27.62.144.214\n)\n\n => Array\n(\n => 124.253.90.151\n)\n\n => Array\n(\n => 49.36.135.69\n)\n\n => Array\n(\n => 39.40.217.106\n)\n\n => Array\n(\n => 119.152.235.136\n)\n\n => Array\n(\n => 103.91.103.226\n)\n\n => Array\n(\n => 117.222.226.93\n)\n\n => Array\n(\n => 182.190.24.126\n)\n\n => Array\n(\n => 27.97.223.179\n)\n\n => Array\n(\n => 202.137.115.11\n)\n\n => Array\n(\n => 43.242.178.130\n)\n\n => Array\n(\n => 182.189.125.232\n)\n\n => Array\n(\n => 182.190.202.87\n)\n\n => Array\n(\n => 124.253.102.193\n)\n\n => Array\n(\n => 103.75.247.73\n)\n\n => Array\n(\n => 122.177.100.97\n)\n\n => Array\n(\n => 47.31.192.254\n)\n\n => Array\n(\n => 49.149.73.185\n)\n\n => Array\n(\n => 39.57.147.197\n)\n\n => Array\n(\n => 103.110.147.52\n)\n\n => Array\n(\n => 124.253.106.255\n)\n\n => Array\n(\n => 152.57.116.136\n)\n\n => Array\n(\n => 110.38.35.102\n)\n\n => Array\n(\n => 182.18.206.127\n)\n\n => Array\n(\n => 103.133.59.246\n)\n\n => Array\n(\n => 27.97.189.139\n)\n\n => Array\n(\n => 179.61.245.54\n)\n\n => Array\n(\n => 103.240.233.176\n)\n\n => Array\n(\n => 111.88.124.196\n)\n\n => Array\n(\n => 49.146.215.3\n)\n\n => Array\n(\n => 110.39.10.246\n)\n\n => Array\n(\n => 27.5.42.135\n)\n\n => Array\n(\n => 27.97.177.251\n)\n\n => Array\n(\n => 93.177.75.254\n)\n\n => Array\n(\n => 43.242.177.3\n)\n\n => Array\n(\n => 112.196.132.97\n)\n\n => Array\n(\n => 116.75.242.188\n)\n\n => Array\n(\n => 202.8.118.101\n)\n\n => Array\n(\n => 49.36.65.43\n)\n\n => Array\n(\n => 157.37.146.220\n)\n\n => Array\n(\n => 157.37.143.235\n)\n\n => Array\n(\n => 157.38.94.34\n)\n\n => Array\n(\n => 49.36.131.1\n)\n\n => Array\n(\n => 132.154.92.97\n)\n\n => Array\n(\n => 132.154.123.115\n)\n\n => Array\n(\n => 49.15.197.222\n)\n\n => Array\n(\n => 124.253.198.72\n)\n\n => Array\n(\n => 27.97.217.95\n)\n\n => Array\n(\n => 47.31.194.65\n)\n\n => Array\n(\n => 197.156.190.156\n)\n\n => Array\n(\n => 197.156.190.230\n)\n\n => Array\n(\n => 103.62.152.250\n)\n\n => Array\n(\n => 103.152.212.126\n)\n\n => Array\n(\n => 185.233.18.177\n)\n\n => Array\n(\n => 116.75.63.83\n)\n\n => Array\n(\n => 157.38.56.125\n)\n\n => Array\n(\n => 119.157.107.195\n)\n\n => Array\n(\n => 103.87.50.73\n)\n\n => Array\n(\n => 95.142.120.141\n)\n\n => Array\n(\n => 154.13.1.221\n)\n\n => Array\n(\n => 103.147.87.79\n)\n\n => Array\n(\n => 39.53.173.186\n)\n\n => Array\n(\n => 195.114.145.107\n)\n\n => Array\n(\n => 157.33.201.185\n)\n\n => Array\n(\n => 195.85.219.36\n)\n\n => Array\n(\n => 105.161.67.127\n)\n\n => Array\n(\n => 110.225.87.77\n)\n\n => Array\n(\n => 103.95.167.236\n)\n\n => Array\n(\n => 89.187.162.213\n)\n\n => Array\n(\n => 27.255.189.50\n)\n\n => Array\n(\n => 115.96.77.54\n)\n\n => Array\n(\n => 223.182.220.223\n)\n\n => Array\n(\n => 157.47.206.192\n)\n\n => Array\n(\n => 182.186.110.226\n)\n\n => Array\n(\n => 39.53.243.237\n)\n\n => Array\n(\n => 39.40.228.58\n)\n\n => Array\n(\n => 157.38.60.9\n)\n\n => Array\n(\n => 106.198.244.189\n)\n\n => Array\n(\n => 124.253.51.164\n)\n\n => Array\n(\n => 49.147.113.58\n)\n\n => Array\n(\n => 14.231.196.229\n)\n\n => Array\n(\n => 103.81.214.152\n)\n\n => Array\n(\n => 117.222.220.60\n)\n\n => Array\n(\n => 83.142.111.213\n)\n\n => Array\n(\n => 14.224.77.147\n)\n\n => Array\n(\n => 110.235.236.95\n)\n\n => Array\n(\n => 103.26.83.30\n)\n\n => Array\n(\n => 106.206.191.82\n)\n\n => Array\n(\n => 103.49.117.135\n)\n\n => Array\n(\n => 202.47.39.9\n)\n\n => Array\n(\n => 180.178.145.205\n)\n\n => Array\n(\n => 43.251.93.119\n)\n\n => Array\n(\n => 27.6.212.182\n)\n\n => Array\n(\n => 39.42.156.20\n)\n\n => Array\n(\n => 47.31.141.195\n)\n\n => Array\n(\n => 157.37.146.73\n)\n\n => Array\n(\n => 49.15.93.155\n)\n\n => Array\n(\n => 162.210.194.37\n)\n\n => Array\n(\n => 223.188.160.236\n)\n\n => Array\n(\n => 47.9.90.158\n)\n\n => Array\n(\n => 49.15.85.224\n)\n\n => Array\n(\n => 49.15.93.134\n)\n\n => Array\n(\n => 107.179.244.94\n)\n\n => Array\n(\n => 182.190.203.90\n)\n\n => Array\n(\n => 185.192.69.203\n)\n\n => Array\n(\n => 185.17.27.99\n)\n\n => Array\n(\n => 119.160.116.182\n)\n\n => Array\n(\n => 203.99.177.25\n)\n\n => Array\n(\n => 162.228.207.248\n)\n\n => Array\n(\n => 47.31.245.69\n)\n\n => Array\n(\n => 49.15.210.159\n)\n\n => Array\n(\n => 42.111.2.112\n)\n\n => Array\n(\n => 223.186.116.79\n)\n\n => Array\n(\n => 103.225.176.143\n)\n\n => Array\n(\n => 45.115.190.49\n)\n\n => Array\n(\n => 115.42.71.105\n)\n\n => Array\n(\n => 157.51.11.157\n)\n\n => Array\n(\n => 14.175.56.186\n)\n\n => Array\n(\n => 59.153.16.7\n)\n\n => Array\n(\n => 106.202.84.144\n)\n\n => Array\n(\n => 27.6.242.91\n)\n\n => Array\n(\n => 47.11.112.107\n)\n\n => Array\n(\n => 106.207.54.187\n)\n\n => Array\n(\n => 124.253.196.121\n)\n\n => Array\n(\n => 51.79.161.244\n)\n\n => Array\n(\n => 103.41.24.100\n)\n\n => Array\n(\n => 195.66.79.32\n)\n\n => Array\n(\n => 117.196.127.42\n)\n\n => Array\n(\n => 103.75.247.197\n)\n\n => Array\n(\n => 89.187.162.107\n)\n\n => Array\n(\n => 223.238.154.49\n)\n\n => Array\n(\n => 117.223.99.139\n)\n\n => Array\n(\n => 103.87.59.134\n)\n\n => Array\n(\n => 124.253.212.30\n)\n\n => Array\n(\n => 202.47.62.55\n)\n\n => Array\n(\n => 47.31.219.128\n)\n\n => Array\n(\n => 49.14.121.72\n)\n\n => Array\n(\n => 124.253.212.189\n)\n\n => Array\n(\n => 103.244.179.24\n)\n\n => Array\n(\n => 182.190.213.92\n)\n\n => Array\n(\n => 43.242.178.51\n)\n\n => Array\n(\n => 180.92.138.54\n)\n\n => Array\n(\n => 111.119.187.26\n)\n\n => Array\n(\n => 49.156.111.31\n)\n\n => Array\n(\n => 27.63.108.183\n)\n\n => Array\n(\n => 27.58.184.79\n)\n\n => Array\n(\n => 39.40.225.130\n)\n\n => Array\n(\n => 157.38.5.178\n)\n\n => Array\n(\n => 103.112.55.44\n)\n\n => Array\n(\n => 119.160.100.247\n)\n\n => Array\n(\n => 39.53.101.15\n)\n\n => Array\n(\n => 47.31.207.117\n)\n\n => Array\n(\n => 112.196.158.155\n)\n\n => Array\n(\n => 94.204.247.123\n)\n\n => Array\n(\n => 103.118.76.38\n)\n\n => Array\n(\n => 124.29.212.208\n)\n\n => Array\n(\n => 124.253.196.250\n)\n\n => Array\n(\n => 118.70.182.242\n)\n\n => Array\n(\n => 157.38.78.67\n)\n\n => Array\n(\n => 103.99.218.33\n)\n\n => Array\n(\n => 137.59.220.191\n)\n\n => Array\n(\n => 47.31.139.182\n)\n\n => Array\n(\n => 182.179.136.36\n)\n\n => Array\n(\n => 106.203.73.130\n)\n\n => Array\n(\n => 193.29.107.188\n)\n\n => Array\n(\n => 81.96.92.111\n)\n\n => Array\n(\n => 110.93.203.185\n)\n\n => Array\n(\n => 103.163.248.128\n)\n\n => Array\n(\n => 43.229.166.135\n)\n\n => Array\n(\n => 43.230.106.175\n)\n\n => Array\n(\n => 202.47.62.54\n)\n\n => Array\n(\n => 39.37.181.46\n)\n\n => Array\n(\n => 49.15.204.204\n)\n\n => Array\n(\n => 122.163.237.110\n)\n\n => Array\n(\n => 45.249.8.92\n)\n\n => Array\n(\n => 27.34.50.159\n)\n\n => Array\n(\n => 39.42.171.27\n)\n\n => Array\n(\n => 124.253.101.195\n)\n\n => Array\n(\n => 188.166.145.20\n)\n\n => Array\n(\n => 103.83.145.220\n)\n\n => Array\n(\n => 39.40.96.137\n)\n\n => Array\n(\n => 157.37.185.196\n)\n\n => Array\n(\n => 103.115.124.32\n)\n\n => Array\n(\n => 72.255.48.85\n)\n\n => Array\n(\n => 124.253.74.46\n)\n\n => Array\n(\n => 60.243.225.5\n)\n\n => Array\n(\n => 103.58.152.194\n)\n\n => Array\n(\n => 14.248.71.63\n)\n\n => Array\n(\n => 152.57.214.137\n)\n\n => Array\n(\n => 103.166.58.14\n)\n\n => Array\n(\n => 14.248.71.103\n)\n\n => Array\n(\n => 49.156.103.124\n)\n\n => Array\n(\n => 103.99.218.56\n)\n\n => Array\n(\n => 27.97.177.246\n)\n\n => Array\n(\n => 152.57.94.84\n)\n\n => Array\n(\n => 111.119.187.60\n)\n\n => Array\n(\n => 119.160.99.11\n)\n\n => Array\n(\n => 117.203.11.220\n)\n\n => Array\n(\n => 114.31.131.67\n)\n\n => Array\n(\n => 47.31.253.95\n)\n\n => Array\n(\n => 83.139.184.178\n)\n\n => Array\n(\n => 125.57.9.72\n)\n\n => Array\n(\n => 185.233.16.53\n)\n\n => Array\n(\n => 49.36.180.197\n)\n\n => Array\n(\n => 95.142.119.27\n)\n\n => Array\n(\n => 223.225.70.77\n)\n\n => Array\n(\n => 47.15.222.200\n)\n\n => Array\n(\n => 47.15.218.231\n)\n\n => Array\n(\n => 111.119.187.34\n)\n\n => Array\n(\n => 157.37.198.81\n)\n\n => Array\n(\n => 43.242.177.92\n)\n\n => Array\n(\n => 122.161.68.214\n)\n\n => Array\n(\n => 47.31.145.92\n)\n\n => Array\n(\n => 27.7.196.201\n)\n\n => Array\n(\n => 39.42.172.183\n)\n\n => Array\n(\n => 49.15.129.162\n)\n\n => Array\n(\n => 49.15.206.110\n)\n\n => Array\n(\n => 39.57.141.45\n)\n\n => Array\n(\n => 171.229.175.90\n)\n\n => Array\n(\n => 119.160.68.200\n)\n\n => Array\n(\n => 193.176.84.214\n)\n\n => Array\n(\n => 43.242.177.77\n)\n\n => Array\n(\n => 137.59.220.95\n)\n\n => Array\n(\n => 122.177.118.209\n)\n\n => Array\n(\n => 103.92.214.27\n)\n\n => Array\n(\n => 178.62.10.228\n)\n\n => Array\n(\n => 103.81.214.91\n)\n\n => Array\n(\n => 156.146.33.68\n)\n\n => Array\n(\n => 42.118.116.60\n)\n\n => Array\n(\n => 183.87.122.190\n)\n\n => Array\n(\n => 157.37.159.162\n)\n\n => Array\n(\n => 59.153.16.9\n)\n\n => Array\n(\n => 223.185.43.241\n)\n\n => Array\n(\n => 103.81.214.153\n)\n\n => Array\n(\n => 47.31.143.169\n)\n\n => Array\n(\n => 112.196.158.250\n)\n\n => Array\n(\n => 156.146.36.110\n)\n\n => Array\n(\n => 27.255.34.80\n)\n\n => Array\n(\n => 49.205.77.19\n)\n\n => Array\n(\n => 95.142.120.20\n)\n\n => Array\n(\n => 171.49.195.53\n)\n\n => Array\n(\n => 39.37.152.132\n)\n\n => Array\n(\n => 103.121.204.237\n)\n\n => Array\n(\n => 43.242.176.153\n)\n\n => Array\n(\n => 43.242.176.120\n)\n\n => Array\n(\n => 122.161.66.120\n)\n\n => Array\n(\n => 182.70.140.223\n)\n\n => Array\n(\n => 103.201.135.226\n)\n\n => Array\n(\n => 202.47.44.135\n)\n\n => Array\n(\n => 182.179.172.27\n)\n\n => Array\n(\n => 185.22.173.86\n)\n\n => Array\n(\n => 67.205.148.219\n)\n\n => Array\n(\n => 27.58.183.140\n)\n\n => Array\n(\n => 39.42.118.163\n)\n\n => Array\n(\n => 117.5.204.59\n)\n\n => Array\n(\n => 223.182.193.163\n)\n\n => Array\n(\n => 157.37.184.33\n)\n\n => Array\n(\n => 110.37.218.92\n)\n\n => Array\n(\n => 106.215.8.67\n)\n\n => Array\n(\n => 39.42.94.179\n)\n\n => Array\n(\n => 106.51.25.124\n)\n\n => Array\n(\n => 157.42.25.212\n)\n\n => Array\n(\n => 43.247.40.170\n)\n\n => Array\n(\n => 101.50.108.111\n)\n\n => Array\n(\n => 117.102.48.152\n)\n\n => Array\n(\n => 95.142.120.48\n)\n\n => Array\n(\n => 183.81.121.160\n)\n\n => Array\n(\n => 42.111.21.195\n)\n\n => Array\n(\n => 50.7.142.180\n)\n\n => Array\n(\n => 223.130.28.33\n)\n\n => Array\n(\n => 107.161.86.141\n)\n\n => Array\n(\n => 117.203.249.159\n)\n\n => Array\n(\n => 110.225.192.64\n)\n\n => Array\n(\n => 157.37.152.168\n)\n\n => Array\n(\n => 110.39.2.202\n)\n\n => Array\n(\n => 23.106.56.52\n)\n\n => Array\n(\n => 59.150.87.85\n)\n\n => Array\n(\n => 122.162.175.128\n)\n\n => Array\n(\n => 39.40.63.182\n)\n\n => Array\n(\n => 182.190.108.76\n)\n\n => Array\n(\n => 49.36.44.216\n)\n\n => Array\n(\n => 73.105.5.185\n)\n\n => Array\n(\n => 157.33.67.204\n)\n\n => Array\n(\n => 157.37.164.171\n)\n\n => Array\n(\n => 192.119.160.21\n)\n\n => Array\n(\n => 156.146.59.29\n)\n\n => Array\n(\n => 182.190.97.213\n)\n\n => Array\n(\n => 39.53.196.168\n)\n\n => Array\n(\n => 112.196.132.93\n)\n\n => Array\n(\n => 182.189.7.18\n)\n\n => Array\n(\n => 101.53.232.117\n)\n\n => Array\n(\n => 43.242.178.105\n)\n\n => Array\n(\n => 49.145.233.44\n)\n\n => Array\n(\n => 5.107.214.18\n)\n\n => Array\n(\n => 139.5.242.124\n)\n\n => Array\n(\n => 47.29.244.80\n)\n\n => Array\n(\n => 43.242.178.180\n)\n\n => Array\n(\n => 194.110.84.171\n)\n\n => Array\n(\n => 103.68.217.99\n)\n\n => Array\n(\n => 182.182.27.59\n)\n\n => Array\n(\n => 119.152.139.146\n)\n\n => Array\n(\n => 39.37.131.1\n)\n\n => Array\n(\n => 106.210.99.47\n)\n\n => Array\n(\n => 103.225.176.68\n)\n\n => Array\n(\n => 42.111.23.67\n)\n\n => Array\n(\n => 223.225.37.57\n)\n\n => Array\n(\n => 114.79.1.247\n)\n\n => Array\n(\n => 157.42.28.39\n)\n\n => Array\n(\n => 47.15.13.68\n)\n\n => Array\n(\n => 223.230.151.59\n)\n\n => Array\n(\n => 115.186.7.112\n)\n\n => Array\n(\n => 111.92.78.33\n)\n\n => Array\n(\n => 119.160.117.249\n)\n\n => Array\n(\n => 103.150.209.45\n)\n\n => Array\n(\n => 182.189.22.170\n)\n\n => Array\n(\n => 49.144.108.82\n)\n\n => Array\n(\n => 39.49.75.65\n)\n\n => Array\n(\n => 39.52.205.223\n)\n\n => Array\n(\n => 49.48.247.53\n)\n\n => Array\n(\n => 5.149.250.222\n)\n\n => Array\n(\n => 47.15.187.153\n)\n\n => Array\n(\n => 103.70.86.101\n)\n\n => Array\n(\n => 112.196.158.138\n)\n\n => Array\n(\n => 156.241.242.139\n)\n\n => Array\n(\n => 157.33.205.213\n)\n\n => Array\n(\n => 39.53.206.247\n)\n\n => Array\n(\n => 157.45.83.132\n)\n\n => Array\n(\n => 49.36.220.138\n)\n\n => Array\n(\n => 202.47.47.118\n)\n\n => Array\n(\n => 182.185.233.224\n)\n\n => Array\n(\n => 182.189.30.99\n)\n\n => Array\n(\n => 223.233.68.178\n)\n\n => Array\n(\n => 161.35.139.87\n)\n\n => Array\n(\n => 121.46.65.124\n)\n\n => Array\n(\n => 5.195.154.87\n)\n\n => Array\n(\n => 103.46.236.71\n)\n\n => Array\n(\n => 195.114.147.119\n)\n\n => Array\n(\n => 195.85.219.35\n)\n\n => Array\n(\n => 111.119.183.34\n)\n\n => Array\n(\n => 39.34.158.41\n)\n\n => Array\n(\n => 180.178.148.13\n)\n\n => Array\n(\n => 122.161.66.166\n)\n\n => Array\n(\n => 185.233.18.1\n)\n\n => Array\n(\n => 146.196.34.119\n)\n\n => Array\n(\n => 27.6.253.159\n)\n\n => Array\n(\n => 198.8.92.156\n)\n\n => Array\n(\n => 106.206.179.160\n)\n\n => Array\n(\n => 202.164.133.53\n)\n\n => Array\n(\n => 112.196.141.214\n)\n\n => Array\n(\n => 95.135.15.148\n)\n\n => Array\n(\n => 111.92.119.165\n)\n\n => Array\n(\n => 84.17.34.18\n)\n\n => Array\n(\n => 49.36.232.117\n)\n\n => Array\n(\n => 122.180.235.92\n)\n\n => Array\n(\n => 89.187.163.177\n)\n\n => Array\n(\n => 103.217.238.38\n)\n\n => Array\n(\n => 103.163.248.115\n)\n\n => Array\n(\n => 156.146.59.10\n)\n\n => Array\n(\n => 223.233.68.183\n)\n\n => Array\n(\n => 103.12.198.92\n)\n\n => Array\n(\n => 42.111.9.221\n)\n\n => Array\n(\n => 111.92.77.242\n)\n\n => Array\n(\n => 192.142.128.26\n)\n\n => Array\n(\n => 182.69.195.139\n)\n\n => Array\n(\n => 103.209.83.110\n)\n\n => Array\n(\n => 207.244.71.80\n)\n\n => Array\n(\n => 41.140.106.29\n)\n\n => Array\n(\n => 45.118.167.65\n)\n\n => Array\n(\n => 45.118.167.70\n)\n\n => Array\n(\n => 157.37.159.180\n)\n\n => Array\n(\n => 103.217.178.194\n)\n\n => Array\n(\n => 27.255.165.94\n)\n\n => Array\n(\n => 45.133.7.42\n)\n\n => Array\n(\n => 43.230.65.168\n)\n\n => Array\n(\n => 39.53.196.221\n)\n\n => Array\n(\n => 42.111.17.83\n)\n\n => Array\n(\n => 110.39.12.34\n)\n\n => Array\n(\n => 45.118.158.169\n)\n\n => Array\n(\n => 202.142.110.165\n)\n\n => Array\n(\n => 106.201.13.212\n)\n\n => Array\n(\n => 103.211.14.94\n)\n\n => Array\n(\n => 160.202.37.105\n)\n\n => Array\n(\n => 103.99.199.34\n)\n\n => Array\n(\n => 183.83.45.104\n)\n\n => Array\n(\n => 49.36.233.107\n)\n\n => Array\n(\n => 182.68.21.51\n)\n\n => Array\n(\n => 110.227.93.182\n)\n\n => Array\n(\n => 180.178.144.251\n)\n\n => Array\n(\n => 129.0.102.0\n)\n\n => Array\n(\n => 124.253.105.176\n)\n\n => Array\n(\n => 105.156.139.225\n)\n\n => Array\n(\n => 208.117.87.154\n)\n\n => Array\n(\n => 138.68.185.17\n)\n\n => Array\n(\n => 43.247.41.207\n)\n\n => Array\n(\n => 49.156.106.105\n)\n\n => Array\n(\n => 223.238.197.124\n)\n\n => Array\n(\n => 202.47.39.96\n)\n\n => Array\n(\n => 223.226.131.80\n)\n\n => Array\n(\n => 122.161.48.139\n)\n\n => Array\n(\n => 106.201.144.12\n)\n\n => Array\n(\n => 122.178.223.244\n)\n\n => Array\n(\n => 195.181.164.65\n)\n\n => Array\n(\n => 106.195.12.187\n)\n\n => Array\n(\n => 124.253.48.48\n)\n\n => Array\n(\n => 103.140.30.214\n)\n\n => Array\n(\n => 180.178.147.132\n)\n\n => Array\n(\n => 138.197.139.130\n)\n\n => Array\n(\n => 5.254.2.138\n)\n\n => Array\n(\n => 183.81.93.25\n)\n\n => Array\n(\n => 182.70.39.254\n)\n\n => Array\n(\n => 106.223.87.131\n)\n\n => Array\n(\n => 106.203.91.114\n)\n\n => Array\n(\n => 196.70.137.128\n)\n\n => Array\n(\n => 150.242.62.167\n)\n\n => Array\n(\n => 184.170.243.198\n)\n\n => Array\n(\n => 59.89.30.66\n)\n\n => Array\n(\n => 49.156.112.201\n)\n\n => Array\n(\n => 124.29.212.168\n)\n\n => Array\n(\n => 103.204.170.238\n)\n\n => Array\n(\n => 124.253.116.81\n)\n\n => Array\n(\n => 41.248.102.107\n)\n\n => Array\n(\n => 119.160.100.51\n)\n\n => Array\n(\n => 5.254.40.91\n)\n\n => Array\n(\n => 103.149.154.25\n)\n\n => Array\n(\n => 103.70.41.28\n)\n\n => Array\n(\n => 103.151.234.42\n)\n\n => Array\n(\n => 39.37.142.107\n)\n\n => Array\n(\n => 27.255.186.115\n)\n\n => Array\n(\n => 49.15.193.151\n)\n\n => Array\n(\n => 103.201.146.115\n)\n\n => Array\n(\n => 223.228.177.70\n)\n\n => Array\n(\n => 182.179.141.37\n)\n\n => Array\n(\n => 110.172.131.126\n)\n\n => Array\n(\n => 45.116.232.0\n)\n\n => Array\n(\n => 193.37.32.206\n)\n\n => Array\n(\n => 119.152.62.246\n)\n\n => Array\n(\n => 180.178.148.228\n)\n\n => Array\n(\n => 195.114.145.120\n)\n\n => Array\n(\n => 122.160.49.194\n)\n\n => Array\n(\n => 103.240.237.17\n)\n\n => Array\n(\n => 103.75.245.238\n)\n\n => Array\n(\n => 124.253.215.148\n)\n\n => Array\n(\n => 45.118.165.146\n)\n\n => Array\n(\n => 103.75.244.111\n)\n\n => Array\n(\n => 223.185.7.42\n)\n\n => Array\n(\n => 139.5.240.165\n)\n\n => Array\n(\n => 45.251.117.204\n)\n\n => Array\n(\n => 132.154.71.227\n)\n\n => Array\n(\n => 178.92.100.97\n)\n\n => Array\n(\n => 49.48.248.42\n)\n\n => Array\n(\n => 182.190.109.252\n)\n\n => Array\n(\n => 43.231.57.209\n)\n\n => Array\n(\n => 39.37.185.133\n)\n\n => Array\n(\n => 123.17.79.174\n)\n\n => Array\n(\n => 180.178.146.215\n)\n\n => Array\n(\n => 41.248.83.40\n)\n\n => Array\n(\n => 103.255.4.79\n)\n\n => Array\n(\n => 103.39.119.233\n)\n\n => Array\n(\n => 85.203.44.24\n)\n\n => Array\n(\n => 93.74.18.246\n)\n\n => Array\n(\n => 95.142.120.51\n)\n\n => Array\n(\n => 202.47.42.57\n)\n\n => Array\n(\n => 41.202.219.253\n)\n\n => Array\n(\n => 154.28.188.182\n)\n\n => Array\n(\n => 14.163.178.106\n)\n\n => Array\n(\n => 118.185.57.226\n)\n\n => Array\n(\n => 49.15.141.102\n)\n\n => Array\n(\n => 182.189.86.47\n)\n\n => Array\n(\n => 111.88.68.79\n)\n\n => Array\n(\n => 156.146.59.8\n)\n\n => Array\n(\n => 119.152.62.82\n)\n\n => Array\n(\n => 49.207.128.103\n)\n\n => Array\n(\n => 203.212.30.234\n)\n\n => Array\n(\n => 41.202.219.254\n)\n\n => Array\n(\n => 103.46.203.10\n)\n\n => Array\n(\n => 112.79.141.15\n)\n\n => Array\n(\n => 103.68.218.75\n)\n\n => Array\n(\n => 49.35.130.14\n)\n\n => Array\n(\n => 172.247.129.90\n)\n\n => Array\n(\n => 116.90.74.214\n)\n\n => Array\n(\n => 180.178.142.242\n)\n\n => Array\n(\n => 111.119.183.59\n)\n\n => Array\n(\n => 117.5.103.189\n)\n\n => Array\n(\n => 203.110.93.146\n)\n\n => Array\n(\n => 188.163.97.86\n)\n\n => Array\n(\n => 124.253.90.47\n)\n\n => Array\n(\n => 139.167.249.160\n)\n\n => Array\n(\n => 103.226.206.55\n)\n\n => Array\n(\n => 154.28.188.191\n)\n\n => Array\n(\n => 182.190.197.205\n)\n\n => Array\n(\n => 111.119.183.33\n)\n\n => Array\n(\n => 14.253.254.64\n)\n\n => Array\n(\n => 117.237.197.246\n)\n\n => Array\n(\n => 172.105.53.82\n)\n\n => Array\n(\n => 124.253.207.164\n)\n\n => Array\n(\n => 103.255.4.33\n)\n\n => Array\n(\n => 27.63.131.206\n)\n\n => Array\n(\n => 103.118.170.99\n)\n\n => Array\n(\n => 111.119.183.55\n)\n\n => Array\n(\n => 14.182.101.109\n)\n\n => Array\n(\n => 175.107.223.199\n)\n\n => Array\n(\n => 39.57.168.94\n)\n\n => Array\n(\n => 122.182.213.139\n)\n\n => Array\n(\n => 112.79.214.237\n)\n\n => Array\n(\n => 27.6.252.22\n)\n\n => Array\n(\n => 89.163.212.83\n)\n\n => Array\n(\n => 182.189.23.1\n)\n\n => Array\n(\n => 49.15.222.253\n)\n\n => Array\n(\n => 125.63.97.110\n)\n\n => Array\n(\n => 223.233.65.159\n)\n\n => Array\n(\n => 139.99.159.18\n)\n\n => Array\n(\n => 45.118.165.137\n)\n\n => Array\n(\n => 39.52.2.167\n)\n\n => Array\n(\n => 39.57.141.24\n)\n\n => Array\n(\n => 27.5.32.145\n)\n\n => Array\n(\n => 49.36.212.33\n)\n\n => Array\n(\n => 157.33.218.32\n)\n\n => Array\n(\n => 116.71.4.122\n)\n\n => Array\n(\n => 110.93.244.176\n)\n\n => Array\n(\n => 154.73.203.156\n)\n\n => Array\n(\n => 136.158.30.235\n)\n\n => Array\n(\n => 122.161.53.72\n)\n\n => Array\n(\n => 106.203.203.156\n)\n\n => Array\n(\n => 45.133.7.22\n)\n\n => Array\n(\n => 27.255.180.69\n)\n\n => Array\n(\n => 94.46.244.3\n)\n\n => Array\n(\n => 43.242.178.157\n)\n\n => Array\n(\n => 171.79.189.215\n)\n\n => Array\n(\n => 37.117.141.89\n)\n\n => Array\n(\n => 196.92.32.64\n)\n\n => Array\n(\n => 154.73.203.157\n)\n\n => Array\n(\n => 183.83.176.14\n)\n\n => Array\n(\n => 106.215.84.145\n)\n\n => Array\n(\n => 95.142.120.12\n)\n\n => Array\n(\n => 190.232.110.94\n)\n\n => Array\n(\n => 179.6.194.47\n)\n\n => Array\n(\n => 103.62.155.172\n)\n\n => Array\n(\n => 39.34.156.177\n)\n\n => Array\n(\n => 122.161.49.120\n)\n\n => Array\n(\n => 103.58.155.253\n)\n\n => Array\n(\n => 175.107.226.20\n)\n\n => Array\n(\n => 206.81.28.165\n)\n\n => Array\n(\n => 49.36.216.36\n)\n\n => Array\n(\n => 104.223.95.178\n)\n\n => Array\n(\n => 122.177.69.35\n)\n\n => Array\n(\n => 39.57.163.107\n)\n\n => Array\n(\n => 122.161.53.35\n)\n\n => Array\n(\n => 182.190.102.13\n)\n\n => Array\n(\n => 122.161.68.95\n)\n\n => Array\n(\n => 154.73.203.147\n)\n\n => Array\n(\n => 122.173.125.2\n)\n\n => Array\n(\n => 117.96.140.189\n)\n\n => Array\n(\n => 106.200.244.10\n)\n\n => Array\n(\n => 110.36.202.5\n)\n\n => Array\n(\n => 124.253.51.144\n)\n\n => Array\n(\n => 176.100.1.145\n)\n\n => Array\n(\n => 156.146.59.20\n)\n\n => Array\n(\n => 122.176.100.151\n)\n\n => Array\n(\n => 185.217.117.237\n)\n\n => Array\n(\n => 49.37.223.97\n)\n\n => Array\n(\n => 101.50.108.80\n)\n\n => Array\n(\n => 124.253.155.88\n)\n\n => Array\n(\n => 39.40.208.96\n)\n\n => Array\n(\n => 122.167.151.154\n)\n\n => Array\n(\n => 172.98.89.13\n)\n\n => Array\n(\n => 103.91.52.6\n)\n\n => Array\n(\n => 106.203.84.5\n)\n\n => Array\n(\n => 117.216.221.34\n)\n\n => Array\n(\n => 154.73.203.131\n)\n\n => Array\n(\n => 223.182.210.117\n)\n\n => Array\n(\n => 49.36.185.208\n)\n\n => Array\n(\n => 111.119.183.30\n)\n\n => Array\n(\n => 39.42.107.13\n)\n\n => Array\n(\n => 39.40.15.174\n)\n\n => Array\n(\n => 1.38.244.65\n)\n\n => Array\n(\n => 49.156.75.252\n)\n\n => Array\n(\n => 122.161.51.99\n)\n\n => Array\n(\n => 27.73.78.57\n)\n\n => Array\n(\n => 49.48.228.70\n)\n\n => Array\n(\n => 111.119.183.18\n)\n\n => Array\n(\n => 116.204.252.218\n)\n\n => Array\n(\n => 73.173.40.248\n)\n\n => Array\n(\n => 223.130.28.81\n)\n\n => Array\n(\n => 202.83.58.81\n)\n\n => Array\n(\n => 45.116.233.31\n)\n\n => Array\n(\n => 111.119.183.1\n)\n\n => Array\n(\n => 45.133.7.66\n)\n\n => Array\n(\n => 39.48.204.174\n)\n\n => Array\n(\n => 37.19.213.30\n)\n\n => Array\n(\n => 111.119.183.22\n)\n\n => Array\n(\n => 122.177.74.19\n)\n\n => Array\n(\n => 124.253.80.59\n)\n\n => Array\n(\n => 111.119.183.60\n)\n\n => Array\n(\n => 157.39.106.191\n)\n\n => Array\n(\n => 157.47.86.121\n)\n\n => Array\n(\n => 47.31.159.100\n)\n\n => Array\n(\n => 106.214.85.144\n)\n\n => Array\n(\n => 182.189.22.197\n)\n\n => Array\n(\n => 111.119.183.51\n)\n\n => Array\n(\n => 202.47.35.57\n)\n\n => Array\n(\n => 42.108.33.220\n)\n\n => Array\n(\n => 180.178.146.158\n)\n\n => Array\n(\n => 124.253.184.239\n)\n\n => Array\n(\n => 103.165.20.8\n)\n\n => Array\n(\n => 94.178.239.156\n)\n\n => Array\n(\n => 72.255.41.142\n)\n\n => Array\n(\n => 116.90.107.102\n)\n\n => Array\n(\n => 39.36.164.250\n)\n\n => Array\n(\n => 124.253.195.172\n)\n\n => Array\n(\n => 203.142.218.149\n)\n\n => Array\n(\n => 157.43.165.180\n)\n\n => Array\n(\n => 39.40.242.57\n)\n\n => Array\n(\n => 103.92.43.150\n)\n\n => Array\n(\n => 39.42.133.202\n)\n\n => Array\n(\n => 119.160.66.11\n)\n\n => Array\n(\n => 138.68.3.7\n)\n\n => Array\n(\n => 210.56.125.226\n)\n\n => Array\n(\n => 157.50.4.249\n)\n\n => Array\n(\n => 124.253.81.162\n)\n\n => Array\n(\n => 103.240.235.141\n)\n\n => Array\n(\n => 132.154.128.20\n)\n\n => Array\n(\n => 49.156.115.37\n)\n\n => Array\n(\n => 45.133.7.48\n)\n\n => Array\n(\n => 122.161.49.137\n)\n\n => Array\n(\n => 202.47.46.31\n)\n\n => Array\n(\n => 192.140.145.148\n)\n\n => Array\n(\n => 202.14.123.10\n)\n\n => Array\n(\n => 122.161.53.98\n)\n\n => Array\n(\n => 124.253.114.113\n)\n\n => Array\n(\n => 103.227.70.34\n)\n\n => Array\n(\n => 223.228.175.227\n)\n\n => Array\n(\n => 157.39.119.110\n)\n\n => Array\n(\n => 180.188.224.231\n)\n\n => Array\n(\n => 132.154.188.85\n)\n\n => Array\n(\n => 197.210.227.207\n)\n\n => Array\n(\n => 103.217.123.177\n)\n\n => Array\n(\n => 124.253.85.31\n)\n\n => Array\n(\n => 123.201.105.97\n)\n\n => Array\n(\n => 39.57.190.37\n)\n\n => Array\n(\n => 202.63.205.248\n)\n\n => Array\n(\n => 122.161.51.100\n)\n\n => Array\n(\n => 39.37.163.97\n)\n\n => Array\n(\n => 43.231.57.173\n)\n\n => Array\n(\n => 223.225.135.169\n)\n\n => Array\n(\n => 119.160.71.136\n)\n\n => Array\n(\n => 122.165.114.93\n)\n\n => Array\n(\n => 47.11.77.102\n)\n\n => Array\n(\n => 49.149.107.198\n)\n\n => Array\n(\n => 192.111.134.206\n)\n\n => Array\n(\n => 182.64.102.43\n)\n\n => Array\n(\n => 124.253.184.111\n)\n\n => Array\n(\n => 171.237.97.228\n)\n\n => Array\n(\n => 117.237.237.101\n)\n\n => Array\n(\n => 49.36.33.19\n)\n\n => Array\n(\n => 103.31.101.241\n)\n\n => Array\n(\n => 129.0.207.203\n)\n\n => Array\n(\n => 157.39.122.155\n)\n\n => Array\n(\n => 197.210.85.120\n)\n\n => Array\n(\n => 124.253.219.201\n)\n\n => Array\n(\n => 152.57.75.92\n)\n\n => Array\n(\n => 169.149.195.121\n)\n\n => Array\n(\n => 198.16.76.27\n)\n\n => Array\n(\n => 157.43.192.188\n)\n\n => Array\n(\n => 119.155.244.221\n)\n\n => Array\n(\n => 39.51.242.216\n)\n\n => Array\n(\n => 39.57.180.158\n)\n\n => Array\n(\n => 134.202.32.5\n)\n\n => Array\n(\n => 122.176.139.205\n)\n\n => Array\n(\n => 151.243.50.9\n)\n\n => Array\n(\n => 39.52.99.161\n)\n\n => Array\n(\n => 136.144.33.95\n)\n\n => Array\n(\n => 157.37.205.216\n)\n\n => Array\n(\n => 217.138.220.134\n)\n\n => Array\n(\n => 41.140.106.65\n)\n\n => Array\n(\n => 39.37.253.126\n)\n\n => Array\n(\n => 103.243.44.240\n)\n\n => Array\n(\n => 157.46.169.29\n)\n\n => Array\n(\n => 92.119.177.122\n)\n\n => Array\n(\n => 196.240.60.21\n)\n\n => Array\n(\n => 122.161.6.246\n)\n\n => Array\n(\n => 117.202.162.46\n)\n\n => Array\n(\n => 205.164.137.120\n)\n\n => Array\n(\n => 171.237.79.241\n)\n\n => Array\n(\n => 198.16.76.28\n)\n\n => Array\n(\n => 103.100.4.151\n)\n\n => Array\n(\n => 178.239.162.236\n)\n\n => Array\n(\n => 106.197.31.240\n)\n\n => Array\n(\n => 122.168.179.251\n)\n\n => Array\n(\n => 39.37.167.126\n)\n\n => Array\n(\n => 171.48.8.115\n)\n\n => Array\n(\n => 157.44.152.14\n)\n\n => Array\n(\n => 103.77.43.219\n)\n\n => Array\n(\n => 122.161.49.38\n)\n\n => Array\n(\n => 122.161.52.83\n)\n\n => Array\n(\n => 122.173.108.210\n)\n\n => Array\n(\n => 60.254.109.92\n)\n\n => Array\n(\n => 103.57.85.75\n)\n\n => Array\n(\n => 106.0.58.36\n)\n\n => Array\n(\n => 122.161.49.212\n)\n\n => Array\n(\n => 27.255.182.159\n)\n\n => Array\n(\n => 116.75.230.159\n)\n\n => Array\n(\n => 122.173.152.133\n)\n\n => Array\n(\n => 129.0.79.247\n)\n\n => Array\n(\n => 223.228.163.44\n)\n\n => Array\n(\n => 103.168.78.82\n)\n\n => Array\n(\n => 39.59.67.124\n)\n\n => Array\n(\n => 182.69.19.120\n)\n\n => Array\n(\n => 196.202.236.195\n)\n\n => Array\n(\n => 137.59.225.206\n)\n\n => Array\n(\n => 143.110.209.194\n)\n\n => Array\n(\n => 117.201.233.91\n)\n\n => Array\n(\n => 37.120.150.107\n)\n\n => Array\n(\n => 58.65.222.10\n)\n\n => Array\n(\n => 202.47.43.86\n)\n\n => Array\n(\n => 106.206.223.234\n)\n\n => Array\n(\n => 5.195.153.158\n)\n\n => Array\n(\n => 223.227.127.243\n)\n\n => Array\n(\n => 103.165.12.222\n)\n\n => Array\n(\n => 49.36.185.189\n)\n\n => Array\n(\n => 59.96.92.57\n)\n\n => Array\n(\n => 203.194.104.235\n)\n\n => Array\n(\n => 122.177.72.33\n)\n\n => Array\n(\n => 106.213.126.40\n)\n\n => Array\n(\n => 45.127.232.69\n)\n\n => Array\n(\n => 156.146.59.39\n)\n\n => Array\n(\n => 103.21.184.11\n)\n\n => Array\n(\n => 106.212.47.59\n)\n\n => Array\n(\n => 182.179.137.235\n)\n\n => Array\n(\n => 49.36.178.154\n)\n\n => Array\n(\n => 171.48.7.128\n)\n\n => Array\n(\n => 119.160.57.96\n)\n\n => Array\n(\n => 197.210.79.92\n)\n\n => Array\n(\n => 36.255.45.87\n)\n\n => Array\n(\n => 47.31.219.47\n)\n\n => Array\n(\n => 122.161.51.160\n)\n\n => Array\n(\n => 103.217.123.129\n)\n\n => Array\n(\n => 59.153.16.12\n)\n\n => Array\n(\n => 103.92.43.226\n)\n\n => Array\n(\n => 47.31.139.139\n)\n\n => Array\n(\n => 210.2.140.18\n)\n\n => Array\n(\n => 106.210.33.219\n)\n\n => Array\n(\n => 175.107.203.34\n)\n\n => Array\n(\n => 146.196.32.144\n)\n\n => Array\n(\n => 103.12.133.121\n)\n\n => Array\n(\n => 103.59.208.182\n)\n\n => Array\n(\n => 157.37.190.232\n)\n\n => Array\n(\n => 106.195.35.201\n)\n\n => Array\n(\n => 27.122.14.83\n)\n\n => Array\n(\n => 194.193.44.5\n)\n\n => Array\n(\n => 5.62.43.245\n)\n\n => Array\n(\n => 103.53.80.50\n)\n\n => Array\n(\n => 47.29.142.233\n)\n\n => Array\n(\n => 154.6.20.63\n)\n\n => Array\n(\n => 173.245.203.128\n)\n\n => Array\n(\n => 103.77.43.231\n)\n\n => Array\n(\n => 5.107.166.235\n)\n\n => Array\n(\n => 106.212.44.123\n)\n\n => Array\n(\n => 157.41.60.93\n)\n\n => Array\n(\n => 27.58.179.79\n)\n\n => Array\n(\n => 157.37.167.144\n)\n\n => Array\n(\n => 119.160.57.115\n)\n\n => Array\n(\n => 122.161.53.224\n)\n\n => Array\n(\n => 49.36.233.51\n)\n\n => Array\n(\n => 101.0.32.8\n)\n\n => Array\n(\n => 119.160.103.158\n)\n\n => Array\n(\n => 122.177.79.115\n)\n\n => Array\n(\n => 107.181.166.27\n)\n\n => Array\n(\n => 183.6.0.125\n)\n\n => Array\n(\n => 49.36.186.0\n)\n\n => Array\n(\n => 202.181.5.4\n)\n\n => Array\n(\n => 45.118.165.144\n)\n\n => Array\n(\n => 171.96.157.133\n)\n\n => Array\n(\n => 222.252.51.163\n)\n\n => Array\n(\n => 103.81.215.162\n)\n\n => Array\n(\n => 110.225.93.208\n)\n\n => Array\n(\n => 122.161.48.200\n)\n\n => Array\n(\n => 119.63.138.173\n)\n\n => Array\n(\n => 202.83.58.208\n)\n\n => Array\n(\n => 122.161.53.101\n)\n\n => Array\n(\n => 137.97.95.21\n)\n\n => Array\n(\n => 112.204.167.123\n)\n\n => Array\n(\n => 122.180.21.151\n)\n\n => Array\n(\n => 103.120.44.108\n)\n\n => Array\n(\n => 49.37.220.174\n)\n\n => Array\n(\n => 1.55.255.124\n)\n\n => Array\n(\n => 23.227.140.173\n)\n\n => Array\n(\n => 43.248.153.110\n)\n\n => Array\n(\n => 106.214.93.101\n)\n\n => Array\n(\n => 103.83.149.36\n)\n\n => Array\n(\n => 103.217.123.57\n)\n\n => Array\n(\n => 193.9.113.119\n)\n\n => Array\n(\n => 14.182.57.204\n)\n\n => Array\n(\n => 117.201.231.0\n)\n\n => Array\n(\n => 14.99.198.186\n)\n\n => Array\n(\n => 36.255.44.204\n)\n\n => Array\n(\n => 103.160.236.42\n)\n\n => Array\n(\n => 31.202.16.116\n)\n\n => Array\n(\n => 223.239.49.201\n)\n\n => Array\n(\n => 122.161.102.149\n)\n\n => Array\n(\n => 117.196.123.184\n)\n\n => Array\n(\n => 49.205.112.105\n)\n\n => Array\n(\n => 103.244.176.201\n)\n\n => Array\n(\n => 95.216.15.219\n)\n\n)\n```\nArchive for June, 2020: My English Castle's Personal Finance Blog\n Layout: Blue and Brown (Default) Author's Creation\n Home > Archive: June, 2020\n\n# Archive for June, 2020\n\n## Looking for Oomph\n\nJune 23rd, 2020 at 01:52 pm\n\nI'm am certainly in need of some oomph. While I'm getting some things done, I am certainly lacking focus. I've always been a person who works better with fewer distractions, and the distractions of the house are starting to erode my focus- along with all the underlying issues going on in the world. But I guess all you can do is keep on keeping on.\n\nI made a list last night that includes a walk, the treadmill, a visit to a framing shop, and the garden center as well as several hours of work. I bought gas and dog food as well as posted DD's British passport application. We also went to the very empty library where I was impressed by their protocols. It was great to get new books which I hope will improve my focus. Laundry done too as well as a new dish--kohlrabi fritters. What to try today? Oomph updates as we go.\n\n## Quiet but Beautiful Weekend\n\nJune 22nd, 2020 at 01:24 am\n\nWhat a beautiful June it's been. My garden is doing well and the greenery is so gorgeous. I love June.\nWe had a quiet weekend, and today our DD has gone back to her work as a grocery checker at the small convenience store near us. She hasn't been in since March but it seems they have good safety guidelines in place, so she was eager to go back. Just four hours today.\nI bought a few books, but we still have a lot of food, especially with the CSA delivery. Not much else new.\n\nI need to do some serious work this week planning for fall. Happy Father's Day to all the dads in your lives!\n\n## Non-News News?\n\nJune 19th, 2020 at 05:21 pm\n\nOur state university system has made a big fanfare about how campuses are re-opening. Yes, we're moving students into dorms in the fall. Yes, some classes will be held face to face. How many? I don't have a hard figure yet, but I would be surprised of the hundreds of classes offered by my department if more than one or two are face to face. It has to be this way. We don't have enough room to make socially distanced classes across the board. We will have a very hard time monitoring student behavior. But we've got to keep the machine running. Everyone I know has been sharpening their skills to teach online--classes, seminars, practicums. I seem to be both relieved and disappointed at the same time. This will be the first fall in over 20 years without me saying \"Welcome to English...\" in front of a classroom. But there's work to do, and we'll do the best we can.\n\nIn other news, I cashed \\$10 out of Mypoints which went into the UK house fund. I picked up the first CSA delivery which was heavenly. We now have wonderful greens, maple syrup, green onions, and the first darn kohlrabi of the season. No spending for days here.\n\nEnjoy another lovely--though plenty hot--June day.\n\n## A Few Things Purchased\n\nJune 15th, 2020 at 03:40 am\n\nI spent some cash at a friend's online Pampered Chef party. I don't know her all that well as she's really a friend of a friend,, but she's a single mom who has been furloughed from her job. And I like nice kitchen things so I googled \"Best Pampered Chef\" products and bought a few things.\n\nWe also spent about \\$100 yesterday on getting a new British passport for our daughter. And she's going \"up north\" with friends for a few days to a friend's cabin before she starts working again next weekend.\n\nI always read the unclaimed property listings in the paper hoping to discover a windfall, but I did find a good friend's name listed. I messaged her, and to her great surprise she had \\$77 coming from a phone refund. She's promised to buy me a patio margarita when the check arrives.\n\nStill no word from the university, but I expect to hear plans this week.\n\n## Peaceful Sunday\n\nJune 7th, 2020 at 05:48 pm\n\nWe're having a quiet Sunday and cool beautiful weather. We had dinner with a friend last night. I was hesitant but I think we did it mostly right. We did have shared food, but she lives alone and we ate and sat outside on her deck. She is an attorney in private practice and I don't think she's seen anybody in months. I hope it was ok, and it sure was a mood lifter.\n\nToday was supposed to be our DD's high school graduation so it's a bittersweet day around here. We've ordered a cake for tomorrow, and will be celebrating in bits and pieces all summer, I guess.\n\nAfter a big Costco shop on Thursday, we're set for a long time. I'll be glad when the CSA starts as mostly I'm buying produce and eggs and milk.\n\nNot a lot of money news; we've been donating to food pantries and social service organizations. Some things I ordered online have been delayed including live plants, so I expect that will be a mess to untangle. This should also be an interesting week for work; I expect some sort of announcement from the university about fall classes. Better grab the peaceful Sunday while I can. Wishing you all the same.\n\n## Hot Day Progress\n\nJune 4th, 2020 at 01:45 am\n\nNot a lot of real money news, but we've been good on the decluttering front. DD and I watched some Marie Kondo videos and sorted though most of her clothes. One big box went to the charity shop today as well as a big plastic bin. I found a place about 20 minutes south of us that recycles refrigerant so we dropped off the broken dehumidifier there, then masked up and went into Kohl's with a load of plastic bags for recycling. I boxed winter sweaters for the out of season closet, found some lavender soap given to us by the French exchange student last year, and stored them together.\n\nDD had her \"fake\" graduation pix taken this morning. Every senior had a five-minute slot for the cap and gown photo. They're still trying to schedule something for July.\n\nI see a Costco trip for fresh fruit and veggies tomorrow. We need a half dozen more things as we're still feeding us all 3X a day. Lots of food!\n\n## What is So Rare?\n\nJune 1st, 2020 at 04:16 pm\n\nIt is a day in June! Who knew we'd still be here in June?\n\nTackling that list is the focus of June here. Last night I listed and sold one of my DD's toy boxes. Are you saying, \"Hey, isn't that kid graduating from high school?\" Well, yes. But the \\$35 can go right into the college fund. I have another to list today, but it's a mere plastic bin, so I don't expect much for it.\n\nMy DH had an errand this morning at the university, so he's just packed up two boxes with old clothes and the contents of DD's toy boxes (with the exception of a teddy bear or two), and taken them to the contactless Goodwill drop off. Two boxes and a toy box gone is a triumph of bulky junk leaving.\n\nWhen scouting around for paint in the basement, I found some old dried up cans of latex paint which apparently can go right in the garbage and recycling. I managed to pry the paint out of both and rinsed out a jar with more latex in it.\n\nIt's cool today so the focus will be upstairs. I'll have a couple hours of university work every day too. We don't expect an announcement on fall classes for another two weeks, but that will be a big job when it happens.\n\nIn further money news, I see my online savings interest rate has dropped again, now to 1.15%. I think staying steady and stable through all that's going on is the best we can do." ]
[ null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.9828477,"math_prob":0.9990632,"size":14198,"snap":"2021-43-2021-49","text_gpt3_token_len":3367,"char_repetition_ratio":0.082992814,"word_repetition_ratio":0.93298584,"special_character_ratio":0.23292013,"punctuation_ratio":0.101768434,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9995451,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2021-10-25T07:32:00Z\",\"WARC-Record-ID\":\"<urn:uuid:e4423d54-f861-4aa4-901a-ee27b4145147>\",\"Content-Length\":\"441452\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:2e4c9f6d-c8ae-4d4b-90e7-335cc305f592>\",\"WARC-Concurrent-To\":\"<urn:uuid:4e2f133c-44da-47e5-824a-2ea90b3ce9c1>\",\"WARC-IP-Address\":\"173.231.200.26\",\"WARC-Target-URI\":\"https://myenglishcastle.savingadvice.com/2020/06/\",\"WARC-Payload-Digest\":\"sha1:Y5P6UZWCUDIM7JZUOVASUAUCKBXN6DWO\",\"WARC-Block-Digest\":\"sha1:VKFPCU46JOLBT5TSY52ABIJA5GZFHY5Q\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2021/CC-MAIN-2021-43/CC-MAIN-2021-43_segments_1634323587655.10_warc_CC-MAIN-20211025061300-20211025091300-00478.warc.gz\"}"}
https://build.se.informatik.uni-kiel.de/stu114708/TeeTime-AnomalyDetection/commit/6a880f31288f1b6b28f94b4bac5c9288b841c084
[ "### hopefully fixed issue with infinity weights on exponential weighted\n\n`forecaster`\nparent aa2f5379\n ... ... @@ -32,8 +32,9 @@ public class WeightedForecaster implements Forecaster { // more recent entry means more weight int position = 1; // Position > 0, because logarithmic forecast method int size = timeSeries.size(); for (TimeSeriesPoint point : timeSeries) { final double weight = getWeight(position); final double weight = getWeight(position, size); totalWeights += weight; weightedSum += point.getValue() * weight; position++; ... ... @@ -42,15 +43,14 @@ public class WeightedForecaster implements Forecaster { return weightedSum / totalWeights; } private double getWeight(final int position) { private double getWeight(final int position, final int size) { switch (this.weightMethod) { case LOGARITHMIC: return Math.log(position); case LINEAR: return position; case EXPONENTIAL: // TODO use position - numberOfElements to avoid Infinity return Math.exp(position); return Math.exp(position - size); default: return position; } ... ...\nMarkdown is supported\n0% or\nYou are about to add 0 people to the discussion. Proceed with caution.\nFinish editing this message first!\nPlease register or to comment" ]
[ null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.574201,"math_prob":0.977729,"size":1242,"snap":"2019-35-2019-39","text_gpt3_token_len":307,"char_repetition_ratio":0.16639742,"word_repetition_ratio":0.049079753,"special_character_ratio":0.27858293,"punctuation_ratio":0.24623115,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9541285,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2019-08-21T23:04:08Z\",\"WARC-Record-ID\":\"<urn:uuid:afa665c4-050a-4074-a52c-c6f2fab8a4bc>\",\"Content-Length\":\"83765\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:176a1266-e954-402d-a948-2891c6ec314a>\",\"WARC-Concurrent-To\":\"<urn:uuid:6d07eb1a-ff25-4d0b-a136-68282ee659da>\",\"WARC-IP-Address\":\"134.245.253.142\",\"WARC-Target-URI\":\"https://build.se.informatik.uni-kiel.de/stu114708/TeeTime-AnomalyDetection/commit/6a880f31288f1b6b28f94b4bac5c9288b841c084\",\"WARC-Payload-Digest\":\"sha1:ZUWMHDXLSLBJDPHMG6KRSWJSIFYKHYJZ\",\"WARC-Block-Digest\":\"sha1:3ACMXCDYXZ6DFLG6CIIZRK2VXVV7RWPZ\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2019/CC-MAIN-2019-35/CC-MAIN-2019-35_segments_1566027316549.78_warc_CC-MAIN-20190821220456-20190822002456-00247.warc.gz\"}"}
http://j-paine.org/pyfuncs.html
[ "# Some Python Functions\n\nThese are some simple Python functions I wrote or adapted for The Oxford Institute. The file as a `.py` is here.\n\n```# pyfuncs.py\n\nimport math\n#\n# For 'sqrt' in 'area'.\n\n# Greet someone by displaying \"Hello \", their name,\n# and an exclamation mark.\ndef greet( name ):\nprint( \"Hello \" + name + \"!\" )\n\n# As 'greet', but builds the complete message\n# in a variable and then displays that.\n#\ndef greet2( name ):\nmessage = \"Hello \" + name + \"!\"\nprint( message )\n\n# Returns the largest of three numbers.\n#\ndef largest( num1, num2, num3 ):\n\n# https://www.programiz.com/python-programming/examples/largest-number-three .\n\nif ( num1 >= num2 ) and ( num1 >= num3 ):\nlargest = num1\nelif ( num2 >= num1 ) and ( num2 >= num3 ):\nlargest = num2\nelse:\nlargest = num3\nreturn largest\n\n# Returns the area of the triangle with the\n# specified three sides.\n#\ndef area( a, b, c ):\n\n# https://www.programiz.com/python-programming/examples/area-triangle .\n# This calculates the area using Heron's formula,\n# explained in\n# https://en.wikipedia.org/wiki/Heron%27s_formula .\n\ns = (a + b + c) / 2.0\n# Calculates the semi-perimeter.\n# I've written 2.0 rather than 2, because otherwise\n# Python 2 will return an integer, giving the wrong\n# See https://stackoverflow.com/questions/2958684/python-division .\n\narea = math.sqrt( s * (s-a) * (s-b) * (s-c) )\n# Calculates the area.\n\nreturn area\n\n# Given a number of days, returns a list containing\n# the number of complete weeks, and the number of\n# days left over.\n#\ndef days_to_weeks( ndays ):\nnweeks = ndays // 7\nndays_left = ndays % 7\nreturn [ nweeks, ndays_left ]\n\n# Given a list of numbers, plots it as a graph\n# sideways on the console. Each number y is\n# plotted as (y-1) spaces followed by a star.\n# So for this to work well, the numbers need\n# to fit within the console linewidth. They\n# must also be integers.\n#\ndef plot( ys ):\n\n# https://stackoverflow.com/questions/20295646/python-ascii-plots-in-terminal .\n\nfor y in ys:\nline = ' '*(y-1) + '*'\nprint line\n\n# Tries 'plot' with some sample data. According to\n# the above link, this is basically ( sin(x)+1 )*20 .\n#\ndef try_plot():\nys = [20, 26, 32, 37, 39, 40, 38, 35, 30, 23, 17,\n10, 5, 2, 0, 1, 3, 8, 14, 20]\nplot( ys )\n\ndef count_words( filename ):\n\n# http://pythonforengineers.com/create-a-word-counter-in-python/ .\n\nf = open( filename, \"r\" )\nf.close()\n#\n# Read the text from the specified file.\n\nwords = data.split( ' ' )\n#\n# Split the data on spaces, giving a list.\n# The list isn't quite words, since some elements\n# will contain newlines as well. That doesn't\n# matter for this demo.\n\ncount = len( words )\n#\n# Get its length.\n\nreturn count\n```" ]
[ null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.78281033,"math_prob":0.8789829,"size":2700,"snap":"2020-10-2020-16","text_gpt3_token_len":770,"char_repetition_ratio":0.099406525,"word_repetition_ratio":0.018556701,"special_character_ratio":0.33888888,"punctuation_ratio":0.1928839,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.992941,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2020-02-19T05:19:03Z\",\"WARC-Record-ID\":\"<urn:uuid:65c1a11d-5946-4d7f-a82e-a490fa21a450>\",\"Content-Length\":\"3668\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:3db272d9-4b7b-4554-9d89-5604f16b7e63>\",\"WARC-Concurrent-To\":\"<urn:uuid:fa1e6852-6b29-4999-8cd5-df78d8f546e1>\",\"WARC-IP-Address\":\"93.93.130.166\",\"WARC-Target-URI\":\"http://j-paine.org/pyfuncs.html\",\"WARC-Payload-Digest\":\"sha1:L7ZJQFNFQYJ7JGGAE6SPQPCRO74BBXVA\",\"WARC-Block-Digest\":\"sha1:L4U7UEJ6QGEZ5NJU5REZXAL4AJMHTNFC\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2020/CC-MAIN-2020-10/CC-MAIN-2020-10_segments_1581875144027.33_warc_CC-MAIN-20200219030731-20200219060731-00337.warc.gz\"}"}
https://datascidani.com/2020/03/09/bar-charts-histograms-and-box-plots/
[ "## Bar Charts, Histograms, and Box Plots\n\nIn the last two posts (Creating Line Graphs and Creating Multiple Line Graphs), I went over creating line charts. To refresh your memory, a line chart is a type of plot used to visualize changes over time. In this post, I’ll go over three more plots that were part of the data visualization mission of DataQuest’s Data Analyst in R track: bar charts, histograms, and box plots.\n\nFor this post, I decided to continue with the Maryland Bridges data set I used in previous posts.\n\nSo without further ado, let’s get started!\n\n### Bar Charts\n\nBar charts represent grouped data summaries using bars with heights proportional to values of a summary variable such as average. Like line charts, bar charts depict the relationship between two variables. These charts have an x and y axes; The x-axis represents the independent variable while the y-axis represents the dependent variable.\n\nTo create a bar chart, I would need the same syntax for the data and aesthetics layers that I used to create line charts. However, this time I need the geom_bar() layer as this layer creates the bar chart.\n\nLet’s look at an example. I want to create a bar chart that shows the average daily traffic of Maryland bridges by county. As I did in my line chart post, I filtered the data, then added my ggplot() and aes() layers. I add my labs() layer as the last layer.\n\nAfter the aes layer, you’ll see the geom_bar() layer, which has two arguments: fill, which represents the color of the bars and stat = “identity”. Using stat = “identity” overrides the default behavior of the height of the bars corresponding to the number of values, and instead creates bars equal to the value of the y-variable.\n\n### Histograms\n\nUnlike a bar chart or a line graph, a histogram is used to understand characteristics of one variable. Histograms depict the distribution of the variable, in other words the frequency with which values of a variable occur.\n\nTo create the histogram, I would use the layer geom_histogram(). I can specify two different arguments in the geom_histogram() layer to specify the number of categories for binning the independent variable.\n\n• binwidth = specifies the size of the bins. This is useful for when I want categories to span specific intervals.\n• bins = specifies the number of bins. This is useful for experimenting with how much detail I want to use to display my data.\n\nThe code below is to create a histogram that shows the year the bridges were built and the condition they’re in. After establishing the data and aesthetics layers, I used geom()histogram to create the histogram and I specified the number of bins I want in my histogram. As I did in my line graphs post, I used facet_wrap() to further split the data into subplots based on bridge condition.\n\nThe histogram below is showing the distribution of all the values of the yr_built variable of my bmore_bridges_filter data frame. On the x-axis is yr_built variable, which represents the year the bridges were built. On the y-axis is a variable that is automatically created when you create a histogram. The count variable represents the number of values of the yr_built variable that fall into each of the categories on the x-axis.\n\nAs I did with line graphs, I can use color to distinguish between variables within the aes() layer. In the example below, I used the fill= argument, which depicts bars filled in with different colors.\n\nAlternatively, I could use the color= argument which maps my specified variable to bar outlines of different colors. Check out the example below and note the difference between color and fill.\n\n### Box Plots\n\nBox plots provide a summary of data for each group and provide information about how the data is spread. I would add the geom_boxplot() layer to create a box plot. Box plots present data in what is known as the five-number summary. The five numbers refer to percentiles of the data I’m working with. The five percentiles summarized by a box plot are the following:\n\n• The largest value: Represented by the top of the black line extending from the top of the box. These are also known as “whiskers”.\n• The third quartile(Q3): Represented by the top of the box. Seventy-five percent of the values are smaller than the third quartile.\n• The median: Represented by a thick black line. The median is the value that falls int he middle of the data.\n• The first quartile(Q1): Represented by the bottom of the box. Twenty-five percent of the values are smaller than the first quartile.\n• The smallest value: Represented by the bottom of the black line extending from the bottom of the box.\n\nThe example below shows the code used to create a box plot. With the exception of the geom_boxplot() layer, it’s pretty much the same thing I’ve done with plots I previously went over.\n\nWhen creating a box plot, you’ll sometimes notice some points that fall below the bottom of the black lines that represent the smallest value. These points are known as outliers because they are outside the range of would be expected based on the rest of the data.\n\nI am really enjoying learning experimenting and visualizing using different types of plots. Looks like I’m going to have to brush up on statistics to gain a deeper understanding of how this all works.\n\nI can’t wait until I am able to do this in a work environment. Well that’s all for this section! Until next time…" ]
[ null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.89672923,"math_prob":0.81416094,"size":5318,"snap":"2020-34-2020-40","text_gpt3_token_len":1116,"char_repetition_ratio":0.13981934,"word_repetition_ratio":0.043336947,"special_character_ratio":0.20778488,"punctuation_ratio":0.08994197,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9867232,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2020-09-22T23:21:49Z\",\"WARC-Record-ID\":\"<urn:uuid:334edb63-2e8d-492e-aae5-f344dee958ab>\",\"Content-Length\":\"113288\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:cbe4aa55-04ec-4b6b-9543-fae6cb20c56e>\",\"WARC-Concurrent-To\":\"<urn:uuid:8c2f99e6-6518-4254-8690-de96ebfe6a2a>\",\"WARC-IP-Address\":\"192.0.78.24\",\"WARC-Target-URI\":\"https://datascidani.com/2020/03/09/bar-charts-histograms-and-box-plots/\",\"WARC-Payload-Digest\":\"sha1:GANSXTFFVGTPVMAOFAC3CXO67UOBDEHA\",\"WARC-Block-Digest\":\"sha1:I5XQK6OAGPUMQSB6W35WKVPYMVQVT5N2\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2020/CC-MAIN-2020-40/CC-MAIN-2020-40_segments_1600400208095.31_warc_CC-MAIN-20200922224013-20200923014013-00285.warc.gz\"}"}
https://docs.rs/ahash/0.6.0/ahash/struct.AHashSet.html
[ "# [−][src]Struct ahash::AHashSet\n\n`pub struct AHashSet<T, S = RandomState>(_);`\n\nA `HashSet` using `RandomState` to hash the items. (Requires the `std` feature to be enabled.)\n\n## Methods from Deref<Target = HashSet<T, S>>\n\n#### `pub fn capacity(&self) -> usize`1.0.0[src]\n\nReturns the number of elements the set can hold without reallocating.\n\n# Examples\n\n```use std::collections::HashSet;\nlet set: HashSet<i32> = HashSet::with_capacity(100);\nassert!(set.capacity() >= 100);```\n\n#### `pub fn iter(&self) -> Iter<'_, T>`1.0.0[src]\n\nAn iterator visiting all elements in arbitrary order. The iterator element type is `&'a T`.\n\n# Examples\n\n```use std::collections::HashSet;\nlet mut set = HashSet::new();\nset.insert(\"a\");\nset.insert(\"b\");\n\n// Will print in an arbitrary order.\nfor x in set.iter() {\nprintln!(\"{}\", x);\n}```\n\n#### `pub fn len(&self) -> usize`1.0.0[src]\n\nReturns the number of elements in the set.\n\n# Examples\n\n```use std::collections::HashSet;\n\nlet mut v = HashSet::new();\nassert_eq!(v.len(), 0);\nv.insert(1);\nassert_eq!(v.len(), 1);```\n\n#### `pub fn is_empty(&self) -> bool`1.0.0[src]\n\nReturns `true` if the set contains no elements.\n\n# Examples\n\n```use std::collections::HashSet;\n\nlet mut v = HashSet::new();\nassert!(v.is_empty());\nv.insert(1);\nassert!(!v.is_empty());```\n\n#### `pub fn drain(&mut self) -> Drain<'_, T>`1.6.0[src]\n\nClears the set, returning all elements in an iterator.\n\n# Examples\n\n```use std::collections::HashSet;\n\nlet mut set: HashSet<_> = [1, 2, 3].iter().cloned().collect();\nassert!(!set.is_empty());\n\n// print 1, 2, 3 in an arbitrary order\nfor i in set.drain() {\nprintln!(\"{}\", i);\n}\n\nassert!(set.is_empty());```\n\n#### `pub fn drain_filter<F>(&mut self, pred: F) -> DrainFilter<'_, T, F> where    F: FnMut(&T) -> bool, `[src]\n\n🔬 This is a nightly-only experimental API. (`hash_drain_filter`)\n\nCreates an iterator which uses a closure to determine if a value should be removed.\n\nIf the closure returns true, then the value is removed and yielded. If the closure returns false, the value will remain in the list and will not be yielded by the iterator.\n\nIf the iterator is only partially consumed or not consumed at all, each of the remaining values will still be subjected to the closure and removed and dropped if it returns true.\n\nIt is unspecified how many more values will be subjected to the closure if a panic occurs in the closure, or if a panic occurs while dropping a value, or if the `DrainFilter` itself is leaked.\n\n# Examples\n\nSplitting a set into even and odd values, reusing the original set:\n\n```#![feature(hash_drain_filter)]\nuse std::collections::HashSet;\n\nlet mut set: HashSet<i32> = (0..8).collect();\nlet drained: HashSet<i32> = set.drain_filter(|v| v % 2 == 0).collect();\n\nlet mut evens = drained.into_iter().collect::<Vec<_>>();\nlet mut odds = set.into_iter().collect::<Vec<_>>();\nevens.sort();\nodds.sort();\n\nassert_eq!(evens, vec![0, 2, 4, 6]);\nassert_eq!(odds, vec![1, 3, 5, 7]);```\n\n#### `pub fn clear(&mut self)`1.0.0[src]\n\nClears the set, removing all values.\n\n# Examples\n\n```use std::collections::HashSet;\n\nlet mut v = HashSet::new();\nv.insert(1);\nv.clear();\nassert!(v.is_empty());```\n\n#### `pub fn hasher(&self) -> &S`1.9.0[src]\n\nReturns a reference to the set's `BuildHasher`.\n\n# Examples\n\n```use std::collections::HashSet;\nuse std::collections::hash_map::RandomState;\n\nlet hasher = RandomState::new();\nlet set: HashSet<i32> = HashSet::with_hasher(hasher);\nlet hasher: &RandomState = set.hasher();```\n\n#### `pub fn reserve(&mut self, additional: usize)`1.0.0[src]\n\nReserves capacity for at least `additional` more elements to be inserted in the `HashSet`. The collection may reserve more space to avoid frequent reallocations.\n\n# Panics\n\nPanics if the new allocation size overflows `usize`.\n\n# Examples\n\n```use std::collections::HashSet;\nlet mut set: HashSet<i32> = HashSet::new();\nset.reserve(10);\nassert!(set.capacity() >= 10);```\n\n#### `pub fn try_reserve(&mut self, additional: usize) -> Result<(), TryReserveError>`[src]\n\n🔬 This is a nightly-only experimental API. (`try_reserve`)\n\nnew API\n\nTries to reserve capacity for at least `additional` more elements to be inserted in the given `HashSet<K, V>`. The collection may reserve more space to avoid frequent reallocations.\n\n# Errors\n\nIf the capacity overflows, or the allocator reports a failure, then an error is returned.\n\n# Examples\n\n```#![feature(try_reserve)]\nuse std::collections::HashSet;\nlet mut set: HashSet<i32> = HashSet::new();\nset.try_reserve(10).expect(\"why is the test harness OOMing on 10 bytes?\");```\n\n#### `pub fn shrink_to_fit(&mut self)`1.0.0[src]\n\nShrinks the capacity of the set as much as possible. It will drop down as much as possible while maintaining the internal rules and possibly leaving some space in accordance with the resize policy.\n\n# Examples\n\n```use std::collections::HashSet;\n\nlet mut set = HashSet::with_capacity(100);\nset.insert(1);\nset.insert(2);\nassert!(set.capacity() >= 100);\nset.shrink_to_fit();\nassert!(set.capacity() >= 2);```\n\n#### `pub fn shrink_to(&mut self, min_capacity: usize)`[src]\n\n🔬 This is a nightly-only experimental API. (`shrink_to`)\n\nnew API\n\nShrinks the capacity of the set with a lower limit. It will drop down no lower than the supplied limit while maintaining the internal rules and possibly leaving some space in accordance with the resize policy.\n\nPanics if the current capacity is smaller than the supplied minimum capacity.\n\n# Examples\n\n```#![feature(shrink_to)]\nuse std::collections::HashSet;\n\nlet mut set = HashSet::with_capacity(100);\nset.insert(1);\nset.insert(2);\nassert!(set.capacity() >= 100);\nset.shrink_to(10);\nassert!(set.capacity() >= 10);\nset.shrink_to(0);\nassert!(set.capacity() >= 2);```\n\n#### `pub fn difference(&'a self, other: &'a HashSet<T, S>) -> Difference<'a, T, S>`1.0.0[src]\n\nVisits the values representing the difference, i.e., the values that are in `self` but not in `other`.\n\n# Examples\n\n```use std::collections::HashSet;\nlet a: HashSet<_> = [1, 2, 3].iter().cloned().collect();\nlet b: HashSet<_> = [4, 2, 3, 4].iter().cloned().collect();\n\n// Can be seen as `a - b`.\nfor x in a.difference(&b) {\nprintln!(\"{}\", x); // Print 1\n}\n\nlet diff: HashSet<_> = a.difference(&b).collect();\nassert_eq!(diff, .iter().collect());\n\n// Note that difference is not symmetric,\n// and `b - a` means something else:\nlet diff: HashSet<_> = b.difference(&a).collect();\nassert_eq!(diff, .iter().collect());```\n\n#### `pub fn symmetric_difference(    &'a self,     other: &'a HashSet<T, S>) -> SymmetricDifference<'a, T, S>`1.0.0[src]\n\nVisits the values representing the symmetric difference, i.e., the values that are in `self` or in `other` but not in both.\n\n# Examples\n\n```use std::collections::HashSet;\nlet a: HashSet<_> = [1, 2, 3].iter().cloned().collect();\nlet b: HashSet<_> = [4, 2, 3, 4].iter().cloned().collect();\n\n// Print 1, 4 in arbitrary order.\nfor x in a.symmetric_difference(&b) {\nprintln!(\"{}\", x);\n}\n\nlet diff1: HashSet<_> = a.symmetric_difference(&b).collect();\nlet diff2: HashSet<_> = b.symmetric_difference(&a).collect();\n\nassert_eq!(diff1, diff2);\nassert_eq!(diff1, [1, 4].iter().collect());```\n\n#### `pub fn intersection(    &'a self,     other: &'a HashSet<T, S>) -> Intersection<'a, T, S>`1.0.0[src]\n\nVisits the values representing the intersection, i.e., the values that are both in `self` and `other`.\n\n# Examples\n\n```use std::collections::HashSet;\nlet a: HashSet<_> = [1, 2, 3].iter().cloned().collect();\nlet b: HashSet<_> = [4, 2, 3, 4].iter().cloned().collect();\n\n// Print 2, 3 in arbitrary order.\nfor x in a.intersection(&b) {\nprintln!(\"{}\", x);\n}\n\nlet intersection: HashSet<_> = a.intersection(&b).collect();\nassert_eq!(intersection, [2, 3].iter().collect());```\n\n#### `pub fn union(&'a self, other: &'a HashSet<T, S>) -> Union<'a, T, S>`1.0.0[src]\n\nVisits the values representing the union, i.e., all the values in `self` or `other`, without duplicates.\n\n# Examples\n\n```use std::collections::HashSet;\nlet a: HashSet<_> = [1, 2, 3].iter().cloned().collect();\nlet b: HashSet<_> = [4, 2, 3, 4].iter().cloned().collect();\n\n// Print 1, 2, 3, 4 in arbitrary order.\nfor x in a.union(&b) {\nprintln!(\"{}\", x);\n}\n\nlet union: HashSet<_> = a.union(&b).collect();\nassert_eq!(union, [1, 2, 3, 4].iter().collect());```\n\n#### `pub fn contains<Q>(&self, value: &Q) -> bool where    Q: Hash + Eq + ?Sized,    T: Borrow<Q>, `1.0.0[src]\n\nReturns `true` if the set contains a value.\n\nThe value may be any borrowed form of the set's value type, but `Hash` and `Eq` on the borrowed form must match those for the value type.\n\n# Examples\n\n```use std::collections::HashSet;\n\nlet set: HashSet<_> = [1, 2, 3].iter().cloned().collect();\nassert_eq!(set.contains(&1), true);\nassert_eq!(set.contains(&4), false);```\n\n#### `pub fn get<Q>(&self, value: &Q) -> Option<&T> where    Q: Hash + Eq + ?Sized,    T: Borrow<Q>, `1.9.0[src]\n\nReturns a reference to the value in the set, if any, that is equal to the given value.\n\nThe value may be any borrowed form of the set's value type, but `Hash` and `Eq` on the borrowed form must match those for the value type.\n\n# Examples\n\n```use std::collections::HashSet;\n\nlet set: HashSet<_> = [1, 2, 3].iter().cloned().collect();\nassert_eq!(set.get(&2), Some(&2));\nassert_eq!(set.get(&4), None);```\n\n#### `pub fn get_or_insert(&mut self, value: T) -> &T`[src]\n\n🔬 This is a nightly-only experimental API. (`hash_set_entry`)\n\nInserts the given `value` into the set if it is not present, then returns a reference to the value in the set.\n\n# Examples\n\n```#![feature(hash_set_entry)]\n\nuse std::collections::HashSet;\n\nlet mut set: HashSet<_> = [1, 2, 3].iter().cloned().collect();\nassert_eq!(set.len(), 3);\nassert_eq!(set.get_or_insert(2), &2);\nassert_eq!(set.get_or_insert(100), &100);\nassert_eq!(set.len(), 4); // 100 was inserted```\n\n#### `pub fn get_or_insert_owned<Q>(&mut self, value: &Q) -> &T where    Q: Hash + Eq + ToOwned<Owned = T> + ?Sized,    T: Borrow<Q>, `[src]\n\n🔬 This is a nightly-only experimental API. (`hash_set_entry`)\n\nInserts an owned copy of the given `value` into the set if it is not present, then returns a reference to the value in the set.\n\n# Examples\n\n```#![feature(hash_set_entry)]\n\nuse std::collections::HashSet;\n\nlet mut set: HashSet<String> = [\"cat\", \"dog\", \"horse\"]\n.iter().map(|&pet| pet.to_owned()).collect();\n\nassert_eq!(set.len(), 3);\nfor &pet in &[\"cat\", \"dog\", \"fish\"] {\nlet value = set.get_or_insert_owned(pet);\nassert_eq!(value, pet);\n}\nassert_eq!(set.len(), 4); // a new \"fish\" was inserted```\n\n#### `pub fn get_or_insert_with<Q, F>(&mut self, value: &Q, f: F) -> &T where    F: FnOnce(&Q) -> T,    Q: Hash + Eq + ?Sized,    T: Borrow<Q>, `[src]\n\n🔬 This is a nightly-only experimental API. (`hash_set_entry`)\n\nInserts a value computed from `f` into the set if the given `value` is not present, then returns a reference to the value in the set.\n\n# Examples\n\n```#![feature(hash_set_entry)]\n\nuse std::collections::HashSet;\n\nlet mut set: HashSet<String> = [\"cat\", \"dog\", \"horse\"]\n.iter().map(|&pet| pet.to_owned()).collect();\n\nassert_eq!(set.len(), 3);\nfor &pet in &[\"cat\", \"dog\", \"fish\"] {\nlet value = set.get_or_insert_with(pet, str::to_owned);\nassert_eq!(value, pet);\n}\nassert_eq!(set.len(), 4); // a new \"fish\" was inserted```\n\n#### `pub fn is_disjoint(&self, other: &HashSet<T, S>) -> bool`1.0.0[src]\n\nReturns `true` if `self` has no elements in common with `other`. This is equivalent to checking for an empty intersection.\n\n# Examples\n\n```use std::collections::HashSet;\n\nlet a: HashSet<_> = [1, 2, 3].iter().cloned().collect();\nlet mut b = HashSet::new();\n\nassert_eq!(a.is_disjoint(&b), true);\nb.insert(4);\nassert_eq!(a.is_disjoint(&b), true);\nb.insert(1);\nassert_eq!(a.is_disjoint(&b), false);```\n\n#### `pub fn is_subset(&self, other: &HashSet<T, S>) -> bool`1.0.0[src]\n\nReturns `true` if the set is a subset of another, i.e., `other` contains at least all the values in `self`.\n\n# Examples\n\n```use std::collections::HashSet;\n\nlet sup: HashSet<_> = [1, 2, 3].iter().cloned().collect();\nlet mut set = HashSet::new();\n\nassert_eq!(set.is_subset(&sup), true);\nset.insert(2);\nassert_eq!(set.is_subset(&sup), true);\nset.insert(4);\nassert_eq!(set.is_subset(&sup), false);```\n\n#### `pub fn is_superset(&self, other: &HashSet<T, S>) -> bool`1.0.0[src]\n\nReturns `true` if the set is a superset of another, i.e., `self` contains at least all the values in `other`.\n\n# Examples\n\n```use std::collections::HashSet;\n\nlet sub: HashSet<_> = [1, 2].iter().cloned().collect();\nlet mut set = HashSet::new();\n\nassert_eq!(set.is_superset(&sub), false);\n\nset.insert(0);\nset.insert(1);\nassert_eq!(set.is_superset(&sub), false);\n\nset.insert(2);\nassert_eq!(set.is_superset(&sub), true);```\n\n#### `pub fn insert(&mut self, value: T) -> bool`1.0.0[src]\n\nAdds a value to the set.\n\nIf the set did not have this value present, `true` is returned.\n\nIf the set did have this value present, `false` is returned.\n\n# Examples\n\n```use std::collections::HashSet;\n\nlet mut set = HashSet::new();\n\nassert_eq!(set.insert(2), true);\nassert_eq!(set.insert(2), false);\nassert_eq!(set.len(), 1);```\n\n#### `pub fn replace(&mut self, value: T) -> Option<T>`1.9.0[src]\n\nAdds a value to the set, replacing the existing value, if any, that is equal to the given one. Returns the replaced value.\n\n# Examples\n\n```use std::collections::HashSet;\n\nlet mut set = HashSet::new();\nset.insert(Vec::<i32>::new());\n\nassert_eq!(set.get(&[][..]).unwrap().capacity(), 0);\nset.replace(Vec::with_capacity(10));\nassert_eq!(set.get(&[][..]).unwrap().capacity(), 10);```\n\n#### `pub fn remove<Q>(&mut self, value: &Q) -> bool where    Q: Hash + Eq + ?Sized,    T: Borrow<Q>, `1.0.0[src]\n\nRemoves a value from the set. Returns whether the value was present in the set.\n\nThe value may be any borrowed form of the set's value type, but `Hash` and `Eq` on the borrowed form must match those for the value type.\n\n# Examples\n\n```use std::collections::HashSet;\n\nlet mut set = HashSet::new();\n\nset.insert(2);\nassert_eq!(set.remove(&2), true);\nassert_eq!(set.remove(&2), false);```\n\n#### `pub fn take<Q>(&mut self, value: &Q) -> Option<T> where    Q: Hash + Eq + ?Sized,    T: Borrow<Q>, `1.9.0[src]\n\nRemoves and returns the value in the set, if any, that is equal to the given one.\n\nThe value may be any borrowed form of the set's value type, but `Hash` and `Eq` on the borrowed form must match those for the value type.\n\n# Examples\n\n```use std::collections::HashSet;\n\nlet mut set: HashSet<_> = [1, 2, 3].iter().cloned().collect();\nassert_eq!(set.take(&2), Some(2));\nassert_eq!(set.take(&2), None);```\n\n#### `pub fn retain<F>(&mut self, f: F) where    F: FnMut(&T) -> bool, `1.18.0[src]\n\nRetains only the elements specified by the predicate.\n\nIn other words, remove all elements `e` such that `f(&e)` returns `false`.\n\n# Examples\n\n```use std::collections::HashSet;\n\nlet xs = [1, 2, 3, 4, 5, 6];\nlet mut set: HashSet<i32> = xs.iter().cloned().collect();\nset.retain(|&k| k % 2 == 0);\nassert_eq!(set.len(), 3);```\n\n## Trait Implementations\n\n### `impl<T, S, '_, '_> BitAnd<&'_ AHashSet<T, S>> for &'_ AHashSet<T, S> where    T: Eq + Hash + Clone,    S: BuildHasher + Default, `[src]\n\n#### `type Output = AHashSet<T, S>`\n\nThe resulting type after applying the `&` operator.\n\n#### `pub fn bitand(self, rhs: &AHashSet<T, S>) -> AHashSet<T, S>`[src]\n\nReturns the intersection of `self` and `rhs` as a new `AHashSet<T, S>`.\n\n# Examples\n\n```use ahash::AHashSet;\n\nlet a: AHashSet<_> = vec![1, 2, 3].into_iter().collect();\nlet b: AHashSet<_> = vec![2, 3, 4].into_iter().collect();\n\nlet set = &a & &b;\n\nlet mut i = 0;\nlet expected = [2, 3];\nfor x in &set {\nassert!(expected.contains(x));\ni += 1;\n}\nassert_eq!(i, expected.len());```\n\n### `impl<T, S, '_, '_> BitOr<&'_ AHashSet<T, S>> for &'_ AHashSet<T, S> where    T: Eq + Hash + Clone,    S: BuildHasher + Default, `[src]\n\n#### `type Output = AHashSet<T, S>`\n\nThe resulting type after applying the `|` operator.\n\n#### `pub fn bitor(self, rhs: &AHashSet<T, S>) -> AHashSet<T, S>`[src]\n\nReturns the union of `self` and `rhs` as a new `AHashSet<T, S>`.\n\n# Examples\n\n```use ahash::AHashSet;\n\nlet a: AHashSet<_> = vec![1, 2, 3].into_iter().collect();\nlet b: AHashSet<_> = vec![3, 4, 5].into_iter().collect();\n\nlet set = &a | &b;\n\nlet mut i = 0;\nlet expected = [1, 2, 3, 4, 5];\nfor x in &set {\nassert!(expected.contains(x));\ni += 1;\n}\nassert_eq!(i, expected.len());```\n\n### `impl<T, S, '_, '_> BitXor<&'_ AHashSet<T, S>> for &'_ AHashSet<T, S> where    T: Eq + Hash + Clone,    S: BuildHasher + Default, `[src]\n\n#### `type Output = AHashSet<T, S>`\n\nThe resulting type after applying the `^` operator.\n\n#### `pub fn bitxor(self, rhs: &AHashSet<T, S>) -> AHashSet<T, S>`[src]\n\nReturns the symmetric difference of `self` and `rhs` as a new `AHashSet<T, S>`.\n\n# Examples\n\n```use ahash::AHashSet;\n\nlet a: AHashSet<_> = vec![1, 2, 3].into_iter().collect();\nlet b: AHashSet<_> = vec![3, 4, 5].into_iter().collect();\n\nlet set = &a ^ &b;\n\nlet mut i = 0;\nlet expected = [1, 2, 4, 5];\nfor x in &set {\nassert!(expected.contains(x));\ni += 1;\n}\nassert_eq!(i, expected.len());```\n\n### `impl<T> Default for AHashSet<T, RandomState>`[src]\n\n#### `pub fn default() -> AHashSet<T, RandomState>`[src]\n\nCreates an empty `AHashSet<T, S>` with the `Default` value for the hasher.\n\n### `impl<T, S> Deref for AHashSet<T, S>`[src]\n\n#### `type Target = HashSet<T, S>`\n\nThe resulting type after dereferencing.\n\n### `impl<'a, T, S> IntoIterator for &'a AHashSet<T, S>`[src]\n\n#### `type Item = &'a T`\n\nThe type of the elements being iterated over.\n\n#### `type IntoIter = Iter<'a, T>`\n\nWhich kind of iterator are we turning this into?\n\n### `impl<T, S> IntoIterator for AHashSet<T, S>`[src]\n\n#### `type Item = T`\n\nThe type of the elements being iterated over.\n\n#### `type IntoIter = IntoIter<T>`\n\nWhich kind of iterator are we turning this into?\n\n### `impl<T, S, '_, '_> Sub<&'_ AHashSet<T, S>> for &'_ AHashSet<T, S> where    T: Eq + Hash + Clone,    S: BuildHasher + Default, `[src]\n\n#### `type Output = AHashSet<T, S>`\n\nThe resulting type after applying the `-` operator.\n\n#### `pub fn sub(self, rhs: &AHashSet<T, S>) -> AHashSet<T, S>`[src]\n\nReturns the difference of `self` and `rhs` as a new `AHashSet<T, S>`.\n\n# Examples\n\n```use ahash::AHashSet;\n\nlet a: AHashSet<_> = vec![1, 2, 3].into_iter().collect();\nlet b: AHashSet<_> = vec![3, 4, 5].into_iter().collect();\n\nlet set = &a - &b;\n\nlet mut i = 0;\nlet expected = [1, 2];\nfor x in &set {\nassert!(expected.contains(x));\ni += 1;\n}\nassert_eq!(i, expected.len());```\n\n## Blanket Implementations\n\n### `impl<T> ToOwned for T where    T: Clone, `[src]\n\n#### `type Owned = T`\n\nThe resulting type after obtaining ownership.\n\n### `impl<T, U> TryFrom<U> for T where    U: Into<T>, `[src]\n\n#### `type Error = Infallible`\n\nThe type returned in the event of a conversion error.\n\n### `impl<T, U> TryInto<U> for T where    U: TryFrom<T>, `[src]\n\n#### `type Error = <U as TryFrom<T>>::Error`\n\nThe type returned in the event of a conversion error." ]
[ null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.5200531,"math_prob":0.92523366,"size":21070,"snap":"2020-45-2020-50","text_gpt3_token_len":6519,"char_repetition_ratio":0.18660401,"word_repetition_ratio":0.3978638,"special_character_ratio":0.33512104,"punctuation_ratio":0.2927937,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9900842,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2020-12-02T19:45:56Z\",\"WARC-Record-ID\":\"<urn:uuid:51125d9b-31ca-4b6d-81d0-c855165416b2>\",\"Content-Length\":\"236411\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:c4e3b68f-f7a5-45c7-ab1b-b59e54fc2aa8>\",\"WARC-Concurrent-To\":\"<urn:uuid:93352197-62ec-478a-9925-d1ecda19976c>\",\"WARC-IP-Address\":\"99.84.176.9\",\"WARC-Target-URI\":\"https://docs.rs/ahash/0.6.0/ahash/struct.AHashSet.html\",\"WARC-Payload-Digest\":\"sha1:B6473YYTUXRFGQFKXHXDKIIC4KL2KL35\",\"WARC-Block-Digest\":\"sha1:HOR2JCRS3RYRXTEPZX2E7ONQCP4ZQEN2\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2020/CC-MAIN-2020-50/CC-MAIN-2020-50_segments_1606141715252.96_warc_CC-MAIN-20201202175113-20201202205113-00413.warc.gz\"}"}
https://discourse.julialang.org/t/efficiently-creating-a-data-frame-that-is-made-up-of-smaller-data-frames/87055
[ "# Efficiently creating a data frame that is made up of smaller data frames\n\nHi all,\n\nI’m trying to create a “long” version data frame (e.g. several observations per individual as in a longitudinal study). However, the data frame for each individual will depend on certain parameters - not the same operation for all N individuals; some will have more rows, some fewer. I was able to do it by creating a blank data frame and then continually updating it within a for loop using vcat.\n\nIn terms of pseudocode, this is how it currently looks:\n\n``````df = DataFrame(ID = Int64[], nᵢ = Int64[], ...) # Define the actual data frame I want\n\nfor i in 1:N\ndftmp = DataFrame(ID = i, nᵢ = Int64[], ...) # Create a temporary data frame (same args as df)\n.\n.\n.\ndf = vcat(df, dftmp) # Combine dftmp with df (i.e. Update df)\nend\n``````\n\nHowever, I feel like there must be a more efficient way of doing this and wanted guidance. I come from an R background and have manipulated data frames using tidyverse.\n\nWhat you do is going to be slow.\n\nInstead use almost the same (essentially: create a vector of data frames and then `vcat` them in one shot next):\n\n``````reduce(vcat, [DataFrame(ID = i , nᵢ = ...) for i in 1:N])\n``````\n\nIf your source data frames have different sets of columns please read `vcat` documentation about options to handle this case.\n\n1 Like\n\nThank you for the response.\n\nHowever, I am not sure how the command below works:\n\n``````[DataFrame(ID = i], , nᵢ = ...) for i in 1:N])\n``````\n\nIn addition, the source data frames will have the same rows but different sets of columns.\nPseudocode:\n\n``````for i in 1:N\ndftmp = DataFrame(ID = i, nᵢ = Int64[], ...) # Create a temporary data frame (same args as df)\n.\nif (arg is true)\ndftmp = ...\nelse\ndftmp = ...\nend\n\ndf = vcat(df, dftmp) # Combine dftmp with df (i.e. Update df)\nend\n``````\n\nIs there a better way to do the inside `ifelse` loop?\n\nOP used `...` as a placeholder for some other operations so I re-used it. The code was not runnable clearly.\n\nthe source data frames will have the same rows but different sets of columns.\n\nAs I have commented above please read `vcat` documentation. I am copying part of the documentation that is relevant:\n\nThe cols keyword argument determines the columns of the returned data frame:\n• :setequal: require all data frames to have the same column names disregarding order. If they\nappear in different orders, the order of the first provided data frame is used.\n• :orderequal: require all data frames to have the same column names and in the same order.\n• :intersect: only the columns present in all provided data frames are kept. If the\nintersection is empty, an empty data frame is returned.\n• :union: columns present in at least one of the provided data frames are kept. Columns not\npresent in some data frames are filled with missing where necessary.\n• A vector of Symbols or strings: only listed columns are kept. Columns not present in some\ndata frames are filled with missing where necessary.\n\nNow regarding your question:\n\nPseudocode:\n\nPlease share full code if you want a full working code in response.\n\n`[DataFrame(ID = i], , nᵢ = ...) for i in 1:N]` is a comprehension.\n\nAlternatively you can define e.g. a function taking one argument (i):\n\n``````function gen_df(i)\n...\nend\n``````\n\nand then use broadcasting like this:\n\n``````reduce(vcat, gen_df.(1:N), cols=:union) # I use :union as I understand you want union of the columns\n``````\n1 Like\n\nJust a quick note, I was referring to the part \" `ID = i],` \" which seems to be a `],` too much. (Anyway, not really relevant ;))\n\n1 Like\n\nAh - OK. Fixed" ]
[ null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.83877033,"math_prob":0.82584345,"size":2868,"snap":"2022-40-2023-06","text_gpt3_token_len":703,"char_repetition_ratio":0.12884079,"word_repetition_ratio":0.24517375,"special_character_ratio":0.2541841,"punctuation_ratio":0.18032786,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9547714,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2022-09-29T07:43:08Z\",\"WARC-Record-ID\":\"<urn:uuid:2ccd64b2-7928-4f1a-8448-9e1fbbbdb0f5>\",\"Content-Length\":\"35181\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:87e48245-9dcb-4326-bebc-882cf35c9b89>\",\"WARC-Concurrent-To\":\"<urn:uuid:54b9ccac-7b51-47a2-b106-ba58cc7cf61b>\",\"WARC-IP-Address\":\"64.71.144.205\",\"WARC-Target-URI\":\"https://discourse.julialang.org/t/efficiently-creating-a-data-frame-that-is-made-up-of-smaller-data-frames/87055\",\"WARC-Payload-Digest\":\"sha1:ZLDCFVARNJFIQISCHBBGTCJCRDP43YGG\",\"WARC-Block-Digest\":\"sha1:BF7WJB4VOFELDUBK423NASJMJZ6KI64G\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2022/CC-MAIN-2022-40/CC-MAIN-2022-40_segments_1664030335326.48_warc_CC-MAIN-20220929065206-20220929095206-00503.warc.gz\"}"}
https://edurev.in/studytube/NCERT-Solutions-Dual-Nature-of-Radiation-and-Matte/1b85cdf0-b868-464b-b21d-2909ff5f5a98_t
[ "Courses\n\n# NCERT Solutions: Dual Nature of Radiation and Matter- 3 Notes | EduRev\n\n## Class 12 : NCERT Solutions: Dual Nature of Radiation and Matter- 3 Notes | EduRev\n\nThe document NCERT Solutions: Dual Nature of Radiation and Matter- 3 Notes | EduRev is a part of Class 12 category.\nAll you need of Class 12 at this link: Class 12\n\nQues 11.29:\nThe work function for the following metals is given:\n\nNa: 2.75 eV; K: 2.30 eV; Mo: 4.17 eV; Ni: 5.15 eV. Which of these metals will not give photoelectric emission for a radiation of wavelength 3300 Å from a He-Cd laser placed 1 m away from the photocell? What happens if the laser is brought nearer and placed 50 cm away?\nAns: Mo and Ni will not show photoelectric emission in both cases\n\nWavelength for a radiation, λ = 3300 Å = 3300 × 10−10 m\nSpeed of light, c = 3 × 108 m/s\nPlanck’s constant, h = 6.6 × 10−34 Js\nThe energy of incident radiation is given as:", null, "It can be observed that the energy of the incident radiation is greater than the work function of Na and K only. It is less for Mo and Ni. Hence, Mo and Ni will not show photoelectric emission.\n\nIf the source of light is brought near the photocells and placed 50 cm away from them, then the intensity of radiation will increase. This does not affect the energy of the radiation. Hence, the result will be the same as before. However, the photoelectrons emitted from Na and K will increase in proportion to intensity.\n\nQues 11.30:\nLight of intensity 10−5 W m−2 falls on a sodium photo-cell of surface area 2 cm2. Assuming that the top 5 layers of sodium absorb the incident energy, estimate time required for photoelectric emission in the wave-picture of radiation. The work function for the metal is given to be about 2 eV. What is the implication of your answer?\nAns: Intensity of incident light, I = 10−5 W m−2\nSurface area of a sodium photocell, A = 2 cm2 = 2 × 10−4 m2\nIncident power of the light, P = I × A\n= 10−5 × 2 × 10−4\n= 2 × 10−9 W\nWork function of the metal,  φ= 2 eV\n= 2 × 1.6 × 10−19\n= 3.2 × 10−19 J\nNumber of layers of sodium that absorbs the incident energy, n = 5\n\nWe know that the effective atomic area of a sodium atom, Ae is 10−20 m2.\n\nHence, the number of conduction electrons in n layers is given as:", null, "The incident power is uniformly absorbed by all the electrons continuously. Hence, the amount of energy absorbed per second per electron is:", null, "Time required for photoelectric emission:", null, "The time required for the photoelectric emission is nearly half a year, which is not practical. Hence, the wave picture is in disagreement with the given experiment.\n\nQues 11.31:\nCrystal diffraction experiments can be performed using X-rays, or electrons accelerated through appropriate voltage. Which probe has greater energy? (For quantitative comparison, take the wavelength of the probe equal to 1 Å, which is of the order of inter-atomic spacing in the lattice) (me= 9.11 × 10−31 kg).\n\nAns: An X-ray probe has a greater energy than an electron probe for the same wavelength.\n\nWavelength of light emitted from the probe, λ = 1 Å = 10−10 m\n\nMass of an electron, me = 9.11 × 10−31 kg\n\nPlanck’s constant, h = 6.6 × 10−34 Js\n\nCharge on an electron, e = 1.6 × 10−19 C\n\nThe kinetic energy of the electron is given as:", null, "Where,\n\nv = Velocity of the electron\n\nmev = Momentum (p) of the electron\n\nAccording to the de Broglie principle, the de Broglie wavelength is given as:", null, "Energy of a photon,", null, "", null, "Hence, a photon has a greater energy than an electron for the same wavelength.\n\nQues 11.32:\n(a) Obtain the de Broglie wavelength of a neutron of kinetic energy 150 eV. As you have seen in Exercise 11.31, an electron beam of this energy is suitable for crystal diffraction experiments. Would a neutron beam of the same energy be equally suitable? Explain. (mn= 1.675 × 10−27 kg)\n\n(b) Obtain the de Broglie wavelength associated with thermal neutrons at room temperature (27 ºC). Hence explain why a fast neutron beam needs to be thermalised with the environment before it can be used for neutron diffraction experiments.\n\nAns: (a) De Broglie wavelength =", null, "; neutron is not suitable for the diffraction experiment\n\nKinetic energy of the neutron, K = 150 eV\n\n= 150 × 1.6 × 10−19\n\n= 2.4 × 10−17 J\n\nMass of a neutron, mn = 1.675 × 10−27 kg\n\nThe kinetic energy of the neutron is given by the relation:", null, "Where,\nv = Velocity of the neutron\nmnv = Momentum of the neutron\nDe-Broglie wavelength of the neutron is given as:", null, "It i\\$ clear that wavelength is inversely proportional to the square root of mass. Hence, wavelength decreases with increase in mass and vice versa.", null, "It is given in the previous problem that the inter-atomic spacing of a crystal is about 1 Å, i.e., 10−10 m. Hence, the inter-atomic spacing is about a hundred times greater. Hence, a neutron beam of energy\n150 eV is not suitable for diffraction experiments.\n\n(b) De Broglie wavelength =", null, "Room temperature, T = 27°C = 27 + 273 = 300 K\n\nThe average kinetic energy of the neutron is given as:", null, "", null, "Where,\nk = Boltzmann constant = 1.38 × 10−23 J mol−1 K−1\n\nThe wavelength of the neutron is given as:", null, "This wavelength is comparable to the inter-atomic spacing of a crystal. Hence, the high-energy neutron beam should first be thermalised, before using it for diffraction.\n\nQues 11.33:\nAn electron microscope uses electrons accelerated by a voltage of 50 kV. Determine the de Broglie wavelength associated with the electrons. If other factors (such as numerical aperture, etc.) are taken to be roughly the same, how does the resolving power of an electron microscope compare with that of an optical microscope which uses yellow light?\n\nAns: Electrons are accelerated by a voltage, V = 50 kV = 50 × 103 V\nCharge on an electron, e = 1.6 × 10−19 C\nMass of an electron, me = 9.11 × 10−31 kg\nWavelength of yellow light = 5.9 × 10−7 m\nThe kinetic energy of the electron is given as:\n\nE = eV\n= 1.6 × 10−19 × 50 × 103\n= 8 × 10−15 J\n\nDe Broglie wavelength is given by the relation:", null, "This wavelength is nearly 105 times less than the wavelength of yellow light.\n\nThe resolving power of a microscope is inversely proportional to the wavelength of light used. Thus, the resolving power of an electron microscope is nearly 105 times that of an optical microscope.\n\nQues 11.34:\nThe wavelength of a probe is roughly a measure of the size of a structure that it can probe in some detail. The quark structure of protons and neutrons appears at the minute length-scale of 10−15 m or less. This structure was first probed in early 1970’s using high energy electron beams produced by a linear accelerator at Stanford, USA. Guess what might have been the order of energy of these electron beams. (Rest mass energy of electron = 0.511 MeV.)\n\nAns: Wavelength of a proton or a neutron, λ ≈ 10−15 m\nRest mass energy of an electron:\nm0c2 = 0.511 MeV\n= 0.511 × 106 × 1.6 × 10−19\n= 0.8176 × 10−13 J\nPlanck’s constant, h = 6.6 × 10−34 Js\n\nSpeed of light, c = 3 × 108 m/s\n\nThe momentum of a proton or a neutron is given as:", null, "The relativistic relation for energy (E) is given as:", null, "", null, "Thus, the electron energy emitted from the accelerator at Stanford, USA might be of the order of 1.24 BeV.\n\nQues 11.35:\n\nFind the typical de Broglie wavelength associated with a He atom in helium gas at room temperature (27 ºC) and 1 atm pressure; and compare it with the mean separation between two atoms under these conditions.\n\nAns: De Broglie wavelength associated with He atom =", null, "Room temperature, T = 27°C = 27 273 = 300 K\n\nAtmospheric pressure, P = 1 atm = 1.01 × 105 Pa\n\nAtomic weight of a He atom = 4\n\nAvogadro’s number, NA = 6.023 × 1023\n\nBoltzmann constant, k = 1.38 × 10−23 J mol−1 K−1\n\nAverage energy of a gas at temperature T,is given as:", null, "De Broglie wavelength is given by the relation:", null, "Where,\n\nm = Mass of a He atom", null, "We have the ideal gas formula:\n\nPV = RT\n\nPV = kNT", null, "Where,\n\nV = Volume of the gas\n\nN = Number of moles of the gas\n\nMean separation between two atoms of the gas is given by the relation:", null, "", null, "Hence, the mean separation between the atoms is much greater than the de Broglie wavelength.\n\nQues 11.36:\n\nCompute the typical de Broglie wavelength of an electron in a metal at 27 ºC and compare it with the mean separation between two electrons in a metal which is given to be about 2 × 10−10 m.\n\n[Note: Exercises 11.35 and 11.36 reveal that while the wave-packets associated with gaseous molecules under ordinary conditions are non-overlapping, the electron wave-packets in a metal strongly overlap with one another. This suggests that whereas molecules in an ordinary gas can be distinguished apart, electrons in a metal cannot be distinguished apart from one another. This indistinguishibility has many fundamental implications which you will explore in more advanced Physics courses.]\n\nAns: Temperature, T = 27°C = 27 273 = 300 K\n\nMean separation between two electrons, r = 2 × 10−10 m\n\nDe Broglie wavelength of an electron is given as:", null, "Where,\n\nh = Planck’s constant = 6.6 × 10−34 Js\n\nm = Mass of an electron = 9.11 × 10−31 kg\n\nk = Boltzmann constant = 1.38 × 10−23 J mol−1 K−1", null, "Hence, the de Broglie wavelength is much greater than the given inter-electron separation.\n\nQues 11.37:\n\nAnswer the following questions:\n\n(a) Quarks inside protons and neutrons are thought to carry fractional charges [( 2/3)e ; (−1/3)e]. Why do they not show up in Millikan’s oil-drop experiment?\n\n(b) What is so special about the combination e/m? Why do we not simply talk of e and m separately?\n\n(c) Why should gases be insulators at ordinary pressures and start conducting at very low pressures?\n\n(d) Every metal has a definite work function. Why do all photoelectrons not come out with the same energy if incident radiation is monochromatic? Why is there an energy distribution of photoelectrons?\n\n(e) The energy and momentum of an electron are related to the frequency and wavelength of the associated matter wave by the relations:\n\nE = hν, p =", null, "But while the value of λ is physically significant, the value of ν (and therefore, the value of the phase speed νλ) has no physical significance. Why?\n\nAns: (a) Quarks inside protons and neutrons carry fractional charges. This is because nuclear force increases extremely if they are pulled apart. Therefore, fractional charges may exist in nature; observable charges are still the integral multiple of an electrical charge.\n\n(b) The basic relations for electric field and magnetic field are", null, "These relations include e (electric charge), v (velocity), m (mass), V (potential), r (radius), and B (magnetic field). These relations give the value of velocity of an electron as", null, "and", null, "It can be observed from these relations that the dynamics of an electron is determined not by e and m separately, but by the ratio e/m.\n\n(c) At atmospheric pressure, the ions of gases have no chance of reaching their respective electrons because of collision and recombination with other gas molecules. Hence, gases are insulators at atmospheric pressure. At low pressures, ions have a chance of reaching their respective electrodes and constitute a current. Hence, they conduct electricity at these pressures.\n\n(d) The work function of a metal is the minimum energy required for a conduction electron to get out of the metal surface. All the electrons in an atom do not have the same energy level. When a ray having some photon energy is incident on a metal surface, the electrons come out from different levels with different energies. Hence, these emitted electrons show different energy distributions.\n\n(e) The absolute value of energy of a particle is arbitrary within the additive constant. Hence, wavelength (λ) is significant, but the frequency (ν) associated with an electron has no direct physical significance.\n\nTherefore, the product νλ(phase speed)has no physical significance.\n\nGroup speed is given as:", null, "This quantity has a physical meaning.\n\nOffer running on EduRev: Apply code STAYHOME200 to get INR 200 off on our premium plan EduRev Infinity!\n\n,\n\n,\n\n,\n\n,\n\n,\n\n,\n\n,\n\n,\n\n,\n\n,\n\n,\n\n,\n\n,\n\n,\n\n,\n\n,\n\n,\n\n,\n\n,\n\n,\n\n,\n\n;" ]
[ null, "https://cdn3.edurev.in/ApplicationImages/Temp/b75599af-7d3b-45c5-a244-cbb8079b0a3f_lg.jpg", null, "https://cdn3.edurev.in/ApplicationImages/Temp/624032f8-fdbf-4e38-bb95-c72c7c3cf4dc_lg.jpg", null, "https://cdn3.edurev.in/ApplicationImages/Temp/34575df7-0364-4f76-99fb-e23545bd9157_lg.jpg", null, "https://cdn3.edurev.in/ApplicationImages/Temp/fadbe8b6-7994-44fd-831d-0c989f2220b3_lg.jpg", null, "https://cdn3.edurev.in/ApplicationImages/Temp/491f1bf9-f333-4ecf-b078-17dcce1ad947_lg.jpg", null, "https://cdn3.edurev.in/ApplicationImages/Temp/7c72e9ac-d9ec-48bc-9b5d-4a07cfcea071_lg.jpg", null, "https://cdn3.edurev.in/ApplicationImages/Temp/3b2e550f-dfa2-49a4-aab1-e8114474495e_lg.jpg", null, "https://cdn3.edurev.in/ApplicationImages/Temp/cdcfa785-dd59-4a8a-80f6-98877c46eb8e_lg.jpg", null, "https://cdn3.edurev.in/ApplicationImages/Temp/76ddac60-07c4-450f-9ad7-fe01974442a4_lg.jpg", null, "https://cdn3.edurev.in/ApplicationImages/Temp/aa68455e-4563-4b80-b3f3-6ccebc064be3_lg.jpg", null, "https://cdn3.edurev.in/ApplicationImages/Temp/0b4421d2-5eac-49a5-a971-2d7980f122e7_lg.jpg", null, "https://cdn3.edurev.in/ApplicationImages/Temp/1419432_65bfa369-268e-4cf8-a321-608c59a86938_lg.PNG", null, "https://cdn3.edurev.in/ApplicationImages/Temp/f6e75823-0249-43b9-84e1-fa40152f502d_lg.jpg", null, "https://cdn3.edurev.in/ApplicationImages/Temp/dbf736ea-a9e1-44cf-b69e-f22d69a3a3b5_lg.jpg", null, "https://cdn3.edurev.in/ApplicationImages/Temp/afc3a5ba-d2eb-44b8-a59c-a223952e98c3_lg.jpg", null, "https://cdn3.edurev.in/ApplicationImages/Temp/24138f65-6531-44f2-8038-eb58a5a08e1f_lg.jpg", null, "https://cdn3.edurev.in/ApplicationImages/Temp/13900cbf-c154-4d6d-a1da-4c2c6d7bc80b_lg.jpg", null, "https://cdn3.edurev.in/ApplicationImages/Temp/b466697c-7e21-4e15-b43d-00cf6b2caae5_lg.jpg", null, "https://cdn3.edurev.in/ApplicationImages/Temp/1419432_ed3fa2d9-07c9-4c35-b9b7-155d6b827b26_lg.PNG", null, "https://cdn3.edurev.in/ApplicationImages/Temp/1419432_6dffa2c9-1c98-4a32-8183-63a37c957518_lg.PNG", null, "https://cdn3.edurev.in/ApplicationImages/Temp/dd10b528-bf3f-4434-ae0f-f42b1c06d999_lg.jpg", null, "https://cdn3.edurev.in/ApplicationImages/Temp/9cbb4d22-e781-4991-ba97-2ef3285801dd_lg.jpg", null, "https://cdn3.edurev.in/ApplicationImages/Temp/d8a9db82-746c-43fb-8794-ca8019df3597_lg.jpg", null, "https://cdn3.edurev.in/ApplicationImages/Temp/a73ae518-6e3d-4b6f-9aa4-c4b61a80978b_lg.jpg", null, "https://cdn3.edurev.in/ApplicationImages/Temp/88c8253a-7fec-421d-9e19-f1fd0fe107c1_lg.jpg", null, "https://cdn3.edurev.in/ApplicationImages/Temp/8b9836b7-cfca-4f1f-93b9-1e2c21f432e5_lg.jpg", null, "https://cdn3.edurev.in/ApplicationImages/Temp/1100b5c0-e1cb-470a-83c3-0fb66070804a_lg.jpg", null, "https://cdn3.edurev.in/ApplicationImages/Temp/e51bdbe1-9064-4672-aa57-0ae621ae01b0_lg.jpg", null, "https://cdn3.edurev.in/ApplicationImages/Temp/22e8d696-022e-4cf1-94cf-3a656e61793e_lg.jpg", null, "https://cdn3.edurev.in/ApplicationImages/Temp/149a8117-64ae-4cb1-9f09-382223606158_lg.jpg", null, "https://cdn3.edurev.in/ApplicationImages/Temp/12c2c5fa-236e-406d-90b4-db0d0819fa38_lg.jpg", null, "https://cdn3.edurev.in/ApplicationImages/Temp/57665644-6876-4851-ba4e-25ec64b96dee_lg.jpg", null, "https://cdn3.edurev.in/ApplicationImages/Temp/faa46720-8fed-4db5-b568-f94c505df173_lg.jpg", null, "https://cdn3.edurev.in/ApplicationImages/Temp/002e0756-b0a5-42fe-b7f4-66e85dca6360_lg.jpg", null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.8820773,"math_prob":0.98968375,"size":11362,"snap":"2021-21-2021-25","text_gpt3_token_len":2913,"char_repetition_ratio":0.16182427,"word_repetition_ratio":0.0920666,"special_character_ratio":0.26632634,"punctuation_ratio":0.11640894,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.99697953,"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,63,64,65,66,67,68],"im_url_duplicate_count":[null,3,null,3,null,3,null,3,null,3,null,3,null,3,null,3,null,3,null,3,null,3,null,3,null,3,null,3,null,3,null,3,null,3,null,3,null,3,null,3,null,3,null,3,null,3,null,3,null,3,null,3,null,3,null,3,null,3,null,3,null,3,null,3,null,3,null,3,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2021-06-18T00:07:52Z\",\"WARC-Record-ID\":\"<urn:uuid:638c2554-b5b3-4bf1-9673-8162842d7a83>\",\"Content-Length\":\"351220\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:3e7fc6ae-bfe0-4307-b89f-8e5c3602dfa1>\",\"WARC-Concurrent-To\":\"<urn:uuid:b47602a0-23e8-4064-827a-bbee4673dec6>\",\"WARC-IP-Address\":\"35.247.187.6\",\"WARC-Target-URI\":\"https://edurev.in/studytube/NCERT-Solutions-Dual-Nature-of-Radiation-and-Matte/1b85cdf0-b868-464b-b21d-2909ff5f5a98_t\",\"WARC-Payload-Digest\":\"sha1:6TNAKXJSGNZFMATOLNWC5K2EKMMB4QHH\",\"WARC-Block-Digest\":\"sha1:3577ODHHQN277F6EFEPZY6YCO2RJYJBI\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2021/CC-MAIN-2021-25/CC-MAIN-2021-25_segments_1623487634576.73_warc_CC-MAIN-20210617222646-20210618012646-00455.warc.gz\"}"}
https://timus.online/problem.aspx?space=1&num=1009
[ "ENG  RUS Timus Online Judge", null, "Online Judge\nProblems\nAuthors\nOnline contests\nSite news\nWebboard\nProblem set\nSubmit solution\nJudge status\nGuide\nRegister\nAuthors ranklist\nCurrent contest\nScheduled contests\nPast contests\nRules\n\n## 1009. K-based Numbers\n\nTime limit: 0.5 second\nMemory limit: 64 MB\nLet’s consider K-based numbers, containing exactly N digits. We define a number to be valid if its K-based notation doesn’t contain two successive zeros. For example:\n• 1010230 is a valid 7-digit number;\n• 1000198 is not a valid number;\n• 0001235 is not a 7-digit number, it is a 4-digit number.\nGiven two numbers N and K, you are to calculate an amount of valid K based numbers, containing N digits.\nYou may assume that 2 ≤ K ≤ 10; N ≥ 2; N + K ≤ 18.\n\n### Input\n\nThe numbers N and K in decimal notation separated by the line break.\n\n### Output\n\nThe result in decimal notation.\n\n### Sample\n\ninputoutput\n```2\n10\n```\n```90\n```\nProblem Source: USU Championship 1997" ]
[ null, "https://timus.online/images/usu-summer.jpg", null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.75501263,"math_prob":0.9081523,"size":610,"snap":"2021-43-2021-49","text_gpt3_token_len":161,"char_repetition_ratio":0.14356436,"word_repetition_ratio":0.0,"special_character_ratio":0.29508197,"punctuation_ratio":0.129771,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.98348236,"pos_list":[0,1,2],"im_url_duplicate_count":[null,null,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2021-12-04T14:23:39Z\",\"WARC-Record-ID\":\"<urn:uuid:b32abb2a-240d-4edd-bf42-f88f952ff256>\",\"Content-Length\":\"6035\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:f2623376-3f26-4600-8879-e4c1bdf62083>\",\"WARC-Concurrent-To\":\"<urn:uuid:43960398-da30-454c-b9c8-bd35d9a8af9c>\",\"WARC-IP-Address\":\"93.88.177.146\",\"WARC-Target-URI\":\"https://timus.online/problem.aspx?space=1&num=1009\",\"WARC-Payload-Digest\":\"sha1:XOKIZNKWHQLIPACDPHL2AEJAG7NLTDE3\",\"WARC-Block-Digest\":\"sha1:V5KYGG452WTO6CS2XD4SHE3HJ4XQD7FU\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2021/CC-MAIN-2021-49/CC-MAIN-2021-49_segments_1637964362992.98_warc_CC-MAIN-20211204124328-20211204154328-00301.warc.gz\"}"}
https://www.hindawi.com/journals/mpe/2018/4272436/
[ "#### Abstract\n\nIt is important to distinguish the dominant mechanism of seabed acoustic scattering for the quantitative inversion of seabed parameters. An identification scheme is proposed based on Bayesian inversion with the relative entropy used to estimate dominant acoustic backscatter mechanism. DiffeRential Evolution Adaptive Metropolis is used to obtain samples from posterior probability density in Bayesian inversion. Three mechanisms for seabed scattering are considered: scattering from a rough water-seabed interface, scattering from volume heterogeneities, and mixed scattering from both interface roughness and volume heterogeneities. Roughness scattering and volume scattering are modelled based on Fluid Theories using Small-Slope Approximation and Small-Perturbation Fluid Approximation, respectively. The identification scheme is applied to three simulated observation data sets. The results indicate that the scheme is promising and appears capable of distinguishing sediment volume from interface roughness scattering and can correctly identify the dominant acoustic backscatter mechanism.\n\n#### 1. Introduction\n\nAcoustic scattering of water-seabed interface is the main source of underwater reverberation, which could affect the performance of sonar system when it is used to detect and classify underwater targets . If we are interested in the seabed, the acoustic scattering is the main way to obtain information of seabed properties. It is believed that seabed scattering consists mainly of two parts: interface rough scattering and inhomogeneous sediment volume scattering . In order to mitigate the reduction of sonar performance and enhance the acquisition of seabed properties, it is necessary to identify the dominant acoustic scattering mechanism and choose an accurate model of seabed scattering at the location of interest . This paper develops a Bayesian approach to identify dominant acoustic backscatter mechanism via relative entropy estimation, figuring out whether interface scattering, volume scattering, or both interface and volume scattering is the main factor.\n\nScattering mechanisms are distinguished using the relative entropy [4, 5], also known as Kullback–Leibler divergence, which is an optimal criterion used to describe the difference between two probability distributions (prior probability distribution and posterior probability density). Compared to other optimal criteria, the relative entropy is suitable for nonlinear model and non-Gaussian distribution of parameters, measuring the amount of information generated by observations and selected model. The motivation of this paper is the application that relative entropy is used to measure information provided by an experiment design . In this paper, the design of the numerical experiment, such as grazing angle and acoustic frequency of the scattering strength measurement, is fixed while different models are used. Then different relative entropies correspond to different models and different models correspond to different main scattering mechanisms. In order to obtain an accurate estimation of relative entropy, the main task is to solve the posterior probability density (PPD) which can be calculated by Model-based Bayesian geoacoustic inversion.\n\nSince the start of geoacoustic inversion more than two decades ago, there are many geoacoustic bottom interaction models, including roughness scattering models and sediment volume scattering models based on different media theories (such as Fluid Theories, Elastic Theories, and Poroelastic Theories), that are established and tested [7, 8]. Although different models differ in the fit degree with the measured data, these models prove their effectiveness with varying degrees. Specifically, considering that the purpose of this paper is to distinguish the different scattering mechanisms, a simplified forward model which takes sediment as fluid is used to predict scattering at the water-sediment interface and/or within the volume of sediment. The seafloor roughness and sediment heterogeneities are taken as random processes which follow the pure power law. Small-Slope Approximation and Small-Perturbation Fluid Approximation are used to calculate the interface scattering and volume scattering, respectively.\n\nBayesian inference has been widely used in geoacoustic inversion to obtain parameter uncertainty analysis instead of point estimation based on global optimization techniques. The key task in Bayesian inference is to solve the posterior distribution. However, geoacoustic bottom interaction models are strongly nonlinear that means the posterior distribution has no analytical form. Monte Carlo simulation methods can be used to generate a sample from the posterior distribution, also referred to as the target distribution. Then the samples can be used to approximate the posterior distribution. Many iterative methods are used to generate samples that are as close to the target distribution as possible. Most of these methods are based on Markov Chain Monte Carlo (MCMC) approach, which exploit a Markov chain that generates a random walk through the parameter search space to obtain solutions with stable frequencies stemming from a stationary distribution. The earliest MCMC approach is the random walk Metropolis. Considering nonsymmetrical jumping distributions, Hastings extended the random walk Metropolis algorithm to more general cases, which is well known as the Metropolis-Hastings (M-H) algorithm . In order to increase sampling efficiency of complex posterior distributions involving long tails, correlated parameters, multimodality, numerous local optima, more and more improved algorithms have been proposed such as adaptive proposal (AP) , adaptive Metropolis (AM) , delayed rejection adaptive Metropolis (DRAM) , differential evolution Markov chain (DE-MC) , Fast Gibbs sampling (FGS) [14, 15], and so on. The sampling method used in this paper is a relatively efficient one entitled DiffeRential Evolution Adaptive Metropolis (DREAM) , which can maintain detailed balance and ergodicity with excellent performance on a wide range of problems involving nonlinearity, high dimensionality, and multimodality.\n\nIn this paper, the high-frequency seafloor acoustics models are adopted, and it is assumed that the sound wave only interacts with the surface of seafloor without considering the influence of the stratification of seabed sediments. Three simulated data sets (two representing a muddy sediment and one representing a sandy sediment) are used in the study of dominant acoustic backscatter mechanism estimation. The dominant scatter mechanisms for the three data sets are volume scattering, interface scattering, and mixed scattering, respectively. Based on the assumption of different dominant backscatter mechanisms, inversions are carried out for each data set. The estimation results can correctly identify the dominant backscatter mechanisms in nine inversions. Although the selected seabed parameters and simulated data sets may differ from the actual seabed situation, it is enough to verify the effectiveness of proposed method.\n\nThe remainder of this paper is organized as follows. Section 2 describes the scatter models for calculation of scattering strength, Bayesian inference, and sampling method. Section 3 presents the simulation study of the method to identify the dominant backscatter mechanism. Finally, Section 4 summarizes and discusses this work.\n\n#### 2. Materials and Methods\n\nFor each set of observation data, the relative entropy estimation steps of identification scheme are as follows: (a) parameter inversions are carried out based on the assumption of different dominant backscatter mechanisms; (b) the sample values from the posterior probability density are used to calculate the relative entropy; (c) the values of relative entropy based on different assumptions are compared with each other to identify the dominant backscatter mechanism. To implement the above steps, this section describes the calculation process of scatter strength, Bayesian inference, and sampling method.\n\n##### 2.1. Scatter Model\n\nAlthough the separation of scattering into separate, independent roughness and volume components is somewhat artificial , it is meaningful to understand the scattering mechanism better by discussing them separately. Before introducing the model calculation, the geometric model of sound propagation is established as shown in Figure 1.\n\nThe in-water wave vectors of incident and scattered directions are defined as follows:where is the acoustic wavenumber in water. and are velocity of sound in water and acoustic frequency. Thus, the horizontal components and vertical component of the above wave vectors, respectively, arewhere the uppercase, boldface symbols represent the horizontal components. The following wave vector differences needed in the model calculation are defined:Based on Snell’s law, the wave vectors for the incident and scattered compressional waves in the sediment arewhere is the acoustic complex speed ratio and its expression will be given in the next part. Then the in-sediment three-dimensional Bragg vector isIn the calculation below, the magnitude of a difference vector is denoted without boldface. Assuming that seafloor is isotropic in the statistical sense, we may set , for backscatter.\n\n###### 2.1.1. Roughness Scattering Model\n\nThere are two most widely used approximations for acoustic scattering by seafloor roughness, which are the small-roughness perturbation method (sometimes known as Rayleigh–Rice perturbation theory) and the Kirchhoff approximation (also known as the tangent-plane approximation). The perturbation theory tends to be most accurate for scattering at wide angles relative to the specular (flat-interface reflection) direction and the Kirchhoff approximation is better for scattering near the specular direction. The complementary behaviour of the Kirchhoff and perturbation approximations has led numerous investigators to combine the two in the composite-roughness approximation. Luckily, there is a kind of approximation method entitled small slope approximation [20, 21] which can provide a single expression that covers all angles and is likely to be at least as accurate as either the Kirchhoff or perturbation approximations. To predict roughness scattering strength, five parameters are needed, which are roughness spectral exponent , roughness spectral strength , ratio of sound velocity in sediment to , ratio of sediment density to water density and, ratio of the imaginary and real parts of complex compressional speed. The final expression of scattering strength and calculation process are as follows :Assuming that the roughness follows pure power law, the Kirchhoff integral iswhere is the zeroth-order cylindrical Bessel function of the first kind and and are as follows: is the square of the “structure constant” which is related to the parameters of the power-law spectrum throughwhere is the gamma function. The final expression of factor iswhere is the flat-interface reflection coefficient,where is the acoustic complex speed ratio which is defined asSo far, the scattering strength can be finally obtained.\n\n###### 2.1.2. Volume Scattering Model\n\nCompared to the hard sediment, the soft sediment with heterogeneities could produce appreciable levels of scattering strength without considering the possible presence of embedded shells and bubbles. The reason is that the sound speed in soft sediment is similar with and the sound can easily transmit into and out of sediment. Typical soft sediment is mud compared with sand.\n\nSix parameters are needed for the calculation of the volume scattering strength. , , and have been defined before. The other three parameters are density fluctuations spectral exponent , density fluctuations spectral strength , and which is a dimensionless parameter describing the correlation between the spectrums of sediment compressibility fluctuations and density fluctuations. If the volume scattering strength is independent of depth, the expression for is [22, 23]Equation (21) forms the basis for several sediment volume scattering models, which differ only in the assumption and approximation used to obtain the volume scattering cross section . Here the Small-Perturbation Fluid Approximation, which is also called Born approximation, is used to calculate through where is the spectrum for density fluctuations with the pure power law form:At last, the scattering strength of roughness and volume scattering (mixed scattering model) can be obtained through\n\n##### 2.2. Bayesian Inference for Relative Entropy\n\nA more detailed description of Bayesian inference applied to different inverse problems can be referred to . Bayesian inference is an ideal tool to handle uncertainties analysis instead of point estimation based on global optimization algorithm. Intuitively, all model parameters are considered as random variables. When a set of observations (scattering strength) and the scattering model are determined, the PPD of parameter vector can be written aswhere is the prior probability distribution of and is conditional probability distribution of observations and is generally considered as likelihood function. is independent with and is usually considered as constant. Then the PPD can be written asAssuming zero-mean Gaussian-distributed errors, the likelihood can be expressed aswhere is the dimension of , denotes the vector predicted by the scattering model, and is a diagonal data covariance matrix. One- and two-dimensional marginal PPD can be obtained as follows:where the non-boldface symbols , represent members of vector . For the prior probability distribution and PPD, the expression of relative entropy is This quantity is nonnegative and nonsymmetric and reflects the difference of information carried by the two distributions. The larger relative entropy means that the posterior probability is more concentrated compared to the prior probability. For the inversion results in this paper, the more concentrated posterior probability means the observation data and the model match better and corresponds to the dominant backscatter mechanism.\n\nThe integral equations (28), (29), and (30) that need to be solved are rewritten in the following uniform formBased on the theory of Monte Carlo, if the integral does not have an analytic solution, we can rewrite (31) as follows:So the integral becomes the mean of on the distribution function . If we get a large number of samples , from , the integral can be approximately equal toIf samples are generated from , the calculation process can be further simplified byIn some literatures, multiple maximum posterior (MAP) estimation methods [28, 29] are used to get samples with unknown such as genetic algorithm (GA) and obtain parameter uncertainty estimation by equation (34). The samples may be too concentrated near the MAP estimation and do not represent the true target distribution. So we need more rigorous sampling method which will be described in the next part.\n\n##### 2.3. DiffeRential Evolution Adaptive Metropolis\n\nIn order to obtain samples from target distribution, MCMC algorithm is the main and effective method. Its basic idea is constructing a Markov chain which can explore the parameter space and gradually converge to its equilibrium distribution. The key that affects the efficiency of the algorithm is whether an optimal starting point and proposal distribution can be found. The starting point can be a MAP estimation which we get from global optimization algorithm such as GA, Simulated Annealing (SA). Compared with starting point, proposed distribution has a larger impact on convergence efficiency. The proposed distribution actually affects the parameter perturbation and the efficiency of exploring the entire parameter space. Compared to many other improved MCMC algorithms, DREAM has proved its excellent performance on target distribution sampling involving nonlinearity, high dimensionality, and multimodality .\n\nIn general, the probability to accept candidate state as the next state of within Markov chain iswhere and are the posterior probability density of parameter vectors at different time and and are the conditional probabilities of chain moves from to and to , respectively. For DREAM, the conditional probability distribution is symmetric and the accepted probability of candidate state can be written asThen a random sample taken from a uniform distribution will be compared with . The candidate state will be accepted as the next state of if . Otherwise, the next state will remain the same with . The efficiency of this seemingly simple process will be significantly affected by parameter perturbation until the chain finally explores the entire parameter space. DREAM uses N Markov chains and differential evolution to expedite the exploration process. The candidate state of the No. chain is updated bywhere is a subset ( dimensional) of parameter space ( dimensional). Equation (37) in addition to (38) means there are only parameters changed by and keep the rest parameters unchanged within the No.i chain. The values of vector and are sampled independently from a multivariate normal distribution and a multivariate uniform distribution , respectively, with default values and . denotes the number of chains used to generate the perturbation. and denote the No.j element of vectors and consisting of integers drawn without replacement from . is the jump rate which is periodically with a chance to enhance the probability of jumps between disconnected modes of the target distribution. Then the candidate state of No. chain at is\n\n#### 3. Results and Discussion\n\nIn this paper, the dominant acoustic backscatter mechanism is identified by the relative entropy. For each set of observations, three inversions are conducted based on the assumption of different dominant acoustic backscatter mechanisms, which are interface roughness scattering, volume scattering, and both interface roughness and volume scattering (mixed scattering). Once all inversions are completed, the relative entropy for each inversion is calculated to measure the amount of information generated by observations and selected model.\n\nAs described in Section 2.2, when the observation data and the used model match best, the largest relative entropy which corresponds to the main scattering mechanism can be obtained. The modification process of acoustic scattering model motivated by the mismatch of data and model is actually a process of modification and addition of additional physical mechanisms . Models that consider more scattering mechanisms will match the data best. In other words, the inversion results based on the assumption of mixed scattering may have the largest relative entropy. That doesn’t mean the dominant acoustic backscatter mechanism is mixed scattering due to the good fitting performance of mixed scattering model. We also have to consider whose relative entropy of the assumption is very close to that of mixed scattering. Only if the relative entropys of the other two mechanisms are both smaller than that of the mixed scattering, it can be considered that the dominant backscatter mechanism is mixed scattering.\n\nIn this section, the proposed identification method is validated by nine simulated-data inversions. There are three sets of geoacoustic parameters, which are selected referring to , representing a sandy seabed and two types of muddy seabed. Parameter set_1 represents the sandy seabed corresponding to the dominant backscatter mechanism of roughness scattering. Parameter set_2 represents the muddy seabed with dominant backscatter mechanism of volume scattering. The last parameter set of muddy seabed corresponds to the dominant backscatter mechanism of mixed scattering. True values of the parameter sets needed for the calculation of scattering strength are given in Table 1. For each sediment type, the scattering strength is computed for roughness scattering, volume scattering, and mixed scattering. Random errors are added to the true predicted scattering strength through where denotes the vector of true predicted scattering strength and denotes the observation data vector, which is used for inversions. Each element of is drawn from the standard normal distribution. “” represents the operation: . The angular and frequency ranges for are 10°~85° and , respectively. Each of the three observation data sets is inverted once assuming each of the three types of scattering.\n\nFigure 2 shows the marginal PPD of each parameter from the inversion results for the true roughness scattering data. The red line, green line, and blue dotted line represent the inversion results based on roughness scattering model, volume scattering model, and mixed scattering model, respectively. It can be seen that inversion results of the mixed scattering model are better than that of the other two models on the whole. For the common parameters , , and , inversion results of roughness scattering model are better than that of volume scattering model. The marginal PPDs of , , and do not concentrate near the truth value; some even deviate from the truth value due to the dominant backscatter mechanism. Thus, we can probably judge that the dominant backscatter mechanism of this observation data is roughness scattering.\n\nIn addition to the uncertainty of the parameters, we can also obtain the uncertainty of predicted scattering strength calculated by the uncertainty of the parameters, as shown in Figure 3. It can be seen that the trend of uncertainty is consistent with the true scattering strength. Compared with large () and small () grazing angle, the uncertainty of predicted scattering strength for intermediate range of grazing angle is larger due to the larger error of observations. The drop above the critical angle of is due to the increased penetration into sediment and it is a unique characteristic of sandy seabed .\n\nThe inversion results in Figure 4 for true volume scattering are similar with the results in Figure 2. The difference is that inversion results of volume scattering model are better than that of roughness scattering model. Due to the real dominant backscatter mechanism, parameters , , which describe the interface roughness, are not properly estimated. The inversion result of of mixed scattering model is obviously better than that of volume scattering model and roughness scattering model. For the other five parameters, the PPDs of mixed scattering model and volume scattering model are similar in general.\n\nThere is no drop for the predicted scattering strength of muddy seabed in Figure 5 since mud has a similar sound speed with water. This feature is often used to distinguish sandy and muddy seabed. Volume scattering strength does not keep increasing at nearly vertical angles. In a mixed scattering situation, the main contribution of volume scattering to total scattering focuses on the small to medium grazing angle and sometimes eliminates the drop above the critical angle of rough scattering as shown in Figure 7.\n\nFigure 6 shows the inversion results for the observations of scattering strength with true mixed scattering. Obviously, the inversion results of mixed scattering model are more satisfied than that of roughness and volume scattering model. However, it can be seen that the PPDs of parameters and are relatively poor compared with the results in Figure 4.\n\nEach of the three dada sets is inverted once assuming each of the three types of scattering, and the relative entropy is calculated for each of the nine inversions which are shown in Table 2. It is not difficult for us to find that the magnitude of the relative entropy corresponds essentially to the quality of the previous inversion results. For the true roughness scattering, the relative entropy of assumed roughness scattering is very close to that of assumed mixed scattering which is the maximum. The other two largest relative entropys’ assumptions all correspond to the true scattering mechanisms. The relative entropy correctly identifies the dominant backscatter mechanism in all cases. For the true mixed scattering, the relative entropy of assumed volume scattering is far less than that of assumed roughness scattering, which means the contribution of roughness scattering to total scattering is much larger. This difference also explains why the PPDs of parameters and in Figure 6 are relatively poor compared with the results in Figure 4.\n\n#### 4. Conclusions\n\nThis paper proposed a method to remotely identify the dominant acoustic backscatter mechanism of water-seabed interface based on the relevant parameters uncertainty estimation. Three mechanisms for seabed scattering are considered: scattering from a rough water-seabed interface, scattering from volume heterogeneities, and mixed scattering from both interface roughness and volume heterogeneities. High-frequency seafloor roughness scattering and volume scattering are modelled based on Fluid Theories using Small-Slope Approximation and Small-Perturbation Fluid Approximation without considering the influence of the stratification of seabed sediments, respectively. An identification scheme based on the relative entropy is proposed for determining the dominant acoustic backscatter mechanism. The relative entropy is an optimal criterion used to describe the difference between prior probability distribution and PPD and it is suitable for nonlinear model, measuring the amount of information generated by observations and selected model. The identification scheme is tested using inversions of three simulated scattering data sets and it correctly identifies the dominant acoustic backscatter mechanisms. The simulation results indicate that the proposed method is promising and appears capable of distinguishing sediment volume from interface roughness scattering.\n\n#### Data Availability\n\nThe data used to support the findings of this study are available from the corresponding author upon request.\n\n#### Conflicts of Interest\n\nThe authors declare that there are no conflicts of interest regarding the publication of this paper.\n\n#### Acknowledgments\n\nThis study was supported by the National Key Research and Development Program of China [No. 2016YFC1401203, No. 2018YFC1407400] and the National Natural Science Foundation of China [No. 41706106]." ]
[ null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.8702621,"math_prob":0.90835553,"size":33121,"snap":"2023-40-2023-50","text_gpt3_token_len":6769,"char_repetition_ratio":0.16169943,"word_repetition_ratio":0.08238173,"special_character_ratio":0.19854473,"punctuation_ratio":0.1461908,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.98664194,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2023-12-05T01:24:16Z\",\"WARC-Record-ID\":\"<urn:uuid:b5e81e3c-53a5-432d-ab7a-1df1d7e97481>\",\"Content-Length\":\"950628\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:d770c9cf-31f4-43c9-b858-2bd23e27f321>\",\"WARC-Concurrent-To\":\"<urn:uuid:48877f52-9ad1-4e17-86ef-e1218e09af27>\",\"WARC-IP-Address\":\"172.64.147.13\",\"WARC-Target-URI\":\"https://www.hindawi.com/journals/mpe/2018/4272436/\",\"WARC-Payload-Digest\":\"sha1:L6QI644AAETBHLNNDRI2BYNZSRABKDSM\",\"WARC-Block-Digest\":\"sha1:62ZNJ2D5B43K2ZOBOBGKI25KJ77TNRQQ\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2023/CC-MAIN-2023-50/CC-MAIN-2023-50_segments_1700679100540.62_warc_CC-MAIN-20231205010358-20231205040358-00806.warc.gz\"}"}
https://www.stat.math.ethz.ch/pipermail/r-help/2018-October/456902.html
[ "# [R] fixef.plm: Extract the Fixed Effects\n\nJayashree Raman j@y@@hreer@m@n @ending from berkeley@edu\nSun Oct 21 03:08:04 CEST 2018\n\n```Hello,\n\nI am trying to predict using a fixed effects model on an unbalanced\npanel. I tried using the code in the example but the fitted values I\nget are very different from the fitted values using observed value -\nresidual. I am giving my code snippet here:\n\npanel.data.train <- plm.data(train_data, index = c(\"session_start\",\"userid\"))\n\nmdl_fe <-plm(session_length~age+session_length_mvavg, data =\npanel.data.train, model = \"within\")\n\n##Summaries\nsummary(mdl_fe)\nfixefs <- fixef(mdl_fe)[index(mdl_fe, which = \"userid\")]\nfit_hand <- fixefs + mdl_fe\\$coefficients * panel.data.train\\$age +\nmdl_fe\\$coefficients * panel.data.train\\$session_length_mvavg\nfitval <- panel.data.train\\$session_length-mdl_fe\\$residuals\n\nAlso when I tried the prediction function from the prediction package,\nI get the following error:\nError in crossprod(beta, t(X)) : non-conformable arguments\n\nAny help is appreciated.\n\nThanks!\nJayashree\n\n```" ]
[ null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.65036476,"math_prob":0.48121732,"size":1210,"snap":"2020-45-2020-50","text_gpt3_token_len":328,"char_repetition_ratio":0.12852405,"word_repetition_ratio":0.0,"special_character_ratio":0.25454545,"punctuation_ratio":0.16591929,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.97489256,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2020-10-20T07:16:22Z\",\"WARC-Record-ID\":\"<urn:uuid:f5a7eee1-af5f-4722-9201-b22887514189>\",\"Content-Length\":\"3991\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:250eb04d-989f-4783-a7be-4d6fed2a8dc6>\",\"WARC-Concurrent-To\":\"<urn:uuid:2fc267d7-5d0b-486e-b461-5dce331c5a94>\",\"WARC-IP-Address\":\"129.132.119.195\",\"WARC-Target-URI\":\"https://www.stat.math.ethz.ch/pipermail/r-help/2018-October/456902.html\",\"WARC-Payload-Digest\":\"sha1:FWHOGJB436QEE6KMGCVKMCCOOBRR52TL\",\"WARC-Block-Digest\":\"sha1:KP72B6SMFJZHKK7XXISBVGCLGBXZQW3Z\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2020/CC-MAIN-2020-45/CC-MAIN-2020-45_segments_1603107869933.16_warc_CC-MAIN-20201020050920-20201020080920-00427.warc.gz\"}"}
https://kostasamplianitis.com/?publications=3d-reconstructions-uncalibrated-image-pair
[ "", null, "Konstantinos Amplianitis, Bachelor Thesis, Supervisor: Prof. Elli Petsa\nPublication year: 2009\n\n### Abstract\n\nThis thesis is about creating a number of projective reconstructions of objects, with input data a set of point correspondences measured in a pair of images. Through these points, the Fundamental Matrix is first determined and subsequently, the Essential Matrix through the former. In both cases, 4 different types of reconstructions are created (2 with linear DLT intersections and 2 with non-linear), with the main difference that the reconstructions arising from the Fundamental Matrix lack the internal (calibration) information of the cameras, hence are projectively distorted. In contrast, the reconstruction arising from the Essential Matrix is similar to the real object, since the pair of the projection camera matrices computed includes the interior orientation of the images. To this purpose, algorithms in MatLab have been developed which take as input the coordinates of the corresponding points in two images, calculate first the Fundamental Matrix and subsequently the Essential Matrix from the former. Then, a number of pairs of projective camera matrices are computed, using the Fundamental and Essential Matrices, whereby, in the photogrammetric sense, the projective camera matrices reflect the interior and relative orientations of the cameras. Next, an intersection is programmed using the linear and non linear method of the Direct Linear Triangulation (DLT). In this thesis, the fundamental theoretical background is presented as well as the analysis of the algorithms developed for this purpose. Finally, a presentation, analysis and testing of the application algorithms with simulated and real data is included." ]
[ null, "https://kostasamplianitis.com/wp-content/uploads/2017/07/bachelor_cover-pdf.jpg", null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.9154815,"math_prob":0.9357821,"size":1637,"snap":"2022-27-2022-33","text_gpt3_token_len":295,"char_repetition_ratio":0.13165952,"word_repetition_ratio":0.0,"special_character_ratio":0.17104459,"punctuation_ratio":0.10294118,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.97861356,"pos_list":[0,1,2],"im_url_duplicate_count":[null,4,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2022-08-08T09:56:50Z\",\"WARC-Record-ID\":\"<urn:uuid:ed33e3ea-1750-4886-bb90-e67b7808ee96>\",\"Content-Length\":\"38342\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:1f9e2e4e-5a8e-49bf-948e-72867117197c>\",\"WARC-Concurrent-To\":\"<urn:uuid:f9296b42-8159-400c-9295-c7f2eca68af7>\",\"WARC-IP-Address\":\"95.216.16.146\",\"WARC-Target-URI\":\"https://kostasamplianitis.com/?publications=3d-reconstructions-uncalibrated-image-pair\",\"WARC-Payload-Digest\":\"sha1:AGCTWSLTX6N3XQK6AGJRK7QZJRLAOX3A\",\"WARC-Block-Digest\":\"sha1:ES243CXVSN5HRWMGOJF5IR7BNWYMLIEF\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2022/CC-MAIN-2022-33/CC-MAIN-2022-33_segments_1659882570793.14_warc_CC-MAIN-20220808092125-20220808122125-00480.warc.gz\"}"}
https://statecancerprofiles.cancer.gov/historicaltrend/data.php?0&0209&999&7599&001&058&00&2&0&0&2&1&1&1&4
[ "", null, "", null, "Historical Trends > Interpret\n\n## Interpretation of Historical Trends Data\n\n### Historical Trends (1975-2018)\n\nMortality, Connecticut, Uterus (Corpus & Uterus, NOS), All Races (incl Hisp), All Ages, Female\n\n#### Mortality, Connecticut, Uterus (Corpus & Uterus, NOS), All Races (incl Hisp), All Ages, Female\n\nLine graph with 44 years and 2 segments\nDuring 1975-1993, the APC1 in the rate of cancer was falling: -2.3 with a 95% confidence interval from -3.4 to -1.2.\nDuring 1993-2018, the APC1 in the rate of cancer was stable: 0.4 with a 95% confidence interval from -0.2 to 1.1.\nYearly points:\nIn 1975, the observed rate was 4.7. The estimated rate was 6.1.\nIn 1976, the observed rate was 5.6. The estimated rate was 6.0.\nIn 1977, the observed rate was 6.1. The estimated rate was 5.8.\nIn 1978, the observed rate was 5.4. The estimated rate was 5.7.\nIn 1979, the observed rate was 5.5. The estimated rate was 5.6.\nIn 1980, the observed rate was 6.0. The estimated rate was 5.4.\nIn 1981, the observed rate was 5.3. The estimated rate was 5.3.\nIn 1982, the observed rate was 5.9. The estimated rate was 5.2.\nIn 1983, the observed rate was 4.9. The estimated rate was 5.1.\nIn 1984, the observed rate was 5.4. The estimated rate was 4.9.\nIn 1985, the observed rate was 5.6. The estimated rate was 4.8.\nIn 1986, the observed rate was 4.9. The estimated rate was 4.7.\nIn 1987, the observed rate was 4.6. The estimated rate was 4.6.\nIn 1988, the observed rate was 3.6. The estimated rate was 4.5.\nIn 1989, the observed rate was 4.8. The estimated rate was 4.4.\nIn 1990, the observed rate was 3.6. The estimated rate was 4.3.\nIn 1991, the observed rate was 5.0. The estimated rate was 4.2.\nIn 1992, the observed rate was 3.3. The estimated rate was 4.1.\nIn 1993, the observed rate was 3.4. The estimated rate was 4.0.\nIn 1994, the observed rate was 3.6. The estimated rate was 4.0.\nIn 1995, the observed rate was 4.0. The estimated rate was 4.0.\nIn 1996, the observed rate was 4.7. The estimated rate was 4.1.\nIn 1997, the observed rate was 3.9. The estimated rate was 4.1.\nIn 1998, the observed rate was 3.8. The estimated rate was 4.1.\nIn 1999, the observed rate was 4.3. The estimated rate was 4.1.\nIn 2000, the observed rate was 3.3. The estimated rate was 4.1.\nIn 2001, the observed rate was 4.3. The estimated rate was 4.1.\nIn 2002, the observed rate was 3.8. The estimated rate was 4.2.\nIn 2003, the observed rate was 4.1. The estimated rate was 4.2.\nIn 2004, the observed rate was 4.7. The estimated rate was 4.2.\nIn 2005, the observed rate was 4.6. The estimated rate was 4.2.\nIn 2006, the observed rate was 4.5. The estimated rate was 4.2.\nIn 2007, the observed rate was 4.9. The estimated rate was 4.3.\nIn 2008, the observed rate was 3.4. The estimated rate was 4.3.\nIn 2009, the observed rate was 4.9. The estimated rate was 4.3.\nIn 2010, the observed rate was 4.1. The estimated rate was 4.3.\nIn 2011, the observed rate was 4.2. The estimated rate was 4.3.\nIn 2012, the observed rate was 5.0. The estimated rate was 4.4.\nIn 2013, the observed rate was 4.0. The estimated rate was 4.4.\nIn 2014, the observed rate was 4.0. The estimated rate was 4.4.\nIn 2015, the observed rate was 4.5. The estimated rate was 4.4.\nIn 2016, the observed rate was 4.2. The estimated rate was 4.4.\nIn 2017, the observed rate was 4.8. The estimated rate was 4.5.\nIn 2018, the observed rate was 4.0. The estimated rate was 4.5.\n\nNotes:\n• Created by statecancerprofiles.cancer.gov on 06/19/2021 2:28 pm.\n• Regression lines calculated using the Joinpoint Regression Program (Version 4.8.0.0).\n• 1 The APC is the Annual Percent Change over the time interval. Rates used in the calculation of the APC are age-adjusted to the 2000 US standard population (19 age groups: <1, 1-4, 5-9, ... , 80-84, 85+).\n\n• Explanation of the Calculation of the Trend:\n• If the APC is less than -1.5, the trend is falling.\n• If the APC is between -1.5 and -0.5, the trend is slightly falling.\n• If the APC is between -0.5 and 0.5, the trend is statistically stable.\n• If the APC is between 0.5 and 1.5, the trend is slightly rising.\n• If the APC is greater than 1.5, the trend is rising.\n• Source: Incidence data provided by the SEER Program and the National Program of Cancer Registries SEER*Stat Database (2001-2017) - United States Department of Health and Human Services, Centers for Disease Control and Prevention (based on the 2019 submission). Rates calculated by the National Cancer Institute using SEER*Stat. Rates are age-adjusted to the 2000 US standard population (19 age groups: <1, 1-4, 5-9, ... , 80-84, 85+). Rates are for invasive cancer only (except for bladder cancer which is invasive and in situ) or unless otherwise specified. Population counts for denominators are based on Census populations as modified by NCI. The US populations included with the data release have been adjusted for the population shifts due to hurricanes Katrina and Rita for 62 counties and parishes in Alabama, Mississippi, Louisiana, and Texas. The 1969-2017 US Population Data File is used with SEER November 2017 data. Rates and trends in this graph are computed using the same standard for malignancy. For more information see malignant.html\n\nSource: Death data provided by the National Vital Statistics System public use data file. Death rates calculated by the National Cancer Institute using SEER*Stat. Death rates (deaths per 100,000 population per year) are age-adjusted to the 2000 US standard population (19 age groups: (<1, 1-4, 5-9, ... , 80-84, 85+). Population counts for denominators are based on Census populations as modified by NCI. The US populations included with the data release have been adjusted for the population shifts due to hurricanes Katrina and Rita for 62 counties and parishes in Alabama, Mississippi, Louisiana, and Texas. 1969-2017 US Population Data File is used with mortality data." ]
[ null, "https://statecancerprofiles.cancer.gov/i/icn-home.png", null, "https://statecancerprofiles.cancer.gov/i/arrow-crumb.png", null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.9658833,"math_prob":0.9473307,"size":5851,"snap":"2021-21-2021-25","text_gpt3_token_len":1801,"char_repetition_ratio":0.37335387,"word_repetition_ratio":0.41674876,"special_character_ratio":0.33259273,"punctuation_ratio":0.2239726,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9985814,"pos_list":[0,1,2,3,4],"im_url_duplicate_count":[null,null,null,null,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2021-06-19T18:28:22Z\",\"WARC-Record-ID\":\"<urn:uuid:5329efb8-4329-4e52-9e8a-f029b16ff171>\",\"Content-Length\":\"18462\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:b6d7cd2b-e1c8-479c-9ff6-c4cfd3ecb00b>\",\"WARC-Concurrent-To\":\"<urn:uuid:8eba307a-67f4-4374-b985-9ffdd609b890>\",\"WARC-IP-Address\":\"131.226.202.20\",\"WARC-Target-URI\":\"https://statecancerprofiles.cancer.gov/historicaltrend/data.php?0&0209&999&7599&001&058&00&2&0&0&2&1&1&1&4\",\"WARC-Payload-Digest\":\"sha1:IWKKFSZ5Y3QLONCXBQUZX2YYW4JXU33Q\",\"WARC-Block-Digest\":\"sha1:ENGVUDXMT5BEJV4V2OUCEBNZJOI67NWF\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2021/CC-MAIN-2021-25/CC-MAIN-2021-25_segments_1623487649688.44_warc_CC-MAIN-20210619172612-20210619202612-00156.warc.gz\"}"}
https://www.geeksforgeeks.org/optimized-naive-algorithm-for-pattern-searching/?type=article&id=13270
[ "", null, "GeeksforGeeks App\nOpen App", null, "Browser\nContinue\n\n# Optimized Algorithm for Pattern Searching\n\nQuestion: We have discussed the Naive String matching algorithm here. Consider a situation where all characters of a pattern are different. Can we modify the original Naive String Matching algorithm so that it works better for these types of patterns? If we can, then what are the changes to the original algorithm?\n\nSolution: In the original Naive String matching algorithm, we always slide the pattern by 1. When all characters of the pattern are different, we can slide the pattern by more than 1. Let us see how can we do this. When a mismatch occurs after j matches, we know that the first character of the pattern will not match the j-matched characters because all characters of the pattern are different. So we can always slide the pattern by j without missing any valid shifts. Following is the modified code that is optimized for the special patterns.\n\nN.B:  This algorithm only works when the search pattern pat has all different characters.\n\n## C++\n\n `/* C++ program for A modified Naive Pattern Searching``algorithm that is optimized for the cases when all``characters of pattern are different */``#include ``using` `namespace` `std;` `/* A modified Naive Pattern Searching``algorithm that is optimized for the``cases when all characters of pattern are different */``void` `search(string pat, string txt)``{``    ``int` `M = pat.size();``    ``int` `N = txt.size();``    ``int` `i = 0;` `    ``while` `(i <= N - M) {``        ``int` `j;` `        ``/* For current index i, check for pattern match */``        ``for` `(j = 0; j < M; j++)``            ``if` `(txt[i + j] != pat[j])``                ``break``;` `        ``if` `(j == M) ``// if pat[0...M-1] = txt[i, i+1, ...i+M-1]``        ``{``            ``cout << ``\"Pattern found at index \"` `<< i << endl;``            ``i = i + M;``        ``}``        ``else` `if` `(j == 0)``            ``i = i + 1;``        ``else``            ``i = i + j; ``// slide the pattern by j``    ``}``}` `/* Driver code*/``int` `main()``{``    ``string txt = ``\"ABCEABCDABCEABCD\"``;``    ``string pat = ``\"ABCD\"``;``    ``search(pat, txt);``    ``return` `0;``}` `// This code is contributed by rathbhupendra`\n\n## C\n\n `/* C program for A modified Naive Pattern Searching``  ``algorithm that is optimized for the cases when all``  ``characters of pattern are different */``#include ``#include ` `/* A modified Naive Pattern Searching algorithm that is optimized``   ``for the cases when all characters of pattern are different */``void` `search(``char` `pat[], ``char` `txt[])``{``    ``int` `M = ``strlen``(pat);``    ``int` `N = ``strlen``(txt);``    ``int` `i = 0;` `    ``while` `(i <= N - M) {``        ``int` `j;` `        ``/* For current index i, check for pattern match */``        ``for` `(j = 0; j < M; j++)``            ``if` `(txt[i + j] != pat[j])``                ``break``;` `        ``if` `(j == M) ``// if pat[0...M-1] = txt[i, i+1, ...i+M-1]``        ``{``            ``printf``(``\"Pattern found at index %d \\n\"``, i);``            ``i = i + M;``        ``}``        ``else` `if` `(j == 0)``            ``i = i + 1;``        ``else``            ``i = i + j; ``// slide the pattern by j``    ``}``}` `/* Driver program to test above function */``int` `main()``{``    ``char` `txt[] = ``\"ABCEABCDABCEABCD\"``;``    ``char` `pat[] = ``\"ABCD\"``;``    ``search(pat, txt);``    ``return` `0;``}`\n\n## Java\n\n `/* Java program for A modified Naive Pattern Searching``algorithm that is optimized for the cases when all``characters of pattern are different */` `class` `GFG {` `    ``/* A modified Naive Pattern Searching``algorithm that is optimized for the``cases when all characters of pattern are different */``    ``static` `void` `search(String pat, String txt)``    ``{``        ``int` `M = pat.length();``        ``int` `N = txt.length();``        ``int` `i = ``0``;` `        ``while` `(i <= N - M) {``            ``int` `j;` `            ``/* For current index i, check for pattern match */``            ``for` `(j = ``0``; j < M; j++)``                ``if` `(txt.charAt(i + j) != pat.charAt(j))``                    ``break``;` `            ``if` `(j == M) ``// if pat[0...M-1] = txt[i, i+1, ...i+M-1]``            ``{``                ``System.out.println(``\"Pattern found at index \"` `+ i);``                ``i = i + M;``            ``}``            ``else` `if` `(j == ``0``)``                ``i = i + ``1``;``            ``else``                ``i = i + j; ``// slide the pattern by j``        ``}``    ``}` `    ``/* Driver code*/``    ``public` `static` `void` `main(String[] args)``    ``{``        ``String txt = ``\"ABCEABCDABCEABCD\"``;``        ``String pat = ``\"ABCD\"``;``        ``search(pat, txt);``    ``}``}` `// This code is contributed by chandan_jnu`\n\n## Python3\n\n `# Python program for A modified Naive Pattern Searching``# algorithm that is optimized for the cases when all``# characters of pattern are different``def` `search(pat, txt):``    ``M ``=` `len``(pat)``    ``N ``=` `len``(txt)``    ``i ``=` `0` `    ``while` `i <``=` `N``-``M:``        ``# For current index i, check for pattern match``        ``for` `j ``in` `range``(M):``            ``if` `txt[i ``+` `j] !``=` `pat[j]:``                ``break``            ``j ``+``=` `1` `        ``if` `j ``=``=` `M:    ``# if pat[0...M-1] = txt[i, i + 1, ...i + M-1]``            ``print` `(``\"Pattern found at index \"` `+` `str``(i))``            ``i ``=` `i ``+` `M``        ``elif` `j ``=``=` `0``:``            ``i ``=` `i ``+` `1``        ``else``:``            ``i ``=` `i ``+` `j    ``# slide the pattern by j` `# Driver program to test the above function``txt ``=` `\"ABCEABCDABCEABCD\"``pat ``=` `\"ABCD\"``search(pat, txt)` `# This code is contributed by Bhavya Jain`\n\n## C#\n\n `/* C# program for A modified Naive Pattern Searching``algorithm that is optimized for the cases when all``characters of pattern are different */` `using` `System;` `class` `GFG {` `    ``/* A modified Naive Pattern Searching``algorithm that is optimized for the``cases when all characters of pattern are different */``    ``static` `void` `search(``string` `pat, ``string` `txt)``    ``{``        ``int` `M = pat.Length;``        ``int` `N = txt.Length;``        ``int` `i = 0;` `        ``while` `(i <= N - M) {``            ``int` `j;` `            ``/* For current index i, check for pattern match */``            ``for` `(j = 0; j < M; j++)``                ``if` `(txt[i + j] != pat[j])``                    ``break``;` `            ``if` `(j == M) ``// if pat[0...M-1] = txt[i, i+1, ...i+M-1]``            ``{``                ``Console.WriteLine(``\"Pattern found at index \"` `+ i);``                ``i = i + M;``            ``}``            ``else` `if` `(j == 0)``                ``i = i + 1;``            ``else``                ``i = i + j; ``// slide the pattern by j``        ``}``    ``}` `    ``/* Driver code*/``    ``static` `void` `Main()``    ``{``        ``string` `txt = ``\"ABCEABCDABCEABCD\"``;``        ``string` `pat = ``\"ABCD\"``;``        ``search(pat, txt);``    ``}``}` `// This code is contributed by chandan_jnu`\n\n## PHP\n\n ``\n\n## Javascript\n\n ``\n\nOutput\n\n```Pattern found at index 4\nPattern found at index 12\n```\n\nTime Complexity: O(N*M), where N is the length of txt and M is the pat length.\nAuxiliary Space: O(1), We are not using any extra space." ]
[ null, "https://media.geeksforgeeks.org/gfg-gg-logo.svg", null, "https://media.geeksforgeeks.org/auth-dashboard-uploads/web-2.png", null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.67861366,"math_prob":0.9686412,"size":7311,"snap":"2023-14-2023-23","text_gpt3_token_len":2264,"char_repetition_ratio":0.14684549,"word_repetition_ratio":0.41377005,"special_character_ratio":0.34550676,"punctuation_ratio":0.15555556,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.99906975,"pos_list":[0,1,2,3,4],"im_url_duplicate_count":[null,null,null,null,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2023-06-05T07:57:48Z\",\"WARC-Record-ID\":\"<urn:uuid:3d79d802-a2b6-4dd6-8f0a-39cc62d93ff2>\",\"Content-Length\":\"257627\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:4da45d70-9742-49de-8e07-e1e1420f40e7>\",\"WARC-Concurrent-To\":\"<urn:uuid:19bee395-3ca0-47d9-b538-e3c9811ffe99>\",\"WARC-IP-Address\":\"23.40.62.17\",\"WARC-Target-URI\":\"https://www.geeksforgeeks.org/optimized-naive-algorithm-for-pattern-searching/?type=article&id=13270\",\"WARC-Payload-Digest\":\"sha1:JKQQO5PJMGITG4ZGSUOACZC3UEVXW3EQ\",\"WARC-Block-Digest\":\"sha1:Q2K45PLCBUIS64ZLGMUHPM4J4LOYKZNI\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2023/CC-MAIN-2023-23/CC-MAIN-2023-23_segments_1685224651325.38_warc_CC-MAIN-20230605053432-20230605083432-00424.warc.gz\"}"}
https://en.essays.club/Mathematics/Applied-Mathematics/Lagrange-Interpolation-Polynomials-14356.html
[ "", null, "# Lagrange Interpolation Polynomials\n\nAutor:   •  August 11, 2019  •  Course Note  •  364 Words (2 Pages)  •  282 Views\n\nPage 1 of 2\n\nInterpolacion\n\n==========\n\nInterpolations\n\nNumerical Analysis\n\nTeacher: Alejandro Haro\n\nYessica Medina Gutiérrez 3040902\n\nActuary\n\n21-02-2018\n\nLagrange Interpolation Polynomials\n\nSuppose that are n+1 points other than the real axis and that f (x) is a function of real value defined over some interval that contains these points. We want to build a polynomial p(x) of degree ≤n that interpolates f (x) and this satisfies\n\nNext we will show that there is at least a degenerate polynomia of degree ≤n that interpolates f (x)\n\nIn this case we look for a polynomial that is canceled in all the points except for .The function\n\n=(x-(x-\n\nit's such a polynomial.Also since x are assumed to be different, so that\n\nAnd this is the solution of the interpolation’s problema in this special case\n\nBut then for an arbitrary function f (x)\n\nTheorem 4.1.-Given a function of real values f (x) and n + 1 different points there exists exactly a polynomial of degree ≤n that interposes in f (x) in those points the summation is called Lagrange form for the points .for example if we have two different points..\n\nThis is the case of linear interpolation written in one of its multiple equivalent forms\n\nNewton Interpolation Polynomials\n\nThe Newton form of the equation of a straight line passing through two points and is\n\nAnd the general form of the equation of the polynomila passing trough n points\n\nTo ilustrate the method for finding the coefficients consider the problem of finding the values for example in the parábola of that pass in the points , and\n\nSustituting\n\ngives\n\nThe calculations can be performed in a systematic manner by using the “divided differences” of the function values.\n\n..." ]
[ null, "https://en.essays.club/i/i/logo.png", null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.85230005,"math_prob":0.98990226,"size":1777,"snap":"2020-45-2020-50","text_gpt3_token_len":424,"char_repetition_ratio":0.15454033,"word_repetition_ratio":0.027027028,"special_character_ratio":0.22284749,"punctuation_ratio":0.05625,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.99841756,"pos_list":[0,1,2],"im_url_duplicate_count":[null,null,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2020-12-05T06:23:50Z\",\"WARC-Record-ID\":\"<urn:uuid:cf4ebc55-3298-43ea-a535-2fc718822729>\",\"Content-Length\":\"16624\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:57ac476d-4228-4afd-87eb-5f712e5863b3>\",\"WARC-Concurrent-To\":\"<urn:uuid:8ee51948-a43f-48a5-9fc9-812ad5c49b69>\",\"WARC-IP-Address\":\"104.238.127.148\",\"WARC-Target-URI\":\"https://en.essays.club/Mathematics/Applied-Mathematics/Lagrange-Interpolation-Polynomials-14356.html\",\"WARC-Payload-Digest\":\"sha1:5JJG3NIF52LSR2GLHIJHMFOUYDW6X6WS\",\"WARC-Block-Digest\":\"sha1:MBCR3HJYP5UY6PL7RHREJYRPXVRQYS6B\",\"WARC-Identified-Payload-Type\":\"application/xhtml+xml\",\"warc_filename\":\"/cc_download/warc_2020/CC-MAIN-2020-50/CC-MAIN-2020-50_segments_1606141746320.91_warc_CC-MAIN-20201205044004-20201205074004-00489.warc.gz\"}"}
https://awm-math.org/abstract/how-do-points-on-plane-curves-generate-fields-let-me-count-the-ways/
[ "Renee Bell, Lehman College\nAuthors: Michael Allen, Robert J. Lemke Oliver, Allechar Serrano Lopez, Tian An Wong\n2023 AWM Research Symposium\nNumber Theory at Primarily Undergraduate Institutions [Organized by Bella Tobin and Leah Sturman]\n\nIn their program on diophantine stability, Mazur and Rubin suggest studying a curve $C$ over $\\mathbb{Q}$ by understanding the field extensions of generated by a single point of $C$; in particular, they ask to what extent the set of such field extensions determines the curve . A natural question in arithmetic statistics along these lines concerns the size of this set: for a smooth projective curve $C$ how many field extensions of $\\mathbb{Q}$ — of given degree and bounded discriminant — arise from adjoining a point of $C$? Can we further count the number of such extensions with specified Galois group? Asymptotic lower bounds for these quantities have been found for elliptic curves by Lemke Oliver and Thorne, for hyperelliptic curves by Keyes, and for superelliptic curves by Beneish and Keyes. We discuss similar asymptotic lower bounds that hold for all smooth plane curves $C$, using tools such as geometry of numbers, Hilbert irreducibility, Newton polygons, and linear optimization." ]
[ null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.88889295,"math_prob":0.9759148,"size":1303,"snap":"2023-40-2023-50","text_gpt3_token_len":291,"char_repetition_ratio":0.103156276,"word_repetition_ratio":0.0,"special_character_ratio":0.19570222,"punctuation_ratio":0.101321585,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.97684413,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2023-12-02T04:37:49Z\",\"WARC-Record-ID\":\"<urn:uuid:e6461416-bc2d-4fc5-82d0-504905af5195>\",\"Content-Length\":\"144802\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:8302d3cb-e744-46f3-a441-8cdae9301554>\",\"WARC-Concurrent-To\":\"<urn:uuid:03072509-cd71-421d-bd80-15bc47be824c>\",\"WARC-IP-Address\":\"35.212.108.173\",\"WARC-Target-URI\":\"https://awm-math.org/abstract/how-do-points-on-plane-curves-generate-fields-let-me-count-the-ways/\",\"WARC-Payload-Digest\":\"sha1:MZPO5AT3ISP7ZGLM6L42O53IDKDXQXD4\",\"WARC-Block-Digest\":\"sha1:GOMNBQH4SETSEVKSZ7UBM6JQZJPYX5Q6\",\"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-00523.warc.gz\"}"}
https://openturns.github.io/openturns/latest/user_manual/statistics_on_sample.html
[ "# Statistics on sample¶\n\n## Sample¶\n\n Sample(*args) Sample of real vectors.\n\n## Building distributions from samples¶\n\n Base class for probability distribution factories. Results of distribution estimation. ArcsineFactory(*args) Arcsine factory. BernoulliFactory(*args) Bernoulli factory. BetaFactory(*args) Beta factory. BinomialFactory(*args) Binomial factory. BurrFactory(*args) Burr factory. ChiFactory(*args) Chi factory. ChiSquareFactory(*args) Chi-Square factory. DiracFactory(*args) Dirac factory. DirichletFactory(*args) Dirichlet factory. ExponentialFactory(*args) Exponential factory. Fisher-Snedecor factory. FrechetFactory(*args) Frechet factory. GammaFactory(*args) Gamma factory. GeneralizedExtremeValue factory. Generalized Pareto factory. GeometricFactory(*args) Geometric factory. GumbelFactory(*args) Gumbel factory. HistogramFactory(*args) Histogram factory. Inverse Normal factory. KernelSmoothing(*args) Non parametric continuous distribution estimation by kernel smoothing. LaplaceFactory(*args) Laplace factory. Least squares factory. LogisticFactory(*args) Logistic factory. LogNormalFactory(*args) Lognormal factory distribution. LogUniformFactory(*args) Log Uniform factory. Maximum likelihood factory. Meixner Distribution factory. Estimation by method of moments. MultinomialFactory(*args) Multinomial factory. Negative Binomial factory. NormalFactory(*args) Normal factory. ParetoFactory(*args) Pareto factory. PoissonFactory(*args) Poisson factory. RayleighFactory(*args) Rayleigh factory. RiceFactory(*args) Rice factory. SkellamFactory(*args) Skellam factory. StudentFactory(*args) Student factory. TrapezoidalFactory(*args) Trapezoidal factory. TriangularFactory(*args) Triangular factory. Truncated Normal factory. UniformFactory(*args) Uniform factory. UserDefinedFactory(*args) UserDefined factory. WeibullMinFactory(*args) WeibullMin factory. WeibullMaxFactory(*args) WeibullMax factory.\n\n## Building copulas from samples¶\n\n AliMikhailHaq copula factory. BernsteinCopula copula factory. Clayton Copula factory. Farlie Gumbel Morgenstern Copula factory. FrankCopulaFactory(*args) Frank Copula factory. Gumbel Copula factory. Normal Copula factory. Plackett Copula factory.\n\n## Correlation analysis¶\n\n Correlation evaluation based on the Pearson correlation coefficient. Correlation evaluation based on the Spearman correlation coefficient. CorrelationAnalysis_PCC(inputSample, …) Correlation evaluation based on the Partial Correlation Coefficient. CorrelationAnalysis_PRCC(inputSample, …) Correlation evaluation based on the Partial Rank Correlation Coefficient. CorrelationAnalysis_SRC(inputSample, …[, …]) Correlation evaluation based on the Standard Regression Coefficient. CorrelationAnalysis_SRRC(inputSample, …[, …]) Correlation evaluation based on the Standard Rank Regression Coefficient. CorrelationAnalysis_SignedSRC(inputSample, …) Correlation evaluation based on the Signed Standard Rank Regression Coefficient.\n\n## Sensitivity Analysis¶\n\n ANCOVA(*args) ANalysis of COVAriance method (ANCOVA). FAST(*args) Fourier Amplitude Sensitivity Testing (FAST). Sensitivity analysis. Sensitivity analysis using Martinez method. Sensitivity analysis using Saltelli method. Sensitivity analysis using Jansen method. Sensitivity analysis using MauntzKucherenko method. Experiment to computeSobol’ indices. Sobol indices computation using iterative sampling. Sobol simulation result.\n\n## Statistical tests¶\n\n TestResult(*args) Test result data structure.\n\n### Goodness-of-fit metrics & tests¶\n\n FittingTest_BIC(\\*args) Compute the Bayesian information criterion. FittingTest_ChiSquared(\\*args) Perform a", null, "goodness-of-fit test for 1-d discrete distributions. FittingTest_Kolmogorov(\\*args) Perform a Kolmogorov goodness-of-fit test for 1-d continuous distributions. Evaluate whether a sample follows a normal distribution. NormalityTest_CramerVonMisesNormal(sample[, …]) Evaluate whether a sample follows a normal distribution.\n\n### Graphical tests¶\n\n VisualTest_DrawCobWeb(inputSample, …[, …]) Draw a Cobweb plot. Draw an Henry plot. Draw kendall plot. VisualTest_DrawLinearModel(sample1, sample2, …) Draw a linear model plot. VisualTest_DrawLinearModelResidual(sample1, …) Draw a linear model residual plot. VisualTest_DrawQQplot(\\*args) Draw a QQ-plot. VisualTest_DrawCDFplot(\\*args) Draw a CDF-plot.\n\n### Hypothesis tests¶\n\n HypothesisTest_ChiSquared(firstSample, …) Test whether two discrete samples are independent. HypothesisTest_FullPearson(firstSample, …) Test whether two discrete samples are independent. HypothesisTest_FullSpearman(firstSample, …) Test whether two samples have no rank correlation. HypothesisTest_PartialPearson(firstSample, …) Test whether two discrete samples are independent. HypothesisTest_PartialSpearman(firstSample, …) Test whether two sample have no rank correlation. HypothesisTest_Pearson(firstSample, secondSample) Test whether two discrete samples are independent. HypothesisTest_Spearman(firstSample, …[, …]) Test whether two samples have no rank correlation. HypothesisTest_TwoSamplesKolmogorov(sample1, …) Test whether two samples follows the same distribution.\n\n### Linear model tests¶\n\n Test the nullity of the linear regression model coefficients. Test zero mean value of the residual of the linear regression model. Test the homoskedasticity of the linear regression model residuals. Test the homoskedasticity of the linear regression model residuals. Test the autocorrelation of the linear regression model residuals. LinearModelTest_FullRegression(firstSample, …) Test whether two discrete samples are not linear. LinearModelTest_PartialRegression(…[, level]) Test whether two discrete samples are independent.\n\n### Model selection¶\n\n Select the best model according to the Bayesian information criterion. Select the best model according to the", null, "goodness-of-fit test. Select the best model according to the Kolmogorov goodness-of-fit test." ]
[ null, "https://openturns.github.io/openturns/latest/_images/math/99669c681d77b95c148aa99983012a861cd45dfe.svg", null, "https://openturns.github.io/openturns/latest/_images/math/99669c681d77b95c148aa99983012a861cd45dfe.svg", null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.6698981,"math_prob":0.8459045,"size":4386,"snap":"2020-45-2020-50","text_gpt3_token_len":1004,"char_repetition_ratio":0.23299862,"word_repetition_ratio":0.24207492,"special_character_ratio":0.23164615,"punctuation_ratio":0.1650641,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.99494743,"pos_list":[0,1,2,3,4],"im_url_duplicate_count":[null,9,null,9,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2020-10-21T15:29:16Z\",\"WARC-Record-ID\":\"<urn:uuid:7fef2b26-c1ee-4e94-9868-e4a7fe376ddd>\",\"Content-Length\":\"51226\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:fe5d3035-3d6b-4082-b8b8-4888d897f8b4>\",\"WARC-Concurrent-To\":\"<urn:uuid:167ed453-5a71-4d05-a29c-cba3ad48a725>\",\"WARC-IP-Address\":\"185.199.108.153\",\"WARC-Target-URI\":\"https://openturns.github.io/openturns/latest/user_manual/statistics_on_sample.html\",\"WARC-Payload-Digest\":\"sha1:FO7MICEXDZB36SFFWYLEE5MTUUUJME7Y\",\"WARC-Block-Digest\":\"sha1:NZRAPDOLW47IMWQ7VSXMF4E4HQLSW4FI\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2020/CC-MAIN-2020-45/CC-MAIN-2020-45_segments_1603107876768.45_warc_CC-MAIN-20201021151342-20201021181342-00337.warc.gz\"}"}
https://number.academy/362
[ "# Number 362\n\nNumber 362 spell 🔊, write in words: three hundred and sixty-two . Ordinal number 362th is said 🔊 and write: three hundred and sixty-second. The meaning of number 362 in Maths: Is Prime? Factorization and dividers. The square root and cube root of 362. The meaning in computer science, numerology, codes and images, writing and naming in other languages, other interesting facts.\n\n## Useful information about number 362\n\nThe decimal (Arabic) number 362 converted to a Roman number is CCCLXII. Roman and decimal number conversions.\n The number 362 converted to a Mayan number is", null, "Decimal and Mayan number conversions.\n\n#### Weight conversion\n\n362 kilograms (kg) = 798.1 pounds (lb)\n362 pounds (lb) = 164.2 kilograms (kg)\n\n#### Length conversion\n\n362 kilometers (km) equals to 224.936 miles (mi).\n362 miles (mi) equals to 582.583 kilometers (km).\n362 meters (m) equals to 1188 feet (ft).\n362 feet (ft) equals 110.339 meters (m).\n362 centimeters (cm) equals to 142.5 inches (in).\n362 inches (in) equals to 919.5 centimeters (cm).\n\n#### Temperature conversion\n\n362° Fahrenheit (°F) equals to 183.3° Celsius (°C)\n362° Celsius (°C) equals to 683.6° Fahrenheit (°F)\n\n#### Power conversion\n\n362 Horsepower (hp) equals to 266.21 kilowatts (kW)\n362 kilowatts (kW) equals to 492.25 horsepower (hp)\n\n#### Time conversion\n\n(hours, minutes, seconds, days, weeks)\n362 seconds equals to 6 minutes, 2 seconds\n362 minutes equals to 6 hours, 2 minutes\n\n### Codes and images of the number 362\n\nNumber 362 morse code: ...-- -.... ..---\nSign language for number 362:", null, "", null, "", null, "Images of the number Image (1) of the number Image (2) of the number", null, "", null, "There is no copyright for these images. Number 362 infographic. More images, other sizes, codes and colors ...\n\n### Gregorian, Hebrew, Islamic, Persian and Buddhist year (calendar)\n\nGregorian year 362 is Buddhist year 905.\nBuddhist year 362 is Gregorian year 181 a. C.\nGregorian year 362 is Islamic year -268 or -267.\nIslamic year 362 is Gregorian year 972 or 973.\nGregorian year 362 is Persian year -261 or -260.\nPersian year 362 is Gregorian 983 or 984.\nGregorian year 362 is Hebrew year 4122 or 4123.\nHebrew year 362 is Gregorian year 3398 a. C.\nThe Buddhist calendar is used in Sri Lanka, Cambodia, Laos, Thailand, and Burma. The Persian calendar is official in Iran and Afghanistan.\n\n## Share in social networks", null, "## Mathematics of no. 362\n\n### Multiplications\n\n#### Multiplication table of 362\n\n362 multiplied by two equals 724 (362 x 2 = 724).\n362 multiplied by three equals 1086 (362 x 3 = 1086).\n362 multiplied by four equals 1448 (362 x 4 = 1448).\n362 multiplied by five equals 1810 (362 x 5 = 1810).\n362 multiplied by six equals 2172 (362 x 6 = 2172).\n362 multiplied by seven equals 2534 (362 x 7 = 2534).\n362 multiplied by eight equals 2896 (362 x 8 = 2896).\n362 multiplied by nine equals 3258 (362 x 9 = 3258).\nshow multiplications by 6, 7, 8, 9 ...\n\n### Fractions: decimal fraction and common fraction\n\n#### Fraction table of 362\n\nHalf of 362 is 181 (362 / 2 = 181).\nOne third of 362 is 120,6667 (362 / 3 = 120,6667 = 120 2/3).\nOne quarter of 362 is 90,5 (362 / 4 = 90,5 = 90 1/2).\nOne fifth of 362 is 72,4 (362 / 5 = 72,4 = 72 2/5).\nOne sixth of 362 is 60,3333 (362 / 6 = 60,3333 = 60 1/3).\nOne seventh of 362 is 51,7143 (362 / 7 = 51,7143 = 51 5/7).\nOne eighth of 362 is 45,25 (362 / 8 = 45,25 = 45 1/4).\nOne ninth of 362 is 40,2222 (362 / 9 = 40,2222 = 40 2/9).\nshow fractions by 6, 7, 8, 9 ...\n\n### Calculator\n\n 362\n\n#### Is Prime?\n\nThe number 362 is not a prime number. The closest prime numbers are 359, 367.\n362th prime number in order is 2441.\n\n#### Factorization and dividers\n\nFactorization 2 * 181 = 362\nDivisors of number 362 are 1 , 2 , 181 , 362\nTotal Divisors 4.\nSum of Divisors 546.\n\n#### Powers\n\nThe second power of 3622 is 131.044.\nThe third power of 3623 is 47.437.928.\n\n#### Roots\n\nThe square root √362 is 19,026298.\nThe cube root of 3362 is 7,126936.\n\n#### Logarithms\n\nThe natural logarithm of No. ln 362 = loge 362 = 5,891644.\nThe logarithm to base 10 of No. log10 362 = 2,558709.\nThe Napierian logarithm of No. log1/e 362 = -5,891644.\n\n### Trigonometric functions\n\nThe cosine of 362 is -0,753882.\nThe sine of 362 is -0,657009.\nThe tangent of 362 is 0,871501.\n\n### Properties of the number 362\n\nIs a Friedman number: No\nIs a Fibonacci number: No\nIs a Bell number: No\nIs a palindromic number: No\nIs a pentagonal number: No\nIs a perfect number: No\n\n## Number 362 in Computer Science\n\nCode typeCode value\nUnix timeUnix time 362 is equal to Thursday Jan. 1, 1970, 12:06:02 a.m. GMT\nIPv4, IPv6Number 362 internet address in dotted format v4 0.0.1.106, v6 ::16a\n362 Decimal = 101101010 Binary\n362 Decimal = 111102 Ternary\n362 Decimal = 552 Octal\n362 Decimal = 16A Hexadecimal (0x16a hex)\n362 BASE64MzYy\n362 MD5c3e878e27f52e2a57ace4d9a76fd9acf\n362 SHA18d6f9131366dac0c298ee725e6577d6e0a54e832\n362 SHA224f957086bbc00be90b4b3ceb222f65c6f73281ef926a56c4269c7e206\n362 SHA2563963317a2b410e5357f4d839787aedb9ceef495514fe5cd91f846ab3a59621e0\nMore SHA codes related to the number 362 ...\n\nIf you know something interesting about the 362 number that you did not find on this page, do not hesitate to write us here.\n\n## Numerology 362\n\n### The meaning of the number 6 (six), numerology 6\n\nCharacter frequency 6: 1\n\nThe number 6 (six) denotes emotional responsibility, love, understanding and harmonic balance. The person with the personal number 6 must incorporate vision and acceptance in the world. Beauty, tenderness, stable, responsible and understanding exchange, the sense of protection and availability also define the meaning of the number 6 (six).\nMore about the meaning of the number 6 (six), numerology 6 ...\n\n### The meaning of the number 3 (three), numerology 3\n\nCharacter frequency 3: 1\n\nThe number three (3) came to share genuine expression and sensitivity with the world. People associated with this number need to connect with their deepest emotions. The number 3 is characterized by its pragmatism, it is utilitarian, sagacious, dynamic, creative, it has objectives and it fulfills them. He/she is also self-expressive in many ways and with communication skills.\nMore about the meaning of the number 3 (three), numerology 3 ...\n\n### The meaning of the number 2 (two), numerology 2\n\nCharacter frequency 2: 1\n\nThe number two (2) needs above all to feel and to be. It represents the couple, duality, family, private and social life. He/she really enjoys home life and family gatherings. The number 2 denotes a sociable, hospitable, friendly, caring and affectionate person. It is the sign of empathy, cooperation, adaptability, consideration for others, supersensitivity towards the needs of others. The number 2 (two) is also the symbol of balance, togetherness and receptivity. He/she is a good partner, colleague or companion; he/she also plays a wonderful role as a referee or mediator. Number 2 person is modest, sincere, spiritually influenced and a good diplomat. It represents intuition and vulnerability.\nMore about the meaning of the number 2 (two), numerology 2 ...\n\n## Interesting facts about the number 362\n\n### Asteroids\n\n• (362) Havnia is asteroid number 362. It was discovered by A. H. Charlois from Nice Observatory on 3/12/1893.\n\n### Distances between cities\n\n• There is a 362 miles (581 km) direct distance between Adana (Turkey) and Jerusalem (Israel).\n• There is a 225 miles (362 km) direct distance between Ahmedabad (India) and Jodhpur (India).\n• There is a 362 miles (582 km) direct distance between Aleppo (Syria) and Antalya (Turkey).\n• There is a 362 miles (582 km) direct distance between Amman (Jordan) and Gaziantep (Turkey).\n• There is a 362 miles (582 km) direct distance between Arequipa (Peru) and Cochabamba (Bolivia).\n• There is a 362 miles (582 km) direct distance between Bareilly (India) and Kathmandu (Nepal).\n• There is a 225 miles (362 km) direct distance between Bhubaneshwar (India) and Hāora (India).\n• There is a 225 miles (362 km) direct distance between Bhubaneshwar (India) and Nowrangapur (India).\n• There is a 362 miles (582 km) direct distance between Ciudad Guayana (Venezuela) and Maracay (Venezuela).\n• There is a 225 miles (362 km) direct distance between Dallas (USA) and Houston (USA).\n• There is a 362 miles (582 km) direct distance between Delhi (India) and Multān (Pakistan).\n• There is a 225 miles (362 km) direct distance between Ecatepec (Mexico) and Gustavo A. Madero (Mexico).\n• There is a 362 miles (581 km) direct distance between Guankou (China) and Jieyang (China).\n• There is a 225 miles (362 km) direct distance between Handan (China) and Tongshan (China).\n• There is a 362 miles (581 km) direct distance between Hefei (China) and Changsha (China).\n• There is a 362 miles (581 km) direct distance between Huaibei (China) and Puyang (China).\n• There is a 362 miles (581 km) direct distance between Huainan (China) and Shiyan (China).\n• There is a 362 miles (582 km) direct distance between Ilorin (Nigeria) and Kano (Nigeria).\n• There is a 362 miles (581 km) direct distance between Kyoto (Japan) and Sendai-shi (Japan).\n• There is a 225 miles (362 km) direct distance between Pingdingshan (China) and Wuhan (China).\n• There is a 362 miles (581 km) direct distance between Puyang (China) and Xiamen (China).\n• There is a 362 miles (581 km) direct distance between Taiyuan (China) and Tongshan (China).\n\n### Games\n\n• Pokémon Glalie (Onigōri, Onigohri) is a Pokémon number # 362 of the National Pokédex. Glalie is Ice-type Pokémon in the third generation. It is a Fairy and Mineral egg group Pokémon. The indexes ontros of Glalie are Sinnoh index 207 , Hoenn index 172 .\n\n### Mathematics\n\n• 362 and its double and triple all use the same number of digits in Roman numerals.\n\n## Number 362 in other languages\n\nHow to say or write the number three hundred and sixty-two in Spanish, German, French and other languages.\n Spanish: 🔊 (número 362) trescientos sesenta y dos German: 🔊 (Anzahl 362) dreihundertzweiundsechzig French: 🔊 (nombre 362) trois cent soixante-deux Portuguese: 🔊 (número 362) trezentos e sessenta e dois Chinese: 🔊 (数 362) 三百六十二 Arabian: 🔊 (عدد 362) ثلاثمائةاثنان و ستون Czech: 🔊 (číslo 362) třista šedesát dva Korean: 🔊 (번호 362) 삼백육십이 Danish: 🔊 (nummer 362) trehundrede og toogtreds Hebrew: (מספר 362) שלש מאות ששים ושנים Dutch: 🔊 (nummer 362) driehonderdtweeënzestig Japanese: 🔊 (数 362) 三百六十二 Indonesian: 🔊 (jumlah 362) tiga ratus enam puluh dua Italian: 🔊 (numero 362) trecentosessantadue Norwegian: 🔊 (nummer 362) tre hundre og seksti-to Polish: 🔊 (liczba 362) trzysta sześćdziesiąt dwa Russian: 🔊 (номер 362) триста шестьдесят два Turkish: 🔊 (numara 362) üçyüzaltmışiki Thai: 🔊 (จำนวน 362) สามร้อยหกสิบสอง Ukrainian: 🔊 (номер 362) триста шiстдесят двi Vietnamese: 🔊 (con số 362) ba trăm sáu mươi hai Other languages ...\n\n## News to email\n\nPrivacy Policy.\n\n## Comment\n\nIf you know something interesting about the number 362 or any natural number (positive integer) please write us here or on facebook." ]
[ null, "https://numero.wiki/s/numeros-mayas/numero-maya-362.png", null, "https://numero.wiki/s/senas/lenguaje-de-senas-numero-3.png", null, "https://numero.wiki/s/senas/lenguaje-de-senas-numero-6.png", null, "https://numero.wiki/s/senas/lenguaje-de-senas-numero-2.png", null, "https://numero.wiki/img/a-362.jpg", null, "https://numero.wiki/img/b-362.jpg", null, "https://numero.wiki/s/share-desktop.png", null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.66894805,"math_prob":0.9814648,"size":9106,"snap":"2021-31-2021-39","text_gpt3_token_len":3018,"char_repetition_ratio":0.1836959,"word_repetition_ratio":0.12302632,"special_character_ratio":0.36569294,"punctuation_ratio":0.1351508,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9679311,"pos_list":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"im_url_duplicate_count":[null,3,null,null,null,null,null,null,null,3,null,3,null,null,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2021-09-28T07:31:57Z\",\"WARC-Record-ID\":\"<urn:uuid:efb2c10b-f63a-4518-851b-5205696d0c54>\",\"Content-Length\":\"44726\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:0dba6e38-ab4a-4eb1-b8c9-02adb0cbd8c8>\",\"WARC-Concurrent-To\":\"<urn:uuid:2af4567d-888b-4500-ae38-4c68420e9381>\",\"WARC-IP-Address\":\"138.201.27.171\",\"WARC-Target-URI\":\"https://number.academy/362\",\"WARC-Payload-Digest\":\"sha1:G5DQPLI7ISPQNB63NFWHPXLTKFKI5H42\",\"WARC-Block-Digest\":\"sha1:ZJF7X5PDS4WRH4GRKP4QJF6PHUETBNXH\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2021/CC-MAIN-2021-39/CC-MAIN-2021-39_segments_1631780060538.11_warc_CC-MAIN-20210928062408-20210928092408-00183.warc.gz\"}"}
https://www.katakata.pro/otal310o/7w1ad.php?id=multiple-linear-regression-python-stack-overflow-02658d
[ "So you want to fit 6-th degree polynomial in python to your data? Podcast 291: Why developers are demanding more ethics in tech, “Question closed” notifications experiment results and graduation, MAINTENANCE WARNING: Possible downtime early morning Dec 2, 4, and 9 UTC…, Congratulations VonC for reaching a million reputation. Instead of a comment explaining what the function does, write a docstring. Stack Exchange network consists of 176 Q&A communities including Stack Overflow, the largest, most trusted online community for developers to learn, share their knowledge, and build their careers. Below is the dataset for which I am trying to implement Linear regression in python. (Docstrings are available from the interactive interpreter via the help function.). To implement multiple linear regression with python you can use any of the following options: 1) Use normal equation method (that uses matrix inverse) Ask Question Asked 1 year ago. This is a simple example of multiple linear regression, and x has exactly two columns. 0. These are of two types: Simple linear Regression; Multiple Linear Regression; Let’s Discuss Multiple Linear Regression using Python. Panshin's \"savage review\" of World of Ptavvs. I searched throw internet but didn't find any solution to select best set of independent variables to draw linear regression and output the variables that had been selected. There are many ways to automatically remove features, and you should cross-validate to determine which one is best for your problem. 0. You are probably looking for a k-fold validation model. Correcting for one of multiple strong batch effects in a dataset. Does your organization need a developer evangelist? I want to make a linear regression out of it. Why is training regarding the loss of RAIM given so much more emphasis than training regarding the loss of SBAS? do you know what it means ? Does Python have a string 'contains' substring method? I am working on a case study on multiple linear regression, ... machine-learning logistic multiple-regression python image-processing. Interest Rate 2. Is it considered offensive to address one's seniors by name in the US? Linear regression is one of the most commonly used algorithms in machine learning. Convert negadecimal to decimal (and back). ... Browse other questions tagged machine-learning python regression linear-regression or ask your own question. Plausibility of an Implausible First Contact. Are static class variables possible in Python? World with two directly opposed habitable continents, one hot one cold, with significant geographical barrier between them. About Us Learn more about Stack Overflow the company ... i have time series data from 2001-2020 of drought index. \\$\\endgroup\\$ – Dave Mar 8 at 14:07. Example of Multiple Linear Regression in Python. Stack Exchange network consists of 176 Q&A communities including Stack Overflow, the largest, most trusted online community for developers to learn, ... \"This is called a multiple linear regression model because more than one regressor is involved. Can a US president give Preemptive Pardons? Best way to let people know you aren't dead, just taking pictures? Regression is a time-tested manner for approximating relationships among a given collection of data, and the recipient of unhelpful naming via unfortunate circumstances.. Predicting an Output Value with Multiple Linear Regression with Missing Data for Regressors So, for a Multiple Linear Regression problem, I have historical data for 8 regressor categories. Were there often intra-USSR wars? Generation of restricted increasing integer sequences. Did China's Chang'e 5 land before November 30th 2020? Below is the dataset for which I am trying to implement Linear regression in python. 开一个生日会 explanation as to why 开 is used here? What is the difference between policy and consensus when it comes to a Bitcoin Core node validating scripts? now i want to use linear regression model for data forcasting and validation. Where did the concept of a (fantasy-style) \"dungeon\" originate? Stack Overflow for Teams is a private, secure spot for you and your coworkers to find and share information. Using this dataset, where multicollinearity is a problem, I would like to perform principal component analysis in Python.I've looked at scikit-learn and statsmodels, but I'm uncertain how to take their output and convert it to the same results structure as SAS. Which game is this six-sided die with two sets of runic-looking plus, minus and empty sides from? I am running (what I think is) as fairly straightforward multiple linear regression model fit using Stats model. Its delivery manager wants to find out if there’s a relationship between the monthly charges of a customer and the tenure of the customer. Ask Question Asked 1 year, 11 months ago. To subscribe to this RSS feed, copy and paste this URL into your RSS reader. yes, that's correct, and in case of negative coefficients, means they are negatively correlated. I know I shouldn't use two variables that are correlated but I don't know which of these variables must be deleted in order to get the best reg line. Does Python have a string 'contains' substring method? Is it more efficient to send a fleet of generation ships or one massive one? Linear regression when dividing the dependent variable by the independent variable The idea is to train your model with your feature selection on (k-1) partitions of your data. Python Select variables in multiple linear regression. ... multiple-regression predictive-models regularization ridge-regression tikhonov-regularization. A deep dive into the theory and implementation of linear regression will help you understand this valuable machine learning algorithm. Stack Overflow en español es un sitio de preguntas y respuestas para programadores y profesionales de la informática. In the following example, we will use multiple linear regression to predict the stock index price (i.e., the dependent variable) of a fictitious economy by using 2 independent/input variables: Interest Rate; Unemployment Rate Step 3: Create a model and fit it 开一个生日会 explanation as to why 开 is used here? I am able to get a single data set to display the linear regression but when I have to groups I can't get the line to display? We’re living in the era of large amounts of data, powerful computers, and artificial intelligence.This is just the beginning. Data science and machine learning are driving image recognition, autonomous vehicles development, decisions in the financial and energy sectors, advances in medicine, the rise of social networks, and more. Stack Overflow for Teams is a private, secure spot for you and asked Jul 20 at 14:40. You'll want to get familiar with linear regression because you'll need to use it if you're trying to measure the relationship between two or more continuous values. Does your organization need a developer evangelist? So, he collects all customer data and implements linear regression by taking monthly charges as the dependent variable and tenure as the independent variable. By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy. The problem is some of my independent variables have correlation more than 0.5. site design / logo © 2020 Stack Exchange Inc; user contributions licensed under cc by-sa. Linear regression is one of the most basic and popular algorithms in machine learning. Here I provide a link for sample data that you can use for tests: Ask Question Asked 1 year, 11 months ago. 2) Numpy's least-squares numpy.linalg.lstsq tool Podcast 291: Why developers are demanding more ethics in tech, “Question closed” notifications experiment results and graduation, MAINTENANCE WARNING: Possible downtime early morning Dec 2, 4, and 9 UTC…, Congratulations VonC for reaching a million reputation, Calculate multivariate linear regression with numpy. seaborn components used: set_theme(), load_dataset(), lmplot() We will start with simple linear regression involving two variables and then we will move towards linear regression involving multiple variables. Say, there is a telecom network called Neo. I am working on a case study on multiple linear regression, In which I have added all variables to the model and now I am dropping predictors one by one on the basis of p-value & VIF. This is part three of our series and covers the topic of outlier detection and how to remove outliers. Linear Regression: It is the basic and commonly used type for predictive analysis. asked Nov 18 at 7:55. You can only find out by doing cross validation. Regístrate o inicia sesión para personalizar tu lista. Is there any solution beside TLS for data-in-transit protection? Multiple linear regression. Running Linear Regression with multiple Rasters converted to a numpy array in Python What I did was an array with Rasters from 2000 to 2018. ... Browse other questions tagged regression multiple-regression python or … ... Leer multiples lineas en un fichero en python. Residual analysis in Python. Regístrate para unirte a esta comunidad. Scikit Learn is awesome tool when it comes to machine learning in Python. It is a statistical approach to modelling the relationship between a dependent variable and a given set of independent variables. Variant: Skills with Different Abilities confuses me. How do people recognise the frequency of a played note? Making statements based on opinion; back them up with references or personal experience. ... Plotting in Multiple Linear Regression in Python 3. If you see that you have a correlation between independent variables. Tengo archivo TXT donde son multiples líneas, ... Stack Overflow en español ayuda chat. Linear regression is an important part of this. https://drive.google.com/file/d/0BzzUvSbpsTAvN1UxTkxXd2U0eVE/view, https://www.dropbox.com/s/e3pd7fp0rfm1cfs/DB2.csv?dl=0. I am working using the anaconda distribution of python, but i'd also like to understand the theory of the model if possible. I see you are working with scikit-learn. Formular una pregunta So far I've managed to plot in linear regression, but currently I'm on Multiple Linear Regression and I couldn't manage to plot it, I can get some results if I ... Stack Exchange Network Stack Exchange network consists of 176 Q&A communities including Stack Overflow , the largest, most trusted online community for developers to learn, share their knowledge, and build their careers. In this section we will see how the Python Scikit-Learn library for machine learning can be used to implement regression functions. Multiple linear regression: How It Works? How do I merge two dictionaries in a single expression in Python (taking union of dictionaries)? and in multiple linear regression, I will get y=a +bx +b1x+ ...what does it mean if I get negative coefficients ? In the following example, we will use multiple linear regression to predict the stock index price (i.e., the dependent variable) of a fictitious economy by using 2 independent/input variables: 1. Multiple linear regression uses a linear function to predict the value of a dependent variable containing the function n independent variables. I use sklearn library to do it. It is the first time I plot multiple linear regression, and I don't know how to interpret the coefficients. If not, why not? Learn more Python Select variables in multiple linear regression How can a company reduce my number of shares? To learn more, see our tips on writing great answers. Thanks for contributing an answer to Stack Overflow! Active 1 year ago. Asking for help, clarification, or responding to other answers. How to avoid overuse of words like \"however\" and \"therefore\" in academic writing? We’ve learnt to implement linear regression models using statsmodels…now let’s learn to do it using scikit-learn! I found this code for simple linear regression. Stack Overflow en español es un sitio de preguntas y respuestas para programadores y profesionales de la informática. And how can I change the code to obtain multiple linear regressions ? Hypothesis to predict price using parameters i.e. ... Browse other questions tagged multiple-regression python stepwise-regression or ask your own question. How is time measured when a player is late? For normal equations method you can use this formula: In above formula X is feature matrix and y is label vector. rev 2020.12.2.38106, Stack Overflow works best with JavaScript enabled, Where developers & technologists share private knowledge with coworkers, Programming & related technical career opportunities, Recruit tech talent & build your employer brand, Reach developers & technologists worldwide. asked Aug 18 at 12:22. Ya casi lo estoy terminando, ... How to know if it's a linear regression problem when working on multi dimensional data? Exploratory data analysis consists of analyzing the main characteristics of a data set usually by means of visualization methods and summary statistics . After implementing the algorithm, what he understands is that there is a relationship between the monthly charges and the tenure of a customer. 0. Just reviewing normalizeFeatures.. What does the phrase, a person with “a pair of khaki pants inside a Manila envelope” mean? This is part two of our series and covers the topic of multicollinearity and it’s effect on multiple regression analysis. Why is “1000000000000000 in range(1000000000000001)” so fast in Python 3? About Us Learn more about Stack Overflow the company ... interpreting multi linear regression results. Learn what formulates a regression problem and how a linear regression algorithm works in Python. Best way to let people know you aren't dead, just taking pictures? Stack Overflow Meta en español tus comunidades . más comunidades Stack Exchange blog de la empresa. Im using the python sklearn library to attempt a linear regression TicTacToe AI. Your situation is multiple linear regression, usually just called linear regression. Clearly, it is nothing but an extension of Simple linear regression. Edits for comments: @CalZ - First comment: my_test_dataset_X.shape = ... Browse other questions tagged python scikit-learn linear-regression cross-validation or ask your own question. Is there any solution beside TLS for data-in-transit protection? Linear Regression with Python Scikit Learn. Me parece que hay buenas formas: np.shape(x_train) (766, 497) np.shape(x_test) (766, 4) Pero cuando aplico logreg.fit: from About Us Learn more about Stack Overflow the company ... How to mix multiple linear and exponential regression ? (Note that this means multiple independent variables with a single dependent variable. Linear regression needs the relationship between the independent and dependent variables to be linear. I am just using the minimum working example from Seaborn's lmplot and I can't seem to get multiple regressions to display correctly. By using our site, you acknowledge that you have read and understand our Cookie Policy, Privacy Policy, and our Terms of Service. Does Python have a ternary conditional operator? 1. ... Estoy practicando python con un juego sencillo de space invaders. I'm trying to figure out how to reproduce in Python some work that I've done in SAS. Introduction Linear regression is one of the most commonly used algorithms in machine learning. For normal equations method you can use this formula: Can \"vorhin\" be used instead of \"von vorhin\" in this sentence? + β_{p}X_{p} \\$\\$ Linear Regression with Python. Stack Overflow en español es un sitio de preguntas y respuestas para programadores y profesionales de la informática. We are continuing our series on machine learning and will now jump to our next model, Multiple Linear Regression. So I can't have them in my model at the same time. The idea is to randomly select your features, and have a way to validate them against each other. Here is the code for reference. Multiple linear regression attempts to model the relationship between two or more features and a response by fitting a linear equation to observed data. How do I merge two dictionaries in a single expression in Python (taking union of dictionaries)? And validate it against the last partition. I want to build a multiple linear regression model by using Tensorflow. Intenté ajustar una logística de regresión sobre un conjunto de datos. One possibility is to first try a fit with all variables, and then remove from the regression the variable with the least significance and then re-run to see what happens to the fitting results. Simple Linear Regression I have a dependent variable y and 6 independent variables. when I add or remove variables, some of the coefficients change from negative to positive. Although this is the basic notion for linear regression, note that all the regression platforms do not try to compute the inverse of the matrix directly. How many spin states do Cu+ and Cu2+ have and why? Uso Python 3.6 e intento leer un dato de entrada de varias lineas para almacenarla en una variable y luego administrar cada linea en una lista por ejemplo. Hot Network Questions Simple Linear Regression To implement multiple linear regression with python you can use any of the following options: 1) Use normal equation method (that uses matrix inverse) 2) Numpy's least-squares numpy.linalg.lstsq tool 3) Numpy's np.linalg.solve tool. 21 2 2 bronze badges. Linear Regression in python with multiple outputs. Multiple linear regression¶. Stack Overflow en español es un sitio de preguntas y respuestas para programadores y profesionales de la informática. The cost function of linear regression without an optimisation algorithm (such as Gradient descent) Stack Exchange Network Stack Exchange network consists of 176 Q&A communities including Stack Overflow , the largest, most trusted online community for developers to learn, share their knowledge, and build their careers. Linear Regression in python with multiple outputs. Here is Python code: Also you can use np.linalg.solve tool of numpy: In all methods regularization is used. age sex bmi children smoker region charges 0 19 female 27.900 0 yes southwest 16884.92400 1 18 male 33.770 1 no southeast 1725.55230 2 28 male 33.000 3 no southeast 4449.46200 3 33 male 22.705 0 no northwest 21984.47061 4 32 male 28.880 0 no northwest 3866.85520 For a single variable I can use Fit: data = Import[\"myfile\",\"Table\"] line = Fit[data, {1, x}, x] We will start with simple linear regression involving two variables and then we will move towards linear regression involving multiple variables. My code is as follows: ... Browse other questions tagged python linear-regression statsmodels or ask your own question. 147 7 7 bronze badges. For least squares method you use Numpy's numpy.linalg.lstsq. Does Python have a ternary conditional operator? your coworkers to find and share information. Are there any Pokemon that get smaller when they evolve? Thanks for contributing an answer to Stack Overflow! Stack Overflow for Teams is a private, secure spot for you and 1. your coworkers to find and share information. To subscribe to this RSS feed, copy and paste this URL into your RSS reader. About Us Learn more about Stack Overflow the company ... “multivariate” regression means a multivariate response variable. Solo te toma un minuto registrarte. By using our site, you acknowledge that you have read and understand our Cookie Policy, Privacy Policy, and our Terms of Service. (Python Implementation) Multiple linear regression. Origin of the symbol for the tensor product. ... Browse other questions tagged python linear-regression or ask your own question. Linear Regression with scikit-learn. How do I orient myself to the literature concerning a research topic and not be overwhelmed? This test is easy to perform and might help in your analytical work. And I went to the link to documentation of sklearn but didn't find any solution for correlation. I accidentally added a character, and then forgot to write them in for the rest of the series. ... quiero hacer en python una sublista con la siguiente característica: ... How to know if it's a linear regression problem when working on multi dimensional data? About Us Learn more about Stack Overflow the company ... Is there something fundamentally wrong with my approach to a simple and basic Linear Regression? 1. interpreting multi linear regression results. You don't know that beforehand. This is distinct from multivariate linear regression, which involves a single independent variable with multiple dependent variables, as asked in this questions.) Visit Stack … You'll want to get familiar with linear regression because you'll need to use it if you're trying to measure the relationship between two or more continuous values.A deep dive into the theory and implementation of linear regression will help you understand this valuable machine learning algorithm. Stack Exchange network consists of 176 Q&A communities including Stack Overflow, the largest, most trusted online community for developers to learn, share their knowledge, and build their careers. so we thought to to use data from 2001 to 2018 and forcast the ... Running Linear Regression with multiple Rasters converted to a numpy array in Python. I am working on a case study on multiple linear regression, ... Browse other questions tagged multiple-regression python stepwise-regression or ask your own question. Here is results (theta coefficients) to see difference between these three approaches: As you can see normal equation, least squares and np.linalg.solve tool methods give to some extent different results. Is there a contradiction in being told by disciples the hidden (disciple only) meaning behind parables for the masses, even though we are the masses? QuantumHoneybees. ... Browse other questions tagged regression python scikit-learn or ask your own question. Catch multiple exceptions in one line (except block). In multiple linear regression, x is a two-dimensional array with at least two columns, while y is usually a one-dimensional array. For this model, we will continue to use the advertising dataset but this time we will use two predictor variables to create a multiple linear regression … Main thing you should note is that it will be still linear regression, its juts that predictors are polynomial (most important is that your weights are still linear (betas in lin.regression)). Can a US president give Preemptive Pardons? Linear Regression with Python Scikit Learn. Active 1 year, 11 months ago. Does the Construct Spirit from Summon Construct cast at 4th level have 40 or 55 hp? site design / logo © 2020 Stack Exchange Inc; user contributions licensed under cc by-sa. Linear Regression in python with multiple outputs. Making statements based on opinion; back them up with references or personal experience. Stack Exchange network consists of 176 Q&A communities including Stack Overflow, the largest, ... which is now just simple linear regression with a fixed intercept. In this section we will see how the Python Scikit-Learn library for machine learning can be used to implement regression functions. The function operates on the global variable X.This makes the function inflexible (you can't use it for anything other than modifying the particular variable X), and hard to test. The field of Data Science has progressed like nothing before. It incorporates so many different domains like Statistics, Linear Algebra, Machine Learning, Databases into its account and merges them in the most meaningful way possible. thank you! https://drive.google.com/file/d/0BzzUvSbpsTAvN1UxTkxXd2U0eVE/view, Alternative: https://www.dropbox.com/s/e3pd7fp0rfm1cfs/DB2.csv?dl=0. Ecclesiastical Latin pronunciation of \"excelsis\": /e/ or /ɛ/? rev 2020.12.2.38106, Stack Overflow works best with JavaScript enabled, Where developers & technologists share private knowledge with coworkers, Programming & related technical career opportunities, Recruit tech talent & build your employer brand, Reach developers & technologists worldwide. I have noticed that only RandomForestRegressor and LinearRegression seem to work out of the box for multiple output regression. When any aspiring data scientist starts off in this field, linear regression is inevitably the first algorithm… DeepMind just announced a breakthrough in protein folding, what are the consequences? 0. DownstairsPanda. As the tenure of the customer i… In this blog post, I want to focus on the concept of linear regression and mainly on the implementation of it in Python. Dataset: Portland housing prices. Stack Overflow is the largest, most ... questions and a question in the Stack Overflow can have multiple ... compare to Logistic Regression. One data example: 2104,3,399900 (The first two are features, and the last one is house price; we have 47 examples) Code below: If you don't want to do any feature selection manually, you could always use one of the feature selection methods in scikit-learns feature_selection module. How can a company reduce my number of shares? Clearly, it is nothing but an extension of Simple linear regression. Why did the scene cut away without showing Ocean's reply? Linear Regression finds the parameters of that line which best fits the data, i.e., slope (theta1) and intercept (theta0) in this case. How to avoid boats on a mainly oceanic world? ... Browse other questions tagged regression python nonlinear-regression exponential or ask your own question. You can transform your features to polynomial using this sklearn module and then use these features in your linear regression model. age sex bmi children smoker region charges 0 19 female 27.900 0 yes southwest 16884.92400 1 18 male 33.770 1 no southeast 1725.55230 2 28 male 33.000 3 no southeast 4449.46200 3 33 male 22.705 0 no northwest 21984.47061 4 32 male 28.880 0 no northwest 3866.85520 Unemployment RatePlease note that you will have to validate that several assumptions are met before you apply linear regression models. to extend it to Multiple Linear Regression all you have to do is to create a multi dimensional x instead of a one dimension x. http://docs.scipy.org/doc/numpy/reference/arrays.ndarray.html. You should consider to remove them. I would like to calculate multiple linear regression with python. 3) Numpy's np.linalg.solve tool. It has many learning algorithms, for regression, classification, clustering and dimensionality reduction. So, a is the coefficient, but I don't see what means ? As for Numpy's numpy.linalg.lstsq or np.linalg.solve tools you just use them out of the box. In above formula X is feature matrix and y is label vector. Linear Regression in python with multiple outputs. You do it for each partition and take the average of your score (MAE / RMSE for instance), Your score is an objectif figure to compare your models aka your features selections. and with respect to a that is called the intercept in a linear regression, i.e. About Us Learn more about Stack Overflow the company ... We have a simple linear regression model (as opposed to a multiple regression model or a polynomial regression model). To learn more, see our tips on writing great answers. About Us Learn more about Stack Overflow the company ... We have a simple linear regression model ... multiple-regression lasso multicollinearity ridge-regression. Most notably, you have to make sure that a linear relationship exists between the dependent v… Multiple linear regression attempts to model the relationship between two or more features and a response by fitting a linear equation to observed data. I create my training set by simply having the computer play random 'blind' games against itself. Adjusted R-squared is too high (=1) in Linear Model. It's temporal Resolution is 16 days. Asking for help, clarification, or responding to other answers. 6. By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy." ]
[ null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.86433077,"math_prob":0.8044569,"size":27977,"snap":"2021-21-2021-25","text_gpt3_token_len":5775,"char_repetition_ratio":0.16641046,"word_repetition_ratio":0.28646427,"special_character_ratio":0.20774208,"punctuation_ratio":0.12843327,"nsfw_num_words":2,"has_unicode_error":false,"math_prob_llama3":0.97444534,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2021-06-22T21:54:57Z\",\"WARC-Record-ID\":\"<urn:uuid:e30a82e6-832d-4d8a-a5e1-5eba6a8ae780>\",\"Content-Length\":\"36917\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:02282dec-1304-4923-8386-87a2ed821ba2>\",\"WARC-Concurrent-To\":\"<urn:uuid:33207da7-afbb-4791-b603-e5f71da52748>\",\"WARC-IP-Address\":\"103.247.10.240\",\"WARC-Target-URI\":\"https://www.katakata.pro/otal310o/7w1ad.php?id=multiple-linear-regression-python-stack-overflow-02658d\",\"WARC-Payload-Digest\":\"sha1:YULUACILFA6U76ZT4Y3TMUXRQ4EH3HQC\",\"WARC-Block-Digest\":\"sha1:EPI6PISRCJB5SVEUD2MKSLAVKKNAO4MO\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2021/CC-MAIN-2021-25/CC-MAIN-2021-25_segments_1623488519735.70_warc_CC-MAIN-20210622190124-20210622220124-00193.warc.gz\"}"}
https://datascience.stackexchange.com/questions/74173/amount-of-data-needed-for-deep-learning-vs-support-vector-machine
[ "# Amount of data needed for deep learning vs support vector machine\n\nI often read about the fact, that the amount of data to train and get a generalizing model for a deep learning algorithm is much higher in comparison, e.g. to a support vector machine. It makes sense, because of the huge amount of parameters in a deep learning approach, which potentially leads to overfitting.\n\nHowever: Are there any systematic studies on this? Do deep learning approaches really need more data?\n\nBest regards, Gesetzt\n\nWhen it comes to how much data model M needs to accurately model problem P, there are 3 factors to consider:\n\n• What is the dimensionality of model M?\n\nThe power of neural networks is that they can model functions up to to a high number of dimensions, which means that they can, therefore, model any function with fewer dimensions. Indeed, a quadratic function can always be estimated by a cubic function, whereas the converse isn't true.\n\nSupport vector machines are an interesting type of models because the kernel trick allows them to model arbitrarily high-dimensional relationships. This allows you to eventually tweak your kernel based on the amount of data at your disposal.\n\n• What is the dimensionality of the space represented by the data at your disposal?\n\nNot all data are created equal, and the amount of data is only a proxy to estimate the dimensionality of the problem space. Always consider the possibility that your data might be an unrepresentative sample of your space. The amount and type of noise present in the data is also a huge factor. A factor which gets mitigated the more data you have.\n\n• What is the true dimensionality of problem P?\n\nEasily the most important factor in terms of how much data you need, and sadly, the only factor that we can never truly know. In a perfect world, the dimensionality of the model should be greater or equal to the dimensionality of the problem. Equal being, of course, the ideal scenario.\n\nDo deep learning approaches really need more data?\n\nTheoretically, the need the amount of data that will appropriately match the true dimensionality of the problem. Because they have a higher number of parameters, more data generally help reduce the chance of overfitting. However, as previously stated, a model with a dimensionality much higher than the problem's is ill-suited, to begin with.\n\nThe power behind neural networks is that they have such a large solution space that the chance to converge in a satisfying spot is quite high." ]
[ null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.9523585,"math_prob":0.9741827,"size":1982,"snap":"2023-40-2023-50","text_gpt3_token_len":398,"char_repetition_ratio":0.15267947,"word_repetition_ratio":0.017910447,"special_character_ratio":0.19323915,"punctuation_ratio":0.09866667,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.966966,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2023-12-05T22:07:00Z\",\"WARC-Record-ID\":\"<urn:uuid:5d3507ff-f540-4eec-9d75-23e7e84a6f88>\",\"Content-Length\":\"160814\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:973d0158-8237-4629-bd90-ac22fea0178a>\",\"WARC-Concurrent-To\":\"<urn:uuid:b6bc4823-e8f4-413d-9790-a644ef9c7fb5>\",\"WARC-IP-Address\":\"104.18.43.226\",\"WARC-Target-URI\":\"https://datascience.stackexchange.com/questions/74173/amount-of-data-needed-for-deep-learning-vs-support-vector-machine\",\"WARC-Payload-Digest\":\"sha1:23345SEPRQQ3YVYZ323QUEMWKRUFWZ3R\",\"WARC-Block-Digest\":\"sha1:763EY2Y62WJ4EI5PWUU6A26SFO72FTSD\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2023/CC-MAIN-2023-50/CC-MAIN-2023-50_segments_1700679100568.68_warc_CC-MAIN-20231205204654-20231205234654-00209.warc.gz\"}"}
https://socratic.org/questions/how-do-you-factor-completely-x-2-14x-49
[ "# How do you factor completely x^2-14x+49?\n\nDec 19, 2016\n\n$\\left(x - 7\\right) \\left(x - 7\\right) = {\\left(x - 7\\right)}^{2}$\n\n#### Explanation:\n\nAll the information you need is in the quadratic trinomial ... Read from right to left:\n\nFind factors of 49 which ADD (+) to give 14.\n\nThese will be $7 \\mathmr{and} 7$ because:\n$7 \\times 7 = 49 \\mathmr{and} 7 + 7 = 14$\n\nThe + sign shows that the signs in the brackets will be the SAME, the minus (-) shows that they will be negative:\n\n$\\left(x - 7\\right) \\left(x - 7\\right) = {\\left(x - 7\\right)}^{2}$" ]
[ null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.80675125,"math_prob":0.99978715,"size":466,"snap":"2019-51-2020-05","text_gpt3_token_len":118,"char_repetition_ratio":0.10822511,"word_repetition_ratio":0.0,"special_character_ratio":0.26824033,"punctuation_ratio":0.10752688,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9961401,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2020-01-21T00:55:36Z\",\"WARC-Record-ID\":\"<urn:uuid:b05044db-8ebf-4da3-b051-476673d8f1c6>\",\"Content-Length\":\"33113\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:c0f3f53b-8fdb-4c29-9abf-8450e7c07d60>\",\"WARC-Concurrent-To\":\"<urn:uuid:b6b0c787-f7fe-416c-bf85-5cc849e43aad>\",\"WARC-IP-Address\":\"54.221.217.175\",\"WARC-Target-URI\":\"https://socratic.org/questions/how-do-you-factor-completely-x-2-14x-49\",\"WARC-Payload-Digest\":\"sha1:OT46SM6XLNJOGH3GHGMGWZQHEAVZCJOX\",\"WARC-Block-Digest\":\"sha1:HCK22ABSPZZSBALLB6DZEYEOV2BN4SA5\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2020/CC-MAIN-2020-05/CC-MAIN-2020-05_segments_1579250601040.47_warc_CC-MAIN-20200120224950-20200121013950-00550.warc.gz\"}"}
https://www.john.geek.nz/2009/03/tles-calculation-of-the-julian-day-number-jdn/?replytocom=95227
[ "# TLEs – Calculation of the Julian Day Number (JDN)\n\nThis post is part of a series on understanding the meaning behind the values contained in a Two Line Element set, or Keplerian Elements. The main article is here.\n\n### Calculation of the Julian Day Number (JDN)\n\nJulian day numbers are regularly used in astronomy instead of a date.\n\nJulian day numbers are simply the count of days that have elapse since noon on January 1, 4713 BC Greenwich time using the Julian proleptic calendar.\n\nWe generally use the Gregorian calendar. Calculation to a Julian date is a little cryptic as the two calendars have different rules for calculating leap years.\n\nJulian Calendar\n\n• Every 4 years\nGregorian Calendar\n\n• Every 4 years except when the year is divisble by 100\n• But ALWAYS every 400 years\n\nTo calculate the value, we first get the Julian date of the year, then add on the days in the year followed by the fraction of the day.\n\nSome astronomers like to use a Modified Julian Date. This is simply the Julian Date with 2,400,000.5 subtracted from it making the number smaller and based on midnight rather than noon UTC.\n\nHere is some C# which will calculate the following:\n\n• Julian Day from a DateTime\n• Julian Day for a year\n• Julian Day from a Satellite Epoch\n• Converting between modified and standard Julian dates\n```double getJulianDay_DateTime(DateTime date) { //Calculate the day of the year and the double dDay = date.DayOfYear; dDay += Convert.ToDouble(date.Hour) / 24; dDay += Convert.ToDouble(date.Minute) / 1440; dDay += Convert.ToDouble(date.Second) / 86400;   return dDay + getJulianDay_Year(date.Year); }   double getJulianDay_Year(int year) { double dYear = year - 1; double A = Math.Floor(dYear / 100); double B = 2 - A + Math.Floor(A / 4); //The use of 30.600000000000001 is to correct for floating point rounding problems double dResult = Math.Floor(365.25 * dYear) + 1721422.9 + B; return dResult; }   double getJulianDay_SatEpoch(int year, double dSatelliteEpoch) { //Tidy up the year and put it into the correct century year = year % 100; if (year < 57) year += 2000; else year += 1900;   double dResult = getJulianDay_Year(year); dResult += dSatelliteEpoch;   return dResult; }   double getModifiedJulian_Julian(double dJulian) { return dJulian - 2400000.5; }   double getJulian_ModifiedJulian(double dModifiedJulian) { return dModifiedJulian + 2400000.5; }```\n\n### You May Also Like\n\n1.", null, "slkfjsf says:" ]
[ null, "https://secure.gravatar.com/avatar/0f0af0c2fbc2a9049e4f8a29311b44df", null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.723163,"math_prob":0.93627316,"size":2476,"snap":"2019-35-2019-39","text_gpt3_token_len":653,"char_repetition_ratio":0.14360842,"word_repetition_ratio":0.025,"special_character_ratio":0.27786753,"punctuation_ratio":0.13363029,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.99639463,"pos_list":[0,1,2],"im_url_duplicate_count":[null,null,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2019-09-22T23:54:04Z\",\"WARC-Record-ID\":\"<urn:uuid:4d7a7e83-550e-4d02-98f6-1471b185e04e>\",\"Content-Length\":\"39400\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:1d7e89e1-24ca-491b-890d-333f6ffc3470>\",\"WARC-Concurrent-To\":\"<urn:uuid:7db98e01-7963-4cf2-bc48-635bbbfdb643>\",\"WARC-IP-Address\":\"104.28.2.4\",\"WARC-Target-URI\":\"https://www.john.geek.nz/2009/03/tles-calculation-of-the-julian-day-number-jdn/?replytocom=95227\",\"WARC-Payload-Digest\":\"sha1:YY64X4PEOWHXELQB2MYVLRT5MBVK5ZCU\",\"WARC-Block-Digest\":\"sha1:OBWDUGBJALBRUVQPDREVXBWMFECAZBUF\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2019/CC-MAIN-2019-39/CC-MAIN-2019-39_segments_1568514575751.84_warc_CC-MAIN-20190922221623-20190923003623-00211.warc.gz\"}"}
https://documen.tv/question/a-bullet-of-mass-0-5-kg-is-moving-horizontally-with-a-speed-of-50-m-s-when-it-hits-a-block-of-ma-24101960-87/
[ "## A bullet of mass 0.5 kg is moving horizontally with a speed of 50 m/s when it hits a block of mass 3 kg that is at rest on a horizontal surf\n\nQuestion\n\nA bullet of mass 0.5 kg is moving horizontally with a speed of 50 m/s when it hits a block of mass 3 kg that is at rest on a horizontal surface with a coefficient of friction of 0.2. After the collision the bullet becomes embedded in the block. How much work is being dne by bullet?\n\nin progress 0\n2 months 2021-07-19T07:43:38+00:00 1 Answers 0 views 0\n\nWork done by the bullet is 612.26 J.\n\nExplanation:\n\nmass of bullet, m = 0.5 kg\n\ninitial velocity of bullet, u = 50 m/s\n\ncoefficient of friction = 0.2\n\nmass of block, M = 3 kg\n\nlet the final speed of the bullet block system is v.\n\nuse conservation of momentum\n\nMomentum of bullet + momentum of block = momentum of bullet block system\n\n0.5 x 50 + 3 x 0 = (3 + 0.5) v\n\nv = 7.14 m/s\n\nlet the stopping distance is\n\nThe work done is given by change in kinetic energy of bullet\n\ninitial kinetic energy of bullet, K =  0.5 x 0.5 x 50 x 50 = 625 J\n\nFinal kinetic energy of bullet, K’ = 0.5 x 0.5 x 7.14 x 7.14 = 12.74 J\n\nSo, the work done by the bullet\n\nW = 625 – 12.74 = 612.26 J" ]
[ null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.8255962,"math_prob":0.99533254,"size":1216,"snap":"2021-31-2021-39","text_gpt3_token_len":398,"char_repetition_ratio":0.14273928,"word_repetition_ratio":0.224,"special_character_ratio":0.35855263,"punctuation_ratio":0.12091503,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9959755,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2021-09-23T14:36:35Z\",\"WARC-Record-ID\":\"<urn:uuid:07cd80e4-a8a1-4375-9b53-77474ada2af0>\",\"Content-Length\":\"79435\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:4f8ffc58-813d-4b7e-88b4-02a2c043f46e>\",\"WARC-Concurrent-To\":\"<urn:uuid:1e1fba9b-4d54-41be-bccf-86462f9a3d0e>\",\"WARC-IP-Address\":\"103.57.223.32\",\"WARC-Target-URI\":\"https://documen.tv/question/a-bullet-of-mass-0-5-kg-is-moving-horizontally-with-a-speed-of-50-m-s-when-it-hits-a-block-of-ma-24101960-87/\",\"WARC-Payload-Digest\":\"sha1:CYBIDXF6MGSTKCQGEYV6HZZ4CXYD42J2\",\"WARC-Block-Digest\":\"sha1:A2QJOSBWO5TUPJRBC6TR6YF7533NJUE6\",\"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-00313.warc.gz\"}"}
https://studyhippo.com/organic-chemistry-year-11/
[ "# Organic Chemistry year 11", null, "Keisha White\nquestion\nWhat is a single bond called?\nAlkane\nquestion\nAre single bonds saturated or unsaturated?\nsaturated\nquestion\nAre double/triple bonds saturated or unsaturated?\nunsaturated\nquestion\nWhat is a double bond called?\nAlkene\nquestion\nWhat is a triple bond called?\nAlkyne\nquestion\nWhat is the formula for single bonds?\nCnH2n+2\nquestion\nWhat is the formula for double bonds?\nCnH2n\nquestion\nWhat is the formula for Triple bonds?\nCnH2n-2\nquestion\nWhat reactions do alkanes have?\nCombustion reactions\nquestion\nWhat is the formula for an alkane reaction?\nalkane + oxygen = carbon dioxide + water\nquestion\nWhat reactions do alkenes have?\nquestion\nWhat does the addition of Hydrogen do to alkenes?\nMakes them turn into alkanes\nquestion\nAn example of a alkene addition reaction?\nethene + H2 = ethane\nquestion\nWhat does the addition of halogens do to alkenes?\nethene + bromine = 1,2 dibromo ethane\nquestion\nWhat reactions do alkyenes have?\nquestion\nWhat do you need in order for an addition reaction to occur for alkynes\nneeds 2 halogens\nquestion\nWhat is a monosaccharide?\nA simple carbohydrate Glucose, Fructose, Galactose (C6H12O6)\nquestion\nWhat is a disaccharide?\n'double carbohydrate' 2 x monosaccharides Through a condensation reaction 2C6H12O6 = (enzyme) C12H22O11 + H2O\nquestion\nWhat is a polysaccharide?\n'complex carbohydrate' - lots of monosaccharides through a condensation reaction Starch, Cellulose nC6H12O6 = (enzyme) (C6H10O5)n + nH2O\nquestion\nWhat is the fermentation reaction equation?\nGlucose -------> (enzyme) ethanol + carbon dioxide C6H12O6 --------> 2CH3CH2OH + 2CO2\nquestion\nWhat do alcohol classifications (primary, secondary, tertiary) mean?\nIt describes how many carbon atoms are attached to the hydroxyl bearing carbon\nquestion\nWhat is a carboxylic acid?\nA weak acid that results in a sour taste, smells bad\nquestion\nWhat do carboxylic acids contain?\nThe carboxyil group (COOH)\nquestion\nWhat are carboxylic acids called?\n----oic acid\nquestion\nWhat is the first carbon in carboxylic acids?\nThe carbon in the carboxylic acid\nquestion\nWhat does a carboxylic acid do when it reacts to a base?\nMakes a salt + water\nquestion\nWhat does a carboxylic acid do when it reacts to a alcohol?\nCreates an ester\nquestion\nHow is an ester formed?\nWith a reaction of an alcohol and a base to create the ester and water\nquestion\nHow do you name a ester?\nFirst word: ---yl, comes from alcohol Second word: --- oate from carboxylic acid\nquestion\nMelting and boiling points in organic chemistry?\nHave low melting and boiling points Because organic molecules are held by intermolecular forces which are weak and are easy to break The larger the molecule, the higher the melting and boiling point is If an OH group is present there are hydrogen bonds, making the boiling and melting points higher\nquestion\nVolatility in organic chemistry?\nHave high volatility Because have weaker bonds therefore easy to break The larger the molecule, the lower the volatility If an OH group is present there are hydrogen bonds, making the volatility lower\nquestion\nSolubility in organic chemistry?\nThe smaller the carbon chain the more soluble it is because dispersion forces are weaker If there is an alcohol present more soluble because hydrogen bonds can be made easier\nquestion\nOxidation of primary alcohols\nCr2O7 2-/ H (warm) Cr2O7 2-/ H (warm) --------------------------> Aldehyde--------------------------> Carboxylic acid O || (RCH)\nquestion\nOxidation of secondary alcohols\nO Cr2O7 2-/ H (warm) || -------------------------> ketone (R-C-R)\nquestion\nOxidation of Tertiary alcohols\nNo reaction\n1 of\n\n## Unlock all answers in this set\n\nquestion\nWhat is a single bond called?\nAlkane\nquestion\nAre single bonds saturated or unsaturated?\nsaturated\nquestion\nAre double/triple bonds saturated or unsaturated?\nunsaturated\nquestion\nWhat is a double bond called?\nAlkene\nquestion\nWhat is a triple bond called?\nAlkyne\nquestion\nWhat is the formula for single bonds?\nCnH2n+2\nquestion\nWhat is the formula for double bonds?\nCnH2n\nquestion\nWhat is the formula for Triple bonds?\nCnH2n-2\nquestion\nWhat reactions do alkanes have?\nCombustion reactions\nquestion\nWhat is the formula for an alkane reaction?\nalkane + oxygen = carbon dioxide + water\nquestion\nWhat reactions do alkenes have?\nquestion\nWhat does the addition of Hydrogen do to alkenes?\nMakes them turn into alkanes\nquestion\nAn example of a alkene addition reaction?\nethene + H2 = ethane\nquestion\nWhat does the addition of halogens do to alkenes?\nethene + bromine = 1,2 dibromo ethane\nquestion\nWhat reactions do alkyenes have?\nquestion\nWhat do you need in order for an addition reaction to occur for alkynes\nneeds 2 halogens\nquestion\nWhat is a monosaccharide?\nA simple carbohydrate Glucose, Fructose, Galactose (C6H12O6)\nquestion\nWhat is a disaccharide?\n'double carbohydrate' 2 x monosaccharides Through a condensation reaction 2C6H12O6 = (enzyme) C12H22O11 + H2O\nquestion\nWhat is a polysaccharide?\n'complex carbohydrate' - lots of monosaccharides through a condensation reaction Starch, Cellulose nC6H12O6 = (enzyme) (C6H10O5)n + nH2O\nquestion\nWhat is the fermentation reaction equation?\nGlucose -------> (enzyme) ethanol + carbon dioxide C6H12O6 --------> 2CH3CH2OH + 2CO2\nquestion\nWhat do alcohol classifications (primary, secondary, tertiary) mean?\nIt describes how many carbon atoms are attached to the hydroxyl bearing carbon\nquestion\nWhat is a carboxylic acid?\nA weak acid that results in a sour taste, smells bad\nquestion\nWhat do carboxylic acids contain?\nThe carboxyil group (COOH)\nquestion\nWhat are carboxylic acids called?\n----oic acid\nquestion\nWhat is the first carbon in carboxylic acids?\nThe carbon in the carboxylic acid\nquestion\nWhat does a carboxylic acid do when it reacts to a base?\nMakes a salt + water\nquestion\nWhat does a carboxylic acid do when it reacts to a alcohol?\nCreates an ester\nquestion\nHow is an ester formed?\nWith a reaction of an alcohol and a base to create the ester and water\nquestion\nHow do you name a ester?\nFirst word: ---yl, comes from alcohol Second word: --- oate from carboxylic acid\nquestion\nMelting and boiling points in organic chemistry?\nHave low melting and boiling points Because organic molecules are held by intermolecular forces which are weak and are easy to break The larger the molecule, the higher the melting and boiling point is If an OH group is present there are hydrogen bonds, making the boiling and melting points higher\nquestion\nVolatility in organic chemistry?\nHave high volatility Because have weaker bonds therefore easy to break The larger the molecule, the lower the volatility If an OH group is present there are hydrogen bonds, making the volatility lower\nquestion\nSolubility in organic chemistry?" ]
[ null, "https://studyhippo.com/wp-content/uploads/authors/Keisha White.jpg", null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.8320395,"math_prob":0.7449955,"size":7849,"snap":"2022-27-2022-33","text_gpt3_token_len":2044,"char_repetition_ratio":0.22957298,"word_repetition_ratio":0.98603123,"special_character_ratio":0.22283094,"punctuation_ratio":0.07025761,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9571646,"pos_list":[0,1,2],"im_url_duplicate_count":[null,6,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2022-07-03T03:15:05Z\",\"WARC-Record-ID\":\"<urn:uuid:4de59273-dd99-4fae-bcf2-a3effe7d62b7>\",\"Content-Length\":\"54528\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:e50597af-e274-4509-9b84-2cc116ce2eab>\",\"WARC-Concurrent-To\":\"<urn:uuid:c580b6eb-d846-4398-81ee-6fd4d035f94c>\",\"WARC-IP-Address\":\"104.21.86.2\",\"WARC-Target-URI\":\"https://studyhippo.com/organic-chemistry-year-11/\",\"WARC-Payload-Digest\":\"sha1:CZJHOJXHDEPROUQPIDIGUN4CACF7GPIG\",\"WARC-Block-Digest\":\"sha1:53KBJSWTGPDWKONKVO644JZXXMGERYON\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2022/CC-MAIN-2022-27/CC-MAIN-2022-27_segments_1656104209449.64_warc_CC-MAIN-20220703013155-20220703043155-00177.warc.gz\"}"}
https://www.doubtnut.com/question-answer/if-x-denotes-the-greatest-integer-less-than-or-equal-to-x-then-find-the-value-of-the-integral-int02x-645280178
[ "Getting Image", null, "", null, "", null, "", null, "Register now for special offers", null, "+91\n\nHome\n\n>\n\nEnglish\n\n>\n\nClass 12\n\n>\n\nMaths\n\n>\n\nChapter\n\n>\n\nDefinite Integration\n\n>\n\nIf [x] denotes the greatest in...\n\n# If [x] denotes the greatest integer less than or equal to x , then find the value of the integral int_0^2x^2[x]dxdot", null, "Khareedo DN Pro and dekho sari videos bina kisi ad ki rukaavat ke!\n\nUpdated On: 27-06-2022", null, "Text Solution\n\nSolution : int_(0)^(2)x^(2)[x]dx=int_(0)^(1)x^(2)[x]dx+int_(1)^(2)x^(2)[x]dx <br> =int_(0)^(1)x^(2)(0)dx+int_(1)^(2)x^(2)(1)dx <br> =0+int_(1)^(2)x^(2)dx=|(x^(3))/3|_(1)^(2) <br> =(8-1)/3=7/3", null, "Step by step solution by experts to help you in doubt clearance & scoring excellent marks in exams.\n\n## Related Videos\n\n642967266\n\n5\n\n4.6 K\n\n2:44\nIf [x] denotes the greatest integer less than or equal to x , then find the value of the integral int_0^2x^2[x]dxdot\n642541391\n\n42\n\n8.4 K\n\n4:08\nIf [x] denotes the greatest integer less than or equal to x , then find the value of the integral int_0^2x^2[x]dxdot\n645280178\n\n10\n\n5.7 K\n\n1:38\nIf [x] denotes the greatest integer less than or equal to x , then find the value of the integral int_0^2x^2[x]dxdot\n644176639\n\n79\n\n2.7 K\n\n2:56\nif [x] denotes the greatest integer less than or equal to x then integral int_0^2x^2[x] dx equals\n647521792\n\n56\n\n4.4 K\n\nThe integral int_0^(1.5)[x^2]dx,\" where \"[x^2] denotes the greatest integer less than or equal to x, is equal to\n34165\n\n41\n\n2.4 K\n\n2:09\nIf [x] denotes the greatest integer less than or equal to x , then find the value of the integral int_0^2x^2[x]dxdot" ]
[ null, "https://d10lpgp6xz60nq.cloudfront.net/images/doubtnut_header_logo_white_new.svg", null, "https://d10lpgp6xz60nq.cloudfront.net/images/mweb-us-icon-small-camera.svg", null, "https://d10lpgp6xz60nq.cloudfront.net/images/video-page-ic-search-white.svg", null, "https://d10lpgp6xz60nq.cloudfront.net/images/mweb-home-white-hamburger-icon.svg", null, "https://d10lpgp6xz60nq.cloudfront.net/images/mweb-india-country-flag-small.svg", null, "https://d10lpgp6xz60nq.cloudfront.net/images/adfree_icon_web_accordion.webp", null, "https://d10lpgp6xz60nq.cloudfront.net/images/mweb-icon-video-page-icon-small-text-book.svg", null, "https://d10lpgp6xz60nq.cloudfront.net/images/mweb-icon-video-page-icon-small-text-book.svg", null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.57493573,"math_prob":0.99960595,"size":329,"snap":"2022-40-2023-06","text_gpt3_token_len":125,"char_repetition_ratio":0.046153847,"word_repetition_ratio":0.0,"special_character_ratio":0.34042552,"punctuation_ratio":0.15476191,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9996524,"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,null,null,null,null,null,null,null,null,null,null,null,null,null,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2023-01-27T21:29:44Z\",\"WARC-Record-ID\":\"<urn:uuid:465e1034-d56f-4ed9-aa53-5237af3ce511>\",\"Content-Length\":\"193074\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:51dc9b40-3e25-44a7-982a-44e8e7edba9d>\",\"WARC-Concurrent-To\":\"<urn:uuid:924ef373-c348-4e13-bbc7-3507a24f1e26>\",\"WARC-IP-Address\":\"108.138.64.89\",\"WARC-Target-URI\":\"https://www.doubtnut.com/question-answer/if-x-denotes-the-greatest-integer-less-than-or-equal-to-x-then-find-the-value-of-the-integral-int02x-645280178\",\"WARC-Payload-Digest\":\"sha1:M65FIKFTIF6CDUZIQ6ZHH3PPWLPNPDVJ\",\"WARC-Block-Digest\":\"sha1:7PUXCZRLU2IC6V5KQ3AGA4WBVGNAYNB5\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2023/CC-MAIN-2023-06/CC-MAIN-2023-06_segments_1674764495012.84_warc_CC-MAIN-20230127195946-20230127225946-00467.warc.gz\"}"}
https://estebantorreshighschool.com/faq-about-equations/perpendicular-equation.html
[ "## How do you know if two equations are perpendicular?\n\nPerpendicular lines intersect at right angles to one another. To figure out if two equations are perpendicular, take a look at their slopes. The slopes of perpendicular lines are opposite reciprocals of each other. Their product is -1!\n\n## What is perpendicular example?\n\nIt just means at right angles (90°) to. The red line is perpendicular to the blue line: Here also: (The little box drawn in the corner, means “at right angles”, so we didn’t really need to also show that it was 90°, but we just wanted to!)\n\n## What is a perpendicular in math?\n\nPerpendicular lines are lines that intersect at a right (90 degrees) angle.\n\n## How do you know if its parallel/perpendicular or neither?\n\nWe can determine from their equations whether two lines are parallel by comparing their slopes. If the slopes are the same and the y-intercepts are different, the lines are parallel. If the slopes are different, the lines are not parallel. Unlike parallel lines, perpendicular lines do intersect.\n\n## What does perpendicular look like?\n\nTwo distinct lines intersecting each other at 90° or a right angle are called perpendicular lines. Here, AB is perpendicular to XY because AB and XY intersect each other at 90°. The two lines are parallel and do not intersect each other. They can never be perpendicular to each other.\n\n## What is the perpendicular symbol?\n\nPerpendicular lines are lines, segments or rays that intersect to form right angles. The symbol ⊥ means is perpendicular to . The right angle symbol in the figure indicates that the lines are perpendicular.\n\n## Where do 2 perpendicular lines intersect?\n\nPerpendicular lines intersect at a 90-degree angle. The two lines can meet at a corner and stop, or continue through each other.\n\n## What is perpendicular distance?\n\nIn geometry, the perpendicular distance between two objects is the distance from one to the other, measured along a line that is perpendicular to one or both. In particular, see: Distance from a point to a line, for the perpendicular distance from a point to a line in two-dimensional space.\n\n## How do you show perpendicular lines?\n\nTwo lines are perpendicular if and only if their slopes are negative reciprocals. To find the slope, we must put the equation into slope-intercept form, , where equals the slope of the line.\n\n## What letters have perpendicular lines?\n\nWe see perpendicular lines every day. They are present in something as simple as certain letters of the alphabet (specifically, E, F, H, L, and T) or the streets we encounter in our everyday travel. As the compass rose demonstrates, the directions north and south are perpendicular to the directions east and west.\n\n## What is perpendicular shape?\n\nIn elementary geometry, the property of being perpendicular (perpendicularity) is the relationship between two lines which meet at a right angle (90 degrees). The property extends to other related geometric objects. A line is said to be perpendicular to another line if the two lines intersect at a right angle.\n\n## How do you write an equation for parallel and perpendicular lines?\n\nTo find the slope of the given line we need to get the line into slope-intercept form (y = mx + b), which means we need to solve for y: The slope of the line 4x – 5y = –10 is m = 4/5. Therefore, the slope of the line perpendicular to this line would have to be m = –5/4.\n\n## What is the equation of the line?\n\nThe equation of a straight line is usually written this way: y = mx + b.\n\n### Releated\n\n#### First order equation\n\nWhat is first order difference equation? Definition A first-order difference equation is an equation. xt = f(t, xt−1), where f is a function of two variables. How do you solve first order equations? Here is a step-by-step method for solving them:Substitute y = uv, and. Factor the parts involving v.Put the v term equal to […]\n\n#### Energy equation physics\n\nWhat is the formula for energy? The formula that links energy and power is: Energy = Power x Time. The unit of energy is the joule, the unit of power is the watt, and the unit of time is the second. How do you solve for energy in physics? In classical mechanics, kinetic energy (KE) […]" ]
[ null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.91948664,"math_prob":0.9931838,"size":3469,"snap":"2021-43-2021-49","text_gpt3_token_len":730,"char_repetition_ratio":0.23261184,"word_repetition_ratio":0.010135135,"special_character_ratio":0.2121649,"punctuation_ratio":0.114754096,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9990496,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2021-12-03T12:46:13Z\",\"WARC-Record-ID\":\"<urn:uuid:e1a4a1ab-e14f-4690-8888-7ddf3e8e0094>\",\"Content-Length\":\"38732\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:86cc6f55-3a75-4988-95fa-a884afa30d01>\",\"WARC-Concurrent-To\":\"<urn:uuid:c429afbd-16d7-43f7-b576-3abac5e858b3>\",\"WARC-IP-Address\":\"172.67.223.43\",\"WARC-Target-URI\":\"https://estebantorreshighschool.com/faq-about-equations/perpendicular-equation.html\",\"WARC-Payload-Digest\":\"sha1:QN27KLEEFAEMH4GKKSQRFTQNLDZT6TUG\",\"WARC-Block-Digest\":\"sha1:JK32YREUIU7CTI22TP57K24N46JTC2O3\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2021/CC-MAIN-2021-49/CC-MAIN-2021-49_segments_1637964362879.45_warc_CC-MAIN-20211203121459-20211203151459-00590.warc.gz\"}"}
https://www.car.chula.ac.th/display7.php?bib=b2092616
[ "Home / Help\n\nAuthor Aubert, Gilles. author Mathematical Problems in Image Processing [electronic resource] : Partial Differential Equations and the Calculus of Variations / by Gilles Aubert, Pierre Kornprobst New York, NY : Springer New York, 2002 http://dx.doi.org/10.1007/b97428 XXV, 288 p. 129 illus. online resource\n\nSUMMARY\n\nPartial differential equations and variational methods were introduced into image processing about 15 years ago, and intensive research has been carried out since then. The main goal of this work is to present the variety of image analysis applications and the precise mathematics involved. It is intended for two audiences. The first is the mathematical community, to show the contribution of mathematics to this domain and to highlight some unresolved theoretical questions. The second is the computer vision community, to present a clear, self-contained, and global overview of the mathematics involved in image processing problems. The book is divided into five main parts. Chapter 1 is a detailed overview. Chapter 2 describes and illustrates most of the mathematical notions found throughout the work. Chapters 3 and 4 examine how PDEs and variational methods can be successfully applied in image restoration and segmentation processes. Chapter 5, which is more applied, describes some challenging computer vision problems, such as sequence analysis or classification. This book will be useful to researchers and graduate students in mathematics and computer vision\n\nCONTENT\n\nGuide to main mathematical concepts and their application -- Notations and symbols -- Mathematical preliminaries -- Image Restoration -- The Segmentation Problem -- Other Challenging Applications\n\nMathematics Computers Image processing Mathematical analysis Analysis (Mathematics) Applied mathematics Engineering mathematics System theory Calculus of variations Mathematics Analysis Applications of Mathematics Calculus of Variations and Optimal Control; Optimization Systems Theory Control Computing Methodologies Image Processing and Computer Vision\n\nLocation", null, "Office of Academic Resources, Chulalongkorn University, Phayathai Rd. Pathumwan Bangkok 10330 Thailand\n\nContact Us\n\nTel. 0-2218-2929,\n0-2218-2927 (Library Service)\n0-2218-2903 (Administrative Division)\nFax. 0-2215-3617, 0-2218-2907", null, "" ]
[ null, "https://www.car.chula.ac.th/images/map3.png", null, "https://www.car.chula.ac.th/images/email2.PNG", null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.91033137,"math_prob":0.5599667,"size":1646,"snap":"2021-04-2021-17","text_gpt3_token_len":294,"char_repetition_ratio":0.15773447,"word_repetition_ratio":0.0,"special_character_ratio":0.16403402,"punctuation_ratio":0.07692308,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.95271766,"pos_list":[0,1,2,3,4],"im_url_duplicate_count":[null,null,null,null,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2021-04-21T01:48:09Z\",\"WARC-Record-ID\":\"<urn:uuid:56ff45cb-8060-498f-a7bd-5d0bfdb3206c>\",\"Content-Length\":\"12979\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:0ee56237-a2c9-4001-bd15-daf01db9167f>\",\"WARC-Concurrent-To\":\"<urn:uuid:a0f89f49-3ed3-4523-9eee-da3cf24813bf>\",\"WARC-IP-Address\":\"161.200.145.59\",\"WARC-Target-URI\":\"https://www.car.chula.ac.th/display7.php?bib=b2092616\",\"WARC-Payload-Digest\":\"sha1:APXFB2HJQAPRL7HIUCXL4LAZITHEQE4Z\",\"WARC-Block-Digest\":\"sha1:QWCXPZB3XHAYG6SURVQ6ZBOCYEDWKUGI\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2021/CC-MAIN-2021-17/CC-MAIN-2021-17_segments_1618039503725.80_warc_CC-MAIN-20210421004512-20210421034512-00043.warc.gz\"}"}
https://wiki.laic.workers.dev/wiki/%E9%9B%B6%E5%9B%A0%E5%AD%90
[ "", null, "# 零因子\n\n## 例子\n\n• 整数Z 没有零因子,但是在环 Z × Z 中,有(0,n) × (m,0) = (0,0),于是(0,n)和(m,0)都是零因子。\n• 商环 Z/6Z 中,同余类 4,就是 4 + 6Z,是一个零因子,因为 3 × 4 便是同余类 0。\n${\\begin{pmatrix}1&1\\\\2&2\\end{pmatrix}}$", null, "${\\begin{pmatrix}1&1\\\\2&2\\end{pmatrix}}$", null, "$\\cdot$", null, "${\\begin{pmatrix}1&1\\\\-1&-1\\end{pmatrix}}$", null, "$=$", null, "${\\begin{pmatrix}-2&1\\\\-2&1\\end{pmatrix}}$", null, "$\\cdot$", null, "${\\begin{pmatrix}1&1\\\\2&2\\end{pmatrix}}$", null, "$=$", null, "${\\begin{pmatrix}0&0\\\\0&0\\end{pmatrix}}$", null, "•  更一般地说,在某些域上的 n×n 的矩阵组成的环中,左零因子也就是右零因子(实际上就是所有的非零的奇异矩阵)。在某些整环上的 n×n 的矩阵组成的环中,零因子就是所有行列式为0的非零矩阵。\n• 下面给出一个环中的左零因子和右零因子的例子,它们都不是零因子。\n• S 为所有整数数列的集合,则 SS 的映射,对于数列的加法和映射的复合,成为一个环 End(S),。\n• 考虑以下三个映射:右移映射:R(a1, a2,a3,...) = (0, a1, a2,...), 左移映射:L(a1, a2,a3,... ) = (a2, a3,...),以及只保留首项的映射: T(a1, a2,a3,... ) = (a1, 0, 0, ... )\n• LTTR = 0,所以 L 是一个左零因子,R 是一个右零因子。但是 L 不是右零因子,R 也不是左零因子。因为 LR 便是恒等映射。也就是说,如果有一个映射 f 使得 fL= 0,那么 0=(fL)R = f(LR)= f1 = ff 必然是 0,于是 L 不可能是右零因子。同理,R 也不可能是左零因子。\n• 实际上,我们可以将 SS 的映射看作可数阶数的矩阵,于是左移映射 L 就可以表示为:\n$A={\\begin{pmatrix}0&1&0&0&0&\\\\0&0&1&0&0&\\cdots \\\\0&0&0&1&0&\\\\0&0&0&0&1&\\\\&&\\vdots &&&\\ddots \\end{pmatrix}}$", null, "• 同理 R 则是 L 的转置矩阵(同时也是 L 的逆矩阵)。可以看出这个例子在有限阶矩阵中是无法构造的。\n\n## 性质\n\n• 左零因子或右零因子不可能是可逆元\n• 任意的非零的等幂元 a ≠ 1 都是零因子,因为由 a2 = a 可推出 a(a − 1) = (a − 1)a = 0。此外,幂零元是当然的零因子。\n• 一个非退化的交换环(0 ≠ 1)若没有零因子,则是一个整环\n• 商环 Z/nZ 包含零因子,当且仅当 n合数。如果 n素数Z/nZ 是一个域,因而没有零因子,因为每个非零元素都是可逆的。\n\n## 註釋\n\n1. ^ 也有作者將既是左零因子又是右零因子的元素称为零因子。\n\n## 參考資料\n\n1. ^ 张贤科、许甫华. 高等代数学. 清华大学出版社. 2004: 10. ISBN 9787302082279.\n2. ^ Jeffrey Bergen. A Concrete Approach to Abstract Algebra: From the Integers to the Insolvability of the Quintic. Academic Press. 2009: 234. ISBN 9780080958620.\n3. ^ 俞正光、李永樂、呂志. 理工科代数基础. 清华大学出版社. 1998: 309. ISBN 9787302029779.\n4. ^ 王礼萍. 离散数学简明教程. 清华大学出版社. 2005: 87. ISBN 9787302112297." ]
[ null, "https://upload.wikimedia.org/wikipedia/commons/thumb/c/cd/Zh_conversion_icon_m.svg/35px-Zh_conversion_icon_m.svg.png", null, "https://wikimedia.org/api/rest_v1/media/math/render/svg/94291e1fd0749457348af9fffb81aa60b535d31a", null, "https://wikimedia.org/api/rest_v1/media/math/render/svg/94291e1fd0749457348af9fffb81aa60b535d31a", null, "https://wikimedia.org/api/rest_v1/media/math/render/svg/ba2c023bad1bd39ed49080f729cbf26bc448c9ba", null, "https://wikimedia.org/api/rest_v1/media/math/render/svg/e3c69aeed01235438a9e834a20c5dd2c8f1b23e3", null, "https://wikimedia.org/api/rest_v1/media/math/render/svg/505a4ceef454c69dffd23792c84b90f488543743", null, "https://wikimedia.org/api/rest_v1/media/math/render/svg/74cfdc1b3d20b7f7f48e88bc787082e78d7dc01c", null, "https://wikimedia.org/api/rest_v1/media/math/render/svg/ba2c023bad1bd39ed49080f729cbf26bc448c9ba", null, "https://wikimedia.org/api/rest_v1/media/math/render/svg/94291e1fd0749457348af9fffb81aa60b535d31a", null, "https://wikimedia.org/api/rest_v1/media/math/render/svg/505a4ceef454c69dffd23792c84b90f488543743", null, "https://wikimedia.org/api/rest_v1/media/math/render/svg/0c35fc6438c7c740a979e47020933b79e3587805", null, "https://wikimedia.org/api/rest_v1/media/math/render/svg/d895c59787c64e635e9c27ac456b8141e697449e", null ]
{"ft_lang_label":"__label__zh","ft_lang_prob":0.99143827,"math_prob":0.9997553,"size":1099,"snap":"2021-04-2021-17","text_gpt3_token_len":1018,"char_repetition_ratio":0.09589041,"word_repetition_ratio":0.0,"special_character_ratio":0.3867152,"punctuation_ratio":0.16269842,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9735288,"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],"im_url_duplicate_count":[null,null,null,null,null,null,null,null,null,5,null,null,null,5,null,null,null,null,null,null,null,10,null,5,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2021-01-26T10:49:58Z\",\"WARC-Record-ID\":\"<urn:uuid:4b50de66-543b-4431-9801-bfcfdf27df84>\",\"Content-Length\":\"86158\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:80106e3e-e475-4154-acdd-47076759ea3b>\",\"WARC-Concurrent-To\":\"<urn:uuid:2714d752-f701-4ae7-93d5-2707856b0aab>\",\"WARC-IP-Address\":\"172.67.176.101\",\"WARC-Target-URI\":\"https://wiki.laic.workers.dev/wiki/%E9%9B%B6%E5%9B%A0%E5%AD%90\",\"WARC-Payload-Digest\":\"sha1:DHZW2TMSMFWHHO4DLHOXMDDUNKXVDZCI\",\"WARC-Block-Digest\":\"sha1:2PSPV7MFKBCVLPFWSWKVPBGOVR6U4J44\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2021/CC-MAIN-2021-04/CC-MAIN-2021-04_segments_1610704799741.85_warc_CC-MAIN-20210126104721-20210126134721-00727.warc.gz\"}"}