URL
stringlengths 15
1.68k
| text_list
sequencelengths 1
199
| image_list
sequencelengths 1
199
| metadata
stringlengths 1.19k
3.08k
|
---|---|---|---|
https://www.2cto.com/kf/201701/593268.html | [
"2017-01-25 10:24:02 来源:萌萌程序员的博客\n\n1:表单的定义\n\n<form>表单标签\n\n```<form action=\"url\" method=get/post name=value target=\"目标窗口\" enctype=\"编码方式\">\n</form>```\n\n1:action\n\n2:method\n\npost---表单数据与URL是分开发的\n\n3:enctype\n\ntext/plain ------- 以纯文本的形式传送\n\napplication --- 默认的编码形式\n\nmultipart/form-data --- MIME编码,上传文件的表单必须选择该项\n\n====================\n\n2:表单元素\n\n1=添加表单控件\n\n```<form>\n<input name=\"控件名称\" type=\"控件类型\">\n</form>```\n\ninput表单类别\n\ntype=\"submit\" 将表单内容提交给服务器的按钮\n\ntype=\"reset\" 将表单内容全部清除,重新填写的按钮\n\ntype=\"image\" 图像提交按钮\n\ntype=\"hidden\" 隐藏域,隐藏域不显示在页面上,但会将内容传递到服务器中\n\ntype=\"file\" 文件域\n\n<input 属性1 属性2....>\n\ninput标签的常用属性\n\ntype 控件的类型\n\nname 控件的名称\n\nalign 对齐方式\n\nsize 控件的宽度\n\nmaxlength 允许输入的最大字符数\n\nvalue 用于指定输入默认值\n\n```<form>\n<input type=\"text\" size=\"20\">\n</form>```\n\n3:文件域\n\n(input type=\"file\")\n\n```<form name=\"form\" method=\"post\" action=\"https://www.baidu.com\">\n请上传你的照片到我的邮箱:\n<input type=\"file\" name=\"userpic\">\n<input type=\"submit\" value=\"发送\">\n</form>```\n\n4:====================\n\n```<select name=\"name\" size=\"value\" multipe>\n<option value=\"value\" selected>选项1</option>\n<option value=\"value\" >选项2</option>\n<option value=\"value\" >选项3</option>\n</select>```\n\nsize --- 显示选项的数目,当size为1时为下拉列表框的控件\n\nmultiple ----列表中的项目多选,用户用Ctrl键来实现多选\n\nvalue ----选项值\n\nselected === 默认选项\n\n```<form>\n请选择您的工作性质:<br>\n<select name=\"selected\" id=\"selected\">\n<option value=\"value\" selected>选项1</option>\n<option value=\"value\" >选项2</option>\n<option value=\"value\" >选项3</option>\n</select>\n<br>\n<input type=\"submit\" name=\"button\" id=\"button\" value=\"提交\">\n</form>```\n\n5=======\n\n<textarea name=\"field_name\" value=\"filed_value\" rows=value cols=value></textarea>\n\n```<form>\n<h2>用户调查</h2>\n请留言<br>\n<textarea name=\"textfiled\" cols=\"50\" rows=\"20\" id=\"textfild\"></textarea><br>\n<input type=\"submit\" name=\"button\" value=\"提交\">\n</form>```"
] | [
null
] | {"ft_lang_label":"__label__zh","ft_lang_prob":0.52186215,"math_prob":0.41631132,"size":1830,"snap":"2019-26-2019-30","text_gpt3_token_len":840,"char_repetition_ratio":0.18017524,"word_repetition_ratio":0.07692308,"special_character_ratio":0.30054644,"punctuation_ratio":0.04347826,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.95163864,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2019-07-16T20:27:16Z\",\"WARC-Record-ID\":\"<urn:uuid:11158eec-0bdf-4aad-a21c-d224c4f863b4>\",\"Content-Length\":\"24228\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:bbe2f754-107c-42f4-a563-e7b902f253b9>\",\"WARC-Concurrent-To\":\"<urn:uuid:7bc8b8f8-3c34-4342-8bc4-eaaa2bd9f181>\",\"WARC-IP-Address\":\"218.90.201.27\",\"WARC-Target-URI\":\"https://www.2cto.com/kf/201701/593268.html\",\"WARC-Payload-Digest\":\"sha1:NIXWZOTJKJNUQXHTXO6OSXJDZGLMLBGY\",\"WARC-Block-Digest\":\"sha1:IGUHOOAESOZ3D2ODI7P2AU2YZJIRWW2C\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2019/CC-MAIN-2019-30/CC-MAIN-2019-30_segments_1563195524879.8_warc_CC-MAIN-20190716201412-20190716223412-00293.warc.gz\"}"} |
http://hrstc.org/node/26 | [
"",
null,
"HRSTC [HeuRiSTiC]\n\n# Visualizing MovieLens Rating Matrix\n\nIt is interesting to look at the visualization of the MovieLens Rating Matrix",
null,
"Here is a random sub sample",
null,
"Here is the Matlab's code:\n\n% Multi-character delimiters are not supported;\n% so we get columns with delimeters too\nD = importdata('ratings.dat',':');\n\n% load data into sparse matrix\nX = sparse(D(:,3),D(:,1),D(:,5));\n\n% plot the whole matrix\nimagesc(X'); figure(gcf)\n\n% plot random sampling of matrix\nr1_idx = randint(1,100,[1,6040]);\nr2_idx = randint(1,100,[1,3592]);\nR = X(r2_idx,r1_idx);\nimagesc(R'); figure(gcf)"
] | [
null,
"http://hrstc.org/themes/pushbutton/logo.png",
null,
"http://hrstc.org/sites/default/files/movielens_rating_matrix.png",
null,
"http://hrstc.org/sites/default/files/movielens_rating_matrix_sample.png",
null
] | {"ft_lang_label":"__label__en","ft_lang_prob":0.71479553,"math_prob":0.99947506,"size":529,"snap":"2021-43-2021-49","text_gpt3_token_len":151,"char_repetition_ratio":0.0952381,"word_repetition_ratio":0.0,"special_character_ratio":0.3383743,"punctuation_ratio":0.22881356,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9988258,"pos_list":[0,1,2,3,4,5,6],"im_url_duplicate_count":[null,null,null,1,null,1,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2021-10-22T09:17:35Z\",\"WARC-Record-ID\":\"<urn:uuid:1752b94a-0df1-4283-8f37-6197c6060c7a>\",\"Content-Length\":\"6633\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:7f65f408-2fb7-4f6c-96b2-b30313179db9>\",\"WARC-Concurrent-To\":\"<urn:uuid:26a85523-6a0e-4852-8963-33394fe0b14a>\",\"WARC-IP-Address\":\"74.208.236.38\",\"WARC-Target-URI\":\"http://hrstc.org/node/26\",\"WARC-Payload-Digest\":\"sha1:TDPSKNLG2USHIJD3MR3LIMFCDRURECOI\",\"WARC-Block-Digest\":\"sha1:NYFMJPQ5YMIYLGRR6622BALRL4HDORUN\",\"WARC-Identified-Payload-Type\":\"application/xhtml+xml\",\"warc_filename\":\"/cc_download/warc_2021/CC-MAIN-2021-43/CC-MAIN-2021-43_segments_1634323585504.90_warc_CC-MAIN-20211022084005-20211022114005-00607.warc.gz\"}"} |
https://accord-framework.net/docs/html/M_Accord_Math_Matrix_DivideByDiagonal_33.htm | [
" Matrix.DivideByDiagonal Method (Byte[][], Single[], Single[][])",
null,
"Computes the product A*inv(B) of matrix A and diagonal matrix B.\n\nNamespace: Accord.Math\nAssembly: Accord.Math (in Accord.Math.dll) Version: 3.8.0",
null,
"Syntax\npublic static float[][] DivideByDiagonal(\nthis byte[][] a,\nfloat[] diagonal,\nfloat[][] result\n)\n\nParameters\n\na\nType: SystemByte\nThe left matrix A.\ndiagonal\nType: SystemSingle\nThe diagonal vector of inverse right matrix B.\nresult\nType: SystemSingle\nThe matrix R to store the product R = A*B of the given matrices A and B.\n\nType: Single\n\nUsage Note\n\nIn Visual Basic and C#, you can call this method as an instance method on any object of type . When you use instance method syntax to call this method, omit the first parameter. For more information, see Extension Methods (Visual Basic) or Extension Methods (C# Programming Guide).",
null,
"See Also"
] | [
null,
"https://accord-framework.net/docs/icons/logo.png",
null,
"https://accord-framework.net/docs/icons/SectionExpanded.png",
null,
"https://accord-framework.net/docs/icons/SectionExpanded.png",
null
] | {"ft_lang_label":"__label__en","ft_lang_prob":0.53745323,"math_prob":0.8927517,"size":1031,"snap":"2022-05-2022-21","text_gpt3_token_len":254,"char_repetition_ratio":0.12950341,"word_repetition_ratio":0.0,"special_character_ratio":0.24054316,"punctuation_ratio":0.15675676,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.99235374,"pos_list":[0,1,2,3,4,5,6],"im_url_duplicate_count":[null,null,null,null,null,null,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2022-01-28T19:43:29Z\",\"WARC-Record-ID\":\"<urn:uuid:5449d767-5af4-49a5-84f2-4aad42ecaf49>\",\"Content-Length\":\"85365\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:6bd435bf-ce72-4297-8367-8846f7421993>\",\"WARC-Concurrent-To\":\"<urn:uuid:171afc2e-7833-4f80-859b-97a8fa29d27c>\",\"WARC-IP-Address\":\"192.30.252.153\",\"WARC-Target-URI\":\"https://accord-framework.net/docs/html/M_Accord_Math_Matrix_DivideByDiagonal_33.htm\",\"WARC-Payload-Digest\":\"sha1:B5ENUMD4AUDR27YCO2I4FHYOYXLDUWLD\",\"WARC-Block-Digest\":\"sha1:BKLUXTI4IFLJJCYXWJULFDVTAANR6EFZ\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2022/CC-MAIN-2022-05/CC-MAIN-2022-05_segments_1642320306335.77_warc_CC-MAIN-20220128182552-20220128212552-00376.warc.gz\"}"} |
https://www.physicsoverflow.org/44477/how-to-find-solution-of-friedman-equation-numerically | [
"#",
null,
"How to find solution of Friedman equation numerically ?\n\n+ 0 like - 0 dislike\n241 views\n\nI am trying to solve friedman acceleration equation and continuity equation numerically using Runge Kutta Dormand Prince Method . My code was doing excellent for solving coupled differential equations. But, when I am trying to solve this equation , I am getting wrong results , I am getting same variation of scale factor for both matter dominated and radiation dominated case while one should vary as a2/3 and other should vary as a1/2. Can someone please tell me the possible reasons why this is happen ?\n\n$\\Ddota= -1/6(\\rho + 3p)$\n\nClosed by author request"
] | [
null,
"https://www.physicsoverflow.org/qa-plugin/po-printer-friendly/print_on.png",
null
] | {"ft_lang_label":"__label__en","ft_lang_prob":0.94121367,"math_prob":0.95112795,"size":534,"snap":"2023-14-2023-23","text_gpt3_token_len":118,"char_repetition_ratio":0.12075472,"word_repetition_ratio":0.023255814,"special_character_ratio":0.21910113,"punctuation_ratio":0.072916664,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9810235,"pos_list":[0,1,2],"im_url_duplicate_count":[null,null,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2023-03-27T14:02:04Z\",\"WARC-Record-ID\":\"<urn:uuid:f796c451-1f82-4b96-9ad3-d22cfead7642>\",\"Content-Length\":\"90331\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:ce91913b-0b68-43bf-9aa2-be42ddee3c5d>\",\"WARC-Concurrent-To\":\"<urn:uuid:0c20d648-c69e-4ca6-8aad-5b5de157d6d9>\",\"WARC-IP-Address\":\"129.70.43.86\",\"WARC-Target-URI\":\"https://www.physicsoverflow.org/44477/how-to-find-solution-of-friedman-equation-numerically\",\"WARC-Payload-Digest\":\"sha1:XFDKOEFDNCBVOAMRHABVAJUIN2ZPYF2F\",\"WARC-Block-Digest\":\"sha1:CNT4VUUYLJ3MH2GKJ6FW64C2SUMZWRSW\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2023/CC-MAIN-2023-14/CC-MAIN-2023-14_segments_1679296948632.20_warc_CC-MAIN-20230327123514-20230327153514-00352.warc.gz\"}"} |
https://kotlinlang.org/api/latest/jvm/stdlib/kotlin.collections/each-count-to.html | [
"# eachCountTo\n\nCommon\nJVM\nJS\nNative\n1.1\n`fun <T, K, M : MutableMap<in K, Int>> Grouping<T, K>.eachCountTo( destination: M): M`\n(source)\n\nGroups elements from the Grouping source by key and counts elements in each group to the given destination map.\n\nIf the destination map already has a value corresponding to the key of some group, that value is used as an initial value of the counter for that group.\n\n``````\n\nfun main(args: Array<String>) {\n//sampleStart\nval words = \"one two three four five six seven eight nine ten\".split(' ')\nval frequenciesByFirstChar = words.groupingBy { it.first() }.eachCount()\nprintln(\"Counting first letters:\")\nprintln(frequenciesByFirstChar) // {o=1, t=3, f=2, s=2, e=1, n=1}\n\nval moreWords = \"eleven twelve\".split(' ')\nval moreFrequencies = moreWords.groupingBy { it.first() }.eachCountTo(frequenciesByFirstChar.toMutableMap())\nprintln(moreFrequencies) // {o=1, t=4, f=2, s=2, e=2, n=1}\n//sampleEnd\n}``````\n\nReturn the destination map associating the key of each group with the count of elements in the group."
] | [
null
] | {"ft_lang_label":"__label__en","ft_lang_prob":0.65128946,"math_prob":0.9696859,"size":992,"snap":"2022-27-2022-33","text_gpt3_token_len":275,"char_repetition_ratio":0.12044534,"word_repetition_ratio":0.0,"special_character_ratio":0.26612905,"punctuation_ratio":0.17098446,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.96058583,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2022-07-02T19:39:32Z\",\"WARC-Record-ID\":\"<urn:uuid:97fe0039-1425-4059-94bc-9a856447d061>\",\"Content-Length\":\"25804\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:99955d64-1ba2-4cf5-87cd-bea0f84e4ec5>\",\"WARC-Concurrent-To\":\"<urn:uuid:023f3340-d566-4bbe-b65b-c827c6b6d6a8>\",\"WARC-IP-Address\":\"18.67.65.38\",\"WARC-Target-URI\":\"https://kotlinlang.org/api/latest/jvm/stdlib/kotlin.collections/each-count-to.html\",\"WARC-Payload-Digest\":\"sha1:FOZEQVLP6Y23H7DJQW4LND4DCMCHJMGK\",\"WARC-Block-Digest\":\"sha1:B7DRNX6YDDNV4CA3GO7MR2DV4FTTIGIZ\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2022/CC-MAIN-2022-27/CC-MAIN-2022-27_segments_1656104204514.62_warc_CC-MAIN-20220702192528-20220702222528-00117.warc.gz\"}"} |
https://wiki.phagocytes.ca/index.php/Bradford_Assay | [
"Introduction\n\nThe Bradford assay should be used to quantify total protein within a sample relative to a standard curve. This is important when running proteins on SDS-PAGE/Western blot, where each lane must contain an identical amount of total protein. This way, the intensity of the bands can be compared between different lanes, as standardizing the amount of protein loaded per lane will account for any variation in cell count from which the proteins were derived.\n\nProtocol\n\nFor a 96 well plate\n\n1. Using a 0.2 or 0.45 μm filter and 15 mL syringe, filter Bio-Rad Protein Assay Dye Reagent Concentrate (Bradford Dye) into a 15 mL falcon tube. Dilute 1:5 with ddH2O (1 part concentrate, 4 parts ddH2O). Invert to mix. Let warm to room temperature.\n2. Collect lysate or supernatant containing protein. Keep on ice.\n3. Label eight 1.5 mL tubes as: 1, 2, 3, 4, 5, 6, 7, 8. Set up the BSA standard by following Table 1. (Use the Bio-Rad 2 mg/mL stock. Do not make BSA yourself)\n• Make sure the diluent is the same as buffer that the protein of interest is in. For example, if in PBS, use PBS to dilute the standard. If in RIPA buffer, use RIPA, etc.\n• Mix by pipetting up and down. Avoid creating bubbles in the tube\n4. Set up 500 μL dilutions of your sample of interest. Make dilutions of 1:5, 1:10, and 1:25.\n• If you think your sample is very concentrated, instead make 1:10, 1:25, and 1:25 dilutions\n• If you think your sample is very dilute, use undiluted, 1:2, and 1:5 dilutions. (This uses a lot of sample however!)\n5. Add 150 μL of sample or standard to each well following Figure 1. Avoid bubbles by only pipetting to the first stop.\n6. Pour the dye into a multichannel pipette reservoir. Using a multichannel pipette, pipet 150 μL of dye into each well. Mix by pipetting carefully up and down.\n7. Incubate for at least 5 minutes at room temperature. Do not exceed 1 hr.\n8. Take off the lid of the plate, and place it into a plate reader/spectrometer.\n9. Measure absorbance at 595 nm.\nTable 1.\nTube # Standard volume (μL) Source of standard Diluent volume (μL) Final concentration (μg/mL)\n1 10 2 mg/mL stock 790 25\n2 10 2 mg/mL stock 990 20\n3 6 2 mg/mL stock 794 15\n4 500 Tube 2 500 10\n5 500 Tube 4 500 5\n6 500 Tube 5 500 2.5\n7 500 Tube 6 500 1.25\n8 - - 500 0\n\n-\n\nAnalysis using the standard curve\n\n1. Export results from spectrometer to Excel.\n2. Subtract the average absorbance of each standard/sample by the average absorbance of the blank. Essentially, you are setting the blank absorption to 0 and making all readings relative to that.\n3. Plot the known standard concentrations (X-axis: 0, 1.25, 2.5, 5, 10, 15, 20, and 25 μg/mL) with the average absorbance at each concentration (Y-axis). Add a line of best fit and display the equation with R2 value. Ideally, the R2 value should be ≥ 0.99. R2 < 0.94 curves should not be used.\n4. Calculate the average absorbance for the samples of interest by using the equation of the line graph y = mx+b (Absorbance = Slope*Concentration + b) and solve for x.\n5. If the calculated concentration falls within the linear range of the standard curve (1.25 - 25 μg/mL), then it is accurate. Determine the concentration of the undiluted sample by multiplying by the dilution factor."
] | [
null
] | {"ft_lang_label":"__label__en","ft_lang_prob":0.8359916,"math_prob":0.93784827,"size":3293,"snap":"2022-05-2022-21","text_gpt3_token_len":970,"char_repetition_ratio":0.121009424,"word_repetition_ratio":0.013490725,"special_character_ratio":0.29456422,"punctuation_ratio":0.13694721,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9526173,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2022-05-21T00:36:51Z\",\"WARC-Record-ID\":\"<urn:uuid:f8ef2edc-5e56-4c2b-884f-72a2302d094e>\",\"Content-Length\":\"19115\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:78d3d835-a91f-4eee-b69c-de11ce01638c>\",\"WARC-Concurrent-To\":\"<urn:uuid:7ba65644-74ec-470c-b20b-4324b9484963>\",\"WARC-IP-Address\":\"149.56.155.8\",\"WARC-Target-URI\":\"https://wiki.phagocytes.ca/index.php/Bradford_Assay\",\"WARC-Payload-Digest\":\"sha1:NAW5QVSUA5RRYWLOMAQTDWGFG7H66QEK\",\"WARC-Block-Digest\":\"sha1:UYRH4XM4JHTXM4PWRPXH6X27Y5VKHKAF\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2022/CC-MAIN-2022-21/CC-MAIN-2022-21_segments_1652662534693.28_warc_CC-MAIN-20220520223029-20220521013029-00263.warc.gz\"}"} |
http://robmorton.20m.com/science/velocity.html | [
"The Nature of Light: Measuring The Velocity of Light\n\nThe apparent distance travelled and time taken by light from its source to an observer differ according to whether we look at it from the point of view of the source or that of the observer. [Português] [PDF].\n\nBasis For The Velocity of Light\n\nThe velocity of light in free space is usually represented by the letter c. It is understood to be an invariant quantity. In other words it is a natural constant, which is built into the fundamental fabric of the universe. Why should the velocity of light have this fixed finite value? Why shouldn't the velocity of light be infinite? It is because light is an electromagnetic disturbance, and space has a natural reluctance to being electromagnetically disturbed.\n\nConsequently, when an electric field is applied at a particular place, the immediate space around it takes time to polarize. It has a kind of electrical inertia that impedes the electric field's effort to polarize it. The surrounding space lags more and more behind in adopting a polarized state the further it is from the place where the electric field is applied. The adoption of this polarized state therefore \"travels\" outwards spherically from the place where the electric field is applied. Due to the natural quantitative value of space's reluctance to polarize, the velocity of this \"travel\" (or propagation) is c, the velocity of light.\n\nSuppose the applied electric field starts off with zero strength. In other words, it doesn't exist yet. Then it starts to grow. It grows slowly at first. Then its rate of growth gradually increases to a maximum. Its rate of growth then reduces, becoming zero again as the strength of the field reaches its maximum. Then the field starts to decay (reduce). Its rate of decay is slow at first, speeds up and then decays back to zero as the strength of the electric field reaches zero again. This process forms an electric field pulse.\n\nA complementary property of space is that the rate of change of an electric field becomes manifested as the magnitude of what is generally known as a magnetic field. Space does not polarize magnetically as it does electrically. A magnetic field doesn't have \"ends\" or poles like an electric field. Instead, it acts in a circular sense, adopting something that is perhaps best conceptualized as a kind of rotational inertia. This results in a situation where, as the electric field is growing or collapsing most rapidly, the associated magnetic field is at its strongest. Conversely, as the magnetic field is changing (growing or collapsing) most rapidly, the electric field is at its strongest.\n\nThe result is that the electric and magnetic fields exchange energy repeatedly rather like the bob of a pendulum continually exchanges its potential energy (due to its height) with its kinetic energy (due to its speed). The result is that these two types of \"force fields\" fall away from their source as an ever-expanding sphere, playing a game of \"throw and catch\" with their energy. This energy becomes ever more thinly spread over the area of an ever-expanding spherical surface. The frequency with which the electric and magnetic fields exchange energy is the frequency of the electromagnetic disturbance.\n\nThe important thing to note from this rather over-simplistic description of electromagnetic propagation in free space is that the effective electromagnetic wave propagates spherically at this fundamental velocity c away from its source.\n\nNotwithstanding, an observer has no way of sensing the approach of a light-pulse. He has no way of sensing when it left its source. He has no way of sensing how far it has travelled. He has no way of sensing how much time it took to reach him. He therefore has no way of sensing how fast it travelled towards him. He can only sense it when it eventually \"hits\" him. Even then, he has no way to sense its velocity of impact.\n\nA Two-Way Trip is Necessary\n\nTo acquire some idea of how \"fast\" light travels, an observer must use the principle of radar. He must set up a source of light that he can control. He must have a stop-clock to measure time. He must have a distant object (ideally a mirror) that can reflect the light emitted by his source. He must have a means of detecting the light reflected from the distant object. He can use his eyes, of course. However, an electronic detector will help him to make a more accurate measurement. He must know accurately the distance x that the distant object is from him. His light-source must be wired so that it automatically starts his clock when it emits a pulse of light. His light-detector must be wired so that it stops the clock immediately it detects the arrival of the light-pulse reflected from the distant object.",
null,
"The observer triggers his light-source to emit a short pulse of light. At the same time, the light-source starts the clock. The light-pulse travels to the distant object (mirror). The mirror then reflects the light pulse back towards the observer. The observer's light detector detects the arrival of the returning light-pulse and immediately stops the clock. The clock reveals the amount of time t the light-pulse took to travel the distance 2x to the distant object and back again. The velocity of light is thus revealed as c = 2x/t.\n\nThis is simply an illustrative experiment. Nowadays, much more refined techniques and apparatus are used to provide more accurate measurements of the velocity of light.\n\nFrames of Reference\n\nI proposed in my previous article that the frame of reference relative to which light travels at its universal velocity c be exclusively that of its source. So what happens in this case when light is reflected back to the original source? In whose frame of reference is the light travelling at the universal velocity c? Isn't it that of the observer who was the original source? What would be the case if the distant object (the mirror) were moving away from the source/observer at a velocity v that was a significant fraction of the velocity of light?\n\nLet me suggest the following. When light is reflected from an object such as a mirror, the process is not the same as that of a ball bouncing off a wall. The original light is not reflected back. Instead, the original light is absorbed by the atoms of the material of which the mirror is made. These atoms then use that energy to generate new light. In other words, a mirror is itself a separate light-source that is \"powered\" by the energy from the incident light. This is consistent with the observation that an object rarely reflects the same colour of light that it receives. It radiates a colour that is charactistic of the material of which it is made.\n\nIf this be the case, then the outbound light pulse is travelling at velocity c with respect to the source/observer frame of reference and the return light-pulse is travelling at velocity c with respect to the distant object's (the mirror's) frame of reference. This situation is illustrated below.",
null,
"When the light-pulse is emitted by the source, the mirror is at a distance x. The light-pulse travels towards the mirror. It travels at velocity c relative to the frame of reference of the source. By the time the light-pulse reaches the mirror, the mirror has travelled a further distance ½vt away from the source. The total distance travelled by the light on the outbound journey is therefore x + ½vt. The mirror absorbs the energy of the light-pulse. It uses this energy to generate another light-pulse. This new light-pulse travels in the direction of the observer. It does so at velocity c relative to the frame of reference of the mirror. By the time the new light-pulse reaches the observer, the observer has travelled yet a further distance of ½vt away from the mirror. The returning light-pulse therefore travels a distance x + vt. The total distance travelled by the outbound and return light-pulses is therefore 2x + 1·5vt. The distance x is therefore given by x = ½(c − 1·5v)t.\n\nWhen the returning light-pulse reaches the observer, it will appear to him to have originated from where the mirror is at that instant. The mirror will appear to be at a distance d given by the formula:\n\nd = x + vt = ½(c - 1·5v)t + vt = (½c + ¼v)t;\n\nwhere t is the amount of time that has elapsed since the observer's light-source emitted the original outbound light-pulse and v is the relative velocity at which the observer and the mirror are receding from each other. This reasoning requires that the \"velocity\" with which wave-crests approach the receding observer is necessarily c − v, and for an approaching observer, c + v. However, this does not mean that anything is materially travelling faster than light. Nor does it mean that information is travelling faster than light.\n\nAgain, although this double source-centred view appears to work, it is not - as mentioned in the previous essay - consistent with any view of gravitational phenomena. Notwithstanding, if the observer-centred Ætherial View is applied to the thought experiment above, the mathematical reasoning is essentially the same. And it is consistent with a means of explaining gravity.\n\n© 17 October 2006 Robert John Morton | PREV | NEXT"
] | [
null,
"http://robmorton.20m.com/science/images/velocity2.gif",
null,
"http://robmorton.20m.com/science/images/velocity1.gif",
null
] | {"ft_lang_label":"__label__en","ft_lang_prob":0.9561874,"math_prob":0.94016266,"size":8994,"snap":"2019-43-2019-47","text_gpt3_token_len":1855,"char_repetition_ratio":0.15494995,"word_repetition_ratio":0.044980444,"special_character_ratio":0.19979987,"punctuation_ratio":0.07955215,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.95616317,"pos_list":[0,1,2,3,4],"im_url_duplicate_count":[null,2,null,2,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2019-10-15T21:59:25Z\",\"WARC-Record-ID\":\"<urn:uuid:08e7eb9b-1f17-42f9-93d0-17bbff9a79ea>\",\"Content-Length\":\"14776\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:d14a527a-d573-4d91-bd6b-18a1f0533307>\",\"WARC-Concurrent-To\":\"<urn:uuid:f3d82db7-7775-42a3-9af8-2e28760935ba>\",\"WARC-IP-Address\":\"64.136.20.53\",\"WARC-Target-URI\":\"http://robmorton.20m.com/science/velocity.html\",\"WARC-Payload-Digest\":\"sha1:KOGUD3LYOZFTMHMBB5QW3BT6NGY4DRSQ\",\"WARC-Block-Digest\":\"sha1:5QE2GDWSZE64NPJOGK4YGRC6V7ESFGO3\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2019/CC-MAIN-2019-43/CC-MAIN-2019-43_segments_1570986660323.32_warc_CC-MAIN-20191015205352-20191015232852-00381.warc.gz\"}"} |
https://www.doubtnut.com/question-answer/simplify-each-of-the-following-and-express-the-result-as-a-rational-number-in-standard-form-19-36xx--642588771 | [
"Getting Image",
null,
"",
null,
"",
null,
"",
null,
"Register now for special offers",
null,
"+91\n\nHome\n\n>\n\nEnglish\n\n>\n\nClass 8\n\n>\n\nMaths\n\n>\n\nChapter\n\n>\n\nRational Numbers\n\n>\n\nSimplify each of the following...\n\nUpdated On: 27-06-2022",
null,
"UPLOAD PHOTO AND GET THE ANSWER NOW!",
null,
"Step by step solution by experts to help you in doubt clearance & scoring excellent marks in exams.",
null,
"Transcript\n\n11 today question is simplify each of the following and Express as Express the result is a rational number in standard form in first part Vinay to simplify -19 upon 36 X 16in second part -13.9 X 27 - 26 so let's solve this question taking first part in first we need to simplify -19 upon 36 X 16 which can be done as 16 by one so making it more simple by cancellation method 16 and 36 will be cancelled 4 times a section will be cancelled for X and 3936 will be cancelled 9 time from 4 now it is not further we cannot make it more simple and more simplified so just multiplying numerator parts 19 x 4 19 multiplayer for will be\n\n76 and minus will be there and 9 X 1 is 9 only soon -76.9 is the answer for the first part moving on to the second part in second part we need to simplify -13.9 X 27 upon -26 so making it more simple by cancellation method so 2626 will be cancelled - 2 X from 13 - 13 so it will be -2 and -1 and 27 will be cancelled 3 x 9 so now it is not we cannot simply for that I cancellations to moving to the next tab 2 - 1 x 3 will be -3 and denominator 1 x minus phase -2 so answer will be 3\n\nto Fir the second part in the standard form I hope you understood the solution thank you\n\n## Related Videos\n\n642587141\n\n200\n\n7.2 K\n\n2:06\nSimplify each of the following and express the result as a rational number in standard from: <br>(i)(-19)/(36)xx16 <br>(ii) (-13)/9xx(27)/(-26)\n1531585\n\n200\n\n2.6 K\n\n1:04\nSimplify each of the following and express the result as a rational number in standard from: (-19)/(36)xx16 (ii) (-13)/9xx(27)/(-26)\n1533529\n\n0\n\n1.8 K\n\n1:06\nSimplify each of the following and express the result as a rational number in standard form: (-19)/(36)x 16 (ii) (-13)/9x(27)/(-26)\n642588773\n\n0\n\n6.1 K\n\n1:21\nSimplify each of the following and express the result as a rational number in standard form: (-11)/9xx(-81)/(-88) (ii) (-5)/9xx(72)/(-25)\n642588772\n\n0\n\n900\n\n2:05\nSimplify each of the following and express the result as a rational number in standard form: (-9)/(16)xx(-64)/(-27) (ii) (-50)/7xx(14)/3\n1533530\n\n300\n\n9.2 K\n\n1:28\nSimplify each of the following and express the result as a rational number in standard form: (-9)/(16)x(-64)/(-27) (ii) (-50)/7x(14)/3",
null,
"",
null,
""
] | [
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/sticky_menu_camera_icon.svg",
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,
"https://d10lpgp6xz60nq.cloudfront.net/images/user-comment.svg",
null,
"https://d10lpgp6xz60nq.cloudfront.net/images/loader.gif",
null
] | {"ft_lang_label":"__label__en","ft_lang_prob":0.9107969,"math_prob":0.9770329,"size":1302,"snap":"2022-40-2023-06","text_gpt3_token_len":343,"char_repetition_ratio":0.1540832,"word_repetition_ratio":0.04477612,"special_character_ratio":0.29185867,"punctuation_ratio":0.02846975,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9782894,"pos_list":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20],"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],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2022-10-05T19:35:51Z\",\"WARC-Record-ID\":\"<urn:uuid:c5a6159e-81b1-4bb2-b56b-e4ca4258e88b>\",\"Content-Length\":\"185446\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:d163c020-4843-47e1-a505-0eb06f54a5c9>\",\"WARC-Concurrent-To\":\"<urn:uuid:f97af217-bcaa-4069-aa27-42c60096c5ab>\",\"WARC-IP-Address\":\"108.138.64.127\",\"WARC-Target-URI\":\"https://www.doubtnut.com/question-answer/simplify-each-of-the-following-and-express-the-result-as-a-rational-number-in-standard-form-19-36xx--642588771\",\"WARC-Payload-Digest\":\"sha1:LLITF5YYSZ7Q4LOV3ZBWVX7EY5W3WFEM\",\"WARC-Block-Digest\":\"sha1:NWYIBSDPAC7PU6YIUQVFZ2KMV4NSHMZY\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2022/CC-MAIN-2022-40/CC-MAIN-2022-40_segments_1664030337663.75_warc_CC-MAIN-20221005172112-20221005202112-00422.warc.gz\"}"} |
https://www.talks.cam.ac.uk/talk/index/59061 | [
"# Nesting statistics in the O(n) loop model on random lattices\n\nRandom Geometry\n\nCo-author: Jeremie Bouttier (CEA Saclay and ENS Paris)\n\nWe investigate how deeply nested are the loops in the O(n) model on random maps. In particular, we find that the number P of loops separating two points in a planar map in the dense phase with V >> 1 vertices is typically of order c(n) ln V for a universal constant c(n), and we compute the large deviations of P. The formula we obtain shows similarity to the CLE _{kappa} nesting properties for n = 2\u000fspi(1 - 4/kappa). The results can be extended to all topologies using the methods of topological recursion.\n\nThis talk is part of the Isaac Newton Institute Seminar Series series."
] | [
null
] | {"ft_lang_label":"__label__en","ft_lang_prob":0.82674104,"math_prob":0.91948605,"size":1803,"snap":"2022-27-2022-33","text_gpt3_token_len":390,"char_repetition_ratio":0.086158976,"word_repetition_ratio":0.050179213,"special_character_ratio":0.18968385,"punctuation_ratio":0.06472492,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9783402,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2022-08-17T10:30:30Z\",\"WARC-Record-ID\":\"<urn:uuid:04b3da3e-5596-421d-b23d-2acebbfd12d0>\",\"Content-Length\":\"11434\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:da2668ad-42b7-40e7-997a-d637715756de>\",\"WARC-Concurrent-To\":\"<urn:uuid:1bce335f-9a63-4359-9319-aab59a453373>\",\"WARC-IP-Address\":\"131.111.150.181\",\"WARC-Target-URI\":\"https://www.talks.cam.ac.uk/talk/index/59061\",\"WARC-Payload-Digest\":\"sha1:LHNCZQJF3O24H2VRSYTD3PSAEU2EO6PQ\",\"WARC-Block-Digest\":\"sha1:JAZC32E47Q2VQUWMANNUDAO4W3TDMFI2\",\"WARC-Identified-Payload-Type\":\"application/xhtml+xml\",\"warc_filename\":\"/cc_download/warc_2022/CC-MAIN-2022-33/CC-MAIN-2022-33_segments_1659882572898.29_warc_CC-MAIN-20220817092402-20220817122402-00257.warc.gz\"}"} |
https://grinebiter.com/Calculators/Factors/Factors-of-776.html | [
"Factors of 776\n\nHere we have calculated and created a list of all the factors of seven hundred seventy-six.\nThe factors of 776 are:\n\n1, 2, 4, 8, 97, 194, 388, 776\n\nFactors of 776 are integers that you can multiply together to get 776. Here are all the combinations of factors of 776 that you can multiply together to get 776:\n\n1 x 776 = 776\n2 x 388 = 776\n4 x 194 = 776\n8 x 97 = 776\n97 x 8 = 776\n194 x 4 = 776\n388 x 2 = 776\n776 x 1 = 776\n\nIf you divide 776 by a factor of 776, you will get one of the other factors of 776. Here are all combinations of dividing 776 by its factors:\n\n776 / 1 = 776\n776 / 2 = 388\n776 / 4 = 194\n776 / 8 = 97\n776 / 97 = 8\n776 / 194 = 4\n776 / 388 = 2\n776 / 776 = 1\n\nIn summary, we have not only listed all the factors of 776, but also illustrated that our solution is correct by multiplying and dividing the factors of seven hundred seventy-six.\n\nFactoring Calculator\nDo you need the factors for another number? No problem - just enter it below and press \"Factor\".\n\nFactors of 777\nHere is the next number on our list for which we have calculated the factors."
] | [
null
] | {"ft_lang_label":"__label__en","ft_lang_prob":0.8875111,"math_prob":0.98897564,"size":1110,"snap":"2021-31-2021-39","text_gpt3_token_len":337,"char_repetition_ratio":0.18625678,"word_repetition_ratio":0.041666668,"special_character_ratio":0.4063063,"punctuation_ratio":0.084033616,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.99989426,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2021-09-22T05:27:55Z\",\"WARC-Record-ID\":\"<urn:uuid:1e432fd4-baa5-4ab2-9d97-8cedb4102722>\",\"Content-Length\":\"6894\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:a1500492-0615-4df3-86ae-2f6cbc02a927>\",\"WARC-Concurrent-To\":\"<urn:uuid:ebfb9cb1-b9a2-42ed-9f07-5ae34dc6d477>\",\"WARC-IP-Address\":\"99.86.230.101\",\"WARC-Target-URI\":\"https://grinebiter.com/Calculators/Factors/Factors-of-776.html\",\"WARC-Payload-Digest\":\"sha1:GYORKKPDKVG3JQNSQOACSRYBRMZAA7AC\",\"WARC-Block-Digest\":\"sha1:TDEV7SWRJKGTRAMBZWWB2VVGGT56OI34\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2021/CC-MAIN-2021-39/CC-MAIN-2021-39_segments_1631780057329.74_warc_CC-MAIN-20210922041825-20210922071825-00608.warc.gz\"}"} |
https://www.physicsforums.com/threads/sum-of-independent-uniform-distribution-conditional-on-uniform.392882/ | [
"# Sum of independent uniform distribution conditional on uniform\n\ngrossgermany\n\n## Homework Statement\n\nLet X and Y be independent and normal, then we know that\nIt must be the case that X+Y and X are jointly normal\nTherefore we can apply the projection theorem:\nwhich states that if A and B are jointly normal then VAR(A|B)=VAR(B)-$$\\rho$$^2VAR(B) , apply the theorem to A=X+Y, B=Y to find\nVAR(X+Y|X)\n\nThere is a similar procedure of finding E(X+Y|X)\n\nI know how to do the above. However, what I don't know is what if X and Y are independent but each are UNIFORMLY distributed on [-1,1]\nWhat is:\n1.VAR(X+Y|X)\n2.E(X+Y|X)\n\n## The Attempt at a Solution\n\nLast edited:\n\nHomework Helper\nthis may help (or may not), with bits borrowed form wiki\nhttp://en.wikipedia.org/wiki/Sum_of_normally_distributed_random_variables\nthough it should be independent of the probabilty distribution used\n\nlet Z = X + Y, and consider the joint probability density $f_{X,Y,Z}(x,y,z)$ the probability density of z is given by\n$$f_{Z}(z) = \\int f_{X,Y,Z}(x,y,z)dxdy$$\n\nyou can re-write the joint distribution using conditional probabilities & the independence of X & Y, following that through leads to the convolution\n$$f_{Z}(z) = \\int f_{X,Y,Z}(x,y,z)dxdy = \\int f_{X}(x)f_{Y}(y|x)f_{Z}(z|x,y)dxdy = \\int f_{X}(x)f_{Y}(y)\\delta(z-x-y)dxdy = \\int f_{X}(x)f_{Y}(z-x)dx$$\n\nThe conditional probability given $X = x_0$ will be\n$$f_{Z}(z|x_0) = \\int f_{X}(x|x_0)f_{Y}(y|x_0)f_{Z}(z|x_0,y)dxdy = \\int \\delta(x-x_0)f_{Y}(y)\\delta(z-x_0-y)dxdy=\\int f_{Y}(y)\\delta(z-x_0-y)dy= f_{Y}(z-x_0)$$\n\nThen take the expectation\n$$E(Z|x_0) = \\int z f(z|x_0)dz = \\int z f_{Y}(z-x_0)dz$$\n\nand similar for the variance\n\ngrossgermany\nUnfortunately I am already familiar with this topic with regard to normally distibuted variables.\nWhat I need is the mean and variance of sum of two independent Uniformly distributed variables conditional on one of the uniformly distributed variable.\nI know that X+Y should be a triangular distributed, if X and Y are independent uniformly distributed.\nHowever, what is\nE(x+y|x)\nVar(x+y|x)\n\nLast edited:\nHomework Helper\nthe derivation does not assume normal variables & should work for any distribution\n\nthe convolution integral will give you the triangular distribution\n\nthe last integral should give you the expectation with conditional X=x_0 (try it, it should be pretty simple)\n\nthen you should be able to use the conditional distiribution for the finding the variance as well\n\nThats rigorous... but if you just think about what is happening when X=x_0 is known you should be able to guess the mean & variance based on the distribution of Y easily enough\n\nLast edited:\nHomework Helper\nPS, hint - as X is a set value, the only random variable is Y, so in effect Z = constant + Y...\n\nLast edited:\ngrossgermany\nThank you very much for your reply. I mostly understand what you wrote except 3 things.\n1. Why is the conditional pdf of (z given x,y) equal to dirac's delta function of z-(x+y). Wikipedia just says they are trivially equal. Yes it's true that z needs to be equal to x+y, so you can say there is zero probabiltiy z not equal to x+y. But somehow I feel this is just too much intuition and not rigorous enough.\n2. When the double integral regard to x y become a single integral to x, why does this work out to be fx(x)fy(z-x) ?\n\nYes y=z-x but don't we need\nintegral[fx(x)integral{fy(z-x)d(-x)}dx]. The d(-x) is due to the fact that dy=d(z-x)=-dx\n3. How would we find E(X|X+Y)\n\nLast edited:\nHomework Helper\nThank you very much for your reply. I mostly understand what you wrote except 3 things.\n1. Why is the conditional pdf of (z given x,y) equal to dirac's delta function of z-(x+y). Wikipedia just says they are trivially equal. Yes it's true that z needs to be equal to x+y, so you can say there is zero probabiltiy z not equal to x+y. But somehow I feel this is just too much intuition and not rigorous enough.\nit can only be that, given X=x & Y=y, Z =X+Y is totally determined to be Z=x+y, hence\n$$f_Z(z=x+y|X=x,Y=y) = \\delta(z-x+y)$$\nnote this intgrates to one as it must and satifies the constraint\n\n2. When the double integral regard to x y become a single integral to x, why does this work out to be fx(x)fy(z-x) ? Yes y=z-x but don't we need integral[fx(x)integral{fy(z-x)d(-x)}dx]. The d(-x) is due to the fact that dy=d(z-x)=-dx\nthe following integral is contracted by integrating over all y, integrating over the delta function sets y = z-x\n$$= \\int \\int f_{X}(x)f_{Y}(y)\\delta(z-x-y)dxdy = \\int f_{X}(x)f_{Y}(z-x)dx$$\n\nyou could similarly choose to integrate over x first & get\n$$= \\int \\int f_{X}(x)f_{Y}(y)\\delta(z-x-y)dxdy = \\int \\int f_{X}(x)f_{Y}(y)\\delta(z-x-y)dydx = \\int f_{X}(z-y)f_{Y}(y)dy$$\n\nthe results are equivalent as they must be, we choose to integrate over Y first as it makes life easier later on with the constrant on x\n\n3. How would we find E(X|X+Y)\nthis takes a little more thought as i assume you mean E(X|Z), with Z = X+Y? you would need to find the conditional probability distribution\n\nfor the previous questions, say you have a random variable X with\n$$E(X) = \\mu$$\n$$VAR(X) = \\sigma^2$$\n\nnote that for a constant a\n$$E(X+a) = \\mu +a$$\n$$VAR(X+a) = \\sigma^2$$\n\ngrossgermany\nI am able to completely understand your post now. Thank you. But I tried to derive the entire thing in your early post but with different objective:\nGive X and Y are indpendent uniform\nFind\nE(X|Z=X+Y)\nVar(X|Z=X+Y)\nand I am stuck in the imitation of your proof. Simply because fx(x|z) is no longer fx(x).\nWould you please show me how to redo your early post in this scenario?"
] | [
null
] | {"ft_lang_label":"__label__en","ft_lang_prob":0.90819323,"math_prob":0.9991825,"size":754,"snap":"2022-27-2022-33","text_gpt3_token_len":226,"char_repetition_ratio":0.12666667,"word_repetition_ratio":0.168,"special_character_ratio":0.25596818,"punctuation_ratio":0.06748466,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.99998534,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2022-08-10T05:17:54Z\",\"WARC-Record-ID\":\"<urn:uuid:10de84ba-5373-46b9-b5ab-a80d8919fed6>\",\"Content-Length\":\"81772\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:7ea9f33d-f366-4c54-b49c-863d738730b3>\",\"WARC-Concurrent-To\":\"<urn:uuid:9222bdc0-a798-4f54-8873-427fec6e7699>\",\"WARC-IP-Address\":\"104.26.15.132\",\"WARC-Target-URI\":\"https://www.physicsforums.com/threads/sum-of-independent-uniform-distribution-conditional-on-uniform.392882/\",\"WARC-Payload-Digest\":\"sha1:OCBWE2HYGRV7QIM7SG3MACDMXP2V3AVM\",\"WARC-Block-Digest\":\"sha1:ANMTMOBAMP4GYPXOG2E3KCSGNYL54WRA\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2022/CC-MAIN-2022-33/CC-MAIN-2022-33_segments_1659882571147.84_warc_CC-MAIN-20220810040253-20220810070253-00001.warc.gz\"}"} |
https://www.studysmarter.us/textbooks/math/essential-calculus-early-transcendentals-2nd/series/q35e-a-use-the-sum-of-the-first-10-terms-and-exercise-33a-to/ | [
"",
null,
"Suggested languages for you:\n\nEurope\n\nAnswers without the blur. Sign up and see all textbooks for free!",
null,
"Q35E\n\nExpert-verified",
null,
"Found in: Page 453",
null,
"### Essential Calculus: Early Transcendentals\n\nBook edition 2nd\nAuthor(s) James Stewart\nPages 830 pages\nISBN 9781133112280",
null,
"# (a) Use the sum of the first 10 terms and Exercise 33(a) to estimate the sum of the series$$\\sum\\limits_{n = 1}^\\infty {\\frac{1}{{{n^2}}}}$$ . How good is this estimate?(b) Improve this estimate using Exercise 33(b) with n = 10(c) Find a value of n that will ensure that the error in the approximation $$S \\approx {S_n}$$ is less than 0.01\n\n(a) The sum of series $$\\sum\\limits_{n = 1}^\\infty {\\frac{1}{{{n^2}}}}$$ is 1.549768 with error at most 0.1\n\n(b) When n = 10, estimate $$S \\approx 1.64522$$ with error ≤ 0.005\n\n(c) Value of n > 1000 that will ensure the error approx $$S \\approx {S_n}$$ is less than 0.01\n\nSee the step by step solution\n\n## (a) Applying Integral on the Given Function:\n\nLet the associated function $$f(x) = \\frac{1}{{{x^2}}}$$ is positive and continuous then\n\n$$f(x) = \\frac{{ - 2}}{{{x^3}}} < 0{\\rm{ for }}x \\ge 1$$\n\nTherefore on applying integral it gives an upper bound for the error using the mth partial sum as:\n\n$${R_\\infty } = \\sum\\limits_{n \\to 1}^\\infty {\\frac{1}{{{n^2}}} \\le \\int\\limits_1^\\infty {\\frac{1}{{{x^2}}}dx} }$$\n\n$${\\rm{ }} = \\mathop {\\lim }\\limits_{b \\to \\infty } \\left[ {\\frac{{ - 1}}{x}} \\right]_m^b = \\frac{1}{m} - \\mathop {\\lim }\\limits_{b \\to \\infty } \\frac{1}{b} = \\frac{1}{m}$$\n\nThe estimate using the sum of the first ten terms is\n\n$$\\sum\\limits_{n = 1}^\\infty {\\frac{1}{{{n^2}}} \\approx {S_{10}}}$$\n\n$$= 1 + \\frac{1}{{{2^2}}} + \\frac{1}{{{3^2}}} + .... + \\frac{1}{{{{10}^2}}}$$\n\n$$\\approx 1.549768$$\n\nAnd the error of this estimate is $${R_{10}} \\le \\frac{1}{{10}}$$ , so the error is at most 0.1\n\n## (b) Improving Estimate with n = 10\n\nWe have $${S_n} + \\int\\limits_{n + 1}^\\infty {f(x)dx \\le S \\le {S_n} + \\int\\limits_n^\\infty {f(x)dx} }$$\n\nNow with n = 10, we have $${S_{10}} + \\int\\limits_{11}^\\infty {\\frac{1}{{{x^2}}}dx \\( = {S_{10}} + \\frac{1}{{11}} \\le S \\le {S_{10}} + \\frac{1}{{10}}$$\n\n$$= 1.549768 + 0.090909 \\le S \\le 1.549768 + 0.1$$\n\n$$= 1.640677 \\le S \\le 1.6491768$$\n\nSo we get S ≈ 1.64522 which is average of 1.640677 and 1.649768, with error ≤ 0.005 (which is rounded up for half 0.1)\n\n## (c) Finding Value of n\n\nWe have $${S_n} \\le \\int\\limits_n^\\infty {\\frac{1}{{{x^2}}}dx{\\rm{ which is equal to }}\\frac{1}{n}}$$\n\n$${\\rm{That is, }}{{\\rm{S}}_n} \\le \\int\\limits_n^\\infty {\\frac{1}{{{x^2}}}dx} = \\frac{1}{n}$$\n\n$${\\rm{So }}{{\\rm{S}}_n} < 0.01{\\rm{ if }}\\frac{1}{n} < \\frac{1}{{1000}}$$\n\n$${\\rm{Hence }}n > 1000$$",
null,
"### Want to see more solutions like these?",
null,
""
] | [
null,
"https://www.studysmarter.us/wp-content/themes/StudySmarter-Theme/dist/assets/images/header-logo.svg",
null,
"https://www.studysmarter.us/wp-content/themes/StudySmarter-Theme/src/assets/images/ab-test/searching-looking.svg",
null,
"https://studysmarter-mediafiles.s3.amazonaws.com/media/textbook-images/Stewart_essential_calculus.jpeg",
null,
"https://studysmarter-mediafiles.s3.amazonaws.com/media/textbook-images/Stewart_essential_calculus.jpeg",
null,
"https://www.studysmarter.us/wp-content/themes/StudySmarter-Theme/src/assets/images/ab-test/businessman-superhero.svg",
null,
"https://www.studysmarter.us/wp-content/themes/StudySmarter-Theme/img/textbook/banner-top.svg",
null,
"https://www.studysmarter.us/wp-content/themes/StudySmarter-Theme/img/textbook/cta-icon.svg",
null
] | {"ft_lang_label":"__label__en","ft_lang_prob":0.5952772,"math_prob":1.0000001,"size":2327,"snap":"2023-14-2023-23","text_gpt3_token_len":970,"char_repetition_ratio":0.17907877,"word_repetition_ratio":0.032967035,"special_character_ratio":0.5040825,"punctuation_ratio":0.06889353,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9999981,"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\":\"2023-03-30T02:50:35Z\",\"WARC-Record-ID\":\"<urn:uuid:76575345-8b8e-4814-a366-3f13d8a56ac2>\",\"Content-Length\":\"152637\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:0b94ba16-3e30-4a73-8928-2c80a363fd7e>\",\"WARC-Concurrent-To\":\"<urn:uuid:9b73a2e0-1cc4-43f1-bbb3-1fca31dff994>\",\"WARC-IP-Address\":\"18.184.139.114\",\"WARC-Target-URI\":\"https://www.studysmarter.us/textbooks/math/essential-calculus-early-transcendentals-2nd/series/q35e-a-use-the-sum-of-the-first-10-terms-and-exercise-33a-to/\",\"WARC-Payload-Digest\":\"sha1:GOHJHA5WKWOZ7RQOV3SZIOOPIY7BUQ2U\",\"WARC-Block-Digest\":\"sha1:JY2BKGZYQGDO5XAB24PNS5L6TKQIFZOS\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2023/CC-MAIN-2023-14/CC-MAIN-2023-14_segments_1679296949093.14_warc_CC-MAIN-20230330004340-20230330034340-00552.warc.gz\"}"} |
https://soccerlapeche.ca/scanwise.aspx | [
"Android App Development\n\n# Converting Fractions Improper To Mixed Worksheet\n\n## First form is to fractions mixed\n\nConverting Improper Fractions To Mixed Numbers Worksheet. Apr 22 2013 This free support page will help you understand how to convert improper fraction to mixed fraction and how to convert mixed fractions to improper.\n\nPython\n\n## We count the improper fractions to mixed worksheet\n\nScroll down to a quizizz to this is this is created great way to fractions to improper mixed worksheet maker will need to helping with riddles to practice converting mixed number and improper fractions to solve future problems?\n\nDocuments X\n\n## To create and to worksheet\n\nConverting a decimal to a mixed number and an improper. Worksheet 2 Convert mixed numbers to improper fractions 2 ' This page includes a lesson covering 'Converting from improper fractions to mixed fractions' as.\n\nFrom\n\n## Ready to mixed fractions to improper fractione numerator\n\nClick here for converting fractions improper to mixed worksheet has a different types and publish button in question: convert between different number fraction is required! 10 Ways to Practice Converting Improper Fractions and Mixed.\n\nOf Parts\n\n## The left and converting fractions improper fraction\n\nThe things interesting real life applications as mixed fractions to worksheet, progress so it into an improper fraction worksheets in the number part of the total number. How can you convert an improper fraction to a mixed number. Fraction Worksheets Math is Fun.\n\nManual\n\n## This problem yourself at anytime by converting fractions to improper mixed worksheet onto overhead and draw a means that\n\nHow to Convert Mixed Numbers to Improper Fractions Maths. Create free unlimited worksheets to practice to simplify fractions Set the range for the numerator and denominator and the worksheet is ready in a couple of.\n\nProviders\n\n## Help students start by contrast, to fractions improper mixed numbers are\n\nThe squares to fractions mixed worksheet requires a model of esl math fractions and rectangles with the bottom of the denominator remains the same denominator, you want to? Printable-fraction-worksheets-convert-mixed-numbers-to. Rename Mixed to Fractions PDF4PRO.\n\nSatisfaction\n\n## To all our terms before converting fractions to mixed numbers\n\nIt means that make great deal with rectangles with situation or. Practice writing a fraction as a mixed number and vice versa. Keep the denominator remains the correct and to mixed numbers; give you want to. Converting Improper Fractions to Mixed Fractions A.\n\nDivorce\n\n## Quizizz also mention that\n\nFree Printable Class 4 Converting improper fraction to mixed. Tutorial an animated video mini-lesson and a free worksheet and answer key. Lesson Converting Mixed Numbers to Improper Fractions.\n\nOf System\n\n## Sasha is a mixed number as fractions worksheet has\n\nWhen students have to convert from improper fractions to mixed. Students use themes and whole number together or folding will show you to fractions improper mixed numbers and resources and mixed numbers and more to this.\n\nLaws\n\n## Add a printable converting improper fractions\n\nPlease select the questions for helping with a fraction by your reports, and fill up to join the ten in converting improper fractions can directly from your previous lesson. Convert mixed numbers to improper fractions Fraction and. Improper fractions worksheet.\n\nQuick\n\n## It off a worksheet to fractions improper mixed numbers as well\n\nMixed Fractions to Improper Worksheets Free Printable PDF. Converting Mixed Numbers to Improper Fractions Worksheets. Put a circle around the improper fraction and change them into mixed fractions. Multiplying mixed fractions worksheets.\n\nResume\n\n## Audio instructions for fractions mixed\n\nConvert Improper Fractions and Mixed Numbers Worksheets. Worksheet on Changing Fractions Improper Fraction to a. Also has a mixed fractions can show you can often have permission to worksheet to. Mixed numbers on a number line calculator.\n\nTustin\n\n## Find a fractions mixed numbers\n\nChanging improper fractions to mixed numbers 4th grade. Badges that she practices converting improper fractions to mixed word worksheet has 9 problems multiplying fractions worksheets have an accurate comparison of.\n\nAnd\n\n## This worksheet to fractions improper mixed numbers that\n\nQuiz & Worksheet Changing Between Improper Fraction and. Worksheets Write improper fractions as mixed numbers Below are six versions of our grade 4 fractions worksheet on re-writing improper fractions fractions 1 to.\n\nUnlock",
null,
""
] | [
null,
"https://soccerlapeche.ca/9dc203.png",
null
] | {"ft_lang_label":"__label__en","ft_lang_prob":0.84989214,"math_prob":0.8154571,"size":4338,"snap":"2022-40-2023-06","text_gpt3_token_len":799,"char_repetition_ratio":0.3077988,"word_repetition_ratio":0.024806201,"special_character_ratio":0.16620563,"punctuation_ratio":0.062849164,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.98824406,"pos_list":[0,1,2],"im_url_duplicate_count":[null,1,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2023-02-01T16:33:01Z\",\"WARC-Record-ID\":\"<urn:uuid:1ab1d923-627b-45c6-b2fa-ddfaaf1270ed>\",\"Content-Length\":\"122976\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:8c244110-8328-4b29-8415-331209e0eca8>\",\"WARC-Concurrent-To\":\"<urn:uuid:42e747ec-0979-40f1-baa6-589d696eb126>\",\"WARC-IP-Address\":\"104.21.90.199\",\"WARC-Target-URI\":\"https://soccerlapeche.ca/scanwise.aspx\",\"WARC-Payload-Digest\":\"sha1:NW5FJSOHEWVSS6Z4E7RTL3UOVRFN7N6E\",\"WARC-Block-Digest\":\"sha1:IBQLMDWSXZJ2E5LJY5BVHW6Q3KL5YY6M\",\"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-00391.warc.gz\"}"} |
http://dynamicmathematicslearning.com/thabit-pyth-generalization.html | [
"## Thabit's Generalization of the Theorem of Pythagoras",
null,
"Let ABC be any triangle as shown below. Construct lines AD and AE as shown in the figure so that angles BAD and CEA are both equal to angle BAC. Then AB2 + AC2 = BC(BD + CE).\n1) Drag any of A, B or C to explore the configuration, and also click on the given button to show the measurements.\n2) An easy way of constructing angles BAD and CEA equal to angle BAC is simply to rotate lines AB and AC around A respectively by the directed angles ACB and ABC.\n3) When the angle at vertex A is a right angle, angles BAD and CEA will also be right angles, and the points D and E will coincide (since the perpendicular from A to BC is unique). In other words, we then obtain the theorem of Pythagoras, namely, AB2 + AC2 = BC2."
] | [
null,
"http://dynamicmathematicslearning.com/thabit.png",
null
] | {"ft_lang_label":"__label__en","ft_lang_prob":0.904388,"math_prob":0.99465686,"size":1285,"snap":"2022-05-2022-21","text_gpt3_token_len":319,"char_repetition_ratio":0.10928962,"word_repetition_ratio":0.0,"special_character_ratio":0.24357976,"punctuation_ratio":0.112840466,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.99677587,"pos_list":[0,1,2],"im_url_duplicate_count":[null,1,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2022-05-17T16:47:58Z\",\"WARC-Record-ID\":\"<urn:uuid:5f6a342b-37a6-4302-96b0-cb9949b7011f>\",\"Content-Length\":\"3692\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:a3a047df-dab3-44d6-8148-01226f00d397>\",\"WARC-Concurrent-To\":\"<urn:uuid:5e4a5744-e292-47ce-a048-7e15beb14bad>\",\"WARC-IP-Address\":\"66.84.6.23\",\"WARC-Target-URI\":\"http://dynamicmathematicslearning.com/thabit-pyth-generalization.html\",\"WARC-Payload-Digest\":\"sha1:ELKJHYMSGWU5I2MVTQJSOBE2XJNT7RSA\",\"WARC-Block-Digest\":\"sha1:NMQMS6XNWJH4HLFAVJALEGBFBS4HW7PQ\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2022/CC-MAIN-2022-21/CC-MAIN-2022-21_segments_1652662519037.11_warc_CC-MAIN-20220517162558-20220517192558-00772.warc.gz\"}"} |
https://www.equationsworksheets.net/translating-words-into-equations-worksheet/ | [
"# Translating Words Into Equations Worksheet\n\nTranslating Words Into Equations Worksheet – Expressions and Equations Worksheets are created to assist children in learning faster and more efficiently. These worksheets are interactive and challenges based on sequence of operations. These worksheets will help children can master both basic and complex concepts in a quick amount of period of time. These PDF resources are free to download, and can be used by your child in order to learn math concepts. These resources are helpful for students in 5th-8th grades.",
null,
"These worksheets can be utilized by students between 5th and 8th grades. These two-step word problems are created using fractions and decimals. Each worksheet contains ten problems. They can be found at any online or print resource. These worksheets are an excellent method to learn how to reorder equations. In addition to allowing students to practice the art of rearranging equations, they assist your student to understand the properties of equality and inverted operations.\n\nThese worksheets are targeted at fifth and eight graders. These are great for students who struggle to calculate percentages. There are three types of problems that you can pick from. You can choose to solve one-step problems that include whole or decimal numbers, or utilize word-based strategies to do fractions or decimals. Each page will have 10 equations. These worksheets for Equations can be used by students in the 5th to 8th grade.",
null,
"These worksheets are a great source for practicing fractions along with other topics related to algebra. Some of the worksheets let users to select from three types of challenges. You can select one that is word-based, numerical or a combination of both. It is crucial to select the type of problem, as every problem is different. Ten problems are on each page, so they’re fantastic resources for students in the 5th to 8th grades.\n\nThe worksheets will teach students about the relationship between variables and numbers. These worksheets allow students to work on solving polynomial problems and to learn how to apply equations to solve problems in everyday life. If you’re in search of an educational tool that will help you learn about expressions and equations, you can start with these worksheets. These worksheets can teach you about the different kinds of mathematical issues as well as the different symbols that are employed to explain them.",
null,
"These worksheets are extremely beneficial for students who are in the 1st grade. These worksheets will teach students how to solve equations and graphs. They are great for practice with polynomial variables. These worksheets can help you factor and simplify these variables. You can find a great set of equations, expressions and worksheets designed for children of every grade level. Doing the work yourself is the most efficient way to master equations.\n\nThere are many worksheets to learn about quadratic equations. There are various levels of equations worksheets for each grade. These worksheets are designed in order to assist you in solving problems of the fourth degree. Once you have completed a certain level, you can continue to work on other kinds of equations. You can continue to take on the same problems. For instance, you could discover a problem that uses the same axis, but as an extended number."
] | [
null,
"https://www.equationsworksheets.net/wp-content/uploads/2022/10/translating-word-problems-to-equations-word-problems-math-word-2.jpg",
null,
"https://www.equationsworksheets.net/wp-content/uploads/2022/10/translating-words-into-equations-card-sort-math-words-education-math-scaled.jpg",
null,
"https://www.equationsworksheets.net/wp-content/uploads/2022/10/translating-words-into-equations-worksheet.jpg",
null
] | {"ft_lang_label":"__label__en","ft_lang_prob":0.9530452,"math_prob":0.954449,"size":3357,"snap":"2023-40-2023-50","text_gpt3_token_len":628,"char_repetition_ratio":0.18878616,"word_repetition_ratio":0.011173184,"special_character_ratio":0.18111409,"punctuation_ratio":0.082214765,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.99075955,"pos_list":[0,1,2,3,4,5,6],"im_url_duplicate_count":[null,1,null,1,null,1,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2023-10-04T20:01:00Z\",\"WARC-Record-ID\":\"<urn:uuid:037f4631-875a-4644-8afb-0ad09c39b90a>\",\"Content-Length\":\"66422\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:61db708c-c2af-4321-bb60-49e63a241906>\",\"WARC-Concurrent-To\":\"<urn:uuid:65b3379d-caaf-4dc5-a50f-64780c30b101>\",\"WARC-IP-Address\":\"104.21.91.193\",\"WARC-Target-URI\":\"https://www.equationsworksheets.net/translating-words-into-equations-worksheet/\",\"WARC-Payload-Digest\":\"sha1:J4OWXEERJ7RGXHS2RKSND5ZFQFHU32WH\",\"WARC-Block-Digest\":\"sha1:4NIY5MQLIM5LNZL7XTC2GKOY67T5ARYN\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2023/CC-MAIN-2023-40/CC-MAIN-2023-40_segments_1695233511406.34_warc_CC-MAIN-20231004184208-20231004214208-00363.warc.gz\"}"} |
https://math.stackexchange.com/questions/3196064/find-general-formula-for-the-terms | [
"# Find general formula for the terms\n\nFind a general formula for the terms of the sequence\n\n$${a_n}=\\left\\{ \\frac{11}{7},\\frac{107}{49},\\frac{659}{343},\\frac{4883}{2401},\\frac{33371}{16807},\\frac{234569}{117649},\\dots \\right\\}$$\n\nI don't know how to approach this question as it is not arithmetic or geometric. I know the denominator is geometric increasing by a factor of $$7$$ but I can't find what the numerator should be for the general formula for the terms. Anyone know what it is?\n\n• Where does it come from? – Jean-Claude Arbaut Apr 21 at 17:14\n• My online calculus questions platform called Mobius(used to be Maple TA). I believe it must be a mistake as nothing I input is giving me the correct answer. – RaV1oLLi Apr 21 at 17:16\n• Have you put it into OEIS? – Dave Apr 21 at 17:22\n• This is in the OEIS, but not much else - oeis.org/A081657 – Peter Foreman Apr 21 at 17:23\n• Nobody can tell you the correct answer. Whatever answer you give, the proposer can tell you that you are wrong. You an't win this kind of game. – Somos Apr 21 at 18:55\n\n## 3 Answers\n\nThe general formula for an (infinite) sequence of (e. g. real) numbers from the finite number $$n$$ of its (first) members is in principle impossible, as the next (not listed) $$(n+1)^\\mathrm{th}$$ member may be an arbitrary number, and there is still a formula for expressing $$a_1, \\dots, a_n, a_{n+1},$$ e. g. as a polynomial of order $$n$$:\n\n$$a_k = \\sum_{i=0}^nb_ik^i,\\quad k = 1, \\dots,n+1$$\n\nThe process for finding coefficients $$b_0, \\dots, b_n$$ is straightforward enough.\n\nIn other words, if someone will find the formula for your \"sequence\", there is still the infinity number of other formulas, giving different sequences, but all of them producing your \"sequence\", i. e. $$\\frac{11}{7},\\frac{107}{49},\\frac{659}{343},\\frac{4883}{2401},\\frac{33371}{16807},\\frac{234569}{117649}.$$\n\nNote:\n\nIt means that all psychological tests of type\n\nWhat is the next number of the sequence $$1, 2, 3, 4, 5?$$\n\nare in principle meaningless ones, because you may tell \"$$1762$$\", and then show to surprised psychologist a formula supporting the correctness of your answer:\n\n$$a_k = {439\\over30}k^5-{439\\over 2}k^4+{7463\\over 6}k^3-{6585\\over 2}k^2+{60158\\over 15}k-1756$$\n\nIf he/she will not trust you, launch SageMath, which will produce accurate, non-rounded results, and write commands\n\nsage: var(\"k\")\nsage: a(k) = (439/30)*k^5 - (439/2)*k^4+(7463/6)*k^3-(6585/2)*k^2+(60158/15)*k-1756\nsage: a(1), a(2), a(3), a(4), a(5), a(6), a(7), a(8)\n\n\nto obtain the result\n\n(1, 2, 3, 4, 5, 1762, 10543, 36884)\n\n\n(and to give the psychologist two more members for free).\n\nNote 2:\n\nIt doesn't mean that there is not a simpler formula - including a recurrent one or other \"recipe\" - for the same (finite) sequence.\n\nFor example, there is so simple one for the rather not so trivial sequence\n\n$$\\color{blue}{1, 11, 21, 1211, 111221}$$\n\nthat even 6-7 year-old child is able to write down the next element ($$\\color{red}{312211}$$) if you tell it the rule, or - perhaps - even without telling it.\n\nNo, you have no chance to discover this simple rule (supposing your age is $$10$$+). Don't waste your time. It's a good advice, believe me.\n\n(Googling for it is a much better approach.)\n\nThe general term seems to be $$a_n=\\frac{2(7^n)+(-3)^n}{7^n}=2+\\left(-\\frac{3}{7}\\right)^n$$ But the last term is given by $$a_6=2-\\left(\\frac{3}{7}\\right)^6$$ so this formula does not always work. A suitable formula could be $$a_n=\\begin{cases}2-\\left(\\frac{3}{7}\\right)^n&n\\equiv0\\mod{6}\\\\ 2+\\left(-\\frac{3}{7}\\right)^n &\\text{otherwise} \\end{cases}$$\n\nThe numerator of the $$n$$-th term seems to be $$2\\cdot 7^n+(-1)^n 3^n.$$\n\n• May I ask how you got to this answer? Or is trial and error the only method?Edit: I inputted this answer into the online question and it came out as incorrect. – RaV1oLLi Apr 21 at 17:07\n• I was thinking the same, but what about the last term? $234569\\ne 2(7^6)+3^6$ – Peter Foreman Apr 21 at 17:07\n• @PeterForeman Arg, yes, the last is $2(7)^6\\color{red}{-}3^6$! – Jean-Claude Arbaut Apr 21 at 17:10\n• @RaV1oLLi: I noticed the numerators are the successive powers of $7$, and the numerators were not far from twice the denominator, with a corrective term. So I subtracted twice the denominators from the numerators, and tried to see a pattern. I tested only the 5 first terms. – Bernard Apr 21 at 17:20"
] | [
null
] | {"ft_lang_label":"__label__en","ft_lang_prob":0.8821842,"math_prob":0.99608606,"size":2126,"snap":"2019-13-2019-22","text_gpt3_token_len":698,"char_repetition_ratio":0.099434495,"word_repetition_ratio":0.0,"special_character_ratio":0.37770462,"punctuation_ratio":0.16,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9994814,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2019-05-25T03:08:48Z\",\"WARC-Record-ID\":\"<urn:uuid:e3407a71-2bb3-42f9-be55-fb04f3dfef7a>\",\"Content-Length\":\"153989\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:233dbfdf-4187-466c-9f3f-fdc4ec1e41a3>\",\"WARC-Concurrent-To\":\"<urn:uuid:110703d0-6a74-4f13-8862-1df3c783abc5>\",\"WARC-IP-Address\":\"151.101.129.69\",\"WARC-Target-URI\":\"https://math.stackexchange.com/questions/3196064/find-general-formula-for-the-terms\",\"WARC-Payload-Digest\":\"sha1:GU4KKZQ27HEJUYZB6HS5DNIEAGY64ZYE\",\"WARC-Block-Digest\":\"sha1:Y5HSAPQQ2KUIAWA4KEJISYI5B2XRXULC\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2019/CC-MAIN-2019-22/CC-MAIN-2019-22_segments_1558232257847.56_warc_CC-MAIN-20190525024710-20190525050710-00316.warc.gz\"}"} |
https://www.convertunits.com/from/decitonne/to/chaldron | [
"## ››Convert decitonne to chaldron\n\n decitonne chaldron\n\nHow many decitonne in 1 chaldron? The answer is 26.9252.\nWe assume you are converting between decitonne and chaldron.\nYou can view more details on each measurement unit:\ndecitonne or chaldron\nThe SI base unit for mass is the kilogram.\n1 kilogram is equal to 0.01 decitonne, or 0.00037139928394218 chaldron.\nNote that rounding errors may occur, so always check the results.\nUse this page to learn how to convert between decitonnes and chaldrons.\nType in your own numbers in the form to convert the units!\n\n## ››Quick conversion chart of decitonne to chaldron\n\n1 decitonne to chaldron = 0.03714 chaldron\n\n10 decitonne to chaldron = 0.3714 chaldron\n\n20 decitonne to chaldron = 0.7428 chaldron\n\n30 decitonne to chaldron = 1.1142 chaldron\n\n40 decitonne to chaldron = 1.4856 chaldron\n\n50 decitonne to chaldron = 1.857 chaldron\n\n100 decitonne to chaldron = 3.71399 chaldron\n\n200 decitonne to chaldron = 7.42799 chaldron\n\n## ››Want other units?\n\nYou can do the reverse unit conversion from chaldron to decitonne, or enter any two units below:\n\n## Enter two units to convert\n\n From: To:\n\n## ››Definition: Decitonne\n\nThe SI prefix \"deci\" represents a factor of 10-1, or in exponential notation, 1E-1.\n\nSo 1 decitonne = 10-1 tonnes.\n\nThe definition of a tonne is as follows:\n\nA tonne (also called metric ton) is a non-SI unit of mass, accepted for use with SI, defined as: 1 tonne = 1000 kg (= 106 g).\n\n## ››Metric conversions and more\n\nConvertUnits.com provides an online conversion calculator for all types of measurement units. You can find metric conversion tables for SI units, as well as English units, currency, and other data. Type in unit symbols, abbreviations, or full names for units of length, area, mass, pressure, and other types. Examples include mm, inch, 100 kg, US fluid ounce, 6'3\", 10 stone 4, cubic cm, metres squared, grams, moles, feet per second, and many more!"
] | [
null
] | {"ft_lang_label":"__label__en","ft_lang_prob":0.7544107,"math_prob":0.9467776,"size":1879,"snap":"2019-51-2020-05","text_gpt3_token_len":570,"char_repetition_ratio":0.25226668,"word_repetition_ratio":0.0,"special_character_ratio":0.27142096,"punctuation_ratio":0.15263158,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9554502,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2020-01-22T05:27:23Z\",\"WARC-Record-ID\":\"<urn:uuid:f36e22b2-2f15-4529-92a1-79a3d7f2fe1e>\",\"Content-Length\":\"31697\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:1c958e22-3b16-48fd-ac8d-a8320d05dd9c>\",\"WARC-Concurrent-To\":\"<urn:uuid:1cdeb375-3950-4b02-902d-4ae8710f8afe>\",\"WARC-IP-Address\":\"54.175.245.234\",\"WARC-Target-URI\":\"https://www.convertunits.com/from/decitonne/to/chaldron\",\"WARC-Payload-Digest\":\"sha1:VNQXGXGHACF77F3BZPMSK5GD2OMOIREG\",\"WARC-Block-Digest\":\"sha1:2WBKR5K4GM76G2O44SAT5R246NDRZOWR\",\"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-00121.warc.gz\"}"} |
http://home.ubalt.edu/ntsbarsh/Business-stat/excel/excel.htm | [
"## Excel For Statistical Data Analysis\n\nPara mis visitantes del mundo de habla hispana, este sitio se encuentra disponible en español en:\nSitio Espejo para América Latina Sitio de los E.E.U.U.\n\nExcel is the widely used statistical package, which serves as a tool to understand statistical concepts and computation to check your hand-worked calculation in solving your homework problems. The site provides an introduction to understand the basics of and working with the Excel. Redoing the illustrated numerical examples in this site will help improving your familiarity and as a result increase the effectiveness and efficiency of your process in statistics.\n\nProfessor Hossein Arsham\n\nTo search the site, try Edit | Find in page [Ctrl + f]. Enter a word or phrase in the dialogue box, e.g. \"variance\" or \"mean\" If the first appearance of the word/phrase is not what you are looking for, try Find Next.\n\nCompanion Sites:\n\n### Introduction\n\nThis site provides illustrative experience in the use of Excel for data summary, presentation, and for other basic statistical analysis. I believe the popular use of Excel is on the areas where Excel really can excel. This includes organizing data, i.e. basic data management, tabulation and graphics. For real statistical analysis on must learn using the professional commercial statistical packages such as SAS, and SPSS.\n\nMicrosoft Excel 2000 (version 9) provides a set of data analysis tools called the Analysis ToolPak which you can use to save steps when you develop complex statistical analyses. You provide the data and parameters for each analysis; the tool uses the appropriate statistical macro functions and then displays the results in an output table. Some tools generate charts in addition to output tables.\n\nIf the Data Analysis command is selectable on the Tools menu, then the Analysis ToolPak is installed on your system. However, if the Data Analysis command is not on the Tools menu, you need to install the Analysis ToolPak by doing the following:\n\nStep 1: On the Tools menu, click Add-Ins.... If Analysis ToolPak is not listed in the Add-Ins dialog box, click Browse and locate the drive, folder name, and file name for the Analysis ToolPak Add-in Analys32.xll usually located in the Program Files\\Microsoft Office\\Office\\Library\\Analysis folder. Once you find the file, select it and click OK.\n\nStep 2: If you don't find the Analys32.xll file, then you must install it.\n\n1. Insert your Microsoft Office 2000 Disk 1 into the CD ROM drive.\n2. Select Run from the Windows Start menu.\n3. Browse and select the drive for your CD. Select Setup.exe, click Open, and click OK.\n4. Click the Add or Remove Features button.\n5. Click the + next to Microsoft Excel for Windows.\n6. Click the + next to Add-ins.\n7. Click the down arrow next to Analysis ToolPak.\n8. Select Run from My Computer.\n9. Select the Update Now button.\n10. Excel will now update your system to include Analysis ToolPak.\n11. Launch Excel.\n12. On the Tools menu, click Add-Ins... - and select the Analysis ToolPak check box.\nStep 3: The Analysis ToolPak Add-In is now installed and Data Analysis... will now be selectable on the Tools menu.\n\nMicrosoft Excel is a powerful spreadsheet package available for Microsoft Windows and the Apple Macintosh. Spreadsheet software is used to store information in columns and rows which can then be organized and/or processed. Spreadsheets are designed to work well with numbers but often include text. Excel organizes your work into workbooks; each workbook can contain many worksheets; worksheets are used to list and analyze data .\n\nExcel is available on all public-access PCs (i.e., those, e.g., in the Library and PC Labs). It can be opened either by selecting Start - Programs - Microsoft Excel or by clicking on the Excel Short Cut which is either on your desktop, or on any PC, or on the Office Tool bar.\n\nOpening a Document:\n\n• Click on File-Open (Ctrl+O) to open/retrieve an existing workbook; change the directory area or drive to look for files in other locations\n• To create a new workbook, click on File-New-Blank Document.\n\nSaving and Closing a Document:\n\nTo save your document with its current filename, location and file format either click on File - Save. If you are saving for the first time, click File-Save; choose/type a name for your document; then click OK. Also use File-Save if you want to save to a different filename/location.\n\nWhen you have finished working on a document you should close it. Go to the File menu and click on Close. If you have made any changes since the file was last saved, you will be asked if you wish to save them.\n\nThe Excel screen",
null,
"Workbooks and worksheets:\n\nWhen you start Excel, a blank worksheet is displayed which consists of a multiple grid of cells with numbered rows down the page and alphabetically-titled columns across the page. Each cell is referenced by its coordinates (e.g., A3 is used to refer to the cell in column A and row 3; B10:B20 is used to refer to the range of cells in column B and rows 10 through 20).\n\nYour work is stored in an Excel file called a workbook. Each workbook may contain several worksheets and/or charts - the current worksheet is called the active sheet. To view a different worksheet in a workbook click the appropriate Sheet Tab.\n\nYou can access and execute commands directly from the main menu or you can point to one of the toolbar buttons (the display box that appears below the button, when you place the cursor over it, indicates the name/action of the button) and click once.\n\nMoving Around the Worksheet:\n\nIt is important to be able to move around the worksheet effectively because you can only enter or change data at the position of the cursor. You can move the cursor by using the arrow keys or by moving the mouse to the required cell and clicking. Once selected the cell becomes the active cell and is identified by a thick border; only one cell can be active at a time.\n\nTo move from one worksheet to another click the sheet tabs. (If your workbook contains many sheets, right-click the tab scrolling buttons then click the sheet you want.) The name of the active sheet is shown in bold.\n\nMoving Between Cells:\n\nHere is a keyboard shortcuts to move the active cell:\n\n• Home - moves to the first column in the current row\n• Ctrl+Home - moves to the top left corner of the document\n• End then Home - moves to the last cell in the document\n\nTo move between cells on a worksheet, click any cell or use the arrow keys. To see a different area of the sheet, use the scroll bars and click on the arrows or the area above/below the scroll box in either the vertical or horizontal scroll bars.\n\nNote that the size of a scroll box indicates the proportional amount of the used area of the sheet that is visible in the window. The position of a scroll box indicates the relative location of the visible area within the worksheet.\n\n### Entering Data\n\nA new worksheet is a grid of rows and columns. The rows are labeled with numbers, and the columns are labeled with letters. Each intersection of a row and a column is a cell. Each cell has an address, which is the column letter and the row number. The arrow on the worksheet to the right points to cell A1, which is currently highlighted, indicating that it is an active cell. A cell must be active to enter information into it. To highlight (select) a cell, click on it.\n\nTo select more than one cell:\n\n• Click on a cell (e.g. A1), then hold the shift key while you click on another (e.g. D4) to select all cells between and including A1 and D4.\n• Click on a cell (e.g. A1) and drag the mouse across the desired range, unclicking on another cell (e.g. D4) to select all cells between and including A1 and D4.\n• To select several cells which are not adjacent, press \"control\" and click on the cells you want to select. Click a number or letter labeling a row or column to select that entire row or column.\n\nOne worksheet can have up to 256 columns and 65,536 rows, so it'll be a while before you run out of space.\n\nEach cell can contain a label, value, logical value, or formula.\n\n• Labels can contain any combination of letters, numbers, or symbols.\n• Values are numbers. Only values (numbers) can be used in calculations. A value can also be a date or a time\n• Logical values are \"true\" or \"false.\"\n• Formulas automatically do calculations on the values in other specified cells and display the result in the cell in which the formula is entered (for example, you can specify that cell D3 is to contain the sum of the numbers in B3 and C3; the number displayed in D3 will then be a funtion of the numbers entered into B3 and C3).",
null,
"To enter information into a cell, select the cell and begin typing.\n\nNote that as you type information into the cell, the information you enter also displays in the formula bar. You can also enter information into the formula bar, and the information will appear in the selected cell.\n\nWhen you have finished entering the label or value:\n\n• Press \"Enter\" to move to the next cell below (in this case, A2)\n• Press \"Tab\" to move to the next cell to the right (in this case, B1)\n• Click in any cell to select it\nEntering Labels",
null,
"Unless the information you enter is formatted as a value or a formula, Excel will interpret it as a label, and defaults to align the text on the left side of the cell.\n\nIf you are creating a long worksheet and you will be repeating the same label information in many different cells, you can use the AutoComplete function. This function will look at other entries in the same column and attempt to match a previous entry with your current entry. For example, if you have already typed \"Wesleyan\" in another cell and you type \"W\" in a new cell, Excel will automatically enter \"Wesleyan.\" If you intended to type \"Wesleyan\" into the cell, your task is done, and you can move on to the next cell. If you intended to type something else, e.g. \"Williams,\" into the cell, just continue typing to enter the term.\n\nTo turn on the AutoComplete funtion, click on \"Tools\" in the menu bar, then select \"Options,\" then select \"Edit,\" and click to put a check in the box beside \"Enable AutoComplete for cell values.\"\n\nAnother way to quickly enter repeated labels is to use the Pick List feature. Right click on a cell, then select \"Pick From List.\" This will give you a menu of all other entries in cells in that column. Click on an item in the menu to enter it into the currently selected cell.\n\nEntering Values\n\nA value is a number, date, or time, plus a few symbols if necessary to further define the numbers [such as: . , + - ( ) % \\$ / ].\n\nNumbers are assumed to be positive; to enter a negative number, use a minus sign \"-\" or enclose the number in parentheses \"()\".\n\nDates are stored as MM/DD/YYYY, but you do not have to enter it precisely in that format. If you enter \"jan 9\" or \"jan-9\", Excel will recognize it at January 9 of the current year, and store it as 1/9/2002. Enter the four-digit year for a year other than the current year (e.g. \"jan 9, 1999\"). To enter the current day's date, press \"control\" and \";\" at the same time.\n\nTimes default to a 24 hour clock. Use \"a\" or \"p\" to indicate \"am\" or \"pm\" if you use a 12 hour clock (e.g. \"8:30 p\" is interpreted as 8:30 PM). To enter the current time, press \"control\" and \":\" (shift-semicolon) at the same time.",
null,
"An entry interpreted as a value (number, date, or time) is aligned to the right side of the cell, to reformat a value.\n\nRounding Numbers that Meet Specified Criteria: To apply colors to maximum and/or minimum values:\n\n1. Select a cell in the region, and press Ctrl+Shift+* (in Excel 2003, press this or Ctrl+A) to select the Current Region.\n2. From the Format menu, select Conditional Formatting.\n3. In Condition 1, select Formula Is, and type =MAX(\\$F:\\$F) =\\$F1.\n4. Click Format, select the Font tab, select a color, and then click OK.\n5. In Condition 2, select Formula Is, and type =MIN(\\$F:\\$F) =\\$F1.\n6. Repeat step 4, select a different color than you selected for Condition 1, and then click OK.\nNote: Be sure to distinguish between absolute reference and relative reference when entering the formulas.\n\nRounding Numbers that Meet Specified Criteria\n\nProblem: Rounding all the numbers in column A to zero decimal places, except for those that have \"5\" in the first decimal place.\n\nSolution: Use the IF, MOD, and ROUND functions in the following formula: =IF(MOD(A2,1)=0.5,A2,ROUND(A2,0))\n\nTo Copy and Paste All Cells in a Sheet\n\n1. Select the cells in the sheet by pressing Ctrl+A (in Excel 2003, select a cell in a blank area before pressing Ctrl+A, or from a selected cell in a Current Region/List range, press Ctrl+A+A).\nOR\nClick Select All at the top-left intersection of rows and columns.\n2. Press Ctrl+C.\n3. Press Ctrl+Page Down to select another sheet, then select cell A1.\n4. Press Enter.\n\nTo Copy the Entire Sheet\n\nCopying the entire sheet means copying the cells, the page setup parameters, and the defined range Names.\n\nOption 1:\n\n1. Move the mouse pointer to a sheet tab.\n2. Press Ctrl, and hold the mouse to drag the sheet to a different location.\n3. Release the mouse button and the Ctrl key.\n\nOption 2:\n\n1. Right-click the appropriate sheet tab.\n2. From the shortcut menu, select Move or Copy. The Move or Copy dialog box enables one to copy the sheet either to a different location in the current workbook or to a different workbook. Be sure to mark the Create a copy checkbox.\n\nOption 3:\n\n1. From the Window menu, select Arrange.\n2. Select Tiled to tile all open workbooks in the window.\n3. Use Option 1 (dragging the sheet while pressing Ctrl) to copy or move a sheet.\n\nSorting by Columns\n\nThe default setting for sorting in Ascending or Descending order is by row. To sort by columns:\n\n1. From the Data menu, select Sort, and then Options.\n2. Select the Sort left to right option button and click OK.\n3. In the Sort by option of the Sort dialog box, select the row number by which the columns will be sorted and click OK.\n\n### Descriptive Statistics\n\nThe Data Analysis ToolPak has a Descriptive Statistics tool that provides you with an easy way to calculate summary statistics for a set of sample data. Summary statistics includes Mean, Standard Error, Median, Mode, Standard Deviation, Variance, Kurtosis, Skewness, Range, Minimum, Maximum, Sum, and Count. This tool eliminates the need to type indivividual functions to find each of these results. Excel includes elaborate and customisable toolbars, for example the \"standard\" toolbar shown here:",
null,
"Some of the icons are useful mathematical computation:",
null,
"is the \"Autosum\" icon, which enters the formula \"=sum()\" to add up a range of cells.",
null,
"is the \"FunctionWizard\" icon, which gives you access to all the functions available.",
null,
"is the \"GraphWizard\" icon, giving access to all graph types available, as shown in this display:",
null,
"Excel can be used to generate measures of location and variability for a variable. Suppose we wish to find descriptive statistics for a sample data: 2, 4, 6, and 8.\n\nStep 1. Select the Tools *pull-down menu, if you see data analysis, click on this option, otherwise, click on add-in.. option to install analysis tool pak.\n\nStep 2. Click on the data analysis option.\n\nStep 3. Choose Descriptive Statistics from Analysis Tools list.\n\nStep 4. When the dialog box appears:\n\nEnter A1:A4 in the input range box, A1 is a value in column A and row 1, in this case this value is 2. Using the same technique enter other VALUES until you reach the last one. If a sample consists of 20 numbers, you can select for example A1, A2, A3, etc. as the input range.\n\nStep 5. Select an output range, in this case B1. Click on summary statistics to see the results.\n\nSelect OK.\n\nWhen you click OK, you will see the result in the selected range.\n\nAs you will see, the mean of the sample is 5, the median is 5, the standard deviation is 2.581989, the sample variance is 6.666667,the range is 6 and so on. Each of these factors might be important in your calculation\nof different statistical procedures.\n\n### Normal Distribution\n\nConsider the problem of finding the probability of getting less than a certain value under any normal probability distribution. As an illustrative example, let us suppose the SAT scores nationwide are normally distributed with a mean and standard deviation of 500 and 100, respectively. Answer the following questions based on the given information:\n\nA: What is the probability that a randomly selected student score will be less than 600 points?\nB: What is the probability that a randomly selected student score will exceed 600 points?\nC: What is the probability that a randomly selected student score will be between 400 and 600?\n\nHint: Using Excel you can find the probability of getting a value approximately less than or equal to a given value. In a problem, when the mean and the standard deviation of the population are given, you have to use common sense to find different probabilities based on the question since you know the area under a normal curve is 1.\n\nSolution:\n\nIn the work sheet, select the cell where you want the answer to appear. Suppose, you chose cell number one, A1. From the menus, select \"insert pull-down\".\n\nSteps 2-3 From the menus, select insert, then click on the Function option.\n\nStep 4. After clicking on the Function option, the Paste Function dialog appears from Function Category. Choose Statistical then NORMDIST from the Function Name box; Click OK\n\nStep 5. After clicking on OK, the NORMDIST distribution box appears:\ni. Enter 600 in X (the value box);\nii. Enter 500 in the Mean box;\niii. Enter 100 in the Standard deviation box;\niv. Type \"true\" in the cumulative box, then click OK.\n\nAs you see the value 0.84134474 appears in A1, indicating the probability that a randomly selected student's score is below 600 points. Using common sense we can answer part \"b\" by subtracting 0.84134474 from 1. So the part \"b\" answer is 1- 0.8413474 or 0.158653. This is the probability that a randomly selected student's score is greater than 600 points. To answer part \"c\", use the same techniques to find the probabilities or area in the left sides of values 600 and 400. Since these areas or probabilities overlap each other to answer the question you should subtract the smaller probability from the larger probability. The answer equals 0.84134474 - 0.15865526 that is, 0.68269. The screen shot should look like following:\n\nInverse Case\n\nCalculating the value of a random variable often called the \"x\" value\n\nYou can use NORMINV from the function box to calculate a value for the random variable - if the probability to the left side of this variable is given. Actually, you should use this function to calculate different percentiles. In this problem one could ask what is the score of a student whose percentile is 90? This means approximately 90% of students scores are less than this number. On the other hand if we were asked to do this problem by hand, we would have had to calculate the x value using the normal distribution formula x = m + zd. Now let's use Excel to calculate P90. In the Paste function, dialog click on statistical, then click on NORMINV. The screen shot would look like the following:\n\nWhen you see NORMINV the dialog box appears.\ni. Enter 0.90 for the probability (this means that approximately 90% of students' score is less than the value we are looking for)\nii. Enter 500 for the mean (this is the mean of the normal distribution in our case)\niii. Enter 100 for the standard deviation (this is the standard deviation of the normal distribution in our case)\n\nAt the end of this screen you will see the formula result which is approximately 628 points. This means the top 10% of the students scored better than 628.\n\n### Confidence Interval for the Mean\n\nSuppose we wish for estimating a confidence interval for the mean of a population. Depending on the size of your sample size you may use one of the following cases:\n\nLarge Sample Size (n is larger than, say 30):\n\nThe general formula for developing a confidence interval for a population means is:",
null,
"In this formula",
null,
"is the mean of the sample; Z is the interval coefficient, which can be found from the normal distribution table (for example the interval coefficient for a 95% confidence level is 1.96). S is the standard deviation of the sample and n is the sample size.\n\nNow we would like to show how Excel is used to develop a certain confidence interval of a population mean based on a sample information. As you see in order to evaluate this formula you need",
null,
"\"the mean of the sample\" and the margin of error",
null,
"Excel will automatically calculate these quantities for you.\n\nThe only things you have to do are:\n\nadd the margin of error",
null,
"to the mean of the sample,",
null,
"; Find the upper limit of the interval and subtract the margin of error from the mean to the lower limit of the interval. To demonstrate how Excel finds these quantities we will use the data set, which contains the hourly income of 36 work-study students here, at the University of Baltimore. These numbers appear in cells A1 to A36 on an Excel work sheet.\n\nAfter entering the data, we followed the descriptive statistic procedure to calculate the unknown quantities. The only additional step is to click on the confidence interval in the descriptive statistics dialog box and enter the given confidence level, in this case 95%.\n\nHere is, the above procedures in step-by-step:\n\nStep 1. Enter data in cells A1 to A36 (on the spreadsheet)\nStep 2. From the menus select Tools\nStep 3. Click on Data Analysis then choose the Descriptive Statistics option then click OK.\n\nOn the descriptive statistics dialog, click on Summary Statistic. After you have done that, click on the confidence interval level and type 95% - or in other problems whatever confidence interval you desire. In the Output Range box enter B1 or what ever location you desire.\nNow click on OK. The screen shot would look like the following:",
null,
"",
null,
"As you see, the spreadsheet shows that the mean of the sample is",
null,
"= 6.902777778 and the absolute value of the margin of error",
null,
"= 0.231678109. This mean is based on this sample information. A 95% confidence interval for the hourly income of the UB work-study students has an upper limit of 6.902777778 + 0.231678109 and a lower limit of 6.902777778 - 0.231678109.\n\nOn the other hand, we can say that of all the intervals formed this way 95% contains the mean of the population. Or, for practical purposes, we can be 95% confident that the mean of the population is between 6.902777778 - 0.231678109 and 6.902777778 + 0.231678109. We can be at least 95% confident that interval [\\$6.68 and \\$7.13] contains the average hourly income of a work-study student.\n\nSmal Sample Size (say less than 30) If the sample n is less than 30 or we must use the small sample procedure to develop a confidence interval for the mean of a population. The general formula for developing confidence intervals for the population mean based on small a sample is:",
null,
"In this formula",
null,
"is the mean of the sample.",
null,
"is the interval coefficient providing an area of",
null,
"in the upper tail of a t distribution with n-1 degrees of freedom which can be found from a t distribution table (for example the interval coefficient for a 90% confidence level is 1.833 if the sample is 10). S is the standard deviation of the sample and n is the sample size.\n\nNow you would like to see how Excel is used to develop a certain confidence interval of a population mean based on this small sample information.\n\nAs you see, to evaluate this formula you need",
null,
"\"the mean of the sample\" and the margin of error",
null,
"Excel will automatically calculate these quantities the way it did for large samples.\n\nAgain, the only things you have to do are: add the margin of error",
null,
"to the mean of the sample,",
null,
", find the upper limit of the interval and to subtract the margin of error from the mean to find the lower limit of the interval.\n\nTo demonstrate how Excel finds these quantities we will use the data set, which contains the hourly incomes of 10 work-study students here, at the University of Baltimore. These numbers appear in cells A1 to A10 on an Excel work sheet.\n\nAfter entering the data we follow the descriptive statistic procedure to calculate the unknown quantities (exactly the way we found quantities for large sample). Here you are with the procedures in step-by-step form:\n\nStep 1. Enter data in cells A1 to A10 on the spreadsheet\nStep 2. From the menus select Tools\nStep 3. Click on Data Analysis then choose the Descriptive Statistics option. Click OK on the descriptive statistics dialog, click on Summary Statistic, click on the confidence interval level and type in 90% or in other problems whichever confidence interval you desire. In the Output Range box, enter B1 or whatever location you desire. Now click on OK. The screen shot will look like the following:",
null,
"Now, like the calculation of the confidence interval for the large sample, calculate the confidence interval of the population based on this small sample information. The confidence interval is:\n\n6.8 ± 0.414426102\nor\n\\$6.39<===>\\$7.21.\n\nWe can be at least 90% confidant that the interval [\\$6.39 and \\$7.21] contains the true mean of the population.\n\n### Test of Hypothesis Concerning the Population Mean\n\nAgain, we must distinguish two cases with respect to the size of your sample\n\nLarge Sample Size (say, over 30): In this section you wish to know how Excel can be used to conduct a hypothesis test about a population mean. We will use the hourly incomes of different work-study students than those introduced earlier in the confidence interval section. Data are entered in cells A1 to A36. The objective is to test the following Null and Alternative hypothesis:",
null,
"The null hypothesis indicates that the average hourly income of a work-study student is equal to \\$7 per hour; however, the alternative hypothesis indicates that the average hourly income is not equal to \\$7 per hour.\n\nI will repeat the steps taken in descriptive statistics and at the very end will show how to find the value of the test statistics in this case, z, using a cell formula.\n\nStep 1. Enter data in cells A1 to A36 (on the spreadsheet)\n\nStep 2. From the menus select Tools\n\nStep 3. Click on Data Analysis then choose the Descriptive Statistics option, click OK.\nOn the descriptive statistics dialog, click on Summary Statistic. Select the Output Range box, enter B1 or whichever location you desire. Now click OK.\n\n(To calculate the value of the test statistics search for the mean of the sample then the standard error. In this output, these values are in cells C3 and C4.)\n\nStep 4. Select cell D1 and enter the cell formula = (C3 - 7)/C4. The screen shot should look like the following:",
null,
"The value in cell D1 is the value of the test statistics. Since this value falls in acceptance range of -1.96 to 1.96 (from the normal distribution table), we fail to reject the null hypothesis.\n\nSmall Sample Size (say, less than 30):\n\nUsing steps taken the large sample size case, Excel can be used to conduct a hypothesis for small-sample case. Let's use the hourly income of 10 work-study students at UB to conduct the following hypothesis.",
null,
"The null hypothesis indicates that average hourly income of a work-study student is equal to \\$7 per hour .The alternative hypothesis indicates that average hourly income is not equal to \\$7 per hour.\n\nI will repeat the steps taken in descriptive statistics and at the very end will show how to find the value of the test statistics in this case \"t\" using a cell formula.\n\nStep 1. Enter data in cells A1 to A10 (on the spreadsheet)\n\nStep 2. From the menus select Tools\n\nStep 3. Click on Data Analysis then choose the Descriptive Statistics option. Click OK.\nOn the descriptive statistics dialog, click on Summary Statistic. Select the Output Range boxes, enter B1 or whatever location you chose. Again, click on OK.\n(To calculate the value of the test statistics search for the mean of the sample then the standard\nerror, in this output these values are in cells C3 and C4.)\n\nStep 4. Select cell D1 and enter the cell formula = (C3 - 7)/C4. The screen shot would look like the following:",
null,
"Since the value of test statistic t = -0.66896 falls in acceptance range -2.262 to +2.262 (from t table, where",
null,
"= 0.025 and the degrees of freedom is 9), we fail to reject the null hypothesis.\n\n### Difference Between Mean of Two Populations\n\nIn this section we will show how Excel is used to conduct a hypothesis test about the difference between two population means assuming that populations have equal variances. The data in this case are taken from various offices here at the University of Baltimore. I collected the hourly income data of 36 randomly selected work-study students and 36 student assistants. The hourly income range for work-study students was \\$6 - \\$8 while the hourly income range for student assistants was \\$6-\\$9. The main objective in this hypothesis testing is to see whether there is a significant difference between the means of the two populations. The NULL and the ALTERNATIVE hypothesis is that the means are equal and the means are not equal, respectively.\n\nReferring to the spreadsheet, I chose A1 and A2 as label centers. The work-study students' hourly income for a sample size 36 are shown in cells A2:A37, and the student assistants' hourly income for a sample size 36 is shown in cells B2:B37\n\nData for Work Study Student: 6, 6, 6, 6, 6, 6, 6, 6.5, 6.5, 6.5, 6.5, 6.5, 6.5, 7, 7, 7, 7, 7, 7, 7, 7.5, 7.5, 7.5, 7.5, 7.5, 7.5, 8, 8, 8, 8, 8, 8, 8, 8, 8.\n\nData for Student Assistant: 6, 6, 6, 6, 6, 6.5, 6.5, 6.5, 6.5, 6.5, 7, 7, 7, 7, 7, 7.5, 7.5, 7.5, 7.5, 7.5, 7.5, 8, 8, 8, 8, 8, 8, 8, 8.5, 8.5, 8.5, 8.5, 8.5, 9, 9, 9, 9.\n\nUse the Descriptive Statistics procedure to calculate the variances of the two samples. The Excel procedure for testing the difference between the two population means will require information on the variances of the two populations. Since the variances of the two populations are unknowns they should be replaced with sample variances. The descriptive for both samples show that the variance of first sample is s12 = 0.55546218, while the variance of the second sample s22 =0.969748.\n\n work-study student student assistant Mean 7.05714286 Mean 7.471429 Standard Error 0.12597757 Standard Error 0.166454 Median 7 Median 7.5 Mode 8 Mode 8 Standard Deviation 0.74529335 Standard Deviation 0.984758 Sample Variance 0.55546218 Sample Variance 0.969748 Kurtosis -1.38870558 Kurtosis -1.192825 Skewness -0.09374375 Skewness -0.013819 Range 2 Range 3 Minimum 6 Minimum 6 Maximum 8 Maximum 9 Sum 247 Sum 261.5 Count 35 Count 35\n\nTo conduct the desired test hypothesis with Excel the following steps can be taken:\n\nStep 1. From the menus select Tools then click on the Data Analysis option.\n\nStep 2. When the Data Analysis dialog box appears:\nChoose z-Test: Two Sample for means then click OK\n\nStep 3. When the z-Test: Two Sample for means dialog box appears:\n\nEnter A1:A36 in the variable 1 range box (work-study students' hourly income)\nEnter B1:B36 in the variable 2 range box (student assistants' hourly income)\nEnter 0 in the Hypothesis Mean Difference box (if you desire to test a mean difference other than 0, enter that value)\nEnter the variance of the first sample in the Variable 1 Variance box\nEnter the variance of the second sample in the Variable 2 Variance box and select Labels\nEnter 0.05 or, whatever level of significance you desire, in the Alpha box\nSelect a suitable Output Range for the results, I chose C19, then click OK.\n\nThe value of test statistic z=-1.9845824 appears in our case in cell D24. The rejection rule for this test is z < -1.96 or z > 1.96 from the normal distribution table. In the Excel output these values for a two-tail test are z<-1.959961082 and z>+1.959961082. Since the value of the test statistic z=-1.9845824 is less than -1.959961082 we reject the null hypothesis. We can also draw this conclusion by comparing the p-value for a two tail -test and the alpha value.\n\nSince p-value 0.047190813 is less than a=0.05 we reject the null hypothesis. Overall we can say, based on the sample results, the two populations' means are different.\n\nSmall Samples: n1 OR n2 are less than 30\n\nIn this section we will show how Excel is used to conduct a hypothesis test about the difference between two population means. - Given that the populations have equal variances when two small independent samples are taken from both populations. Similar to the above case, the data in this case are taken from various offices here at the University of Baltimore. I collected hourly income data of 11 randomly selected work-study students and 11 randomly selected student assistants. The hourly income range for both groups was similar range, \\$6 - \\$8 and \\$6-\\$9. The main objective in this hypothesis testing is similar too, to see whether there is a significant difference between the means of the two populations. The NULL and the ALTERNATIVE hypothesis are that the means are equal and they are not equal, respectively.\n\n work-study student student assistant 6 6 8 9 7.5 8.5 6.5 7 7 6.5 6 7 7.5 7.5 8 6 6 8 6.5 9 7 7.5>\n\nReferring to the spreadsheet, we chose A1 and A2 as label centers. The work-study students' hourly income for a sample size 11 are shown in cells A2:A12, and the student assistants' hourly income for a sample size 11 is shown in cells B2:B12. Unlike previous case, you do not have to calculate the variances of the two samples, Excel will automatically calculate these quantities and use them in the calculation of the value of the test statistic.\n\nSimilar to the previous case, but a bit different in step # 2, to conduct the desired test hypothesis with Excel the following steps can be taken:\n\nStep 1. From the menus select Tools then click on the Data Analysis option.\n\nStep 2. When the Data Analysis dialog box appears:\nChoose t-Test: Two Sample Assuming Equal Variances then click OK\n\nStep 3 When the t-Test: Two Sample Assuming Equal Variances dialog box appears:\n\nEnter A1:A12 in the variable 1 range box (work-study student hourly income)\nEnter B1:B12 in the variable 2 range box (student assistant hourly income)\nEnter 0 in the Hypothesis Mean Difference box(if you desire to test a mean difference other than zero, enter that value) then select Labels\n\nEnter 0.05 or, whatever level of significance you desire, in the Alpha box\n\nSelect a suitable Output Range for the results, I chose C1, then click OK.\n\nThe value of the test statistic t=-1.362229828 appears, in our case, in cell D10. The rejection rule for this test is t<-2.086 or t>+2.086 from the t distribution table where the t value is based on a t distribution with n1-n2-2 degrees of freedom and where the area of the upper one tail is 0.025 ( that is equal to alpha/2).\n\nIn the Excel output the values for a two-tail test are t<-2.085962478 and t>+2.085962478. Since the value of the test statistic t=-1.362229828, is in an acceptance range of t<-2.085962478 and t>+2.085962478, we fail to reject the null hypothesis.\n\nWe can also draw this conclusion by comparing the p-value for a two-tail test and the alpha value.\n\nSince the p-value 0.188271278 is greater than a=0.05 again, we fail to reject the null hypothesis.\n\nOverall we can say, based on sample results, the two populations' means are equal.\n\n work-study student student assistant Mean 6.909090909 7.454545455 Variance 0.590909091 1.172727273 Observations 11 11 Pooled Variance 0.881818182 Hypothesized Mean Difference 0 Df 20 t Stat -1.362229828 P(T<=t) one tail 0.094135639 t Critical one tail 1.724718004 P(T<=t)two tail 0.188271278 t Critical two tail 2.085962478\n\n### ANOVA: Analysis of Variances\n\nIn this section the objective is to see whether or not means of three or more populations based on random samples taken from populations are equal or not. Assuming independents samples are taken from normally distributed populations with equal variances, Excel would do this analysis if you choose one way anova from the menus. We can also choose Anova: two way factor with or without replication option and see whether there is significant difference between means when different factors are involved.\n\nSingle-Factor ANOVA Test\n\nIn this case we were interested to see whether there a significant difference among hourly wages of student assistants in three different service departments here at the University of Baltimore. Six student assistants were randomly were selected from the three departments and their hourly wages were recorded as following:\n\n ARC CSI TCC 10.00 6.50 9.00 8.00 7.00 7.00 7.50 7.00 7.00 8.00 7.50 7.00 7.00 7.00 6.50\n\nEnter data in an Excel work sheet starting with cell A2 and ending with cell C8. The following steps should be taken to find the proper output for interpretation.\n\nStep 1. From the menus select Tools and click on Data Analysis option.\n\nStep 2. When data analysis dialog appears, choose Anova single-factor option; enter A2:C8 in the input range box. Select labels in first row.\n\nStep3.Select any cell as output(in here we selected A11). Click OK.\n\nThe general form of Anova table looks like following:\n Source of Variation SS df MS F P-value F crit Between Groups SSTR K-1 MSTR MST/MSE 0.046725 3.682316674 Within Groups SSE nt-K MSE Total\n\nSuppose the test is done at level of significance a = 0.05, we reject the null hypothesis. This means there is a significant difference between means of hourly incomes of student assistants in these departments.\n\nThe Two-way ANOVA Without Replication\n\nIn this section, the study involves six students who were offered different hourly wages in three different department services here at the University of Baltimore. The objective is to see whether the hourly incomes are the same. Therefore, we can consider the following:\n\nFactor: Department\n\nTreatment: Hourly payments in the three departments\n\nBlocks: Each student is a block since each student has worked in the three different departments\n\n Student ARC CSI TCC 1 10.00 7.50 7.00 2 8.00 7.00 6.00 3 7.00 6.00 6.00 4 8.00 6.50 6.50 5 9.00 8.00 7.00 6 8.00 8.00 6.00\n\nThe general form of Anova table would look like:\n\n Source of Variation Sum of Squares Degrees of freedom Mean Squares F Treatment SST K-1 MST F=MST/MSE Blocks SSB b-1 MSB Error SSE (K-1)(b-1) MSB Total SST nt-1\n\nTo find the Excel output for the above data the following steps can be taken:\n\nStep 1. From the menus select Tools and click on Data Analysis option.\n\nStep2. When data analysis box appears: select Anova two-factor without replication then Enter A2: D8 in the input range. Select labels in first row.\n\nStep3. Select an output range (in here we selected A11) then OK.\n\n SUMMARY COUNT SUM AVERAGE VARIANCE 1 3 24.5 8.166667 2.583333 2 3 21 7 1 3 3 19.5 6.5 0.25 4 3 21.5 7.166667 0.583333 5 3 23 7.666667 2.333333 6 3 22 7.333333 1.333333 ARC 6 50 8.333333 1.066667 CSI 6 43 7.166667 0.666667 TCC 6 38.5 6.416667 0.241667\n\nANOVA\n\n Source of Variation SS df MS F P-value F crit Rows 4.902778 5 0.980556 1.972067 0.168792 3.325837 Columns 11.19444 2 5.597222 11.25698 0.002752 4.102816 Error 4.972222 10 0.497222 Total 21.06944 17\n\nNOTE: F=MST/MSE =0.980556/0.497222 = 1.972067\nF = 3.33 from table (5 numerator DF and 10 denominator DF)\nSince 1.972067<3.33 we fail to reject the null.\n\nConclusion: There is not sufficient evidence to conclude that hourly rates differ for the three departments.\n\nTwo-Way ANOVA with Replication\n\nReferring to the student assistant and the work study hourly wages here at the university of Baltimore the following data shows the hourly wages for the two categories in three different departments:\n\n ARC CSI TCC 6.50 6.10 6.90 Work Study 6.80 6.00 7.20 7.10 6.50 7.10 7.40 6.80 7.50 Student Assistant 7.50 7.00 7.00 8.00 6.60 7.10 Factors\n\nFactor A: Student job category (in here two different job categories exists)\n\nFactor B: Departments (in here we have three departments)\n\nReplication: The number of students in each experimental condition. In this case there are three replications.\n\nInteraction:\n\n ARC CSI TCC 6.50 6.10 6.90 Work Study 6.80 6.00 7.20 7.10 6.50 7.10 7.40 6.80 7.50 Student Assistant 7.50 7.00 7.00 8.00 6.60 7.10\n\n SUMMARY ARC CSI TCC Total Count 3 3 3 9 Sum 20.4 19 21 60.2 Average 6.8 6.2 7.1 6.69 Variance 0.09 0.1 0 0.19\n\n Count 3 3 3 9 Sum 22.9 20 22 64.9 Average 7.63333 6.8 7.2 7.21 Variance 0.10333 0 0.1 0.18 Total\n\n Total Count 6 6 6 Sum 43.3 39 43 Average 7.21667 6.5 7.1 Variance 0.28567 0.2 0\n\nANOVA\n Source of Variation SS df MS F P-value F crit Sample(Factor A) 1.22722 1 1.2 18.6 0.001016557 4.747221 Columns(Factor B) 1.84333 2 0.9 13.9 0.000741998 3.88529 Interaction 0.38111 2 0.2 2.88 0.095003443 3.88529 Within 0.79333 12 0.1 Total 4.245 17\n\nConclusion:\nMean hourly income differ by job category.\nMean hourly income differ by department.\nInteraction is not significant.\n\n### Goodness-of-Fit Test for Discrete Random Variables\n\nThe CHI-SQUARE distribution can be used in a hypothesis test involving a population variance. However, in this section we would like to test and see how close a sample results are to the expected results.\n\nExample: The Multinomial Random Variable\n\nIn this example the objective is to see whether or not based on a randomly selected sample information the standards set for a population is met. There are so many practical examples that can be used in this situation. For example it is assumed the guidelines for hiring people with different ethnic background for the US government is set at 70%(WHITE), 20%(African American) and 10%(others), respectively. A randomly selected sample of 1000 US employees shows the following results that is summarized in a table.\n\n ETHNIC BACKGROUND EXPECTED NUMBER OF EMPLOYEES OBSERVED FROM SAMPLE WHITE 700 =70%OF 1000 750 AFRICAN American 200 =20%OF 1000 170 OTHERS 100 =10%OF 1000 80\n\nAs you see the observed sample numbers for groups two and three are lower than their expected values unlike group one which has a higher expected value. Is this a clear sign of discrimination with respect to ethnic background? Well depends on how much lower the expected values are. The lower amount might not statistically be significant. To see whether these differences are significant we can use Excel and find the value of the CHI-SQUARE. If this value falls within the acceptance region we can assume that the guidelines are met otherwise they are not. Now lets enter these numbers into Excel spread- sheet. We used cells B7-B9 for the expected proportions, C7-C9 for the observed values and D7-D9 for the expected frequency. To calculate the expected frequency for a category, you can multiply the proportion of that category by the sample size (in here 1000). The formula for the first cell of the expected value column, D7 is 1000*B7. To find other entries in the expected value column, use the copy and the paste menu as shown in the following picture. These are important values for the chi-square test. The observed range in this case is C7: C9 while the expected range is D7: D9. The null and the alternative hypothesis for this test are as follows:\n\nH0 : PW = 0.70, PA=0.20 and PO =0.10\n\nHA: The population proportions are not PW = 0.70, PA= 0.20 and PO = 0.10\n\nNow lets use Excel to calculate the p-value in a CHI-SQUARE test. Step 1.Select a cell in the work sheet, the location which you like the p value of the CHI-SQUARE to appear. We chose cell D12.\n\nStep 2. From the menus, select insert then click on the Function option, Paste Function dialog box appears.\n\nStep 3.Refer to function category box and choose statistical, from function name box select CHITEST and click on OK.\n\nStep 4.When the CHITEST dialog appears:\nEnter C7: C9 in the actual-range box then enter D7: D9 in the expected-range box, and finally click on OK.\n\nThe p-value will appear in the selected cell, D12.\n\nAs you see the p value is 0.002392 which is less than the value of the level of significance (in this case the level of significance, a= 0.10). Hence the null hypothesis should be rejected. This means based on the sample information the guidelines are not met. Notice if you type \"=CHITEST(C7:C9,D7:D9)\" in the formula bar the p-value will show up in the designated cell.\n\nNOTE: Excel can actually find the value of the CHI-SQUARE. To find this value first select an empty cell on the spread sheet then in the formula bar type \"=CHIINV(D12,2).\" D12 designates the p-Value found previously and 2 is the degrees of freedom (number of rows minus one). The CHI-SQUARE value in this case is 12.07121. If we refer to the CHI-SQUARE table we will see that the cut off is 4.60517 since 12.07121>4.60517 we reject the null. The following screen shot shows you how to the CHI-SQUARE value.\n\n### Test of Independence: Contingency Tables\n\nThe CHI-SQUARE distribution is also used to test and see whether two variables are independent or not. For example based on sample data you might want to see whether smoking and gender are independent events for a certain population. The variables of interest in this case are smoking and the gender of an individual. Another example in this situation could involve the age range of an individual and his or her smoking habit. Similar to case one data may appear in a table but unlike the case one this table may contains several columns in addition to rows. The initial table contains the observed values. To find expected values for this table we set up another table similar to this one. To find the value of each cell in the new table we should multiply the sum of the cell column by the sum of the cell row and divide the results by the grand total. The grand total is the total number of observations in a study. Now based on the following table test whether or not the smoking habit and gender of the population that the following sample taken from are independent. On the other hand is that true that males in this population smoke more than females?\n\nYou could use formula bar to calculate the expected values for the expected range. For example to find the expected value for the cell C5 which is replaced in c11 you could click on the formula bar and enter C6*D5/D6 then enter in cell C11.\n\nStep 1. Observed Range b4:c5\n\nSmoking and gender\n\n yes no total male 31 69 100 female 45 122 167 total 76 191 267\n\nStep2. Expected Range b10:c11\n\n 28.4644 71.5356 47.5356 119.464\n\nSo the observed range is b4:c5 and the expected range is b10:c11.\n\nStep 3. Click on fx(paste function)\n\nStep 4. When Paste Function dialog box appears, click on Statistical in function category and CHITEST in the function name then click OK.\n\nWhen the CHITEST box appears, enter b4:c5 for the actual range, then b10:c11 for the expected range.\n\nStep 5. Click on OK (the p-value appears). 0.477395\n\nConclusion: Since p-value is greater than the level of significance (0.05), fails to reject the null. This means smoking and gender are independent events. Based on sample information one can not assure females smoke more than males or the other way around.\n\nStep 6. To find the chi-square value, use CHINV function, when Chinv box appears enter 0.477395 for probability part, then 1 for the degrees of freedom.\n\nDegrees of freedom=(number of columns-1)X(number of rows-1)\n\nCHI-SQUARE=0.504807\n\n### Test Hypothesis Concerning the Variance of Two Populations\n\nIn this section we would like to examine whether or not the variances of two populations are equal. Whenever independent simple random samples of equal or different sizes such as n1 and n2 are taken from two normal distributions with equal variances, the sampling distribution of s12/s22 has F distribution with n1- 1 degrees of freedom for the numerator and n2 - 1 degrees of freedom for the denominator. In the ratio s12/s22 the numerator s12 and the denominator s22 are variances of the first and the second sample, respectively. The following figure shows the graph of an F distribution with 10 degrees of freedom for both the numerator and the denominator. Unlike the normal distribution as you see the F distribution is not symmetric. The shape of an F distribution is positively skewed and depends on the degrees of freedom for the numerator and the denominator. The value of F is always positive.\n\nNow let see whether or not the variances of hourly income of student-assistant and work-study students based on samples taken from populations previously are equal. Assume that the hypothesis test in this case is conducted at a = 0.10. The null and the alternative are:",
null,
"Rejection Rule: Reject the null hypothesis if F< F0.095 or F> F0.05 where F, the value of the test statistic is equal to s12/s22, with 10 degrees of freedom for both the numerator and the denominator. We can find the value of F.05 from the F distribution table. If s12/s22, we do not need to know the value of F0.095 otherwise, F0.95 = 1/ F0.05 for equal sample sizes.",
null,
"A survey of eleven student-assistant and eleven work-study students shows the following\ndescriptive statistics. Our objective is to find the value of s12/s22, where s12 is the value of the variance of student assistant sample and s22 is the value of the variance of the work study students sample. As you see these values are in cells F8 and D8 of the descriptive statistic output.",
null,
"To calculate the value of s12/s22, select a cell such as A16 and enter cell formula = F8/D8 and enter. This is the value of F in our problem. Since this value, F=1.984615385, falls in acceptance area we fail to reject the null hypothesis. Hence, the sample results do support the conclusion that student assistants hourly income variance is equal to the work study students hourly income variance. The following screen shoot shows how to find the F value. We can follow the same format for one tail test(s).",
null,
"### Linear Correlation and Regression Analysis\n\nIn this section the objective is to see whether there is a correlation between two variables and to find a model that predicts one variable in terms of the other variable. There are so many examples that we could mention but we will mention the popular ones in the world of business. Usually independent variable is presented by the letter x and the dependent variable is presented by the letter y. A business man would like to see whether there is a relationship between the number of cases of sold and the temperature in a hot summer day based on information taken from the past. He also would like to estimate the number cases of soda which will be sold in a particular hot summer day in a ball game. He clearly recorded temperatures and number of cases of soda sold on those particular days. The following table shows the recorded data from June 1 through June 13. The weatherman predicts a 94F degree temperature for June 14. The businessman would like to meet all demands for the cases of sodas ordered by customers on June 14.\n\n DAY Cases of Soda Temperature 1-Jun 57 56 2-Jun 59 58 3-Jun 65 63 4-Jun 67 66 5-Jun 75 73 6-Jun 81 78 7-Jun 86 85 8-Jun 88 85 9-Jun 88 87 10-Jun 84 84 11-Jun 82 88 12-Jun 80 84 13-Jun 83 89\n\nNow lets use Excel to find the linear correlation coefficient and the regression line equation. The linear correlation coefficient is a quantity between -1 and +1. This quantity is denoted by R. The closer R to +1 the stronger positive (direct) correlation and similarly the closer R to -1 the stronger negative (inverse) correlation exists between the two variables. The general form of the regression line is y = mx + b. In this formula, m is the slope of the line and b is the y-intercept. You can find these quantities from the Excel output. In this situation the variable y (the dependent variable) is the number of cases of soda and the x (independent variable) is the temperature. To find the Excel output the following steps can be taken:\n\nStep 1. From the menus choose Tools and click on Data Analysis.\n\nStep 2. When Data Analysis dialog box appears, click on correlation.\n\nStep 3. When correlation dialog box appears, enter B1:C14 in the input range box. Click on Labels in first row and enter a16 in the output range box. Click on OK.\n\n Cases of Soda Temperature Cases of Soda 1 Temperature 0.96659877 1\n\nAs you see the correlation between the number of cases of soda demanded and the temperature is a very strong positive correlation. This means as the temperature increases the demand for cases of soda is also increasing. The linear correlation coefficient is 0.966598577 which is very close to +1.\n\nNow lets follow same steps but a bit different to find the regression equation.\n\nStep 1. From the menus choose Tools and click on Data Analysis\n\nStep 2. When Data Analysis dialog box appears, click on regression.\n\nStep 3. When Regression dialog box appears, enter b1:b14 in the y-range box and c1:c14 in the x-range box. Click on labels.\n\nStep 4. Enter a19 in the output range box.\n\nNote: The regression equation in general should look like Y=m X + b. In this equation m is the slope of the regression line and b is its y-intercept.\n\nSUMMARY OUTPUT\n\n Multiple R 0.966599 R Square 0.934313 Adjusted R Square 0.928341 Standard Error 2.91938 Observations 13\n\nANOVA\n\n df SS MS F Significance F Regression 1 1333.479989 1333.479989 156.4603497 7.58511E-08 Residual 11 93.75078034 8522798213 Total 12 1427.230769\n\n Coefficients Standard Error t Stat P-value Lower 95% Upper 95% Intercept 9.17800767 5.445742836 1.685354587 0.120044801 -2.80799756 21.16401 Temperature 0.879202711 0.07028892 12.50841116 7.58511E-08 0.724497763 1.033908\n\nThe relationship between the number of cans of soda and the temperature is: Y = 0.879202711 X + 9.17800767\n\nThe number of cans of soda = 0.879202711*(Temperature) + 9.17800767. Referring to this expression we can approximately predict the number of cases of soda needed on June 14. The weather forecast for this is 94 degrees, hence the number of cans of soda needed is equal to; The number of cases of soda=0.879202711*(94) + 9.17800767 = 91.82 or about 92 cases.\n\n### Moving Average and Exponential Smoothing\n\nMoving Average Models: Use the Add Trendline option to analyze a moving average forecasting model in Excel. You must first create a graph of the time series you want to analyze. Select the range that contains your data and make a scatter plot of the data. Once the chart is created, follow these steps:\n1. Click on the chart to select it, and click on any point on the line to select the data series. When you click on the chart to select it, a new option, Chart, s added to the menu bar.\n2. From the Chart menu, select Add Trendline.\n\nThe following is the moving average of order 4 for weekly sales:",
null,
"Exponential Smoothing Models: The simplest way to analyze a timer series using an Exponential Smoothing model in Excel is to use the data analysis tool. This tool works almost exactly like the one for Moving Average, except that you will need to input the value of a instead of the number of periods, k. Once you have entered the data range and the damping factor, 1- a , and indicated what output you want and a location, the analysis is the same as the one for the Moving Average model.\n\n### Applications and Numerical Examples\n\nDescriptive Statistics: Suppose you have the following, n = 10, data:\n\n1.2, 1.5, 2.6, 3.8, 2.4, 1.9, 3.5, 2.5, 2.4, 3.0\n\n1. Type your n data points into the cells A1 through An.\n2. Click on the \"Tools\" menu. (At the bottom of the \"Tools\" menu will be a submenu \"Data Analysis...\", if the Analysis Tool Pack has been properly installed.)\n3. Clicking on \"Data Analysis...\" will lead to a menu from which \"Descriptive Statistics\" is to be selected.\n4. Select \"Descriptive Statistics\" by pointing at it and clicking twice, or by highlighting it and clicking on the \"Okay\" button.\n5. Within the Descriptive Statistics submenu,\na. for the \"input range\" enter \"A1:Dn\", assuming you typed the data into cells A1 to An.\n\nb. click on the \"output range\" button and enter the output range \"C1:C16\".\n\nc. click on the Summary Statistics box\n\nd. finally, click on \"Okay.\"\n\nThe Central Tendency: The data can be sorted in ascending order:\n\n1.2, 1.5, 1.9, 2.4, 2.4, 2.5, 2.6, 3.0, 3.5, 3.8\n\nThe mean, median and mode are computed as follows:\n\n(1.2 1.5 2.6 3.8 2.4 1.9 3.5 2.5 2.4 3.0) / 10 = 2.48\n\n(2.4 + 2.5) / 2 = 2.45\n\nThe mode is 2.4, since it is the only value that occurs twice.\n\nThe midrange is (1.2+ 3.8) / 2 = 2.5.\n\nNote that the mean, median and mode of this set of data are very close to each other. This suggests that the data is very symmetrically distributed.\n\nVariance: The variance of a set of data is the average of the cumulative measure of the squares of the difference of all the data values from the mean.\n\nThe sample variance-based estimation for the population variance are computed differently. The sample variance is simply the arithmetic mean of the squares of the difference between each data value in the sample and the mean of the sample. On the other hand, the formula for an estimate for the variance in the population is similar to the formula for the sample variance, except that the denominator in the fraction is (n-1) instead of n. However, you should not worry about this difference if the sample size is large, say over 30. Compute an estimate for the variance of the population, given the following sorted data:\n\n1.2, 1.5, 1.9, 2.4, 2.4, 2.5, 2.6, 3.0, 3.5, 3.8 mean = 2.48 as computed earlier. An estimate for the population variance is: s2 = 1 / (10-1) [ (1.2 - 2.48)2 + (1.5 - 2.48)2 + (1.9 - 2.48)2 + (2.4 -2.48)2 + (2.4 - 2.48)2 + (2.5 - 2.48)2 + (2.6 - 2.48)2 + (3.0 - 2.48)2 + (3.5 -2.48)2 + (3.8 - 2.48)2 ]\n= (1 / 9) (1.6384 + 0.9604 + 0.3364 + 0.0064 + 0.0064 + 0.0004 + 0.0144 + 0.2704 + 1.0404 + 1.7424) = 0.6684\n\nTherefore, the standard deviation is s = ( 0.6684 )1/2 = 0.8176\n\nProbability and Expected Values: Newsweek reported that \"average take\" for bank robberies was \\$3,244 but 85 percent of the robbers were caught. Assuming 60 percent of those caught lose their entire take and 40 percent lose half, graph the probability mass function using EXCEL. Calculate the expected take from a bank robbery. Does it pay to be a bank robber?\n\nTo construct the probability function for bank robberies, first define the random variable x, bank robbery take. If the robber is not caught, x = \\$3,244. If the robber is caught and manages to keep half, x = \\$1,622. If the robber is caught and loses it all, then x = 0. The associated probabilities for these x values are 0.15 = (1 - 0.85), 0.34 = (0.85)(0.4), and 0.51 = (0.85)(0.6). After entering the x values in cells A1, A2 and A3 and after entering the associated probabilities in B1, B2, and B3, the following steps lead to the probability mass function:\n\n1. Click on ChartWizard. The \"ChartWizard Step 1 of 4\" screen will appear.\n2. Highlight \"Column\" at \"ChartWizard Step 1 of 4\" and click \"Next.\"\n3. At \"ChartWizard Step 2 of 4 Chart Source Data,\" enter \"=B1:B3\" for \"Data range,\" and click \"column\" button for \"Series in.\" A graph will appear. Click on \"series\" toward the top of the screen to get a new page.\n4. At the bottom of the \"Series\" page, is a rectangle for \"Category (X) axis labels:\" Click on this rectangle and then highlight A1:A3.\n5. At \"Step 3 of 4\"; move on by clicking on \"Next,\" and at \"Step 4 of 4\", click on \"Finish.\"\n\nThe expected value of a robbery is \\$1,038.08.\n\nE(X) = (0)(0.51)+(1622)(0.34) + (3244)(0.15) = 0 + 551.48 + 486.60 = 1038.08\n\nThe expected return on a bank robbery is positive. On average, bank robbers get \\$1,038.08 per heist. If criminals make their decisions strictly on this expected value, then it pays to rob banks. A decision rule based only on an expected value, however, ignores the risks or variability in the returns. In addition, our expected value calculations do not include the cost of jail time, which could be viewed by criminals as substantial.\n\nDiscrete & Continuous Random Variables:\n\nBinomial Distribution Application: A multiple choice test has four unrelated questions. Each question has five possible choices but only one is correct. Thus, a person who guesses randomly has a probability of 0.2 of guessing correctly. Draw a tree diagram showing the different ways in which a test taker could get 0, 1, 2, 3 and 4 correct answers. Sketch the probability mass function for this test. What is the probability a person who guesses will get two or more correct?\n\nSolution: Letting Y stand for a correct answer and N a wrong answer, where the probability of Y is 0.2 and the probability of N is 0.8 for each of the four questions, the probability tree diagram is shown in the textbook on page 182. This probability tree diagram shows the \"branches\" that must be followed to show the calculations captured in the binomial mass function for n = 4 and = 0.2. For example, the tree diagram shows the six different branch systems that yield two correct and two wrong answers (which corresponds to 4!/(2!2!) = 6. The binomial mass function shows the probability of two correct answers as\n\nP(x = 2 | n = 4, p = 0.2) = 6(.2)2(.8)2 = 6(0.0256) = 0.1536 = P(2)\n\nWhich is obtained from excel by using the \"BINOMDIST\" Command, where the first entry is x, the second is n, and the third is mass (0) or cumulative (1); that is, entering\n\n=BINOMDIST(2,4,0.2,0) IN ANY EXCEL CELL YIELDS 0.1536 AND\n=BINOMDIST(3,4,0.2,0) YIELDS P(x=3|n=4, p = 0.2) = 0.0256\n=BINOMDIST(4,4,0.2,0) YIELDS P(x=4|n=4, p = 0.2) = 0.0016\n=1-BINOMDIST(1,4,0.2,1) YIELDS P(x ³ 2 | n = 4, p = 0.2) = 0.1808\n\nNormal Example: If the time required to complete an examination by those with a certain learning disability is believed to be distributed normally, with mean of 65 minutes and a standard deviation of 15 minutes, then when can the exam be terminated so that 99 percent of those with the disability can finish?\n\nSolution: Because the average and standard deviation are known, what needs to be established is the amount of time, above the mean time, such that 99 percent of the distribution is lower. This is a distance that is measured in standard deviations as given by the Z value corresponding to the 0.99 probability found in the body of Appendix B, Table 5,as shown in the textbook OR the commands entered into any cell of Excel to find this Z value is =NORMINV(0.99,0,1) for 2.326342.\n\nThe closest cumulative probability that can be found is 0.9901, in the row labeled 2.3 and column headed by .03, Z = 2.33, which is only an approximation for the more exact 2.326342 found in Excel. Using this more exact value the calculation with mean m and standard deviation s in the following formula would be\n\nZ = ( X - m ) / s\nThat is, Z = ( x - 65)/15\nThus, x = 65 + 15(2.32634) = 99.9 minutes.\n\nAlternatively, instead of standardizing with the Z distribution using Excel we can simply work directly with the normal distribution with a mean of 65 and standard deviation of 15 and enter \"=NORMINV(0.99,65,15)\". In general to obtain the x value for which alpha percent of a normal random variable's values are lower, the following \"NORMINV\" command may be used, where the first entry is a, the second is m , and the third is s.\n\nAnother Example: In the early 1980s, the Toro Company of Minneapolis, Minnesota, advertised that it would refund the purchase price of a snow blower if the following winter's snowfall was less than 21 percent of the local average. If the average snowfall is 45.25 inches, with a standard deviation of 12.2 inches, what is the likelihood that Toro will have to make refunds?\n\nSolution: Within limits, snowfall is a continuous random variable that can be expected to vary symmetrically around its mean, with values closer to the mean occurring most often. Thus, it seems reasonable to assume that snowfall (x) is approximately normally distributed with a mean of 45.25 inches and standard deviation of 12.2 inches. Nine and one half inches is 21 percent of the mean snowfall of 45.25 inches and, with a standard deviation of 12.2 inches, the number of standard deviations between 45.25 inches and 9.5 inches is Z:\n\nZ = ( x - m ) / s = (9.50 - 45.25)/12.2 = -2.93\n\nUsing Appendix B, Table 5, the textbook demonstrates the determination of P(x £ 9.50) = P(z £ -2.93) = 0.17, the probability of snowfall less than 9.5 inches. Using Excel, this normal probability is obtained with the \"NORMDIST\" command, where the first entry is x, the second is mean m , the third is standard deviation s, and the fourth is CUMULATIVE (1). Entering\n\n=NORMDIST(9.5,45.25,12.2,1), Gives P( x £ 9.50) = 0.001693.\n\nSampling Distribution and the Central Limit Theorem : A bakery sells an average of 24 loaves of bread per day. Sales (x) are normally distributed with a standard deviation of 4.\n\nIf a random sample of size n = 1 (day) is selected, what is the probability this x value will exceed 28?\n\nIf a random sample of size n = 4 (days) is selected, what is theprobability that xbar ³ 28?\n\nWhy does the answer in part 1 differ from that in part 2?\n\nSolutions:\n\n1. The sampling distribution of the sample mean xbar is normal with a mean of 24 and a standard error of the mean of 4. Thus, using Excel, 0.15866 =1-NORMDIST(28,24,4,1).\n\n2. The sampling distribution of the sample mean xbar is normal with a mean of 24 and a standard error of the mean of 2 using Excel, 0.02275 =1-NORMDIST(28,24,2,1).\n\nRegression Analysis: The highway deaths per 100 million vehicle miles and highway speed limits for 10 countries, are given below:\n\n(Death, Speed) = (3.0, 55), (3.3, 55), (3.4, 55), (3.5, 70), (4.1, 55), (4.3, 60), (4.7, 55), (4.9, 60), (5.1, 60), and (6.1, 75).\n\nFrom this we can see that five countries with the same speed limit have very different positions on the safety list. For example, Britain ... with a speed limit of 70 is demonstrably safer than Japan, at 55. Can we argue that, speed has little to do with safety. Use regression analysis to answer this question.\n\nSolution: Enter the ten paired y and x data into cells A2 to A11 and B2 to B11, with the \"death\" rate label in A1 and \"speed\" limits label in B1, the following steps produce the regression output.\n\nChoose \"Regression\" from \"Data Analysis\" in the \"Tools\" menu. The Regression dialog box will will appear.\n\nNote: Use the mouse to move between the boxes and buttons. Click on the desired box or button. The large rectangular boxes require a range from the worksheet. A range may be typed in or selected by highlighting the cells with the mouse after clicking on the box. If the dialog box blocks the data, it can be moved on the screen by clicking on the title bar and dragging.\n\nFor the \"Input Y Range,\" enter A1 to A11, and for the \"Input X Range\" enter B1 to B11.\n\nBecause the Y and X ranges include the \"Death\" and \"Speed\" labels in A1 and B1, select the \"Labels\" box with a click.\n\nClick the \"Output Range\" button and type reference cell, which in this demonstration is A13.\n\nTo get the predicted values of Y (Death rates) and residuals select the \"Residuals\" box with a click.\n\nYour screen display should show a Table, clicking \"OK\" will give the \"SUMMARY OUTPUT,\" \"ANOVA\" AND RESIDUAL OUTPUT\"\n\nThe first section of the EXCEL printout gives \"SUMMARY OUTPUT.\" The \"Multiple R\" is the square root of the \"R Square;\" the computation and interpretation of which we have already discussed. The \"Standard Error\" of estimate (which will be discussed in the next chapter) is s = 0.86423, which is the square root of \"Residual SS\" = 5.97511 divided by its degrees of freedom, df = 8, as given in the \"ANOVA\" section. We will also discuss the adjusted R-square of 0.21325 in the following chapters.\n\nUnder the \"ANOVA\" section are the estimated regression coefficients and related statistics that will be discussed in detail in the next chapter. For now it is sufficient to recognize that the calculated coefficient values for the slope and y intercept are provided (b = 0.07556 and a = -0.29333). Next to these coefficient estimates is information on the variability in the distribution of the least-squares estimators from which these specific estimates were drawn: the column titled \"Std. Error\" contains the standard deviations (standard errors) of the intercept and slope distributions; the \"t-ratio\" and \"p\" columns give the calculated values of the t statistics and associated p-values. As shown in Chapter 13, the t statistic of 1.85458 and p-value of 0.10077, for example, indicates that the sample slope (0.07556) is sufficiently different from zero, at even the 0.10 two-tail Type I error level, to conclude that there is a significant relationship between deaths and speed limits in the population. This conclusion is contrary to assertion that \"speed has little to do with safety.\"\n\nSUMMARY OUTPUT: Multiple R = 0.54833, R Square = 0.30067, Adjusted R Square = 0.21325, Standard Error = 0.86423, Observations = 10\n\nANOVA df SS MS F P-value\nRegression 1 2.56889 2.56889 3.43945 0.10077\nResidual 8 5.97511 0.74689\nTotal 9 8.54400\n\nCoeffs. Estimate Std. Error T Stat P-value Lower 95% Upper 95%\nIntercept -0.29333 2.45963 -0.11926 0.90801 -5.96526 5.37860\nSpeed 0.07556 0.04074 1.85458 0.10077 -0.01839 0.16950\n\nResidual Output:\n\nPredicted Residuals\n3.86222 -0.86222\n3.86222 -0.56222\n3.86222 -0.46222\n4.99556 -1.49556\n3.86222 0.23778\n4.24000 0.06000\n3.86222 0.83778\n4.24000 0.66000\n4.24000 0.86000\n5.37333 0.72667\n\n### Microsoft Excel Add-Ins\n\nForecasting with regression requires the Excel add-in called \"Analysis ToolPak,\" and linear programming requires the Excel add-in called \"Solver.\" How you check to see if these are activated on your computer, and how to activate them if they are not active, varies with Excel version. Here are instructions for the most common versions. If Excel will not let you activate Data Analysis and Solver, you must use a different computer.\n\nExcel 2002/2003:\nStart Excel, then click Tools and look for Data Analysis and for Solver. If both are there, press Esc (escape) and continue with the respective assignment. Otherwise click Tools, Add-Ins, and check the boxes for Analysis ToolPak and for Solver, then click OK. Click Tools again, and both tools should be there.\n\nExcel 2007:\nStart Excel 2007 and click the Data tab at the top. Look to see if Data Analysis and Solver show in the Analysis section at the far right. If both are there, continue with the respective assignment. Otherwise, do the following steps exactly as indicated:\n-click the “Office Button” at top left\n-click the Excel Options button near the bottom of the resulting window\n-click the Add-ins button on the left of the next screen\n-near the bottom at Manage Excel Add-ins, click Go\n-check the boxes for Analysis ToolPak and Solver Add-in if they are not already checked, then click OK\n-click the Data tab as above and verify that the add-ins show.\n\nExcel 2010:\nStart Excel 2010 and click the Data tab at the top. Look to see if Data Analysis and Solver show in the Analysis section at the far right. If both are there, continue with the respective assignment. Otherwise, do the following steps exactly as indicated:\n-click the File tab at top left\n-click the Options button near the bottom of the left side\n-click the Add-ins button near the bottom left of the next screen\n-near the bottom at Manage Excel Add-ins, click Go\n-check the boxes for Analysis ToolPak and Solver Add-in if they are not already checked, then click OK\n-click the Data tab as above and verify that the add-ins show.\n\n### Computer-assisted Learning: E-Labs and Computational Tools\n\nMy teaching style deprecates the 'plug the numbers into the software and let the magic box work it out' approach. Personal computers, spreadsheets, e.g., Excel, professional statistical packages (e.g., such as SPSS), and other information technologies are now ubiquitous in statistical data analysis. Without using these tools, one cannot perform any realistic statistical data analysis on large data sets.\n\nThe appearance of other computer software, JavaScript Applets, Statistical Demonstrations Applets, and Online Computation are the most important events in the process of teaching and learning concepts in model-based statistical decision making courses. These tools allow you to construct numerical examples to understand the concepts, and to find their significance for yourself.\n\nUse any or online interactive tools available on the WWW to perform statistical experiments (with the same purpose, as you used to do experiments in physics labs to learn physics) to understand statistical concepts such as Central Limit Theorem are entertaining and educating.\n\nComputer-assisted learning is similar to the experiential model of learning. The adherents of experiential learning are fairly adamant about how we learn. Learning seldom takes place by rote. Learning occurs because we immerse ourselves in a situation in which we are forced to perform and think. You get feedback from the computer output and then adjust your thinking-process if needed.\n\nProfessional Software:\n\n• A SPSS-Example, SPSS-Examples, SPSS-More Examples, (Statistical Package for the Social Sciences) is a data management and analysis product. It can perform a variety of data analysis and presentation functions, including statistical analyses and graphical presentation of data.\n\nAvailable at: SPSS Package on Citrix (Installing and Accessing)\n\n• SAS (Statistical Analysis System) is a system of software packages; some of its basic functions and uses are: database management inputting, cleaning and manipulating data, statistical analysis, calculating simple statistics such as means, variances, correlations; running standard routines such as regressions.\n\nAvailable at: SPSS/SAS Packages on Citrix (Installing and Accessing) Use your email ID and Password: Technical Difficulties OTS Call Center (401) 837-6262\n\n• Excel Examples, Excel More Examples It is Excellent for Descriptive Statistics, and getting acceptance is improving, as computational tool for Inferential Statistics.\n\nThe Value of Performing Experiment: If the learning environment is focused on background information, knowledge of terms and new concepts, the learner is likely to learn that basic information successfully. However, this basic knowledge may not be sufficient to enable the learner to carry out successfully the on-the-job tasks that require more than basic knowledge. Thus, the probability of making real errors in the business environment is high. On the other hand, if the learning environment allows the learner to experience and learn from failures within a variety of situations similar to what they would experience in the \"real world\" of their job, the probability of having similar failures in their business environment is low. This is the realm of simulations-a safe place to fail.\n\nThe appearance of statistical software is one of the most important events in the process of decision making under uncertainty. Statistical software systems are used to construct examples, to understand the existing concepts, and to find new statistical properties. On the other hand, new developments in the process of decision making under uncertainty often motivate developments of new approaches and revision of the existing software systems. Statistical software systems rely on a cooperation of statisticians, and software developers.\n\nBeside the professional statistical software Online statistical computation, and the use of a scientific calculator is required for the course. A Scientific Calculator is the one, which has capability to give you, say, the result of square root of 5. Any calculator that goes beyond the 4 operations is fine for this course. These calculators allow you to perform simple calculations you need in this course, for example, enabling you to take square root, to raise e to the power of say, 0.36. and so on. These types of calculators are called general Scientific Calculators. There are also more specific and advanced calculators for mathematical computations in other areas such as Finance, Accounting, and even Statistics. The last one, for example, computes mean, variance, skewness, and kurtosis of a sample by simply entering all data one-by-one and then pressing any of the mean, variance, skewness, and kurtosis keys.\n\nWithout a computer one cannot perform any realistic statistical data analysis. Students who are signing up for the course are expected to know the basics of Excel.\n\nAs a starting point, you need visiting the Excel Web site created for this course. If you are challenged by or unfamiliar with Excel, you may seek tutorial help from the Academic Resource Center at 410-837-5385, E-mail.\n\nLeaning Tools for Statistical Concepts is a part of the E-labs learning objects for decision making.\n\nWhat and How to Hand-in My Computer Assignment? For the computer assignment I do recommend in checking your hand computation homework, and checking some of the numerical examples from your textbook. As part of your homework assignment you don not have to hand in the printout of the computer assisted learning, however, you must include within your handing homework a paragraph entitled \"Computer Implementation\" describing your (positive or negative) experience.\n\n### Interesting and Useful Sites\n\nBack to\n\nThe Copyright Statement: The fair use, according to the 1996 Fair Use Guidelines for Educational Multimedia, of materials presented on this Web site is permitted for non-commercial and classroom purposes only.\nThis site may be mirrored intact (including these notices), on any server with public access. All files are available at http://www.mirrorservice.org/sites/home.ubalt.edu/ntsbarsh/Business-stat for mirroring.\n\nKindly e-mail me your comments, suggestions, and concerns. Thank you.\n\nProfessor Hossein Arsham\n\nBack to:"
] | [
null,
"http://home.ubalt.edu/ntsbarsh/Business-stat/excel/excelscn.gif",
null,
"http://home.ubalt.edu/ntsbarsh/Business-stat/excel/enterinfo.jpg",
null,
"http://home.ubalt.edu/ntsbarsh/Business-stat/excel/labels.jpg",
null,
"http://home.ubalt.edu/ntsbarsh/Business-stat/excel/numbers.jpg",
null,
"http://home.ubalt.edu/ntsbarsh/Business-stat/excel/excel_standard.gif",
null,
"http://home.ubalt.edu/ntsbarsh/Business-stat/excel/excel_icon_sum.gif",
null,
"http://home.ubalt.edu/ntsbarsh/Business-stat/excel/excel_icon_function.gif",
null,
"http://home.ubalt.edu/ntsbarsh/Business-stat/excel/excel_icon_graph.gif",
null,
"http://home.ubalt.edu/ntsbarsh/Business-stat/excel/excel_chartwizard.gif",
null,
"http://home.ubalt.edu/ntsbarsh/Business-stat/excel/formula1.gif",
null,
"http://home.ubalt.edu/ntsbarsh/Business-stat/excel/symbol1.gif",
null,
"http://home.ubalt.edu/ntsbarsh/Business-stat/excel/symbol1.gif",
null,
"http://home.ubalt.edu/ntsbarsh/Business-stat/excel/formula2.GIF",
null,
"http://home.ubalt.edu/ntsbarsh/Business-stat/excel/formula2.GIF",
null,
"http://home.ubalt.edu/ntsbarsh/Business-stat/excel/symbol1.gif",
null,
"http://home.ubalt.edu/ntsbarsh/Business-stat/excel/Image9.gif",
null,
"http://home.ubalt.edu/ntsbarsh/Business-stat/excel/Image10.gif",
null,
"http://home.ubalt.edu/ntsbarsh/Business-stat/excel/symbol1.gif",
null,
"http://home.ubalt.edu/ntsbarsh/Business-stat/excel/formula3.gif",
null,
"http://home.ubalt.edu/ntsbarsh/Business-stat/excel/formula4.GIF",
null,
"http://home.ubalt.edu/ntsbarsh/Business-stat/excel/symbol1.gif",
null,
"http://home.ubalt.edu/ntsbarsh/Business-stat/excel/symbol2.gif",
null,
"http://home.ubalt.edu/ntsbarsh/Business-stat/excel/symbol3.gif",
null,
"http://home.ubalt.edu/ntsbarsh/Business-stat/excel/symbol1.gif",
null,
"http://home.ubalt.edu/ntsbarsh/Business-stat/excel/formula5.GIF",
null,
"http://home.ubalt.edu/ntsbarsh/Business-stat/excel/formula5.GIF",
null,
"http://home.ubalt.edu/ntsbarsh/Business-stat/excel/symbol1.gif",
null,
"http://home.ubalt.edu/ntsbarsh/Business-stat/excel/Image11.gif",
null,
"http://home.ubalt.edu/ntsbarsh/Business-stat/excel/formula6.gif",
null,
"http://home.ubalt.edu/ntsbarsh/Business-stat/excel/Image12.gif",
null,
"http://home.ubalt.edu/ntsbarsh/Business-stat/excel/formula6.gif",
null,
"http://home.ubalt.edu/ntsbarsh/Business-stat/excel/Image13.gif",
null,
"http://home.ubalt.edu/ntsbarsh/Business-stat/excel/symbol3.gif",
null,
"http://home.ubalt.edu/ntsbarsh/Business-stat/excel/formula8.gif",
null,
"http://home.ubalt.edu/ntsbarsh/Business-stat/excel/Image21.gif",
null,
"http://home.ubalt.edu/ntsbarsh/Business-stat/excel/Image22.gif",
null,
"http://home.ubalt.edu/ntsbarsh/Business-stat/excel/Image23.gif",
null,
"http://home.ubalt.edu/ntsbarsh/Business-stat/excel/moving.gif",
null
] | {"ft_lang_label":"__label__en","ft_lang_prob":0.87096494,"math_prob":0.9210659,"size":78439,"snap":"2019-13-2019-22","text_gpt3_token_len":19395,"char_repetition_ratio":0.1566775,"word_repetition_ratio":0.13182087,"special_character_ratio":0.26383558,"punctuation_ratio":0.13112648,"nsfw_num_words":1,"has_unicode_error":false,"math_prob_llama3":0.9880249,"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],"im_url_duplicate_count":[null,4,null,4,null,4,null,4,null,4,null,null,null,null,null,null,null,4,null,4,null,null,null,null,null,8,null,8,null,null,null,4,null,4,null,null,null,4,null,4,null,null,null,4,null,8,null,null,null,8,null,8,null,null,null,4,null,8,null,4,null,8,null,4,null,8,null,4,null,4,null,4,null,4,null,4,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2019-03-22T21:14:58Z\",\"WARC-Record-ID\":\"<urn:uuid:b8f64126-be45-495e-b9e7-93d028ee25d1>\",\"Content-Length\":\"114556\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:67c78363-13a5-4ffe-923b-bb0cb9dcc49c>\",\"WARC-Concurrent-To\":\"<urn:uuid:da45f73b-eb98-4f44-a81d-6d14abc432d0>\",\"WARC-IP-Address\":\"204.52.129.236\",\"WARC-Target-URI\":\"http://home.ubalt.edu/ntsbarsh/Business-stat/excel/excel.htm\",\"WARC-Payload-Digest\":\"sha1:HSVR5JUIF2DO76Q2WKRKBVJVWENDXQBV\",\"WARC-Block-Digest\":\"sha1:OXJZJTMFA7QO5RVF3YJBYYKSMYSAT4LH\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2019/CC-MAIN-2019-13/CC-MAIN-2019-13_segments_1552912202689.76_warc_CC-MAIN-20190322200215-20190322222215-00553.warc.gz\"}"} |
http://www.nanodic.com/general/Heisenberg_Uncertainty_Principle.htm | [
" Dictionary of nanotechnology - Heisenberg Uncertainty Principle\nHeisenberg Uncertainty Principle\n\n A quantum-mechanical principle with the consequence that the position and momentum of an object cannot be precisely determined. The Heisenberg principle helps determine the size of electron clouds, and hence the size of atoms. Source A consequence from quantum mechanics: the position and the momentum of a particle can not be determined with the same accuracy at the same time. When for example the speed of an electron is well known, it's position is unpredictable within a certain volume. This effect is negligible in macroscopic dimensions. Source A quantum-mechanical principle with the consequence that the position and momentum of an object cannot be precisely determined. The Heisenberg principle helps determine the size of electron clouds, and hence the size of atoms. [NTN] \"The more precisely the POSITION is determined, the less precisely the MOMENTUM is known\" [Werner Heisenberg] Source A quantum-mechanical principle with the consequence that the position and momentum of an object cannot be precisely determined. The Heisenberg principle helps determine the size of electron clouds, and hence the size of atoms. [NTN] \"The more precisely the POSITION is determined, the less precisely the MOMENTUM is known\" [Werner Heisenberg] Source",
null,
"",
null,
"",
null,
"",
null,
"",
null,
"",
null,
"",
null,
"___________________ Refer to this page: ___________________ Related Terms:",
null,
"",
null,
"Note: If a company/institute/site doesn't want to present its own information in nanodic.com, it can sent one e-mail to [email protected]."
] | [
null,
"http://www.nanodic.com/images/top02.gif",
null,
"http://www.nanodic.com/images/right_space.gif",
null,
"http://www.nanodic.com/tell/Image/button_black2.gif",
null,
"http://www.nanodic.com/images/favorites.png",
null,
"http://www.nanodic.com/images/print.png",
null,
"http://www.nanodic.com/images/SendResponse.png",
null,
"http://www.nanodic.com/images/saveaspdf.jpg",
null,
"http://www.nanodic.com/images/bottom_01.gif",
null,
"http://www.nanodic.com/images/copyright.jpg",
null
] | {"ft_lang_label":"__label__en","ft_lang_prob":0.8384806,"math_prob":0.90661967,"size":1223,"snap":"2022-40-2023-06","text_gpt3_token_len":274,"char_repetition_ratio":0.14438064,"word_repetition_ratio":0.6775956,"special_character_ratio":0.17825021,"punctuation_ratio":0.0776699,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9535616,"pos_list":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18],"im_url_duplicate_count":[null,8,null,8,null,8,null,8,null,8,null,8,null,8,null,8,null,8,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2022-10-07T00:08:59Z\",\"WARC-Record-ID\":\"<urn:uuid:96852b5a-6ac1-4052-8766-d68df70c3982>\",\"Content-Length\":\"16783\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:b4ce9d60-be33-4030-82dd-78ff33870d5f>\",\"WARC-Concurrent-To\":\"<urn:uuid:700b8fca-1be0-43b2-9209-e8b07adea1b9>\",\"WARC-IP-Address\":\"185.55.224.160\",\"WARC-Target-URI\":\"http://www.nanodic.com/general/Heisenberg_Uncertainty_Principle.htm\",\"WARC-Payload-Digest\":\"sha1:AH6XYHGDYRTTCKL2D4DSBZEXYULXRN4O\",\"WARC-Block-Digest\":\"sha1:WCGCTOLADJD7OKFBLKVFKZFRWBM7IN3B\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2022/CC-MAIN-2022-40/CC-MAIN-2022-40_segments_1664030337889.44_warc_CC-MAIN-20221006222634-20221007012634-00008.warc.gz\"}"} |
https://piccard.info/matpower-41-28/ | [
"Matpower is designed to give the best performance possible while keeping the code simple to understand and modify. Most of the formulation More information. The solution values are stored as shown in Table Solution of Linear Systems Chapter 3 Solution of Linear Systems In this chapter we study algorithms for possibly the most commonly occurring problem in scientific computing, the solution of linear systems of equations. This paper is extracted from the M. Each Newton step involves computing the mismatch g x , forming the Jacobian based on the sensitivities of these mismatches to changes in x and solving for an updated value of x by factorizing this Jacobian. The initial need for Matlab-based power flow and optimal power flow code was born out of the computational requirements of the PowerWeb project 2.",
null,
"",
null,
"",
null,
"An n-dimensional vector is a row or a column. An optimization problem usually has three essential ingredients: These options are passed to the simulation routines as a Matpower options vector.\n\nAs a result, for the DC case 5. Matlab is a registered trademark of The MathWorks, Inc.\n\nThe standard version of each takes the following form: April 12, Contents 2. Systems of Linear Equations Definition. The function g is convex if either of the following two conditions.",
null,
"The notation in this section, as well as Sections 4 and 5, is based on this internal numbering, with all generators and branches assumed to be in-service. All of Matpower s solvers exploit the sparsity of the problem and, except for Gauss-Seidel, scale well to very large systems. W03 Analysis of DC Circuits.\n\nmatpowe",
null,
"Enhanced Fritz John Optimality Conditions In this example, it allows us to access the real power demand column of the bus matrix using the name PD without having to remember that it is the 3 rd column. The bus data includes the voltage, angle and total generation mqtpower load at each bus. An Example Consider the following linear program: Algebra I Part IV: Introduction The Fundamental Theorem of Algebra says every nonconstant polynomial with complex coefficients can be factored into linear More information.\n\nIntroduction to PowerWorld Simulator: In the first form, the objective is to maximize, the material.\n\n## Matpower 4.1 User s Manual\n\nChristopher Lum lum u. The parameters r s, x s, b c, and shift are specified directly in columns 3, 4, 5, 9 and 10, respectively, of the corresponding row of the branch matrix.\n\nFurthermore, the n l n b sparse connection matrices C f and C t used in building matpowfr system admittance matrices can be defined as follows. Follow the download instructions on the Matpower home page 6. Familiarization with the Network Analyzer Measurements to characterize networks at high frequencies RF and microwave frequencies are usually done in terms of scattering parameters Matpoder parameters.\n\nAlgorithms and Applications Matrix Math Review The purpose of this document is to give a brief review of selected linear algebra concepts that will be useful for the course and to develop More information."
] | [
null,
"https://www.researchgate.net/profile/Ray_Zimmerman/publication/265542880/figure/tbl2/AS:669378353836047@1536603644478/2-Power-Flow-Options_Q320.jpg",
null,
"https://piccard.info/download.png",
null,
"https://imgv2-1-f.scribdassets.com/img/document/314185815/149x198/ffc361076f/1464551614",
null,
"https://docplayer.net/docs-images/40/13628725/images/page_4.jpg",
null,
"https://image.slidesharecdn.com/matpowermanual-151121185035-lva1-app6892/95/mat-power-manual-41-638.jpg",
null
] | {"ft_lang_label":"__label__en","ft_lang_prob":0.8530879,"math_prob":0.9352683,"size":4268,"snap":"2020-34-2020-40","text_gpt3_token_len":899,"char_repetition_ratio":0.104831144,"word_repetition_ratio":0.038235296,"special_character_ratio":0.19868791,"punctuation_ratio":0.102827765,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9928527,"pos_list":[0,1,2,3,4,5,6,7,8,9,10],"im_url_duplicate_count":[null,1,null,5,null,1,null,1,null,1,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2020-09-24T02:17:53Z\",\"WARC-Record-ID\":\"<urn:uuid:565858c9-7c7e-4bb6-b6ab-4ce6698af751>\",\"Content-Length\":\"36562\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:2ca56992-e53a-4aa7-8ce0-4ec68c913d1e>\",\"WARC-Concurrent-To\":\"<urn:uuid:0228bcc5-7b37-4369-a1ad-28fcce395c3e>\",\"WARC-IP-Address\":\"172.67.212.5\",\"WARC-Target-URI\":\"https://piccard.info/matpower-41-28/\",\"WARC-Payload-Digest\":\"sha1:OB3LHXZNPB5AEQ6ZGJ7VCIGZS2GTAIWI\",\"WARC-Block-Digest\":\"sha1:EKXN47QTQ5SAFV7Q3HHVOEM4WQPPSWRA\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2020/CC-MAIN-2020-40/CC-MAIN-2020-40_segments_1600400213006.47_warc_CC-MAIN-20200924002749-20200924032749-00388.warc.gz\"}"} |
https://zoidberg.ukp.informatik.tu-darmstadt.de/jenkins/job/DKPro%20Text%20Classification%20Framework%20(GitHub)/javadoc/org/dkpro/tc/ml/weka/evaluation/MulanEvaluationWrapper.html | [
"org.dkpro.tc.ml.weka.evaluation\n\n## Class MulanEvaluationWrapper\n\n• ```public class MulanEvaluationWrapper\nextends Object```\nA wrapper for evaluation measures calculated by the Mulan framework for multi-label classification.\n• ### Constructor Summary\n\nConstructors\nConstructor and Description\n`MulanEvaluationWrapper()`\n• ### Method Summary\n\nAll Methods\nModifier and Type Method and Description\n`static boolean[][]` `getBooleanMatrix(int[][] actuals)`\nConverts a list of {0,1}-integer arrays into a boolean-matrix.\n`static List<mulan.evaluation.measure.Measure>` ```getMeasures(mulan.classifier.MultiLabelOutput prediction, int numOfLabels, boolean strict)```\n`static List<mulan.evaluation.measure.Measure>` ```getMulanEvals(double[][] predictions, boolean[][] actuals, double threshold)```\nRetrieves evaluation measures calculated by the Mulan framework for multi-label classification\n`static mulan.evaluation.measure.Measure` ```getMulanMeasure(double[][] predictions, boolean[][] actuals, double[] thresholds, mulan.evaluation.measure.Measure m)```\nRetrieves a single evaluation measure calculated by the Mulan framework for multi-label classification\n• ### Methods inherited from class java.lang.Object\n\n`clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait`\n• ### Constructor Detail\n\n• #### MulanEvaluationWrapper\n\n`public MulanEvaluationWrapper()`\n• ### Method Detail\n\n• #### getMulanEvals\n\n```public static List<mulan.evaluation.measure.Measure> getMulanEvals(double[][] predictions,\nboolean[][] actuals,\ndouble threshold)```\nRetrieves evaluation measures calculated by the Mulan framework for multi-label classification\nParameters:\n`predictions` - predictions by the classifier\n`actuals` - gold standard\n`threshold` - a threshold to create bipartitions from rankings\nReturns:\nmeasures as defined in `getMeasures(MultiLabelOutput, int, boolean)`\n• #### getMeasures\n\n```public static List<mulan.evaluation.measure.Measure> getMeasures(mulan.classifier.MultiLabelOutput prediction,\nint numOfLabels,\nboolean strict)```\n• #### getBooleanMatrix\n\n`public static boolean[][] getBooleanMatrix(int[][] actuals)`\nConverts a list of {0,1}-integer arrays into a boolean-matrix.\nParameters:\n`actuals` - a list of {0,1}-integer arrays\nReturns:\na matrix holding only boolean values\n• #### getMulanMeasure\n\n```public static mulan.evaluation.measure.Measure getMulanMeasure(double[][] predictions,\nboolean[][] actuals,\ndouble[] thresholds,\nmulan.evaluation.measure.Measure m)\nthrows IOException```\nRetrieves a single evaluation measure calculated by the Mulan framework for multi-label classification\nParameters:\n`predictions` - predictions by the classifier\n`actuals` - gold standard\n`thresholds` - a threshold to create bipartitions from rankings (one per instance)\n`m` - the measure\nReturns:\nthe updated measure\nThrows:\n`IOException` - an exception\n\nCopyright © 2013–2019 Ubiquitous Knowledge Processing (UKP) Lab. All rights reserved."
] | [
null
] | {"ft_lang_label":"__label__en","ft_lang_prob":0.5639317,"math_prob":0.91989803,"size":1898,"snap":"2019-13-2019-22","text_gpt3_token_len":406,"char_repetition_ratio":0.17001057,"word_repetition_ratio":0.22222222,"special_character_ratio":0.18967333,"punctuation_ratio":0.18560606,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.98103815,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2019-05-22T16:01:09Z\",\"WARC-Record-ID\":\"<urn:uuid:3668e8e7-eb10-46fb-bb5a-253edc385f82>\",\"Content-Length\":\"19068\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:7e542a2f-207b-48e5-99de-cd87c78e1eb3>\",\"WARC-Concurrent-To\":\"<urn:uuid:03a8d2cc-ac9c-4847-ab02-c64696da8474>\",\"WARC-IP-Address\":\"130.83.167.140\",\"WARC-Target-URI\":\"https://zoidberg.ukp.informatik.tu-darmstadt.de/jenkins/job/DKPro%20Text%20Classification%20Framework%20(GitHub)/javadoc/org/dkpro/tc/ml/weka/evaluation/MulanEvaluationWrapper.html\",\"WARC-Payload-Digest\":\"sha1:UJ5YELZ5ESMV7VXJDUWFACE3IIS25WQ7\",\"WARC-Block-Digest\":\"sha1:HGFXH22I4AZJBHA6GODVU3QR4DQPJSJP\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2019/CC-MAIN-2019-22/CC-MAIN-2019-22_segments_1558232256858.44_warc_CC-MAIN-20190522143218-20190522165218-00339.warc.gz\"}"} |
https://www.financehomeworkhelp.org/how-to-calculate-capitalization-rate/ | [
"# Find out How to Calculate Capitalization Rate\n\n## Capitalization Rate: How to Calculate",
null,
"Assignment:\n\nXYZ Ltd., expects a net income of Rs. 1,50,000. The company has 10% of\n5,00,000 Debentures. The equity capitalization rate of the company is 10%.\n(a) Calculate the value of the firm and overall capitalization rate according to\nthe net income approach (ignoring income tax).\n(b) If the debenture debt is increased to Rs. 7,50,000 and interest of debt is change\nto 9%. What is the value of the firm and overall capitalization rate?a. Calculation the firm value and overall capitalization rate according to the net income approach.\n\nAccording to net income approach, the firm value is the summary its debt and equity. The cost of debt and cost of equity are independent. The main purpose of any company is raising its value using the most optimal mix of debt and equity. While the firm will achieve to maximize its value, the overall capitalization rate will be declined. So how to calculate capitalization rate? The overall capitalization rate means how much net operating income is generated by the dollar of market value its assets. And what is the value of the firm and how do business analysis and valuation work? The value of the company (V) is defined the following formulas, where S is the sum of market value of its equity and B is the market value of its debt.",
null,
"Using NI approach, the market value of equity(S) is calculated as earning available to equity shareholders (NI) divided by the equity capitalization rate (k e).",
null,
"The earnings available to equity shareholders (NI) are determined as net operating income (EBIT) less interest on debenture (I).",
null,
"The overall capitalization rate (ko) is defined as net operating income (EBIT) divided by the value of the company (V).",
null,
"Particulars Rs. Net operating income (EBIT) 1,50,000 Less: Interest of 10% on debenture of 5,00,000 (I) 50,000 Earnings available to equity shareholders (NI) 1,00,000 Divided by: Equity capitalization rate (K e)% 10% Market value of equity (S= Nix100/Ke) 10,00,000 Plus: Market value of debt (B) 5,00,000 Value of the firm (V=S+B) 15,00,000 Overall capitalization rate (Ko=EBIT/V)% 10.00%\n\nSo, the value of the firm will be equal Rs. 15, 00,000, while the overall capitalization rate will be the same as cost of equity and debt. Typically, the cost of debt is lower than cost of equity as the lenders require lower rate of return than equity shareholders. So, the company is more interested in attraction additional debt than equity for its operating activity. In the above case, the firm has as the equal finance structure, as the same cost of its sources. This is the main reason why the overall capitalization rate is the same.\n\nb. Calculation the firm value and overall capitalization rate if the debt will be increased.\n\nAccording to the above calculation in requirement #a, if the debenture debt is increased to Rs. 7, 50,000 while the cost of debt is reduced to 9%, the calculation the firms’ value will be following. As the cost of debt is decreased, but the proportion in capital structure ups the value of the company will be increased as shown in the table below. As the result of this shift in capital structure the overall capitalization rate is decreased from 10 percent to 9.52 percent.\n\n Particulars Rs Net operating income (EBIT) 1,50,000 Less: Interest of 9% on debenture of 7,50,000 (I) 67,500 Earnings available to equity shareholders (NI) 82,500 Divided by: Equity capitalization rate (K e)% 10% Market value of equity (S= Nix100/K e) 825,000 Plus: Market value of debt (B) 7,50,000 Value of the firm (V=S+B) 15,75,000 Overall capitalization rate (K o=EBIT/V)% 9.52%"
] | [
null,
"https://www.financehomeworkhelp.org/wp-content/uploads/2017/10/how-to-calculate-capitalization-rate-solution.png",
null,
"data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAEAAAAASCAIAAABkTU91AAAEd0lEQVR4nGP5//8/w1AGLAPtAErB8PLAv/fHJuZnVCy+zGIanZdZXp2gy8PIwPDn2Y6ukpLmDUz+pQ2dNUHyrKSY//fN4UkltYuu/Obn/v/+8d1XfEFLD0534idC57erc2vrJ0xZe+WPrJ6hGNOPd89eM2v4l/T3pBrxMeHwAJOgVeHElt2r/M/oZ9Ym6nJBlUjZOkuy7GhfszhfhSTHMzD8vjvNz61VeuHFE2HSQJu+nSz2XcFNpBlc2slN+UcWrn3gNP/IKmdehv+fjlcaW2V4MenenWHFjd0DIMCr66HBsP348ae/rVUhVv25v6hqn1PnYVJdD4zRVwcWH/9vsc1DGmINu7xvZrQ6J7KS75enVM1jSm7P0uHA0P733dVLbxnkTOTAUox8+n6OYp2zz1x5/9eKmxmnB1gkLGylGGbuuvypWFUYmID+v9/bPFOoaqc5D6nOBxnGwcH488yqgy/dfMWBVjJLOIRIoKr4dW/txIlMjg3YPPDj/vEHDJy2euLQkPv59tknBiFtNQFmJEWYmZhT1c2AfcrZ3be/BwlzMfy8Nq3pTsw8f3GkZPdlX4SU88rPWJ3M7Lr57S4faBpnEvWsy1Bwne6nfiOrd1JTgqkwM1ZN2MHft1cvv2OQNZEHee3/j4fb22r28fpPbbBGCUospRA4EW07dvLFHwv5N+vrNhi37lNjQ1bA47Ti0/8VxLiBSchl8plj2sWZZdNSzOZPy1u2oSdAFhSe/359/vT1D7AG+vTl9///TF8+vH//D5hKWLj4eNlhQQWOAIZvcyOt1v97f//yvS9qIe0bZsYpoqZkLB5gEbewk2KYtevKp+RXPRMYitZb8TIS41rsgFnYMnvBuej8OTkh6ZOCQ1VvH85RYv3zcLqNUsEluKJoBSEwrdlx82K5GjTrvb58+T2Desu2U9WabAz/vt3bWhcYaK13fcfFWe7CiPSArR4AJiJDjsnnd+yeee9MQF+rJCnxjgT+fH7zjUOED+QcJgHDtLmbnp/Sad509VuOEj+zZMjcfdof/jIwfD1aGNDA2LChzxpYsDDzq8nCHfTjwYkHDFyOJtLg2GfiUvKtanCcGLR48qk+d08+vB5g4NEBJqKtM3Jmp686qcmOIf1lf5Ss0/IPWF3N5rHl1XZvUB74cak792jcolxY4cXMyc/JKCQvBOIyckibOEqDRD9+FWFkZDJ0cHFBqxuAEXDlA4OilTK80Pr/98fPvwwcfBxMyOqweoBF3NxemuGGZmW1HT+W1MPjuOz9/2VY3Y8A/z/fOnb6qNazdBV5UBD+ebmra+Jt3ayFRlwENELBjwfAHMDnaSQB9f+fV/t6Wg//l8vONOZGVoe9KcGp6mrjIFwdLkNm6gEBDq1IjwXtzno9MnKi7L8/fGDVK9mzL8OAE1UVv//+f//Qtf57e3hiefXmjwxfdmfbm3ADw/Dvj4+fmRWd+vY25tjyoYQpjraQgPeK/d7kOx4IGHn1kqfsSCZLL5OwbeGcY4VziFE7vBpzQxEMeQ8AAOzsmCWtEH5qAAAAAElFTkSuQmCC",
null,
"data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAADAAAAAhCAIAAAAQ6r/uAAAEMUlEQVR4nGP5//8/w2ACLPSx5s+5ylm2y2W3XvJ14BsUDmISNVLyeC0mxU5QJb0cJBvk0GfPKj9oHMTw99WTPY/lksWYCSmkk4N+X1zzXClGhQiV9HDQ/7c791Q81F0vSIxiTAf9fXN4Ukntoiu/+bn/v3989xVf0NKD0534yXbO36dXk+LuWe514yZKObqDft+d5ufWKr3w4okwaaDct5PFviu4Wcl2DdA916bv28SiWq0MSj0/b19uX8uRVqIqhTNm0CT+vTqw+Ph/i20e0hAJdnnfzGh1Tkoc9OL6FwYuTm4mMOfdk9k1jyWjVdJlGYlzEAMLBwfjzzOrDr508xUH+olZwiFEggLnMDCwGiZrSfhdXnjGstOanUNBztya00IUl2swHcQk6lmXoeA63U/9RlbvpKYEU2FEPv2yL0LKeeVnrMYwu25+u8sHW0JjFPHyu3DwfO+C3WX7hKSEBarX2+tz4PEAeggxCblMPnNMuzizbFqK2fxpecs29ATIQtIQj9OKT/9X4DELF2AStzbusiZSMZbExSxsmb3gXHT+nJyQ9EnBoaq3D+cokZCsGRnxRAhOAK/jURz05/ObbxwifCDbmQQM0+Zuen5Kp3nT1W85SuTnelIBsoN+XOrOPRq3KFcFGh7MnPycjELyQlDul/1Rsk7LP2A1hs1jy6vt3mBnU9ieQXLQ/8+3jp0+qvUsXUWeDcj983JX18TbulkLjbgg8jyOy97/X0aJZSQ6iIFDK9JjQbuzXo+MnCj77w8fWPVK9uzLMCCnFPpxZ2VLQU7rLuONL3f4EVVlYHEQI69e8pQdyWRYjwk4VAIjTWvbb5gpcpGok2aV67f7px6zKBvLEG4BoQJaOejXs3N3fsmEKZEaQDRz0PcHpx+zqIAC6NedGYGWle8ipy3riVRkfndiRmX7rveMr89c5oqZt6rBXoiJLg4CBtDtnzLBSlz/P19ev4e7av/KAgOe/+/2F9tFXs48uCVb7ctqR/Gwqm3Zh2PEUV1EIwf9eHDqEYuyifCd6Rltf8vmlxjwMDJ8PdkYP/l/3uVUdY7/n88eucekFqvDz4SukzYO+vXs/O2fInqH0hwmnPE/MIMPVJl8Pjl54WPNah/u61snTu9f/jxh494aA8xqljYOAgbQw38vOViiax32VXZsb7UNE//7/PT5j+x8Lw7uu63pUL8lT5IDe5VHEwf9fn7h1g+Z3NlNkSqHtjR4dyy7F1go9+fnHwYOJZ/EBEcefHpp4qDvD089Yla2kOdgFLArSpQy7Z9+MaNXzcZCqH773N3PbQMlGT/d3Lb4kERMiik/ejjRwkG/X1y4+V3SU5UXaBmnfka+fn91eonR6p6eFdXPU6JkBYVVtAzd0+obvDBcQyMHsaqVXf1bBuOoFl/4VwxhK7XsfthCQDO9eq5Eg1EHEQIABrR+WDWGLDoAAAAASUVORK5CYII=",
null,
"data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAFYAAAASCAIAAABO/b7aAAAFL0lEQVR4nGP5//8/w8gGLAPtgIEHo0GALQj+nKucZbtcduslXwc+0g38//XSnNqG/snrr/8RUVITZmUECf77/vyRYMPVM4XKv67Ora2fMGXtlT+yeoZiTD/ePXvNrOFf0t+TasTHxPD74bq2xr6++Ue/afilxkTZXcrPPCmqLMHD+OHKmZtfeNRMtPh+f351755Qy/XTeYpERx+qsUkVZf5yrHiDgEnUSMnjtZgUO+n+BwJGbr3UpryD89c/dl1+YZULL1jw76PZQY1K4kDLWLSTm/KPLFz7wGn+kVXOvAz/Px2vNLbK8GLSvTvDiptVPqiy+NKS+cck62ZPDf08JSxi89UJNtz/Xy2zE49+Xrj2SJMOO9CskFZVUVKSL4qxkWKMqLLYgkA2yKHPnlWevCAAgj9vrlz9wKBoqcgJF2JX9AzS4AAz/767euktg5yJHJjLyKfv5yjWOfvMlfd/rbiZGRi+3T/1iEHKW5WX8d9nqZBkQ26goh8PT95jYNMzkQY7iUMtKEKDE4u9+ADCWAwpbIH599WTPY/lksWYSbQGBn48OPGAgdddXxxs+K+3jz/xyLpkeMNk7x9/wMBpqycOTYs/3z77xCCkrSYAtu7n0zO3fzEqmQMDiE05OAqs4v/n2+eeMcilKnOBeMxi9rFipDoJyVgMgCUIfl9c81wpRgVJ5Mu+CCnnlZ+xGs7suvntLh9+JJE/by5f+cCgYKEAsu7/+z0VNb87FvizQ4P/79url98xyJrIg2V/PNzeVrOP139qgzUPWPr7vZOg2FJBjq0fD08AE4E+NBGQBbAZCwPoQfD/7c49FQ911wsiC/I4rfj0fwWx1oETAcO/WdGOa1kY/n64+9F3OzfCZnAiYPg2N9Jq/b/39y/f+6IW0r5hZpwiJE38fHLmzi8GRTN5pNj6/+kWMBHIpylyEesCDIDNWDhADYK/T68mxd2z3OvGTbZtDH9eX776kUG3b/PhQmUWhs+7U7K+yrAjy15+z6Desu1UtSYbw79v97bWBQZa613fcXGWuzATw3dQlpX2UkVNBCfvM7AbmsiwoVr0/Wy9f9rGV3+xuIGR32nqtj4ruC+wGQsHKEHw99r0fZtYVKuVQdny5+3L7Ws50kpUpUhrO/x4AIxmfi8DSEnAbd3ezyiElAhASYTL0UQa7B8mLiXfqgbHiUGLJ5/qc/fkg8aWOZZEkKGIXgJyGjfuOttIjJOwGYsAqEHw4voXBi5ObiYw592T2TWPJaNV0mW/7o+SdVr+AavxbB5bXm33RpQFkESgaK0EsY6JS1SE4cfFnrqHcR1+YkxAWWA5oWilDPfP/78/fv5l4ODjAFn67R6o3MaSCDiMjKXREgEJAJuxCIASBKyGyVoSfpcXnrHstGbnUJAzt+a0EAVq43Fc9v7/MuKsA0ezUICuCMLkL6fn7GRLzmFigCYRPk8jCWh18OfVvp7Ww//lsjONuaHlNoMSeiI4D0wEWRiJgHiAzVgkgBIEjCJefhcOnu9dsLtsn5CUsED1ent97Nqwgr9vDk9rn75k8yeGL1tSrQw4IWH+/8/Hh69MVrZy/Ht7eGJ59eaPDF92Z9ubgErIvz8+fmZWdOrb25hjy3p9QVXP4nl3gRl3YUO/VGO+g+i/x1smTNp0eMtJYKLf2lLKGFpcGoDcrCMGfL+2oBnNWPS6Hj2fM4lbG3dZk2YNDDCL2Ob2AhHO9GJbOOdY4RwckloJbfOACNk8WZ/SbiCaRZ5zwIAT01h0MNpNGg2C0SAAAgBLTzgu7PzTgAAAAABJRU5ErkJggg==",
null,
"data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAFoAAAAmCAIAAADLKhvvAAAI2klEQVR4nO1YaVRT1xY+mRMSAjJKmEzCZG2YEgWjKKDWgVYUhzovXTwsDhWpigXUggpoH2V4TigObXEh0udDCyoORVscCqIiENECMUAFRRmDZE7evUmUJIbiUoz54bfuj3vO2WfY3/n2OftetEKhAB/xEugPvQDjwkc6tGBIOhQvqg5vTUjfU1ArtaK5WWIQcKVc0No0LIFTEU0Xc45s/S5j76kaqaOnjw1S2NHyDOURujE9NcKXjASSxv8lJ6alHbve5zEzYsmiCVVRq8qs6cNJiK6aioe9JDfWJ2QJv43LtdhZe2sd9W3dMiQdCKJnxPZ1vx8raJ5yojJ/sqmyUtaUHZZIs4XWgR4Vvj3q2k+neMHHruVPMgWKnpuxTHbkDCSjIYtNxDiHxW6oOn7sht227H3z+HvnLyjkZIwnKtpyJ9gubo0+dW37pzhorLlJrtbv4JOBg0X6vIbTBahjqYRXVTjq9DAPvPJV1sGpagdOLCdlEUH2mhlkszu7oqZTxiaiAOh7VN4EKCGupgg5nzI33IcIGQkby7gA68myx8Fd8G5hCzwIeuZ9UxiYDiHvTx4wneplq5xX3N7cQ3KcHBnysvXRTR4gBHjaYlRlUXtLD7AY5WaOUpYeV9SJETQ/iCwsfc4ipYWCX3enBThF0E3gEspm4lKbd1qfYemQPq+u6QIj/EfA26/ovPztFsmuH0NxCFWrrJ1T3QEcWc7KVmHj+eQtJaah+xLGkZTNAm4ZLA4XU0T/gMLGPyFxeKnF8e4wLB1KcQD5ocVBp9BA1tXQ/cV5Yr9zSnGAviML2QXyzkfV3F63uSmnDy6jqrQi+ruiXgyoY5zx/eMpev6CxOG8kmoyRAs0KB3SZ9WcbsBIKyyNpqMB/9K/Vr9wwGm2VncC953nyuNHYoG8j3t22+zZ4zxri+8dmmqJBAL45LCf4aotjrJHAOfDcsAONrW84/YF7ojPWJZw3AnqisvwwYGOr/cyKB1CHrT9ZjO8VScHcVxKOsJCQxywdEyCWPbKVSJNaF/EJQRlhuXsKU+bOp2sFoefHnFEUgc7PcXcE3urmDFMlKpIoHnyU7Jvr1/NJCG0DXXoENaf3Ll+bdJF5pmnxTOHvZ3TA0IlDuo4msojpIm1FRDeS93WuGzXTBsk1AqdK1Q2/ZVvCplQJAN4Mh4JFfq48LWiRxx4X6b9P4tD1nI6jROYvLifSBRl6hxZVE695ypXjJapDh14l9kLR29NeTBmyKJRA8rtt5jFsOqftPfW4QvY8LVIoJYOebrvcPUCpW0lqUmlCqc1q5hE9bUCaLriuAuJY/Ug4hDX5eYRZh4na1ViXUMYO47eXZ40Rqvza8ECXe7NaDrTYYiOajVkz0v3pxw4XtgDeosi2N4E1RYrpN2NbayTSXh5e2nm5vjCbtB7ac1EFny6yoTdfBQ1OO23xLUBmNof41JzjjZAQf9TQjolMSrQWt5clPGfX0uLyiDln925CTFvw6ZZThi9U0t4Zy8SJ0fobi/anu1SmccRjGFp8qFLh7jlTr3YYT5tiMWBsgr4+gfoyR3IICD68I3owwM0frI8+Sj0aI7n+Pmmf0PPoUFnVnRXXhH5hL7uD96ZiS2/3ipl0TQ40KVDwLvVjHaBxSGuz5o9NrZj4f7c1IUjJLV538XsKZNam/KbX4yKOpSxzJ2gcwoZKUR/331ixrbWoxy8nfOLUzwhoJH663TogMRRJ3KYQzNR8KsLLhPjrpxc700SP8gM8d9hlll+eTkNJ7qfzPSdtcu3MpEBx1NvyQLKpJN8vStBTSlsv/i52dC59jaQdjRLrMz0XaAosg1ofdKnABrXi+7NwitvQtNZlvUHIpNlMcc2epMQspb8NZuvM/Y0LKXB/uOokyYO25JfxNvCcIcoJwXn9Sjy3qtD7wa5kC/HY/UpGYklokXdQjlEzKs6bTrELXfrRFaef6wMzKgIvZpFhkZRtP9+5KqIdTjEQd1JIZcrFMJugQwA/WeXPiAQHyC01D/6YCcGMHitRpsOSByN8qd49OKtgSWxu84nBcy3lTzlNMutg93MkSoTedfDe0+RTgy7QRNB4wASb4oUSvTxIRf3SXHWeKRmnRYdktbKv4QOX2dvX+jyR1FCyK5c7uxoZ7w5Ad5dtYm06czBW7igo0FWqmF6ryxyDD7RpXcl2GlFbedDlGfHh/sji7F0wrZ3S/W0yHrawHA/Ey3ZatEhaCxvQtH9nfEI8wnfrKCMTj9wL/IHxrR5HnE5hfdfjGWZCO5nrYzljP/+1nyKOnRIQbmdigGvTyMA1sGX0l33TALMdENb2NpI8HLSzq806ZA8qXwosJuuzIMJXpFRXunxX230/SU95syR1hVL/Nm2ZCGfHLSvbMci96FN0t4nEGTvYMKZBgFw0aFD1HRH4D3NfuAkHeMWw5HFvCy4bqiUb1AXlmZdX/q+1qsJeeeNzKjIb3Oq0aMXr1u1OX45A74EpS3F32/cuOM0MnRTwu4tYc5vfoLDwDjNmC46Uts31U8rFZM+vvFg1LwYnfTMuP6kI4exozN3XsoPrfBatXUFQ71WNCVgkh26OOW/OVG6W/wmwNC/XCTdf6fHb7zGZ4u44VxVQEQ4UcfWuOiAYcqY5gHO37z5WDJO/bkpffRzXEnw7tK34QIG0nbGOq/0Xx+ylrirPwBlrZdPo1eucX/tdjQ+OtDD/QMo4ODF6p4NrpZwztD5246DFnEX/EiD9x0IGKdZK72uPuhw9baAL0QBj0NeEu6j+7MDGCMdgOD6mTdu7+1LdYIwSxMgur9/e/2So6G2yMF7/gOQ5oxg71cz0CeP129mhHSowuXcjbInUn/n5wXbTjOTStwMlPQZIx1oW/8JFHDoYk1PeFtqBvimgG1qqBTfGOmAw8UHv+du8aWD3IpZaUl2qMG7DBGMkg5A+hQKl7NZa7O/yi8baciUzzjpQNv6TbQHD0bGxk8wM+insHHSAYXLlPGBlvFfOhguTpQwUjqAeUjelZDBzYYaxkrHB8JHOrTwkQ4t/B8S/F79yaZ+qwAAAABJRU5ErkJggg==",
null
] | {"ft_lang_label":"__label__en","ft_lang_prob":0.9230452,"math_prob":0.9968595,"size":3651,"snap":"2021-31-2021-39","text_gpt3_token_len":925,"char_repetition_ratio":0.19276117,"word_repetition_ratio":0.16558442,"special_character_ratio":0.26841962,"punctuation_ratio":0.12533693,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9941994,"pos_list":[0,1,2,3,4,5,6,7,8,9,10],"im_url_duplicate_count":[null,5,null,null,null,null,null,null,null,null,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2021-09-20T01:43:48Z\",\"WARC-Record-ID\":\"<urn:uuid:e5e00c57-dc29-41f7-90e1-321809968d78>\",\"Content-Length\":\"52513\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:1e040b48-6a57-47e7-b18f-3db96bc075ab>\",\"WARC-Concurrent-To\":\"<urn:uuid:b4066216-d0b8-46ba-9da2-6cde65ce8931>\",\"WARC-IP-Address\":\"172.67.175.19\",\"WARC-Target-URI\":\"https://www.financehomeworkhelp.org/how-to-calculate-capitalization-rate/\",\"WARC-Payload-Digest\":\"sha1:K2B6CLJVTPTBJDE3ZGVXBX5WIPS3C5MS\",\"WARC-Block-Digest\":\"sha1:M4D3HKLRCZ32VYAKCPNLXK3TVWEVWNU3\",\"WARC-Identified-Payload-Type\":\"application/xhtml+xml\",\"warc_filename\":\"/cc_download/warc_2021/CC-MAIN-2021-39/CC-MAIN-2021-39_segments_1631780056974.30_warc_CC-MAIN-20210920010331-20210920040331-00661.warc.gz\"}"} |
https://www.isprimenumber.com/prime/26927 | [
"# Is 26927 a Prime Number?\n\nYes, 26927 is a prime number. 26927 is divisible by 1 and itself.\n\nYes, 26927 is a prime number.\n\n### Why 26927 is a prime number?\n\nBecause 26927 has no positive divisors rather than 1 and itself.\n\nThe next prime number of 26927 is 26947\nThe previous prime number of 26927 is 26921.\n\n### Related Prime Numbers\n\nBiggest 10 prime numbers smaller than 26927\n\nSmallest 10 prime numbers bigger than 26927\n\n### Related Non-Prime Numbers\n\nBiggest 10 composite numbers smaller than 26927\n\nSmallest 10 composite numbers bigger than 26927"
] | [
null
] | {"ft_lang_label":"__label__en","ft_lang_prob":0.84833604,"math_prob":0.9205378,"size":531,"snap":"2019-13-2019-22","text_gpt3_token_len":147,"char_repetition_ratio":0.25426945,"word_repetition_ratio":0.11494253,"special_character_ratio":0.33898306,"punctuation_ratio":0.089108914,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.95886827,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2019-03-23T08:21:10Z\",\"WARC-Record-ID\":\"<urn:uuid:6d4a1473-37c4-4d39-a350-ab25eb7adb1e>\",\"Content-Length\":\"12629\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:2c13bcd2-8523-4e6d-8e16-c453d82d1fb9>\",\"WARC-Concurrent-To\":\"<urn:uuid:f8bdcc9e-49fe-4717-bfa3-7dffb86e743e>\",\"WARC-IP-Address\":\"104.197.145.71\",\"WARC-Target-URI\":\"https://www.isprimenumber.com/prime/26927\",\"WARC-Payload-Digest\":\"sha1:RGNGB2JAKPHKAKPLPT6SIA2AFVTZ724A\",\"WARC-Block-Digest\":\"sha1:N2LL3JNPDZQAVYETHCCVN2HZN2HPSHAD\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2019/CC-MAIN-2019-13/CC-MAIN-2019-13_segments_1552912202781.33_warc_CC-MAIN-20190323080959-20190323102959-00117.warc.gz\"}"} |
http://www.batesville.k12.in.us/physics/PhyNet/Mechanics/Newton1/ObjCh3Inertia.html | [
"# Physics - Chapter 4 Newtons First Law of Motion - Inertia Terms & Objectives",
null,
"",
null,
"",
null,
"",
null,
"",
null,
"BHS -> Mr. Stanbrough -> Physics -> Mechanics -> Newton's Laws -> Newton's First Law -> this page\n\nNote: The following terms and objectives are based on the Indiana Standards 2000 for Physics 1. You may download the complete physics standards by clicking here, or view the standards relevant to Chapter 4 - Newton's First Law here.\n\n## New Terms in Chapter 4:\n\n accelerating reference frame inertia Newton (unit) fictitious force kilogram Newton's First Law force Law of Inertia violent motion friction equilibrium static equilibrium inertial reference frame natural motion support force heliocentric solar system geocentric solar system normal force net force\n\n## Chapter 4 Objectives:\n\nAfter completing Chapter 4, you should be able to:\n\n1. ... define force.\n2. ...find the net force acting on an object if:\n1. no forces push/pull on it.\n2. 1 force pushes/pulls on it.\n3. 2 forces push/pull on it in the same direction.\n4. 2 forces push/pull on it in opposite directions.\n3. ... state Newton's First Law.\n4. ... define inertia.\n5. ... identify the conditions necessary for a body to be in equilibrium, and describe all of the forces acting on the body.\n6. ... correctly apply Newton's First Law and the concept of inertia to explain various motions, such as the motion of a person inside an accelerating car.\n\n## Possible Preconceptions to Correct:\n\nDo you believe that any of the following statements are true? They AREN'T! When you finish Chapter 4, you should understand that each of these statements is FALSE, and WHY it is false.",
null,
"",
null,
"",
null,
"",
null,
"",
null,
"BHS -> Mr. Stanbrough -> Physics -> Mechanics -> Newton's Laws -> Newton's First Law -> this page\n\nlast update October 15, 2009 by JL Stanbrough"
] | [
null,
"http://www.batesville.k12.in.us/physics/PhyNet/NavIcons/Prev.GIF",
null,
"http://www.batesville.k12.in.us/physics/PhyNet/NavIcons/Next.GIF",
null,
"http://www.batesville.k12.in.us/physics/PhyNet/NavIcons/Up.GIF",
null,
"http://www.batesville.k12.in.us/physics/PhyNet/NavIcons/Home.GIF",
null,
"http://www.batesville.k12.in.us/physics/PhyNet/NavIcons/Help.GIF",
null,
"http://www.batesville.k12.in.us/physics/PhyNet/NavIcons/Prev.GIF",
null,
"http://www.batesville.k12.in.us/physics/PhyNet/NavIcons/Next.GIF",
null,
"http://www.batesville.k12.in.us/physics/PhyNet/NavIcons/Up.GIF",
null,
"http://www.batesville.k12.in.us/physics/PhyNet/NavIcons/Home.GIF",
null,
"http://www.batesville.k12.in.us/physics/PhyNet/NavIcons/Help.GIF",
null
] | {"ft_lang_label":"__label__en","ft_lang_prob":0.8913592,"math_prob":0.7428063,"size":706,"snap":"2021-43-2021-49","text_gpt3_token_len":161,"char_repetition_ratio":0.13105413,"word_repetition_ratio":0.23140496,"special_character_ratio":0.25354108,"punctuation_ratio":0.10569106,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9838202,"pos_list":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20],"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],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2021-11-29T13:48:42Z\",\"WARC-Record-ID\":\"<urn:uuid:7c639215-f5f4-4899-8066-fe4abe6adfa5>\",\"Content-Length\":\"9038\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:174bb6d5-b863-400f-9550-4048a692ef12>\",\"WARC-Concurrent-To\":\"<urn:uuid:1be6eb43-9325-4fce-9ba9-2d852ab3c721>\",\"WARC-IP-Address\":\"69.16.250.147\",\"WARC-Target-URI\":\"http://www.batesville.k12.in.us/physics/PhyNet/Mechanics/Newton1/ObjCh3Inertia.html\",\"WARC-Payload-Digest\":\"sha1:CU5AGJ6ZB6IILLS3TSQA7YPQODIPFQ4U\",\"WARC-Block-Digest\":\"sha1:TFTBU5KUFPMMY5XW2L5SUL4CG5G2NVJI\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2021/CC-MAIN-2021-49/CC-MAIN-2021-49_segments_1637964358774.44_warc_CC-MAIN-20211129134323-20211129164323-00113.warc.gz\"}"} |
https://www.journaldev.com/26700/python-and-operator | [
"# Python AND Operator\n\nFiled Under: Python\n\nPython operators can be divided into multiple categories. Two of them are – bitwise operators and logical operators. Bitwise operator performs operations on integers in binary format whereas logical operators perform operations on boolean values.\n\n## Python AND Operator\n\nThere are two types of Python AND Operators.\n\n1. Bitwise AND Operator: It’s denoted by `&` and work with integers. The numbers are converted into binary format and bitwise AND operation is performed. Finally, the output is returned in the decimal format.\n2. Logical AND Operator: It’s denoted by `and` and work with boolean values. The output is boolean – either `True` or `False`.\n\n## Python Bitwise AND Operator Example\n\nLet’s look at an example of bitwise and operator. We will ask the user to enter two numbers and print their binary and operation output.\n\n``````\na = int(input('Please enter an integer:\\n'))\nb = int(input('Please enter another integer:\\n'))\n\nprint(f'{a} in binary is {str(bin(a))[2:]}')\nprint(f'{b} in binary is {str(bin(b))[2:]}')\nprint(f'Binary AND of {a} and {b} is {a&b}')\n``````\n\nOutput:",
null,
"Python And Operator – Bitwise\n\n## Python Logical AND Operator Example\n\nLet’s look at an example of logical and operator. We will ask the user to enter a single digit number and print if it’s positive or negative. If the user doesn’t enter single digit integer, then we will print it too.\n\n``````\nx = int(input('Please enter a single digit integer:\\n'))\n\nif x > 0 and x < 10:\nprint('You entered positive single digit number')\nelif x < 0 and x > -10:\nprint('You entered negative single digit number')\nelse:\nprint('You did not entered single digit integer')\n``````\n\nOutput:",
null,
"Python Logical And Operator\n\n## Summary\n\nPython provides a lot of operators to work with different kinds of data types. Here we learned how to use Python and operators with boolean and bitwise binary integers.\n\nYou can checkout complete python script and more Python examples from our GitHub Repository.\nclose\nGeneric selectors\nExact matches only\nSearch in title\nSearch in content\nSearch in posts\nSearch in pages"
] | [
null,
"https://cdn.journaldev.com/wp-content/uploads/2019/02/python-and-operator-bitwise-binary-integers.png",
null,
"https://cdn.journaldev.com/wp-content/uploads/2019/02/python-logical-and-operator.png",
null
] | {"ft_lang_label":"__label__en","ft_lang_prob":0.81557685,"math_prob":0.94199026,"size":1761,"snap":"2019-51-2020-05","text_gpt3_token_len":397,"char_repetition_ratio":0.15082528,"word_repetition_ratio":0.07801419,"special_character_ratio":0.2350937,"punctuation_ratio":0.08928572,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.98841876,"pos_list":[0,1,2,3,4],"im_url_duplicate_count":[null,2,null,2,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2020-01-19T12:45:01Z\",\"WARC-Record-ID\":\"<urn:uuid:ee3af733-add5-4d7f-8507-f3f1df43faa3>\",\"Content-Length\":\"164856\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:d3579680-0e6b-42e5-94cb-5243420f2d89>\",\"WARC-Concurrent-To\":\"<urn:uuid:05ea91fe-3709-479b-afd4-09769eec5df6>\",\"WARC-IP-Address\":\"3.95.122.236\",\"WARC-Target-URI\":\"https://www.journaldev.com/26700/python-and-operator\",\"WARC-Payload-Digest\":\"sha1:557DPHHTZL227F6SIUOVOZSV6KWM2RP2\",\"WARC-Block-Digest\":\"sha1:GSIDYS3HGPT44YNCHSNEMW2STGIHBIYI\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2020/CC-MAIN-2020-05/CC-MAIN-2020-05_segments_1579250594603.8_warc_CC-MAIN-20200119122744-20200119150744-00216.warc.gz\"}"} |
https://www.colorhexa.com/0c9a75 | [
"# #0c9a75 Color Information\n\nIn a RGB color space, hex #0c9a75 is composed of 4.7% red, 60.4% green and 45.9% blue. Whereas in a CMYK color space, it is composed of 92.2% cyan, 0% magenta, 24% yellow and 39.6% black. It has a hue angle of 164.4 degrees, a saturation of 85.5% and a lightness of 32.5%. #0c9a75 color hex could be obtained by blending #18ffea with #003500. Closest websafe color is: #009966.\n\n• R 5\n• G 60\n• B 46\nRGB color chart\n• C 92\n• M 0\n• Y 24\n• K 40\nCMYK color chart\n\n#0c9a75 color description : Dark cyan - lime green.\n\n# #0c9a75 Color Conversion\n\nThe hexadecimal color #0c9a75 has RGB values of R:12, G:154, B:117 and CMYK values of C:0.92, M:0, Y:0.24, K:0.4. Its decimal value is 825973.\n\nHex triplet RGB Decimal 0c9a75 `#0c9a75` 12, 154, 117 `rgb(12,154,117)` 4.7, 60.4, 45.9 `rgb(4.7%,60.4%,45.9%)` 92, 0, 24, 40 164.4°, 85.5, 32.5 `hsl(164.4,85.5%,32.5%)` 164.4°, 92.2, 60.4 009966 `#009966`\nCIE-LAB 56.557, -43.047, 9.976 14.917, 24.472, 20.766 0.248, 0.407, 24.472 56.557, 44.188, 166.952 56.557, -46.721, 20.138 49.469, -32.747, 9.74 00001100, 10011010, 01110101\n\n# Color Schemes with #0c9a75\n\n• #0c9a75\n``#0c9a75` `rgb(12,154,117)``\n• #9a0c31\n``#9a0c31` `rgb(154,12,49)``\nComplementary Color\n• #0c9a2e\n``#0c9a2e` `rgb(12,154,46)``\n• #0c9a75\n``#0c9a75` `rgb(12,154,117)``\n• #0c789a\n``#0c789a` `rgb(12,120,154)``\nAnalogous Color\n• #9a2e0c\n``#9a2e0c` `rgb(154,46,12)``\n• #0c9a75\n``#0c9a75` `rgb(12,154,117)``\n• #9a0c78\n``#9a0c78` `rgb(154,12,120)``\nSplit Complementary Color\n• #9a750c\n``#9a750c` `rgb(154,117,12)``\n• #0c9a75\n``#0c9a75` `rgb(12,154,117)``\n• #750c9a\n``#750c9a` `rgb(117,12,154)``\nTriadic Color\n• #319a0c\n``#319a0c` `rgb(49,154,12)``\n• #0c9a75\n``#0c9a75` `rgb(12,154,117)``\n• #750c9a\n``#750c9a` `rgb(117,12,154)``\n• #9a0c31\n``#9a0c31` `rgb(154,12,49)``\nTetradic Color\n• #06533f\n``#06533f` `rgb(6,83,63)``\n• #086b51\n``#086b51` `rgb(8,107,81)``\n• #0a8263\n``#0a8263` `rgb(10,130,99)``\n• #0c9a75\n``#0c9a75` `rgb(12,154,117)``\n• #0eb287\n``#0eb287` `rgb(14,178,135)``\n• #10c999\n``#10c999` `rgb(16,201,153)``\n• #12e1ab\n``#12e1ab` `rgb(18,225,171)``\nMonochromatic Color\n\n# Alternatives to #0c9a75\n\nBelow, you can see some colors close to #0c9a75. Having a set of related colors can be useful if you need an inspirational alternative to your original color choice.\n\n• #0c9a52\n``#0c9a52` `rgb(12,154,82)``\n• #0c9a5d\n``#0c9a5d` `rgb(12,154,93)``\n• #0c9a69\n``#0c9a69` `rgb(12,154,105)``\n• #0c9a75\n``#0c9a75` `rgb(12,154,117)``\n• #0c9a81\n``#0c9a81` `rgb(12,154,129)``\n• #0c9a8d\n``#0c9a8d` `rgb(12,154,141)``\n• #0c9a99\n``#0c9a99` `rgb(12,154,153)``\nSimilar Colors\n\n# #0c9a75 Preview\n\nText with hexadecimal color #0c9a75\n\nThis text has a font color of #0c9a75.\n\n``<span style=\"color:#0c9a75;\">Text here</span>``\n#0c9a75 background color\n\nThis paragraph has a background color of #0c9a75.\n\n``<p style=\"background-color:#0c9a75;\">Content here</p>``\n#0c9a75 border color\n\nThis element has a border color of #0c9a75.\n\n``<div style=\"border:1px solid #0c9a75;\">Content here</div>``\nCSS codes\n``.text {color:#0c9a75;}``\n``.background {background-color:#0c9a75;}``\n``.border {border:1px solid #0c9a75;}``\n\n# Shades and Tints of #0c9a75\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, #010806 is the darkest color, while #f5fefc is the lightest one.\n\n• #010806\n``#010806` `rgb(1,8,6)``\n• #021b14\n``#021b14` `rgb(2,27,20)``\n• #032d22\n``#032d22` `rgb(3,45,34)``\n• #053f30\n``#053f30` `rgb(5,63,48)``\n• #06513e\n``#06513e` `rgb(6,81,62)``\n• #08634c\n``#08634c` `rgb(8,99,76)``\n• #097659\n``#097659` `rgb(9,118,89)``\n• #0b8867\n``#0b8867` `rgb(11,136,103)``\n• #0c9a75\n``#0c9a75` `rgb(12,154,117)``\n• #0dac83\n``#0dac83` `rgb(13,172,131)``\n• #0fbe91\n``#0fbe91` `rgb(15,190,145)``\n• #10d19e\n``#10d19e` `rgb(16,209,158)``\n• #12e3ac\n``#12e3ac` `rgb(18,227,172)``\nShade Color Variation\n• #1bedb6\n``#1bedb6` `rgb(27,237,182)``\n• #2defbc\n``#2defbc` `rgb(45,239,188)``\n• #3ff0c2\n``#3ff0c2` `rgb(63,240,194)``\n• #51f1c8\n``#51f1c8` `rgb(81,241,200)``\n• #64f3ce\n``#64f3ce` `rgb(100,243,206)``\n• #76f4d3\n``#76f4d3` `rgb(118,244,211)``\n• #88f6d9\n``#88f6d9` `rgb(136,246,217)``\n• #9af7df\n``#9af7df` `rgb(154,247,223)``\n• #acf9e5\n``#acf9e5` `rgb(172,249,229)``\n• #bffaeb\n``#bffaeb` `rgb(191,250,235)``\n• #d1fbf0\n``#d1fbf0` `rgb(209,251,240)``\n• #e3fdf6\n``#e3fdf6` `rgb(227,253,246)``\n• #f5fefc\n``#f5fefc` `rgb(245,254,252)``\nTint Color Variation\n\n# Tones of #0c9a75\n\nA tone is produced by adding gray to any pure hue. In this case, #525453 is the less saturated color, while #06a078 is the most saturated one.\n\n• #525453\n``#525453` `rgb(82,84,83)``\n• #4c5a56\n``#4c5a56` `rgb(76,90,86)``\n• #456159\n``#456159` `rgb(69,97,89)``\n• #3f675d\n``#3f675d` `rgb(63,103,93)``\n• #396d60\n``#396d60` `rgb(57,109,96)``\n• #327463\n``#327463` `rgb(50,116,99)``\n• #2c7a66\n``#2c7a66` `rgb(44,122,102)``\n• #268069\n``#268069` `rgb(38,128,105)``\n• #1f876c\n``#1f876c` `rgb(31,135,108)``\n• #198d6f\n``#198d6f` `rgb(25,141,111)``\n• #129472\n``#129472` `rgb(18,148,114)``\n• #0c9a75\n``#0c9a75` `rgb(12,154,117)``\n• #06a078\n``#06a078` `rgb(6,160,120)``\nTone Color Variation\n\n# Color Blindness Simulator\n\nBelow, you can see how #0c9a75 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.58931506,"math_prob":0.6653302,"size":3700,"snap":"2019-13-2019-22","text_gpt3_token_len":1685,"char_repetition_ratio":0.122835495,"word_repetition_ratio":0.011049724,"special_character_ratio":0.56027025,"punctuation_ratio":0.23698781,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9811403,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2019-05-22T00:58:33Z\",\"WARC-Record-ID\":\"<urn:uuid:a6b02cdc-78d1-43d1-8543-4881b42ec688>\",\"Content-Length\":\"36427\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:380e3d4b-0fad-4bac-b016-d3f2f61a6c57>\",\"WARC-Concurrent-To\":\"<urn:uuid:7ef73f56-e14b-42fc-a619-4a6fb87d74ce>\",\"WARC-IP-Address\":\"178.32.117.56\",\"WARC-Target-URI\":\"https://www.colorhexa.com/0c9a75\",\"WARC-Payload-Digest\":\"sha1:FTBJTYRBKJSJHHQW6AFBR546WZAVYIIY\",\"WARC-Block-Digest\":\"sha1:FYZORGKC3GJNZREZMKZCOYF6NXS4TUER\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2019/CC-MAIN-2019-22/CC-MAIN-2019-22_segments_1558232256600.32_warc_CC-MAIN-20190522002845-20190522024845-00243.warc.gz\"}"} |
http://www.usaco.org/current/data/sol_necklace.html | [
"Analysis: Necklace by Jakub Pachocki\n\nAs it is often the case when counting the number of subsequences fulfilling some criteria, the solution to this problem uses dynamic programming. Assume the initial string representing Bessie's necklace is S, and that the other cow's name is T. For every i, we would like to compute the number of subsequences of S[1..i] that do not contain T. This information is not enough to maintain by itself, so we need to split our state some more. One possibility would be remembering the last |T| - 1 letters of our chosen subsequence; that is something we would be able to update upon adding one letter, and it would also allow us to determine whether we contain T as a substring.\n\nUnfortunately, the number of states in the proposed approach is exponential in |T|, and thus far too large for our needs. Maybe we do not really care what the last |T| - 1 letters are exactly? In fact, it would be enough to know how 'similar' they are to T. The correct measure of similarity here is the longest suffix of these letters that is also some prefix of T. This is also information that we can maintain upon state transition, and it also allows us to determine whether the chosen subsequence contains T as a substring.\n\nTo speed up the state transitions, it may be useful to precompute which prefix of T we contain after matching T[1..j] and adding any letter c. This gives us A * |T| state transitions, where A = 26 is the size of the alphabet. The total running of our solution is thus O(A * |T| * |T| + |S| * |T|), if we just precompute the transitions naively. Although that is fast enough, it is actually just as easy to precompute the transitions with DP, reducing the complexity to O(A * |T| + |T| * |S|). A sample implementation follows.\n\n```/*\nLANG: C++\n*/\n\n#include <iostream>\n#include <fstream>\n#include <algorithm>\n#include <vector>\n#include <string>\n\nusing namespace std;\n\nint main() {\nifstream in;\nofstream out;\nin.open(\"necklace.in\");\nout.open(\"necklace.out\");\n\nstring text, pattern;\nin >> text >> pattern;\n\nint n = text.size();\nint m = pattern.size();\n\nfor (int i = 0; i < n; ++i) {\ntext[i] -= 'a';\n}\n\nfor (int i = 0; i < m; ++i) {\npattern[i] -= 'a';\n}\n\nvector<vector<int> > next(m, vector<int>(26, 0));\n\nfor (int i = 1; i < m; ++i) {\nint prev = next[i - 1][pattern[i - 1]];\nnext[i - 1][pattern[i - 1]] = i;\nfor (int j = 0; j < 26; ++j) {\nnext[i][j] = next[prev][j];\n}\n}\nnext[m - 1][pattern[m - 1]] = m;\n\nvector<int> max_taken(m, -n - 1);\nmax_taken = 0;\nfor (int i = 0; i < n; ++i) {\nvector<int> next_taken = max_taken;\nfor (int j = 0; j < m; ++j) {\nint cur = next[j][text[i]];\nif (cur < m) {\nnext_taken[cur] = max(next_taken[cur], max_taken[j] + 1);\n}\n}\nmax_taken = next_taken;\n}\n\nint result = 0;\nfor (int i = 0; i < m; ++i) {\nresult = max(result, max_taken[i]);\n}\n\nout << n - result << endl;\n\nin.close();\nout.close();\n}\n```"
] | [
null
] | {"ft_lang_label":"__label__en","ft_lang_prob":0.83428794,"math_prob":0.9882266,"size":2843,"snap":"2019-13-2019-22","text_gpt3_token_len":800,"char_repetition_ratio":0.10003522,"word_repetition_ratio":0.07471264,"special_character_ratio":0.31902918,"punctuation_ratio":0.1539763,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.99476177,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2019-03-26T03:55:03Z\",\"WARC-Record-ID\":\"<urn:uuid:a9b30324-8a42-4e09-8f7c-feca72431e7a>\",\"Content-Length\":\"4027\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:69b5182b-8222-4bd4-bb12-1a1183c0647f>\",\"WARC-Concurrent-To\":\"<urn:uuid:f2808374-a8c8-44c4-9249-87207ef1b565>\",\"WARC-IP-Address\":\"130.127.215.7\",\"WARC-Target-URI\":\"http://www.usaco.org/current/data/sol_necklace.html\",\"WARC-Payload-Digest\":\"sha1:UZQITXXXKE543LMRTOYFJHJVPFURRLEC\",\"WARC-Block-Digest\":\"sha1:RELG7JRUXOIR5EKWMO7BLQFPBWD4SG54\",\"WARC-Identified-Payload-Type\":\"application/xhtml+xml\",\"warc_filename\":\"/cc_download/warc_2019/CC-MAIN-2019-13/CC-MAIN-2019-13_segments_1552912204790.78_warc_CC-MAIN-20190326034712-20190326060712-00407.warc.gz\"}"} |
https://effort.academickids.com/encyclopedia/index.php/Gravity | [
"# Gravity\n\nThe popular model of general relativity, as causing a flat surface like a rubber sheet to curve into a manifold is unhelpful to further progress in unifying quantum space with gravitation, since physical space fills volume, not surface area. This obvious fact is obfuscated by jargon in physics! Instead of 11 dimensional and multiple universe speculation (http://www.math.columbia.edu/~woit/blog/), consider what physics can do with experimentally-proved properties of space: real space is in physics as electric impedance (mc = 377 ohms for a vacuum, allowing radio transmission), electric permittivity, magnetic permeability (m), it forms a vacuum foam and causes particle-wave duality (Dirac space sea).\n\nFact 1: the big bang is receding galaxies with observable speed increasing linearly with time past, v/t = constant acceleration\n\nFact 2: by Newtons 2nd empirical law, F = ma, the mass of the galaxies times acceleration is outward force of the big bang\n\nFact 3: by Newtons 3rd empirical law, forces have equal and opposite reaction: so equal inward force is proved, thus gravity\n\nThis inward force is carried by the fabric of space around accelerating matter, so the inward pressure (force/area) gives rise to the inverse-square law of gravity (see illustrations), causing gravitation where shielded by mass (http://cdsweb.cern.ch/search.py?recid=706468&ln=en).\n\nIn many interesting situations
the source of the gravitational field can be taken to be a perfect fluid
. A fluid is a continuum that flows... A perfect fluid is defined as one in which all antislipping forces are zero, and the only force between neighboring fluid elements is pressure. Bernard Schutz, General Relativity, Cambridge University Press, 1986, pp. 89-90.\n\nThe correct force of gravity is proved below: F = mMG/r2, where G = (3/4) H2/( p r local e3 ) = 0.0119H2/r local = 6.7 x 10-11 Nm2kg-2. This is not speculative: all 3 facts above are hard experimental results. Electromagnetism and nuclear forces are well-known energy exchange processes, but gravity is not.\n\n• Art and Cultures\n• Countries of the World (http://www.academickids.com/encyclopedia/index.php/Countries)\n• Space and Astronomy"
] | [
null
] | {"ft_lang_label":"__label__en","ft_lang_prob":0.8796769,"math_prob":0.96803707,"size":2085,"snap":"2021-21-2021-25","text_gpt3_token_len":493,"char_repetition_ratio":0.086496875,"word_repetition_ratio":0.0,"special_character_ratio":0.2321343,"punctuation_ratio":0.13636364,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.982163,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2021-05-11T01:21:46Z\",\"WARC-Record-ID\":\"<urn:uuid:4a309e62-7724-48f2-b68e-6ece0352f9dd>\",\"Content-Length\":\"24375\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:5c8aea76-f5ee-4897-aca9-1816d9af05e0>\",\"WARC-Concurrent-To\":\"<urn:uuid:51abbd61-c742-499a-850d-35eea2662195>\",\"WARC-IP-Address\":\"108.59.0.28\",\"WARC-Target-URI\":\"https://effort.academickids.com/encyclopedia/index.php/Gravity\",\"WARC-Payload-Digest\":\"sha1:OAE3TFKNZQOXHKFXWO7UFFSLL5SUW4HB\",\"WARC-Block-Digest\":\"sha1:UYZZBZGVS2FSC4L2OMLY4FTOGUMRVTEP\",\"WARC-Identified-Payload-Type\":\"application/xhtml+xml\",\"warc_filename\":\"/cc_download/warc_2021/CC-MAIN-2021-21/CC-MAIN-2021-21_segments_1620243991553.4_warc_CC-MAIN-20210510235021-20210511025021-00354.warc.gz\"}"} |
https://ftp.aimsciences.org/journal/1930-5311/2017/11/0 | [
"",
null,
"",
null,
"",
null,
"",
null,
"",
null,
"ISSN:\n1930-5311\n\neISSN:\n1930-532X\n\n## Journal Home\n\n• Open Access Articles",
null,
"All Issues\n\n## Journal of Modern Dynamics\n\n2017 , Volume 11\n\nSelect all articles\n\nExport/Reference:\n\n2017, 11: 1-16 doi: 10.3934/jmd.2017001 +[Abstract](5670) +[HTML](134) +[PDF](186.6KB)\nAbstract:\n\nWe prove analogs of the logarithm laws of Sullivan and KleinbockMargulis in the context of unipotent flows. In particular, we prove results for horospherical actions on homogeneous spaces G/Γ.\n\n2017, 11: 17-41 doi: 10.3934/jmd.2017002 +[Abstract](4071) +[HTML](117) +[PDF](255.8KB)\nAbstract:\n\nWe compute the algebraic equation of the universal family over the Kenyon-Smillie (2, 3, 4)-Teichmüller curve, and we prove that the equation is correct in two different ways. Firstly, we prove it in a constructive way via linear conditions imposed by three special points of the Teichmüller curve. Secondly, we verify that the equation is correct by computing its associated Picard-Fuchs equation. We also notice that each point of the Teichmüller curve has a hyperflex and we see that the torsion map is a central projection from this point.\n\n2017, 11: 43-56 doi: 10.3934/jmd.2017003 +[Abstract](4098) +[HTML](81) +[PDF](196.7KB)\nAbstract:\n\nThe celebrated KAM theory says that if one makes a small perturbation of a non-degenerate completely integrable system, we still see a huge measure of invariant tori with quasi-periodic dynamics in the perturbed system. These invariant tori are known as KAM tori. What happens outside KAM tori draws a lot of attention. In this paper we present a Lagrangian perturbation of the geodesic flow on a flat 3-torus. The perturbation is $C^\\infty$ small but the flow has a positive measure of trajectories with positive Lyapunov exponent. The measure of this set is of course extremely small. Still, the flow has positive metric entropy. From this result we get positive metric entropy outside some KAM tori.\n\n2017, 11: 57-98 doi: 10.3934/jmd.2017004 +[Abstract](5314) +[HTML](101) +[PDF](388.2KB)\nAbstract:\n\nIn the moduli space of degree $d$ polynomials, we prove the equidistribution of postcritically finite polynomials toward the bifurcation measure. More precisely, using complex analytic arguments and pluripotential theory, we prove the exponential speed of convergence for $\\mathscr{C}^2$-observables. This improves results obtained with arithmetic methods by Favre and Rivera-Letellier in the unicritical family and Favre and the first author in the space of degree $d$ polynomials.\n\nWe deduce from that the equidistribution of hyperbolic parameters with $(d-1)$ distinct attracting cycles of given multipliers toward the bifurcation measure with exponential speed for $\\mathscr{C}^1$-observables. As an application, we prove the equidistribution (up to an explicit extraction) of parameters with $(d-1)$ distinct cycles with prescribed multiplier toward the bifurcation measure for any $(d-1)$ multipliers outside a pluripolar set.\n\n2017, 11: 99-123 doi: 10.3934/jmd.2017005 +[Abstract](3964) +[HTML](92) +[PDF](282.7KB)\nAbstract:\n\nIn this paper we investigate relations between Koopman, groupoid and quasi-regular representations of countable groups. We show that for an ergodic measure class preserving action of a countable group G on a standard Borel space the associated groupoid and quasi-regular representations are weakly equivalent and weakly contained in the Koopman representation. Moreover, if the action is hyperfinite then the Koopman representation is weakly equivalent to the groupoid. As a corollary of our results we obtain a continuum of pairwise disjoint pairwise equivalent irreducible representations of weakly branch groups. As an illustration we calculate spectra of regular, Koopman and groupoid representations associated to the action of the 2-group of intermediate growth constructed by the second author in 1980.\n\n2017, 11: 125-142 doi: 10.3934/jmd.2017006 +[Abstract](3854) +[HTML](84) +[PDF](223.8KB)\nAbstract:\n\nWe study close-to-constants quasiperiodic cocycles in \\begin{document} $\\mathbb{T} ^{d} \\times G$ \\end{document}, where \\begin{document} $d \\in \\mathbb{N} ^{*}$ \\end{document} and \\begin{document} $G$ \\end{document} is a compact Lie group, under the assumption that the rotation in the basis satisfies a Diophantine condition. We prove differentiable rigidity for such cocycles: if such a cocycle is measurably conjugate to a constant one satisfying a Diophantine condition with respect to the rotation, then it is \\begin{document} $C^{\\infty}$ \\end{document}-conjugate to it, and the KAM scheme actually produces a conjugation. We also derive a global differentiable rigidity theorem, assuming the convergence of the renormalization scheme for such dynamical systems.\n\n2017, 11: 143-153 doi: 10.3934/jmd.2017007 +[Abstract](5012) +[HTML](117) +[PDF](183.1KB)\nAbstract:\n\nWe give upper and lower bounds for Diophantine exponents measuring how well a point in the plane can be approximated by points in the orbit of a lattice \\begin{document}$\\Gamma < {\\rm{S}}{{\\rm{L}}_2}\\left( {\\mathbb{R}} \\right)$\\end{document} acting linearly on \\begin{document}${\\mathbb{R}^2}$\\end{document}. Our method gives bounds that are uniform for almost all orbits.\n\n2017, 11: 155-188 doi: 10.3934/jmd.2017008 +[Abstract](2572) +[HTML](94) +[PDF](326.2KB)\nAbstract:\n\nLet \\begin{document}$\\Gamma$\\end{document} be a lattice in \\begin{document}$G=\\mathrm{SL}(2, \\mathbb{C})$\\end{document}. We give an effective equidistribution result with precise error terms for expanding translates of pieces of horospherical orbits in \\begin{document}$\\Gamma\\backslash G$\\end{document}. Our method of proof relies on the theory of unitary representations.\n\n2017, 11: 189-217 doi: 10.3934/jmd.2017009 +[Abstract](5312) +[HTML](122) +[PDF](386.4KB)\nAbstract:\n\nConsider a general circle packing \\begin{document}$\\mathscr{P}$\\end{document} in the complex plane \\begin{document}$\\mathbb{C}$\\end{document} invariant under a Kleinian group \\begin{document}$\\Gamma$\\end{document}. When \\begin{document}$\\Gamma$\\end{document} is convex cocompact or its critical exponent is greater than 1, we obtain an effective equidistribution for small circles in \\begin{document}$\\mathscr{P}$\\end{document} intersecting any bounded connected regular set in \\begin{document}$\\mathbb{C}$\\end{document}; this provides an effective version of an earlier work of Oh-Shah . In view of the recent result of McMullen-Mohammadi-Oh , our effective circle counting theorem applies to the circles contained in the limit set of a convex cocompact but non-cocompact Kleinian group whose limit set contains at least one circle. Moreover, consider the circle packing \\begin{document}$\\mathscr{P}(\\mathscr{T})$\\end{document} of the ideal triangle attained by filling in largest inner circles. We give an effective estimate to the number of disks whose hyperbolic areas are greater than \\begin{document}$t$\\end{document}, as \\begin{document}$t\\to0$\\end{document}, effectivizing the work of Oh .\n\n2017, 11: 219-248 doi: 10.3934/jmd.2017010 +[Abstract](4820) +[HTML](96) +[PDF](685.9KB)\nAbstract:\n\nIt is known since a 40-year-old paper by M.Keane that minimality is a generic (i.e., holding with probability one) property of an irreducible interval exchange transformation. If one puts some integral linear restrictions on the parameters of the interval exchange transformation, then minimality may become an \"exotic\" property. We conjecture in this paper that this occurs if and only if the linear restrictions contain a Lagrangian subspace of the first homology of the suspension surface. We partially prove it in the `only if' direction and provide a series of examples to support the converse one. We show that the unique ergodicity remains a generic property if the restrictions on the parameters do not contain a Lagrangian subspace (this result is due to Barak Weiss).\n\n2017, 11: 249-262 doi: 10.3934/jmd.2017011 +[Abstract](3523) +[HTML](83) +[PDF](183.8KB)\nAbstract:\n\nLet \\begin{document}$T$\\end{document} be an \\begin{document}$m$\\end{document}-interval exchange transformation. By the rank of \\begin{document}$T$\\end{document} we mean the dimension of the \\begin{document}$\\mathbb{Q}$\\end{document}-vector space spanned by the lengths of the exchanged intervals. We prove that if \\begin{document}$T$\\end{document} is minimal and the rank of \\begin{document}$T$\\end{document} is greater than \\begin{document}$1+\\lfloor m/2 \\rfloor$\\end{document}, then \\begin{document}$T$\\end{document} cannot be written as a power of another interval exchange. We also demonstrate that this estimate on the rank cannot be improved.\n\nIn the case that \\begin{document}$T$\\end{document} is a minimal 3-interval exchange transformation, we prove a stronger result: \\begin{document}$T$\\end{document} cannot be written as a power of another interval exchange if and only if \\begin{document}$T$\\end{document} satisfies Keane's infinite distinct orbit condition. In the course of proving this result, we give a classification (up to conjugacy) of those minimal interval exchange transformations whose discontinuities all belong to a single orbit.\n\n2017, 11: 263-312 doi: 10.3934/jmd.2017012 +[Abstract](4112) +[HTML](89) +[PDF](456.5KB)\nAbstract:\n\nWe show that genuinely higher rank expanding actions of abelian semigroups on compact manifolds are \\begin{document}$C.{\\infty}$\\end{document}-conjugate to affine actions on infra-nilmanifolds. This is based on the classification of expanding diffeomorphisms up to Hölder conjugacy by Gromov and Shub, and is similar to recent work on smooth classification of higher rank Anosov actions on tori and nilmanifolds. To prove regularity of the conjugacy in the higher rank setting, we establish exponential mixing of solenoid actions induced from semigroup actions by nilmanifold endomorphisms, a result of independent interest. We then proceed similar to the case of higher rank Anosov actions.\n\n2017, 11: 313-339 doi: 10.3934/jmd.2017013 +[Abstract](5570) +[HTML](107) +[PDF](425.1KB)\nAbstract:\n\nThe first author introduced a relative symplectic capacity \\begin{document}$C$\\end{document} for a symplectic manifold \\begin{document}$(N,\\omega_N)$\\end{document} and its subset \\begin{document}$X$\\end{document} which measures the existence of non-contractible periodic trajectories of Hamiltonian isotopies on the product of \\begin{document}$N$\\end{document} with the annulus \\begin{document}$A_R=(-R,R)\\times\\mathbb{R}/\\mathbb{Z}$\\end{document}. In the present paper, we give an exact computation of the capacity \\begin{document}$C$\\end{document} of the \\begin{document}$2n$\\end{document}-torus \\begin{document}$\\mathbb{T}^{2n}$\\end{document} relative to a Lagrangian submanifold \\begin{document}$\\mathbb{T}^n$\\end{document} which implies the existence of non-contractible Hamiltonian periodic trajectories on \\begin{document}$A_R\\times\\mathbb{T}^{2n}$\\end{document}. Moreover, we give a lower bound on the number of such trajectories.\n\n2017, 11: 341-368 doi: 10.3934/jmd.2017014 +[Abstract](4008) +[HTML](82) +[PDF](287.0KB)\nAbstract:\n\nLet \\begin{document}$f$\\end{document} be a measure-preserving transformation of a Lebesgue space \\begin{document}$(X,\\mu)$\\end{document} and let \\begin{document}${\\mathscr{F}}$\\end{document} be its extension to a bundle \\begin{document}$\\mathscr{E} = X \\times {\\mathbb{R}}^m$\\end{document} by smooth fiber maps \\begin{document}${\\mathscr{F}}_x : {\\mathscr{E}}_x \\to {\\mathscr{E}}_{fx}$\\end{document} so that the derivative of \\begin{document}${\\mathscr{F}}$\\end{document} at the zero section has negative Lyapunov exponents. We construct a measurable system of smooth coordinate changes \\begin{document}${\\mathscr{H}}_x$\\end{document} on \\begin{document}${\\mathscr{E}}_x$\\end{document} for \\begin{document}$\\mu$\\end{document}-a.e. \\begin{document}$x$\\end{document} so that the maps \\begin{document}${\\mathscr{P}}_x ={\\mathscr{H}}_{fx} \\circ {\\mathscr{F}}_x \\circ {\\mathscr{H}}_x^{-1}$\\end{document} are sub-resonance polynomials in a finite dimensional Lie group. Our construction shows that such \\begin{document}${\\mathscr{H}}_x$\\end{document} and \\begin{document}${\\mathscr{P}}_x$\\end{document} are unique up to a sub-resonance polynomial. As a consequence, we obtain the centralizer theorem that the coordinate change \\begin{document}$\\mathscr{H}$\\end{document} also conjugates any commuting extension to a polynomial extension of the same type. We apply our results to a measure-preserving diffeomorphism \\begin{document}$f$\\end{document} with a non-uniformly contracting invariant foliation \\begin{document}$W$\\end{document}. We construct a measurable system of smooth coordinate changes \\begin{document}${\\mathscr{H}}_x: W_x \\to T_xW$\\end{document} such that the maps \\begin{document}${\\mathscr{H}}_{fx} \\circ f \\circ {\\mathscr{H}}_x^{-1}$\\end{document} are polynomials of sub-resonance type. Moreover, we show that for almost every leaf the coordinate changes exist at each point on the leaf and give a coherent atlas with transition maps in a finite dimensional Lie group.\n\n2017, 11: 369-407 doi: 10.3934/jmd.2017015 +[Abstract](3869) +[HTML](99) +[PDF](1611.2KB)\nAbstract:\n\nWe show that in positive characteristic the homogeneous probability measure supported on a periodic orbit of the diagonal group in the space of \\begin{document}$2$\\end{document}-lattices, when varied along rays of Hecke trees, may behave in sharp contrast to the zero characteristic analogue: For a large set of rays, the measures fail to converge to the uniform probability measure on the space of \\begin{document}$2$\\end{document}-lattices. More precisely, we prove that when the ray is rational there is uniform escape of mass, that there are uncountably many rays giving rise to escape of mass, and that there are rays along which the measures accumulate on measures which are not absolutely continuous with respect to the uniform measure on the space of \\begin{document}$2$\\end{document}-lattices.\n\n2017, 11: 409-423 doi: 10.3934/jmd.2017016 +[Abstract](3414) +[HTML](168) +[PDF](358.22KB)\nAbstract:\n\nThe deformation space of a branched cover \\begin{document}$f:(S^2,A)\\to (S^2,B)$\\end{document} is a complex submanifold of a certain Teichmüller space, which consists of classes of marked rational maps \\begin{document}$F:(\\mathbb{P}^1,A')\\to (\\mathbb{P}^1,B')$\\end{document} that are combinatorially equivalent to \\begin{document}$f$\\end{document}. In the case \\begin{document}$A=B$\\end{document}, under a mild assumption on \\begin{document}$f$\\end{document}, William Thurston gave a topological criterion for which the deformation space of \\begin{document}$f:(S^2,A)\\to (S^2,B)$\\end{document} is nonempty, and he proved that it is always connected. We show that if \\begin{document}$A\\subsetneq B$\\end{document}, then the deformation space need not be connected. We exhibit a family of quadratic rational maps for which the associated deformation spaces are disconnected; in fact, each has infinitely many components.\n\n2017, 11: 425-445 doi: 10.3934/jmd.2017017 +[Abstract](3699) +[HTML](173) +[PDF](264.84KB)\nAbstract:\n\nFor area preserving C2 surface diffeomorphisms, we give an explicit finite information condition on the exponential growth of the number of Bowen's (n, δ)-balls needed to cover a positive proportion of the space, that is sufficient to guarantee positive topological entropy. This can be seen as an effective version of Katok's horseshoe theorem in the conservative setting. We also show that the analogous result is false in dimension larger than 3.\n\n2017, 11: 447-476 doi: 10.3934/jmd.2017018 +[Abstract](3488) +[HTML](131) +[PDF](312.47KB)\nAbstract:\n\nWe prove logarithm laws for unipotent flows on non-compact finite-volume hyperbolic manifolds. Our method depends on the estimate of norms of certain incomplete Eisenstein series.\n\n2017, 11: 477-499 doi: 10.3934/jmd.2017019 +[Abstract](3285) +[HTML](165) +[PDF](632.75KB)\nAbstract:\n\nWe prove the existence and some properties of the limiting gap distribution for the directions of some Schottky group orbits in the Poincaré disk. A key feature is that the fundamental domains for these groups have infinite area.\n\n2017, 11: 501-550 doi: 10.3934/jmd.2017020 +[Abstract](3140) +[HTML](148) +[PDF](464.61KB)\nAbstract:\n\nWe prove an analogue of a theorem of Eskin-Margulis-Mozes . Suppose we are given a finite set of places \\begin{document} $S$ \\end{document} over \\begin{document} ${\\mathbb{Q}}$ \\end{document} containing the Archimedean place and excluding the prime \\begin{document} $2$ \\end{document}, an irrational isotropic form \\begin{document} ${\\mathbf q}$ \\end{document} of rank \\begin{document} $n\\geq 4$ \\end{document} on \\begin{document} ${\\mathbb{Q}}_S$ \\end{document}, a product of \\begin{document} $p$ \\end{document}-adic intervals \\begin{document} $\\mathsf{I}_p$ \\end{document}, and a product \\begin{document} $\\Omega$ \\end{document} of star-shaped sets. We show that unless \\begin{document} $n=4$ \\end{document} and \\begin{document} ${\\mathbf q}$ \\end{document} is split in at least one place, the number of \\begin{document} $S$ \\end{document}-integral vectors \\begin{document} $\\mathbf v \\in {\\mathsf{T}} \\Omega$ \\end{document} satisfying simultaneously \\begin{document} ${\\mathbf q}(\\mathbf v) \\in I_p$ \\end{document} for \\begin{document} $p \\in S$ \\end{document} is asymptotically given by\n\n\\begin{document}$\\begin{split}\\lambda({\\mathbf q}, \\Omega) |\\,\\mathsf{I}\\,| \\cdot \\| {\\mathsf{T}} \\|^{n-2}\\end{split}$ \\end{document}\n\nas \\begin{document} ${\\mathsf{T}}$ \\end{document} goes to infinity, where \\begin{document} $|\\,\\mathsf{I}\\,|$ \\end{document} is the product of Haar measures of the \\begin{document} $p$ \\end{document}-adic intervals \\begin{document} $I_p$ \\end{document}. The proof uses dynamics of unipotent flows on \\begin{document} $S$ \\end{document}-arithmetic homogeneous spaces; in particular, it relies on an equidistribution result for certain translates of orbits applied to test functions with a controlled growth at infinity, specified by an \\begin{document} $S$ \\end{document}-arithmetic variant of the \\begin{document} $\\alpha$ \\end{document}-function introduced in , and an \\begin{document} $S$ \\end{document}-arithemtic version of a theorem of Dani-Margulis .\n\n2017, 11: 551-562 doi: 10.3934/jmd.2017021 +[Abstract](3369) +[HTML](208) +[PDF](163.67KB)\nAbstract:\n\nWe consider densities \\begin{document}$D_\\Sigma(A)$\\end{document}, \\begin{document}$\\overline{D}_\\Sigma(A)$\\end{document} and \\begin{document}$\\underline{D}_\\Sigma(A)$\\end{document} for a subset \\begin{document}$A$\\end{document} of \\begin{document}$\\mathbb{N}$\\end{document} with respect to a sequence \\begin{document}$\\Sigma$\\end{document} of finite subsets of \\begin{document}$\\mathbb{N}$\\end{document} and study Fourier coefficients of ergodic, weakly mixing and strongly mixing \\begin{document}$\\times p$\\end{document}-invariant measures on the unit circle \\begin{document}$\\mathbb{T}$\\end{document}. Combining these, we prove the following measure rigidity results: on \\begin{document}$\\mathbb{T}$\\end{document}, the Lebesgue measure is the only non-atomic \\begin{document}$\\times p$\\end{document}-invariant measure satisfying one of the following: (1) \\begin{document}$\\mu$\\end{document} is ergodic and there exist a Følner sequence \\begin{document}$\\Sigma$\\end{document} in \\begin{document}$\\mathbb{N}$\\end{document} and a nonzero integer \\begin{document}$l$\\end{document} such that \\begin{document}$\\mu$\\end{document} is \\begin{document}$\\times (p^j+l)$\\end{document}-invariant for all \\begin{document}$j$\\end{document} in a subset \\begin{document}$A$\\end{document} of \\begin{document}$\\mathbb{N}$\\end{document} with \\begin{document}$D_\\Sigma(A)=1$\\end{document}; (2) \\begin{document}$\\mu$\\end{document} is weakly mixing and there exist a Følner sequence \\begin{document}$\\Sigma$\\end{document} in \\begin{document}$\\mathbb{N}$\\end{document} and a nonzero integer \\begin{document}$l$\\end{document} such that \\begin{document}$\\mu$\\end{document} is \\begin{document}$\\times (p^j+l)$\\end{document}-invariant for all \\begin{document}$j$\\end{document} in a subset \\begin{document}$A$\\end{document} of \\begin{document}$\\mathbb{N}$\\end{document} with \\begin{document}$\\overline{D}_\\Sigma(A)>0$\\end{document}; (3) \\begin{document}$\\mu$\\end{document} is strongly mixing and there exists a nonzero integer \\begin{document}$l$\\end{document} such that \\begin{document}$\\mu$\\end{document} is \\begin{document}$\\times (p^j+l)$\\end{document}-invariant for infinitely many \\begin{document}$j$\\end{document}. Moreover, a \\begin{document}$\\times p$\\end{document}-invariant measure satisfying (2) or (3) is either a Dirac measure or the Lebesgue measure.\n\nAs an application we prove that for every increasing function \\begin{document}$\\tau$\\end{document} defined on positive integers with \\begin{document}$\\lim_{n\\to\\infty}\\tau(n)=\\infty$\\end{document}, there exists a multiplicative semigroup \\begin{document}$S_\\tau$\\end{document} of \\begin{document}$\\mathbb{Z}^+$\\end{document} containing \\begin{document}$p$\\end{document} such that \\begin{document}$|S_\\tau\\cap[1,n]|\\leq (\\log_p n)^{\\tau(n)}$\\end{document} and the Lebesgue measure is the only non-atomic ergodic \\begin{document}$\\!\\times \\!p$\\end{document}-invariant measure which is \\begin{document}$\\times q$\\end{document}-invariant for all \\begin{document}$q$\\end{document} in \\begin{document}$S_\\tau$\\end{document}.\n\n2017, 11: 563-588 doi: 10.3934/jmd.2017022 +[Abstract](4919) +[HTML](172) +[PDF](277.58KB)\nAbstract:\n\nWe show that Masur's logarithmic law of geodesics in the moduli space of translation surfaces does not imply unique ergodicity of the translation flow, but that a similar law involving the flat systole of a Teichmüller geodesic does imply unique ergodicity. It shows that the flat geometry has a better control on ergodic properties of translation flow than hyperbolic geometry.\n\n2020 Impact Factor: 0.848\n5 Year Impact Factor: 0.815\n2020 CiteScore: 0.9"
] | [
null,
"https://ftp.aimsciences.org:443/style/web/images/white_google.png",
null,
"https://ftp.aimsciences.org:443/style/web/images/white_facebook.png",
null,
"https://ftp.aimsciences.org:443/style/web/images/white_twitter.png",
null,
"https://ftp.aimsciences.org:443/style/web/images/white_linkedin.png",
null,
"https://ftp.aimsciences.org/fileAIMS/journal/img/cover/coverJMD_ad.png",
null,
"https://ftp.aimsciences.org:443/style/web/images/OA.png",
null
] | {"ft_lang_label":"__label__en","ft_lang_prob":0.8785081,"math_prob":0.9865323,"size":6261,"snap":"2021-43-2021-49","text_gpt3_token_len":1379,"char_repetition_ratio":0.11539076,"word_repetition_ratio":0.0020811656,"special_character_ratio":0.18798915,"punctuation_ratio":0.0679702,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9986996,"pos_list":[0,1,2,3,4,5,6,7,8,9,10,11,12],"im_url_duplicate_count":[null,null,null,null,null,null,null,null,null,null,null,null,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2021-10-21T12:19:42Z\",\"WARC-Record-ID\":\"<urn:uuid:11e63fc3-e924-452c-8c6f-f59897554bfe>\",\"Content-Length\":\"155897\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:e88f0978-5c7e-46dd-a5ca-9b35946d9058>\",\"WARC-Concurrent-To\":\"<urn:uuid:fec0dce5-ac79-4844-97d6-a641961ff84c>\",\"WARC-IP-Address\":\"107.161.80.18\",\"WARC-Target-URI\":\"https://ftp.aimsciences.org/journal/1930-5311/2017/11/0\",\"WARC-Payload-Digest\":\"sha1:CTFGYIUFKYYLT2T6YSLZSEU53KKXRQGV\",\"WARC-Block-Digest\":\"sha1:VE2SOGAYOO77BLDY4WMZCCCKJSEWAWVV\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2021/CC-MAIN-2021-43/CC-MAIN-2021-43_segments_1634323585405.74_warc_CC-MAIN-20211021102435-20211021132435-00202.warc.gz\"}"} |
https://www.prepbytes.com/blog/cpp-programming/factorial-program-in-cpp/ | [
"# Factorial Program in C++",
null,
"In this article, we will discuss what is a factorial number, and what is its logic to implement it in C++. We will look and see multiple approaches to implement factorial programs.\nFirstly, let’s see what a Factorial Number is?\n\n## Factorial Number\n\nCalculation of factorial numbers is simple mathematics. The factorial of a number is 1 2 3 number.\nFor Example, factorial 6 is\n6! = 1 2 3 4 5 * 6 = 720.\n\n## Explanation of Program\n\nLet’s create a factorial program using recursive functions. Until the value is not equal to zero, the recursive function will call itself.\nFactorial can be calculated using the following recursive formula:\nn! = n * (n – 1)!\nn! = 1 if n = 0 or n = 1\n\n### Approach 1: (Using Recursion)\n\n1. Build a recursive function factorial which takes an integer n as a parameter and returns an unsigned integer as the output.\n2. If n ==0 or n==1, then return 1.\n3. Else return n * factorial(n – 1).\n\nCode Implementation (Using Recursion)\n\n```#include <iostream>\nusing namespace std;\n\nunsigned int factorial(unsigned int n)\n{\nif (n == 0 || n == 1)\nreturn 1;\nreturn n * factorial(n - 1);\n}\n\nint main()\n{\nint num = 5;\ncout << \"Factorial of \"\n<< num << \" is: \" << factorial(num) << endl;\nreturn 0;\n}\n```\n\nTime complexity: O(n) will be the time complexity for implementing a factorial program in C++ using recursion.\n\nAuxiliary Space: O(n) will be the space complexity for implementing a factorial program in C++ using recursion.\n\n### Approach 2: (Using For loop)\n\nFollow the steps to solve the problem:\n\n1. Using a for loop, we will write a program for finding the factorial of a number.\n2. An integer variable with a value of 1 will be used in the program.\n3. With each iteration, the value will increase by 1 until it equals the value entered by the user.\n4. The factorial of the number entered by the user will be the final value in the fact variable.\n\nCode Implementation (Using For Loop)\n\n```#include <iostream>\nusing namespace std;\n\nunsigned int factorial(unsigned int n)\n{\nint res = 1, i;\nfor (i = 2; i <= n; i++)\nres *= i;\nreturn res;\n}\n\nint main()\n{\nint num = 5;\ncout << \"Factorial of \"\n<< num << \" is \"\n<< factorial(num) << endl;\nreturn 0;\n}\n```\n\nTime complexity: O(n) will be the time complexity for implementing a factorial program in C++ using a for loop.\n\nAuxiliary Space: O(1) will be the space complexity for implementing a factorial program in C++ using a for loop.\n\nApproach 3: In this approach, we will see how we can use the while loop for implementing the factorial of a number.\n\nCode Implementation (Using While Loop)\n\n```#include <iostream>\nusing namespace std;\nunsigned int factorial(unsigned int n)\n{\nif(n == 0)\nreturn 1;\nint i = n, fact = 1;\nwhile (n / i != n) {\nfact = fact * i;\ni--;\n}\nreturn fact;\n}\nint main()\n{\nint num = 5;\ncout << \"Factorial of \"\n<< num << \" is \"\n<< factorial(num) << endl;\nreturn 0;\n}\n```\n\nTime complexity: O(n) will be the time complexity for implementing a factorial program in C++ using a while loop.\n\nAuxiliary Space: O(1) will be the space complexity for implementing a factorial program in C++ using a while loop.\n\nApproach 4: A ternary operator can be thought of as a shorthand for an if…else statement. The conditions are provided, along with statements to be executed based on them. Here’s the program for factorial using a ternary operator.\n\nCode Implementation (Using Ternary Operators)\n\n```#include <iostream>\nusing namespace std;\n\nint factorial(int n)\n{\nreturn (n == 1 || n == 0) ? 1 : n * factorial(n - 1);\n}\n\nint main()\n{\nint num = 5;\ncout << \"Factorial of \" << num << \" is \"<< factorial(num);\nreturn 0;\n}\n```\n\nTime complexity: O(n) will be the time complexity for implementing a factorial program in C++ using a ternary operator for the recursive approach.\n\nAuxiliary Space: O(n) will be the space complexity for implementing a factorial program in C++ using a ternary operator for the recursive approach.\n\nTips\nVarious service based companies like TCS, Wipro, Accenture and Capgemini have asked for a factorial program for their technical interviews.\n\nConclusion\nThis article tried its best to explain the various approaches to implement factorial programs in C++. Having knowledge about mathematical topics like factorial numbers will always help in the logic building. And for beginners, this problem must be solved to improve their coding as well as problem solving skills.\n\nOther C++ Programs"
] | [
null,
"https://prepbytes-misc-images.s3.ap-south-1.amazonaws.com/assets/1670564301916-Factorial%20Program%20in%20Cpp.jpg",
null
] | {"ft_lang_label":"__label__en","ft_lang_prob":0.76338345,"math_prob":0.99248004,"size":4485,"snap":"2022-40-2023-06","text_gpt3_token_len":1096,"char_repetition_ratio":0.18946664,"word_repetition_ratio":0.30920246,"special_character_ratio":0.2717949,"punctuation_ratio":0.11452184,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.99955285,"pos_list":[0,1,2],"im_url_duplicate_count":[null,2,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2023-02-04T02:24:53Z\",\"WARC-Record-ID\":\"<urn:uuid:614cb14e-5de7-41aa-b0fd-5138227a6b20>\",\"Content-Length\":\"148359\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:ae31d988-7e11-43ba-bd8b-5b0237d7f673>\",\"WARC-Concurrent-To\":\"<urn:uuid:3d366151-509f-4df2-8090-1123a34d90b2>\",\"WARC-IP-Address\":\"18.160.18.47\",\"WARC-Target-URI\":\"https://www.prepbytes.com/blog/cpp-programming/factorial-program-in-cpp/\",\"WARC-Payload-Digest\":\"sha1:XBWU2G5HT6E5BB73GIK4HUHCRINBPVHS\",\"WARC-Block-Digest\":\"sha1:ZOCBO2AQ6ZXGE7BGVMCHDBZTOH7YEIRR\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2023/CC-MAIN-2023-06/CC-MAIN-2023-06_segments_1674764500080.82_warc_CC-MAIN-20230204012622-20230204042622-00251.warc.gz\"}"} |
https://alpha-brains.com/Courses/magic-math/ | [
"3000 PKR\n\n# Magic Maths Cultivates an interest in numbers and eliminates the maths phobia\n\nGet the benefit from the 20 years of\nMr. Sohaib Intesar\n\nFirst Certified Abacus Trainer in Pakistan.",
null,
"### Magic Math\n\nAlpha Brains rearranged Magic Maths course for kids and launched this course in Pakistan, UAE & UK. Magic maths Course has been introduced as a system of ancient times for Mathematics which was introduced by Late S. K Theta. He has discovered and re-organized the techniques in the form of 16 main techniques and 13 sub techniques. Alpha brains provides excellent opportunity to learn the Magic maths course by online or offline and get certification. It is simple and more interesting than the regular way of learning conventional maths.\nThe course is based on the natural way of learning; which helps to learn and perform the calculations at a much faster rate with smart efficiency that can save the time to solve mathematical problems. This works as a system which helps in checking the independent set of methods which can be useful in cross-checking the answers that can reduce the possibility of doing careless mistakes while solving the problems.\nThe tricks and formulas applied are direct, straightforward, and simple which reduces the stress work of finger counting and scratch work. Thus, it is helpful in developing your creativity, intelligence by improving the clarity in mind. It is very helpful in preparing for competitive exams like SAT, CSS, MCAT Engineering and many more.\nMagic Maths Course is for teachers, students, homemaker, and businessman for doing calculations and even teaching students as a mentor. With the help of its learning, one can perform the calculations 10-15 times faster than the conventional maths methods.\n\n### Benefits of Magic Math\n\n⦁ Magic Mathematics cultivates an interest in numbers and eliminates the maths-phobia\n⦁ Magic Maths is very easy to understand and practice.\n⦁ Any type of complex and critical multiplication or division can be done with simplicity\n⦁ High-Speed Magic Mathematics is 10 to 15 times faster than conventional Maths\n⦁ Magic Maths not only simplifies and eases the toughness of mathematics but also boosts the brain power\n⦁ Kids will improve their results in Schools\n⦁ Helps in Simplifying Calculations\n⦁ Enhances Ability for Numbers\n⦁ Improves Focus, Memory & Concentration\n⦁ Better Performances in Competitive Exams\n\n# Who Can Learn Magic Math?",
null,
"",
null,
"",
null,
"",
null,
"",
null,
"",
null,
"# Course Outline\n\n## M1\n\n2 Months\n• Multiplication by 11\n• Multiplication by 22-99\n• Multiplication by 12 to 19\n• Multiplication by 111\n• Multiplication by 222 to 999\n• If the sum of the units digits is 10 & tens place digits are same\n• If the sum of the tens place digits is 10 & units place digits are same\n• Multiplication by 9\n• Multiplication by number ending with 9\n• General Method Multiplication 2D x 2D & 3D x 3D\n• Multiplication (Below Base 10-90)\n• Multiplication (Below Base 100-900)\n• Multiplication Below Base Method\u0002Practice (100-10000)\n• Multiplication (Above Base 10-90)\n• Multiplication (Above Base 100-900)\n• Multiplication Above Base Method\u0002Practice (1000-10000)\n• Subtraction (All from 9 & last from 10)\n• Vinculum\n• Devinculum\n• Subtraction using Vinculum\n• Subtraction Base Method\n• Division by 9\n• Division by 8\n• Division by 11 & 12\n• Division by Below base 100\n• Division by Above base 100\n• Division Base Method (Above)\n• Division Base Method (Below) by other divisors\n• Squares (Above the Base & Below the Base 10 to 900)\n• Squares of number starting with 5 & number ending with 5\n• Mock Papers\n\n## M2\n\n\\$ 2 Months\n• Tables using vinculum\n• Multiplication by number of nines\n• Multiplication (General Method) 2D x 2D, 3D x3D, 4Dx4D\n• High Speed Multiplications\n• Division (General Method) by 2 digit divisor (flag method)\n• Division (General Method) by 3 digit divisor (flag method)\n• Division (General Method)by 4 digit divisor (flag method)\n• Many More...\n\n## M3\n\n\\$ 2 Months\n• Auxiliary Fraction (Divisor Ending with 9, 8, 7, 6 & 1)\n• Multiplication (General Method) 2Dx2Dx2D ( 3 rows )\n• Multiplication (Base Method), 3 rows\n• Magic Squares\n• Algebraic Multiplication\n• Algebraic Division\n• Divisibility (by 2 to 23)\n• Many More...\n\n## M4\n\n\\$ 2 Months\n• Product of two numbers ending with 5\n• Revision Multiplication Base Method (Below Base)\n• Revision Multiplication Base Method (Above Base)\n• Revision Multiplication Base Method (Mixed Base)\n• (one number below and other Above - Same base)\n• Base Method multiplication\n• Many More..."
] | [
null,
"https://alpha-brains.com/wp-content/uploads/2022/03/upaa2.png",
null,
"http://alpha-brains.com/wp-content/uploads/2022/03/bg1-1.png",
null,
"http://alpha-brains.com/wp-content/uploads/2022/03/bg2.png",
null,
"http://alpha-brains.com/wp-content/uploads/2022/03/bg3.png",
null,
"http://alpha-brains.com/wp-content/uploads/2022/03/bg4.png",
null,
"http://alpha-brains.com/wp-content/uploads/2022/03/bg5.png",
null,
"http://alpha-brains.com/wp-content/uploads/2022/03/bg6.png",
null
] | {"ft_lang_label":"__label__en","ft_lang_prob":0.9401106,"math_prob":0.888705,"size":2372,"snap":"2022-40-2023-06","text_gpt3_token_len":482,"char_repetition_ratio":0.11697635,"word_repetition_ratio":0.015789473,"special_character_ratio":0.18254638,"punctuation_ratio":0.071428575,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9811901,"pos_list":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"im_url_duplicate_count":[null,2,null,2,null,2,null,2,null,2,null,2,null,2,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2023-02-01T15:42:32Z\",\"WARC-Record-ID\":\"<urn:uuid:c5a374cf-8138-42c5-a509-254e98e43cac>\",\"Content-Length\":\"100734\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:fb4f0013-d381-4028-817d-c6f554d63abc>\",\"WARC-Concurrent-To\":\"<urn:uuid:e3bbb124-ca77-4c5b-8323-7cd41cbbc61c>\",\"WARC-IP-Address\":\"185.212.71.38\",\"WARC-Target-URI\":\"https://alpha-brains.com/Courses/magic-math/\",\"WARC-Payload-Digest\":\"sha1:6MXNXYTRPJMEKBUUVHU7MDTRXNQMDSCR\",\"WARC-Block-Digest\":\"sha1:G3EW56CP37MHTYFRM6LPCKCIZII6AV2N\",\"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-00608.warc.gz\"}"} |
https://simbody.github.io/simbody-3.6-doxygen/api/structSimTK_1_1Narrowest.html | [
"Simbody 3.6\nSimTK::Narrowest< R1, R2 > Struct Template Reference\n\nThis class is specialized for all 16 combinations of standard types (that is, real and complex types in each of two precisions) and has typedefs \"Type\" which is the appropriate \"narrowed\" type for use when R1 & R2 appear in an operation together where the result must be of the narrower precision, and \"Precision\" which is the expected precision of the result (float, double). More...\n\n## Detailed Description\n\n### template<class R1, class R2> struct SimTK::Narrowest< R1, R2 >\n\nThis class is specialized for all 16 combinations of standard types (that is, real and complex types in each of two precisions) and has typedefs \"Type\" which is the appropriate \"narrowed\" type for use when R1 & R2 appear in an operation together where the result must be of the narrower precision, and \"Precision\" which is the expected precision of the result (float, double).\n\nFor example, if R1=complex< double > and R2=float, Narrowest<R1,R2>::Type is complex< float > and Narrowest<R1,R2>::Precision is float.\n\nThe documentation for this struct was generated from the following file:"
] | [
null
] | {"ft_lang_label":"__label__en","ft_lang_prob":0.90888035,"math_prob":0.8856204,"size":911,"snap":"2022-40-2023-06","text_gpt3_token_len":219,"char_repetition_ratio":0.13781698,"word_repetition_ratio":0.82758623,"special_character_ratio":0.23929748,"punctuation_ratio":0.12068965,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9690087,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2022-09-26T22:54:53Z\",\"WARC-Record-ID\":\"<urn:uuid:6f89780a-ff03-429f-aa28-72be1afbe214>\",\"Content-Length\":\"5884\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:cfca9f70-8cb0-413d-b26c-bb04f0766c6c>\",\"WARC-Concurrent-To\":\"<urn:uuid:29fb62e0-6968-4871-9466-1673ff4c535a>\",\"WARC-IP-Address\":\"185.199.109.153\",\"WARC-Target-URI\":\"https://simbody.github.io/simbody-3.6-doxygen/api/structSimTK_1_1Narrowest.html\",\"WARC-Payload-Digest\":\"sha1:VXTXZRP55J7CZ7SHGYZQX5HUNVK4NA5H\",\"WARC-Block-Digest\":\"sha1:FRYAXSDLGNICQH423VC6XHJXUKGTRCHI\",\"WARC-Identified-Payload-Type\":\"application/xhtml+xml\",\"warc_filename\":\"/cc_download/warc_2022/CC-MAIN-2022-40/CC-MAIN-2022-40_segments_1664030334942.88_warc_CC-MAIN-20220926211042-20220927001042-00322.warc.gz\"}"} |
https://www.midasbridge.com/en/blog/bridge-insight/wood-armer-moments-for-skew-slabs | [
"BLOG BRIDGE INSIGHT\n\n# Wood Armer Moments for Skew Slabs\n\n## 1. Introduction\n\nA bridge deck configuration depends upon the site conditions and road alignment. This article will discuss how to calculate the design moments along the reinforcement directions in a skew slab. Slab bridges tend to span in a direction running from support to support. As skew increases, the moments vary towards edges, maximum at the obtuse end and minimum towards the acute end. These can be seen from the moment contours, as shown in Figure 1. Various parametric study results have indicated that shear forces and bending moments increase with increasing skew angle.",
null,
"Figure 1. Image of trajectories for different skew angles.\n\nThere are many theoretical approaches to obtain optimum reinforcement angles for the most economical design for different skew angles in a slab. However, such theoretical optimization techniques are usually not practical and may not be economical to execute. A few of the different possible layouts for a skew bridge are shown in Figure 2. One can create the meshing as per different configurations such as parallel to skew, transversely normal, and longitudinally normal type of meshing. Each has some variations depending upon the loadings.",
null,
"Figure 2. Different skew layouts.\n\nIt is observed that as the skew increases:\n\n1. The deflection reduces\n2. The longitudinal moment reduces\n3. The point of maximum longitudinal moment shift towards the obtuse corner\n4. The shear force concentrate at the obtuse corner\n5. The transverse moment increases\n\nThe layout with straight bars in a skew slab is not the most practical. Research on skew deck slab has shown that an orthogonal layout is optimized most of the time and deviates to provide the higher amount of reinforcement.\n\nSeveral parameters can affect the magnitude of moments at the obtuse corner\n\n1. structural continuity\n2. geometry of the slab\n3. Cracked conditions\n\n## 2. Wood Armer Moments\n\nThe design moments along the reinforcement for the skew slab are a combination of (a) normal bending moments and a torsional component. These are called wood armer moments. The Wood-Armer equations were derived for the design of skew as well as curved reinforced concrete slabs.\n\n## 3. Midas Civil Features for Wood Armer Moments\n\nTo calculate the wood armer moments in midas Civil, we need to generate the slabs as plate elements. From there, we need to define the domain and sub-domain to provide the reinforcement directions along to which these forces need to arrive. A Sub-Domain can be defined while a mesh is generated using the Auto mesh feature in midas Civil or it can also be defined from the Define Sub-Domain.",
null,
"Figure 3. Domain definitions in midas Civil",
null,
"Figure 4. Sub-domain definition in midas Civil\n\nThe reference axis used to define the rebar direction can be: (Refer to Figure 3&4)\n\n1. Local\n2. UCS\n3. Reference Axis\n\n1. Local: We can define the rebar direction along the Local Coordinate System of the plate elements.\n\n2. UCS: We can define the rebar direction along the User-defined Coordinate System. If user-defined coordinates are not specified, the Global Coordinate System can be used.\n\n3. Reference Axis: We can define the rebar direction along the user-defined Reference Axis. Here we need two nodes for V1 to be specified to define the x-direction from the origin of the coordinate system. Then V2 is selected to decide the plane, and z-direction is selected as per ‘Right-Hand’ rule.\n\n## 4. Moment Calculations in midas Civil\n\nFrom the midas Civil analysis results, the following plate moments about the local axis are obtained:\n\n• mxx\n• myy\n• mxy\n\nIn order to calculate design forces or wood armer moments in the reinforcement direction, angle α and φ will be taken as shown in Figure 5.",
null,
"Figure 5. Domain and sub-domain definitions in midas Civil.\n\nwhere,\n\nx, y: the local axis of the plate element.\n\n1, 2: the reinforcement direction.\n\nα: the angle between local x-direction and rebar direction 1.\n\nφ: angle between rebar direction 1 and rebar direction 2.\n\nFirst, the internal forces (mxx, myy and mxy) are calculated into a-b coordinate system as shown in fig. 5.",
null,
"Then, Wood-Armer moments are calculated as follows:",
null,
"",
null,
"where,\n\nmud1 : is the initial moments in direction 1\n\nmud2 : is the initial moments in direction 2\n\nm’ud1 : is the wood armer moments in direction 1\n\nm’ud2 : is the wood armer moments in direction 2\n\n## 5. Verification of Wood Armer Moments\n\nA verification of Wood Armer Moment with manual calculations is explained here.\nConsider case 3 for verification purposes. To understand the calculations, we will consider node number 96, which has a maximum moment; refer to fig.6.",
null,
"Figure 7. Reference element for verification.\n\n### Manual Calculations for Wood Armer Moments\n\nLocal forces from the analysis are listed here: (Refer to Figure 8)\n\nElement number = 388;\n\nNode Number = 96;\n\nMxx = -30 kNm;\n\nMyy = -3.398 kNm;\n\nMxy = -12.694 kNm;\n\nSkew angle = 45;\n\nReinforcement Direction 1 = 0 from local axis x;\n\nReinforcement Direction 2 = 90 from local axis x",
null,
"Figure 8. Plate local forces in midas Civil\n\nReinforcement Angle α = 0 = 0 x (π/180) = 0 rad;\n\nand φ = 90 = 90 x (π/180) = 1.5708 rad;",
null,
"",
null,
"",
null,
"Top Design Force\n\nAs, M’ud1 < 0 and M’ud2 < 0,\n\nM’ud1 = 42.694 kNm\n\nM’ud2 = 16.092 kNm\n\nBottom Design Force\n\nAs M’ud1 > 0 and M’ud2 > 0,\n\nM’ud1 = 0 kNm",
null,
"M’ud2 = (-3.398) – l (-12.694 – (-3.398) x cot2 (1.5708)) / (-30 – 2 x -12.694 x cot (1.5708)) + (-3.398 x cot2 (1.5708)) l = 1.97325 kNm\n\n Wood Armer Moments Manual Calculations Midas Civil Direction Direction 1 Direction 2 Direction 1 Direction 2 Top 42.694 16.093 42.694 16.093 Bottom 0 1.973 0 1.973\n\nTable 1. Comparison of Wood Armer Moments from manual calculations and midas Civil.\n\nThe Wood Armer Moments in each directions calculated by from the Empirical formulae can be validated with midas Civil output as shown in the table 1.",
null,
"",
null,
""
] | [
null,
"https://www.midasbridge.com/hs-fs/hubfs/International_Bridge/midasBridge_Blog/2021%20midasBridge%20contents/Wood%20Armer%20Moments%20for%20Skew%20Slabs/Fig%201.jpg",
null,
"https://www.midasbridge.com/hs-fs/hubfs/International_Bridge/midasBridge_Blog/2021%20midasBridge%20contents/Wood%20Armer%20Moments%20for%20Skew%20Slabs/Fig%202.jpg",
null,
"https://www.midasbridge.com/hs-fs/hubfs/International_Bridge/midasBridge_Blog/2021%20midasBridge%20contents/Wood%20Armer%20Moments%20for%20Skew%20Slabs/Fig%203-1.jpg",
null,
"https://www.midasbridge.com/hs-fs/hubfs/International_Bridge/midasBridge_Blog/2021%20midasBridge%20contents/Wood%20Armer%20Moments%20for%20Skew%20Slabs/Fig%203-2.jpg",
null,
"https://www.midasbridge.com/hs-fs/hubfs/International_Bridge/midasBridge_Blog/2021%20midasBridge%20contents/Wood%20Armer%20Moments%20for%20Skew%20Slabs/Fig%204.jpg",
null,
"https://www.midasbridge.com/hs-fs/hubfs/International_Bridge/midasBridge_Blog/2021%20midasBridge%20contents/Wood%20Armer%20Moments%20for%20Skew%20Slabs/Fig%205-1.jpg",
null,
"https://www.midasbridge.com/hs-fs/hubfs/image-png-Oct-20-2021-06-25-44-96-AM.png",
null,
"https://www.midasbridge.com/hs-fs/hubfs/International_Bridge/midasBridge_Blog/2021%20midasBridge%20contents/Wood%20Armer%20Moments%20for%20Skew%20Slabs/Fig%205-3.jpg",
null,
"https://www.midasbridge.com/hs-fs/hubfs/International_Bridge/midasBridge_Blog/2021%20midasBridge%20contents/Wood%20Armer%20Moments%20for%20Skew%20Slabs/Fig%206.jpg",
null,
"https://www.midasbridge.com/hubfs/image-png-Oct-20-2021-06-36-14-39-AM.png",
null,
"https://www.midasbridge.com/hs-fs/hubfs/International_Bridge/midasBridge_Blog/2021%20midasBridge%20contents/Wood%20Armer%20Moments%20for%20Skew%20Slabs/1.jpg",
null,
"https://www.midasbridge.com/hs-fs/hubfs/International_Bridge/midasBridge_Blog/2021%20midasBridge%20contents/Wood%20Armer%20Moments%20for%20Skew%20Slabs/2.jpg",
null,
"https://www.midasbridge.com/hs-fs/hubfs/International_Bridge/midasBridge_Blog/2021%20midasBridge%20contents/Wood%20Armer%20Moments%20for%20Skew%20Slabs/3.jpg",
null,
"https://www.midasbridge.com/hs-fs/hubfs/International_Bridge/midasBridge_Blog/2021%20midasBridge%20contents/Wood%20Armer%20Moments%20for%20Skew%20Slabs/4.jpg",
null,
"https://www.midasbridge.com/hubfs/International_Bridge/midasBridge_Blog/2020%20midasBridge%20Contents%20(2020.10.26~2020.12.31)/Photos%20of%20specialists/Pratap-1.png",
null,
"https://www.midasbridge.com/hubfs/International_Bridge/email/midas%20newsletter%20MIAC/20210913/front-page.png",
null
] | {"ft_lang_label":"__label__en","ft_lang_prob":0.8328241,"math_prob":0.9393348,"size":5742,"snap":"2021-43-2021-49","text_gpt3_token_len":1449,"char_repetition_ratio":0.15144649,"word_repetition_ratio":0.049196787,"special_character_ratio":0.25322187,"punctuation_ratio":0.11879433,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9701723,"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],"im_url_duplicate_count":[null,1,null,1,null,1,null,1,null,1,null,1,null,1,null,1,null,1,null,1,null,1,null,1,null,1,null,1,null,3,null,1,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2021-11-27T10:59:26Z\",\"WARC-Record-ID\":\"<urn:uuid:8bf15a8b-d9f1-4cf4-8e34-5940cbb9dec7>\",\"Content-Length\":\"198909\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:d0a118f6-f500-4da3-9ba1-73dffb377eb9>\",\"WARC-Concurrent-To\":\"<urn:uuid:79e609fd-0c5a-48d3-ade8-95b148c6dc5b>\",\"WARC-IP-Address\":\"199.60.103.226\",\"WARC-Target-URI\":\"https://www.midasbridge.com/en/blog/bridge-insight/wood-armer-moments-for-skew-slabs\",\"WARC-Payload-Digest\":\"sha1:NZNYAH6AUPRQFN5NWKE6XMCKPEBOMM2N\",\"WARC-Block-Digest\":\"sha1:ZEAQJ7HVNDEVWYWFC37UJCBO5G7MEFAM\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2021/CC-MAIN-2021-49/CC-MAIN-2021-49_segments_1637964358180.42_warc_CC-MAIN-20211127103444-20211127133444-00260.warc.gz\"}"} |
http://slideplayer.com/slide/6196369/ | [
"",
null,
"Holt CA Course 1 9-2 Perimeter and Area of Triangles and Trapezoids Warm Up Warm Up California Standards California Standards Lesson Presentation Lesson.\n\nPresentation on theme: \"Holt CA Course 1 9-2 Perimeter and Area of Triangles and Trapezoids Warm Up Warm Up California Standards California Standards Lesson Presentation Lesson.\"— Presentation transcript:\n\nHolt CA Course 1 9-2 Perimeter and Area of Triangles and Trapezoids Warm Up Warm Up California Standards California Standards Lesson Presentation Lesson PresentationPreview\n\nHolt CA Course 1 9-2 Perimeter and Area of Triangles and Trapezoids Warm Up A rectangle has sides lengths of 12 ft and 20 ft. 2. Find the area. 1. Find the perimeter. 64 ft 240 ft 2\n\nHolt CA Course 1 9-2 Perimeter and Area of Triangles and Trapezoids MG2.1 Use formulas routinely for finding the perimeter and area of basic two- dimensional figures and the surface area and volume of basic three-dimensional figures, including rectangles, parallelograms, trapezoids, squares, triangles, circles, prisms, and cylinders. Also covered: MG3.2 California Standards\n\nHolt CA Course 1 9-2 Perimeter and Area of Triangles and Trapezoids DO NOT COPY A triangle or trapezoid can be thought of as half of a parallelogram. Therefore, the formulas for the area of a triangle or trapezoid have as a factor. 1212\n\nHolt CA Course 1 9-2 Perimeter and Area of Triangles and Trapezoids\n\nHolt CA Course 1 9-2 Perimeter and Area of Triangles and Trapezoids Additional Example 1: Using Perimeter 71 = 55 + d d = 16 in. P = 22 + 15 + 18 + d 16 = d Substitute 71 for P. Find the missing measurement when the perimeter is 71 in. 18 in. 22 in. 15 in. Subtract 55 from both sides. 55 d\n\nHolt CA Course 1 9-2 Perimeter and Area of Triangles and Trapezoids Check It Out! Example 1 58 = 49 + d d = 9 in. P = 28 + 7 + 14 + d 9 = d Substitute 58 for P. Find the missing measurement when the perimeter is 58 in. 14 in. 28 in. 7 in. Subtract 49 from both sides. 49 d\n\nHolt CA Course 1 9-2 Perimeter and Area of Triangles and Trapezoids Additional Example 2: Multi-Step Application Step 1: Find the length of the third side. Substitute 12 for a and 20 for c. A homeowner wants to plant a border of shrubs around her yard that is in the shape of a right triangle. She knows that the length of the shortest side of the yard is 12 feet and the length of the longest side is 20 feet. How long will the border be? b = 16 a 2 + b 2 = c 2 12 2 + b 2 = 20 2 144 + b 2 = 400 b 2 = 256 Use the Pythagorean Theorem. √256 = 16.\n\nHolt CA Course 1 9-2 Perimeter and Area of Triangles and Trapezoids Additional Example 3 Continued Step 2: Find the perimeter of the yard. Add all sides. P = a + b + c = 12 + 20 + 16 = 48 The border will be 48 feet long.\n\nHolt CA Course 1 9-2 Perimeter and Area of Triangles and Trapezoids Check It Out! Example 2 Step 1: Find the length of the third side. Substitute 38 for a and 32 for b. A gardener wants to plant a border of flowers around the building that is in the shape of a right triangle. He knows that the length of the shortest sides of the building are 38 feet and 32 feet. How long will the border be? c ≈ 49.68 a 2 + b 2 = c 2 38 2 + 32 2 = c 2 1444 + 1024 = c 2 2468 = c 2 Use the Pythagorean Theorem. √2468 49.68.\n\nHolt CA Course 1 9-2 Perimeter and Area of Triangles and Trapezoids Lesson Quiz Use the figure to find the following measurements. 1. the perimeter of the triangle 2. the perimeter of the trapezoid 3. the perimeter of the combined figure 4. the area of the triangle 5. the area of the trapezoid 36 cm 44 cm 54 cm 2 64 cm 104 cm 2\n\nHolt CA Course 1 9-2 Perimeter and Area of Triangles and Trapezoids Exit ticket Page 441 - 442 Problems 1 – 4, 17 -22\n\nHolt CA Course 1 9-2 Perimeter and Area of Triangles and Trapezoids Check It Out! Example 2 Continued Step 2: Find the perimeter of the yard. Add all sides. P = a + b + c 38 + 32 + 49.68 119.68 The border will be about 119.68 feet long.\n\nHolt CA Course 1 9-2 Perimeter and Area of Triangles and Trapezoids A. (–2, 2), (4, 2), (0, 5) x y 6 3 = 9 units 2 A = bh 1212 Additional Example 3: Finding the Area of Triangles and Trapezoids Graph and find the area of the figure with the given vertices. (4, 2) (0, 5) (–2, 2) = 6 3 1212 Area of a triangle Substitute for b and h.\n\nHolt CA Course 1 9-2 Perimeter and Area of Triangles and Trapezoids B. (–1, 1), (4, 1), (4, 4), (0, 4) = 13.5 units 2 A = h(b 1 + b 2 ) 1212 = 3(5 + 4) 1212 Area of a trapezoid Substitute for h, b 1, and b 2. (–1, 1) (0, 4) (4, 4) x y (4, 1) Graph and find the area of the figure with the given vertices. Additional Example 3: Finding the Area of Triangles and Trapezoids 5 3 4\n\nHolt CA Course 1 9-2 Perimeter and Area of Triangles and Trapezoids A. (–1, –2), (5, –2), (5, 2), (–1, 6) Check It Out! Example 3 Graph and find the area of the figure with the given vertices. = 36 units 2 A = h(b 1 + b 2 ) 1212 = 6(8 + 4) 1212 Area of a trapezoid Substitute for h, b 1, and b 2. (–1, –2) (–1, 6) (5, 2) x y (5, –2) 48 6\n\nHolt CA Course 1 9-2 Perimeter and Area of Triangles and Trapezoids B. (–1, 1), (5, 1), (1, 5) x y 6 4 = 12 units 2 A = bh 1212 Check It Out! Example 3 Graph and find the area of the figure with the given vertices. (5, 1) (1, 5) (–1, 1) = 6 4 1212 Area of a triangle Substitute for b and h.\n\nDownload ppt \"Holt CA Course 1 9-2 Perimeter and Area of Triangles and Trapezoids Warm Up Warm Up California Standards California Standards Lesson Presentation Lesson.\"\n\nSimilar presentations"
] | [
null,
"http://slideplayer.com/static/blue_design/img/slide-loader4.gif",
null
] | {"ft_lang_label":"__label__en","ft_lang_prob":0.81523144,"math_prob":0.9893209,"size":5128,"snap":"2019-43-2019-47","text_gpt3_token_len":1722,"char_repetition_ratio":0.20745511,"word_repetition_ratio":0.34427768,"special_character_ratio":0.3521841,"punctuation_ratio":0.118297875,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.99478465,"pos_list":[0,1,2],"im_url_duplicate_count":[null,null,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2019-10-19T12:19:53Z\",\"WARC-Record-ID\":\"<urn:uuid:5dc6f1a4-db94-491b-b018-80f7b2f4e30f>\",\"Content-Length\":\"167138\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:1836cc26-d528-4751-ae08-4ce760d9603b>\",\"WARC-Concurrent-To\":\"<urn:uuid:5e41c558-8354-45f1-a4bd-25e19c772754>\",\"WARC-IP-Address\":\"138.201.58.10\",\"WARC-Target-URI\":\"http://slideplayer.com/slide/6196369/\",\"WARC-Payload-Digest\":\"sha1:2IJR6MZLT6YN65U6W4E2P4EKZAAPMHDV\",\"WARC-Block-Digest\":\"sha1:3IQNKUIP55R5HPXOHSI5SRNFTT7VHDUS\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2019/CC-MAIN-2019-43/CC-MAIN-2019-43_segments_1570986693979.65_warc_CC-MAIN-20191019114429-20191019141929-00314.warc.gz\"}"} |
http://www.nabla.hr/Z_MemoHU-010.htm | [
"10\n\nALGEBRA\nExponential and logarithmic functions and equations\n:: Exponential and logarithmic functions (are mutually) inverse functions\n The inverse function, usually written f -1, is the function whose domain and the range are respectively the range and domain of a given function f, that is f -1(x) = y if and only if f (y) = x. Thus, the composition of the inverse function and the given function returns x, which is called the identity function, i.e., f -1(ƒ(x)) = x and f (f -1(x)) = x. The inverse of a function undoes the procedure (or function) of the given function. Therefore, to obtain the inverse of a function y = f (x), exchange the variables x and y writing x = f (y) and solve for y. That is, form the composition f (f -1(x)) = x and solve for f -1.\n Example: Given y = f (x) = log2 x determine f -1(x). Recall, a logarithm is the exponent (the power) to which a base must be raised to yield a given number that is, y = loga x if x = a y. Solution: Rewrite y = f (x) = log2 x to x = log2 y and solve for y, which gives y = f -1(x) = 2x. or, form f (f -1(x)) = x that is, log2 (f -1(x)) = x and solve for f -1, which gives y = f -1(x) = 2x.\n Graphs of inverse functions The graphs of a pair of inverse functions are symmetrical with respect to the line y = x.",
null,
"Exponential functions\n f (x) = y = ex <=> x = ln y, e = 2.718281828..., where e is the base of the natural logarithm. The exponential function is inverse of the natural logarithm function, so that e ln x = x.\nf (x) = y = ax <=> x = loga y, where a > 0 and a is not 1.\n The exponential function with base a is inverse of the logarithmic function, so that",
null,
"The graph of the exponential function y = ax = ebx, where a > 0 and b = ln a",
null,
"The graph of the logarithmic function y = logaxa > 0 and for a = ey = logex = ln x",
null,
"The logarithmic function is inverse of the f (x) = ax since its domain and the range are respectively the range and domain of the exponential function, so that",
null,
"The domain of f (x) = loga x is the set of all positive real numbers. The range of f (x) = loga x is the set of all real numbers. If a > 1 then f is an increasing function and if 0 < a < 1 then f is a decreasing function. The graph of the logarithmic function passes through the point (1, 0). The y-axis is the vertical asymptote to the graph, as shows the above picture.\nTranslated logarithmic and exponential functions\n Note that y - y0 = loga (x - x0) represents translated logarithmic function to base a and y - y0 = a (x - x0) represents translated exponential function with base a where, x0 and y0 are the coordinates of translations of the graph in the direction of the coordinate axes.\n Example: Given translated logarithmic function y - 2 = log3 (x + 1), find its inverse and draw their graphs. Solution: Exchange variables and solve for y, that is x - 2 = log3 (y + 1) which gives y + 1 = 3x - 2.",
null,
"",
null,
"",
null,
"",
null,
"Contents A",
null,
""
] | [
null,
"http://www.nabla.hr/MeInvLogExB2.GIF",
null,
"http://www.nabla.hr/Me83.GIF",
null,
"http://www.nabla.hr/MeExpFunct.GIF",
null,
"http://www.nabla.hr/MeLogFun.GIF",
null,
"http://www.nabla.hr/Me84.GIF",
null,
"http://www.nabla.hr/MeTranslLE.GIF",
null,
"http://www.nabla.hr/Previous.gif",
null,
"http://www.nabla.hr/TOP.gif",
null,
"http://www.nabla.hr/Next.gif",
null,
"http://www.nabla.hr/HOME1.gif",
null
] | {"ft_lang_label":"__label__en","ft_lang_prob":0.7292481,"math_prob":0.9998567,"size":3066,"snap":"2022-05-2022-21","text_gpt3_token_len":1013,"char_repetition_ratio":0.18451992,"word_repetition_ratio":0.13213213,"special_character_ratio":0.3330072,"punctuation_ratio":0.10696921,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":1.0000007,"pos_list":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20],"im_url_duplicate_count":[null,2,null,2,null,2,null,2,null,2,null,2,null,null,null,null,null,null,null,null,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2022-05-26T18:27:58Z\",\"WARC-Record-ID\":\"<urn:uuid:aa7be2fe-c52b-4844-9b72-10773af0b921>\",\"Content-Length\":\"50037\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:158c572c-7e15-44c2-8d19-5937530bcdac>\",\"WARC-Concurrent-To\":\"<urn:uuid:b4f43827-f75f-45f2-9749-6df44b171c67>\",\"WARC-IP-Address\":\"213.202.101.150\",\"WARC-Target-URI\":\"http://www.nabla.hr/Z_MemoHU-010.htm\",\"WARC-Payload-Digest\":\"sha1:B75G53KNLK7RDJEM4TDTIW6ICPHFHS7J\",\"WARC-Block-Digest\":\"sha1:KFFUYDTPGCE5A2QUQCHQOQ5E56PBFPGV\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2022/CC-MAIN-2022-21/CC-MAIN-2022-21_segments_1652662619221.81_warc_CC-MAIN-20220526162749-20220526192749-00756.warc.gz\"}"} |
https://blog.cropbytes.com/deflation-protocol/ | [
"# Game Coins and Deflation Protocol\n\nCropBytes is the top crypto game since 2018. Since the start, the development and growth of CropBytes has been constant. CropBytes has grown from a 2D game with basic game economics to a full-fledged multi-platform game with unmatched game economics and the world’s most advanced trading platform for games.\n\nThe Crypto market is soaring right now. To keep up we are bringing in some major improvements in the game and the economy. Two of these are deflation protocol and Game Coin.\n\nLet’s take a look at these in detail.\n\n## Game Coins\n\n#### What are Game Coins?\n\nGame Cards will now be called Game Coins. Game Coins are an in-game currency used in the CropBytes ecosystem. These coins can only be minted by players in the game.\n\n#### How are they created?\n\nMinting of a Game Coin requires a player to maintain a farm and complete game activities to collect produce from animals. Animal products can then be burnt to create Game Coins.\n\n#### Applications\n\n##### Current\n• Mining: Game Coins are mined by players in the CropBytes ecosystem.\n• Melting: Game Coins can be converted to Pro assets.\n• Trade: Game Coins are trade-able with Tron (TRX)\n##### Future\n• Trading platforms: Game Coins (GC) will be tradable with BTC, ETH, USDT on major trading platforms.\n• Mini-Games: Used as tokens in various mini-games.\n• Alliances: Will be used by alliances and partners of CropBytes.\n• Game transactions: Trading fee and other purchases in the CropBytes ecosystem.\n\n## Deflation protocol\n\nAs more and more players start playing, game activity increases, the production of extracts also increases, and so does the minting of GC. This eventually will lead to an unlimited supply of Game Coins and a reduction in their value.Game Coins are based on the Deflation Protocol, which means the rate of production slows down as the supply increases.\n\nGame Coins can also be melted to acquire pro assets, thus reducing the supply.\n\n#### How does it work?\n\nTo mine GC, players need to convert (burn) their produced goods. The factor of conversion (Difficulty) is based on the total GC in circulation.\n\nFormula for GC Generation:\n\n##### (Extract x Conversion rate ) x Difficulty = GC\n\nExample: Where conversion rate is 4 milk = 1 GC\n\nWhen Difficulty = 1\n(Milk x Conversion rate = 4) x Difficulty (1) ~ 4×1= 4\n∴ 4 Milk = 1 GC\n\nWhen Difficulty = 0.5\n(Milk x Conversion rate = 4) x Difficulty (0.5) ~ 4×0.5 = 2\n∴ 2 Milk = 1 GC\n\nWhen Difficulty = 1.5\n(Milk x Conversion rate = 4) x Difficulty (1.5) ~ 4×1.5= 6\n∴ 6 Milk = 1 GC\n\nExample: Where conversion rate is 8 milk = 1 GC\n\n• When Difficulty = 1\n(Milk x Conversion rate = 8) x Difficulty (1) ~ 8×1= 8\n∴ 8 Milk = 1 GC\n• When Difficulty = 0.5\n(Milk x Conversion rate = 8) x Difficulty (0.5) ~ 8×0.5= 4\n∴ 4 Milk = 1 GC\n• When Difficulty = 1.5\n(Milk x Conversion rate = 8) x Difficulty (1.5) ~ 8×1.5= 12\n∴ 12 Milk = 1 GC\n\nFormula for difficulty:\n\n##### Difficulty = ( Actual produced GC / Estimated Gc) ^ 5\n\nExample:\n\n• If estimated GC supply by X weeks is 1,42,000 and actually GC produced is 1,52,000.\nDifficulty = (1,52,000/ 1,42,000)⁵ = 1.145\nMilk required = 4 * 1.145 = 4.58\n∴ 4.58 Milk = 1 GC\n• If estimated GC supply by X weeks is 1,42,000, and actually GC produced is 1,35,000.\nDifficulty = ( 135000 / 142000)⁵ = 0.77\nMilk required = 4 * 0.77 = 3.08\n∴ 3.08 Milk = 1 GC\n\nFor example:\nMax 200000 GC is estimated to be generated per week. The count of estimated GC minted will be reduced by 50% every 10 weeks.\n\nTherefore:\n\n• Week 10–20: Estimated GC per week = 200,000\n• Week 21–30: Estimated GC per week= 200,000 / 2 = 100,000\n\nAs GC is produced and burned, the difficulty factor fluctuates. If the Total GC generated is more or less than the estimated GC by that particular time period, then it will affect the difficulty.\n\n#### Conversion rate\n\nAfter every period, the standard conversion rate for extracts to GC increases.\n\nExample:\n\n• Week 10- 20: 4 milk = 1 GC\n• Week 21–30: 8 milk = 1 GC\n• Week 31–40: 16 milk = 1 GC\n\n### Supply\n\n• Current Circulation: 2,892,893 | 16.17%\n• Pre Minted (team): 3,000,000 | 16.77%\n• Pre Minted (operations): 2,000,000 | 11.18%\n• Mintable GC: 10,000,000 | 55.89%\n##### Total Supply: 17,892,893.00\n\nAll the users can see the total supply in circulation & total GC produced per day on the GC Conversion Page.\n\n#### Unlocking Process\n\nTotal GC allocated for team & CropBytes will be locked for the first year. After which, 20% of the total will be unlocked each year.\n\n#### TRC20 Token\n\nSoon, GC will be converted to TRC20 tokens. The distribution of tokens will remain the same as current GC distribution."
] | [
null
] | {"ft_lang_label":"__label__en","ft_lang_prob":0.9016742,"math_prob":0.97987336,"size":4455,"snap":"2021-21-2021-25","text_gpt3_token_len":1274,"char_repetition_ratio":0.14895529,"word_repetition_ratio":0.11965812,"special_character_ratio":0.30774412,"punctuation_ratio":0.13796791,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.95745486,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2021-06-19T06:57:18Z\",\"WARC-Record-ID\":\"<urn:uuid:6fa19d24-881d-46fd-993b-a7a581b9b1f1>\",\"Content-Length\":\"76077\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:09418f68-3ec2-432a-bc37-cc7f86a2c4bc>\",\"WARC-Concurrent-To\":\"<urn:uuid:b5569d9f-1eab-4f46-a21d-f2eb2ccee4df>\",\"WARC-IP-Address\":\"45.93.101.7\",\"WARC-Target-URI\":\"https://blog.cropbytes.com/deflation-protocol/\",\"WARC-Payload-Digest\":\"sha1:OAHYIMD3PPAOIFZCZ7YG55KEPUNMZKOJ\",\"WARC-Block-Digest\":\"sha1:RWA5EAPB5626XKKHAEDKJ7ONBBALDXAV\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2021/CC-MAIN-2021-25/CC-MAIN-2021-25_segments_1623487643703.56_warc_CC-MAIN-20210619051239-20210619081239-00187.warc.gz\"}"} |
https://www.percentagecal.com/answer/what-is-%2010-percent-of-%2024500 | [
"#### Solution for What is 10 percent of 24500:\n\n10 percent * 24500 =\n\n( 10:100)* 24500 =\n\n( 10* 24500):100 =\n\n245000:100 = 2450\n\nNow we have: 10 percent of 24500 = 2450\n\nQuestion: What is 10 percent of 24500?\n\nPercentage solution with steps:\n\nStep 1: Our output value is 24500.\n\nStep 2: We represent the unknown value with {x}.\n\nStep 3: From step 1 above,{ 24500}={100\\%}.\n\nStep 4: Similarly, {x}={ 10\\%}.\n\nStep 5: This results in a pair of simple equations:\n\n{ 24500}={100\\%}(1).\n\n{x}={ 10\\%}(2).\n\nStep 6: By dividing equation 1 by equation 2 and noting that both the RHS (right hand side) of both\nequations have the same unit (%); we have\n\n\\frac{ 24500}{x}=\\frac{100\\%}{ 10\\%}\n\nStep 7: Again, the reciprocal of both sides gives\n\n\\frac{x}{ 24500}=\\frac{ 10}{100}\n\n\\Rightarrow{x} = {2450}\n\nTherefore, { 10\\%} of { 24500} is {2450}\n\n#### Solution for What is 24500 percent of 10:\n\n24500 percent * 10 =\n\n( 24500:100)* 10 =\n\n( 24500* 10):100 =\n\n245000:100 = 2450\n\nNow we have: 24500 percent of 10 = 2450\n\nQuestion: What is 24500 percent of 10?\n\nPercentage solution with steps:\n\nStep 1: Our output value is 10.\n\nStep 2: We represent the unknown value with {x}.\n\nStep 3: From step 1 above,{ 10}={100\\%}.\n\nStep 4: Similarly, {x}={ 24500\\%}.\n\nStep 5: This results in a pair of simple equations:\n\n{ 10}={100\\%}(1).\n\n{x}={ 24500\\%}(2).\n\nStep 6: By dividing equation 1 by equation 2 and noting that both the RHS (right hand side) of both\nequations have the same unit (%); we have\n\n\\frac{ 10}{x}=\\frac{100\\%}{ 24500\\%}\n\nStep 7: Again, the reciprocal of both sides gives\n\n\\frac{x}{ 10}=\\frac{ 24500}{100}\n\n\\Rightarrow{x} = {2450}\n\nTherefore, { 24500\\%} of { 10} is {2450}\n\nCalculation Samples"
] | [
null
] | {"ft_lang_label":"__label__en","ft_lang_prob":0.764586,"math_prob":0.99928135,"size":1984,"snap":"2020-45-2020-50","text_gpt3_token_len":729,"char_repetition_ratio":0.19040404,"word_repetition_ratio":0.3547486,"special_character_ratio":0.500504,"punctuation_ratio":0.15690866,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9999455,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2020-10-29T14:46:43Z\",\"WARC-Record-ID\":\"<urn:uuid:6d1b5425-b4ee-45cf-927c-7d53c9e76645>\",\"Content-Length\":\"10307\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:619fc5d6-e4c4-426a-8ad9-42b10424aa7d>\",\"WARC-Concurrent-To\":\"<urn:uuid:cef2e4b1-73c4-4b9e-99fb-ecf222fe0848>\",\"WARC-IP-Address\":\"217.23.5.136\",\"WARC-Target-URI\":\"https://www.percentagecal.com/answer/what-is-%2010-percent-of-%2024500\",\"WARC-Payload-Digest\":\"sha1:7T5EL6SGGB24VANIVRZTZ4AUGRAEG6IW\",\"WARC-Block-Digest\":\"sha1:VMOF3OFZEHYBHWEABOW72A5PX5VECWUA\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2020/CC-MAIN-2020-45/CC-MAIN-2020-45_segments_1603107904287.88_warc_CC-MAIN-20201029124628-20201029154628-00119.warc.gz\"}"} |
https://crypto.stackexchange.com/questions/68859/what-is-the-difference-between-discrete-then-gaussian-and-gaussian-then-discrete | [
"# What is the difference between discrete-then-gaussian and gaussian-then-discrete?\n\nIn lattice cryptography, we always face the probem of discrete gaussian sampling. To the beginners, it is a bit complex. However, gaussian sampling from a continous space is much easier to understand, and a lot of tools are available. Say, we can use MATLAB to do gaussian sampling very efficiently. So, I want to know what is the difference between the following to process:\n\n(1) discrete-then-gaussian: Just as required is many lattice cryptography papers.\n\n(2) gaussian-then-discrete: At first, get continous gaussian samples, say by using MATLAB, and then perform nearest rounding operations, i.e., discrete to the nearest integers.\n\n• The resulting distributions of (1) and (2) are not quite the same, and in some applications even a tiny difference in these distributions can be fatal for proving/guaranteeing security. – TMM Apr 18 at 1:11\n• @TMM Thanks! Can you give me more references or explanations on the differences? – Licheng Wang Apr 18 at 6:10\n• Simply from looking at both definitions you should be able to see there is no immediate reason for the two distributions to be equivalent - sure, they both mimic a continuous Gaussian on a discrete set, but the probability mass function is different. – TMM Apr 18 at 23:53"
] | [
null
] | {"ft_lang_label":"__label__en","ft_lang_prob":0.95144534,"math_prob":0.93686575,"size":634,"snap":"2019-51-2020-05","text_gpt3_token_len":134,"char_repetition_ratio":0.14285715,"word_repetition_ratio":0.0,"special_character_ratio":0.20347004,"punctuation_ratio":0.176,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9935185,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2019-12-08T01:18:05Z\",\"WARC-Record-ID\":\"<urn:uuid:9f1c5801-4b81-40b4-bfce-6031a894c225>\",\"Content-Length\":\"128038\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:2f9c3ae7-2122-43c1-b688-94183ffeff43>\",\"WARC-Concurrent-To\":\"<urn:uuid:ed3cdbab-fc28-4e2c-8df9-f9cf1fbef927>\",\"WARC-IP-Address\":\"151.101.129.69\",\"WARC-Target-URI\":\"https://crypto.stackexchange.com/questions/68859/what-is-the-difference-between-discrete-then-gaussian-and-gaussian-then-discrete\",\"WARC-Payload-Digest\":\"sha1:6KUHEZNZ7FUEF6BUSCPBRRZK5MJOGQT2\",\"WARC-Block-Digest\":\"sha1:Y5Q5BZAMJVLCMTIJROPEDTGL6XBBXUXG\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2019/CC-MAIN-2019-51/CC-MAIN-2019-51_segments_1575540503656.42_warc_CC-MAIN-20191207233943-20191208021943-00553.warc.gz\"}"} |
https://www.pustudy.com/calculators/calc/math/Arctan_Calculator.html | [
"# Arctan Calculator\n\nFor example, If the tangent of 45° is 1:\n\ntan(45°) = 1\n\nThen the arctangent of 1 is 45°:\n\narctan(1) = tan-1(1) = 45°\n\n## Arctangent table\n\ny x = arctan(y)\n-1.732050808 -60° -π/3\n-1 -45° -π/4\n-0.577350269 -30° -π/6\n0 0\n0.577350269 30° π/6\n1 45° π/4\n1.732050808 60° π/3\n\nHere we discuss list of online math calculators that help us for doing calculation easily.\n\n### Arctan Calculator\n\nThe arctan is the inverse of the tangent. It is normally represented by arctan(θ) or tan-1(θ).Use arctan calculator to easily calculate the arctan of a given number. Online arctangent calculation tool to compute the arcus tangens function in degrees or radians. Supports input of decimal numbers (0.5, 6, -1, etc.) and fractions (1/3, 3/4, 1/6, -4/3 etc.).\n\nArctangent definition\n\nThe arctangent function is the inverse function of y = tan(x).\n\narctan(y) = tan-1(y) = x+ kπ\n\nFor every\n\nk = {...,-2,-1,0,1,2,...}\n\nFor example, If the tangent of 45° is 1:\n\ntan(45°) = 1\n\nThen the arctangent of 1 is 45°:\n\narctan(1) = tan-1(1) = 45°\n\nHow to Use the Arctan Calculator?\n\nThe procedure to use the arctan calculator is as follows:\n\n1. Enter the tangent value in the respective input field\n\n2. Now click the button “Calculate Arctan” to get the angle\n\n3. Finally, the angle in both degree and radian measure will be displayed in the output field\n\nWhat is arctan?\n\nArctangent is the inverse of the tangent function. Simply speaking, we use arctan when we want to find an angle for which we know the tangent value.\n\nHowever, in the strictest sense, because the tangent is a periodic trigonometric function, it doesn't have an inverse function. Still, we can define an inverse function if we restrict the domain to the interval where the function is monotonic. Using the tan-1x convention may lead to confusion about the difference between arctangent and cotangent. It turns out that arctan and cot are really separate things:\n\n1. cot(x) = 1/tan(x), so cotangent is basically the reciprocal of a tangent, or, in other words, the multiplicative inverse\n\n2. arctan(x) is the angle whose tangent is x\n\nWe hope that now you do not doubt that arctan and cotan are different. To avoid any further misunderstandings, you may want to use the arctan(x) rather than tan-1x notation\n\nArctan function :- The arctan (a.k.a. arcus tangens) is one of the inverse trigonometric functions (antitrigonometric functions) and is the inverse of the tangent function. It is sometimes written as tan-1(x), but this notation should be avoided as it can cause confusion with an exponent notation. The arctan is used to obtain an angle from the tangent trigonometric ratio, which is the ratio between the side opposite to the angle and the adjacent side of the triangle.\n\nThe function spans all real numbers (-∞ - +∞) and so do the results from our calculator. The range of the angle values is usually between -90° and 90°. There are a number of arctan rules, like that tan(arctan(x)) = x, or that arctanα + arctanβ = arctan((α + β) / (1-αβ)), as well as sine of the arctangent: sin(arctan(x)) = x / √(1+x2), which can help you in trigonometry calculations."
] | [
null
] | {"ft_lang_label":"__label__en","ft_lang_prob":0.8200155,"math_prob":0.99828005,"size":3308,"snap":"2023-14-2023-23","text_gpt3_token_len":975,"char_repetition_ratio":0.1822034,"word_repetition_ratio":0.11270125,"special_character_ratio":0.286578,"punctuation_ratio":0.12071535,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.99936527,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2023-05-31T20:26:11Z\",\"WARC-Record-ID\":\"<urn:uuid:1faf278f-c439-4d84-ab22-e43de4f1b28d>\",\"Content-Length\":\"23388\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:b348e786-ce94-4c6c-924e-d2793442079d>\",\"WARC-Concurrent-To\":\"<urn:uuid:efdef45a-50c9-497f-988e-62dc0602e273>\",\"WARC-IP-Address\":\"103.93.17.55\",\"WARC-Target-URI\":\"https://www.pustudy.com/calculators/calc/math/Arctan_Calculator.html\",\"WARC-Payload-Digest\":\"sha1:HK2OFJY35ZWWSMHANP2OSYVX7WXFOUVY\",\"WARC-Block-Digest\":\"sha1:QG3SNTJ536WIDF7X5376GNSU2Y5SHLXS\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2023/CC-MAIN-2023-23/CC-MAIN-2023-23_segments_1685224647409.17_warc_CC-MAIN-20230531182033-20230531212033-00497.warc.gz\"}"} |
https://featheressays.com/let-professional-handle-your-assignment-get-an-a-cloud-architectures-application-121/ | [
"Referencing Styles : APA Part A Circuit Option 1: Part A Only (35 marks):The implementation for this part must use only the three basic logic gates (AND, OR, NOT) with maximum 2 inputs.You are required to implement a circuit where the user (you) can input a key value (K1, K2, and K3) and a lock value (L1, L2, and L3) and the circuit decodes the K1, K2, K3 and L1, L2, L3 values using a decoder (see lecture notes) as well as other permitted logic gates to determine if the key matches the lock.The output will be a single L … View More Part A Circuit Option 1: Part A Only (35 marks): The implementation for this part must use only the three basic logic gates (AND, OR, NOT) with maximum 2 inputs. You are required to implement a circuit where the user (you) can input a key value (K1, K2, and K3) and a lock value (L1, L2, and L3) and the circuit decodes the K1, K2, K3 and L1, L2, L3 values using a decoder (see lecture notes) as well as other permitted logic gates to determine if the key matches the lock. The output will be a single LED labelled OPEN which is lit if the key matches the lock, and is not lit if the key and lock are different. Part B Circuit Option 2: Part A and Part B (60 marks): For this part, the lock allows a certain number (n) of incorrect attempts. The number of times an invalid key value can be input ranges from 0 to 7 and should be set via a combination of three separate inputs: X1, X2 and X3 Note: You can combine the 3 inputs into a single 3 bit input. With an n value of 0 you can make 0 incorrect key attempts (ie. The first attempt has to work and the OPEN LED has to light up and be set to 1). Using the same circuit as Part A, add additional circuitry to count how many incorrect attempts have been made. Read Less"
] | [
null
] | {"ft_lang_label":"__label__en","ft_lang_prob":0.86670923,"math_prob":0.9841381,"size":1757,"snap":"2020-24-2020-29","text_gpt3_token_len":459,"char_repetition_ratio":0.12093554,"word_repetition_ratio":0.44606414,"special_character_ratio":0.26465565,"punctuation_ratio":0.10997442,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.97470886,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2020-06-06T09:47:58Z\",\"WARC-Record-ID\":\"<urn:uuid:78963a6f-4c9c-4c9d-a331-27892484d02d>\",\"Content-Length\":\"50151\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:ab6aef0c-3e98-4b0f-b5c7-33cba52a4971>\",\"WARC-Concurrent-To\":\"<urn:uuid:53c1a2df-8268-4649-920f-bd52ace7d160>\",\"WARC-IP-Address\":\"198.54.114.164\",\"WARC-Target-URI\":\"https://featheressays.com/let-professional-handle-your-assignment-get-an-a-cloud-architectures-application-121/\",\"WARC-Payload-Digest\":\"sha1:MZDNAJYL27AQSUTHFM6VYX5OQ4SEV3RU\",\"WARC-Block-Digest\":\"sha1:VXLVNUJXLU3ZNKQ2RRHSDCX2LGYJEZJ4\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2020/CC-MAIN-2020-24/CC-MAIN-2020-24_segments_1590348513230.90_warc_CC-MAIN-20200606093706-20200606123706-00180.warc.gz\"}"} |
https://www.nel.edu/rheological-properties-of-myometrium-experimental-quantification-and-mathematical-modeling-1390/ | [
"",
null,
"# Rheological properties of myometrium: experimental quantification and mathematical modeling.\n\nJournal Article 2008; 29(4): 454-460 PubMed PMID: 18766144\n\n: This work answers some questions related to detection of rheological properties of soft tissues exemplified in myometrium, stressed by external tensile force. In the first stage of the experiment the tissue samples were ciclically stressed and response loops were recorded. This test proved severe plastical deformation of samples, which is not usually being stated for living tissues. In addition to course, growth and stabilizing this deformation also energetical losses of individual hysteresis loops of the response were evaluated. In the second stage of the experiment the tissue samples were exposed to a loading force changed in step-wise manner in four steps. The sample response to each force step was processed and evaluated separately to obtain basic properties of used model. In next step, the changes in model characteristics were obtained and evaluated for each element in subsequent force steps. By reason of following easier interpretation, the quite simple visco-elastic model, defined by differential equation with analytic solution, is used. The results prove necessary to introduce in model both spring and damper constants dependent on the magnitude of the loading force and one damper with even time dependent constant. The interindividual variability of characteristic values of the model elements is surprisingly low. On the other side, they are strongly dependent on load magnitude. Complete mathematical model of uterine wall tissue is obtained by amending the principal equation by formulas describing changes in individual components of the model."
] | [
null,
"https://www.nel.edu//www/default/templates/img/logo-new.png",
null
] | {"ft_lang_label":"__label__en","ft_lang_prob":0.9583129,"math_prob":0.8934327,"size":1577,"snap":"2023-40-2023-50","text_gpt3_token_len":281,"char_repetition_ratio":0.10743801,"word_repetition_ratio":0.034334764,"special_character_ratio":0.16423589,"punctuation_ratio":0.08108108,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9692561,"pos_list":[0,1,2],"im_url_duplicate_count":[null,null,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2023-12-03T00:13:33Z\",\"WARC-Record-ID\":\"<urn:uuid:9859073f-3985-4dba-979a-66cbb9454838>\",\"Content-Length\":\"30856\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:e98f3ccd-471b-4fa2-804c-e416c21cf29e>\",\"WARC-Concurrent-To\":\"<urn:uuid:06310b23-0757-4a11-a81b-d46670a7f60c>\",\"WARC-IP-Address\":\"46.4.116.125\",\"WARC-Target-URI\":\"https://www.nel.edu/rheological-properties-of-myometrium-experimental-quantification-and-mathematical-modeling-1390/\",\"WARC-Payload-Digest\":\"sha1:SGE2PY5SUHD3BLRCVSIWJ75XFU2UJ5B3\",\"WARC-Block-Digest\":\"sha1:4R63ZEM63ZO4LOWNRQ6H2R7JUBNMVRZT\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2023/CC-MAIN-2023-50/CC-MAIN-2023-50_segments_1700679100476.94_warc_CC-MAIN-20231202235258-20231203025258-00600.warc.gz\"}"} |
https://www.srcmini.com/31093.html | [
"# SciPy spatial模块:实现三角剖分\n\nscipy.spatial软件包可以利用Qhull库来计算一组点的三角剖分, Voronoi图和凸包。同样, 它包含用于最近邻点查询的KDTree实现以及用于各种度量中距离计算的实用程序。\n\n• Delaunay三角剖分\n\n``````from scipy.spatial import Delaunay\nimport numpy as np\nimport matplotlib.pyplot as plt\npoints = np.array([[0, 3], [1, 1.1], [1, 4], [1, 2]])\ntriang = Delaunay(points)\nplt.triplot(points[:, 0], points[:, 1], triang.simplices.copy())\nplt.plot(points[:, 0], points[:, 1], 'o')\nplt.show()``````\n\n### 共平面点\n\n``````from scipy.spatial import Delaunay\npoints = np.array([[0, 0], [0, 1], [1, 0], [1, 1], [1, 1]])\ntri = Delaunay(points)\nprint(tri.coplanar)``````\n\n``[[4 0 3]]``\n\n### 凸包\n\n``````from scipy.spatial import ConvexHull\nimport matplotlib.pyplot as plt\npoints = np.random.rand(10, 2) # 30 random points in 2-D\nhull = ConvexHull(points)\nplt.plot(points[:, 0], points[:, 1], 'o')\nfor simplex in hull.simplices:\nplt.plot(points[simplex, 0], points[simplex, 1], 'k-')\nplt.show()``````\n\n### Scipy cdist\n\nSciPy提供了space.distance.cdist, 用于计算两个输入集合中的每对之间的距离。以下是调用约定:\n\n1. Y = cdist(XA, XB, ‘欧几里得’)\n\n2. Y = cdist(XA, XB, ‘minkowski’, p = 2。)\n\n3. Y = cdist(XA, XB, ” cityblock”)\n\n• 回顶"
] | [
null
] | {"ft_lang_label":"__label__zh","ft_lang_prob":0.50074553,"math_prob":0.9990951,"size":1382,"snap":"2023-14-2023-23","text_gpt3_token_len":828,"char_repetition_ratio":0.13860668,"word_repetition_ratio":0.04137931,"special_character_ratio":0.30028942,"punctuation_ratio":0.2967033,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9983799,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2023-05-30T23:20:34Z\",\"WARC-Record-ID\":\"<urn:uuid:71bffe6e-e391-40a5-ab6b-9057f8485d10>\",\"Content-Length\":\"63600\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:2dd17a1f-a210-4b35-b55a-86597e880d9c>\",\"WARC-Concurrent-To\":\"<urn:uuid:2855eb12-681d-4072-a6ec-2c6c823eeae3>\",\"WARC-IP-Address\":\"23.224.179.19\",\"WARC-Target-URI\":\"https://www.srcmini.com/31093.html\",\"WARC-Payload-Digest\":\"sha1:SFXPK374NC5NV6TKZW4EDMZB6TUC6V3K\",\"WARC-Block-Digest\":\"sha1:74NMYI3BIJQR6ELJEJDKCGP5WTM4BUFS\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2023/CC-MAIN-2023-23/CC-MAIN-2023-23_segments_1685224646181.29_warc_CC-MAIN-20230530230622-20230531020622-00661.warc.gz\"}"} |
https://www.litscape.com/word_analysis/palaeophytes | [
"# palaeophytes in Scrabble®\n\nThe word palaeophytes is playable in Scrabble®, no blanks required. Because it is longer than 7 letters, you would have to play off an existing word or do it in several moves.\n\nPALAEOPHYTES\n(261)\n\n## Seven Letter Word Alert: (27 words)\n\napostle, appeals, appease, applets, asphalt, eophyte, eyelash, eyeshot, eyespot, heeltap, heptose, hopples, laptops, loathes, oleates, palates, paleate, palpate, papalty, peoples, popeyes, shapely, spyhole, steeply, taphole, teashop, topples\n\nPALAEOPHYTES\n(261)\nPALAEOPHYTES\n(216)\nPALAEOPHYTES\n(174)\nPALAEOPHYTES\n(144)\nPALAEOPHYTES\n(116)\nPALAEOPHYTES\n(108)\nPALAEOPHYTES\n(104)\nPALAEOPHYTES\n(100)\nPALAEOPHYTES\n(96)\nPALAEOPHYTES\n(92)\nPALAEOPHYTES\n(88)\nPALAEOPHYTES\n(88)\nPALAEOPHYTES\n(88)\nPALAEOPHYTES\n(88)\nPALAEOPHYTES\n(72)\nPALAEOPHYTES\n(72)\nPALAEOPHYTES\n(64)\nPALAEOPHYTES\n(64)\nPALAEOPHYTES\n(60)\nPALAEOPHYTES\n(58)\nPALAEOPHYTES\n(52)\nPALAEOPHYTES\n(48)\nPALAEOPHYTES\n(48)\nPALAEOPHYTES\n(48)\nPALAEOPHYTES\n(38)\nPALAEOPHYTES\n(34)\nPALAEOPHYTES\n(32)\nPALAEOPHYTES\n(30)\nPALAEOPHYTES\n(30)\nPALAEOPHYTES\n(29)\nPALAEOPHYTES\n(28)\nPALAEOPHYTES\n(25)\n\nPALAEOPHYTES\n(261)\nPALAEOPHYTES\n(216)\nPALAEOPHYTES\n(174)\nPALAEOPHYTES\n(144)\nPALAEOPHYTES\n(116)\nSPYHOLE\n(110 = 60 + 50)\nEOPHYTE\n(110 = 60 + 50)\nSHAPELY\n(110 = 60 + 50)\nPALAEOPHYTES\n(108)\nSPYHOLE\n(107 = 57 + 50)\nSHAPELY\n(107 = 57 + 50)\nSHAPELY\n(107 = 57 + 50)\nEOPHYTE\n(107 = 57 + 50)\nSPYHOLE\n(107 = 57 + 50)\nSPYHOLE\n(107 = 57 + 50)\nEOPHYTE\n(107 = 57 + 50)\nEOPHYTE\n(107 = 57 + 50)\nPOPEYES\n(106 = 56 + 50)\nPAPALTY\n(106 = 56 + 50)\nHOPPLES\n(106 = 56 + 50)\nPAPALTY\n(104 = 54 + 50)\nSHAPELY\n(104 = 54 + 50)\nSPYHOLE\n(104 = 54 + 50)\nPALAEOPHYTES\n(104)\nEOPHYTE\n(104 = 54 + 50)\nPOPEYES\n(104 = 54 + 50)\nHOPPLES\n(104 = 54 + 50)\nSHAPELY\n(104 = 54 + 50)\nEYESHOT\n(102 = 52 + 50)\nEYELASH\n(102 = 52 + 50)\nHOPPLES\n(101 = 51 + 50)\nPOPEYES\n(101 = 51 + 50)\nPAPALTY\n(101 = 51 + 50)\nPOPEYES\n(101 = 51 + 50)\nHOPPLES\n(101 = 51 + 50)\nEYESHOT\n(101 = 51 + 50)\nEYESHOT\n(101 = 51 + 50)\nEYELASH\n(101 = 51 + 50)\nHOPPLES\n(101 = 51 + 50)\nEYELASH\n(101 = 51 + 50)\nPAPALTY\n(101 = 51 + 50)\nPALAEOPHYTES\n(100)\nSHAPELY\n(98 = 48 + 50)\nSTEEPLY\n(98 = 48 + 50)\nHEPTOSE\n(98 = 48 + 50)\nSHAPELY\n(98 = 48 + 50)\nTAPHOLE\n(98 = 48 + 50)\nHEPTOSE\n(98 = 48 + 50)\nEOPHYTE\n(98 = 48 + 50)\nEYESPOT\n(98 = 48 + 50)\nTAPHOLE\n(98 = 48 + 50)\nEOPHYTE\n(98 = 48 + 50)\nSHAPELY\n(98 = 48 + 50)\nTAPHOLE\n(98 = 48 + 50)\nSTEEPLY\n(98 = 48 + 50)\nEYESPOT\n(98 = 48 + 50)\nTEASHOP\n(98 = 48 + 50)\nTEASHOP\n(98 = 48 + 50)\nASPHALT\n(98 = 48 + 50)\nEOPHYTE\n(98 = 48 + 50)\nSHAPELY\n(98 = 48 + 50)\nASPHALT\n(98 = 48 + 50)\nEOPHYTE\n(98 = 48 + 50)\nSPYHOLE\n(98 = 48 + 50)\nSPYHOLE\n(98 = 48 + 50)\nHEELTAP\n(98 = 48 + 50)\nASPHALT\n(98 = 48 + 50)\nSPYHOLE\n(98 = 48 + 50)\nSPYHOLE\n(98 = 48 + 50)\nHEELTAP\n(98 = 48 + 50)\nSHAPELY\n(96 = 46 + 50)\nEOPHYTE\n(96 = 46 + 50)\nPALAEOPHYTES\n(96)\nSPYHOLE\n(96 = 46 + 50)\nHOPPLES\n(95 = 45 + 50)\nPAPALTY\n(95 = 45 + 50)\nHEPTOSE\n(95 = 45 + 50)\nEYESPOT\n(95 = 45 + 50)\nPOPEYES\n(95 = 45 + 50)\nTEASHOP\n(95 = 45 + 50)\nHOPPLES\n(95 = 45 + 50)\nHOPPLES\n(95 = 45 + 50)\nEOPHYTE\n(95 = 45 + 50)\nHOPPLES\n(95 = 45 + 50)\nTAPHOLE\n(95 = 45 + 50)\nSPYHOLE\n(95 = 45 + 50)\nPAPALTY\n(95 = 45 + 50)\nPAPALTY\n(95 = 45 + 50)\nASPHALT\n(95 = 45 + 50)\nPOPEYES\n(95 = 45 + 50)\nSTEEPLY\n(95 = 45 + 50)\nPAPALTY\n(95 = 45 + 50)\nPAPALTY\n(95 = 45 + 50)\nPOPEYES\n(95 = 45 + 50)\nHEELTAP\n(95 = 45 + 50)\nSHAPELY\n(95 = 45 + 50)\nPOPEYES\n(95 = 45 + 50)\nPOPEYES\n(95 = 45 + 50)\nPOPEYES\n(94 = 44 + 50)\nPEOPLES\n(94 = 44 + 50)\nTOPPLES\n(94 = 44 + 50)\nAPPLETS\n(94 = 44 + 50)\nPALPATE\n(94 = 44 + 50)\nLAPTOPS\n(94 = 44 + 50)\nAPPEASE\n(94 = 44 + 50)\nAPPEALS\n(94 = 44 + 50)\nLAPTOPS\n(92 = 42 + 50)\nEYESHOT\n(92 = 42 + 50)\nLOATHES\n(92 = 42 + 50)\nAPPLETS\n(92 = 42 + 50)\nEYESHOT\n(92 = 42 + 50)\nEYESHOT\n(92 = 42 + 50)\nPEOPLES\n(92 = 42 + 50)\nEYESHOT\n(92 = 42 + 50)\nAPPLETS\n(92 = 42 + 50)\nEYESHOT\n(92 = 42 + 50)\nPOPEYES\n(92 = 42 + 50)\nPEOPLES\n(92 = 42 + 50)\nLAPTOPS\n(92 = 42 + 50)\nPEOPLES\n(92 = 42 + 50)\nEYESHOT\n(92 = 42 + 50)\nEYELASH\n(92 = 42 + 50)\nPALAEOPHYTES\n(92)\nEYESHOT\n(92 = 42 + 50)\nPALPATE\n(92 = 42 + 50)\nEYELASH\n(92 = 42 + 50)\nEYELASH\n(92 = 42 + 50)\nEYELASH\n(92 = 42 + 50)\nEYELASH\n(92 = 42 + 50)\nHOPPLES\n(92 = 42 + 50)\nTOPPLES\n(92 = 42 + 50)\nTOPPLES\n(92 = 42 + 50)\nTOPPLES\n(92 = 42 + 50)\nEYELASH\n(92 = 42 + 50)\nEYELASH\n(92 = 42 + 50)\nSPYHOLE\n(92 = 42 + 50)\nPAPALTY\n(92 = 42 + 50)\nEYESHOT\n(92 = 42 + 50)\nPALPATE\n(92 = 42 + 50)\nEOPHYTE\n(92 = 42 + 50)\nAPPEASE\n(92 = 42 + 50)\nAPPEASE\n(92 = 42 + 50)\nHOPPLES\n(92 = 42 + 50)\nPALPATE\n(92 = 42 + 50)\nAPPEALS\n(92 = 42 + 50)\nAPPEALS\n(92 = 42 + 50)\nTEASHOP\n(90 = 40 + 50)\nEYESPOT\n(90 = 40 + 50)\nPOPEYES\n(90 = 40 + 50)\nEOPHYTE\n(90 = 40 + 50)\nPAPALTY\n(90 = 40 + 50)\nSHAPELY\n(90 = 40 + 50)\nPOPEYES\n(90 = 40 + 50)\nSPYHOLE\n(90 = 40 + 50)\nPAPALTY\n(90 = 40 + 50)\nHOPPLES\n(90 = 40 + 50)\nLOATHES\n(90 = 40 + 50)\nEYELASH\n(89 = 39 + 50)\nEYESPOT\n(89 = 39 + 50)\nHEELTAP\n(89 = 39 + 50)\nSTEEPLY\n(89 = 39 + 50)\nASPHALT\n(89 = 39 + 50)\nHEPTOSE\n(89 = 39 + 50)\nASPHALT\n(89 = 39 + 50)\nHEPTOSE\n(89 = 39 + 50)\nHEELTAP\n(89 = 39 + 50)\nASPHALT\n(89 = 39 + 50)\nHEPTOSE\n(89 = 39 + 50)\nHEELTAP\n(89 = 39 + 50)\nHEPTOSE\n(89 = 39 + 50)\nTAPHOLE\n(89 = 39 + 50)\nHEPTOSE\n(89 = 39 + 50)\nHEELTAP\n(89 = 39 + 50)\nHEELTAP\n(89 = 39 + 50)\nEYESPOT\n(89 = 39 + 50)\nTEASHOP\n(89 = 39 + 50)\nASPHALT\n(89 = 39 + 50)\nTAPHOLE\n(89 = 39 + 50)\nTAPHOLE\n(89 = 39 + 50)\nTAPHOLE\n(89 = 39 + 50)\nHEELTAP\n(89 = 39 + 50)\nEYESPOT\n(89 = 39 + 50)\nTEASHOP\n(89 = 39 + 50)\nEYESPOT\n(89 = 39 + 50)\nASPHALT\n(89 = 39 + 50)\nSTEEPLY\n(89 = 39 + 50)\nHEPTOSE\n(89 = 39 + 50)\nSTEEPLY\n(89 = 39 + 50)\nSTEEPLY\n(89 = 39 + 50)\nTEASHOP\n(89 = 39 + 50)\nSTEEPLY\n(89 = 39 + 50)\nEYESPOT\n(89 = 39 + 50)\nEYESPOT\n(89 = 39 + 50)\nTEASHOP\n(89 = 39 + 50)\nTAPHOLE\n(89 = 39 + 50)\nTEASHOP\n(89 = 39 + 50)\nEYESHOT\n(89 = 39 + 50)\nTEASHOP\n(89 = 39 + 50)\nSTEEPLY\n(89 = 39 + 50)\nEOPHYTE\n(88 = 38 + 50)\n\n# palaeophytes in Words With Friends™\n\nThe word palaeophytes is playable in Words With Friends™, no blanks required. Because it is longer than 7 letters, you would have to play off an existing word or do it in several moves.\n\nPALAEOPHYTES\n(333)\n\n## Seven Letter Word Alert: (27 words)\n\napostle, appeals, appease, applets, asphalt, eophyte, eyelash, eyeshot, eyespot, heeltap, heptose, hopples, laptops, loathes, oleates, palates, paleate, palpate, papalty, peoples, popeyes, shapely, spyhole, steeply, taphole, teashop, topples\n\nPALAEOPHYTES\n(333)\nPALAEOPHYTES\n(297)\nPALAEOPHYTES\n(279)\nPALAEOPHYTES\n(243)\nPALAEOPHYTES\n(222)\nPALAEOPHYTES\n(162)\nPALAEOPHYTES\n(112)\nPALAEOPHYTES\n(100)\nPALAEOPHYTES\n(100)\nPALAEOPHYTES\n(96)\nPALAEOPHYTES\n(92)\nPALAEOPHYTES\n(92)\nPALAEOPHYTES\n(92)\nPALAEOPHYTES\n(92)\nPALAEOPHYTES\n(70)\nPALAEOPHYTES\n(62)\nPALAEOPHYTES\n(62)\nPALAEOPHYTES\n(58)\nPALAEOPHYTES\n(54)\nPALAEOPHYTES\n(54)\nPALAEOPHYTES\n(33)\nPALAEOPHYTES\n(33)\nPALAEOPHYTES\n(32)\nPALAEOPHYTES\n(29)\nPALAEOPHYTES\n(29)\nPALAEOPHYTES\n(29)\nPALAEOPHYTES\n(29)\nPALAEOPHYTES\n(28)\nPALAEOPHYTES\n(28)\nPALAEOPHYTES\n(26)\nPALAEOPHYTES\n(26)\nPALAEOPHYTES\n(25)\n\nPALAEOPHYTES\n(333)\nPALAEOPHYTES\n(297)\nPALAEOPHYTES\n(279)\nPALAEOPHYTES\n(243)\nPALAEOPHYTES\n(222)\nPALAEOPHYTES\n(162)\nPAPALTY\n(131 = 96 + 35)\nPOPEYES\n(128 = 93 + 35)\nHOPPLES\n(125 = 90 + 35)\nSHAPELY\n(122 = 87 + 35)\nSPYHOLE\n(122 = 87 + 35)\nSTEEPLY\n(116 = 81 + 35)\nSHAPELY\n(116 = 81 + 35)\nPAPALTY\n(113 = 78 + 35)\nAPPLETS\n(113 = 78 + 35)\nLAPTOPS\n(113 = 78 + 35)\nHOPPLES\n(113 = 78 + 35)\nPALPATE\n(113 = 78 + 35)\nHEPTOSE\n(113 = 78 + 35)\nTEASHOP\n(113 = 78 + 35)\nHOPPLES\n(113 = 78 + 35)\nPALAEOPHYTES\n(112)\nSPYHOLE\n(110 = 75 + 35)\nPEOPLES\n(107 = 72 + 35)\nTOPPLES\n(107 = 72 + 35)\nHOPPLES\n(107 = 72 + 35)\nPEOPLES\n(107 = 72 + 35)\nPALPATE\n(107 = 72 + 35)\nTOPPLES\n(107 = 72 + 35)\nTOPPLES\n(107 = 72 + 35)\nAPPEALS\n(107 = 72 + 35)\nAPPEALS\n(107 = 72 + 35)\nHOPPLES\n(107 = 72 + 35)\nEOPHYTE\n(107 = 72 + 35)\nPAPALTY\n(107 = 72 + 35)\nPEOPLES\n(107 = 72 + 35)\nPALPATE\n(107 = 72 + 35)\nAPPLETS\n(107 = 72 + 35)\nLAPTOPS\n(107 = 72 + 35)\nAPPEASE\n(104 = 69 + 35)\nPOPEYES\n(104 = 69 + 35)\nSHAPELY\n(104 = 69 + 35)\nSHAPELY\n(104 = 69 + 35)\nPALEATE\n(104 = 69 + 35)\nSHAPELY\n(104 = 69 + 35)\nHEELTAP\n(104 = 69 + 35)\nPOPEYES\n(104 = 69 + 35)\nAPPEASE\n(104 = 69 + 35)\nTAPHOLE\n(104 = 69 + 35)\nTAPHOLE\n(104 = 69 + 35)\nASPHALT\n(104 = 69 + 35)\nASPHALT\n(104 = 69 + 35)\nSPYHOLE\n(104 = 69 + 35)\nPALATES\n(104 = 69 + 35)\nSPYHOLE\n(104 = 69 + 35)\nPEOPLES\n(101 = 66 + 35)\nTOPPLES\n(101 = 66 + 35)\nPALPATE\n(101 = 66 + 35)\nPEOPLES\n(101 = 66 + 35)\nAPPEALS\n(101 = 66 + 35)\nEYESPOT\n(101 = 66 + 35)\nEOPHYTE\n(101 = 66 + 35)\nPEOPLES\n(101 = 66 + 35)\nEOPHYTE\n(101 = 66 + 35)\nLAPTOPS\n(101 = 66 + 35)\nEYELASH\n(101 = 66 + 35)\nPALPATE\n(101 = 66 + 35)\nEOPHYTE\n(101 = 66 + 35)\nHOPPLES\n(101 = 66 + 35)\nPALPATE\n(101 = 66 + 35)\nPAPALTY\n(101 = 66 + 35)\nHOPPLES\n(101 = 66 + 35)\nAPPLETS\n(101 = 66 + 35)\nTOPPLES\n(101 = 66 + 35)\nPALAEOPHYTES\n(100)\nPALAEOPHYTES\n(100)\nHOPPLES\n(99 = 64 + 35)\nPAPALTY\n(99 = 64 + 35)\nHOPPLES\n(99 = 64 + 35)\nHOPPLES\n(99 = 64 + 35)\nPAPALTY\n(99 = 64 + 35)\nPAPALTY\n(99 = 64 + 35)\nAPPEASE\n(98 = 63 + 35)\nHEELTAP\n(98 = 63 + 35)\nAPOSTLE\n(98 = 63 + 35)\nHEELTAP\n(98 = 63 + 35)\nASPHALT\n(98 = 63 + 35)\nSHAPELY\n(98 = 63 + 35)\nSPYHOLE\n(98 = 63 + 35)\nSHAPELY\n(98 = 63 + 35)\nTAPHOLE\n(98 = 63 + 35)\nSPYHOLE\n(98 = 63 + 35)\nPALAEOPHYTES\n(96)\nPOPEYES\n(95 = 60 + 35)\nSPYHOLE\n(95 = 60 + 35)\nSHAPELY\n(95 = 60 + 35)\nTEASHOP\n(95 = 60 + 35)\nEYELASH\n(95 = 60 + 35)\nPOPEYES\n(95 = 60 + 35)\nPAPALTY\n(95 = 60 + 35)\nTOPPLES\n(95 = 60 + 35)\nSPYHOLE\n(95 = 60 + 35)\nPAPALTY\n(95 = 60 + 35)\nEYESPOT\n(95 = 60 + 35)\nPOPEYES\n(95 = 60 + 35)\nEOPHYTE\n(95 = 60 + 35)\nAPPEALS\n(95 = 60 + 35)\nSHAPELY\n(95 = 60 + 35)\nPEOPLES\n(95 = 60 + 35)\nAPPLETS\n(95 = 60 + 35)\nSHAPELY\n(95 = 60 + 35)\nSPYHOLE\n(95 = 60 + 35)\nEOPHYTE\n(95 = 60 + 35)\nPALAEOPHYTES\n(92)\nASPHALT\n(92 = 57 + 35)\nPALAEOPHYTES\n(92)\nTAPHOLE\n(92 = 57 + 35)\nPALAEOPHYTES\n(92)\nASPHALT\n(92 = 57 + 35)\nHEELTAP\n(92 = 57 + 35)\nPOPEYES\n(92 = 57 + 35)\nTAPHOLE\n(92 = 57 + 35)\nSTEEPLY\n(92 = 57 + 35)\nSHAPELY\n(92 = 57 + 35)\nSPYHOLE\n(92 = 57 + 35)\nPALAEOPHYTES\n(92)\nSTEEPLY\n(92 = 57 + 35)\nPOPEYES\n(92 = 57 + 35)\nAPOSTLE\n(92 = 57 + 35)\nSHAPELY\n(92 = 57 + 35)\nEYESHOT\n(92 = 57 + 35)\nPALEATE\n(92 = 57 + 35)\nHEELTAP\n(92 = 57 + 35)\nSPYHOLE\n(92 = 57 + 35)\nEYESHOT\n(92 = 57 + 35)\nHEELTAP\n(92 = 57 + 35)\nPALATES\n(92 = 57 + 35)\nAPPEALS\n(91 = 56 + 35)\nAPPEALS\n(91 = 56 + 35)\nTOPPLES\n(91 = 56 + 35)\nAPPEALS\n(91 = 56 + 35)\nEOPHYTE\n(91 = 56 + 35)\nPALPATE\n(91 = 56 + 35)\nEOPHYTE\n(91 = 56 + 35)\nLAPTOPS\n(91 = 56 + 35)\nTOPPLES\n(91 = 56 + 35)\nPALPATE\n(91 = 56 + 35)\nPALPATE\n(91 = 56 + 35)\nAPPLETS\n(91 = 56 + 35)\nLAPTOPS\n(91 = 56 + 35)\nTOPPLES\n(91 = 56 + 35)\nAPPLETS\n(91 = 56 + 35)\nPEOPLES\n(91 = 56 + 35)\nPEOPLES\n(91 = 56 + 35)\nLAPTOPS\n(91 = 56 + 35)\nEOPHYTE\n(91 = 56 + 35)\nAPPLETS\n(91 = 56 + 35)\nPEOPLES\n(91 = 56 + 35)\nPOPEYE\n(90)\nHOPPLES\n(89 = 54 + 35)\nPAPALTY\n(89 = 54 + 35)\nPAPALTY\n(89 = 54 + 35)\nPALPATE\n(89 = 54 + 35)\nLAPTOPS\n(89 = 54 + 35)\nPAPALTY\n(89 = 54 + 35)\nLAPTOPS\n(89 = 54 + 35)\nAPPEALS\n(89 = 54 + 35)\nLAPTOPS\n(89 = 54 + 35)\nAPPEALS\n(89 = 54 + 35)\nPAPALTY\n(89 = 54 + 35)\nHOPPLES\n(89 = 54 + 35)\nHEPTOSE\n(89 = 54 + 35)\nHOPPLES\n(89 = 54 + 35)\nEYELASH\n(89 = 54 + 35)\nEYELASH\n(89 = 54 + 35)\nAPPLETS\n(89 = 54 + 35)\nAPPLETS\n(89 = 54 + 35)\nEYELASH\n(89 = 54 + 35)\nLOATHES\n(89 = 54 + 35)\nAPPLETS\n(89 = 54 + 35)\nEYESPOT\n(89 = 54 + 35)\nSLOPPY\n(87)\nASPHALT\n(87 = 52 + 35)\nTAPHOLE\n(87 = 52 + 35)\nTAPHOLE\n(87 = 52 + 35)\nAPPEASE\n(87 = 52 + 35)\nHOPPLE\n(87)\nASPHALT\n(87 = 52 + 35)\nTAPHOLE\n(87 = 52 + 35)\nSTEEPLY\n(87 = 52 + 35)\nHEELTAP\n(87 = 52 + 35)\nAPPEASE\n(87 = 52 + 35)\nHEELTAP\n(87 = 52 + 35)\nHEELTAP\n(87 = 52 + 35)\nSTEEPLY\n(87 = 52 + 35)\nASPHALT\n(87 = 52 + 35)\nAPPEASE\n(87 = 52 + 35)\nSTEEPLY\n(87 = 52 + 35)\nPOPEYES\n(86 = 51 + 35)\nHEELTAP\n(86 = 51 + 35)\n\n# Word Growth involving palaeophytes\n\n## Shorter words in palaeophytes\n\neophyte eophytes\n\neophyte palaeophyte\n\nla palaeophyte\n\npa pal palaeophyte\n\n## Longer words containing palaeophytes\n\n(No longer words found)"
] | [
null
] | {"ft_lang_label":"__label__en","ft_lang_prob":0.7166679,"math_prob":1.0000077,"size":1216,"snap":"2023-40-2023-50","text_gpt3_token_len":411,"char_repetition_ratio":0.23267327,"word_repetition_ratio":0.6883117,"special_character_ratio":0.19407895,"punctuation_ratio":0.2792793,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.99986386,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2023-09-22T00:43:26Z\",\"WARC-Record-ID\":\"<urn:uuid:a0ce5e22-3c8e-4165-8f20-8c875b31e794>\",\"Content-Length\":\"170029\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:7c27421e-7041-4579-b8db-578686834603>\",\"WARC-Concurrent-To\":\"<urn:uuid:8ca58ff7-8da8-44e5-9a9d-15bcad1bbf35>\",\"WARC-IP-Address\":\"104.21.48.183\",\"WARC-Target-URI\":\"https://www.litscape.com/word_analysis/palaeophytes\",\"WARC-Payload-Digest\":\"sha1:HFP4KVL2ATD6ITUPLS2PV6IA54PQ6MHW\",\"WARC-Block-Digest\":\"sha1:4PWOBD23NONCAUNY2ADE5PQ3OWM7DN6L\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2023/CC-MAIN-2023-40/CC-MAIN-2023-40_segments_1695233506320.28_warc_CC-MAIN-20230922002008-20230922032008-00337.warc.gz\"}"} |
https://patents.justia.com/patent/5414428 | [
"# Radar system with pulse compression and range sidelobe suppression preceding doppler filtering\n\n- Martin Marietta Corp.\n\nA radar system transmits dispersed pulses, and receives echoes from targets. The echo signals are digitized and applied over a number of signal paths. In each signal path except one, the digitized signal is multiplied by one of a plurality of differential exponential signals, for converting the echo signal of different exponential signals, for converting the echo signal in each path to baseband, with the baseband frequency representing a particular Doppler which depends upon the exponential signal. In the one remaining signal path, no multiplier is used, and the echo signal is deemed to be at baseband. The signals in each path are applied through a cascade of a pulse compressor and a range sidelobe suppressor. Since Doppler filtering has not yet taken place, full compression and range sidelobe reduction is not achieved, because of extraneous pulse-to-pulse phase shifts. The signals in each signal path are applied to a filter element of a pulse-to-pulse Doppler filter bank, which removes the extraneous phase shifts, and thereby provides full suppression of the range sidelobes.\n\n## Description\n\n#### FIELD OF THE INVENTION\n\nThis invention relates to radar systems generally, and more specifically to arrangements for reducing range sidelobes in radar systems which transmit dispersed waveforms, and using matched filtering for pulse compression of the waveforms, and sidelobe suppression of the compressed waveforms, followed by Doppler processing of received echoes.\n\n#### BACKGROUND OF THE INVENTION\n\nThe high speed and long range of modern airborne vehicles places increasing range demands on radar systems used for tracking. The long-range requirement also requires the use of relatively high transmitted power to reliably detect small targets. High transmitted power implies a relatively higher peak transmitter power or a longer duration transmitter pulse (also known as a \"wider\" pulse). Assuming a maximum available peak power, longer range implies a longer duration transmitted pulse. A longer duration pulse tends to reduce range resolution, which is the ability to distinguish among targets which are at similar ranges. Pulse compression techniques can be used to improve range resolution in spite of the longer pulse duration, thus eliminating the need for high peak power short pulses, but the minimum range at which a target can be detected by a monostatic radar system increases with the transmitted pulse length. Thus, if the transmitter pulse duration is 100 microseconds (.mu.s), the minimum distance at which a target may be detected by a monostatic radar is about 8 nautical miles (nm). Clearly, a radar using pulses of such a duration cannot be used to detect close-in targets, as for example aircraft which are landing or taking off from an airport at which the radar is situated. An additional problem associated with pulse compression is the appearance of range sidelobes (as distinguished from antenna sidelobes) in addition to the main range lobe. The time position, or range, of the main lobe is the position that is tested for the presence of a target and for estimating the parameters of that target (reflected energy or power, fluctuations in echo power, and closing speed, etc.). The presence of range sidelobes on the compressed pulse results in interfering echoes which originate at ranges other than the range of the main lobe. This interference, known as \"flooding,\" can cause erroneous estimates of the echo characteristics in the range cell (i.e., range increment) covered by the main lobe. Prior art techniques for suppressing range sidelobes include the \"zero-Doppler\" technique, in which the range sidelobe suppression scheme is based in part upon the assumption that the interfering echoes, as well as the desired echo, are associated with a closing velocity which results in no significant Doppler phase change or shift over the duration of the uncompressed pulse. The Doppler phase shift .phi..sub.DV across the uncompressed pulse is 2.pi. times the product of the Doppler frequency shift and the uncompressed pulse duration (i.e. .phi..sub.DV =2.pi. f.sub.d T.sub.0 radians). When this Doppler phase shift is actually zero or very small, moderate sidelobe suppression is achievable with the zero Doppler design. However, the zero Doppler design is very sensitive to small Doppler frequency shifts, making deep sidelobe suppression impossible for radar applications in which such deep sidelobe suppression is desired, as for example in weather mapping, clear air turbulence detection, and microburst detection.\n\nAn approach to range sidelobe suppression elimination is described as prior art in U.S. Pat. No. 5,151,702, issued Sep. 29, 1992, in the name of Urkowitz (Urkowitz '702), incorporated herein by reference. FIG. 1 is a simplified block diagram of prior art as described in Urkowitz '702. In FIG. 1, a complex received signal I+jQ is applied by way of an input port 10 to a pulse compressor, illustrated as a block 12, for enhancing signal-to-noise ratio. The compressed signal is applied to a range sidelobe suppressor 14, which may be implemented as a mismatch filter for reducing range sidelobes which result from pulse compression. The pulse compressed, range sidelobe suppressed, echo signal is applied to a pulse-to-pulse Doppler filter bank 16, which separates the received signals from sequential receptions into frequency bins, as well known in the art. The Doppler filtered signals from Doppler filter bank 16 are independently applied to amplitude detectors 218a, 218b, 218c, . . . , 218m, for generating the desired radial velocity information of both point and diffuse targets, which may then be applied for further processing and display. The further processing may include, as indicated in FIG. 1, threshold processing for determining the presence of a target in noise and clutter. This prior art arrangement for suppressing sidelobes includes the \"zero Doppler\" technique, in which the assumption is made that the interfering echoes as well as the desired echo have a closing velocity that has no significant Doppler phase change or shift over the duration of the uncompressed pulse, as described in detail in U.S. Pat. No. 5,173,706, issued Dec. 22, 1992 in the name of Urkowitz (Urkowitz '706), incorporated herein by reference. As mentioned, when the Doppler phase shift is actually zero or very small, moderate sidelobe suppression is achievable with the zero Doppler design, but the design is very sensitive to small Doppler frequency shifts, thereby making deep sidelobe suppressio impossible in the presence of such shifts.\n\nThe solution to the abovementioned problems as described in Urkowitz '706 is illustrated generally in FIG. 2. FIG. 2 is a simplified block diagram of an embodiment of the invention which is better suited to larger Doppler frequency shifts and/or larger duration-bandwidth products than the structure of FIG. 1. In FIG. 2, the I+jQ signal, representing the complex envelope of the radar echo, plus whatever receiver noise is combined with the echo, is applied by way of port 210 to Doppler filter bank 216, without being pulse-compressed. Filter bank 216 separates the signal into frequency bins, and applies the signal in-each bin to a separate processor 228, which performs the functions of both pulse compression and range sidelobe suppression (PC & SS). As with the arrangement of FIG. 1, the output from the lowest-frequency bin of Doppler filter bank 216, namely the f.sub.1 bin, is applied directly to its associated processor 228a, without a multiplication or frequency conversion. The output signals from filter elements f.sub.2 though f.sub.m of Doppler filter bank 216 are individually applied to a corresponding multiplier 220. For example, the output port of filter element f.sub.3 of filter bank 216 is applied to an input of a multiplier 220c. Multiplier 220c also receives from a source (not illustrated in FIG. 2) an oscillation signal exp(-j2.pi.f.sub.3 k.tau..sub.0) which is the negative of the center frequency of filter element f.sub.3. This has the effect of converting the signal output of filter element f.sub.3 to baseband. The output signals of each of the other filter elements of filter bank 216 (except filter element f.sub.1) are similarly processed, with the result that all the filter element output signals are converted to baseband signals with a bandwidth corresponding to that of the filter element. The bandwidth of each filter element of filter bank 216 is small, on the order of a few Hertz or less.\n\nAs described in the Urkowitz '706 patent, the pulse compression and range sidelobe suppression performed in processor 228 of FIG. 2 may be performed by a pair of FIR filters implemented as tapped delay lines with weighting and summing. The salient requirement is that the range sidelobe reduction function be provided individually for the signal component in each frequency bin. When this requirement is met, the range sidelobe suppression can be optimized for each frequency increment, and the suppression can be maintained. The combination 228 of pulse compressor and range sidelobe suppression follows each of the complex multipliers 220. Since each complex multiplication removes the residual Doppler phase shift across the uncompressed pulse, no residual Doppler phase shift remains on the uncompressed pulse. Each pulse compressor and range sidelobe suppressor is a zero Doppler design. All of the pulse compressor and range sidelobe suppressors are therefore identical, which is a cost advantage.\n\nIt was believed that the pulse-to-pulse Doppler filter bank, range mixers, pulse compressors, and sidelobe suppressors constituted a combination of time-invariant and time-variant filters, in which the order of processing is critical.\n\n#### SUMMARY OF THE INVENTION\n\nThe inventor herein realized that the time-varying component varies with time in an intra-pulse manner, whereas the inter-pulse or per-pulse operation could be considered to be mathematically, and therefore physically, independent. A Doppler radar system according to the invention includes a transmitter for transmitting a plurality of sets of dispersed pulses of electromagnetic radiation toward scatterers, which results in the generation of returns or echoes. A receiver is coupled for receiving the returns from the scatterers, and for generating sets of received complex envelope signals therefrom. A bank of pulse-to-pulse Doppler filters is provided, each of which includes a second plurality of inputs and the same second plurality of outputs, for filtering signals applied to each of the inputs about the center frequency of one of a plurality of frequency bins, to thereby produce a plurality of signals, each having a frequency spectrum related to that of the associated bin. The radar system further includes a plurality, equal to the second plurality, of complex exponential signal generators, each of which generates a complex exponential signal, the frequency of which is centered at the negative of the frequency of an associated one of the frequency bins of the pulse-to-pulse Doppler filters, and a plurality, equal to the second plurality, of multipliers, each of which is coupled to the receiver and to one of the complex exponential signal generators. Each of the multipliers multiplies the sets of received complex envelope signals by one of the complex exponential waveforms, to thereby convert the sets of received signals into a baseband signal component at the output of each multiplier, whereby the plurality of multipliers produces a plurality of baseband signal components. The radar system further includes a plurality, equal in number to the second plurality, of identical cascades. Each of the cascades includes the cascade of a range sidelobe suppressor and a pulse compressor, and each of the cascades is coupled to the output of one of the multipliers and to the input of a corresponding one of the pulse-to-pulse Doppler filters of the Doppler filter bank. Each of the cascades processes one of the baseband signal components to reduce range sidelobes, to thereby produce a plurality of range sidelobe suppressed signals at the inputs of the pulse-to-pulse Doppler filters, whereby each set of transmitted and received signals results in a set of signals at the outputs of the Doppler filter bank.\n\n#### DESCRIPTION OF THE DRAWINGS\n\nFIG. 1 is a simplified block diagram of a portion of a prior art processor including pulse compressor, range sidelobe suppressor, and Doppler filter;\n\nFIG. 2 is a simplified block diagram of another prior art processor for producing Doppler tolerant range sidelobe suppression;\n\nFIG. 3 is a simplified block diagram of a radar system;\n\nFIG. 4 is a simplified block diagram illustrating an embodiment of the invention; which may be used in the radar system of FIG. 1;\n\nFIG. 5 illustrates a sequence of pulses of a carrier;\n\nFIGS. 6a and 6b represent I and Q components, respectively, of Doppler modulation of a pulse train;\n\nFIG. 7 is a simplified representation of pulse-to-pulse Doppler filtering arrangement;\n\nFIG. 8 is a simplified representation of pulse compression and range sidelobe suppression arrangement; and\n\nFIG. 9 is a simplified representation of a cascade of pulse compression and range sidelobe suppression followed by pulse-to-pulse Doppler filtering.\n\n#### DESCRIPTION OF THE INVENTION\n\nFIG. 3 is a simplified block diagram of a radar system as described in the abovementioned Urkowitz '702 patent. In FIG. 3, an antenna 318 is connected by way of a transmit-receive (T/R) duplexing or multiplexing system 350 to a transmit controller (TX) 303. Controller 303 establishes the system pulse duration, PRF, frequency and the like, and provides other control functions including generation of local oscillator and tuning signals. Antenna 318, controller 303 and T/R 350 together cause transmission of electromagnetic signals, illustrated as 307, and couple echoes of the electromagnetic signals received by antenna 318 by way of a path 309 to a receiver and analog signal processor (ASP) 352 for low-noise amplification, frequency downconversion, and the like, with the aid of local oscillator (L.O.) signals. In their broadest concept, there are conventional radar techniques. The resulting baseband signals may, in general, include orthogonal inphase (I) and quadrature (Q) components. The baseband signals are applied from receiver/ASP 352 to an analog-to-digital converter (ADC) associated with a block 362, which converts the analog baseband signals to digital form with the aid of system timing signals applied over a path 364. The \"range clock\" portion of the timing signals establishes the smallest time interval into which the received signals are quantized, and therefore establishes the smallest discernible target range increment.\n\nAs described in the abovementioned Urkowitz '702 patent, a buffer may be associated with ADC 362 of FIG. 3 for purposes unrelated to the present application. The digital signals are coupled from ADC 362 (or its buffers, if used) to a digital signal processor (DSP) 368, for performing processing, including the processing described in conjunction with FIG. 4.\n\nIn FIG. 4, a digitized received complex envelope signal is applied from analog-to-digital converter 362, in common, over signal paths 366 and 410 to inputs of a set of complex multipliers 412b, 412c . . . , 412m. The digitized received complex envelope signal is also applied directly from path 410 to a zero Doppler pulse compressor and sidelobe suppression filter (ZDPC & SS), illustrated together as a block 414a, for reasons described below. Each complex multiplier 412b, 412c, . . . , 412m also receives a complex exponential signal exp (-j2.pi.f.sub.n r.tau..sub.o) from a corresponding source 416b, 416c, . . . , 416m. For example, ZDPC & SS 414b receives a complex exponential signal exp (-j2.pi.f.sub.1 r.tau..sub.o) from a complex exponential signal source 416b, ZDPC & SS 414c receives a complex exponential signal exp (-j2.pi.f.sub.2 r.tau..sub.o) from a complex exponential signal source 414c, . . . , and ZDPC & SS 414m receives a complex exponential signal exp (-j2.pi.f.sub.m r.tau..sub.o) from a complex exponential signal source 416m. The complex exponential signal has a line spectrum, and may be considered to be the output of an oscillator. The multiplied signal at the output port of each multiplier 412b, 412c, . . . , 412m is applied over a corresponding signal path 413b, 413c, . . . 413m to a zero Doppler pulse compressor and sidelobe suppression filter (ZDPC & SS), illustrated as blocks 414b, 414c, . . . , 414m. The outputs of blocks 414b, 414c, . . . , 414m are applied to inputs of pulse-to-pulse Doppler filters 422b, 422c, . . . , 422m of a Doppler filter bank 420. The outputs of the Doppler filters are applied over paths 424a, 424b, . . . , 424m to further processing and for eventual display.\n\nIn operation of the arrangement of FIGS. 3 and 4, sets of pulses are transmitted toward a target, which may be a diffuse target, and are reflected thereby, to form echo signals. The echo signals are received, to thereby produce received complex envelope signals. The received complex envelope signals are converted into digital form in ADC 62, and the resulting digital form of the complex envelope signals are applied over paths 366 and 410 (in parallel form if desired), in common, to the inputs of multipliers 412. The complex exponential signals are selected in conjunction with the frequencies of the pulse-to-pulse Doppler filters 422a, 422b, . . . , 422m, so that each multiplier 412, when it multiplies the digital complex envelope signal at its input port by the complex exponential signal from its associated complex exponential source 416, converts the complex envelope signal to zero frequency reference, which may be considered to be baseband, along each range trace. Thus, the output signal from each multiplier 412 on its output signal path 413 is referenced to zero frequency along each range trace. Each of the Doppler filters 420 of Doppler filter bank 420 operates at the pulse-to-pulse rate of the radar system, rather than at the range clock sample rate, so as to respond to the Doppler frequency of the echo, because of the pulse-to-pulse phase change. In other words, each filter 427 of the Doppler filter bank 420 responds, at a particular range bin, to the pulse-to-pulse phase change induced in the echo by its Doppler frequency shift. It does this for each range bin. The output of each of the pulse-to-pulse Doppler filters 420a, 420b, . . . , 420m on signal paths 424a, 42b, 422c, . . . , 424m represents range compressed, sidelobe suppressed Doppler filtered signals which may be further processed, as by envelope detection, CFAR processing, thresholding, spectral analysis, track processing, and the like, for eventual display.\n\nWhile the outputs of the pulse compressor and sidelobe suppressor cascades 414 of FIG. 4 have been partially sidelobe suppressed in the form in which they appear on signal paths 418, full sidelobe suppression and pulse compression gain are not achieved until the extraneous pulse-to-pulse Doppler components have been removed. The pulse-to-pulse Doppler filter bank removes these extraneous components, and restores the full sidelobe suppression and pulse compression gain.\n\nAs so far described, only the signal paths of FIG. 4 which include multipliers 412 have been described. As mentioned above, the digitized echo signals applied to processor 68 are applied directly to zero doppler pulse compressor and sidelobe suppressor 414a, without conversion to baseband by a multiplier. This is because the signal received by processor 68 includes signal components at the selected baseband frequency, which therefore require no conversion before application to ZDPC & SS 414a in order to be at baseband. Thus, the signal path including ZDPC & SS 414a corresponds conceptually with the paths including ZDPC & SS 414b-414m, where the hyphen represents the word \"through\", except that frequency conversion is not required and the multiplier is therefore dispensed with.\n\nThe design of the range sidelobe suppressors and the pulse compressors of the arrangement according to the invention corresponds to those of the prior art. A proof follows of the ability to interchange the operations of Doppler filtering and the pulse compression and range sidelobe suppressors.\n\n#### THE TRANSMITTED AND RECEIVED WAVEFORMS\n\nOrdinary radar transmission consists of a sequence of carrier pulses, illustrated as 501a, 501b, . . . , 501N in FIG. 5, in which the carrier frequency is f.sub.c, and in which the pulses are all similar, occurring at a uniform rate called the \"pulse repetition frequency\" (PRF). The pulse recurrence or repetition frequency is the interverse of the inter-pulse time T.sub.r, hence f.sub.r =1/T.sub.r. As illustrated in FIG. 5, pulses 501, 502, 503 have a simple pulse form. Before we go into the mathematics, let's look into the situation qualitatively. We want to add echoes from these pulses and we want to add them in phase so that the sum will be a \"coherent\" sum. This means that the starting phase of each pulse with respect to its own origin must be the same as that of every other pulse with respect to its origin. The origin for the second pulse is T.sub.r ; for the third it is 2T.sub.r, etc. What this means is that, if the carrier frequency is f.sub.c, there must effectively be an integer number of cycles in the time interval T.sub.r. That is,\n\nf.sub.c T.sub.r =integer (1)\n\nIn an actual radar system, this is automatically accomplished, within an acceptable error, by using an internal oscillator as the reference for the echoes from each pulse. Whatever the actual phase of the transmission, it is used as the reference phase, and is therefore designated zero phase for each transmitted pulse. This will ensure that Equation (1) is satisfied.\n\nNow we can turn to the algebra. Let g(t) denote the pre-envelope of the basic transmitted pulse g(t). Then the sequence of N transmitted pulses may be described in pre-envelope form as ##EQU1## where g(t) is the complex envelope of g(t);\n\nt is time;\n\nn is a running variable;\n\nT.sub.r is defined above;\n\n.omega..sub.c =2.pi.f.sub.c ; and\n\ng(t)=g(t)e.sup.j.omega..sbsp.c.sup.t (3)\n\nIn view of Equation (1), the exponent in Equation (2) can be written\n\ne.sup.j.omega..sbsp.c.sup.t-j.omega..sbsp.c.sup.nT.spsb.r =e.sup.j.omega..sbsp.c.sup.t (4)\n\nand Equation (2) becomes ##EQU2##\n\nNow let's look at the echo. We presume that the time NT.sub.r is not too large for a moving target to move more than a resolvable range interval. Then each pulse undergoes the same range delay .tau..sub.i. Furthermore, let a Doppler frequency f.sub.d =.omega..sub.d /2.pi. be imposed upon the echo. The relation between Doppler frequency f.sub.d and range rate R is\n\nf.sub.d =-2Rf.sub.c /C (6)\n\nwhere f.sub.c is the reference or carrier frequency and c is the speed of light. The echo pre-envelope g.sub.R (t), which has the range delay .tau..sub.i and the Doppler shift f.sub.d imposed on it, may then be found by substituting t-.tau..sub.i for t and f.sub.c +f.sub.d for f.sub.c in Equation (5). This changes the transmitted pre-envelope s(t) to the received pre-envelope gR(t). Thus, ##EQU3## We seek the complex envelope g(t), which is simply the coefficient of exp(j.omega..sub.c t). Thus, the complex envelope is ##EQU4## The factor e.sup.-j.omega..sbsp.c.sup..tau..sbsp.i in Equation (8) represents an initial constant phase shift .phi. of the echo that is, in general, unknown. We therefore treat that phase as a random variable with a uniform probability density function over the interval (0,2.pi.). This is the least favorable distribution. We set\n\n.phi.=-.omega..sub.c .tau..sub.i (9)\n\nThe factor e.sup.j.omega..sbsp.d.sup.(t-.tau..sbsp.i.sup.) in Equation (8) is the Doppler modulation upon the sequence of echoes. The inphase (I) and Q components of a Doppler modulated pulse train are illustrated in FIGS. 6a and 6b, respectively, where the frequency f.sub.d of the modulation envelopes 610 and 612 are the Doppler frequency, and T.sub.r is the pulse repetition period. Now we may write Equation (8) as\n\ng.sub.R (t)=g.sub.1 (t)e.sup.j.phi. (10)\n\nwhere ##EQU5## In many cases, the pulse duration is a small fraction of the Doppler period 1/f.sub.d. Thus, over a pulse duration, exp (j.omega..sub.d [t-.tau..sub.i ]) is nearly a constant whose value at the n.sup.th pulse is obtained by setting t to .tau..sub.i +nT.sub.r, so\n\nexp (j.omega..sub.d [t-.tau..sub.i ]).sub.t =.tau..sub.i +nT.sub.r =exp (j.omega..sub.d nT.sub.r) (12)\n\nThus, we may write Equation (11) as ##EQU6##\n\nHowever, in our case, the pulse duration may be a significant fraction of the Doppler period 1/f.sub.d, and we can no longer consider exp(j.omega..sub.d [t-.tau..sub.i ]) to be nearly a constant. Then there will be significant Doppler phase shift during te pulse duration. To make this evident, let us set\n\nt=t'+.tau..sub.i +nT.sub.r (14)\n\nwhere t' is the time along the duration of each pulse; i.e., along the range dimension, measured from the leading edge of the n.sup.th received pulse. With this change Equation (13) becomes ##EQU7## Equation (15) shows that the echo complex envelope consists of the product of two parts:\n\n1. A part e.sup.j.omega..sbsp.d.sup.t' g(t') characterizing variation along a range trace.\n\n2. A part ##EQU8## characterizing pulse-to-pulse variation. Any signal processing to be performed can therefore be divided into a per pulse operation (i.e., along a range trace) and a pulse-to-pulse operation. It is clear that these may be done in either order.\n\n#### THE PULSE-TO-PULSE OPERATION\n\nEquation (15) expresses a sequence of received Doppler shifted envelopes y.sub.n such that\n\ny.sub.n =e.sup.j.omega..sbsp.d.sup.t' g(t')e.sup.jn.omega..sbsp.d.sup.T.sbsp.r, n=0, 1, . . . , N-1(16)\n\nThe pulse-to-pulse operation is a Doppler filtering as ordinarily considered, illustrated in FIG. 7. The sequence of complex envelopes y.sub.n, given by Equation (16), is multiplied by a sequence of complex exponentials and summed. The output, labeled z(t'), is given by ##EQU9## where .omega..sub.k =2.tau.f.sub.k Note that the summation in z(t') is simply a constant as far as t', time along the range dimension, is concerned. If digital processing is used, t'=r.tau..sub.o, where .tau..sub.o is the range sampling period.\n\nThe next step in pulse-to-pulse processing is to mix z(t') from FIG. 7 with an exponential wave having the frequency 2.tau.f.sub.k =.omega..sub.k and to follow this mixing operation by the filtering operation h(t'), along the range dimension t', that performs pulse compression and range sidelobe suppression. The mixing and filtering are illustrated in FIG. 8. The result of the convolution indicated by the centered * in FIG. 8 is ##EQU10##\n\n#### Interchange of the Operations\n\nNow we look at an interchange of the operations illustrated in FIGS. 7 and 8. This interchange is shown in FIG. 9. the operation of pulse compression and range sidelobe suppression precedes the pulse to pulse Doppler filtering, reversing the cascade operation of FIGS. 7 and 8. Using Equation (16) for y.sub.n, the output of the first filter of FIG. 9 can be written as\n\np(t')=[y.sub.n exp (-j.omega..sub.k t')]*h(t')=[{g (t') exp [j(.omega..sub.d -.omega..sub.k)t']}*h(t')] exp (jn.omega..sub.d T.sub.r), n=0,1, . . . , N-1 (19)\n\nThe second operation is the pulse to pulse mixing and filtering yielding ##EQU11## This is q(t') of Equation (18). This establishes the equivalence of FIG. 9 with the cascade of FIGS. 7 and 8 and, therefore, the equivalence of the arrangements of FIGS. 2 and 4 when we set t'=r.tau..sub.0, where .tau..sub.0 is the range sampling period and r is an integer index.\n\nOther embodiments of the invention will be apparent to those skilled in the art. For example, analog or digital processing may be used for any of the operations. The described processing may be used for sonar as well as for radar. In a radar context, different carrier frequencies may be used, and the antennas may be conventional reflector types of arrays, either passive or active, and may provide monopulse functions, nulls for jamming, and the like.\n\n## Claims\n\n1. A Doppler radar system, comprising:\n\ntransmitting means for transmitting a plurality of sets of dispersed pulses of electromagnetic radiation toward scatterers to generate returns;\nreceiving means coupled for receiving said returns from said scatterers and for generating sets of received complex envelope signals therefrom;\na bank of pulse-to-pulse Doppler filtering means including a second plurality of inputs and said second plurality of outputs, for filtering signals applied to each of said inputs about the center frequency of one of a plurality of frequency bins, to thereby produce a plurality of signals, each having a frequency spectrum related to that of the associated bin;\na plurality, equal to said second plurality, of complex exponential signal generating means, each of which generates a complex exponential signal, the frequency of which is centered at the negative of the frequency of an associated one of said frequency bins;\na plurality, equal to said second plurality, of multiplying means, each of which is coupled to said receiving means and to one of said complex exponential signal generating means, each of said multiplying means being for multiplying said sets of received complex envelope signals by one of said complex exponential waveforms, to thereby convert said sets of received signals into a baseband signal component at the output of said multiplying means, whereby said plurality of multiplying means produces a plurality of baseband signal components;\na plurality, equal in number to said second plurality, of identical cascades, each of said cascades including the cascade of range sidelobe suppression means and pulse compression means, each of said cascades being coupled to the output of one of said and to said input of a corresponding one of said pulse-to-pulse Doppler filter means of said Doppler filter bank, each of said cascades being for processing one of said baseband signal components to reduce range sidelobes, to thereby produce a plurality of range sidelobe suppressed signals at said inputs of said pulse-to-pulse Doppler filter means, whereby each set of transmitted and received signals results in a set of signals at the outputs of said Doppler filter bank.\n\n2. A system according to claim 1, wherein said range sidelobe suppression means comprises a FIR filter.\n\n3. A system according to claim 1, wherein each of said complex exponential signal processing means comprises an oscillator.\n\n4. A method for detecting a target by radar, comprising the steps of:\n\ntransmitting dispersed pulses of electromagnetic radiation toward the target;\nreceiving echo pulses from the target, and generating complex envelope of received signals in response to the echo pulses;\nmultiplying said complex envelope by a plurality of complex exponential waveforms which are selected to convert said complex envelope into said plurality of baseband signal components;\npulse compressing and range sidelobe suppressing each of said plurality of baseband signals, to thereby produce processed baseband signals in which the range sidelobe suppression may be degraded; and\npulse-to-pulse Doppler filtering said processed baseband signals to produce a plurality of baseband signal components in which said range sidelobe suppression is improved.\n\n5. A method according to claim 4, wherein said step of pulse compressing comprises the step of compressing the duration of said echo pulses.\n\n6. A method according to claim 4, wherein said pulse compressing step is performed before said step of suppressing range sidelobes.\n\n7. A method according to claim 4, wherein said compressing step is performed after said step of suppressing range sidelobes.\n\n## Patent History\n\nPatent number: 5414428\nType: Grant\nFiled: May 6, 1994\nDate of Patent: May 9, 1995\nAssignee: Martin Marietta Corp. (Moorestown, NJ)\nInventors: John J. Gallagher (Turnersville, NJ), Harry Urkowitz (Philadelphia, PA)\nPrimary Examiner: John B. Sotomayor\nAttorneys: W. H. Meise, C. A. Nieves, S. A. Young\nApplication Number: 8/239,051"
] | [
null
] | {"ft_lang_label":"__label__en","ft_lang_prob":0.9006731,"math_prob":0.90611887,"size":32857,"snap":"2019-35-2019-39","text_gpt3_token_len":7433,"char_repetition_ratio":0.17794417,"word_repetition_ratio":0.10813954,"special_character_ratio":0.22552273,"punctuation_ratio":0.16094226,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9504725,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2019-08-19T15:14:10Z\",\"WARC-Record-ID\":\"<urn:uuid:23ed19be-e451-4f17-a345-d5e1da704aff>\",\"Content-Length\":\"78362\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:62d51867-944c-45fb-9f03-e1a7c0e98eb6>\",\"WARC-Concurrent-To\":\"<urn:uuid:ffc6441e-9e89-44e3-8730-2dbebbcb6579>\",\"WARC-IP-Address\":\"52.200.229.96\",\"WARC-Target-URI\":\"https://patents.justia.com/patent/5414428\",\"WARC-Payload-Digest\":\"sha1:YOZK34SMUBOVQ2MTKO7PPRB7B3SIYQMI\",\"WARC-Block-Digest\":\"sha1:JUOCGGMRHPGELAOWLRXZJMJIJXENHR3X\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2019/CC-MAIN-2019-35/CC-MAIN-2019-35_segments_1566027314752.21_warc_CC-MAIN-20190819134354-20190819160354-00278.warc.gz\"}"} |
http://lexiss.uneb.br/ben-and-zlhqigv/vertical-position-formula-a292b7 | [
"AJ Design ☰ Math Geometry Physics Force Fluid Mechanics Finance Loan Calculator. Mouvement vertical de projectile : déterminer la hauteur maximale connaissant la durée totale. Performance & security by Cloudflare, Please complete the security check to access. All the items in the balance sheet are stated as a percentage of the total assets. The Amplitude is the height from the center line to the peak (or to the trough). List of formulas related to a ball thrown vertically upward [formula set] ... As it moves upwards from its initial position (wherefrom it’s thrown) and gains height, its potential energy rises. Inputs: initial vertical velocity (v y0) acceleration of gravity … The effects of arms and countermovement on vertical jumping. This tutorial shows how to use INDEX and MATCH in Excel and how it is better than VLOOKUP. Descarga miles de iconos gratis de educación en Flaticon, en formato SVG, PSD, PNG, EPS o como fuente de iconos Si les lois relient accélération et force, vous voyez tout de suite que . En este movimiento podemos considerar el movimiento de caída libre, el movimiento de lanzamiento vertical hacia abajo o el el movimiento de lanzamiento vertical hacia arriba. Now, without changing the setting, look through the sextant at any vertical line (for example, a flag pole or the vertical edge of a building) and swing the instrument back and forth across the vertical line. • But this method is not useful to make firm decisions, and measurement of the company value cannot be defined. The formulas below show how INDEX can be used to get a value: = INDEX (A1:B5, 2, 2) // returns value in B2 = INDEX (A1:B5, 3, 1) // returns value in A3. elevation': \"the vertical distance of a point or a level, on or affixed to the surface of the earth, measured from mean sea level.\" And now, I will try if not to talk you out of using VLOOKUP, then at least show you an alternative way to do a vertical … Moreover, it would travel before it reaches the same vertical position as it started from. The Vertical Shift is how far the function is shifted vertically from the usual position. This scale is chosen in order to linearize the resulting plot for Weibull data. Maximum Height Formula. European Journal of Applied Physiology, 38 (3): 181-188. The vertical analysis of financial statements does not help to make a firm decision as there is no standard percentage or ratio regarding the change in the components of the income statement or the balance sheet. In that, we can easily understand that the total expenses gradually increased from 43% to 52%, and the net income got reduced from 1st year to 2nd year. Here all the items in the income statement are stated as a percentage of gross sales. Use TRANSPONER para cambiar la orientación vertical y horizontal de una matriz o un rango de una hoja de cálculo. Projectile motion calculator solving for vertical velocity at time given initial vertical velocity, acceleration of gravity and time AJ Design ☰ Math Geometry Physics Force Fluid ... Science Physics Formulas. (equation for vertical displacement for an angled-launched projectile) where viy is the initial vertical velocity in m/s, t is the time in seconds, and g = -9.8 m/s/s (an approximate value of the acceleration of gravity). The above vertical analysis example shows the net profit of the company where we can see the net profit in both amount and percentage. This analysis makes it easier to compare the financial statements of one company with another and across the companies as one can see the relative proportion of accounts. In the 3rd year, the COGS got decreased when compared to the previous years, and the income got increased. Completing the CAPTCHA proves you are a human and gives you temporary access to the web property. This video is unavailable. Guide to Vertical Analysis Formula. Clearly, in this example, the angle between the crank and the rod is not a right angle. If you are on a personal connection, like at home, you can run an anti-virus scan on your device to make sure it is not infected with malware. MOVIMIENTO VERTICAL: Un ejemplo de MRUA es el movimiento vertical. Units. the initial position of the body is x 0. The Beauty Concept Cuando bebé demuestre señales de hambre puedes hacer cosquillas cerca de la boca/mejilla con la mamadera (o método que usas) para que bebé abra bien su … This method is easy to compare with the previous reports and easy to prepare. Position with respect to crank angle (from the triangle relation, completing the square, ... Then, using the triangle law of sines, it is found that the rod-vertical angle is 18.60647° and the crank-rod angle is 88.21738°. geodetic positions in three dimensions. Typically, the MATCH function is used to find the position, which is then fed into INDEX… Vertical analysis formula = (Statement line item / Total base figure) X 100 Horizontal analysis formula = {(Comparison year amount - Base year amount) / Base year amount} X 100 However, it is important to remember that you can still use vertical analysis to compare a line item's percentages from one quarter or year to another. Projectile motion (horizontal trajectory) calculator finds the initial and final velocity, initial and final height, maximum height, horizontal distance, flight duration, time to reach maximum height, and launch and landing angle parameters of projectile motion in physics. Linear Motion Formulas. Add vertical line 1 (word 1) and vertical line 15 (word 3) and enter the answer to the resulting clue on this line; Placed in a vertical position; Small bony fish that adopts a vertical swimming position; Vacuum cleaner used in a vertical position; Vertical or in a standing position; In a vertical position … This is not what vertical alignment means bilal. In this formula, y(x,t) is the displacement, x is the wave's position on the same axis as the wave's movement at the point of displacement, and t is the time the wave has been traveling. The VLOOKUP function is a built-in function in Excel that is categorized as a Lookup/Reference Function.It can be used as a worksheet function (WS) in Excel. First, the direct and inverse problems are developed, then two special problems - those of azimuth and spatial distance intersections - are dealt vith. x = horizontal distance (m) y = vertical distance (m) v = velocity (combined components, m/s) v x = horizontal velocity (m/s) v y = vertical velocity (m/s) Vertical velocity. Figure 11 shows some example trajectories calculated, from the above model, with the same launch angle, , but with different values of the ratio .Here, and .The solid, short-dashed, long-dashed, and dot-dashed curves correspond to , , , and , respectively.It can be seen that as the air resistance strength increases (i.e., as increases), the range of the projectile decreases. Position Formula Solved Examples. Practica encontrar la distancia entre dos puntos en el plano coordenado que comparten la misma coordenada x o la misma coordenada y. Where the total sales of company A are $1000000 and the cost of goods sold is$400000. Thanx to all ahead of time. So by using this method, it is easy to understand the net profit as it is easy to compare between the years. Tous les exemples présentés dans le tutoriel sont disponibles dans … They may be a subset of a larger market. Select a vertical list or horizontal list you want to convert, and then press Ctrl + C keys simultaneously to copy the list. v x = v xo. Vertical alignment means that if I have a box that is 50 units high, and text that is 10 units high, then there will be 20 units of space above the text and 20 units of space below the text. Cuntry song I. Karaoked. Esta propiedad tiene un montón de posibles valores, sus nombres no tienen sentido y son casi imposibles de memorizar. These equations, from the Astronomical Almanac, can be used to calculate the apparent coordinates of the Sun, mean equinox and ecliptic of date, to a precision of about 0°.01 (36″), for dates between 1950 and 2050.. Start by calculating n, the number of days (positive or negative, including fractional days) since Greenwich noon, … You may learn more about financial statement analysis from the following articles –, Copyright © 2021. CFA® And Chartered Financial Analyst® Are Registered Trademarks Owned By CFA Institute.Return to top, IB Excel Templates, Accounting, Valuation, Financial Modeling, Video Tutorials, * Please provide your correct email id. v = s / t (1a) where. eur-lex.europa.eu. Example of the vertical analysis of the financial statement, which shows the total in amount and percentage. We will also find out how to find out the maximum height, time to reach the maximum height, the total time … Tengo el siguiente problema: Requiero poder arrastrar una fórmula verticalmente, en la que hago una operación en … To increase the effectiveness of vertical analysis, multiple year’s statements or reports can be compared, and comparative analysis of statements can be done. Is there a function that returns a value based on both a vertical and horizontal lookup? Cloudflare Ray ID: 614cd03b0d6bcc83 Or, put differently - a 'vlookup' returns a value in a specified column. Amplitude, Period, Phase Shift and Frequency. The Period goes from one peak to the next (or from any point to the next matching point):. Nav width width is 100px (guessing). Thevertical position(height or depth) [...] of the instruments shall be indicated in metres with a plus (= height above the. Vertical analysis of financial statements is a technique in which the relationship between items in the same financial statement is identified by expressing all amounts as a percentage a total amount. I solved by using a calculator and entering both equations and finding the x intercept for an answer of s=5.74 sec but I need to do it by completing the square. Entre sentado y acostado. Description. After that, the horizontal range is depending upon the initial velocity $$V_{0}$$, the launch angle $$\\theta$$, and the acceleration occurring due to the gravity. Vertical form (this is default) Horizontal form; Inline form; Standard rules for all three form layouts: Wrap labels and form controls in\n(needed for optimum spacing) Add class .form-control to all textual ,"
] | [
null
] | {"ft_lang_label":"__label__en","ft_lang_prob":0.7876806,"math_prob":0.94417346,"size":10186,"snap":"2021-04-2021-17","text_gpt3_token_len":2235,"char_repetition_ratio":0.12139069,"word_repetition_ratio":0.009318579,"special_character_ratio":0.21735716,"punctuation_ratio":0.115364715,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9885952,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2021-04-23T13:37:05Z\",\"WARC-Record-ID\":\"<urn:uuid:75c362c4-415c-4fb2-ae1d-a0f939305124>\",\"Content-Length\":\"39341\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:0d2c9c22-a7e7-4221-a12d-fafa20576236>\",\"WARC-Concurrent-To\":\"<urn:uuid:a8c7cefc-a107-4e53-98df-11fb1c5dad69>\",\"WARC-IP-Address\":\"200.128.3.45\",\"WARC-Target-URI\":\"http://lexiss.uneb.br/ben-and-zlhqigv/vertical-position-formula-a292b7\",\"WARC-Payload-Digest\":\"sha1:3UNP4EF4JUQIBUI27GJN64RLNRTSHD5B\",\"WARC-Block-Digest\":\"sha1:V2Q27ME7TKL3KOKPNZXI7FZLK43DQMZM\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2021/CC-MAIN-2021-17/CC-MAIN-2021-17_segments_1618039594808.94_warc_CC-MAIN-20210423131042-20210423161042-00567.warc.gz\"}"} |
http://mcatprep.yolasite.com/rr6.php | [
"## Thermodynamics\n\nLaws of Thermodynamics\n\n1st law:\n\nEnergy is conserved. The total amount of energy in the universe is constant.\n\nThe universe can be thought of as simply a system we are interested in and its surroundings. For such a system,\n\nDE (internal energy) = Q (heat) + W (work)\nDE = Q + W\n\nE is the internal energy of a system. It is the total of all the possible kinds of energy in the system. E cannot be measured, but DE can.\nQ is positive if heat is added to a system from the surroundings and negative if the system gives up heat to its surroundings.\nW is positive if work is done on the system by the surroundings (e.g. compressing gas in a container) and negative if a system does work on the surroundings (e.g. if a compressed gas is allowed to expand).\n\nEnthalpy\n\nUnder the condition of constant pressure, Q = DH, the change in enthalpy. Most reactions occur under the essentially constant pressure of 1 atm.\n\nIf DH is negative, heat is generated and the reaction is said to be exothermic.\n\nIf DH is positive, heat is absorbed from the surroundings and the reaction is said to be endothermic.\n\n2nd law:\n\nAny spontaneous change that occurs must be accompanied by an increase in the entropy of the universe.\n\n3rd law:\n\nThe entropy of a pure crystal at 0 K is zero. (Thus the absolute amount of entropy of a system is measurable.)\n\nGibb's Free Energy\n\nWhether a chemical reaction is spontaneous (i.e. the formation of the products is favored) or not depends on two driving forces: DH and DS. Spontaneous reactions tend to occur when potential energy is released as heat through the breaking and formation of bonds (DH <0), or when the system becomes more disordered (DS >0), or both.\n\nDG incorporates both DH and DS,as show below.\n\nDG = DH - TDS\n\nwhere G is Gibb's free energy (so named because it is the energy that is free to do work),\nH is enthalpy (heat produced or consumed under conditions of constant pressure),\nS is entropy (degree of disorder), and\nT is temperature in K.\n\nWhy is DS multiplied by T? The higher the temperature, the greater the kinetic energy of the molecules and, thus, the greater the tendency for the system to go to a state of increased disorder (an analogy is the increased disorder an earthquake creates).\n\nIf DG <0, the forward reaction is spontaneous.\n\nHowever, even if a reaction is spontaneous, if the activation energy is too high it will not proceed. Such a reaction is said to be under kinetic control and may require the use of a catalyst or energy input such as heat (which would also alter the equilibrium position).\n\nIf a reaction occurs as DG predicts, it is said to be under thermodynamic control.\n\nRelationship between Gibb's Free Energy and Keq and E (cell potential for a reaction)\n\nAn indication of the equilibrium position of a reaction is provided by each of DG, Keq, and E. DG looks at the thermodynamics of a reaction, while E looks at the relative tendencies of reactants to be oxidized or reduced. Thus they are related to each other.\n\nKeq = eDG°/-RT\nThus if DG is large and negative, Keq will be large.\n\nAnd, Keq = enFE°/RT\nIf E is large and positive, Keq will be large.\n\nAlso, DG° = -nFE°\nThus, if E is positive, DG will be negative.\n\n(Note: the symbol ° denotes that standard states exist, i.e. the concentration of each reactant and product is 1 M if in solution, and 0.1 MPa if gaseous.)\n\nState Functions\nA state function is a quantity whose value depends only on the state of the system and not on its history. X is a state function only if DX does not depend on the path used to go from the initial state to the final state of the system. V, G, P, H, E, S, and T are state functions.\n\nHess's law is a consequence of enthalpy being a state function. It states that DH of a reaction is the same regardless of whether the reaction occurs in a single step or in several steps.\n\nLeChatelier's principle\n\nWhen a system at equilibrium is subjected to a stress, it will shift in a direction that minimizes the effect of this stress.\n\nMake a Free Website with Yola."
] | [
null
] | {"ft_lang_label":"__label__en","ft_lang_prob":0.9437175,"math_prob":0.96969545,"size":3865,"snap":"2019-13-2019-22","text_gpt3_token_len":906,"char_repetition_ratio":0.13416213,"word_repetition_ratio":0.012552301,"special_character_ratio":0.22923674,"punctuation_ratio":0.111809045,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.98280776,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2019-03-19T18:51:02Z\",\"WARC-Record-ID\":\"<urn:uuid:9f567501-1503-4249-9424-db58a6b5cf5c>\",\"Content-Length\":\"14216\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:daa08ea7-ae15-47f9-83e4-2d38ca2f65ff>\",\"WARC-Concurrent-To\":\"<urn:uuid:1c2c6f94-2033-493e-aefd-6b4858c3ecee>\",\"WARC-IP-Address\":\"104.16.162.215\",\"WARC-Target-URI\":\"http://mcatprep.yolasite.com/rr6.php\",\"WARC-Payload-Digest\":\"sha1:UTWCSSTOBM5JSGTSOUEHO4G3PW6YKBGX\",\"WARC-Block-Digest\":\"sha1:KCPVJ563DPMLMRQMGTFH7RDTC5Q72QE4\",\"WARC-Identified-Payload-Type\":\"application/xhtml+xml\",\"warc_filename\":\"/cc_download/warc_2019/CC-MAIN-2019-13/CC-MAIN-2019-13_segments_1552912202125.41_warc_CC-MAIN-20190319183735-20190319205735-00109.warc.gz\"}"} |
https://study.com/academy/topic/calculations-applications-of-derivatives.html | [
"# Ch 10: Calculations & Applications of Derivatives\n\nLearn more about how to calculate and apply mathematical derivatives with this chapter. Use these lessons and quizzes as a comprehensive study guide to prepare you for an upcoming test or homework exam.\n\n## Calculations & Applications of Derivatives - Chapter Summary\n\nIn this chapter, how to calculate the derivatives of polynomial, exponential and trigonometric functions is explained. How derivatives relate to inverse trigonometric functions is also covered. You will also learn how to apply the rules of differentiation to derivative calculations, including quotient, product and chain rules.\n\nAs you continue through the lessons, how to calculate higher order derivatives is presented, as well as how to solve optimization problems in calculus. This chapter will teach you how to:\n\n• Use simple tricks to calculate the derivative of a polynomial equation\n• Calculate derivatives of exponential and trigonometric functions\n• Solve derivative problems using rules\n• Define mathematical jerk\n• Tell whether a function is increasing or decreasing by looking at the sign of the first derivative\n• Determine min-max problems by using derivatives\n\nUse these lessons and quizzes to gauge how well you understood the material and where you might need further study. If you'd like to review just one part of a video lesson, use the video tabs featured in the Timeline to jump directly to the section you'd like to watch. Each lesson is accompanied by a printable transcript so you can print a copy to review offline at any time. If you have questions about the lesson, contact one of our instructors for assistance.\n\n9 Lessons in Chapter 10: Calculations & Applications of Derivatives\nTest your knowledge with a 30-question chapter practice test\nChapter Practice Exam\nTest your knowledge of this chapter with a 30 question practice chapter exam.\nNot Taken\nPractice Final Exam\nTest your knowledge of the entire course with a 50 question practice final exam.\nNot Taken\n\n### Earning College Credit\n\nDid you know… We have over 200 college courses that prepare you to earn credit by exam that is accepted by over 1,500 colleges and universities. You can test out of the first two years of college and save thousands off your degree. Anyone can earn credit-by-exam regardless of age or education level."
] | [
null
] | {"ft_lang_label":"__label__en","ft_lang_prob":0.88714474,"math_prob":0.85753167,"size":5586,"snap":"2020-34-2020-40","text_gpt3_token_len":1158,"char_repetition_ratio":0.15102114,"word_repetition_ratio":0.020293122,"special_character_ratio":0.19065522,"punctuation_ratio":0.081677705,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.99496007,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2020-09-20T01:12:16Z\",\"WARC-Record-ID\":\"<urn:uuid:1a320fde-a767-4e07-b199-8bf55d27f9fb>\",\"Content-Length\":\"114339\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:3af2453d-e554-49fb-a3dc-d813de35a0ff>\",\"WARC-Concurrent-To\":\"<urn:uuid:096994e1-d478-400d-9c21-c894ca9ce989>\",\"WARC-IP-Address\":\"52.7.75.206\",\"WARC-Target-URI\":\"https://study.com/academy/topic/calculations-applications-of-derivatives.html\",\"WARC-Payload-Digest\":\"sha1:M5BVTEMJP67ZZHUGQ7YIOVPP4LZ42WUX\",\"WARC-Block-Digest\":\"sha1:J2P6EQKQQSYLBO4HGY4FQEXNO3AIZFJN\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2020/CC-MAIN-2020-40/CC-MAIN-2020-40_segments_1600400193087.0_warc_CC-MAIN-20200920000137-20200920030137-00182.warc.gz\"}"} |
https://www.lmfdb.org/EllipticCurve/Q/25200ef3/ | [
"Show commands for: Magma / Pari/GP / SageMath\n\n## Minimal Weierstrass equation\n\nsage: E = EllipticCurve([0, 0, 0, -9651675, -11541221750]) # or\n\nsage: E = EllipticCurve(\"25200ef3\")\n\ngp: E = ellinit([0, 0, 0, -9651675, -11541221750]) \\\\ or\n\ngp: E = ellinit(\"25200ef3\")\n\nmagma: E := EllipticCurve([0, 0, 0, -9651675, -11541221750]); // or\n\nmagma: E := EllipticCurve(\"25200ef3\");\n\n$$y^2 = x^{3} - 9651675 x - 11541221750$$\n\n## Mordell-Weil group structure\n\n$$\\Z/{2}\\Z$$\n\n## Torsion generators\n\nsage: E.torsion_subgroup().gens()\n\ngp: elltors(E)\n\nmagma: TorsionSubgroup(E);\n\n$$\\left(-1795, 0\\right)$$\n\n## Integral points\n\nsage: E.integral_points()\n\nmagma: IntegralPoints(E);\n\n$$\\left(-1795, 0\\right)$$\n\n## Invariants\n\n sage: E.conductor().factor() gp: ellglobalred(E) magma: Conductor(E); Conductor: $$25200$$ = $$2^{4} \\cdot 3^{2} \\cdot 5^{2} \\cdot 7$$ sage: E.discriminant().factor() gp: E.disc magma: Discriminant(E); Discriminant: $$96018048000000000$$ = $$2^{16} \\cdot 3^{7} \\cdot 5^{9} \\cdot 7^{3}$$ sage: E.j_invariant().factor() gp: E.j magma: jInvariant(E); j-invariant: $$\\frac{2131200347946769}{2058000}$$ = $$2^{-4} \\cdot 3^{-1} \\cdot 5^{-3} \\cdot 7^{-3} \\cdot 11^{3} \\cdot 11699^{3}$$ Endomorphism ring: $$\\Z$$ Geometric endomorphism ring: $$\\Z$$ (no potential complex multiplication) Sato-Tate group: $\\mathrm{SU}(2)$\n\n## BSD invariants\n\n sage: E.rank() magma: Rank(E); Rank: $$0$$ sage: E.regulator() magma: Regulator(E); Regulator: $$1$$ sage: E.period_lattice().omega() gp: E.omega magma: RealPeriod(E); Real period: $$0.0856542481782$$ sage: E.tamagawa_numbers() gp: gr=ellglobalred(E); [[gr[i,1],gr[i]] | i<-[1..#gr[,1]]] magma: TamagawaNumbers(E); Tamagawa product: $$96$$ = $$2^{2}\\cdot2\\cdot2^{2}\\cdot3$$ sage: E.torsion_order() gp: elltors(E) magma: Order(TorsionSubgroup(E)); Torsion order: $$2$$ sage: E.sha().an_numerical() magma: MordellWeilShaInformation(E); Analytic order of Ш: $$1$$ (exact)\n\n## Modular invariants\n\nModular form 25200.2.a.ei\n\nsage: E.q_eigenform(20)\n\ngp: xy = elltaniyama(E);\n\ngp: x*deriv(xy)/(2*xy+E.a1*xy+E.a3)\n\nmagma: ModularForm(E);\n\n$$q + q^{7} - 2q^{13} - 6q^{17} + 4q^{19} + O(q^{20})$$\n\n sage: E.modular_degree() magma: ModularDegree(E); Modular degree: 663552 $$\\Gamma_0(N)$$-optimal: no Manin constant: 1\n\n#### Special L-value\n\nsage: r = E.rank();\n\nsage: E.lseries().dokchitser().derivative(1,r)/r.factorial()\n\ngp: ar = ellanalyticrank(E);\n\ngp: ar/factorial(ar)\n\nmagma: Lr1 where r,Lr1 := AnalyticRank(E: Precision:=12);\n\n$$L(E,1)$$ ≈ $$2.05570195628$$\n\n## Local data\n\nThis elliptic curve is not semistable.\n\nsage: E.local_data()\n\ngp: ellglobalred(E)\n\nmagma: [LocalInformation(E,p) : p in BadPrimes(E)];\n\nprime Tamagawa number Kodaira symbol Reduction type Root number ord($$N$$) ord($$\\Delta$$) ord$$(j)_{-}$$\n$$2$$ $$4$$ $$I_8^{*}$$ Additive -1 4 16 4\n$$3$$ $$2$$ $$I_1^{*}$$ Additive -1 2 7 1\n$$5$$ $$4$$ $$I_3^{*}$$ Additive 1 2 9 3\n$$7$$ $$3$$ $$I_{3}$$ Split multiplicative -1 1 3 3\n\n## Galois representations\n\nThe image of the 2-adic representation attached to this elliptic curve is the subgroup of $\\GL(2,\\Z_2)$ with Rouse label X13f.\n\nThis subgroup is the pull-back of the subgroup of $\\GL(2,\\Z_2/2^2\\Z_2)$ generated by $\\left(\\begin{array}{rr} 1 & 0 \\\\ 0 & 3 \\end{array}\\right),\\left(\\begin{array}{rr} 3 & 3 \\\\ 0 & 1 \\end{array}\\right)$ and has index 12.\n\nsage: rho = E.galois_representation();\n\nsage: [rho.image_type(p) for p in rho.non_surjective()]\n\nmagma: [GaloisRepresentation(E,p): p in PrimesUpTo(20)];\n\nThe mod $$p$$ Galois representation has maximal image $$\\GL(2,\\F_p)$$ for all primes $$p$$ except those listed.\n\nprime Image of Galois representation\n$$2$$ B\n$$3$$ B\n\n## $p$-adic data\n\n### $p$-adic regulators\n\nsage: [E.padic_regulator(p) for p in primes(3,20) if E.conductor().valuation(p)<2]\n\nAll $$p$$-adic regulators are identically $$1$$ since the rank is $$0$$.\n\n## Iwasawa invariants\n\n$p$ Reduction type $\\lambda$-invariant(s) $\\mu$-invariant(s) 2 3 5 7 add add add split - - - 1 - - - 0\n\nAll Iwasawa $\\lambda$ and $\\mu$-invariants for primes $p\\ge 5$ of good reduction are zero.\n\nAn entry - indicates that the invariants are not computed because the reduction is additive.\n\n## Isogenies\n\nThis curve has non-trivial cyclic isogenies of degree $$d$$ for $$d=$$ 2, 3, 4, 6 and 12.\nIts isogeny class 25200ef consists of 8 curves linked by isogenies of degrees dividing 12.\n\n## Growth of torsion in number fields\n\nThe number fields $K$ of degree up to 7 such that $E(K)_{\\rm tors}$ is strictly larger than $E(\\Q)_{\\rm tors}$ $\\cong \\Z/{2}\\Z$ are as follows:\n\n$[K:\\Q]$ $K$ $E(K)_{\\rm tors}$ Base change curve\n$2$ $$\\Q(\\sqrt{-1})$$ $$\\Z/4\\Z$$ Not in database\n$2$ $$\\Q(\\sqrt{-5})$$ $$\\Z/6\\Z$$ Not in database\n$2$ $$\\Q(\\sqrt{-105})$$ $$\\Z/4\\Z$$ Not in database\n$2$ $$\\Q(\\sqrt{105})$$ $$\\Z/2\\Z \\times \\Z/2\\Z$$ Not in database\n$4$ $$\\Q(i, \\sqrt{5})$$ $$\\Z/12\\Z$$ Not in database\n$4$ $$\\Q(\\sqrt{-5}, \\sqrt{-21})$$ $$\\Z/2\\Z \\times \\Z/6\\Z$$ Not in database\n$4$ $$\\Q(i, \\sqrt{105})$$ $$\\Z/2\\Z \\times \\Z/4\\Z$$ Not in database\n$4$ $$\\Q(\\sqrt{-5}, \\sqrt{21})$$ $$\\Z/12\\Z$$ Not in database\n$4$ 4.2.4630500.2 $$\\Z/2\\Z \\times \\Z/4\\Z$$ Not in database\n$6$ 6.2.5668704000.1 $$\\Z/6\\Z$$ Not in database\n\nWe only show fields where the torsion growth is primitive. For each field $K$ we either show its label, or a defining polynomial when $K$ is not in the database."
] | [
null
] | {"ft_lang_label":"__label__en","ft_lang_prob":0.5162933,"math_prob":0.9999906,"size":4346,"snap":"2020-45-2020-50","text_gpt3_token_len":1720,"char_repetition_ratio":0.12966375,"word_repetition_ratio":0.023569023,"special_character_ratio":0.4519098,"punctuation_ratio":0.13892215,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.99997103,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2020-11-29T19:55:43Z\",\"WARC-Record-ID\":\"<urn:uuid:75a96823-6415-40f2-a9ff-30f44daaee85>\",\"Content-Length\":\"88519\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:8ccf07ba-5a2b-4aca-8194-70f8c1ed0628>\",\"WARC-Concurrent-To\":\"<urn:uuid:c2bb8c0f-cb9f-43c2-8afa-873fc1653251>\",\"WARC-IP-Address\":\"35.241.19.59\",\"WARC-Target-URI\":\"https://www.lmfdb.org/EllipticCurve/Q/25200ef3/\",\"WARC-Payload-Digest\":\"sha1:VXKYGKTR6QKEPP5WLPSZSBA524UL25LF\",\"WARC-Block-Digest\":\"sha1:XDFM4O2EMI2ZJQREHGBKW7625NWBFYQT\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2020/CC-MAIN-2020-50/CC-MAIN-2020-50_segments_1606141202590.44_warc_CC-MAIN-20201129184455-20201129214455-00399.warc.gz\"}"} |
https://socratic.org/questions/how-do-you-solve-abs-t-6-4 | [
"# How do you solve abs(t+6)=4?\n\n##### 1 Answer\nSep 18, 2016\n\n$t = - 10 \\text{ and } t = - 2$\n\n#### Explanation:\n\nThe value inside the $\\textcolor{b l u e}{\\text{absolute value}}$ can be positive or negative but always produces a positive answer.\n\nFor example : $| - 4 | = 4 \\text{ and} | 4 | = 4$\n\nThe absolute value informs us about how far the number is from the origin with no consideration of it's direction.\n\n$- 4 \\mathmr{and} + 4 \\text{ are both 4 units from the origin.}$\n\nThis is also true for algebraic expressions inside the absolute value bars, so\n\n$t + 6 = 4 \\Rightarrow t = 4 - 6 \\Rightarrow t = - 2$\n\nand\n\n$- \\left(t + 6\\right) = 4 \\Rightarrow - t - 6 = 4$\n\nadd 6 to both sides.\n\n$- t \\cancel{- 6} \\cancel{+ 6} = 4 + 6$\n\n$\\Rightarrow - t = 10 \\Rightarrow t = - 10$\n\nCheck : $t = - 2 \\Rightarrow | - 2 + 6 | = | 4 | = 4$\n\nand $t = - 10 \\Rightarrow | - 10 + 6 | = | - 4 | = 4$\n\nThus solutions are t = - 10 and t = - 2"
] | [
null
] | {"ft_lang_label":"__label__en","ft_lang_prob":0.7110951,"math_prob":0.9999714,"size":811,"snap":"2021-21-2021-25","text_gpt3_token_len":269,"char_repetition_ratio":0.09789343,"word_repetition_ratio":0.0,"special_character_ratio":0.34648582,"punctuation_ratio":0.061349694,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9993481,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2021-06-24T12:34:01Z\",\"WARC-Record-ID\":\"<urn:uuid:5cdc0bbc-c17e-46fb-b111-5df107122861>\",\"Content-Length\":\"33975\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:4a3c939f-842f-44c0-b927-048e92ff40d8>\",\"WARC-Concurrent-To\":\"<urn:uuid:d3b45c97-a8c0-4bb4-bede-46e19d0e5c4e>\",\"WARC-IP-Address\":\"216.239.38.21\",\"WARC-Target-URI\":\"https://socratic.org/questions/how-do-you-solve-abs-t-6-4\",\"WARC-Payload-Digest\":\"sha1:DBK3EHZDAXMHJFGG3SDSW4Q76OSLNDFL\",\"WARC-Block-Digest\":\"sha1:PM2RIJZJVB37LFVVAWKYICZ62AYPYGZ7\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2021/CC-MAIN-2021-25/CC-MAIN-2021-25_segments_1623488553635.87_warc_CC-MAIN-20210624110458-20210624140458-00347.warc.gz\"}"} |
https://vorakl.com/articles/csp/ | [
"## Constraint Satisfaction Problem (CSP)\n\n### A mathematical question that is defined by variables, domains, and constraints\n\nConstraint Satisfaction Problem (CSP) is a class of problems that can be used to represent a large set of real-world problems. In particular, it is widely used in Artificial Intelligent (AI) as finding a solution for a formulated CSP may be used in decision making. There are a few adjacent areas in terms that for solving problems they all involve constraints: SAT (Boolean satisfiability problem), and the SMT (satisfiability modulo theories).\n\nGenerally speaking, the complexity of finding a solution for CSP is NP-Complete (takes exponential time), because a solution can be guessed and verified relatively fast (in polynomial time), and the SAT problem (NP-Hard) can be translated into a CSP problem. But, it also means, there is no known polynomial-time solution. Thus, the development of efficient algorithms and techniques for solving CSPs is crucial and appears as a subject in many scientific pieces of research.\n\nThe simplest kind of CSPs are defined by a set of discrete variables (e.g. X, Y), finite non-empty domains (e.g. 0<X<=4, Y<10), and a set of constraints (e.g. Y=X^2, X<>3) which involve some of the variables. There are distinguished two related terms: the Possible World (or the Complete Assignment) of a CSP is an assignment of values to all variables and the Model (or the Solution to a CSP) is a possible world that satisfies all the constraints.\n\nWithin the topic, there is a programming paradigm - Constraint Programming. It allows building a Constraint Based System where relations between variables are stated in a form of constraints. Hence, this defines certain specifics:\n\n• the paradigm doesn't specify a sequence of steps to execute for finding a solution, but rather declares the solution's properties and desired result. This makes the paradigm a sort of Declarative Programming\n• it's usually characterized by non-directional computation when to satisfy constraints, computations are propagated throughout a system accordingly to changed conditions or variables' values.\n\nThe example of using this paradigm can be seen in another my article \"A converter of a character's case and Ascii codes\".\n\nA CSP can be effectively applied in a number of areas like mappings, assignments, planning and scheduling, games (e.g. sudoku), solving system of equations, etc. There are also a number of software frameworks which provide CSP solvers, like python-constraint and Google OR-Tools, just to name a few."
] | [
null
] | {"ft_lang_label":"__label__en","ft_lang_prob":0.9264738,"math_prob":0.90210557,"size":2544,"snap":"2020-45-2020-50","text_gpt3_token_len":515,"char_repetition_ratio":0.11496063,"word_repetition_ratio":0.0,"special_character_ratio":0.20007862,"punctuation_ratio":0.111827955,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.99205625,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2020-10-22T09:19:39Z\",\"WARC-Record-ID\":\"<urn:uuid:16eed763-0831-4c31-b14d-3fab04f53f84>\",\"Content-Length\":\"8369\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:8946ab65-3acd-43c5-a8cd-4d393c6588c0>\",\"WARC-Concurrent-To\":\"<urn:uuid:5cc165f2-298a-443e-820d-1a7a5212ff83>\",\"WARC-IP-Address\":\"104.31.84.97\",\"WARC-Target-URI\":\"https://vorakl.com/articles/csp/\",\"WARC-Payload-Digest\":\"sha1:HZ6LJB33VW47FP7BIU4FEXO2OM54R4S3\",\"WARC-Block-Digest\":\"sha1:LZSXARVXGQ7M3755GXNADSDL3XJCFF3T\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2020/CC-MAIN-2020-45/CC-MAIN-2020-45_segments_1603107879362.3_warc_CC-MAIN-20201022082653-20201022112653-00302.warc.gz\"}"} |
https://qa.answers.com/other-qa/What_is_the_difference_between_correlation_coefficient_and_chi_square | [
"",
null,
"",
null,
"",
null,
"",
null,
"0\n\n# What is the difference between correlation coefficient and chi square?\n\nUpdated: 9/28/2023",
null,
"Wiki User\n\n13y ago\n\ncorrelation is used when there is metric data and chi square is used when there is categorized data.\n\nsayan chakrabortty",
null,
"Wiki User\n\n13y ago",
null,
"",
null,
"",
null,
"Earn +20 pts\nQ: What is the difference between correlation coefficient and chi square?\nSubmit\nStill have questions?",
null,
"",
null,
"Related questions\n\n### What is coefficient of determination?\n\nThe coefficient of determination R2 is the square of the correlation coefficient. It is used generally to determine the goodness of fit of a model. See: http://en.wikipedia.org/wiki/Coefficient_of_determination for more details.\n\n### What did E MC square do?\n\nIt defined a direct correlation between matter and energy.\n\n### How can you tell if it appears to have a good r-square?\n\nr^2 , the square of the correlation coefficient represents the percentage of variation explained by the independent variable of the dependent variable. It varies between 0 and 100 percent. The user has to make his/her own judgment as to whether the obtained value of r^2 is good enough for him/her.\n\n### What does the value of r square interpret?\n\nR2 refers to the fraction of variance. it is the square of the correlation coefficient between two dependent variables. It is a statistical term that tells us how good one variable is at predicting another. If R2 is 1.0, then given the value of one variable you can perfectly predict the value of the other variable. If R2 is 0.0, then knowing either variable does not help you predict the other variable. In turn, the higher the R2 value the more correlation there is between the two variables.\n\n### What is difference between centimeter square and square centimeter?\n\nNo mathematical difference.\n\n### What's the difference between square kilometers and kilometers squared?\n\nThere is no difference between square meters and meters square. for simplicity we use these in different form.\n\n### What is the difference between a square pyramid and a pyramid?\n\nthe difference between them is that the bottom face is different one of them is a rectangle and one of them is a square\n\n### What is the difference between 7-8 Reggae and normal 7-8 time?\n\nIt is the same as the difference between a blue square and a square.\n\n### What is the difference between a square pyramid and a rectangular pyramid?\n\nthe difference between them is that the bottom face is different one of them is a rectangle and one of them is a square\n\n### How do you calculate Spearman's rank correlation?\n\n# State the null hypothesis i.e. \"There is no relationship between the two sets of data.\" # Rank both sets of data from the highest to the lowest. Make sure to check for tied ranks. # Subtract the two sets of ranks to get the difference d. # Square the values of d. # Add the squared values of d to get Sigma d2. # Use the formula Rs = 1-(6Sigma d2/n3-n) where n is the number of ranks you have. # If the Rs value... ... is -1, there is a perfect negative correlation. ...falls between -1 and -0.5, there is a strong negative correlation. ...falls between -0.5 and 0, there is a weak negative correlation. ... is 0, there is no correlation ...falls between 0 and 0.5, there is a weak positive correlation. ...falls between 0.5 and 1, there is a strong positive correlation ...is 1, there is a perfect positive correlation between the 2 sets of data. # If the Rs value is 0, state that null hypothesis is accepted. Otherwise, say it is rejected. (sourced from http://www.revision-notes.co.uk/revision/181.html)\n\n### What is the difference between units square and square units?\n\nThere isn't a significant difference, just which ever you prefer.\n\n### Is there a difference between a perfect square and a square?\n\nNo, but a perfect square is usually the square of a whole number."
] | [
null,
"https://qa.answers.com/icons/searchIcon.svg",
null,
"https://qa.answers.com/icons/searchGlassWhiteIcon.svg",
null,
"https://qa.answers.com/icons/notificationBellIcon.svg",
null,
"https://qa.answers.com/icons/coinIcon.svg",
null,
"https://qa.answers.com/images/avatars/default.png",
null,
"https://qa.answers.com/images/avatars/default.png",
null,
"https://qa.answers.com/images/avatars/default.png",
null,
"https://qa.answers.com/icons/sendIcon.svg",
null,
"https://qa.answers.com/icons/coinIcon.svg",
null,
"https://qa.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.93362176,"math_prob":0.9867677,"size":3728,"snap":"2023-40-2023-50","text_gpt3_token_len":834,"char_repetition_ratio":0.17293233,"word_repetition_ratio":0.19968553,"special_character_ratio":0.23095493,"punctuation_ratio":0.14395887,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9974355,"pos_list":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22],"im_url_duplicate_count":[null,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-11-29T16:09:10Z\",\"WARC-Record-ID\":\"<urn:uuid:294dd8eb-0a21-4eb7-ab5d-41affab1a064>\",\"Content-Length\":\"177814\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:07a3a089-de43-4039-81b1-7eadf1374bfb>\",\"WARC-Concurrent-To\":\"<urn:uuid:26565634-ce11-4f6a-bf87-b299f24899e6>\",\"WARC-IP-Address\":\"146.75.28.203\",\"WARC-Target-URI\":\"https://qa.answers.com/other-qa/What_is_the_difference_between_correlation_coefficient_and_chi_square\",\"WARC-Payload-Digest\":\"sha1:76B6747HARNQUE2T5WPSLTJGAZRGYBXP\",\"WARC-Block-Digest\":\"sha1:SH2LDR3LVSUF4UZRB2CU3TKFFRE6BNMD\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2023/CC-MAIN-2023-50/CC-MAIN-2023-50_segments_1700679100112.41_warc_CC-MAIN-20231129141108-20231129171108-00651.warc.gz\"}"} |
https://metanumbers.com/249975600 | [
"249975600 (number)\n\n249,975,600 (two hundred forty-nine million nine hundred seventy-five thousand six hundred) is an even nine-digits composite number following 249975599 and preceding 249975601. In scientific notation, it is written as 2.499756 × 108. The sum of its digits is 42. It has a total of 9 prime factors and 120 positive divisors. There are 57,135,360 positive integers (up to 249975600) that are relatively prime to 249975600.\n\nBasic properties\n\n• Is Prime? No\n• Number parity Even\n• Number length 9\n• Sum of Digits 42\n• Digital Root 6\n\nName\n\nShort name 249 million 975 thousand 600 two hundred forty-nine million nine hundred seventy-five thousand six hundred\n\nNotation\n\nScientific notation 2.499756 × 108 249.9756 × 106\n\nPrime Factorization of 249975600\n\nPrime Factorization 24 × 3 × 52 × 7 × 29759\n\nComposite number\nDistinct Factors Total Factors Radical ω(n) 5 Total number of distinct prime factors Ω(n) 9 Total number of prime factors rad(n) 6249390 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 249,975,600 is 24 × 3 × 52 × 7 × 29759. Since it has a total of 9 prime factors, 249,975,600 is a composite number.\n\nDivisors of 249975600\n\n1, 2, 3, 4, 5, 6, 7, 8, 10, 12, 14, 15, 16, 20, 21, 24, 25, 28, 30, 35, 40, 42, 48, 50, 56, 60, 70, 75, 80, 84, 100, 105, 112, 120, 140, 150, 168, 175, 200, 210, 240, 280, 300, 336, 400, 420, 560, 600, 840, 1200, 1680 Load all the 120 divisors\n\n120 divisors\n\n Even divisors 96 24 12 12\nTotal Divisors Sum of Divisors Aliquot Sum τ(n) 120 Total number of the positive divisors of n σ(n) 9.1518e+08 Sum of all the positive divisors of n s(n) 6.65204e+08 Sum of the proper positive divisors of n A(n) 7.6265e+06 Returns the sum of divisors (σ(n)) divided by the total number of divisors (τ(n)) G(n) 15810.6 Returns the nth root of the product of n divisors H(n) 32.7773 Returns the total number of divisors (τ(n)) divided by the sum of the reciprocal of each divisors\n\nThe number 249,975,600 can be divided by 120 positive divisors (out of which 96 are even, and 24 are odd). The sum of these divisors (counting 249,975,600) is 915,179,520, the average is 7,626,496.\n\nOther Arithmetic Functions (n = 249975600)\n\n1 φ(n) n\nEuler Totient Carmichael Lambda Prime Pi φ(n) 57135360 Total number of positive integers not greater than n that are coprime to n λ(n) 1785480 Smallest positive number such that aλ(n) ≡ 1 (mod n) for all a coprime to n π(n) ≈ 13662317 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 57,135,360 positive integers (less than 249,975,600) that are coprime with 249,975,600. And there are approximately 13,662,317 prime numbers less than or equal to 249,975,600.\n\nDivisibility of 249975600\n\n m n mod m 2 3 4 5 6 7 8 9 0 0 0 0 0 0 0 6\n\nThe number 249,975,600 is divisible by 2, 3, 4, 5, 6, 7 and 8.\n\n• Arithmetic\n• Refactorable\n• Abundant\n\n• Polite\n• Practical\n\nBase conversion (249975600)\n\nBase System Value\n2 Binary 1110111001100101001100110000\n3 Ternary 122102101002001120\n4 Quaternary 32321211030300\n5 Quinary 1002443204400\n6 Senary 40445502240\n8 Octal 1671451460\n10 Decimal 249975600\n12 Duodecimal 6b871980\n20 Vigesimal 3i26j00\n36 Base36 44tueo\n\nBasic calculations (n = 249975600)\n\nMultiplication\n\nn×y\n n×2 499951200 749926800 999902400 1249878000\n\nDivision\n\nn÷y\n n÷2 1.24988e+08 8.33252e+07 6.24939e+07 4.99951e+07\n\nExponentiation\n\nny\n n2 62487800595360000 15620425446505473216000000 3904725223245473570453529600000000 976086030515921203058263333877760000000000\n\nNth Root\n\ny√n\n 2√n 15810.6 629.94 125.74 47.8167\n\n249975600 as geometric shapes\n\nCircle\n\n Diameter 4.99951e+08 1.57064e+09 1.96311e+17\n\nSphere\n\n Volume 6.54307e+25 7.85245e+17 1.57064e+09\n\nSquare\n\nLength = n\n Perimeter 9.99902e+08 6.24878e+16 3.53519e+08\n\nCube\n\nLength = n\n Surface area 3.74927e+17 1.56204e+25 4.3297e+08\n\nEquilateral Triangle\n\nLength = n\n Perimeter 7.49927e+08 2.7058e+16 2.16485e+08\n\nTriangular Pyramid\n\nLength = n\n Surface area 1.08232e+17 1.84088e+24 2.04104e+08\n\nCryptographic Hash Functions\n\nmd5 0ec4bc8554e6b8ad21cf04cee0a9f765 ea119fb17f506b6650b44d050c65e2b6a57102e8 42210f8735c0c721a708cd18594863fdd657b08d751eb70561f3b6829128cfb9 6a9804530e0c4f2e400f7ecf5b73081035a8693dc77ba3278fdee75f40a1a90edb26f60d636072b62dd593a77c06dc1eda0a94a3c4972781c201d953fe8ee821 484eec1daa26177921239ee32b35c0848b923019"
] | [
null
] | {"ft_lang_label":"__label__en","ft_lang_prob":0.6201665,"math_prob":0.98585474,"size":4988,"snap":"2022-05-2022-21","text_gpt3_token_len":1771,"char_repetition_ratio":0.12379615,"word_repetition_ratio":0.051649928,"special_character_ratio":0.49077788,"punctuation_ratio":0.09427208,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9945081,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2022-01-18T07:48:56Z\",\"WARC-Record-ID\":\"<urn:uuid:788f6ddd-8547-4006-ba9a-51d575608983>\",\"Content-Length\":\"41274\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:52e2dff2-4023-4a80-a687-7b20596fad4d>\",\"WARC-Concurrent-To\":\"<urn:uuid:c114923c-98d8-41d8-8576-55d0745c0afc>\",\"WARC-IP-Address\":\"46.105.53.190\",\"WARC-Target-URI\":\"https://metanumbers.com/249975600\",\"WARC-Payload-Digest\":\"sha1:JSG27KK7VR2TZUTKZ4UVCFEHKL27YLSE\",\"WARC-Block-Digest\":\"sha1:HQTNUX73CQBWHZJNNQGE3OHQMJEVJJIQ\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2022/CC-MAIN-2022-05/CC-MAIN-2022-05_segments_1642320300805.79_warc_CC-MAIN-20220118062411-20220118092411-00079.warc.gz\"}"} |
https://www.kusa.com.np/2019/03/SEE-Compulsory-Math-Model-Question-2075-2019-SET01-Solution.html | [
"## SEE Compulsory Math Model Question | 2075 | SET 01 | With Solution\n\nSecondary Education Examinations -SEE\nMODEL QUESTION (SET 01) - 2075 (2019)\nCOMPULSORY MATHS\nTime: 3:00 hrs\n\nFull Marks: 100\n\n### Also Check:\n\nDownload All Exam Papers - Question Papers of Secondary Education Examination [SEE] 2074/2018\nDownload All Exam Papers - Question Papers of Secondary Education Examination [SEE] 2073/2017\nDownload Supplementary Question Papers - Exam Papers of Secondary Education Examination [SEE] 2074/2018, 2075/2019\nCandidates are required to give their answer according to the given instructions.",
null,
"SEE Compulsory Math Model Question 2075-2019 SET01\nसबै प्रश्नहरु हल गर्नुहोस् Attempt all the Questions.\nसमूह - 'क' (Group - 'A') [3x2=6]\n1.\n(a) Write down the definition of Value Added Tax (VAT).\nSolution:\nA value-added tax (VAT) is a type of consumption tax that is placed on a product whenever value is added at a stage of production and at the point of retail sale.[/toggle]\n(b). If three sides of a triangle are a,b and c respectively, what is the semi perimeter of the triangle? Write it.\nSolution:",
null,
"Semi perimeter of a triangle\n2.\n(a) (Simplify):",
null,
"simplify\nSolution:",
null,
"simplify answer\n(b). Write the formula to find the value of lower quartile (Q1) of a continuous data.\nSolution:",
null,
"value of quartile Q1\n3.\n(a). In the given figure, what is the relation between the area of the parallelogram PQRS and the ΔQTR? Write it.",
null,
"area of parallelogram PQRS\nSolution:\nArea of ΔQTR=1/2 area of Parallelogram PQRS\n(b). In the adjoining figure, O is the center of a circle. If ∡NMP = x0, find the value of ∡NOP.\nSolution:∡NOP = 2x˚\nसमूह - 'ख' (Group - 'B') [9X4=36] [7 x (2+2) +3 x (2+2+2) =34]\n4.\n(a) The price of an object with 13%value added tax is Rs. 5763. What will be the value added tax amount? Find it.\nSolution:\ni. Let the price of the object with VAT be Rs. x.\nThen,\n113x/100 = 5763\nTherefore, x = Rs. 5100\nii. VAT amount = Rs. 5763-Rs. 5100\n= Rs. 663[/toggle]\n(b). The present price of a motorcycle is Rs. 2,25,000. If its price is depreciated per year by 8%, after how many years will be the price of the motorcycle be Rs. 1,75,204.80? Find it.\nSolution:",
null,
"price of motercycle\n5.\n(a) The area of anisosceles triangular land whose base side length 10 meter is 60 square meter. Find the measure of its remaining sides.\n(b). The volume of a cylinder with diameter of its base 14 cm is 2156 cubic cm. Find the height of the cylinder.\n(c). In the given solid triangular prism, if PQ⏊QR, PQ = 8cm, QR = 6cm and RR1= 15 cm, find the lateral surface area of the prism.",
null,
"triangular prism\n\nSolution:",
null,
"area of the lateral surface of prism\n6.\n(a) (Simplify):\n2√98 - 8√32 + 3√72\nSolution:",
null,
"simplify solution\n(b). (Solve):",
null,
"solve\nSolution:",
null,
"solve solution\n7.\n(a) (Evaluate) :",
null,
"evaluate\nSolution:",
null,
"evaluate solution\n(b). If 5 is added to the square of a positive number, the sum is 69. Find the number.\nSolution:",
null,
"number\n(c). (Simplify):",
null,
"simplify\nSolution:",
null,
"simplify solution\n8.\n(a) In the given figure, BC// AE, BA//CD, BF// CE and AX⏊CD. If AB= 12 cm and area of the quadrilateral BCEF = 84 sq. cm., find the length of AX.",
null,
"quadrilateral BCEF\nSolution:",
null,
"area-of-parallelogram\n(b). In the given figure, O is the centre of the circle and MNPQ is a cyclic quadrilateral. If NR = NP and ∡PNR = 500, find the size of ∡NMQ .",
null,
"cyclic\n\nSolution:",
null,
"size of NMQ\n(c). In the given figure, O is the center of the circle and AB is a tangent line. If OC= 5 cm and BC = 12 cm, find the measure of BE.",
null,
"measure of BE\nSolution:",
null,
"solution measure of BE\n9.\n(a) In the given triangle XYZ, XY = 8 cm, YZ = 12 cm and area of ΔXYZis 24 sq. cm., find the size of ∡XYZ.",
null,
"triangle-XYZ\nSolution:",
null,
"size of XYZ\nb). In a grouped data, if the number of terms (N) =9b+5, Σfm = 350 and Mean",
null,
", find the value of N.\nSolution:",
null,
"the-value-of-N\n10.\n(a) Find the probability of getting a number divisible by 3 or a square number when a fair dice is thrown.\nSolution:",
null,
"probability of getting number divisible by 3\n(b). From a bag containing 10 red and 6 black balls of the same shape and size, two balls are taken randomly in succession without replacement. Show the probabilities of all outcomes in a tree diagram.\nSolution:",
null,
"probabilities-tree-diagram\nसमूह - 'ग' (Group - 'C') [10x4=40]\n11. In a survey of a group of 180 students, 50 students say to like cricket game only, 30 students say to like basketball game only and 50 students say do not like both games.\ni) Represent the above information in a Venn diagram.\nii) Find the ratio of the students who like cricket game and basketball game.\nSolution:",
null,
"survey\n12. Manish bought some American dollar for Rs. 2,00,000. But after four days, the Nepalese currency was devaluated in the comparison of American dollar by 5%. Again Manish exchanged the Nepali currency by giving American dollar in the day of devaluation of Nepalese currency. How much does he gain or loss? Find it.-\\$1 = NRs.104.28.\nSolution:",
null,
"manish-american-dollar\n13. Find the total surface area of a square based pyramid having the slant height 10 cm and vertical height 8cm.\nSolution:",
null,
"total-surface-area-of-a-square\n14. (Find the H.C.F. of):\na3+1+2a2+2a, a3-1 and a4+a2+1\nSolution:",
null,
"hcf\n15. (Simplify):",
null,
"simplify-3\nSolution:",
null,
"simplify-7\n16. A triangle PMN and a parallelogram RMNQ are constructed on the same base MN and between the same parallel lines MN and PQ. Prove that: area of ΔPMN=1/2 area of RMNQ.\nSolution:",
null,
"area pmn=1/2 area of rmnq\n17. Construct a quadrilateral PQRS in which PQ=5cm, QR=5.6cm, Rs=5.4cm, SP=6.8cm, and ∡PQR=750. Then construct a triangle PSM equal in area to the quadrilateral PQRS.\nSolution:",
null,
"quadrilateral-PQRS\n18. Explore experimentally the relation between the central angle APC and the circumference angle ABC standing on the same arc AC of a circle ABC. (Two circles of radii not less than 3cm are necessary.)\nSolution:",
null,
"radii\n19. A 1.5 meters tall person is standing in front of 41.5 meters high tree. When observing the top of the tree an angle of 450 is formed with the eyes. Find the distance between the tree and the person.\nSolution:",
null,
"distance-between-tree-and-person\n20. If the median of the following given data is 19, find the value of P.",
null,
"median\nSolution:",
null,
"median-find-the-value-of-p\nसमूह - 'घ' (Group - 'D') [4x5=20]\n21. A bank has fixed the rate of interest 10% per annum semiannually compound interest in account A and12% per annum annually compound interest in account B. If you are going to deposit Rs. 25,000 for 2 years in the same bank, in which account will you deposit and why? Give your reason with calculation.\nSolution:",
null,
"deposit-bank\n22. A person bought a water tank of circular base having the radius 1.05 meter and height 3.5 meter for the use of own house from the shop. If the upper part of the tank is semi spherical, how many liters of water will be contained in the tank? Find it.\nSolution:",
null,
"liters of water in tank\n23. Three years ago, the sum of the ages of the father and son was 48 years. After three years the ratio of the ages of the father and son will be 3: 1, then how much old is the father from his son? Find it.\nSolution:",
null,
"old-father-son\n24. In the given figure, ABCD is a cyclic quadrilateral. The side CD is produced to E. If AD bisects ∡BDE, prove that ΔABC is an isosceles triangle.\nSolution:",
null,
"cyclic-quadrilateral\n\nCheck and view Model Question Paper Of Compulsory Maths (SET 01) | Secondary Education Examination [SEE] | 2074/2018 with Solution.\n\nSearch Terms:\n\nFirst of all, thank you for visiting my blog. It's much appreciated! If you would like to leave a comment, please do, I'd love to hear what you think!\n\nSuggestions and/or questions are always welcome, please post them in the comment form below.\n\nHowever, comments are always reviewed and it may take some time to appear. Always keep in mind \"URL without nofollow tag\" will consider as a spam."
] | [
null,
"https://1.bp.blogspot.com/-UHsQw_Fz26g/XIlGS2Cuj5I/AAAAAAAAAS4/YHB97rXDTI4LDFtexgsMKQ8anDWwyK6sQCLcBGAs/s1600/SEE-Maths-Model-Question-2074-2018-SET-01_page-0001.jpg",
null,
"https://2.bp.blogspot.com/-LTeZcI82ss0/XIky-MtAksI/AAAAAAAAAMw/7_SF63VU-Q4vFwaiM0jcjvWD4R_ZpFBPgCLcBGAs/s1600/perimeter-triangle.png",
null,
"https://1.bp.blogspot.com/-93sx6hxIuCo/XIkzoPVORZI/AAAAAAAAAM4/CGOySjq7jdkJ-w1Tb3kCXFz_QE6BZkDkgCLcBGAs/s1600/simplify.png",
null,
"https://1.bp.blogspot.com/-ZLwpp4qIKHg/XIk0Bv5mQYI/AAAAAAAAANE/p3514ExrUVYzZ1wmFye9Sv0Gea45eZIqQCLcBGAs/s1600/simplify-ans.png",
null,
"https://4.bp.blogspot.com/-aeP1b1i-hso/XIk0liqBf-I/AAAAAAAAANM/WnIm_eRaD60lTIo4AkI0-u0V6MBvBOiDQCLcBGAs/s1600/lower%2Bquartile.png",
null,
"https://4.bp.blogspot.com/-wU_qD5OeOoU/XIk0z3GPQEI/AAAAAAAAANQ/uTMNw_1c9pIWwzPOpfRyrt2y7lbB_hDQgCLcBGAs/s1600/parallelogram%2BPQRS.png",
null,
"https://1.bp.blogspot.com/-oCesUc8BWmY/XIk1ug3p4gI/AAAAAAAAANk/ZnkGcaS4D18AKGTh9l3G1rlIdO9_Vj69ACLcBGAs/s1600/price-motercycle.png",
null,
"https://1.bp.blogspot.com/-MBAWYnlhY-k/XIk2QOGsIsI/AAAAAAAAANs/aQUwTgRhGuUL5k-rR78L2GIcC7xML8_DQCLcBGAs/s320/triangular%2Bprism.png",
null,
"https://4.bp.blogspot.com/-2oEV23N6XlE/XIk2ndAur1I/AAAAAAAAAN0/JNOnZwmGMrwsyPR-cv5jZWCNuJ-Jb6z-QCLcBGAs/s320/triangular%2Bprism%2Banswer.png",
null,
"https://4.bp.blogspot.com/-Ii6zjJCjuaM/XIk3p7-DerI/AAAAAAAAAOA/Lq6IZj1bmnwQl9DK474I5j9wyLBOA7NRwCLcBGAs/s1600/simplify-4.png",
null,
"https://1.bp.blogspot.com/-1CSGYS_0G7U/XIk342DkaFI/AAAAAAAAAOE/bOjshsgf6V85mtuA0OGgvU4ECK4SnaMHgCLcBGAs/s1600/simplify-1.png",
null,
"https://2.bp.blogspot.com/-JMkO-Ly5oDU/XIk4ROV8G5I/AAAAAAAAAOQ/mgh59PLNpOcSyi8fG28pHzs8Bfa0Q6qeACLcBGAs/s1600/solve.png",
null,
"https://2.bp.blogspot.com/-6zGu32JQ3jY/XIk4lSSi7EI/AAAAAAAAAOY/sRu6KOt9jG8D65ntSJKKbs1xjxn9TOtywCLcBGAs/s1600/evaluate.png",
null,
"https://3.bp.blogspot.com/-390SsNkZUBs/XIk41oDbNMI/AAAAAAAAAOc/rK8v4w8guw0j-S-i-j2wGeoY-Te-ReWCQCLcBGAs/s1600/evaluate-1.png",
null,
"https://4.bp.blogspot.com/-UU3tgNB30JM/XIk5ExkzveI/AAAAAAAAAOk/msmQiAo7ps8WZNdVvFM1W9Znyo8O13DwwCLcBGAs/s1600/find-the-number.png",
null,
"https://2.bp.blogspot.com/-IFUPlHYFfa8/XIk5UvaxZiI/AAAAAAAAAOw/OwTc9YV3P-UTjaYWPf-WEvtj5WDoQmqwgCLcBGAs/s1600/simplify-2.png",
null,
"https://1.bp.blogspot.com/-SLU9-ss8vXY/XIk5sOQ_TvI/AAAAAAAAAO4/lH7geH8yjYo-7bJRpksTu42BQ4Ji8WJugCLcBGAs/s1600/simplify-6.png",
null,
"https://3.bp.blogspot.com/-KXg0AkhRPz8/XIk55rlXaKI/AAAAAAAAAO8/0-AzBzjn1p8HrA68yvUnEcWv7-O1dahIgCLcBGAs/s320/quadrilateral-BCEF.png",
null,
"https://1.bp.blogspot.com/-9PHsc-JZJKg/XIk6YvFz3II/AAAAAAAAAPM/vp2TWrqoUXEeMCoJ0epUymf18t6ZiMbWQCLcBGAs/s320/area-of-parallelogram.png",
null,
"https://2.bp.blogspot.com/-nia6HxynB-I/XIk6kz6AFfI/AAAAAAAAAPQ/oAenHR92K04OTWMRHjzkCnlO9ETwYV6GwCLcBGAs/s1600/cyclic.png",
null,
"https://4.bp.blogspot.com/-3ch5Z3-yj44/XIk61RwRvEI/AAAAAAAAAPY/uxUTVBXyXyM10tP20LEJMYeBWGGjrTCcQCLcBGAs/s1600/size-of-NMQ.png",
null,
"https://2.bp.blogspot.com/-zGA4RRO8uBQ/XIk7E1DSGDI/AAAAAAAAAPc/xc94i81pZ6cB4khRV-AkI5qLVy2VOWKVQCLcBGAs/s1600/circle.png",
null,
"https://2.bp.blogspot.com/-WFmtR78K0WI/XIk7WDiPkKI/AAAAAAAAAPs/3LGZSkYaWc4vvx23JAIQTXl0uBy58R-9wCLcBGAs/s1600/measure-of-BE.png",
null,
"https://4.bp.blogspot.com/-gsCagZl4kWs/XIk7n__l-6I/AAAAAAAAAP0/r6lKIJ-6TegA9DmWawFRDoYSuARHv5HVwCLcBGAs/s1600/triangle-XYZ.png",
null,
"https://4.bp.blogspot.com/-YBzcF6Z-iE0/XIk79DSR5SI/AAAAAAAAAP8/rtq1daLI4LwaEBQKb9kvu7iG5LrcbOmEgCLcBGAs/s320/size-of-XYZ.png",
null,
"https://2.bp.blogspot.com/-8qEjkoOymxU/XIk8J7YinqI/AAAAAAAAAQA/6b5ZTeuyE2UllY10meUrWYzIz5PfzrR5wCLcBGAs/s1600/mean.png",
null,
"https://2.bp.blogspot.com/-VUW9_7pmHww/XIk8hmbJtyI/AAAAAAAAAQI/S_Wa4_tCQCEhIc8Xh-R6oKZGHY7Cwfv2wCLcBGAs/s1600/the-value-of-N.png",
null,
"https://1.bp.blogspot.com/-IUyx1EnpX0A/XIk8tNJRBjI/AAAAAAAAAQM/9Ayqtece0C0l8S_SMgxWYBAdfZHwHjYBACLcBGAs/s1600/probability-fair-dice.png",
null,
"https://4.bp.blogspot.com/-I0CEEtaDYiE/XIk9F_2G2wI/AAAAAAAAAQU/4YEOV3T_VNA553fVJC8wFcHorP9jZor2ACLcBGAs/s1600/probabilities-tree-diagram.png",
null,
"https://1.bp.blogspot.com/-h1I9yk-B0kQ/XIk9Xpg-NKI/AAAAAAAAAQc/axm_TXLPPgQylNtX7oh5J44Ym_jXByejQCLcBGAs/s1600/survey.png",
null,
"https://2.bp.blogspot.com/-sGPiZjTjHfs/XIk9s7DLngI/AAAAAAAAAQk/FuwPtz2DvEQKoqLipcL081IyduEpMhg3gCLcBGAs/s1600/manish-american-dollar.png",
null,
"https://4.bp.blogspot.com/-I3BeDPgITBI/XIk-B4dl9gI/AAAAAAAAAQs/ssA3Zu_N-jwuUxI57657ioLkfN4zdWlOwCLcBGAs/s1600/total-surface-area-of-a-square.png",
null,
"https://3.bp.blogspot.com/-dtKLQbjqCJQ/XIk-Qw_raEI/AAAAAAAAAQw/J0RQj8oBcsAm0oXrDtf2qgOEAGh-UCoOwCLcBGAs/s1600/HCF.png",
null,
"https://3.bp.blogspot.com/-JRQ8yUxAAiY/XIk-eIXzGEI/AAAAAAAAAQ4/jEspEau0Gz8PupZ5LDZrsVH0RrkzCQ-UACLcBGAs/s320/simplify-3.png",
null,
"https://3.bp.blogspot.com/-8e2tW7RotJo/XIk-zMgt1wI/AAAAAAAAARE/_xs6ZGGWMHAdkXZQrUfpcuywoohOix0TACLcBGAs/s1600/simplify-7.png",
null,
"https://4.bp.blogspot.com/-FT0OoX7THjQ/XIk_J-_Io2I/AAAAAAAAARM/058DrAsVXRAm7-c_EHniDWYH27guJDrCwCLcBGAs/s1600/triangle-parallelogram.png",
null,
"https://3.bp.blogspot.com/-z7MsbPHW8YU/XIk_luwUgXI/AAAAAAAAARU/frHRItHJ2FkAmz28lDEIRqdqeq-mINL1gCLcBGAs/s1600/quadrilateral-PQRS.png",
null,
"https://3.bp.blogspot.com/-BpDODBtXKJo/XIk_ymUT7dI/AAAAAAAAARY/-CU79vErEAcKckSHgRLp5vWLPBEmQdKpgCLcBGAs/s1600/radii.png",
null,
"https://3.bp.blogspot.com/-VkkAnjpXPco/XIk__vvFvlI/AAAAAAAAARg/dHhs2gV0F_oDWLL4IyGRsre0CU8tdNGvACLcBGAs/s1600/distance-between-tree-and-person.png",
null,
"https://3.bp.blogspot.com/-9KE0o2H3aIU/XIlALQQV27I/AAAAAAAAARo/ZozqNf7JyyEImPl8q72d81wrgR6h_paQQCLcBGAs/s1600/median.png",
null,
"https://4.bp.blogspot.com/-1MhwM-sCPx4/XIlBCHONjMI/AAAAAAAAAR8/jlIEUt8ObjoT044rvdOCJQ3-1nojyGXAgCLcBGAs/s1600/median-find-the-value-of-p.png",
null,
"https://3.bp.blogspot.com/-Ytljurp7n2c/XIlBP11HapI/AAAAAAAAASE/u5QxtSHqTp8bBGv17yGfhztY6lOCgLl1ACLcBGAs/s1600/deposit-bank.png",
null,
"https://2.bp.blogspot.com/-VQ1kx1Xr_QU/XIlBjGl99ZI/AAAAAAAAASQ/KUXEKS2q5RgTvUn5Tg0AaAkxPmXzoC0VQCLcBGAs/s1600/water-tank.png",
null,
"https://3.bp.blogspot.com/-6LiNcoKU5y0/XIlB1JdyrDI/AAAAAAAAASY/WNtIGUza5D4wXP0BtvxIwYDfP6qaRXidwCLcBGAs/s1600/old-father-son.png",
null,
"https://4.bp.blogspot.com/-Xp7Ec5RTs8E/XIlChv3H67I/AAAAAAAAASs/Gr9Yadnl1rEgR3M9px5i0S8UaweRaDWAgCLcBGAs/s1600/cyclic-quadrilateral.png",
null
] | {"ft_lang_label":"__label__en","ft_lang_prob":0.7893433,"math_prob":0.97276735,"size":6075,"snap":"2023-14-2023-23","text_gpt3_token_len":1785,"char_repetition_ratio":0.16307034,"word_repetition_ratio":0.04737903,"special_character_ratio":0.29514402,"punctuation_ratio":0.118136436,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9972641,"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],"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,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\":\"2023-05-29T21:10:53Z\",\"WARC-Record-ID\":\"<urn:uuid:9a71e46b-d302-4aa4-94c0-7abd3d9b63e2>\",\"Content-Length\":\"327893\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:854b1dfb-a485-4006-b1db-80d74e92404e>\",\"WARC-Concurrent-To\":\"<urn:uuid:388c4afb-0736-47b9-a975-4e67c2bfa94e>\",\"WARC-IP-Address\":\"142.251.16.121\",\"WARC-Target-URI\":\"https://www.kusa.com.np/2019/03/SEE-Compulsory-Math-Model-Question-2075-2019-SET01-Solution.html\",\"WARC-Payload-Digest\":\"sha1:KEHXWPWAWG5QU7YU5C6XVTUAL3RV7ABK\",\"WARC-Block-Digest\":\"sha1:H4GUOBQLKUBAIV5O5JMAKIEL3K2CQCUP\",\"WARC-Identified-Payload-Type\":\"application/xhtml+xml\",\"warc_filename\":\"/cc_download/warc_2023/CC-MAIN-2023-23/CC-MAIN-2023-23_segments_1685224644913.39_warc_CC-MAIN-20230529205037-20230529235037-00652.warc.gz\"}"} |
https://www.waybuilder.net/sweethaven/Math/algebra/linearEq/LinEqOne01_EE.asp | [
"",
null,
"",
null,
"Linear Equations of One Variable\n\n Select an \"endless\" activity - Solving equations of the form x + B = C - Solving equations of the form x – B = C - Solving equations of the form x ± B = C Combines Activities 1 and 2 - Solving equations of the form Ax = C - Solving equations of the form x/A = C - Solving equations of forms Ax = C, x/A = C Combines Activities 4 and 5 - Solving equations of the form Ax + B = C - Solving equations of the form Ax – B = C - Solving equations of the form Ax ± B = C Combines Activities 7 and 8 - Solving equations of forms x ± B = C and Ax ± B = C Combines Activities 3 and 9 - Solving equations of the form x/A + B = C - Solving equations of the form x/A – B = C - Solving equations of form x/A ± B = C Combines Activities 11 and 12 - Solving equations of forms Ax = C, x/A = C and x/A ± B = C Combines Activities 6 and 13 - Solving linear equations of one variable Combines all activities About These Activities These activities are provided as learning tools for classroom teachers, home school mentors, and independent learners. Teachers and mentors should select and review the activities to be assigned to their students. Independent learners should begin at the top of the list and systematically work down through the activities. A free online tutorial, Linear Equations of One Variable, is available from SweetHaven Publishing Services. A complete pre-algebra course is available totally free and online at Free-Ed.Net."
] | [
null,
"https://www.waybuilder.net/sweethaven/pics/e2ne01.gif",
null,
"https://www.waybuilder.net/sweethaven/pics/shpslogo.jpg",
null
] | {"ft_lang_label":"__label__en","ft_lang_prob":0.7841274,"math_prob":0.9997273,"size":530,"snap":"2019-51-2020-05","text_gpt3_token_len":117,"char_repetition_ratio":0.08555133,"word_repetition_ratio":0.0,"special_character_ratio":0.20188679,"punctuation_ratio":0.14942528,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9996896,"pos_list":[0,1,2,3,4],"im_url_duplicate_count":[null,8,null,null,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2019-12-06T23:33:57Z\",\"WARC-Record-ID\":\"<urn:uuid:341cc8c9-ac2b-4c63-9944-80fbc8e42237>\",\"Content-Length\":\"6531\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:08f6edf9-2de9-4fea-995e-0310674e839b>\",\"WARC-Concurrent-To\":\"<urn:uuid:1e277e75-d0cb-4d6d-8fee-6a96505f5117>\",\"WARC-IP-Address\":\"64.41.95.84\",\"WARC-Target-URI\":\"https://www.waybuilder.net/sweethaven/Math/algebra/linearEq/LinEqOne01_EE.asp\",\"WARC-Payload-Digest\":\"sha1:BXGAP6QQZ4D3HRL6HGFBZRUQVY5MFFRG\",\"WARC-Block-Digest\":\"sha1:XNVYLG5M3CQNFDR7OFTDRN7L36SK4AJJ\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2019/CC-MAIN-2019-51/CC-MAIN-2019-51_segments_1575540491491.18_warc_CC-MAIN-20191206222837-20191207010837-00553.warc.gz\"}"} |
https://homework.cpm.org/category/CC/textbook/CC2/chapter/Ch2/lesson/2.1.1/problem/2-17 | [
"",
null,
"",
null,
"### Home > CC2 > Chapter Ch2 > Lesson 2.1.1 > Problem2-17\n\n2-17.\n\nRead the Math Notes box for this lesson. Then rewrite each number below as a single fraction greater than one.\n\n1. $1\\frac{1}{11}$\n\nIf $1\\frac{1}{11}=\\frac{11}{11}+\\frac{1}{11}=\\frac{?}{11}$\n\n$\\frac{12}{11}$\n\n1. $3\\frac{2}{5}$\n\n$3\\frac{2}{5}=\\frac{15}{5}+\\frac{2}{5}=\\frac{?}{5}$\n\n1. $2\\frac{4}{15}$\n\n$2\\frac{4}{15}=\\frac{?}{15}+\\frac{4}{15}=\\frac{?}{15}$"
] | [
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
] | {"ft_lang_label":"__label__en","ft_lang_prob":0.83368856,"math_prob":1.0000018,"size":288,"snap":"2020-45-2020-50","text_gpt3_token_len":74,"char_repetition_ratio":0.09507042,"word_repetition_ratio":0.6666667,"special_character_ratio":0.27083334,"punctuation_ratio":0.11290322,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.99997556,"pos_list":[0,1,2,3,4],"im_url_duplicate_count":[null,null,null,null,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2020-10-21T08:01:37Z\",\"WARC-Record-ID\":\"<urn:uuid:ace0c149-2002-47d5-90c0-f166c4f14008>\",\"Content-Length\":\"37022\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:1d8c1c58-abd1-4708-bd07-63509e8e0db8>\",\"WARC-Concurrent-To\":\"<urn:uuid:f4d40190-d896-49a5-b2a5-f718eb330459>\",\"WARC-IP-Address\":\"172.67.70.60\",\"WARC-Target-URI\":\"https://homework.cpm.org/category/CC/textbook/CC2/chapter/Ch2/lesson/2.1.1/problem/2-17\",\"WARC-Payload-Digest\":\"sha1:J3W2CLHICAFGTPMTJBDVHM2UNQT35YZU\",\"WARC-Block-Digest\":\"sha1:QYFKIHW5BEXKYGXQ2UX52F4SAG6EWELY\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2020/CC-MAIN-2020-45/CC-MAIN-2020-45_segments_1603107876136.24_warc_CC-MAIN-20201021064154-20201021094154-00282.warc.gz\"}"} |
https://researchprofiles.canberra.edu.au/en/publications/algorithmic-calculus-for-lie-determining-systems | [
"# Algorithmic calculus for Lie determining systems\n\nIan LISLE, Tracy HUANG\n\nResearch output: Contribution to journalArticle\n\n4 Citations (Scopus)\n\n### Abstract\n\nThe infinitesimal symmetries of differential equations (DEs) or other geometric objects provide key insight into their analytical structure, including construction of solutions and of mappings between DEs. This article is a contribution to the algorithmic treatment of symmetries of DEs and their applications. Infinitesimal symmetries obey a determining system L of linear homogeneous partial differential equations, with the property that its solution vector fields form a Lie algebra L. We exhibit several algorithms that work directly with the determining system without solving it. A procedure is given that can decide if a system specifies a Lie algebra L, if L is abelian and if a system L' specifies an ideal in L. Algorithms are described that compute determining systems for transporter, Lie product and Killing orthogonal subspace. This gives a systematic calculus for Lie determining systems, enabling computation of the determining systems for normalisers, centralisers, centre, derived algebra, solvable radical and key series (derived series, lower/upper central series). Our methods thereby give algorithmic access to new geometrical invariants of the symmetry action.\nOriginal language English 482-498 17 Journal of Symbolic Computation 79 2 https://doi.org/10.1016/j.jsc.2016.03.002 Published - 2017"
] | [
null
] | {"ft_lang_label":"__label__en","ft_lang_prob":0.82486135,"math_prob":0.6505917,"size":1703,"snap":"2020-45-2020-50","text_gpt3_token_len":359,"char_repetition_ratio":0.12831077,"word_repetition_ratio":0.0,"special_character_ratio":0.20904286,"punctuation_ratio":0.12847222,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9602819,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2020-10-20T23:53:59Z\",\"WARC-Record-ID\":\"<urn:uuid:723f0d6f-e5bc-408e-a75a-5a4cfaa0f9a8>\",\"Content-Length\":\"47859\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:01645783-56ad-4ddc-bba7-66f91d31cb23>\",\"WARC-Concurrent-To\":\"<urn:uuid:a5d128b7-3132-4be7-ae0f-26e3c1877193>\",\"WARC-IP-Address\":\"18.139.148.124\",\"WARC-Target-URI\":\"https://researchprofiles.canberra.edu.au/en/publications/algorithmic-calculus-for-lie-determining-systems\",\"WARC-Payload-Digest\":\"sha1:2K7LK4S53GAUSJHXESLO4STRMZYPYMLT\",\"WARC-Block-Digest\":\"sha1:6UVU6MIQ3DW52B3XRNMDFH6QSB6GZN6J\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2020/CC-MAIN-2020-45/CC-MAIN-2020-45_segments_1603107874340.10_warc_CC-MAIN-20201020221156-20201021011156-00701.warc.gz\"}"} |
https://www.bestpfe.com/probing-andreev-states-in-superconducting-atomic-contacts/ | [
"# Probing Andreev States in superconducting atomic contacts\n\nGet Complete Project Material File(s) Now! »\n\n## Escape driven by an asymmetric noise\n\nThe goal of this section is to explain how the escape out of the zero- voltage state of a Josephson junction can be used to probe noise, and in particular the asymmetry of its probability distribution. So far, we only considered thermal fluctuations arising from macroscopic resistors, therefore Gaussian noise. In the following, we introduce predictions for the escape rate when the noise does not arise only from thermal fluctu- ations, but also from a specific noise source, producing for example shot noise which is not Gaussian . Predictions have been derived for a noise presenting a finite second and third moment [11, 31, 32, 33, 65, 68], and neglecting higher order moments.1 The electrical setup considered in this part is shown in Fig. 2.9. A Josephson junction is biased by a current IB flowing through a resistor RB. To this resistor is associated a current source in parallel, producing Gaussian current fluctuations δIB. In addition, a non-Gaussian noise source with impedance RN is present. To this noise source is associated a current fluctuation δIN. The equation describing this circuit is similar to Eq. (2.8): CJϕ0¨γ + ϕ0 R γ˙ + EJ [sin γ − s] = δIB + δIN.\n\n### Frequency scales\n\nThe frequency scales of the problem are defined here from the smallest to the largest (see also Fig. 2.10):\n• The escape rate: typically, escape rates probed experimentally are in the sub-MHz range, corresponding to a measurement time of 1 μs or more.\n• The plasma frequency: the plasma frequency considered in the follow- ing experiment is around 1 GHz.\n• The thermal noise cut-off frequency: At the relevant temperature of the experiment, which is of the order or 100mK (from 20mK to 500mK, thermal noise extends to frequencies of the order of kBT h ≃ 2GHz ).\n• The superconducting gap: In the experiments described in this thesis, all superconductors are aluminum for which the frequency correspond- ing to the superconducting gap is h ≃ 50 GHz.\n• Non-Gaussian noise cut-off frequency: In the experimental case of a tunnel junction biased at a voltage VN, the maximal frequency of the shot noise is eVN h . For VN ≃ 400 μV, which is the lowest voltage probed in the experiment presented in the following, it corresponds to frequencies higher than 100GHz. At the scale of the plasma frequency, non-Gaussian noise thus appears completely frequency-independent.\n\n#### Noise statistical properties\n\nIn the framework of Full Counting Statistics (FCS), the properties of the current fluctuations are treated through the probability distribution function. Experimentally, this distribution is accessed its the moments or through its cumulants which are two ways to represent the same infor- mation (see for details). However, moments and cumulants are equal up to the third order, as is recalled in Appendix B.3, and since this thesis only deals with moments up to the third one, it is not necessary here to make a distinction between moments and cumulants. In the following, we deal only with the moments.\n\nEscape rate in presence of an asymmetric noise\n\nWe now turn to the theoretical predictions for the effect of an asymmetric noise on the escape rate out of a single well.\nThe first prediction, obtained by J.T. Peltonen et al. considers the adiabatic response of the junction to the noise. Therefore, it only deals with the effect of noise at frequencies much smaller than the plasma frequency. In our experiments, this corresponds to only a small fraction of the noise spectrum, as shown in Fig. 2.10. The damping in the junction dynamics, which appears in the following to be of central importance, does not enter in this approach.\nThe second prediction was obtained by E. Sukhorukov and A. Jordan with a stochastic path integral formalism, in the two limits of low and high damping limits only, which were unfortunately out of the relevant experimental range.\nThe third prediction, obtained by J. Ankerhold [31, 32, 35] is based on a Fokker-Planck equation approach to calculate the escape rate. The resolution of the Fokker-Planck equation relies on the fact that escape is only a small perturbation to the Boltzmann equilibrium in the well. As was already discussed by Kramers, this assumption might not be appropriate for very large values of the quality factor.\nThe last prediction that we present, obtained by H. Grabert , relies on the calculation of the action along the escape trajectory using also a path integral formalism. Its validity range spans over the complete range of quality factor, and recovers the two limits of E. Sukhorukov and A. Jordan calculated with a similar method. All the predictions are compared at the end of the chapter.\n\nEffect of a low-frequency cutoff\n\nIn the experiment, the dc part of the noise is cut by an RC filter [35, 38] to ensure that the Poisson noise added to the bias current of the junction has zero mean value. To probe the effect of this cut-off on the rate asym- metry, we simulated the dynamics of the circuit shown in Fig. 3.13. In this circuit, both the Poisson noise δIN and the Johnson-Nyquist noise δIB2 are filtered. Only the components of the noise at large enough fre- quencies reach the Josephson junction, while the low frequency part flows through the resistor R2. Beware that two resistors are present, each of them producing a Johnson-Nyquist noise. For simplicity, we consider in this section that they have different resistances but are at the same tem- perature.\n\nProbing shot noise with a Josephson junction\n\nAt the beginning of my work, a simplified version of this strategy, aiming at measuring only the third moment and not the FCS, had been explored experimentally by two groups: the group of J. Pekola at Helsinki University of Technology (HUT) [29, 37, 85] and the Quantronics group in Saclay [36, 35]. In both cases, the shot noise of a tunnel junction was added to the bias current of the Josephson junction (JJ), in order to extract the third moment of the noise.\nTo do so, one option is to have the full current in the noise source IN(t) flowing through the JJ. In this case however, the escape rate is modified not only by the noise, but also trivially by the dc current hINi. To get rid of this contribution, the dc part hINi of the current was either compensated for or filtered out.\n\n1 Introduction\n1.1 Josephson effect and mesoscopic physics\n1.2 Detecting asymmetric noise with a Josephson junction\n1.3 Towards Andreev states spectroscopy\nI Detecting noise asymmetry using a Josephson junction\n2 Escape of a Josephson junction out of the metastable state\n2.1 The Josephson junction in an electromagnetic environment\n2.2 Escape rate out of the zero-voltage state\n2.3 Escape driven by an asymmetric noise\n2.4 Conclusion\n3 Numerical simulation of the escape\n3.1 Simulation algorithm\n3.2 Rate estimation\n3.3 Results on the escape rate\n3.4 Effect of a low-frequency cutoff\n3.5 Conclusion\n4 Experimental detection of an asymmetric noise with a Josephson junction\n4.1 Introduction\n4.2 Experimental setup\n4.3 Circuit characterization & measurement techniques\n4.4 Results on Sample JJD1\n4.5 Results on Sample JJD2\n4.6 Perspectives\n4.7 Conclusion\nArticle reporting the measurement of asymmetric noise using a Josephson junction\nII Probing Andreev States in superconducting atomic contacts\n5 Josephson effect and Andreev states\n5.1 Andreev Bound States\n5.2 An experimental test-bed: superconducting atomic contacts\n5.3 Supercurrent in atomic contacts\n5.4 Current-phase relation of well-characterized contacts\n5.5 Out-of-equilibrium effects\n5.6 Conclusions\n6 Towards Andreev states spectroscopy\n6.1 Predictions for the Andreev transition\n6.2 Design of an experimental setup\n6.3 Probing the new on-chip environment with a standard SQUID circuit\nIII Sample Fabrication and Measurement Techniques\n7 Sample Fabrication\n7.1 Samples JJD for noise detection experiments\n7.2 Samples AC1 and AC2 for atomic contacts experiments\n7.3 SQUID sample\n7.4 Lithography recipes\n8 Low-Noise Measurement Techniques\n8.1 Sample Holder & Bending Mechanism.\n8.2 Cryostat wiring\n8.3 Room temperature connections and instruments\nIV Appendix\nA.1 Back-Bending in the I(V ) characteristics of Josephson junctions .\nA.2 Heating effects in switching measurements\nB Miscellaneous\nB.1 Approximations for the tilted washboard potential\nB.2 Resonant activation through the modulation of the critical current\nB.3 Moments and Cumulants, and Poisson Process.\nB.4 Details on the simulations\nB.5 The Andreev Levels Qubit\nB.6 Critical current of a Josephson junction with electrodes having different gaps\nB.7 Attenuators\nB.8 Correspondence between names\nBibliography\n\nGET THE COMPLETE PROJECT"
] | [
null
] | {"ft_lang_label":"__label__en","ft_lang_prob":0.8949002,"math_prob":0.9341202,"size":8749,"snap":"2022-27-2022-33","text_gpt3_token_len":2018,"char_repetition_ratio":0.14259577,"word_repetition_ratio":0.014861995,"special_character_ratio":0.2144245,"punctuation_ratio":0.113377325,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9555844,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2022-08-18T17:30:28Z\",\"WARC-Record-ID\":\"<urn:uuid:c9087c96-8524-4609-8398-f248c3794a2a>\",\"Content-Length\":\"59017\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:dd6d82a0-1ff5-44d9-97e7-f8c9f68a8517>\",\"WARC-Concurrent-To\":\"<urn:uuid:037c5095-f136-4162-9c04-b754901aa590>\",\"WARC-IP-Address\":\"66.23.225.237\",\"WARC-Target-URI\":\"https://www.bestpfe.com/probing-andreev-states-in-superconducting-atomic-contacts/\",\"WARC-Payload-Digest\":\"sha1:AWUVYHYKSRHNTHLLN6KBREBK4HNMHLZU\",\"WARC-Block-Digest\":\"sha1:PYRBGWWZWS6YJSEJBUQXRODT6GZH7LKC\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2022/CC-MAIN-2022-33/CC-MAIN-2022-33_segments_1659882573242.55_warc_CC-MAIN-20220818154820-20220818184820-00597.warc.gz\"}"} |
https://courses-archive.maths.ox.ac.uk/node/42735 | [
"# C6.1 Numerical Linear Algebra (2019-2020)\n\n## Primary tabs\n\n2019-2020\nLecturer(s):\nProf. Andrew Wathen\nGeneral Prerequisites:\n\nOnly elementary linear algebra is assumed in this course. The Part A Numerical Analysis course would be helpful, indeed some swift review and extensions of some of the material of that course is included here.\n\nCourse Term:\nMichaelmas\nCourse Lecture Information:\n\n16 lectures\n\nCourse Weight:\n1.00 unit(s)\nCourse Level:\nM\n\n### Assessment type:\n\nCourse Overview:\n\nLinear Algebra is a central and widely applicable part of mathematics. It is estimated that many (if not most) computers in the world are computing with matrix algorithms at any moment in time whether these be embedded in visualization software in a computer game or calculating prices for some financial option. This course builds on elementary linear algebra and in it we derive, describe and analyse a number of widely used constructive methods (algorithms) for various problems involving matrices.\n\nNumerical Methods for solving linear systems of equations, computing eigenvalues and singular values and various related problems involving matrices are the main focus of this course.\n\nLearning Outcomes:\n\nStudents should understand the Singular Value Decomposition and its wide uses, state-of-the art algorithms for eigenvalue computation and core algorithms for solving linear systems, including in particular iterative solution methods of Krylov subspace type and multigrid.\n\nCourse Synopsis:\n\nCommon problems in linear algebra. Matrix structure, singular value decomposition. QR factorization, the QR algorithm for eigenvalues. Direct solution methods for linear systems, Gaussian elimination and its variants. Iterative solution methods for linear systems.\n\nChebyshev polynomials and Chebyshev semi-iterative methods, conjugate gradients, convergence analysis, preconditioning."
] | [
null
] | {"ft_lang_label":"__label__en","ft_lang_prob":0.8479632,"math_prob":0.8886162,"size":2215,"snap":"2021-43-2021-49","text_gpt3_token_len":478,"char_repetition_ratio":0.111714154,"word_repetition_ratio":0.012269938,"special_character_ratio":0.20361173,"punctuation_ratio":0.15601023,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.98279494,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2021-12-04T16:43:24Z\",\"WARC-Record-ID\":\"<urn:uuid:397fb000-a1d4-473e-9d54-da3b2ec2f311>\",\"Content-Length\":\"14701\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:2d2b0ad3-7366-4084-8a5a-ca6d1678353a>\",\"WARC-Concurrent-To\":\"<urn:uuid:dc40913b-09a0-4c9f-977d-fac78b4f8909>\",\"WARC-IP-Address\":\"129.67.184.133\",\"WARC-Target-URI\":\"https://courses-archive.maths.ox.ac.uk/node/42735\",\"WARC-Payload-Digest\":\"sha1:5YX3GTGTDS6BYHZPN3DKSZN5HYSA56JA\",\"WARC-Block-Digest\":\"sha1:MGMP5UZLXO4INK4HMXIMZ7WQF43XANWD\",\"WARC-Identified-Payload-Type\":\"application/xhtml+xml\",\"warc_filename\":\"/cc_download/warc_2021/CC-MAIN-2021-49/CC-MAIN-2021-49_segments_1637964362999.66_warc_CC-MAIN-20211204154554-20211204184554-00428.warc.gz\"}"} |
https://studentreader.com/JTBV2/geometry/ | [
"# Geometry\n\nBy Levi Clancy for Student Reader on\nupdated\n\nCircle Area = π r2Circumference = 2 π r Area = 4 π r2Volume = 4⁄3 π r3 Curved (Lateral) Area = 2 π r lVolume = π r2 l Area = Average Height × Average Length = ½ ( h1 + h2 ) × ½ ( l1 + l2)"
] | [
null
] | {"ft_lang_label":"__label__en","ft_lang_prob":0.7106659,"math_prob":0.9971189,"size":274,"snap":"2019-51-2020-05","text_gpt3_token_len":108,"char_repetition_ratio":0.14444445,"word_repetition_ratio":0.0,"special_character_ratio":0.3941606,"punctuation_ratio":0.0,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9933907,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2020-01-19T19:10:24Z\",\"WARC-Record-ID\":\"<urn:uuid:8756dcbb-a84d-4955-a544-e03aa413c1a4>\",\"Content-Length\":\"29512\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:db9c995d-176d-4406-a856-18a0ab0077b8>\",\"WARC-Concurrent-To\":\"<urn:uuid:e094d1b2-48e5-4fa4-8a9f-bc1554f50f89>\",\"WARC-IP-Address\":\"35.196.213.223\",\"WARC-Target-URI\":\"https://studentreader.com/JTBV2/geometry/\",\"WARC-Payload-Digest\":\"sha1:GTOTN2CTFYGICTDZ3OOARXBDI5AB5L54\",\"WARC-Block-Digest\":\"sha1:Q4CJY3YFLCGS3V4OEUU6IXPZAHO5E3FD\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2020/CC-MAIN-2020-05/CC-MAIN-2020-05_segments_1579250594705.17_warc_CC-MAIN-20200119180644-20200119204644-00532.warc.gz\"}"} |
http://mizar.org/version/current/html/proofs/partfun4/8_1_1 | [
"reconsider F = f as continuous Function of T,R^1 by ;\nset c = the carrier of T;\nfor q being Point of T holds f . q <> 0\nproof\nlet q be Point of T; :: thesis: f . q <> 0\ndom f = the carrier of T by FUNCT_2:def 1;\nhence f . q <> 0 ; :: thesis: verum\nend;\nthen consider H being Function of T,R^1 such that\nA1: for p being Point of T\nfor r1 being Real st F . p = r1 holds\nH . p = 1 / r1 and\nA2: H is continuous by JGRAPH_2:26;\nreconsider h = H as RealMap of T by TOPMETR:17;\nA3: now :: thesis: for a being object st a in dom h holds\nh . a = (f . a) \"\nlet a be object ; :: thesis: ( a in dom h implies h . a = (f . a) \" )\nassume a in dom h ; :: thesis: h . a = (f . a) \"\nhence h . a = 1 / (f . a) by A1\n.= 1 * ((f . a) \") by XCMPLX_0:def 9\n.= (f . a) \" ;\n:: thesis: verum\nend;\ndom h = the carrier of T by FUNCT_2:def 1\n.= (dom f) \\ (f \" ) by FUNCT_2:def 1 ;\nthen h = f ^ by ;\nhence for b1 being RealMap of T st b1 = f ^ holds\nb1 is continuous by ; :: thesis: verum"
] | [
null
] | {"ft_lang_label":"__label__en","ft_lang_prob":0.8860028,"math_prob":0.99936205,"size":573,"snap":"2022-40-2023-06","text_gpt3_token_len":224,"char_repetition_ratio":0.12653778,"word_repetition_ratio":0.0,"special_character_ratio":0.38219896,"punctuation_ratio":0.17218544,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.99995756,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2022-09-29T17:22:28Z\",\"WARC-Record-ID\":\"<urn:uuid:2a8d8e65-ab19-4e86-bf28-a6793fb59248>\",\"Content-Length\":\"12966\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:f671bced-4d39-4783-bc3a-9bc50ccf9683>\",\"WARC-Concurrent-To\":\"<urn:uuid:7bc21da2-ba9c-4d3d-8806-a8cceb964a1c>\",\"WARC-IP-Address\":\"193.219.28.149\",\"WARC-Target-URI\":\"http://mizar.org/version/current/html/proofs/partfun4/8_1_1\",\"WARC-Payload-Digest\":\"sha1:BOHRUHGLLVVFMCHAANBUPJLBTZK64OJI\",\"WARC-Block-Digest\":\"sha1:5GVL5DHYSS3CIJ743GVZGTC7PKQKJPW6\",\"WARC-Identified-Payload-Type\":\"application/xml\",\"warc_filename\":\"/cc_download/warc_2022/CC-MAIN-2022-40/CC-MAIN-2022-40_segments_1664030335362.18_warc_CC-MAIN-20220929163117-20220929193117-00761.warc.gz\"}"} |
http://www.assignmentclick.com/gscm-530-devry | [
"Shopping Cart\nYour shopping cart is empty!\nGSCM 530\n\nGSCM 530 (NEW)\n\nThis Tutorial was purchased:10Times & Rated :A+ by student like you.\nGSCM 530 Week 1 Homework Assignment Page 431, Problems 2, 8, and 12 NEW ..\n\\$15.00 \\$12.00\nThis Tutorial was purchased:9Times & Rated :A by student like you.\nGSCM 530 Week 2 Homework Assignment Page 459, Problems 4,6 and 8 NEW Week 2 Homework Assignment – Page 459, Problems 4,6 and 8. 4. The current aggregate demand requirements for a firm are shown below for the next six months Month May June July Aug Sept Oct Demand 120 100 100 1..\n\\$15.00 \\$11.99\nThis Tutorial was purchased:8Times & Rated :A by student like you.\nGSCM 530 Week 3 Homework Assignment Page 491, Problems 4, 8, 12 and 13 NEW Week 3 Homework Assignment – Page 491, Problems 4, 8, 12 and 13 4. Based on the BOM shown below, how many units of part F will be needed if 15 units of end item A are needed? If the compan..\n\\$15.00 \\$12.00\nThis Tutorial was purchased:7Times & Rated :A+ by student like you.\nGSCM 530 Week 4 Homework Assignment Page 83. Problems and 8 and 9, Page 491, Problems 18 and 19 NEW Week 4 Homework Assignment – Page 83. Problems and 8 and 9 Homework Assignment – Page 491, Problems 18 and 19 8.New Time Videos (NTV) 9. Pizza Time a. Cash registers? ..\n\\$15.00 \\$12.00\nThis Tutorial was purchased:9Times & Rated :B+ by student like you.\nGSCM 530 Week 5 Homework Assignment Page 528, Problems 4 and 6, Page 547 Problems 4 NEW Week 5 Homework Assignment – Page 528, Problems 4 and 6 Homework Assignment – Page 547 Problems 4 4. Answer the following questions for the network shown below. Times shown a..\n\\$15.00 \\$11.99\nThis Tutorial was purchased:8Times & Rated :A by student like you.\nGSCM 530 Week 6 Homework Assignment Page 107, Problem 2, Page 327, Problems 2 and 4 NEW ..\n\\$15.00 \\$12.00\nThis Tutorial was purchased:7Times & Rated :A+ by student like you.\nGSCM 530 Week 7 Homework Assignment Page 274, Problems 2, 3 and 4 NEW Week 7 Homework Assignment – Page 274, Problems 2, 3 and 4 2. The following table contains data about the inventory for 5 items at Jones Corporation. Complete the missing items in the table. 3..\n\\$15.00 \\$11.99"
] | [
null
] | {"ft_lang_label":"__label__en","ft_lang_prob":0.8144093,"math_prob":0.81505394,"size":1663,"snap":"2019-13-2019-22","text_gpt3_token_len":555,"char_repetition_ratio":0.24713683,"word_repetition_ratio":0.13057324,"special_character_ratio":0.37943476,"punctuation_ratio":0.17721519,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.95342,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2019-03-25T22:31:39Z\",\"WARC-Record-ID\":\"<urn:uuid:fcb7881c-bdc3-4cd4-9975-8eb6171f542a>\",\"Content-Length\":\"20447\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:28c27a52-9c5c-4b21-9c09-f02aa4f73393>\",\"WARC-Concurrent-To\":\"<urn:uuid:21e16997-4014-449b-80e8-86606a2a3158>\",\"WARC-IP-Address\":\"142.4.8.200\",\"WARC-Target-URI\":\"http://www.assignmentclick.com/gscm-530-devry\",\"WARC-Payload-Digest\":\"sha1:EY7T43MOPJ7JQKMWXYBI7CTAYFCZQD43\",\"WARC-Block-Digest\":\"sha1:4VTDRNQIPO3RXT6AIBKMLSWULCCMKZF7\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2019/CC-MAIN-2019-13/CC-MAIN-2019-13_segments_1552912204461.23_warc_CC-MAIN-20190325214331-20190326000331-00035.warc.gz\"}"} |
https://physics.stackexchange.com/questions/537443/why-cant-a-gas-of-photons-reach-a-bose-einstein-condensate | [
"# Why can't a gas of photons reach a Bose-Einstein condensate?\n\nI have read in many places that as the gas of photons has a chemical potential $$\\mu=0$$ it can't reach a Bose-Einstein condensate (BEC), but I don't understand why.\n\nI am reading Greiner's \"Thermodynamics and Statistical Mechanics\" and in chapter 13 \"The Ideal Bose Gas\", he first derives the Bose-Einstein conditions for an ideal Bose gas and then, as a particular example, he derives some relations for the gas of photons. I think I understand the case for the ideal gas, but when I try to apply that same approach to the gas of photons, I can't seem to reach the conclusion that the BEC is not possible.\n\nSo, a quick summary of how I understand that an ideal Bose gas condensates:\n\n# Ideal bose gas\n\nThe mean occupation number is given by: $$N = \\sum_k \\frac 1 {e^{(E_k-\\mu)/kT}-1} \\tag{1}$$ And, to compute this summation, we can approximate it as an integral which results in: $$N_E = \\frac V {\\lambda^3} g_{3/2}(z) \\tag{1.1}$$ where the $$z=e^{\\mu/kT}$$ is called the fugacity and: $$g_n(z) = \\frac 1 {\\Gamma(n)} \\int_0^\\infty \\frac {x^{n-1}dx} {z^{-1}e^x-1} \\tag{1.2}$$ The reason why I am labeling this as $$N_E$$ is because the approximation leaves out the case for the ground state (when $$E_k=0$$), so the mean occupation number is in reality: $$N = N_e + N_0 \\tag{1.3}$$ where $$N_0 = \\frac z {1-z} \\tag{2}$$ which is just $$(1)$$ evaluated for $$E_k=0$$. We can see from here that $$N_0$$ diverges when $$z=1$$ (which is when $$\\mu=0$$), for which $$N_E$$ has a finite value (as all $$g_n(1)$$ are finite for $$n>1$$). This means that, in this scenario, almost all particles are in the ground state which results in the Bose-Einstein condensate.\n\nNow, for the gas of photons (using Greiner's equations):\n\n# Gas of photons\n\nEquation $$(1)$$ still holds if we set $$\\mu=0$$, which must mean that equation $$(2)$$ also holds, so (considering de density of states $$g(E)$$ as @SuperCiocia noticed were missing and adding more details): $$N_0 = \\lim_{\\mu \\to 0} \\frac {e^{-\\mu/kT}} {1 - e^{-\\mu/kT}} \\to \\infty \\tag{3}$$ And approximating $$N$$ as an integral, we get: $$N_E = \\int \\langle n_E \\rangle g(E)dE = \\frac {8\\pi V} {h^3 c^3} \\int_0^\\infty \\frac {E^{2}dE} {e^{E/kT}-1} = \\frac {8\\pi V k^3 T^3} {h^3 c^3} g_3(1) \\tag{4}$$ which is finite. Then this must mean that the gas of photons is always in the Bose-Einstein condensate phase, which clearly doesn't make any sense.\n\nCan someone tell me, what am I doing wrong?\n\nI have checked some questions about this (like what-is-condensed-light, can-a-system-entirely-of-photons-be-a-bose-einsten-condensate) and the explanations given are more of physical intuition about photons popping out of existence (as $$\\mu=0$$) which implies there is never a saturation of states (either ground state or any excited state), but I can't seem to relate these equations to that argument. The closest I have found is why-zero-chemical-potential-does-not-allow-the-bose-einstein-condensation-of-phonons which performs a similar analysis, except that instead of getting $$N_0$$ from $$(1)$$ (as I did here and as Greiner does), he calculates the limit of $$N_E$$ when $$E \\to 0$$ which yields a correct result, but then I don't get why Greiner doesn't do it that way.\n\nIt can, it's just hard as you have to engineer it.\nSee, for instance, here.\n\nA Bose-Einstein Condensate is more than just a state described by a macroscopic wavefunction. It's the result of a phase transition. Indeed, it's the phase transition that defines the BEC phase, as the breaking of the $$U(1)$$ symmetry is what guarantees the choice of a specific phase and all that. In this context, Bose-Einstein condensation is different from \"Bose-Einstein proliferation\", i.e. just a lot of bosons in the ground state.\n\nSo you have to show that your system can go from a thermal state to a BEC as you decrease the temperature (or increase particle number).\n\n### Crash course in Bose-Einstein condensation\n\nA BEC is essentially a saturation effect; the occupancy of bosons $$f(E) = \\frac{1}{\\mathrm{e}^\\frac{E-\\mu}{k_{\\mathrm{B}}T}-1}$$ has to be positive, which means that $$E-\\mu \\geqslant 0 \\quad \\forall E$$. So you if fix $$\\mu$$ and choose your ground energy to be $$E_0 = 0$$ (hence $$\\mu \\leqslant 0$$), any energy level is capped at $$\\mathrm{max}[f(E)] = (\\mathrm{e}^\\frac{E}{k_{\\mathrm{B}}T}-1)^{-1}$$.\n\nBecause the occupancy is capped, energy levels may run out of places to accommodate particles. Decreasing the temperature $$T$$ helps bringing this cap sooner. So as you decrease the temperature $$T$$, the $$n^{\\mathrm{th}}$$ energy level doesn't have any free spots any longer. Etc. At some point (critical temperature $$T_{\\mathrm{c}}$$), all excited states ($$E>0$$) are full.\nIf particle number is conserved, then particles cannot disappear. They have to go somewhere. Indeed, they go to the only state with infinite acceptance, i.e. the ground state with $$E_0 = 0$$ and hence $$f(E_0) \\rightarrow \\infty$$. It is this saturation that triggers the macroscopic occupation of the ground state.\n\n### Ok so what about the chemical potential?\n\nEssentially, the chemical potential $$\\mu$$ is the change in Helmholtz free energy $$F = U-TS$$ when a particle is added to the system. Adding a particle at a particular temperature increases the internal energy $$U$$, but this extra particle results in many more possible arrangements of the particles in the system, which in turn increases the entropy $$S$$. In the thermal phase, the entropy change is larger than the energy term, hence the chemical potential is negative $$\\mu < 0$$. This agrees with what found above from the mathematical requirement of $$f(E) > 0$$.\n\nWhen you hit condensation, then new particles can only be allocated in the ground state. Which has energy zero, so $$U=0$$. The certainty of the state where it ends up in, also, means that entropy does not increase$$^\\dagger$$. Hence $$\\mu = 0$$ only for $$T \\leqslant T_{\\mathrm{c}}$$.\n\n### Photons\n\nFor (free) photons, $$\\mu = 0$$ always. It is not a function of temperature. It does not entail any interesting dynamics.\n\nThe Planck's distribution, indeed, tends to zero for $$T \\rightarrow 0$$. Which is the same thing, really: photons just \"vanish\". Objects do not radiate as much when cold.\n\nSo how do you make a gas photons undergo Bose-Einstein condensation?\nYou force them to adpot $$\\mu \\neq 0$$. For example by placing them in a cavity, where different modes interact via a dye -- as done in the reference in the first line.\n\n1) Is a laser a BEC?\nNo. While both a laser and a BEC are coherent states, the latter is an equilibrium state of matter while the former is a \"steady-state\" -- meaning pumping and stimulated emission are balanced but both need to be non-zero. And pumping is external.\n\n2) In your equations you forgot an essential part; the density of states $$g(E)$$. Its functional dependence with dimensionality $$d$$ is what determines which trap geometries can have a BEC.\n\n$$^\\dagger$$: Indeed, the BEC is a coherent state with zero entropy. Experimentally reaching a BEC therefore not only requires loss of energy via cooling, but also, more importantly, the removal of entropy. This dictates which cooling mechanisms are useful and which are not (e.g. adiabatic relaxations).\n\n• Thanks for your explanation! It helped me to see how temperature fits into this phenomenom, but following the reasoning on your crash course. For the case of free photons (where $\\mu=0$ always), equation (4) is always capped, so shouldn't that mean most photons should go to the ground state (as (3) is inifinite)resulting in a BEC? How can I understand the BEC from those equations? Or, if I can't, what else do I need? Mar 22, 2020 at 22:59\n• The \"problem\" with eq. 4 is that your number of photons depends on the temperature. Particle number isn't conserved, so photons do not go the ground state as their only choice, for they can just disappear (indeed, the Black Body density of states you used is an equilibrium one, with as many emissions as absorptions in detailed balance). You need to have a total particle number $N$ independent on temperature, so that temperature can only cause a reshuffling between $N_E$ and $N_0$. You cannot do that in free space (where the black body radiation formula is valid) like you are doing. Mar 22, 2020 at 23:14\n• To quote the abstract of the paper I reference: \"\"However, the most omnipresent Bose gas, blackbody radiation (radiation in thermal equilibrium with the cavity walls) does not show this phase transition. In such systems photons have a vanishing chemical potential, meaning that their number is not conserved when the temperature of the photon gas is varied; at low temperatures, photons disappear in the cavity walls instead of occupying the cavity ground state. \"\" Mar 22, 2020 at 23:15\n• I get the subtlety that photons are not conserved and they vanish to prevent any saturation of states, but $N_E$ for the ideal Bose gas also depends on temperature via the thermal wavelength $\\lambda$ and still it can BEC. Shouldn't that mean the photon gas could too? Mar 23, 2020 at 0:26\n• But $\\mu$ also depends on temperature, as I say in my answer... that’s why $N_E$ saturates when $T=T_c$ and $\\mu=0$... this saturation is what triggers the macroscopic occupation of the ground state. I fear we are gong back in a circle here. You have correctly shown that photons can all live in the ground state: call that “boson proliferation”, not condensation. For condensation you need them to be forced into the ground state by the saturation of the excited energy levels - which cannot happen for a free photon gas with $\\mu=0$. Mar 23, 2020 at 0:56"
] | [
null
] | {"ft_lang_label":"__label__en","ft_lang_prob":0.92152894,"math_prob":0.9967267,"size":3169,"snap":"2023-40-2023-50","text_gpt3_token_len":961,"char_repetition_ratio":0.10932069,"word_repetition_ratio":0.0,"special_character_ratio":0.30482802,"punctuation_ratio":0.07176287,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9994592,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2023-09-29T12:39:16Z\",\"WARC-Record-ID\":\"<urn:uuid:a87cecda-c19f-46e6-8acd-6e3125852415>\",\"Content-Length\":\"177352\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:7c45afd7-154f-4f83-ba76-c287e70af94e>\",\"WARC-Concurrent-To\":\"<urn:uuid:621e6c5a-10ef-4090-8863-e38911c2bb42>\",\"WARC-IP-Address\":\"104.18.10.86\",\"WARC-Target-URI\":\"https://physics.stackexchange.com/questions/537443/why-cant-a-gas-of-photons-reach-a-bose-einstein-condensate\",\"WARC-Payload-Digest\":\"sha1:PFENN7OUTD5ZHOVQA3VOFJFJ66JC3UPL\",\"WARC-Block-Digest\":\"sha1:FYHSII3H55W5JFREEQCFQ4EM6UL3D344\",\"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-00859.warc.gz\"}"} |
https://papers.neurips.cc/paper/2015/file/024d7f84fff11dd7e8d9c510137a2381-Reviews.html | [
"Paper ID: 890 Title: Policy Gradient for Coherent Risk Measures\nCurrent Reviews\n\nSubmitted by Assigned_Reviewer_1\n\nQ1: Comments to author(s). First provide a summary of the paper, and then address the following criteria: Quality, clarity, originality and significance. (For detailed reviewing guidelines, see http://nips.cc/PaperInformation/ReviewerInstructions)\nThe paper proposes a new formula for the class of static coherent risks from which policy gradients for many common risk measures can be derived analytically. It also presents a general sampling-based algorithm for cases where no analytical solution is available and shows consistency guarantees of the policy gradient estimates. Eventually, the paper provides expressions for policy gradients of Markov coherent dynamic risk measures.\n\nSignificance and quality:\n\nThe unified derivation of policy gradients for coherent risk measures is intriguing and a valuable and novel contribution to the risk-sensitive decision making literature. Nevertheless, analytical solutions of the Lagrangian saddle-points are only available for some risk measures.\n\nThe proposed sample-based approximation scheme could allow us to apply the derived results for general coherent risk measures by avoiding to derive analytical forms of the saddle points. However, the paper does not provide any empirical evidence that the proposed estimation scheme is viable in practice. An experimental comparison between the using the sample-based policy gradients and the analytical ones in different problems, e.g. for CVaR would be extremely helpful.\n\nOriginality: To the best of my knowledge, the derived policy gradients are - in this general form - are novel.\n\nClarity: The paper is generally well written, however, it appears to me that the clarity of the main paper is hindered considerably by number of different issues attempted to be addressed in the eight pages. Especially the dynamic risk policy gradients in Section 5 are presented on a very high level and the lack of any algorithm details and experimental evaluations do not allow the reader to judge whether the derived policy gradients yield approaches that are viable in practice. It seems to me this content is rather suited for a longer journal publication. An alternative that I would see as beneficial is to split this paper and rather focus on static risk measures which allows to make the paper more standalone and provide more details and a more comprehensive empirical evaluation beyond the very basic toy example in the current submission.\nAn interesting paper with potentially generally applicable results, but the lack of comprehensive experimental evaluations makes this hard to judge. Also, a narrower focus might be more appropriate to improve the deficits in clarity due to space constraints.\n\nSubmitted by Assigned_Reviewer_2\n\nQ1: Comments to author(s). First provide a summary of the paper, and then address the following criteria: Quality, clarity, originality and significance. (For detailed reviewing guidelines, see http://nips.cc/PaperInformation/ReviewerInstructions)\nThis paper presents methods for estimating policy gradients in risk-sensitive problems with coherent risk measures, and proposes RL algorithms based on them. The paper particularly extends the existing methods for specific risk measures to the general class of coherent risk measures, and thus provides a unified view. The algorithm is illustrated with a toy example in finance domain, where each asset has its own return distribution.\n\nThe motivation is very clear, and the problem formulation and algorithms follow naturally from this motivation and previous works. The experiment is relatively simple as it is done in only a static risk problem. However, the results seem to support the quality of the algorithm in terms of its risk-aversive behavior as well as the flexibility in different risk types.\n\nQuality: the paper is well written. The equations are technically sound and all relevant references are given.\n\nClarity: the clarity of this paper is well above average.\n\nOriginality: The paper proposes new algorithms for risk-sensitive RL problems based on the related works on risk-sensitive planning and RL. The extension to proposed approach is not straightforward. The originality of this paper seems sufficient to me.\n\nSignificance: Risk-sensitive RL is an interesting and important problem, and this paper provides significant contributions.\nThis paper presents clear algorithms which solve risk-sensitive RL with coherent risk measures, and demonstrates the behavior of trained policies with different risk settings on a static risk problem. The proposed approach is clearly motivated by the authors, and a natural extension to existing algorithms and problems (policy gradient, actor-critic and coherent risk measure optimization).\n\nSubmitted by Assigned_Reviewer_3\n\nQ1: Comments to author(s). First provide a summary of the paper, and then address the following criteria: Quality, clarity, originality and significance. (For detailed reviewing guidelines, see http://nips.cc/PaperInformation/ReviewerInstructions)\nThe authors analyze the risk averse Markov decision process setting with static and dynamically consistent risk measures (mappings). The main contribution is, in particular, to show to form of the gradient for both the dynamic and static setting.\n\nThe paper is a generalization of previous results, which focused specifically on CVaR. This extension represents a minor, but useful, contribution. The results is a simple extension of the policy gradient in risk-neutral settings.\n\nThe paper is well organized, well written, and easy to follow.\n\nThe results are correct as far as I can tell.\n\n- Theorem 2.1: The notation \\xi P_\\theta is confusing. I suggest referring to Theorem 6.6 in and using the same notation.\n\n- Line\n\n141: risk enevlop[e] - Section 3: To avoid confusing readers not familiar with the topic, it may be worth pointing out here that\n\nMDPs with Markov risk measures are very tractable. The reason the problem in the paper is not tractable is because of the policy parametrization and NOT because of the risk measure.\nThe paper presents a minor but solid and important extension of existing results.\n\nSubmitted by Assigned_Reviewer_4\n\nQ1: Comments to author(s). First provide a summary of the paper, and then address the following criteria: Quality, clarity, originality and significance. (For detailed reviewing guidelines, see http://nips.cc/PaperInformation/ReviewerInstructions)\nThe authors consider the problem of finding policy parameters that minimize a given risk measure. The class of risk measures considered in the paper is general, and defined by simple coherence properties such as convexity, monotonicity, and translation invariance. The presented approach is based on a dual representation of any coherent risk measures as a convex hull of probability distributions. The risk of a random variable (such as a cost) is given by the maximum expected value in the hull. The paper makes an assumption on the family of coherent risk measures, by bounding the maximum derivatives of the convex hull's borders (i.e., the borders of the hull are M-Lipschitz continuous). Using this assumption, the authors analytically derive the optimal policy parameters (w.r.t the risk measure), as well as a general gradient estimation algorithm for both the static case (one-step decision), and the dynamic (or sequential) case.\n\nThe paper is well-written and organized. Although I am not familiar with risk-sensitive optimization, I was able to follow most of the explanations. The main contribution of this work is the unified analysis of a general class of risk measures that include most well-known measures. I believe that this is a significant contribution. However, a deeper empirical analysis of the proposed gradient algorithm would be appreciated.\n\nSome comments/questions 1- The preliminaries section is not clear enough. I was confused about the roles of P_{\\theta} and \\ksi . 2- Isn't Equation 2 just the definition of a convex envelope? Why is this more restrictive than Theorem 2.1? 3- I would suggest adding a comment on how the analysis generalize to distributions on continuous variables. 4- It would be nice to mention in the short paper the role of the smoothness of the constraint functions in proving Theorem 4.2\nA strong theory paper that provides a general approach to risk-sensitive decision-making. Results seem compelling but proofs need to be verified.\n\nAuthor Feedback\nAuthor Feedback\nQ1:Author rebuttal: Please respond to any concerns raised in the reviews. There are no constraints on how you want to argue your case, except for the fact that your text should be limited to a maximum of 5000 characters. Note however, that reviewers and area chairs are busy and may not read long vague rebuttals. It is in your own interest to be concise and to the point.\nWe thank the reviewers for their comments. We will incorporate all the suggestions in the paper.\n\nReviewer 1:\nOur sample-based policy gradient algorithm in Section 4.3 is based on the sampled average approximation method (SAA), for which in general, and under mild technical conditions, a law-of-large-numbers (LLN) style variance bound of 1/sqrt(number of samples) can be guaranteed . While we have not explicitly extended this result for the case in the paper, we expect that under some technical conditions, a similar result should hold. This bound is comparable to the variance bound that can be obtained with the analytical-solution based policy-gradient methods, which are also based on the LLN. Thus, at least asymptotically, we expect both methods to be comparable.\n\nWe agree that an empirical evaluation is important. Therefore, as the reviewer suggested, we performed a comparison between the sample-based policy gradient and the analytical-solution based one for CVaR. The results corroborate our expectations and suggest that the two approaches are very similar in performance. The results may be accessed in the (anonymous) URL: https://sites.google.com/site/coherentrisknips15rebuttal/\nWe will add this important discussion to the paper.\n\nReviewer 3:\nEq. (2) states that the risk envelope can be written in a standard convex programming framework. This framework is general enough to capture almost all commonly used risk metrics such as the CVaR and spectral risk measures, and allows us to systematically analyze the Lagrange multipliers and solution vector required in deriving the policy gradient. However, by definition, this is still more restrictive than Thm 2.1, which only says that the problem is convex. For example in \"Vector-valued Coherent Risk Measures\" by E. Jouini, M. Meddeb, and N. Touzi 2007, the risk envelope described has a set-valued constraint. Such generalization is out of the scope of our paper.\n\nReviewer 5:\nOur actor-critic algorithm requires a simulator. We will clarify this point in the paper."
] | [
null
] | {"ft_lang_label":"__label__en","ft_lang_prob":0.93036276,"math_prob":0.7949844,"size":11045,"snap":"2021-31-2021-39","text_gpt3_token_len":2215,"char_repetition_ratio":0.1303324,"word_repetition_ratio":0.07130018,"special_character_ratio":0.18886374,"punctuation_ratio":0.11037302,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.96069103,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2021-09-27T00:54:33Z\",\"WARC-Record-ID\":\"<urn:uuid:a370f3cf-598f-413c-8c5b-1ff779961712>\",\"Content-Length\":\"18815\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:50dddbbb-f46d-492e-82e6-6bbb8818a174>\",\"WARC-Concurrent-To\":\"<urn:uuid:4527866e-eaa9-4c5d-86a5-9e3d9ffb85f2>\",\"WARC-IP-Address\":\"198.202.70.94\",\"WARC-Target-URI\":\"https://papers.neurips.cc/paper/2015/file/024d7f84fff11dd7e8d9c510137a2381-Reviews.html\",\"WARC-Payload-Digest\":\"sha1:UOK3WMUTBP6GQLRJHDVUSIUGSXK3RXRC\",\"WARC-Block-Digest\":\"sha1:Y6LDXOSX4GVZWXCYIOB35KIAW2STXOOB\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2021/CC-MAIN-2021-39/CC-MAIN-2021-39_segments_1631780058222.43_warc_CC-MAIN-20210926235727-20210927025727-00099.warc.gz\"}"} |
http://www.yourelectrichome.com/2011/05/kirchhoffs-law.html | [
"### Kirchhoff's Law\n\nIn 1847, a German Physicist, Kirchhoff, formulated tow fundamental laws of electricity. These laws are of tremendous importance from network simplification point of view.\n1. Kirchhoff Current law (KLC)\nConsider a junction point i a complex network as shown in the Fig .1.",
null,
"Fig. 1\nAt this junction point if I1 = 2 A , I2= 4 A and I3 = 1 A then to determine I4 we write, total current entering is 2 + 4 = 6 A while total current leaving is 1+ I4 A\nAnd hence, I= 5 A.\nThis analysis of currents entering and leaving is nothing but the application of Kirchhoff's Current Law. The law can be stated as,\nThe total current flowing towards a junction point is equal to the total current flowing away from that junction point.\nAnother way to state the law is,\nThe algebraic sum of all current meeting at a junction point is always zero\nThe word algebraic means considering the signs of various currents.\n∑I at junction point = 0\nSign convention : Currents flowing towards a junction point are assumed to be positive while currents flowing away from a junction point assumed to be negative.\ne.g. refer to Fig. 1. current I1 and I2 are positive while I3 and I4 are negative.\nApplying KCL, ∑I at junction O = 0\nI1 +I2 - I3 - I= 0 i.e. I1 + I2 =I3 + I4\nThe law is very helpful in network simplification.\n\n2. Kirchhoff Voltage Law (KVL)\n\"In any network, the algebraic sum of the voltage drops across the circuit elements of any closed path (or lop or mesh) is equal to the algebraic sum of the e.m.f. s in the path\"\nIn other words, \"The algebraic sum of all the branch voltages, around any closed path or closed loop is always zero.\"\nAround a closed path ∑V = 0\nThe law states that if one starts at a certain point of a closed path and goes on tracing and noting all the potential changes (either drops or rises), in any one particular direction, till the starting point is reached again, he must be at the same potential with which he started tracing a closed path.\nSum of all the potential rises must be equal to sum of all the potential drops while tracing any closed path of the circuit. The total change in potential along a closed path is always zero.\nThis law is very useful in loop analysis of the network.\n\n3. Sign Conventions to be Followed While Applying KVL\nWhen current flows through a resistance, the voltage drop occurs across the resistance.\nThe polarity of this voltage drop always depends on direction of the current. The current always flows from higher potential to lower potential.\nIn the Fig. 2(a), current I is flowing from right to left, hence point B is at higher potential than point A, as shown.\nIn the Fig. 2(b), current I is flowing from left to right, hence point A is at higher potential than point B, as shown.",
null,
"Fig. 2\n\nOnce all such polarities are marked in the given circuit, We can apply KVL to any closed path in the circuit.\nNow while tracing a closed path, if we go from - ve marked terminal to + ve marked terminal, that voltage must be taken as positive. This is called potential rise.\nFor example, if the branch AB is traced from A to B then the drop across it must be considered as rise and must be taken as + IR while writing the equations.\nWhile tracing a closed path, if we go from + ve marked terminal to - ve marked terminal, that voltage must be taken as negative. This is called potential drop.\nFor example in the Fig. 2(a) only, if the branch is traced from B to A then it should be taken as negative, as - IR while writing the equations.\nSimilarly in the Fig.2(b), if branch is traced from A to B then there is a voltage drop and term must be written negative as - IR while writing the equation. If the branch is traced from B to A, it becomes a rise in voltage and term must be written positive as + IR while writing the equation.\nKey point :\n1) Potential rise i.e. travelling from negative to positively marked terminal, must be considered as Positive.\n2) Potential drop i.e. travelling from positive to negatively marked terminal, must be considered as Negative.\n3) While tracing a closed path, select any one direction clockwise or anticlockwise. This selection is totally independent of the directions of currents and voltage of various branches of that closed loop path.\n\n4. Application of KVL to a closed path\nConsider a closed path of a complex network with various branches currents assumed as shown in the Fig. 3(a).\nAs the loop is assumed to be a part of complex network, the branch currents are assumed to be different from each other.\nDue to these currents the various voltage drops taken place across various resistances are marked as shown in the Fig. 3(b).",
null,
"Fig. 3\n\nThe polarity of voltage drop along the current direction is to be marked as positive (+) to negative (-).\nLet us trace this closed path in clockwise direction i.e. A-B-C-D-A.\nAcross R1 there is voltage drop I1 R and as getting traced from +ve to -ve, it is drop and must be taken as negative while applying KVL.\nBattery E1 is getting traced from negative to positive i.e. it is a rise hence must be considered as positive.\nAcross R2 there is a voltage drop I2 R2 and as getting traced from +ve to -ve, it is drop and must be taken negative.\nAcross R there is a drop I3 R3 and as getting traced from +ve to -ve, it is drop and must be taken as negative.\nAcross R4 there is drop I4 R4 and as getting traced from +ve to -ve, it is drop must be taken as negative.\nBattery E2 is getting traced from -ve to +ve, it is rise and must be taken as positive.\n... We can write an equation by using KVL around this closed path as,\n- I1 R1 + E1 -IR -IR -IR + E = 0 ....Required KVL equation\ni.e. E+ E = I1 R +I2 R + I3 R + I4 R\nIf we trace the closed loop in opposite direction i.e. along A-D-B-A and follow the same sign convention, the resulting equation will be same as what we have obtained above.\nKey point : So while applying KVL, direction in which loop is to be traced is not important but following the sign convention is most important.\n\n5. Steps to Apply Kirchhoff's Law to Get Network Equations\nThe steps are stated based on the branch current method.\nStep 1 : Draw the circuit diagram from the given information and insert all the value of source with appropriate polarities and all the resistances.\nStep 2 : Mark all the branch currents with some assumed directions using KCL at various nodes and junction points. Kept the number of unknown currents minimum as far as possible to limit the mathematical calculations required to solve them later on.\nAssumed directions may be wrong, in such case answer of such current will be mathematically negative which indicates the correct direction of the current. A particular current leaving a particular source has some magnitude, then same magnitude of current should enter that source after travelling through various branches of the network.\nStep 3 : Mark all the polarities of voltage drops and rise as per directions of the assumed branch currents flowing through various branch resistance of the network. This is necessary for application of KVL to various closed loops.\nStep 4 : Apply KVL to different closed paths in the network and obtain the corresponding equations. Each equation must contain some elements which is not considered in any previous equation.\nKey point : KVL must be applied to sufficient number of loops such that each element of the network is include at least once in any of the equations.\nStep 5 : Solve the simultaneous equations for the unknown currents. From these currents unknown voltages and power consumption in different resistances can be calculated.\n\nWhat to do if current source exists ?\nKey point : If there is current source in the network then complete the current distribution considering the current source. But while applying KVL, the loops should not be considered involving current source. The loop equations must be written to those loops which do not include any current source. This is because drop across current source is unknown.\nFor example consider the circuit shown in the Fig. 4. The current distribution completed in terms of current source value. Then KVL must be applied to the drop b-c-d-c-b, which does not include current source. The loop a-b-e-f-a should not be used for KVL application, as it includes current source. Its effect is already considered at the time of current distribution.",
null,
"Fig. 4"
] | [
null,
"http://4.bp.blogspot.com/-DJ-oPDSrmAU/Td0mXs8qHoI/AAAAAAAAAdo/ZGQRAtcOlZQ/s1600/qwe191.jpeg",
null,
"http://4.bp.blogspot.com/-B2g6qeMhswQ/Td0p6QXE3MI/AAAAAAAAAdw/BaCDsIA_hO8/s1600/qwe192.jpeg",
null,
"http://4.bp.blogspot.com/-1RYQmgRKjtM/Td0pv5TZi9I/AAAAAAAAAds/JeWyQkJWX7o/s1600/qwe193.jpeg",
null,
"http://3.bp.blogspot.com/-LTCndTBSiIQ/Td4kZuCBXOI/AAAAAAAAAe8/XSB4xDLyS0s/s1600/qwe1112.jpeg",
null
] | {"ft_lang_label":"__label__en","ft_lang_prob":0.9384107,"math_prob":0.982543,"size":10388,"snap":"2019-26-2019-30","text_gpt3_token_len":2266,"char_repetition_ratio":0.14705315,"word_repetition_ratio":0.45607376,"special_character_ratio":0.21659607,"punctuation_ratio":0.099609375,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9964993,"pos_list":[0,1,2,3,4,5,6,7,8],"im_url_duplicate_count":[null,1,null,1,null,1,null,1,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2019-07-19T23:13:27Z\",\"WARC-Record-ID\":\"<urn:uuid:32c950dc-f964-44ff-9da0-e721f4ab306d>\",\"Content-Length\":\"106907\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:38742e2f-3c38-4452-843b-28effd6d28f2>\",\"WARC-Concurrent-To\":\"<urn:uuid:0e073892-ac02-458a-8bc4-ab084d218c75>\",\"WARC-IP-Address\":\"172.217.164.147\",\"WARC-Target-URI\":\"http://www.yourelectrichome.com/2011/05/kirchhoffs-law.html\",\"WARC-Payload-Digest\":\"sha1:66QUL5GFSNBU2WB4QELJZPNBJAORQPV6\",\"WARC-Block-Digest\":\"sha1:6BQUQ46O7XVVHBEQRBPNTJ4BDENU3HO6\",\"WARC-Identified-Payload-Type\":\"application/xhtml+xml\",\"warc_filename\":\"/cc_download/warc_2019/CC-MAIN-2019-30/CC-MAIN-2019-30_segments_1563195526386.37_warc_CC-MAIN-20190719223744-20190720005744-00003.warc.gz\"}"} |
http://mathcentral.uregina.ca/QandQ/topics/non-linear%20system | [
"",
null,
"",
null,
"Math Central - mathcentral.uregina.ca",
null,
"",
null,
"Quandaries & Queries",
null,
"",
null,
"",
null,
"",
null,
"Q & Q",
null,
"",
null,
"",
null,
"",
null,
"Topic:",
null,
"non-linear system",
null,
"",
null,
"",
null,
"start over\n\nOne item is filed under this topic.",
null,
"",
null,
"",
null,
"",
null,
"Page1/1",
null,
"",
null,
"",
null,
"",
null,
"",
null,
"",
null,
"",
null,
"",
null,
"",
null,
"",
null,
"",
null,
"",
null,
"Two equations in two unknowns 2003-02-06",
null,
"From Patrick:What are all ordered pairs of real numbers (x, y) for which: yx2 - 7x + 12 = 1 and x + y = 6? Answered by Penny Nom.",
null,
"",
null,
"",
null,
"",
null,
"",
null,
"",
null,
"Page1/1",
null,
"",
null,
"",
null,
"",
null,
"Math Central is supported by the University of Regina and The Pacific Institute for the Mathematical Sciences.",
null,
"",
null,
"",
null,
"",
null,
"about math central :: site map :: links :: notre site français"
] | [
null,
"http://mathcentral.uregina.ca/lid/images/pixels/transparent.gif",
null,
"http://mathcentral.uregina.ca/lid/images/pixels/transparent.gif",
null,
"http://mathcentral.uregina.ca/lid/images/pixels/transparent.gif",
null,
"http://mathcentral.uregina.ca/lid/images/pixels/transparent.gif",
null,
"http://mathcentral.uregina.ca/lid/images/pixels/transparent.gif",
null,
"http://mathcentral.uregina.ca/lid/images/pixels/transparent.gif",
null,
"http://mathcentral.uregina.ca/lid/images/pixels/transparent.gif",
null,
"http://mathcentral.uregina.ca/lid/images/pixels/transparent.gif",
null,
"http://mathcentral.uregina.ca/lid/images/pixels/transparent.gif",
null,
"http://mathcentral.uregina.ca/lid/images/boxes/whiteonwhite/topleft.gif",
null,
"http://mathcentral.uregina.ca/lid/images/boxes/whiteonwhite/topright.gif",
null,
"http://mathcentral.uregina.ca/lid/QQ/images/topic.gif",
null,
"http://mathcentral.uregina.ca/images/transparent.gif",
null,
"http://mathcentral.uregina.ca/images/transparent.gif",
null,
"http://mathcentral.uregina.ca/lid/images/boxes/whiteonwhite/bottomleft.gif",
null,
"http://mathcentral.uregina.ca/lid/images/boxes/whiteonwhite/bottomright.gif",
null,
"http://mathcentral.uregina.ca/images/transparent.gif",
null,
"http://mathcentral.uregina.ca/images/transparent.gif",
null,
"http://mathcentral.uregina.ca/images/nav_but_inact_first.gif",
null,
"http://mathcentral.uregina.ca/images/nav_but_inact_previous.gif",
null,
"http://mathcentral.uregina.ca/images/nav_but_inact_next.gif",
null,
"http://mathcentral.uregina.ca/images/nav_but_inact_last.gif",
null,
"http://mathcentral.uregina.ca/images/transparent.gif",
null,
"http://mathcentral.uregina.ca/images/transparent.gif",
null,
"http://mathcentral.uregina.ca/images/transparent.gif",
null,
"http://mathcentral.uregina.ca/images/transparent.gif",
null,
"http://mathcentral.uregina.ca/images/transparent.gif",
null,
"http://mathcentral.uregina.ca/images/transparent.gif",
null,
"http://mathcentral.uregina.ca/images/transparent.gif",
null,
"http://mathcentral.uregina.ca/images/transparent.gif",
null,
"http://mathcentral.uregina.ca/images/transparent.gif",
null,
"http://mathcentral.uregina.ca/images/transparent.gif",
null,
"http://mathcentral.uregina.ca/images/transparent.gif",
null,
"http://mathcentral.uregina.ca/images/transparent.gif",
null,
"http://mathcentral.uregina.ca/images/transparent.gif",
null,
"http://mathcentral.uregina.ca/images/transparent.gif",
null,
"http://mathcentral.uregina.ca/images/transparent.gif",
null,
"http://mathcentral.uregina.ca/images/nav_but_inact_first.gif",
null,
"http://mathcentral.uregina.ca/images/nav_but_inact_previous.gif",
null,
"http://mathcentral.uregina.ca/images/nav_but_inact_next.gif",
null,
"http://mathcentral.uregina.ca/images/nav_but_inact_last.gif",
null,
"http://mathcentral.uregina.ca/images/transparent.gif",
null,
"http://mathcentral.uregina.ca/images/transparent.gif",
null,
"http://mathcentral.uregina.ca/lid/images/pixels/transparent.gif",
null,
"http://mathcentral.uregina.ca/lid/styles/mathcentral/interior/cms.gif",
null,
"http://mathcentral.uregina.ca/lid/images/pixels/transparent.gif",
null,
"http://mathcentral.uregina.ca/lid/images/pixels/transparent.gif",
null
] | {"ft_lang_label":"__label__en","ft_lang_prob":0.67005426,"math_prob":0.8740971,"size":517,"snap":"2019-13-2019-22","text_gpt3_token_len":153,"char_repetition_ratio":0.08966862,"word_repetition_ratio":0.0,"special_character_ratio":0.2804642,"punctuation_ratio":0.14678898,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9652892,"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],"im_url_duplicate_count":[null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,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\":\"2019-03-19T01:49:42Z\",\"WARC-Record-ID\":\"<urn:uuid:c2f6c2d6-71fc-44ad-bcd6-f11ebcea1810>\",\"Content-Length\":\"13635\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:159c88a1-d49e-4334-83f0-e37a7b264d4d>\",\"WARC-Concurrent-To\":\"<urn:uuid:1b2b20b5-d6bd-429c-ba0f-c36ba1cfce96>\",\"WARC-IP-Address\":\"142.3.156.43\",\"WARC-Target-URI\":\"http://mathcentral.uregina.ca/QandQ/topics/non-linear%20system\",\"WARC-Payload-Digest\":\"sha1:ITPGXUIANJZWEF2HYKRMD5OXV6MDEPTN\",\"WARC-Block-Digest\":\"sha1:LJSHP6Q7BJD2NE7FC2QWYWXHEDJPHXZC\",\"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-00308.warc.gz\"}"} |
https://www.khanacademy.org/math/ap-statistics/random-variables-ap/combining-random-variables/v/analyzing-the-difference-in-distributions | [
"If you're seeing this message, it means we're having trouble loading external resources on our website.\n\nIf you're behind a web filter, please make sure that the domains *.kastatic.org and *.kasandbox.org are unblocked.\n\n# Example: Analyzing the difference in distributions\n\nAP.STATS:\nVAR‑5 (EU)\n,\nVAR‑5.E (LO)\n,\nVAR‑5.E.1 (EK)\n,\nVAR‑5.E.3 (EK)\n\n## Video transcript\n\nsuppose that men have a mean height of 178 centimeters with a standard deviation of 8 centimeters women have a mean height of 170 centimeters with a standard deviation of 6 centimeters the male and female heights are each normally distributed we independently randomly select a man and a woman what is the probability that the woman is taller than the man so I encourage you to pause this video and think through it and I'll give you a hint what if we were to define the random variable M as equal to the height of a randomly selected man height of random man what if we define the random variable W to be equal to the height of a random woman woman and we defined a third random variable in terms of these first two so let me call this D for difference and it is equal to the difference in height between a randomly selected man and a randomly selected woman so d the random variable D is equal to the random variable M minus the random variable W so the first two are clearly normally distributed they tell us that right over here the male and female Heights are each normally distributed and we also know or you're about to know that the difference of random variables that are each normally distributed is also going to be normally distributed so given this can you think about how to tackle this question the probability that the woman is taller than the man all right now let's work through this together and to help us visualize I'll draw the normal distribution curves for these three random variables so this first one is for the variable M and so right here in the middle that is the mean of M and we know that this is going to be equal to 178 centimeters we'll assume everything is in centimeters we also know that it has a standard deviation of 8 centimeters so for example this is one standard deviation above this is one standard deviation below this point right over here would be 8 centimeters more than 178 so that would be 186 and this would be 8 centimeters below that so this would be 170 centimeters so this is for the random variable M now let's think about the random variable W the random variable W the mean of W they tell us is 170 and one standard deviation above the mean is going to be 6 centimeters above the mean the standard deviation is 6 6 centimeters so this would be minus 6 is to go to one standard deviation below the mean now let's think about the difference between the two the random variable D so let me think about this a little bit the random variable D the mean of D is going to be equal to the differences in the means of these random variables so it's going to be equal to the mean of M the mean of M minus the mean of W minus the mean of W well we know both of these this is going to be 178 minus 170 so let me write that down this is equal to 178 centimeters minus 170 centimeters which is going to be equal to I'll do it in this color this is going to be equal to 8 centimeters so this is 8 right over here now what about the standard deviation assuming these two random variables are independent and they tell us that we are independently randomly selecting a man and a woman the height of the man shouldn't affect the height of the woman or vice versa assuming that these two are independent variables if you take the sum or the difference of these then the spread will increase but you won't just add the standard deviations what you would actually do is say the variance of the difference is going to be the sum of these two variances so let me write that down so I could write vary ins with var or I could write it as a standard deviation squared so let me write that the standard deviation of D of our difference squared which is the variance is going to be equal to the variance of our variable M plus the variance of our variable W now this might be a little bit counterintuitive this might have made sense to you if this was plus right over here but it doesn't matter if we are adding or subtracting and these are truly independent variables then regardless of whether we're adding or subtracting you would add the variances and so we can figure this out this is going to be equal to the standard deviation of variable m is 8 so 8 squared is going to be 64 and then we have 6 squared this right over here is 6 6 squared is going to be 36 you add these two together this is going to be equal to 100 and so the variance of this distribution right over here is going to be equal to 100 well what's the standard deviation of that distribution what's going to be equal to the square root of the variance so the square root of 100 which is equal to 10 so for example one standard deviation above the mean is going to be 18 one standard deviation below the mean is going to be equal to negative 2 and so now using this distribution we can actually answer this question what is the probability that the woman is taller than the man well we can rewrite that question is saying what is the probability that the random variable D is what conditions would it be pause the video and think about it well the situations where the woman is taller than the man if the woman is taller than the man then this is going to be a negative value then D is going to be less than zero so what we really want to do is figure out the probability that D is less than zero and so what we want to do if we say zero is right over if we said that zero is right over here on our distribution so that is d is equal to zero we want to figure out well what is the area under the curve less than that so we want to figure out this entire area there's a couple of ways you could do this you could figure out the z-score for D equaling zero and that's pretty straightforward you could just say this Z is equal to zero minus our mean of 8 divided by our standard deviation of 10 so it's negative 8 over 10 which is equal to negative 8/10 so you could look up a Z table and say what is the total area under the curve below Z is equal to negative 0.8 another way you could do this is you could use a graphing calculator I have a ti-84 here where you have a normal cumulative distribution function I'm going to press 2nd vars and that gets me to distribution and so I have these various functions I want normal cumulative distribution function so that is choice two and then the lower bound well I want to go to negative infinity well calculators don't have a negative infinity button but you could put in a very very very very negative number that for our birth business is equivalent to negative infinity so we could say negative 1 times 10 to the 99th power and the way we do that is second this to capital ease or saying essentially times 10 to the and I'll say 99 power so this is a very very very negative number the upper bound here we want to go let me delete this the upper bound is going to be 0 we're finding the area from negative infinity all the way to 0 the mean here well we've already figured that out the mean is 8 and then the standard deviation here we figured this out too this is equal to 10 and so when we pick this we're going to go back to the main screen enter so this is we could have just typed this in directly on the main screen this says look we're looking at a normal distribution we want to find the cumulative area between two bounds in this case is from negative infinity to 0 from negative infinity to 0 where the mean is 8 and the standard deviation is 10 we press enter and we get approximately zero point two one two is approximately zero point two one two or you could say what is the probability that the woman is taller than the man well zero point two one two or approximately there's a twenty one point two percent chance of that happening a little better than one in five\nAP® is a registered trademark of the College Board, which has not reviewed this resource."
] | [
null
] | {"ft_lang_label":"__label__en","ft_lang_prob":0.9572094,"math_prob":0.9910367,"size":7731,"snap":"2021-31-2021-39","text_gpt3_token_len":1624,"char_repetition_ratio":0.16668823,"word_repetition_ratio":0.095681064,"special_character_ratio":0.21187428,"punctuation_ratio":6.60502E-4,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.999469,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2021-08-02T12:17:47Z\",\"WARC-Record-ID\":\"<urn:uuid:8c430202-4910-4ec9-980e-79df8a8ffee1>\",\"Content-Length\":\"257173\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:22df7346-5bb0-4e0c-a51a-3f70e6274b63>\",\"WARC-Concurrent-To\":\"<urn:uuid:b62b5576-b21d-40b6-a17b-5bd56d4e687c>\",\"WARC-IP-Address\":\"151.101.249.42\",\"WARC-Target-URI\":\"https://www.khanacademy.org/math/ap-statistics/random-variables-ap/combining-random-variables/v/analyzing-the-difference-in-distributions\",\"WARC-Payload-Digest\":\"sha1:H2D3QR6GMLNCJEDC2EOUT75VZPIZGMAR\",\"WARC-Block-Digest\":\"sha1:GI5RQ2SA6PTDWOX55GDM6O7KMTOCMIYH\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2021/CC-MAIN-2021-31/CC-MAIN-2021-31_segments_1627046154320.56_warc_CC-MAIN-20210802110046-20210802140046-00212.warc.gz\"}"} |
https://developer.mozilla.org/en-US/docs/web/javascript/reference/global_objects/promise/then | [
"# Promise.prototype.then()\n\nThe `then()` method returns a `Promise`. It takes up to two arguments: callback functions for the success and failure cases of the `Promise`.\n\n## Try it\n\nNote: If one or both arguments are omitted or are provided non-functions, then `then` will be missing the handler(s), but will not generate any errors. If the `Promise` that `then` is called on adopts a state (`fulfillment` or `rejection`) for which `then` has no handler, the returned promise adopts the final state of the original `Promise` on which `then` was called.\n\n## Syntax\n\n``````p.then(onFulfilled[, onRejected]);\n\np.then(value => {\n// fulfillment\n}, reason => {\n// rejection\n});\n``````\n\n### Parameters\n\n`onFulfilled` Optional\n\nA `Function` called if the `Promise` is fulfilled. This function has one argument, the `fulfillment value`. If it is not a function, it is internally replaced with an identity function (`x => x`) which simply passes the fulfillment value forward.\n\n`onRejected` Optional\n\nA `Function` called if the `Promise` is rejected. This function has one argument, the `rejection reason`. If it is not a function, it is internally replaced with a thrower function (`x => { throw x; }`) which throws the rejection reason it received.\n\n### Return value\n\nOnce a `Promise` is fulfilled or rejected, the respective handler function (`onFulfilled` or `onRejected`) will be called asynchronously (scheduled in the current thread loop). The behavior of the handler function follows a specific set of rules. If a handler function:\n\n• returns a value, the promise returned by `then` gets resolved with the returned value as its value.\n• doesn't return anything, the promise returned by `then` gets resolved with an `undefined` value.\n• throws an error, the promise returned by `then` gets rejected with the thrown error as its value.\n• returns an already fulfilled promise, the promise returned by `then` gets fulfilled with that promise's value as its value.\n• returns an already rejected promise, the promise returned by `then` gets rejected with that promise's value as its value.\n• returns another pending promise object, the resolution/rejection of the promise returned by `then` will be subsequent to the resolution/rejection of the promise returned by the handler. Also, the resolved value of the promise returned by `then` will be the same as the resolved value of the promise returned by the handler.\n\nFollowing, an example to demonstrate the asynchronicity of the `then` method.\n\n``````// using a resolved promise, the 'then' block will be triggered instantly,\n// but its handlers will be triggered asynchronously as demonstrated by the console.logs\nconst resolvedProm = Promise.resolve(33);\n\nlet thenProm = resolvedProm.then(value => {\nconsole.log(\"this gets called after the end of the main stack. the value received and returned is: \" + value);\nreturn value;\n});\n// instantly logging the value of thenProm\nconsole.log(thenProm);\n\n// using setTimeout we can postpone the execution of a function to the moment the stack is empty\nsetTimeout(() => {\nconsole.log(thenProm);\n});\n\n// logs, in order:\n// Promise {[[PromiseStatus]]: \"pending\", [[PromiseValue]]: undefined}\n// \"this gets called after the end of the main stack. the value received and returned is: 33\"\n// Promise {[[PromiseStatus]]: \"resolved\", [[PromiseValue]]: 33}\n``````\n\n## Description\n\nAs the `then` and `Promise.prototype.catch()` methods return promises, they can be chained — an operation called composition.\n\n## Examples\n\n### Using the `then` method\n\n``````const p1 = new Promise((resolve, reject) => {\nresolve('Success!');\n// or\n// reject(new Error(\"Error!\"));\n});\n\np1.then(value => {\nconsole.log(value); // Success!\n}, reason => {\nconsole.error(reason); // Error!\n});\n``````\n\n### Having a non-function as either parameter\n\n``````Promise.resolve(1).then(2).then(console.log); // prints 1\nPromise.reject(1).then(2, 2).then(console.log, console.log); // prints 1\n``````\n\n### Chaining\n\nThe `then` method returns a `Promise` which allows for method chaining.\n\nIf the function passed as handler to `then` returns a `Promise`, an equivalent `Promise` will be exposed to the subsequent `then` in the method chain. The below snippet simulates asynchronous code with the `setTimeout` function.\n\n``````Promise.resolve('foo')\n// 1. Receive \"foo\", concatenate \"bar\" to it, and resolve that to the next then\n.then(function(string) {\nreturn new Promise(function(resolve, reject) {\nsetTimeout(function() {\nstring += 'bar';\nresolve(string);\n}, 1);\n});\n})\n// 2. receive \"foobar\", register a callback function to work on that string\n// and print it to the console, but not before returning the unworked on\n// string to the next then\n.then(function(string) {\nsetTimeout(function() {\nstring += 'baz';\nconsole.log(string); // foobarbaz\n}, 1)\nreturn string;\n})\n// 3. print helpful messages about how the code in this section will be run\n// before the string is actually processed by the mocked asynchronous code in the\n// previous then block.\n.then(function(string) {\nconsole.log(\"Last Then: oops... didn't bother to instantiate and return \" +\n\"a promise in the prior then so the sequence may be a bit \" +\n\"surprising\");\n\n// Note that `string` will not have the 'baz' bit of it at this point. This\n// is because we mocked that to happen asynchronously with a setTimeout function\nconsole.log(string); // foobar\n});\n\n// logs, in order:\n// Last Then: oops... didn't bother to instantiate and return a promise in the prior then so the sequence may be a bit surprising\n// foobar\n// foobarbaz\n``````\n\nWhen a value is returned from within a `then` handler, it will effectively return `Promise.resolve(<value returned by whichever handler was called>)`.\n\n``````const p2 = new Promise(function(resolve, reject) {\nresolve(1);\n});\n\np2.then(function(value) {\nconsole.log(value); // 1\nreturn value + 1;\n}).then(function(value) {\nconsole.log(value + ' - A synchronous value works'); // 2 - A synchronous value works\n});\n\np2.then(function(value) {\nconsole.log(value); // 1\n});\n``````\n\nA `then` call will return a rejected promise if the function throws an error or returns a rejected Promise.\n\n``````Promise.resolve()\n.then(() => {\n// Makes .then() return a rejected promise\nthrow new Error('Oh no!');\n})\n.then(() => {\nconsole.log('Not called.');\n}, error => {\nconsole.error('onRejected function called: ' + error.message);\n});\n``````\n\nIn all other cases, a resolving Promise is returned. In the following example, the first `then()` will return `42` wrapped in a resolving Promise even though the previous Promise in the chain was rejected.\n\n``````Promise.reject()\n.then(() => 99, () => 42) // onRejected returns 42 which is wrapped in a resolving Promise\n.then(solution => console.log('Resolved with ' + solution)); // Resolved with 42\n``````\n\nIn practice, it is often desirable to catch rejected promises rather than use `then`'s two case syntax, as demonstrated below.\n\n``````Promise.resolve()\n.then(() => {\n// Makes .then() return a rejected promise\nthrow new Error('Oh no!');\n})\n.catch(error => {\nconsole.error('onRejected function called: ' + error.message);\n})\n.then(() => {\nconsole.log(\"I am always called even if the prior then's promise rejects\");\n});\n``````\n\nYou can also use chaining to implement one function with a Promise-based API on top of another such function.\n\n``````function fetch_current_data() {\n// The fetch() API returns a Promise. This function\n// exposes a similar API, except the fulfillment\n// value of this function's Promise has had more\n// work done on it.\nreturn fetch('current-data.json').then(response => {\nthrow new TypeError();\n}\nconst j = response.json();\n// maybe do something with j\nreturn j; // fulfillment value given to user of\n// fetch_current_data().then()\n});\n}\n``````\n\nIf `onFulfilled` returns a promise, the return value of `then` will be resolved/rejected by the promise.\n\n``````function resolveLater(resolve, reject) {\nsetTimeout(function() {\nresolve(10);\n}, 1000);\n}\nfunction rejectLater(resolve, reject) {\nsetTimeout(function() {\nreject(new Error('Error'));\n}, 1000);\n}\n\nconst p1 = Promise.resolve('foo');\nconst p2 = p1.then(function() {\n// Return promise here, that will be resolved to 10 after 1 second\nreturn new Promise(resolveLater);\n});\np2.then(function(v) {\nconsole.log('resolved', v); // \"resolved\", 10\n}, function(e) {\n// not called\nconsole.error('rejected', e);\n});\n\nconst p3 = p1.then(function() {\n// Return promise here, that will be rejected with 'Error' after 1 second\nreturn new Promise(rejectLater);\n});\np3.then(function(v) {\n// not called\nconsole.log('resolved', v);\n}, function(e) {\nconsole.error('rejected', e); // \"rejected\", 'Error'\n});\n``````\n\n### window.setImmediate style promise-based polyfill\n\nUsing a `Function.prototype.bind()` `Reflect.apply` (`Reflect.apply()`) method to create a (non-cancellable) `window.setImmediate`-style function.\n\n``````const nextTick = (() => {\nconst noop = () => {}; // literally\nconst nextTickPromise = () => Promise.resolve().then(noop);\n\nconst rfab = Reflect.apply.bind; // (thisArg, fn, thisArg, [...args])\nconst nextTick = (fn, ...args) => (\nfn !== undefined\n? Promise.resolve(args).then(rfab(null, fn, null))\n: nextTickPromise(),\nundefined\n);\nnextTick.ntp = nextTickPromise;\n\nreturn nextTick;\n})();\n``````\n\n## Browser compatibility\n\nBCD tables only load in the browser"
] | [
null
] | {"ft_lang_label":"__label__en","ft_lang_prob":0.68873423,"math_prob":0.7197358,"size":9115,"snap":"2022-27-2022-33","text_gpt3_token_len":2105,"char_repetition_ratio":0.19240479,"word_repetition_ratio":0.13565604,"special_character_ratio":0.26374108,"punctuation_ratio":0.18711656,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9503942,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2022-07-06T08:14:06Z\",\"WARC-Record-ID\":\"<urn:uuid:25967d46-6078-4f54-a202-f7b99d04847e>\",\"Content-Length\":\"141869\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:dca518d7-6b3f-45ed-820e-3fcd2c4e43b8>\",\"WARC-Concurrent-To\":\"<urn:uuid:70b9d95e-a2de-4a75-933c-87b87232125f>\",\"WARC-IP-Address\":\"99.84.108.98\",\"WARC-Target-URI\":\"https://developer.mozilla.org/en-US/docs/web/javascript/reference/global_objects/promise/then\",\"WARC-Payload-Digest\":\"sha1:UVJLQQCT6LVC67BNKFNRAUQ2PYAAWODU\",\"WARC-Block-Digest\":\"sha1:OYGDOI2OF2RZEUZSFZH4CBP4GQSRZ5OR\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2022/CC-MAIN-2022-27/CC-MAIN-2022-27_segments_1656104668059.88_warc_CC-MAIN-20220706060502-20220706090502-00199.warc.gz\"}"} |
http://graphmath.com/win/index.htm | [
"",
null,
"Main Features: * Draws 2D graphs of Y = F(X) functions * Displays their derivatives and integrals * Draws 3D graphs of Z = F(X, Y) functions, animates rotation * Solves F(X,Y) = 0 equations\n\nHere are some examples (click to see the full size picture):",
null,
"",
null,
"",
null,
"",
null,
"y = f(x) y=f(x),f'(x),S(x) f(x,y) = 0 z = f(x,y)",
null,
"z = f(x,y) (rotating)\n\n To download the program, please press on our logo or click here (ver. 2.5, last updated 08/14/2004)\n\n The authors would like to hear your suggestions or comments. Write to us! ([email protected])\n\n Keywords: graph, graphics, plot, plotting, graphing software, math, learning tools, education, 3D, three-D, 3-dimensional, tri-dimensional, function, equation, integral, derivative, extreme values, download free version."
] | [
null,
"http://graphmath.com/bar_bright.jpg",
null,
"http://graphmath.com/win/F_Ia_sm.gif",
null,
"http://graphmath.com/win/F_I_D_sm.gif",
null,
"http://graphmath.com/win/Eq_sm.gif",
null,
"http://graphmath.com/win/3Dnew_sm.gif",
null,
"http://graphmath.com/win/graph0-8.gif",
null
] | {"ft_lang_label":"__label__en","ft_lang_prob":0.7863273,"math_prob":0.9965135,"size":772,"snap":"2022-40-2023-06","text_gpt3_token_len":231,"char_repetition_ratio":0.092447914,"word_repetition_ratio":0.0,"special_character_ratio":0.29792747,"punctuation_ratio":0.21428572,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9936193,"pos_list":[0,1,2,3,4,5,6,7,8,9,10,11,12],"im_url_duplicate_count":[null,9,null,4,null,4,null,4,null,4,null,3,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2022-09-27T01:26:13Z\",\"WARC-Record-ID\":\"<urn:uuid:c0715292-86b5-43f3-bb7d-0816408b0413>\",\"Content-Length\":\"6917\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:548ae9e8-2768-4789-a38d-63355107ab29>\",\"WARC-Concurrent-To\":\"<urn:uuid:042afd22-0ea4-40b9-905e-f9a651acf78a>\",\"WARC-IP-Address\":\"173.201.178.162\",\"WARC-Target-URI\":\"http://graphmath.com/win/index.htm\",\"WARC-Payload-Digest\":\"sha1:ZMN6SPYIYKQ6ZDUYI4BHBO5PN7JGAVZ6\",\"WARC-Block-Digest\":\"sha1:7K32EUSIXWLFQYPJVS27JXMVK3AHV5RI\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2022/CC-MAIN-2022-40/CC-MAIN-2022-40_segments_1664030334974.57_warc_CC-MAIN-20220927002241-20220927032241-00699.warc.gz\"}"} |
https://www.techyv.com/questions/there-easy-way-insert-infinite-numbers-employees-ms-excel | [
"",
null,
"## How to add Employee number on Excel in an easy way?\n\nAsked By 250 points N/A Posted on -\n\nI encoded thousands of names to update our employee list but I forgot to put the numbers before the names so I can monitor the list,\n\nHow do I save time from typing the numbers?",
null,
"SHARE",
null,
"Best Answer by LisaRoberts\nAnswered By 5 points N/A #87515\n\n## How to add Employee number on Excel in an easy way?\n\nHi,\n\nIf you wanted to insert employee number in large Excel sheet, there are multiple ways to do it. You can pick any of these following tricks:\n\n• If you just want a sequential number as Employee number.\n\n1. Add a new column for Type in the first the first number ex. E0001 select that cell.\n2. In the left hand bottom of that cell you should see a bolded (+).\n3. When you see that just simply drag down or across and the numbers will automatically sequence itself. It shouldn't matter if there is a letter is before the number.\n4. If you enter a serial # E0001 in A1 and the next number E0002 in A2 and highlight both of them, then click and drag from the fill handle, Excel will compute the increment as 1 and automatically create more numbers using that increment, until the end of time, or 65,536 rows, whichever comes first.\n5. Excel will let you increment +1, going down in a column, so start the top of the column with E0001.\n6. Select a whole lot of the fields under that one and give the + 1 command. It may not let you do this with the E in front. In that case, put the E in the first column and the 0001 in the second column. Do the +1 increment in the second column.\n7. Copy the E as far as you need in the first column.\n8. Put as little space between the 2 columns as you can and orient the number to the left.\n\n• If your serial numbers begin with a specific letter, as in my example uses \"E\" and is followed by a set number of digits, as per your example of 4.\n\n• If you type your start serial number in for example cell C5, insert the following formula in cell C6, and copy it down as many rows as needed.\n\n=\"E\" & RIGHT(C5,4)+1\n\n• You can write a Macro for this.\n• You can create a button for increment the Serial number on every cell. It will increment the number in the active cell when the button is pressed. (Use a button from the Forms toolbar and assign this macro to it..\n\nSub Btn_Click()\n\nDim s As String, ll As Long\n\nDim j As Long, i As Long\n\nDim s1 As String, sChr As String\n\ns = ActiveCell.Value\n\ns = Trim(s)\n\nll = Len(s)\n\nIf ll = 0 Then\n\nActiveCell.Value = \"AB/1000\"\n\nExit Sub\n\nEnd If\n\nj = 0\n\ni = 0\n\nDo\n\ni = i + 1\n\nsChr = Mid(s, i, 1)\n\nIf IsNumeric(sChr) Then\n\ns1 = s1 & sChr\n\nElse\n\nj = j + 1\n\nEnd If\n\nLoop Until i = ll\n\ns1 = Format(Int(s1) + 1, \"0000\")\n\ns1 = Left(s, j) & s1\n\nActiveCell.Value = s1\n\nEnd Sub\n\n• Add the Employee number for the first Employee by hand (0001) and fill the remaining serial number fields (the ones below) with the following formula:\n\nFormula: =IF(ISBLANK(A2),\"\",B1+1) With A2 = cell to the left and B1 = cell above\n\nR1C1 Notation: =IF(ISBLANK(RC[-1]),\"\",R[-1]C+1)\n\nEdit: To \"add\" a leading 0 to the number, you need to set the number format of your serial number to the following custom format: 000000\n\n• A1 is header, A2 is first Employee number, A3=IF(COUNTA(B3:IV3)>0,MAX(A\\$1:A2)+1,\"\")\n\nCopy down as far as you wish.\n\n1. Insert a new column for adding serial numbers.\n2. Write 1 in the first row of that newly created column.\n3. Select that column and click on “Fill” under “Home”. This is for MS Excel 2007. You can check for “Fill” accordingly if you are using a different version of Excel.\n4. Under “Fill” select “Series…”\n5. Check the option “Columns” under “Series in”. Let the type be “Linear”. Select “Step value” as 1 and “Stop value” as per your requirements, say 1000. This stop value is number where counting will end.\n6. Click on “Ok”. That’s it your new column will now be filled with serial numbers.\n\n• Is the serial number just +1 on each row? If so try =sum (put the cell above the letter and number in these parenthesis) +1. Then copy and paste it down the column but be sure that the cell numbers are changing.\n\nHope this will help.",
null,
"Answered By 0 points N/A #87516\n\n## How to add Employee number on Excel in an easy way?\n\nIn either way you use when filling down the data automatically, you will find a small tooltip looks like a briefcase. Open it and select fill serial. You will find this tooltip on the Excel sheet.\n\nPlease note that in Office 2003 the end of Excel sheet is 65,553 rows and in Office 2007 undefined, so it's better to use Office 2007.\n\n• Just add new column before the name's column and type 1 or whichever the number you want to start with.\n• In the cell area, you will find a small square button in the left or right corner of the cell when u select it. Just double click it and it will automatically fill the next cells.\n• Also,instead of using this button you could select the area you want to fill the numbers in and from the ribbon select the following: Home > fill > fill down.",
null,
"Best Answer\nBest Answer\nAnswered By 0 points N/A #87517\n\n## How to add Employee number on Excel in an easy way?\n\nYes, there is a simple method:\n\n• First you have to insert a column before the name column.\n• For that right click on the column heading and select insert. You will have a new column inserted left to the name column.\n• Now type the number in the first cell of the list. Suppose it is something like, ‘EMP01’.\n• Now select the range that you want to fill with numbers.\n• Click on ‘Home’ tab. Click on the down arrow of the ‘Fill’ tool in ‘Editing ‘ group.\n• Select the ‘Series’ option. In the ‘Series’ dialog box select the type as ‘Auto fill’ and click ‘Ok’.\nEmployee numbers will be filled automatically.",
null,
"",
null,
""
] | [
null,
"https://secure.gravatar.com/avatar/92ff1f656f9afe142015f89b38706ca8",
null,
"https://techyv.com/sites/default/2016/10/techpedia_logo.png",
null,
"https://secure.gravatar.com/avatar/2140c780d7a0d9e6b2a791374d532b64",
null,
"https://techyv.com/sites/default/2016/10/techpedia_logo.png",
null,
"https://techyv.com/sites/default/2016/10/techpedia_logo.png",
null,
"https://www.techyv.com/sites/default/filesx/Click-on-the-down-arrow-of-the-Fill-tool-in-Editing.jpg",
null,
"https://techyv.com/sites/default/2016/10/techpedia_logo.png",
null
] | {"ft_lang_label":"__label__en","ft_lang_prob":0.85819274,"math_prob":0.8623794,"size":5469,"snap":"2021-04-2021-17","text_gpt3_token_len":1436,"char_repetition_ratio":0.14986277,"word_repetition_ratio":0.021596244,"special_character_ratio":0.27628452,"punctuation_ratio":0.09862779,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9630208,"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,3,null,null,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2021-04-21T08:22:06Z\",\"WARC-Record-ID\":\"<urn:uuid:a7d0adcd-288c-40aa-8273-06344df89968>\",\"Content-Length\":\"476770\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:35e1bb79-01c7-4ade-af5f-425778e88e76>\",\"WARC-Concurrent-To\":\"<urn:uuid:51d9efb5-37cd-4829-96f2-0cb38adc90e4>\",\"WARC-IP-Address\":\"104.21.62.161\",\"WARC-Target-URI\":\"https://www.techyv.com/questions/there-easy-way-insert-infinite-numbers-employees-ms-excel\",\"WARC-Payload-Digest\":\"sha1:HX5VPKK4VAOLNW74XUKD3ZST3LJ6VN6D\",\"WARC-Block-Digest\":\"sha1:K2UJZCVMS3EQHC7TPMOLBIVDQNHZVAHU\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2021/CC-MAIN-2021-17/CC-MAIN-2021-17_segments_1618039526421.82_warc_CC-MAIN-20210421065303-20210421095303-00540.warc.gz\"}"} |
https://www.cassieoakman.com/maths-work-out-1/ | [
"# Maths Work Out 1 – Think of a Number …\n\n“Think of a Number” is a common starting point for maths problems that use algebra. But you don’t need to know or use algebra to have fun with them. So …\n\nThink of a number, and write it down. Double your number, and write down the answer. Add 12 to that answer, and write that down. Multiply that answer by 3, and write that down. Subtract 18 from that answer, and write down the new answer. Divide that by 6, and write down your final answer.\n\nNow choose another number, and follow the above steps. Is there a pattern? If you can’t see one, try choosing another answer and following the steps again. If there is a pattern, can you predict what the final answer will be if you start with a different number? Will that always happen? If you believe it will, can you prove it? If you believe it won’t, can you find an exception?"
] | [
null
] | {"ft_lang_label":"__label__en","ft_lang_prob":0.9311272,"math_prob":0.78633606,"size":864,"snap":"2021-21-2021-25","text_gpt3_token_len":206,"char_repetition_ratio":0.16976744,"word_repetition_ratio":0.0,"special_character_ratio":0.23958333,"punctuation_ratio":0.13471502,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.97927946,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2021-06-20T13:11:56Z\",\"WARC-Record-ID\":\"<urn:uuid:2f1e3876-e395-416c-8620-c6c07f5c31ef>\",\"Content-Length\":\"39485\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:a5abf755-de84-44cd-8173-298f5b310dd0>\",\"WARC-Concurrent-To\":\"<urn:uuid:bf93dbb7-4500-44af-b936-465c9a324c5c>\",\"WARC-IP-Address\":\"185.119.173.226\",\"WARC-Target-URI\":\"https://www.cassieoakman.com/maths-work-out-1/\",\"WARC-Payload-Digest\":\"sha1:PBRQEPH3BLGOST3HPD4EOJ4RN6BC4NET\",\"WARC-Block-Digest\":\"sha1:HBGBRNTXZ457PWCCZFVI3ZZH7PQGE7C4\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2021/CC-MAIN-2021-25/CC-MAIN-2021-25_segments_1623487662882.61_warc_CC-MAIN-20210620114611-20210620144611-00349.warc.gz\"}"} |
https://ekaditak.com/exponent-rules-coloring-sheet-answer-key/ | [
"# Exponent Rules Coloring Sheet Answer Key",
null,
"Exponent Rules Coloring Sheet Answer Key. Articles worksheets are in pdf format and consist of a worksheet and answer sheet to check your results. 1 adding and subtracting polynomials.\n\nOrder of operations rational numbers. Printable in convenient pdf format. Generating tick marks on the range slider.\n\n### The Main Key When Solving Word Problems With Algebraic Sentences Is To.\n\nYou will lesson 5 integer exponents practice b answers is available in our digital. 1 adding and subtracting polynomials. Decoder key middle school math with pizzazz book e answer key e posted on jan middle school math with pizzazz book e answer key e germany ib math hl guide year 9 sats revision maths tes and forecasting questions australia by what is the answer to the middle school math pizzazz book of e posted on jan 23 sep.\n\n### The Exponent Range For Normalized Numbers Is [−126, 127] For.\n\nTim cut his pizza(the same size) into 3 equal slices and ate one of them. Multiple values creates multiple handles. Simplifying radicals worksheet with answers is really a sheet of report containing projects or questions which can be designed to be performed by students.\n\n### Mar 20, 2016 · 2.\n\nThis dataset is only a tiny fraction of what amazon provides, but for testing purposes, it's more than enough. The initial focus is on numbers and counting followed by arithmetic and concepts related to. 6 6 65 30 1.\n\n### I Checked Bootstrap 4 Documentation For The Range Slider And Answers Here On So, But Can't Find A Way.\n\nSteps for order of operations, practice problems,., introduction to signed numbers : Merely said, the quotable puzzles exponent rules maze worksheet answers. Write the letter of the exercise in the box above the answer.\n\n### Our Digital Library Hosts In Multiple Locations, Allowing You To Get The Most Less Latency Time To Download Any Of Our Books Like This One.\n\nThe answer key features answers to all student textbook practices and problem sets. Printable in convenient pdf format. Factoring fun answer key math riddles for grade 4."
] | [
null,
"https://ekaditak.com/wp-content/uploads/2022/03/th-1158.jpg",
null
] | {"ft_lang_label":"__label__en","ft_lang_prob":0.86001754,"math_prob":0.7924386,"size":2049,"snap":"2022-40-2023-06","text_gpt3_token_len":433,"char_repetition_ratio":0.10562347,"word_repetition_ratio":0.052785926,"special_character_ratio":0.20400195,"punctuation_ratio":0.097112864,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.97638357,"pos_list":[0,1,2],"im_url_duplicate_count":[null,1,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2022-10-02T15:28:45Z\",\"WARC-Record-ID\":\"<urn:uuid:c10d1863-a3cd-4e03-94d7-29d14be711df>\",\"Content-Length\":\"62581\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:300ae5b8-593d-41d8-b025-bce64838a276>\",\"WARC-Concurrent-To\":\"<urn:uuid:2b34fed5-7d17-4732-b1c8-1ee447d47fe6>\",\"WARC-IP-Address\":\"154.12.234.65\",\"WARC-Target-URI\":\"https://ekaditak.com/exponent-rules-coloring-sheet-answer-key/\",\"WARC-Payload-Digest\":\"sha1:SS7MUFE265PUUC2XB4TPUKB6GEIAIUPJ\",\"WARC-Block-Digest\":\"sha1:VPFF42LGLLDUDH36LAK4I2R3P2LPFYWR\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2022/CC-MAIN-2022-40/CC-MAIN-2022-40_segments_1664030337338.11_warc_CC-MAIN-20221002150039-20221002180039-00777.warc.gz\"}"} |
http://blomquist.xyz/3dcollisions/content/Chapter2/static_plane_plane.html | [
"# Plane Plane intersection\n\nWe've already done some work with plane intersection, when we did the intersection for 3 planes onto a point. Luckly the intersection of 2 planes is a lot simpler.\n\nThe only time two planes don't intersect is if they are parallel. If the planes are not parallel they will intersect in a line (of infinate length)",
null,
"The line of intersection is fairly useless in game development, so we will not be covering it here. If you are interested, youtube is full of videos on how to find this line, and the book Real Time Collision Detection covers how to do it in the context of games. I have a PDF if you need it.\n\n## The Algorithm\n\nThe key piece of information above is that two planes never intersect if they are parallel. Only if they are parallel. Knowing this case, the problem becomes, how can we tell if two planes are parallel?\n\nDot Product to the rescue! We have the normal of each plane! If the normals point in the same direction, we have parallel planes!\n\nbool PlanesIntersect(Plane p1, Plane p2) {\n// Compute direction of intersection line\nVector d = Cross(p1.n, p2.n);\n\n// If the length(Squared) of d is zero, the planes are\n// parallel (and separated) or coincident,\n// so they’re not considered intersecting\nreturn (Dot(d, d) > EPSILON); // EPSILON = 0.0001f\n}\n\n\nAdd the following function to the Collisions class:\n\npublic static bool Intersects(Plane p1, Plane p2)\n\n\nAnd provide an implementation for it!\n\n### Unit Test\n\nYou can Download the samples for this chapter to see if your result looks like the unit test.\n\nVisually, the unit test does not matter, this is because all of the planes intersect at least one other plane. Instead, the Initialize funciton will throw detailed error messages if needed.\n\nusing OpenTK.Graphics.OpenGL;\nusing Math_Implementation;\nusing CollisionDetectionSelector.Primitives;\n\nnamespace CollisionDetectionSelector.Samples {\nclass PlanePlaneIntersection : Application {\nPlane[] planes = new Plane[] {\nnull, null, null, null, null // Size = 5\n};\n\npublic override void Intialize(int width, int height) {\nGL.Enable(EnableCap.DepthTest);\n//GL.Enable(EnableCap.CullFace);\nGL.PolygonMode(MaterialFace.FrontAndBack, PolygonMode.Line);\nGL.PointSize(5f);\n\nplanes = new Plane();\nplanes = new Plane(new Vector3(2f, 0f, 1f), 0f);\nplanes = new Plane(new Vector3(0f, 1f, 0f), -2f);\nplanes = new Plane(new Vector3(-1f, 1f, 2f), 3f);\nplanes = new Plane(new Vector3(1f, 0f, 0.5f), 3f);\n\nbool[] results = new bool[] {\nfalse, true, true, true, true, true, false, true, true, false, true,\ntrue, false, true, true, true, true, true, false, true, true, false,\ntrue, true, false,\n};\nint t = 0;\n\nfor (int i = 0; i < planes.Length; ++i) {\nfor (int j = 0; j < planes.Length; ++j) {\nif (Collisions.Intersects(planes[i], planes[j]) != results[t++]) {\nLogError(\"[\" + (t - 1) + \"] Expected plane \" + i + \" to \" +\n(results[t - 1] ? \"intersect\" : \"not intersect\") +\n\" plane \" + j);\n}\n}\n}\n}\n\npublic override void Render() {\nbase.Render();\nDrawOrigin();\n\nfor (int i = 0; i < planes.Length; ++i) {\nplanes[i].Render();\n}\n}\n}\n}"
] | [
null,
"http://blomquist.xyz/3dcollisions/content/Chapter2/intersection_of_planes.png",
null
] | {"ft_lang_label":"__label__en","ft_lang_prob":0.6979496,"math_prob":0.9120132,"size":3053,"snap":"2022-27-2022-33","text_gpt3_token_len":825,"char_repetition_ratio":0.16497213,"word_repetition_ratio":0.064257026,"special_character_ratio":0.28365543,"punctuation_ratio":0.21001616,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.99128395,"pos_list":[0,1,2],"im_url_duplicate_count":[null,1,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2022-08-15T01:03:18Z\",\"WARC-Record-ID\":\"<urn:uuid:4871aa89-882e-461f-9a36-d7fa6855b348>\",\"Content-Length\":\"54069\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:ca704ee8-124b-4fcf-a16e-283e7ece6cb0>\",\"WARC-Concurrent-To\":\"<urn:uuid:cda29943-3037-47de-a536-b22d307839fd>\",\"WARC-IP-Address\":\"185.199.108.153\",\"WARC-Target-URI\":\"http://blomquist.xyz/3dcollisions/content/Chapter2/static_plane_plane.html\",\"WARC-Payload-Digest\":\"sha1:3P54SCYBNPTWSMWD4O2EMDI2GRYJGYS4\",\"WARC-Block-Digest\":\"sha1:E2YDAQEH2AHZKKBTUYPGSTUTSYVNIPRM\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2022/CC-MAIN-2022-33/CC-MAIN-2022-33_segments_1659882572089.53_warc_CC-MAIN-20220814234405-20220815024405-00547.warc.gz\"}"} |
https://homework.cpm.org/category/CCI_CT/textbook/int1/chapter/10/lesson/10.2.3/problem/10-104 | [
"",
null,
"",
null,
"### Home > INT1 > Chapter 10 > Lesson 10.2.3 > Problem10-104\n\n10-104.\n\nMarley’s cup of tea was cooling. Its temperature with relation to time can approximately be modeled by the function $f(t)=140(0.5)^t+72$.\n\n1. What does the $72$ represent in this situation?\n\nAs t gets larger, the function value approaches 72.\n\nConsider the significance of part b. Will the tea get cooler than surrounding air temperature?\n\n2. Marley decides to save energy and lower the temperature of her cottage to $68º$. How would this change the model?\n\n• $f(t)=140(0.5)t+68$"
] | [
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
] | {"ft_lang_label":"__label__en","ft_lang_prob":0.9118442,"math_prob":0.9750853,"size":480,"snap":"2021-31-2021-39","text_gpt3_token_len":111,"char_repetition_ratio":0.11134454,"word_repetition_ratio":0.0,"special_character_ratio":0.24791667,"punctuation_ratio":0.11702128,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.978642,"pos_list":[0,1,2,3,4],"im_url_duplicate_count":[null,null,null,null,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2021-09-21T18:38:28Z\",\"WARC-Record-ID\":\"<urn:uuid:c9922ece-6984-4c4f-a0c9-444510ff7584>\",\"Content-Length\":\"34990\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:efeee207-1294-47e8-9275-f0613587d0cf>\",\"WARC-Concurrent-To\":\"<urn:uuid:dadf7aed-e08a-4ec1-8961-6db750e359ac>\",\"WARC-IP-Address\":\"104.26.6.16\",\"WARC-Target-URI\":\"https://homework.cpm.org/category/CCI_CT/textbook/int1/chapter/10/lesson/10.2.3/problem/10-104\",\"WARC-Payload-Digest\":\"sha1:QGUCE26IYHW3DRDGMWOYDVIZD42VZQMQ\",\"WARC-Block-Digest\":\"sha1:54PZUKXWDUSDZNGHSP2NDCJ5DGHMV2EI\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2021/CC-MAIN-2021-39/CC-MAIN-2021-39_segments_1631780057225.57_warc_CC-MAIN-20210921161350-20210921191350-00195.warc.gz\"}"} |
https://probjet.com/8ojaf.php?e644bc=expressions-and-equations-8th-grade | [
"This lesson has students create linear equations from a real life context and use the equations to solve problems and make decisions. Grade 8 Enduring Understandings Worksheets are 8th equations grade, Science 8th grade expressions equations crossword 1 name, Science 8th grade expressions equations crossword 2 name, Elementary math work, Linear equations, Grade 8 mathematics practice test, Linear equations work, Solving linear equations variable on both sides. First things first, prioritize major topics with our printable compilation of 8th grade math worksheets with answer keys. Displaying all worksheets related to - 8th Grade Equations. PLAY. Questions on solving equations, simplifying expressions including expressions with fractions are included. Question 8: The equation 2x + 7 + x = 4x - x + 25 has.\n\nLearn vocabulary, terms, and more with flashcards, games, and other study tools. Grade 8 Math: Expressions and Equations.\n\nThese Algebraic Expressions Worksheets are a good resource for students in the 5th Grade through the 8th Grade. For example, 3 2 × 3 -5 = 3 -3 = 1/3 3 = 1/27. Mar 19, 2017 - Explore mandy679's board \"Expressions and Equations\" on Pinterest. 3. Includes full solutions and score reporting. When the change in y change in x is constant, also shown in a graph as a linear function. Unit: Expressions and Equations Grade Level: 8th Standard 8.EE.6: I can use similar triangles to explain why the slope m is the same between any two district points on a non-vertical line in the coordinate plane; derive the equation y=mx+b for a line through the origin and the equation y=mx+b for a line intercepting Question 9: Solve the following linear equation: x = -6. x = -3. x = -1. x = 2. Standards Document • 6-8 Standards Mathematics Teacher Support • Numeracy Intervention Resource - Georgia Numeracy Project Overview New • Georgia Numeracy Project Infomercial NEW • Georgia Mathematics 6-8 Teacher Professional Learning Community • Join the Georgia Mathematics 6-8 Teacher Email List by sending a blank email to [email protected] Question 10: Solve the following system of linear equations: Free practice questions for Common Core: 8th Grade Math - Expressions & Equations. NOTE: In what follows, mixed numbers are written in the form a b/c.\n\nGenerate equivalent numerical expressions 8.EE.2.–: Use square root and cube root symbols to represent solutions to equations of the form x2 = p and x3 = p, where p is a positive rational number. Evaluate square roots of small perfect squares and … A numerical factor in a term of an algebraic expression. CCSS.Math.Content.8.EE.A.2.\n\nFor example 2 1/3 means the mixed number 2 + 1/3. Grade 8 algebra questions with solutions are presented. You may select from 3 and 4 terms with addition, subtraction, and multiplication.\nIt is designed for 8th graders and provided by the National Council of Teachers of Mathematics. Fitness Test; Education Links; Physical Education Pics ; Science. Coefficient. A mathematical process used to simplify an expression or to add or subtract polynomials. CCSS.Math.Content.8.EE.A.3 Use numbers expressed in the form of a single digit times an integer power of 10 to estimate very large or very small quantities, and to express how many times as much one is than the other. These Algebraic Expressions Worksheets will create algebraic statements for the student to simplify. These Algebraic Expressions Worksheets will create algebraic statements for the student to simplify. 8.EE.A.2. Evaluate square roots of small perfect squares and cube roots of small perfect cubes. Know that √2 is irrational. Use square root and cube root symbols to represent solutions to equations of the form x2 = p and x3 = p, where p is a positive rational number. 8th Grade Equations.\n\nThese Algebraic Expressions Worksheets are a good resource for students in the 5th Grade through the 8th Grade. Use square root and cube root symbols to represent solutions to equations … You may select from 2, 3, or 4 terms with addition, subtraction, and multiplication.\n\nEquation. Start studying 8th Grade: Expressions and Equations (Linear) (Unit 3). Decimal Word Problems, Add, Subtract, Multiply, and Divide Integers, Evaluate Exponents, Fractions and Mixed Numbers, Solve Algebra Word Problems, Find sequence and nth term, Slope and Intercept of a Line, Circles, Volume, Surface Area, Ratio, Percent, Statistics, Probability Worksheets, examples with step by step solutions See more ideas about Math classroom, 8th grade math and Teaching math. 7th Grade Math; 8th Grade Math; Integrated 1 Math . .\n\nBhaskar The Rascal Child Actress Name, Bravo Jennifer Aydin, Dassault Aviation Investor Relations, Brazilian Whiteknee Tarantula Facts, Martin Mystery Tamil, Covetous Gold Serpent Ring Ds2, Lesson Plan On Addition Of Three-digit Numbers, Don't Leave Lyrics Clean, No Pagan Holidays, Atlanta Police Ride Along, Bhaskar Oru Rascal Tamil Movie Full Movie Tamilyogi, Maybelline Eyeshadow Review, Expedition Robinson Survivor, Tool - Lateralus Music Video, Tamil Prayer Lyrics, Deer In The Fall, Santiago Isabela Zip Code, Next To Kin Meaning In Urdu, In The End Lyrics Rush, Redback Salamander Biomass, Blue-fronted Amazon Parrot Fun Facts, Reefer Madness Romeo And Juliet Lyrics, Does Soma End Up With Erina, Hyrule Warriors Legends Guide Pdf, Elizabeth Of York And Richard Iii, The Gift Of Love Movie 1978, Space Jam: A New Legacy Cast, Time For Me To Come Home For Christmas Music, Wolf 2019 Trailer, Club Tool Meaning In Urdu, Petite Party Wear, Liam Millar Stats, Muriel Smith - Hold Me, Thrill Me, Kiss Me, Budgie Breeding Signs, Rene Gruau Pronunciation, Roma Pass Borghese Gallery Reservations, Revolver Sight Picture, Nevada Collie Rescue, White-nosed Coati Arizona, Violin Lessons Community Centre, I Am They, Cocktail Party Program Sample, Henry 22 Mag Octagon Barrel Golden Boy, Happy Hunting Cast, Xcom 2 - Alien Hunters Dlc, Millenium Prayer Sheet Music, Terry Sylvester Wife, Master Sword Vs Thunderblight Ganon, Bionic Commando Rearmed Steam, Hercai Cast Miran, Virtua Cop 1, Kenyan Sand Boa Poop, Martha Batman V Superman Meme, Flying Termites Colorado, R Kelly The World's Greatest Album, It's TIme To Party Now, The Bakery Girl Of Monceau English Subtitles, Cancer Cure News Today, Oregon License Plate, Brittany Spaniel Colors, Meet The Groomsmen Examples, Makeup Workshops For Beginners, Solar Lights Argos, Mrs Doubtfire Remake 2020, Sziget Sell Tickets, Meshell Ndegeocello Bitter Songs, Kangaroo Island Flights, How Many Slaves Died On Ships, Poetry Vocabulary Powerpoint, Sixtyforce Save Game, Side Impact Collisions, Moonlight In Vermont, Not A Night Owl Or Early Bird, Perfect Dark Zero Characters, Target Unicorn Roller Coaster,"
] | [
null
] | {"ft_lang_label":"__label__en","ft_lang_prob":0.8347546,"math_prob":0.9143045,"size":7532,"snap":"2020-34-2020-40","text_gpt3_token_len":1763,"char_repetition_ratio":0.13217323,"word_repetition_ratio":0.10940171,"special_character_ratio":0.21216145,"punctuation_ratio":0.16053748,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.97079474,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2020-09-29T01:53:57Z\",\"WARC-Record-ID\":\"<urn:uuid:cf03374c-5ed1-4204-b5e3-0ee9dd519d64>\",\"Content-Length\":\"23818\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:10960cb3-9b49-4353-a465-0e1902f4b5a2>\",\"WARC-Concurrent-To\":\"<urn:uuid:265d65f4-3038-43de-97f0-a770e5f80f59>\",\"WARC-IP-Address\":\"83.166.138.81\",\"WARC-Target-URI\":\"https://probjet.com/8ojaf.php?e644bc=expressions-and-equations-8th-grade\",\"WARC-Payload-Digest\":\"sha1:TZTLLDGDVEC32GLBD7M3UMZEWPRFIFQI\",\"WARC-Block-Digest\":\"sha1:5FQYAG6AMZPJCFJ7CBGLBJTGGPTT2K44\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2020/CC-MAIN-2020-40/CC-MAIN-2020-40_segments_1600401617641.86_warc_CC-MAIN-20200928234043-20200929024043-00034.warc.gz\"}"} |
https://www.varsitytutors.com/calculus_2-help/comparing-series | [
"# Calculus 2 : Comparing Series\n\n## Example Questions\n\n← Previous 1 3\n\n### Example Question #1 : Comparing Series\n\nWe consider the series having the general term :",
null,
"Determine the nature of convergence of the series.\n\nThe series is divergent.\n\nThe series is convergent.",
null,
"",
null,
"",
null,
"The series is convergent.\n\nExplanation:\n\nWe will use the integral test to prove this result.\n\nWe need to note the following:",
null,
"is positive, decreasing and",
null,
".\n\nBy the integral test, we know that the series",
null,
"is the integral",
null,
".\n\nWe know that the above intgral is finite.\n\nThis means that the series",
null,
"is convergent.\n\n### Example Question #2931 : Calculus Ii\n\nWe know that :",
null,
"and",
null,
"We consider the series having the general term:",
null,
"Determine the nature of the series:",
null,
"The series is divergent.",
null,
"",
null,
"The series is convergent.\n\nIt will stop converging after a certain number.\n\nThe series is convergent.\n\nExplanation:\n\nWe know that:",
null,
"and therefore we deduce :",
null,
"We will use the Comparison Test with this problem. To do this we will look at the function in general form",
null,
"We can do this since,",
null,
"and",
null,
"approach zero as n approaches infinity. The limit of our function becomes,",
null,
"This last part gives us",
null,
".\n\nNow we know that",
null,
"and noting that",
null,
"is a geometric series that is convergent.\n\nWe deduce by the Comparison Test that the series\n\nhaving general term",
null,
"is convergent.\n\n### Example Question #91 : Polynomial Approximations And Series\n\nWe consider the following series:",
null,
"Determine the nature of the convergence of the series.",
null,
"",
null,
"",
null,
"The series is divergent.",
null,
"The series is divergent.\n\nExplanation:\n\nWe will use the comparison test to prove this result. We must note the following:",
null,
"is positive.\n\nWe have all natural numbers n:",
null,
", this implies that",
null,
".\n\nInverting we get :",
null,
"Summing from 1 to",
null,
", we have",
null,
"We know that the",
null,
"is divergent. Therefore by the comparison test:",
null,
"is divergent\n\n### Example Question #4 : Comparing Series\n\nDetermine the nature of convergence of the series having the general term:",
null,
"The series is divergent.",
null,
"",
null,
"The series is convergent.",
null,
"The series is convergent.\n\nExplanation:\n\nWe will use the Limit Comparison Test to establish this result.\n\nWe need to note that the following limit",
null,
"goes to 1 as n goes to infinity.\n\nTherefore the series have the same nature. They either converge or diverge at the same time.\n\nWe will focus on the series:",
null,
".\n\nWe know that this series is convergent because it is a p-series. (Remember that",
null,
"converges if p>1 and we have p=3/2 which is greater that one in this case)\n\nBy the Limit Comparison Test, we deduce that the series is convergent, and that is what we needed to show.\n\n### Example Question #5 : Comparing Series\n\nDetermine whether the following series is convergent or divergent.",
null,
"",
null,
"",
null,
"",
null,
"",
null,
"This series is divergent.\n\nThis series is divergent.\n\nExplanation:\n\nTo have a series that is convergent we must have that the general term of the series goes to 0 as n goes to",
null,
".\n\nWe have the general term:",
null,
"therefore, we have",
null,
".\n\nThis means that the general term does not go to 0 .\n\nTherefore the series is divergent.\n\n### Example Question #121 : Convergence And Divergence\n\nDetermine the nature of the following series:",
null,
"The series is divergent.",
null,
"",
null,
"",
null,
"The series is convergent.\n\nThe series is divergent.\n\nExplanation:\n\nWe note first that the general term of the series is positive.\n\nIt is also decreasing and tends to 0 as n tends to",
null,
". We will use the Integral Comparison Test to show this result.\n\nNote the nature of the series is the same for the integral:",
null,
"This last intgral is divergent because it does not equal zero.\n\nTherefore our series is divergent as well.\n\n### Example Question #122 : Convergence And Divergence\n\nDetermine the nature of the series having the general term:",
null,
"",
null,
"",
null,
"",
null,
"The series is convergent.\n\nThe series is divergent.\n\nThe series is convergent.\n\nExplanation:\n\nWe note first that we can write the general term as:",
null,
"and simplifying this term one more time, we have:",
null,
"We note that since",
null,
", this series is a geometric one which is convergent.\n\nThis is what we need to show here.\n\n### Example Question #1 : Comparing Series\n\nDetermine whether the following series is convergent or divergent:",
null,
"",
null,
"",
null,
"This series is divergent.",
null,
"This series is convergent.\n\nThis series is divergent.\n\nExplanation:\n\nWe know that if a series is convergent, then its general term must go to 0 as",
null,
".\n\nWe have",
null,
"is our general term in this case.\n\nWe have",
null,
".\n\nSince the general term does not go to 0, the series is divergent.\n\n### Example Question #1 : Comparing Series\n\nUsing the Limit Test, determine the nature of the series:",
null,
"The series is divergent.",
null,
"The series is convergent.",
null,
"",
null,
"The series is convergent.\n\nExplanation:\n\nWe will use the Limit Comparison Test to study the nature of the series.\n\nWe note first that",
null,
", the series is positive.\n\nWe will compare the general term to",
null,
"We note that by letting",
null,
"and",
null,
", we have:",
null,
".\n\nTherefore the two series have the same nature, (they either converge or diverge at the same time).\n\nWe will use the Integral Test to deduce that the series having the general term:",
null,
"is convergent.\n\nNote that we know that",
null,
"is convergent if p>1 and in our case p=8 .\n\nThis shows that the series having general term",
null,
"is convergent.\n\nBy the Limit Test, the series having general term",
null,
"is convergent.\n\nThis shows that our series is convergent.\n\n### Example Question #1 : Comparing Series\n\nDetermine the nature of the series having general term:",
null,
"where",
null,
"The series is convergent.",
null,
"The series is divergent.",
null,
"",
null,
"The series is divergent.\n\nExplanation:\n\nWe will use the Comparison Test to prove this result.\n\nWe need to note first that",
null,
"for",
null,
".\n\nWe know that",
null,
", where",
null,
".\n\nInverting the above inequality, we have:",
null,
".\n\nNow we will use the Comparison Test.\n\nWe know that the series",
null,
"is divergent.\n\nTherefore,",
null,
"is also divergent.\n\n← Previous 1 3\n\n### All Calculus 2 Resources",
null,
""
] | [
null,
"https://vt-vtwa-assets.varsitytutors.com/vt-vtwa/uploads/formula_image/image/269919/gif.latex",
null,
"https://vt-vtwa-assets.varsitytutors.com/vt-vtwa/uploads/formula_image/image/282398/gif.latex",
null,
"https://vt-vtwa-assets.varsitytutors.com/vt-vtwa/uploads/formula_image/image/282397/gif.latex",
null,
"https://vt-vtwa-assets.varsitytutors.com/vt-vtwa/uploads/formula_image/image/268872/gif.latex",
null,
"https://vt-vtwa-assets.varsitytutors.com/vt-vtwa/uploads/formula_image/image/269920/gif.latex",
null,
"https://vt-vtwa-assets.varsitytutors.com/vt-vtwa/uploads/formula_image/image/269921/gif.latex",
null,
"https://vt-vtwa-assets.varsitytutors.com/vt-vtwa/uploads/formula_image/image/269922/gif.latex",
null,
"https://vt-vtwa-assets.varsitytutors.com/vt-vtwa/uploads/formula_image/image/269923/gif.latex",
null,
"https://vt-vtwa-assets.varsitytutors.com/vt-vtwa/uploads/formula_image/image/269924/gif.latex",
null,
"https://vt-vtwa-assets.varsitytutors.com/vt-vtwa/uploads/formula_image/image/268937/gif.latex",
null,
"https://vt-vtwa-assets.varsitytutors.com/vt-vtwa/uploads/formula_image/image/268939/gif.latex",
null,
"https://vt-vtwa-assets.varsitytutors.com/vt-vtwa/uploads/formula_image/image/268933/gif.latex",
null,
"https://vt-vtwa-assets.varsitytutors.com/vt-vtwa/uploads/formula_image/image/268935/gif.latex",
null,
"https://vt-vtwa-assets.varsitytutors.com/vt-vtwa/uploads/formula_image/image/268870/gif.latex",
null,
"https://vt-vtwa-assets.varsitytutors.com/vt-vtwa/uploads/formula_image/image/268869/gif.latex",
null,
"https://vt-vtwa-assets.varsitytutors.com/vt-vtwa/uploads/formula_image/image/268941/gif.latex",
null,
"https://vt-vtwa-assets.varsitytutors.com/vt-vtwa/uploads/formula_image/image/268943/gif.latex",
null,
"https://vt-vtwa-assets.varsitytutors.com/vt-vtwa/uploads/formula_image/image/268944/gif.latex",
null,
"https://vt-vtwa-assets.varsitytutors.com/vt-vtwa/uploads/formula_image/image/282390/gif.latex",
null,
"https://vt-vtwa-assets.varsitytutors.com/vt-vtwa/uploads/formula_image/image/282391/gif.latex",
null,
"https://vt-vtwa-assets.varsitytutors.com/vt-vtwa/uploads/formula_image/image/282392/gif.latex",
null,
"https://vt-vtwa-assets.varsitytutors.com/vt-vtwa/uploads/formula_image/image/268945/gif.latex",
null,
"https://vt-vtwa-assets.varsitytutors.com/vt-vtwa/uploads/formula_image/image/268946/gif.latex",
null,
"https://vt-vtwa-assets.varsitytutors.com/vt-vtwa/uploads/formula_image/image/268947/gif.latex",
null,
"https://vt-vtwa-assets.varsitytutors.com/vt-vtwa/uploads/formula_image/image/268948/gif.latex",
null,
"https://vt-vtwa-assets.varsitytutors.com/vt-vtwa/uploads/formula_image/image/282375/gif.latex",
null,
"https://vt-vtwa-assets.varsitytutors.com/vt-vtwa/uploads/formula_image/image/282374/gif.latex",
null,
"https://vt-vtwa-assets.varsitytutors.com/vt-vtwa/uploads/formula_image/image/282372/gif.latex",
null,
"https://vt-vtwa-assets.varsitytutors.com/vt-vtwa/uploads/formula_image/image/268861/gif.latex",
null,
"https://vt-vtwa-assets.varsitytutors.com/vt-vtwa/uploads/formula_image/image/268860/gif.latex",
null,
"https://vt-vtwa-assets.varsitytutors.com/vt-vtwa/uploads/formula_image/image/282376/gif.latex",
null,
"https://vt-vtwa-assets.varsitytutors.com/vt-vtwa/uploads/formula_image/image/268951/gif.latex",
null,
"https://vt-vtwa-assets.varsitytutors.com/vt-vtwa/uploads/formula_image/image/282377/gif.latex",
null,
"https://vt-vtwa-assets.varsitytutors.com/vt-vtwa/uploads/formula_image/image/282378/gif.latex",
null,
"https://vt-vtwa-assets.varsitytutors.com/vt-vtwa/uploads/formula_image/image/268954/gif.latex",
null,
"https://vt-vtwa-assets.varsitytutors.com/vt-vtwa/uploads/formula_image/image/282379/gif.latex",
null,
"https://vt-vtwa-assets.varsitytutors.com/vt-vtwa/uploads/formula_image/image/268956/gif.latex",
null,
"https://vt-vtwa-assets.varsitytutors.com/vt-vtwa/uploads/formula_image/image/268957/gif.latex",
null,
"https://vt-vtwa-assets.varsitytutors.com/vt-vtwa/uploads/formula_image/image/270159/gif.latex",
null,
"https://vt-vtwa-assets.varsitytutors.com/vt-vtwa/uploads/formula_image/image/268873/gif.latex",
null,
"https://vt-vtwa-assets.varsitytutors.com/vt-vtwa/uploads/formula_image/image/268875/gif.latex",
null,
"https://vt-vtwa-assets.varsitytutors.com/vt-vtwa/uploads/formula_image/image/268874/gif.latex",
null,
"https://vt-vtwa-assets.varsitytutors.com/vt-vtwa/uploads/formula_image/image/270160/gif.latex",
null,
"https://vt-vtwa-assets.varsitytutors.com/vt-vtwa/uploads/formula_image/image/270161/gif.latex",
null,
"https://vt-vtwa-assets.varsitytutors.com/vt-vtwa/uploads/formula_image/image/270162/gif.latex",
null,
"https://vt-vtwa-assets.varsitytutors.com/vt-vtwa/uploads/formula_image/image/270094/gif.latex",
null,
"https://vt-vtwa-assets.varsitytutors.com/vt-vtwa/uploads/formula_image/image/268880/gif.latex",
null,
"https://vt-vtwa-assets.varsitytutors.com/vt-vtwa/uploads/formula_image/image/268882/gif.latex",
null,
"https://vt-vtwa-assets.varsitytutors.com/vt-vtwa/uploads/formula_image/image/268879/gif.latex",
null,
"https://vt-vtwa-assets.varsitytutors.com/vt-vtwa/uploads/formula_image/image/268881/gif.latex",
null,
"https://vt-vtwa-assets.varsitytutors.com/vt-vtwa/uploads/formula_image/image/270095/gif.latex",
null,
"https://vt-vtwa-assets.varsitytutors.com/vt-vtwa/uploads/formula_image/image/270096/gif.latex",
null,
"https://vt-vtwa-assets.varsitytutors.com/vt-vtwa/uploads/formula_image/image/270097/gif.latex",
null,
"https://vt-vtwa-assets.varsitytutors.com/vt-vtwa/uploads/formula_image/image/269839/gif.latex",
null,
"https://vt-vtwa-assets.varsitytutors.com/vt-vtwa/uploads/formula_image/image/268877/gif.latex",
null,
"https://vt-vtwa-assets.varsitytutors.com/vt-vtwa/uploads/formula_image/image/268878/gif.latex",
null,
"https://vt-vtwa-assets.varsitytutors.com/vt-vtwa/uploads/formula_image/image/268876/gif.latex",
null,
"https://vt-vtwa-assets.varsitytutors.com/vt-vtwa/uploads/formula_image/image/269840/gif.latex",
null,
"https://vt-vtwa-assets.varsitytutors.com/vt-vtwa/uploads/formula_image/image/282430/gif.latex",
null,
"https://vt-vtwa-assets.varsitytutors.com/vt-vtwa/uploads/formula_image/image/270110/gif.latex",
null,
"https://vt-vtwa-assets.varsitytutors.com/vt-vtwa/uploads/formula_image/image/282453/gif.latex",
null,
"https://vt-vtwa-assets.varsitytutors.com/vt-vtwa/uploads/formula_image/image/268883/gif.latex",
null,
"https://vt-vtwa-assets.varsitytutors.com/vt-vtwa/uploads/formula_image/image/268884/gif.latex",
null,
"https://vt-vtwa-assets.varsitytutors.com/vt-vtwa/uploads/formula_image/image/270111/gif.latex",
null,
"https://vt-vtwa-assets.varsitytutors.com/vt-vtwa/uploads/formula_image/image/282458/gif.latex",
null,
"https://vt-vtwa-assets.varsitytutors.com/vt-vtwa/uploads/formula_image/image/270113/gif.latex",
null,
"https://vt-vtwa-assets.varsitytutors.com/vt-vtwa/uploads/formula_image/image/282519/gif.latex",
null,
"https://vt-vtwa-assets.varsitytutors.com/vt-vtwa/uploads/formula_image/image/268886/gif.latex",
null,
"https://vt-vtwa-assets.varsitytutors.com/vt-vtwa/uploads/formula_image/image/268887/gif.latex",
null,
"https://vt-vtwa-assets.varsitytutors.com/vt-vtwa/uploads/formula_image/image/268885/gif.latex",
null,
"https://vt-vtwa-assets.varsitytutors.com/vt-vtwa/uploads/formula_image/image/270085/gif.latex",
null,
"https://vt-vtwa-assets.varsitytutors.com/vt-vtwa/uploads/formula_image/image/282520/gif.latex",
null,
"https://vt-vtwa-assets.varsitytutors.com/vt-vtwa/uploads/formula_image/image/282521/gif.latex",
null,
"https://vt-vtwa-assets.varsitytutors.com/vt-vtwa/uploads/formula_image/image/269695/gif.latex",
null,
"https://vt-vtwa-assets.varsitytutors.com/vt-vtwa/uploads/formula_image/image/268890/gif.latex",
null,
"https://vt-vtwa-assets.varsitytutors.com/vt-vtwa/uploads/formula_image/image/268888/gif.latex",
null,
"https://vt-vtwa-assets.varsitytutors.com/vt-vtwa/uploads/formula_image/image/268889/gif.latex",
null,
"https://vt-vtwa-assets.varsitytutors.com/vt-vtwa/uploads/formula_image/image/269696/gif.latex",
null,
"https://vt-vtwa-assets.varsitytutors.com/vt-vtwa/uploads/formula_image/image/269697/gif.latex",
null,
"https://vt-vtwa-assets.varsitytutors.com/vt-vtwa/uploads/formula_image/image/269698/gif.latex",
null,
"https://vt-vtwa-assets.varsitytutors.com/vt-vtwa/uploads/formula_image/image/269699/gif.latex",
null,
"https://vt-vtwa-assets.varsitytutors.com/vt-vtwa/uploads/formula_image/image/269700/gif.latex",
null,
"https://vt-vtwa-assets.varsitytutors.com/vt-vtwa/uploads/formula_image/image/269701/gif.latex",
null,
"https://vt-vtwa-assets.varsitytutors.com/vt-vtwa/uploads/formula_image/image/269702/gif.latex",
null,
"https://vt-vtwa-assets.varsitytutors.com/vt-vtwa/uploads/formula_image/image/269703/gif.latex",
null,
"https://vt-vtwa-assets.varsitytutors.com/vt-vtwa/uploads/formula_image/image/269704/gif.latex",
null,
"https://vt-vtwa-assets.varsitytutors.com/vt-vtwa/uploads/formula_image/image/282545/gif.latex",
null,
"https://vt-vtwa-assets.varsitytutors.com/vt-vtwa/uploads/formula_image/image/270053/gif.latex",
null,
"https://vt-vtwa-assets.varsitytutors.com/vt-vtwa/uploads/formula_image/image/282542/gif.latex",
null,
"https://vt-vtwa-assets.varsitytutors.com/vt-vtwa/uploads/formula_image/image/282544/gif.latex",
null,
"https://vt-vtwa-assets.varsitytutors.com/vt-vtwa/uploads/formula_image/image/282543/gif.latex",
null,
"https://vt-vtwa-assets.varsitytutors.com/vt-vtwa/uploads/formula_image/image/282546/gif.latex",
null,
"https://vt-vtwa-assets.varsitytutors.com/vt-vtwa/uploads/formula_image/image/270055/gif.latex",
null,
"https://vt-vtwa-assets.varsitytutors.com/vt-vtwa/uploads/formula_image/image/282547/gif.latex",
null,
"https://vt-vtwa-assets.varsitytutors.com/vt-vtwa/uploads/formula_image/image/270057/gif.latex",
null,
"https://vt-vtwa-assets.varsitytutors.com/vt-vtwa/uploads/formula_image/image/282548/gif.latex",
null,
"https://vt-vtwa-assets.varsitytutors.com/vt-vtwa/uploads/formula_image/image/270059/gif.latex",
null,
"https://vt-vtwa-assets.varsitytutors.com/vt-vtwa/uploads/formula_image/image/282549/gif.latex",
null,
"https://vt-vtwa-app-assets.varsitytutors.com/assets/problems/og_image_practice_problems-9cd7cd1b01009043c4576617bc620d0d5f9d58294f59b6d6556fd8365f7440cf.jpg",
null
] | {"ft_lang_label":"__label__en","ft_lang_prob":0.8970982,"math_prob":0.9120956,"size":5391,"snap":"2019-51-2020-05","text_gpt3_token_len":1225,"char_repetition_ratio":0.28049007,"word_repetition_ratio":0.25520834,"special_character_ratio":0.21461695,"punctuation_ratio":0.13302326,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.99717253,"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,147,148,149,150,151,152,153,154,155,156,157,158,159,160,161,162,163,164,165,166,167,168,169,170,171,172,173,174,175,176,177,178,179,180,181,182,183,184,185,186,187,188,189,190,191,192,193,194,195,196,197,198],"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,3,null,3,null,3,null,3,null,6,null,6,null,6,null,6,null,6,null,6,null,6,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,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,null,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2019-12-13T21:11:26Z\",\"WARC-Record-ID\":\"<urn:uuid:49c12342-7989-4326-8e93-94f6f51891c0>\",\"Content-Length\":\"208906\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:1f3c9cef-a95f-42a2-85e5-9285c444407a>\",\"WARC-Concurrent-To\":\"<urn:uuid:22e8e8e4-0716-487c-9a72-f7226c8c5852>\",\"WARC-IP-Address\":\"99.84.181.118\",\"WARC-Target-URI\":\"https://www.varsitytutors.com/calculus_2-help/comparing-series\",\"WARC-Payload-Digest\":\"sha1:YX3IWMH2PZK4NBSPTYX3VLBOWRLIFYQV\",\"WARC-Block-Digest\":\"sha1:MHEEYOHUKNSF3UG7BAREGTI376JW25XI\",\"WARC-Identified-Payload-Type\":\"application/xhtml+xml\",\"warc_filename\":\"/cc_download/warc_2019/CC-MAIN-2019-51/CC-MAIN-2019-51_segments_1575540569146.17_warc_CC-MAIN-20191213202639-20191213230639-00532.warc.gz\"}"} |
https://www.programcreek.com/python/?code=dask%2Fdask-ml%2Fdask-ml-master%2Fdask_ml%2Fmodel_selection%2F_incremental.py | [
"```from __future__ import division\n\nimport itertools\nimport logging\nimport operator\nimport sys\nfrom collections import defaultdict, namedtuple\nfrom copy import deepcopy\nfrom time import time\nfrom typing import Union\nfrom warnings import warn\n\nimport numpy as np\nimport scipy.stats\nimport toolz\nfrom dask.distributed import Future, default_client, futures_of, wait\nfrom distributed.utils import log_errors\nfrom sklearn.base import clone\nfrom sklearn.metrics import check_scoring\nfrom sklearn.model_selection import ParameterGrid, ParameterSampler\nfrom sklearn.utils import check_random_state\nfrom sklearn.utils.metaestimators import if_delegate_has_method\n\nfrom .._compat import check_is_fitted, dummy_context\nfrom .._utils import LoggingContext\nfrom ..utils import check_array\nfrom ..wrappers import ParallelPostFit\nfrom ._split import train_test_split\n\nResults = namedtuple(\"Results\", [\"info\", \"models\", \"history\", \"best\"])\n\nno_default = object()\n\ndef _partial_fit(model_and_meta, X, y, fit_params):\n\"\"\"\nCall partial_fit on a classifiers with training data X and y\n\nArguments\n---------\nmodel_and_meta : Tuple[Estimator, dict]\nX, y : np.ndarray, np.ndarray\nTraining data\nfit_params : dict\nExtra keyword arguments to pass to partial_fit\n\nReturns\n-------\nResults\nA namedtuple with four fields: info, models, history, best\n\n* info : Dict[model_id, List[Dict]]\nKeys are integers identifying each model. Values are a\nList of Dict\n* models : Dict[model_id, Future[Estimator]]\nA dictionary with the same keys as `info`. The values\nare futures to the fitted models.\n* history : List[Dict]\nThe history of model fitting for each model. Each element\nof the list is a dictionary with the following elements:\n\n* model_id : int\nA superset of the keys for `info` and `models`.\n* params : Dict[str, Any]\nParameters this model was trained with.\n* partial_fit_calls : int\nThe number of *consecutive* partial fit calls at this stage in\nthis models training history.\n* partial_fit_time : float\nTime (in seconds) spent on this partial fit\n* score : float\nScore on the test set for the model at this point in history\n* score_time : float\nTime (in seconds) spent on this scoring.\n* best : Tuple[model_id, Future[Estimator]]]\nThe estimator with the highest validation score in the final\nround.\n\"\"\"\nwith log_errors():\nstart = time()\nmodel, meta = model_and_meta\n\nif len(X):\nmodel = deepcopy(model)\nmodel.partial_fit(X, y, **(fit_params or {}))\n\nmeta = dict(meta)\nmeta[\"partial_fit_calls\"] += 1\nmeta[\"partial_fit_time\"] = time() - start\n\nreturn model, meta\n\ndef _score(model_and_meta, X, y, scorer):\nstart = time()\nmodel, meta = model_and_meta\nif scorer:\nscore = scorer(model, X, y)\nelse:\nscore = model.score(X, y)\n\nmeta = dict(meta)\nmeta.update(score=score, score_time=time() - start)\nreturn meta\n\ndef _create_model(model, ident, **params):\n\"\"\" Create a model by cloning and then setting params \"\"\"\nwith log_errors():\nmodel = clone(model).set_params(**params)\nreturn model, {\"model_id\": ident, \"params\": params, \"partial_fit_calls\": 0}\n\nasync def _fit(\nmodel,\nparams,\nX_train,\ny_train,\nX_test,\ny_test,\nfit_params=None,\nscorer=None,\nrandom_state=None,\nverbose: Union[bool, int, float] = False,\nprefix=\"\",\n):\nif isinstance(verbose, bool):\n# Always log (other loggers might configured differently)\nverbose = 1.0\nif not 0 <= verbose <= 1:\nraise ValueError(\n\"verbose={} does not satisfy 0 <= verbose <= 1\".format(verbose)\n)\nlog_delay = int(1 / float(verbose)) if verbose > 0 else 0\n\noriginal_model = model\nfit_params = fit_params or {}\nclient = default_client()\nrng = check_random_state(random_state)\n\ninfo = {}\nmodels = {}\nscores = {}\n\nlogger.info(\"[CV%s] creating %d models\", prefix, len(params))\nfor ident, param in enumerate(params):\nmodel = client.submit(_create_model, original_model, ident, **param)\ninfo[ident] = []\nmodels[ident] = model\n\n# assume everything in fit_params is small and make it concrete\nfit_params = await client.compute(fit_params)\n\n# Convert testing data into a single element on the cluster\n# This assumes that it fits into memory on a single worker\nif isinstance(X_test, da.Array):\nX_test = client.compute(X_test)\nelse:\nX_test = await client.scatter(X_test)\nif isinstance(y_test, da.Array):\ny_test = client.compute(y_test)\nelse:\ny_test = await client.scatter(y_test)\n\n# Convert to batches of delayed objects of numpy arrays\nX_train = sorted(futures_of(X_train), key=lambda f: f.key)\ny_train = sorted(futures_of(y_train), key=lambda f: f.key)\nassert len(X_train) == len(y_train)\n\ntrain_eg = await client.gather(client.map(len, y_train))\nmsg = \"[CV%s] For training there are between %d and %d examples in each chunk\"\nlogger.info(msg, prefix, min(train_eg), max(train_eg))\n\n# Order by which we process training data futures\norder = []\n\ndef get_futures(partial_fit_calls):\n\"\"\" Policy to get training data futures\n\nCurrently we compute once, and then keep in memory.\nPresumably in the future we'll want to let data drop and recompute.\nThis function handles that policy internally, and also controls random\n\"\"\"\n# Shuffle blocks going forward to get uniform-but-random access\nwhile partial_fit_calls >= len(order):\nL = list(range(len(X_train)))\nrng.shuffle(L)\norder.extend(L)\nj = order[partial_fit_calls]\nreturn X_train[j], y_train[j]\n\n# Submit initial partial_fit and score computations on first batch of data\nX_future, y_future = get_futures(0)\nX_future_2, y_future_2 = get_futures(1)\n_models = {}\n_scores = {}\n_specs = {}\n\nfor ident, model in models.items():\nmodel = d_partial_fit(model, X_future, y_future, fit_params)\nscore = d_score(model, X_test, y_test, scorer)\nspec = d_partial_fit(model, X_future_2, y_future_2, fit_params)\n_models[ident] = model\n_scores[ident] = score\n_specs[ident] = spec\n_models, _scores, _specs, priority={tuple(_specs.values()): -1}\n)\n_models = {k: list(v.dask.values()) for k, v in _models.items()}\n_scores = {k: list(v.dask.values()) for k, v in _scores.items()}\n_specs = {k: list(v.dask.values()) for k, v in _specs.items()}\nmodels.update(_models)\nscores.update(_scores)\nspeculative = _specs\n\nnew_scores = list(_scores.values())\nhistory = []\nstart_time = time()\n\n# async for future, result in seq:\nfor _i in itertools.count():\nmetas = await client.gather(new_scores)\n\nif log_delay and _i % int(log_delay) == 0:\nidx = np.argmax([m[\"score\"] for m in metas])\nbest = metas[idx]\nmsg = \"[CV%s] validation score of %0.4f received after %d partial_fit calls\"\nlogger.info(msg, prefix, best[\"score\"], best[\"partial_fit_calls\"])\n\nfor meta in metas:\nident = meta[\"model_id\"]\nmeta[\"elapsed_wall_time\"] = time() - start_time\n\ninfo[ident].append(meta)\nhistory.append(meta)\n\ndel models[ident]\ndel scores[ident]\ndel info[ident]\n\nif not any(instructions.values()):\nbreak\n\n_models = {}\n_scores = {}\n_specs = {}\n\nfor ident, k in instructions.items():\nstart = info[ident][-1][\"partial_fit_calls\"] + 1\n\nif k:\nk -= 1\nmodel = speculative.pop(ident)\nfor i in range(k):\nX_future, y_future = get_futures(start + i)\nmodel = d_partial_fit(model, X_future, y_future, fit_params)\nscore = d_score(model, X_test, y_test, scorer)\nX_future, y_future = get_futures(start + k)\nspec = d_partial_fit(model, X_future, y_future, fit_params)\n_models[ident] = model\n_scores[ident] = score\n_specs[ident] = spec\n\n_models, _scores, _specs, priority={tuple(_specs.values()): -1}\n)\n_models2 = {\nk: v if isinstance(v, Future) else list(v.dask.values())\nfor k, v in _models2.items()\n}\n_scores2 = {k: list(v.dask.values()) for k, v in _scores2.items()}\n_specs2 = {k: list(v.dask.values()) for k, v in _specs2.items()}\n\nmodels.update(_models2)\nscores.update(_scores2)\nspeculative = _specs2\n\nnew_scores = list(_scores2.values())\n\nmodels = {k: client.submit(operator.getitem, v, 0) for k, v in models.items()}\nawait wait(models)\nscores = await client.gather(scores)\nbest = max(scores.items(), key=lambda x: x[\"score\"])\n\ninfo = defaultdict(list)\nfor h in history:\ninfo[h[\"model_id\"]].append(h)\ninfo = dict(info)\n\nreturn Results(info, models, history, best)\n\nasync def fit(\nmodel,\nparams,\nX_train,\ny_train,\nX_test,\ny_test,\nfit_params=None,\nscorer=None,\nrandom_state=None,\nverbose: Union[bool, int] = False,\nprefix=\"\",\n):\n\"\"\" Find a good model and search among a space of hyper-parameters\n\nThis does a hyper-parameter search by creating many models and then fitting\nthem incrementally on batches of data and reducing the number of models based\non the scores computed during training. Over time fewer and fewer models\nremain. We train these models for increasingly long times.\n\nThe model, number of starting parameters, and decay can all be provided as\nconfiguration parameters.\n\nTraining data should be given as Dask arrays. It can be large. Testing\ndata should be given either as a small dask array or as a numpy array. It\nshould fit on a single worker.\n\nParameters\n----------\nmodel : Estimator\nparams : List[Dict]\nParameters to start training on model\nX_test : Array\nNumpy array or small dask array. Should fit in single node's memory.\ny_test : Array\nNumpy array or small dask array. Should fit in single node's memory.\nA function that takes information about scoring history per model and\nreturns the number of additional partial fit calls to run on each model\nfit_params : dict\nExtra parameters to give to partial_fit\nscorer : callable\nA scorer callable object / function with signature\n``scorer(estimator, X, y)``.\nrandom_state : int, RandomState instance or None, optional, default: None\nIf int, random_state is the seed used by the random number generator;\nIf RandomState instance, random_state is the random number generator;\nIf None, the random number generator is the RandomState instance used\nby `np.random`.\nverbose : bool, int, float, default=False\nIf bool (default), log everytime possible.\nIf non-zero, configure logging to print/pipe to stdout.\nIf float or int, log and print ``verbose`` fraction of the time.\nIf zero, do not log past initialization.\nprefix : str, optional, default: \"\"\nThe string to print out in each debug message. Each message is prefixed\nwith `[CV{prefix}]`.\n\nExamples\n--------\n>>> import numpy as np\n>>> X, y = make_classification(n_samples=5000000, n_features=20,\n... chunks=100000, random_state=0)\n\n>>> from sklearn.linear_model import SGDClassifier\n>>> model = SGDClassifier(tol=1e-3, penalty='elasticnet', random_state=0)\n\n>>> from sklearn.model_selection import ParameterSampler\n>>> params = {'alpha': np.logspace(-2, 1, num=1000),\n... 'l1_ratio': np.linspace(0, 1, num=1000),\n... 'average': [True, False]}\n>>> params = list(ParameterSampler(params, 10, random_state=0))\n\n>>> X_test, y_test = X[:100000], y[:100000]\n>>> X_train = X[100000:]\n>>> y_train = y[100000:]\n\n>>> def remove_worst(scores):\n... last_score = {model_id: info[-1]['score']\n... for model_id, info in scores.items()}\n... worst_score = min(last_score.values())\n... out = {}\n... for model_id, score in last_score.items():\n... if score != worst_score:\n... out[model_id] = 1 # do one more training step\n... if len(out) == 1:\n... out = {k: 0 for k in out} # no more work to do, stops execution\n... return out\n\n>>> client = Client(processes=False)\n\n>>> info, models, history, best = fit(model, params,\n... X_train, y_train,\n... X_test, y_test,\n... fit_params={'classes': [0, 1]},\n... random_state=0)\n\n>>> models\n{2: <Future: status: finished, type: SGDClassifier, key: ...}\n>>> models.result()\nSGDClassifier(...)\n>>> info[-1] # doctest: +SKIP\n{'model_id': 2,\n'params': {'l1_ratio': 0.9529529529529529, 'average': False,\n'alpha': 0.014933932161242525},\n'partial_fit_calls': 8,\n'partial_fit_time': 0.17334818840026855,\n'score': 0.58765,\n'score_time': 0.031442880630493164}\n\nReturns\n-------\ninfo : Dict[int, List[Dict]]\nScoring history of each successful model, keyed by model ID.\nThis has the parameters, scores, and timing information over time\nmodels : Dict[int, Future]\nDask futures pointing to trained models\nhistory : List[Dict]\nA history of all models scores over time\n\"\"\"\nreturn await _fit(\nmodel,\nparams,\nX_train,\ny_train,\nX_test,\ny_test,\nfit_params=fit_params,\nscorer=scorer,\nrandom_state=random_state,\nverbose=verbose,\nprefix=prefix,\n)\n\n# ----------------------------------------------------------------------------\n# Base class for scikit-learn compatible estimators using fit\n# ----------------------------------------------------------------------------\n\nclass BaseIncrementalSearchCV(ParallelPostFit):\n\"\"\"Base class for estimators using the incremental `fit`.\n\nSubclasses must implement the following abstract method\n\n\"\"\"\n\ndef __init__(\nself,\nestimator,\nparameters,\ntest_size=None,\nrandom_state=None,\nscoring=None,\nmax_iter=100,\npatience=False,\ntol=1e-3,\nverbose=False,\nprefix=\"\",\n):\nself.parameters = parameters\nself.test_size = test_size\nself.random_state = random_state\nself.max_iter = max_iter\nself.patience = patience\nself.tol = tol\nself.verbose = verbose\nself.prefix = prefix\nsuper(BaseIncrementalSearchCV, self).__init__(estimator, scoring=scoring)\n\ndef _validate_parameters(self, X, y):\nif (self.max_iter is not None) and self.max_iter < 1:\nraise ValueError(\n\"Received max_iter={}. max_iter < 1 is not supported\".format(\nself.max_iter\n)\n)\n\n# Make sure dask arrays are passed so error on unknown chunk size is raised\nif isinstance(X, dd.DataFrame):\nif isinstance(y, (dd.DataFrame, dd.Series)):\nX = self._check_array(X, **kwargs)\ny = self._check_array(y, ensure_2d=False, **kwargs)\nscorer = check_scoring(self.estimator, scoring=self.scoring)\nreturn X, y, scorer\n\n@property\ndef _postfit_estimator(self):\ncheck_is_fitted(self, \"best_estimator_\")\nreturn self.best_estimator_\n\ndef _check_array(self, X, **kwargs):\n\"\"\"Validate the data arguments X and y.\n\nBy default, NumPy arrays are converted to 1-block dask arrays.\n\nParameters\n----------\nX, y : array-like\n\"\"\"\nif isinstance(X, np.ndarray):\nX = da.from_array(X, X.shape)\nX = check_array(X, **kwargs)\nreturn X\n\ndef _get_train_test_split(self, X, y, **kwargs):\n\"\"\"CV-Split the arrays X and y\n\nis used with ``self.test_size``. The test set is expected to\nfit in memory on each worker machine.\n\nParameters\n----------\n\"\"\"\nif self.test_size is None:\ntest_size = min(0.2, 1 / X.npartitions)\nelse:\ntest_size = self.test_size\nX_train, X_test, y_train, y_test = train_test_split(\nX, y, test_size=test_size, random_state=self.random_state\n)\nreturn X_train, X_test, y_train, y_test\n\nraise NotImplementedError\n\ndef _get_params(self):\n\"\"\"Parameters to pass to `fit`.\n\nBy default, a GridSearch over ``self.parameters`` is used.\n\"\"\"\nreturn ParameterGrid(self.parameters)\n\ndef _get_cv_results(self, history, model_hist):\ncv_results = {}\nbest_scores = {}\nbest_scores = {k: hist[-1][\"score\"] for k, hist in model_hist.items()}\n\ncv_results = {}\nfor k, hist in model_hist.items():\npf_times = list(toolz.pluck(\"partial_fit_time\", hist))\nscore_times = list(toolz.pluck(\"score_time\", hist))\ncv_results[k] = {\n\"mean_partial_fit_time\": np.mean(pf_times),\n\"mean_score_time\": np.mean(score_times),\n\"std_partial_fit_time\": np.std(pf_times),\n\"std_score_time\": np.std(score_times),\n\"test_score\": best_scores[k],\n\"model_id\": k,\n\"params\": hist[\"params\"],\n\"partial_fit_calls\": hist[-1][\"partial_fit_calls\"],\n}\ncv_results = list(cv_results.values()) # list of dicts\ncv_results = {k: [res[k] for res in cv_results] for k in cv_results}\n\n# Every model will have the same params because this class uses either\n# ParameterSampler or ParameterGrid\nparams = defaultdict(list)\nfor model_params in cv_results[\"params\"]:\nfor k, v in model_params.items():\nparams[k].append(v)\n\nfor k, v in params.items():\ncv_results[\"param_\" + k] = v\n\ncv_results = {k: np.array(v) for k, v in cv_results.items()}\ncv_results[\"rank_test_score\"] = scipy.stats.rankdata(\n-cv_results[\"test_score\"], method=\"min\"\n).astype(int)\nreturn cv_results\n\ndef _process_results(self, results):\n\"\"\"Called with the output of `fit` immediately after it finishes.\n\nSubclasses may update the results here, before further results are\ncomputed (e.g. ``cv_results_``, ``best_estimator_``).\n\nBy default, results is returned as-is.\n\"\"\"\nreturn results\n\ndef _check_is_fitted(self, method_name):\nreturn check_is_fitted(self, \"best_estimator_\")\n\nasync def _fit(self, X, y, **fit_params):\nif self.verbose:\nh = logging.StreamHandler(sys.stdout)\ncontext = LoggingContext(logger, level=logging.INFO, handler=h)\nelse:\ncontext = dummy_context()\n\nX, y, scorer = self._validate_parameters(X, y)\nX_train, X_test, y_train, y_test = self._get_train_test_split(X, y)\n\nwith context:\nresults = await fit(\nself.estimator,\nself._get_params(),\nX_train,\ny_train,\nX_test,\ny_test,\nfit_params=fit_params,\nscorer=scorer,\nrandom_state=self.random_state,\nverbose=self.verbose,\nprefix=self.prefix,\n)\nresults = self._process_results(results)\nmodel_history, models, history, bst = results\n\ncv_results = self._get_cv_results(history, model_history)\nbest_idx = bst\nbest_estimator = await models[best_idx]\n\n# Clean up models we're hanging onto\nids = list(results.models)\nfor model_id in ids:\ndel results.models[model_id]\n\nself.cv_results_ = cv_results\nself.scorer_ = scorer\nself.history_ = history\nself.model_history_ = model_history\nself.best_estimator_ = best_estimator\nself.best_index_ = best_idx\nself.best_score_ = cv_results[\"test_score\"][best_idx]\nself.best_params_ = cv_results[\"params\"][best_idx]\nself.n_splits_ = 1\n\n# this is always true because adaptive searches need one number to\n# judge model quality. I suppose different models run different metrics\n# at each scoring, but one score is needed to choose the better of two\n# models\nself.multimetric_ = False\nreturn self\n\ndef fit(self, X, y=None, **fit_params):\n\"\"\"Find the best parameters for a particular model.\n\nParameters\n----------\nX, y : array-like\n**fit_params\nAdditional partial fit keyword arguments for the estimator.\n\"\"\"\nclient = default_client()\nif not client.asynchronous:\nreturn client.sync(self._fit, X, y, **fit_params)\nreturn self._fit(X, y, **fit_params)\n\n@if_delegate_has_method(delegate=(\"best_estimator_\", \"estimator\"))\ndef decision_function(self, X):\nself._check_is_fitted(\"decision_function\")\nreturn self.best_estimator_.decision_function(X)\n\n@if_delegate_has_method(delegate=(\"best_estimator_\", \"estimator\"))\ndef transform(self, X):\nself._check_is_fitted(\"transform\")\nreturn self.best_estimator_.transform(X)\n\n@if_delegate_has_method(delegate=(\"best_estimator_\", \"estimator\"))\ndef inverse_transform(self, Xt):\nself._check_is_fitted(\"inverse_transform\")\nreturn self.best_estimator_.transform(Xt)\n\ndef score(self, X, y=None):\nif self.scorer_ is None:\nraise ValueError(\n\"No score function explicitly defined, \"\n\"and the estimator doesn't provide one %s\" % self.best_estimator_\n)\nreturn self.scorer_(self.best_estimator_, X, y)\n\nclass IncrementalSearchCV(BaseIncrementalSearchCV):\n\"\"\"\nIncrementally search for hyper-parameters on models that support partial_fit\n\nThis incremental hyper-parameter optimization class starts training the\nmodel on many hyper-parameters on a small amount of data, and then only\ncontinues training those models that seem to be performing well.\n\nSee the :ref:`User Guide <hyperparameter.incremental>` for more.\n\nParameters\n----------\nestimator : estimator object.\nA object of that type is instantiated for each initial hyperparameter\ncombination. This is assumed to implement the scikit-learn estimator\ninterface. Either estimator needs to provide a `score`` function,\nor ``scoring`` must be passed. The estimator must implement\n``partial_fit``, ``set_params``, and work well with ``clone``.\n\nparameters : dict\nDictionary with parameters names (string) as keys and distributions\nor lists of parameters to try. Distributions must provide a ``rvs``\nmethod for sampling (such as those from scipy.stats.distributions).\nIf a list is given, it is sampled uniformly.\n\nn_initial_parameters : int, default=10\nNumber of parameter settings that are sampled.\nThis trades off runtime vs quality of the solution.\n\nAlternatively, you can set this to ``\"grid\"`` to do a full grid search.\n\ndecay_rate : float, default 1.0\nHow quickly to decrease the number partial future fit calls.\n\n.. deprecated:: v1.4.0\nThis implementation of an adaptive algorithm that uses\n``decay_rate`` has moved to\n\npatience : int, default False\nIf specified, training stops when the score does not increase by\n``tol`` after ``patience`` calls to ``partial_fit``. Off by default.\n\nfits_per_score : int, optional, default=1\nIf ``patience`` is used the maximum number of ``partial_fit`` calls\nbetween ``score`` calls.\n\nscores_per_fit : int, default 1\nIf ``patience`` is used the maximum number of ``partial_fit`` calls\nbetween ``score`` calls.\n\n.. deprecated:: v1.4.0\nRenamed to ``fits_per_score``.\n\ntol : float, default 0.001\nThe required level of improvement to consider stopping training on\nthat model. The most recent score must be at at most ``tol`` better\nthan the all of the previous ``patience`` scores for that model.\nIncreasing ``tol`` will tend to reduce training time, at the cost\nof worse models.\n\nmax_iter : int, default 100\nMaximum number of partial fit calls per model.\n\ntest_size : float\nFraction of the dataset to hold out for computing test scores.\nDefaults to the size of a single partition of the input training set\n\n.. note::\n\nThe training dataset should fit in memory on a single machine.\nAdjust the ``test_size`` parameter as necessary to achieve this.\n\nrandom_state : int, RandomState instance or None, optional, default: None\nIf int, random_state is the seed used by the random number generator;\nIf RandomState instance, random_state is the random number generator;\nIf None, the random number generator is the RandomState instance used\nby `np.random`.\n\nscoring : string, callable, list/tuple, dict or None, default: None\nA single string (see :ref:`scoring_parameter`) or a callable\n(see :ref:`scoring`) to evaluate the predictions on the test set.\n\nFor evaluating multiple metrics, either give a list of (unique) strings\nor a dict with names as keys and callables as values.\n\nNOTE that when using custom scorers, each scorer should return a single\nvalue. Metric functions returning a list/array of values can be wrapped\ninto multiple scorers that return one value each.\n\nSee :ref:`multimetric_grid_search` for an example.\n\nIf None, the estimator's default scorer (if available) is used.\n\nverbose : bool, float, int, optional, default: False\nIf False (default), don't print logs (or pipe them to stdout). However,\nstandard logging will still be used.\n\nIf True, print logs and use standard logging.\n\nIf float, print/log approximately ``verbose`` fraction of the time.\n\nprefix : str, optional, default=\"\"\nWhile logging, add ``prefix`` to each message.\n\nAttributes\n----------\ncv_results_ : dict of np.ndarrays\nThis dictionary has keys\n\n* ``mean_partial_fit_time``\n* ``mean_score_time``\n* ``std_partial_fit_time``\n* ``std_score_time``\n* ``test_score``\n* ``rank_test_score``\n* ``model_id``\n* ``partial_fit_calls``\n* ``params``\n* ``param_{key}``, where ``key`` is every key in ``params``.\n\nThe values in the ``test_score`` key correspond to the last score a model\nreceived on the hold out dataset. The key ``model_id`` corresponds with\n``history_``. This dictionary can be imported into Pandas.\n\nmodel_history_ : dict of lists of dict\nA dictionary of each models history. This is a reorganization of\n``history_``: the same information is present but organized per model.\n\nThis data has the structure ``{model_id: hist}`` where ``hist`` is a\nsubset of ``history_`` and ``model_id`` are model identifiers.\n\nhistory_ : list of dicts\nInformation about each model after each ``partial_fit`` call. Each dict\nthe keys\n\n* ``partial_fit_time``\n* ``score_time``\n* ``score``\n* ``model_id``\n* ``params``\n* ``partial_fit_calls``\n* ``elapsed_wall_time``\n\nThe key ``model_id`` corresponds to the ``model_id`` in ``cv_results_``.\nThis list of dicts can be imported into Pandas.\n\nbest_estimator_ : BaseEstimator\nThe model with the highest validation score among all the models\nretained by the \"inverse decay\" algorithm.\n\nbest_score_ : float\nScore achieved by ``best_estimator_`` on the vaidation set after the\nfinal call to ``partial_fit``.\n\nbest_index_ : int\nIndex indicating which estimator in ``cv_results_`` corresponds to\nthe highest score.\n\nbest_params_ : dict\nDictionary of best parameters found on the hold-out data.\n\nscorer_ :\nThe function used to score models, which has a call signature of\n``scorer_(estimator, X, y)``.\n\nn_splits_ : int\nNumber of cross validation splits.\n\nmultimetric_ : bool\nWhether this cross validation search uses multiple metrics.\n\nExamples\n--------\nConnect to the client and create the data\n\n>>> client = Client()\n>>> import numpy as np\n>>> X, y = make_classification(n_samples=5000000, n_features=20,\n... chunks=100000, random_state=0)\n\nOur underlying estimator is an SGDClassifier. We specify a few parameters\ncommon to each clone of the estimator.\n\n>>> from sklearn.linear_model import SGDClassifier\n>>> model = SGDClassifier(tol=1e-3, penalty='elasticnet', random_state=0)\n\nThe distribution of parameters we'll sample from.\n\n>>> params = {'alpha': np.logspace(-2, 1, num=1000),\n... 'l1_ratio': np.linspace(0, 1, num=1000),\n... 'average': [True, False]}\n\n>>> search = IncrementalSearchCV(model, params, random_state=0)\n>>> search.fit(X, y, classes=[0, 1])\nIncrementalSearchCV(...)\n\nbut stop those that don't seem to improve with more data.\n\n>>> search = IncrementalSearchCV(model, params, random_state=0,\n... n_initial_parameters=1000,\n... patience=20, max_iter=100)\n\nOften, additional training leads to little or no gain in scores at the\nend of training. In these cases, stopping training is beneficial because\nthere's no gain from more training and less computation is required. Two\nparameters control detecting \"little or no gain\": ``patience`` and ``tol``.\nTraining continues if at least one score is more than ``tol`` above\nthe other scores in the most recent ``patience`` calls to\n``model.partial_fit``.\n\nFor example, setting ``tol=0`` and ``patience=2`` means training will stop\nafter two consecutive calls to ``model.partial_fit`` without improvement,\nor when ``max_iter`` total calls to ``model.parital_fit`` are reached.\n\n\"\"\"\n\ndef __init__(\nself,\nestimator,\nparameters,\nn_initial_parameters=10,\ndecay_rate=no_default,\ntest_size=None,\npatience=False,\ntol=0.001,\nfits_per_score=1,\nmax_iter=100,\nrandom_state=None,\nscoring=None,\nverbose=False,\nprefix=\"\",\nscores_per_fit=None,\n):\n\nself.n_initial_parameters = n_initial_parameters\nself.decay_rate = decay_rate\nself.fits_per_score = fits_per_score\nself.scores_per_fit = scores_per_fit\n\nsuper(IncrementalSearchCV, self).__init__(\nestimator,\nparameters,\ntest_size=test_size,\nrandom_state=random_state,\nscoring=scoring,\nmax_iter=max_iter,\npatience=patience,\ntol=tol,\nverbose=verbose,\nprefix=prefix,\n)\n\ndef _decay_deprecated(self):\nreturn True\n\ndef fit(self, X, y=None, **fit_params):\nif self._decay_deprecated():\nif self.decay_rate is no_default:\nwarn(\n\"decay_rate has been deprecated since Dask-ML v1.4.0.\\n\\n\"\n\" * Use InverseDecaySearchCV to use `decay_rate`\\n\"\n\" * Specify decay_rate=None\\n\\n\",\nFutureWarning,\n)\nelif self.decay_rate is not None:\nwarn(\n\"decay_rate is deprecated in InverseDecaySearchCV. \"\nf\"Use InverseDecaySearchCV to use decay_rate={self.decay_rate}\",\nFutureWarning,\n)\nif self.scores_per_fit is not None and self.fits_per_score != 1:\nmsg = \"Specify fits_per_score, not scores_per_fit\"\nraise ValueError(msg)\n\nif self.scores_per_fit:\nself.fits_per_score = self.scores_per_fit\nwarn(\n\"scores_per_fit has been deprecated since Dask-ML v1.4.0. \"\n)\nreturn super(IncrementalSearchCV, self).fit(X, y=y, **fit_params)\n\ndef _get_params(self):\nif self.n_initial_parameters == \"grid\":\nreturn ParameterGrid(self.parameters)\nelse:\nreturn ParameterSampler(\nself.parameters,\nself.n_initial_parameters,\nrandom_state=self.random_state,\n)\n\nif not isinstance(self.patience, int):\nmsg = (\n\"patience must be an integer (or a subclass like boolean), \"\n\"not patience={} of type {}\"\n)\nraise ValueError(msg.format(self.patience, type(self.patience)))\nif self.patience and self.patience <= 1: # patience=0 => don't use patience\nraise ValueError(\n\"patience={}<=1 will always detect a plateau. \"\n\"To resolve this,\\n\\n * set patience >= 2\"\n)\n\ncalls = {k: v[-1][\"partial_fit_calls\"] for k, v in info.items()}\n\nif self.patience and max(calls.values()) > 1:\ncalls_so_far = {k: v[-1][\"partial_fit_calls\"] for k, v in info.items()}\nk: [\n][-1]\nfor k, v in info.items()\n}\n\ncalls_to_make = {k: adapt_calls[k] - calls_so_far[k] for k in calls}\nif sum(calls_to_make.values()) > 0:\nout = self._stop_on_plateau(calls_to_make, info)\nreturn {k: min(v, int(self.patience)) for k, v in out.items()}\n\nif self.patience:\nfor ident, calls in instructions.items():\n\nout = self._stop_on_plateau(instructions, info)\n\nif self.patience:\nreturn {k: min(v, int(self.patience)) for k, v in out.items()}\nreturn out\n\nreturn {k: self.fits_per_score for k in info}\n\ndef _stop_on_plateau(self, instructions, info):\n# Second, stop on plateau if any models have already converged\nout = {}\nfor k, steps in instructions.items():\nrecords = info[k]\ncurrent_calls = records[-1][\"partial_fit_calls\"]\nif self.max_iter and current_calls >= self.max_iter:\nout[k] = 0\nelif self.patience and current_calls >= self.patience:\nplateau = [\nh[\"score\"]\nfor h in records\nif current_calls - h[\"partial_fit_calls\"] <= self.patience\n]\ndiffs = np.array(plateau[1:]) - plateau\nif (self.tol is not None) and diffs.max() <= self.tol:\nout[k] = 0\nelse:\nout[k] = steps\n\nelse:\nout[k] = steps\nreturn out\n\nclass InverseDecaySearchCV(IncrementalSearchCV):\n\"\"\"\nIncrementally search for hyper-parameters on models that support partial_fit\n\nThis incremental hyper-parameter optimization class starts training the\nmodel on many hyper-parameters on a small amount of data, and then only\ncontinues training those models that seem to be performing well.\n\nThis class will decay the number of parameters over time. At time step\n``k``, this class will retain ``1 / (k + 1)`` fraction of the highest\nperforming models.\n\nParameters\n----------\nestimator : estimator object.\nA object of that type is instantiated for each initial hyperparameter\ncombination. This is assumed to implement the scikit-learn estimator\ninterface. Either estimator needs to provide a `score`` function,\nor ``scoring`` must be passed. The estimator must implement\n``partial_fit``, ``set_params``, and work well with ``clone``.\n\nparameters : dict\nDictionary with parameters names (string) as keys and distributions\nor lists of parameters to try. Distributions must provide a ``rvs``\nmethod for sampling (such as those from scipy.stats.distributions).\nIf a list is given, it is sampled uniformly.\n\nn_initial_parameters : int, default=10\nNumber of parameter settings that are sampled.\nThis trades off runtime vs quality of the solution.\n\nAlternatively, you can set this to ``\"grid\"`` to do a full grid search.\n\npatience : int, default False\nIf specified, training stops when the score does not increase by\n``tol`` after ``patience`` calls to ``partial_fit``. Off by default.\n\nfits_per_scores : int, optional, default=1\nIf ``patience`` is used the maximum number of ``partial_fit`` calls\nbetween ``score`` calls.\n\nscores_per_fit : int, default 1\nIf ``patience`` is used the maximum number of ``partial_fit`` calls\nbetween ``score`` calls.\n\ntol : float, default 0.001\nThe required level of improvement to consider stopping training on\nthat model. The most recent score must be at at most ``tol`` better\nthan the all of the previous ``patience`` scores for that model.\nIncreasing ``tol`` will tend to reduce training time, at the cost\nof worse models.\n\nmax_iter : int, default 100\nMaximum number of partial fit calls per model.\n\ntest_size : float\nFraction of the dataset to hold out for computing test scores.\nDefaults to the size of a single partition of the input training set\n\n.. note::\n\nThe training dataset should fit in memory on a single machine.\nAdjust the ``test_size`` parameter as necessary to achieve this.\n\nrandom_state : int, RandomState instance or None, optional, default: None\nIf int, random_state is the seed used by the random number generator;\nIf RandomState instance, random_state is the random number generator;\nIf None, the random number generator is the RandomState instance used\nby `np.random`.\n\nscoring : string, callable, list/tuple, dict or None, default: None\nA single string (see :ref:`scoring_parameter`) or a callable\n(see :ref:`scoring`) to evaluate the predictions on the test set.\n\nFor evaluating multiple metrics, either give a list of (unique) strings\nor a dict with names as keys and callables as values.\n\nNOTE that when using custom scorers, each scorer should return a single\nvalue. Metric functions returning a list/array of values can be wrapped\ninto multiple scorers that return one value each.\n\nSee :ref:`multimetric_grid_search` for an example.\n\nIf None, the estimator's default scorer (if available) is used.\n\nverbose : bool, float, int, optional, default: False\nIf False (default), don't print logs (or pipe them to stdout). However,\nstandard logging will still be used.\n\nIf True, print logs and use standard logging.\n\nIf float, print/log approximately ``verbose`` fraction of the time.\n\nprefix : str, optional, default=\"\"\nWhile logging, add ``prefix`` to each message.\n\ndecay_rate : float, default 1.0\nHow quickly to decrease the number partial future fit calls.\nHigher `decay_rate` will result in lower training times, at the cost\nof worse models.\n\nThe default ``decay_rate=1.0`` is chosen because it has some theoritical\nmotivation _.\n\nAttributes\n----------\ncv_results_ : dict of np.ndarrays\nThis dictionary has keys\n\n* ``mean_partial_fit_time``\n* ``mean_score_time``\n* ``std_partial_fit_time``\n* ``std_score_time``\n* ``test_score``\n* ``rank_test_score``\n* ``model_id``\n* ``partial_fit_calls``\n* ``params``\n* ``param_{key}``, where ``key`` is every key in ``params``.\n\nThe values in the ``test_score`` key correspond to the last score a model\nreceived on the hold out dataset. The key ``model_id`` corresponds with\n``history_``. This dictionary can be imported into Pandas.\n\nmodel_history_ : dict of lists of dict\nA dictionary of each models history. This is a reorganization of\n``history_``: the same information is present but organized per model.\n\nThis data has the structure ``{model_id: hist}`` where ``hist`` is a\nsubset of ``history_`` and ``model_id`` are model identifiers.\n\nhistory_ : list of dicts\nInformation about each model after each ``partial_fit`` call. Each dict\nthe keys\n\n* ``partial_fit_time``\n* ``score_time``\n* ``score``\n* ``model_id``\n* ``params``\n* ``partial_fit_calls``\n* ``elapsed_wall_time``\n\nThe key ``model_id`` corresponds to the ``model_id`` in ``cv_results_``.\nThis list of dicts can be imported into Pandas.\n\nbest_estimator_ : BaseEstimator\nThe model with the highest validation score among all the models\nretained by the \"inverse decay\" algorithm.\n\nbest_score_ : float\nScore achieved by ``best_estimator_`` on the vaidation set after the\nfinal call to ``partial_fit``.\n\nbest_index_ : int\nIndex indicating which estimator in ``cv_results_`` corresponds to\nthe highest score.\n\nbest_params_ : dict\nDictionary of best parameters found on the hold-out data.\n\nscorer_ :\nThe function used to score models, which has a call signature of\n``scorer_(estimator, X, y)``.\n\nn_splits_ : int\nNumber of cross validation splits.\n\nmultimetric_ : bool\nWhether this cross validation search uses multiple metrics.\n\nNotes\n-----\nWhen ``decay_rate==1``, this class approximates the\nnumber of ``partial_fit`` calls that :class:`SuccesiveHalvingSearchCV`\nperforms. If ``n_initial_parameters`` is configured properly with\n``decay_rate=1``, it's possible this class will mirror the most aggressive\nbracket of :class:`HyperbandSearchCV`. This might yield good results\nand/or find good models, but is untested.\n\nReferences\n----------\n.. Li, L., Jamieson, K., DeSalvo, G., Rostamizadeh, A., & Talwalkar, A.\n(2017). Hyperband: A novel bandit-based approach to hyperparameter\noptimization. The Journal of Machine Learning Research, 18(1),\n6765-6816. http://www.jmlr.org/papers/volume18/16-558/16-558.pdf\n\n\"\"\"\n\ndef __init__(\nself,\nestimator,\nparameters,\nn_initial_parameters=10,\ntest_size=None,\npatience=False,\ntol=0.001,\nfits_per_score=1,\nmax_iter=100,\nrandom_state=None,\nscoring=None,\nverbose=False,\nprefix=\"\",\ndecay_rate=1.0,\n):\nself.decay_rate = decay_rate\nsuper(InverseDecaySearchCV, self).__init__(\nestimator,\nparameters,\nn_initial_parameters=n_initial_parameters,\ntest_size=test_size,\npatience=patience,\ntol=tol,\nfits_per_score=fits_per_score,\nmax_iter=max_iter,\nrandom_state=random_state,\nscoring=scoring,\nverbose=verbose,\nprefix=prefix,\ndecay_rate=decay_rate,\n)\n\ndef _decay_deprecated(self):\nreturn False\n\n# First, have an adaptive algorithm\nif self.n_initial_parameters == \"grid\":\nstart = len(ParameterGrid(self.parameters))\nelse:\nstart = self.n_initial_parameters\n\ndef inverse(time):\n\"\"\" Decrease target number of models inversely with time \"\"\"\nreturn int(start / (1 + time) ** self.decay_rate)\n\nexample = toolz.first(info.values())\ntime_step = example[-1][\"partial_fit_calls\"]\n\ncurrent_time_step = time_step + 1\nnext_time_step = current_time_step\n\nif inverse(current_time_step) == 0:\n# we'll never get out of here\nnext_time_step = 1\n\nwhile inverse(current_time_step) == inverse(next_time_step) and (\nself.decay_rate\nand not self.patience\nor next_time_step - current_time_step < self.fits_per_score\n):\nnext_time_step += 1\n\ntarget = max(1, inverse(next_time_step))\nbest = toolz.topk(target, info, key=lambda k: info[k][-1][\"score\"])\n\nif len(best) == 1:\n[best] = best\nreturn {best: 0}\nsteps = next_time_step - current_time_step\ninstructions = {b: steps for b in best}\nreturn instructions\n```"
] | [
null
] | {"ft_lang_label":"__label__en","ft_lang_prob":0.61647564,"math_prob":0.9415155,"size":38979,"snap":"2021-04-2021-17","text_gpt3_token_len":9352,"char_repetition_ratio":0.15358563,"word_repetition_ratio":0.37014276,"special_character_ratio":0.27879113,"punctuation_ratio":0.21571808,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9922399,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2021-01-27T16:05:55Z\",\"WARC-Record-ID\":\"<urn:uuid:555ab1e3-447f-497e-8606-2520e25d2250>\",\"Content-Length\":\"122436\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:58fb216e-cc86-499d-a354-ab67e2f1d78b>\",\"WARC-Concurrent-To\":\"<urn:uuid:2e1ce6f7-786e-496b-94bb-b432a8c4c806>\",\"WARC-IP-Address\":\"172.67.71.73\",\"WARC-Target-URI\":\"https://www.programcreek.com/python/?code=dask%2Fdask-ml%2Fdask-ml-master%2Fdask_ml%2Fmodel_selection%2F_incremental.py\",\"WARC-Payload-Digest\":\"sha1:6E66265NMNL7ZSVQN3XFR7VEVLA4IFMX\",\"WARC-Block-Digest\":\"sha1:XB4MPPTL3V6D25BJBWO6TUVLHIA2PCSU\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2021/CC-MAIN-2021-04/CC-MAIN-2021-04_segments_1610704828358.86_warc_CC-MAIN-20210127152334-20210127182334-00775.warc.gz\"}"} |
https://escholarship.org/uc/item/96d1f81q | [
"On sequences of finitely generated discrete groups",
null,
"Open Access Publications from the University of California\n\n## On sequences of finitely generated discrete groups\n\n• Author(s): Kapovich, Michael\n• et al.\n\n## Published Web Location\n\nhttps://arxiv.org/pdf/0708.2671.pdf\nNo data is associated with this publication.\nAbstract\n\nWe consider sequences of finitely generated discrete subgroups Gamma_i=rho_i(Gamma) of a rank 1 Lie group G, where the representations rho_i are not necessarily faithful. We show that, for algebraically convergent sequences (Gamma_i), unless Gamma_i's are (eventually) elementary or contain normal finite subgroups of arbitrarily high order, their algebraic limit is a discrete nonelementary subgroup of G. In the case of divergent sequences (Gamma_i) we show that the limiting action on a real tree T satisfies certain semistability condition, which generalizes the notion of stability introduced by Rips. We then verify that the group Gamma splits as an amalgam or HNN extension of finitely generated groups, so that the edge group has an amenable image in the isometry group of T.\n\nItem not freely available? Link broken?\nReport a problem accessing this item"
] | [
null,
"https://escholarship.org/images/logo_eschol-mobile.svg",
null
] | {"ft_lang_label":"__label__en","ft_lang_prob":0.85717416,"math_prob":0.58575785,"size":941,"snap":"2021-31-2021-39","text_gpt3_token_len":211,"char_repetition_ratio":0.12166489,"word_repetition_ratio":0.014925373,"special_character_ratio":0.19872476,"punctuation_ratio":0.10493827,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.95622945,"pos_list":[0,1,2],"im_url_duplicate_count":[null,null,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2021-08-04T10:46:42Z\",\"WARC-Record-ID\":\"<urn:uuid:4ad6eedc-457b-40d6-8d9d-6114e099f54c>\",\"Content-Length\":\"47187\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:3c391501-5ae8-46d3-9dcb-67a9dd29800f>\",\"WARC-Concurrent-To\":\"<urn:uuid:e9e3ed58-d6c1-4fa4-9156-aa8c80cd20f8>\",\"WARC-IP-Address\":\"99.84.189.73\",\"WARC-Target-URI\":\"https://escholarship.org/uc/item/96d1f81q\",\"WARC-Payload-Digest\":\"sha1:47HMIYHGKK3VQN7FOCEUZGTLXYNTDUZL\",\"WARC-Block-Digest\":\"sha1:SGYXMNPFHVUKVRT2O2P4CK26YVF4LZXR\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2021/CC-MAIN-2021-31/CC-MAIN-2021-31_segments_1627046154798.45_warc_CC-MAIN-20210804080449-20210804110449-00611.warc.gz\"}"} |
https://www.bartleby.com/solution-answer/chapter-21-problem-48e-finite-mathematics-and-applied-calculus-mindtap-course-list-7th-edition/9781337274203/what-can-you-say-about-the-graph-of-fxax2bxc-if-c0/1703e1de-5bfd-11e9-8385-02ee952b546e | [
"",
null,
"",
null,
"",
null,
"Chapter 2.1, Problem 48E",
null,
"Finite Mathematics and Applied Cal...\n\n7th Edition\nStefan Waner + 1 other\nISBN: 9781337274203\n\nSolutions\n\nChapter\nSection",
null,
"Finite Mathematics and Applied Cal...\n\n7th Edition\nStefan Waner + 1 other\nISBN: 9781337274203\nTextbook Problem\n\nWhat can you say about the graph of f ( x ) = a x 2 + b x + c if c = 0 ?\n\nTo determine\n\nThe nature of the graph of function f(x)=ax2+bx+c if c=0.\n\nExplanation\n\nGiven Information:\n\nThe provided function,\n\nf(x)=ax2+bx+c\n\nConsider the function,\n\nf(x)=ax2+bx+c\n\nThe equation form is y=ax2+bx+c. Which is the equation of parabola.\n\nIn the above equation, c is the y-intercept\n\nStill sussing out bartleby?\n\nCheck out a sample textbook solution.\n\nSee a sample solution\n\nThe Solution to Your Study Problems\n\nBartleby provides explanations to thousands of textbook problems written by our experts, many with advanced degrees!\n\nGet Started\n\nInequalities Solve the inequality graphically. 146. |x2 16| 10 0\n\nPrecalculus: Mathematics for Calculus (Standalone Book)\n\nFind the derivative of the function. y=cos(1e2x1+e2x)\n\nSingle Variable Calculus: Early Transcendentals, Volume I\n\nIn Exercises 29-34, rationalize the denominator of each expression. 30. 1x+5\n\nApplied Calculus for the Managerial, Life, and Social Sciences: A Brief Approach\n\nTrue or False: is a convergent series.\n\nStudy Guide for Stewart's Multivariable Calculus, 8th",
null,
""
] | [
null,
"https://www.bartleby.com/static/search-icon-white.svg",
null,
"https://www.bartleby.com/static/close-grey.svg",
null,
"https://www.bartleby.com/static/solution-list.svg",
null,
"https://www.bartleby.com/isbn_cover_images/9781337274203/9781337274203_largeCoverImage.gif",
null,
"https://www.bartleby.com/isbn_cover_images/9781337274203/9781337274203_largeCoverImage.gif",
null,
"https://www.bartleby.com/static/logo.svg",
null
] | {"ft_lang_label":"__label__en","ft_lang_prob":0.6594668,"math_prob":0.99033254,"size":1578,"snap":"2019-43-2019-47","text_gpt3_token_len":340,"char_repetition_ratio":0.14930114,"word_repetition_ratio":0.08,"special_character_ratio":0.15779468,"punctuation_ratio":0.101321585,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9990914,"pos_list":[0,1,2,3,4,5,6,7,8,9,10,11,12],"im_url_duplicate_count":[null,null,null,null,null,null,null,null,null,null,null,null,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2019-10-23T19:00:21Z\",\"WARC-Record-ID\":\"<urn:uuid:7dce0e8b-ec93-43c5-8e0b-b861fdd7d523>\",\"Content-Length\":\"574005\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:b0d7d910-f07f-42c6-84c4-cf32519b19a3>\",\"WARC-Concurrent-To\":\"<urn:uuid:7950bfdb-a562-4379-961c-76954713464a>\",\"WARC-IP-Address\":\"99.84.181.97\",\"WARC-Target-URI\":\"https://www.bartleby.com/solution-answer/chapter-21-problem-48e-finite-mathematics-and-applied-calculus-mindtap-course-list-7th-edition/9781337274203/what-can-you-say-about-the-graph-of-fxax2bxc-if-c0/1703e1de-5bfd-11e9-8385-02ee952b546e\",\"WARC-Payload-Digest\":\"sha1:P6YFCCZI3XBUZFRPN7X75ZRUMARALRBW\",\"WARC-Block-Digest\":\"sha1:4NEWH7AGFBSHKBMV6ZH4AD6BENK3JXNB\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2019/CC-MAIN-2019-43/CC-MAIN-2019-43_segments_1570987835748.66_warc_CC-MAIN-20191023173708-20191023201208-00341.warc.gz\"}"} |
https://wzf2000.top/wzf2000/3047/ | [
"# 线性代数笔记(10)——四个基本子空间的基和维数",
null,
"## 线性代数笔记(10)——四个基本子空间的基和维数\n\n### 四个基本子空间的基和维数\n\n#### 维数公式\n\n$\\Rightarrow W_1 \\cap W_2$ 是 $V$ 的一个子空间(“交”),$W_1 + W_2 = \\{\\alpha_1 + \\alpha_2 | \\alpha_1 \\in W_1,\\alpha_2 \\in W_2\\}$ 也是 $V$ 的子空间(“和”),但 $W_1 \\cup W_2$ 不一定是 $V$ 的子空间。\n\n$$\\dim W_1 + \\dim W_2 = \\dim (W_1 \\cap W_2) + \\dim (W_1 + W_2)$$\n\n#### 另一种找出基的方法\n\n$$PAQ = \\begin{pmatrix} I_r & 0 \\\\ 0 & 0 \\end{pmatrix}, r=r(A)$$\n\n:设 $Q = (Q_1,Q_2),P= \\begin{pmatrix}P_1 \\\\ P_2\\end{pmatrix}$,其中 $Q_1$ 有 $r$ 列。\n$$PAQ_1 = \\begin{pmatrix} I_r \\\\ 0 \\end{pmatrix}, PAQ_2 = \\begin{pmatrix} 0 \\\\ 0 \\end{pmatrix} \\\\ P_1AQ = (I_r,0),P_2AQ = (0,0)$$\n$Q_2$ 的列是 $N(A)$ 的基,$P_2$ 的行是 $N(A^T)$ 的基。\n\n$C(A) \\supseteq C(AQ_1)$,又 $\\dim C(A) = r(A) = r$,$\\dim C(AQ_1) = r(AQ_1) = r(A) = \\dim C(A)$。\n\n$\\Rightarrow C(A) = C(AQ_1)$,故 $AQ_1$ 的列是 $C(A)$ 的基。\n\n#### 四个子空间之间的交\n\n$\\Rightarrow C(A^T) \\cap N(A) = \\{\\mathbf{0}\\}$。\n\n#### 子空间的正交\n\n$\\mathbb{R}^n$ 中,设 $S,T$ 都是 $\\mathbb{R}^n$ 的子空间,若 $\\forall \\mathbf{v} \\in S,\\mathbf{w} \\in T$ 都有 $\\mathbf{v}^T \\mathbf{w} = 0$,称 $S$ 与 $T$ 正交,记为 $S \\perp T$。\n\n#### 四个子空间的正交性\n\n:利用 $C(A) \\perp N(A^T)$ 和 $\\dim C(A^T) + \\dim N(A) = n$ 可得,$C(A^T) + N(A) = \\mathbb{R}^n$。(可以考虑维数公式)\n\n#### 正交补\n\n$C(A^T) + N(A) = \\mathbb{R}^n,C(A^T) \\perp N(A)$\n\n$C(A) + N(A^T) = \\mathbb{R}^m,C(A) \\perp N(A^T)$"
] | [
null,
"https://wzf2000.top/wp-content/uploads/二次元/狼与香辛料/180916189687.jpg",
null
] | {"ft_lang_label":"__label__zh","ft_lang_prob":0.6157307,"math_prob":1.00001,"size":4166,"snap":"2022-40-2023-06","text_gpt3_token_len":2577,"char_repetition_ratio":0.21984623,"word_repetition_ratio":0.0064620357,"special_character_ratio":0.49975997,"punctuation_ratio":0.032467533,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":1.0000099,"pos_list":[0,1,2],"im_url_duplicate_count":[null,2,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2022-10-04T23:30:31Z\",\"WARC-Record-ID\":\"<urn:uuid:2c6e22bf-068b-47cc-898e-41a761f56855>\",\"Content-Length\":\"90293\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:0f4f4fab-ff9b-45c0-a758-88756dc74662>\",\"WARC-Concurrent-To\":\"<urn:uuid:eccee74f-95bc-41ac-89f6-ef5d5970efd2>\",\"WARC-IP-Address\":\"101.43.216.60\",\"WARC-Target-URI\":\"https://wzf2000.top/wzf2000/3047/\",\"WARC-Payload-Digest\":\"sha1:TNKV4G5XAV24TCBDFG6A76N3G67QB3ZI\",\"WARC-Block-Digest\":\"sha1:GCUXTPEHBCDQMGLENPDFGWO4NXT6TDFR\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2022/CC-MAIN-2022-40/CC-MAIN-2022-40_segments_1664030337529.69_warc_CC-MAIN-20221004215917-20221005005917-00170.warc.gz\"}"} |
https://www.geteasysolution.com/x*0.65=5000 | [
"# x*0.65=5000\n\n## Simple and best practice solution for x*0.65=5000 equation. Check how easy it is, and learn it for the future. Our solution is simple, and easy to understand, so dont hesitate to use it as a solution of your homework.\n\nIf it's not what You are looking for type in the equation solver your own equation and let us solve it.\n\n## Solution for x*0.65=5000 equation:\n\nx*0.65=5000\nWe move all terms to the left:\nx*0.65-(5000)=0\nWy multiply elements\n0.65x-5000=0\nWe move all terms containing x to the left, all other terms to the right\n0.65x=5000\nx=5000/0.65\nx=7692+0.19999999999982/0.65\n\n`"
] | [
null
] | {"ft_lang_label":"__label__en","ft_lang_prob":0.6547125,"math_prob":0.9974501,"size":803,"snap":"2023-14-2023-23","text_gpt3_token_len":448,"char_repetition_ratio":0.16145182,"word_repetition_ratio":0.0,"special_character_ratio":0.7098381,"punctuation_ratio":0.08294931,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.99929744,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2023-04-01T00:24:23Z\",\"WARC-Record-ID\":\"<urn:uuid:c6b8bcba-df58-4350-8676-5875af8ae098>\",\"Content-Length\":\"20050\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:5b8bce2d-da94-4c94-b922-ad268b4baf83>\",\"WARC-Concurrent-To\":\"<urn:uuid:d5fc1775-c95d-4ab7-ac27-983a7e8d67a9>\",\"WARC-IP-Address\":\"51.91.60.1\",\"WARC-Target-URI\":\"https://www.geteasysolution.com/x*0.65=5000\",\"WARC-Payload-Digest\":\"sha1:Q7HZW4Q4HVNOLTW76TTPDAF5HDORMFPO\",\"WARC-Block-Digest\":\"sha1:I5GE6HHLEACJRDLHNRIQWBKWCUC3USOS\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2023/CC-MAIN-2023-14/CC-MAIN-2023-14_segments_1679296949694.55_warc_CC-MAIN-20230401001704-20230401031704-00663.warc.gz\"}"} |
https://www.algebrapracticeproblems.com/adding-polynomials/ | [
"On this post you will find the explanation of how to do the addition of polynomials. Also, you will see examples of sums of polynomials and even exercises solved step by step. Finally, we also explain what are the properties of this type of operation with polynomials.\n\nTo add two or more polynomials, add the terms of the polynomials that are like terms. That is, the addition of polynomials consists of adding the terms that have the same variables and the same exponents.\n\nThus, an addition of polynomials can be done with two different methods: the horizontal method or the vertical method. Here is an explanation of both procedures.\n\nLet’s see how to do an addition of polynomials with the horizontal method solving an example:\n\n• Find the sum of the following two polynomials:",
null,
"",
null,
"First of all, we have to place the two polynomials in the same operation, in other words, one polynomial after another:\n\nAnd now we add the terms that have the same variables (letters) with the same exponents. Terms that are not like terms cannot be added.\n\nSo the result of the addition of polynomials is:\n\nWe have just seen how to add polynomials horizontally, but now we are going to see the other method that there is to do an addition of polynomials: adding polynomials vertically. And so that you can see the differences between the two methods, we will add the same polynomials as in the previous example:\n\n• Add the following two polynomials:",
null,
"",
null,
"The first thing we must do is place one polynomial below another, so that the like terms of the two polynomials are aligned by columns:\n\nNote: if a polynomial does not have a term of a certain degree, we must leave a blank space. For example, the polynomial",
null,
"does not have a monomial of second degree, so there is a blank space in its place.\n\nOnce we have arranged all the terms from highest to lowest degree, we add the coefficients of each column, keeping the variables and exponents the same:\n\nTherefore, the result obtained from the addition of the 2 polynomials is:",
null,
"As you can see, we have obtained the same result with both methods, so when you do an addition of polynomials you can use the method you prefer.\n\n## Practice problems on adding polynomials\n\nWe leave you with several practice problems of additions of polynomials. If you have any questions, you can ask them below in the comments.\n\n### Problem 1",
null,
"",
null,
"In this case, we will add the two polynomials vertically. To do this, we order the polynomials by degree and add the terms in the same column:\n\n### Problem 2\n\nSolve the addition of the following two polynomials:",
null,
"",
null,
"We will do the sum of the two polynomials using the vertical method. So we order the polynomials by degree and add the terms in the same column:\n\nNote that in this particular case we must leave an empty space in the second degree column of the second polynomial, because it does not have a second degree term.\n\n### Problem 3\n\nSimplify the following addition of two polynomials:",
null,
"",
null,
"We will add the two polynomials using the vertical method. Therefore:\n\n### Problem 4",
null,
"",
null,
"",
null,
"We will calculate the addition of the 3 polynomials using the vertical method. So we put the polynomials ordered by degree and add the terms that are in the same column:\n\n## Properties of the addition of polynomials\n\nThe addition of polynomials has the following characteristics:\n\n• Associative property: when 3 or more polynomials are added, it does not matter how the polynomials are grouped, since the result is always the same. That is, the following equation is true:",
null,
"• Commutative property: in the sum of polynomials the order of the addends does not alter the result of the sum.",
null,
"• Neutral element: logically, adding a polynomial plus the zero polynomial is equivalent to the first polynomial.",
null,
"• Opposite element: the result of adding any polynomial plus its opposite polynomial is always null.",
null,
"Scroll to Top"
] | [
null,
"https://www.algebrapracticeproblems.com/wp-content/ql-cache/quicklatex.com-264d22d516101e25fb925d1fe4b524aa_l3.svg",
null,
"https://www.algebrapracticeproblems.com/wp-content/ql-cache/quicklatex.com-b4a53a3b83ce8a11dc9bb8f292e15feb_l3.svg",
null,
"https://www.algebrapracticeproblems.com/wp-content/ql-cache/quicklatex.com-264d22d516101e25fb925d1fe4b524aa_l3.svg",
null,
"https://www.algebrapracticeproblems.com/wp-content/ql-cache/quicklatex.com-acb105ef724b039d6d3c2d6b93dbfa1f_l3.svg",
null,
"https://www.algebrapracticeproblems.com/wp-content/ql-cache/quicklatex.com-5b37a06736ec9fcd1801c7cb5ad24f09_l3.svg",
null,
"https://www.algebrapracticeproblems.com/wp-content/ql-cache/quicklatex.com-a71c6b404b3aa3514fffdcdddc6f38a0_l3.svg",
null,
"https://www.algebrapracticeproblems.com/wp-content/ql-cache/quicklatex.com-2f5d17416b694ebf9d0cb4f5f107a998_l3.svg",
null,
"https://www.algebrapracticeproblems.com/wp-content/ql-cache/quicklatex.com-4fc22be620564e57c2f9207320fd41cd_l3.svg",
null,
"https://www.algebrapracticeproblems.com/wp-content/ql-cache/quicklatex.com-f4c5331ed9273e47d82a52ba4da47491_l3.svg",
null,
"https://www.algebrapracticeproblems.com/wp-content/ql-cache/quicklatex.com-48af3490ece81004ac6d7729918c732c_l3.svg",
null,
"https://www.algebrapracticeproblems.com/wp-content/ql-cache/quicklatex.com-9703e6ce0eeb121bd722a00b48bfff89_l3.svg",
null,
"https://www.algebrapracticeproblems.com/wp-content/ql-cache/quicklatex.com-087f73a775f0bf1b502a4354b03f3828_l3.svg",
null,
"https://www.algebrapracticeproblems.com/wp-content/ql-cache/quicklatex.com-611c693143b665c8d307d9ba0b1a2eeb_l3.svg",
null,
"https://www.algebrapracticeproblems.com/wp-content/ql-cache/quicklatex.com-c599ad5ad0bc142b89c509cdc3bc668a_l3.svg",
null,
"https://www.algebrapracticeproblems.com/wp-content/ql-cache/quicklatex.com-0b8caa8a6a8144b2334eac6af8c0bf38_l3.svg",
null,
"https://www.algebrapracticeproblems.com/wp-content/ql-cache/quicklatex.com-c97a09a5bba9b27b54dbf81eaba17603_l3.svg",
null,
"https://www.algebrapracticeproblems.com/wp-content/ql-cache/quicklatex.com-872541a7537e674196870a123176252c_l3.svg",
null,
"https://www.algebrapracticeproblems.com/wp-content/ql-cache/quicklatex.com-651e61ff383c9f6af1e4c5741c3bde60_l3.svg",
null,
"https://www.algebrapracticeproblems.com/wp-content/ql-cache/quicklatex.com-318bc124901b39576fc10320379b6b62_l3.svg",
null
] | {"ft_lang_label":"__label__en","ft_lang_prob":0.9199243,"math_prob":0.9609614,"size":3960,"snap":"2021-43-2021-49","text_gpt3_token_len":833,"char_repetition_ratio":0.23887765,"word_repetition_ratio":0.080763586,"special_character_ratio":0.19621213,"punctuation_ratio":0.10171731,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9991604,"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],"im_url_duplicate_count":[null,6,null,3,null,6,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,6,null,3,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2021-10-25T11:45:24Z\",\"WARC-Record-ID\":\"<urn:uuid:8c74fd8d-9213-4f7e-897d-ec0514c6f80b>\",\"Content-Length\":\"146212\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:507f7624-2650-485c-af2a-939f28657206>\",\"WARC-Concurrent-To\":\"<urn:uuid:f0b16908-f632-44b1-8600-51722fe4e98c>\",\"WARC-IP-Address\":\"35.214.234.5\",\"WARC-Target-URI\":\"https://www.algebrapracticeproblems.com/adding-polynomials/\",\"WARC-Payload-Digest\":\"sha1:KPM23AAOSMKTQX5ADFQFAWH2SKSPBO37\",\"WARC-Block-Digest\":\"sha1:4R7QAMKFCJMN4AVDEJ6CQ2SDAXNF4MNC\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2021/CC-MAIN-2021-43/CC-MAIN-2021-43_segments_1634323587659.72_warc_CC-MAIN-20211025092203-20211025122203-00000.warc.gz\"}"} |
http://slideplayer.com/slide/7989103/ | [
"",
null,
"# Objective: Learn to write fractions in simplest form.\n\n## Presentation on theme: \"Objective: Learn to write fractions in simplest form.\"— Presentation transcript:\n\nObjective: Learn to write fractions in simplest form.\n\n Take a white paper and fold it in half. Shade half of the paper. How many sides are in total? How much is shaded? What is the fraction? ______________ Now, fold the same paper in 4 parts. How much is shaded our of the total amount of squares? __________________ Now, fold it again in 8 parts and then 16 parts. What fractions do you see? __________\n\n when a and b are whole numbers greater than 0, it is called a fraction. The number on top is called the numerator. The bottom number is called the denominator. 1 ÷ 4 = 1 numerator 4 denominator When 2 fractions represent the same quantity, they are equivalent.\n\n For Example to find two equivalent fractions to 12 16 So, first we are going to multiply… 12 × 2 =24 16 × 2 =32 Then we will divide both numbers and get a smaller equivalent fraction. 12 ÷ 2 = 6 16 ÷ 2= 8 24 and 6 are equivalent to 12 32 8 16\n\n Find 2 equivalent fractions for each fraction. 1. 6 9 2. 25 30 3. 10 12\n\n A fraction is in simplest form or lowest terms when 1 is the only common factor of the numerator and the denominator. For example: 8 ÷ 2 = 4 10 ÷ 2 = 5 10 ÷ 5 = 2 15 ÷ 5= 3 Your Example: Express each fraction in lowest terms. 1. 5 = 2. 30 40 36\n\n Write 2 equivalent fractions for each fraction. 1. 9 12 2. 25 35 3. 16 32 4. 14 20 5. 10 20 Write each fraction in simplest form. 1. 12 20 2. 15 25 3. 24 28 4. 20 80 5. 32 32"
] | [
null,
"http://slideplayer.com/static/blue_design/img/slide-loader4.gif",
null
] | {"ft_lang_label":"__label__en","ft_lang_prob":0.85320807,"math_prob":0.9963532,"size":1599,"snap":"2023-40-2023-50","text_gpt3_token_len":496,"char_repetition_ratio":0.14984326,"word_repetition_ratio":0.01863354,"special_character_ratio":0.36210132,"punctuation_ratio":0.13370474,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9992872,"pos_list":[0,1,2],"im_url_duplicate_count":[null,null,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2023-09-23T03:41:46Z\",\"WARC-Record-ID\":\"<urn:uuid:97df9d62-fd5e-4a23-a345-0fc69c2330b3>\",\"Content-Length\":\"137742\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:f0a7d3c4-7283-4cc6-980f-17fbabd8c624>\",\"WARC-Concurrent-To\":\"<urn:uuid:6d9c42d3-18c2-414f-af8c-bf34f73c8a04>\",\"WARC-IP-Address\":\"138.201.85.222\",\"WARC-Target-URI\":\"http://slideplayer.com/slide/7989103/\",\"WARC-Payload-Digest\":\"sha1:S6HJ3IATYL75J4D2ZTZB6G342UE4L7X2\",\"WARC-Block-Digest\":\"sha1:TCRDX7F3T7MI3XI5ZZYWRO3KANMNCW43\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2023/CC-MAIN-2023-40/CC-MAIN-2023-40_segments_1695233506479.32_warc_CC-MAIN-20230923030601-20230923060601-00623.warc.gz\"}"} |
https://www.ques10.com/p/47535/mechanics-of-solids-question-paper-jun-18-mechan-1/ | [
"0\nMechanics of Solids Question Paper - Jun 18 - Mechanical Engineering (Semester 3) - Jawaharlal Nehru Technological University (JNTUH)\n\n## Mechanics of Solids - Jun 18\n\n### Mechanical Engineering (Semester 3)\n\nTotal marks: 80\nTotal time: 3 Hours\nINSTRUCTIONS\n(1) Question 1 is compulsory.\n(2) Attempt any three from the remaining questions.\n(3) Draw neat diagrams wherever necessary.\n\nPART - A (25MARKS)\n\n1.a. Explain about elasticity and plasticity.\n(2 marks) 00\n\n(3 marks) 00\n\n1.c. draw the S.F.D and B.M.D of cantilever carrying couple (M) at the free end.\n(2 marks) 00\n\n1.d. write the relation between load, shear force and bending moment.\n(3 marks) 00\n\n1.e. What is bending stress? Write pure bending equation.\n(2 marks) 00\n\n1.f. Draw the shear stress distribution for regular, hollow, circular, cross section.\n(3 marks) 00\n\n1.g. what is mohr'scircle of stresses?\n(2 marks) 00\n\n1.h. Discuss in brief various prominent theories of failure.\n(3 marks) 00\n\n1.i. Explain about thin spherical shells?\n(2 marks) 00\n\n1.j. Drive the equations of longitudinal and circumferential stress.\n(3 marks) 00\n\nPART - B (50MARKS)\n\n2. Drive an expression for strain energy stored in body when the load is applied with an impact.\n(10 marks) 00\n\nOR\n\n3.a. The shear stress in a material at a point is given as 50N/mm². Determine the local strain energy per unit volume stored in material due to shear stress. Take modulus of rigidity as 8*10⁴ N/mm².\n(4 marks) 00\n\n3.b. A load 'P' is suspended from two roads as shown in figure 1. The rod AC is of Steel, having a circular c/s 30 mm in daimeter, and an allowable stress of 16MN/m², the road BC is aluminium having diameter 40 mm and allowable stress of 60MN/m². What is the maximum load p which can be suspended from these rods?",
null,
"(6 marks) 00\n\n4. A horizontal beam 10 m long carries u.d.l of 180N/m over its entire span and it adding concentrated load of 200N at the left end. The beam is supported at two points 7m apart, so choose and that each support carries half the total load. Draw S.F.D and B.M.D\n(10 marks) 00\n\nOR\n\n5. Calculate the reaction in the beam shown in the figure2. Draw the SFD and BMD. Determine the location of maximum bending moment and mark it clearly on each of the diagram.",
null,
"(10 marks) 00\n\n6.a. What are the design criteria according to the building and relation between bending moment and section modulus?\n(6 marks) 00\n\n6.b. What is bending stress? What are difference between bending stress and direct stress?\n(4 marks) 00\n\nOR\n\n7. A T-section beam shown in the figure 3 is subjected to a shear force of 9KN at a section. Determine the amount of maximum intensity of shear stress and draw the distribution of the shear Street acrod depth of the section.",
null,
"(10 marks) 00\n\n8. At a point in a strained material the principal stress are 210 N/mm² (tensile) and 120N/mm² (compressive). Determine the following stress on an oblique section incliend at 40° with the axis of the minor principal stress: a) Normal stress b) Shear stress c) Resultant stress (magnitude only) d) Max. shear stress.\n(10 marks) 00\n\nOR\n\n9. A certain type of Steel has yield strength of 270N/mm². At a point in a strained region the principal stresses are +120, +80 and -30N/mm². Determine the factor of safety as per the max. Principal strain theory. Take poisson's ratio is 0.285.\n(10 marks) 00\n\n10. Determine the diameter of a solid shaft which will transmit 300 KW at 250 rpm. The max shear stress should not exceed 30N/mm² and twist should not be more than 1° in a shaft length of 2.0m. Take modulus of rigidity = 1*10 raise to 5 N/mm².\n(5 marks) 00\n\nOR\n\n11. Drive the equation for the circumferential and longitudinal stress included in the thin spherical shells.\n(10 marks) 00\n\n0"
] | [
null,
"https://i.imgur.com/YEAQHh8.png",
null,
"https://i.imgur.com/b3vT8cV.png",
null,
"https://i.imgur.com/6gF93dA.png",
null
] | {"ft_lang_label":"__label__en","ft_lang_prob":0.8516653,"math_prob":0.96133286,"size":3761,"snap":"2020-24-2020-29","text_gpt3_token_len":1009,"char_repetition_ratio":0.14958744,"word_repetition_ratio":0.006051437,"special_character_ratio":0.28157404,"punctuation_ratio":0.12842892,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.977823,"pos_list":[0,1,2,3,4,5,6],"im_url_duplicate_count":[null,2,null,2,null,2,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2020-07-04T18:31:59Z\",\"WARC-Record-ID\":\"<urn:uuid:f64884b0-b2cd-4524-8a25-5298a110d867>\",\"Content-Length\":\"24824\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:3020609c-e63f-4499-b8e3-0b9c6c10de44>\",\"WARC-Concurrent-To\":\"<urn:uuid:cd15ef19-e064-4511-9ea3-bff77bb6d45e>\",\"WARC-IP-Address\":\"104.31.92.239\",\"WARC-Target-URI\":\"https://www.ques10.com/p/47535/mechanics-of-solids-question-paper-jun-18-mechan-1/\",\"WARC-Payload-Digest\":\"sha1:GRNUSV3JALF4NIYFOPYABR6N7W5GSGUD\",\"WARC-Block-Digest\":\"sha1:4VZLEMSHONLFODCAIGL66H4KFVHUXI7X\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2020/CC-MAIN-2020-29/CC-MAIN-2020-29_segments_1593655886516.43_warc_CC-MAIN-20200704170556-20200704200556-00410.warc.gz\"}"} |
https://miphonedoctorofaustin.com/qa/question-is-1-the-smallest-factor-of-any-number.html | [
"",
null,
"# Question: Is 1 The Smallest Factor Of Any Number?\n\n## Which is the smallest prime number?\n\nThe smallest prime numbers are 2, 3, 5, 7, 11, 13, 17, 19 and 23.\n\nThe number 2 is the only even prime number.\n\nThe number 7 has only two factors: 1 and itself.\n\nThe number 11 has only two factors: 1 and itself..\n\n## Why is 11 not a prime number?\n\nFor 11, the answer is: yes, 11 is a prime number because it has only two distinct divisors: 1 and itself (11). As a consequence, 11 is only a multiple of 1 and 11.\n\n## What is the largest factor of any number?\n\nthe smallest factor of a number is 1 and the largest factor is number itself.\n\n## Does 1 have less than 2 factors?\n\n1 does not have two different factors, so it is not prime. 2 has only the factors 2 and 1. 3 has only the factors 3 and 1. 4 has more than two factors: 1, 2, and 4, so it is composite.\n\n## Why is 1 a factor of every number?\n\nOriginally Answered: What is the factor of every number? A number A is said to be a factor of a number B if B is divisible by A (B/A=NATURAL NO.) now as every no is divisible by 1 . so, 1 is the no which is the factor of every no.\n\n## Is 1 a prime factor of every number?\n\nEach prime number is only divisible by 1 and itself. That means the number 1 can never be a prime number. So any prime number should have only two factors and it should be greater than 1.\n\n## What is the HCF of 120 and 75?\n\n15The hcf of 75 and 120 is 15.\n\n## Which is the smallest factor of 15?\n\nAnswer. So, the smallest Factor of 15 is 1.\n\n## What is factor of every number?\n\nFactor of a number means that its multiple is totally divisible by that number. 1 is a divisible of every number i.e it divides every number. So, 1 is the number which is a factor of every number. Hence, the answer is 1.\n\n## What is the smallest and largest factor of any number?\n\nFactors of a number The factors (noun) of a number are the numbers that divide evenly into the number. For example the factors of the number 12 are the numbers 1, 2, 3, 4, 6 and 12. (Notice that the smallest factor is always 1 and the biggest factor is always the number itself.)\n\n## What is the smallest factor of number?\n\nThe number 1 is the smallest factor of every number. Every number will have a minimum of two factors, 1 and the number itself. A number that has only two factors, 1 and the number itself, is called a prime number.\n\n## Can 0 be a factor?\n\nFor any real number, multiply it by its reciprocal to get 1. … Zero is not a factor of any non-zero number because n/0 is undefined for any number other than zero. All integers other than zero are factors of zero because 0n = 0 for all numbers."
] | [
null,
"https://mc.yandex.ru/watch/66668152",
null
] | {"ft_lang_label":"__label__en","ft_lang_prob":0.9520409,"math_prob":0.99650425,"size":2964,"snap":"2020-45-2020-50","text_gpt3_token_len":797,"char_repetition_ratio":0.26452702,"word_repetition_ratio":0.17434211,"special_character_ratio":0.28272605,"punctuation_ratio":0.13256484,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.999806,"pos_list":[0,1,2],"im_url_duplicate_count":[null,null,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2020-10-22T14:46:49Z\",\"WARC-Record-ID\":\"<urn:uuid:cfd36e92-6924-4717-a9e8-928e985ad8e2>\",\"Content-Length\":\"33801\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:1c5fbb52-109e-449d-8d40-b1c7b2ae5b1c>\",\"WARC-Concurrent-To\":\"<urn:uuid:450b5995-1ccf-435e-a729-2d5b7f20416c>\",\"WARC-IP-Address\":\"87.236.16.235\",\"WARC-Target-URI\":\"https://miphonedoctorofaustin.com/qa/question-is-1-the-smallest-factor-of-any-number.html\",\"WARC-Payload-Digest\":\"sha1:ETI5G7WAQHXWGTODI54PWZFNRQRBLQHV\",\"WARC-Block-Digest\":\"sha1:4WG55BHI2NJX7J4U5HI5DIIIL2WRZQHD\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2020/CC-MAIN-2020-45/CC-MAIN-2020-45_segments_1603107879673.14_warc_CC-MAIN-20201022141106-20201022171106-00354.warc.gz\"}"} |
https://www.mimuw.edu.pl/aktualnosci/seminaria/reducing-randomness-isolation-lemma-decomposable-graphs | [
"",
null,
"Czekaj...Wczytywanie...",
null,
"",
null,
"Nie jesteś zalogowany | zaloguj się",
null,
"## Wydział Matematyki, Informatyki i Mechaniki Uniwersytetu Warszawskiego\n\n• Skala szarości\n• Wysoki kontrast\n• Negatyw\n• Reset\n\n# Aktualności — Wydarzenia\n\nSem. Algorytmika\n\n## Reducing randomness in Isolation Lemma on decomposable graphs\n\nPrelegent: Michał Pilipczuk\n\n2021-04-01 12:15\n\nThe classic Isolation Lemma of Mulmuley et al. states that if\nF is a non-empty family of subsets of a universe U of size n, and we\ndraw a weight function f : U -> {1,...,2n} uniformly at random, then\nwith probability at least 1/2 there is a unique element of F that has\nthe minimum weight w.r.t. f. Obviously, drawing such a weight function\nuniformly at random requires using O(n log n) random bits. We study how\nmuch we can reduce the amount of randomness needed in case we know that\nthe family F in question comprises of some nicely behaving combinatorial\nobjects in a decomposable graph. For instance, we provide an isolation\nscheme that uses O(t log n + log^2 n) random bits for Hamiltonian Cycles\nin graphs of treewidth t, which can be generalized to isolating any\nMSO-definable family of objects using f(t) log n + O(log^2 n) random\nbits. A concrete corollary of our randomness-efficient isolation schemes\nis an algorithm for Hamiltonian Cycle in planar graphs (and in fact, in\nany class of graphs that admits balanced separators of size O(n^{1/2}))\nthat achieves determinism, time complexity 2^O(sqrt{n}), and polynomial\nspace complexity at the same time.\n\nThis is a joint work with Jesper Nederlof, Céline Swennenhuis, and Karol\nWęgrzycki (♥)."
] | [
null,
"https://logowanie.uw.edu.pl/cas/img/casMenu/uw_slx.gif",
null,
"https://logowanie.uw.edu.pl/cas/img/casMenu/uw_slbtn0.gif",
null,
"https://www.mimuw.edu.pl/sites/default/files/casmenu_uw_kropki.gif",
null,
"https://www.mimuw.edu.pl/sites/all/themes/mimuwtheme/images/MIM_logo_sygnet_pl.png",
null
] | {"ft_lang_label":"__label__en","ft_lang_prob":0.787282,"math_prob":0.91571814,"size":1323,"snap":"2023-14-2023-23","text_gpt3_token_len":350,"char_repetition_ratio":0.094010614,"word_repetition_ratio":0.0,"special_character_ratio":0.22600152,"punctuation_ratio":0.10344828,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.98160505,"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-06-06T10:54:14Z\",\"WARC-Record-ID\":\"<urn:uuid:115edb1d-7149-4e88-b36c-231c0b036861>\",\"Content-Length\":\"35871\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:d7a224e7-e14d-49eb-8db5-d3c74a0dcc83>\",\"WARC-Concurrent-To\":\"<urn:uuid:df0ceb9c-979e-4455-a25f-caeef7bdd180>\",\"WARC-IP-Address\":\"193.0.96.14\",\"WARC-Target-URI\":\"https://www.mimuw.edu.pl/aktualnosci/seminaria/reducing-randomness-isolation-lemma-decomposable-graphs\",\"WARC-Payload-Digest\":\"sha1:ZNQFINZ7QQMM5BKOYGHQ3DFEABKTJPS3\",\"WARC-Block-Digest\":\"sha1:SB6IX7ILWOP2VUSZ5N2Y73GJCY5MTRTR\",\"WARC-Identified-Payload-Type\":\"application/xhtml+xml\",\"warc_filename\":\"/cc_download/warc_2023/CC-MAIN-2023-23/CC-MAIN-2023-23_segments_1685224652494.25_warc_CC-MAIN-20230606082037-20230606112037-00619.warc.gz\"}"} |
https://qanda.ai/en/solutions/oBdJYC8SMa-3-times-4-is-12---3times4-12 | [
"",
null,
"",
null,
"",
null,
"Symbol\nProblem",
null,
"$3$ times $4$ is $12$ $-$ $3\\times 4=$ $12$ $3$ times $6$ is $10$ $3\\times 6=$ $18$ 0 00 $3$ times $7$ is $2|$ $3\\times 7=$ $21$\n7th-9th grade\nCalculus\nSearch count: 107\nSolution",
null,
"Qanda teacher - abdulhaq",
null,
""
] | [
null,
"https://qanda.ai/static/icons/qanda_logo.png",
null,
"https://qanda.ai/static/icons/ic-search-grey.svg",
null,
"https://qanda.ai/static/icons/rootx_orange.svg",
null,
"https://thumb-m.mathpresso.io/qanda-thumbnail-storage/questions/bJmSDGfWdTyWU9zszdhV3Uo2TwAs4VFyMFR5F42cEFv3TX0fGWCor.jpg",
null,
"https://thumb.mathpresso.io/qanda-storage/6245aa17-eb67-4be8-b9e2-67a94d70636e.jpg",
null,
"https://thumb.mathpresso.io/qanda-storage/0cc2620b-a9eb-4fc1-9ef6-6108a8f3cc8d.jpg",
null
] | {"ft_lang_label":"__label__en","ft_lang_prob":0.64083886,"math_prob":1.00001,"size":1275,"snap":"2021-04-2021-17","text_gpt3_token_len":514,"char_repetition_ratio":0.15499607,"word_repetition_ratio":0.2815534,"special_character_ratio":0.42352942,"punctuation_ratio":0.07575758,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.99999464,"pos_list":[0,1,2,3,4,5,6,7,8,9,10,11,12],"im_url_duplicate_count":[null,null,null,null,null,null,null,1,null,6,null,2,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2021-04-12T03:18:45Z\",\"WARC-Record-ID\":\"<urn:uuid:212c2e8d-b220-4e55-b48a-fae527633bb0>\",\"Content-Length\":\"54746\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:51fc4d4c-c746-4fd8-916c-2d7f96dcc6d2>\",\"WARC-Concurrent-To\":\"<urn:uuid:d0ebd96a-9761-47ed-8d12-bdef422af20d>\",\"WARC-IP-Address\":\"13.32.207.84\",\"WARC-Target-URI\":\"https://qanda.ai/en/solutions/oBdJYC8SMa-3-times-4-is-12---3times4-12\",\"WARC-Payload-Digest\":\"sha1:OU7DTBQWA4BRREVZRI7SYOE746YRBZOV\",\"WARC-Block-Digest\":\"sha1:GO77AII2DVD7CVK5Q74N4PXFFS7K3WGA\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2021/CC-MAIN-2021-17/CC-MAIN-2021-17_segments_1618038066568.16_warc_CC-MAIN-20210412023359-20210412053359-00052.warc.gz\"}"} |
https://getremedyonline.com/35-excel-chart-x-axis-not-to-scale/ | [
"By | July 9, 2019",
null,
"Awesome 35 Illustration Excel Chart X Axis Not to Scale\nexcel vba chart control secondary x axis scale how can i control the maximum and minimum for secondary horizontal x axis i have an xy scatter chart with primary secondary axes i want the secondary horizontal axis max min to be controlled by link excel chart axis scale to values in cells peltier this tutorial shows examples of code to update an excel charts axis scales on demand or on worksheet changes using scale parameters from worksheet cells excel chart not displaying x axis super user ive got a chart in a spreadsheet in excel 2010 which is using a chart stacked column in 3 d i have defined the horizontal category axis label in the select data source window and it is correctl line chart x axis starts at 1 not zero mrexcel publishing every time i create a line chart the line starts at 1 on the x axis and on the y axis it starts at zero for example in the source data table column a representing the x axis has a unit series tha how excel calculates automatic chart axis limits peltier excels automatic axis scaling often seems somewhat mysterious and its not easy to find information about it microsoft has a couple articles in the msdn knowledge base how chart ax how to format the x axis and y axis in excel 2010 charts when charting values excel 2010 isnt always careful how it formats the values that appear on the y axis or the x axis when using some chart types if youre not happy with the way cant get evenly spaced chart x axis labels excel help forum hi dan let me a little more specific if i double click on the x axis i get a format axis window on the scale tab is where the ticks and labels are set excel chart with two x axes horizontal possible is it possible to create an excel chart which has two x axes i e horizontal axes not vertical y axes i want to use the second axis to plot the normalized value of the default horizontal axi how to create a two axis chart in excel 2013 2010 or you can chart multiple things in a chart even if they are of a different scale by having 2 different y axis values one on either side of the chart using a secondary axis in microsoft excel maximum minimum axis values from chart free excelvba hi can anyone tell me how i get the maximum and minimum values of the axis from and excel chart what i mean is i want to specify a chart and output in the same excel worksheet the values for the ma Awesome 35 Illustration Excel Chart X Axis Not to Scale\n\nRead More : Fresh 34 Design Chart Template Design\n\nExcel Chart X Axis Not to Scale Ebook Bisphosphonates and Osteonecrosis Of the Jaw A\n\nExcel Chart X Axis Not to Scale Excel How to Create A Chart that Automatically Scales the\n\nExcel Chart X Axis Not to Scale X Axis Excel Horizontal Axis Excel Enter Image Description\n\nExcel Chart X Axis Not to Scale Excel Chart Axis Scale Break Excel 2013 Chart Axis Scale\n\nExcel Chart X Axis Not to Scale Excel Charts Add Title Customize Chart Axis Legend and"
] | [
null,
"data:image/gif;base64,R0lGODlhAQABAAAAACH5BAEKAAEALAAAAAABAAEAAAICTAEAOw==",
null
] | {"ft_lang_label":"__label__en","ft_lang_prob":0.7795859,"math_prob":0.8690112,"size":2909,"snap":"2019-51-2020-05","text_gpt3_token_len":604,"char_repetition_ratio":0.17521514,"word_repetition_ratio":0.06352087,"special_character_ratio":0.20144379,"punctuation_ratio":0.0,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9785349,"pos_list":[0,1,2],"im_url_duplicate_count":[null,null,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2019-12-07T06:56:32Z\",\"WARC-Record-ID\":\"<urn:uuid:2212f339-fb64-4cf1-9918-7c57529f1d24>\",\"Content-Length\":\"107723\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:c7beb339-1b02-4c08-ae73-4aecb024ea73>\",\"WARC-Concurrent-To\":\"<urn:uuid:ebe8f021-074e-43d8-8243-eec7a08656b8>\",\"WARC-IP-Address\":\"104.18.34.10\",\"WARC-Target-URI\":\"https://getremedyonline.com/35-excel-chart-x-axis-not-to-scale/\",\"WARC-Payload-Digest\":\"sha1:BTCARQPG6GGZ3YUIIXQIHVYYRDHQHYWY\",\"WARC-Block-Digest\":\"sha1:3W5ZVEE42XBP46H4U23BVZBO7RMX36EG\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2019/CC-MAIN-2019-51/CC-MAIN-2019-51_segments_1575540496492.8_warc_CC-MAIN-20191207055244-20191207083244-00323.warc.gz\"}"} |
https://forum.coppeliarobotics.com/viewtopic.php?f=9&t=8247&view=print | [
"Page 1 of 1\n\n### Controlling velocity with MATLAB\n\nPosted: 03 Jan 2020, 21:40\nHello. I have a 6-DOF robot and I have a set of angular velocities and positions values taken at 10ms intervals of the actual robot joints. I want the robot model in the simulation to follow those values using MATLAB as the control method.\n\nI was able to manipulate the joint positions using the following MATLAB code in a for loop:\n\nCode: Select all\n\n``[returnCode]=vrep.simxSetJointTargetPosition(clientID,art_0,(A(i,1))*pi/180,vrep.simx_opmode_oneshot);``\nWhere \"A\" represents a matrix with joint positions.\n\nI want to be able to manipulate the joint velocities as well but the following function does not work:\n\nCode: Select all\n\n``[returnCode]=vrep.simxSetJointTargetVelocity(clientID,art_0,B(i,1),vrep.simx_opmode_oneshot);``\nWhere \"B\" represents a matrix with joint velocities.\n\nOne forum topic said to use child scripts in Coppeliasim and call them using MATLAB. I did that but I also could not control the velocities. I want to also ask if it is even possible to control the velocity. The joints are set to Force/Torque mode with the control loop enabled.\n\n### Re: Controlling velocity with MATLAB\n\nPosted: 06 Jan 2020, 13:21\nHello,\n\nif your joints are in force/torque mode, the motor enabled, and the control loop enabled, then you should modify the upper velocity limit, i.e. your joint is in position control, and the controller will try to bring the joint via a PID controller to the desired position by only taking into account the upper velocity limit.\nThat value for a joint can be adjusted programatically via: `sim.setObjectFloatParameter(jointHandle,sim.jointfloatparam_upper_limit,upperVelLimit)`\nKeep in mind that a change will only take effect when simulation is not yet running.\n\nCheers\n\n### Re: Controlling velocity with MATLAB\n\nPosted: 14 Jan 2020, 12:27\nThanks, but is there no other way to control the velocity when the simulation is running?\n\n### Re: Controlling velocity with MATLAB\n\nPosted: 14 Jan 2020, 13:40\nWell, yes, you can. But then you need to handle the joint control yourself, via a joint callback function. If you take the example control on that page, simply replace inData.velUpperLimit with another value, e.g.:\n\nCode: Select all\n\n``````function sysCall_jointCallback(inData)\n\n...\n\nlocal upperVel=sim.getFloatSignal(\"upperVelocityLimit\")\nif not upperVel then\nupperVel=90*math.pi/180 -- default value\nend\n\n-- 4. Calculate the velocity needed to reach the position in one dynamic time step:\nlocal maxVelocity=ctrl/inData.dynStepSize -- max. velocity allowed.\nif (maxVelocity>upperVel) then\nmaxVelocity=upperVel\nend\nif (maxVelocity<-upperVel) then\nmaxVelocity=-upperVel\nend\n\n...\n\nreturn outData\nend``````\nThen you can control the upper velocity limit via the float signal upperVelocityLimit.\n\nCheers"
] | [
null
] | {"ft_lang_label":"__label__en","ft_lang_prob":0.92109823,"math_prob":0.59996116,"size":1583,"snap":"2020-34-2020-40","text_gpt3_token_len":373,"char_repetition_ratio":0.12666245,"word_repetition_ratio":0.6184739,"special_character_ratio":0.21415035,"punctuation_ratio":0.115015976,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9840309,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2020-08-05T22:32:40Z\",\"WARC-Record-ID\":\"<urn:uuid:958df557-ea8c-46c6-9f96-30eec956b393>\",\"Content-Length\":\"6663\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:b1356997-db02-46e6-a2bd-a5895de0a5ac>\",\"WARC-Concurrent-To\":\"<urn:uuid:e9c0ced2-b2b7-477f-98b6-c83882a08308>\",\"WARC-IP-Address\":\"149.210.209.149\",\"WARC-Target-URI\":\"https://forum.coppeliarobotics.com/viewtopic.php?f=9&t=8247&view=print\",\"WARC-Payload-Digest\":\"sha1:RXBX6RUKSVQNQEXLCITQU5ACXQRY4ZKL\",\"WARC-Block-Digest\":\"sha1:FIPZI75ZARATBJF5HKWTAE3HWXUE32YL\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2020/CC-MAIN-2020-34/CC-MAIN-2020-34_segments_1596439735989.10_warc_CC-MAIN-20200805212258-20200806002258-00153.warc.gz\"}"} |
http://www.hkxiaopan.com/column/zhidao/95079.html | [
"# 单价敏感系数计算公式-单位变动成本的敏感系数公式\n\na.0.60\n\nb.0.80\n\nc.1.25\n\nd.1.60\n\n【答案】d\n\n【解析】利润=(单价-单位变动成本)×销售量-固定成本=单位边际贡献×销量-固定成本,固定成本=单位边际贡献×销量-利润=40×2-50=30(万元)。假设销量上升10%,变化后的销量=40×(1+10%)=44(万元),变化后的利润=44×2-30=58(万元),利润变化的百分比=(58-50)/50=16%,销售量的敏感系数=16%/10%=1.6,所以,选项d正确。\n\n【知识点】利润敏感性分析(p256)"
] | [
null
] | {"ft_lang_label":"__label__zh","ft_lang_prob":0.9207631,"math_prob":0.99401915,"size":505,"snap":"2021-21-2021-25","text_gpt3_token_len":483,"char_repetition_ratio":0.1257485,"word_repetition_ratio":0.0,"special_character_ratio":0.3960396,"punctuation_ratio":0.106796116,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9517228,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2021-06-17T22:48:00Z\",\"WARC-Record-ID\":\"<urn:uuid:99e7088f-1c16-4bfb-b402-e268a0663577>\",\"Content-Length\":\"16146\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:dd9883d9-93ad-4d17-9f16-4b4b00cc3d76>\",\"WARC-Concurrent-To\":\"<urn:uuid:a4356849-7d8c-439e-a0ec-d27fca581bff>\",\"WARC-IP-Address\":\"129.226.187.197\",\"WARC-Target-URI\":\"http://www.hkxiaopan.com/column/zhidao/95079.html\",\"WARC-Payload-Digest\":\"sha1:2BTVWJDMEH6R6ARL2VYZ2HCK6FUZVVET\",\"WARC-Block-Digest\":\"sha1:VW5M6OLSI5OCZ4LX7BBFNXJAVGZRZWB4\",\"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-00075.warc.gz\"}"} |
http://wordsearchfun.com/201860_FRIENDLY_VILLAGE_WORD_SEARCH_wordsearch.html | [
"FRIENDLY VILLAGE WORD SEARCH\nTRAVEL TIME\n\nLogin to be the first to rate this puzzle!\nATV\nBARGE\nBICYCLE\nBLIMP\nBURRO\nCAMEL\nCANOE\nCART\nCHARIOT\nCURRENT\nDINGHY\nELEPHANT\nHORSE\nJEEP\nLLAMA\nOXCART\nPLANE\nRAFT\nROCKET\nSTROLLER\nSUBWAY\nSURREY\nSWING\nTAXI\nTRACTOR\nTRAIN\nVAN\nWAGON\nWAVE\nYACHT\n W S W S Q Z P D L F U A A W A K P M Z J V L J D N G U I H X Y T B R S H Q J B E A Q X M P T T X K W R F O D Q A U V N M V M D V M R G A U V O T B F F K R N A V L M Y A X A T T X K C V B J O J H P Z E T K B G G C F S O A E B R J C Q M Y B H Y I P R K X A G R I X U Y J D I H L B S T R E L L O R T S U R R E Y L G E M S A O B Z F C I O R N U P A H B N M O W D L H G J L A A C A Z A T V H I A Y B Y B A M L F B B W K I D R H R D C G R P B S C N P Q E R I E N H O I P A Y U N G J O A K N C M S G T V R O L N E C P R I E P G T M A Y D L T S B A O M R L E F R W D L N Y U U I L E O N E F T L E E U D E S T W I I R W W A E H T X A A F J A U U N F P Q E R V W R X T F M C O R R U B Z S T S B T S S E B K B A N R E V A W A G O N E E A P N B D T Z R X W L X A O E P J F A E A K U W R K L T H C A Y Z N K V F I"
] | [
null
] | {"ft_lang_label":"__label__en","ft_lang_prob":0.63380444,"math_prob":0.6403184,"size":1918,"snap":"2020-34-2020-40","text_gpt3_token_len":927,"char_repetition_ratio":0.28996864,"word_repetition_ratio":0.22867298,"special_character_ratio":0.6506778,"punctuation_ratio":0.0022271716,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":1.000007,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2020-09-29T04:10:03Z\",\"WARC-Record-ID\":\"<urn:uuid:05cc4cf9-676b-4c3d-a74f-2e63dd90f910>\",\"Content-Length\":\"35841\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:46aae844-c1a7-4b00-9717-eded89ce5b3f>\",\"WARC-Concurrent-To\":\"<urn:uuid:9cb72062-f9c9-4f31-abe4-664482acf013>\",\"WARC-IP-Address\":\"88.208.252.230\",\"WARC-Target-URI\":\"http://wordsearchfun.com/201860_FRIENDLY_VILLAGE_WORD_SEARCH_wordsearch.html\",\"WARC-Payload-Digest\":\"sha1:XWJBO4773BSOHXU2UFTGY5HCXL4FH3DP\",\"WARC-Block-Digest\":\"sha1:BBWEERGTF22Y6TAEPSIYCGENHUEPCHYC\",\"WARC-Identified-Payload-Type\":\"application/xhtml+xml\",\"warc_filename\":\"/cc_download/warc_2020/CC-MAIN-2020-40/CC-MAIN-2020-40_segments_1600401624636.80_warc_CC-MAIN-20200929025239-20200929055239-00574.warc.gz\"}"} |
https://electronics.stackexchange.com/questions/456921/how-to-connect-multiple-sensors-to-single-plc-input | [
"# How to connect multiple sensors to single PLC input?",
null,
"Hello. I have a scenario where I have multiple PNP \"error signal\" from several sensors (let's assume 3 for now). If the sensor output is HIGH, then there is error. If the sensor output is LOW, then there is no error. The design is that if any of the sensor detect error then the PLC input will be HIGH. My question is, suppose if all three sensors detect error, it means all three will send voltage to the same port in PLC. Will it cause over current and damage the PLC input? Is the current in PLC port = current sensor 1 + current sensor 2 + current sensor 3?",
null,
"simulate this circuit – Schematic created using CircuitLab\n\nYo do only have to add three diodes D1-D3 to your PLC input. The currents don't sum, right the opposite. If only one sensor is HIGH, then the current through sensor and PLC input is the same, if more than one sensor is HIGH, then current through PLC input is the same, but current through sensors are divided.\n\nYou may also omit the diodes and connect them parallel if they are industrial sensors. I do connect, for example photocells, parallel to increase the detection zone.\n\nYou more have to make sure 1 sensor does not damage another,\n\nE.g. if 1 outputs \"HIGH\" and 1 outputs \"LOW\" if its a driven output, its essentially a short circuit on the sensor outputs.\n\nIf its \"Open Collector\" outputs, or \"Open Emitter\" outputs, then they are safe to have in parallel so long as they are all the same type. as you say its a PNP output, I am going to assume Open Emitter,\n\nI am going to assume the PLC input is measuring voltage, if so you should not have to worry about damaging the PLC input, as it should be a very high resistance, so the current from the outputs would be very small. This is assuming that the PNP output voltage is not higher than the maximum voltage rating for the PLC input."
] | [
null,
"https://i.stack.imgur.com/FwD6M.jpg",
null,
"https://i.stack.imgur.com/RmtoV.png",
null
] | {"ft_lang_label":"__label__en","ft_lang_prob":0.91739154,"math_prob":0.90150994,"size":1818,"snap":"2023-40-2023-50","text_gpt3_token_len":416,"char_repetition_ratio":0.16372657,"word_repetition_ratio":0.02366864,"special_character_ratio":0.2249725,"punctuation_ratio":0.102902375,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9660845,"pos_list":[0,1,2,3,4],"im_url_duplicate_count":[null,2,null,2,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2023-12-10T08:03:26Z\",\"WARC-Record-ID\":\"<urn:uuid:7492f98c-8b47-4506-b76d-00b8ff46c201>\",\"Content-Length\":\"171679\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:16312bc3-b393-4c33-96c3-946357ee1c25>\",\"WARC-Concurrent-To\":\"<urn:uuid:445a1458-a505-40d1-b619-86ce17722dd3>\",\"WARC-IP-Address\":\"104.18.43.226\",\"WARC-Target-URI\":\"https://electronics.stackexchange.com/questions/456921/how-to-connect-multiple-sensors-to-single-plc-input\",\"WARC-Payload-Digest\":\"sha1:IV6E3A3O5MR3R4CU45G5EBHCE27HN5YY\",\"WARC-Block-Digest\":\"sha1:YSUEAVLOEBEYOY3NH7ORSKUGRW2DYPMK\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2023/CC-MAIN-2023-50/CC-MAIN-2023-50_segments_1700679101282.74_warc_CC-MAIN-20231210060949-20231210090949-00094.warc.gz\"}"} |
https://www.mathworks.com/matlabcentral/cody/problems/44696-sum-of-unique-multiples-of-3-and-5/solutions/1643415 | [
"Cody\n\n# Problem 44696. Sum of unique multiples of 3 and 5\n\nSolution 1643415\n\nSubmitted on 12 Oct 2018 by li haitao\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\nn = 15; sm_correct = 60; assert(isequal(sum3and5muls(n),sm_correct))\n\n2 Pass\nn = 18; sm_correct = 78; assert(isequal(sum3and5muls(n),sm_correct))\n\n3 Pass\nn = (2^2)-1; sm_correct = 3; assert(isequal(sum3and5muls(n),sm_correct))\n\n4 Pass\nn = randi(25); sm_correct = sum(3:3:n)+sum(5:5:n)-sum(15:15:n); assert(isequal(sum3and5muls(n),sm_correct))"
] | [
null
] | {"ft_lang_label":"__label__en","ft_lang_prob":0.50860846,"math_prob":0.9985214,"size":636,"snap":"2019-43-2019-47","text_gpt3_token_len":214,"char_repetition_ratio":0.17088607,"word_repetition_ratio":0.0,"special_character_ratio":0.3537736,"punctuation_ratio":0.168,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.998933,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2019-11-12T09:44:54Z\",\"WARC-Record-ID\":\"<urn:uuid:4ab8d60b-9c0c-4a40-b9fd-7a5205336932>\",\"Content-Length\":\"72010\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:98180d91-b6e9-4e40-9b29-4dd22466ec49>\",\"WARC-Concurrent-To\":\"<urn:uuid:b6b0282b-39f0-4759-aea8-7d974772be31>\",\"WARC-IP-Address\":\"104.117.0.182\",\"WARC-Target-URI\":\"https://www.mathworks.com/matlabcentral/cody/problems/44696-sum-of-unique-multiples-of-3-and-5/solutions/1643415\",\"WARC-Payload-Digest\":\"sha1:JL6LWNGUNRQNKPINGKIEN2OTIDXZY5JW\",\"WARC-Block-Digest\":\"sha1:2KORSW6MSLJHHFR36DWSNIODSEPYS6A3\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2019/CC-MAIN-2019-47/CC-MAIN-2019-47_segments_1573496664808.68_warc_CC-MAIN-20191112074214-20191112102214-00424.warc.gz\"}"} |
https://developer.android.google.cn/ndk/reference/group/neural-networks?hl=zh-tw | [
"# NeuralNetworks\n\n#include <NeuralNetworks.h>\n\n## Summary\n\n### Enumerations\n\nAnonymous Enum 48{ ANEURALNETWORKS_MAX_SIZE_OF_IMMEDIATELY_COPIED_VALUES = 128} enum\nFor ANeuralNetworksModel_setOperandValue, values with a length smaller or equal to this will be immediately copied into the model.\nAnonymous Enum 49{ ANEURALNETWORKS_BYTE_SIZE_OF_CACHE_TOKEN = 32} enum\nFor ANeuralNetworksCompilation_setCaching, specify the size of the cache token required from the application.\nDeviceTypeCode{ ANEURALNETWORKS_DEVICE_UNKNOWN = 0, ANEURALNETWORKS_DEVICE_OTHER = 1, ANEURALNETWORKS_DEVICE_CPU = 2, ANEURALNETWORKS_DEVICE_GPU = 3, ANEURALNETWORKS_DEVICE_ACCELERATOR = 4} enum\nDevice types.\nDurationCode{ ANEURALNETWORKS_DURATION_ON_HARDWARE = 0, ANEURALNETWORKS_DURATION_IN_DRIVER = 1, ANEURALNETWORKS_FENCED_DURATION_ON_HARDWARE = 2, ANEURALNETWORKS_FENCED_DURATION_IN_DRIVER = 3} enum\nDifferent duration measurements.\nFuseCode{ ANEURALNETWORKS_FUSED_NONE = 0, ANEURALNETWORKS_FUSED_RELU = 1, ANEURALNETWORKS_FUSED_RELU1 = 2, ANEURALNETWORKS_FUSED_RELU6 = 3} enum\nFused activation function types.\nOperandCode{ ANEURALNETWORKS_FLOAT32 = 0, ANEURALNETWORKS_INT32 = 1, ANEURALNETWORKS_UINT32 = 2, ANEURALNETWORKS_TENSOR_FLOAT32 = 3, ANEURALNETWORKS_TENSOR_INT32 = 4, ANEURALNETWORKS_TENSOR_QUANT8_ASYMM = 5, ANEURALNETWORKS_BOOL = 6, ANEURALNETWORKS_TENSOR_QUANT16_SYMM = 7, ANEURALNETWORKS_TENSOR_FLOAT16 = 8, ANEURALNETWORKS_TENSOR_BOOL8 = 9, ANEURALNETWORKS_FLOAT16 = 10, ANEURALNETWORKS_TENSOR_QUANT8_SYMM_PER_CHANNEL = 11, ANEURALNETWORKS_TENSOR_QUANT16_ASYMM = 12, ANEURALNETWORKS_TENSOR_QUANT8_SYMM = 13, ANEURALNETWORKS_TENSOR_QUANT8_ASYMM_SIGNED = 14, ANEURALNETWORKS_MODEL = 15} enum\nOperand types.\nOperationCode{ ANEURALNETWORKS_ADD = 0, ANEURALNETWORKS_AVERAGE_POOL_2D = 1, ANEURALNETWORKS_CONCATENATION = 2, ANEURALNETWORKS_CONV_2D = 3, ANEURALNETWORKS_DEPTHWISE_CONV_2D = 4, ANEURALNETWORKS_DEPTH_TO_SPACE = 5, ANEURALNETWORKS_DEQUANTIZE = 6, ANEURALNETWORKS_EMBEDDING_LOOKUP = 7, ANEURALNETWORKS_FLOOR = 8, ANEURALNETWORKS_FULLY_CONNECTED = 9, ANEURALNETWORKS_HASHTABLE_LOOKUP = 10, ANEURALNETWORKS_L2_NORMALIZATION = 11, ANEURALNETWORKS_L2_POOL_2D = 12, ANEURALNETWORKS_LOCAL_RESPONSE_NORMALIZATION = 13, ANEURALNETWORKS_LOGISTIC = 14, ANEURALNETWORKS_LSH_PROJECTION = 15, ANEURALNETWORKS_LSTM = 16, ANEURALNETWORKS_MAX_POOL_2D = 17, ANEURALNETWORKS_MUL = 18, ANEURALNETWORKS_RELU = 19, ANEURALNETWORKS_RELU1 = 20, ANEURALNETWORKS_RELU6 = 21, ANEURALNETWORKS_RESHAPE = 22, ANEURALNETWORKS_RESIZE_BILINEAR = 23, ANEURALNETWORKS_RNN = 24, ANEURALNETWORKS_SOFTMAX = 25, ANEURALNETWORKS_SPACE_TO_DEPTH = 26, ANEURALNETWORKS_SVDF = 27, ANEURALNETWORKS_TANH = 28, ANEURALNETWORKS_BATCH_TO_SPACE_ND = 29, ANEURALNETWORKS_DIV = 30, ANEURALNETWORKS_MEAN = 31, ANEURALNETWORKS_PAD = 32, ANEURALNETWORKS_SPACE_TO_BATCH_ND = 33, ANEURALNETWORKS_SQUEEZE = 34, ANEURALNETWORKS_STRIDED_SLICE = 35, ANEURALNETWORKS_SUB = 36, ANEURALNETWORKS_TRANSPOSE = 37, ANEURALNETWORKS_ABS = 38, ANEURALNETWORKS_ARGMAX = 39, ANEURALNETWORKS_ARGMIN = 40, ANEURALNETWORKS_AXIS_ALIGNED_BBOX_TRANSFORM = 41, ANEURALNETWORKS_BIDIRECTIONAL_SEQUENCE_LSTM = 42, ANEURALNETWORKS_BIDIRECTIONAL_SEQUENCE_RNN = 43, ANEURALNETWORKS_BOX_WITH_NMS_LIMIT = 44, ANEURALNETWORKS_CAST = 45, ANEURALNETWORKS_CHANNEL_SHUFFLE = 46, ANEURALNETWORKS_DETECTION_POSTPROCESSING = 47, ANEURALNETWORKS_EQUAL = 48, ANEURALNETWORKS_EXP = 49, ANEURALNETWORKS_EXPAND_DIMS = 50, ANEURALNETWORKS_GATHER = 51, ANEURALNETWORKS_GENERATE_PROPOSALS = 52, ANEURALNETWORKS_GREATER = 53, ANEURALNETWORKS_GREATER_EQUAL = 54, ANEURALNETWORKS_GROUPED_CONV_2D = 55, ANEURALNETWORKS_HEATMAP_MAX_KEYPOINT = 56, ANEURALNETWORKS_INSTANCE_NORMALIZATION = 57, ANEURALNETWORKS_LESS = 58, ANEURALNETWORKS_LESS_EQUAL = 59, ANEURALNETWORKS_LOG = 60, ANEURALNETWORKS_LOGICAL_AND = 61, ANEURALNETWORKS_LOGICAL_NOT = 62, ANEURALNETWORKS_LOGICAL_OR = 63, ANEURALNETWORKS_LOG_SOFTMAX = 64, ANEURALNETWORKS_MAXIMUM = 65, ANEURALNETWORKS_MINIMUM = 66, ANEURALNETWORKS_NEG = 67, ANEURALNETWORKS_NOT_EQUAL = 68, ANEURALNETWORKS_PAD_V2 = 69, ANEURALNETWORKS_POW = 70, ANEURALNETWORKS_PRELU = 71, ANEURALNETWORKS_QUANTIZE = 72, ANEURALNETWORKS_QUANTIZED_16BIT_LSTM = 73, ANEURALNETWORKS_RANDOM_MULTINOMIAL = 74, ANEURALNETWORKS_REDUCE_ALL = 75, ANEURALNETWORKS_REDUCE_ANY = 76, ANEURALNETWORKS_REDUCE_MAX = 77, ANEURALNETWORKS_REDUCE_MIN = 78, ANEURALNETWORKS_REDUCE_PROD = 79, ANEURALNETWORKS_REDUCE_SUM = 80, ANEURALNETWORKS_ROI_ALIGN = 81, ANEURALNETWORKS_ROI_POOLING = 82, ANEURALNETWORKS_RSQRT = 83, ANEURALNETWORKS_SELECT = 84, ANEURALNETWORKS_SIN = 85, ANEURALNETWORKS_SLICE = 86, ANEURALNETWORKS_SPLIT = 87, ANEURALNETWORKS_SQRT = 88, ANEURALNETWORKS_TILE = 89, ANEURALNETWORKS_TOPK_V2 = 90, ANEURALNETWORKS_TRANSPOSE_CONV_2D = 91, ANEURALNETWORKS_UNIDIRECTIONAL_SEQUENCE_LSTM = 92, ANEURALNETWORKS_UNIDIRECTIONAL_SEQUENCE_RNN = 93, ANEURALNETWORKS_RESIZE_NEAREST_NEIGHBOR = 94, ANEURALNETWORKS_QUANTIZED_LSTM = 95, ANEURALNETWORKS_IF = 96, ANEURALNETWORKS_WHILE = 97, ANEURALNETWORKS_ELU = 98, ANEURALNETWORKS_HARD_SWISH = 99, ANEURALNETWORKS_FILL = 100, ANEURALNETWORKS_RANK = 101} enum\nOperation types.\nPaddingCode{ ANEURALNETWORKS_PADDING_SAME = 1, ANEURALNETWORKS_PADDING_VALID = 2} enum\nPreferenceCode{ ANEURALNETWORKS_PREFER_LOW_POWER = 0, ANEURALNETWORKS_PREFER_FAST_SINGLE_ANSWER = 1, ANEURALNETWORKS_PREFER_SUSTAINED_SPEED = 2} enum\nExecution preferences.\nPriorityCode{ ANEURALNETWORKS_PRIORITY_LOW = 90, ANEURALNETWORKS_PRIORITY_MEDIUM = 100, ANEURALNETWORKS_PRIORITY_HIGH = 110, ANEURALNETWORKS_PRIORITY_DEFAULT = ANEURALNETWORKS_PRIORITY_MEDIUM} enum\nRelative execution priority.\nResultCode{ ANEURALNETWORKS_NO_ERROR = 0, ANEURALNETWORKS_OUT_OF_MEMORY = 1, ANEURALNETWORKS_INCOMPLETE = 2, ANEURALNETWORKS_UNEXPECTED_NULL = 3, ANEURALNETWORKS_BAD_DATA = 4, ANEURALNETWORKS_OP_FAILED = 5, ANEURALNETWORKS_BAD_STATE = 6, ANEURALNETWORKS_UNMAPPABLE = 7, ANEURALNETWORKS_OUTPUT_INSUFFICIENT_SIZE = 8, ANEURALNETWORKS_UNAVAILABLE_DEVICE = 9, ANEURALNETWORKS_MISSED_DEADLINE_TRANSIENT = 10, ANEURALNETWORKS_MISSED_DEADLINE_PERSISTENT = 11, ANEURALNETWORKS_RESOURCE_EXHAUSTED_TRANSIENT = 12, ANEURALNETWORKS_RESOURCE_EXHAUSTED_PERSISTENT = 13, ANEURALNETWORKS_DEAD_OBJECT = 14} enum\nResult codes.\n\n### Typedefs\n\nANeuralNetworksBurst typedef\nstruct ANeuralNetworksBurst\nANeuralNetworksBurst is an opaque type that can be used to reduce the latency of a rapid sequence of executions.\nANeuralNetworksCompilation typedef\nstruct ANeuralNetworksCompilation\nANeuralNetworksCompilation is an opaque type that can be used to compile a machine learning model.\nANeuralNetworksDevice typedef\nstruct ANeuralNetworksDevice\nANeuralNetworksDevice is an opaque type that represents a device.\nANeuralNetworksEvent typedef\nstruct ANeuralNetworksEvent\nANeuralNetworksEvent is an opaque type that represents an event that will be signaled once an execution completes.\nANeuralNetworksExecution typedef\nstruct ANeuralNetworksExecution\nANeuralNetworksExecution is an opaque type that can be used to apply a machine learning model to a set of inputs.\nANeuralNetworksMemory typedef\nstruct ANeuralNetworksMemory\nANeuralNetworksMemory is an opaque type that represents memory.\nANeuralNetworksMemoryDesc typedef\nstruct ANeuralNetworksMemoryDesc\nANeuralNetworksMemoryDesc is an opaque type that represents a memory descriptor.\nANeuralNetworksModel typedef\nstruct ANeuralNetworksModel\nANeuralNetworksModel is an opaque type that contains a description of the mathematical operations that constitute the model.\nANeuralNetworksOperandType typedef\nstruct ANeuralNetworksOperandType\nANeuralNetworksOperandType describes the type of an operand.\nANeuralNetworksOperationType typedef\nint32_t\nANeuralNetworksSymmPerChannelQuantParams typedef\nstruct ANeuralNetworksSymmPerChannelQuantParams\nParameters for ANEURALNETWORKS_TENSOR_QUANT8_SYMM_PER_CHANNEL operand.\n\n### Functions\n\nANeuralNetworksBurst_create(ANeuralNetworksCompilation *compilation, ANeuralNetworksBurst **burst)\nint\nCreate a ANeuralNetworksBurst to apply the given compilation.\nANeuralNetworksBurst_free(ANeuralNetworksBurst *burst)\nvoid\nDestroys the burst object.\nANeuralNetworksCompilation_create(ANeuralNetworksModel *model, ANeuralNetworksCompilation **compilation)\nint\nCreate a ANeuralNetworksCompilation to compile the given model.\nANeuralNetworksCompilation_createForDevices(ANeuralNetworksModel *model, const ANeuralNetworksDevice *const *devices, uint32_t numDevices, ANeuralNetworksCompilation **compilation)\nint\nCreate a ANeuralNetworksCompilation to compile the given model for a specified set of devices.\nANeuralNetworksCompilation_finish(ANeuralNetworksCompilation *compilation)\nint\nIndicate that we have finished modifying a compilation.\nANeuralNetworksCompilation_free(ANeuralNetworksCompilation *compilation)\nvoid\nDestroy a compilation.\nANeuralNetworksCompilation_setCaching(ANeuralNetworksCompilation *compilation, const char *cacheDir, const uint8_t *token)\nint\nSets the compilation caching signature and the cache directory.\nANeuralNetworksCompilation_setPreference(ANeuralNetworksCompilation *compilation, int32_t preference)\nint\nSets the execution preference.\nANeuralNetworksCompilation_setPriority(ANeuralNetworksCompilation *compilation, int priority)\nint\nSet the execution priority.\nANeuralNetworksCompilation_setTimeout(ANeuralNetworksCompilation *compilation, uint64_t duration)\nint\nSet the maximum expected duration for compiling the model.\nANeuralNetworksDevice_getFeatureLevel(const ANeuralNetworksDevice *device, int64_t *featureLevel)\nint\nGet the supported NNAPI version of the specified device.\nANeuralNetworksDevice_getName(const ANeuralNetworksDevice *device, const char **name)\nint\nGet the name of the specified device.\nANeuralNetworksDevice_getType(const ANeuralNetworksDevice *device, int32_t *type)\nint\nGet the type of a given device.\nANeuralNetworksDevice_getVersion(const ANeuralNetworksDevice *device, const char **version)\nint\nGet the version of the driver implementation of the specified device.\nANeuralNetworksDevice_wait(const ANeuralNetworksDevice *device)\nint\nWait until the device is in a live state.\nANeuralNetworksEvent_createFromSyncFenceFd(int sync_fence_fd, ANeuralNetworksEvent **event)\nint\nCreate a ANeuralNetworksEvent from a sync_fence file descriptor.\nANeuralNetworksEvent_free(ANeuralNetworksEvent *event)\nvoid\nDestroys the event.\nANeuralNetworksEvent_getSyncFenceFd(const ANeuralNetworksEvent *event, int *sync_fence_fd)\nint\nGet sync_fence file descriptor from the event.\nANeuralNetworksEvent_wait(ANeuralNetworksEvent *event)\nint\nWaits until the execution completes.\nANeuralNetworksExecution_burstCompute(ANeuralNetworksExecution *execution, ANeuralNetworksBurst *burst)\nint\nSchedule synchronous evaluation of the execution on a burst object.\nANeuralNetworksExecution_compute(ANeuralNetworksExecution *execution)\nint\nSchedule synchronous evaluation of the execution.\nANeuralNetworksExecution_create(ANeuralNetworksCompilation *compilation, ANeuralNetworksExecution **execution)\nint\nCreate a ANeuralNetworksExecution to apply the given compilation.\nANeuralNetworksExecution_free(ANeuralNetworksExecution *execution)\nvoid\nDestroy an execution.\nANeuralNetworksExecution_getDuration(const ANeuralNetworksExecution *execution, int32_t durationCode, uint64_t *duration)\nint\nGet the time spent in the specified ANeuralNetworksExecution, in nanoseconds.\nANeuralNetworksExecution_getOutputOperandDimensions(ANeuralNetworksExecution *execution, int32_t index, uint32_t *dimensions)\nint\nGet the dimensional information of the specified output operand of the model of the ANeuralNetworksExecution.\nANeuralNetworksExecution_getOutputOperandRank(ANeuralNetworksExecution *execution, int32_t index, uint32_t *rank)\nint\nGet the dimensional information of the specified output operand of the model of the ANeuralNetworksExecution.\nANeuralNetworksExecution_setInput(ANeuralNetworksExecution *execution, int32_t index, const ANeuralNetworksOperandType *type, const void *buffer, size_t length)\nint\nAssociate a user buffer with an input of the model of the ANeuralNetworksExecution.\nANeuralNetworksExecution_setInputFromMemory(ANeuralNetworksExecution *execution, int32_t index, const ANeuralNetworksOperandType *type, const ANeuralNetworksMemory *memory, size_t offset, size_t length)\nint\nAssociate a region of a memory object with an input of the model of the ANeuralNetworksExecution.\nANeuralNetworksExecution_setLoopTimeout(ANeuralNetworksExecution *execution, uint64_t duration)\nint\nSet the maximum duration of WHILE loops in the specified execution.\nANeuralNetworksExecution_setMeasureTiming(ANeuralNetworksExecution *execution, bool measure)\nint\nSpecifies whether duration of the ANeuralNetworksExecution is to be measured.\nANeuralNetworksExecution_setOutput(ANeuralNetworksExecution *execution, int32_t index, const ANeuralNetworksOperandType *type, void *buffer, size_t length)\nint\nAssociate a user buffer with an output of the model of the ANeuralNetworksExecution.\nANeuralNetworksExecution_setOutputFromMemory(ANeuralNetworksExecution *execution, int32_t index, const ANeuralNetworksOperandType *type, const ANeuralNetworksMemory *memory, size_t offset, size_t length)\nint\nAssociate a region of a memory object with an output of the model of the ANeuralNetworksExecution.\nANeuralNetworksExecution_setTimeout(ANeuralNetworksExecution *execution, uint64_t duration)\nint\nSet the maximum expected duration of the specified execution.\nANeuralNetworksExecution_startCompute(ANeuralNetworksExecution *execution, ANeuralNetworksEvent **event)\nint\nSchedule asynchronous evaluation of the execution.\nANeuralNetworksExecution_startComputeWithDependencies(ANeuralNetworksExecution *execution, const ANeuralNetworksEvent *const *dependencies, uint32_t num_dependencies, uint64_t duration, ANeuralNetworksEvent **event)\nint\nSchedule asynchronous evaluation of the execution with dependencies.\nANeuralNetworksMemoryDesc_addInputRole(ANeuralNetworksMemoryDesc *desc, const ANeuralNetworksCompilation *compilation, uint32_t index, float frequency)\nint\nSpecify that a memory object will be playing the role of an input to an execution created from a particular compilation.\nANeuralNetworksMemoryDesc_addOutputRole(ANeuralNetworksMemoryDesc *desc, const ANeuralNetworksCompilation *compilation, uint32_t index, float frequency)\nint\nSpecify that a memory object will be playing the role of an output to an execution created from a particular compilation.\nANeuralNetworksMemoryDesc_create(ANeuralNetworksMemoryDesc **desc)\nint\nCreate a ANeuralNetworksMemoryDesc with no properties.\nANeuralNetworksMemoryDesc_finish(ANeuralNetworksMemoryDesc *desc)\nint\nIndicate that we have finished modifying a memory descriptor.\nANeuralNetworksMemoryDesc_free(ANeuralNetworksMemoryDesc *desc)\nvoid\nDestroy a memory descriptor.\nANeuralNetworksMemoryDesc_setDimensions(ANeuralNetworksMemoryDesc *desc, uint32_t rank, const uint32_t *dimensions)\nint\nSet the dimensional information of the memory descriptor.\nANeuralNetworksMemory_copy(const ANeuralNetworksMemory *src, const ANeuralNetworksMemory *dst)\nint\nCopies data from one memory object to another.\nANeuralNetworksMemory_createFromAHardwareBuffer(const AHardwareBuffer *ahwb, ANeuralNetworksMemory **memory)\nint\nCreates a shared memory object from an AHardwareBuffer handle.\nANeuralNetworksMemory_createFromDesc(const ANeuralNetworksMemoryDesc *desc, ANeuralNetworksMemory **memory)\nint\nCreates a memory object from a memory descriptor.\nANeuralNetworksMemory_createFromFd(size_t size, int protect, int fd, size_t offset, ANeuralNetworksMemory **memory)\nint\nCreates a shared memory object from a file descriptor.\nANeuralNetworksMemory_free(ANeuralNetworksMemory *memory)\nvoid\nDelete a memory object.\nANeuralNetworksModel_addOperand(ANeuralNetworksModel *model, const ANeuralNetworksOperandType *type)\nint\nAdd an operand to a model.\nANeuralNetworksModel_addOperation(ANeuralNetworksModel *model, ANeuralNetworksOperationType type, uint32_t inputCount, const uint32_t *inputs, uint32_t outputCount, const uint32_t *outputs)\nint\nAdd an operation to a model.\nANeuralNetworksModel_create(ANeuralNetworksModel **model)\nint\nCreate an empty ANeuralNetworksModel.\nANeuralNetworksModel_finish(ANeuralNetworksModel *model)\nint\nIndicate that we have finished modifying a model.\nANeuralNetworksModel_free(ANeuralNetworksModel *model)\nvoid\nDestroy a model.\nANeuralNetworksModel_getSupportedOperationsForDevices(const ANeuralNetworksModel *model, const ANeuralNetworksDevice *const *devices, uint32_t numDevices, bool *supportedOps)\nint\nGet the supported operations for a specified set of devices.\nANeuralNetworksModel_identifyInputsAndOutputs(ANeuralNetworksModel *model, uint32_t inputCount, const uint32_t *inputs, uint32_t outputCount, const uint32_t *outputs)\nint\nSpecifies which operands will be the model's inputs and outputs.\nANeuralNetworksModel_relaxComputationFloat32toFloat16(ANeuralNetworksModel *model, bool allow)\nint\nSpecifies whether ANEURALNETWORKS_TENSOR_FLOAT32 is allowed to be calculated with range and/or precision as low as that of the IEEE 754 16-bit floating-point format.\nANeuralNetworksModel_setOperandSymmPerChannelQuantParams(ANeuralNetworksModel *model, int32_t index, const ANeuralNetworksSymmPerChannelQuantParams *channelQuant)\nint\nSets an operand's per channel quantization parameters.\nANeuralNetworksModel_setOperandValue(ANeuralNetworksModel *model, int32_t index, const void *buffer, size_t length)\nint\nSets an operand to a constant value.\nANeuralNetworksModel_setOperandValueFromMemory(ANeuralNetworksModel *model, int32_t index, const ANeuralNetworksMemory *memory, size_t offset, size_t length)\nint\nSets an operand to a value stored in a memory object.\nANeuralNetworksModel_setOperandValueFromModel(ANeuralNetworksModel *model, int32_t index, const ANeuralNetworksModel *value)\nint\nSets an operand to a value that is a reference to another NNAPI model.\nANeuralNetworks_getDefaultLoopTimeout()\nuint64_t\nGet the default timeout value for WHILE loops.\nANeuralNetworks_getDevice(uint32_t devIndex, ANeuralNetworksDevice **device)\nint\nGet the representation of the specified device.\nANeuralNetworks_getDeviceCount(uint32_t *numDevices)\nint\nGet the number of available devices.\nANeuralNetworks_getMaximumLoopTimeout()\nuint64_t\nGet the maximum timeout value for WHILE loops.\n\n### Structs\n\nANeuralNetworksOperandType\n\nANeuralNetworksOperandType describes the type of an operand.\n\nANeuralNetworksSymmPerChannelQuantParams\n\nParameters for ANEURALNETWORKS_TENSOR_QUANT8_SYMM_PER_CHANNEL operand.\n\n## Enumerations\n\n### Anonymous Enum 48\n\n Anonymous Enum 48\n\nFor ANeuralNetworksModel_setOperandValue, values with a length smaller or equal to this will be immediately copied into the model.\n\nThe size is in bytes.\n\nAvailable since API level 27.\n\nProperties\nANEURALNETWORKS_MAX_SIZE_OF_IMMEDIATELY_COPIED_VALUES\n\n### Anonymous Enum 49\n\n Anonymous Enum 49\n\nFor ANeuralNetworksCompilation_setCaching, specify the size of the cache token required from the application.\n\nThe size is in bytes.\n\nAvailable since API level 29.\n\nProperties\nANEURALNETWORKS_BYTE_SIZE_OF_CACHE_TOKEN\n\n### DeviceTypeCode\n\n DeviceTypeCode\n\nDevice types.\n\nThe type of NNAPI device.\n\nProperties\nANEURALNETWORKS_DEVICE_ACCELERATOR\n\nDedicated accelerator for Machine Learning workloads.\n\nANEURALNETWORKS_DEVICE_CPU\n\nThe device runs NNAPI models on single or multi-core CPU.\n\nANEURALNETWORKS_DEVICE_GPU\n\nThe device can run NNAPI models and also accelerate graphics APIs such as OpenGL ES and Vulkan.\n\nANEURALNETWORKS_DEVICE_OTHER\n\nThe device does not fall into any category below.\n\nANEURALNETWORKS_DEVICE_UNKNOWN\n\nThe device type cannot be provided.\n\n### DurationCode\n\n DurationCode\n\nDifferent duration measurements.\n\nDurations are measured in nanoseconds.\n\nAvailable since API level 29.\n\nProperties\nANEURALNETWORKS_DURATION_IN_DRIVER\nANEURALNETWORKS_DURATION_ON_HARDWARE\nANEURALNETWORKS_FENCED_DURATION_IN_DRIVER\nANEURALNETWORKS_FENCED_DURATION_ON_HARDWARE\n\n### FuseCode\n\n FuseCode\n\nFused activation function types.\n\nAvailable since API level 27.\n\nProperties\nANEURALNETWORKS_FUSED_NONE\n\nNO fused activation function.\n\nANEURALNETWORKS_FUSED_RELU\n\nFused ReLU activation function.\n\nANEURALNETWORKS_FUSED_RELU1\n\nFused ReLU1 activation function.\n\nANEURALNETWORKS_FUSED_RELU6\n\nFused ReLU6 activation function.\n\n### OperandCode\n\n OperandCode\n\nOperand types.\n\nThe type of an operand in a model.\n\nTypes prefaced with ANEURALNETWORKS_TENSOR_* must be used for tensor data (i.e., tensors with at least one dimension). Types not prefaced by ANEURALNETWORKS_TENSOR_* represent scalar values and must have no dimensions.\n\nAlthough we define many types, most operators accept just a few types. Most used are ANEURALNETWORKS_TENSOR_FLOAT32, ANEURALNETWORKS_TENSOR_QUANT8_ASYMM, and ANEURALNETWORKS_INT32.\n\nAvailable since API level 27.\n\nProperties\nANEURALNETWORKS_BOOL\n\nAn 8 bit boolean scalar value.\n\nValues of this operand type are either true or false. A zero value represents false; any other value represents true.\n\nAvailable since API level 29.\n\nANEURALNETWORKS_FLOAT16\n\nAn IEEE 754 16 bit floating point scalar value.\n\nAvailable since API level 29.\n\nANEURALNETWORKS_FLOAT32\n\nA 32 bit floating point scalar value.\n\nANEURALNETWORKS_INT32\n\nA signed 32 bit integer scalar value.\n\nANEURALNETWORKS_MODEL\n\nA reference to a model.\n\nANeuralNetworksModel_setOperandValueFromModel must be used to set the value for an Operand of this type.\n\nAvailable since API level 30.\n\nANEURALNETWORKS_TENSOR_BOOL8\n\nA tensor of 8 bit boolean values.\n\nValues of this operand type are either true or false. A zero value represents false; any other value represents true.\n\nAvailable since API level 29.\n\nANEURALNETWORKS_TENSOR_FLOAT16\n\nA tensor of IEEE 754 16 bit floating point values.\n\nAvailable since API level 29.\n\nANEURALNETWORKS_TENSOR_FLOAT32\n\nA tensor of 32 bit floating point values.\n\nANEURALNETWORKS_TENSOR_INT32\n\nA tensor of 32 bit integer values.\n\nANEURALNETWORKS_TENSOR_QUANT16_ASYMM\n\nA tensor of 16 bit unsigned integers that represent real numbers.\n\nAttached to this tensor are two numbers that can be used to convert the 16 bit integer to the real value and vice versa. These two numbers are:\n\n• scale: a 32 bit floating point value greater than zero.\n• zeroPoint: a 32 bit integer, in range [0, 65535].\n\nThe formula is: real_value = (integer_value - zeroPoint) * scale.\n\nAvailable since API level 29.\n\nANEURALNETWORKS_TENSOR_QUANT16_SYMM\n\nA tensor of 16 bit signed integers that represent real numbers.\n\nAttached to this tensor is a number representing real value scale that is used to convert the 16 bit number to a real value in the following way: realValue = integerValue * scale.\n\nscale is a 32 bit floating point with value greater than zero.\n\nAvailable since API level 29.\n\nANEURALNETWORKS_TENSOR_QUANT8_ASYMM\n\nA tensor of 8 bit unsigned integers that represent real numbers.\n\nAttached to this tensor are two numbers that can be used to convert the 8 bit integer to the real value and vice versa. These two numbers are:\n\n• scale: a 32 bit floating point value greater than zero.\n• zeroPoint: a 32 bit integer, in range [0, 255].\n\nThe formula is: real_value = (integer_value - zeroPoint) * scale.\n\nANEURALNETWORKS_TENSOR_QUANT8_ASYMM_SIGNED\n\nA tensor of 8 bit signed integers that represent real numbers.\n\nAttached to this tensor are two numbers that can be used to convert the 8 bit integer to the real value and vice versa. These two numbers are:\n\n• scale: a 32 bit floating point value greater than zero.\n• zeroPoint: a 32 bit integer, in range [-128, 127].\n\nThe formula is: real_value = (integer_value - zeroPoint) * scale.\n\nAvailable since API level 30.\n\nANEURALNETWORKS_TENSOR_QUANT8_SYMM\n\nA tensor of 8 bit signed integers that represent real numbers.\n\nAttached to this tensor is a number representing real value scale that is used to convert the 8 bit number to a real value in the following way: realValue = integerValue * scale.\n\nscale is a 32 bit floating point with value greater than zero.\n\nAvailable since API level 29.\n\nANEURALNETWORKS_TENSOR_QUANT8_SYMM_PER_CHANNEL\n\nA tensor of 8 bit signed integers that represent real numbers.\n\nThis tensor is associated with additional fields that can be used to convert the 8 bit signed integer to the real value and vice versa. These fields are:\n\n• channelDim: a 32 bit unsigned integer indicating channel dimension.\n• scales: an array of positive 32 bit floating point values. The size of the scales array must be equal to dimensions[channelDim].\n\nANeuralNetworksModel_setOperandSymmPerChannelQuantParams must be used to set the parameters for an Operand of this type.\n\nThe channel dimension of this tensor must not be unknown (dimensions[channelDim] != 0).\n\nThe formula is: realValue[..., C, ...] = integerValue[..., C, ...] * scales[C] where C is an index in the Channel dimension.\n\nAvailable since API level 29.\n\nANEURALNETWORKS_UINT32\n\nAn unsigned 32 bit integer scalar value.\n\n### OperationCode\n\n OperationCode\n\nOperation types.\n\nThe type of an operation in a model.\n\nAvailable since API level 27.\n\nProperties\nANEURALNETWORKS_ABS\n\nComputes the absolute value of a tensor, element-wise.\n\nSupported tensor OperandCode:\n\nSupported tensor rank: from 1.\n\nInputs:\n\n• 0: A tensor.\n\nOutputs:\n\n• 0: The output tensor of same shape as input0.\n\nAvailable since API level 29.\n\nANEURALNETWORKS_ADD\n\nTakes two input tensors of identical OperandCode and compatible dimensions. The output is the sum of both input tensors, optionally modified by an activation function.\n\nTwo dimensions are compatible when:\n\n1. they are equal, or\n2. one of them is 1\n\nThe size of the output is the maximum size along each dimension of the input operands. It starts with the trailing dimensions, and works its way forward.\n\nExample:\n\ninput1.dimension = {4, 1, 2}\ninput2.dimension = {5, 4, 3, 1}\noutput.dimension = {5, 4, 3, 2}\n\n\nSince API level 29, generic zero-sized input tensor is supported. Zero dimension is only compatible with 0 or 1. The size of the output dimension is zero if either of corresponding input dimension is zero.\n\nSupported tensor OperandCode:\n\nSupported tensor rank: up to 4\n\nInputs:\n\nOutputs:\n\nAvailable since API level 27.\n\nANEURALNETWORKS_ARGMAX\n\nReturns the index of the largest element along an axis.\n\nSupported tensor OperandCode:\n\nSupported tensor rank: from 1\n\nInputs:\n\n• 0: An n-D tensor specifying the input. Must be non-empty.\n• 1: An ANEURALNETWORKS_INT32 scalar specifying the axis to reduce across. Negative index is used to specify axis from the end (e.g. -1 for the last axis). Must be in the range [-n, n).\n\nOutputs:\n\nAvailable since API level 29.\n\nANEURALNETWORKS_ARGMIN\n\nReturns the index of the smallest element along an axis.\n\nSupported tensor OperandCode:\n\nSupported tensor rank: from 1\n\nInputs:\n\n• 0: An n-D tensor specifying the input. Must be non-empty.\n• 1: An ANEURALNETWORKS_INT32 scalar specifying the axis to reduce across. Negative index is used to specify axis from the end (e.g. -1 for the last axis). Must be in the range [-n, n).\n\nOutputs:\n\nAvailable since API level 29.\n\nANEURALNETWORKS_AVERAGE_POOL_2D\n\nPerforms a 2-D average pooling operation.\n\nThe output dimensions are functions of the filter dimensions, stride, and padding.\n\nThe values in the output tensor are computed as:\n\noutput[b, i, j, channel] =\nsum_{di, dj}(\ninput[b, strides * i + di, strides * j + dj, channel]\n) / sum(1)\n\n\nSupported tensor OperandCode:\n\nSupported tensor rank: 4, with \"NHWC\" or \"NCHW\" data layout. With the default data layout NHWC, the data is stored in the order of: [batch, height, width, channels]. Alternatively, the data layout could be NCHW, the data storage order of: [batch, channels, height, width]. NCHW is supported since API level 29.\n\n• 0: A 4-D tensor, of shape [batches, height, width, depth], specifying the input. Since API level 29, zero batches is supported for this tensor.\n• 1: An ANEURALNETWORKS_INT32 scalar, specifying the padding on the left, in the ‘width’ dimension.\n• 2: An ANEURALNETWORKS_INT32 scalar, specifying the padding on the right, in the ‘width’ dimension.\n• 3: An ANEURALNETWORKS_INT32 scalar, specifying the padding on the top, in the ‘height’ dimension.\n• 4: An ANEURALNETWORKS_INT32 scalar, specifying the padding on the bottom, in the ‘height’ dimension.\n• 5: An ANEURALNETWORKS_INT32 scalar, specifying the stride when walking through input in the ‘width’ dimension.\n• 6: An ANEURALNETWORKS_INT32 scalar, specifying the stride when walking through input in the ‘height’ dimension.\n• 7: An ANEURALNETWORKS_INT32 scalar, specifying the filter width.\n• 8: An ANEURALNETWORKS_INT32 scalar, specifying the filter height.\n• 9: An ANEURALNETWORKS_INT32 scalar, and has to be one of the FuseCode values. Specifies the activation to invoke on the result.\n• 10: An optional ANEURALNETWORKS_BOOL scalar, default to false. Set to true to specify NCHW data layout for input0 and output0. Available since API level 29.\n\n• 0: A 4-D tensor, of shape [batches, height, width, depth], specifying the input. Since API level 29, zero batches is supported for this tensor.\n• 1: An ANEURALNETWORKS_INT32 scalar, specifying the implicit padding scheme, has to be one of the PaddingCode values.\n• 2: An ANEURALNETWORKS_INT32 scalar, specifying the stride when walking through input in the ‘width’ dimension.\n• 3: An ANEURALNETWORKS_INT32 scalar, specifying the stride when walking through input in the ‘height’ dimension.\n• 4: An ANEURALNETWORKS_INT32 scalar, specifying the filter width.\n• 5: An ANEURALNETWORKS_INT32 scalar, specifying the filter height.\n• 6: An ANEURALNETWORKS_INT32 scalar, and has to be one of the FuseCode values. Specifies the activation to invoke on the result.\n• 7: An optional ANEURALNETWORKS_BOOL scalar, default to false. Set to true to specify NCHW data layout for input0 and output0. Available since API level 29.\n\nOutputs:\n\nAvailable since API level 27.\n\nANEURALNETWORKS_AXIS_ALIGNED_BBOX_TRANSFORM\n\nTransform axis-aligned bounding box proposals using bounding box deltas.\n\nGiven the positions of bounding box proposals and the corresponding bounding box deltas for each class, return the refined bounding box regions. The resulting bounding boxes are cliped against the edges of the image.\n\nSupported tensor OperandCode:\n\nInputs:\n\n• 0: A 2-D Tensor of shape [num_rois, 4], specifying the locations of the bounding box proposals, each line with format [x1, y1, x2, y2]. For tensor of type ANEURALNETWORKS_TENSOR_QUANT16_ASYMM, the zeroPoint must be 0 and the scale must be 0.125. Zero num_rois is supported for this tensor.\n• 1: A 2-D Tensor of shape [num_rois, num_classes * 4], specifying the bounding box delta for each region of interest and each class. The bounding box deltas are organized in the following order [dx, dy, dw, dh], where dx and dy is the relative correction factor for the center position of the bounding box with respect to the width and height, dw and dh is the log-scale relative correction factor for the width and height. For input0 of type ANEURALNETWORKS_TENSOR_QUANT16_ASYMM, this tensor should be of ANEURALNETWORKS_TENSOR_QUANT8_ASYMM or ANEURALNETWORKS_TENSOR_QUANT8_ASYMM_SIGNED. Zero num_rois is supported for this tensor.\n• 2: An 1-D ANEURALNETWORKS_TENSOR_INT32 tensor, of shape [num_rois], specifying the batch index of each box. Boxes with the same batch index are grouped together. Zero num_rois is supported for this tensor.\n• 3: A 2-D Tensor of shape [batches, 2], specifying the information of each image in the batch, each line with format [image_height, image_width].\n\nOutputs:\n\n• 0: A tensor of the same OperandCode as input0, with shape [num_rois, num_classes * 4], specifying the coordinates of each output bounding box for each class, with format [x1, y1, x2, y2]. For type of ANEURALNETWORKS_TENSOR_QUANT16_ASYMM, the scale must be 0.125 and the zero point must be 0.\n\nAvailable since API level 29.\n\nANEURALNETWORKS_BATCH_TO_SPACE_ND\n\nBatchToSpace for N-dimensional tensors.\n\nThis operation reshapes the batch dimension (dimension 0) into M + 1 dimensions of shape block_shape + [batch], interleaves these blocks back into the grid defined by the spatial dimensions [1, ..., M], to obtain a result with the same rank as the input.\n\nThis is the reverse of SpaceToBatch.\n\nSupported tensor OperandCode:\n\nSupported tensor rank: 4, with \"NHWC\" or \"NCHW\" data layout. With the default data layout NHWC, the data is stored in the order of: [batch, height, width, channels]. Alternatively, the data layout could be NCHW, the data storage order of: [batch, channels, height, width]. NCHW is supported since API level 29.\n\nInputs:\n\n• 0: An n-D tensor, specifying the tensor to be reshaped\n• 1: A 1-D Tensor of ANEURALNETWORKS_TENSOR_INT32, the block sizes for each spatial dimension of the input tensor. All values must be >= 1.\n• 2: An optional ANEURALNETWORKS_BOOL scalar, default to false. Set to true to specify NCHW data layout for input0 and output0. Available since API level 29.\n\nOutputs:\n\nAvailable since API level 28.\n\nANEURALNETWORKS_BIDIRECTIONAL_SEQUENCE_LSTM\n\nA recurrent neural network layer that applies an LSTM cell to a sequence of inputs in forward and backward directions.\n\nThe op supports cross-linking via an auxiliary input. Regular cell feeds one input into the two RNN cells in the following way:\n\n INPUT (INPUT_REVERSED)\n| |\n\n\n## | FW_LSTM BW_LSTM |\n\n| | FW_OUT BW_OUT\n\nAn op with cross-linking takes two inputs and feeds them into the RNN cells in the following way:\n\n AUX_INPUT (AUX_INPUT_REVERSED)\n| |\nINPUT | (INPUT_R'D.)|\n| | | |\n\n\n| \\ / \\ / |\n\n## | FW_LSTM BW_LSTM |\n\n| | FW_OUT BW_OUT\n\nThe cross-linking mode is enabled iff auxiliary input and auxiliary weights are present. While stacking this op on top of itself, this allows to connect both forward and backward outputs from previous cell to the next cell's input.\n\nSince API level 30 parallel linking mode is supported. The mode is enabled if auxiliary input is present but auxiliary weights are omitted. In this case, the cell feeds inputs into the RNN in the following way:\n\n INPUT (AUX_INPUT_REVERSED)\n| |\n\n\n## | FW_LSTM BW_LSTM |\n\n| | FW_OUT BW_OUT\n\nWhile stacking this op on top of itself, this allows to connect both forward and backward outputs from previous cell to the next cell's corresponding inputs.\n\nSupported tensor OperandCode:\n\nSupported tensor rank: 3, either time-major or batch-major.\n\nAll input and output tensors must be of the same type.\n\nInputs:\n\n• 0: The input. A 3-D tensor of shape: If time-major: [max_time, batch_size, input_size] If batch-major: [batch_size, max_time, input_size] where \"max_time\" is the number of timesteps (sequence length), \"batch_size\" corresponds to the batching dimension, and \"input_size\" is the size of the input.\n• 1: The forward input-to-input weights. Optional. A 2-D tensor of shape [fw_num_units, input_size], where “fw_num_units” corresponds to the number of forward cell units.\n• 2: The forward input-to-forget weights. A 2-D tensor of shape [fw_num_units, input_size].\n• 3: The forward input-to-cell weights. A 2-D tensor of shape [fw_num_units, input_size].\n• 4: The forward input-to-output weights. A 2-D tensor of shape [fw_num_units, input_size].\n• 5: The forward recurrent-to-input weights. Optional. A 2-D tensor of shape [fw_num_units, fw_output_size], where “fw_output_size” corresponds to either the number of cell units (i.e., fw_num_units), or the second dimension of the “fw_projection_weights”, if defined.\n• 6: The forward recurrent-to-forget weights. A 2-D tensor of shape [fw_num_units, fw_output_size].\n• 7: The forward recurrent-to-cell weights. A 2-D tensor of shape [fw_num_units, fw_output_size].\n• 8: The forward recurrent-to-output weights. A 2-D tensor of shape [fw_num_units, fw_output_size].\n• 9: The forward cell-to-input weights. Optional. A 1-D tensor of shape [fw_num_units].\n• 10: The forward cell-to-forget weights. Optional. A 1-D tensor of shape [fw_num_units].\n• 11: The forward cell-to-output weights. Optional. A 1-D tensor of shape [fw_num_units].\n• 12: The forward input gate bias. Optional. A 1-D tensor of shape [fw_num_units].\n• 13: The forward forget gate bias. A 1-D tensor of shape [fw_num_units].\n• 14: The forward cell gate bias. A 1-D tensor of shape [fw_num_units].\n• 15: The forward output gate bias. A 1-D tensor of shape [fw_num_units].\n• 16: The forward projection weights. Optional. A 2-D tensor of shape [fw_output_size, fw_num_units].\n• 17: The forward projection bias. Optional. A 1-D tensor of shape [fw_output_size].\n• 18: The backward input-to-input weights. Optional. A 2-D tensor of shape [bw_num_units, input_size], where “bw_num_units” corresponds to the number of backward cell units.\n• 19: The backward input-to-forget weights. A 2-D tensor of shape [bw_num_units, input_size].\n• 20: The backward input-to-cell weights. A 2-D tensor of shape [bw_num_units, input_size].\n• 21: The backward input-to-output weights. A 2-D tensor of shape [bw_num_units, input_size].\n• 22: The backward recurrent-to-input weights. Optional. A 2-D tensor of shape [bw_num_units, bw_output_size], where “bw_output_size” corresponds to either the number of cell units (i.e., “bw_num_units”), or the second dimension of the “bw_projection_weights”, if defined.\n• 23: The backward recurrent-to-forget weights. A 2-D tensor of shape [bw_num_units, bw_output_size].\n• 24: The backward recurrent-to-cell weights. A 2-D tensor of shape [bw_num_units, bw_output_size].\n• 25: The backward recurrent-to-output weights. A 2-D tensor of shape [bw_num_units, bw_output_size].\n• 26: The backward cell-to-input weights. Optional. A 1-D tensor of shape [bw_num_units].\n• 27: The backward cell-to-forget weights. Optional. A 1-D tensor of shape [bw_num_units].\n• 28: The backward cell-to-output weights. Optional. A 1-D tensor of shape [bw_num_units].\n• 29: The backward input gate bias. Optional. A 1-D tensor of shape [bw_num_units].\n• 30: The backward forget gate bias. A 1-D tensor of shape [bw_num_units].\n• 31: The backward cell gate bias. A 1-D tensor of shape [bw_num_units].\n• 32: The backward output gate bias. A 1-D tensor of shape [bw_num_units].\n• 33: The backward projection weights. Optional. A 2-D tensor of shape [bw_output_size, bw_num_units].\n• 34: The backward projection bias. Optional. A 1-D tensor of shape [bw_output_size].\n• 35: The forward input activation state. A 2-D tensor of shape [batch_size, bw_output_size].\n• 36: The forward input cell state. A 2-D tensor of shape [batch_size, bw_num_units].\n• 37: The backward input activation state. A 2-D tensor of shape [batch_size, bw_output_size].\n• 38: The backward input cell state. A 2-D tensor of shape [batch_size, bw_num_units].\n• 39: The auxiliary input. Optional. A 3-D tensor of shape [max_time, batch_size, aux_input_size], where “batch_size” corresponds to the batching dimension, and “aux_input_size” is the size of the auxiliary input. Optional. See the docs above for the usage modes explanation.\n• 40: The forward auxiliary input-to-input weights. Optional. See the docs above for the usage modes explanation. A 2-D tensor of shape [fw_num_units, aux_input_size].\n• 41: The forward auxiliary input-to-forget weights. Optional. See the docs above for the usage modes explanation. A 2-D tensor of shape [fw_num_units, aux_input_size].\n• 42: The forward auxiliary input-to-cell weights. Optional. See the docs above for the usage modes explanation. A 2-D tensor of shape [fw_num_units, aux_input_size].\n• 43: The forward auxiliary input-to-output weights. Optional. See the docs above for the usage modes explanation. A 2-D tensor of shape [fw_num_units, aux_input_size].\n• 44: The backward auxiliary input-to-input weights. Optional. See the docs above for the usage modes explanation. A 2-D tensor of shape [bw_num_units, aux_input_size].\n• 45: The backward auxiliary input-to-forget weights. Optional. See the docs above for the usage modes explanation. A 2-D tensor of shape [bw_num_units, aux_input_size].\n• 46: The backward auxiliary input-to-cell weights. Optional. See the docs above for the usage modes explanation. A 2-D tensor of shape [bw_num_units, aux_input_size].\n• 47: The backward auxiliary input-to-output weights. Optional. See the docs above for the usage modes explanation. A 2-D tensor of shape [bw_num_units, aux_input_size].\n• 48: The activation function. A value indicating the activation function:\n• 0: None;\n• 1: Relu;\n• 3: Relu6;\n• 4: Tanh;\n• 6: Sigmoid.\n• 49: The clipping threshold for the cell state, such that values are bound within [-cell_clip, cell_clip]. If set to 0.0 then clipping is disabled. If all the input tensors have type ANEURALNETWORKS_TENSOR_FLOAT32, this scalar must be of the type ANEURALNETWORKS_FLOAT32, otherwise if all the input tensors have the type ANEURALNETWORKS_TENSOR_FLOAT16, this scalar must be of type ANEURALNETWORKS_FLOAT16.\n• 50: The clipping threshold for the output from the projection layer, such that values are bound within [-proj_clip, proj_clip]. If set to 0.0 then clipping is disabled. If all the input tensors have type ANEURALNETWORKS_TENSOR_FLOAT32, this scalar must be of the type ANEURALNETWORKS_FLOAT32, otherwise if all the input tensors have the type ANEURALNETWORKS_TENSOR_FLOAT16, this scalar must be of type ANEURALNETWORKS_FLOAT16.\n• 51: merge_outputs An ANEURALNETWORKS_BOOL scalar specifying if the outputs from forward and backward cells should be merged.\n• 52: time_major An ANEURALNETWORKS_BOOL scalar specifying the shape format of input and output tensors.\n• 53: The forward input layer normalization weights. Optional. A 1-D tensor of shape [fw_num_units]. Used to rescale normalized inputs to activation at input gate.\n• 54: The forward forget layer normalization weights. Optional. A 1-D tensor of shape [fw_num_units]. Used to rescale normalized inputs to activation at forget gate.\n• 55: The forward cell layer normalization weights. Optional. A 1-D tensor of shape [fw_num_units]. Used to rescale normalized inputs to activation at cell gate.\n• 56: The forward output layer normalization weights. Optional. A 1-D tensor of shape [fw_num_units]. Used to rescale normalized inputs to activation at output gate.\n• 57: The backward input layer normalization weights. Optional. A 1-D tensor of shape [bw_num_units]. Used to rescale normalized inputs to activation at input gate.\n• 58: The backward forget layer normalization weights. Optional. A 1-D tensor of shape [bw_num_units]. Used to rescale normalized inputs to activation at forget gate.\n• 59: The backward cell layer normalization weights. Optional. A 1-D tensor of shape [bw_num_units]. Used to rescale normalized inputs to activation at cell gate.\n• 60: The backward output layer normalization weights. Optional. A 1-D tensor of shape [bw_num_units]. Used to rescale normalized inputs to activation at output gate.\n\nOutputs:\n\n• 0: The forward output. A 3-D tensor of shape: If time-major and not merge_outputs: [max_time, batch_size, fw_output_size] If time-major and merge_outputs: [max_time, batch_size, fw_output_size + bw_output_size] If batch-major and not merge_outputs: [batch_size, max_time, fw_output_size] If batch-major and merge_outputs: [batch_size, max_time, fw_output_size + bw_output_size]\n• 1: The backward output. Unused if merge_outputs is true. A 3-D tensor of shape: If time-major: [max_time, batch_size, bw_output_size] If batch-major: [batch_size, max_time, bw_output_size]\n• 2: The forward activation state output. A 2-D tensor of shape [batch_size, fw_output_size] containing an activation state from the last time step in the sequence. This output is optional and can be omitted. If this output is present then outputs 3-5 must be present as well. Available since API level 30.\n• 3: The forward cell state output. A tensor of shape [batch_size, fw_cell_size] containing a cell state from the last time step in the sequence. This output is optional and can be omitted. If this output is present then outputs 2, 4, 5 must be present as well. Available since API level 30.\n• 4: The backward activation state output. A 2-D tensor of shape [batch_size, bw_output_size] containing an activation state from the last time step in the sequence. This output is optional and can be omitted. If this output is present then outputs 2, 3, 5 must be present as well. Available since API level 30.\n• 5: The backward cell state output. A tensor of shape [batch_size, bw_cell_size] containing a cell state from the last time step in the sequence. This output is optional and can be omitted. If this output is present then outputs 2-4 must be present as well. Available since API level 30.\n\nAvailable since API level 29.\n\nImportant: As of API level 29, there is no way to get the output state tensors out and NNAPI does not maintain internal states. This operator does not support the usage pattern in which multiple cells are chained and state tensors are propagated.\n\nANEURALNETWORKS_BIDIRECTIONAL_SEQUENCE_RNN\n\nA recurrent neural network layer that applies a basic RNN cell to a sequence of inputs in forward and backward directions.\n\nThis Op unrolls the input along the sequence dimension, and implements the following operation for each element in the sequence s = 1...sequence_length: fw_outputs[s] = fw_state = activation(inputs[s] * fw_input_weights’ + fw_state * fw_recurrent_weights’ + fw_bias)\n\nAnd for each element in sequence t = sequence_length : 1 bw_outputs[t] = bw_state = activation(inputs[t] * bw_input_weights’ + bw_state * bw_recurrent_weights’ + bw_bias)\n\nWhere:\n\n• “{fw,bw}_input_weights” is a weight matrix that multiplies the inputs;\n• “{fw,bw}_recurrent_weights” is a weight matrix that multiplies the current “state” which itself is the output from the previous time step computation;\n• “{fw,bw}_bias” is a bias vector (added to each output vector in the batch);\n• “activation” is the function passed as the “fused_activation_function” argument (if not “NONE”).\n\nThe op supports cross-linking via an auxiliary input. Regular cell feeds one input into the two RNN cells in the following way:\n\n INPUT (INPUT_REVERSED)\n| |\n\n\n## | FW_RNN BW_RNN |\n\n| | FW_OUT BW_OUT\n\nAn op with cross-linking takes two inputs and feeds them into the RNN cells in the following way:\n\n AUX_INPUT (AUX_INPUT_REVERSED)\n| |\nINPUT | (INPUT_R'D.)|\n| | | |\n\n\n| \\ / \\ / |\n\n## | FW_RNN BW_RNN |\n\n| | FW_OUT BW_OUT\n\nThe cross-linking mode is enabled iff auxiliary input and auxiliary weights are present. While stacking this op on top of itself, this allows to connect both forward and backward outputs from previous cell to the next cell's input.\n\nSince API level 30 parallel linking mode is supported. The mode is enabled if auxiliary input is present but auxiliary weights are omitted. In this case, the cell feeds inputs into the RNN in the following way:\n\n INPUT (AUX_INPUT_REVERSED)\n| |\n\n\n## | FW_RNN BW_RNN |\n\n| | FW_OUT BW_OUT\n\nWhile stacking this op on top of itself, this allows to connect both forward and backward outputs from previous cell to the next cell's corresponding inputs.\n\nSupported tensor OperandCode:\n\nThe input tensors must all be the same type.\n\nInputs:\n\n• 0: input. A 3-D tensor. The shape is defined by the input 6 (timeMajor). If it is set to true, then the input has a shape [maxTime, batchSize, inputSize], otherwise the input has a shape [batchSize, maxTime, inputSize].\n• 1: fwWeights. A 2-D tensor of shape [fwNumUnits, inputSize].\n• 2: fwRecurrentWeights. A 2-D tensor of shape [fwNumUnits, fwNumUnits].\n• 3: fwBias. A 1-D tensor of shape [fwNumUnits].\n• 4: fwHiddenState. A 2-D tensor of shape [batchSize, fwNumUnits]. Specifies a hidden state input for the first time step of the computation.\n• 5: bwWeights. A 2-D tensor of shape [bwNumUnits, inputSize].\n• 6: bwRecurrentWeights. A 2-D tensor of shape [bwNumUnits, bwNumUnits].\n• 7: bwBias. A 1-D tensor of shape [bwNumUnits].\n• 8: bwHiddenState A 2-D tensor of shape [batchSize, bwNumUnits]. Specifies a hidden state input for the first time step of the computation.\n• 9: auxInput. A 3-D tensor. The shape is defined by the input 6 (timeMajor). If it is set to true, then the input has a shape [maxTime, batchSize, auxInputSize], otherwise the input has a shape [batchSize, maxTime, auxInputSize]. Can be omitted. See the docs above for the usage modes explanation.\n• 10:fwAuxWeights. A 2-D tensor of shape [fwNumUnits, auxInputSize]. Can be omitted. See the docs above for the usage modes explanation.\n• 11:bwAuxWeights. A 2-D tensor of shape [bwNumUnits, auxInputSize]. Can be omitted. See the docs above for the usage modes explanation.\n• 12:fusedActivationFunction. A FuseCode value indicating the activation function. If “NONE” is specified then it results in a linear activation.\n• 13:timeMajor An ANEURALNETWORKS_BOOL scalar specifying the shape format of input and output tensors.\n• 14:mergeOutputs An ANEURALNETWORKS_BOOL scalar specifying if the outputs from forward and backward cells are separate (if set to false) or concatenated (if set to true). Outputs:\n• 0: fwOutput. A 3-D tensor. The first two dimensions of the shape are defined by the input 6 (timeMajor) and the third dimension is defined by the input 14 (mergeOutputs). If timeMajor is set to true, then the first two dimensions are [maxTime, batchSize], otherwise they are set to [batchSize, maxTime]. If mergeOutputs is set to true, then the third dimension is equal to (fwNumUnits + bwNumUnits), otherwise it is set to fwNumUnits.\n• 1: bwOutput. A 3-D tensor. If the input 14 (mergeOutputs) is set to true, then this tensor is not produced. The shape is defined by the input 6 (timeMajor). If it is set to true, then the shape is set to [maxTime, batchSize, bwNumUnits], otherwise the shape is set to [batchSize, maxTime, bwNumUnits].\n• 2: The forward hidden state output. A 2-D tensor of shape [batchSize, fwNumUnits] containing a hidden state from the last time step in the sequence. This output is optional and can be omitted. If this output is present then output 3 must be present as well. Available since API level 30.\n• 3: The backward hidden state output. A 2-D tensor of shape [batchSize, bwNumUnits] containing a hidden state from the last time step in the sequence. This output is optional and can be omitted. If this output is present then output 2 must be present as well. Available since API level 30.\n\nAvailable since API level 29.\n\nImportant: As of API level 29, there is no way to get the output state tensors out and NNAPI does not maintain internal states. This operator does not support the usage pattern in which multiple cells are chained and state tensors are propagated.\n\nANEURALNETWORKS_BOX_WITH_NMS_LIMIT\n\nGreedily selects a subset of bounding boxes in descending order of score.\n\nThis op applies NMS algorithm to each class. In each loop of execution, the box with maximum score gets selected and removed from the pending set. The scores of the rest of boxes are lowered according to the intersection-over-union (IOU) overlapping with the previously selected boxes and a specified NMS kernel method. Any boxes with score less than a threshold are removed from the pending set.\n\nThree NMS kernels are supported:\n\n• Hard: score_new = score_old * (1 if IoU < threshold else 0)\n• Linear: score_new = score_old * (1 if IoU < threshold else 1 - IoU)\n• Gaussian: score_new = score_old * exp(- IoU^2 / sigma)\n\nAxis-aligned bounding boxes are represented by its upper-left corner coordinate (x1,y1) and lower-right corner coordinate (x2,y2). A valid bounding box should satisfy x1 <= x2 and y1 <= y2.\n\nSupported tensor OperandCode:\n\nInputs:\n\n• 0: A 2-D Tensor of shape [num_rois, num_classes], specifying the score of each bounding box proposal. The boxes are grouped by batches in the first dimension. Zero num_rois is supported for this tensor.\n• 1: A 2-D Tensor specifying the bounding boxes of shape [num_rois, num_classes * 4], organized in the order [x1, y1, x2, y2]. The boxes are grouped by batches in the first dimension. The sequential order of the boxes corresponds with input0. For input0 of type ANEURALNETWORKS_TENSOR_QUANT8_ASYMM, this tensor should be of ANEURALNETWORKS_TENSOR_QUANT16_ASYMM, with zeroPoint of 0 and scale of 0.125. For input0 of type ANEURALNETWORKS_TENSOR_QUANT8_ASYMM_SIGNED, this tensor should be of ANEURALNETWORKS_TENSOR_QUANT16_ASYMM, with zeroPoint of -128 and scale of 0.125. Zero num_rois is supported for this tensor.\n• 2: A 1-D ANEURALNETWORKS_TENSOR_INT32 tensor, of shape [num_rois], specifying the batch index of each box. Boxes with the same batch index are grouped together.\n• 3: An ANEURALNETWORKS_FLOAT32 scalar, score_threshold. Boxes with scores lower than the threshold are filtered before sending to the NMS algorithm.\n• 4: An ANEURALNETWORKS_INT32 scalar, specifying the maximum number of selected bounding boxes for each image. Set to a negative value for unlimited number of output bounding boxes.\n• 5: An ANEURALNETWORKS_INT32 scalar, specifying the NMS kernel method, options are 0:hard, 1:linear, 2:gaussian.\n• 6: An ANEURALNETWORKS_FLOAT32 scalar, specifying the IoU threshold in hard and linear NMS kernel. This field is ignored if gaussian kernel is selected.\n• 7: An ANEURALNETWORKS_FLOAT32 scalar, specifying the sigma in gaussian NMS kernel. This field is ignored if gaussian kernel is not selected.\n• 8: An ANEURALNETWORKS_FLOAT32 scalar, nms_score_threshold. Boxes with scores lower than the threshold are dropped during the score updating phase in soft NMS.\n\nOutputs:\n\nAvailable since API level 29.\n\nANEURALNETWORKS_CAST\n\nCasts a tensor to a type.\n\nThis operation ignores the scale and zeroPoint of quanized tensors, e.g. it treats a ANEURALNETWORKS_TENSOR_QUANT8_ASYMM input as a tensor of uint8 values.\n\nSupported tensor OperandCode:\n\nSupported tensor rank: from 1\n\nInputs:\n\n• 0: A tensor.\n\nOutputs:\n\n• 0: A tensor with the same shape as input0.\n\nAvailable since API level 29.\n\nANEURALNETWORKS_CHANNEL_SHUFFLE\n\nShuffle the channels of the input tensor.\n\nGiven an input tensor and a integer value of num_groups, CHANNEL_SHUFFLE divide the channel dimension into num_groups groups, and reorganize the channels by grouping channels with the same index in each group.\n\nAlong the channel dimension, the output is calculated using this formula:\n\noutput_channel[k * num_groups + g] = input_channel[g * group_size + k]\n\n\nwhere group_size = num_channels / num_groups\n\nThe number of channels must be divisible by num_groups.\n\nSupported tensor OperandCode:\n\nSupported tensor rank: up to 4\n\nInputs:\n\n• 0: An n-D tensor, specifying the tensor to be shuffled.\n• 1: An ANEURALNETWORKS_INT32 scalar, specifying the number of groups.\n• 2: An ANEURALNETWORKS_INT32 scalar, specifying the dimension channel shuffle would be performed on. Negative index is used to specify axis from the end (e.g. -1 for the last axis). Must be in the range [-n, n).\n\nOutputs:\n\nAvailable since API level 29.\n\nANEURALNETWORKS_CONCATENATION\n\nConcatenates the input tensors along the given dimension.\n\nThe input tensors must have identical OperandCode and the same dimensions except the dimension along the concatenation axis.\n\nSupported tensor OperandCode:\n\nSupported tensor rank: up to 4\n\nInputs:\n\nOutputs:\n\n• 0: The output, a tensor of the same OperandCode as the input tensors. The output shape is [D0, D1, ..., sum(Daxis(i)), ..., Dm]. Since API level 29, for a ANEURALNETWORKS_TENSOR_QUANT8_ASYMM tensor, the scale and zeroPoint values can be different from input tensors. Before API level 29 they have to be the same as for the input tensors.\n\nAvailable since API level 27.\n\nANEURALNETWORKS_CONV_2D\n\nPerforms a 2-D convolution operation.\n\nThe CONV_2D op sweeps a 2-D filter that can mix channels together over a batch of images, applying the filter to each window of each image of the appropriate size.\n\nThe output dimensions are functions of the filter dimensions, stride, and padding.\n\nThe values in the output tensor are computed as:\n\noutput[b, i, j, channel] =\nsum_{di, dj, k} (\ninput[b, strides * i + di, strides * j + dj, k] *\nfilter[channel, di, dj, k]\n) + bias[channel]\n\n\nSupported tensor OperandCode configurations:\n\nAvailable since API level 29:\n\nAvailable since API level 30:\n\nSupported tensor rank: 4, with \"NHWC\" or \"NCHW\" data layout. With the default data layout NHWC, the data is stored in the order of: [batch, height, width, channels]. Alternatively, the data layout could be NCHW, the data storage order of: [batch, channels, height, width]. NCHW is supported since API level 29.\n\n• 0: A 4-D tensor, of shape [batches, height, width, depth_in], specifying the input. Since API level 29, zero batches is supported for this tensor.\n• 1: A 4-D tensor, of shape [depth_out, filter_height, filter_width, depth_in], specifying the filter. For tensor of type ANEURALNETWORKS_TENSOR_QUANT8_SYMM_PER_CHANNEL the channel dimension (ANeuralNetworksSymmPerChannelQuantParams::channelDim) must be set to 0.\n• 2: A 1-D tensor, of shape [depth_out], specifying the bias. For input tensor of type ANEURALNETWORKS_TENSOR_FLOAT32 or ANEURALNETWORKS_TENSOR_FLOAT16 the bias must be of the same type. For filter tensor of ANEURALNETWORKS_TENSOR_QUANT8_ASYMM and ANEURALNETWORKS_TENSOR_QUANT8_ASYMM_SIGNED, the bias should be of ANEURALNETWORKS_TENSOR_INT32, with zeroPoint of 0 and bias_scale == input_scale * filter_scale. For filter tensor of ANEURALNETWORKS_TENSOR_QUANT8_SYMM_PER_CHANNEL, the bias should be of ANEURALNETWORKS_TENSOR_INT32, with zeroPoint of 0 and bias_scale of 0. The actual scale of each value 'i' is equal to bias_scale[i] = input_scale * filter_scale[i].\n• 3: An ANEURALNETWORKS_INT32 scalar, specifying the padding on the left, in the ‘width’ dimension.\n• 4: An ANEURALNETWORKS_INT32 scalar, specifying the padding on the right, in the ‘width’ dimension.\n• 5: An ANEURALNETWORKS_INT32 scalar, specifying the padding on the top, in the ‘height’ dimension.\n• 6: An ANEURALNETWORKS_INT32 scalar, specifying the padding on the bottom, in the ‘height’ dimension.\n• 7: An ANEURALNETWORKS_INT32 scalar, specifying the stride when walking through input in the ‘width’ dimension.\n• 8: An ANEURALNETWORKS_INT32 scalar, specifying the stride when walking through input in the ‘height’ dimension.\n• 9: An ANEURALNETWORKS_INT32 scalar, and has to be one of the FuseCode values. Specifies the activation to invoke on the result.\n• 10: An optional ANEURALNETWORKS_BOOL scalar, default to false. Set to true to specify NCHW data layout for input0 and output0. Available since API level 29.\n• 11: An optional ANEURALNETWORKS_INT32 scalar, specifying the dilation factor for width. Defaults to 1. If set to k > 1, there will be k-1 skipped cells between each filter element on width dimension. If this input is set, input 12 (dilation factor for height) must be specified as well. Available since API level 29.\n• 12: An optional ANEURALNETWORKS_INT32 scalar, specifying the dilation factor for height. Defaults to 1. If set to k > 1, there will be k-1 skipped cells between each filter element on height dimension. If this input is set, input 11 (dilation factor for width) must be specified as well. Available since API level 29.\n\n• 0: A 4-D tensor, of shape [batches, height, width, depth_in], specifying the input. Since API level 29, zero batches is supported for this tensor.\n• 1: A 4-D tensor, of shape [depth_out, filter_height, filter_width, depth_in], specifying the filter. For tensor of type ANEURALNETWORKS_TENSOR_QUANT8_SYMM_PER_CHANNEL the channel dimension (ANeuralNetworksSymmPerChannelQuantParams::channelDim) must be set to 0.\n• 2: A 1-D tensor, of shape [depth_out], specifying the bias. For input tensor of type ANEURALNETWORKS_TENSOR_FLOAT32 or ANEURALNETWORKS_TENSOR_FLOAT16 the bias must be of the same type. For filter tensor of ANEURALNETWORKS_TENSOR_QUANT8_ASYMM and ANEURALNETWORKS_TENSOR_QUANT8_ASYMM_SIGNED, the bias should be of ANEURALNETWORKS_TENSOR_INT32, with zeroPoint of 0 and bias_scale == input_scale * filter_scale. For filter tensor of ANEURALNETWORKS_TENSOR_QUANT8_SYMM_PER_CHANNEL, the bias should be of ANEURALNETWORKS_TENSOR_INT32, with zeroPoint of 0 and bias_scale of 0. The actual scale of each value 'i' is equal to bias_scale[i] = input_scale * filter_scale[i].\n• 3: An ANEURALNETWORKS_INT32 scalar, specifying the implicit padding scheme, has to be one of the PaddingCode values.\n• 4: An ANEURALNETWORKS_INT32 scalar, specifying the stride when walking through input in the ‘width’ dimension.\n• 5: An ANEURALNETWORKS_INT32 scalar, specifying the stride when walking through input in the ‘height’ dimension.\n• 6: An ANEURALNETWORKS_INT32 scalar, and has to be one of the FuseCode values. Specifies the activation to invoke on the result.\n• 7: An optional ANEURALNETWORKS_BOOL scalar, default to false. Set to true to specify NCHW data layout for input0 and output0. Available since API level 29.\n• 8: An optional ANEURALNETWORKS_INT32 scalar, specifying the dilation factor for width. Defaults to 1. If set to k > 1, there will be k-1 skipped cells between each filter element on width dimension. If this input is set, input 9 (dilation factor for height) must be specified as well. Available since API level 29.\n• 9: An optional ANEURALNETWORKS_INT32 scalar, specifying the dilation factor for height. Defaults to 1. If set to k > 1, there will be k-1 skipped cells between each filter element on height dimension. If this input is set, input 8 (dilation factor for width) must be specified as well. Available since API level 29.\n\nOutputs:\n\n• 0: The output 4-D tensor, of shape [batches, out_height, out_width, depth_out]. Before API level 29, for output tensor of ANEURALNETWORKS_TENSOR_QUANT8_ASYMM, the following condition must be satisfied: output_scale > input_scale * filter_scale\n\nAvailable since API level 27.\n\nANEURALNETWORKS_DEPTHWISE_CONV_2D\n\nPerforms a depthwise 2-D convolution operation.\n\nGiven an input tensor of shape [batches, height, width, depth_in] and a filter tensor of shape [1, filter_height, filter_width, depth_out] containing depth_out convolutional filters of depth 1, DEPTHWISE_CONV applies a different filter to each input channel (expanding from 1 channel to channel_multiplier channels for each), then concatenates the results together.\n\nThe output has depth_out = depth_in * depth_multiplier channels. The output dimensions are functions of the filter dimensions, stride, and padding.\n\nThe values in the output tensor are computed as:\n\noutput[b, i, j, k * channel_multiplier + q] =\nsum_{di, dj} (\ninput[b, strides * i + di, strides * j + dj, k] *\nfilter[1, di, dj, k * channel_multiplier + q]\n) + bias[k * channel_multiplier + q]\n\n\nSupported tensor OperandCode configurations:\n\nAvailable since API level 29:\n\nAvailable since API level 30:\n\nSupported tensor rank: 4, with \"NHWC\" or \"NCHW\" data layout. With the default data layout NHWC, the data is stored in the order of: [batch, height, width, channels]. Alternatively, the data layout could be NCHW, the data storage order of: [batch, channels, height, width]. NCHW is supported since API level 29.\n\n• 0: A 4-D tensor, of shape [batches, height, width, depth_in], specifying the input.\n• 1: A 4-D tensor, of shape [1, filter_height, filter_width, depth_out], specifying the filter. For tensor of type ANEURALNETWORKS_TENSOR_QUANT8_SYMM_PER_CHANNEL the channel dimension (ANeuralNetworksSymmPerChannelQuantParams::channelDim) must be set to 3.\n• 2: A 1-D tensor, of shape [depth_out], specifying the bias. For input tensor of type ANEURALNETWORKS_TENSOR_FLOAT32 or ANEURALNETWORKS_TENSOR_FLOAT16 the bias must be of the same type. For filter tensor of ANEURALNETWORKS_TENSOR_QUANT8_ASYMM and ANEURALNETWORKS_TENSOR_QUANT8_ASYMM_SIGNED, the bias should be of ANEURALNETWORKS_TENSOR_INT32, with zeroPoint of 0 and bias_scale == input_scale * filter_scale. For filter tensor of ANEURALNETWORKS_TENSOR_QUANT8_SYMM_PER_CHANNEL, the bias should be of ANEURALNETWORKS_TENSOR_INT32, with zeroPoint of 0 and bias_scale of 0. The actual scale of each value 'i' is equal to bias_scale[i] = input_scale * filter_scale[i].\n• 3: An ANEURALNETWORKS_INT32 scalar, specifying the padding on the left, in the ‘width’ dimension.\n• 4: An ANEURALNETWORKS_INT32 scalar, specifying the padding on the right, in the ‘width’ dimension.\n• 5: An ANEURALNETWORKS_INT32 scalar, specifying the padding on the top, in the ‘height’ dimension.\n• 6: An ANEURALNETWORKS_INT32 scalar, specifying the padding on the bottom, in the ‘height’ dimension.\n• 7: An ANEURALNETWORKS_INT32 scalar, specifying the stride when walking through input in the ‘width’ dimension.\n• 8: An ANEURALNETWORKS_INT32 scalar, specifying the stride when walking through input in the ‘height’ dimension.\n• 9: An ANEURALNETWORKS_INT32 scalar, specifying the depthwise multiplier.\n• 10: An ANEURALNETWORKS_INT32 scalar, and has to be one of the FuseCode values. Specifies the activation to invoke on the result.\n• 11: An optional ANEURALNETWORKS_BOOL scalar, default to false. Set to true to specify NCHW data layout for input0 and output0. Available since API level 29.\n• 12: An optional ANEURALNETWORKS_INT32 scalar, specifying the dilation factor for width. Defaults to 1. If set to k > 1, there will be k-1 skipped cells between each filter element on width dimension. If this input is set, input 13 (dilation factor for height) must be specified as well. Available since API level 29.\n• 13: An optional ANEURALNETWORKS_INT32 scalar, specifying the dilation factor for height. Defaults to 1. If set to k > 1, there will be k-1 skipped cells between each filter element on height dimension. If this input is set, input 12 (dilation factor for width) must be specified as well. Available since API level 29.\n\n• 0: A 4-D tensor, of shape [batches, height, width, depth_in], specifying the input.\n• 1: A 4-D tensor, of shape [1, filter_height, filter_width, depth_out], specifying the filter.\n• 2: A 1-D tensor, of shape [depth_out], specifying the bias. For input tensor of type ANEURALNETWORKS_TENSOR_FLOAT32 or ANEURALNETWORKS_TENSOR_FLOAT16 the bias must be of the same type. For filter tensor of ANEURALNETWORKS_TENSOR_QUANT8_ASYMM and ANEURALNETWORKS_TENSOR_QUANT8_ASYMM_SIGNED, the bias should be of ANEURALNETWORKS_TENSOR_INT32, with zeroPoint of 0 and bias_scale == input_scale * filter_scale. For filter tensor of ANEURALNETWORKS_TENSOR_QUANT8_SYMM_PER_CHANNEL, the bias should be of ANEURALNETWORKS_TENSOR_INT32, with zeroPoint of 0 and bias_scale of 0. The actual scale of each value 'i' is equal to bias_scale[i] = input_scale * filter_scale[i].\n• 3: An ANEURALNETWORKS_INT32 scalar, specifying the implicit padding scheme, has to be one of the PaddingCode values.\n• 4: An ANEURALNETWORKS_INT32 scalar, specifying the stride when walking through input in the ‘width’ dimension.\n• 5: An ANEURALNETWORKS_INT32 scalar, specifying the stride when walking through input in the ‘height’ dimension.\n• 6: An ANEURALNETWORKS_INT32 scalar, specifying the depthwise multiplier.\n• 7: An ANEURALNETWORKS_INT32 scalar, and has to be one of the FuseCode values. Specifies the activation to invoke on the result.\n• 8: An optional ANEURALNETWORKS_BOOL scalar, default to false. Set to true to specify NCHW data layout for input0 and output0. Available since API level 29.\n• 9: An optional ANEURALNETWORKS_INT32 scalar, specifying the dilation factor for width. Defaults to 1. If set to k > 1, there will be k-1 skipped cells between each filter element on width dimension. If this input is set, input 10 (dilation factor for height) must be specified as well. Available since API level 29.\n• 10: An optional ANEURALNETWORKS_INT32 scalar, specifying the dilation factor for height. Defaults to 1. If set to k > 1, there will be k-1 skipped cells between each filter element on height dimension. If this input is set, input 9 (dilation factor for width) must be specified as well. Available since API level 29.\n\nOutputs:\n\n• 0: The output 4-D tensor, of shape [batches, out_height, out_width, depth_out]. Before API level 29, for output tensor of ANEURALNETWORKS_TENSOR_QUANT8_ASYMM, the following condition must be satisfied: output_scale > input_scale * filter_scale\n\nAvailable since API level 27.\n\nANEURALNETWORKS_DEPTH_TO_SPACE\n\nRearranges data from depth into blocks of spatial data.\n\nMore specifically, this op outputs a copy of the input tensor where values from the depth dimension are moved in spatial blocks to the height and width dimensions. The value block_size indicates the input block size and how the data is moved.\n\nChunks of data of size block_size * block_size from depth are rearranged into non-overlapping blocks of size block_size x block_size.\n\nThe width of the output tensor is input_depth * block_size, whereas the height is input_height * block_size. The depth of the input tensor must be divisible by block_size * block_size\n\nSupported tensor OperandCode:\n\nSupported tensor rank: 4, with \"NHWC\" or \"NCHW\" data layout. With the default data layout NHWC, the data is stored in the order of: [batch, height, width, channels]. Alternatively, the data layout could be NCHW, the data storage order of: [batch, channels, height, width]. NCHW is supported since API level 29.\n\nInputs:\n\n• 0: A 4-D tensor, of shape [batches, height, width, depth_in], specifying the input.\n• 1: An ANEURALNETWORKS_INT32 scalar, specifying the block_size. block_size must be >=1 and block_size * block_size must be a divisor of the input depth.\n• 2: An optional ANEURALNETWORKS_BOOL scalar, default to false. Set to true to specify NCHW data layout for input0 and output0. Available since API level 29.\n\nOutputs:\n\nAvailable since API level 27.\n\nANEURALNETWORKS_DEQUANTIZE\n\nDequantizes the input tensor.\n\nThe formula is:\n\noutput = (input - zeroPoint) * scale.\n\n\nSupported input tensor OperandCode:\n\nSupported output tensor OperandCode:\n\nSupported tensor rank: up to 4\n\nInputs:\n\n• 0: A tensor. Since API level 29, this tensor may be zero-sized.\n\nOutputs:\n\n• 0: A tensor with the same shape as input0.\n\nAvailable since API level 27.\n\nANEURALNETWORKS_DETECTION_POSTPROCESSING\n\nApply postprocessing steps to bounding box detections.\n\nBounding box detections are generated by applying transformation on a set of predefined anchors with the bounding box deltas from bounding box regression. A final step of hard NMS is applied to limit the number of returned boxes.\n\nSupported tensor OperandCode:\n\nInputs:\n\n• 0: A 3-D Tensor of shape [batches, num_anchors, num_classes], specifying the score of each anchor with each class. Class 0 for each [batches, num_anchors, 0] is background and will be ignored.\n• 1: A 3-D Tensor of shape [batches, num_anchors, length_box_encoding], with the first four values in length_box_encoding specifying the bounding box deltas. The box deltas are encoded in the order of [dy, dx, dh, dw], where dy and dx is the linear-scale relative correction factor for the center position of the bounding box with respect to the width and height, dh and dw is the log-scale relative correction factor for the width and height. All the entries in length_box_encoding beyond the first four values are ignored in this operation.\n• 2: A 2-D Tensor of shape [num_anchors, 4], specifying the shape of each predefined anchor, with format [ctr_y, ctr_x, h, w], where ctr_y and ctr_x are the center position of the box, and h and w are the height and the width.\n• 3: An ANEURALNETWORKS_FLOAT32 scalar, specifying the scaling factor for dy in bounding box deltas.\n• 4: An ANEURALNETWORKS_FLOAT32 scalar, specifying the scaling factor for dx in bounding box deltas.\n• 5: An ANEURALNETWORKS_FLOAT32 scalar, specifying the scaling factor for dh in bounding box deltas.\n• 6: An ANEURALNETWORKS_FLOAT32 scalar, specifying the scaling factor for dw in bounding box deltas.\n• 7: An ANEURALNETWORKS_BOOL scalar, set to true to use regular multi-class NMS algorithm that do NMS separately for each class, set to false for a faster algorithm that only do one single NMS using the highest class score..\n• 8: An ANEURALNETWORKS_INT32 scalar, max_num_detections, specifying the maximum number of boxes for the output. Boxes with the lowest scores are discarded to meet the limit.\n• 9: An ANEURALNETWORKS_INT32 scalar, only used when input7 is set to false, specifying the maximum number of classes per detection.\n• 10: An ANEURALNETWORKS_INT32 scalar, only used when input7 is set to true, specifying the maximum number of detections when applying NMS algorithm for each single class.\n• 11: A scalar, score_threshold. Boxes with scores lower than the threshold are filtered before sending to the NMS algorithm. The scalar must be of ANEURALNETWORKS_FLOAT16 if input0 is of ANEURALNETWORKS_TENSOR_FLOAT16 and of ANEURALNETWORKS_FLOAT32 if input0 is of ANEURALNETWORKS_TENSOR_FLOAT32.\n• 12: A scalar, specifying the IoU threshold for hard NMS. The scalar must be of ANEURALNETWORKS_FLOAT16 if input0 is of ANEURALNETWORKS_TENSOR_FLOAT16 and of ANEURALNETWORKS_FLOAT32 if input0 is of ANEURALNETWORKS_TENSOR_FLOAT32.\n• 13: An ANEURALNETWORKS_BOOL scalar, set to true to include background class in the list of label map for the output, set to false to not include the background. When the background class is included, it has label 0 and the output classes start at 1 in the label map, otherwise, the output classes start at 0.\n\nOutputs:\n\n• 0: A 2-D tensor of the same OperandCode as input0, with shape [batches, max_num_detections], specifying the score of each output detections.\n• 1: A 3-D tensor of shape [batches, max_num_detections, 4], specifying the coordinates of each output bounding box, with format [y1, x1, y2, x2].\n• 2: A 2-D ANEURALNETWORKS_TENSOR_INT32 tensor, of shape [batches, max_num_detections], specifying the class label for each output detection.\n• 3: An 1-D ANEURALNETWORKS_TENSOR_INT32 tensor, of shape [batches], specifying the number of valid output detections for each batch.\n\nAvailable since API level 29.\n\nANEURALNETWORKS_DIV\n\nElement-wise division of two tensors.\n\nTakes two input tensors of identical OperandCode and compatible dimensions. The output is the result of dividing the first input tensor by the second, optionally modified by an activation function.\n\nFor inputs of ANEURALNETWORKS_TENSOR_INT32, performs \"floor division\" (\"//\" in Python). For example, 5 // 2 = 2 -5 // 2 = -3\n\nTwo dimensions are compatible when:\n\n1. they are equal, or\n2. one of them is 1\n\nThe size of the output is the maximum size along each dimension of the input operands. It starts with the trailing dimensions, and works its way forward.\n\nExample: input1.dimension = {4, 1, 2} input2.dimension = {5, 4, 3, 1} output.dimension = {5, 4, 3, 2}\n\nSince API level 29, generic zero-sized input tensor is supported. Zero dimension is only compatible with 0 or 1. The size of the output dimension is zero if either of corresponding input dimension is zero.\n\nSupported tensor OperandCode:\n\nSupported tensor rank: up to 4\n\nInputs:\n\nOutputs:\n\nAvailable since API level 28.\n\nANEURALNETWORKS_ELU\n\nComputes exponential linear activation on the input tensor element-wise.\n\nThe output is calculated using the following formula:\n\nELU(x) = max(0, x) + min(0, alpha * (exp(x) - 1))\n\n\nSupported tensor OperandCode:\n\nSupported tensor rank: from 1.\n\nInputs:\n\nOutputs:\n\n• 0: The output tensor of same shape and type as input0.\n\nAvailable since API level 30.\n\nANEURALNETWORKS_EMBEDDING_LOOKUP\n\nLooks up sub-tensors in the input tensor.\n\nThis operator takes for input a tensor of values (Values) and a one-dimensional tensor of selection indices (Lookups). The output tensor is the concatenation of sub-tensors of Values as selected by Lookups.\n\nThink of Values as being sliced along its first dimension: The entries in Lookups select which slices are concatenated together to create the output tensor.\n\nFor example, if Values has shape of [40, 200, 300] and Lookups has shape of , all three values found in Lookups are expected to be between 0 and 39. The resulting tensor must have shape of [3, 200, 300].\n\nIf a value in Lookups is out of bounds, the operation must fail and an error must be reported.\n\nSupported value tensor OperandCode:\n\nSupported value tensor rank: from 2\n\nInputs:\n\n• 0: Lookups. A 1-D tensor of ANEURALNETWORKS_TENSOR_INT32. The values are indices into the first dimension of Values.\n• 1: Values. An n-D tensor, where n >= 2, from which sub-tensors are extracted.\n\nOutput:\n\nAvailable since API level 27.\n\nANEURALNETWORKS_EQUAL\n\nFor input tensors x and y, computes x == y elementwise.\n\nSupported tensor OperandCode:\n\nSupported tensor rank: from 1\n\nInputs:\n\n• 0: A tensor.\n• 1: A tensor of the same OperandCode and dimensions compatible with input0.\n\nOutputs:\n\nAvailable since API level 29.\n\nANEURALNETWORKS_EXP\n\nComputes exponential of x element-wise.\n\nSupported tensor OperandCode:\n\nSupported tensor rank: from 1.\n\nInputs:\n\n• 0: A tensor.\n\nOutputs:\n\n• 0: The output tensor of same shape as input0.\n\nAvailable since API level 29.\n\nANEURALNETWORKS_EXPAND_DIMS\n\nInserts a dimension of 1 into a tensor's shape.\n\nGiven a tensor input, this operation inserts a dimension of 1 at the given dimension index of input's shape. The dimension index starts at zero; if you specify a negative dimension index, it is counted backward from the end.\n\nSupported tensor OperandCode:\n\nSupported tensor rank: from 1\n\nInputs:\n\n• 0: An n-D tensor.\n• 1: An ANEURALNETWORKS_INT32 scalar specifying the dimension index to expand. Must be in the range [-(n + 1), (n + 1)).\n\nOutputs:\n\nAvailable since API level 29.\n\nANEURALNETWORKS_FILL\n\nCreates a tensor filled with a scalar value.\n\nSupported output tensor OperandCode:\n\nSupported tensor rank: from 1.\n\nInputs:\n\nOutputs:\n\n• 0: The output tensor.\n\nAvailable since API level 30.\n\nANEURALNETWORKS_FLOOR\n\nComputes element-wise floor() on the input tensor.\n\nSupported tensor OperandCode:\n\nSupported tensor rank: up to 4\n\nInputs:\n\n• 0: A tensor.\n\nOutputs:\n\n• 0: The output tensor, of the same OperandCode and dimensions as the input tensor.\n\nAvailable since API level 27.\n\nANEURALNETWORKS_FULLY_CONNECTED\n\nDenotes a fully (densely) connected layer, which connects all elements in the input tensor with each element in the output tensor.\n\nThis layer implements the operation:\n\noutputs = activation(inputs * weights’ + bias)\n\n\nSupported tensor OperandCode:\n\nSupported tensor rank: up to 4.\n\nInputs:\n\n• 0: A tensor of at least rank 2, specifying the input. If rank is greater than 2, then it gets flattened to a 2-D Tensor. The (flattened) 2-D Tensor is reshaped (if necessary) to [batch_size, input_size], where \"input_size\" corresponds to the number of inputs to the layer, matching the second dimension of weights, and \"batch_size\" is calculated by dividing the number of elements by \"input_size\". Since API level 29, zero batch_size is supported for this tensor.\n• 1: A 2-D tensor, specifying the weights, of shape [num_units, input_size], where \"num_units\" corresponds to the number of output nodes.\n• 2: A 1-D tensor, of shape [num_units], specifying the bias. For input tensor of ANEURALNETWORKS_TENSOR_FLOAT32, the bias should also be of ANEURALNETWORKS_TENSOR_FLOAT32. For input tensor of ANEURALNETWORKS_TENSOR_QUANT8_ASYMM and ANEURALNETWORKS_TENSOR_QUANT8_ASYMM_SIGNED, the bias should be of ANEURALNETWORKS_TENSOR_INT32, with zeroPoint of 0 and bias_scale == input_scale * filter_scale.\n• 3: An ANEURALNETWORKS_INT32 scalar, and has to be one of the FuseCode values. Specifies the activation to invoke on the result.\n\nOutputs:\n\n• 0: The output tensor, of shape [batch_size, num_units]. Before API level 29, for output tensor of ANEURALNETWORKS_TENSOR_QUANT8_ASYMM, the following condition must be satisfied: output_scale > input_scale * filter_scale.\n\nAvailable since API level 27.\n\nANEURALNETWORKS_GATHER\n\nGathers values along an axis.\n\nProduces an output tensor with shape input0.dimension[:axis] + indices.dimension + input0.dimension[axis + 1:] where:\n\n# Vector indices (output is rank(input0)).\n\noutput[a_0, ..., a_n, i, b_0, ..., b_n] = input0[a_0, ..., a_n, indices[i], b_0, ..., b_n]\n\n# Higher rank indices (output is rank(input0) + rank(indices) - 1).\n\noutput[a_0, ..., a_n, i, ..., j, b_0, ... b_n] = input0[a_0, ..., a_n, indices[i, ..., j], b_0, ..., b_n]\n\nSupported tensor OperandCode:\n\nSupported tensor rank: from 1\n\nInputs:\n\n• 0: An n-D tensor from which to gather values.\n• 1: An ANEURALNETWORKS_INT32 scalar specifying the axis. Negative index is used to specify axis from the end (e.g. -1 for the last axis). Must be in the range [-n, n).\n• 2: A k-D tensor ANEURALNETWORKS_TENSOR_INT32 of indices. The values must be in the bounds of the corresponding dimensions of input0.\n\nOutputs:\n\nAvailable since API level 29.\n\nANEURALNETWORKS_GENERATE_PROPOSALS\n\nGenerate aixs-aligned bounding box proposals.\n\nBounding box proposals are generated by applying transformation on a set of predefined anchors with the bounding box deltas from bounding box regression. A final step of hard NMS is applied to limit the number of returned boxes.\n\nAxis-aligned bounding boxes are represented by its upper-left corner coordinate (x1,y1) and lower-right corner coordinate (x2,y2). A valid bounding box should satisfy x1 <= x2 and y1 <= y2.\n\nSupported tensor OperandCode:\n\nInputs:\n\n• 0: A 4-D Tensor specifying the score of each anchor at each location. With \"NHWC\" data layout, the tensor shape is [batches, height, width, num_anchors]. With \"NCHW\" data layout, the tensor shape is [batches, num_anchors, height, width].\n• 1: A 4-D Tensor specifying the bounding box deltas. With \"NHWC\" data layout, the tensor shape is [batches, height, width, num_anchors * 4]. With \"NCHW\" data layout, the tensor shape is [batches, num_anchors * 4, height, width]. The box deltas are encoded in the order of [dx, dy, dw, dh], where dx and dy is the linear-scale relative correction factor for the center position of the bounding box with respect to the width and height, dw and dh is the log-scale relative correction factor for the width and height. The last dimensions is the channel dimension.\n• 2: A 2-D Tensor of shape [num_anchors, 4], specifying the shape of each predefined anchor, with format [x1, y1, x2, y2]. For input0 of type ANEURALNETWORKS_TENSOR_QUANT8_ASYMM or ANEURALNETWORKS_TENSOR_QUANT8_ASYMM_SIGNED, this tensor should be of ANEURALNETWORKS_TENSOR_QUANT16_SYMM, with scale of 0.125.\n• 3: A 2-D Tensor of shape [batches, 2], specifying the size of each image in the batch, with format [image_height, image_width]. For input0 of type ANEURALNETWORKS_TENSOR_QUANT8_ASYMM or ANEURALNETWORKS_TENSOR_QUANT8_ASYMM_SIGNED, this tensor should be of ANEURALNETWORKS_TENSOR_QUANT16_SYMM, with scale of 0.125.\n• 4: An ANEURALNETWORKS_FLOAT32 scalar, specifying the ratio from the height of original image to the height of feature map.\n• 5: An ANEURALNETWORKS_FLOAT32 scalar, specifying the ratio from the width of original image to the width of feature map.\n• 6: An ANEURALNETWORKS_INT32 scalar, specifying the maximum number of boxes before going into the hard NMS algorithm. Boxes with the lowest scores are discarded to meet the limit. Set to a non-positive value for unlimited number.\n• 7: An ANEURALNETWORKS_INT32 scalar, specifying the maximum number of boxes returning from the hard NMS algorithm. Boxes with the lowest scores are discarded to meet the limit. Set to a non-positive value for unlimited number.\n• 8: An ANEURALNETWORKS_FLOAT32 scalar, specifying the IoU threshold for hard NMS.\n• 9: An ANEURALNETWORKS_FLOAT32 scalar, min_size. Boxes with height or width lower than the absolute threshold are filtered out.\n• 10: An ANEURALNETWORKS_BOOL scalar, set to true to specify NCHW data layout for input0 and input1. Set to false for NHWC.\n\nOutputs:\n\n• 0: A tensor of the same OperandCode as input0, of shape [num_output_rois], specifying the score of each output box. The boxes are grouped by batches, but the sequential order in each batch is not guaranteed. For type of ANEURALNETWORKS_TENSOR_QUANT8_ASYMM or ANEURALNETWORKS_TENSOR_QUANT8_ASYMM_SIGNED, the scale and zero point must be the same as input0.\n• 1: A tensor of the same OperandCode as input3, of shape [num_output_rois, 4], specifying the coordinates of each output bounding box for each class, with format [x1, y1, x2, y2]. The sequential order of the boxes corresponds with output0. For type of ANEURALNETWORKS_TENSOR_QUANT16_ASYMM, the scale must be 0.125 and the zero point must be 0.\n• 2: A 1-D ANEURALNETWORKS_TENSOR_INT32 tensor, of shape [num_output_rois], specifying the batch index of each box. Boxes with the same batch index are grouped together.\n\nAvailable since API level 29.\n\nANEURALNETWORKS_GREATER\n\nFor input tensors x and y, computes x > y elementwise.\n\nSupported tensor OperandCode:\n\nSupported tensor rank: from 1\n\nInputs:\n\n• 0: A tensor.\n• 1: A tensor of the same OperandCode and dimensions compatible with input0.\n\nOutputs:\n\nAvailable since API level 29.\n\nANEURALNETWORKS_GREATER_EQUAL\n\nFor input tensors x and y, computes x >= y elementwise.\n\nSupported tensor OperandCode:\n\nSupported tensor rank: from 1\n\nInputs:\n\n• 0: A tensor.\n• 1: A tensor of the same OperandCode and dimensions compatible with input0.\n\nOutputs:\n\nAvailable since API level 29.\n\nANEURALNETWORKS_GROUPED_CONV_2D\n\nPerforms a grouped 2-D convolution operation.\n\nGiven an input tensor of shape [batches, height, width, depth_in] and a filter tensor of shape [depth_out, filter_height, filter_width, depth_group] containing depth_out convolutional filters of depth depth_group, GROUPED_CONV applies a group of different filters to each input channel group, then concatenates the results together.\n\nSpecifically, the input channels are divided into num_groups groups, each with depth depth_group, i.e. depth_in = num_groups * depth_group. The convolutional filters are also divided into num_groups groups, i.e. depth_out is divisible by num_groups. GROUPED_CONV applies each group of filters to the corresponding input channel group, and the result are concatenated together.\n\nThe output dimensions are functions of the filter dimensions, stride, and padding.\n\nThe values in the output tensor are computed as:\n\noutput[b, i, j, g * channel_multiplier + q] =\nsum_{di, dj, dk} (\ninput[b, strides * i + di, strides * j + dj,\ng * depth_group + dk] *\nfilter[g * channel_multiplier + q, di, dj, dk]\n) + bias[channel]\n\n\nwhere channel_multiplier = depth_out / num_groups\n\nSupported tensor OperandCode configurations:\n\nSupported tensor rank: 4, with \"NHWC\" or \"NCHW\" data layout. With the default data layout NHWC, the data is stored in the order of: [batch, height, width, channels]. Alternatively, the data layout could be NCHW, the data storage order of: [batch, channels, height, width].\n\nOutputs:\n\nAvailable since API level 29.\n\nANEURALNETWORKS_HARD_SWISH\n\nComputes hard-swish activation on the input tensor element-wise.\n\nHard swish activation is introduced in https://arxiv.org/pdf/1905.02244.pdf\n\nThe output is calculated using the following formula:\n\nh-swish(x) = x * max(0, min(6, (x + 3))) / 6\n\n\nSupported tensor OperandCode:\n\nSupported tensor rank: from 1.\n\nInputs:\n\n• 0: A tensor, specifying the input. May be zero-sized.\n\nOutputs:\n\n• 0: The output tensor of same shape and type as input0. Scale and zero point of this tensor may be different from the input tensor's parameters.\n\nAvailable since API level 30.\n\nANEURALNETWORKS_HASHTABLE_LOOKUP\n\nLooks up sub-tensors in the input tensor using a key-value map.\n\nThis operator takes for input a tensor of values (Values), a one-dimensional tensor of selection values (Lookups) and a one-dimensional tensor that maps these values to Values indexes. The output tensor is the concatenation of sub-tensors of Values as selected by Lookups via Keys.\n\nThink of Values as being sliced along its outer-most dimension. The output is a concatenation of selected slices, with one slice for each entry of Lookups. The slice selected is the one at the same index as the Maps entry that matches the value in Lookups.\n\nFor a hit, the corresponding sub-tensor of Values is included in the Output tensor. For a miss, the corresponding sub-tensor in Output must have zero values.\n\nFor example, if Values has shape of [40, 200, 300], Keys should have a shape of . If Lookups tensor has shape of , three slices are being concatenated, so the resulting tensor must have the shape of [3, 200, 300]. If the first entry in Lookups has the value 123456, that value must be located in Keys tensor. If the sixth entry of Keys contains 123456, the sixth slice of Values must be selected. If no entry in Keys has 123456, a slice of zeroes must be concatenated.\n\nSupported value tensor OperandCode:\n\nSupported value tensor rank: from 2\n\nInputs:\n\n• 0: Lookups. A 1-D ANEURALNETWORKS_TENSOR_INT32 tensor with shape [ k ].\n• 1: Keys. A 1-D ANEURALNETWORKS_TENSOR_INT32 tensor with shape [ n ]; Keys and Values pair represent a map, i.e., the ith element in Keys (Keys[i]) is the key to select the ith sub-tensor in Values (Values[i]), where 0 <= i <= n-1. Keys tensor MUST be sorted in ascending order.\n• 2: Values. A tensor with shape of [ n, … ]; i.e., the first dimension must be n.\n\nOutputs:\n\n• 0: Output. A tensor with shape [ k …]. For a ANEURALNETWORKS_TENSOR_QUANT8_ASYMM tensor, the scale and zeroPoint must be the same as input2.\n• 1: Hits. A boolean tensor with shape [ k ] indicates whether the lookup hits (True) or not (False). Stored as ANEURALNETWORKS_TENSOR_QUANT8_ASYMM with offset 0 and scale 1.0f. A non-zero byte represents True, a hit. A zero indicates otherwise.\n\nAvailable since API level 27.\n\nANEURALNETWORKS_HEATMAP_MAX_KEYPOINT\n\nLocalize the maximum keypoints from heatmaps.\n\nThis operation approximates the accurate maximum keypoint scores and indices after bicubic upscaling by using Taylor expansion up to the quadratic term.\n\nThe bounding box is represented by its upper-left corner coordinate (x1,y1) and lower-right corner coordinate (x2,y2) in the original image. A valid bounding box should satisfy x1 <= x2 and y1 <= y2.\n\nSupported tensor OperandCode:\n\nSupported tensor rank: 4, with \"NHWC\" or \"NCHW\" data layout. With the default data layout NHWC, the data is stored in the order of: [batch, height, width, channels]. Alternatively, the data layout could be NCHW, the data storage order of: [batch, channels, height, width].\n\nInputs:\n\nOutputs:\n\nAvailable since API level 29.\n\nANEURALNETWORKS_IF\n\nExecutes one of the two referenced models as determined by a boolean value.\n\nThe inputs and outputs of the two referenced models must agree with the signature of this operation. That is, if the operation has (3 + n) inputs and m outputs, both models must have n inputs and m outputs with the same types as the corresponding operation inputs and outputs.\n\nInputs:\n\n• 0: A value of type ANEURALNETWORKS_TENSOR_BOOL8 and shape that determines which of the two referenced models to execute.\n• 1: A ANEURALNETWORKS_MODEL reference to the model to be executed if the condition is true.\n• 2: A ANEURALNETWORKS_MODEL reference to the model to be executed if the condition is false.\n• 3 ~ (n + 2): Inputs to be passed to the model selected for execution.\n\nOutputs:\n\n• 0 ~ (m - 1): Outputs produced by the selected model.\n\nAvailable since API level 30.\n\nANEURALNETWORKS_INSTANCE_NORMALIZATION\n\nApplies instance normalization to the input tensor.\n\nThe values in the output tensor are computed as:\n\noutput[b, h, w, c] =\n(input[b, h, w, c] - mean[b, c]) * gamma /\nsqrt(var[b, c] + epsilon) + beta\n\n\nWhere the mean and variance are computed across the spatial dimensions:\n\nmean[b, c] =\nsum_{h, w}(input[b, h, w, c]) / sum(1)\n\nvar[b, c] =\nsum_{h, w}(pow(input[b, h, w, c] - mean[b, c], 2)) / sum(1)\n\n\nSupported tensor OperandCode:\n\nSupported tensor rank: 4, with \"NHWC\" or \"NCHW\" data layout. With the default data layout NHWC, the data is stored in the order of: [batch, height, width, channels]. Alternatively, the data layout could be NCHW, the data storage order of: [batch, channels, height, width].\n\nInputs:\n\nOutputs:\n\n• 0: A tensor of the same OperandCode and same shape as input0.\n\nAvailable since API level 29.\n\nANEURALNETWORKS_L2_NORMALIZATION\n\nApplies L2 normalization along the axis dimension.\n\nThe values in the output tensor are computed as:\n\noutput[batch, row, col, channel] =\ninput[batch, row, col, channel] /\nsqrt(sum_{c} pow(input[batch, row, col, c], 2))\n\n\nBy default the axis dimension is the last dimension of the input tensor.\n\nSupported tensor OperandCode:\n\nSupported tensor rank: up to 4 Tensors with rank less than 4 are only supported since API level 29.\n\nInputs:\n\n• 0: An n-D tensor, specifying the tensor to be normalized.\n• 1: An optional ANEURALNETWORKS_INT32 scalar, default to -1, specifying the dimension normalization would be performed on. Negative index is used to specify axis from the end (e.g. -1 for the last axis). Must be in the range [-n, n). Available since API level 29.\n\nOutputs:\n\n• 0: A tensor of the same OperandCode and same shape as input0. For ANEURALNETWORKS_TENSOR_QUANT8_ASYMM, the scale must be 1.f / 128 and the zeroPoint must be 128. For ANEURALNETWORKS_TENSOR_QUANT8_ASYMM_SIGNED, the scale must be 1.f / 128 and the zeroPoint must be 0.NOTE: Before API level 30, if the elements along an axis are all zeros, the result is undefined. Since API level 30, if the elements along an axis are all zeros, the result is logical zero.\n\nAvailable since API level 27.\n\nANEURALNETWORKS_L2_POOL_2D\n\nPerforms an 2-D L2 pooling operation.\n\nThe output dimensions are functions of the filter dimensions, stride, and padding.\n\nThe values in the output tensor are computed as:\n\noutput[b, i, j, c] =\nsqrt(sum_{di, dj} pow(input[b, strides * i + di, strides * j + dj, c], 2) /\nsum(1))\n\n\nSupported tensor OperandCode:\n\nSupported tensor rank: 4, with \"NHWC\" or \"NCHW\" data layout. With the default data layout NHWC, the data is stored in the order of: [batch, height, width, channels]. Alternatively, the data layout could be NCHW, the data storage order of: [batch, channels, height, width]. NCHW is supported since API level 29.\n\n• 0: A 4-D tensor, of shape [batches, height, width, depth], specifying the input. Since API level 29, zero batches is supported for this tensor.\n• 1: An ANEURALNETWORKS_INT32 scalar, specifying the padding on the left, in the ‘width’ dimension.\n• 2: An ANEURALNETWORKS_INT32 scalar, specifying the padding on the right, in the ‘width’ dimension.\n• 3: An ANEURALNETWORKS_INT32 scalar, specifying the padding on the top, in the ‘height’ dimension.\n• 4: An ANEURALNETWORKS_INT32 scalar, specifying the padding on the bottom, in the ‘height’ dimension.\n• 5: An ANEURALNETWORKS_INT32 scalar, specifying the stride when walking through input in the ‘width’ dimension.\n• 6: An ANEURALNETWORKS_INT32 scalar, specifying the stride when walking through input in the ‘height’ dimension.\n• 7: An ANEURALNETWORKS_INT32 scalar, specifying the filter width.\n• 8: An ANEURALNETWORKS_INT32 scalar, specifying the filter height.\n• 9: An ANEURALNETWORKS_INT32 scalar, and has to be one of the FuseCode values. Specifies the activation to invoke on the result.\n• 10: An optional ANEURALNETWORKS_BOOL scalar, default to false. Set to true to specify NCHW data layout for input0 and output0. Available since API level 29.\n\n• 0: A 4-D tensor, of shape [batches, height, width, depth], specifying the input. Since API level 29, zero batches is supported for this tensor.\n• 1: An ANEURALNETWORKS_INT32 scalar, specifying the implicit padding scheme, has to be one of the PaddingCode values.\n• 2: An ANEURALNETWORKS_INT32 scalar, specifying the stride when walking through input in the ‘width’ dimension.\n• 3: An ANEURALNETWORKS_INT32 scalar, specifying the stride when walking through input in the ‘height’ dimension.\n• 4: An ANEURALNETWORKS_INT32 scalar, specifying the filter width.\n• 5: An ANEURALNETWORKS_INT32 scalar, specifying the filter height.\n• 6: An ANEURALNETWORKS_INT32 scalar, and has to be one of the FuseCode values. Specifies the activation to invoke on the result.\n• 7: An optional ANEURALNETWORKS_BOOL scalar, default to false. Set to true to specify NCHW data layout for input0 and output0. Available since API level 29.\n\nOutputs:\n\n• 0: The output 4-D tensor, of shape [batches, out_height, out_width, depth].\n\nAvailable since API level 27.\n\nANEURALNETWORKS_LESS\n\nFor input tensors x and y, computes x < y elementwise.\n\nSupported tensor OperandCode:\n\nSupported tensor rank: from 1\n\nInputs:\n\n• 0: A tensor.\n• 1: A tensor of the same OperandCode and dimensions compatible with input0.\n\nOutputs:\n\nAvailable since API level 29.\n\nANEURALNETWORKS_LESS_EQUAL\n\nFor input tensors x and y, computes x <= y elementwise.\n\nSupported tensor OperandCode:\n\nSupported tensor rank: from 1\n\nInputs:\n\n• 0: A tensor.\n• 1: A tensor of the same OperandCode and dimensions compatible with input0.\n\nOutputs:\n\nAvailable since API level 29.\n\nANEURALNETWORKS_LOCAL_RESPONSE_NORMALIZATION\n\nApplies Local Response Normalization along the depth dimension.\n\nThe 4-D input tensor is treated as a 3-D array of 1-D vectors (along the last dimension), and each vector is normalized independently. Within a given vector, each component is divided by the weighted, squared sum of inputs within depth_radius.\n\nThe output is calculated using this formula:\n\nsqr_sum[a, b, c, d] = sum(\npow(input[a, b, c, d - depth_radius : d + depth_radius + 1], 2))\noutput = input / pow((bias + alpha * sqr_sum), beta)\n\n\nFor input tensor with rank less than 4, independently normalizes each 1-D slice along specified dimension.\n\nSupported tensor OperandCode:\n\nSupported tensor rank: up to 4 Tensors with rank less than 4 are only supported since API level 29.\n\nInputs:\n\nOutputs:\n\n• 0: The output tensor of same shape as input0.\n\nAvailable since API level 27.\n\nANEURALNETWORKS_LOG\n\nComputes natural logarithm of x element-wise.\n\nSupported tensor OperandCode:\n\nSupported tensor rank: from 1.\n\nInputs:\n\n• 0: A tensor.\n\nOutputs:\n\n• 0: The output tensor of same shape as input0.\n\nAvailable since API level 29.\n\nANEURALNETWORKS_LOGICAL_AND\n\nReturns the truth value of x AND y element-wise.\n\nSupported tensor OperandCode:\n\nSupported tensor rank: from 1\n\nInputs:\n\nOutputs:\n\nAvailable since API level 29.\n\nANEURALNETWORKS_LOGICAL_NOT\n\nComputes the truth value of NOT x element-wise.\n\nSupported tensor OperandCode:\n\nSupported tensor rank: from 1.\n\nInputs:\n\n• 0: A tensor.\n\nOutputs:\n\n• 0: The output tensor of same shape as input0.\n\nAvailable since API level 29.\n\nANEURALNETWORKS_LOGICAL_OR\n\nReturns the truth value of x OR y element-wise.\n\nSupported tensor OperandCode:\n\nSupported tensor rank: from 1\n\nInputs:\n\nOutputs:\n\nAvailable since API level 29.\n\nANEURALNETWORKS_LOGISTIC\n\nComputes sigmoid activation on the input tensor element-wise.\n\nThe output is calculated using this formula:\n\noutput = 1 / (1 + exp(-input))\n\n\nSupported tensor OperandCode:\n\nSupported tensor rank: up to 4.\n\nInputs:\n\n• 0: A tensor, specifying the input. Since API level 29, this tensor may be zero-sized.\n\nOutputs:\n\nAvailable since API level 27.\n\nANEURALNETWORKS_LOG_SOFTMAX\n\nComputes the log softmax activations given logits.\n\nThe output is calculated using this formula:\n\noutput = logits * beta - log(reduce_sum(exp(logits * beta), axis))\n\n\nSupported tensor OperandCode:\n\nSupported tensor rank: from 1.\n\nInputs:\n\nOutputs:\n\n• 0: The output tensor of the same OperandCode and shape as input0.\n\nAvailable since API level 29.\n\nANEURALNETWORKS_LSH_PROJECTION\n\nProjects an input to a bit vector via locality senstive hashing.\n\nSupported input tensor OperandCode:\n\nSupported input tensor rank: from 1\n\nInputs:\n\n• 0: Hash functions. Dim.size == 2, DataType: Float. Tensor.Dim: Number of hash functions. Tensor.Dim: Number of projected output bits generated by each hash function. If the projection type is Sparse: Tensor.Dim + ceil(log2(Tensor.Dim)) <= 32\n• 1: Input. Dim.size >= 1, no restriction on DataType.\n• 2: Weight. Optional. Dim.size == 1, DataType: Float. If not set, each input element is considered to have the same weight of 1.0. Tensor.Dim == Tensor.Dim\n• 3: Type: Sparse: Value LSHProjectionType_SPARSE(=3) (since API level 29). Computed bit vector is considered to be sparse. Each output element is an int32 made up of multiple bits computed from hash functions.NOTE: To avoid collisions across hash functions, an offset value of k * (1 << Tensor.Dim) will be added to each signature, where k is the index of the hash function.Value LSHProjectionType_SPARSE_DEPRECATED(=1). Legacy behavior that does not include the offset value.Dense: Value LSHProjectionType_DENSE(=2). Computed bit vector is considered to be dense. Each output element represents a bit and can take the value of either 0 or 1.\n\nOutputs:\n\n• 0: If the projection type is Sparse: Output.Dim == { Tensor.Dim } A tensor of int32 that represents hash signatures.If the projection type is Dense: Output.Dim == { Tensor.Dim * Tensor.Dim } A flattened tensor that represents projected bit vectors.\n\nAvailable since API level 27. The offset value for sparse projections was added in API level 29.\n\nANEURALNETWORKS_LSTM\n\nPerforms a single time step in a Long Short-Term Memory (LSTM) layer.\n\nThe LSTM operation is described by the following equations.\n\n\\begin{eqnarray*} i_t =& \\sigma(W_{xi}x_t+W_{hi}h_{t-1}+W_{ci}C_{t-1}+b_i) & \\\\ f_t =& \\sigma(W_{xf}x_t+W_{hf}h_{t-1}+W_{cf}C_{t-1}+b_f) & \\\\ C_t =& clip(f_t \\odot C_{t-1} + i_t \\odot g(W_{xc}x_t+W_{hc}h_{t-1}+b_c),\\ t_{cell}) & \\\\ o_t =& \\sigma(W_{xo}x_t+W_{ho}h_{t-1}+W_{co}C_t+b_o) & \\\\ & & \\\\ & clip(W_{proj}(o_t \\odot g(C_t))+b_{proj},\\ t_{proj}) & if\\ there\\ is\\ a\\ projection; \\\\ h_t =& & \\\\ & o_t \\odot g(C_t) & otherwise. \\\\ \\end{eqnarray*} Where:\n\n• $x_t$ is the input,\n• $i_t$ is the input gate,\n• $f_t$ is the forget gate,\n• $C_t$ is the cell state,\n• $o_t$ is the output,\n• $h_t$ is the output state,\n• $\\sigma$ is the logistic sigmoid function,\n• $g$ is the cell input and cell output activation function, usually $tahn$,\n• $W_{xi}$ is the input-to-input weight matrix,\n• $W_{hi}$ is the recurrent to input weight matrix,\n• $W_{ci}$ is the cell-to-input weight matrix,\n• $b_i$ is the input gate bias,\n• $W_{xf}$ is the input-to-forget weight matrix,\n• $W_{hf}$ is the recurrent-to-forget weight matrix,\n• $W_{cf}$ is the cell-to-forget weight matrix,\n• $b_f$ is the forget gate bias,\n• $W_{xc}$ is the input-to-cell weight matrix,\n• $W_{hc}$ is the recurrent-to-cell weight matrix,\n• $b_c$ is the cell bias,\n• $W_{xo}$ is the input-to-output weight matrix,\n• $W_{ho}$ is the recurrent-to-output weight matrix,\n• $W_{co}$ is the cell-to-output weight matrix,\n• $b_o$ is the output gate bias,\n• $W_{proj}$ is the projection weight matrix,\n• $b_{proj}$ is the projection bias,\n• $t_{cell}$ is the threshold for clipping the cell state, and\n• $t_{proj}$ is the threshold for clipping the projected output.\n• $\\odot$ is the Hadamard product that takes two matrices and produces another matrix, each element of which is the product of the corresponding elements of the input matrices.\n\nSince API level 29 LSTM supports layer normalization. In case layer normalization is used, the inputs to internal activation functions (sigmoid and $g$) are normalized, rescaled and recentered following an approach from section 3.1 from https://arxiv.org/pdf/1607.06450.pdf\n\nThe operation has the following independently optional inputs:\n\n• The cell-to-input weights ( $W_{ci}$), cell-to-forget weights ( $W_{cf}$) and cell-to-output weights ( $W_{co}$) either all have values or neither of them have values (i.e., all set to null). If they have values, the peephole optimization is used.\n• The input-to-input weights ( $W_{xi}$), recurrent-to-input weights ( $W_{hi}$) and input gate bias ( $b_i$) either all have values, or none of them have values. If they have no values, coupling of input and forget gates (CIFG) is used, in which case the input gate ( $i_t$) is calculated using the following equation instead. \\begin{eqnarray*} i_t = 1 - f_t \\end{eqnarray*} In case peephole optimization is used and CIFG is not used cell-to-input ( $W_{ci}$) weights must be present. Otherwise, the cell-to-input weights must have no value.\n• The projection weights ( $W_{proj}$) is required only for the recurrent projection layer, and should otherwise have no value.\n• The projection bias ( $b_{proj}$) may (but not required to) have a value if the recurrent projection layer exists, and should otherwise have no value.\n• (API level 29 or later) The four layer normalization weights either all have values or none of them have values. Additionally, if CIFG is used, input layer normalization weights tensor is omitted and the other layer normalization weights either all have values or none of them have values. Layer normalization is used when the values of all the layer normalization weights are present.\n\nReferences:\n\nThe default non-peephole non-CIFG implementation is based on: http://www.bioinf.jku.at/publications/older/2604.pdf S. Hochreiter and J. Schmidhuber. \"Long Short-Term Memory\". Neural Computation, 9(8):1735-1780, 1997.\n\nThe peephole implementation and projection layer is based on: https://research.google.com/pubs/archive/43905.pdf Hasim Sak, Andrew Senior, and Francoise Beaufays. \"Long short-term memory recurrent neural network architectures for large scale acoustic modeling.\" INTERSPEECH, 2014. (However, the concept of peephole optimization was introduced in work prior to this paper.)\n\nThe coupling of input and forget gate (CIFG) is based on: http://arxiv.org/pdf/1503.04069.pdf Greff et al. \"LSTM: A Search Space Odyssey\"\n\nThe layer normalization is based on: https://arxiv.org/pdf/1607.06450.pdf Jimmy Ba et al. \"Layer Normalization\"\n\nSupported tensor OperandCode:\n\nAll input and output tensors must be of the same type.\n\nInputs:\n\n• 0: The input ( $x_t$). A 2-D tensor of shape [batch_size, input_size], where “batch_size” corresponds to the batching dimension, and “input_size” is the size of the input.\n• 1: The input-to-input weights ( $W_{xi}$). Optional. A 2-D tensor of shape [num_units, input_size], where “num_units” corresponds to the number of cell units.\n• 2: The input-to-forget weights ( $W_{xf}$). A 2-D tensor of shape [num_units, input_size].\n• 3: The input-to-cell weights ( $W_{xc}$). A 2-D tensor of shape [num_units, input_size].\n• 4: The input-to-output weights ( $W_{xo}$). A 2-D tensor of shape [num_units, input_size].\n• 5: The recurrent-to-input weights ( $W_{hi}$). Optional. A 2-D tensor of shape [num_units, output_size], where “output_size” corresponds to either the number of cell units (i.e., “num_units”), or the second dimension of the “projection_weights”, if defined.\n• 6: The recurrent-to-forget weights ( $W_{hf}$). A 2-D tensor of shape [num_units, output_size].\n• 7: The recurrent-to-cell weights ( $W_{hc}$). A 2-D tensor of shape [num_units, output_size].\n• 8: The recurrent-to-output weights ( $W_{ho}$). A 2-D tensor of shape [num_units, output_size].\n• 9: The cell-to-input weights ( $W_{ci}$). Optional. A 1-D tensor of shape [num_units].\n• 10:The cell-to-forget weights ( $W_{cf}$). Optional. A 1-D tensor of shape [num_units].\n• 11:The cell-to-output weights ( $W_{co}$). Optional. A 1-D tensor of shape [num_units].\n• 12:The input gate bias ( $b_i$). Optional. A 1-D tensor of shape [num_units].\n• 13:The forget gate bias ( $b_f$). A 1-D tensor of shape [num_units].\n• 14:The cell bias ( $b_c$). A 1-D tensor of shape [num_units].\n• 15:The output gate bias ( $b_o$). A 1-D tensor of shape [num_units].\n• 16:The projection weights ( $W_{proj}$). Optional. A 2-D tensor of shape [output_size, num_units].\n• 17:The projection bias ( $b_{proj}$). Optional. A 1-D tensor of shape [output_size].\n• 18:The output state (in) ( $h_{t-1}$). A 2-D tensor of shape [batch_size, output_size].\n• 19:The cell state (in) ( $C_{t-1}$). A 2-D tensor of shape [batch_size, num_units].\n• 20:The activation function ( $g$). A value indicating the activation function:\n• 0: None;\n• 1: Relu;\n• 3: Relu6;\n• 4: Tanh;\n• 6: Sigmoid.\n• 21:The clipping threshold ( $t_{cell}$) for the cell state, such that values are bound within [-cell_clip, cell_clip]. If set to 0.0 then clipping is disabled. Until API level 29 this scalar must be of type ANEURALNETWORKS_FLOAT32. Since API level 29, if all the input tensors have type ANEURALNETWORKS_TENSOR_FLOAT32, this scalar must be of the type ANEURALNETWORKS_FLOAT32, otherwise if all the input tensors have the type ANEURALNETWORKS_TENSOR_FLOAT16, this scalar must be of type ANEURALNETWORKS_FLOAT16.\n• 22:The clipping threshold ( $t_{proj}$) for the output from the projection layer, such that values are bound within [-proj_clip, proj_clip]. If set to 0.0 then clipping is disabled. Until API level 29 this scalar must be of type ANEURALNETWORKS_FLOAT32. Since API level 29, if all the input tensors have type ANEURALNETWORKS_TENSOR_FLOAT32, this scalar must be of the type ANEURALNETWORKS_FLOAT32, otherwise if all the input tensors have the type ANEURALNETWORKS_TENSOR_FLOAT16, this scalar must be of type ANEURALNETWORKS_FLOAT16. Since API level 29 there are additional inputs to this op:\n• 23:The input layer normalization weights. A 1-D tensor of shape [num_units]. Used to rescale normalized inputs to activation at input gate.\n• 24:The forget layer normalization weights. A 1-D tensor of shape [num_units]. Used to rescale normalized inputs to activation at forget gate.\n• 25:The cell layer normalization weights. A 1-D tensor of shape [num_units]. Used to rescale normalized inputs to activation at cell gate.\n• 26:The output layer normalization weights. A 1-D tensor of shape [num_units]. Used to rescale normalized inputs to activation at output gate.\n\nOutputs:\n\n• 0: The scratch buffer. A 2-D tensor of shape [batch_size, num_units * 3] with CIFG, or [batch_size, num_units * 4] without CIFG.\n• 1: The output state (out) ( $h_t$). A 2-D tensor of shape [batch_size, output_size].\n• 2: The cell state (out) ( $C_t$). A 2-D tensor of shape [batch_size, num_units].\n• 3: The output ( $o_t$). A 2-D tensor of shape [batch_size, output_size]. This is effectively the same as the current “output state (out)” value.\n\nAvailable since API level 27.\n\nANEURALNETWORKS_MAXIMUM\n\nReturns the element-wise maximum of two tensors.\n\nSupported tensor OperandCode:\n\nSupported tensor rank: from 1.\n\nInputs:\n\nOutputs:\n\nAvailable since API level 29.\n\nANEURALNETWORKS_MAX_POOL_2D\n\nPerforms an 2-D max pooling operation.\n\nThe output dimensions are functions of the filter dimensions, stride, and padding.\n\nThe values in the output tensor are computed as:\n\noutput[b, i, j, channel] =\nmax_{di, dj} (\ninput[b, strides * i + di, strides * j + dj, channel]\n)\n\n\nSupported tensor OperandCode:\n\nSupported tensor rank: 4, with \"NHWC\" or \"NCHW\" data layout. With the default data layout NHWC, the data is stored in the order of: [batch, height, width, channels]. Alternatively, the data layout could be NCHW, the data storage order of: [batch, channels, height, width]. NCHW is supported since API level 29.\n\n• 0: A 4-D tensor, of shape [batches, height, width, depth], specifying the input. Since API level 29, zero batches is supported for this tensor.\n• 1: An ANEURALNETWORKS_INT32 scalar, specifying the padding on the left, in the ‘width’ dimension.\n• 2: An ANEURALNETWORKS_INT32 scalar, specifying the padding on the right, in the ‘width’ dimension.\n• 3: An ANEURALNETWORKS_INT32 scalar, specifying the padding on the top, in the ‘height’ dimension.\n• 4: An ANEURALNETWORKS_INT32 scalar, specifying the padding on the bottom, in the ‘height’ dimension.\n• 5: An ANEURALNETWORKS_INT32 scalar, specifying the stride when walking through input in the ‘width’ dimension.\n• 6: An ANEURALNETWORKS_INT32 scalar, specifying the stride when walking through input in the ‘height’ dimension.\n• 7: An ANEURALNETWORKS_INT32 scalar, specifying the filter width.\n• 8: An ANEURALNETWORKS_INT32 scalar, specifying the filter height.\n• 9: An ANEURALNETWORKS_INT32 scalar, and has to be one of the FuseCode values. Specifies the activation to invoke on the result.\n• 10: An optional ANEURALNETWORKS_BOOL scalar, default to false. Set to true to specify NCHW data layout for input0 and output0. Available since API level 29.\n\n• 0: A 4-D tensor, of shape [batches, height, width, depth], specifying the input. Since API level 29, zero batches is supported for this tensor.\n• 1: An ANEURALNETWORKS_INT32 scalar, specifying the implicit padding scheme, has to be one of the PaddingCode values.\n• 2: An ANEURALNETWORKS_INT32 scalar, specifying the stride when walking through input in the ‘width’ dimension.\n• 3: An ANEURALNETWORKS_INT32 scalar, specifying the stride when walking through input in the ‘height’ dimension.\n• 4: An ANEURALNETWORKS_INT32 scalar, specifying the filter width.\n• 5: An ANEURALNETWORKS_INT32 scalar, specifying the filter height.\n• 6: An ANEURALNETWORKS_INT32 scalar, and has to be one of the FuseCode values. Specifies the activation to invoke on the result.\n• 7: An optional ANEURALNETWORKS_BOOL scalar, default to false. Set to true to specify NCHW data layout for input0 and output0. Available since API level 29.\n\nOutputs:\n\nAvailable since API level 27.\n\nANEURALNETWORKS_MEAN\n\nComputes the mean of elements across dimensions of a tensor.\n\nReduces the input tensor along the given dimensions to reduce. Unless keep_dims is true, the rank of the tensor is reduced by 1 for each entry in axis. If keep_dims is true, the reduced dimensions are retained with length 1.\n\nSupported tensor OperandCode:\n\nSupported tensor rank: up to 4\n\nInputs:\n\n• 0: A tensor, specifying the input.\n• 1: A 1-D Tensor of ANEURALNETWORKS_TENSOR_INT32. The dimensions to reduce. Must be in the range [-rank(input_tensor), rank(input_tensor)).NOTE: When the operation was introduced, the documentation incorrectly stated that if dimensions were empty, the operation would reduce across all dimensions. This behavior was never implemented.\n• 2: An ANEURALNETWORKS_INT32 scalar, keep_dims. If positive, retains reduced dimensions with length 1.\n\nOutputs:\n\nAvailable since API level 28.\n\nANEURALNETWORKS_MINIMUM\n\nReturns the element-wise minimum of two tensors.\n\nSupported tensor OperandCode:\n\nSupported tensor rank: from 1.\n\nInputs:\n\nOutputs:\n\nAvailable since API level 29.\n\nANEURALNETWORKS_MUL\n\nMultiplies two tensors, element-wise.\n\nTakes two input tensors of identical OperandCode and compatible dimensions. The output is the product of both input tensors, optionally modified by an activation function.\n\nTwo dimensions are compatible when:\n\n1. they are equal, or\n2. one of them is 1\n\nThe size of the resulting output is the maximum size along each dimension of the input operands. It starts with the trailing dimensions, and works its way forward.\n\nSince API level 29, generic zero-sized input tensor is supported. Zero dimension is only compatible with 0 or 1. The size of the output dimension is zero if either of corresponding input dimension is zero.\n\nSupported tensor OperandCode:\n\nSupported tensor rank: up to 4\n\nInputs:\n\nOutputs:\n\nAvailable since API level 27.\n\nANEURALNETWORKS_NEG\n\nComputes numerical negative value element-wise.\n\nSupported tensor OperandCode:\n\nSupported tensor rank: from 1.\n\nInputs:\n\n• 0: A tensor.\n\nOutputs:\n\n• 0: The output tensor of same shape as input0.\n\nAvailable since API level 29.\n\nANEURALNETWORKS_NOT_EQUAL\n\nFor input tensors x and y, computes x != y elementwise.\n\nSupported tensor OperandCode:\n\nSupported tensor rank: from 1\n\nInputs:\n\n• 0: A tensor.\n• 1: A tensor of the same OperandCode and dimensions compatible with input0.\n\nOutputs:\n\nAvailable since API level 29.\n\nANEURALNETWORKS_PAD\n\nSupported tensor OperandCode:\n\nSupported tensor rank: up to 4\n\nInputs:\n\n• 0: An n-D tensor, specifying the tensor to be padded.\n• 1: A 2-D Tensor of ANEURALNETWORKS_TENSOR_INT32, the paddings for each spatial dimension of the input tensor. The shape of the tensor must be {rank(input0), 2}. padding[i, 0] specifies the number of elements to be padded in the front of dimension i. padding[i, 1] specifies the number of elements to be padded after the end of dimension i.\n\nOutputs:\n\nAvailable since API level 28.\n\nANEURALNETWORKS_PAD_V2\n\nPads a tensor with the given constant value according to the specified paddings.\n\nSupported tensor OperandCode:\n\nSupported tensor rank: up to 4\n\nInputs:\n\nOutputs:\n\n• 0: A tensor of the same OperandCode as input0. The output tensor has the same rank as input0, and each dimension of the output tensor has the same size as the corresponding dimension of the input tensor plus the size of the padding: output0.dimension[i] = padding[i, 0] + input0.dimension[i] + padding[i, 1] For a ANEURALNETWORKS_TENSOR_QUANT8_ASYMM and ANEURALNETWORKS_TENSOR_QUANT8_ASYMM_SIGNED tensor, the scale and zeroPoint must be the same as input0.\n\nAvailable since API level 29.\n\nANEURALNETWORKS_POW\n\nComputes the power of one value to another.\n\nGiven a tensor base and a tensor exponent, this operation computes base^exponent elementwise.\n\nThis operations supports broadcasting. The size of the output is the maximum size along each dimension of the input operands. It starts with the trailing dimensions, and works its way forward.\n\nFor example: base.dimension = {4, 1, 2} exponent.dimension = {5, 4, 3, 1} output.dimension = {5, 4, 3, 2}\n\nSupported tensor OperandCode:\n\nSupported tensor rank: from 1\n\nInputs:\n\n• 0: A tensor specifying the base.\n• 1: A tensor specifying the exponent.\n\nOutputs:\n\n• 0: An output tensor.\n\nAvailable since API level 29.\n\nANEURALNETWORKS_PRELU\n\nParametric Rectified Linear Unit.\n\nIt follows: f(x) = alpha * x for x < 0, f(x) = x for x >= 0, where alpha is a learned array with the same OperandCode and compatible dimensions as input x.\n\nTwo dimensions are compatible when:\n\n1. they are equal, or\n2. one of them is 1\n\nThe size of the output is the maximum size along each dimension of the input operands. It starts with the trailing dimensions, and works its way forward.\n\nExample: input.dimension = {4, 1, 2} alpha.dimension = {5, 4, 3, 1} output.dimension = {5, 4, 3, 2}\n\nSupported tensor OperandCode:\n\nSupported tensor rank: from 1\n\nInputs:\n\n• 0: A tensor, specifying the input.\n• 1: A tensor of the same OperandCode, and compatible dimensions as input0, specifying the alpha.\n\nOutputs:\n\nAvailable since API level 29.\n\nANEURALNETWORKS_QUANTIZE\n\nQuantizes the input tensor.\n\nThe formula for ANEURALNETWORKS_TENSOR_QUANT8_ASYMM output tensor is:\n\noutput = max(0, min(255, round(input / scale) + zeroPoint)\n\n\nThe formula for ANEURALNETWORKS_TENSOR_QUANT8_ASYMM_SIGNED output tensor is:\n\noutput = max(-128, min(127, round(input / scale) + zeroPoint)\n\n\nSupported input tensor OperandCode:\n\nSupported output tensor OperandCode:\n\nSupported tensor rank: from 1\n\nInputs:\n\n• 0: A tensor, may be zero-sized.\n\nOutputs:\n\nAvailable since API level 29.\n\nANEURALNETWORKS_QUANTIZED_16BIT_LSTM\n\nA version of quantized LSTM, using 16 bit quantization for internal state.\n\nThere is no projection layer, so cell state size is equal to the output size.\n\nInputs:\n\n• 0: A 2-D tensor of type ANEURALNETWORKS_TENSOR_QUANT8_ASYMM and shape [numBatches, inputSize] specifying the input to the LSTM cell. Tensor is quantized with a fixed quantization range of -1, 127/128.\n• 1: The input-to-input weights. A 2-D tensor of type ANEURALNETWORKS_TENSOR_QUANT8_ASYMM and shape [outputSize, inputSize] specifying input-to-input part of weights for fully-connected layer inside the LSTM cell. Quantization zero point and scale must be the same across all the weights.\n• 2: The input-to-forget weights. A 2-D tensor of type ANEURALNETWORKS_TENSOR_QUANT8_ASYMM and shape [outputSize, inputSize] specifying input-to-forget part of weights for fully-connected layer inside the LSTM cell. Quantization zero point and scale must be the same across all the weights.\n• 3: The input-to-cell weights. A 2-D tensor of type ANEURALNETWORKS_TENSOR_QUANT8_ASYMM and shape [outputSize, inputSize] specifying input-to-cell part of weights for fully-connected layer inside the LSTM cell. Quantization zero point and scale must be the same across all the weights.\n• 4: The input-to-output weights. A 2-D tensor of type ANEURALNETWORKS_TENSOR_QUANT8_ASYMM and shape [outputSize, inputSize] specifying input-to-output part of weights for fully-connected layer inside the LSTM cell. Quantization zero point and scale must be the same across all the weights.\n• 5: The recurrent-to-input weights. A 2-D tensor of type ANEURALNETWORKS_TENSOR_QUANT8_ASYMM and shape [outputSize, outputSize] specifying recurrent-to-input part of weights for fully-connected layer inside the LSTM cell. Quantization zero point and scale must be the same across all the weights.\n• 6: The recurrent-to-forget weights. A 2-D tensor of type ANEURALNETWORKS_TENSOR_QUANT8_ASYMM and shape [outputSize, outputSize] specifying recurrent-to-forget part of weights for fully-connected layer inside the LSTM cell. Quantization zero point and scale must be the same across all the weights.\n• 7: The recurrent-to-cell weights. A 2-D tensor of type ANEURALNETWORKS_TENSOR_QUANT8_ASYMM and shape [outputSize, outputSize] specifying recurrent-to-cell part of weights for fully-connected layer inside the LSTM cell. Quantization zero point and scale must be the same across all the weights.\n• 8: The recurrent-to-output weights. A 2-D tensor of type ANEURALNETWORKS_TENSOR_QUANT8_ASYMM and shape [outputSize, outputSize] specifying recurrent-to-output part of weights for fully-connected layer inside the LSTM cell. Quantization zero point and scale must be the same across all the weights.\n• 9: The input gate bias. A 1-D tensor of type ANEURALNETWORKS_TENSOR_INT32 and shape [outputSize] specifying the bias for the fully-connected layer inside the LSTM cell. Bias is quantized with scale being a product of input and weights scales and zeroPoint equal to 0.\n• 10:The forget gate bias. A 1-D tensor of type ANEURALNETWORKS_TENSOR_INT32 and shape [outputSize] specifying the bias for the fully-connected layer inside the LSTM cell. Bias is quantized with scale being a product of input and weights scales and zeroPoint equal to 0.\n• 11:The cell bias. A 1-D tensor of type ANEURALNETWORKS_TENSOR_INT32 and shape [outputSize] specifying the bias for the fully-connected layer inside the LSTM cell. Bias is quantized with scale being a product of input and weights scales and zeroPoint equal to 0.\n• 12:The output gate bias. A 1-D tensor of type ANEURALNETWORKS_TENSOR_INT32 and shape [outputSize] specifying the bias for the fully-connected layer inside the LSTM cell. Bias is quantized with scale being a product of input and weights scales and zeroPoint equal to 0.\n• 13: A 2-D tensor of type ANEURALNETWORKS_TENSOR_QUANT16_SYMM and shape [numBatches, outputSize] specifying the cell state from the previous time step of the LSTM cell. It is quantized using a quantization range of -2^4, 2^4 * 32767/32768.\n• 14: A 2-D tensor of type ANEURALNETWORKS_TENSOR_QUANT8_ASYMM and shape [numBathes, outputSize] specifying the output of the LSTM cell from previous time-step. Tensor is quantized with a fixed quantization range of -1, 127/128.\n\nOutputs:\n\nANEURALNETWORKS_QUANTIZED_LSTM\n\nQuantized version of ANEURALNETWORKS_LSTM.\n\nThe input and the output use asymmetric quantized types, while the rest use symmetric ones.\n\nInputs:\n\nOutputs:\n\nAvailable since API level 30.\n\nANEURALNETWORKS_RANDOM_MULTINOMIAL\n\nDraws samples from a multinomial distribution.\n\nSupported tensor OperandCode:\n\nInputs:\n\n• 0: A 2-D tensor with shape [batches, classes], specifying the unnormalized log-probabilities for all classes.\n• 1: A scalar ANEURALNETWORKS_INT32, specifying the number of independent samples to draw for each row slice.\n• 2: A 1-D ANEURALNETWORKS_TENSOR_INT32 tensor with shape , specifying seeds used to initialize the random distribution. If both provided seeds are 0, both will be randomly generated. Outputs:\n• 0: A 2-D ANEURALNETWORKS_TENSOR_INT32 tensor with shape [batches, samples], containing the drawn samples.\n\nAvailable since API level 29.\n\nANEURALNETWORKS_RANK\n\nReturns the rank of a tensor.\n\nThe rank of a tensor is the number of dimensions in it. Also known as \"order\", \"degree\", \"ndims\".\n\nSupported tensor OperandCode:\n\nSupported tensor rank: from 1.\n\nInputs:\n\n• 0: The input tensor.\n\nOutputs:\n\nAvailable since API level 30.\n\nANEURALNETWORKS_REDUCE_ALL\n\nReduces a tensor by computing the \"logical and\" of elements along given dimensions.\n\nIf keep_dims is true, the reduced dimensions are retained with length 1. Otherwise, the rank of the tensor is reduced by 1 for each entry in dimensions.\n\nSupported tensor OperandCode:\n\nSupported tensor rank: up to 4\n\nInputs:\n\nOutputs:\n\nAvailable since API level 29.\n\nANEURALNETWORKS_REDUCE_ANY\n\nReduces a tensor by computing the \"logical or\" of elements along given dimensions.\n\nIf keep_dims is true, the reduced dimensions are retained with length 1. Otherwise, the rank of the tensor is reduced by 1 for each entry in dimensions.\n\nSupported tensor OperandCode:\n\nSupported tensor rank: up to 4\n\nInputs:\n\nOutputs:\n\nAvailable since API level 29.\n\nANEURALNETWORKS_REDUCE_MAX\n\nReduces a tensor by computing the maximum of elements along given dimensions.\n\nIf keep_dims is true, the reduced dimensions are retained with length 1. Otherwise, the rank of the tensor is reduced by 1 for each entry in dimensions.\n\nSupported tensor OperandCode:\n\nSupported tensor rank: up to 4\n\nInputs:\n\nOutputs:\n\nAvailable since API level 29.\n\nANEURALNETWORKS_REDUCE_MIN\n\nReduces a tensor by computing the minimum of elements along given dimensions.\n\nIf keep_dims is true, the reduced dimensions are retained with length 1. Otherwise, the rank of the tensor is reduced by 1 for each entry in dimensions.\n\nSupported tensor OperandCode:\n\nSupported tensor rank: up to 4\n\nInputs:\n\nOutputs:\n\nAvailable since API level 29.\n\nANEURALNETWORKS_REDUCE_PROD\n\nReduces a tensor by multiplying elements along given dimensions.\n\nIf keep_dims is true, the reduced dimensions are retained with length 1. Otherwise, the rank of the tensor is reduced by 1 for each entry in dimensions.\n\nSupported tensor OperandCode:\n\nSupported tensor rank: up to 4\n\nInputs:\n\nOutputs:\n\nAvailable since API level 29.\n\nANEURALNETWORKS_REDUCE_SUM\n\nReduces a tensor by summing elements along given dimensions.\n\nIf keep_dims is true, the reduced dimensions are retained with length 1. Otherwise, the rank of the tensor is reduced by 1 for each entry in dimensions.\n\nSupported tensor OperandCode:\n\nSupported tensor rank: up to 4\n\nInputs:\n\nOutputs:\n\nAvailable since API level 29.\n\nANEURALNETWORKS_RELU\n\nComputes rectified linear activation on the input tensor element-wise.\n\nThe output is calculated using this formula:\n\noutput = max(0, input)\n\n\nSupported tensor OperandCode:\n\nSupported tensor rank: up to 4.\n\nInputs:\n\n• 0: A tensor, specifying the input. Since API level 29, this tensor may be zero-sized.\n\nOutputs:\n\nAvailable since API level 27.\n\nANEURALNETWORKS_RELU1\n\nComputes rectified linear 1 activation on the input tensor element-wise.\n\nThe output is calculated using this formula:\n\noutput = min(1.f, max(-1.f, input))\n\n\nSupported tensor OperandCode:\n\nSupported tensor rank: up to 4.\n\nInputs:\n\n• 0: A tensor, specifying the input. Since API level 29, this tensor may be zero-sized.\n\nOutputs:\n\nAvailable since API level 27.\n\nANEURALNETWORKS_RELU6\n\nComputes rectified linear 6 activation on the input tensor element-wise.\n\nThe output is calculated using this formula:\n\noutput = min(6, max(0, input))\n\n\nSupported tensor OperandCode:\n\nSupported tensor rank: up to 4.\n\nInputs:\n\n• 0: A tensor, specifying the input. Since API level 29, this tensor may be zero-sized.\n\nOutputs:\n\nAvailable since API level 27.\n\nANEURALNETWORKS_RESHAPE\n\nReshapes a tensor.\n\nGiven tensor, this operation returns a tensor that has the same values as tensor, but with a newly specified shape.\n\nSupported tensor OperandCode:\n\nSupported tensor rank: up to 4.\n\nInputs:\n\n• 0: A tensor, specifying the tensor to be reshaped.\n• 1: A 1-D tensor of ANEURALNETWORKS_TENSOR_INT32, defining the shape of the output tensor. The number of elements implied by shape must be the same as the number of elements in the input tensor.If one component of shape is the special value -1, the size of that dimension is computed so that the total size remains constant. In particular, a shape of [-1] flattens into 1-D. At most one component of shape can be -1.\n\nOutputs:\n\nAvailable since API level 27.\n\nANEURALNETWORKS_RESIZE_BILINEAR\n\nResizes images to given size using the bilinear interpretation.\n\nResized images must be distorted if their output aspect ratio is not the same as input aspect ratio. The corner pixels of output may not be the same as corner pixels of input.\n\nSupported tensor OperandCode:\n\nSupported tensor rank: 4, with \"NHWC\" or \"NCHW\" data layout. With the default data layout NHWC, the data is stored in the order of: [batch, height, width, channels]. Alternatively, the data layout could be NCHW, the data storage order of: [batch, channels, height, width]. NCHW is supported since API level 29.\n\nBoth resizing by shape and resizing by scale are supported.\n\nInputs (resizing by shape):\n\n• 0: A 4-D tensor, of shape [batches, height, width, depth], specifying the input. Since API level 29, zero batches is supported for this tensor.\n• 1: An ANEURALNETWORKS_INT32 scalar, specifying the output width of the output tensor.\n• 2: An ANEURALNETWORKS_INT32 scalar, specifying the output height of the output tensor.\n• 3: An optional ANEURALNETWORKS_BOOL scalar, default to false. Set to true to specify NCHW data layout for input0 and output0. Available since API level 29.\n• 4: Align corners. An optional ANEURALNETWORKS_BOOL scalar, default to false. If True, the centers of the 4 corner pixels of the input and output tensors are aligned, preserving the values at the corner pixels. Available since API level 30.\n• 5: Half pixel centers. An optional ANEURALNETWORKS_BOOL scalar, default to false. If True, the pixel centers are assumed to be at (0.5, 0.5). This is the default behavior of image.resize in TF 2.0. If this parameter is True, then align_corners parameter must be False. Available since API level 30.\n\nInputs (resizing by scale, since API level 29):\n\n• 0: A 4-D tensor, of shape [batches, height, width, depth], specifying the input. Zero batches is supported for this tensor.\n• 1: A scalar, specifying width_scale, the scaling factor of the width dimension from the input tensor to the output tensor. The output width is calculated as new_width = floor(width * width_scale). The scalar must be of ANEURALNETWORKS_FLOAT16 if input0 is of ANEURALNETWORKS_TENSOR_FLOAT16 and of ANEURALNETWORKS_FLOAT32 otherwise.\n• 2: A scalar, specifying height_scale, the scaling factor of the height dimension from the input tensor to the output tensor. The output height is calculated as new_height = floor(height * height_scale). The scalar must be of ANEURALNETWORKS_FLOAT16 if input0 is of ANEURALNETWORKS_TENSOR_FLOAT16 and of ANEURALNETWORKS_FLOAT32 otherwise.\n• 3: An optional ANEURALNETWORKS_BOOL scalar, default to false. Set to true to specify NCHW data layout for input0 and output0.\n• 4: Align corners. An optional ANEURALNETWORKS_BOOL scalar, default to false. If True, the centers of the 4 corner pixels of the input and output tensors are aligned, preserving the values at the corner pixels. Available since API level 30.\n• 5: Half pixel centers. An optional ANEURALNETWORKS_BOOL scalar, default to false. If True, the pixel centers are assumed to be at (0.5, 0.5). This is the default behavior of image.resize in TF 2.0. If this parameter is True, then align_corners parameter must be False. Available since API level 30.\n\nOutputs:\n\nAvailable since API level 27.\n\nANEURALNETWORKS_RESIZE_NEAREST_NEIGHBOR\n\nResizes images to given size using the nearest neighbor interpretation.\n\nResized images must be distorted if their output aspect ratio is not the same as input aspect ratio. The corner pixels of output may not be the same as corner pixels of input.\n\nSupported tensor OperandCode:\n\nSupported tensor rank: 4, with \"NHWC\" or \"NCHW\" data layout. With the default data layout NHWC, the data is stored in the order of: [batch, height, width, channels]. Alternatively, the data layout could be NCHW, the data storage order of: [batch, channels, height, width].\n\nBoth resizing by shape and resizing by scale are supported.\n\nInputs (resizing by shape):\n\n• 0: A 4-D tensor, of shape [batches, height, width, depth], specifying the input. Zero batches is supported for this tensor.\n• 1: An ANEURALNETWORKS_INT32 scalar, specifying the output width of the output tensor.\n• 2: An ANEURALNETWORKS_INT32 scalar, specifying the output height of the output tensor.\n• 3: An ANEURALNETWORKS_BOOL scalar, default to false. Set to true to specify NCHW data layout for input0 and output0.\n• 4: Align corners. An optional ANEURALNETWORKS_BOOL scalar, default to false. If True, the centers of the 4 corner pixels of the input and output tensors are aligned, preserving the values at the corner pixels. Available since API level 30.\n• 5: Half pixel centers. An optional ANEURALNETWORKS_BOOL scalar, default to false. If True, the pixel centers are assumed to be at (0.5, 0.5). This is the default behavior of image.resize in TF 2.0. If this parameter is True, then align_corners parameter must be False. Available since API level 30.\n\nInputs (resizing by scale):\n\n• 0: A 4-D tensor, of shape [batches, height, width, depth], specifying the input. Zero batches is supported for this tensor.\n• 1: A scalar, specifying width_scale, the scaling factor of the width dimension from the input tensor to the output tensor. The output width is calculated as new_width = floor(width * width_scale). The scalar must be of ANEURALNETWORKS_FLOAT16 if input0 is of ANEURALNETWORKS_TENSOR_FLOAT16 and of ANEURALNETWORKS_FLOAT32 otherwise.\n• 2: A scalar, specifying height_scale, the scaling factor of the height dimension from the input tensor to the output tensor. The output height is calculated as new_height = floor(height * height_scale). The scalar must be of ANEURALNETWORKS_FLOAT16 if input0 is of ANEURALNETWORKS_TENSOR_FLOAT16 and of ANEURALNETWORKS_FLOAT32 otherwise.\n• 3: An ANEURALNETWORKS_BOOL scalar, default to false. Set to true to specify NCHW data layout for input0 and output0.\n• 4: Align corners. An optional ANEURALNETWORKS_BOOL scalar, default to false. If True, the centers of the 4 corner pixels of the input and output tensors are aligned, preserving the values at the corner pixels. Available since API level 30.\n• 5: Half pixel centers. An optional ANEURALNETWORKS_BOOL scalar, default to false. If True, the pixel centers are assumed to be at (0.5, 0.5). This is the default behavior of image.resize in TF 2.0. If this parameter is True, then align_corners parameter must be False. Available since API level 30.\n\nOutputs:\n\nAvailable since API level 29.\n\nANEURALNETWORKS_RNN\n\nA basic recurrent neural network layer.\n\nThis layer implements the operation: outputs = state = activation(inputs * input_weights + state * recurrent_weights + bias)\n\nWhere:\n\n• “input_weights” is a weight matrix that multiplies the inputs;\n• “recurrent_weights” is a weight matrix that multiplies the current “state” which itself is the output from the previous time step computation;\n• “bias” is a bias vector (added to each output vector in the batch);\n• “activation” is the function passed as the “fused_activation_function” argument (if not “NONE”).\n\nSupported tensor OperandCode:\n\nThe input tensors must all be the same type.\n\nInputs:\n\n• 0: input. A 2-D tensor of shape [batch_size, input_size], where “batch_size” corresponds to the batching dimension, and “input_size” is the size of the input.\n• 1: weights. A 2-D tensor of shape [num_units, input_size], where “num_units” corresponds to the number of units.\n• 2: recurrent_weights. A 2-D tensor of shape [num_units, num_units], with columns corresponding to the weights from each unit.\n• 3: bias. A 1-D tensor of shape [num_units].\n• 4: hidden state (in). A 2-D tensor of shape [batch_size, num_units].\n• 5: fused_activation_function. An optional FuseCode value indicating the activation function. If “NONE” is specified then it results in a linear activation.\n\nOutputs:\n\n• 0: hidden state (out). A 2-D tensor of shape [batch_size, num_units].\n• 1: output. A 2-D tensor of shape [batch_size, num_units]. This is effectively the same as the current state value.\n\nAvailable since API level 27.\n\nANEURALNETWORKS_ROI_ALIGN\n\nSelect and scale the feature map of each region of interest to a unified output size by average pooling sampling points from bilinear interpolation.\n\nThe region of interest is represented by its upper-left corner coordinate (x1,y1) and lower-right corner coordinate (x2,y2) in the original image. A spatial scaling factor is applied to map into feature map coordinate. A valid region of interest should satisfy x1 <= x2 and y1 <= y2.\n\nNo rounding is applied in this operation. The sampling points are unified distributed in the pooling bin and their values are calculated by bilinear interpolation.\n\nSupported tensor OperandCode:\n\nSupported tensor rank: 4, with \"NHWC\" or \"NCHW\" data layout. With the default data layout NHWC, the data is stored in the order of: [batch, height, width, channels]. Alternatively, the data layout could be NCHW, the data storage order of: [batch, channels, height, width].\n\nInputs:\n\n• 0: A 4-D tensor, specifying the feature map.\n• 1: A 2-D Tensor of shape [num_rois, 4], specifying the locations of the regions of interest, each line with format [x1, y1, x2, y2]. For input0 of type ANEURALNETWORKS_TENSOR_QUANT8_ASYMM, this tensor should be of ANEURALNETWORKS_TENSOR_QUANT16_ASYMM, with zeroPoint of 0 and scale of 0.125. Zero num_rois is supported for this tensor.\n• 2: An 1-D ANEURALNETWORKS_TENSOR_INT32 tensor, of shape [num_rois], specifying the batch index of each box. Boxes with the same batch index are grouped together. Zero num_rois is supported for this tensor.\n• 3: An ANEURALNETWORKS_INT32 scalar, specifying the output height of the output tensor.\n• 4: An ANEURALNETWORKS_INT32 scalar, specifying the output width of the output tensor.\n• 5: An ANEURALNETWORKS_FLOAT32 scalar, specifying the ratio from the height of original image to the height of feature map.\n• 6: An ANEURALNETWORKS_FLOAT32 scalar, specifying the ratio from the width of original image to the width of feature map.\n• 7: An ANEURALNETWORKS_INT32 scalar, specifying the number of sampling points in height dimension used to compute the output. Set to 0 for adaptive value of ceil(roi_height/out_height).\n• 8: An ANEURALNETWORKS_INT32 scalar, specifying the number of sampling points in width dimension used to compute the output. Set to 0 for adaptive value of ceil(roi_width/out_width).\n• 9: An ANEURALNETWORKS_BOOL scalar, set to true to specify NCHW data layout for input0 and output0. Set to false for NHWC.\n\nOutputs:\n\nAvailable since API level 29.\n\nANEURALNETWORKS_ROI_POOLING\n\nSelect and scale the feature map of each region of interest to a unified output size by max-pooling.\n\nThe region of interest is represented by its upper-left corner coordinate (x1,y1) and lower-right corner coordinate (x2,y2) in the original image. A spatial scaling factor is applied to map into feature map coordinate. A valid region of interest should satisfy x1 <= x2 and y1 <= y2.\n\nRounding is applied in this operation to ensure integer boundary for regions of interest and pooling bins.\n\nSupported tensor OperandCode:\n\nSupported tensor rank: 4, with \"NHWC\" or \"NCHW\" data layout. With the default data layout NHWC, the data is stored in the order of: [batch, height, width, channels]. Alternatively, the data layout could be NCHW, the data storage order of: [batch, channels, height, width].\n\nInputs:\n\nOutputs:\n\nAvailable since API level 29.\n\nANEURALNETWORKS_RSQRT\n\nComputes reciprocal of square root of x element-wise.\n\nSupported tensor OperandCode:\n\nSupported tensor rank: from 1.\n\nInputs:\n\n• 0: A tensor.\n\nOutputs:\n\n• 0: The output tensor of same shape as input0.\n\nAvailable since API level 29.\n\nANEURALNETWORKS_SELECT\n\nUsing a tensor of booleans c and input tensors x and y select values elementwise from both input tensors:\n\nO[i] = C[i] ? x[i] : y[i].\n\nSupported tensor OperandCode:\n\nSupported tensor rank: from 1\n\nInputs:\n\nOutputs:\n\n• 0: A tensor of the same type and shape as input1 and input2. For a ANEURALNETWORKS_TENSOR_QUANT8_ASYMM tensor, the scale and zeroPoint can be different from inputs' scale and zeroPoint.\n\nAvailable since API level 29.\n\nANEURALNETWORKS_SIN\n\nComputes sin of x element-wise.\n\nSupported tensor OperandCode:\n\nSupported tensor rank: from 1.\n\nInputs:\n\n• 0: A tensor.\n\nOutputs:\n\n• 0: The output tensor of same shape as input0.\n\nAvailable since API level 29.\n\nANEURALNETWORKS_SLICE\n\nExtracts a slice of specified size from the input tensor starting at a specified location.\n\nThe starting location is specified as a 1-D tensor containing offsets for each dimension. The size is specified as a 1-D tensor containing either size of a slice along corresponding dimension or -1. In the latter case, all the remaining elements in dimension are included in the slice.\n\nA sum of begin offset and a size of a slice must not exceed size of a corresponding dimension.\n\nSupported tensor OperandCode:\n\nSupported tensor rank: from 1\n\nInputs:\n\n• 0: An n-D tensor to take slice from, may be zero-sized.\n• 1: A 1-D tensor of type ANEURALNETWORKS_TENSOR_INT32 specifying the beginning indices of the slice in each dimension.\n• 2: A 1-D tensor of type ANEURALNETWORKS_TENSOR_INT32 specifying the size of the slice in each dimension.\n\nOutputs:\n\nAvailable since API level 29.\n\nANEURALNETWORKS_SOFTMAX\n\nComputes the softmax activation on the input tensor element-wise, per batch, by normalizing the input vector so the maximum coefficient is zero.\n\nThe output is calculated using this formula:\n\noutput[batch, i] =\nexp((input[batch, i] - max(input[batch, :])) * beta) /\nsum_{k}{exp((input[batch, k] - max(input[batch, :])) * beta)}\n\n\nFor input tensor with rank other than 2, the activation will be applied independently on each 1-D slice along specified dimension.\n\nSupported tensor OperandCode:\n\nSupported tensor rank: up to 4. Tensors with rank other than 2 or 4 are only supported since API level 29.\n\nInputs:\n\nOutputs:\n\nAvailable since API level 27.\n\nANEURALNETWORKS_SPACE_TO_BATCH_ND\n\nSpaceToBatch for N-Dimensional tensors.\n\nThis operation divides \"spatial\" dimensions [1, ..., M] of the input into a grid of blocks of shape block_shape, and interleaves these blocks with the \"batch\" dimension (0) such that in the output, the spatial dimensions [1, ..., M] correspond to the position within the grid, and the batch dimension combines both the position within a spatial block and the original batch position. Prior to division into blocks, the spatial dimensions of the input are optionally zero padded according to paddings.\n\nSupported tensor OperandCode:\n\nSupported tensor rank: 4, with \"NHWC\" or \"NCHW\" data layout. With the default data layout NHWC, the data is stored in the order of: [batch, height, width, channels]. Alternatively, the data layout could be NCHW, the data storage order of: [batch, channels, height, width]. NCHW is supported since API level 29.\n\nInputs:\n\n• 0: An n-D tensor, specifying the input.\n• 1: A 1-D Tensor of ANEURALNETWORKS_TENSOR_INT32, the block sizes for each spatial dimension of the input tensor. All values must be >= 1.\n• 2: A 2-D Tensor of ANEURALNETWORKS_TENSOR_INT32, the paddings for each spatial dimension of the input tensor. All values must be >= 0. The shape of the tensor must be {M, 2}, where M is the number of spatial dimensions. padding[i, 0] specifies the number of element to be padded in the front of dimension i. padding[i, 1] specifies the number of element to be padded after the end of dimension i.\n• 3: An optional ANEURALNETWORKS_BOOL scalar, default to false. Set to true to specify NCHW data layout for input0 and output0. Available since API level 29.\n\nOutputs:\n\nAvailable since API level 28.\n\nANEURALNETWORKS_SPACE_TO_DEPTH\n\nRearranges blocks of spatial data, into depth.\n\nMore specifically, this op outputs a copy of the input tensor where values from the height and width dimensions are moved to the depth dimension. The value block_size indicates the input block size and how the data is moved.\n\nChunks of data of size block_size * block_size from depth are rearranged into non-overlapping blocks of size block_size x block_size.\n\nThe depth of the output tensor is input_depth * block_size * block_size. The input tensor's height and width must be divisible by block_size.\n\nSupported tensor OperandCode:\n\nSupported tensor rank: 4, with \"NHWC\" or \"NCHW\" data layout. With the default data layout NHWC, the data is stored in the order of: [batch, height, width, channels]. Alternatively, the data layout could be NCHW, the data storage order of: [batch, channels, height, width]. NCHW is supported since API level 29.\n\nInputs:\n\n• 0: A 4-D tensor, of shape [batches, height, width, depth_in], specifying the input.\n• 1: An ANEURALNETWORKS_INT32 scalar, specifying the block_size. block_size must be >=1 and block_size must be a divisor of both the input height and width.\n• 2: An optional ANEURALNETWORKS_BOOL scalar, default to false. Set to true to specify NCHW data layout for input0 and output0. Available since API level 29.\n\nOutputs:\n\nAvailable since API level 27.\n\nANEURALNETWORKS_SPLIT\n\nSplits a tensor along a given axis into num_splits subtensors.\n\nSupported tensor OperandCode:\n\nSupported tensor rank: from 1\n\nInputs:\n\n• 0: An n-D tensor to split.\n• 1: An ANEURALNETWORKS_INT32 scalar specifying the axis along which to split.\n• 2: An ANEURALNETWORKS_INT32 scalar indicating the number of splits along given axis. Must evenly divide axis size.\n\nOutputs:\n\nAvailable since API level 29.\n\nANEURALNETWORKS_SQRT\n\nComputes square root of x element-wise.\n\nSupported tensor OperandCode:\n\nSupported tensor rank: from 1.\n\nInputs:\n\n• 0: A tensor.\n\nOutputs:\n\n• 0: The output tensor of same shape as input0.\n\nAvailable since API level 29.\n\nANEURALNETWORKS_SQUEEZE\n\nRemoves dimensions of size 1 from the shape of a tensor.\n\nGiven a tensor input, this operation returns a tensor of the same OperandCode with all dimensions of size 1 removed. If you don't want to remove all size 1 dimensions, you can remove specific size 1 dimensions by specifying the axes (input1).\n\nSupported tensor OperandCode:\n\nSupported tensor rank: up to 4\n\nInputs:\n\n• 0: An n-D tensor, the tensor to be squeezed.\n• 1: An optional 1-D tensor of ANEURALNETWORKS_TENSOR_INT32. The dimensions to squeeze. If specified only squeezes the dimensions listed. Otherwise, squeezes all dimensions. The dimension index starts at 0. An error must be reported if squeezing a dimension that is not 1.\n\nOutputs:\n\nAvailable since API level 28.\n\nANEURALNETWORKS_STRIDED_SLICE\n\nExtracts a strided slice of a tensor.\n\nRoughly speaking, this op extracts a slice of size (end - begin) / stride from the given input tensor. Starting at the location specified by begin the slice continues by adding stride to the index until all dimensions are not less than end. Note that a stride can be negative, which causes a reverse slice.\n\nSupported tensor OperandCode:\n\nSupported tensor rank: up to 4\n\nInputs:\n\n• 0: An n-D tensor, specifying the tensor to be sliced.\n• 1: begin, a 1-D tensor of ANEURALNETWORKS_TENSOR_INT32. The starts of the dimensions of the input tensor to be sliced. The length must be of rank(input0).\n• 2: end, a 1-D tensor of ANEURALNETWORKS_TENSOR_INT32. The ends of the dimensions of the input tensor to be sliced. The length must be of rank(input0).\n• 3: strides, a 1-D tensor of ANEURALNETWORKS_TENSOR_INT32. The strides of the dimensions of the input tensor to be sliced. The length must be of rank(input0). The entries must be non-zero.\n• 4: begin_mask, an ANEURALNETWORKS_INT32 scalar. If the ith bit of begin_mask is set, begin[i] is ignored and the fullest possible range in that dimension is used instead.\n• 5: end_mask, an ANEURALNETWORKS_INT32 scalar. If the ith bit of end_mask is set, end[i] is ignored and the fullest possible range in that dimension is used instead.\n• 6: shrink_axis_mask, an ANEURALNETWORKS_INT32 scalar. If the ith bit of shrink_axis_mask is set, the ith dimension specification shrinks the dimensionality by 1, taking on the value at index begin[i]. In this case, the ith specification must define a slice of size 1, e.g. begin[i] = x, end[i] = x + 1.\n\nOutputs:\n\nAvailable since API level 28.\n\nANEURALNETWORKS_SUB\n\nElement-wise subtraction of two tensors.\n\nTakes two input tensors of identical OperandCode and compatible dimensions. The output is the result of subtracting the second input tensor from the first one, optionally modified by an activation function.\n\nTwo dimensions are compatible when:\n\n1. they are equal, or\n2. one of them is 1\n\nThe size of the output is the maximum size along each dimension of the input operands. It starts with the trailing dimensions, and works its way forward.\n\nExample: input1.dimension = {4, 1, 2} input2.dimension = {5, 4, 3, 1} output.dimension = {5, 4, 3, 2}\n\nSince API level 29, generic zero-sized input tensor is supported. Zero dimension is only compatible with 0 or 1. The size of the output dimension is zero if either of corresponding input dimension is zero.\n\nSupported tensor OperandCode:\n\nSupported tensor rank: up to 4\n\nInputs:\n\nOutputs:\n\nAvailable since API level 28.\n\nANEURALNETWORKS_SVDF\n\nSVDF op is a kind of stateful layer derived from the notion that a densely connected layer that's processing a sequence of input frames can be approximated by using a singular value decomposition of each of its nodes.\n\nThe implementation is based on:\n\nP. Nakkiran, R. Alvarez, R. Prabhavalkar, C. Parada. “Compressing Deep Neural Networks using a Rank-Constrained Topology”. INTERSPEECH, 2015.\n\nIt processes the incoming input using a 2-stage filtering mechanism:\n\n• stage 1 performs filtering on the \"features\" dimension, whose outputs get pushed into a memory of fixed-size memory_size.\n• stage 2 performs filtering on the \"time\" dimension of the memory_size memoized outputs of stage 1.\n\nSpecifically, for rank 1, this layer implements the operation:\n\nmemory = push(conv1d(inputs, weights_feature, feature_dim,\noutputs = activation(memory * weights_time + bias);\n\n\nWhere:\n\n• “weights_feature” is a weights matrix that processes the inputs (by convolving the input with every “feature filter”), and whose outputs get pushed, stacked in order, into the fixed-size “memory” (the oldest entry gets dropped);\n• “weights_time” is a weights matrix that processes the “memory” (by a batched matrix multiplication on the num_units);\n• “bias” is an optional bias vector (added to each output vector in the batch); and\n• “activation” is the function passed as the “fused_activation_function” argument (if not “NONE”).\n\nEach rank adds a dimension to the weights matrices by means of stacking the filters.\n\nSupported tensor OperandCode:\n\nAll input tensors must be the same type.\n\nInputs:\n\n• 0: input. A 2-D tensor of shape [batch_size, input_size], where “batch_size” corresponds to the batching dimension, and “input_size” is the size of the input.\n• 1: weights_feature. A 2-D tensor of shape [num_units, input_size], where “num_units” corresponds to the number of units.\n• 2: weights_time. A 2-D tensor of shape [num_units, memory_size], where “memory_size” corresponds to the fixed-size of the memory.\n• 3: bias. An optional 1-D tensor of shape [num_units].\n• 4: state (in). A 2-D tensor of shape [batch_size, (memory_size - 1) * num_units * rank].\n• 5: rank. The rank of the SVD approximation.\n• 6: fused_activation_function. An optional FuseCode value indicating the activation function. If “NONE” is specified then it results in a linear activation.\n\nOutputs:\n\n• 0: state (out). A 2-D tensor of the same OperandCode as the inputs, with shape [batch_size, (memory_size - 1) * num_units * rank].\n• 1: output. A 2-D tensor of the same OperandCode as the inputs, with shape [batch_size, num_units].\n\nAvailable since API level 27.\n\nANEURALNETWORKS_TANH\n\nComputes hyperbolic tangent of input tensor element-wise.\n\nThe output is calculated using this formula:\n\noutput = tanh(input)\n\n\nSupported tensor OperandCode:\n\nSupported tensor rank: up to 4.\n\nInputs:\n\n• 0: A tensor, specifying the input. Since API level 29, this tensor may be zero-sized.\n\nOutputs:\n\nAvailable since API level 27.\n\nANEURALNETWORKS_TILE\n\nConstructs a tensor by tiling a given tensor.\n\nThis operation creates a new tensor by replicating inputmultiples times. The output tensor's i-th dimension has input.dims(i) * multiples[i] elements, and the values of input are replicated multiples[i] times along the i-th dimension. For example, tiling [a b c d] by produces [a b c d a b c d].\n\nSupported tensor OperandCode:\n\nSupported tensor rank: from 1\n\nInputs:\n\n• 0: input, an n-D tensor specifying the input.\n• 1: multiples, a 1-D tensor of ANEURALNETWORKS_TENSOR_INT32. The length of multiples must be n.\n\nOutputs:\n\nAvailable since API level 29.\n\nANEURALNETWORKS_TOPK_V2\n\nFinds values and indices of the k largest entries for the last dimension.\n\nResulting values in each dimensions are sorted in descending order. If two values are equal, the one with larger index appears first.\n\nSupported tensor OperandCode:\n\nSupported tensor rank: from 1\n\nInputs:\n\n• 0: input, an n-D tensor specifying the input.\n• 1: k, an ANEURALNETWORKS_INT32 scalar, specifying the number of top elements to look for along the last dimension.\n\nOutputs:\n\nAvailable since API level 29.\n\nANEURALNETWORKS_TRANSPOSE\n\nTransposes the input tensor, permuting the dimensions according to the perm tensor.\n\nThe returned tensor's dimension i corresponds to the input dimension perm[i]. If perm is not given, it is set to (n-1...0), where n is the rank of the input tensor. Hence by default, this operation performs a regular matrix transpose on 2-D input Tensors.\n\nSupported tensor OperandCode:\n\nSupported tensor rank: up to 4\n\nInputs:\n\n• 0: An n-D tensor, specifying the tensor to be transposed. Since API level 29, this tensor may be zero-sized.\n• 1: An optional 1-D Tensor of ANEURALNETWORKS_TENSOR_INT32, the permutation of the dimensions of the input tensor.\n\nOutputs:\n\nAvailable since API level 28.\n\nANEURALNETWORKS_TRANSPOSE_CONV_2D\n\nPerforms the transpose of 2-D convolution operation.\n\nThis operation is sometimes called \"deconvolution\" after Deconvolutional Networks, but is actually the transpose (gradient) of ANEURALNETWORKS_CONV_2D rather than an actual deconvolution.\n\nThe output dimensions are functions of the filter dimensions, stride, and padding.\n\nSupported tensor OperandCode configurations:\n\nAvailable since API level 30:\n\nSupported tensor rank: 4, with \"NHWC\" or \"NCHW\" data layout. With the default data layout NHWC, the data is stored in the order of: [batch, height, width, channels]. Alternatively, the data layout could be NCHW, the data storage order of: [batch, channels, height, width].\n\nOutputs:\n\nAvailable since API level 29.\n\nANEURALNETWORKS_UNIDIRECTIONAL_SEQUENCE_LSTM\n\nA recurrent neural network specified by an LSTM cell.\n\nPerforms (fully) dynamic unrolling of input.\n\nThis Op unrolls the input along the time dimension, and implements the following operation for each element in the sequence s = 1...sequence_length: outputs[s] = projection(state = activation(LSTMOp(inputs[s])))\n\nWhere LSTMOp is the LSTM op as in ANEURALNETWORKS_LSTM, the \"projection\" is an optional projection layer from state and output and the “activation” is the function passed as the “fused_activation_function” argument (if not “NONE”).\n\nSupported tensor OperandCode:\n\nSupported tensor rank: 3, either time-major or batch-major.\n\nAll input and output tensors must be of the same type.\n\nInputs:\n\n• 0: The input ( $x_t$). A 3-D tensor of shape: If time-major: [max_time, batch_size, input_size] If batch-major: [batch_size, max_time, input_size] where “max_time” is the number of timesteps (sequence length), “batch_size” corresponds to the batching dimension, and “input_size” is the size of the input.\n• 1: The input-to-input weights ( $W_{xi}$). Optional. A 2-D tensor of shape [num_units, input_size], where “num_units” corresponds to the number of cell units.\n• 2: The input-to-forget weights ( $W_{xf}$). A 2-D tensor of shape [num_units, input_size].\n• 3: The input-to-cell weights ( $W_{xc}$). A 2-D tensor of shape [num_units, input_size].\n• 4: The input-to-output weights ( $W_{xo}$). A 2-D tensor of shape [num_units, input_size].\n• 5: The recurrent-to-input weights ( $W_{hi}$). Optional. A 2-D tensor of shape [num_units, output_size], where “output_size” corresponds to either the number of cell units (i.e., “num_units”), or the second dimension of the “projection_weights”, if defined.\n• 6: The recurrent-to-forget weights ( $W_{hf}$). A 2-D tensor of shape [num_units, output_size].\n• 7: The recurrent-to-cell weights ( $W_{hc}$). A 2-D tensor of shape [num_units, output_size].\n• 8: The recurrent-to-output weights ( $W_{ho}$). A 2-D tensor of shape [num_units, output_size].\n• 9: The cell-to-input weights ( $W_{ci}$). Optional. A 1-D tensor of shape [num_units].\n• 10:The cell-to-forget weights ( $W_{cf}$). Optional. A 1-D tensor of shape [num_units].\n• 11:The cell-to-output weights ( $W_{co}$). Optional. A 1-D tensor of shape [num_units].\n• 12:The input gate bias ( $b_i$). Optional. A 1-D tensor of shape [num_units].\n• 13:The forget gate bias ( $b_f$). A 1-D tensor of shape [num_units].\n• 14:The cell bias ( $b_c$). A 1-D tensor of shape [num_units].\n• 15:The output gate bias ( $b_o$). A 1-D tensor of shape [num_units].\n• 16:The projection weights ( $W_{proj}$). Optional. A 2-D tensor of shape [output_size, num_units].\n• 17:The projection bias ( $b_{proj}$). Optional. A 1-D tensor of shape [output_size].\n• 18:The output state (in) ( $h_{t-1}$). A 2-D tensor of shape [batch_size, output_size].\n• 19:The cell state (in) ( $C_{t-1}$). A 2-D tensor of shape [batch_size, num_units].\n• 20:The activation function ( $g$). A value indicating the activation function:\n• 0: None;\n• 1: Relu;\n• 3: Relu6;\n• 4: Tanh;\n• 6: Sigmoid.\n• 21:The clipping threshold ( $t_{cell}$) for the cell state, such that values are bound within [-cell_clip, cell_clip]. If set to 0.0 then clipping is disabled.\n• 22:The clipping threshold ( $t_{proj}$) for the output from the projection layer, such that values are bound within [-proj_clip, proj_clip]. If set to 0.0 then clipping is disabled.\n• 23:Time-major if true, batch-major if false.\n• 24:The input layer normalization weights. Optional. A 1-D tensor of shape [num_units]. Used to rescale normalized inputs to activation at input gate.\n• 25:The forget layer normalization weights. Optional. A 1-D tensor of shape [num_units]. Used to rescale normalized inputs to activation at forget gate.\n• 26:The cell layer normalization weights. Optional. A 1-D tensor of shape [num_units]. Used to rescale normalized inputs to activation at cell gate.\n• 27:The output layer normalization weights. Optional. A 1-D tensor of shape [num_units]. Used to rescale normalized inputs to activation at output gate.\n\nOutputs:\n\n• 0: The output ( $o_t$). A 3-D tensor of shape: If time-major: [max_time, batch_size, output_size] If batch-major: [batch_size, max_time, output_size]\n• 1: A tensor of shape [batch_size, output_size] containing a hidden state from the last time step in the sequence. This output is optional and can be omitted. If this output is present then output #2 must be present as well. Available since API level 30.\n• 2: A tensor of shape [batch_size, cell_size] containing a cell state from the last time step in the sequence. This output is optional and can be omitted. Available since API level 30.\n\nAvailable since API level 29.\n\nImportant: As of API level 29, there is no way to get the output state tensors out and NNAPI does not maintain internal states. This operator does not support the usage pattern in which multiple cells are chained and state tensors are propagated.\n\nANEURALNETWORKS_UNIDIRECTIONAL_SEQUENCE_RNN\n\nA recurrent neural network layer that applies a basic RNN cell to a sequence of inputs.\n\nThis layer unrolls the input along the sequence dimension, and implements the following operation for each element in the sequence s = 1...sequence_length: outputs[s] = state = activation(inputs[s] * input_weights’ + state * recurrent_weights’ + bias)\n\nWhere:\n\n• “input_weights” is a weight matrix that multiplies the inputs;\n• “recurrent_weights” is a weight matrix that multiplies the current “state” which itself is the output from the previous time step computation;\n• “bias” is a bias vector (added to each output vector in the batch);\n• “activation” is the function passed as the “fused_activation_function” argument (if not “NONE”).\n\nSupported tensor OperandCode:\n\nThe input tensors must all be the same type.\n\nInputs:\n\n• 0: input. A 3-D tensor. The shape is defined by the input 6 (timeMajor). If it is set to 1, then the input has a shape [maxTime, batchSize, inputSize], otherwise the input has a shape [batchSize, maxTime, inputSize].\n• 1: weights. A 2-D tensor of shape [numUnits, inputSize].\n• 2: recurrent_weights. A 2-D tensor of shape [numUnits, numUnits].\n• 3: bias. A 1-D tensor of shape [numUnits].\n• 4: hidden state A 2-D tensor of shape [batchSize, numUnits]. Specifies a hidden state input for the first time step of the computation.\n• 5: fusedActivationFunction. A FuseCode value indicating the activation function. If “NONE” is specified then it results in a linear activation.\n• 6: timeMajor An ANEURALNETWORKS_INT32 scalar specifying the shape format of input and output tensors. Must be set to either 0 or 1. Outputs:\n• 0: output. A 3-D tensor. The shape is defined by the input 6 (timeMajor). If it is set to 1, then the output has a shape [maxTime, batchSize, numUnits], otherwise the output has a shape [batchSize, maxTime, numUnits].\n• 1: A tensor of shape [batchSize, numUnits] containing hidden state from the last time step in the sequence. This output is optional and can be omitted. Available since API level 30.\n\nAvailable since API level 29.\n\nImportant: As of API level 29, there is no way to get the output state tensors out and NNAPI does not maintain internal states. This operator does not support the usage pattern in which multiple cells are chained and state tensors are propagated.\n\nANEURALNETWORKS_WHILE\n\nExecutes the body model until the condition model outputs false.\n\nThe inputs to this operation are the condition model, the body model, and operand values for the first iteration of the loop. The values are implicitly split into three groups of input-output, state-only, and input-only values, as described below.\n\nThe outputs of this operation are the final values of input-output operands.\n\nBoth the condition and body model receive (m + k + n) inputs.\n\n• The first m (m >= 1) inputs are input-output operands. For the first iteration, these are initialized from the corresponding inputs of the WHILE operation. In subsequent iterations, their values come from the corresponding outputs of the body model produced during the previous iteration.\n• The next k (k >= 0) inputs are state-only operands. They are similar to the input-output operands, except that their values are no longer available after the loop terminates.\n• The last n (n >= 0) inputs are input-only operands. Their values come from the corresponding inputs of the WHILE operation.\n\nThe body model produces (m + k) outputs.\n\n• The first m outputs are input-output operands. They become the outputs of the WHILE operation when a termination condition is reached.\n• The last k outputs are state-only operands. Their values are no longer available after the loop terminates.\n\nThe numbers m, k, and n are inferred by the runtime as follows: m = (WHILE operation output count) k = (body model output count) - m n = (body model input count) - m - k\n\nThe pseudo-code below illustrates the flow of a WHILE operation with inputs condition, body, initial_input_output, initial_state, input_only (m = 1, k = 1, n = 1):\n\ninput_output = initial_input_output\nstate = initial_state\nwhile condition(input_output, state, input_only):\ninput_output, state = body(input_output, state, input_only)\nreturn input_output\n\n\nTo prevent infinite loops, there is an implicit execution timeout associated with each loop (\"loop timeout duration\"). See ANeuralNetworksExecution_setLoopTimeout.\n\nInputs:\n\n• 0: A ANEURALNETWORKS_MODEL reference to the condition model. The model must have (m + k + n) inputs with the same types as the corresponding inputs of the WHILE operation and exactly one output of ANEURALNETWORKS_TENSOR_BOOL8 and shape .\n• 1: A ANEURALNETWORKS_MODEL reference to the body model. The model must have (m + k + n) inputs and (m + k) outputs with the same types as the corresponding inputs and outputs of the WHILE operation.\n• (m inputs): Initial values for input-output operands.\n• (k inputs): Initial values for state-only operands.\n• (n inputs): Values for input-only operands.\n\nOutputs:\n\n• 0 ~ (m - 1): Outputs produced by the loop.\n\nAvailable since API level 30.\n\n PaddingCode\n\nAvailable since API level 27.\n\nProperties\nANEURALNETWORKS_PADDING_SAME\n\ntotal_padding is a function of input, stride, dilation and filter size. It could be computed as follows: out_size = (input + stride - 1) / stride effective_filter_size = (filter_size - 1) * dilation + 1 needed_input = (out_size - 1) * stride + effective_filter_size total_padding = max(0, needed_input - input_size) The computation is the same for the horizontal and vertical directions.\n\nANEURALNETWORKS_PADDING_VALID\n\nNo padding. When the input size is not evenly divisible by the filter size, the input at the end that could not fill the whole filter tile will simply be ignored.\n\n### PreferenceCode\n\n PreferenceCode\n\nExecution preferences.\n\nAvailable since API level 27.\n\nProperties\nANEURALNETWORKS_PREFER_FAST_SINGLE_ANSWER\n\nPrefer returning a single answer as fast as possible, even if this causes more power consumption.\n\nANEURALNETWORKS_PREFER_LOW_POWER\n\nPrefer executing in a way that minimizes battery drain.\n\nThis is desirable for compilations that will be executed often.\n\nANEURALNETWORKS_PREFER_SUSTAINED_SPEED\n\nPrefer maximizing the throughput of successive frames, for example when processing successive frames coming from the camera.\n\n### PriorityCode\n\n PriorityCode\n\nRelative execution priority.\n\nAvailable since API level 30.\n\nProperties\nANEURALNETWORKS_PRIORITY_DEFAULT\nANEURALNETWORKS_PRIORITY_HIGH\nANEURALNETWORKS_PRIORITY_LOW\nANEURALNETWORKS_PRIORITY_MEDIUM\n\n### ResultCode\n\n ResultCode\n\nResult codes.\n\nAny NNAPI function can return any result code, including result codes not currently documented. Any value other than ANEURALNETWORKS_NO_ERROR indicates a failure of some kind.\n\nAdditional information about the nature of a failure can be obtained from the device log after enabling NNAPI debugging by setting the debug.nn.vlog property to 1, e.g., by calling \"adb shell setprop debug.nn.vlog 1\".\n\nAvailable since API level 27.\n\nProperties\nANEURALNETWORKS_BAD_DATA\n\nFailure caused by invalid function arguments, invalid model definition, invalid execution definition or invalid data at execution time.\n\nANEURALNETWORKS_BAD_STATE\n\nFailure caused by object being in the wrong state.\n\nANEURALNETWORKS_DEAD_OBJECT\n\nFailure indicating an object is in a dead state.\n\nAvailable since API level 30.\n\nANEURALNETWORKS_INCOMPLETE\nANEURALNETWORKS_MISSED_DEADLINE_PERSISTENT\n\nFailure because a deadline could not be met for a task, and future deadlines will likely also not be met for the same task even after a short delay.\n\nAvailable since API level 30.\n\nANEURALNETWORKS_MISSED_DEADLINE_TRANSIENT\n\nFailure because a deadline could not be met for a task, but future deadlines may still be met for the same task after a short delay.\n\nAvailable since API level 30.\n\nANEURALNETWORKS_NO_ERROR\n\nOperation was succesful.\n\nANEURALNETWORKS_OP_FAILED\n\nFailure caused by failed model execution.\n\nANEURALNETWORKS_OUTPUT_INSUFFICIENT_SIZE\n\nFailure caused by insufficient buffer size provided to a model output.\n\nANEURALNETWORKS_OUT_OF_MEMORY\n\nFailure caused by not enough available memory.\n\nANEURALNETWORKS_RESOURCE_EXHAUSTED_PERSISTENT\n\nFailure because of a resource limitation within the driver, and future calls for the same task will likely also fail even after a short delay.\n\nAvailable since API level 30.\n\nANEURALNETWORKS_RESOURCE_EXHAUSTED_TRANSIENT\n\nFailure because of a resource limitation within the driver, but future calls for the same task may still succeed after a short delay.\n\nAvailable since API level 30.\n\nANEURALNETWORKS_UNAVAILABLE_DEVICE\n\nFailure caused by a device not being available.\n\nANEURALNETWORKS_UNEXPECTED_NULL\n\nFailure caused by unexpected null argument.\n\nANEURALNETWORKS_UNMAPPABLE\n\nFailure caused by not being able to map a file into memory.\n\nThis may be caused by a file descriptor not being mappable, or an AHardwareBuffer not supported by the device. Mitigate by reading its content into memory.\n\n## Typedefs\n\n### ANeuralNetworksBurst\n\nstruct ANeuralNetworksBurst ANeuralNetworksBurst\n\nANeuralNetworksBurst is an opaque type that can be used to reduce the latency of a rapid sequence of executions.\n\nIt will likely cause overhead if only used for a single execution.\n\nANeuralNetworksBurst serves as a context object for any number of inferences using ANeuralNetworksExecution objects. An ANeuralNetworksBurst object and the ANeuralNetworksExecution objects used with it must all have been created from the same ANeuralNetworksCompilation object.\n\nThis object is also used as a hint to drivers, providing insight to the lifetime of a rapid sequence of executions. For example, a driver may choose to increase the clock frequency of its accelerator for the lifetime of a burst object.\n\nTo use:\n\nAvailable since API level 29.\n\n### ANeuralNetworksCompilation\n\nstruct ANeuralNetworksCompilation ANeuralNetworksCompilation\n\nANeuralNetworksCompilation is an opaque type that can be used to compile a machine learning model.\n\nTo use:\n\nA compilation is completed by calling ANeuralNetworksCompilation_finish. A compilation is destroyed by calling ANeuralNetworksCompilation_free.\n\nA compilation cannot be modified once ANeuralNetworksCompilation_finish has been called on it.\n\nIt is the application's responsibility to make sure that only one thread modifies a compilation at a given time. It is however safe for more than one thread to use the compilation once ANeuralNetworksCompilation_finish has returned.\n\nIt is also the application's responsibility to ensure that there are no other uses of the compilation after calling ANeuralNetworksCompilation_free. This includes any execution object or burst object created using the compilation, or any memory descriptor with the compilation as part of one of the roles specified by ANeuralNetworksMemoryDesc_addInputRole or ANeuralNetworksMemoryDesc_addOutputRole.\n\nAvailable since API level 27.\n\n### ANeuralNetworksDevice\n\nstruct ANeuralNetworksDevice ANeuralNetworksDevice\n\nANeuralNetworksDevice is an opaque type that represents a device.\n\nThis type is used to query basic properties and supported operations of the corresponding device, and control which device(s) a model is to be run on.\n\nAvailable since API level 29.\n\n### ANeuralNetworksEvent\n\nstruct ANeuralNetworksEvent ANeuralNetworksEvent\n\nANeuralNetworksEvent is an opaque type that represents an event that will be signaled once an execution completes.\n\nAvailable since API level 27.\n\n### ANeuralNetworksExecution\n\nstruct ANeuralNetworksExecution ANeuralNetworksExecution\n\nANeuralNetworksExecution is an opaque type that can be used to apply a machine learning model to a set of inputs.\n\nTo use:\n\nAn output buffer or memory region must not overlap with any other output buffer or memory region, with an input buffer or memory region, or with an operand value in a memory object (ANeuralNetworksModel_setOperandValueFromMemory).\n\nAn execution cannot be modified once ANeuralNetworksExecution_burstCompute, ANeuralNetworksExecution_compute, ANeuralNetworksExecution_startCompute or ANeuralNetworksExecution_startComputeWithDependencies has been called on it.\n\nAn execution can be applied to a model with ANeuralNetworksExecution_burstCompute, ANeuralNetworksExecution_compute, ANeuralNetworksExecution_startCompute or ANeuralNetworksExecution_startComputeWithDependencies only once. Create new executions to do new evaluations of the model.\n\nIt is the application's responsibility to make sure that only one thread modifies an execution at a given time. It is however safe for more than one thread to use ANeuralNetworksEvent_wait at the same time.\n\nIt is also the application's responsibility to ensure that the execution either has never been scheduled or has completed (i.e., that ANeuralNetworksExecution_burstCompute, ANeuralNetworksExecution_compute, or ANeuralNetworksEvent_wait has returned) before calling ANeuralNetworksExecution_free.\n\n.\n\nIt is also the application's responsibility to ensure that there are no other uses of the execution after calling ANeuralNetworksExecution_free.\n\nMultiple executions can be scheduled and evaluated concurrently, either by means of ANeuralNetworksExecution_compute or ANeuralNetworksExecution_burstCompute (which are synchronous) in different threads, or by means of ANeuralNetworksExecution_startCompute or ANeuralNetworksExecution_startComputeWithDependencies (which are asynchronous). (Concurrent uses of ANeuralNetworksExecution_burstCompute must be on different burst objects.) The runtime makes no guarantee on the ordering of completion of executions. If it's important to the application, the application should enforce the ordering by ensuring that one execution completes before the next is scheduled (for example, by scheduling all executions synchronously within a single thread, or by scheduling all executions asynchronously and using ANeuralNetworksEvent_wait between calls to ANeuralNetworksExecution_startCompute); or by using ANeuralNetworksExecution_startComputeWithDependencies to make the execution wait for a list of events to be signaled before starting the actual evaluation.\n\nAvailable since API level 27.\n\n### ANeuralNetworksMemory\n\nstruct ANeuralNetworksMemory ANeuralNetworksMemory\n\nANeuralNetworksMemory is an opaque type that represents memory.\n\nThis type is used to represent shared memory, memory mapped files, and similar memories.\n\nBy using shared memory, a program can efficiently communicate to the runtime and drivers the tensors that define a model. See ANeuralNetworksModel_setOperandValueFromMemory. An application should typically create one shared memory object that contains every constant tensor needed to define a model. ANeuralNetworksMemory_createFromFd can be used to create shared memory from a file handle. ANeuralNetworksMemory_createFromAHardwareBuffer can be used to create shared memory from an AHardwareBuffer handle.\n\nMemory objects can also be used to specify the input and output arguments of an execution. See ANeuralNetworksExecution_setInputFromMemory and ANeuralNetworksExecution_setOutputFromMemory.\n\nWhen calling ANeuralNetworksModel_setOperandValueFromMemory, ANeuralNetworksExecution_setInputFromMemory and ANeuralNetworksExecution_setOutputFromMemory, each operand in the shared memory object must be aligned on a boundary of a byte size that is a multiple of the element type byte size, e.g., a tensor with ANEURALNETWORKS_TENSOR_FLOAT32 type must be aligned on 4-byte boundary.\n\nIt is the application's responsibility to ensure that there are no uses of the memory after calling ANeuralNetworksMemory_free. This includes any model which references this memory because of a call to ANeuralNetworksModel_setOperandValueFromMemory, any compilation created using such a model, any execution object or burst object created using such a compilation, or any execution which references this memory because of a call to ANeuralNetworksExecution_setInputFromMemory or ANeuralNetworksExecution_setOutputFromMemory.\n\nAvailable since API level 27.\n\nStarting at API level 30, the application may request creation of device native memory from ANeuralNetworksMemoryDesc to avoid potential memory copying and transformation overhead between executions. See also ANeuralNetworksMemoryDesc and ANeuralNetworksMemory_createFromDesc.\n\n### ANeuralNetworksMemoryDesc\n\nstruct ANeuralNetworksMemoryDesc ANeuralNetworksMemoryDesc\n\nANeuralNetworksMemoryDesc is an opaque type that represents a memory descriptor.\n\nA memory descriptor describes the properties of a memory object, and is used by ANeuralNetworksMemory_createFromDesc.\n\nTo use:\n\nA memory descriptor is completed by calling ANeuralNetworksMemoryDesc_finish. A memory descriptor is destroyed by calling ANeuralNetworksMemoryDesc_free.\n\nA memory descriptor must not be modified once ANeuralNetworksMemoryDesc_finish has been called on it.\n\nIt is the application's responsibility to make sure that only one thread modifies a memory descriptor at a given time. It is however safe for more than one thread to use the memory descriptor once ANeuralNetworksMemoryDesc_finish has returned.\n\nIt is also the application's responsibility to ensure that there are no other uses of the memory descriptor after calling ANeuralNetworksMemoryDesc_free. It is however safe to continue using a ANeuralNetworksMemory object created from the memory descriptor.\n\nAvailable since API level 30.\n\n### ANeuralNetworksModel\n\nstruct ANeuralNetworksModel ANeuralNetworksModel\n\nANeuralNetworksModel is an opaque type that contains a description of the mathematical operations that constitute the model.\n\nBuild the model by calling\n\nThis forms a graph in which each operation and operand is a node, a directed edge from an operand to an operation indicates that the operand is an input to the operation, and a directed edge from an operation to an operand indicates that the operand is an output from the operation. This graph must be acyclic.\n\nA model is completed by calling ANeuralNetworksModel_finish. A model is destroyed by calling ANeuralNetworksModel_free.\n\nA model cannot be modified once ANeuralNetworksModel_finish has been called on it.\n\nIt is the application's responsibility to make sure that only one thread modifies a model at a given time. It is however safe for more than one thread to use the model once ANeuralNetworksModel_finish has returned.\n\nIt is also the application's responsibility to ensure that there are no other uses of the model after calling ANeuralNetworksModel_free. This includes any compilation, execution object or burst object created using the model.\n\nAvailable since API level 27.\n\n### ANeuralNetworksOperandType\n\nstruct ANeuralNetworksOperandType ANeuralNetworksOperandType\n\nANeuralNetworksOperandType describes the type of an operand.\n\nThis structure is used to describe both scalars and tensors.\n\nA tensor operand type with all dimensions specified is \"fully specified\". Whenever possible (i.e., whenever the dimensions are known at model construction time), a tensor operand type should be (but is not required to be) fully specified, in order to enable the best possible performance.\n\nIf a tensor operand's type is not fully specified, the dimensions of the operand are deduced from the operand types and values of the operation for which that operand is an output.\n\nIn the following situations, a tensor operand type must be fully specified:\n\nA tensor operand type of specified rank but some number of unspecified dimensions is represented by setting dimensionCount to the rank and each unspecified dimension to 0.\n\nAvailable since API level 27.\n\nStarting at API level 29, a tensor operand type of unspecified rank is represented by setting dimensionCount to 0 and dimensions to NULL (just as if it were a scalar operand type).\n\n### ANeuralNetworksOperationType\n\nint32_t ANeuralNetworksOperationType\n\n### ANeuralNetworksSymmPerChannelQuantParams\n\nstruct ANeuralNetworksSymmPerChannelQuantParams ANeuralNetworksSymmPerChannelQuantParams\n\nParameters for ANEURALNETWORKS_TENSOR_QUANT8_SYMM_PER_CHANNEL operand.\n\n## Functions\n\n### ANeuralNetworksBurst_create\n\nint ANeuralNetworksBurst_create(\nANeuralNetworksCompilation *compilation,\nANeuralNetworksBurst **burst\n)\n\nCreate a ANeuralNetworksBurst to apply the given compilation.\n\nThis only creates the burst object. Computation is only performed once ANeuralNetworksExecution_burstCompute is invoked with a valid ANeuralNetworksExecution and ANeuralNetworksBurst.\n\nThe provided compilation must outlive the burst object.\n\nAvailable since API level 29.\n\nDetails\nParameters\n compilation The ANeuralNetworksCompilation to be evaluated. burst The newly created object or NULL if unsuccessful.\nReturns\nANEURALNETWORKS_NO_ERROR if successful, ANEURALNETWORKS_BAD_DATA if the compilation is invalid.\n\n### ANeuralNetworksBurst_free\n\nvoid ANeuralNetworksBurst_free(\nANeuralNetworksBurst *burst\n)\n\nDestroys the burst object.\n\nAvailable since API level 29.\n\nDetails\nParameters\n burst The burst object to be destroyed. Passing NULL is acceptable and results in no operation.\n\n### ANeuralNetworksCompilation_create\n\nint ANeuralNetworksCompilation_create(\nANeuralNetworksModel *model,\nANeuralNetworksCompilation **compilation\n)\n\nCreate a ANeuralNetworksCompilation to compile the given model.\n\nThe model passed to this function is termed the \"main model\" of the compilation, to distinguish it from other models referred to by an Operand of type ANEURALNETWORKS_MODEL within this compilation.\n\nThis function only creates the object. Compilation is only performed once ANeuralNetworksCompilation_finish is invoked.\n\nANeuralNetworksCompilation_finish should be called once all desired properties have been set on the compilation.\n\nANeuralNetworksModel_free should be called once the compilation is no longer needed.\n\nThe provided model must outlive the compilation.\n\nThe model must already have been finished by a call to ANeuralNetworksModel_finish.\n\nSee ANeuralNetworksCompilation for information on multithreaded usage.\n\nAvailable since API level 27.\n\nDetails\nParameters\n model The ANeuralNetworksModel to be compiled. compilation The newly created object or NULL if unsuccessful.\nReturns\nANEURALNETWORKS_NO_ERROR if successful, ANEURALNETWORKS_BAD_DATA if the model is invalid.\n\n### ANeuralNetworksCompilation_createForDevices\n\nint ANeuralNetworksCompilation_createForDevices(\nANeuralNetworksModel *model,\nconst ANeuralNetworksDevice *const *devices,\nuint32_t numDevices,\nANeuralNetworksCompilation **compilation\n)\n\nCreate a ANeuralNetworksCompilation to compile the given model for a specified set of devices.\n\nIf more than one device is specified, the compilation will distribute the workload automatically across the devices. The model must be fully supported by the specified set of devices. This means that ANeuralNetworksModel_getSupportedOperationsForDevices() must have returned true for every operation for that model/devices pair.\n\nThe user must handle all compilation and execution failures from the specified set of devices. This is in contrast to a use of ANeuralNetworksCompilation_create, where the runtime will attempt to recover from such failures.\n\nThe model passed to this function is termed the \"main model\" of the compilation, to distinguish it from other models referred to by an Operand of type ANEURALNETWORKS_MODEL within this compilation.\n\nAvailable since API level 29.\n\nDetails\nParameters\n model The ANeuralNetworksModel to be compiled. devices The set of devices. Must not contain duplicates. numDevices The number of devices in the set. compilation The newly created object or NULL if unsuccessful.\nReturns\nANEURALNETWORKS_NO_ERROR if successful, ANEURALNETWORKS_BAD_DATA if the model is invalid.\n\n### ANeuralNetworksCompilation_finish\n\nint ANeuralNetworksCompilation_finish(\nANeuralNetworksCompilation *compilation\n)\n\nIndicate that we have finished modifying a compilation.\n\nRequired before calling ANeuralNetworksBurst_create or ANeuralNetworksExecution_create.\n\nAn application must ensure that no other thread uses the compilation at the same time.\n\nThis function must only be called once for a given compilation.\n\nIf ANeuralNetworksCompilation_setTimeout was called on this compilation, and the compilation is not able to be finished before the timeout duration is exceeded, then compilation may be aborted, in which case ANEURALNETWORKS_MISSED_DEADLINE_* will be returned.\n\nSee ANeuralNetworksCompilation for information on multithreaded usage.\n\nAvailable since API level 27.\n\nDetails\nParameters\n compilation The compilation to be finished.\nReturns\nANEURALNETWORKS_NO_ERROR if successful.\n\n### ANeuralNetworksCompilation_free\n\nvoid ANeuralNetworksCompilation_free(\nANeuralNetworksCompilation *compilation\n)\n\nDestroy a compilation.\n\nThe compilation need not have been finished by a call to ANeuralNetworksCompilation_finish.\n\nSee ANeuralNetworksCompilation for information on multithreaded usage.\n\nAvailable since API level 27.\n\nDetails\nParameters\n compilation The compilation to be destroyed. Passing NULL is acceptable and results in no operation.\n\n### ANeuralNetworksCompilation_setCaching\n\nint ANeuralNetworksCompilation_setCaching(\nANeuralNetworksCompilation *compilation,\nconst char *cacheDir,\nconst uint8_t *token\n)\n\nSets the compilation caching signature and the cache directory.\n\nProvides optional caching information to the runtime for faster repeated compilation.\n\nSee ANeuralNetworksCompilation for information on multithreaded usage.\n\nAvailable since API level 29.\n\nDetails\nParameters\n compilation The compilation to be modified. cacheDir The cache directory for the runtime to store and retrieve caching data. It is recommended to use the code cache directory provided by the Android runtime. If not using the code cache directory, the user should choose a directory local to the application, and is responsible for managing the cache entries. token The token provided by the user to specify a model must be of length ANEURALNETWORKS_BYTE_SIZE_OF_CACHE_TOKEN. The user should ensure that the token is unique to a model within the application. The NNAPI runtime cannot detect token collisions; a collision will result in a failed execution or in a successful execution that produces incorrect output values.\nReturns\nANEURALNETWORKS_NO_ERROR if successful.\n\n### ANeuralNetworksCompilation_setPreference\n\nint ANeuralNetworksCompilation_setPreference(\nANeuralNetworksCompilation *compilation,\nint32_t preference\n)\n\nSets the execution preference.\n\nProvides guidance to the runtime when trade-offs are possible. By default the runtime uses PREFER_SINGLE_FAST_ANSWER\n\nSee ANeuralNetworksCompilation for information on multithreaded usage.\n\nAvailable since API level 27.\n\nDetails\nParameters\n compilation The compilation to be modified. preference\nReturns\nANEURALNETWORKS_NO_ERROR if successful.\n\n### ANeuralNetworksCompilation_setPriority\n\nint ANeuralNetworksCompilation_setPriority(\nANeuralNetworksCompilation *compilation,\nint priority\n)\n\nSet the execution priority.\n\nExecution priorities are relative to other executions created by the same application (specifically same uid) for the same device. Specifically, priorities of executions from one application will not affect executions from another application. Similarly, priorities of executions on one device will not affect executions on another device.\n\nHigher priority executions may use more compute resources than lower priority executions, and may preempt or starve lower priority executions.\n\nSee ANeuralNetworksCompilation for information on multithreaded usage.\n\nAvailable since API level 30.\n\nDetails\nParameters\n compilation The compilation to be modified. priority The relative priority of the execution compared to other executions created by the application. Must be one of ANEURALNETWORKS_PRIORITY_*.\nReturns\nANEURALNETWORKS_NO_ERROR if successful.\n\n### ANeuralNetworksCompilation_setTimeout\n\nint ANeuralNetworksCompilation_setTimeout(\nANeuralNetworksCompilation *compilation,\nuint64_t duration\n)\n\nSet the maximum expected duration for compiling the model.\n\nIf the device is not able to complete the compilation within the specified duration, the compilation may be aborted. The timeout duration begins at the call to ANeuralNetworksCompilation_finish.\n\nThis timeout duration acts as a hint to drivers, and can be used to both free up compute resources within the driver and return control back to the application quicker than is possible without the hint. It enables drivers that are able to estimate how long a compilation will take to abort the compilation before it has even started if the driver believes the compilation cannot be completed within the timeout duration. Similarly, it enables drivers to abort an ongoing compilation if it is taking too long. However, this call does not guarantee that the compilation will complete or abort within the timeout duration.\n\nBy default (i.e., unless ANeuralNetworksCompilation_setTimeout is called), the timeout duration for compiling the model is considered infinite.\n\nThe ANeuralNetworksCompilation must have been created with ANeuralNetworksCompilation_createForDevices with numDevices = 1, otherwise this function will fail with ANEURALNETWORKS_BAD_DATA. If the device has a feature level reported by ANeuralNetworksDevice_getFeatureLevel that is lower than 30, then the timeout duration hint will be ignored.\n\nSee ANeuralNetworksCompilation for information on multithreaded usage.\n\nAvailable since API level 30.\n\nDetails\nParameters\n compilation The compilation to be modified. duration The maximum amount of time in nanoseconds that is expected to be spent finishing a compilation. If this duration is exceeded, the compilation may be aborted. If set to 0, the timeout duration is considered infinite.\nReturns\nANEURALNETWORKS_NO_ERROR if successful.\n\n### ANeuralNetworksDevice_getFeatureLevel\n\nint ANeuralNetworksDevice_getFeatureLevel(\nconst ANeuralNetworksDevice *device,\nint64_t *featureLevel\n)\n\nGet the supported NNAPI version of the specified device.\n\nEach device has a supported feature level, which is the most advanced feature this driver implements. For example, if the driver implements the features introduced in Android P, but does not implement the features introduced after Android P, the value would be 28. Developers could decide whether or not the specified device should be used for a Model that has certain feature requirements.\n\nAvailable since API level 29.\n\nDetails\nParameters\n device The representation of the specified device. featureLevel The API level of the most advanced feature this driver implements.\nReturns\nANEURALNETWORKS_NO_ERROR if successful.\n\n### ANeuralNetworksDevice_getName\n\nint ANeuralNetworksDevice_getName(\nconst ANeuralNetworksDevice *device,\nconst char **name\n)\n\nGet the name of the specified device.\n\nAvailable since API level 29.\n\nDetails\nParameters\n device The representation of the specified device. name The returned name of the specified device. The name will be in UTF-8 and will be null-terminated. It will be recognizable as a known device name rather than a cryptic string. For devices with feature level reported by ANeuralNetworksDevice_getFeatureLevel that is 29 and above, the format of the name is {VENDOR}-{DEVICE}. For devices with feature level 28 or lower, the format of the name is undefined. The name will remain valid for the duration of the application.\nReturns\nANEURALNETWORKS_NO_ERROR if successful.\n\n### ANeuralNetworksDevice_getType\n\nint ANeuralNetworksDevice_getType(\nconst ANeuralNetworksDevice *device,\nint32_t *type\n)\n\nGet the type of a given device.\n\nThe device type can be used to help application developers to distribute Machine Learning workloads and other workloads such as graphical rendering. E.g., for an app which renders AR scenes based on real time object detection results, the developer could choose an ACCELERATOR type device for ML workloads, and reserve GPU for graphical rendering.\n\nAvailable since API level 29.\n\nDetails\nParameters\n device The representation of the specified device. type The returned DeviceTypeCode of the specified device.\nReturns\nANEURALNETWORKS_NO_ERROR if successful.\n\n### ANeuralNetworksDevice_getVersion\n\nint ANeuralNetworksDevice_getVersion(\nconst ANeuralNetworksDevice *device,\nconst char **version\n)\n\nGet the version of the driver implementation of the specified device.\n\nIt’s the responsibility of the driver implementor to insure that this version string uniquely distinguishes this implementation from all previous implementations.\n\nThis version string must not be confused with the feature level which is solely defined by ANeuralNetworksDevice_getFeatureLevel. There is no implicit ordering of the versions. For example, it is not possible to filter all drivers older than a certain version.\n\nApplication developers may use this version string to avoid or prefer specific driver implementations. For example, an application may want to do so because:\n\n• A specific version of the driver does not provide the required performance, perhaps because of a performance regression.\n• A specific version of the driver has a bug or returns results that don’t match the minimum precision requirement for the application.\n\nAvailable since API level 29.\n\nDetails\nParameters\n device The representation of the specified device. version The returned version string of the driver for the specified device. The string will be in UTF-8 and will be null-terminated. For devices with feature level 28 or lower, \"UNKNOWN\" will be returned. The version string will remain valid for the duration of the application.\nReturns\nANEURALNETWORKS_NO_ERROR if successful.\n\n### ANeuralNetworksDevice_wait\n\nint ANeuralNetworksDevice_wait(\nconst ANeuralNetworksDevice *device\n)\n\nWait until the device is in a live state.\n\nA device may encounter internal errors and temporarily enter a dead state. A call that uses a device in such a state will return with the error ANEURALNETWORKS_DEAD_OBJECT. ANeuralNetworksDevice_wait will block until the device is in a live state.\n\nAvailable since API level 30.\n\nDetails\nParameters\n device The representation of the specified device.\nReturns\nANEURALNETWORKS_NO_ERROR if successful.\n\n### ANeuralNetworksEvent_createFromSyncFenceFd\n\nint ANeuralNetworksEvent_createFromSyncFenceFd(\nint sync_fence_fd,\nANeuralNetworksEvent **event\n)\n\nCreate a ANeuralNetworksEvent from a sync_fence file descriptor.\n\nThe newly created ANeuralNetworksEvent does not take ownership of the provided sync_fence_fd, it will instead dup the provided sync_fence_fd and own the duplicate.\n\nAvailable since API level 30.\n\nDetails\nParameters\n sync_fence_fd The sync_fence file descriptor. event The newly created object or NULL if unsuccessful.\nReturns\nANEURALNETWORKS_NO_ERROR if successful.\n\n### ANeuralNetworksEvent_free\n\nvoid ANeuralNetworksEvent_free(\nANeuralNetworksEvent *event\n)\n\nDestroys the event.\n\nSee ANeuralNetworksExecution for information on multithreaded usage.\n\nAvailable since API level 27.\n\nDetails\nParameters\n event The event object to be destroyed. Passing NULL is acceptable and results in no operation.\n\n### ANeuralNetworksEvent_getSyncFenceFd\n\nint ANeuralNetworksEvent_getSyncFenceFd(\nconst ANeuralNetworksEvent *event,\nint *sync_fence_fd\n)\n\nGet sync_fence file descriptor from the event.\n\nIf the ANeuralNetworksEvent is not backed by a sync fence, the sync_fence_fd will be set to -1, and ANEURALNETWORKS_BAD_DATA will be returned.\n\nSee ANeuralNetworksEvent_createFromSyncFenceFd and ANeuralNetworksExecution_startComputeWithDependencies to see how to create an event backed by a sync fence.\n\nThe user takes ownership of the returned fd, and must close the returned file descriptor when it is no longer needed.\n\nAvailable since API level 30.\n\nDetails\nParameters\n event An event that is backed by a sync fence. sync_fence_fd The sync_fence file descriptor. The file descriptor will be set to -1 if there is an error.\nReturns\nANEURALNETWORKS_NO_ERROR if successful.\n\n### ANeuralNetworksEvent_wait\n\nint ANeuralNetworksEvent_wait(\nANeuralNetworksEvent *event\n)\n\nWaits until the execution completes.\n\nMore than one thread can wait on an event. When the execution completes, all threads will be released.\n\nIf ANeuralNetworksExecution_setTimeout was called on the execution corresponding to this event, and the execution is not able to complete before the duration is exceeded, the execution may be aborted, in which case ANEURALNETWORKS_MISSED_DEADLINE_* will be returned here.\n\nIf the execution contains a ANEURALNETWORKS_WHILE operation, and the condition model does not output false within the loop timeout duration, the execution will be aborted, and ANEURALNETWORKS_MISSED_DEADLINE_* will be returned here.\n\nSee ANeuralNetworksExecution for information on multithreaded usage.\n\nAvailable since API level 27.\n\nDetails\nParameters\n event The event that will be signaled on completion.\nReturns\nANEURALNETWORKS_NO_ERROR if the execution completed normally. ANEURALNETWORKS_UNMAPPABLE if the execution input or output memory cannot be properly mapped.\n\n### ANeuralNetworksExecution_burstCompute\n\nint ANeuralNetworksExecution_burstCompute(\nANeuralNetworksExecution *execution,\nANeuralNetworksBurst *burst\n)\n\nSchedule synchronous evaluation of the execution on a burst object.\n\nSchedules synchronous evaluation of the execution. Returns once the execution has completed and the outputs are ready to be consumed.\n\nIf ANeuralNetworksExecution_setTimeout was called on the execution, and the execution is not able to complete before the timeout duration is exceeded, then execution may be aborted, in which case ANEURALNETWORKS_MISSED_DEADLINE_* will be returned.\n\nIf the execution contains a ANEURALNETWORKS_WHILE operation, and the condition model does not output false within the loop timeout duration, then execution will be aborted and ANEURALNETWORKS_MISSED_DEADLINE_* will be returned. If the device has a feature level reported by ANeuralNetworksDevice_getFeatureLevel that is lower than 30, then the timeout duration hint will be ignored.\n\nThere must be at most one ANeuralNetworksExecution processing at any given time for any given burst object. Any ANeuralNetworksExecution launched before the previous has finished will result in ANEURALNETWORKS_BAD_STATE.\n\nSee ANeuralNetworksExecution_compute for synchronous execution. See ANeuralNetworksExecution_startCompute for regular asynchronous execution. See ANeuralNetworksExecution_startComputeWithDependencies for asynchronous execution with dependencies.\n\nAvailable since API level 29.\n\nDetails\nParameters\n burst The burst object to execute on. execution The execution to be scheduled and executed. The execution must be created from the same ANeuralNetworksCompilation as the burst object.\nReturns\nANEURALNETWORKS_NO_ERROR if the execution completed normally.\n\n### ANeuralNetworksExecution_compute\n\nint ANeuralNetworksExecution_compute(\nANeuralNetworksExecution *execution\n)\n\nSchedule synchronous evaluation of the execution.\n\nSchedules synchronous evaluation of the execution. Returns once the execution has completed and the outputs are ready to be consumed.\n\nIf ANeuralNetworksExecution_setTimeout was called on this execution, and the execution is not able to complete before the timeout duration is exceeded, then execution may be aborted, in which case ANEURALNETWORKS_MISSED_DEADLINE_* will be returned. If the device has a feature level reported by ANeuralNetworksDevice_getFeatureLevel that is lower than 30, then the timeout duration hint will be ignored.\n\nIf this execution contains a ANEURALNETWORKS_WHILE operation, and the condition model does not output false within the loop timeout duration, then execution will be aborted and ANEURALNETWORKS_MISSED_DEADLINE_* will be returned.\n\nSee ANeuralNetworksExecution for information on multithreaded usage.\n\nSee ANeuralNetworksExecution_burstCompute for burst synchronous execution. See ANeuralNetworksExecution_startCompute for regular asynchronous execution. See ANeuralNetworksExecution_startComputeWithDependencies for asynchronous execution with dependencies.\n\nAvailable since API level 29.\n\nDetails\nParameters\n execution The execution to be scheduled and executed.\nReturns\nANEURALNETWORKS_NO_ERROR if the execution completed normally. ANEURALNETWORKS_UNMAPPABLE if the execution input or output memory cannot be properly mapped.\n\n### ANeuralNetworksExecution_create\n\nint ANeuralNetworksExecution_create(\nANeuralNetworksCompilation *compilation,\nANeuralNetworksExecution **execution\n)\n\nCreate a ANeuralNetworksExecution to apply the given compilation.\n\nThis only creates the object. Computation is only performed once ANeuralNetworksExecution_burstCompute, ANeuralNetworksExecution_compute, ANeuralNetworksExecution_startCompute or ANeuralNetworksExecution_startComputeWithDependencies is invoked.\n\nThe provided compilation must outlive the execution.\n\nSee ANeuralNetworksExecution for information on multithreaded usage.\n\nAvailable since API level 27.\n\nDetails\nParameters\n compilation The ANeuralNetworksCompilation to be evaluated. execution The newly created object or NULL if unsuccessful.\nReturns\nANEURALNETWORKS_NO_ERROR if successful, ANEURALNETWORKS_BAD_DATA if the compilation is invalid.\n\n### ANeuralNetworksExecution_free\n\nvoid ANeuralNetworksExecution_free(\nANeuralNetworksExecution *execution\n)\n\nDestroy an execution.\n\nThe execution need not have been scheduled by a call to ANeuralNetworksExecution_burstCompute, ANeuralNetworksExecution_compute, ANeuralNetworksExecution_startCompute or ANeuralNetworksExecution_startComputeWithDependencies; but if it has been scheduled, then the application must not call ANeuralNetworksExecution_free until the execution has completed (i.e., ANeuralNetworksExecution_burstCompute, ANeuralNetworksExecution_compute, or ANeuralNetworksEvent_wait has returned).\n\nSee ANeuralNetworksExecution for information on multithreaded usage.\n\nAvailable since API level 27.\n\nDetails\nParameters\n execution The execution to be destroyed. Passing NULL is acceptable and results in no operation.\n\n### ANeuralNetworksExecution_getDuration\n\nint ANeuralNetworksExecution_getDuration(\nconst ANeuralNetworksExecution *execution,\nint32_t durationCode,\nuint64_t *duration\n)\n\nGet the time spent in the specified ANeuralNetworksExecution, in nanoseconds.\n\nThe execution must have completed. On asynchronous execution initiated by ANeuralNetworksExecution_startCompute or ANeuralNetworksExecution_startComputeWithDependencies, ANeuralNetworksEvent_wait must be called prior to this function.\n\nAvailable since API level 29.\n\nDetails\nParameters\n execution The execution to be queried. durationCode The measurement to be queried, specified by DurationCode. duration The returned duration. If no measurement was requested by ANeuralNetworksExecution_setMeasureTiming, if the device is has a feature level reported by ANeuralNetworksDevice_getFeatureLevel that is lower than 29, or for some other reason the duration is not available, UINT64_MAX will be returned. A particular device need not support any given measurement.\nReturns\nANEURALNETWORKS_NO_ERROR if successful.\n\n### ANeuralNetworksExecution_getOutputOperandDimensions\n\nint ANeuralNetworksExecution_getOutputOperandDimensions(\nANeuralNetworksExecution *execution,\nint32_t index,\nuint32_t *dimensions\n)\n\nGet the dimensional information of the specified output operand of the model of the ANeuralNetworksExecution.\n\nThe target output operand cannot be a scalar.\n\nThe execution must have completed. On asynchronous execution initiated by ANeuralNetworksExecution_startCompute or ANeuralNetworksExecution_startComputeWithDependencies, ANeuralNetworksEvent_wait must be called prior to this function.\n\nAvailable since API level 29.\n\nDetails\nParameters\n execution The execution to be queried. index The index of the output argument we are querying. It is an index into the lists passed to ANeuralNetworksModel_identifyInputsAndOutputs. It is not the index associated with ANeuralNetworksModel_addOperand. dimensions The dimension array to be filled. The size of the array must be exactly as large as the rank of the output operand to be queried in the model.\nReturns\nANEURALNETWORKS_NO_ERROR if successful, ANEURALNETWORKS_OUTPUT_INSUFFICIENT_SIZE if the target output is provided an insufficient buffer at execution time, ANEURALNETWORKS_BAD_DATA if the index is invalid or if the target is a scalar.\n\n### ANeuralNetworksExecution_getOutputOperandRank\n\nint ANeuralNetworksExecution_getOutputOperandRank(\nANeuralNetworksExecution *execution,\nint32_t index,\nuint32_t *rank\n)\n\nGet the dimensional information of the specified output operand of the model of the ANeuralNetworksExecution.\n\nThe execution must have completed. On asynchronous execution initiated by ANeuralNetworksExecution_startCompute or ANeuralNetworksExecution_startComputeWithDependencies, ANeuralNetworksEvent_wait must be called prior to this function.\n\nAvailable since API level 29.\n\nDetails\nParameters\n execution The execution to be queried. index The index of the output argument we are querying. It is an index into the lists passed to ANeuralNetworksModel_identifyInputsAndOutputs. It is not the index associated with ANeuralNetworksModel_addOperand. rank The rank of the output operand.\nReturns\nANEURALNETWORKS_NO_ERROR if successful, ANEURALNETWORKS_OUTPUT_INSUFFICIENT_SIZE if the target output is provided an insufficient buffer at execution time, ANEURALNETWORKS_BAD_DATA if the index is invalid.\n\n### ANeuralNetworksExecution_setInput\n\nint ANeuralNetworksExecution_setInput(\nANeuralNetworksExecution *execution,\nint32_t index,\nconst ANeuralNetworksOperandType *type,\nconst void *buffer,\nsize_t length\n)\n\nAssociate a user buffer with an input of the model of the ANeuralNetworksExecution.\n\nEvaluation of the execution must not have been scheduled. Once evaluation of the execution has been scheduled, the application must not change the content of the buffer until the execution has completed. Evaluation of the execution will not change the content of the buffer.\n\nThe provided buffer must outlive the execution.\n\nIf the input is optional, you can indicate that it is omitted by passing nullptr for buffer and 0 for length.\n\nSee ANeuralNetworksExecution for information on multithreaded usage.\n\nAvailable since API level 27.\n\nDetails\nParameters\n execution The execution to be modified. index The index of the input argument we are setting. It is an index into the lists passed to ANeuralNetworksModel_identifyInputsAndOutputs. It is not the index associated with ANeuralNetworksModel_addOperand. type The ANeuralNetworksOperandType of the operand. Unless the input is omitted, this should be used to specify the dimensions that were left unspecified when the operand was added to the model. All other properties of the type must be the same as specified in the model. If the type is the same as specified when the model was built, NULL can be passed. Neither the ANeuralNetworksOperandType nor the dimensions it points to need to outlive the call to ANeuralNetworksExecution_setInput. buffer The buffer containing the data. length The length in bytes of the buffer.\nReturns\nANEURALNETWORKS_NO_ERROR if successful, ANEURALNETWORKS_BAD_DATA if the name is not recognized or the buffer is too small for the input.\n\n### ANeuralNetworksExecution_setInputFromMemory\n\nint ANeuralNetworksExecution_setInputFromMemory(\nANeuralNetworksExecution *execution,\nint32_t index,\nconst ANeuralNetworksOperandType *type,\nconst ANeuralNetworksMemory *memory,\nsize_t offset,\nsize_t length\n)\n\nAssociate a region of a memory object with an input of the model of the ANeuralNetworksExecution.\n\nEvaluation of the execution must not have been scheduled. Once evaluation of the execution has been scheduled, the application must not change the content of the region until the execution has completed. Evaluation of the execution will not change the content of the region.\n\nThe provided memory must outlive the execution.\n\nIf the input is optional, you can indicate that it is omitted by using ANeuralNetworksExecution_setInput instead, passing nullptr for buffer and 0 for length.\n\nSee ANeuralNetworksExecution for information on multithreaded usage. See ANeuralNetworksMemory_createFromAHardwareBuffer for information on AHardwareBuffer usage. See ANeuralNetworksMemory_createFromDesc for information on usage of memory objects created from memory descriptors.\n\nAvailable since API level 27.\n\nDetails\nParameters\n execution The execution to be modified. index The index of the input argument we are setting. It is an index into the lists passed to ANeuralNetworksModel_identifyInputsAndOutputs. It is not the index associated with ANeuralNetworksModel_addOperand. type The ANeuralNetworksOperandType of the operand. This should be used to specify the dimensions that were left unspecified when the operand was added to the model. All other properties of the type must be the same as specified in the model. If the type is the same as specified when the model was built, NULL can be passed. Neither the ANeuralNetworksOperandType nor the dimensions it points to need to outlive the call to ANeuralNetworksExecution_setInputFromMemory. memory The memory containing the data. offset This specifies the location of the data within the memory. The offset is in bytes from the start of memory. length The size in bytes of the data value.\nReturns\nANEURALNETWORKS_NO_ERROR if successful, ANEURALNETWORKS_BAD_DATA if the name is not recognized or the buffer is too small for the input.\n\n### ANeuralNetworksExecution_setLoopTimeout\n\nint ANeuralNetworksExecution_setLoopTimeout(\nANeuralNetworksExecution *execution,\nuint64_t duration\n)\n\nSet the maximum duration of WHILE loops in the specified execution.\n\nThis is a fuzzy per-loop timeout intended to prevent infinite loops.\n\nIf a WHILE loop condition model does not output false within the specified duration, the execution will be aborted.\n\nSee ANeuralNetworks_getDefaultLoopTimeout and ANeuralNetworks_getMaximumLoopTimeout for the default and maximum timeout values.\n\nSee ANeuralNetworksExecution for information on multithreaded usage.\n\nAvailable since API level 30.\n\nDetails\nParameters\n execution The execution to be modified. duration The maximum amount of time in nanoseconds that can be spent executing a WHILE loop. If the specified duration value exceeds the value produced by ANeuralNetworks_getMaximumLoopTimeout, it will be overridden by that value.\nReturns\nANEURALNETWORKS_NO_ERROR if successful. ANEURALNETWORKS_BAD_STATE if execution has started. ANEURALNETWORKS_UNEXPECTED_NULL if execution is NULL.\n\n### ANeuralNetworksExecution_setMeasureTiming\n\nint ANeuralNetworksExecution_setMeasureTiming(\nANeuralNetworksExecution *execution,\nbool measure\n)\n\nSpecifies whether duration of the ANeuralNetworksExecution is to be measured.\n\nEvaluation of the execution must not have been scheduled.\n\nBy default, duration is not measured.\n\nThe ANeuralNetworksExecution must have been created from an ANeuralNetworksCompilation which in turn was created from ANeuralNetworksCompilation_createForDevices with numDevices = 1. If the device has a feature level reported by ANeuralNetworksDevice_getFeatureLevel that is lower than 29, then the duration will not be measured.\n\nSee ANeuralNetworksExecution for information on multithreaded usage.\n\nAvailable since API level 29.\n\nDetails\nParameters\n execution The execution to be modified. measure 'true' if duration is to be measured, 'false' if not.\nReturns\nANEURALNETWORKS_NO_ERROR if successful.\n\n### ANeuralNetworksExecution_setOutput\n\nint ANeuralNetworksExecution_setOutput(\nANeuralNetworksExecution *execution,\nint32_t index,\nconst ANeuralNetworksOperandType *type,\nvoid *buffer,\nsize_t length\n)\n\nAssociate a user buffer with an output of the model of the ANeuralNetworksExecution.\n\nEvaluation of the execution must not have been scheduled. Once evaluation of the execution has been scheduled, the application must not change the content of the buffer until the execution has completed.\n\nIf the output is optional, you can indicate that it is omitted by passing nullptr for buffer and 0 for length.\n\nThe provided buffer must outlive the execution.\n\nSee ANeuralNetworksExecution for information on multithreaded usage.\n\nAvailable since API level 27.\n\nDetails\nParameters\n execution The execution to be modified. index The index of the output argument we are setting. It is an index into the lists passed to ANeuralNetworksModel_identifyInputsAndOutputs. It is not the index associated with ANeuralNetworksModel_addOperand. type The ANeuralNetworksOperandType of the operand. Unless the output is omitted, this should be used to specify the dimensions that were left unspecified when the operand was added to the model. All other properties of the type must be the same as specified in the model. If the type is the same as specified when the model was built, NULL can be passed. Neither the ANeuralNetworksOperandType nor the dimensions it points to need to outlive the call to ANeuralNetworksExecution_setOutput. Since API level 29, the output operand can have unspecified dimensions or rank to be deduced dynamically during the execution. However, the user must provide a large enough buffer. The user can retrieve the output dimensional information after the execution by ANeuralNetworksExecution_getOutputOperandRank and ANeuralNetworksExecution_getOutputOperandDimensions. buffer The buffer where the data is to be written. length The length in bytes of the buffer.\nReturns\nANEURALNETWORKS_NO_ERROR if successful, ANEURALNETWORKS_BAD_DATA if the name is not recognized or the buffer is too small for the output.\n\n### ANeuralNetworksExecution_setOutputFromMemory\n\nint ANeuralNetworksExecution_setOutputFromMemory(\nANeuralNetworksExecution *execution,\nint32_t index,\nconst ANeuralNetworksOperandType *type,\nconst ANeuralNetworksMemory *memory,\nsize_t offset,\nsize_t length\n)\n\nAssociate a region of a memory object with an output of the model of the ANeuralNetworksExecution.\n\nEvaluation of the execution must not have been scheduled. Once evaluation of the execution has been scheduled, the application must not change the content of the region until the execution has completed.\n\nIf the output is optional, you can indicate that it is omitted by using ANeuralNetworksExecution_setOutput instead, passing nullptr for buffer and 0 for length.\n\nThe provided memory must outlive the execution.\n\nSee ANeuralNetworksExecution for information on multithreaded usage. See ANeuralNetworksMemory_createFromAHardwareBuffer for information on AHardwareBuffer usage. See ANeuralNetworksMemory_createFromDesc for information on usage of memory objects created from memory descriptors.\n\nAvailable since API level 27.\n\nDetails\nParameters\n execution The execution to be modified. index The index of the output argument we are setting. It is an index into the lists passed to ANeuralNetworksModel_identifyInputsAndOutputs. It is not the index associated with ANeuralNetworksModel_addOperand. type The ANeuralNetworksOperandType of the operand. This should be used to specify the dimensions that were left unspecified when the operand was added to the model. All other properties of the type must be the same as specified in the model. If the type is the same as specified when the model was built, NULL can be passed. Neither the ANeuralNetworksOperandType nor the dimensions it points to need to outlive the call to ANeuralNetworksExecution_setOutputFromMemory. Since API level 29, the output operand can have unspecified dimensions or rank to be deduced dynamically during the execution. However, the user must provide a large enough memory. The user can retrieve the output dimensional information after the execution by ANeuralNetworksExecution_getOutputOperandRank and ANeuralNetworksExecution_getOutputOperandDimensions. memory The memory where the data is to be stored. offset This specifies the location of the data within the memory. The offset is in bytes from the start of memory. length The length in bytes of the data value.\nReturns\nANEURALNETWORKS_NO_ERROR if successful, ANEURALNETWORKS_BAD_DATA if the name is not recognized or the buffer is too small for the output.\n\n### ANeuralNetworksExecution_setTimeout\n\nint ANeuralNetworksExecution_setTimeout(\nANeuralNetworksExecution *execution,\nuint64_t duration\n)\n\nSet the maximum expected duration of the specified execution.\n\nIf the device is not able to complete the execution within the specified duration, the execution may be aborted. The timeout duration begins at a call to one of:\n\nThis timeout duration acts as a hint to drivers, and can be used to both free up compute resources within the driver and return control back to the application quicker than is possible without the hint. It enables drivers that are able to estimate how long an execution will take to abort the execution before it has even started if the driver believes the execution cannot be completed within the timeout duration. Similarly, it enables drivers to abort an ongoing execution if it is taking too long. However, this call does not guarantee that the execution will complete or abort within the timeout duration.\n\nBy default (i.e., unless ANeuralNetworksExecution_setTimeout is called), the timeout duration for execution is considered infinite.\n\nThe ANeuralNetworksExecution must have been created from an ANeuralNetworksCompilation which in turn was created from ANeuralNetworksCompilation_createForDevices with numDevices = 1, otherwise this function will fail with ANEURALNETWORKS_BAD_DATA. If the device has a feature level reported by ANeuralNetworksDevice_getFeatureLevel that is lower than 30, then the timeout duration hint will be ignored.\n\nSee ANeuralNetworksExecution for information on multithreaded usage.\n\nAvailable since API level 30.\n\nDetails\nParameters\n execution The execution to be modified. duration The maximum amount of time in nanoseconds that is expected to be spent executing a model. If this duration is exceeded, the execution may be aborted. If set to 0, the timeout duration is considered infinite.\nReturns\nANEURALNETWORKS_NO_ERROR if successful.\n\n### ANeuralNetworksExecution_startCompute\n\nint ANeuralNetworksExecution_startCompute(\nANeuralNetworksExecution *execution,\nANeuralNetworksEvent **event\n)\n\nSchedule asynchronous evaluation of the execution.\n\nSchedules asynchronous evaluation of the execution. Once the execution has completed and the outputs are ready to be consumed, the returned event will be signaled. Use ANeuralNetworksEvent_wait to wait for that event.\n\nANeuralNetworksEvent_wait must be called to recuperate the resources used by the execution.\n\nIf ANeuralNetworksExecution_setTimeout was called on this execution, and the execution is not able to complete before the timeout duration is exceeded, then execution may be aborted, in which case ANEURALNETWORKS_MISSED_DEADLINE_* will be returned through ANeuralNetworksExecution_startCompute or ANeuralNetworksEvent_wait on the event object. If the device has a feature level reported by ANeuralNetworksDevice_getFeatureLevel that is lower than 30, then the timeout duration hint will be ignored.\n\nIf this execution contains a ANEURALNETWORKS_WHILE operation, and the condition model does not output false within the loop timeout duration, then execution will be aborted and ANEURALNETWORKS_MISSED_DEADLINE_* will be returned through ANeuralNetworksEvent_wait on the event object.\n\nIf the device can detect before the execution has started that the execution will not complete within the timeout duration, the device may choose to skip the execution and instead return ANEURALNETWORKS_MISSED_DEADLINE_*.\n\nSee ANeuralNetworksExecution for information on multithreaded usage.\n\nSee ANeuralNetworksExecution_compute for synchronous execution. See ANeuralNetworksExecution_burstCompute for burst synchronous execution. See ANeuralNetworksExecution_startComputeWithDependencies for asynchronous execution with dependencies.\n\nAvailable since API level 27.\n\nDetails\nParameters\n execution The execution to be scheduled and executed. event The event that will be signaled on completion. event is set to NULL if there's an error.\nReturns\nANEURALNETWORKS_NO_ERROR if the evaluation is successfully scheduled.\n\n### ANeuralNetworksExecution_startComputeWithDependencies\n\nint ANeuralNetworksExecution_startComputeWithDependencies(\nANeuralNetworksExecution *execution,\nconst ANeuralNetworksEvent *const *dependencies,\nuint32_t num_dependencies,\nuint64_t duration,\nANeuralNetworksEvent **event\n)\n\nSchedule asynchronous evaluation of the execution with dependencies.\n\nThe execution will wait for all the depending events to be signaled before starting the evaluation. Once the execution has completed and the outputs are ready to be consumed, the returned event will be signaled. Depending on which devices are handling the execution, the event could be backed by a sync fence. Use ANeuralNetworksEvent_wait to wait for that event.\n\nANeuralNetworksEvent_wait must be called to recurperate the resources used by the execution.\n\nIf parts of the execution are scheduled on devices that do not support fenced execution, the function call may wait for such parts to finish before returning.\n\nThe function will return an error if any of the events in dependencies is already in a bad state. After the execution is scheduled, if any of the events in dependencies does not complete normally, the execution will fail, and ANeuralNetworksEvent_wait on the returned event will return an error.\n\nThe function will return an error if any of the execution outputs has a tensor operand type that is not fully specified.\n\nThe function can be passed a timeout duration in nanoseconds. This timeout duration acts as a hint to drivers in the same way that the timeout durations in ANeuralNetworksCompilation_setTimeout and ANeuralNetworksExecution_setTimeout act as hints to drivers. The duration begins when all waitFor sync fences have been signaled, and can be used together with ANeuralNetworksExecution_setTimeout which specifies the maximum timeout duration beginning at the call to ANeuralNetworksExecution_startComputeWithDependencies. If the duration is non-zero, the ANeuralNetworksExecution must have been created from an ANeuralNetworksCompilation which in turn was created from ANeuralNetworksCompilation_createForDevices with numDevices = 1, otherwise this function will fail with ANEURALNETWORKS_BAD_DATA. If either the timeout duration from ANeuralNetworksExecution_setTimeout or the timeout duration passed to this call is exceeded, the execution may be aborted, in which case ANEURALNETWORKS_MISSED_DEADLINE_* will be returned through ANeuralNetworksExecution_startComputeWithDependencies or ANeuralNetworksEvent_wait on the event object. If the device has a feature level reported by ANeuralNetworksDevice_getFeatureLevel that is lower than 30, then the timeout duration hints will be ignored.\n\nIf this execution contains a ANEURALNETWORKS_WHILE operation, and the condition model does not output false within the loop timeout duration, then execution will be aborted and ANEURALNETWORKS_MISSED_DEADLINE_* will be returned through ANeuralNetworksEvent_wait on the event object.\n\nSee ANeuralNetworksExecution for information on multithreaded usage.\n\nSee ANeuralNetworksExecution_compute for synchronous execution. See ANeuralNetworksExecution_burstCompute for burst synchronous execution. See ANeuralNetworksExecution_startCompute for regular asynchronous execution.\n\nAvailable since API level 30.\n\nDetails\nParameters\n execution The execution to be scheduled and executed. dependencies A set of depending events. The actual evaluation will not start until all the events are signaled. num_dependencies The number of events in the dependencies set. duration The maximum amount of time in nanoseconds that is expected to be spent executing the model after all dependencies are signaled. If set to 0, the timeout duration is considered infinite. event The event that will be signaled on completion. event is set to NULL if there's an error.\nReturns\nANEURALNETWORKS_NO_ERROR if the evaluation is successfully scheduled.\n\nint ANeuralNetworksMemoryDesc_addInputRole(\nANeuralNetworksMemoryDesc *desc,\nconst ANeuralNetworksCompilation *compilation,\nuint32_t index,\nfloat frequency\n)\n\nSpecify that a memory object will be playing the role of an input to an execution created from a particular compilation.\n\nThe compilation and the input index fully specify an input operand. This function may be invoked multiple times on the same memory descriptor with different input operands, and the same input operand may be specified on multiple memory descriptors. However, specifying the same input operand on the same memory descriptor more than once will return an error.\n\nThe dimensions of the corresponding model operands of all the roles specified by ANeuralNetworksMemoryDesc_addInputRole and ANeuralNetworksMemoryDesc_addOutputRole must be compatible with each other. Two dimensions are incompatible if both ranks are fully specified but have different values, or if there is at least one axis that is fully specified in both but has different values.\n\nAt least one of ANeuralNetworksMemoryDesc_addInputRole and ANeuralNetworksMemoryDesc_addOutputRole must be called on a memory descriptor before invoking ANeuralNetworksMemoryDesc_finish.\n\nAttempting to modify a memory descriptor once ANeuralNetworksMemoryDesc_finish has been called will return an error.\n\nSee ANeuralNetworksMemoryDesc for information on multithreaded usage.\n\nAvailable since API level 30.\n\nDetails\nParameters\n desc The memory descriptor to be modified. compilation The compilation object. It must already have been finished by calling ANeuralNetworksCompilation_finish, and must outlive the memory descriptor. index The index of the input argument we are referencing from the compilation. It is an index into the inputs list passed to ANeuralNetworksModel_identifyInputsAndOutputs. It is not the index associated with ANeuralNetworksModel_addOperand. frequency A floating-point value within the range (0.0, 1.0]. Describes how likely the memory is to be used in the specified role. This is provided as a hint to optimize the case when different roles prefer different memory locations or data layouts.\nReturns\nANEURALNETWORKS_NO_ERROR if successful.\n\nint ANeuralNetworksMemoryDesc_addOutputRole(\nANeuralNetworksMemoryDesc *desc,\nconst ANeuralNetworksCompilation *compilation,\nuint32_t index,\nfloat frequency\n)\n\nSpecify that a memory object will be playing the role of an output to an execution created from a particular compilation.\n\nThe compilation and the output index fully specify an output operand. This function may be invoked multiple times on the same memory descriptor with different output operands, and the same output operand may be specified on multiple memory descriptors. However, specifying the same output operand on the same memory descriptor object more than once will return an error.\n\nThe dimensions of the corresponding model operands of all the roles specified by ANeuralNetworksMemoryDesc_addInputRole and ANeuralNetworksMemoryDesc_addOutputRole must be compatible with each other. Two dimensions are incompatible if both ranks are fully specified but have different values, or if there is at least one axis that is fully specified in both but has different values.\n\nAt least one of ANeuralNetworksMemoryDesc_addInputRole and ANeuralNetworksMemoryDesc_addOutputRole must be called on the memory descriptor before invoking ANeuralNetworksMemoryDesc_finish.\n\nAttempting to modify a memory descriptor once ANeuralNetworksMemoryDesc_finish has been called will return an error.\n\nSee ANeuralNetworksMemoryDesc for information on multithreaded usage.\n\nAvailable since API level 30.\n\nDetails\nParameters\n desc The memory descriptor to be modified. compilation The compilation object. It must already have been finished by calling ANeuralNetworksCompilation_finish, and must outlive the memory descriptor. index The index of the output argument we are referencing from the compilation. It is an index into the outputs list passed to ANeuralNetworksModel_identifyInputsAndOutputs. It is not the index associated with ANeuralNetworksModel_addOperand. frequency A floating-point value within the range (0.0, 1.0]. Describes how likely the memory is to be used in the specified role. This is provided as a hint to optimize the case when multiple roles prefer different memory locations or data layouts.\nReturns\nANEURALNETWORKS_NO_ERROR if successful.\n\n### ANeuralNetworksMemoryDesc_create\n\nint ANeuralNetworksMemoryDesc_create(\nANeuralNetworksMemoryDesc **desc\n)\n\nCreate a ANeuralNetworksMemoryDesc with no properties.\n\nThis only creates the memory descriptor. Its properties should be set with calls to ANeuralNetworksMemoryDesc_addInputRole, ANeuralNetworksMemoryDesc_addOutputRole, and ANeuralNetworksMemoryDesc_setDimensions.\n\nANeuralNetworksMemoryDesc_finish must be called once all properties have been set.\n\nANeuralNetworksMemoryDesc_free must be called once the memory descriptor is no longer needed.\n\nAvailable since API level 30.\n\nDetails\nParameters\n desc The ANeuralNetworksMemoryDesc to be created. Set to NULL if unsuccessful.\nReturns\nANEURALNETWORKS_NO_ERROR if successful.\n\n### ANeuralNetworksMemoryDesc_finish\n\nint ANeuralNetworksMemoryDesc_finish(\nANeuralNetworksMemoryDesc *desc\n)\n\nIndicate that we have finished modifying a memory descriptor.\n\nRequired before calling ANeuralNetworksMemory_createFromDesc.\n\nThis function must only be called once for a given memory descriptor.\n\nSee ANeuralNetworksMemoryDesc for information on multithreaded usage.\n\nAvailable since API level 30.\n\nDetails\nParameters\n desc The memory descriptor to be finished.\nReturns\nANEURALNETWORKS_NO_ERROR if successful.\n\n### ANeuralNetworksMemoryDesc_free\n\nvoid ANeuralNetworksMemoryDesc_free(\nANeuralNetworksMemoryDesc *desc\n)\n\nDestroy a memory descriptor.\n\nThe memory descriptor need not have been finished by a call to ANeuralNetworksMemoryDesc_finish.\n\nSee ANeuralNetworksMemoryDesc for information on multithreaded usage.\n\nAvailable since API level 30.\n\nDetails\nParameters\n desc The memory descriptor to be destroyed. Passing NULL is acceptable and results in no operation.\n\n### ANeuralNetworksMemoryDesc_setDimensions\n\nint ANeuralNetworksMemoryDesc_setDimensions(\nANeuralNetworksMemoryDesc *desc,\nuint32_t rank,\nconst uint32_t *dimensions\n)\n\nSet the dimensional information of the memory descriptor.\n\nThe specified dimensions must be compatible with the dimensions of the corresponding model operands of all the roles specified by ANeuralNetworksMemoryDesc_addInputRole and ANeuralNetworksMemoryDesc_addOutputRole. Two dimensions are incompatible if both ranks are fully specified but have different values, or if there is at least one axis that is fully specified in both but has different values.\n\nAttempting to modify a memory descriptor once ANeuralNetworksMemoryDesc_finish has been called will return an error.\n\nSee ANeuralNetworksMemoryDesc for information on multithreaded usage.\n\nAvailable since API level 30.\n\nDetails\nParameters\n desc The memory descriptor to be modified. rank The number of dimensions. Must be 0 for scalars. dimensions An array of dimensions. An entry with the value 0 indicates that the corresponding axis has an unknown size.\nReturns\nANEURALNETWORKS_NO_ERROR if successful.\n\n### ANeuralNetworksMemory_copy\n\nint ANeuralNetworksMemory_copy(\nconst ANeuralNetworksMemory *src,\nconst ANeuralNetworksMemory *dst\n)\n\nCopies data from one memory object to another.\n\nIf at most one of the src and dst is created from ANeuralNetworksMemory_createFromDesc, the src and dst must have the same logical size:\n\nIf both src and dst are created from ANeuralNetworksMemory_createFromDesc, they must have compatible dimensions. Two dimensions are incompatible if both ranks are fully specified but have different values, or if there is at least one axis that is fully specified in both but has different values. The dst may have unspecified dimensions or rank. In such a case, the dimensions of dst will get updated according to the dimensions of the src.\n\nIn both cases, if the src is created from ANeuralNetworksMemory_createFromDesc, it must have been used as an output in a successful execution, or used as the destination memory in a successful ANeuralNetworksMemory_copy.\n\nThe src and dst may have different data layout, in which case the data copying is performed logically with data layout transformation.\n\nAvailable since API level 30.\n\nDetails\nParameters\n src The source memory object. dst The destination memory object.\nReturns\nANEURALNETWORKS_NO_ERROR if successful.\n\n### ANeuralNetworksMemory_createFromAHardwareBuffer\n\nint ANeuralNetworksMemory_createFromAHardwareBuffer(\nconst AHardwareBuffer *ahwb,\nANeuralNetworksMemory **memory\n)\n\nCreates a shared memory object from an AHardwareBuffer handle.\n\nIf the shared memory is backed by an AHardwareBuffer of AHARDWAREBUFFER_FORMAT_BLOB format, it can be used the same way as shared memory created from a file handle. See ANeuralNetworksMemory for a description on how to use this shared memory.\n\nIf the shared memory is backed by an AHardwareBuffer of a format other than AHARDWAREBUFFER_FORMAT_BLOB, it can only be used for Model inputs and outputs. When calling ANeuralNetworksExecution_setInputFromMemory or ANeuralNetworksExecution_setOutputFromMemory with the shared memory, both offset and length must be set to zero and the entire memory region will be associated with the specified input or output operand. There is no guarantee that an arbitrary AHardwareBuffer_Format and AHardwareBuffer_UsageFlags combination can be used by arbitrary devices. The execution will fail if the selected set of devices cannot consume the buffer.\n\nCalling ANeuralNetworksModel_setOperandValueFromMemory with shared memory backed by an AHardwareBuffer of a format other than AHARDWAREBUFFER_FORMAT_BLOB is disallowed.\n\nThe provided AHardwareBuffer must outlive the ANeuralNetworksMemory object.\n\nAvailable since API level 29.\n\nDetails\nParameters\n ahwb The AHardwareBuffer handle. memory The memory object to be created. Set to NULL if unsuccessful.\nReturns\nANEURALNETWORKS_NO_ERROR if the request completed normally.\n\n### ANeuralNetworksMemory_createFromDesc\n\nint ANeuralNetworksMemory_createFromDesc(\nconst ANeuralNetworksMemoryDesc *desc,\nANeuralNetworksMemory **memory\n)\n\nCreates a memory object from a memory descriptor.\n\nThe memory object is created with an uninitialized buffer. A memory object with an uninitialized buffer may only be used according to the roles specified by ANeuralNetworksMemoryDesc_addOutputRole, or as the destination memory in ANeuralNetworksMemory_copy. The buffer of a memory object is initialized after the memory object is used as an output in a successful execution, or used as the destination memory in a successful ANeuralNetworksMemory_copy. A memory object with an initialized buffer may be used according to all roles specified in ANeuralNetworksMemoryDesc, or as the source or destination memory in ANeuralNetworksMemory_copy. The buffer of a memory object will return to the uninitialized state if the memory object is used as an output in a failed execution, or used as the destination memory in a failed ANeuralNetworksMemory_copy.\n\nThe dimensions of the memory descriptor are deduced from the dimensions of the corresponding model operands of all the roles specified by ANeuralNetworksMemoryDesc_addInputRole and ANeuralNetworksMemoryDesc_addOutputRole, as well as the dimensions set by the call to ANeuralNetworksMemoryDesc_setDimensions, if any. The memory descriptor may have unspecified dimensions or rank. In such a case, the same memory object may be used with different shapes of outputs in different executions. When the memory is used as an input, the input shape must be the same as the output shape from the last execution using this memory object as an output, or the last ANeuralNetworkMemory_copy using this memory object as the destination memory. Creating a memory object with unspecified dimensions or rank may fail for certain sets of roles.\n\nUsing the memory in roles or shapes that are not compatible with the rules specified above will return an error.\n\nWhen calling ANeuralNetworksExecution_setInputFromMemory or ANeuralNetworksExecution_setOutputFromMemory with the memory object, both offset and length must be set to zero and the entire memory region will be associated with the specified input or output operand.\n\nCalling ANeuralNetworksModel_setOperandValueFromMemory with the memory created from this function will return an error.\n\nANeuralNetworksMemory_free must be called once the memory is no longer needed.\n\nAttempting to create memory from an unfinished memory descriptor will return an error.\n\nThe provided ANeuralNetworksMemoryDesc need not outlive the ANeuralNetworksMemory object.\n\nAvailable since API level 30.\n\nDetails\nParameters\n desc The memory descriptor. memory The memory object to be created. Set to NULL if unsuccessful.\nReturns\nANEURALNETWORKS_NO_ERROR if successful; ANEURALNETWORKS_OP_FAILED if the memory is created with unspecified dimensions or rank and it is not supported for this set of roles.\n\n### ANeuralNetworksMemory_createFromFd\n\nint ANeuralNetworksMemory_createFromFd(\nsize_t size,\nint protect,\nint fd,\nsize_t offset,\nANeuralNetworksMemory **memory\n)\n\nCreates a shared memory object from a file descriptor.\n\nThe shared memory is backed by a file descriptor via mmap. See ANeuralNetworksMemory for a description on how to use this shared memory.\n\nAvailable since API level 27.\n\nDetails\nParameters\n size The requested size in bytes. Must not be larger than the file size. prot The desired memory protection for the mapping. It is either PROT_NONE or the bitwise OR of one or more of the following flags: PROT_READ, PROT_WRITE. fd The requested file descriptor. The file descriptor has to be mmap-able. The file descriptor will be duplicated. offset The offset to the beginning of the file of the area to map. The offset has to be aligned to a page size. memory The memory object to be created. Set to NULL if unsuccessful.\nReturns\nANEURALNETWORKS_NO_ERROR if the request completed normally.\n\n### ANeuralNetworksMemory_free\n\nvoid ANeuralNetworksMemory_free(\nANeuralNetworksMemory *memory\n)\n\nDelete a memory object.\n\nDestroys the object used by the run time to keep track of the memory. This will free the underlying actual memory if no other code has open handles to this memory.\n\nAvailable since API level 27.\n\nDetails\nParameters\n memory The memory object to be freed. Passing NULL is acceptable and results in no operation.\n\nint ANeuralNetworksModel_addOperand(\nANeuralNetworksModel *model,\nconst ANeuralNetworksOperandType *type\n)\n\nAdd an operand to a model.\n\nThe order in which the operands are added is important. The first one added to a model will have the index value 0, the second 1, etc. These indexes are used as operand identifiers in ANeuralNetworksModel_addOperation, ANeuralNetworksModel_identifyInputsAndOutputs, ANeuralNetworksModel_setOperandValue, ANeuralNetworksModel_setOperandValueFromMemory, ANeuralNetworksExecution_setInput, ANeuralNetworksExecution_setInputFromMemory, ANeuralNetworksExecution_setOutput, ANeuralNetworksExecution_setOutputFromMemory and ANeuralNetworksExecution_setOperandValue.\n\nEvery operand must be referenced in exactly one of the following ways:\n\nint ANeuralNetworksModel_addOperation(\nANeuralNetworksModel *model,\nANeuralNetworksOperationType type,\nuint32_t inputCount,\nconst uint32_t *inputs,\nuint32_t outputCount,\nconst uint32_t *outputs\n)\n\nAdd an operation to a model.\n\nThe operands specified by inputs and outputs must have been previously added by calls to ANeuralNetworksModel_addOperand.\n\nDetails\nParameters\n model The model to be modified. type The ANeuralNetworksOperationType of the operation. inputCount The number of entries in the inputs array. inputs An array of indexes identifying each operand. outputCount The number of entries in the outputs array. outputs An array of indexes identifying each operand.\n\nAttempting to modify a model once ANeuralNetworksModel_finish has been called will return an error.\n\nSee ANeuralNetworksModel for information on multithreaded usage.\n\nAvailable since API level 27.\n\nDetails\nReturns\nANEURALNETWORKS_NO_ERROR if successful.\n\n### ANeuralNetworksModel_create\n\nint ANeuralNetworksModel_create(\nANeuralNetworksModel **model\n)\n\nCreate an empty ANeuralNetworksModel.\n\nThis only creates the object. Computation is performed once ANeuralNetworksExecution_burstCompute, ANeuralNetworksExecution_compute, ANeuralNetworksExecution_startCompute or ANeuralNetworksExecution_startComputeWithDependencies is invoked.\n\nANeuralNetworksModel_finish should be called once the model has been fully constructed.\n\nANeuralNetworksModel_free should be called once the model is no longer needed.\n\nAvailable since API level 27.\n\nDetails\nParameters\n model The ANeuralNetworksModel to be created. Set to NULL if unsuccessful.\nReturns\nANEURALNETWORKS_NO_ERROR if successful.\n\n### ANeuralNetworksModel_finish\n\nint ANeuralNetworksModel_finish(\nANeuralNetworksModel *model\n)\n\nIndicate that we have finished modifying a model.\n\nRequired before calling ANeuralNetworksCompilation_create and ANeuralNetworksCompilation_createForDevices.\n\nAn application must ensure that no other thread uses the model at the same time.\n\nThis function must only be called once for a given model.\n\nSee ANeuralNetworksModel for information on multithreaded usage.\n\nAvailable since API level 27.\n\nDetails\nParameters\n model The model to be finished.\nReturns\nANEURALNETWORKS_NO_ERROR if successful.\n\n### ANeuralNetworksModel_free\n\nvoid ANeuralNetworksModel_free(\nANeuralNetworksModel *model\n)\n\nDestroy a model.\n\nThe model need not have been finished by a call to ANeuralNetworksModel_finish.\n\nSee ANeuralNetworksModel for information on multithreaded usage.\n\nAvailable since API level 27.\n\nDetails\nParameters\n model The model to be destroyed. Passing NULL is acceptable and results in no operation.\n\n### ANeuralNetworksModel_getSupportedOperationsForDevices\n\nint ANeuralNetworksModel_getSupportedOperationsForDevices(\nconst ANeuralNetworksModel *model,\nconst ANeuralNetworksDevice *const *devices,\nuint32_t numDevices,\nbool *supportedOps\n)\n\nGet the supported operations for a specified set of devices.\n\nIf multiple devices are selected, the supported operation list is a union of supported operations of all selected devices.\n\nAvailable since API level 29.\n\nDetails\nParameters\n model The model to be queried. devices The set of devices. Must not contain duplicates. numDevices The number of devices in the set. supportedOps The boolean array to be filled. True means supported. The size of the boolean array must be at least as large as the number of operations in the model. The order of elements in the supportedOps array matches the order in which the corresponding operations were added to the model.\nReturns\nANEURALNETWORKS_NO_ERROR if successful.\n\n### ANeuralNetworksModel_identifyInputsAndOutputs\n\nint ANeuralNetworksModel_identifyInputsAndOutputs(\nANeuralNetworksModel *model,\nuint32_t inputCount,\nconst uint32_t *inputs,\nuint32_t outputCount,\nconst uint32_t *outputs\n)\n\nSpecifies which operands will be the model's inputs and outputs.\n\nEvery model must have at least one input and one output.\n\nAn operand cannot be used for both input and output. Doing so will return an error.\n\nThe operands specified by inputs and outputs must have been previously added by calls to ANeuralNetworksModel_addOperand.\n\nDetails\nParameters\n model The model to be modified. inputCount The number of entries in the inputs array. inputs An array of indexes identifying the input operands. outputCount The number of entries in the outputs array. outputs An array of indexes identifying the output operands.\n\nAttempting to modify a model once ANeuralNetworksModel_finish has been called will return an error.\n\nSee ANeuralNetworksModel for information on multithreaded usage.\n\nAvailable since API level 27.\n\n### ANeuralNetworksModel_relaxComputationFloat32toFloat16\n\nint ANeuralNetworksModel_relaxComputationFloat32toFloat16(\nANeuralNetworksModel *model,\nbool allow\n)\n\nSpecifies whether ANEURALNETWORKS_TENSOR_FLOAT32 is allowed to be calculated with range and/or precision as low as that of the IEEE 754 16-bit floating-point format.\n\nBy default, ANEURALNETWORKS_TENSOR_FLOAT32 must be calculated using at least the range and precision of the IEEE 754 32-bit floating-point format.\n\nThe relaxComputationFloat32toFloat16 setting of the main model of a compilation overrides the values of the referenced models.\n\nAttempting to modify a model once ANeuralNetworksModel_finish has been called will return an error.\n\nDetails\nParameters\n model The model to be modified. allow 'true' indicates ANEURALNETWORKS_TENSOR_FLOAT32 may be calculated with range and/or precision as low as that of the IEEE 754 16-bit floating point format. 'false' indicates ANEURALNETWORKS_TENSOR_FLOAT32 must be calculated using at least the range and precision of the IEEE 754 32-bit floating point format.\n\nAvailable since API level 28.\n\nSee ANeuralNetworksModel for information on multithreaded usage.\n\n### ANeuralNetworksModel_setOperandSymmPerChannelQuantParams\n\nint ANeuralNetworksModel_setOperandSymmPerChannelQuantParams(\nANeuralNetworksModel *model,\nint32_t index,\nconst ANeuralNetworksSymmPerChannelQuantParams *channelQuant\n)\n\nSets an operand's per channel quantization parameters.\n\nSets parameters required by a tensor of type ANEURALNETWORKS_TENSOR_QUANT8_SYMM_PER_CHANNEL. This function must be called for every tensor of type ANEURALNETWORKS_TENSOR_QUANT8_SYMM_PER_CHANNEL before calling ANeuralNetworksModel_finish.\n\nAvailable since API level 29.\n\nDetails\nParameters\n model The model to be modified. index The index of the model operand we're setting. channelQuant The per channel quantization parameters for the operand. No memory in this struct needs to outlive the call to this function.\nReturns\nANEURALNETWORKS_NO_ERROR if successful.\n\n### ANeuralNetworksModel_setOperandValue\n\nint ANeuralNetworksModel_setOperandValue(\nANeuralNetworksModel *model,\nint32_t index,\nconst void *buffer,\nsize_t length\n)\n\nSets an operand to a constant value.\n\nValues of length smaller or equal to ANEURALNETWORKS_MAX_SIZE_OF_IMMEDIATELY_COPIED_VALUES are immediately copied into the model.\n\nFor values of length greater than ANEURALNETWORKS_MAX_SIZE_OF_IMMEDIATELY_COPIED_VALUES, a pointer to the buffer is stored within the model. The application must not change the content of this region until all executions using this model have completed. As the data may be copied during processing, modifying the data after this call yields undefined results. The provided buffer must outlive this model.\n\nFor large tensors, using ANeuralNetworksModel_setOperandValueFromMemory is likely to be more efficient.\n\nTo indicate that an optional operand should be considered missing, pass nullptr for buffer and 0 for length.\n\nAttempting to modify a model once ANeuralNetworksModel_finish has been called will return an error.\n\nSee ANeuralNetworksModel for information on multithreaded usage.\n\nAvailable since API level 27.\n\nDetails\nParameters\n model The model to be modified. index The index of the model operand we're setting. buffer A pointer to the data to use. length The size in bytes of the data value.\nReturns\nANEURALNETWORKS_NO_ERROR if successful.\n\n### ANeuralNetworksModel_setOperandValueFromMemory\n\nint ANeuralNetworksModel_setOperandValueFromMemory(\nANeuralNetworksModel *model,\nint32_t index,\nconst ANeuralNetworksMemory *memory,\nsize_t offset,\nsize_t length\n)\n\nSets an operand to a value stored in a memory object.\n\nThe content of the memory is not copied. A reference to that memory is stored inside the model. The application must not change the content of the memory region until all executions using this model have completed. As the data may be copied during processing, modifying the data after this call yields undefined results.\n\nThe provided memory must outlive this model.\n\nTo indicate that an optional operand should be considered missing, use ANeuralNetworksModel_setOperandValue instead, passing nullptr for buffer.\n\nIt is disallowed to set an operand value with shared memory backed by an AHardwareBuffer of a format other than AHARDWAREBUFFER_FORMAT_BLOB.\n\nIt is disallowed to set an operand value with memory created from ANeuralNetworksMemory_createFromDesc.\n\nAttempting to modify a model once ANeuralNetworksModel_finish has been called will return an error.\n\nSee ANeuralNetworksModel for information on multithreaded usage. See ANeuralNetworksMemory_createFromAHardwareBuffer for information on AHardwareBuffer usage.\n\nAvailable since API level 27.\n\nDetails\nParameters\n model The model to be modified. index The index of the model operand we're setting. buffer A pointer to the data to use. memory The memory containing the data. offset This specifies the location of the data within the memory. The offset is in bytes from the start of memory. length The size in bytes of the data value.\nReturns\nANEURALNETWORKS_NO_ERROR if successful.\n\n### ANeuralNetworksModel_setOperandValueFromModel\n\nint ANeuralNetworksModel_setOperandValueFromModel(\nANeuralNetworksModel *model,\nint32_t index,\nconst ANeuralNetworksModel *value\n)\n\nSets an operand to a value that is a reference to another NNAPI model.\n\nThe referenced model must already have been finished by a call to ANeuralNetworksModel_finish.\n\nThe ANeuralNetworksModel_relaxComputationFloat32toFloat16 setting of referenced models is overridden by that setting of the main model of a compilation.\n\nThe referenced model must outlive the model referring to it.\n\nAttempting to modify a model once ANeuralNetworksModel_finish has been called will return an error.\n\nSee ANeuralNetworksModel for information on multithreaded usage.\n\nAvailable since API level 30.\n\nDetails\nParameters\n model The model to be modified. index The index of the model operand we're setting. value The model to be referenced.\nReturns\nANEURALNETWORKS_NO_ERROR if successful.\n\n### ANeuralNetworks_getDefaultLoopTimeout\n\nuint64_t ANeuralNetworks_getDefaultLoopTimeout()\n\nGet the default timeout value for WHILE loops.\n\nAvailable since API level 30.\n\nDetails\nReturns\nThe default timeout value in nanoseconds.\n\n### ANeuralNetworks_getDevice\n\nint ANeuralNetworks_getDevice(\nuint32_t devIndex,\nANeuralNetworksDevice **device\n)\n\nGet the representation of the specified device.\n\nAvailable since API level 29.\n\nDetails\nParameters\n devIndex The index of the specified device. Must be less than the number of available devices. device The representation of the specified device. The same representation will always be returned for the specified device.\nReturns\nANEURALNETWORKS_NO_ERROR if successful.\n\n### ANeuralNetworks_getDeviceCount\n\nint ANeuralNetworks_getDeviceCount(\nuint32_t *numDevices\n)\n\nGet the number of available devices.\n\nAvailable since API level 29.\n\nDetails\nParameters\n numDevices Used to return the number of devices.\nReturns\nANEURALNETWORKS_NO_ERROR if successful.\n\n### ANeuralNetworks_getMaximumLoopTimeout\n\nuint64_t ANeuralNetworks_getMaximumLoopTimeout()\n\nGet the maximum timeout value for WHILE loops.\n\nAvailable since API level 30.\n\nDetails\nReturns\nThe maximum timeout value in nanoseconds."
] | [
null
] | {"ft_lang_label":"__label__en","ft_lang_prob":0.73910326,"math_prob":0.89276683,"size":145630,"snap":"2020-24-2020-29","text_gpt3_token_len":33300,"char_repetition_ratio":0.26315355,"word_repetition_ratio":0.4884165,"special_character_ratio":0.18972053,"punctuation_ratio":0.13550954,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9517425,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2020-07-11T05:43:54Z\",\"WARC-Record-ID\":\"<urn:uuid:2671065e-b153-48f2-9e5e-401b5ea9db61>\",\"Content-Length\":\"947002\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:7129e6d3-198e-4b81-a04b-8c15b6abaf7d>\",\"WARC-Concurrent-To\":\"<urn:uuid:9d75d00c-8ecc-47d5-8a25-85fb84505dc3>\",\"WARC-IP-Address\":\"172.217.8.3\",\"WARC-Target-URI\":\"https://developer.android.google.cn/ndk/reference/group/neural-networks?hl=zh-tw\",\"WARC-Payload-Digest\":\"sha1:4UV2C274M5GC5TK7SDXLHHGF3WOETCWW\",\"WARC-Block-Digest\":\"sha1:3A2AWCHBOFZOLCKQIH5JLYDS5X542QLK\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2020/CC-MAIN-2020-29/CC-MAIN-2020-29_segments_1593655921988.66_warc_CC-MAIN-20200711032932-20200711062932-00221.warc.gz\"}"} |
http://newnooze.info/fraction-worksheets-year-6-australia-4170.html | [
"# Fraction Worksheets Year 6 Australia\n\ni1",
null,
"## year 6 math worksheets and problems percentage edugain australia",
null,
"## year 6 math worksheets and problems fractions edugain australia",
null,
"## year 7 math worksheets and problems fractions edugain australia",
null,
"## year 6 maths worksheets adding fractions k5 worksheets math worksheets year 6 maths",
null,
"## year 4 math worksheets and problems fractions edugain australia",
null,
"## year 6 math worksheets and problems decimals edugain australia\n\ni2",
null,
"## year 6 math worksheets and problems integers edugain australia",
null,
"## year 6 math worksheets and problems geometry edugain australia",
null,
"## year 6 naplan printable worksheets online practice online tests and problems edugain australia",
null,
"## year 6 math worksheets and problems algebra edugain australia",
null,
"## year 2 maths worksheets from save teachers sundays by saveteacherssundays teaching resources tes",
null,
"## dividing fractions with whole numbers worksheets whole by fraction and fraction by whole",
null,
"## mathsonline maths tuition for all australian k 12 students",
null,
"## australian money worksheets higher order thinking hots grade 3 and 4 os board money",
null,
"## third grade math worksheets multiplication 2 digits by 1 digit 6 math pinterest",
null,
"## targeting mental maths year 3 australian curriculum edition by garda turner 9781742152080",
null,
"## year 5 olympiad printable worksheets online practice online tests and problems edugain",
null,
"## mental maths workbook year 6 australian curriculum aligned mental maths pinterest mental",
null,
"## fractions decimals and percentage sort this worksheet is designed to assist students to make",
null,
"## australian curriculum number and algebra worksheet year 5 39 back to school 39 workbooks",
null,
"## mental maths workbook sample year 4 australian curriculum aligned free 16 page printable",
null,
"## how much change subtracting from 5 this resource consists of 3 worksheets that",
null,
"## equivalent fractions decimals and percentages by jlcaseyuk teaching resources",
null,
"## year 6 mental maths worksheets 10 math sch pinterest math mental maths tests and mental",
null,
"## pin by ahmad thekingofstress on kumpulan contoh math worksheets year 7 maths worksheets year",
null,
"## australian maths worksheets mental maths workbook sample year 2 australian curriculum",
null,
"## fractions and decimals magical maths math questions math worksheets maths exam",
null,
"## mental maths workbook year 6 australian curriculum aligned mental maths math workbook",
null,
"## math subtraction worksheets 1st grade picture year 1 first mental an image part of counting",
null,
"## 10 best australian school curriculum images on pinterest learning australian curriculum and",
null,
"## s t w now has canadian money worksheets uk and australian money coming soon math super",
null,
"## year 7 math worksheets and problems percentage edugain australia",
null,
"## free math worksheets printable organized by grade k5 learning",
null,
"## realistic math problems help 6th graders solve real life questions recipes to cook pinterest",
null,
"## printable fraction worksheets equivalent fractions 5 4 6 grade math fractions worksheets",
null,
"## free equivalent fractions worksheets generator at the bottom of the page future classroom",
null,
"## targeting mental maths year 4 australian curriculum edition by robyn hurley 9781742152097",
null,
"## math problem worksheets tallest trees metric tutoring 5th grade math math word problems",
null,
"",
null,
"## changing mixed fractions to decimals studyladder interactive learning games",
null,
"## ks3 ks4 maths worksheets printable with answers year 7 math pdf al 5 uk algebra fractions angles",
null,
""
] | [
null,
"https://au.edugain.com/images/worksheets/grade-6-Percentage.png",
null,
"https://d2pbkktgz4wpxb.cloudfront.net/images/worksheets/grade-6-Fractions.png",
null,
"https://au.edugain.com/images/worksheets/grade-7-Fractions.png",
null,
"https://i.pinimg.com/736x/8d/59/a8/8d59a855b0636d49db4284533ac91cec.jpg",
null,
"https://au.edugain.com/images/worksheets/grade-4-Fractions.png",
null,
"https://au.edugain.com/images/worksheets/grade-6-Decimals.png",
null,
"https://d2pbkktgz4wpxb.cloudfront.net/images/worksheets/grade-6-Integers.png",
null,
"https://au.edugain.com/images/worksheets/grade-6-Geometry.png",
null,
"https://d2pbkktgz4wpxb.cloudfront.net/images/worksheets/grade-6-NAPLAN.png",
null,
"http://au.edugain.com/images/worksheets/grade-6-Algebra.png",
null,
"https://dryuc24b85zbr.cloudfront.net/tes/resources/6407620/image",
null,
"https://s-media-cache-ak0.pinimg.com/736x/65/76/fb/6576fbcae1e3b187ec1875c2258d6c58.jpg",
null,
"http://www.mathsonline.com.au/assets/images/how-it-works-4A.jpg",
null,
"https://i.pinimg.com/736x/6e/c1/5c/6ec15c65aa4de1ef8cd99859b69a1025--australian-money-money-worksheets.jpg",
null,
"https://s-media-cache-ak0.pinimg.com/originals/0e/9c/56/0e9c56813abe6ac1db398294d1669564.gif",
null,
"https://static.booktopia.com.au/internals/9781742152080-5.jpg",
null,
"https://au.edugain.com/images/worksheets/grade-5-Olympiad.png",
null,
"https://i.pinimg.com/236x/6b/ab/c8/6babc8f26d1de6ed0476075eb56b74e9--australian-curriculum-place-values.jpg",
null,
"https://i.pinimg.com/originals/17/6b/be/176bbe9b2fdd8912cb7f4311584a2d8a.png",
null,
"https://i.pinimg.com/originals/77/1c/e9/771ce9a9582024c0651f0a28669936dc.jpg",
null,
"https://i.pinimg.com/236x/61/a0/b3/61a0b38cdf95cc2dd483df1ab317996d--math-workbook-mental-maths.jpg",
null,
"https://i.pinimg.com/originals/26/5d/91/265d910c6efb59bc9f0e9b288b3f88d5.png",
null,
"https://dryuc24b85zbr.cloudfront.net/tes/resources/6094528/image",
null,
"https://i.pinimg.com/originals/8e/65/1c/8e651c2556448907bc7db0bcc6a40008.gif",
null,
"https://i.pinimg.com/736x/bf/74/3a/bf743a4b2362997762fe409f1b9fe6b0.jpg",
null,
"http://au.edugain.com/images/worksheets/grade-10-Full-Year-10th-Grade-Review.png",
null,
"https://i.pinimg.com/736x/e0/f5/27/e0f527b3cd2a6a141bed9984a1e5d48a.jpg",
null,
"https://i.pinimg.com/236x/88/10/86/8810862819ae920c100b1fb17d4f697d--math-measurement-school-worksheets.jpg",
null,
"https://i.pinimg.com/originals/a6/fe/19/a6fe19b9a7850734b6703c88caf216de.gif",
null,
"https://i.pinimg.com/736x/b9/c3/37/b9c33759e265391e1abe97c2ecf7eaad--teaching-math-maths.jpg",
null,
"https://s-media-cache-ak0.pinimg.com/736x/b8/cc/cb/b8cccb14495f10a7a89e5f50482720b0.jpg",
null,
"https://au.edugain.com/images/worksheets/grade-7-Percentage.png",
null,
"https://www.k5learning.com/sites/all/files/math-worksheets-printable.gif",
null,
"https://i.pinimg.com/236x/a2/fb/25/a2fb250b8c0bcd2f9db1cd0dc67ca2a6--math-worksheets-maths.jpg",
null,
"https://i.pinimg.com/originals/d4/e7/4c/d4e74ca4651e8f9a639feda0923b1054.gif",
null,
"https://i.pinimg.com/originals/8a/be/6a/8abe6a4e57309c1027145fb555c36ce9.gif",
null,
"https://static.booktopia.com.au/internals/9781742152097-4.jpg",
null,
"https://i.pinimg.com/originals/fc/d0/1c/fcd01c6b3c92b2201594eea6ef01d34c.gif",
null,
"https://i.pinimg.com/originals/37/9f/a8/379fa881e2fb3c83fe83755052145bbc.jpg",
null,
"https://static.studyladder.com/cdn/course/35/a838df040ac0.jpg",
null,
"https://i.pinimg.com/originals/df/b7/6d/dfb76d321769002e82d1823e46b2d7d8.jpg",
null,
"https://i.pinimg.com/originals/53/22/3e/53223e446ab4b7a6c901728785ac6c62.jpg",
null
] | {"ft_lang_label":"__label__en","ft_lang_prob":0.73898023,"math_prob":0.44010746,"size":7814,"snap":"2019-43-2019-47","text_gpt3_token_len":1617,"char_repetition_ratio":0.30793855,"word_repetition_ratio":0.09602076,"special_character_ratio":0.17622216,"punctuation_ratio":0.004310345,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.97587574,"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],"im_url_duplicate_count":[null,4,null,null,null,null,null,null,null,7,null,3,null,null,null,2,null,3,null,2,null,null,null,null,null,3,null,3,null,4,null,2,null,3,null,6,null,6,null,7,null,2,null,2,null,8,null,null,null,null,null,6,null,6,null,3,null,null,null,2,null,6,null,null,null,null,null,5,null,null,null,null,null,3,null,null,null,null,null,5,null,null,null,3,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2019-11-12T15:22:43Z\",\"WARC-Record-ID\":\"<urn:uuid:dc4f9434-1ec1-455d-ac49-70a4a8463aa0>\",\"Content-Length\":\"100940\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:10addd30-3c24-467d-9640-359a41cb3382>\",\"WARC-Concurrent-To\":\"<urn:uuid:f3ed6b49-df79-4e8b-9576-0824d6965c88>\",\"WARC-IP-Address\":\"104.28.0.86\",\"WARC-Target-URI\":\"http://newnooze.info/fraction-worksheets-year-6-australia-4170.html\",\"WARC-Payload-Digest\":\"sha1:BXAO5FK3FPDIZZLTZPT26CBMVOOUITRI\",\"WARC-Block-Digest\":\"sha1:W6QC2T7DPX6CCGODDTFGFEPD5GSVHW3S\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2019/CC-MAIN-2019-47/CC-MAIN-2019-47_segments_1573496665575.34_warc_CC-MAIN-20191112151954-20191112175954-00409.warc.gz\"}"} |
http://main.timleungjr.ca/?p=773 | [
"# Even Non Engineers Can Learn Design Optimization!\n\nFor 10 years I studied worked in the Computational Aerodynamics Group at the University of Toronto Institute for Aerospace Studies. It's goal is researching into designing environmentally friendly aircraft. Specifically, I worked in the area of \"aerodynamic shape optimization\", where I used computer algorithms to design wings with the least amount of drag. While the group had undergraduate and graduate students, post-doctoral researchers, and even the occasional high-school interns working, the bulk of the research is done by the graduate students, because it requires a good understanding of aerodynamics—the physics of air flows around an aircraft, as well as a strong background in mathematics, especially in calculus and linear algebra. That said, like topics in many areas of engineering research, the underlying concept of optimization actually isn't particularly difficult to understand, and it can usually be explained to any lay person with a basic science background.\n\nIt goes like this. Engineers and mathematicians usually pose the optimization problem using this simple (but perhaps strange looking) expression:\n\nThe expression means \"find a set of design variables $\\mathcal{X}$ such that the objective function $\\mathcal{J}$ is minimized, while satisfying $i$ constraints $C_i\\leq 0$.\" Writing out the expression doesn't necessarily make things easier to understand, but we can strip away the math and just focus on the concept.\n\nWe start with the objective function $\\mathcal{J}$. This function is very important, since we use this single number to describe what ultimately matters most. For example, in aircraft design, we may want to minimize drag on the surface of the wing $C_D$ because it directly impact fuel consumption, or maximize range $R$ (i.e. we'd minimize the inverse $1/R$), or maximize the payload weight $W_\\mathrm{payload}$ (i.e. minimize $1/W_\\mathrm{payload}$). If we're working on heating and cooling a confined space, the objective function may be to minimize the heat loss through the walls, or the minimum amount of energy to reduce the internal temperature by 1°C.\n\nIt's important to point out a crucial concept that's obvious to anyone working in numerical optimization, but difficult for others to grasp. If we optimize 3 airplanes based on the 3 objective functions I mentioned before (minimize drag, maximize range, maximize payload) then I'd get 3 very different airplanes. Which one is actually better? Well, I don't know! Because they're optimized with different objectives in mind, they're all \"best\" by their own definition. If you then use a different standard to measure their performances, then none of them are optimized. This is why a company CEO can't just tell an engineer, \"give me the best design\" without being very specific about what management actually wants.\n\nDuring the optimization process, we allow the computer to change some \"design variables\" $\\mathcal{X}$, which are parameters that define the shape. In my work in aircraft design, design variables can be the span of the wings, the location of the wings and horizontal stabilizers, the sweep or twist angles of the wings, the cross sectional shapes of the wings, the length and diameter of the fuselage etc. Even when we design just a wing, we have more than 100 variables specifying it's shape. The more variables we use, the more number crunching the computer needs to do. The conventional wisdom is that the more variables you use, the better the final design will be, i.e. lower objective functional value at the end, although my research showed that it's not usually the case.\n\nThe optimization process looks something like this:\n\n1. Start with original non optimal design $\\mathcal{X}_0$\n2. Compute objective function $\\mathcal{J}$\n3. Compute a direction of improvement\n4. If the design can be improved further, update $\\mathcal{X}$, and go back to step 2.\n\nJust remember that all the work is done on the computer and not by hand. For now we've ignored the constraints $C_i$, which are other design requirements that we must satisfy. That'll be the topic of another article..."
] | [
null
] | {"ft_lang_label":"__label__en","ft_lang_prob":0.93747205,"math_prob":0.9537414,"size":3923,"snap":"2021-31-2021-39","text_gpt3_token_len":761,"char_repetition_ratio":0.11533555,"word_repetition_ratio":0.0,"special_character_ratio":0.19525874,"punctuation_ratio":0.11251758,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.97907656,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2021-09-24T22:00:07Z\",\"WARC-Record-ID\":\"<urn:uuid:011e8788-f2a3-4052-a85c-8704fa609e43>\",\"Content-Length\":\"27951\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:e4d8d250-86e9-41af-83af-0f04b0e7fa78>\",\"WARC-Concurrent-To\":\"<urn:uuid:84afce20-7000-4f80-962c-1767777bab39>\",\"WARC-IP-Address\":\"64.34.156.151\",\"WARC-Target-URI\":\"http://main.timleungjr.ca/?p=773\",\"WARC-Payload-Digest\":\"sha1:PQUMADWSJOQY7OUVUGDICPB3E756BX2S\",\"WARC-Block-Digest\":\"sha1:Y5AXXUZLNCSXNFX7UO4CWH4AKOCBMJIC\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2021/CC-MAIN-2021-39/CC-MAIN-2021-39_segments_1631780057580.39_warc_CC-MAIN-20210924201616-20210924231616-00627.warc.gz\"}"} |
https://www.wendangwang.com/doc/c80433931963834cc712139c | [
"# 2014年三年级数学下册期中测试题\n\n1、直接写出得数。6%\n\n160×4= 17×50= 250×0= 4500÷3=\n\n4×16= 5×140= 280+0= 30×60=\n\n30×16= 10×47= 45+15= 80×40=\n\n2、列竖式计算。18%(带※的要求验算)\n\n※69×87= ※57×69= 902÷3\n\n904÷5= ※80×75= 25×28=\n\n1、最小的两位数与最大的两位数的积是( ),和是( )。\n\n2、口算22×20时,先算( )×( )=( ),再在末尾添加( )个零。\n\n3、根据右边的竖式填空。 53\n\n1113 求的是( )个班( )人\n\n4、42的50倍是( ),425是5的( )倍,33个12的和是( )。\n\n5、在O里填“﹤、﹥、﹦”\n\n40×50O200 34×12O43×12 97×30O2700 26×21O26×3×7\n\n6、95的5倍是( ),95是5的( )倍。\n\n7、估一估,连一连。\n\n37×43· ·得数比400大,比900小\n\n47×74· ·得数在3500左右\n\n23×28· ·得数比1800大,比2800小\n\n33×66· ·得数在1600左右\n\n8、小王每分钟打64个字,请你估算一下,他48分钟大约能打( )千个字。\n\n9、已知2004年是闰年,这一年以后的三个闰年分别是( )年、( )年、和( )年\n\n10、〇÷13=□ ☆,☆最大可能是( )\n\n1\n\n#### 你可能喜欢\n\n• 人教版三年级数学下册期中试卷\n• 南京一模数学\n• 人教版六年级数学下册第三单元\n• 人教版数学三年级下册第四单元\n• 人教版三年级下册英语期末试卷\n• 人教版小学数学三年级下册\n• 义务教育教科书数学三年级下册\n• 数学三年级下册知识点归纳\n\n## 最新文档",
null,
""
] | [
null,
"https://www.wendangwang.com/images/top.png",
null
] | {"ft_lang_label":"__label__zh","ft_lang_prob":0.8589157,"math_prob":0.964037,"size":1973,"snap":"2020-24-2020-29","text_gpt3_token_len":1958,"char_repetition_ratio":0.17216861,"word_repetition_ratio":0.0,"special_character_ratio":0.37962493,"punctuation_ratio":0.0,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.95709175,"pos_list":[0,1,2],"im_url_duplicate_count":[null,null,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2020-06-06T17:02:07Z\",\"WARC-Record-ID\":\"<urn:uuid:7e90b2f6-1826-44bc-b158-8d624be5e1ba>\",\"Content-Length\":\"36489\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:eb9bf0bf-ab45-4555-9b7c-2759e4617660>\",\"WARC-Concurrent-To\":\"<urn:uuid:2f453e14-18a7-4a4e-879a-40bbfce2c60b>\",\"WARC-IP-Address\":\"140.143.218.90\",\"WARC-Target-URI\":\"https://www.wendangwang.com/doc/c80433931963834cc712139c\",\"WARC-Payload-Digest\":\"sha1:26SSOEPTHH75HQU262ZSHEW75DMNBYGM\",\"WARC-Block-Digest\":\"sha1:QRHTDUDNIVRI67CHGDWOXLCWJ6NLU7AT\",\"WARC-Identified-Payload-Type\":\"application/xhtml+xml\",\"warc_filename\":\"/cc_download/warc_2020/CC-MAIN-2020-24/CC-MAIN-2020-24_segments_1590348517506.81_warc_CC-MAIN-20200606155701-20200606185701-00108.warc.gz\"}"} |
https://hellothinkster.com/math-questions/decimals/what-is-40-70-as-a-decimal | [
"# What is 40/70 as a decimal?\n\nToday, we will walk you through how to convert 40/70 to a decimal. In this particular guide we’ll show how to use the division method, one of the easiest ways to convert a fraction to a decimal.\n\n## Solution: 40/70 as a decimal is 0.57\n\nMethods\n\n### Explanation using the division method:\n\nA fraction is written in terms of two parts: the number on top is called the numerator and the number on the bottom is called the denominator. We can use the division method to solve this question. To get a decimal, simply divide the numerator 40 by the denominator 70:\n\n40 (numerator) ÷ 70 (denominator) = 0.57\n\nAs a result, you get 0.57 as your answer when you convert 40/70 to a decimal.\n\n### Convert some more fractions to decimals!\n\nPractice some more problems on converting fractions to decimals:",
null,
"#### 8 Math Hacks and Tricks to Turn Your ‘Okay’ Math Student Into a Math Champion!\n\nOne thing we teach our students at Thinkster is that there are multiple ways to solve a math problem. This helps our students learn to think flexibly and non-linearly.\n\nGet PDF",
null,
"#### How to Make Sure Your Child is Highly Successful and Becomes a Millionaire\n\nAs a parent, you hope your child is extremely successful and likely become the next Gates, Zuckerberg, or Meg Whitman. To set your child on the right path, there are many skills and traits that you can start building and nurturing now. Doing so plants the seeds for future success.\n\nGet PDF\n\n### Your Child Can Improve Their Math Scores By 90% Within 3 months!\n\nOur elite math tutors are ready to help make your child a math champion! Sign up for our zero \\$ free trial to get started today.\n\nGet Price + Free Parent Membership"
] | [
null,
"https://hellothinkster.com/images/download-img-1.jpg",
null,
"https://hellothinkster.com/images/download-img-2.jpg",
null
] | {"ft_lang_label":"__label__en","ft_lang_prob":0.89950895,"math_prob":0.83262616,"size":388,"snap":"2023-14-2023-23","text_gpt3_token_len":100,"char_repetition_ratio":0.15364583,"word_repetition_ratio":0.0,"special_character_ratio":0.27319586,"punctuation_ratio":0.10843374,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.95031476,"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-09T17:22:28Z\",\"WARC-Record-ID\":\"<urn:uuid:9f38f4c7-9e67-4921-b944-b6dc47a86931>\",\"Content-Length\":\"98736\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:69cfd2b5-bf87-4ed7-a89a-7c48a8dbf102>\",\"WARC-Concurrent-To\":\"<urn:uuid:07be02c3-1619-4b01-8405-8aeb65d943d0>\",\"WARC-IP-Address\":\"151.101.194.132\",\"WARC-Target-URI\":\"https://hellothinkster.com/math-questions/decimals/what-is-40-70-as-a-decimal\",\"WARC-Payload-Digest\":\"sha1:LYHS52VKMBT7UD2D6OTS6KXN33SRJ2TQ\",\"WARC-Block-Digest\":\"sha1:LXLXCM7Y2SBZJX3JHDM2ZQJZ46WFMJUJ\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2023/CC-MAIN-2023-23/CC-MAIN-2023-23_segments_1685224656788.77_warc_CC-MAIN-20230609164851-20230609194851-00555.warc.gz\"}"} |
https://brainmass.com/statistics/regression-analysis/determining-the-least-squares-trend-equation-6334 | [
"Purchase Solution\n\n# Determining the least squares trend equation\n\nNot what you're looking for?\n\nListed is the selling price for a share of PepsiCo, Inc. at the close of the year\n\nA. Plot the data\nB. Determine the least squares trend equation\nC. Calculate the points for years 1993 and 1998\n\nSee attachment below for time series table.\n\n##### Solution Summary\n\nThe solution answers the question(s) below.\n\n##### Free BrainMass Quizzes\n\nEach question is a choice-summary multiple choice question that presents you with a statistical concept and then 4 numbered statements. You must decide which (if any) of the numbered statements is/are true as they relate to the statistical concept.\n\n##### Measures of Central Tendency\n\nTests knowledge of the three main measures of central tendency, including some simple calculation questions.\n\n##### Measures of Central Tendency\n\nThis quiz evaluates the students understanding of the measures of central tendency seen in statistics. This quiz is specifically designed to incorporate the measures of central tendency as they relate to psychological research.\n\n##### Terms and Definitions for Statistics\n\nThis quiz covers basic terms and definitions of statistics."
] | [
null
] | {"ft_lang_label":"__label__en","ft_lang_prob":0.89100385,"math_prob":0.96772575,"size":1212,"snap":"2023-40-2023-50","text_gpt3_token_len":235,"char_repetition_ratio":0.12582782,"word_repetition_ratio":0.022099448,"special_character_ratio":0.17739274,"punctuation_ratio":0.073891625,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9913125,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2023-11-28T22:33:59Z\",\"WARC-Record-ID\":\"<urn:uuid:fed39ec9-4cd0-4145-b570-6d4c32bb55ae>\",\"Content-Length\":\"20639\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:2e1de8fa-694d-4526-92f0-0ceaf055e623>\",\"WARC-Concurrent-To\":\"<urn:uuid:d9729214-8737-4d40-80d4-b4a593a7facd>\",\"WARC-IP-Address\":\"104.21.75.23\",\"WARC-Target-URI\":\"https://brainmass.com/statistics/regression-analysis/determining-the-least-squares-trend-equation-6334\",\"WARC-Payload-Digest\":\"sha1:KT5J3K4VCCMIQSRTJD5QLEFIR3FJIHBA\",\"WARC-Block-Digest\":\"sha1:UQNQPJQP4FFABAPXQ25TOHAJTF2UZP4K\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2023/CC-MAIN-2023-50/CC-MAIN-2023-50_segments_1700679100016.39_warc_CC-MAIN-20231128214805-20231129004805-00446.warc.gz\"}"} |
http://www.sklogwiki.org/SklogWiki/index.php?title=Mathematics&diff=prev&oldid=10014 | [
"# Difference between revisions of \"Mathematics\"\n\n\"Important investigations by physicists on the foundations of mechanics are at hand; I refer to the writings of Mach, Hertz, Boltzmann and Volkmann. It is therefore very desirable that the discussion of the foundations of mechanics be taken up by mathematicians also.\"\nDavid Hilbert (excerpt from problem #6 of his lecture \"Mathematical Problems\", delivered before the Second International Congress of Mathematicians in Paris, 1900)\n\nHere are details of mathematical tools that have applications in classical thermodynamics, statistical mechanics and computer simulation techniques.\n\n## Computer assisted mathematics\n\nPackages Program or library Notes License\nBLAS routines Basic Linear Algebra Subprograms free source\nCGAL library Computational Geometry Algorithms Library free, Open Source\nIMSL Numerical Libraries library\nLAPACK routines Linear Algebra PACKage free source\nScaLAPACK library Scalable LAPACK free source\nMagma\nMaple program commercial\nMathematica program commercial\nMath Kernel Library library\nMATLAB program commercial\nMaxima program free (General Public License)\nNAG routines Numerical Algorithms Group commercial\nNumerical Recipes routines\nOctave program free (GNU)"
] | [
null
] | {"ft_lang_label":"__label__en","ft_lang_prob":0.68593365,"math_prob":0.5054794,"size":3020,"snap":"2020-45-2020-50","text_gpt3_token_len":764,"char_repetition_ratio":0.12301061,"word_repetition_ratio":0.009925558,"special_character_ratio":0.22086093,"punctuation_ratio":0.06,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9776506,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2020-12-03T16:25:22Z\",\"WARC-Record-ID\":\"<urn:uuid:ffffb097-8247-4b74-acac-57e40cbbd2fe>\",\"Content-Length\":\"34054\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:f11c4177-0686-4928-bbdd-bc568cb29cb4>\",\"WARC-Concurrent-To\":\"<urn:uuid:3ab56912-0a5e-44bc-86c4-6eb68dc823e1>\",\"WARC-IP-Address\":\"62.204.197.178\",\"WARC-Target-URI\":\"http://www.sklogwiki.org/SklogWiki/index.php?title=Mathematics&diff=prev&oldid=10014\",\"WARC-Payload-Digest\":\"sha1:TXIRL5VJKCP4IS5UIHQSJ6DRQ5PXRZYW\",\"WARC-Block-Digest\":\"sha1:BXYKLF7BFNLCYGX4PKY2DDJPHRUR2ZC4\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2020/CC-MAIN-2020-50/CC-MAIN-2020-50_segments_1606141729522.82_warc_CC-MAIN-20201203155433-20201203185433-00654.warc.gz\"}"} |
https://oeis.org/A274273 | [
"The OEIS is supported by the many generous donors to the OEIS Foundation.",
null,
"Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)\n A274273 Number of noncomposite areas of a Venn diagram for n multisets. 1\n 1, 2, 8, 50, 392, 3602, 37928, 451250, 5995592, 88073042, 1418137448, 24846302450, 470675213192, 9587626273682, 209000505036968, 4855088300025650, 119739457665173192, 3124793129198573522, 86030517992814720488, 2492084621605727380850, 75769449406015305475592 (list; graph; refs; listen; history; text; internal format)\n OFFSET 0,2 COMMENTS Noncomposite areas are the smallest areas in the figures, those that are not composed of smaller areas. As in the case of sets, we consider a universal multiset U and an area external to all multisets represented in the Venn diagram, the difference between U and the union of the multisets. The difference between the total number of noncomposite areas and the number of disjoint areas in a Venn diagram for n multisets is given by (1 + F(n) + 2*Sum_{i=1..n-1} C(n,i)*F(i)*F(n-i)) - (1 + F(n) + Sum_{i=1..n-1} C(n,i)*F(i)) = Sum_{i=1..n-1} C(n,i)*F(i)*(2*F(n-i)-1), where F(n) is A000670. LINKS Aurelian Radoaca, Properties of Multisets Compared to Sets, unpublished article, 2016, FORMULA a(n) = 1 + F(n) + 2*Sum_{i=1..n-1} C(n,i)*F(i)*F(n-i) for n > 1, where a(0)=1, a(1)=2, and F(i) is A000670. a(n) ~ n!*n / (2*log(2)^(n+2)). - Vaclav Kotesovec, Jul 04 2016 From Peter Bala, May 21 2017: (Start) a(n) = 1 - 2*A000670(n) + A000670(n+1) for n >= 1. G.f.: A(x) = 1 + 2*x/(1 - x)*( 1 + 3*x/(1 - 3*x)*( 1 + 4*x/(1 - 4*x)*( 1 + 5*x/(1 - 5*x)*( 1 + .... (End) a(n) = 1 + (1/2)*Li_{-n-1}(1/2) - Li_{-n}(1/2) = A343583(n) + 1, where Li_{n}x) is the polylogarithm function. - Peter Luschny, Apr 26 2021 EXAMPLE a(0)=1, a(1)=2. MAPLE seq(1 + add(factorial(k)*(stirling2(n+1, k) - 2*stirling2(n, k)), k = 0..n+1), n = 1..20); # Peter Bala, May 21 2017 MATHEMATICA F = 1; F[n_] := F[n] = Sum[Binomial[n, k] F[n - k], {k, 1, n}]; a := 1; a[n_] := 1 + F[n] + 2 Sum[Binomial[n, i] F[i] F[n - i], {i, 1, n - 1}]; Table[a[n], {n, 0, 20}] CROSSREFS Cf. A000670, A343583. Sequence in context: A360949 A231352 A186182 * A121677 A120956 A000557 Adjacent sequences: A274270 A274271 A274272 * A274274 A274275 A274276 KEYWORD nonn,easy AUTHOR Aurelian Radoaca, Jun 17 2016 STATUS approved\n\nLookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam\nContribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents\nThe OEIS Community | Maintained by The OEIS Foundation Inc.\n\nLast modified March 22 18:34 EDT 2023. Contains 361432 sequences. (Running on oeis4.)"
] | [
null,
"https://oeis.org/banner2021.jpg",
null
] | {"ft_lang_label":"__label__en","ft_lang_prob":0.52714396,"math_prob":0.99236125,"size":2309,"snap":"2023-14-2023-23","text_gpt3_token_len":983,"char_repetition_ratio":0.097180046,"word_repetition_ratio":0.0050251256,"special_character_ratio":0.5591165,"punctuation_ratio":0.20626152,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.99908257,"pos_list":[0,1,2],"im_url_duplicate_count":[null,null,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2023-03-22T22:40:45Z\",\"WARC-Record-ID\":\"<urn:uuid:4dba5aa1-71ef-4110-8a64-44aef95e3524>\",\"Content-Length\":\"17882\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:ceaca5f9-a745-4b05-898e-d9a25f48c9e8>\",\"WARC-Concurrent-To\":\"<urn:uuid:39ec8345-167b-421f-81d8-04bfc7449188>\",\"WARC-IP-Address\":\"104.239.138.29\",\"WARC-Target-URI\":\"https://oeis.org/A274273\",\"WARC-Payload-Digest\":\"sha1:RX3HEJSHFPRCDDJEU3ESOAIFHCUEZXLM\",\"WARC-Block-Digest\":\"sha1:SW6YT6NTHPDXORRBVBZOJV36UI4D2FOR\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2023/CC-MAIN-2023-14/CC-MAIN-2023-14_segments_1679296944452.97_warc_CC-MAIN-20230322211955-20230323001955-00567.warc.gz\"}"} |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.