URL
stringlengths 15
1.68k
| text_list
listlengths 1
199
| image_list
listlengths 1
199
| metadata
stringlengths 1.19k
3.08k
|
---|---|---|---|
https://www.skillsugar.com/how-to-convert-a-string-to-a-number-in-javascript
|
[
"# How to Convert a String to a Number in JavaScript",
null,
"Converting a string to a number is a fundamental aspect of programming in JavaScript or any other major programming language for that matter.\n\nFortunately, JavaScript provides several options for converting strings into numbers. In this article, we will go through some of the ways we can achieve this.\n\n## The Number() Constructor\n\nThe easiest and most readable way to convert a string to a number is to pass it into the JavaScript `Number` constructor. Just pass the string as the first argument in `Number` function.\n\n``````var string = '123';\nvar num = Number(string);\n``````\n``````123\n``````\n\nNote - `Number` removes decimal places and will give a `NaN` error if any other separators are included in the string to be converted.\n\n``````Number('20,000') //NaN\nNumber('20.00') //20\n``````\n\n## .parseInt()\n\n`parseInt` works just like `Number`, except we can pass a second argument to convert the string into non-decimal numerical systems such as binary. `parseInt` will also treat non `.` (dot) separators as a decimal place also.\n\n``````parseInt('222');\n``````\n``````222\n``````\n``````parseInt('222.222'); // decimal place will be removed\n``````\n``````222\n``````\n``````parseInt('222kk222'); // everything after first non number is cut\n``````\n``````222\n``````\n``````parseInt(\"0xF\", 16); // convert hexadecimal\n``````\n``````15\n``````\n``````parseInt('s123'); // strings starting with non-numerical value will return NaN\n``````\n``````NaN\n``````\n\n## .parseFloat()\n\n`parseFloat` will preserve floating-point numbers as they are converted from strings.\n\n``````parseFloat('222');\n``````\n``````222\n``````\n``````parseFloat('22.02');\n``````\n``````22.02\n``````\n``````parseFloat('22.00'); // decimal place is removed from floating points consisting of only zeros.\n``````\n``````22\n``````\n\nJust like with `parseInt`, everything after a non-numerical value is removed and strings starting with a non-numerical value will be returned as `NaN`.\n\n``````parseFloat('222kk222'); // everything after first non number is cut\n``````\n``````222\n``````\n``````parseFloat('kk222');\n``````\n``````NaN\n``````\n\n## Math.floor()\n\n`Math.floor` will accept strings making it a convenient way to round-down floating point numerical strings into number objects in JavaScript. You will need to make sure the string has no non-numerical values in it beforehand though.\n\n``````Math.floor('22.72');\n``````\n``````22\n``````\n\nIf there are any non-numerical characters in the string it will output `NaN`.\n\n``````Math.floor('22.72');\n``````\n``````NaN\n``````\n\n## Math.ceil()\n\n`Math.ceil` will also accept strings and convert them into number objects, making it a clean way to simultaneously convert a numerical string and round it up. It has the same behaviour as `Math.floor` in terms of what numerical strings it will accept.\n\n``````Math.ceil('22.22');\n``````\n``````23\n``````\n\n## Multiply by 1\n\nYou can also simply times the numerical string by 1 and JavaScript will turn it into a number object. Of course, the numerical string must be formatted correctly before multiplying it.\n\n``````var string = '22.72';\nstring * 1\n``````\n``````22.72\n``````\n\n## Conclusion\n\nYou now know multiple ways in which you can change a string to a number object in JavaScript and how each function behaves.\n\n#### Related Tutorials",
null,
"### parseString in JavaScript\n\nMarch 16, 2021",
null,
"### How to use the parseInt() Function in JavaScript\n\nJuly 15, 2021",
null,
"### How to Compare Values in JavaScript\n\nAugust 26, 2020",
null,
"### Convert to Lowercase or Uppercase in JavaScript\n\nNovember 09, 2020",
null,
"### How to Parse JSON Data in Python (Read and Write)\n\nSeptember 18, 2020",
null,
"July 15, 2020"
] |
[
null,
"https://www.skillsugar.com/media/image/string-to-number-javascript-1597941320.png",
null,
"https://www.skillsugar.com/media/image/thumb/poster-default.png",
null,
"https://www.skillsugar.com/media/image/thumb/poster-default.png",
null,
"https://www.skillsugar.com/media/image/thumb/poster-default.png",
null,
"https://www.skillsugar.com/media/image/thumb/poster-default.png",
null,
"https://www.skillsugar.com/media/image/thumb/poster-default.png",
null,
"https://www.skillsugar.com/media/image/thumb/poster-default.png",
null
] |
{"ft_lang_label":"__label__en","ft_lang_prob":0.7052668,"math_prob":0.90541804,"size":2808,"snap":"2022-40-2023-06","text_gpt3_token_len":618,"char_repetition_ratio":0.15513553,"word_repetition_ratio":0.034802783,"special_character_ratio":0.25391737,"punctuation_ratio":0.12075472,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9906548,"pos_list":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"im_url_duplicate_count":[null,4,null,null,null,null,null,null,null,null,null,null,null,null,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2023-02-01T08:33:43Z\",\"WARC-Record-ID\":\"<urn:uuid:959ecbcc-58c9-406c-8ccc-c18c1b417682>\",\"Content-Length\":\"38058\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:55910a28-61e5-461a-9709-4ce70775428e>\",\"WARC-Concurrent-To\":\"<urn:uuid:52a132a9-6d18-4516-b6c1-79f572c1076d>\",\"WARC-IP-Address\":\"172.67.201.10\",\"WARC-Target-URI\":\"https://www.skillsugar.com/how-to-convert-a-string-to-a-number-in-javascript\",\"WARC-Payload-Digest\":\"sha1:2HJ3VW62BIELQKSRAD4IZ762WKIZ5OIA\",\"WARC-Block-Digest\":\"sha1:GTHHZN7LUED4JTJZ5WYE32GJLCKPLEJJ\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2023/CC-MAIN-2023-06/CC-MAIN-2023-06_segments_1674764499919.70_warc_CC-MAIN-20230201081311-20230201111311-00670.warc.gz\"}"}
|
https://teamtreehouse.com/community/unit-testing-c-tdd-challenge-task-4-of-4-what-i-have-to-do-on-this
|
[
"## Welcome to the Treehouse Community\n\nThe Treehouse Community is a meeting place for developers, designers, and programmers of all backgrounds and skill levels to get support. Collaborate here on code errors or bugs that you need feedback on, or asking for an extra set of eyes on your latest project. Join thousands of Treehouse students and alumni in the community today. (Note: Only Treehouse students can comment or ask questions, but non-students are welcome to browse our conversations.)\n\n### Looking to learn something new?\n\nTreehouse offers a seven day free trial for new students. Get access to thousands of hours of content and a supportive community. Start your free trial today.",
null,
"# Unit testing C# => TDD Challenge Task 4 of 4 What I have to do on this?\n\nCalculator.cs\n```using System;\n\npublic class Calculator\n{\npublic double Result;\n\npublic Calculator(double number)\n{\nResult = number;\n}\n\n{\nResult += number;\n}\n\npublic void Substract(double number)\n{\nResult -= number;\n}\n}\n```\nCalculatorTests.cs\n```using Xunit;\n\npublic class CalculatorTests\n{\n[Fact]\npublic void Initialization()\n{\nvar expected = 1.1;\nvar target = new Calculator(1.1);\nAssert.Equal(expected, target.Result, 1);\n}\n\n[Fact]\n{\nvar target = new Calculator(1.1);\nvar expected = 3.3;\nAssert.Equal(expected, target.Result, 1);\n}\n[Fact]\npublic void BasicSubtract()\n{\nvar target = new Calculator(1.1);\ntarget.Substract(0.2);\nvar expected = 0.9;\nAssert.Equal(expected, target.Result,9);\n}\n\n}\n```",
null,
""
] |
[
null,
"https://uploads.teamtreehouse.com/production/profile-photos/4350752/micro_I_am.jpg",
null,
"https://uploads.teamtreehouse.com/production/profile-photos/969492/micro_tool_chess_set_2.jpg",
null
] |
{"ft_lang_label":"__label__en","ft_lang_prob":0.81236917,"math_prob":0.78893065,"size":1772,"snap":"2022-40-2023-06","text_gpt3_token_len":433,"char_repetition_ratio":0.1199095,"word_repetition_ratio":0.041044775,"special_character_ratio":0.25620767,"punctuation_ratio":0.18421052,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.97322387,"pos_list":[0,1,2,3,4],"im_url_duplicate_count":[null,9,null,null,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2023-01-28T17:23:41Z\",\"WARC-Record-ID\":\"<urn:uuid:39438397-df05-4652-8636-079dac980440>\",\"Content-Length\":\"96215\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:6f9a3962-3487-42ca-9c79-0d35c80b8396>\",\"WARC-Concurrent-To\":\"<urn:uuid:6e4219ca-21b6-4858-921d-14a8bad1df2f>\",\"WARC-IP-Address\":\"3.94.15.124\",\"WARC-Target-URI\":\"https://teamtreehouse.com/community/unit-testing-c-tdd-challenge-task-4-of-4-what-i-have-to-do-on-this\",\"WARC-Payload-Digest\":\"sha1:P2AJDY6N5WRO4JVQGZTX7XPE5ZEP6CKR\",\"WARC-Block-Digest\":\"sha1:TPEJX52MCD2G6A4IZBPMU6OC3WSL4YOM\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2023/CC-MAIN-2023-06/CC-MAIN-2023-06_segments_1674764499646.23_warc_CC-MAIN-20230128153513-20230128183513-00416.warc.gz\"}"}
|
http://kwlpradio.com/furniture-stores-xhtb/minimum-distance-classifier-example-cf42fc
|
[
"X : vector of image data (n bands) Kernel minimum distance classifier. 0000001757 00000 n 0000003401 00000 n How you'd compute this is quite simple. We can classify the unclassified sample vectors by the help of Minimum Distance to Class Mean Classifier. For new examples decide their class using the discriminant function. (2) Normalized Euclidian distance 0000031171 00000 n 0000006334 00000 n Minimum distance classi er Maximum likelihood classi er. Searches nodes within that range for any points closer to the query point. 0000002917 00000 n 0000003164 00000 n Classification Input File window appears. Context. these examples is to: (a) compare the sample classification accuracy (% samples correct) of a minimum distance classifier, with the vector classifi cation accuracy (% vector correct) of a maximum likeiihood classifier; (b) compare the sample classification accuracy of a parametric with a non parametric minimum distance classifier. 0000002160 00000 n Minimum distance classifier is a parametric classifier, because it is parameterized by the mean of the each class. Face Recognition Face Recognition is the world's simplest face recognition library. %PDF-1.5 %���� 219 0 obj << /Linearized 1.0 /L 1558997 /H [ 51312 636 ] /O 222 /E 51948 /N 27 /T 1554572 /P 0 >> endobj xref 219 29 0000000015 00000 n Module 2 Lecture 3: The maximum likelihood classifier—discriminant function and example 10:58 Module 2 Lecture 4: The minimum distance classifier, background material 3:31 Taught By The metric to use when calculating distance between instances in a feature array. Figure 2 Feature space: + sewing needles, o … In this video I briefly explain what minimum distance is and why it is helpful. Minimum distance classifier (cont.) All pixels are classified to the nearest class unless a standard deviation or distance threshold is specified, in which case some pixels may be unclassified if they do not meet the selected criteria. Creates a minimum distance classifier for the given distance metric. COVID-19 has infected more than 10,000 people in South Korea. As an example, the DN values of two bands are plotted in a scatter diagram in the similar way to minimum distance to mean classifier. The distance metric for the nearest neighbor and minimum-distance classifier is crucial to their predic- tive capabilities. Introduction “Minimum Distance to Class Mean Classifier” is used to classify unclassified sample vectors where the vectors clustered in more than one classes are given. 0000050377 00000 n This should be taken with a grain of salt, as the intuition conveyed by these examples … K Nearest Neighbor and Minimum Distance Classifiers. Some given sample vectors are already classified into different classes and some are not classified. Contribute to pctseng7/minimum-distance-to-class-mean-classifier development by creating an account on GitHub. (7.19) g … For example, if we have two classes, red and green and after calculating the distances and getting the 3 nearest points, from which 2 are red and 1 is green, then the selected class by majority voting is red (2 > 1). This video explain American Backer character set and minimum distance classifier example. Minimum distance to means classification strategy. I'm trying to implement the Minimum Distance Algorithm for image classification using GDAL and Python. Usage Returns; ee.Classifier.minimumDistance(metric) Classifier: Argument Type Details; metric: String, default: \"euclidean\" The distance metric to use. k : mean of the kth class 2. 0000008550 00000 n The measure of resemblance is a … Figure 11.6.4 shows examples of classification with the three distances. 2. 0000042099 00000 n Minimum (Mean) Distance Classifier. I searched a lot but wasnt successful. Parameters metric str or callable. Each class is represented by its centroid, with test samples classified to the class with the nearest centroid. Read more in the User Guide. Minimum Distance Classifier Algorithm Estimate class mean vector and covariance matrix from training samples m i = S j∈Ci X j; C i = E{(X - m i ) (X - m i )T } | X ∈ C i} Compute distance between X and m i X ∈C i if d(X, m i) ≤ d(X,m j) ∀j Compute P(C k |X) = Leave X unclassified if max k P(C k |X) < T min 29 Unlike the first two data sets, wine.mat contains 13 different features, so find_best_features.m can be used to narrow down the two best features to use for classification using the minimum distance to class mean classifier. Minimum distance classi er Training is done using the objects (pixels) of known class The distance is defined as an index of similarity so that the minimum distance is identical to the maximum similarity. The distance is defined as an index of similarity so that the minimum distance is identical to the maximum similarity. 0000004040 00000 n In the following example, the point in a red square is slightly closer to the query point than those within Node 4. Select the image that needs to be classified. (1) Euclidian distance 0000005810 00000 n Specifically in minimum distance classification a sample (i.e. minimum distance classifier free download. •In practice, the classifier works well when the distance between means is large compared to the spread of each class. Next, we will go through the process step by step. After calculating the mean pixel-value of the sample areas and storing them into a list of arrays (\"sample_array\"), I read the image into an array called \"values\". It allows you to recognize and ma Classifier comparison¶ A comparison of a several classifiers in scikit-learn on synthetic datasets. 0000045491 00000 n Nearest centroid classifier. 0000001849 00000 n b) Parallelepiped Classifier: The parallelepiped classification strategy is also computationally simple and efficient. The following distances are often used in this procedure. trailer << /Size 248 /Prev 1554561 /Root 220 0 R /Info 218 0 R /ID [ <2C2AEE9B16AF003F4E9E6E933A975BAD> ] >> startxref 0 %%EOF 220 0 obj <> endobj 221 0 obj <<>> endobj 222 0 obj <>/XObject<>/ProcSet[/PDF /Text/ImageC]>>/Group<>/Annots[227 0 R 226 0 R 225 0 R 224 0 R 223 0 R]>> endobj 223 0 obj <>>> endobj 224 0 obj <>>> endobj 225 0 obj <>>> endobj 226 0 obj <>>> endobj 227 0 obj <>>> endobj 228 0 obj <> endobj 229 0 obj <> endobj 230 0 obj <>/W[1[190 302 405 405 204 286 204 455 476 476 476 476 476 269 840 613 673 709 558 532 704 550 853 546 612 483 641 705 876 406 489 405 497 420 262 438 495 238 448 231 753 500 492 490 324 345 294 487 421 639 431 1015 484 561]]/FontDescriptor 237 0 R>> endobj 231 0 obj <> endobj 232 0 obj <>/W[1[160 142 558 642 680 663 505 813 566 443 852 368 447 371 455 378 395 202 407 195 704 458 455 283 310 255 446 426]]/FontDescriptor 236 0 R>> endobj 233 0 obj <> endobj 234 0 obj <> endobj 235 0 obj <> endobj 236 0 obj <> endobj 237 0 obj <> endobj 238 0 obj <> stream k = [ m1, m2, .... mn]. 0000002673 00000 n 0000005988 00000 n 0000006161 00000 n 0000050899 00000 n and just found in matlab group of vectors) is classified into the class whose known or estimated distribution most closely resembles the estimated distribution of the sample to be classified. •This occurs seldom unless the system designer controls the nature of the input. where 0000001871 00000 n I need minimum euclidean distance algorithm in python to use for a data set which has 72 examples and 5128 features. 0000004695 00000 n The Normalized Euclidian distance is proportional to the similarity in dex, as shown in Figure 11.6.2, in the case of difference variance. (3) Mahalanobis distance 4). 0000005628 00000 n 0000004173 00000 n One of the key ingredients of KMD is the definition of kernel-induced distance measures. The minimum distance classifier is used to classify unknown image data to classes which minimize the distance between the image data and the class in multi-feature space. KCDC (Korea Centers for Disease Control & Prevention) announces the information of COVID-19 quickly and transparently. Minimum distance classifies image data on a database file using a set of 256 possible class signature segments as specified by signature parameter. Only the mean … Minimum Distance Classifier Example ( ) ( ) ( ) 2.8 1 2 8.9 0 12 1 2 = + − = = − x x d x d x d x The decision functions are ( ) 4.3 1.3 10.1 2 1 1 2 1 1 1 1 = + − = − x x d x x m mT m The decision boundary is Class Iris setosa Class Iris versicolor 2 1 ⇒ ⇒ ω ω = = 0.3 1.5 and 1.3 4.3 m 1 m 2 ( … In your training set, you have a set of training examples with each example belonging to a particular class. 0000004562 00000 n 11.6 Minimum Distance Classifier. The Euclidian distance is theoretically identical to the similarity index. The dotted line is the optimal classifier for equiprobable classes, and a common covariance of a more general form, different than σ 2 I (minimum Mahalanobis distance classifier). 0000004979 00000 n Each segment specified in signature, for example, stores signature data pertaining to a particular class. These points will define the class of the new observation by majority voting. 17 C. Nikou –Digital Image Processing Minimum distance classifier (cont.) In this example, only Node 3 overlaps the solid black circle centered at the query point with radius equal to the distance to the closest points within Node 4. t��:ޔ�ۼ`T��k�;*L99����oގ�� �����j�M�實�Pu '�NH�߭'�o�\\�e Ed�q���,��f\\�O� V�uX͔��f5�r�&,E@�aKͧ-�t?x�v���&��g�#�н��4�nb�8>�. Examples JavaScript // Your example goes here! x��Zَ\\�}��Ǟ���@0Kw �=��D� k-means clustering is a method of vector quantization, originally from signal processing, that aims to partition n observations into k clusters in which each observation belongs to the cluster with the nearest mean (cluster centers or cluster centroid), serving as a prototype of the cluster.This results in a partitioning of the data space into Voronoi cells. The main idea is that for a new observation we search the K nearest point (with minimum distance). minimum-distance-to-means classification A remote sensing classification system in which the mean point in digital parameter space is calculated for pixels of known classes, and unknown pixels are then assigned to the class which is arithmetically closest when digital number values of the different bands are plotted. 0000002421 00000 n E ects of Distance Measure Choice on KNN Classi er Performance - A Review V. B. Surya Prasatha,b,c,d,, Haneen Arafat Abu Alfeilat e, Ahmad B. Is used in cases where the variances of the population classes are different to each other. By doing this, the classifier simply boils down to finding the smallest distance from a training sample x to each of the other classes represented by their mean vectors. In cases where there is correlation between the axes in feature space, the Mahalanobis distance with variance-covariance matrix, should be used as shown in Figure 11.6.3. So, we have made sure that minimum distance is the right algorithm. Given a data set S = {x 1, …, x l} sampled from the input space X, a kernel K (x, y) and a function Φ in a feature space satisfy K (x, y) = Φ (x) T Φ (y). Here we first consider a set of simple supervised classification algorithms that assign an unlabeled sample to one of the known classes based on set of training samples, where each sample is labeled by , indicating it belongs to class .. k Nearest neighbors (k-NN) Classifier The minimum distance classifier is used to classify unknown image data to classes which minimize the distance between the image data and the class in multi-feature space. Your training set, you have a set of training examples with each example belonging a... You have a set of training examples with each example belonging to a class. Has infected more than 10,000 people in South Korea is identical to spread! The world 's simplest face Recognition is the right algorithm class minimum distance classi er is! Definition of kernel-induced distance measures instances minimum distance classifier example a red square is slightly closer to the query.. The co-variance matrix is identity, stores signature data pertaining to a particular class the key of. Found in matlab classifier comparison¶ a comparison of a several classifiers in scikit-learn on synthetic datasets large compared to similarity... The Parallelepiped classification strategy is also computationally simple and efficient ) announces the information of covid-19 quickly and transparently C1! The distance between means is large compared to the query point tive capabilities the example problem! Classifier comparison¶ a comparison of a several classifiers in minimum distance classifier example on synthetic datasets of different.! ) Euclidian distance is defined as an index of similarity so that the minimum distance classifier (.! Discriminant function the concept of a several classifiers in scikit-learn on synthetic datasets distance metric a... Copyright & copy 1996 Japan Association of Remote Sensing All rights reserved of KMD is the minimum distance classifier example.! 5128 features Bayes classifier when the co-variance matrix is identity Parallelepiped classification is. Has infected more than 10,000 people in South Korea that for a data set which has 72 examples 5128! The distance is theoretically identical to the spread of each class are already classified into different and. Recognition is the definition of kernel-induced distance measures any points closer to the query point than those within Node.. The Euclidian distance is used in cases where the variances of the each.. Briefly explain what minimum distance classification a sample ( i.e boundaries of different classifiers explain what minimum distance is definition! Distance algorithm in python to use when calculating distance between means is large compared to the spread each... Will define the class with the nearest centroid minimum distance classi er training is done the... Seldom unless the system designer controls the nature of the Bayes classifier when distance! A minimum distance classi er training is done using the discriminant function:!, stores signature data pertaining to a particular class ) to start the classification process in choose... And as shown in figure 2 distance classification ( fig: + sewing needles, o for. In figure 2 Feature space: + sewing needles, o … for new examples their. Mean classifier training examples with each example belonging to a particular class minimum distance classifier example explain American character. Search the K nearest point ( with minimum distance ) ( fig ) of known class minimum classi. … minimum distance is identical to the maximum similarity the process step step. As an index of similarity so that the minimum distance ) way '' and the ``.. Rights reserved of covid-19 quickly and transparently with each example belonging to a particular class ) ܻm��U�g��mk��ѻ�2�4���\\^�0^n������'�q... The example classification problem given above, and as shown in figure 2 is large compared to query! A particular class the classification process in Toolbox choose Classification→Supervised Classification→Minimum distance a! Process in Toolbox choose Classification→Supervised Classification→Minimum distance classification ( fig known class minimum classifier! Using the discriminant function of training examples with each example belonging to a particular class ( pixels of... And why it is special case of the key ingredients of KMD is the 's! A Feature array process step by step algorithm in python to use when distance... ) of known class minimum distance classifier ( cont. python to use for a observation! Class of the Bayes classifier when the distance between means is large compared the... Set of training examples with each example belonging to a particular class Classification→Supervised Classification→Minimum distance classification sample... Controls the nature of the new observation we search the K nearest point ( with distance... Is to illustrate the nature of the population classes are different to each other classified into different and! People in South Korea by creating an account on GitHub is also computationally and... Unclassified sample vectors by the help of minimum distance ) training set, you have a set of examples. C. Nikou –Digital Image minimum distance classifier example minimum distance is defined as an index of similarity so the... A data set which has 72 examples and 5128 features class with the three distances than those Node! Is that for a data set which has 72 examples and 5128 features nearest. `` shortcut. of KMD is the right algorithm given distance metric that for a new observation by majority.... Have a set of training examples with each example belonging to a particular class cont. simple and.... 'S simplest face Recognition library 1996 Japan Association of Remote Sensing All reserved. It is special case of the Bayes classifier when the co-variance matrix is identity some given sample are... With the three distances the following distances are often used in cases where the variances of key!\n\nBlf213-b1 Installation Manual, Ovarian Stroma Function, Panzer Ii Dak, How To Read Pregnancy Ultrasound Report, How To Reset Nissan Altima 2015, Dark Grey Caulk, Qualcast Classic 35s Service Kit, Uconn C Logo, Williams, Az Map, Black Mage Armor Skyrim Se,"
] |
[
null
] |
{"ft_lang_label":"__label__en","ft_lang_prob":0.8166343,"math_prob":0.95583034,"size":17261,"snap":"2021-04-2021-17","text_gpt3_token_len":4129,"char_repetition_ratio":0.20258446,"word_repetition_ratio":0.1507431,"special_character_ratio":0.26551184,"punctuation_ratio":0.09820019,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.97632164,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2021-04-16T16:36:25Z\",\"WARC-Record-ID\":\"<urn:uuid:d1c8e03e-a57d-4194-8850-5e1966a7f0bb>\",\"Content-Length\":\"30388\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:9ce12d67-8782-4f43-ae9d-3f83067e487b>\",\"WARC-Concurrent-To\":\"<urn:uuid:3a085b7c-b6a4-4d23-97ea-f9912d2e3b6e>\",\"WARC-IP-Address\":\"198.24.138.36\",\"WARC-Target-URI\":\"http://kwlpradio.com/furniture-stores-xhtb/minimum-distance-classifier-example-cf42fc\",\"WARC-Payload-Digest\":\"sha1:Y654BKDLT7G4QGFU45KAN6NOOFYXEZT7\",\"WARC-Block-Digest\":\"sha1:DXWWLFE4IKFBHXFTYZVD2GXGT5VXSUTO\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2021/CC-MAIN-2021-17/CC-MAIN-2021-17_segments_1618038088245.37_warc_CC-MAIN-20210416161217-20210416191217-00199.warc.gz\"}"}
|
https://forums.studentdoctor.net/threads/hesss-law-question.293657/
|
[
"# Hess's Law question...\n\nB\n\n#### beastly115\n\nH2O(g) → H2O(l) ∆H (kJ/mole) = 44\nC(s) + O2(g) → CO2(g) 394\nH2(g) + 1/2O2(g) → H2O(l) 286\nC2H5OH(l)+ 3O2(g) → 2CO2(g) + 3H2O(l) 1367\n\nCalculate the enthalpy change for the reaction:\n2C(s) + 2H2(g) + H2O(l) → C2H5OH(l)\nA. 226 kJ/mole\nB. +7 kJ/mole\nC. +109 kJ/mole\nD. +344 kJ/mole\nE. +687 kJ/mole\n\n-------------------------------\n\nThe answer is B, but in the answer the first rxn where H2O(g) goes to H2O(l) is not involved in the calculation to arrive at choice B. Why not?\n\nThanks.\n\n#### armorshell\n\n##### One Man Freak Show\nModerator Emeritus\n10+ Year Member\nBecause that value is used in the next question",
null,
"#### checkamundo\n\n##### Don't know what i'm doing\n10+ Year Member\n5+ Year Member\nYou only have to use the rxns that will give you the final rxn with the appropriate coefficients. You don't need to use the first rxn to get the final rxn given. If you had used the first rxn, there's no other reaction that has H2O(g) so you wouldn't be able to cancel it out to get the final reaction.\n\nB\n\n#### beastly115\n\ncheckamundo said:\nYou only have to use the rxns that will give you the final rxn with the appropriate coefficients. You don't need to use the first rxn to get the final rxn given. If you had used the first rxn, there's no other reaction that has H2O(g) so you wouldn't be able to cancel it out to get the final reaction.\n\nOk thanks.\n\n#### asckwan\n\n##### Member\n10+ Year Member\n5+ Year Member\nCould someone give a detailed calculation please?\n\nB\n\n#### beastly115\n\n2 C(s) + 2 O2(g) → 2 CO2(g) 2(394)\nH2(g) + O2(g) → 2 H2O(l) 2(286)\n2 CO2(g) + 3 H2O(l) → C2H5OH(l)+ 3 O2(g) (1367)\n________________________________________________________________________________\n2 C(s) + 2 H2(g) + H2O(l) → C2H5OH(l) ∆H= 2(394) + 2(286) (1367)\n\n#### Rock23\n\n##### Member\n10+ Year Member\non this question the kaplan book says to that you have to use the enthalpy of the products minus the enthalpy of the reactants. if we did that though you wouldnt come out to the same answer.",
null,
"10+ Year Member\n7+ Year Member\nyeah you would\n\n#### OSUDDS\n\n##### Senior Member\n10+ Year Member\nChga said:\nyeah you would\nNo, one way you get -7, the other way +7....\n\n#### tom_servo_dds\n\n##### Senior Member\n10+ Year Member\nOSUDDS said:\nNo, one way you get -7, the other way +7....\n\nProduct = 1367\nReactants = 2(-394) + 2(-286)\n\n1367 - 1360 = 7+\n\nThis thread is more than 15 years old.\n\nYour message may be considered spam for the following reasons:"
] |
[
null,
"data:image/gif;base64,R0lGODlhAQABAIAAAAAAAP///yH5BAEAAAAALAAAAAABAAEAAAIBRAA7",
null,
"data:image/gif;base64,R0lGODlhAQABAIAAAAAAAP///yH5BAEAAAAALAAAAAABAAEAAAIBRAA7",
null
] |
{"ft_lang_label":"__label__en","ft_lang_prob":0.6492094,"math_prob":0.9137402,"size":934,"snap":"2021-43-2021-49","text_gpt3_token_len":420,"char_repetition_ratio":0.22688173,"word_repetition_ratio":0.9202454,"special_character_ratio":0.49357602,"punctuation_ratio":0.094339624,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.95911354,"pos_list":[0,1,2,3,4],"im_url_duplicate_count":[null,null,null,null,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2021-12-09T13:03:42Z\",\"WARC-Record-ID\":\"<urn:uuid:a80a76c8-d45b-4d36-b773-4d9bfff4b903>\",\"Content-Length\":\"180358\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:bd9200b1-3fcd-4aff-86a1-c93b4f4349f7>\",\"WARC-Concurrent-To\":\"<urn:uuid:5629565b-daf5-4729-ad63-9b63d1f125ee>\",\"WARC-IP-Address\":\"104.20.11.156\",\"WARC-Target-URI\":\"https://forums.studentdoctor.net/threads/hesss-law-question.293657/\",\"WARC-Payload-Digest\":\"sha1:BL2IL7KYPHRSRTMUK2UPEO5CHHCBRVYS\",\"WARC-Block-Digest\":\"sha1:HKE3JZRYSDWIYSEA4VERS7UCO6COILQR\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2021/CC-MAIN-2021-49/CC-MAIN-2021-49_segments_1637964364169.99_warc_CC-MAIN-20211209122503-20211209152503-00181.warc.gz\"}"}
|
https://ericmarcon.github.io/entropart/reference/Hqz.html
|
[
"Calculates the entropy of order $$q$$ of a probability vector according to a similarity matrix.\n\nHqz(NorP, q = 1, Z = diag(length(NorP)), ...)\nbcHqz(Ns, q = 1, Z = diag(length(Ns)), Correction = \"Best\", SampleCoverage = NULL,\nCheckArguments = TRUE)\n# S3 method for ProbaVector\nHqz(NorP, q = 1, Z = diag(length(NorP)),\n..., CheckArguments = TRUE, Ps = NULL)\n# S3 method for AbdVector\nHqz(NorP, q = 1, Z = diag(length(NorP)), Correction = \"Best\",\n..., CheckArguments = TRUE, Ns = NULL)\n# S3 method for integer\nHqz(NorP, q = 1, Z = diag(length(NorP)), Correction = \"Best\",\n..., CheckArguments = TRUE, Ns = NULL)\n# S3 method for numeric\nHqz(NorP, q = 1, Z = diag(length(NorP)), Correction = \"Best\",\n..., CheckArguments = TRUE, Ps = NULL, Ns = NULL)\n\n## Arguments\n\nPs\n\nA probability vector, summing to 1.\n\nNs\n\nA numeric vector containing species abundances.\n\nNorP\n\nA numeric vector, an integer vector, an abundance vector (AbdVector) or a probability vector (ProbaVector). Contains either abundances or probabilities.\n\nq\n\nA number: the order of entropy. Default is 1.\n\nZ\n\nA relatedness matrix, i.e. a square matrix whose terms are all positive, strictly positive on the diagonal. Generally, the matrix is a similarity matrix, i.e. the diagonal terms equal 1 and other terms are between 0 and 1. Default is the identity matrix to calculate neutral entropy.\n\nCorrection\n\nA string containing one of the possible corrections: \"None\" (no correction), \"ChaoShen\", \"MarconZhang\" or \"Best\", the default value. The \"MarconZhang\" correction assumes a similarity matrix.\n\nSampleCoverage\n\nThe sample coverage of Ns calculated elsewhere. Used to calculate the gamma diversity of meta-communities, see details.\n\n...\n\nCheckArguments\n\nLogical; if TRUE, the function arguments are verified. Should be set to FALSE to save time when the arguments have been checked elsewhere.\n\n## Details\n\nEntropy is calculated following Leinster and Cobbold (2012) after Ricotta and Szeidl (2006): it is the entropy of order q of the community, using species ordinariness as the information function.\n\nA similarity matrix is used (as for Dqz), not a distance matrix as in Ricotta and Szeidl (2006). See the example.\n\nBias correction requires the number of individuals. Use bcHqz and choose the Correction. Correction techniques are from Marcon et al. (2014).\n\nCurrently, the \"Best\" correction is the max value of \"ChaoShen\" and \"MarconZhang\".\n\nThe functions are designed to be used as simply as possible. Hqz is a generic method. If its first argument is an abundance vector, an integer vector or a numeric vector which does not sum to 1, the bias corrected function bcHqz is called. Explicit calls to bcHqz (with bias correction) or to Hqz.ProbaVector (without correction) are possible to avoid ambiguity. The .integer and .numeric methods accept Ps or Ns arguments instead of NorP for backward compatibility.\n\nThe size of a metacommunity (see MetaCommunity) is unknown so it has to be set according to a rule which does not ensure that its abundances are integer values. Then, classical bias-correction methods do not apply. Providing the SampleCoverage argument allows applying the \"ChaoShen\" correction to estimate quite well the entropy. DivPart and GammaEntropy functions use this tweak.\n\n## Value\n\nA named number equal to the calculated entropy. The name is that of the bias correction used.\n\nDqz, PhyloEntropy\n\n## Examples\n\n# Load Paracou data (number of trees per species in two 1-ha plot of a tropical forest)\ndata(Paracou618)\n# Prepare the similarity matrix\nDistanceMatrix <- as.matrix(EightSpTree\\$Wdist^2/2)\n# Similarity can be 1 minus normalized distances between species\nZ <- 1 - DistanceMatrix/max(DistanceMatrix)\n# Calculate diversity of order 2\nPs <- EightSpAbundance/sum(EightSpAbundance)\nHqz(Ps, 2, Z)\n#> None\n#> 0.6033223\n# Equal to normalized Rao quadratic entropy when q=2\nRao(Ps, EightSpTree)/max(DistanceMatrix)\n#> None\n#> 0.6033223\n# But different from PhyloEntropy for all other q, e.g. 1\nHqz(Ps, 1, Z)\n#> None\n#> 0.9348275\nsummary(PhyloEntropy(Ps, 1, EightSpTree))\n#> alpha or gamma phylogenetic or functional entropy of order 1 of distribution -\n#> with correction: None\n#> Phylogenetic or functional entropy was calculated according to the tree\n#> EightSpTree\n#>\n#> Entropy is normalized\n#>\n#> Entropy equals: 1.034531"
] |
[
null
] |
{"ft_lang_label":"__label__en","ft_lang_prob":0.7902177,"math_prob":0.9865823,"size":4666,"snap":"2022-27-2022-33","text_gpt3_token_len":1263,"char_repetition_ratio":0.11926212,"word_repetition_ratio":0.08228731,"special_character_ratio":0.2584655,"punctuation_ratio":0.18233944,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9974006,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2022-07-06T13:53:02Z\",\"WARC-Record-ID\":\"<urn:uuid:90e6c0b8-aff7-4820-8e41-a1dd482f3a6a>\",\"Content-Length\":\"22057\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:10f1e587-106e-4895-b615-aac546b3c24e>\",\"WARC-Concurrent-To\":\"<urn:uuid:cb71db3e-7ace-4126-bbd5-89d6c22bbbe2>\",\"WARC-IP-Address\":\"185.199.110.153\",\"WARC-Target-URI\":\"https://ericmarcon.github.io/entropart/reference/Hqz.html\",\"WARC-Payload-Digest\":\"sha1:DLFKLMGLDN7WXRYCY7PGCUTXBZ5FC5XM\",\"WARC-Block-Digest\":\"sha1:P6WDW7QYELWS6VNGMTQABBX6TBVHDI5W\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2022/CC-MAIN-2022-27/CC-MAIN-2022-27_segments_1656104672585.89_warc_CC-MAIN-20220706121103-20220706151103-00209.warc.gz\"}"}
|
https://convertoctopus.com/23-3-pounds-to-kilograms
|
[
"## Conversion formula\n\nThe conversion factor from pounds to kilograms is 0.45359237, which means that 1 pound is equal to 0.45359237 kilograms:\n\n1 lb = 0.45359237 kg\n\nTo convert 23.3 pounds into kilograms we have to multiply 23.3 by the conversion factor in order to get the mass amount from pounds to kilograms. We can also form a simple proportion to calculate the result:\n\n1 lb → 0.45359237 kg\n\n23.3 lb → M(kg)\n\nSolve the above proportion to obtain the mass M in kilograms:\n\nM(kg) = 23.3 lb × 0.45359237 kg\n\nM(kg) = 10.568702221 kg\n\nThe final result is:\n\n23.3 lb → 10.568702221 kg\n\nWe conclude that 23.3 pounds is equivalent to 10.568702221 kilograms:\n\n23.3 pounds = 10.568702221 kilograms\n\n## Alternative conversion\n\nWe can also convert by utilizing the inverse value of the conversion factor. In this case 1 kilogram is equal to 0.09461899664587 × 23.3 pounds.\n\nAnother way is saying that 23.3 pounds is equal to 1 ÷ 0.09461899664587 kilograms.\n\n## Approximate result\n\nFor practical purposes we can round our final result to an approximate numerical value. We can say that twenty-three point three pounds is approximately ten point five six nine kilograms:\n\n23.3 lb ≅ 10.569 kg\n\nAn alternative is also that one kilogram is approximately zero point zero nine five times twenty-three point three pounds.\n\n## Conversion table\n\n### pounds to kilograms chart\n\nFor quick reference purposes, below is the conversion table you can use to convert from pounds to kilograms\n\npounds (lb) kilograms (kg)\n24.3 pounds 11.022 kilograms\n25.3 pounds 11.476 kilograms\n26.3 pounds 11.929 kilograms\n27.3 pounds 12.383 kilograms\n28.3 pounds 12.837 kilograms\n29.3 pounds 13.29 kilograms\n30.3 pounds 13.744 kilograms\n31.3 pounds 14.197 kilograms\n32.3 pounds 14.651 kilograms\n33.3 pounds 15.105 kilograms"
] |
[
null
] |
{"ft_lang_label":"__label__en","ft_lang_prob":0.75505066,"math_prob":0.9972726,"size":1782,"snap":"2020-45-2020-50","text_gpt3_token_len":490,"char_repetition_ratio":0.22440945,"word_repetition_ratio":0.0,"special_character_ratio":0.34904602,"punctuation_ratio":0.14854111,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9964479,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2020-12-04T07:29:36Z\",\"WARC-Record-ID\":\"<urn:uuid:0dfeb012-5c12-45dc-bfea-ca23d9048376>\",\"Content-Length\":\"28330\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:ff1426ab-6de3-4766-a9de-8aba269ece79>\",\"WARC-Concurrent-To\":\"<urn:uuid:20006d0e-6625-4863-8bfe-cea83fb84b6a>\",\"WARC-IP-Address\":\"104.27.143.66\",\"WARC-Target-URI\":\"https://convertoctopus.com/23-3-pounds-to-kilograms\",\"WARC-Payload-Digest\":\"sha1:IVU3R6UHKVALLECAOSKURTH43PT5EIBG\",\"WARC-Block-Digest\":\"sha1:EO27UOTV3AIA5DY2QPGXX3723EFNAR5C\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2020/CC-MAIN-2020-50/CC-MAIN-2020-50_segments_1606141735395.99_warc_CC-MAIN-20201204071014-20201204101014-00649.warc.gz\"}"}
|
https://www.ellibs.com/book/9781118909379/continuum-mechanics-the-birthplace-of-mathematical-models
|
[
"# Continuum Mechanics: The Birthplace of Mathematical Models\n\n94,05€\n\nISBN: 9781118909348\nDRM Restrictions\n\nPrinting 91 pages with an additional page accrued every 8 hours, capped at 91 pages 5 excerpts\n\nPresents a self-contained introduction to continuum mechanics that illustrates how many of the important partial differential equations of applied mathematics arise from continuum modeling principles\n\nWritten as an accessible introduction, Continuum Mechanics: The Birthplace of Mathematical Models provides a comprehensive foundation for mathematical models used in fluid mechanics, solid mechanics, and heat transfer. The book features derivations of commonly used differential equations based on the fundamental continuum mechanical concepts encountered in various fields, such as engineering, physics, and geophysics.\n\nThe book begins with geometric, algebraic, and analytical foundations before introducing topics in kinematics. The book then addresses balance laws, constitutive relations, and constitutive theory. Finally, the book presents an approach to multiconstituent continua based on mixture theory to illustrate how phenomena, such as diffusion and porous-media flow, obey continuum-mechanical principles.\n\nContinuum Mechanics: The Birthplace of Mathematical Models features:\n\n• Direct vector and tensor notation to minimize the reliance on particular coordinate systems when presenting the theory\n• Terminology that is aligned with standard courses in vector calculus and linear algebra\n• The use of Cartesian coordinates in the examples and problems to provide readers with a familiar setting\n• Over 200 exercises and problems with hints and solutions in an appendix\n• Introductions to constitutive theory and multiconstituent continua, which are distinctive for books at this level\nContinuum Mechanics: The Birthplace of Mathematical Models is an ideal textbook for courses on continuum mechanics for upper-undergraduate mathematics majors and graduate students in applied mathematics, mechanical engineering, civil engineering, physics, and geophysics. The book is also an excellent reference for professional mathematicians, physical scientists, and engineers.\n\nKeywords:\n\ncontinuum mechanics; partial differential equations; mathematical modeling; applied mathematics; mathematics; engineering; physics; geophysics; fluid mechanics; solid mechanics; heat transfer; porous media\n\n, Computational / Numerical Methods, Numerical Methods & Algorithms, Computational / Numerical Methods, Numerical Methods & Algorithms\nAuthor(s)\nPublisher\nJohn Wiley and Sons, Inc.\nPublication year\n2015\nLanguage\nen\nEdition\n1\nPage amount\n304 pages\nCategory\nNatural Sciences\nFormat\nEbook\neISBN (ePUB)\n9781118909348\nPrinted ISBN\n9781118909379"
] |
[
null
] |
{"ft_lang_label":"__label__en","ft_lang_prob":0.8197802,"math_prob":0.66563433,"size":2487,"snap":"2022-05-2022-21","text_gpt3_token_len":480,"char_repetition_ratio":0.141764,"word_repetition_ratio":0.14071856,"special_character_ratio":0.18737435,"punctuation_ratio":0.15176152,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9932633,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2022-05-26T21:42:00Z\",\"WARC-Record-ID\":\"<urn:uuid:b4499122-df9a-4dcc-a175-7feda3935e75>\",\"Content-Length\":\"27725\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:7df32d5d-e301-40ac-a1ee-45c22b3e1dc4>\",\"WARC-Concurrent-To\":\"<urn:uuid:9583bdef-a95b-4e32-9492-1d57397ff918>\",\"WARC-IP-Address\":\"62.44.201.222\",\"WARC-Target-URI\":\"https://www.ellibs.com/book/9781118909379/continuum-mechanics-the-birthplace-of-mathematical-models\",\"WARC-Payload-Digest\":\"sha1:POAYGWPPQVWNODJG4TSOENCBTAYWQ3LW\",\"WARC-Block-Digest\":\"sha1:HFT6IKMU5AOUUTGGEY3HYJRSFHJS4M4Z\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2022/CC-MAIN-2022-21/CC-MAIN-2022-21_segments_1652662625600.87_warc_CC-MAIN-20220526193923-20220526223923-00716.warc.gz\"}"}
|
https://www-history.mcs.st-andrews.ac.uk/Curves/Ellipse.html
|
[
"# Ellipse",
null,
"Cartesian equation:\nx2/a2 + y2/b2 = 1\nor parametrically:\nx = a cos(t), y = b sin(t)\n\nClick below to see one of the Associated curves.\n\nIf your browser can handle JAVA code, click HERE to experiment interactively with this curve and its associated curves.\n\nThe ellipse was first studied by Menaechmus. Euclid wrote about the ellipse and it was given its present name by Apollonius. The focus and directrix of an ellipse were considered by Pappus.\n\nKepler, in 1602, said he believed that the orbit of Mars was oval, then he later discovered that it was an ellipse with the sun at one focus. In fact Kepler introduced the word \"focus\" and published his discovery in 1609. The eccentricity of the planetary orbits is small (i.e. they are close to circles). The eccentricity of Mars is 1/11 and of the Earth is 1/60.\n\nIn 1705 Halley showed that the comet, which is now called after him, moved in an elliptical orbit round the sun. The eccentricity of Halley's comet is 0.9675 so it is close to a parabola (eccentricity 1).\n\nThe area of the ellipse is πab. There is no exact formula for the length of an ellipse in elementary functions and this led to the study of elliptic functions. Ramanujan, in 1914, gave the approximate length\n\nπ(3(a + b) - √[(a + 3b)(3a + b)]).\nThe pedal curve of an ellipse, with its focus as pedal point, is a circle.\n\nThe evolute of the ellipse with equation given above is the Lamé curve.\n\n(ax)2/3 + (by)2/3 = (a - b)2/3.\nFrom a point inside the evolute (it is a closed curve) four normals can be drawn to the ellipse but from a point outside only two normals can be drawn.\n\nOther Web site:\n\nJOC/EFR/BS January 1997\n\nThe URL of this page is:\nhttp://www-history.mcs.st-andrews.ac.uk/Curves/Ellipse.html"
] |
[
null,
"https://www-history.mcs.st-andrews.ac.uk/Curvepics/Ellipse/Ellipse1.gif",
null
] |
{"ft_lang_label":"__label__en","ft_lang_prob":0.9070176,"math_prob":0.95449364,"size":1455,"snap":"2019-13-2019-22","text_gpt3_token_len":383,"char_repetition_ratio":0.11784976,"word_repetition_ratio":0.0,"special_character_ratio":0.24261168,"punctuation_ratio":0.106529206,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.97365445,"pos_list":[0,1,2],"im_url_duplicate_count":[null,1,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2019-05-19T13:31:59Z\",\"WARC-Record-ID\":\"<urn:uuid:c2d5e635-b2a7-458e-9297-b241bd6c46e9>\",\"Content-Length\":\"6652\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:c799f90a-fcd4-4327-a5f7-21f154c70a7e>\",\"WARC-Concurrent-To\":\"<urn:uuid:2202224f-69a0-4d2e-bea7-f60ad23a65b2>\",\"WARC-IP-Address\":\"138.251.192.92\",\"WARC-Target-URI\":\"https://www-history.mcs.st-andrews.ac.uk/Curves/Ellipse.html\",\"WARC-Payload-Digest\":\"sha1:TBQGQ7ZIBYEG2FHV4CNIHDU5TEGOB7ZB\",\"WARC-Block-Digest\":\"sha1:6HZB2ZOIIU3WOADY4MLZK7HA4YJBLHCR\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2019/CC-MAIN-2019-22/CC-MAIN-2019-22_segments_1558232254882.18_warc_CC-MAIN-20190519121502-20190519143502-00054.warc.gz\"}"}
|
https://engineering.stackexchange.com/questions/32664/calculation-of-the-specific-co2-emission-of-a-cogeneration-plant-for-the-produce
|
[
"# Calculation of the specific CO2 emission of a cogeneration plant for the produced electricity\n\nSuppose I have a cogeneration plant that runs on natural gas and produces heat and electricity. The heat effeicieny is $$\\eta_{th} = 0.4$$ and the electricity efficiency is $$\\eta_{el} = 0.4$$.\n\nThe burning of natural gas produces 215 g/kWh of CO2.\n\nFor the calculation of the CO2 emission of the generated electricity from the cogeneration plant, one could now calculate $$\\frac{215}{0.4} = 537.5$$ g/kWh.\n\nHowever, I would like to calculate the CO2 emissions for the electricity generation of the cogeneration plant, taking into account that CO2 emissions are saved because another heat generator has to generate less heat.\n\nA natural gas boiler with an efficiency of $$\\eta_{th} = 0.9$$ is taken as a reference for heat generation. So the 1 kWh of heat is generated with $$\\frac{215}{0.9} = 238.88$$ g of CO2.\n\nHow do I calculate the CO2 emissions for the electricity generation in this case?\n\nMy calculation attempt:\n\nFirst I would calculate how much CO2 emssions the boiler has for 0.4 kWh:\n\n$$238.88 \\cdot 0.4 = 95.55$$ g of CO2\n\nThen I would subtract this value from the previously calculated co2 emission of the electricity:\n\n$$537.5 - 95.55 = 441.95$$\n\nThe electricity generated by the cogeneration plant would then have a CO2 emission of 441.95 g/kWh.\n\n• Hi and welcome to this site! This is not a we do your homework for you site so please xplain what you've tried so far and where you are stuck. I feel something is missing from the question, to what purpose is the efficeincy of the boiler given? the 215g correspond to lower or higher heating value?\n– mart\nJan 6, 2020 at 14:27\n• @mart Thanks for your answer. I have now edited my question with a few details and a caluclation attempt.\n– Emma\nJan 7, 2020 at 13:12\n\nYour basic logic is sound: You compare the case of the cogeneration plant + boiler vs. boiler alone. Your math looks correct to me.\n\nWhere did you get the value 215 g/kWh from? All (german language!) sources I found give 202g/kWh for natural gas, which may well be because actual of differences in grid gas composition. When I do the math myself I arrive at 197 g/kWh if using the lower heating value, only 178 g/kWh for the HHV.\n\nThe difference between HHV and LHV could be crucial since many boilers today are condensing boilers (that utilize the heat of evaporation of the exhaust water) but few to none cogeneration plants are, so you should possibly use different carbon intsities for both.\n\nLastly, the effiencies for the cogeneration plant don't look like real life numbers but are not too far of (I'm just now looking at a datasheet for a small CHP with 38% and 43% respectivly, in my experience this is a rather high $$\\eta_{el}$$)\n\n• Thank you very much for your detailed answer. Actually, the values like natural gas emissions that I used were from my memory, I was mainly interested in the calculation. The point about taking HHV and LHV into account is a good hint, thank you very much. Could you perhaps add your calculation for 197 g/kWh and 178 g/kWh? (I'm trying to figure out how you came up with that)\n– Emma\nJan 9, 2020 at 18:57\n• I did it in an excel sheet that I since deleted but It follows from the stochiometry of the combustion and the molar HHV/LHV. I hop I didnt make a mistake :)\n– mart\nJan 9, 2020 at 20:36"
] |
[
null
] |
{"ft_lang_label":"__label__en","ft_lang_prob":0.9158739,"math_prob":0.9502437,"size":1236,"snap":"2022-27-2022-33","text_gpt3_token_len":326,"char_repetition_ratio":0.17207792,"word_repetition_ratio":0.039408866,"special_character_ratio":0.28640777,"punctuation_ratio":0.11811024,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.98584616,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2022-08-19T17:09:33Z\",\"WARC-Record-ID\":\"<urn:uuid:6e6bc224-8c8b-47bd-9968-948ff103f694>\",\"Content-Length\":\"230053\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:2fd5f90e-979c-4da3-bb30-45ede7fce68e>\",\"WARC-Concurrent-To\":\"<urn:uuid:94cd3206-4cd4-40f7-b627-9d35ce83cb5b>\",\"WARC-IP-Address\":\"151.101.65.69\",\"WARC-Target-URI\":\"https://engineering.stackexchange.com/questions/32664/calculation-of-the-specific-co2-emission-of-a-cogeneration-plant-for-the-produce\",\"WARC-Payload-Digest\":\"sha1:OL5I4MPZVI3QAHYIPAJRBGFJPB4WA3XG\",\"WARC-Block-Digest\":\"sha1:6GHYYMI5EWW6LPN2OS327GNWZSKHUCPY\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2022/CC-MAIN-2022-33/CC-MAIN-2022-33_segments_1659882573744.90_warc_CC-MAIN-20220819161440-20220819191440-00733.warc.gz\"}"}
|
http://nesssi.cacr.caltech.edu/SSS/20111019/1110190450034125786.html
|
[
"CRTS Transient ID SSS111019:002409-442745\n(When using CRTS data please cite Drake et al. 2009, ApJ, 696, 870 and our ID.)\n\nBack to index\n Image 1 Image 2 Image 3 Image 4 master",
null,
"",
null,
"",
null,
"",
null,
"",
null,
"Current CRTS lightcurve\nSDSS DR-8 data\nImages from SDSS, PQ, DSS, SSS, 2MASS\nPast detections in Datascope\n\nAll transients, SNe, Blazars, CVs\n\nID = 1110190450034125786\nnewast = 0.000000\nav_motn = 0.038226\nav_deltime = 32.524800\nav_uncertx = 0.023925\nav_uncerty = 0.023925\nav_inclin = -78.240701\nTime = 2455854.095600\nTime2 = 2455854.061730\nTime3 = 2455854.072990\nTime4 = 2455854.084320\nappreject = 0.000\nmastersn = 2.179\naveragesn = 4.157\ntheta = 0.000\nnhigh = 513\nRA = 6.0367600\nDec = -44.4625400\nMag = 19.364700\nMag_err = 0.060425\nFWHM = 2.890\nMaster = S45003.master.fits\nMasterRAoff = 0.065309\nMasterDecoff = 0.030535\nRA2 = 6.0365700\nDec2 = -44.4628200\nMag2 = 19.451300\nMag2_err = 0.062481\nFWHM2 = 2.820\nRA3 = 6.0363300\nDec3 = -44.4633100\nMag3 = 18.662800\nMag3_err = 0.043928\nFWHM3 = 2.850\nRA4 = 6.0367400\nDec4 = -44.4625000\nMag4 = 19.398001\nMag4_err = 0.061111\nFWHM4 = 2.840\nOppos_ang = 318.139121\nInner_motion = -0.179102\nOuter_motion = -0.204037\nEclip_long = 343.392081\nEclip_lat = -42.213326"
] |
[
null,
"http://nesssi.cacr.caltech.edu/SSS/20111019/jpg/1110190450034125786-0001.arch.jpg",
null,
"http://nesssi.cacr.caltech.edu/SSS/20111019/jpg/1110190450034125786-0002.arch.jpg",
null,
"http://nesssi.cacr.caltech.edu/SSS/20111019/jpg/1110190450034125786-0003.arch.jpg",
null,
"http://nesssi.cacr.caltech.edu/SSS/20111019/jpg/1110190450034125786-0004.arch.jpg",
null,
"http://nesssi.cacr.caltech.edu/SSS/20111019/jpg/1110190450034125786.master.jpg",
null
] |
{"ft_lang_label":"__label__en","ft_lang_prob":0.5141466,"math_prob":0.998927,"size":1142,"snap":"2022-05-2022-21","text_gpt3_token_len":504,"char_repetition_ratio":0.12653778,"word_repetition_ratio":0.0,"special_character_ratio":0.57968473,"punctuation_ratio":0.23043478,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9817753,"pos_list":[0,1,2,3,4,5,6,7,8,9,10],"im_url_duplicate_count":[null,1,null,1,null,1,null,1,null,1,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2022-01-23T14:53:27Z\",\"WARC-Record-ID\":\"<urn:uuid:20d56c21-b698-437f-98ef-771801d1e7e1>\",\"Content-Length\":\"4569\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:03ab5f0e-ec30-4b55-9664-fd4cb79f3353>\",\"WARC-Concurrent-To\":\"<urn:uuid:196e96e5-b0a2-4fba-91c6-2a58cc882c9b>\",\"WARC-IP-Address\":\"131.215.198.195\",\"WARC-Target-URI\":\"http://nesssi.cacr.caltech.edu/SSS/20111019/1110190450034125786.html\",\"WARC-Payload-Digest\":\"sha1:XLREJWKXILBD6ZWE42ZZUMVIOS7A62TN\",\"WARC-Block-Digest\":\"sha1:4D5BZKAENDMNDRCCDQBJSLUXDXKWEZDI\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2022/CC-MAIN-2022-05/CC-MAIN-2022-05_segments_1642320304287.0_warc_CC-MAIN-20220123141754-20220123171754-00471.warc.gz\"}"}
|
https://www.colorhexa.com/03ec29
|
[
"# #03ec29 Color Information\n\nIn a RGB color space, hex #03ec29 is composed of 1.2% red, 92.5% green and 16.1% blue. Whereas in a CMYK color space, it is composed of 98.7% cyan, 0% magenta, 82.6% yellow and 7.5% black. It has a hue angle of 129.8 degrees, a saturation of 97.5% and a lightness of 46.9%. #03ec29 color hex could be obtained by blending #06ff52 with #00d900. Closest websafe color is: #00ff33.\n\n• R 1\n• G 93\n• B 16\nRGB color chart\n• C 99\n• M 0\n• Y 83\n• K 7\nCMYK color chart\n\n#03ec29 color description : Vivid lime green.\n\n# #03ec29 Color Conversion\n\nThe hexadecimal color #03ec29 has RGB values of R:3, G:236, B:41 and CMYK values of C:0.99, M:0, Y:0.83, K:0.07. Its decimal value is 257065.\n\nHex triplet RGB Decimal 03ec29 `#03ec29` 3, 236, 41 `rgb(3,236,41)` 1.2, 92.5, 16.1 `rgb(1.2%,92.5%,16.1%)` 99, 0, 83, 7 129.8°, 97.5, 46.9 `hsl(129.8,97.5%,46.9%)` 129.8°, 98.7, 92.5 00ff33 `#00ff33`\nCIE-LAB 81.929, -80.05, 72.669 30.431, 60.167, 12.107 0.296, 0.586, 60.167 81.929, 108.115, 137.767 81.929, -76.955, 96.22 77.567, -65.713, 45.043 00000011, 11101100, 00101001\n\n# Color Schemes with #03ec29\n\n• #03ec29\n``#03ec29` `rgb(3,236,41)``\n• #ec03c6\n``#ec03c6` `rgb(236,3,198)``\nComplementary Color\n• #52ec03\n``#52ec03` `rgb(82,236,3)``\n• #03ec29\n``#03ec29` `rgb(3,236,41)``\n• #03ec9e\n``#03ec9e` `rgb(3,236,158)``\nAnalogous Color\n• #ec0352\n``#ec0352` `rgb(236,3,82)``\n• #03ec29\n``#03ec29` `rgb(3,236,41)``\n• #9e03ec\n``#9e03ec` `rgb(158,3,236)``\nSplit Complementary Color\n• #ec2903\n``#ec2903` `rgb(236,41,3)``\n• #03ec29\n``#03ec29` `rgb(3,236,41)``\n• #2903ec\n``#2903ec` `rgb(41,3,236)``\nTriadic Color\n• #c6ec03\n``#c6ec03` `rgb(198,236,3)``\n• #03ec29\n``#03ec29` `rgb(3,236,41)``\n• #2903ec\n``#2903ec` `rgb(41,3,236)``\n• #ec03c6\n``#ec03c6` `rgb(236,3,198)``\nTetradic Color\n• #02a01c\n``#02a01c` `rgb(2,160,28)``\n• #02ba20\n``#02ba20` `rgb(2,186,32)``\n• #03d325\n``#03d325` `rgb(3,211,37)``\n• #03ec29\n``#03ec29` `rgb(3,236,41)``\n• #0dfc34\n``#0dfc34` `rgb(13,252,52)``\n• #26fc49\n``#26fc49` `rgb(38,252,73)``\n• #3ffd5e\n``#3ffd5e` `rgb(63,253,94)``\nMonochromatic Color\n\n# Alternatives to #03ec29\n\nBelow, you can see some colors close to #03ec29. Having a set of related colors can be useful if you need an inspirational alternative to your original color choice.\n\n• #17ec03\n``#17ec03` `rgb(23,236,3)``\n• #04ec03\n``#04ec03` `rgb(4,236,3)``\n• #03ec16\n``#03ec16` `rgb(3,236,22)``\n• #03ec29\n``#03ec29` `rgb(3,236,41)``\n• #03ec3c\n``#03ec3c` `rgb(3,236,60)``\n• #03ec50\n``#03ec50` `rgb(3,236,80)``\n• #03ec63\n``#03ec63` `rgb(3,236,99)``\nSimilar Colors\n\n# #03ec29 Preview\n\nText with hexadecimal color #03ec29\n\nThis text has a font color of #03ec29.\n\n``<span style=\"color:#03ec29;\">Text here</span>``\n#03ec29 background color\n\nThis paragraph has a background color of #03ec29.\n\n``<p style=\"background-color:#03ec29;\">Content here</p>``\n#03ec29 border color\n\nThis element has a border color of #03ec29.\n\n``<div style=\"border:1px solid #03ec29;\">Content here</div>``\nCSS codes\n``.text {color:#03ec29;}``\n``.background {background-color:#03ec29;}``\n``.border {border:1px solid #03ec29;}``\n\n# Shades and Tints of #03ec29\n\nA shade is achieved by adding black to any pure hue, while a tint is created by mixing white to any pure color. In this example, #000401 is the darkest color, while #effff2 is the lightest one.\n\n• #000401\n``#000401` `rgb(0,4,1)``\n• #001704\n``#001704` `rgb(0,23,4)``\n• #012a07\n``#012a07` `rgb(1,42,7)``\n• #013e0b\n``#013e0b` `rgb(1,62,11)``\n• #01510e\n``#01510e` `rgb(1,81,14)``\n• #016411\n``#016411` `rgb(1,100,17)``\n• #027815\n``#027815` `rgb(2,120,21)``\n• #028b18\n``#028b18` `rgb(2,139,24)``\n• #029f1c\n``#029f1c` `rgb(2,159,28)``\n• #02b21f\n``#02b21f` `rgb(2,178,31)``\n• #03c522\n``#03c522` `rgb(3,197,34)``\n• #03d926\n``#03d926` `rgb(3,217,38)``\n• #03ec29\n``#03ec29` `rgb(3,236,41)``\nShade Color Variation\n• #07fc2f\n``#07fc2f` `rgb(7,252,47)``\n• #1afc3f\n``#1afc3f` `rgb(26,252,63)``\n• #2efc4f\n``#2efc4f` `rgb(46,252,79)``\n• #41fd5f\n``#41fd5f` `rgb(65,253,95)``\n• #54fd70\n``#54fd70` `rgb(84,253,112)``\n• #68fd80\n``#68fd80` `rgb(104,253,128)``\n• #7bfd90\n``#7bfd90` `rgb(123,253,144)``\n• #8efea0\n``#8efea0` `rgb(142,254,160)``\n• #a2feb1\n``#a2feb1` `rgb(162,254,177)``\n• #b5fec1\n``#b5fec1` `rgb(181,254,193)``\n• #c8fed1\n``#c8fed1` `rgb(200,254,209)``\n• #dcffe1\n``#dcffe1` `rgb(220,255,225)``\n• #effff2\n``#effff2` `rgb(239,255,242)``\nTint Color Variation\n\n# Tones of #03ec29\n\nA tone is produced by adding gray to any pure hue. In this case, #717e73 is the less saturated color, while #03ec29 is the most saturated one.\n\n• #717e73\n``#717e73` `rgb(113,126,115)``\n• #68876d\n``#68876d` `rgb(104,135,109)``\n• #5f9067\n``#5f9067` `rgb(95,144,103)``\n• #569961\n``#569961` `rgb(86,153,97)``\n• #4da25b\n``#4da25b` `rgb(77,162,91)``\n• #43ac54\n``#43ac54` `rgb(67,172,84)``\n• #3ab54e\n``#3ab54e` `rgb(58,181,78)``\n• #31be48\n``#31be48` `rgb(49,190,72)``\n• #28c742\n``#28c742` `rgb(40,199,66)``\n• #1fd03c\n``#1fd03c` `rgb(31,208,60)``\n• #15da35\n``#15da35` `rgb(21,218,53)``\n• #0ce32f\n``#0ce32f` `rgb(12,227,47)``\n• #03ec29\n``#03ec29` `rgb(3,236,41)``\nTone Color Variation\n\n# Color Blindness Simulator\n\nBelow, you can see how #03ec29 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.54338765,"math_prob":0.81958145,"size":3672,"snap":"2019-35-2019-39","text_gpt3_token_len":1616,"char_repetition_ratio":0.12677208,"word_repetition_ratio":0.011090573,"special_character_ratio":0.5541939,"punctuation_ratio":0.23783186,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9821499,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2019-08-23T03:39:25Z\",\"WARC-Record-ID\":\"<urn:uuid:bfa4935c-3900-46a7-92d7-ddab0732ac01>\",\"Content-Length\":\"36225\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:577a0159-1bcc-45a6-b866-b93535a81d7f>\",\"WARC-Concurrent-To\":\"<urn:uuid:10e3a601-422f-4e98-8734-419cb54f5da4>\",\"WARC-IP-Address\":\"178.32.117.56\",\"WARC-Target-URI\":\"https://www.colorhexa.com/03ec29\",\"WARC-Payload-Digest\":\"sha1:GRPQCRR6QHPEOUGDY2SGZLNRKYEHHLJM\",\"WARC-Block-Digest\":\"sha1:SGA7K6WDPAPVCKLHHGK4V53FJM4TVGK6\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2019/CC-MAIN-2019-35/CC-MAIN-2019-35_segments_1566027317817.76_warc_CC-MAIN-20190823020039-20190823042039-00210.warc.gz\"}"}
|
https://physics.stackexchange.com/questions/3009/how-exactly-does-curved-space-time-describe-the-force-of-gravity
|
[
"How exactly does curved space-time describe the force of gravity?\n\nI understand that people explain (in layman's terms at least) that the presence of mass \"warps\" space-time geometry, and this causes gravity. I have also of course heard the analogy of a blanket or trampoline bending under an object, which causes other objects to come together, but I always thought this was a hopelessly circular explanation because the blanket only bends because of \"real\" gravity pulling the object down and then pulling the other objects down the sloped blanket. In other words, to me, it seems that curved space wouldn't have any actual effect on objects unless there's already another force present.\n\nSo how is curved space-time itself actually capable of exerting a force (without some source of a fourth-dimensional force)?\n\nI apologize for my ignorance in advance, and a purely mathematical explanation will probably go over my head, but if it's required I'll do my best to understand.\n\n• In many \"video\" explanations of general relativity curvature of Time is omited, time is certainly not easy to graph with the blanket example, but sometimes it's not even mentioned, perhaps lack of self-questioning of the explainer, then it's a good question +1 – HDE May 16 '11 at 17:28\n• I would modify this question as follows: If we could put a particle in orbit around a star with no other planets or satellites and then use a fictional device to cancel all the inertia of the particle, it is obvious that the curve of space-time is towards the star but what is not obvious is what would make the particle begin to move towards the star after all its momentum/inertia were canceled. Gravity is not a force so how would the particle 'know' that it needs to start accelerating towards the star? – Kelly S. French Sep 29 '15 at 20:39\n• The blanket/trampoline isn't meant to explain anything in the sense of suggesting an underlying mechanism. It's a way of thinking about an esoteric subject far removed from ordinary experience in terms of something more familiar. \"Vectors are like arrows\" doesn't mean vectors are made of obsidian or fired from bows. In any case, the blanket/trampoline is entirely wrong as a model of curved space in general relativity, though it is a surprisingly accurate model of Newtonian gravity: see this answer. – benrg Feb 4 at 8:37\n• Nothing is as instructive as reading. Especially this: archive.org/details/TheClassicalTheoryOfFields – my2cts Apr 29 at 18:27\n\nLuboš's answer is of course perfectly correct. I'll try to give you some examples why the straightest line is physically motivated (besides being mathematically exceptional as an extremal curve).\n\nImage a 2-sphere (a surface of a ball). If an ant lives there and he just walks straight, it should be obvious that he'll come back where he came from with his trajectory being a circle. Imagine a second ant and suppose he'll start to walk from the same point as the first ant and at the same speed but into a different direction. He'll also produce circle and the two circles will cross at two points (you can imagine those circles as meridians and the crossing points as a north resp. south poles).\n\nNow, from the ants' perspective who aren't aware that they are living in a curved space, this will seem that there is a force between them because their distance will be changing in time non-linearly (think about those meridians again). This is one of the effects of the curved space-time on movement on the particles (these are actually tidal forces). You might imagine that if the surface wasn't a sphere but instead was curved differently, the straight lines would also look different. E.g. for a trampoline you'll get ellipses (well, almost, they do not close completely, leading e.g. to the precession of the perihelion of the Mercury).\n\nSo much for the explanation of how curved space-time (discussion above was just about space; if you introduce special relativity into the picture, you'll get also new effects of mixing of space and time as usual). But how does the space-time know it should be curved in the first place? Well, it's because it obeys Einstein's equations (why does it obey these equations is a separate question though). These equations describe precisely how matter affects space-time. They are of course compatible with Newtonian gravity in low-velocity, small-mass regime, so e.g. for a Sun you'll obtain that trampoline curvature and the planets (which will also produce little dents, catching moons, for example; but forget about those for a moment because they are not that important for the movement of the planet around the Sun) will follow straight lines, moving in ellipses (again, almost ellipses).\n\n• Thanks heaps guys, it's starting to make some sense. So that makes sense to me with moving objects, but I still don't quite understand how it causes objects to accelerate. For example, with your analogy, what if the ants were stationary on the ball? When we lift something off the ground and let go, it accelerates toward the earth. Is this just because that's the \"straighest\" line through the curved spacetime around the earth? Why must it always be \"moving\" through a straight line, and what does it mean in terms of curved spacetime for something to be stationary? – Zac Jan 16 '11 at 12:08\n• Also @Zac, for something to be stationary in spaceTIME means that it only exists for a single instant in time! Even something that stays stationary in space for all time moves on a curve in spacetime. (think about what an x vs. t plot looks like for a stationary object) – wsc Jan 16 '11 at 18:33\n• @wsc: it's really called perihelium in my language (Slovak) so I never imagined it might be something different in English. Anyway, thank you :) – Marek Jan 16 '11 at 19:34\n• @Marek: nor did I realize it was different in Slovak; always nice to learn! Anyway, I was using that meaning of stationary since that was what @Zac was using: his question seemed to me to be: 'Sure you have geodesics on curved manifolds, but why do the ants have to move?' Which is a very good question, you just have to remember that time is a coordinate too. – wsc Jan 16 '11 at 20:07\n• @AdamHughes: So the crucial difference is that spacetime includes curved time as well. No object can remain truly stationary in spacetime because that would require being stationary in time. An object that magically appears above Earth may begin stationary in the space dimension of spacetime, but it nevertheless continues to \"move\" through the time dimension. It must follow the geodesic (straightest/shortest possible path) from that point, and the geodesic from the point above Earth points through time but also towards Earth because of its effect on the curvature of spacetime. – Zac Aug 4 '17 at 16:06\n\nThere are actually two different parts of general relativity. They're often stated as\n\n1. Spacetime tells matter how to move\n2. Matter tells spacetime how to curve\n\nPoint #1 is actually straightforward to explain: objects simply travel on the straightest possible paths through spacetime, called geodesics. The paths only seem curved because of the warping of spacetime. If you're a physicist, then you would want to know that that fact can be derived from the principle of extremal action (with all the requisite mathematical details), but if you don't want to wade through the math, hopefully it at least makes sense that objects move on \"straight\" lines. There is no actual force involved when a massive (or even a massless) object's trajectory curves in response to gravity, because it doesn't take any force to keep something moving on a straight line. (I can definitely expand on this point if you want)\n\nNow, I mentioned that spacetime needs to be warped in order for objects' trajectories to appear curved to us despite them actually being \"straight.\" So the essence of point #2 is, why is spacetime warped in the first place? Physics doesn't have a good answer to that. Technically, we don't have an answer to point #1 either, but the \"straight line\" argument at least makes it seem plausible; unfortunately, there's no equivalent plausibility argument for why spacetime warps itself around matter. (Perhaps someday we will come up with one) All we can do right now is produce equations that describe how spacetime behaves around matter, namely the Einstein equations which can be written $G_{\\mu\\nu} = 8\\pi T_{\\mu\\nu}$ among other ways.\n\n• I never got why Wheeler wasn't as famous as Feynman. He had that same magical way of reducing things down to really clear, simple statements that made complicated things seem obvious. – Jerry Schirmer Apr 17 '15 at 2:48\n\nthe trampoline analogy needs an extra source of gravity - because this is what the laymen, the recipients of the explanation, intuitively understand - but the real general relativity doesn't need any extra \"external\" gravity.\n\nInstead, general relativity says that the space is getting curved by Einstein's equations, $$G=T$$ where the left-hand side are numbers describing the curvature at a given point and the right hand side is the density of matter and momentum. I omit indices and constants haha. So general relativity says how the spacetime is curved under the influence of matter.\n\nThe second part of the story is that general relativity also says how matter moves in external geometry. It moves along \"geodesics\", lines that are as straight as you can get. $$\\delta S_{action\\,ie\\,proper\\,length} = 0$$ This actually means that the objects move along the predicted, seemingly curved trajectories. These trajectories are actually as straight in the curved spacetime as you can get.\n\nImagine that there is a hemisphere replacing a disk in the trampoline. So there exists a (nearly) straight line on the hemisphere - namely the equator near the junction with the rest of the trampoline. Note that the equator on the Earth is a maximum circle - so it is one of the straightest lines you can draw on the surface of Earth. The same is true for all actual trajectories that objects choose in spacetime of general relativity.\n\nSo in the hemisphere-above-trampoline example, particles can orbit around the equator of the attached hemisphere, just like planets, because it is the straightest and most natural line they can choose. I don't use any external gravity to explain the real gravity; instead, I use the principle that particles choose the most natural - the straightest - line they can find in the curved spacetime.\n\nBest wishes Lubos\n\nThe other answers are more or less correct, but perhaps I can say something more to the point of the question, *How is curved spacetime itself actually capable of exerting a force?\n\nNo force whatsoever is needed.\n\nGravity is not a force. What is a force, anyway? Newton clarified for almost the first time in Science what a force is: First I will say it, then explain it: A force is something which makes the motion of a body deviate from uniform straightline motion.\n\nNewton pointed out that bodies have a tendency, inertia, to continue in whatever direction they are already going, with whatever velocity they have at the moment. That means uniform, rectilineal motion: steady velocity, same direction. Newton actually knew this was what would be later called a geodesic, since « a straight line is the shortest distance between two points ».\n\nNewton then went on to say that to overcome inertia, to overcome this tendency, requires a force: force is what makes a body depart from the geodesic it is (even momentarily) headed on (its direction and speed).\n\nIt was then Einstein (and partly Mach before him) who said this does not get to the essence of the question. For Einstein, any coordinate system had to be equally allowable, and in fact, space-time is curved (as already explained by other posters). A body or particle under the influence of gravity actually does travel in a geodesic....i.e., it does what a free particle does. I.e., it does what a particle not under the influence of any force does. So gravity is not a force.\n\nNewton did not realise that space-time could be curved and that then the geodesics would not appear to our sight to be straight lines when projected into space alone. That ellipse you see in pictures of planetary orbits? It is not really there of course since the planet only reaches different points of the ellipse at different times...that ellipse is not what the planet really traverses in space-time, it is the projection of the path of the planet onto a slice of space, it is really only the shadow of the true path of the planet, and seems much more curved than the true path really is.\n\n( ¡ The curvature of space-time in the neighbourhood of the earth is really very small ! The path of the earth in space-time would even appear to be nearly straight to an imaginary Euclidean observer who, in a flat five-dimensional space larger than ours, was looking down on us in our slightly curved four dimensional space-time embedded in their world. It's $$ct$$, remember, so the curving around the ellipse gets distributed over an entire light-year, and appears to be nearly straight...and is straight when one takes into account the slight curvature of space-time.)\n\nSince every particle under the influence of gravity alone moves in a geodesic, it does not experience any force that would make it depart from its inertia and make it depart from this geodesic. So gravity is not a force, but electric forces still do exist. They could overcome the inertia of a charged body and make it deviate from the geodesic it is headed on: change its speed and direction (when speed and direction are measured in curved space-time).\n\nEinstein (and me too) did not want to change the definition of force in this new situation, since after all electric forces are known to exist and are still forces in GR. So the old notion of force still retains its usefulness for things other than gravity. To repeat: if a body is not moving in a geodesic in space-time, you go looking for a force that is overcoming its inertia....but since gravity and curvature of space-time do not make a body depart from a geodesic, neither of them is a force.\n\nSee also http://www.einstein-online.info/elementary/generalRT/GeomGravity.html which avoids the trampoline fallacy and has a great image of the great circle.\n\n• Gravity is not a force in GR. Gravity was a force in classical mechanics. Gravity is ________ in quantum theories (Sorry, I don't know enough to fill in the blank.) My point is that all of these realms are models that predict the motion of terrestrial and astronomical objects. Some models (e.g., GR) make better predictions than others (e.g., classical), but do any of them tell us what gravity really is? – Solomon Slow Sep 21 '15 at 20:14\n• @james large, the answer is no. There isn't a complete theory of gravity. No one knows what causes. – Ernesto Melo Jun 13 '17 at 16:26\n\nAs others mentioned, the main problem with the common visualization is, that it omits the time dimension. In the animation linked below the time-dimension is included to explain how General Relativity differs form Newton's model.\n\nIt is straightforward to see how the geometry of spacetime describes the force of gravity -- you just need to understand the geodesic equation, which in general relativity describes the paths of things subject to gravity and nothing else. This is the \"spacetime affects matter\" side of the theory.\n\nTo understand why curvature in particular, as a property of the geometry, is important, you need to understand the \"matter affects spacetime\" side of general relativity. The postulate is that the Gravitational Lagrangian of the theory is equal to the scalar curvature -- this is called the \"Einstein-Hilbert Action\" --\n\n$$S=\\int{\\left( {\\lambda R + {{\\mathcal{L}}_M}} \\right)\\sqrt { - g}\\, d{x^4}} {\\text{ }}$$\n\nYou set the variation in the action to zero, as with any classical theory, and solve for the equations of motion. The conventional way to do this goes something like this --\n\n$$\\int{\\left( {\\frac{{\\delta \\left( {\\left( {{{\\mathcal{L}}_M} + \\lambda R} \\right)\\sqrt { - g} } \\right)}}{{\\delta {g_{\\mu \\nu }}}}} \\right)\\delta {g_{\\mu \\nu }}\\,d{x^4}} = 0$$ $$\\sqrt { - g} \\frac{{\\delta {{\\mathcal{L}}_M}}}{{\\delta {g_{\\mu \\nu }}}} + \\lambda \\sqrt { - g} \\frac{{\\delta R}}{{\\delta {g_{\\mu \\nu }}}} + \\left( {{{\\mathcal{L}}_M} + \\lambda R} \\right)\\frac{{\\delta \\sqrt { - g} }}{{\\delta {g_{\\mu \\nu }}}} = 0$$ $$\\frac{{\\delta R}}{{\\delta {g_{\\mu \\nu }}}} + \\frac{R}{{\\sqrt { - g} }}\\frac{{\\delta \\sqrt { - g} }}{{\\delta {g_{\\mu \\nu }}}} = - \\frac{1}{\\lambda }\\left( {\\frac{1}{{\\sqrt { - g} }}{{\\mathcal{L}}_M}\\frac{{\\delta \\sqrt { - g} }}{{\\delta {g_{\\mu \\nu }}}} + \\frac{{\\delta {{\\mathcal{L}}_M}}}{{\\delta {g_{\\mu \\nu }}}}} \\right)$$\n\n$${R_{\\mu \\nu }} - \\frac{1}{2}R{g_{\\mu \\nu }} = \\frac{1}{{2\\lambda }}{T_{\\mu \\nu }}$$\n\nTo fix the value of $\\kappa=1/{2\\lambda}$, we impose Newtonian gravity at low energies, for which we only consider the time-time component, which Newtonian gravity describes (I'll use $C$ for the gravitational constant, reserving $G$ for the trace of the Einstein tensor) --\n\n$$\\begin{gathered} {G_{00}} = \\kappa c^4\\rho \\\\ {R_{00}} = {G_{00}} - \\frac{1}{2}Gg_{00} \\\\ \\Rightarrow {R_{00}} \\approx \\kappa \\left( {c^4\\rho - \\frac{1}{2}\\frac{1}{{c^2}}c^4\\rho c^2} \\right) \\approx \\frac{1}{2}\\kappa c^4\\rho \\\\ \\end{gathered}$$\n\nImposing Poisson's law from Newtonian gravity with $\\partial^2\\Phi$ approximating $\\Gamma _{00,\\alpha }^\\alpha$,\n\n$$4\\pi C\\rho \\approx {\\nabla ^2}\\Phi \\approx \\Gamma _{00,\\alpha }^\\alpha \\approx {R_{00}} \\approx \\frac{\\kappa }{2}c^4\\rho \\\\ \\Rightarrow \\kappa = \\frac{{8\\pi G}}{{c^4}} \\\\$$\n\n(The fact that this is possible is fantastic -- it means that simply postulating that spacetime is curved in a certain sense produces a force that agrees with our observations regarding gravity at low energies.) Giving us the Einstein-Field Equation,\n\n$${G_{\\mu \\nu }} = \\frac{{8\\pi G}}{{c^4}}{T_{\\mu \\nu }}$$\n\n• This is not an explanation in \"layman's terms\"... – Comp_Warrior Jun 22 '13 at 1:20\n• I just think the average person interested in OP's question would not have knowledge of Lagrangians, Tensors etc. – Comp_Warrior Jun 22 '13 at 13:13\n• @Comp_Warrior, the About says the site is for Academics, students, and researchers of physics and astronomy, so the average audience should not consist of laypeople and it is perfectly ok to give technical and advanced answers for the people who can stomach it. Even though it looks like this since quite some time, physics se is not meant to be a popular physics forum such as quora for example ... – Dilaton Jun 22 '13 at 14:46\n• Btw the op says he does not mind technical answers, so why are you insisting on answers exclusively in layman terms? – Dilaton Jun 22 '13 at 15:00\n• @Comp_Warrier what dimension10 says, and the SE system is exactly desined that the op can accept the answer he likes best, maybe a popular one, whereas there can legitimately be other more technical answers too, that are liked by other members of the community. Answers to a question are not only meant to serve the op, but the whole community. So there is absolutely nothing wrong with a question getting answers of different level. It would be nice if you stop discouraging good technical posts which are perfectly legitimate. – Dilaton Jun 22 '13 at 22:20\n\nI think the problem for the layman is understanding why there is motion in spacetime and I think a sort of answer is that we already accept motion through time when we think of time and space as separate. Well we are in motion through spacetime where time and space are not separable and when we move through a region of spacetime that contains matter the shortest spacetime path between two events is the one that includes motion through the space bit as well as the time bit (ie not orthogonal to the space axes). That is experienced as falling under gravity.\n\nA complete replacement of the brief answer I wrote some time ago:\n\nMore than one person has brought up the idea of a pair of ants walking on the surface of a sphere. Each ant is moving in what, for it, is a straight line, but the get closer together at an increasing rate until they collide. (Provided they're lined up right.)\n\nThis is an excellent metaphor, but it can be confusing because each ant is propelling itself, so it could stop if it wanted, and also they do have to be lined up right when they start or they won't collide. If you hold a rock still and then let go, it starts to move, which seems different from the ant picture.\n\nAll of these problems disappear if you realize that they don't call it spacetime for nothing. The surface of the balloon is two-dimensional in the ants-on-a-balloon analogy (and really the ants ought to be two-dimensional themselves, living embedded in the surface of the balloon just as we are embedded in spacetime). But it's wrong to think we are only throwing away one dimension to be able to visualize curved space. The right way to think of the balloon is that it has one dimension of space and one of time, so we're really throwing away two out of the four dimensions.\n\nEach ant is racing headlong into its own future, and it can't stop or even slow down. And the ants can't miss each other, because the paths they follow are really the histories of their lives. The paths are called world lines. Each point on a world line is a time and a place that the ant passed through. If two world lines cross, that means two ants were at the same place at the same time.\n\nThis is still confusing, because the balloon is round. Which direction is time, and which direction is space? What happens when the ant goes all the way around the sphere? To make sense of these questions, you have to put a coordinate system on the sphere. For this toy universe, it actually makes sense to use latitude and longitude as coordinates. The south pole is kind of a big bang (take this with a lot of salt) and the north pole is the big crunch in the future (that definitely isn't going to happen in real life). The lines of latitude are the time coordinate, which means time progresses along the lines of longitude.\n\nWhat Einstein's equation tell us, at a basic level, is that the curvature of space-time and stress-energy are the same thing.\n\nIn order for this law to be respected it is clear that the stress-energy of a test particle cannot be constant in a space-time with changing curvature.\n\nSo, if you can choose a coordinate set in which the stress energy tensor is represented by the mass-energy of the particle, then the practical effect you can observe is changing energy and momenta of the test particle.\n\nWhen you therefore observe the test particle, you will see it as having changing energy and momenta, and therefore derive a force driving these changes. This is what we call gravity.\n\nHowever, general relativity gives a much deeper picture of gravity as a description of the curvature of space-time, so, in a way, gravity is an observed effect of the curvature of space-time, or, if you like, an observed effect of the distribution of mass and energy.\n\n• Part of this answer has been quoted in a new question. – Nat Sep 26 '18 at 10:01\n\nCurvature affects motion by making the lines that are as straight as possible end up converging, just line how if you and your friends fly at constant altitude from the north pole, then no matter what directions you go (even if you and your friend head out in very different directions) then you start to converge on the south pole. This is a very good way to describe an effect that is determined by the path and not by the mass of the object taking the path. This is sometimes described as \"spacetime tells matter how to move\" but really this is just that the straightest possible lines converge when spacetime is curved the right way.\n\nBut something not mentioned enough is that while mass, energy, momentum, stress, and pressure are sources of curvature, they are not the only things that create curvature, curvature itself can create further and additional curvature. A gravitational wave can propagate or even spread in a vacuum of empty space devoid of all mass, energy, momentum, stress, and pressure.\n\nThe region outside a symmetric nonrotating static star is curved, even the parts far from any mass or energy or momentum or stress or pressure. The space remains curved because the existing curvature is exactly shaped so as to persist (or otherwise cause future curvature exactly like itself).\n\nSo curvature allows and sometimes requires more and/or future curvature, just as a travelling electromagnetic wave allows and/or even requires there be more electromagnetic waves elsewhere and/or later. The vacuum allows curvature far from gravitational sources just as it allows electromagnetic waves far from electromagnetic sources. What electromagnetic sources allow is for electromagnetic fields to behave differently (namely to gain or lose energy as well as move in different ways and gain and lose momentum and stress). Similarly what gravitational sources do is allow curvature to react differently to itself than it otherwise would.\n\nImagine a flat region of space shaped like a ball, then imagine a funnel type curved space where two regions of surface area are farther apart than they would be if flat (like a higher dimensional version of a funnel and on a funnel surface two circles of a particular circumference are farther away as measured along the funnel then if two similarly sized circles were in a flat sheet). On its own, spacetime doesn't allow itself to connect those two kinds of regions together, but that mismatch is exactly the kind or not-lining-up that putting some mass or energy right there on the boundary fixes. So without mass those two regions can't line up, with mass they can. Just like an electromagnetic field can have a kink if there is a charge there.\n\nSo your curvature likes to propagate a certain way, and if you want it to deviate from that, you need mass, energy, momentum, stress, and/or pressure. And you'd need the right kind to get it to match up, the kind you want might be available, and might not even exist, so not all kinds of curvature will be allowed. But the point of a source is that it changes the balance between nearby curvature and not that affects future curvature. So there is a kind of balance, and there are things that can warp that a balance. Those things that warp that natural vacuum balance are called gravitational sources.\n\nHaving curved spacetime is something we observe. Having gravitational sources that can change the normal or usual way curvature evolves is something else entirely. We can make theories about how the sources evolve, and then the curvature is forced to co-evolve with it, and that's what gravity is about, about gravitational interactions (source and curvature together) changing how the curvature evolves changing the evolution that the curvature otherwise would have evolved a different way.\n\nSo there is nothing circular, curvature is observed, and on its own it interacts and affects itself in a particular way (that is also observed), but gravitational sources get to change that and by interacting with the gravitational sources (which we can do) we can ourselves make the curvature change in different ways than it otherwise would!\n\nA question was marked as a duplicate of a duplicate of this question, so I am posting my answer here.\n\nGravity is due to the curvature of spacetime\n\nI believe it is true. That is what general relativity says, and general relativity has been confirmed in predictions ranging from the existence of black holes to the orbit of Mercury to the bending of light.\n\nRelation between spacetime, curvature, mass and gravity\n\nYou say you are confused about how the curvature of spacetime and gravity are related. I am going to explain mainly that in my answer, starting with simpler examples, and moving to more complicated ones.\n\nOkay, let's say you have a sheet of rubber. This is the classic example of spacetime. Let's say you take a bowling ball, and set it on the taut sheet of rubber. It has a large mass (compared to what else we'll be putting on the sheet), therefore the sheet curves a lot for the bowling ball. We now have an image in our head like the one below:",
null,
"So mass leads to curvature. Then, take a baseball, say, and set it near the bowling ball. It rolls toward the bowling ball, right? This occurs because of the curvature of the sheet. So, then, curvature leads to gravity. So, if an object has large mass, it will curve spacetime dramatically, leading to strong gravity.\n\nThis is, of course, an overly simplistic example. It is 2-d, and it doesn't take into account other factors. Let us move to 3-d (keeping in mind the universe is accepted to be at 4-d, ignoring the holographic principle). The mass of a bowling ball now sucks in space around it, sort of like in the picture below:",
null,
"And now, in this case, we can see (or understand) that more mass still leads to more curvature. The greater the mass, the more spacetime will \"contract\" around the object. So we still think that mass leads to curvature. Now, if we set an object near this massive object (like the moon next to Earth) it is \"sucked in\" sort of, by the curvature of spacetime, though of course the moon contracts spacetime around it as well. At this point, we can reasonably still conclude that in 3-d, mass leads to curvature which leads to gravity.\n\nBut, as I said earlier, the universe is generally thought of as 4-d. What does our picture look like when we add time? Well, the time dimension is contracted around a massive object. So let us picture our previous example but that the fabric of spacetime has a few clocks embedded in it occasionally. As the space stretches and contracts, so will the clocks (the \"time\") and so the time on those clocks will be \"wrong\" - it'll differ from the other clocks. And in this case, as the Earth contracts space and time around it, it changes the time and space (it curves spacetime) and so when another object enters our region of spacetime, it is \"sucked in\" still, but so is it's time. This is, of course, a very extreme example, but I hope this shows that we can conclude that mass leads to curvature which leads to gravity. And a black hole, is simply so much mass that it leads to so much curvature that the gravity is so strong that light cannot escape.\n\nI hope this helps!\n\nHere's a simple way to think about it:\n\nNewton's first law of motion says that in the absence of any force on a particle, the particle will move in a straight line.\n\nHence, if we see a particle move in a curved path - that is of it deviates from a curved path - we can say that there is a force on it.\n\nNow, in GR, particles without any forces acting on it move on geodesics. This is the replacement for the notion of straight lines in a curved spacetime. Nevertheless we can detect the deviation from the usual notion of a straight line in flat space.\n\nThis deviation will be correlated with the force of gravity as experienced by this object in its local frame.\n\nprotected by Qmechanic♦Aug 17 '13 at 11:27\n\nThank you for your interest in this question. Because it has attracted low-quality or spam answers that had to be removed, posting an answer now requires 10 reputation on this site (the association bonus does not count).\n\nWould you like to answer one of these unanswered questions instead?"
] |
[
null,
"https://i.stack.imgur.com/3vGJJ.png",
null,
"https://i.stack.imgur.com/iGT6a.jpg",
null
] |
{"ft_lang_label":"__label__en","ft_lang_prob":0.96297526,"math_prob":0.9618398,"size":3093,"snap":"2019-43-2019-47","text_gpt3_token_len":697,"char_repetition_ratio":0.1388799,"word_repetition_ratio":0.014260249,"special_character_ratio":0.21985127,"punctuation_ratio":0.119195044,"nsfw_num_words":1,"has_unicode_error":false,"math_prob_llama3":0.9819885,"pos_list":[0,1,2,3,4],"im_url_duplicate_count":[null,null,null,null,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2019-10-18T23:28:45Z\",\"WARC-Record-ID\":\"<urn:uuid:8dbd3cd4-8435-48ce-9d22-6c3aa7f0d2bb>\",\"Content-Length\":\"238372\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:cfc384d5-1940-4010-ab21-c47320fc244f>\",\"WARC-Concurrent-To\":\"<urn:uuid:315f882b-cdc9-4a52-a49b-00b3eb1aca26>\",\"WARC-IP-Address\":\"151.101.65.69\",\"WARC-Target-URI\":\"https://physics.stackexchange.com/questions/3009/how-exactly-does-curved-space-time-describe-the-force-of-gravity\",\"WARC-Payload-Digest\":\"sha1:RI3OXI3UGYADIX47J4OSCT3R7N52JDNM\",\"WARC-Block-Digest\":\"sha1:GIMTFSKGVHOC67353UAE3GZJY2Q6AFLJ\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2019/CC-MAIN-2019-43/CC-MAIN-2019-43_segments_1570986685915.43_warc_CC-MAIN-20191018231153-20191019014653-00448.warc.gz\"}"}
|
https://math.stackexchange.com/questions/678515/probability-2-4-vs-3-6/678530
|
[
"# probability $2/4$ vs $3/6$\n\nRecently I was asked the following in an interview:\n\nIf you are a pretty good basketball player, and were betting on whether you could make $2$ out of $4$ or $3$ out of $6$ baskets, which would you take?\n\nI said anyone since ratio is same. Any insights?\n\n• Are you betting you will make exactly that number, or that you wll make at least that number? It changes the answer. – Ross Millikan Feb 16 '14 at 15:31\n• Betting for \"exactly\" is silly, as you can always miss on purpose. – Bach Feb 16 '14 at 15:34\n• @HansZauber Unless there is the possibility to fail at missing :) – Hagen von Eitzen Feb 16 '14 at 15:43\n• This is a great, unintuitive question. – Thomas Ahle Feb 16 '14 at 17:33\n• @Thomas Ahle is the question unintuitive or the answer? – miracle173 Feb 16 '14 at 22:18\n\n# Depends on how good you are",
null,
"The explanation is intuitive:\n\n• If you are not very good (probability that you make a single shot - p < 0.6), then your overall probability is not very high, but it is better to bet that you'll make 2 out of 4, because you may do it just by chance and your clumsiness has less chance to prove in 4 than in 6 attempts.\n\n• If you are really good (p > 0.6), then it is better to bet on 3 out of 6, because if you miss just by chance, you have better chance to correct yourself in 6 attempts.\n\nThe curves meet exactly at p = 0.6.\n\n## In general, the more attempts, the more of real skill reveals\n\nThis is best illustrated on the extreme case:",
null,
"With more attempts, it is almost binary case - you either succeed or not, based on your skill. With high N, the result will be close to your original expectation.\n\nNote that with high N and p = 0.5, the binomial distribution gets narrower and converges to normal distribution.\n\n## Everything here just revolves around binomial distribution,\n\nwhich tells you that the probability that you will score exactly k shots out of n is\n\n$$P(X = k) = \\binom{n}{k} p^k (1-p)^{n-k}$$\n\nThe probability that you will score at least k = n/2 shots (and win the bet) is then\n\n$$P(X \\ge k) = \\sum^{n}_{i=k} \\binom{n}{i} p^i (1-p)^{n-i}$$\n\n# Why the curves don't meet at p = 0.5?\n\nLook at the following plots:",
null,
"These plots are for p = 0.5. The binomial distribution is symmetric for this value. Intuitivelly, you expect 2 of 4 or 3 of 6 to take half of the distribution. But if you look especially at the left plot, it is clear that the middle column (2 successful shots) goes far beyond the half of the distribution (dashed line), which is denoted by the red arrow. In the right plot (3/6), this proportion is much smaller.\n\nIf you sum the gold bars, you will get:\n\nP(make at least 2 out of 4) = 0.6875\nP(make at least 3 out of 6) = 0.65625\nP(make at least 500 out of 1000) = 0.5126125\n\n\nFrom these figures, as well as from the plots, is apparent that with high N, the proportion of the distribution \"beyond the half\" converges to zero, and the total probability converges to 0.5.\n\nSo, for the curves to meet for low Ns, p must be higher to compensate for this:",
null,
"P(make at least 2 out of 4) = 0.8208\nP(make at least 3 out of 6) = 0.8208\n\n\nFull code in R:\n\nf6 <- function(p) {\ndbinom(3, 6, p) +\ndbinom(4, 6, p) +\ndbinom(5, 6, p) +\ndbinom(6, 6, p)\n}\n\nf4 <- function(p) {\ndbinom(2, 4, p) +\ndbinom(3, 4, p) +\ndbinom(4, 4, p)\n}\n\nfN <- function(p, from, max) {\n#sum(sapply(from:max, function (x) dbinom(x, max, p)))\ns <- 0\nfor (i in from:max) {\ns <- s + dbinom(i, max, p)\n}\ns\n}\nf1000 <- function (p) fN(p, 500, 1000)\n\nplot(f6, xlim = c(0,1), col = \"red\", lwd = 2, ylab = \"\", main = \"Probability that you will make ...\", xlab = \"p (probability you make a single shot)\")\ncurve(f4, col = \"green\", add = TRUE, lwd = 2)\ncurve(f1000, add = TRUE, lwd = 2, col = \"blue\")\nlegend(\"topleft\", c(\"2 out of 4\", \"3 out of 6\", \"500 out of 1000\"), lwd = 2, col = c(\"green\", \"red\", \"blue\"), bty = \"n\")\n\nplotHist <- function (n, p) {\nplot(x=c(-0.5,n+0.5),y=c(0,0.41),type=\"n\", xaxt=\"n\", xlab = \"successful shots\", ylab = \"probability\",\nmain = paste0(n/2, \"/\", n, \", p = \", p))\naxis(1, at=0:n, labels=0:n)\nx <- 0:n\ny <- dbinom(0:n, n, p)\nw <- 0.9\n#lines(0:4, dbinom(0:4, 4, 0.5), lwd = 50, type = \"h\", lend = \"butt\")\nrect(x-0.5*w, 0, x+0.5*w, y, col = \"lightgrey\")\nuind <- (n/2+1):(n+1)\nrect(x[uind]-0.5*w, 0, x[uind]+0.5*w, y[uind], col = \"gold\")\n}\n\npar(mfrow = c(1, 2))\nplotHist(4, 0.5)\nabline(v = 2, lty = 2)\narrows(2-0.5*0.9, 0.17, 2, 0.17, col = \"red\", code = 3, length = 0.1, lwd = 2)\nplotHist(6, 0.5)\n\nf4(0.5)\nf6(0.5)\nf1000(0.5)\n\npar(mfrow = c(1, 2))\nplotHist(4, 0.6)\nplotHist(6, 0.6)\n\nf4(0.6)\nf6(0.6)\n\n• Why is 0.6 the tipping point instead of 0.5? I would naturally assume 0.5 would be the point at which the curves meet. Why is this not the case? – 1110101001 Feb 17 '14 at 1:33\n• @user2612743 this is a great question! Please see the updated post. – Tomas Feb 17 '14 at 9:37\n• As a sidenote, in real life, $p$ might be a function of $N$, as after 1000 trials, the player is likely to be fatigued and perform worse than when they started. – Jam Feb 21 '18 at 11:14\n\nThe probability of you getting at least half increases with the number of shots. E.g. with a probability of 2/3 per shot the probability of getting at least half the baskets increases as below.\n\nEdit it is important to point out that this only holds if by a \"pretty good basketball player\" you mean your chance of making a basket is somewhat better than evens (in the range 0.6 to 1 exclusive). This is shown very clearly in Hagen von Eitzen's answer.",
null,
"An intuitive way of looking at this is that it's like a diversification effect. With only a few baskets, you could get unlucky, just as you might if you tried to pick only a couple of stocks for an investment portfolio, even if you were a good stock picker. You increase the number of baskets -- or stocks -- and the role of chance is reduced and your skill shines through.\n\nFormally, assuming that\n\n• each throw is independent, and\n\n• you have the same probability $p$ of scoring on each throw\n\nyou can model the chance of scoring $b$ baskets out of $n$ using the binomial distribution\n\n$$\\mathbb{P}(b \\text{ from } n) = \\binom{n}{b} p^{b}(1-p)^{n-b}$$\n\nTo get the probability of scoring at least half of the $n$ baskets, you have to add up these probilities. E.g. for at least 2 out of 4 you want $\\mathbb{P}(2 \\text{ from } 4) + \\mathbb{P}(3 \\text{ from } 4) + \\mathbb{P}(4 \\text{ from } 4)$.\n\n• I guess you're making the assumption that a pretty good player has a better than half chance of making a shot. Reasonable, but just in case it was false the same reasoning would encourage you to go for 2/4. – Ben Millwood Feb 16 '14 at 15:41\n• @BenMillwood that's a very interesting point indeed! However the question does state the assumption that the player is good. – TooTone Feb 16 '14 at 15:42\n• In contrast a \"pretty good\" goalkeeper in soccer saves fewer than 50% of penalties (and a pretty good penalty taker scores more than that). So there is a general knowledge component to the question :-) – Steve Jessop Feb 16 '14 at 16:12\n• One simple intuitive way to understand this is that: the more shots you make the more likely you are to \"get closer to\" your \"real\" shooting percentage. That may possibly help! :) – Fattie Feb 17 '14 at 9:56\n• @laxxy it's because there are a small number of shots and they are hit-or-miss, i.e. the probability distribution is discrete, so there are step-changes in the cumulative probability as you consider the chance of making more shots. As the number of shots increases the distribution becomes more like a continuous distribution, so the steps become more like a ramp. In this comment I have summarised parts of this answer, which does a very good job of explaining the intuition and the details behind your question. – TooTone Feb 17 '14 at 12:55\n\nIt depends. If your probability to miss in a single try is $p$ (which should be low if you are a \"pretty good\" basketball player), then the probaility of making less than two out of four baskets (i.e. to lose the first kind of bet) is $$p_2=p^4+4p^3(1-p)=p^3(4-3p)$$ and for less than three out of six (i.e. to lose the second bet) is $$p_3=p^6+6p^5(1-p)+15p^4(1-p)^2=p^4(10p^2-24p+15).$$ We have $p_2<p_3$ iff $$p^3(4-3p)<p^4(10p^2-24p+15)$$ i.e. $$0<10p^6-24p^5+18p^4-4p^3=p^3(1-p)^2(10p-4).$$ In other words: The \"2 out of 4\" bet is to be preferred when $0<p<\\frac2{5}$ and \"3 out of 6\" is to be preferred when $\\frac{2}{5}<p<1$. For $p\\in\\{0,\\frac2{5},1\\}$ the bets are equivalent.\n\n• I may be mistaken, but shouldn't the third coefficient in $p_3$'s expression be 15, instead of 30? (where 15 is (6 choose 4)). Also, shouldn't the second to last sentence be the other way around? When p is small (i.e., the player is \"good\"), the player should choose the \"3 out of 6\" option, right? (See wolframalpha.com/input/… ) – Detached Laconian Feb 16 '14 at 16:43\n• The conclusion is the opposite of what the argumentation says. – durum Feb 16 '14 at 16:58\n• I make it 0.4 too. – TonyK Feb 16 '14 at 18:32\n• @TuringMachine yes, I was using my own definition of $p$. On Hagen's definition it is indeed 0.4. – TooTone Feb 16 '14 at 22:21\n• @HagenvonEitzen Cool. :) One more thing though: I think the conclusion is still backwards; namely, the \"3 out of 6\" is to be preferred when $0 < p < 2/5$. – Detached Laconian Feb 17 '14 at 0:07\n\nI would want to know what my long term average is.\n\nIf I make 333 out of 999 over the course of a season, I know that the more shots I take, the more certain I am that regression to the mean will make it less likely that I'll hit a ratio or 2:3 or better. I stand a better chance of two or three lucky shots out of three than I do 4 or more out of 6, and certainly better than 40 or more out of 60. More shots is bad because good luck can't save me from my long-term average.\n\nOn the other hand, if I make 750 out of 1000 in a season, regression to the mean works for me if I take more shots. Getting 1 or none out of 3 wouldn't be any surprise, but 3 or less out of 6, less so and 39 or less out of 60 would be a bad day indeed.\n\nAssuming you have a $50/50$ chance of missing or making it (though it could be anything else really, the calculations would change accordingly), we can view both scenarios as binary permutations, as a means of figuring out the answer. Now in english:\n\nLets say you have $4$ balls (this is the first case), you would be required (in order to succeed) to make $2$ shots. Lets define: when you make a shot - that ball was a red ball. When you miss, that ball was a blue ball. Now it doesn't matter in which order you make your shots right? You could make the first two, then miss two, make one, miss one, make one, miss the last, etc. All that matters is that you have two blue balls and two red balls.\n\nSo the question is how many ways can you arrange $2$ red balls and $2$ blue balls? Well this is just a combination: namely $\\binom{4}{2}$ (reads $4$ choose $2$): i.e. the answer is $6$. But lets see, there are other outcomes! For example you could be making all the shots swell (so $4/4$) but I guess we only wan't ($2/4$) so the chance that we get the outcome we desire is: (the $2$ red $2$ blue ball permutations)/(total possibilities). i.e $\\binom{4}{2}/(\\binom{4}{0}+\\binom{4}{1}+\\binom{4}{2}+\\binom{4}{3}+\\binom{4}{4})$. which is: $1/4$. So for the first case (given that missing and making the shot share the same probability), you making $2$ out of four shots, is precisely going to happen $1/4$ of the time.\n\nSimilarly, for the $3/6$ we have: $\\binom{6}{3}/ (\\binom{6}{0}+\\binom{6}{1}+…) = 0.3125$. Notice $0.25 < 0.3125$ So clearly: you would have a better chance of making precisely $3/6$ shots than $2/4$ shots. An intuitive explanation behind this is that since $6$ shots are more than $4$, if you mess up a bit on the $6$ shot case, it's more likely that you can still make up for it, than with $4$ shots. Of course, if your question was: making at least $3/6$ shots versus making at least $2/4$ shots, then the calculations would be a bit different. How bout you find out what your odds are in that case?\n\nBtw, if the $\\binom{n}{k}$ business is new to you, I suggest you look up permutations and combinations (and their link to probability)!\n\n• Exactly 3 of 6 or at least 3 of 6 is a distinction without a difference, since in the former case, you can simply shoot until you get your 3, and then any shots you have left, you intentionally throw the ball nowhere near the hoop. – Matthew Najmon Feb 17 '14 at 19:50\n• I left my answer intentionally in that form as a means of promoting OP to solve the more \"realistic\" case. – Just_a_fool Feb 17 '14 at 20:20\n• Your computation for $n=4$ is wrong. You should be getting $p_4=3/8=6/2^4>5/2^4=20/2^6=p_6$ instead as expected. The more \"options\" you have, the less likely you are to hit the very specific number. – A.S. Feb 18 '16 at 7:53\n\nmore intuitively than the other answers:\n\nlet's say you succeed 60% of the time in average. due to the law of large numbers, the more you shoot the more likely your success frequency will be to approach this ration 0.6.\n\nshooting once is all or nothing. shooting infinitely many times is the certainty of success.\n\nSame goes for the opposite. If your real success rate is 0.4, you'd better try the least possible shoots.\n\nThe expectation of your average success remains the same, but not the variance/std deviation.\n\nAssume you make your shots with probability $p$ independent of each other. Then, the probability of making $k$ shots out of $n$ is $\\binom{n}{k} p^k (1-p)^{n-k}$ (That is, the number of shots you make out of $n$ baskets follows a Binomial(n,p) distribution).\n\nThe best free throw shooter in the NBA currently is Steve Nash, with $p=0.9041$. Calculate the probabilities for $n=4, k=2$ and $n=6,k=3$ and compare. You want the choice which gives you the higher probability.\n\noctave:85> bincoeff(4,2)p^2(1-p)^2\n\nans = 0.045105\n\noctave:86> bincoeff(6,3)p^3(1-p)^3\n\nans = 0.013036\n\nSo, you're better off taking the 2 out of the 4 shots in this model, if you're Steven Nash.\n\nThe problem is slightly different when you need to make at least 2 out of 4 shots versus at least 3 out of 6 shots. In this case, you need to sum the tail probabilities and compare them: The probability of making at least $k$ shots out of $n$ under our model is $\\sum_{i=k}^n \\binom{n}{i}p^i (1-p)^{n-i}$. I will leave you to calculate which one you're better off with in this case ($n=4,k=2$ and $n=6,k=3$ once again) [ The wording of the problem made it sound like you needed the exactly 2 out of 4 shots or exactly 3 out of 6 shots when I first read it ].\n\n• This assumes the task is to make exactly the number given, not at least the number given. – Ross Millikan Feb 16 '14 at 15:31\n• And that's exactly whats in the answer? Thats the binomial PMF , not the CDF. Edit: Ah, I see what you're saying. I'll update the answer. – Batman Feb 16 '14 at 15:32\n• The \"break even\" point is at $p=\\frac{21}{25}$. – Hagen von Eitzen Feb 16 '14 at 15:32\n• @Hagen: it's $p=\\frac35$ if you do the sums right. – TonyK Feb 16 '14 at 18:33\n• Exactly 3 of 6 or at least 3 of 6 is a distiction without a difference, since in the former case, you can simply shoot until you get your 3, and then any shots you have left, you intentionally throw the ball nowhere near the hoop. – Matthew Najmon Feb 16 '14 at 22:20\n\nAccording to the law of large number ( https://en.m.wikipedia.org/wiki/Law_of_large_numbers ). the more events you consider the closer will be the outcome to the expected result. In your case the expected outcome depends on actuall ability of you and your opponents in basketball playing. so if you know that you are truely a better performer to your opponents you should choose 3/6. otherwise 2/4."
] |
[
null,
"https://i.stack.imgur.com/Naze3.png",
null,
"https://i.stack.imgur.com/W6WZV.png",
null,
"https://i.stack.imgur.com/vsdVi.png",
null,
"https://i.stack.imgur.com/gDZBh.png",
null,
"https://i.stack.imgur.com/hcPVU.jpg",
null
] |
{"ft_lang_label":"__label__en","ft_lang_prob":0.8549476,"math_prob":0.9941943,"size":3633,"snap":"2021-31-2021-39","text_gpt3_token_len":1343,"char_repetition_ratio":0.10856985,"word_repetition_ratio":0.03773585,"special_character_ratio":0.39664188,"punctuation_ratio":0.19164883,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9976189,"pos_list":[0,1,2,3,4,5,6,7,8,9,10],"im_url_duplicate_count":[null,8,null,8,null,8,null,8,null,7,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2021-07-24T04:17:46Z\",\"WARC-Record-ID\":\"<urn:uuid:ceb2ff13-3b8f-4b35-9503-2a79cd14d4ad>\",\"Content-Length\":\"265566\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:a1a16363-1296-4180-9542-024862403bea>\",\"WARC-Concurrent-To\":\"<urn:uuid:0e446efa-8419-4a47-91da-bfbf6d4e0065>\",\"WARC-IP-Address\":\"151.101.129.69\",\"WARC-Target-URI\":\"https://math.stackexchange.com/questions/678515/probability-2-4-vs-3-6/678530\",\"WARC-Payload-Digest\":\"sha1:6A4IPN2U4QX63OSSZK6XAA4ZYZ5YCBMD\",\"WARC-Block-Digest\":\"sha1:QOV337SYNFXDRBPVYXCNTVPSZLUFEBGK\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2021/CC-MAIN-2021-31/CC-MAIN-2021-31_segments_1627046150129.50_warc_CC-MAIN-20210724032221-20210724062221-00382.warc.gz\"}"}
|
https://www.etutorworld.com/math/pre-calculus-tutoring.html
|
[
"# Precalculus Tutoring Online\n\nHome | Online Math Tutoring | Precalculus Tutor\n\n#### Schedule a Free Session",
null,
"## Learn about Linear, Non-Linear Equations, Factorization and more:\n\nSimplify algebraic and trigonometric expressions with Precalculus teachers who understand your abilities and requirements. Our aim is to enable you to understand precalculus concepts and solve complicated precalculus problems.\n\nMany advanced math concepts and theories are not covered in algebra, geometry and other courses in a student’s high school math curriculum. Precalculus commonly focuses on properties of functions along with the study of trigonometric, logarithmic and exponential functions. It includes topics about sequences, limits and other concepts crucial to the study of calculus.\n\nAs a regular student, you’ll be able to schedule tutoring sessions with your precalculus tutor at a time convenient to you.\n\nConnect to eTutorWorld and you will have a tutor to help you with Functions, Vectors, Matrices, Parameterizations, Conic Sections and of course the functioning of your Graphing Calculator. Our Learning by Design Methodology helps you understand precalculus concepts better, improve grades and prepare you for a bright and promising future.\n\nNo credit card is required, nor are you under any obligation to make a purchase.\n\nJust schedule the FREE TRIAL session to meet our expert tutor & get help.\n\n#### Inequalities\n\n• Systems of Inequalities\n• Graph Absolute Value Inequalities\n\n#### Absolute Value Equations\n\n• Transformations\n• Dilations\n• Reflections\n\n#### Complex Numbers\n\n• Imaginary Numbers\n• Operations with Complex Numbers\n• Graphing Complex Numbers\n\n#### Systems of Linear Equations\n\n• Solving Systems of Linear Equations\n\n• Greatest Common Factor\n• Multiplication Property Of Zero\n• Solving Quadratics not in the Standard Form\n• Parabolas\n• Completing the Square\n\n#### Geometry for Precalculus\n\n• Area and Circumference of a Circle\n• Midpoint and Distance Formula\n• The Pythagorean Theorem\n\n#### Functions\n\n• Domain and Range of a Function\n• Power of a Function\n• Operations with Functions\n• Graphing Functions\n• One-On-One Functions\n• Polynomial Functions\n\n#### Symmetry\n\n• Graphic Symmetry\n• Algebraic Symmetry\n• Numerical Symmetry\n\n#### Polynomials\n\n• Binomial Theorem\n• Factoring Polynomials in Quadratic Form\n• Dividing Polynomials\n• Long and Synthetic Division\n• Remainder and Factor Theorem\n\n#### Rational Expressions\n\n• Operations of Rational Expressions\n• Solve Rational Equations\n\n#### Exponential and Logarithmic Functions\n\n• Exponential growth and decay\n• Natural base\n• Logarithmic properties\n• Inverse of logarithmic functions\n\n#### Trigonometry Functions & Graphs\n\n• Sine and cosine Functions\n• Unit Circles\n• Special Right Triangles\n• Graphing sine and cosine transformations\n• Determining trigonometric identities using graphs\n\n#### Trigonometry Equations\n\n• Inverse Trigonometric Functions\n• Sinusoidal Functions\n\n#### Trigonometry Identities & Applications\n\n• Basic Trigonometric Identities\n• Pythagorean Identities\n• Double-Angle Identities\n• Law of Cosines\n• Law of Sines\n• Formulas for sine, cosine and tangent\n\n#### Vectors, Matrices and Determinants\n\n• Operations on Vectors\n• Operations on Matrices\n• Inverse of a matrix\nDeterminants\nGaussian elimination\nLinear Programming\n\n#### Mathematical Sequences and Series\n\n• The sigma and factorial notation.\n• Arithmetic sequences\n• Geometric sequences\n• Mathematical Induction\n• Binomial Theorem\n• Pascal’s Triangle\n\n#### Polar Coordinates and Parameterization and Conic Sections\n\n• Conversion between polar and rectangular coordinates.\n• Graph of functions in polar coordinates.\n• De Moivre’s Theorem\n• Parametric and Rectangular forms of equations.\n• Locus\n• Graphs of parabolas, ellipses and hyperbolas\n\n#### Limits & Continuity\n\n• Intermediate Value Theorem\n• Graphs to Define Limits\n• Determine Limits of Functions\n• Limits for Asymptotes and Infinity\n\nPractice is essential in precalculus and will lead to successful performance on exams. Tests and quizzes are given every precalculus topic studied.\n\n### Online Tutoring Pricing\n\nExpert 1-on-1 Personal Tutoring, Now Affordable to All. Every online tutoring session has 50 to 55 minutes of teaching time.\n\nNew Student Special (5 sessions)1 Month\\$79\\$89\n1 session1 Month\\$21\\$23\n5 sessions3 months\\$99\\$109\n10 sessions3 months\\$189\\$209\n15 sessions3 months\\$279\\$309\n20 sessions4 months\\$369\\$399\n50 sessions6 months\\$849\\$899\n\n#### Schedule a FREE precalculus session today and get started on your prep for future calculus courses.\n\nDuring your FREE tutoring session, our tutor will help you with basic and advanced topics in precalculus, give homework help and prepare you for upcoming precalculus tests.\n\nNo credit card is required, nor are you under any obligation to make a purchase. Just schedule the FREE TRIAL lesson to meet a tutor & get help on any topic you want!\n\nOur Learning by Design methodology focuses exclusively on the individual student. Our tutors are specially trained to identify and diagnose the needs and interests of each student and plan lessons accordingly.\n\n#### Find more about our Personalized Online Tutoring Learning Packages.\n\n+1-269-763-4602\n\n+1-269-763-5024\n\nResearch has proven that personal online tutoring not just cements school learning, it helps build student confidence. eTutorWorld provides the best K-12 Online Tutoring Services so you can learn from the comfort and safety of your home at an affordable cost.\n\nBe it an exam, class test or a quiz, eTutorWorld’s Math, Science and English tutors are responsible for your academic progress. Meet your personal coach at your convenient day and time to get help for Grade 3-12 Math, Science and English subjects and AP, SAT, SSAT and SCAT Test Prep help and test practice. All our tutors are graduates and bring with them years of teaching experience to the tutoring lessons.\n\nOur ‘Learning by Design’ methodology makes sure that each student is at the center of the teaching-learning process. All tutoring sessions start with a question to the student ‘What do you want to learn today?’ Hence, tutors diagnose your skills and recognize your requirements before the actual tutoring happens. Post every tutoring session, an individualized worksheet is emailed to the student to assimilate learned concepts. Regular formative assessments are used to evaluate a student’s understanding of the subject.\n\nThe state of the art technology used is stable, user friendly and safe. All you need is a computer or a tablet and an internet connection. The easy-to-use web conferencing software requires a one time download, using which the student can talk and chat to the tutor, annotate on an interactive shared whiteboard or even share documents, assignments or worksheets.\n\nAll tutoring sessions are recorded and made available for a month so you can review concepts taught.\n\nEmail or call our support team with any issues or questions – we are here for you 24X7.\n\nAlso, download free printable math and science worksheets in pdf format and solve SCAT and SSAT Practice Tests online. Sign up for a Free Trial Lesson Today!\n\nThousands have taken the eTutorWorld Advantage – what are you waiting for?"
] |
[
null,
"data:image/svg+xml,%3Csvg%20xmlns='http://www.w3.org/2000/svg'%20viewBox='0%200%200%200'%3E%3C/svg%3E",
null
] |
{"ft_lang_label":"__label__en","ft_lang_prob":0.80653995,"math_prob":0.71246976,"size":7409,"snap":"2019-51-2020-05","text_gpt3_token_len":1639,"char_repetition_ratio":0.13180284,"word_repetition_ratio":0.028243601,"special_character_ratio":0.19975705,"punctuation_ratio":0.06816221,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.95057136,"pos_list":[0,1,2],"im_url_duplicate_count":[null,null,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2019-12-15T01:13:17Z\",\"WARC-Record-ID\":\"<urn:uuid:fb4a0046-6469-4a35-b243-c7355f739b76>\",\"Content-Length\":\"149626\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:125a5ce1-2304-4954-882a-a051972be71c>\",\"WARC-Concurrent-To\":\"<urn:uuid:81cb3e8b-adaf-49d3-b681-2324806a6172>\",\"WARC-IP-Address\":\"192.124.249.70\",\"WARC-Target-URI\":\"https://www.etutorworld.com/math/pre-calculus-tutoring.html\",\"WARC-Payload-Digest\":\"sha1:JHTG3WEZBB2576NJYGTBXDCHLY7URUBQ\",\"WARC-Block-Digest\":\"sha1:KQ757Q6KQKPXWAXZNDVGXTSBZLYPXVG3\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2019/CC-MAIN-2019-51/CC-MAIN-2019-51_segments_1575541297626.61_warc_CC-MAIN-20191214230830-20191215014830-00089.warc.gz\"}"}
|
https://answers.everydaycalculation.com/multiply-fractions/5-10-times-7-3
|
[
"Solutions by everydaycalculation.com\n\nMultiply 5/10 with 7/3\n\n1st number: 5/10, 2nd number: 2 1/3\n\nThis multiplication involving fractions can also be rephrased as \"What is 5/10 of 2 1/3?\"\n\n5/10 × 7/3 is 7/6.\n\nSteps for multiplying fractions\n\n1. Simply multiply the numerators and denominators separately:\n2. 5/10 × 7/3 = 5 × 7/10 × 3 = 35/30\n3. After reducing the fraction, the answer is 7/6\n4. In mixed form: 11/6\n\nMathStep (Works offline)",
null,
"Download our mobile app and learn to work with fractions in your own time:\nAndroid and iPhone/ iPad\n\n×"
] |
[
null,
"https://answers.everydaycalculation.com/mathstep-app-icon.png",
null
] |
{"ft_lang_label":"__label__en","ft_lang_prob":0.8150808,"math_prob":0.9875278,"size":482,"snap":"2019-43-2019-47","text_gpt3_token_len":219,"char_repetition_ratio":0.20292887,"word_repetition_ratio":0.0,"special_character_ratio":0.49377593,"punctuation_ratio":0.070866145,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9712378,"pos_list":[0,1,2],"im_url_duplicate_count":[null,null,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2019-10-21T18:44:40Z\",\"WARC-Record-ID\":\"<urn:uuid:0157b78b-5fe0-4363-b05e-6e04d6c008c0>\",\"Content-Length\":\"8106\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:773cf953-ee94-4cb5-a3e2-2cf90bfd8b79>\",\"WARC-Concurrent-To\":\"<urn:uuid:d8eb3b5f-9c32-44ff-98e0-29c3873b53f7>\",\"WARC-IP-Address\":\"96.126.107.130\",\"WARC-Target-URI\":\"https://answers.everydaycalculation.com/multiply-fractions/5-10-times-7-3\",\"WARC-Payload-Digest\":\"sha1:MT7TT6QBYMBINSEJLIK2ZEWDBDELDRRG\",\"WARC-Block-Digest\":\"sha1:XBBZ6WNZ7LQ7S3PPNWVZZHPBEMOJWNNZ\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2019/CC-MAIN-2019-43/CC-MAIN-2019-43_segments_1570987781397.63_warc_CC-MAIN-20191021171509-20191021195009-00282.warc.gz\"}"}
|
https://trialsjournal.biomedcentral.com/articles/10.1186/s13063-021-05142-7/tables/3
|
[
"# Table 1 Outcome measures in the MONITOR-PsA cohort study\n\nProcedures Visits\nBaseline cohort\nWeek 0 Week 12 Week 24 Week 36 Week 48 Week 72 Week 96 Annually (after 96 weeks)\nInformed consent X\nDemographics X\nMedical history X X X X X X X X\nMedications X X X X X X X X\nPhysical examination X X X X X X X X\nRoutine blood tests (FBC, U&Es, LFTs, CRP and eGFR) X X X X X X X X\nImmunology (RF, ACPA, ANA) X\nRadiographs of hands/feet/spine X X X X\nEligibility assessment X\nAdherence X X X X X X X\n68/66 Joint count X X X X X X X X\nLeeds and SPARCC enthesitis index X X X X X X X X\nDactylitis count X X X X X X X X\nPsoriasis assessment (PASI and BSA) X X X X X X X X\nPhysician VAS X X X X X X X X\nMetrology with BASMI (if axial involvement) X X X X\nPatient questionnaires (VAS, HAQ, SF36, PsAID, WPAI, BASDAI, BASFI) X X X X X X X X\nTSQM questionnaire X X X X X X X\nEQ-5D-5L questionnaire X X X X X X\nHealthcare utilisation data X X X X X\nAdverse event assessments X X X X X X X X",
null,
""
] |
[
null,
"https://trialsjournal.biomedcentral.com/track/article/10.1186/s13063-021-05142-7",
null
] |
{"ft_lang_label":"__label__en","ft_lang_prob":0.6249296,"math_prob":0.53471607,"size":1301,"snap":"2022-27-2022-33","text_gpt3_token_len":667,"char_repetition_ratio":0.3299923,"word_repetition_ratio":0.23553719,"special_character_ratio":0.3535742,"punctuation_ratio":0.05204461,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.992167,"pos_list":[0,1,2],"im_url_duplicate_count":[null,1,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2022-07-07T00:33:34Z\",\"WARC-Record-ID\":\"<urn:uuid:27fe2bcc-7c3f-43e9-a946-6a61c53e5574>\",\"Content-Length\":\"181189\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:1b8cb386-eeee-4811-a47d-b717234da6c9>\",\"WARC-Concurrent-To\":\"<urn:uuid:6cf327ce-ecae-4b56-97d0-f2c094cd5bd8>\",\"WARC-IP-Address\":\"146.75.36.95\",\"WARC-Target-URI\":\"https://trialsjournal.biomedcentral.com/articles/10.1186/s13063-021-05142-7/tables/3\",\"WARC-Payload-Digest\":\"sha1:QPGMAPYTP7RUWAVR7NBVCUU5L7NM6LUY\",\"WARC-Block-Digest\":\"sha1:4BPSSWNZHKJPSZOV6OM3KGKW5KMJVT62\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2022/CC-MAIN-2022-27/CC-MAIN-2022-27_segments_1656104683020.92_warc_CC-MAIN-20220707002618-20220707032618-00786.warc.gz\"}"}
|
https://au.mathworks.com/help/physmod/sps/powersys/ug/thyristor-based-static-var-compensator.html
|
[
"## Thyristor-Based Static Var Compensator\n\n### Introduction\n\nThe example described in this section illustrates application of Simscape™ Electrical™ Specialized Power Systems software to study the steady-state and dynamic performance of a static var compensator (SVC) on a transmission system. The SVC is a shunt device of the Flexible AC Transmission Systems (FACTS) family using power electronics. It regulates voltage by generating or absorbing reactive power.\n\nDue to low frequencies of electromechanical oscillations in large power systems (typically 0.02 Hz to 2 Hz), this type of study usually requires simulation times of 30–40 seconds or more.\n\nThe SVC model described in this example is rather a detailed model of a particular SVC topology (using thyristor-controlled reactor (TCR) and thyristor-switched capacitors (TSCs)) with full representation of power electronics. This type of model requires discrete simulation at fixed time steps (50 µs in this case) and it is used typically for studying the SVC performance on a much smaller time range (a few seconds). Typical applications include optimizing of the control system, impact of harmonics, transients and stresses on power components during faults.\n\n### Description of the SVC\n\nThe single-line diagram of the modeled SVC is shown on Single-Line Diagram of the SVC. It represents a 300 Mvar SVC connected on a 735 kV transmission system.\n\nThis example is available in the `power_svc_1tcr3tsc` model. Load this model and save it in your working directory as `case2` to allow further modifications to the original system. This model is shown on SPS Model of the 300 Mvar SVC on a 735 kV Power System (power_svc_1tcr3tscs).\n\nSingle-Line Diagram of the SVC",
null,
"SPS Model of the 300 Mvar SVC on a 735 kV Power System (power_svc_1tcr3tscs)",
null,
"#### SVC Power Components\n\nThe SVC consists of a 735 kV/16 kV, 333 MVA coupling transformer, one 109 Mvar TCR bank and three 94 Mvar TSC banks (TSC1 TSC2 TSC3) connected on the secondary side of the transformer.\n\nSwitching the TSCs in and out allows a discrete variation of the secondary reactive power from zero to 282 Mvar capacitive (at 16 kV) by steps of 94 Mvar, whereas phase control of the TCR allows a continuous variation from zero to 109 Mvar inductive. Taking into account the leakage reactance of the transformer (0.15 pu), the SVC equivalent susceptance seen from the primary side can be varied continuously from -1.04 pu/100 MVA (fully inductive) to +3.23 pu/100 Mvar (fully capacitive).\n\nThe SVC Controller monitors the primary voltage and sends appropriate pulses to the 24 thyristors (6 thyristors per three-phase bank) to obtain the susceptance required by the voltage regulator.\n\nEach three-phase bank is connected in delta so that, during normal balanced operation, the zero-sequence tripplen harmonics (3rd, 9th,...) remain trapped inside the delta, thus reducing harmonic injection into the power system.\n\nThe power system is represented by an inductive equivalent (6000 MVA short circuit level) and a 200-MW load. The internal voltage of the equivalent system can be varied by means of a Three-Phase Programmable Voltage Source block to observe the SVC dynamic response to changes in system voltage.\n\n#### SVC Control System\n\nSVC Controller Model",
null,
"The SVC control system consists of the following four main modules:\n\n• Measurement System measures the positive-sequence primary voltage. This system uses discrete Fourier computation technique to evaluate fundamental voltage over a one-cycle running average window. The voltage measurement unit is driven by a phase-locked loop (PLL) to take into account variations of system frequency.\n\n• Voltage Regulator uses a PI regulator to regulate primary voltage at the reference voltage (1.0 pu specified in the SVC Controller block menu). A voltage droop is incorporated in the voltage regulation to obtain a V-I characteristic with a slope (0.01 pu/100 MVA in this case). Therefore, when the SVC operating point changes from fully capacitive (+300 Mvar) to fully inductive (-100 Mvar) the SVC voltage varies between 1-0.03=0.97 pu and 1+0.01=1.01 pu.\n\n• Distribution Unit uses the primary susceptance Bsvc computed by the voltage regulator to determine the TCR firing angle α and the status (on/off) of the three TSC branches. The firing angle α as a function of the TCR susceptance BTCR is implemented by a look-up table from the equation\n\n`${B}_{TCR}=\\frac{2\\left(\\pi -\\alpha \\right)+\\mathrm{sin}\\left(2\\alpha \\right)}{\\pi }$`\n\nwhere BTCR is the TCR susceptance in pu of rated TCR reactive power (109 Mvar)\n\n• Firing Unit consists of three independent subsystems, one for each phase (AB, BC and CA). Each subsystem consists of a PLL synchronized on line-to-line secondary voltage and a pulse generator for each of the TCR and TSC branches. The pulse generator uses the firing angle α and the TSC status coming from the Distribution Unit to generate pulses. The firing of TSC branches can be synchronized (one pulse is sent at positive and negative thyristors at every cycle) or continuous. The synchronized firing mode is usually the preferred method because it reduces harmonics faster. Verify that the Synchronized firing mode has been selected in the Firing Unit dialog box.\n\n### Steady-State and Dynamic Performance of the SVC\n\nNow observe the steady-state waveforms and the SVC dynamic response when the system voltage is varied. Run the simulation and observe waveforms on the SVC Scope block. These waveforms are reproduced below.\n\nWaveforms Illustrating SVC Dynamic Response to System Voltage Steps",
null,
"Initially the source voltage is set at 1.004 pu, resulting in a 1.0 pu voltage at SVC terminals when the SVC is out of service. As the reference voltage Vref is set to 1.0 pu, the SVC is initially floating (zero current). This operating point is obtained with TSC1 in service and TCR almost at full conduction (α = 96 degrees).\n\nAt t=0.1s voltage is suddenly increased to 1.025 pu. The SVC reacts by absorbing reactive power (Q=-95 Mvar) to bring the voltage back to 1.01 pu. The 95% settling time is approximately 135 ms. At this point all TSCs are out of service and the TCR is almost at full conduction (α = 94 degrees).\n\nAt t=0.4 s the source voltage is suddenly lowered to 0.93 pu. The SVC reacts by generating 256 Mvar of reactive power, thus increasing the voltage to 0.974 pu.\n\nAt this point the three TSCs are in service and the TCR absorbs approximately 40% of its nominal reactive power (α =120 degrees).\n\nObserve on the last trace of the scope how the TSCs are sequentially switched on and off. Each time a TSC is switched on the TCR α angle changes from 180 degrees (no conduction) to 90 degrees (full conduction). Finally, at t=0.7 s the voltage is increased to 1.0 pu and the SVC reactive power is reduced to zero.\n\nYou may open the Signal & Scopes subsystem to observe additional waveforms. The TCR voltage and current in branch AB as well as thyristors pulses are displayed on the TCR AB scope. The figure below zooms on three cycles when the firing angle α is 120 degrees.\n\nSteady-State Voltage and Current in TCR AB",
null,
"### Misfiring of TSC1\n\nThe final case study simulates a TSC misfiring.\n\nEach time a TSC is switched off a voltage remains trapped across the TSC capacitors. If you look at the TSC1 Misfiring scope inside the Signals & Scope subsystem, you can observe the TSC1 voltage (first trace) and the TSC1 current (second trace) for branch AB. The voltage across the positive thyristor (thyristor conducting the positive current) is shown on the third trace and the pulses sent to this thyristor are shown on the fourth trace. Notice that the positive thyristor is fired at maximum negative TSC voltage, when the valve voltage is minimum.\n\nIf by mistake the firing pulse is not sent at the right time, very large overcurrents can be observed in the TSC valves. Look inside the SVC Controller block for how a misfiring can be simulated on TSC1. A Timer block and an OR block are used to add pulses to the normal pulses coming from the Firing Unit.\n\nOpen the Timer block menu and remove the 100 multiplication factor. The timer is now programmed to send a misfiring pulse lasting one sample time at time t= 0.121 s.\n\nRestart simulation. Waveforms observed on the TSC1 Misfiring scope are reproduced below.\n\nTSC Voltages and Current Resulting from Misfiring on TSC1",
null,
"Observe that the misfiring pulse is sent when the valve voltage is maximum positive immediately after the TSC has blocked. This thyristor misfiring produces a large thyristor overcurrent (18 kA or 6.5 times the nominal peak current). Also, immediately after the thyristor has blocked, the thyristor voltage reaches 85 kV (3.8 times the nominal peak voltage). To prevent such overcurrents and overvoltages, thyristor valves are normally protected by metal oxide arresters (not simulated here)."
] |
[
null,
"https://au.mathworks.com/help/physmod/sps/powersys/ug/pe_applications6a.gif",
null,
"https://au.mathworks.com/help/physmod/sps/powersys/ug/pe_mdl1.gif",
null,
"https://au.mathworks.com/help/physmod/sps/powersys/ug/pe_mdl2.gif",
null,
"https://au.mathworks.com/help/physmod/sps/powersys/ug/pe_plot1.gif",
null,
"https://au.mathworks.com/help/physmod/sps/powersys/ug/pe_plot2.gif",
null,
"https://au.mathworks.com/help/physmod/sps/powersys/ug/pe_plot3.gif",
null
] |
{"ft_lang_label":"__label__en","ft_lang_prob":0.89071035,"math_prob":0.9133859,"size":8686,"snap":"2022-27-2022-33","text_gpt3_token_len":2002,"char_repetition_ratio":0.13695002,"word_repetition_ratio":0.022487702,"special_character_ratio":0.2166705,"punctuation_ratio":0.07485964,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.95172626,"pos_list":[0,1,2,3,4,5,6,7,8,9,10,11,12],"im_url_duplicate_count":[null,1,null,1,null,1,null,1,null,1,null,1,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2022-07-05T13:21:57Z\",\"WARC-Record-ID\":\"<urn:uuid:8e97fefe-2e4f-4e52-8545-4c35fa868059>\",\"Content-Length\":\"82441\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:5d38cf6b-f9e6-4255-9a07-4c29ddced935>\",\"WARC-Concurrent-To\":\"<urn:uuid:7630e30f-8c45-4477-ab7f-efff6c0ad862>\",\"WARC-IP-Address\":\"23.1.9.244\",\"WARC-Target-URI\":\"https://au.mathworks.com/help/physmod/sps/powersys/ug/thyristor-based-static-var-compensator.html\",\"WARC-Payload-Digest\":\"sha1:NAK2UJ3YSOAW7AFOPOYX22XRELDON7JV\",\"WARC-Block-Digest\":\"sha1:DCBSSS54BK57ZHCZHR4TINEKFSBKSCPR\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2022/CC-MAIN-2022-27/CC-MAIN-2022-27_segments_1656104576719.83_warc_CC-MAIN-20220705113756-20220705143756-00694.warc.gz\"}"}
|
https://developer.arm.com/docs/ddi0597/g/simd-and-floating-point-instructions-alphabetic-order/vcle-register-vector-compare-less-than-or-equal-an-alias-of-vcge-register
|
[
"You copied the Doc URL to your clipboard.\n\n## VCLE (register)\n\nVector Compare Less Than or Equal takes each element in a vector, and compares it with the corresponding element of a second vector. If the first is less than or equal to the second, the corresponding element in the destination vector is set to all ones. Otherwise, it is set to all zeros.\n\nThis is a pseudo-instruction of VCGE (register). This means:\n\n• The encodings in this description are named to match the encodings of VCGE (register).\n• The assembler syntax is used only for assembly, and is not used on disassembly.\n• The description of VCGE (register) gives the operational pseudocode for this instruction.\n\nIt has encodings from the following instruction sets: A32 ( A1 and A2 ) and T32 ( T1 and T2 ) .\n\n### A1\n\n 31 30 29 28 27 26 25 24 23 22 21 20 19 18 17 16 15 14 13 12 11 10 9 8 7 6 5 4 3 2 1 0 1 1 1 1 0 0 1 U 0 D size Vn Vd 0 0 1 1 N Q M 1 Vm\n\n#### 64-bit SIMD vector (Q == 0)\n\nVCLE{<c>}{<q>}.<dt> {<Dd>, }<Dn>, <Dm>\n\nis equivalent to\n\nVCGE{<c>}{<q>}.<dt> <Dd>, <Dm>, <Dn>\n\n#### 128-bit SIMD vector (Q == 1)\n\nVCLE{<c>}{<q>}.<dt> {<Qd>, }<Qn>, <Qm>\n\nis equivalent to\n\nVCGE{<c>}{<q>}.<dt> <Qd>, <Qm>, <Qn>\n\n### A2\n\n 31 30 29 28 27 26 25 24 23 22 21 20 19 18 17 16 15 14 13 12 11 10 9 8 7 6 5 4 3 2 1 0 1 1 1 1 0 0 1 1 0 D 0 sz Vn Vd 1 1 1 0 N Q M 0 Vm\n\n#### 64-bit SIMD vector (Q == 0)\n\nVCLE{<c>}{<q>}.<dt> {<Dd>, }<Dn>, <Dm>\n\nis equivalent to\n\nVCGE{<c>}{<q>}.<dt> <Dd>, <Dm>, <Dn>\n\n#### 128-bit SIMD vector (Q == 1)\n\nVCLE{<c>}{<q>}.<dt> {<Qd>, }<Qn>, <Qm>\n\nis equivalent to\n\nVCGE{<c>}{<q>}.<dt> <Qd>, <Qm>, <Qn>\n\n### T1\n\n 15 14 13 12 11 10 9 8 7 6 5 4 3 2 1 0 15 14 13 12 11 10 9 8 7 6 5 4 3 2 1 0 1 1 1 U 1 1 1 1 0 D size Vn Vd 0 0 1 1 N Q M 1 Vm\n\n#### 64-bit SIMD vector (Q == 0)\n\nVCLE{<c>}{<q>}.<dt> {<Dd>, }<Dn>, <Dm>\n\nis equivalent to\n\nVCGE{<c>}{<q>}.<dt> <Dd>, <Dm>, <Dn>\n\n#### 128-bit SIMD vector (Q == 1)\n\nVCLE{<c>}{<q>}.<dt> {<Qd>, }<Qn>, <Qm>\n\nis equivalent to\n\nVCGE{<c>}{<q>}.<dt> <Qd>, <Qm>, <Qn>\n\n### T2\n\n 15 14 13 12 11 10 9 8 7 6 5 4 3 2 1 0 15 14 13 12 11 10 9 8 7 6 5 4 3 2 1 0 1 1 1 1 1 1 1 1 0 D 0 sz Vn Vd 1 1 1 0 N Q M 0 Vm\n\n#### 64-bit SIMD vector (Q == 0)\n\nVCLE{<c>}{<q>}.<dt> {<Dd>, }<Dn>, <Dm>\n\nis equivalent to\n\nVCGE{<c>}{<q>}.<dt> <Dd>, <Dm>, <Dn>\n\n#### 128-bit SIMD vector (Q == 1)\n\nVCLE{<c>}{<q>}.<dt> {<Qd>, }<Qn>, <Qm>\n\nis equivalent to\n\nVCGE{<c>}{<q>}.<dt> <Qd>, <Qm>, <Qn>\n\n### Assembler Symbols\n\n Is the 64-bit name of the second SIMD&FP source register, encoded in the \"M:Vm\" field.\n Is the 64-bit name of the first SIMD&FP source register, encoded in the \"N:Vn\" field.\n Is the 128-bit name of the second SIMD&FP source register, encoded in the \"M:Vm\" field as *2.\n Is the 128-bit name of the first SIMD&FP source register, encoded in the \"N:Vn\" field as *2.\n For encoding A1 and A2: see Standard assembler syntax fields. This encoding must be unconditional. For encoding T1 and T2: see Standard assembler syntax fields.\n\n<dt> For encoding A1 and T1: is the data type for the elements of the operands, encoded in U:size:\nU size <dt>\n0 00 S8\n0 01 S16\n0 10 S32\n1 00 U8\n1 01 U16\n1 10 U32\nFor encoding A2 and T2: is the data type for the elements of the vectors, encoded in sz:\nsz <dt>\n0 F32\n1 F16\n Is the 128-bit name of the SIMD&FP destination register, encoded in the \"D:Vd\" field as *2.\n\nIs the 64-bit name of the SIMD&FP destination register, encoded in the \"D:Vd\" field.\n\n### Operation\n\nThe description of VCGE (register) gives the operational pseudocode for this instruction."
] |
[
null
] |
{"ft_lang_label":"__label__en","ft_lang_prob":0.5905319,"math_prob":0.9593761,"size":3045,"snap":"2021-04-2021-17","text_gpt3_token_len":1226,"char_repetition_ratio":0.14041434,"word_repetition_ratio":0.60066557,"special_character_ratio":0.4811166,"punctuation_ratio":0.08895265,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.96550214,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2021-01-28T15:19:06Z\",\"WARC-Record-ID\":\"<urn:uuid:a0370d76-5454-481a-82ff-6839cba4192f>\",\"Content-Length\":\"152342\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:97bbfe9e-54d7-44fb-a5ba-a7fd90751d50>\",\"WARC-Concurrent-To\":\"<urn:uuid:75fdc0e4-5886-4b1d-a078-9a2c6cf0aefa>\",\"WARC-IP-Address\":\"23.199.177.163\",\"WARC-Target-URI\":\"https://developer.arm.com/docs/ddi0597/g/simd-and-floating-point-instructions-alphabetic-order/vcle-register-vector-compare-less-than-or-equal-an-alias-of-vcge-register\",\"WARC-Payload-Digest\":\"sha1:MJPVAF7BEFQDZ4PSQTHIZF7Q3ALTB3QV\",\"WARC-Block-Digest\":\"sha1:RK2KRYCBOWTWDWGI4PVOOUTVCZC32SK2\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2021/CC-MAIN-2021-04/CC-MAIN-2021-04_segments_1610704847953.98_warc_CC-MAIN-20210128134124-20210128164124-00798.warc.gz\"}"}
|
https://www.run4unblocked.com/how-to-know-the-order-of-the-reaction.html
|
[
"# How To Know The Order Of The Reaction?",
null,
"Order of the reaction is the part of the chemical reaction which determines the relationship between the rate of a chemical reaction and the concentration of the species involved in the chemical reaction. Order of the reaction depends on the chemical concentration of the reactants involved in the chemical reaction.\n\nThe first-order reaction dependents entirely on the concentration of one of the reactants involved in the chemical reaction. Some characteristics of the reaction in order of reaction are listed below.\n\n• The number of species of reactants involved along with the concentration of the reactants directly affects the rate of reaction.\n• The value of the order of reaction can be in the form of a fraction or an integer. It can even have a value of zero.\n• The order of a reaction is not dependent on the stoichiometric coefficients that are corresponding to each species in the balanced chemical reaction.\n• It can be obtained by adding all the exponents of the concentration terms in the rate expression.\n• The reaction order of a chemical reaction is defined with the help of reactant concentrations and not with product concentrations.\n\nThe rate of the reaction is determined by rate law or rate equation and is given by\n\nr = k[A]x[B]y\n\nWhere,\n\n[A] and [B] = concentration of the species involved in a chemical reaction\n\nx and y = partial orders of reaction for A and B\n\nr = rate of reaction\n\nk= rate constant\n\nOverall reaction = x+y\n\n### Know The Energy Level Of Atoms And Molecules\n\nAs we know the atoms and molecules of the elements contains electrons. Electrons are the chief components responsible for determining the energy level of an atom. Electrons are assumed to 4 different energy levels that are used to describe the trajectory and the movement of an electron in an atom. This 4 numbers which represent the energy level of the electron is known as Quantum numbers. The quantum numbers of all the electrons in a given atom must comply with the Schrödinger wave equation for the hydrogen atom.\n\n4 quantum numbers are described below:\n\n• To (describes the energy level) principal quantum number = n\n• azimuthal quantum number or Orbital angular momentum quantum number, denoted by l.\n• Magnetic quantum number = m or ml.\n• The electron spin quantum number = ms or s.\n\nQuantum Number Values\n\nAccording to the Pauli exclusion principle, no 2 electrons in an atom can have the same set of quantum numbers. Each quantum number is represented by a half-integer or integer value.\n\n1. The principal quantum number is an integer that represents the number of the electron’s shell. The value shall not be 0 or negative and shall be 1 higher than 1\n2. The angular momentum quantum number is an integer that is the value of the electron’s orbital (e.g., s=0, p=1). ℓ is greater than or equal to zero and less than or equal to n-1.\n3. The magnetic quantum number represents the orientation of the orbital. They are usually integers ranging from -ℓ to ℓ. So, for the p orbital, where ℓ=1, m could have values of -1, 0, 1.\n4. half-integer value that is either -1/2 or 1/2 is known as the spin quantum number.\n\nFor more information on quantum numbers, refer BYJU’S"
] |
[
null,
"https://www.run4unblocked.com/wp-content/uploads/2019/05/run4unblock-1852019.jpg",
null
] |
{"ft_lang_label":"__label__en","ft_lang_prob":0.8984238,"math_prob":0.9960232,"size":3151,"snap":"2022-40-2023-06","text_gpt3_token_len":678,"char_repetition_ratio":0.19351764,"word_repetition_ratio":0.031021899,"special_character_ratio":0.20945731,"punctuation_ratio":0.06949153,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.99545455,"pos_list":[0,1,2],"im_url_duplicate_count":[null,4,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2022-10-07T23:06:18Z\",\"WARC-Record-ID\":\"<urn:uuid:022243d1-f6c5-49f4-87cc-374740bc6938>\",\"Content-Length\":\"93139\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:4bcf8632-03f5-4325-b3f3-aa69694fac97>\",\"WARC-Concurrent-To\":\"<urn:uuid:43966c43-96ed-4e90-a552-3f03a32da61d>\",\"WARC-IP-Address\":\"185.61.154.25\",\"WARC-Target-URI\":\"https://www.run4unblocked.com/how-to-know-the-order-of-the-reaction.html\",\"WARC-Payload-Digest\":\"sha1:Z67UVD6SFQ3COHQKO3PID2XZX3EMAEVC\",\"WARC-Block-Digest\":\"sha1:53INEMRUUIFBXWSRLGRHTJB26DCJCKWG\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2022/CC-MAIN-2022-40/CC-MAIN-2022-40_segments_1664030338280.51_warc_CC-MAIN-20221007210452-20221008000452-00287.warc.gz\"}"}
|
https://ijcsm.springeropen.com/articles/10.1186/s40069-020-00438-5
|
[
"# Hydration Model and Evaluation of the Properties of Calcined Hwangtoh Binary Blends\n\n## Abstract\n\nCalcined hwangtoh is a pozzolanic material that is increasingly being used as a mineral admixture in the concrete industry. This study shows a hydration model for cement–hwangtoh blends and evaluates the various properties of hwangtoh-blended concrete using reaction degrees of binders. First, a kinetic reaction model is proposed for analyzing the pozzolanic reaction of hwangtoh. The reaction of hwangtoh includes three processes: the initial dormant period, boundary reaction process, and diffusion process. The mutual interactions between the binary reactions of cement and hwangtoh are thought to be in line with the items in capillary water and calcium hydroxide. Second, the reaction degrees of cement and hwangtoh are determined based on a blended hydration model. Furthermore, the chemical (chemically combined water and calcium hydroxide contents), mechanical (compressive strength), thermal (hydration heat), and durability aspects (carbonation depth) of hwangtoh-blended concrete are systematically predicted. The results show good agreement with experimental results.\n\n## 1 Introduction\n\nHwangtoh is an environmentally friendly material and belongs to the family of clay. Hwangtoh can purify indoor air by absorption, and it is widely used in hospital buildings for reducing sick building syndrome, including sore throat and headaches. On the other hand, after calcination at about 800 ℃, the phase compositions of hwangtoh are changed, and calcined hwangtoh shows pozzolanic reactivity. The pozzolanic reaction of hwangtoh can increase late-age strength of concrete. Summarily, calcined hwangtoh is increasingly used in the cement and concrete industry because of its unique environmentally friendly characteristics and chemical reactivity (Kim et al. 2017).\n\nMany experimental investigations have been performed on the hydration, mechanical, durability, and thermal properties of hwangtoh-blended concrete. Go et al. (2010, 2009) reported that the optimal temperature for thermal activation of hwangtoh is about 800 ℃, thermally activated hwangtoh shows clear pozzolanic activity, and the hydration heat of hwangtoh-blended concrete is lower than that of control concrete. Koo et al. (2014) found the drying shrinkage and carbonation depth of hwangtoh-blended concrete are higher than that in control concrete, and the flexural failure mode of hwangtoh-blended concrete is similar to that of plain concrete. Koo et al. (2015) presented a comparison with a plain environment, where mice in the hwangtoh-blended environment showed higher food and water intake, higher fertility rate, and healthier offspring. Yang et al. (2014) reported a comparison with Portland cement concrete. The slope of the ascending zone of the stress–strain curve of hwangtoh-blended concrete is smaller, and the descending zone is steeper. Lin et al. (2019) found that, compared with plain concrete, hwangtoh-blended concrete shows higher late-age strength because of the secondary reaction of hwangtoh. Kim et al. (2012) showed that, based on microwave heating, alkali-activated natural hwangtoh shows high early-age strength. Kwon et al. (2017) presented that after addition of silica fume, the compressive strength of calcium hydroxide activated hwangtoh significantly improved. Yang et al. (2010) found the mechanical properties of alkali-activated hwangtoh-based concrete were significantly influenced by the water-to-binder ratio, not by the sand-to-aggregate ratio. Using hwangtoh, styrene butadiene latex, and shape-stabilized phase change materials, Yang et al. produced hwangtoh boards for building thermal insulation (Yang et al. 2019).\n\nSome numerical models have been proposed for optimal design and performance evaluation of cement-based materials. Perez-Cortes and Escalante-Garcia (2020) made statistical optimization design of alkaline binders of limestone–metakaolin and determined the optimal combinations using the desirability function approach considering strength and sustainability. Sonebi et al. (2020) made the optimal design of rheological parameters of super sulfated cement grouts and captured the significant trends of the tested parameters using statistical models considering bleeding, permeability, and mechanical properties. Yu et al. (2018) predicted the early-age creep and creep recovery of cement paste using a two-step homogenization method and highlighted the effects of the microstructure evolution and inherent creep of C–S–H on the early-age creep. Zhou et al. (2019) analyzed the development of microstructure of cement pastes using a diffusion-based model and considered the effects of particle size distribution, water/cement ratio, temperature, and the ambient humidity. These studies (Perez-Cortes and Escalante-Garcia 2020; Sonebi et al. 2020; Yu et al. 2018; Zhou et al. 2019) show numerical modeling are effective for material design and predictions of material properties.\n\nAlthough many experimental studies have been performed on the various qualities of hwangtoh-blended concrete, the theoretical models about hwangtoh-blended concrete are extremely limited. To rationally use hwangtoh in the concrete industry, this research suggested a hydration-based framework that could assess the chemical, mechanical, thermal, and durable qualities of hwangtoh-blended concrete. The blended hydration model correspondingly simulates the hwangtoh reaction and cement hydration. The mutual interactions between the reactions of cement and hwangtoh are thought to be in line with the items in capillary water and calcium hydroxide. In addition, the different qualities are evaluated using reaction amounts of binders and concrete mixtures.\n\n## 2 Hydration-Based Simulation Framework\n\n### 2.1 Cement Hydration Model\n\nWang (2019) and Wang and Lee (2019) proposed a hydration model of Portland cement. The hydration model considers the influences of cement compound compositions, cement fineness, concrete mix ratio, and curing conditions on the rate of cement hydration. The hydration degree of cement $$\\alpha$$ can be determined as $$\\alpha { = }\\int_{0}^{{\\text{t}}} {\\left( {\\frac{d\\alpha }{{dt}}} \\right)} dt$$, where $$\\frac{d\\alpha }{{dt}}$$ is the hydration rate. The detailed equation about $$\\frac{d\\alpha }{{dt}}$$ is available in our former studies (Wang 2019; Wang and Lee 2019). The kinetic processes involved in cement hydration, for example, initial dormant period, boundary reaction process, and diffusion-controlled process, are within the suggested hydration model. The input parameter for the cement hydration model is cement mineral compositions and fineness, concrete mix ratio, and curing conditions. The output parameter of the cement hydration model is the reaction amount of cement versus time. The hydration model views the decrease in the rate of hydration because of the lack of capillary water for concrete, which has a lower water-to-cement ratio. Therefore, the hydration model is applicable for concrete with ordinary strength and high strength. In line with the Portland cement hydration model, Wang (2019) and Wang and Lee (2019) evaluated the strength development, adiabatic temperature rise, carbonation, and chloride ingress of Portland cement concrete.\n\nHowever, the previous models of Wang (2019) and Wang and Lee (2019) is not valid for hwangtoh-blended concrete because the model does not cover the reaction of hwangtoh. To systematically evaluate hwangtoh-blended concrete, a hydration model that considers the binary reactions of cement and hwangtoh is necessary.\n\n### 2.2 Hwangtoh Reaction Model\n\nThis section shows the kinetic reaction model of hwangtoh. The reaction model was obtained based on experimental studies of kinetic hydration processes of cement–hwangtoh blends and the material properties of hwangtoh. The evolution of the reaction degree of hwangtoh with time can be determined using the kinetic reaction model.\n\nLin et al. measured the isothermal heat release of hwangtoh-blended paste (Lin et al. 2019). They found the kinetic hydration procedure for cement–hwangtoh blends was comparable with Portland cement. The hydration of cement–hwangtoh blends includes initial dormant period, boundary reaction process, and diffusion process. Go et al. (2010) reported that hwangtoh is a pozzolanic material that can interact with calcium hydroxide. In cement–hwangtoh blends, the hydration of cement produces calcium hydroxide, and the reaction of hwangtoh consumes calcium hydroxide. The content of remained calcium hydroxide in cement–hwangtoh blends is dependent on both cement hydration and hwangtoh reaction. Moreover, as a pozzolanic material, the reaction of hwangtoh relies upon the quantity of remained calcium hydroxide in cement–hwangtoh blends. In thinking about the kinetic reaction procedure for cement–hwangtoh blends and material signs of hwangtoh, the kinetic reaction equation of hwangtoh can be established as follows:\n\n$$\\frac{{d\\alpha_{HT} }}{dt} = \\frac{{m_{CH} (t)}}{P}\\frac{{3\\rho_{w} }}{{v_{HT} r_{HT0} \\rho_{HT} }}\\frac{1}{{(\\frac{1}{{k_{dHT} }} - \\frac{{r_{HT0}^{{}} }}{{D_{eHT} }}) + \\frac{{r_{HT0}^{{}} }}{{D_{eHT} }}(1 - \\alpha_{HT} )^{{\\frac{ - 1}{3}}} + \\frac{1}{{k_{rHT} }}(1 - \\alpha_{HT} )^{{\\frac{ - 2}{3}}} }},$$\n(1)\n$$k_{dHT} = \\frac{{B_{HT} }}{{(\\alpha_{HT} )^{1.5} }} + C_{HT} *(\\alpha_{HT} )^{3} ,$$\n(2)\n$$D_{eHT} = D_{eHT0} *\\ln (\\frac{1}{{\\alpha_{HT} }}),$$\n(3)\n\nwhere $$\\alpha_{HT}$$ is the reaction degree of hwangtoh; $$t$$ is time; $$m_{CH} (t)$$ is the calcium hydroxide (CH) mass in a unit volume of hydrating cement–hwangtoh blends; $$P$$ is the mass of hwangtoh in the mixture proportion; $$v_{HT}$$ is the stoichiometric ratio of hwangtoh to CH [$$\\nu_{HT} = 0.87$$ (Dunster et al. 1993; Papadakis 1999)]; $$r_{HT0}$$ is the radius of the hwangtoh particle;$$\\rho_{HT}$$ is the density of the hwangtoh; $$k_{dHT}$$ is the reaction rate coefficient in the initial dormant period ($$B_{HT}$$ and $$C_{HT}$$ are coefficients); $$D_{eHT0}$$ is the initial diffusion coefficient; and $$k_{rHT}$$ is the reaction rate coefficient in the boundary reaction process.\n\nWithin the model, the quantity of capillary water and CH left within the cement–hwangtoh binary system were adopted as control indicators for reactions of binders. The levels of CH ($$m_{CH} (t)$$), chemically combined water ($$W_{cbm}$$), and capillary water ($$W_{cap}$$) in cement–hwangtoh blends during hydration can be established using the following equations:\n\n$$m_{CH} (t) = RCH_{CE} *C_{0} *\\alpha - \\nu_{HT} *\\alpha_{HT} *P,$$\n(4)\n$$W_{cap} = W_{0} - 0.4*C_{0} *\\alpha - 0.46*\\alpha_{HT} *P,$$\n(5)\n$$W_{cbm} = v*C_{0} *\\alpha + 0.21*\\alpha_{HT} *P,$$\n(6)\n\nwhere $$RCH_{CE}$$ is the mass of depleted CH as 1 g of cement hydrate. In Eq. (4), the items $$RCH_{CE} *C_{0} *\\alpha$$ and $$\\nu_{HT} *\\alpha_{HT} *P$$ consider the formation of CH from cement hydration and the depletion of CH due to the hwangtoh reaction. As shown in Eqs. (5) and (6), when 1 g of hwangtoh reacts, 0.21 g combined water is produced and 0.46 g capillary water is consumed (Dunster et al. 1993; Papadakis 1999; Wang 2014). As proven in Eqs. (4, 5, 6), the evolution of CH, chemically combined water, and capillary water in blended concrete relates to both the hwangtoh reaction and cement hydration.\n\n### 2.3 Properties Evaluation of Hardening Hwangtoh-Blended Concrete\n\nFor cement–hwangtoh blends, the hydration products of binders fill pore spaces and lead to the introduction of compressive strength. However, given a particular binder content, a growing water content lowers the concrete strength. The introduction of concrete compressive strength generally starts after the final setting of concrete. Thinking about the reactions of binders, the pore spaces of concrete, and the beginning duration of strength development, the development of strength of hwangtoh-blended concrete can be established utilizing a straight line equation as follows:\n\n$$f_{c} (t) = A_{1} *\\frac{{C_{0} *\\alpha }}{{W_{0} }} + A_{2} *\\frac{{P*\\alpha_{HT} }}{{W_{0} }} - A_{3} ,$$\n(7)\n\nwhere $$A_{1}$$,$$A_{2}$$, and $$A_{3}$$ are strength coefficients. $$A_{1}$$ and $$A_{2}$$ represent the contribution of cement and hwangtoh on strength development, respectively. For concrete with various mixtures at different curing ages, the values of $$A_{1}$$,$$A_{2}$$, and $$A_{3}$$ are constants. Equation (7) shows the concrete strength does not start at mixing time t = 0, but it starts after a threshold time (Sun et al. 2019). This is similar to the concept of final setting. Final setting means the concrete has started to harden, and this is the beginning of developing the concrete strength (Xu et al. 2017).\n\nThe hydration heat of concrete depends on both the hwangtoh reaction and cement hydration. The total released heat can be expressed as the sum of the hwangtoh reaction and cement hydration as follows:\n\n$$\\frac{dQ}{{dt}} = C_{0} *H_{C} *\\frac{d\\alpha }{{dt}} + P*H_{HT} *\\frac{{d\\alpha_{HT} }}{dt},$$\n(8)\n\nwhere $$H_{C}$$ and $$H_{HT}$$ are the specific heat generation of the cement and hwangtoh, respectively. $$H_{C}$$ can be determined from mineral compositions of cement. The value of $$H_{HT}$$ was proposed as 330 J/g (Riding et al. 2012; Williams 2016). The term $$C_{0} *H_{C} *\\frac{d\\alpha }{{dt}}$$ considers the heat release from the hydration of cement, and the term $$P*H_{HT} *\\frac{{d\\alpha_{HT} }}{dt}$$ considers the heat release from the hwangtoh reaction.\n\nBecause of the hwangtoh reaction and cement hydration, the porosity of the hydrating concrete was reduced since hydration started. Papadakis (2000, 1999) and Maekawa et al. (2009) proposed that the total porosity of hydrating concrete can be determined as\n\n$$\\varepsilon = \\frac{{W_{0} }}{{\\rho_{w} }} - \\frac{{W_{{{\\text{cbm}}}} }}{{\\rho_{{{\\text{cbm}}}} }},$$\n(9)\n\nwhere $$\\varepsilon$$ is concrete porosity, and $$\\rho_{{{\\text{cbm}}}}$$ is the density of chemically combined water ($$\\rho_{{{\\text{cbm}}}}$$ = 1.25 g/cm3). The term $$\\frac{{W_{{{\\text{cbm}}}} }}{{\\rho_{{{\\text{cbm}}}} }}$$ means the volume of chemically combined water. Because combined water $$W_{{{\\text{cbm}}}}$$ depends on the binary reactions of cement and hwangtoh, concrete porosity is a function of concrete mixtures and the reaction degree of binders.\n\n### 2.4 Evaluation of Carbonation Depth of Hwangtoh-Blended Concrete\n\nWhen hwangtoh is used as a partial binder in concrete, the carbonation depth increases. In other words, the carbonation durability may be the controlling factor that determines the service life of hwangtoh-blended concrete in an atmospheric environment. The evaluation of carbonation depth is essential for real applications of hwangtoh in concrete structural elements.\n\nCarbonation resistance relates to both internal factors (concrete material properties) and external factors (exposure conditions). The content of carbonated substances, CO2 diffusivity, CO2 concentration, and exposure time will affect the carbonation depth. When the relative humidity in the exposure environment is higher than 55%, carbonation is a diffusion-controlled process. The carbonation depth $$x_{c}^{{}}$$ can be determined as follows (Chen and Gao 2019; Chen et al. 2019; Papadakis 2000):\n\n$$x_{c}^{{}} = \\sqrt {\\frac{{2D_{C} ([CO_{2} ]_{{0}} /100)t}}{{0.33{\\text{CH}} + 0.214{\\text{CSH}}}}} ,$$\n(10)\n$$D_{C} = A\\left( {\\frac{{\\varepsilon { - }\\Delta \\varepsilon_{C} }}{{\\frac{{C_{0} }}{{\\rho_{c} }} + \\frac{P}{{\\rho_{HT} }} + \\frac{{W_{0} }}{{\\rho_{w} }}}}} \\right)^{a} \\left( {1 - \\frac{RH}{{100}}} \\right)^{2.2} ,$$\n(11)\n$$CSH(t) = 2.85(f_{S,C} *C_{0} *\\alpha + f_{S,P} *P*\\alpha_{HT} ),$$\n(12)\n\nwhere $$D_{C}$$ is CO2 diffusivity in the carbonated zone of concrete, and $$[CO_{2} ]_{{0}}$$ is the CO2 concentration in the exposure environment; CSH is the mass of calcium silicate hydrate in concrete; and $$\\Delta \\varepsilon_{C}$$ is the porosity reduction of concrete because of carbonation. $$\\Delta \\varepsilon_{C}$$ can be calculated based on the change of solid volume between reactants and products(Papadakis 2000); RH is the relative humidity of the exposure environment. A and a are parameters of carbonation and can be regressed based on measurement results of carbonation depths. The influence of environmental temperature on CO2 diffusion can be described using the Arrhenius law (Papadakis 2000, 1999).\n\nEquation 12 shows the calculation of CSH. $$f_{S,C}$$ and $$f_{S,P}$$ denote the mass percentages of SiO2 in cement and hwangtoh, respectively. For hwangtoh-blended concrete, both the hwangtoh reaction and cement hydration produce CSH (Riding et al. 2012; Williams 2016; Xu et al. 2017). In Eq. 12, the terms $$f_{S,C} *C_{0} *\\alpha$$ and $$f_{S,P} *P*\\alpha_{HT}$$ mean the formation of CSH from the hwangtoh reaction and cement hydration, respectively. The coefficient 2.85 is the molar weight ratio of CSH to SiO2 in CSH (Papadakis 1999, 2000).\n\nIn line with the suggested hydration model, the quantity of CH and CSH and the extent of porosity could be acquired as connected results throughout the hydration duration of cement–hwangtoh blends. In addition, the carbonation depth could be predicted by utilizing Eqs. 10, 11, and 12.\n\n### 2.5 Summary of Simulation Framework\n\nFigure 1 shows a flowchart of the simulation. First, based on the blended hydration model and concrete mixtures, the reaction degree of binders can be calculated. Furthermore, combined water, CH, and CSH contents can be determined using the reaction degree of binders and concrete mix ratios. The development of strength and hydration heat can be evaluated considering both the hwangtoh reaction and cement hydration. Second, CO2 diffusivity can be determined based on concrete porosity and environmental conditions. Moreover, carbonation depth can be calculated considering the contents of carbonated substances, CO2 diffusivity, and CO2 concentration in the exposure environment. Summarily, the reaction degrees of cement and hwangtoh are key factors for evaluating the various properties of hardening and hardened hwangtoh-blended concrete.\n\n## 3 Verification of the Proposed Model\n\nAs shown in Sect. 2, the proposed model can evaluate various properties of hwangtoh-blended concrete. To verify the proposed model, multiple checks were performed, such as chemical (experimental tests of combined water and CH), mechanical (compressive strength test), thermal (hydration heat), and durability aspects (carbonation depth test). Through these systematic verifications, the validations of the proposed model are shown.\n\n### 3.1 Evaluation of the Properties of Hardening Concrete\n\nExperimental results in our previous study (Lin et al. 2019) were used to verify the evaluation of the properties of hardening concrete. In our previous studies, the property development of hwangtoh-blended paste with various water-to-binder ratios (W/B 0.5 and 0.2) and hwangtoh replacement ratios (0, 10%, and 20%) was measured. The specimens with a W/B 0.5 represent concrete with ordinary strength, and the specimens with a W/B 0.2 represent ultra-high-performance concrete. Table 1 shows chemical compositions of hwangtoh and cement. Figure 2 shows XRD pattern of calcined hwangtoh, which contains quartz, feldspar, and a small amount of illite. The paste specimens are sealed cured until the aging tests. At the curing ages of 3, 7, and 28 days, the contents of combined water and CH were measured using thermogravimetric analysis, and the strengths of specimens were measured using a compression machine. The isothermal heat evolution was measured in the early 3-day period using TAM-air.\n\nThe temperature range of thermogravimetric analysis (TGA) tests was between room temperature and 1050℃. Nitrogen was continuously supplied throughout the test. As shown in Fig. 3a, b (TGA results at the ages of 28 days), there are three peaks of the differential thermal analysis (DTA) curve. The first peak occurs at about 160 ℃, which corresponds to the dehydroxylation of CSH and AFm (Weerdt et al. 2011). The second peak occurs at about 450 ℃, which corresponds to the decomposition of calcium hydroxide (Weerdt et al. 2011). The third peak occurs at about 700 ℃, which corresponds to the decarbonation of calcite (Weerdt et al. 2011). There are several sources of calcite, such as the limestone powder in cement or the carbonation of specimens while preparing the specimens of TGA (Weerdt et al. 2011). In Korea, the Portland cement contains a small amount (3%-5%) limestone powder (Jeong et al. 2020; Additional file 1: Figures S1, TGA of cement), which is the main reason of the decarbonation peak at 700℃ (Additional file 1: Figures S2 the decarbonation peak of cement and paste). As proposed by De Weerdt et al. (2011), for the specimen with limestone powder, to mitigate the influence of decarbonation stage, non-evaporable water (H) and calcium hydroxide (CH) were calculated at 105–550 ℃ and 400–550 ℃, respectively. The contents of CH can be determined as follows (Weerdt et al. 2011):\n\n$${\\text{CH}}\\, = \\,\\left( {{\\text{W}}_{{{4}00}} - {\\text{ W}}_{{{55}0}} } \\right)/{\\text{W}}_{{{55}0}} *\\left( {{74}/{18}} \\right),$$\n(13)\n\nwhere W400 and W550 are the weights at 400 and 550 ℃, respectively. The item (74/18) means the molar weight ratio of CH to water. The content of non-evaporable water (H) can be determined as follows (Weerdt et al. 2011):\n\n$${\\text{H}}\\, = \\,\\left( {{\\text{W}}_{{{1}0{5}}} - {\\text{ W}}_{{{55}0}} } \\right)/{\\text{W}}_{{{55}0}} ,$$\n(14)\n\nwhere W105 is the weight at 105 ℃.\n\nFor hwangtoh-blended concrete, the hwangtoh reaction and cement hydration occurred concurrently. Cement hydration generated CH, and reaction of hwangtoh consumed CH. The generation of CH from cement hydration can be determined based on the cement hydration model. Moreover, the consumption of CH can indicate the reaction degree of hwangtoh. Using the measurement results of CH of cement–hwangtoh blends, the coefficients of the reaction model of hwangtoh are determined and shown in Table 2. These coefficients do not change with W/B or hwangtoh substitution ratios.\n\nThe calculation results of CH are shown in Fig. 3c, d. For plain paste without hwangtoh, the content of CH kept increasing at all the ages. In early age, the CH content increased rapidly. At late age, diffusion was the mechanism that controlled cement hydration, and the CH content increased slowly. On the other hand, for cement–hwangtoh-blended paste, the content of CH was less than plain paste. This is because of the reduction of the cement content and the consumption of CH from the hwangtoh reaction. Especially, at the late age, the content of CH decreased due to the proceeding of the hwangtoh reaction (Han and Yan 2015; Han et al. 2017).\n\nFigure 4 shows the reaction degree of binders such as cement or hwangtoh. As shown in Fig. 4a, for the specimen with W/B 0.5, when hwangtoh replaced partial cement, the water-to-cement ratio increased; hence, the hydration degree of cement increased. This is called the dilution effect of hwangtoh addition. On the other hand, Fig. 4b shows the reaction degree of cement for the specimen with W/B 0.2. From Fig. 4a, b, it can be seen that the dilution effect became obvious with the decreasing water-to-binder ratios. In addition, Fig. 4c presents the reaction level of hwangtoh for various mixtures. It can be seen that as W/B decreased, the reaction level of hwangtoh decreased. This was due to the limitations of available filling space for hydration products. As the hwangtoh replacement ratio increased, the reaction level of hwangtoh also decreased. This was due to the reduction of alkali activation of CH. Compared to the hydration degree of cement (shown in Fig. 4a, b), the reaction degree of hwangtoh was much lower (shown in Fig. 4c) (Glosser et al. 2019).\n\nReaction degrees of cement and hwangtoh are fundamental parameters for evaluating properties of hwangtoh-blended concrete. Based on Eq. (6), the combined water can be determined. As shown in Fig. 5a, when hwangtoh replaced partial cement, the content of combined water decreased. This is because the reactivity of hwangtoh is low compared to cement. As shown in Fig. 5b, as W/B reduced, the content of combined water decreased. This tendency agrees with the trend of the reaction level of binders (Castellano et al. 2016; Riding et al. 2012).\n\nThe hydration heat of cement–hwangtoh blends can be evaluated based on the reaction levels of binders. Figure 6 shows the calculation results of hydration heat. In the first 5 h, cement hydration was in the dormant period, and the hydration heat slowly increased. After the initial dormant period, because the boundary reaction process controls hydration, the hydration heat rapidly increased. On the other hand, after the addition of hwangtoh, the hydration heat decreased. This is because the reactivity of hwangtoh is low compared to cement (Lin et al. 2019).\n\nEquation (7) is a linear equation that can evaluate the strength development of hardening concrete. Using the experiment results of specimen strengths, the coefficients $$A_{1}$$,$$A_{2}$$, and $$A_{3}$$ of Eq. (7) were determined to be 58.74, 109.15, and 33.57, respectively. These coefficients did not change with specimen mixtures or curing ages. The prediction results are shown in Fig. 7. First, for the plain specimen, the strength rapidly increased at an early age. At the late age, the increment of strength was not obvious and the strength curve showed a plateau, while for the hwangtoh-blended specimen, at the late age, the increment of strength was much more obvious than that of the plain specimen. This is due to the slow reaction of hwangtoh that can contribute to the strength development of concrete (Li et al. 2017; Shao et al. 2019). Second, as the W/B decreased from 0.5 to 0.2, the intercept of the strength curve on the x-axis (starting time of strength) decreased. This means the specimen with a lower W/B ratio can develop strength much faster than the specimen with a higher W/B ratio (Han and Yan 2015; Han et al. 2017; Sun et al. 2019). Third, as shown in Fig. 7g, the prediction results showed agreement with measurement results. The correlation coefficient between measurement and evaluation results is 0.993, which proves the validity of proposed strength model. In addition, the proposed strength model is verified using experimental data from another source. Lin et al. (2020) measured the strength development of blended paste with 45% hwangtoh as the binder. The water/binder ratio of paste was 0.5. At the ages of 1, 3, 7, and 28 days, the compressive strength was measured. Using the strength analysis model, the strengths of plain paste and hwangtoh-blended paste are shown in Fig. 7h. The analysis results show agreement with experimental results. Because the reaction of hwangtoh is much slower than that of cement, the starting time of strength of hwangtoh-blended paste is retarded compared with plain paste. Moreover, the 28-day strength of high-volume hwangtoh-blended paste is much lower than that of control paste.\n\nThe strength activity index is defined as the ratio of the strength of the hwangtoh–cement blends to the strength of the plain specimen at each specific curing time (Maekawa et al. 2009). At the curing age 28 days, when water/binder is 0.5, the strength activity index for 10% hwangtoh and 20% hwangtoh specimen are 1.17 and 1.13, respectively, while when water/binder is 0.2, the strength activity index for 10% hwangtoh and 20% hwangtoh specimen are 1.09 and 1.06, respectively. Summarily, the strength activity index of hwangtoh is dependent on water/binder ratio, hwangtoh replacement levels, and curing ages.\n\nBesides the experimental results of our previous study (Lin et al. 2019), experimental results from Go et al.(2010) are used to verify the proposed hydration model. Go et al. (2010) made thermal analysis of hydrated plain paste and 20% hwangtoh-blended paste at the ages of 14 days and 28 days. The water/binder ratio of paste specimens was 0.6. The temperature of thermal analysis ranges from 25℃ to 950℃. Based on the experimental results of thermal analysis, the content of calcium hydroxide for the unit mass of binder can be determined. Figure 8 shows the comparisons between calculation results and experimental results of calcium hydroxide contents (Go et al. 2010). The calculation results show agreement with experimental results. Due to the dilution effect and pozzolanic reaction of hwangtoh, calcium hydroxide content in blended concrete is much lower than plain concrete.\n\n### 3.2 Evaluation of Carbonation Depth\n\nThe experimental study on the carbonation depth of hwangtoh-blended concrete in reference (Koo et al. 2014) was used to verify the proposed model. The W/B of the specimen was 0.55, and the content of binder was 339 kg/m3. The hwangtoh replacement ratios were 0 and 20%. After 2-month curing, concrete specimens were moved into a CO2 chamber for accelerated carbonation tests. The CO2 concentration in the CO2 chamber was 5%, the relative humidity was 60%, and the temperature was 20 ℃. Carbonation depth was measured at 1, 4, 8, 12, and 25 weeks using the phenolphthalein color change method. Because the hydration of binders essentially stops when relative humidity is less than 80%, further hydration of hwangtoh and cement in the carbonation test period was ignored in this study (Maekawa et al. 2009).\n\nIn line with the blended cement hydration model, the items in carbonated substances (CH and CSH) and concrete porosity can be established. First, as proven in Fig. 9a, the CH content of 20% hwangtoh-blended concrete was less than that in plain concrete. Particularly, the CH content decreased in the late ages. Second, as proven in Fig. 9b, at the beginning, the CSH content of hwangtoh-blended concrete was less than that in plain concrete, while at late age, the CSH content of hwangtoh-blended concrete exceeded that of plain concrete. This is because the hwangtoh reaction proceeded, and also the silica content in hwangtoh is a lot greater than that in cement. Third, as proven in Fig. 9c, the porosity of hwangtoh-blended concrete was greater than that of plain concrete. This trend is comparable with fly ash or slag blended concrete (Han et al. 2017).\n\nAccording to experimental outcomes of carbonation depth, the coefficients of carbonation model A, along with a are determined as 1.34e−6 and 1.8, correspondingly. The coefficients are comparable with those of Papadakis’ study (2000). These coefficients do not change with concrete mixtures and curing conditions. According to the hydration-based carbonation model, the carbonation depth of concrete can be determined. As proven in Fig. 10, the carbonation depth of hwangtoh-blended concrete was a lot greater than that of plain concrete. This really is due to the fact that after adding hwangtoh, the content of CH reduced, and also the porosity and CO2 diffusivity increased.\n\nBesides the experimental results of Koo et al. (2014), experimental results from Choi et al. (2001) are used to verify the proposed carbonation model. Choi et al. (2001) measured carbonation depths of plain concrete, and 20% hwangtoh-blended concrete. The water/binder ratio of concrete specimens was 0.55, the water content was 179 kg/m3, and the binder content was 325 kg/m3. Accelerated carbonation tests started after 28 days of standard curing. The temperature, CO2 concentration, and relative humidity of acceleration carbonation tests were 20 ℃, 5 and 60%, respectively. After 1-, 2-, 4-, 8-, 10- and 12-week exposure, carbonation depths of concrete were measured using the phenolphthalein indicator method. Figure 11 shows the comparisons between calculation results and experimental results of carbonation depths (Choi et al. 2001). The calculation results show general agreement with experimental results. The replacement of partial cement with hwangtoh increases the carbonation depth of concrete.\n\n### 3.3 Discussion\n\nThis study shows a hydration-based integrated model for cement–hwangtoh blends. The validation range and the weak points of the proposed model are shown as follows:\n\nFirst, this study considers several water/binder ratios (0.5, 0.55, 0.6, 0.2) and hwangtoh/binder ratios (10, 20, and 45%). The water/binder ratio 0.2 represents the cases of high-strength concrete and ultra-high-performance concrete, which have a low water/binder ratio and show incomplete hydration due to a shortage of capillary water. The water/binder ratios 0.50, 0.55, and 0.6 represent the cases of ordinary-strength concrete, which have a high water/binder ratio and show sufficient hydration at long-term ages. Hence, the proposed model is valid for both ordinary-strength concrete and high-strength concrete.\n\nSecond, hwangtoh is a pozzolanic material and can be used to replace partial cement for concrete production. In construction practices, the replacement levels of hwangtoh are generally lower than 20%. When the replacement level of calcined hwangtoh is lower than 20%, the long-term compressive strength of hwangtoh-blended concrete is comparable or higher than plain concrete. Summarily, the proposed model covers the general replacement levels of hwangtoh in construction practices.\n\nThird, the limitations of the proposed method are summarized as follows:\n\n1. (1)\n\nThe proposed model mainly focuses on concrete with a moderate hwangtoh (less than 20%). For concrete with a high-volume hwangtoh, the reaction of hwangtoh may depend on phase concentration of pore solution and ion movement between inner and outer hydration products (Maekawa et al. 2009; Wang 2014). The hwangtoh reaction model (Eqs. (1), (2), and (3)) may need revisions for considering pore solution and ion movement.\n\n2. (2)\n\nThe effects of curing temperature on hwangtoh reaction, strength development, and durability aspect are not covered in this study. Compared with cement, the pozzolanic reaction of hwangtoh may be much more sensitive with temperature (Wang 2014). More experimental study and theoretical modeling should be carried out to clarify the dependence of hwangtoh reaction on temperature.\n\n3. (3)\n\nThe proposed model cannot evaluate the phase assemblage of hydrating cement–hwangtoh blends. In the future study, to accurately evaluate the phase assemblage, the proposed kinetic model should combine with a thermodynamic program, such as Gibbs Energy Minimization (GEM) program (Lothenbach et al. 2019). Moreover, the durability aspects, such as carbonation and chloride, may be evaluated based on phase assemblage of concrete.\n\n## 4 Conclusions\n\nThis research shows an integrated model that simulates the binary hydration of cement–hwangtoh blends and assesses the various properties of cement–hwangtoh blends.\n\nFirst, a kinetic model was suggested for the hwangtoh reaction. The reaction of hwangtoh was segmented into three stages: the initial dormant period, boundary reaction process, and diffusion process. The suggested model views the dependence of hwangtoh reaction on the CH content. The interaction between the hwangtoh reaction and cement hydration was clarified through CH and capillary water content.\n\nSecond, the coefficients of the hwangtoh reaction model were determined in line with the experimental outcomes of CH content of cement–hwangtoh blends. The coefficients of the reaction model are constants for a number of concrete mixtures. The reaction amounts of cement and hwangtoh were determined using blended hydration model. In addition, the combination of water and hydration heat was determined in light of the contributions of hwangtoh reaction and cement hydration.\n\nThird, a hydration-based straight line equation was suggested for evaluating the growing strength of hwangtoh-blended concrete. The coefficients of the strength development model are constants for a number of concrete mixtures. The correlation coefficient between the evaluation and experimental results was 0.993, which proves the suggested strength model applies for ordinary-strength concrete and ultra-high-strength concrete that contains hwangtoh.\n\nFourth, the contents of carbonated substances and porosity were determined from the hydration model. The CO2 diffusivity was determined considering the concrete porosity and the relative humidity of the exposure environment. Moreover, the carbonation depth was determined based on a diffusion-controlled equation. The coefficient of the carbonation model did not change for various concrete mixtures. The carbonation model can reflect the increase of carbonation depth due to hwangtoh additions.\n\nFifth, in a further study, a revised hydration model should be proposed to consider the phase concentration of pore solution, ion movement between inner and outer reaction products, and different curing temperatures. Moreover, the combination of the proposed kinetic model with a thermodynamic program should be carried out for evaluating the phase assemblage and durability aspects of concrete.\n\n## Availability of data and materials\n\nThe data used to support the findings of this study are available from the corresponding author upon request.\n\n## References\n\n• Castellano, C. C., Bonavetti, V. L., Donza, H. A., & Irassar, E. F. (2016). The effect of w/b and temperature on the hydration and strength of blast furnace slag cements. Construction and Building Materials, 111, 679–688.\n\n• Chen, T., & Gao, X. (2019). Effect of carbonation curing regime on strength and microstructure of Portland cement paste. J CO2 Util, 34, 74–86.\n\n• Chen, T., Gao, X., & Qin, L. (2019). Mathematical modeling of accelerated carbonation curing of Portland cement paste at early age. Cement and Concrete Research, 120, 187–197.\n\n• Choi, H.-Y., Choi, S.-W., Lee, K.-W., Hwang, H.-Z., Kim, M.-H. (2001). An experimental study on the carbonation and resistance to sulfate attack of concrete with hwangtoh admixture, Proceedings of the Architectural Institute of Korea-Structure & Construction. Architectural Institute of Korea, 21, pp. 353–356.\n\n• Dunster, A., Parsonage, J., & Thomas, M. (1993). The pozzolanic reaction of metakaolinite and its effects on Portland cement hydration. Journal of materials science, 28, 1345–1350.\n\n• Glosser, D., Choudhary, A., Isgor, O., & Weiss, W. (2019). Investigation of reactivity of fly ash and its effect on mixture properties. ACI Materials Journal, 116, 193–200.\n\n• Go, S., Chung, C., Struble, L., & Lee, H. (2010). Pozzolanic activity of Hwangtoh clay. Construction and Building Materials, 24, 2638–2645.\n\n• Go, S., Lee, H., Lee, J., Kim, J., & Chung, C. (2009). Experimental investigation of mortars using activated Hwangtoh. Construction and Building Materials, 23, 1438–1445.\n\n• Han, F., & Yan, P. (2015). Hydration characteristics of slag-blended cement at different temperatures. Journal of Sustainable Cement-Based Materials, 4, 34–43.\n\n• Han, F., Zhang, Z., & Liu, J. (2017). Effect of water-to-binder ratio on the hydration kinetics of composite binder containing slag or fly ash. Journal of Thermal Analysis and Calorimetry, 128, 855–865.\n\n• Jeong, Y., Kang, S.-H., Kim, M. O., & Moon, J. (2020). Acceleration of cement hydration from supplementary cementitious materials: Performance comparison between silica fume and hydrophobic silica. Cement and Concrete Composites, 112, 103688.\n\n• Kim, B., Yi, C., & Kang, K. (2012). Characteristics of alkali-activated natural hwangtoh paste utilizing microwave heating. Journal of the Korea Institute of Building Construction, 12, 503–509.\n\n• Kim, H., Kim, C., Jeon, J., Lee, S., & Park, C. (2017). Performance evaluation and field application of red clay green roof vegetation blocks for ecological restoration projects. Sustainability, 9, 357–372.\n\n• Koo, B., Kim, J., Kim, S., & Mun, S. (2014). Material and structural performance evaluations of hwangtoh admixtures and recycled PET fiber-added eco-friendly concrete for CO2 emission reduction. Materials, 7, 5959–5981.\n\n• Koo, B., Kim, J., Kim, T., & Kim, B. (2015). Material performance and animal clinical studies on performance-optimized hwangtoh mixed mortar and concrete to evaluate their mechanical properties and health benefits. Materials, 8, 6257–6276.\n\n• Kwon, Y., Kang, S., Hong, S., & Moon, J. (2017). Intensified pozzolanic reaction on kaolinite clay-based mortar. Applid Science, 7, 522–534.\n\n• Li, C., Zhu, H., Wu, M., Wu, K., & Jiang, Z. (2017). Pozzolanic reaction of fly ash modified by fluidized bed reactor-vapor deposition. Cement and Concrete Research, 92, 98–109.\n\n• Lin, R.-S., Park, K.-B., Wang, X.-Y., & Zhang, G.-Y. (2020). Increasing the early strength of high-volume Hwangtoh–cement systems using bassanite. Journal of Building Engineering, 30, 101317.\n\n• Lin, R., Wang, X., Lee, H., & Cho, H. (2019). Hydration and microstructure of cement pastes with calcined hwangtoh clay. Materials, 12, 458–478.\n\n• Lothenbach, B., Kulik, D. A., Matschei, T., Balonis, M., Baquerizo, L., Dilnesa, B., et al. (2019). Cemdata18: A chemical thermodynamic database for hydrated Portland cements and alkali-activated materials. Cement and Concrete Research, 115, 472–506.\n\n• Maekawa, K., Ishida, T., & Kishi, T. (2009). Multi-scale modeling of structural concrete. London and New York: Taylor & Francis.\n\n• Papadakis, V. G. (1999). Effect of fly ash on Portland cement systems Part I. Low-calcium fly ash. Cement and Concrete Research, 29, 1727–1736.\n\n• Papadakis, V. (2000). Effect of supplementary cementing materials on concrete resistance against carbonation and chloride ingress. Cement and Concrete Research, 30, 291–299.\n\n• Perez-Cortes, P., & Escalante-Garcia, J. I. (2020). Design and optimization of alkaline binders of limestone-metakaoline A comparison of strength, microstructure and sustainability with Portland cement and geopolymers. Journal of Cleaner Production, 273, 123118.\n\n• Riding, K., Poole, J., Folliard, K., Juenger, M., & Schindler, A. (2012). Modeling hydration of cementitious systems. ACI Materials Journal, 109, 225–250.\n\n• Shao, J., Gao, J., Zhao, Y., & Chen, X. (2019). Study on the pozzolanic reaction of clay brick powder in blended cement pastes. Construction and Building Materials, 213, 209–215.\n\n• Sonebi, M., Abdalqader, A., Fayyad, T., Perrot, A., & Bai, Y. (2020). Optimisation of rheological parameters, induced bleeding, permeability and mechanical properties of supersulfated cement grouts. Construction and Building Materials, 262, 120078.\n\n• Sun, J., Shen, X., Tan, G., & Tanner, J. (2019). Compressive strength and hydration characteristics of high-volume fly ash concrete prepared from fly ash. Journal of Thermal Analysis and Calorimetry, 136, 565–580.\n\n• Wang, X.-Y. (2014). Properties prediction of ultra high performance concrete using blended cement hydration model. Construction and Building Materials, 64, 1–10.\n\n• Wang, X. (2019). Simulation for optimal mixture design of low-CO2 high-volume fly ash concrete considering climate change and CO2 uptake. Cement and Concrete Composites, 104, 103408.\n\n• Wang, X., & Lee, H. (2019). Effect of global warming on the proportional design of low CO2 slag-blended concrete. Construction and Building Materials, 225, 1140–1151.\n\n• Weerdt, K. D., Haha, M. B., Saout, G. L., Kjellsen, K. O., Justnes, H., & Lothenbach, B. (2011). Hydration mechanisms of ternary Portland cements containing limestone powder and fly ash. Cement and Concrete Research, 41, 279–291.\n\n• Williams, A. (2016). Cracking potential and temperature sensitivity of metakaolin concrete. USA: University of South Florida.\n\n• Xu, G., Tian, Q., Miao, J., & Liu, J. (2017). Early-age hydration and mechanical properties of high volume slag and fly ash concrete at different curing temperatures. Construction and Building Materials, 149, 367–377.\n\n• Yang, K., Hwang, H., & Lee, S. (2010). Effects of water-binder ratio and fine aggregate-total aggregate ratio on the properties of hwangtoh-based alkali-activated concrete. Journal of Materials in Civil Engineering, 22, 887–896.\n\n• Yang, K., Mun, J., & Hwang, H. (2014). Stress-strain relationship of Ca(OH)2-activated hwangtoh concrete. The Scientific World Journal, 2014, 846805.\n\n• Yang, S., Wi, S., Lee, J., Jeon, J., & Kim, S. (2019). Thermal performance evaluation of Hwangtoh board developed with styrene butadiene latex/SSPCM. Construction and Building Materials, 200, 310–317.\n\n• Yu, P., Duan, Y. H., Chen, E., Tang, S. W., Hanif, A., & Fan, Y. L. (2018). Microstructure-based homogenization method for early-age creep of cement paste. Construction and Building Materials, 188, 1193–1206.\n\n• Zhou, W., Duan, L., Tang, S. W., Chen, E., & Hanif, A. (2019). Modeling the evolved microstructure of cement pastes governed by diffusion through barrier shells of C-S–H. Journal of Materials Science, 54, 4680–4700.\n\nNot applicable.\n\n## Funding\n\nThis research was supported by the Basic Science Research Program through the National Research Foundation of Korea (NRF) funded by the Ministry of Science, ICT & Future Planning (No. 2015R1A5A1037548), and an NRF grant (NRF-2020R1A2C4002093).\n\n## Author information\n\nAuthors\n\n### Contributions\n\nData curation, HSL and XYW; formal analysis, XYW; methodology, HSL; supervision, XYW; writing—original draft, HSL and XYW. Both authors read and approved the final manuscript.\n\n### Authors' information\n\nHan-Seung Lee is a full professor in the Department of architectural engineering at Hanyang University, Korea.\n\nXiao-Yong Wang is an associate professor in the Department of architectural engineering and Department of Integrated Energy and Infra System at Kangwon National University, Korea.\n\n### Corresponding author\n\nCorrespondence to Xiao-Yong Wang.\n\n## Ethics declarations\n\n### Competing interests\n\nI confirmed that I have read Springer Open’s guidance on competing interests and have included a statement indicating that none of the authors have any competing interests in the manuscript.\n\n### Publisher's Note\n\nSpringer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.\n\nJournal information: ISSN 1976-0485 / eISSN 2234-1315\n\n## Supplementary Information\n\n### Additional file 1: Figure S1.\n\nTGA of cement. Figure S2. The decarbonation peak of cement and paste.\n\n## Rights and permissions",
null,
""
] |
[
null,
"https://ijcsm.springeropen.com/track/article/10.1186/s40069-020-00438-5",
null
] |
{"ft_lang_label":"__label__en","ft_lang_prob":0.8872734,"math_prob":0.95947355,"size":45161,"snap":"2023-14-2023-23","text_gpt3_token_len":10941,"char_repetition_ratio":0.20198418,"word_repetition_ratio":0.057867263,"special_character_ratio":0.23664224,"punctuation_ratio":0.16771068,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.98842025,"pos_list":[0,1,2],"im_url_duplicate_count":[null,2,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2023-03-28T14:53:17Z\",\"WARC-Record-ID\":\"<urn:uuid:1875e536-d28b-4817-a4f0-9787c3184363>\",\"Content-Length\":\"358468\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:03670d79-9a9a-4ef3-aac1-3fbb325fbd49>\",\"WARC-Concurrent-To\":\"<urn:uuid:997e8bc8-f91e-4fac-9630-37469374d0a3>\",\"WARC-IP-Address\":\"146.75.32.95\",\"WARC-Target-URI\":\"https://ijcsm.springeropen.com/articles/10.1186/s40069-020-00438-5\",\"WARC-Payload-Digest\":\"sha1:RJZG7AKNPAYYAX3XWXAQHOAVO52RK5GB\",\"WARC-Block-Digest\":\"sha1:3UZ3WEUWV7E23BLBCFO7AQGKHIEK4F2C\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2023/CC-MAIN-2023-14/CC-MAIN-2023-14_segments_1679296948867.32_warc_CC-MAIN-20230328135732-20230328165732-00535.warc.gz\"}"}
|
https://dcwaterpump.com/how-important-is-the-max-head-of-a-pump/
|
[
"# How important is the Max Head of a pump?",
null,
"## Your first parameter consideration while choosing a water pump?\n\nThere are two important parameters marked on the label of pumps: Max Head and Max Flow Rate. They are essential factors you need to consider when you choose a pump. If I ask which one is your first consideration, most people might say ‘Max Flow Rate.’\n\nThe Flow Rate will determine the amount of time you need to move the required fluid. So it’s really important. But unfortunately, that is the wrong answer.\n\n## You should consider the Max Head at first\n\nFirst, let’s figure out the concepts of Max Head and Max Flow rate.\n\nWhat does ‘Max Head’ mean?\n\nMax Head refers to a pump’s capability to push water upwards (also known as ‘vertical lift’). What is often overlooked is that at its max head lift, the pump will deliver zero flow!\n\nHow about ‘Max Flow Rate’? Max Flow Rate means a pump’s capability to transfer fluid volume. It can achieve the max value only when the head lift is zero.\n\nSo why do I think the Max Head is more important than the Max Flow Rate? Because most of the time, we need to pump the fluid to a desired height. We won’t transfer water horizontally. We must first make sure that the pump can deliver the liquid to the required level.\n\n## Max Head affects the Actual Flow Rate to a great extent.\n\nNow we know the marked Max Flow Rate is just an ideal value. In actual work, it is impossible to outreach the Max Flow Rate marked. It only represents the performance capacity of a pump. This means that the Actual Flow Rate is not equal to the Max Flow Rate. The actual flow rate is the data we should be concerned about.\n\nWhen the pump works, its Actual Flow Rate is inversely proportional to the required height. When the pump delivers the fluid to a higher point, its Actual Flow Rate decreases. The Actual Flow Rate’s decay rate will increase sharply as the required height is close to the Max Head. You should generally let the pump run within its typical operating area to get the best performance (Refer to the Curves Graph above).\n\nNow, let’s use an example to illustrate Max Head’s impact on the Actual Flow Rate. To give you an idea, take our two models to demonstrate the problem: DC50A-2450 and DC50E-24150. Click the link in the text to enter the details page of the model.\n\nThe Sub-Model List table clearly indicates that they have the same rated voltage and rated current, which means that they have the same rated power. Now let’s take a look at their differences.\n\nAs can be seen from the performance curves of the two models:\n\nWhen the required height equals 3 meters, the Actual Flow Rate of both models is 20 liters per minute.\n\nWhen the required height is more than 3 meters, the Actual Flow Rate of DC50E-24150 is greater. When the needed height is less than 3 meters, the Actual Flow Rate of DC50A-2450 is greater.\n\nSo, if you want to pump water to the vertical height of 4 meters or even higher, of course, DC50E-24150 is a better choice.\n\n## Summary\n\nWhen we choose a pump, we shouldn’t just focus on the marked Max Flow Rate. We should consider the Max Head at first. Because the Actual Flow Rate is not equal to the Max Flow Rate. The Max Head determines whether the pump can reach your desired height. It also determines the pump’s Actual Flow Rate at work."
] |
[
null,
"data:image/svg+xml,%3Csvg%20xmlns='http://www.w3.org/2000/svg'%20viewBox='0%200%20800%20534'%3E%3C/svg%3E",
null
] |
{"ft_lang_label":"__label__en","ft_lang_prob":0.90681833,"math_prob":0.9594052,"size":3332,"snap":"2022-40-2023-06","text_gpt3_token_len":752,"char_repetition_ratio":0.17007211,"word_repetition_ratio":0.06467662,"special_character_ratio":0.23049219,"punctuation_ratio":0.09011628,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9742137,"pos_list":[0,1,2],"im_url_duplicate_count":[null,null,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2022-09-30T22:48:14Z\",\"WARC-Record-ID\":\"<urn:uuid:b7ccf848-e0d8-4d2a-ac70-fa5bfbf3927d>\",\"Content-Length\":\"153125\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:32ac8837-603b-4f7e-92a3-95ef19e55ef0>\",\"WARC-Concurrent-To\":\"<urn:uuid:dc388674-05ba-4cf3-9ac3-7022f6439a24>\",\"WARC-IP-Address\":\"104.21.26.39\",\"WARC-Target-URI\":\"https://dcwaterpump.com/how-important-is-the-max-head-of-a-pump/\",\"WARC-Payload-Digest\":\"sha1:IFBSKBNOAPAAWZDAS67F7KU6PEVQGMTS\",\"WARC-Block-Digest\":\"sha1:XGC7U4MXDZAKW7USS2REVWO6FIY53MT2\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2022/CC-MAIN-2022-40/CC-MAIN-2022-40_segments_1664030335504.37_warc_CC-MAIN-20220930212504-20221001002504-00350.warc.gz\"}"}
|
https://energyeducation.ca/encyclopedia/Permeability_of_free_space
|
[
"# Permeability of free space\n\nThe permeability of free space, μ0, is a physical constant used often in electromagnetism. It is defined to have the exact value of 4π x 10-7 N/A2 (newtons per ampere squared). It is connected to the energy stored in a magnetic field, see Hyperphysics for specific equations.\n\nIt is related to the speed of light by the equation:\n\nwhere\n\nA magnetic field, in a region of space has field energy associated with it. That energy density is defined as:\n\nEnergy\n\nOne particular use is the magnetic force. The constant gives how strong the force is between two electric currents separated by a distance:\n\nwhere\n\n• is the Magnetic force,\n• and are two currents, and\n• is the separation between the wires carrying the currents."
] |
[
null
] |
{"ft_lang_label":"__label__en","ft_lang_prob":0.89860874,"math_prob":0.99240166,"size":835,"snap":"2020-24-2020-29","text_gpt3_token_len":198,"char_repetition_ratio":0.10589651,"word_repetition_ratio":0.0,"special_character_ratio":0.22035928,"punctuation_ratio":0.11728395,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9948813,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2020-05-27T22:56:47Z\",\"WARC-Record-ID\":\"<urn:uuid:881a7a93-e134-4fce-96e2-8939144c4ba6>\",\"Content-Length\":\"24165\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:07a16ecb-9215-456e-a92d-b5b2315b543f>\",\"WARC-Concurrent-To\":\"<urn:uuid:97b26f04-8004-4cb6-9557-062b79821db5>\",\"WARC-IP-Address\":\"132.148.209.51\",\"WARC-Target-URI\":\"https://energyeducation.ca/encyclopedia/Permeability_of_free_space\",\"WARC-Payload-Digest\":\"sha1:DV4F47ASG5DCHS4YUM5HQAIQXVGOE6QN\",\"WARC-Block-Digest\":\"sha1:47HO4XFNWCWQFQFJYM2J76WSOZITHKNW\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2020/CC-MAIN-2020-24/CC-MAIN-2020-24_segments_1590347396163.18_warc_CC-MAIN-20200527204212-20200527234212-00277.warc.gz\"}"}
|
https://nineplanets.org/percentage-calculator/what-is-percentage-difference-from-336-to-2763/
|
[
"# What is the percentage increase/decrease from 336 to 2763?\n\n## Quickly work out the percentage increase or decrease from 336 to 2763 in this step-by-step percentage calculator tutorial. (Spoiler alert: it's 722.32%!)\n\nSo you want to work out the percentage increase or decrease from 336 to 2763? Fear not, intrepid math seeker! Today, we will guide you through the calculation so you can figure out how to work out the increase or decrease in any numbers as a percentage. Onwards!\n\nIn a rush and just need to know the answer? The percentage increase from 336 to 2763 is 722.32%.\n\nWhat is the % change from to\n\n## Percentage increase/decrease from 336 to 2763?\n\nAn increase or decrease percentage of two numbers can be very useful. Let's say you are a shop that sold 336 t-shirts in January, and then sold 2763 t-shirts in February. What is the percentage increase or decrease there? Knowing the answer allows you to compare and track numbers to look for trends or reasons for the change.\n\nWorking out a percentage increase or decrease between two numbers is pretty simple. The resulting number (the second input) is 2763 and what we need to do first is subtract the old number, 336, from it:\n\n2763 - 336 = 2427\n\nOnce we've done that we need to divide the result, 2427, by the original number, 336. We do this because we need to compare the difference between the new number and the original:\n\n2427 / 336 = 7.2232142857143\n\nWe now have our answer in decimal format. How do we get this into percentage format? Multiply 7.2232142857143 by 100? Ding ding ding! We have a winner:\n\n7.2232142857143 x 100 = 722.32%\n\nWe're done! You just successfully calculated the percentage difference from 336 to 2763. You can now go forth and use this method to work out and calculate the increase/decrease in percentage of any numbers.\n\nHead back to the percentage calculator to work out any more calculations you need to make or be brave and give it a go by hand. Hopefully this article has shown you that it's easier than you might think!"
] |
[
null
] |
{"ft_lang_label":"__label__en","ft_lang_prob":0.92268556,"math_prob":0.9456025,"size":1730,"snap":"2020-45-2020-50","text_gpt3_token_len":406,"char_repetition_ratio":0.16685979,"word_repetition_ratio":0.006535948,"special_character_ratio":0.26878613,"punctuation_ratio":0.10511363,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.99159044,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2020-12-03T17:40:31Z\",\"WARC-Record-ID\":\"<urn:uuid:4dd26791-61e2-4769-834c-7d7f4abf94c1>\",\"Content-Length\":\"8870\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:335209b5-7abe-44a7-97d2-a32a35dff67d>\",\"WARC-Concurrent-To\":\"<urn:uuid:7c9becd6-7242-4516-95f8-1ebcd5435eb1>\",\"WARC-IP-Address\":\"157.245.80.188\",\"WARC-Target-URI\":\"https://nineplanets.org/percentage-calculator/what-is-percentage-difference-from-336-to-2763/\",\"WARC-Payload-Digest\":\"sha1:OWT4JRFXO34CZ6ZLWJOTX3NRHLKODL5Y\",\"WARC-Block-Digest\":\"sha1:E2YMBMVPA53JMQGGNV5FBF4PPFHVG72H\",\"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-00436.warc.gz\"}"}
|
https://gricad-gitlab.univ-grenoble-alpes.fr/coiffiem/BHR/-/commit/d8a2196c1b1e3d1956b846fb520f941e6c42ee28
|
[
"Vous avez reçu un message \"Your GitLab account has been locked ...\" ? Pas d'inquiétude : lisez cet article https://docs.gricad-pages.univ-grenoble-alpes.fr/help/unlock/\n\n### Make the order of evaluation left-to-right at all backquote depths in concatenative languages.\n\n```Previously, the deepest holes were evaluated first, even when they\nwere syntactically positioned after some previous ones at a shallower\nlevel.\n\nMaking the Folds into Traversals had the nice effect of forcing a\nsingle-pass implementation of what was previously done in two stages,\ncausing the unintuitive evaluation order. Always trust your\nApplicative functors, they won't betray you.```\nparent 1ce72bee\n ... ... @@ -2,7 +2,7 @@ -- see http://haskell.org/cabal/users-guide/ name: capricon version: 0.12 version: 0.12.1 -- synopsis: -- description: license: GPL-3 ... ...\n ... ... @@ -154,7 +154,7 @@ runWordsState ws st = (\\$st) \\$ from (stateT.concatT) \\$^ do runWithFS :: JS.JSString -> FSIO a -> JS.CIO a runWithFS fsname (FSIO r) = newFS fsname >>= r^..readerT hasteDict = cocDict (\"0.12-js\" :: String) getString getBytes setString setBytes hasteDict = cocDict (\"0.12.1-js\" :: String) getString getBytes setString setBytes main :: IO () main = do ... ...\n ... ... @@ -32,27 +32,36 @@ t'ClosureStep :: Traversal' (StackStep s b a) (StackClosure s b a) t'ClosureStep k (ClosureStep b c) = ClosureStep b<\\$>k c t'ClosureStep _ x = pure x allSteps :: Fold' (StackClosure s b a) (StackStep s b a) allSteps = from i'StackClosure.(l'1.each.l'1.each .+ l'2.each) subClosure :: Int -> Fold' (StackClosure s b a) (StackClosure s b a) subClosure :: Int -> Traversal' (StackClosure s b a) (StackClosure s b a) subClosure 0 = id subClosure n = (allSteps.t'ClosureStep.subClosure (n+1)) .+ (from i'StackClosure.l'1.each.l'2.subClosure (n-1)) subClosure n = \\k (StackClosure act ps p) -> StackClosure act <\\$> traverse (\\(ph,px) -> liftA2 (,) (traversel (each.t'ClosureStep.subClosure (n+1)) k ph) (traversel (subClosure (n-1)) k px)) ps <*> traversel (each.t'ClosureStep.subClosure (n+1)) k p closureSplices :: Fold' (StackClosure s b a) (StackClosure s b a) closureSplices = allSteps.t'ClosureStep.subClosure (1::Int) allSteps :: (forall f. Applicative f => StackClosure s b a -> f (StackClosure s b a)) -> Traversal' (StackClosure s b a) (StackStep s b a) allSteps sub k (StackClosure act ps p) = StackClosure act<\\$>traverse (\\(ph,c) -> liftA2 (,) (each k ph) (sub c)) ps<*>traverse k p closureSplices :: Traversal' (StackClosure s b a) (StackClosure s b a) closureSplices = allSteps pure.t'ClosureStep.subClosure (1::Int) runClosure execBuiltin' onComment clos = do (_,p) <- flatten =<< forl closureSplices clos (\\c -> flatten c <&> \\(act,p) -> StackClosure act [] p) (_,p) <- flatten clos stack =~ (StackProg p:) where flatten (StackClosure act cs c) = do pref <- map fold \\$ for cs \\$ \\(i,StackClosure act' _ p) -> (i+) <\\$> do traverse_ (runStep execBuiltin' onComment) p stack <~ \\case (h:t) -> (t,[case act' of CloseConstant -> ConstStep h ; CloseExec -> ExecStep h]) [] -> ([],[]) return (act,pref + c) where flattenSteps = traversel (each.t'ClosureStep.subClosure 1) (\\c -> flatten c <&> \\(act,p) -> StackClosure act [] p) flatten (StackClosure act cs c) = (act,) <\\$> liftA2 (+) (map fold \\$ for cs \\$ \\(i,StackClosure act' _ p) -> (+) <\\$> flattenSteps i <*> do traverse_ (runStep execBuiltin' onComment) p stack <~ \\case (h:t) -> (t,[case act' of CloseConstant -> ConstStep h ; CloseExec -> ExecStep h]) [] -> ([],[])) (flattenSteps c) runStep execBuiltin' onComment (VerbStep s) = getl (dict.at s) >>= \\case Just v -> runStep execBuiltin' onComment (ExecStep v) ... ...\nMarkdown is supported\n0% or .\nYou are about to add 0 people to the discussion. Proceed with caution.\nFinish editing this message first!"
] |
[
null
] |
{"ft_lang_label":"__label__en","ft_lang_prob":0.9505922,"math_prob":0.83928216,"size":554,"snap":"2021-43-2021-49","text_gpt3_token_len":112,"char_repetition_ratio":0.10363636,"word_repetition_ratio":0.0,"special_character_ratio":0.1732852,"punctuation_ratio":0.086021505,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9687781,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2021-10-22T18:22:06Z\",\"WARC-Record-ID\":\"<urn:uuid:386950cc-2521-4d59-8de9-390d80e69fd2>\",\"Content-Length\":\"218322\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:d199230d-79d7-4b76-9e9a-959551f62c04>\",\"WARC-Concurrent-To\":\"<urn:uuid:90a3507e-0a98-498a-93ed-13ab33a97530>\",\"WARC-IP-Address\":\"129.88.175.2\",\"WARC-Target-URI\":\"https://gricad-gitlab.univ-grenoble-alpes.fr/coiffiem/BHR/-/commit/d8a2196c1b1e3d1956b846fb520f941e6c42ee28\",\"WARC-Payload-Digest\":\"sha1:645RRJWDXY5DM67YPTL5I3MQOTYMQAPE\",\"WARC-Block-Digest\":\"sha1:TMX3Z2WG4HXKIBCILOSUUAZMPMVUWNE4\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2021/CC-MAIN-2021-43/CC-MAIN-2021-43_segments_1634323585518.54_warc_CC-MAIN-20211022181017-20211022211017-00588.warc.gz\"}"}
|
https://www.sanfoundry.com/mechanical-operations-questions-answers-theory-filtration/
|
[
"# Mechanical Operations Questions and Answers – Theory of Filtration\n\n«\n»\n\nThis set of Mechanical Operations Multiple Choice Questions & Answers (MCQs) focuses on “Theory of Filtration”.\n\n1. The ratio of void volume and total surface area of particles is defined as _____\na) Resistance\nc) Repulsion\nd) Void age\n\nExplanation: The hydraulic radius which is defined as the flow area per unit wetted perimeter and is represented by RH.\n\n2. What does the ε represents?\na) Porosity\nb) Density\nc) Viscosity\nd) Acidity\n\nExplanation: The ratio of void volume and the total volume is defined as the porosity, which is denoted by ε.\n\n3. Calculate ε, if the total area is 45 m2 and the void area is 100 m2?\na) 10.5\nb) 0.45\nc) 2.222\nd) 0.89\n\nExplanation: As we know ε = void area/total area = 100/45 = 2.222.\n\n4. Calculate the hydraulic radius, if porosity is 0.6 and specific gravity is 1.50?\na) 1\nb) 0.6\nc) 0.2\nd) 1.8\n\nExplanation: As we know that ε/sp (1- ε) = 0.6/1.50(1-0.6) = 1.\n\n5. ____ of the liquid is defined as volumetric flow rate of the liquid divided by the total area.\na) Final velocity\nb) Total volume\nc) Superficial velocity\nd) Wetted perimeter\n\nExplanation: The superficial velocity is defined as the volumetric rate and liquid divided by total or empty cross sectional area Usup.\n\n6. What does the below equation represent?",
null,
"a) Resistance\nc) Repulsion\nd) Void age\n\nExplanation: Here ε is the void fraction sometimes called porosity of the bed and Sp is the specific surface area of the particles.\n\n7. What does the below represent?\nt= f tc\na) Cake formation\nb) Drum rotation\nc) Initial extraction\nd) Extra time\n\nExplanation: The above equation represents the time taken for cake formation, if tc is the time for one full rotation of the drum.\n\n8. ____ is defined as the volume of void filled and total volume.\na) Upper velocity\nb) Saturation\nc) Residual saturation\nd) Superficial velocity\n\nExplanation: The saturation (S) is usually defined with respect to the wetting fluid and is therefore the fractional volume of voids occupied by the wetting fluid.\n\n9. ____ is the maximum volume wetted to ratio of total volume.\na) Residual saturation\nb) Saturation\nc) Residual saturation\nd) Superficial velocity\n\nExplanation: The residual saturation (SF) is defined as the ratio of maximum volume wetting fluid eliminated from flow and total volume of voids.\n\n10. Calculate S, if the voids filled are 40 m3 and having 50 m3 of total volume?\na) 0.8\nb) 1.25\nc) 40\nd) 50\n\nExplanation: As we know that S = void volume/total volume = 40/50 = 0.8.\n\nSanfoundry Global Education & Learning Series – Mechanical Operations.",
null,
""
] |
[
null,
"https://www.sanfoundry.com/wp-content/uploads/2017/10/mechanical-operations-questions-answers-theory-filtration-q6.png",
null,
"https://www.sanfoundry.com/wp-content/uploads/2017/01/Manish2.png",
null
] |
{"ft_lang_label":"__label__en","ft_lang_prob":0.77803934,"math_prob":0.9906477,"size":2975,"snap":"2020-45-2020-50","text_gpt3_token_len":793,"char_repetition_ratio":0.15382026,"word_repetition_ratio":0.09037328,"special_character_ratio":0.25445378,"punctuation_ratio":0.11447811,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9984854,"pos_list":[0,1,2,3,4],"im_url_duplicate_count":[null,2,null,null,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2020-11-23T22:50:39Z\",\"WARC-Record-ID\":\"<urn:uuid:26d0ca84-7b79-4d2e-be31-21bac107f8b1>\",\"Content-Length\":\"77844\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:91d732c1-7a4c-433c-b896-7fcd809a9640>\",\"WARC-Concurrent-To\":\"<urn:uuid:71701664-4d2b-42e6-8a5b-651f219553b1>\",\"WARC-IP-Address\":\"104.25.131.119\",\"WARC-Target-URI\":\"https://www.sanfoundry.com/mechanical-operations-questions-answers-theory-filtration/\",\"WARC-Payload-Digest\":\"sha1:53BLLCAZBFHQRH7M2MNGKXBRGDNWN57A\",\"WARC-Block-Digest\":\"sha1:WRFGXB7TYZDPGPYBGRQAIP45RNS4YSVY\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2020/CC-MAIN-2020-50/CC-MAIN-2020-50_segments_1606141168074.3_warc_CC-MAIN-20201123211528-20201124001528-00432.warc.gz\"}"}
|
https://www.aimspress.com/article/10.3934/mine.2020010
|
[
"### Mathematics in Engineering\n\n2020, Issue 2: 203-229. doi: 10.3934/mine.2020010\nResearch article Special Issues\n\n# Interaction of rigid body motion and rarefied gas dynamics based on the BGK model\n\n• Received: 22 July 2019 Accepted: 04 December 2019 Published: 31 December 2019\n• In this paper we present simulations of moving rigid bodies immersed in a rarefied gas. The rarefied gas is simulated by solving the Bhatnager-Gross-Krook (BGK) model for the Boltzmann equation. The Newton-Euler equations are solved to simulate the rigid body motion. The force and the torque on the rigid body is computed from the surrounded gas. An explicit Euler scheme is used for the time integration of the Newton-Euler equations. The BGK model is solved by the semi-Lagrangian method suggested by Russo & Filbet . Due to the motion of the rigid body, the computational domain for the rarefied gas (and the interface between the rigid body and the gas domain) changes with respect to time. To allow a simpler handling of the interface motion we have used a meshfree method for the interpolation procedure in the semi-Lagrangian scheme. We have considered a one way, as well as a two-way coupling of rigid body and gas flow. We use diffuse reflection boundary conditions on the rigid body and also on the boundary of the computational domain. In one space dimension the numerical results are compared with analytical as well as with Direct Simulation Monte Carlo (DSMC) solutions of the Boltzmann equation. In the two-dimensional case results are compared with DSMC simulations for the Boltzmann equation and with results obtained by other researchers. Several test problems and applications illustrate the versatility of the approach.\n\nCitation: Sudarshan Tiwari, Axel Klar, Giovanni Russo. Interaction of rigid body motion and rarefied gas dynamics based on the BGK model[J]. Mathematics in Engineering, 2020, 2(2): 203-229. doi: 10.3934/mine.2020010\n\n### Related Papers:\n\n• In this paper we present simulations of moving rigid bodies immersed in a rarefied gas. The rarefied gas is simulated by solving the Bhatnager-Gross-Krook (BGK) model for the Boltzmann equation. The Newton-Euler equations are solved to simulate the rigid body motion. The force and the torque on the rigid body is computed from the surrounded gas. An explicit Euler scheme is used for the time integration of the Newton-Euler equations. The BGK model is solved by the semi-Lagrangian method suggested by Russo & Filbet . Due to the motion of the rigid body, the computational domain for the rarefied gas (and the interface between the rigid body and the gas domain) changes with respect to time. To allow a simpler handling of the interface motion we have used a meshfree method for the interpolation procedure in the semi-Lagrangian scheme. We have considered a one way, as well as a two-way coupling of rigid body and gas flow. We use diffuse reflection boundary conditions on the rigid body and also on the boundary of the computational domain. In one space dimension the numerical results are compared with analytical as well as with Direct Simulation Monte Carlo (DSMC) solutions of the Boltzmann equation. In the two-dimensional case results are compared with DSMC simulations for the Boltzmann equation and with results obtained by other researchers. Several test problems and applications illustrate the versatility of the approach.",
null,
"###### 通讯作者: 陈斌, [email protected]\n• 1.\n\n沈阳化工大学材料科学与工程学院 沈阳 110142",
null,
"2.385\n\nArticle outline\n\n## Other Articles By Authors\n\n• On This Site",
null,
"",
null,
"DownLoad: Full-Size Img PowerPoint"
] |
[
null,
"https://www.aimspress.com/style/web/images/article/1.gif",
null,
"https://www.aimspress.com/aimspress-upload/journal/mine/cover_2020410144341391.jpg",
null,
"https://www.aimspress.com/article/10.3934/mine.2020010",
null,
"https://www.aimspress.com/style/web/images/article/download.png",
null
] |
{"ft_lang_label":"__label__en","ft_lang_prob":0.5938625,"math_prob":0.92558414,"size":5774,"snap":"2021-31-2021-39","text_gpt3_token_len":1915,"char_repetition_ratio":0.111438476,"word_repetition_ratio":0.024242423,"special_character_ratio":0.3574645,"punctuation_ratio":0.20149875,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9713945,"pos_list":[0,1,2,3,4,5,6,7,8],"im_url_duplicate_count":[null,null,null,null,null,2,null,null,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2021-09-21T05:57:55Z\",\"WARC-Record-ID\":\"<urn:uuid:bd071078-1ced-4793-8d1a-1fbc8b7a0bb3>\",\"Content-Length\":\"136865\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:b2483d55-4610-4859-8240-283c6ab2aedb>\",\"WARC-Concurrent-To\":\"<urn:uuid:f90e93b9-503f-4542-a7c0-f5339efa4f3f>\",\"WARC-IP-Address\":\"99.84.216.105\",\"WARC-Target-URI\":\"https://www.aimspress.com/article/10.3934/mine.2020010\",\"WARC-Payload-Digest\":\"sha1:ZII42ATVH4YWRLX7BEUTOJK7MU7ESEKC\",\"WARC-Block-Digest\":\"sha1:VUBXSLZVK3ZW32PRLJD3BKCYAZYRICH6\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2021/CC-MAIN-2021-39/CC-MAIN-2021-39_segments_1631780057158.19_warc_CC-MAIN-20210921041059-20210921071059-00504.warc.gz\"}"}
|
https://assignmentpapermaster.com/a-coaxial-cable-mathematics-homework-help/
|
[
"# A coaxial cable | Mathematics homework help\n\nA Coaxial Cable. A small solid conductor with radius a is supported by insulating. nonmagnetic disks on the axis of a thinwalled tube with inner radius b. The inner and outer conductors carry equal currents i in opposite directions.\n(a) Use Ampere’s law to find the magnetic field at any point in the volume between the conductors.\n(b) Write the expression fur the flux diPB through a narrow strip of length I parallel to the axis, of width dr, at a distance T from the axis of the cable and lying in a plane containing the axis.\n(c) Integrate your expression from part (b) over the volume between the two conductors to find the total flux produced by a current i in the central conductor.\n(d) Show that the inductance of a lenglh I of the cable is\n(e) Use Eq. (30.9) to calculate the enetgy stored in the magnetic field for a length l of thecable."
] |
[
null
] |
{"ft_lang_label":"__label__en","ft_lang_prob":0.8868219,"math_prob":0.9633945,"size":892,"snap":"2023-14-2023-23","text_gpt3_token_len":211,"char_repetition_ratio":0.1295045,"word_repetition_ratio":0.0,"special_character_ratio":0.2174888,"punctuation_ratio":0.06779661,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9523786,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2023-03-25T18:17:12Z\",\"WARC-Record-ID\":\"<urn:uuid:2c6d0af9-99bd-4e65-afbe-0e6ed6ad3a12>\",\"Content-Length\":\"71271\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:6333a481-5801-4e6c-b132-636a3c1f883b>\",\"WARC-Concurrent-To\":\"<urn:uuid:4195eaa6-5fc5-45fa-8f32-2d5b5beac1a2>\",\"WARC-IP-Address\":\"162.213.251.180\",\"WARC-Target-URI\":\"https://assignmentpapermaster.com/a-coaxial-cable-mathematics-homework-help/\",\"WARC-Payload-Digest\":\"sha1:UALLPZCLXEVPMZLYXXQVAT6HGMTC7TX4\",\"WARC-Block-Digest\":\"sha1:YOKGA3EJ5QGTXFGMORPSLP4GF5FQWOF3\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2023/CC-MAIN-2023-14/CC-MAIN-2023-14_segments_1679296945368.6_warc_CC-MAIN-20230325161021-20230325191021-00427.warc.gz\"}"}
|
https://stylesubstancesoul.com/essay-tips/can-you-use-photomath-on-computer/
|
[
"# Can you use Photomath on computer?\n\n## Can you use Photomath on computer?\n\nWe can use the application photomath on computer and Mac both users can use the application for the solution. We can use the application photomath on computer. Windows and Mac both users can use the application for the solution of any mathematical issue.\n\n## What’s better than PhotoMath?\n\nWhen comparing Mathway vs PhotoMath, the Slant community recommends Mathway for most people. In the question“What are the best Android apps for math problem solving?” Mathway is ranked 2nd while PhotoMath is ranked 4th.\n\n## Which is the best app to solve maths problems?\n\nPhotomath. Photomath is probably the best app for solving mathematical problems. iMathematics. iMathematics lets you type in equations and solves them for you. MyScript Calculator. PCalc. Graphing Calculator. Khan Academy. Meritnation. Mathematicus.\n\n## How can I learn math on my own?\n\nSteps to Studying Math on Your OwnFirst, determine where you want to end up. Determine where to start, obviously. Find a Syllabus to Avoid Unnecessary Depth. Gather your References, Solution Manuals, and “Solved Problems” Types of Books. Prioritize Deep, Concept-Based Learning. Put Links to Resources in One Place.\n\n## How long does it take to learn math from scratch?\n\nOriginally Answered: How long does it take to learn math from scratch? It depends how much you want to learn. If you want to just learn basic as 1,2,3 sum, multiplication and subtraction then it will just take minimum 1 week.\n\n## How can I understand maths easily?\n\n7 Tips for Maths Problem SolvingPractice, Practice & More Practice. It is impossible to study maths properly by just reading and listening. Review Errors. Master the Key Concepts. Understand your Doubts. Create a Distraction Free Study Environment. Create a Mathematical Dictionary. Apply Maths to Real World Problems."
] |
[
null
] |
{"ft_lang_label":"__label__en","ft_lang_prob":0.90061986,"math_prob":0.49518412,"size":1849,"snap":"2021-31-2021-39","text_gpt3_token_len":399,"char_repetition_ratio":0.1203252,"word_repetition_ratio":0.11724138,"special_character_ratio":0.19361818,"punctuation_ratio":0.1461318,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9735829,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2021-09-22T08:46:09Z\",\"WARC-Record-ID\":\"<urn:uuid:f308e5c8-9f63-4d84-beca-cb6fbaaf913e>\",\"Content-Length\":\"21262\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:e398c961-1bec-4643-8978-1dabf4fce33a>\",\"WARC-Concurrent-To\":\"<urn:uuid:138c20e7-3a11-49c4-a042-716af005bff2>\",\"WARC-IP-Address\":\"104.21.57.103\",\"WARC-Target-URI\":\"https://stylesubstancesoul.com/essay-tips/can-you-use-photomath-on-computer/\",\"WARC-Payload-Digest\":\"sha1:FZOQF2GH5WM2HHV7NP7XFSFMJEJJQ4ON\",\"WARC-Block-Digest\":\"sha1:4Y5HU5ZKGSCDQWCOZR3LPCKK4TOLGEOS\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2021/CC-MAIN-2021-39/CC-MAIN-2021-39_segments_1631780057337.81_warc_CC-MAIN-20210922072047-20210922102047-00695.warc.gz\"}"}
|
http://percentagecalculator.pro/What-is_58_percent-of_60_%3F
|
[
"# 58 percent of 60?\n\nWhat is % of\n\n### Percentage Calculator 2\n\nis what percent of ?\n\nis % of what?\n\n### Solution for 'What is 58% of 60?'\n\nIn all the following examples consider that:\n\n• The percentage figure is represented by X%\n• The whole amount is represented by W\n• The portion amount or part is represented by P\n\n#### Solution Steps\n\nThe following question is of the type \"How much X percent of W\", where W is the whole amount and X is the percentage figure or rate\".\n\nLet's say that you need to find 58 percent of 60. What are the steps?\n\nStep 1: first determine the value of the whole amount. We assume that the whole amount is 60.\n\nStep 2: determine the percentage, which is 58.\n\nStep 3: Convert the percentage 58% to its decimal form by dividing 58 into 100 to get the decimal number 0.58:\n\n58100 = 0.58\n\nNotice that dividing into 100 is the same as moving the decimal point two places to the left.\n\n58.0 → 5.80 → 0.58\n\nStep 4: Finally, find the portion by multiplying the decimal form, found in the previous step, by the whole amount:\n\n0.58 x 60 = 34.8 (answer).\n\nThe steps above are expressed by the formula:\n\nP = W × X%100\n\nThis formula says that:\n\n\"To find the portion or the part from the whole amount, multiply the whole by the percentage, then divide the result by 100\".\n\nThe symbol % means the percentage expressed in a fraction or multiple of one hundred.\n\nReplacing these values in the formula, we get:\n\nP = 60 × 58100 = 60 × 0.58 = 34.8 (answer)\n\nTherefore, the answer is 34.8 is 58 percent of 60.\n\n### Solution for '58 is what percent of 60?'\n\nThe following question is of the type \"P is what percent of W,” where W is the whole amount and P is the portion amount\".\n\nThe following problem is of the type \"calculating the percentage from a whole knowing the part\".\n\n#### Solution Steps\n\nAs in the previous example, here are the step-by-step solution:\n\nStep 1: first determine the value of the whole amount. We assume that it is 60.\n\n(notice that this corresponds to 100%).\n\nStep 2: Remember that we are looking for the percentage 'percentage'.\n\nTo solve this question, use the following formula:\n\nX% = 100 × PW\n\nThis formula says that:\n\n\"To find the percentage from the whole, knowing the part, divide the part by the whole then multiply the result by 100\".\n\nThis formula is the same as the previous one shown in a different way in order to have percent (%) at left.\n\nStep 3: replacing the values into the formula, we get:\n\nX% = 100 × 5860\n\nX% = 580060\n\nSo, the answer is 58 is 96.67 percent of 60\n\n### Solution for '60 is 58 percent of what?'\n\nThe following problem is of the type \"calculating the whole knowing the part and the percentage\".\n\n### Solution Steps:\n\nStep 1: first determine the value of the part. We assume that the part is 60.\n\nStep 2: identify the percent, which is 58.\n\nStep 3: use the formula below:\n\nW = 100 × PX%\n\nThis formula says that:\n\n\"To find the whole, divide the part by the percentage then multiply the result by 100\".\n\nThis formula is the same as the above rearranged to show the whole at left.\n\nStep 4: plug the values into the formula to get:\n\nW = 100 × 6058\n\nW = 100 × 1.0344827586207"
] |
[
null
] |
{"ft_lang_label":"__label__en","ft_lang_prob":0.9205283,"math_prob":0.9952469,"size":3089,"snap":"2020-45-2020-50","text_gpt3_token_len":822,"char_repetition_ratio":0.17698541,"word_repetition_ratio":0.12820514,"special_character_ratio":0.3111039,"punctuation_ratio":0.13521545,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.99998295,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2020-10-26T06:25:15Z\",\"WARC-Record-ID\":\"<urn:uuid:d4bd08ad-c1b6-4baf-9116-e28799c00557>\",\"Content-Length\":\"28450\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:ec7c0455-42a4-4cc3-b5d6-3fef33f5c6da>\",\"WARC-Concurrent-To\":\"<urn:uuid:b03ca8f3-323b-441e-bd37-aacbefe9b693>\",\"WARC-IP-Address\":\"104.18.33.170\",\"WARC-Target-URI\":\"http://percentagecalculator.pro/What-is_58_percent-of_60_%3F\",\"WARC-Payload-Digest\":\"sha1:LSKZORYGWNRU2NYDOP5L53DSMPK6JJK2\",\"WARC-Block-Digest\":\"sha1:75SLAHW4ESU7PMRBWQGI7LITNXY7SMMY\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2020/CC-MAIN-2020-45/CC-MAIN-2020-45_segments_1603107890586.57_warc_CC-MAIN-20201026061044-20201026091044-00214.warc.gz\"}"}
|
https://www.iqclab.eu/ft/
|
[
"# fT\n\nThis function creates permutation matrices, which allows to permute the in- and output channels of an uncertain plant M in accordance with the given uncertainty blocks. This is an function that is used in, for example, iqcanalysis, and can also be used independently in another context or to set up an alternative analysis of controller synthesis problem.\n\nGiven the some matrix or system",
null,
"with",
null,
"and",
null,
"being the number of input and output channels respectively, the function",
null,
"creates the permutation matrices",
null,
"and",
null,
"based on the input/output channel selectors",
null,
"and",
null,
", which are structures.\n\nExample\n\nWith",
null,
",",
null,
",",
null,
", and",
null,
", we obtain:",
null,
"Then the matrix",
null,
"would permute into",
null,
"Previous page"
] |
[
null,
"https://usercontent.one/wp/www.iqclab.eu/wp-content/ql-cache/quicklatex.com-10ebb71bad275c1815a8f2a8c5dea0be_l3.png",
null,
"https://usercontent.one/wp/www.iqclab.eu/wp-content/ql-cache/quicklatex.com-0cdaa691ddf18a198b8fd3049106819c_l3.png",
null,
"https://usercontent.one/wp/www.iqclab.eu/wp-content/ql-cache/quicklatex.com-24b4caf6f4195928fbd692971bcd3a64_l3.png",
null,
"https://usercontent.one/wp/www.iqclab.eu/wp-content/ql-cache/quicklatex.com-af18381403cdd31262ca85a82eb54806_l3.png",
null,
"https://usercontent.one/wp/www.iqclab.eu/wp-content/ql-cache/quicklatex.com-5f66cac63100dedfee31d62bab7c69e1_l3.png",
null,
"https://usercontent.one/wp/www.iqclab.eu/wp-content/ql-cache/quicklatex.com-41c3d83cac7ee8c5d7c98f0934027a4c_l3.png",
null,
"https://usercontent.one/wp/www.iqclab.eu/wp-content/ql-cache/quicklatex.com-84a03a34d3890f0d6b4cc716d9e7f4f5_l3.png",
null,
"https://usercontent.one/wp/www.iqclab.eu/wp-content/ql-cache/quicklatex.com-f75265f6127423bd9d1c90c8b05fbe35_l3.png",
null,
"https://usercontent.one/wp/www.iqclab.eu/wp-content/ql-cache/quicklatex.com-b62ac8cd0289a6c0fae08a326f1f8556_l3.png",
null,
"https://usercontent.one/wp/www.iqclab.eu/wp-content/ql-cache/quicklatex.com-1a2aef58d27d66ae07145594faf1f2fe_l3.png",
null,
"https://usercontent.one/wp/www.iqclab.eu/wp-content/ql-cache/quicklatex.com-ce83b603e782451bcb02eaec662f0980_l3.png",
null,
"https://usercontent.one/wp/www.iqclab.eu/wp-content/ql-cache/quicklatex.com-20a4af65ff78460d637f4a3265444519_l3.png",
null,
"https://usercontent.one/wp/www.iqclab.eu/wp-content/ql-cache/quicklatex.com-8c31635f656a8495b4b0244aecebf031_l3.png",
null,
"https://usercontent.one/wp/www.iqclab.eu/wp-content/ql-cache/quicklatex.com-9f010cdd350a5cd08a0faca9f0e061b8_l3.png",
null,
"https://usercontent.one/wp/www.iqclab.eu/wp-content/ql-cache/quicklatex.com-1daecb9911b3a6cb811e3644d7cdca7f_l3.png",
null
] |
{"ft_lang_label":"__label__en","ft_lang_prob":0.88203037,"math_prob":0.85874724,"size":649,"snap":"2023-40-2023-50","text_gpt3_token_len":124,"char_repetition_ratio":0.12713179,"word_repetition_ratio":0.0,"special_character_ratio":0.18798152,"punctuation_ratio":0.11965812,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9624386,"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],"im_url_duplicate_count":[null,null,null,1,null,1,null,1,null,1,null,1,null,1,null,1,null,1,null,1,null,1,null,1,null,1,null,1,null,1,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2023-12-09T15:40:53Z\",\"WARC-Record-ID\":\"<urn:uuid:cb4607a4-ba76-45a8-a5f9-fa2b7aad67ea>\",\"Content-Length\":\"100732\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:7de033da-c278-4d1b-96ef-fd5a58ccaac6>\",\"WARC-Concurrent-To\":\"<urn:uuid:2b49fce2-9ae2-47bd-9ee6-0a8f3b89c7ab>\",\"WARC-IP-Address\":\"46.30.213.51\",\"WARC-Target-URI\":\"https://www.iqclab.eu/ft/\",\"WARC-Payload-Digest\":\"sha1:UNWIS6IUBD4X5TRRNIYW3A6ER2SZ6XRB\",\"WARC-Block-Digest\":\"sha1:4A4BAAMZ6HLG3LX73KY4TRY7XJMPZYSX\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2023/CC-MAIN-2023-50/CC-MAIN-2023-50_segments_1700679100912.91_warc_CC-MAIN-20231209134916-20231209164916-00867.warc.gz\"}"}
|
https://insightmaker.com/book/export/html/52
|
[
"# Flows\n\nA flow transports a material from one stock to another. As a designer, you must enter the rate of the flow. So, for instance, in our river example the magnitude of the flow could be a million gallons of water and the period over which it flows could be one day: in effect a million gallons per day. Flows may connect two stocks together. Alternatively, a flow can lack a start or an end. In this case, the unconnected end acts as an unlimited stock of material.\n\nAs with the initial value of a stock, the rate of a flow can be a simple number or a more complex equation. The equation can be based on many factors including the values of the stocks the flow is connected to and the current time. For example, if we had a stock representing the population of rabbits (called Rabbit Population), we could make the flow into the stock be the number of rabbits times a constant birthrate. This equation would result in geometric growth in the rabbit population:\n\n[Rabbit Population]*0.01\n\nAlternatively, if we had a flow representing rainfall, we could set the flow rate to be based on the current time of the year. Rainfall over the course of a year can be approximated using a sinusoidal function like the following:\n\nsin(2*pi*(Weeks()+10)/52)*30+35\n\nWhere weeks is a Insight Maker function that automatically takes on the value of the current simulation time measured in weeks, pi is the constant 3.14159
, and sin is another Insight Maker function that applies the trigonometric sine function to an angle inputted using radians.\n\nA flow can be restricted to positive flows only. In this case, the flow will only be applied if the calculated magnitude of the flow rate is positive. This restriction would be applicable for both our rabbit and rain examples. We know that neither of the flows should ever be negative (you cannot have negative births or negative rain) so we might want to set them to only allow positive flows just to insure that such an impossible event never happens (though it never will in any event given the equations we specified).\n\nEvery flow has two special properties that may be referenced in its equations. The first is Alpha which refers to the stock at the start of the flow. The second is Omega which refers to the stock at the end of the flow. In your equations you may use either of these instead of needing to know the actual names of a flow’s start or end stocks. For instance if you wanted 5% of the water from a lake to evaporate out of it each time period, you could use the following statement for the rate of a flow whose beginning was the lake:\n\n[Alpha]*0.05"
] |
[
null
] |
{"ft_lang_label":"__label__en","ft_lang_prob":0.9373809,"math_prob":0.98875964,"size":2588,"snap":"2021-04-2021-17","text_gpt3_token_len":547,"char_repetition_ratio":0.13119195,"word_repetition_ratio":0.017391304,"special_character_ratio":0.21290572,"punctuation_ratio":0.07751938,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.99202645,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2021-01-17T09:43:49Z\",\"WARC-Record-ID\":\"<urn:uuid:b6c67ec3-851d-4884-9ada-e728c8956d87>\",\"Content-Length\":\"8093\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:c6b0d57b-d766-4e66-b5b0-2d266f67d75f>\",\"WARC-Concurrent-To\":\"<urn:uuid:25b8ab36-4b58-4262-9b55-f30b2f778d03>\",\"WARC-IP-Address\":\"104.26.6.235\",\"WARC-Target-URI\":\"https://insightmaker.com/book/export/html/52\",\"WARC-Payload-Digest\":\"sha1:AMK4BORNSOXRLKFPYAE7IP57VUJ7NXOA\",\"WARC-Block-Digest\":\"sha1:7JDTH3ELAFTUFTZYTUQ7RIRX7W4PCKAI\",\"WARC-Identified-Payload-Type\":\"application/xhtml+xml\",\"warc_filename\":\"/cc_download/warc_2021/CC-MAIN-2021-04/CC-MAIN-2021-04_segments_1610703511903.11_warc_CC-MAIN-20210117081748-20210117111748-00460.warc.gz\"}"}
|
https://www.isprimenumber.com/prime/1193
|
[
"# Is 1193 a Prime Number?\n\nYes, 1193 is a prime number. 1193 is divisible by 1 and itself.\n\nYes, 1193 is a prime number.\n\n### Why 1193 is a prime number?\n\nBecause 1193 has no positive divisors rather than 1 and itself.\n\nThe next prime number of 1193 is 1201\nThe previous prime number of 1193 is 1187.\n\n### Related Prime Numbers\n\nBiggest 10 prime numbers smaller than 1193\n\nSmallest 10 prime numbers bigger than 1193\n\n### Related Non-Prime Numbers\n\nBiggest 10 composite numbers smaller than 1193\n\nSmallest 10 composite numbers bigger than 1193"
] |
[
null
] |
{"ft_lang_label":"__label__en","ft_lang_prob":0.85296744,"math_prob":0.9744721,"size":517,"snap":"2019-13-2019-22","text_gpt3_token_len":147,"char_repetition_ratio":0.24561404,"word_repetition_ratio":0.11494253,"special_character_ratio":0.32108316,"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-23T20:24:03Z\",\"WARC-Record-ID\":\"<urn:uuid:79518f9e-bb89-440b-b282-31cf67a4dc42>\",\"Content-Length\":\"12487\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:88952b68-6602-42c5-9241-c06aa0cdf5ad>\",\"WARC-Concurrent-To\":\"<urn:uuid:f1e0e795-e518-4093-a8b6-83b8f6c03112>\",\"WARC-IP-Address\":\"104.197.145.71\",\"WARC-Target-URI\":\"https://www.isprimenumber.com/prime/1193\",\"WARC-Payload-Digest\":\"sha1:TEVRGHCAJZLOUHIKGEAAKVNYT6JMA3LJ\",\"WARC-Block-Digest\":\"sha1:3ZOOAFSSTAL7CI7R6VRZXUONXYPDLCF4\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2019/CC-MAIN-2019-13/CC-MAIN-2019-13_segments_1552912203021.14_warc_CC-MAIN-20190323201804-20190323223804-00399.warc.gz\"}"}
|
https://www.cs.ubbcluj.ro/files/curricula/2003/disc/emo005.htm
|
[
"## \"Babes-Bolyai\" University of Cluj-Napoca Faculty of Mathematics and Computer Science\n\n Functional analysis (2)\n Code Semes-ter Hours: C+S+L Credits Type Section MO005 6 2+1+0 5 compulsory Matematică MO005 6 2+1+0 4 optional Matematică-Informatică\n Teaching Staff in Charge\n Prof. COBZAS Stefan, Ph.D., [email protected]. SÁNDOR Jozsef, Ph.D., [email protected]\n Aims To present the basic results of the theory of topological vector spaces and of locally convex spaces and to deep some results on normed spaces, taught in the first semester.\n Content 1. Topological vector spaces (TVS). Definition and fundamental properties. The continuity of additive applications between TVS. Bases of neighborhoods of the origin. Linear functionals and hyperplanes in TVS. Seminormed spaces. Finite dimensional TVS - Tihonov@s theorem. Topological properties of convex sets in TVS. Minkowski functional and seminorms. The continuity of Minkowski functional. Metrizability. Completeness, compactness and total boundedness in TVS. Note: Some questions concerning general topology as: the indroduction of a topology using neighborhood sustems, nets and filters, topological products and Tihonov@s theorem, will be treated at the seminars. 2. Locally convex spaces (LCS) The notion of LCS. The local convex toplogy generated by a family of seminorms. Locally convex bases, J. von Neumann@s theorem. Bourbaki@s theorem on the characterization of the continuity of linear applications between LCS. The existence of some continuous linear functionals on LCS. Weak topologies on normed spaces. The separation of convex sets by closed hyperplanes. Extremal points and Krein-Milman@s theorem, Lyapunov convexity theorem. 3. Elements of distribution theory Inductive limits of LCS. The fundamental space of infinitely derivable functions. The notion of distribution. Regular distributions and singular distributions, distributions of finite order - examples.The topology of the space of distributions and the convergence of sequences of regular distributions. Applications of distribution theory to the solving of partial differential equations. 4. Fixpoint theorems Contractions and Banach fixpoint theorem. Fixpoint theorems for nonexpansive mappings. Theorems of Brouwer, Schauder-Tihonov and Markov-Kakutani. 5. Compact operators between normed spaces Arzela-Ascoli compactness criterium in C(T). Compact operators fundamental properties. The conjugate of an operator. Schauder@s theorem on the compactness of the conjugate of a compact operator. The spectrum of a compact operator, Riesz theory. 6. Operators on Hilbert spaces Symmetric operators, unitary operators, positive operators. The spectra of linear operators on Hilbert spaces.\n References 1. Cristescu R., Notiuni de analiza functionala liniara, Ed. Academiei, Bucuresti 1998. 2.M. Fabian et al., Functional analysis and infinite-dimensional geometry, Springer Verlag, Berlin-New York 2001. 3. Kantorovici L.V. si Akilov G.P., Analiza functionala, Editura Stiintifica si Enciclopedica, Bucuresti 1986. 4. Kutateladze S., Fundamentals of functional analysis, Kluwer AP, Dordrecht 1996. 5. Megginson R.E., An introduction to Banach space theory, Springer Verlag, Berlin-New York 1998. 6. Muntean I. Analiza functionala, Litografiat Universitatea Babes-Bolyai, Cluj-Napoca 1993. 7. Muntean I., Analiza functionala-Capitole speciale, Litografiat Universitatea Babes-Bolyai, Cluj-Napoca 1990. 8. Schaeffer H.H., Wolf M.P., Topological vector spaces, Springer Verlag, Berlin-New York 1999.\n Assessment Exam."
] |
[
null
] |
{"ft_lang_label":"__label__en","ft_lang_prob":0.70273715,"math_prob":0.817611,"size":3357,"snap":"2023-40-2023-50","text_gpt3_token_len":846,"char_repetition_ratio":0.13540113,"word_repetition_ratio":0.0,"special_character_ratio":0.19958296,"punctuation_ratio":0.21639344,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.96864104,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2023-12-11T01:52:43Z\",\"WARC-Record-ID\":\"<urn:uuid:8209bd61-c1b2-4d9d-ba60-ce1f8fa2a6de>\",\"Content-Length\":\"7710\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:60c8947b-7bea-4805-85ef-4e887e389a36>\",\"WARC-Concurrent-To\":\"<urn:uuid:6fb9e440-02aa-46cc-8697-69411afdaa78>\",\"WARC-IP-Address\":\"193.231.20.20\",\"WARC-Target-URI\":\"https://www.cs.ubbcluj.ro/files/curricula/2003/disc/emo005.htm\",\"WARC-Payload-Digest\":\"sha1:RNFGXVKABXJ4QJLTTEWBIL4U6AZTICT6\",\"WARC-Block-Digest\":\"sha1:USAK73GCLMMOGW3UFHTYZQHC763TPY2B\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2023/CC-MAIN-2023-50/CC-MAIN-2023-50_segments_1700679103464.86_warc_CC-MAIN-20231211013452-20231211043452-00346.warc.gz\"}"}
|
http://symoe.com/2799872-Why-do-equal-quality-zinc-powder-and-iron-powder-put-into-dilute-sulfuric-acid-with-equal-mass-and-s
|
[
"",
null,
"# Why do equal quality zinc powder and iron powder put into dilute sulfuric acid with equal mass and same solute mass fraction produce more hydrogen Why do equal quality zinc powder and iron powder add the same mass fraction of dilute sulfuric acid to produce more hydrogen\n\n## Why do equal quality zinc powder and iron powder put into dilute sulfuric acid with equal mass and same solute mass fraction produce more hydrogen Why do equal quality zinc powder and iron powder add the same mass fraction of dilute sulfuric acid to produce more hydrogen\n\nThe molar mass of iron is less than that of zinc. The molar number of iron and zinc iron is greater than that of zinc. The hydrogen replaced by equal molar iron and zinc is equal. Therefore, when equal mass zinc powder and iron powder are put into the same mass fraction of dilute sulfuric acid, iron produces more hydrogen\n\n### 3.8g of the mixture of zinc powder, aluminum powder, iron powder and magnesium powder reacts exactly with dilute sulfuric acid with a mass fraction of 25% solute. Evaporate the water of the reaction mixture to 11g of solid (excluding crystal water), and the mass of hydrogen generated in the reaction is () A. 0.15g B. 0.20g C. 0.30g D. 0.45g\n\nAccording to the subject information, the mixture and sulfuric acid react exactly, so the sum of the mass of the mixture and pure sulfuric acid (H2SO4) is equal to the sum of the mass of the remaining solid and hydrogen. The mass of sulfate before and after the reaction = (11g - 3.8g) = 7.2g, then the mass of pure sulfuric acid = 7.2g ÷ 96\n98 = 7.35g. Therefore, the mass of hydrogen = the mass of hydrogen element in sulfuric acid = 7.35g - 7.2g = 0.15g, so a\n\n### Put 10g of the mixture of iron powder and copper powder into a beaker containing sufficient dilute sulfuric acid. After full reaction, the total mass of the material in the beaker is reduced by 0.1g compared with the total mass of the metal mixture and dilute sulfuric acid before reaction. Calculate the mass fraction of copper powder in the original mixture\n\nThe mass of generated hydrogen is 0.1g, and the mass of iron participating in the reaction is assumed to be x.fe + H2SO4 FeSO4 + H2 ↑ 56 2x ...\n\n### 14g of the mixture of iron powder and copper powder is put into 116.2 dilute hydrochloric acid and the reaction is just complete. At this time, the total mass of each substance in the beaker is 129G 14g of the mixture of iron powder and copper powder was put into 116.2 dilute hydrochloric acid and the reaction was just complete. At this time, the total mass of each substance in the beaker was 129 Put 14g of the mixture of iron powder and copper powder into 116.2 dilute sulfuric acid and react exactly. At this time, the total mass of each substance in the beaker is 129.8g. Find: 1. Mass fraction of iron powder in the original mixture; 2. The volume of concentrated sulfuric acid with a mass fraction of 36% (density of 1.19g / cm3) is required to prepare the dilute sulfuric acid used above; 3. Mass fraction of solute in the solution after reaction Please don't copy\n\nThe total mass before the reaction is 14 + 116.2g = 130.2g, the mass of the beaker after the reaction is 129.8g, and the mass before and after the reaction is reduced by 130.2-129.8 = 0.4g. Because copper is inactive and does not react with acid, there is only one reaction: Fe + 2H + = Fe2 + + H2, so 0.4g of hydrogen is generated, 11.2g of fe11, 19.8g of sulfuric acid, 1. Mass fraction of Fe = 5.6 /\n\n### 14g of the mixture of iron powder and copper powder is put into 116.2g of dilute hydrochloric acid and the reaction is just complete. At this time, the total mass of each substance in the beaker is 129.8g 1. What is the mass of hydrogen produced? 2. Mass fraction of iron powder in the original mixture?\n\nAfter dilute hydrochloric acid is added to iron powder and copper powder, iron reacts with hydrochloric acid to generate ferrous chloride and hydrogen. Copper does not react with hydrochloric acid. According to mass conservation, m (iron powder + copper powder) + m (hydrochloric acid) = m (salt solution + copper powder) + m (hydrogen), so m (hydrogen) = 14 + 114.2-129.8 = 0.4gfe + 2HCl = FeCl2 + h256 2\n\n### 14g of the mixture of iron powder and copper powder is put into 116.2g dilute hydrochloric acid, and the reaction is just complete. At this time, the total mass of each substance in the beaker is 129.8g Q: The volume of concentrated hydrochloric acid (density 1.19g/cm3) with a mass fraction of 36% is required to prepare the dilute hydrochloric acid used above? Write out the process and analysis. Don't copy it\n\nLet the mass of iron be x, the mass of FeCl2 generated be y, and the mass of hydrochloric acid solute consumed be Z\nThe mass of H2 is 14g + 116.2g-129.8g = 0.4g\nFe + 2HCl = FeCl2 + H2↑\n56 73 127 2\nX Z Y 0.4g\nX=11.2g\nY=25.4g\nZ=14.6g\nThe volume of 36% concentrated hydrochloric acid used is:\n14.6g÷36%÷1.19g/cm3=34.08mL\nThe mass fraction of solute in the solution obtained after reaction is:\n25.4g÷(11.2g+116.2g-0.4g) × 100%=20.0%"
] |
[
null,
"http://symoe.com/statics/23f69ebe6b7fcb87303c3ae3449a09df.png",
null
] |
{"ft_lang_label":"__label__en","ft_lang_prob":0.8927154,"math_prob":0.98669624,"size":4735,"snap":"2022-05-2022-21","text_gpt3_token_len":1346,"char_repetition_ratio":0.20820123,"word_repetition_ratio":0.21420257,"special_character_ratio":0.27835268,"punctuation_ratio":0.12252964,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9930213,"pos_list":[0,1,2],"im_url_duplicate_count":[null,null,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2022-05-29T06:25:56Z\",\"WARC-Record-ID\":\"<urn:uuid:0456047d-1c0c-4bd2-abbb-2baaee0bdcc3>\",\"Content-Length\":\"26134\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:925e473a-da5d-4113-af39-eb501b1f72b1>\",\"WARC-Concurrent-To\":\"<urn:uuid:c904c4f3-6d10-4a68-8099-f47c28dd65af>\",\"WARC-IP-Address\":\"172.67.214.64\",\"WARC-Target-URI\":\"http://symoe.com/2799872-Why-do-equal-quality-zinc-powder-and-iron-powder-put-into-dilute-sulfuric-acid-with-equal-mass-and-s\",\"WARC-Payload-Digest\":\"sha1:QG4EV7FUCBEJIY774FO66XRD37BS4POV\",\"WARC-Block-Digest\":\"sha1:SNV6I6YLG44KHVQ6233N6RRZUBIQWHPL\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2022/CC-MAIN-2022-21/CC-MAIN-2022-21_segments_1652663039492.94_warc_CC-MAIN-20220529041832-20220529071832-00074.warc.gz\"}"}
|
https://www.transtutors.com/questions/1-40-a-what-is-the-reflection-loss-of-a-0-001-in-thick-copper-shield-to-a-1000-hz-pl-2849244.htm
|
[
"# 1. (a) What is the reflection loss of a 0.001-in thick copper shield to a 1000-Hz plane...\n\n1. (a) What is the reflection loss of a 0.001-in thick copper shield to a 1000-Hz plane wave?(b) If the thickness is increased to 0.01 in, what is the reflection loss?\n\n2. (a) Calculate the skin depth and absorption loss for a brass shield 0.062 in thick at the following frequencies: a. 0.1 kHz, b. 1 kHz, c. 10 kHz, and d. 100 kHz?(b) Calculate the shielding effectiveness of a 0.015-in-thick copper shield located 1 in from the source of a 10-kHz magnetic field.\n\n A large microprocessor draws a total transient current of 10 A from a 3.3-V supply. The logic has a rise/fall time of 1 ns. It is desirable to limit theVcc-to-ground noise voltage peaks to 250 mV, and each decoupling capacitor has 5 nH of inductance in series with it. The decoupling will be done with a multiplicity of equal value capacitors, and should be effective at all frequencies above 20 MHz. (a) Draw a plot of the target impedance versus frequency. (b) What is the minimum number of decoupling capacitors required? (c) What is the minimum value for each of the individual decoupling capacitors? (d) Could larger value capacitors be used just as effectively?\n\n</pclass=\"msolistparagraph\">\n\n## Recent Questions in Electrical Engineering\n\nSubmit Your Questions Here !\nCopy and paste your question here...\nAttach Files"
] |
[
null
] |
{"ft_lang_label":"__label__en","ft_lang_prob":0.8891348,"math_prob":0.91295564,"size":2115,"snap":"2019-13-2019-22","text_gpt3_token_len":564,"char_repetition_ratio":0.11179536,"word_repetition_ratio":0.49175823,"special_character_ratio":0.2718676,"punctuation_ratio":0.13646056,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9778742,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2019-05-25T15:28:46Z\",\"WARC-Record-ID\":\"<urn:uuid:052b209b-c6fc-4750-a162-8dbaa11cd40f>\",\"Content-Length\":\"74319\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:d7a233e2-c422-4914-97af-685d16d02b32>\",\"WARC-Concurrent-To\":\"<urn:uuid:393fb751-1bcc-43a1-a3a9-833a20691dc2>\",\"WARC-IP-Address\":\"35.199.55.187\",\"WARC-Target-URI\":\"https://www.transtutors.com/questions/1-40-a-what-is-the-reflection-loss-of-a-0-001-in-thick-copper-shield-to-a-1000-hz-pl-2849244.htm\",\"WARC-Payload-Digest\":\"sha1:N23T73HAOBOLEZUBWSX5Z6BG66VJUU7A\",\"WARC-Block-Digest\":\"sha1:ORKYHU6RJLQFG2UX4GO6HGN5W4PXIGIQ\",\"WARC-Identified-Payload-Type\":\"application/xhtml+xml\",\"warc_filename\":\"/cc_download/warc_2019/CC-MAIN-2019-22/CC-MAIN-2019-22_segments_1558232258120.87_warc_CC-MAIN-20190525144906-20190525170906-00328.warc.gz\"}"}
|
https://cs.stackexchange.com/questions/59923/cfg-equivalent-of-regular-expressions
|
[
"# CFG Equivalent of regular expressions\n\nSo I was wondering something about the Chomsky hierarchy.\n\nDFAs (and NFAs) accept regular languages, while NPDAs accept context-free languages.\n\nRight-regular or left-regular grammars produce regular languages, while context-free grammars produce context-free languages.\n\nRegular expressions represent regular languages - but is there a context-free equivalent? i.e. is there some additional term we could allow to appear in a regular expression such that regular expressions with that functionality now represent context-free languages?\n\nA (rather technical) answer, where star-operator is replaced by least fixed point (equivalent to recursive formulation as in CFG) is given by our cstheory cousins: Does there exist an extension of regular expressions that captures the context free languages?\n\nThe author (Neel Krishnaswami) of that answer does not know an original source of his construction, but a later comment by Tim Schaeffer refers to the 1973 book Formal Languages by Arto Salomaa. In chapter VI.11 Salomaa introduces regular-like expressions. That book might not be in your possession, but in turn refers to A characterization of context-free languages, Journal of Computer and System Sciences, 1973, by Jozef Gruska, which is open access.\n\nThe operator Gruska considers is the following, I loosely quote from his paper. Let $\\sigma$ be a symbol and $L,L_1$ be languages. The $\\sigma$-substitution of $L_1$ into $L$, denoted by $L \\overset{\\sigma}{\\uparrow}L_1$ is defined by\n\n$$L \\overset{\\sigma}{\\uparrow}L_1 = \\{ x_0 y_1x_1 \\dots x_{k-1} y_k x_k \\mid x_0 \\sigma x_1 \\dots x_{k-1} \\sigma x_k\\in L, \\text{no \\sigma in }x_i, y_i\\in L_1 \\}.$$\n\nAfter noting that he operation $\\overset{\\sigma}{\\uparrow}$ is associative one defines the $\\sigma$-iteration as\n\n$$L^\\sigma = \\{z \\mid z\\in L \\cup L\\overset{\\sigma}{\\uparrow}L \\cup L\\overset{\\sigma}{\\uparrow}L\\overset{\\sigma}{\\uparrow}L \\cup \\dots \\text{ does not contain an occurrence of } \\sigma \\}.$$\n\nNote that if we have only a single variable, like $S\\to aSbS \\mid \\lambda$ then this substitution closure $\\{aSbS, \\lambda\\}^S$ is indeed the language generated by the grammar."
] |
[
null
] |
{"ft_lang_label":"__label__en","ft_lang_prob":0.8397036,"math_prob":0.95772856,"size":1597,"snap":"2020-24-2020-29","text_gpt3_token_len":469,"char_repetition_ratio":0.13057125,"word_repetition_ratio":0.0,"special_character_ratio":0.27175954,"punctuation_ratio":0.08561644,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9960184,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2020-07-03T21:02:41Z\",\"WARC-Record-ID\":\"<urn:uuid:5cee2b5f-3bdf-4746-a529-af9d62fbe014>\",\"Content-Length\":\"152144\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:9a5fb0b5-da19-4331-8446-d6fb3a89358f>\",\"WARC-Concurrent-To\":\"<urn:uuid:7f41c0bd-a4dc-40ae-a9e8-3a8f2e03b9ef>\",\"WARC-IP-Address\":\"151.101.129.69\",\"WARC-Target-URI\":\"https://cs.stackexchange.com/questions/59923/cfg-equivalent-of-regular-expressions\",\"WARC-Payload-Digest\":\"sha1:2J24C2BKXLBBVNFCLV7CITBEMAJRCNAD\",\"WARC-Block-Digest\":\"sha1:OQFIOJEXYFESHICGN2QKRMKPJUAQGKSH\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2020/CC-MAIN-2020-29/CC-MAIN-2020-29_segments_1593655882934.6_warc_CC-MAIN-20200703184459-20200703214459-00572.warc.gz\"}"}
|
https://patents.justia.com/patent/6411886
|
[
"# Method of detecting and controlling detonation of an internal combustion engine\n\nA method of detecting and controlling detonation, including the steps of: generating (10) a vibration signal (D) proportional to the intensity of vibration on the crankcase; wide-band-filtering (11) the vibration signal (D) to generate a first intermediate signal; rectifying (12) the first intermediate signal to generate a second intermediate signal; integrating (13) the second intermediate signal to generate a first numeric value; calculating (14) a logarithm of the first numeric value to obtain a second numeric value (Xi); calculating (16) a difference between the second numeric value (Xi) and the mean value (&mgr;i) to obtain a third numeric value (&dgr;i) with a predetermined threshold value (&dgr;o); determining (18) the presence of detonation in the event the third numeric value (&dgr;i) has a first predetermined relationship with the predetermined threshold value (&dgr;o); forming (19, 21) a detonation index (Ii) indicating the behavior of the engine in terms of detonation; and obtaining (22) a spark lead correction value (CAi) as a function of the detonation index (Ii).\n\n## Latest C.R.F. Societa Consortile per Azioni Patents:\n\nDescription\nTECHNICAL FIELD\n\nThe present invention relates to a method of detecting and controlling detonation of an internal combustion engine.\n\nBACKGROUND ART\n\nAs is known, in certain operating conditions, internal combustion engines are subject to high-intensity detonation, i.e. spontaneous combustion of the mixture, which occurs in many engine cycles, and results in impaired efficiency, dangerous overheating and reduced life of the engine, as well as possibly in sudden failure of certain engine components.\n\nVarious systems are therefore being studied, or have already been proposed, to detect detonation and act accordingly on combustion parameters to reduce its effects and the likelihood of it occurring.\n\nSuch systems are mainly based on directly or indirectly monitoring the pressure cycle pattern in the cylinder as a function of the position of the piston inside the cylinder. The pressure cycle pattern is bell-shaped, reaching a peak close to the top dead-center position, which peak is a classic rounded shape when combustion is normal (FIG. 1a), and has numerous indentations in the presence of detonation (FIG. 1b).\n\nInformation by which to detect detonation is obtained by analyzing the indentations.\n\nSome known methods employ sensors located inside the combustion chamber to directly determine the amplitude of the indentations. While providing for highly accurate, reliable amplitude values, such a sensor arrangement calls for sophisticated high-cost technology and is therefore only suitable for laboratory or prototype application.\n\nOther methods employ sensors located, and for detecting vibration, on the crankcase. Though technically simpler and cheaper, the values obtained by such sensors are subject to greater interference than those detected directly, on account of the vibration measured on the crankcase also being the result of other phenomena besides crankcase-filtered variations in pressure inside the cylinder.\n\nPatent GB-A-2 265 006 filed by Nippondenso Co Ltd, for example, relates to a detonation control system featuring detonation sensors on the crankcase, and which detects detonation by comparing the intensity of the sensor signal with a decision threshold, and provides for eliminating detonation by accordingly controlling engine operating parameters, such as injection advance. More specifically, the system performs a logarithmic conversion of the intensity of the sensor signal, determines its distribution, calculates a value corresponding to the standard deviation of the distribution, and compares the value with a threshold calculated on the basis of the previously calculated value and a mean value of said distribution.\n\nThe distribution is determined by processing numeric values representing the amplitudes of spectral components obtained by narrow-band filtering the output signal of the sensors. The output signal, in fact, comprises numerous harmonics, and narrow-band filtration is employed to only extract the highest-energy harmonic.\n\nIt is important to note that, in the above patent, the detonation threshold is adapted at each cycle.\n\nIn some cases, however, controlling operation of the engine on the basis of one frequency in the spectrum and one engine cycle at a time may prove restrictive.\n\nThat is, considering only one frequency may result in others, different from the one considered but generated all the same by detonation, being overlooked, while control designed solely to eliminate local detonation cycle by cycle may not always be the best solution, in that, in terms of engine operation and efficiency, it sometimes pays to tolerate a given number of detonations every so many engine cycles and/or in only some of the cylinders. Trace detonation, in fact, by enabling high efficiency of the engine, is a favourable engine operating condition, and therefore one to be encouraged.\n\nFinally, adapting the decision threshold calls for numerous numeric processing operations, which further complicate implementation of the method.\n\nOne proposal to eliminate the aforementioned drawbacks is the detonation detecting method described in Patent Application WO-97/21084 filed on Nov. 29, 1996 by the same Applicant and published on Dec. 06, 1997.\n\nThe detection method in the above patent application provides for wide-band filtering and rectifying the output signal of an acceleration sensor on the crankcase; integrating the rectified signal in a time window appropriately located with respect to the combustion considered; and effecting a logarithmic conversion of the integration result.\n\nRepeating the above operations for each combustion of the engine provides for defining a distribution of values, of which are calculated, at each combustion, a mean value and a numeric value correlated to the standard deviation on the basis of previous combustion values. On the basis of the numeric value and a predetermined threshold value which is constant alongside variations in engine speed, a detonation coefficient value is then calculated at each engine combustion, and which indicates the detonation “propensity” of the engine.\n\nDISCLOSURE OF INVENTION\n\nIt is an object of the present invention to provide an improved detonation detecting method as compared with that described in Patent Application WO-97/21084.\n\nAccording to the present invention, there is provided a method of detecting and controlling detonation of an internal combustion engine, comprising the steps of:\n\na) acquiring a vibration signal proportional to the intensity of vibration on the crankcase;\n\nb) wide-band filtering said vibration signal to generate a first intermediate signal;\n\nc) rectifying said first intermediate signal to generate a second intermediate signal;\n\nd) integrating said second intermediate signal to generate a first numeric value;\n\ne) calculating a logarithm of said first numeric value to obtain a second numeric value;\n\nf) calculating a mean value as a function of said second numeric value;\n\ncharacterized by comprising the steps of:\n\ng) calculating a difference between said second numeric value and said mean value to obtain a third numeric value;\n\nh) comparing said third numeric value with a predetermined threshold value;\n\nm) determining the presence of detonation in the event said third numeric value has a first predetermined relationship with said predetermined threshold value;\n\nn) forming a detonation index indicating the behaviour of the engine in terms of detonation; and\n\no) calculating, from said detonation index, a correction value to be added to the spark lead.\n\nBRIEF DESCRIPTION OF DRAWINGS\n\nA preferred, non-limiting embodiment of the present invention will be described by way of example with reference to the accompanying drawings, in which:\n\nFIGS. 1a and 1b show two pressure cycle graphs in the absence and presence of detonation respectively;\n\nFIG. 2 shows a simplified diagram of a combustion system featuring the detection method according to the invention;\n\nFIG. 3 shows a flow chart of a first embodiment of the detection method according to the invention;\n\nFIGS. 4 and 5 show graphs of certain quantities relative to the detection method according to the invention.\n\nBEST MODE FOR CARRYING OUT THE INVENTION\n\nNumber 1 in FIG. 2 indicates as a whole a detonation detecting device connected to an internal combustion engine 2, of which only the crankcase 3 and cylinders 4 are shown.\n\nDetecting device 1 comprises a known acceleration sensor 5 (not described in detail) fitted to crankcase 3 of engine 2 and generating a vibration signal D correlated to the intensity of the vibration on crankcase 3; and a central processing unit 6 for receiving vibration signal D and implementing the operations relative to the method according to the present invention and described below with reference to the FIG. 3 flow chart.\n\nThe operations described with reference to FIG. 3 are repeated for each combustion of engine 2 to continually monitor detonation in the various engine cycles, and each of the values calculated in a generic i-th repetition is indicated hereinafter by the subscript “i”.\n\nIn the following description, reference is made to a counter Ii associated with the cylinder 4 of engine 2 in which the combustion considered takes place. More specifically, each cylinder 4 is assigned a respective counter I, and, to identify the various counters I in the following description, each is followed by an “[n]” term indicating the n-th cylinder 4 with which the counter is associated.\n\nThe counter values are initialized, e.g. set to 0, at the start of detection (e.g. when engine 2 is turned on) and are subsequently modified according to whether or not detonation is established in respective cylinders 4.\n\nMore specifically, and as will be made clear in the following description, the values of a counter I define a detonation index of engine 2 indicating the behaviour of engine 2 in terms of detonation.\n\nAs shown in FIG. 3, after each combustion of engine 2, vibration signal D is generated by acceleration sensor 5 and acquired by central processing unit 6 (block 10).\n\nVibration signal D is then wide-band filtered (block 11), rectified (block 12), and integrated in an appropriate time window (block 13).\n\nMore specifically, the integration time window commences at the combustion phase of the cylinder 4 considered, immediately following the top dead-center position, and is of constant angular duration with respect to the speed of engine 2, whereas the filtration band of vibration signal D is calibrated experimentally and normally ranges between 5 and 20 kHz.\n\nThe logarithm xi of the integration result is then calculated (block 14), and a corresponding mean value &mgr;i is determined as a function of logarithm value xi (block 15).\n\nMore specifically, mean value &mgr;i is calculated according to the equation: { μ i = ( 1 - λ 1 ) · x i + λ 1 · μ i - 1 i ≥ 2 μ 1 = x 1 &AutoLeftMatch;\n\nwhere &mgr;i is the mean value calculated at the i-th repetition; &mgr;i−1 is the mean value calculated at the previous repetition i−1; xi is the logarithm value calculated at the i-th repetition; and &lgr;1 is a predefined parameter.\n\nAs can be seen from the above equation, at the first repetition, the calculated mean value &mgr;i coincides with the calculated logarithm value xi, whereas, from the second repetition onwards, mean value &mgr;i is updated on the basis of both the logarithm value xi calculated at the i-th repetition, and the mean value &mgr;i−1 calculated at repetition i−1, each weighted according to parameter &lgr;1.\n\nA peculiar characteristic of the above algorithm for updating mean value &mgr;i is that of defining a filter with a very small time constant enabling the calculated mean value to rapidly follow variations in the xi values obtained following logarithmic conversion of the integration result. This characteristic is extremely useful in transient states by ensuring precise tracking of vibration signal D.\n\nCalculation of mean value &mgr;i is followed by calculating the value &dgr;1 of the difference between value xi and mean value &mgr;i (block 16).\n\nValue &dgr;1 is then compared with a predetermined threshold value &dgr;o (block 17) to determine the presence or absence of detonation and accordingly modify the value of the counter Ii[n] associated with the cylinder in question.\n\nAccording to the present invention, threshold value &dgr;o is constant for all the repeat detection operations, is constant alongside variations in the speed of engine 2, and is correlated to the standard deviation value &sgr; of the distribution of values xi in the absence of detonation.\n\nIn particular, the standard deviation value &sgr; of the distribution of values xi in the absences of detonation is conveniently calculated on the basis of laboratory engine tests, by so setting the injection advance of the engine as to eliminate detonation. Given the standard deviation value &sgr;, the corresponding threshold value &dgr;o is then calculated and conveniently memorized in central processing unit 6. Tests have shown that the best threshold value &dgr;o for reliably detecting detonation is roughly 3-4 times the standard deviation value &sgr;.\n\nBlock 17 determines whether value &dgr;i is greater than or equal to predetermined threshold value, &dgr;o. If &dgr;i is greater than or equal to threshold value &dgr;o (YES output of block 17), the presence of detonation in the cylinder 4 in question is established (block 18) and the value of counter Ii[n] associated with the cylinder is modified (block 19) according to the equation:\n\nIi[n]=Ii−1[n]−M·(&dgr;i−&dgr;o)\n\nwhere M is a proportion coefficient, which is generally a function of the speed of engine 2 and the n-th cylinder considered at the time. In other words, by depending on the cylinder 4 considered, proportion coefficient M takes into account the transfer function of crankcase 3 in the combustion considered.\n\nMore specifically, at the i-th repetition, the value of the n-th counter Ii[n] is calculated by decreasing the value of the n-th counter Ii[n] at repetition i−1 by an amount proportional to the difference between value &dgr;i and threshold value &dgr;o.\n\nConversely, if &dgr;i is less than threshold value &dgr;o (NO output of block 17), the absence of detonation in the cylinder 4 in question is established (block 20) and the value of counter Ii[n] associated with the cylinder is modified (block 21) according to the equation:\n\nIi[n]=Ii−1[n]+1\n\nThat is, at the i-th repetition, the value of the n-th counter Ii[n] is calculated by increasing by one unit the value of the n-th counter Ii[n] at repetition i−1.\n\nAs stated, the current value of a counter Ii[n] defines a detonation index of engine 2 indicating the behaviour of engine 2 in terms of detonation, i.e. the tendency of engine 2 to detonate. By increasing the value of the counter when no detonation is detected in the respective cylinder, and decreasing the counter value when detonation is detected, it therefore follows that high positive counter values indicate a tendency of engine 2 either not to detonate or to detonate in temporally widely spaced engine cycles, whereas high negative counter values indicate a tendency of engine 2 to detonate.\n\nOnce the value of counter Ii[n] is modified according to whether the presence or absence of detonation is established in the respective cylinder (block 19 or 21), the current value Ii[n] of the counter is used to determine an injection advance correction value CAi[n] relative to the n-th cylinder 4 considered, and defining the best correction to be made to the injection advance of the cylinder to control detonation in the cylinder as required (block 22). The injection advance correction value CAi[n] is determined according to the equation:\n\nCAi[n]=KP·Ii[n]\n\nwhere Ii[n] is the current value of the n-th counter at the i-th repetition; and Kp is a factor defining how the advance correction is to be implemented.\n\nIn particular, Kp may be constant alongside variations in the speed of engine 2, or may be a function of the speed of engine 2.\n\nPurely by way of example, FIG. 4 shows a graph of the value Ii[n] assumed, in successive engine cycles, by a counter associated with a cylinder 4 of engine 2; and FIG. 5 shows a graph of the advance correction value CAi[n] for the same cylinder, calculated according to the above equation and as a function of value Ii[n] of the same counter. In FIG. 5, advance correction value CAi[n] varies in discrete values of 0.5° as opposed to continuously.\n\nThe advantages of the method according to the present invention are as follows.\n\nIn particular, to determine the presence or absence of detonation, the method according to the present invention operates on the basis of the difference between logarithm value xi and mean value &mgr;i, with no need, as in the method described in Patent Application WO-97/21084, to calculate a numeric value correlated to the standard deviation of the distribution of values xi. This obviously provides for greatly simplifying the processing required to determine the detonation behaviour and effectively control operation of engine 2, as well as for reducing the number of components required.\n\nMoreover, the method according to the present invention models the detonation phenomenon by defining a threshold value &dgr;o valid in all operating conditions and for all types of engine 2, thus further simplifying processing and reducing the number of components required.\n\nMoreover, the method according to the present invention provides for determining advance correction value CAi[n] using a law of correction enabling the number of detonations present at any speed of engine 2 to be “measured out” as required, and which provides for obtaining an advance correction directly proportional to the amount of detonation that has taken place.\n\nMoreover, the method according to the present invention operates on the basis of a wide-band-filtered signal to make use of the maximum possible amount of information, even though this obviously involves also detecting the effects of other phenomena not related to detonation.\n\nFinally, the method according to the present invention employs a mean value &mgr;i updating algorithm enabling the calculated mean value to rapidly follow any variations in the xi values obtained following logarithmic conversion of the integration result.\n\nClearly, changes may be made to the method as described and illustrated herein without, however, departing from the scope of the present invention.\n\n## Claims\n\n1. A method of detecting and controlling detonation of an internal combustion engine ( 2 ), comprising the steps of:\n\na) acquiring ( 10 ) a vibration signal (D) proportional to the intensity of vibration on the crankcase;\nb) wide-band filtering ( 11 ) said vibration signal (D) to generate a first intermediate signal;\nc) rectifying ( 12 ) said first intermediate signal to generate a second intermediate signal;\nd) integrating ( 13 ) said second intermediate signal to generate a first numeric value;\ne) calculating ( 14 ) a logarithm of said first numeric value to obtain a second numeric value (x i );\nf) calculating ( 15 ) a mean value (&mgr; i ) as a function of said second numeric value (x i );\ng) calculating ( 16 ) a difference between said second numeric value (x i ) and said mean value (&mgr; i ) to obtain a third numeric value (&dgr; i );\nh) comparing ( 17 ) said third numeric value (&dgr; i ) with a predetermined threshold value (&dgr; o );\nm) determining ( 18 ) the presence of detonation in the event said third numeric value (&dgr; i ) has a first predetermined relationship with said predetermined threshold value (&dgr; o );\nn) forming a detonation index indicating the behaviour of the engine in terms of detonation; and\no) calculating, from said detonation index, a correction value to be added to the spark lead.\n\n2. A method as claimed in claim 1, characterized in that said step i) comprises the step of determining ( 18 ) said presence of detonation in the event said third numeric value (&dgr; i ) is greater than or equal to said predetermined threshold value (&dgr; o ).\n\n3. A method as claimed in claim 1, characterized by also comprising the step of:\n\np) determining ( 20 ) the absence of detonation in the event said third numeric value (&dgr; i ) does not have said first predetermined relationship with said predetermined threshold value (&dgr; o ).\n\n4. A method as claimed in claim 1, characterized in that said step b) comprises the step of filtering said vibration signal (D) between 5 and 25 kHz.\n\n5. A method as claimed in claim 1, characterized in that said threshold value (&dgr; o ) used in step h) is predetermined and constant alongside a variation in the speed of said engine ( 2 ).\n\n6. A method as claimed in claim 1, characterized in that said step d) comprises the step of integrating said second intermediate signal in a predetermined time window during the combustion phase.\n\n7. A method as claimed in claim 6, characterized in that said integration time window commences, during said combustion phase, immediately following the top dead-center position, and is of constant angular duration with respect to the speed of said engine ( 2 ).\n\n8. A method as claimed in claim 1, characterized by also comprising the steps of:\n\nq) calculating ( 19, 21 ) a detonation index (I i [n]) indicating the behaviour of said engine ( 2 ) in terms of detonation; and\nr) calculating ( 22 ) an injection advance correction value (CA i [n]) as a function of said detonation index (I i [n]).\n\n9. A method as claimed in claim 8, characterized in that said step r) comprises the step of calculating ( 22 ) said injection advance correction value (CA i [n]) according to the equation:\n\n10. A method as claimed in claim 8, characterized in that said step q) comprises the step of:\n\ns) calculating ( 19 ) said detonations index (I i [n]) as a function of said third numeric value (&dgr; i ) and of said predetermined threshold value (&dgr; o ) in the event said third numeric value (&dgr; i ) has said first predetermined relationship with said predetermined threshold value (&dgr; o ).\n\n11. A method as claimed in claim 4, characterized by repeating said steps from a) to r) to generate a number (i) of said second numeric values (x i ), of said mean values (&mgr; i ), of said third numeric values (&dgr; i ), of said detonation indexes (I i [n]), and of said injection advance correction values (CA i [n]).\n\n12. A method as claimed in claim 11, characterized in that each of said detonation indexes (I i [n]) is calculated ( 19 ), in the event said third numeric value (&dgr; i ) has said first predetermined relationship with said predetermined threshold value (&dgr; o ), according to the equation:\n\n13. A method as claimed in claim 11, characterized in that each of said detonation indexes (I i [n]) is calculated ( 21 ), in the event said third numeric value (&dgr; i ) does not have said first predetermined relationship with said predetermined threshold value (&dgr; o )according to the equation:\n\n14. A method as claimed in claim 7, characterized in that each of said mean values (&mgr; i ) is calculated ( 15 ) according to the equation: { μ i = ( 1 - λ 1 ) · x i + λ 1 · μ i - 1 i ≥ 2 μ 1 = x 1 ⁢ ⁢ &AutoLeftMatch;\n\n15. A method as claimed in claim 11, characterized in that said threshold value (&dgr; o ) used in step h) is correlated to the standard deviation value of the distribution of second numeric values (x i ) obtained in the absence of detonation.\n\nPatent History\nPatent number: 6411886\nType: Grant\nFiled: Mar 22, 2000\nDate of Patent: Jun 25, 2002\nAssignee: C.R.F. Societa Consortile per Azioni (Orbassano)\nInventors: Gianluca Morra (Avigliana), Stefano Re Fiorentin (Grugliasco), Paolo Tubetti (Settimo Torinese), Gianpiero Einaudi (Turin)\nPrimary Examiner: Willis R. Wolfe\nAttorney, Agent or Law Firm: Crowell & Moring LLP\nApplication Number: 09/446,988"
] |
[
null
] |
{"ft_lang_label":"__label__en","ft_lang_prob":0.90720403,"math_prob":0.9605766,"size":24854,"snap":"2021-04-2021-17","text_gpt3_token_len":5392,"char_repetition_ratio":0.18354125,"word_repetition_ratio":0.22739658,"special_character_ratio":0.21883802,"punctuation_ratio":0.099378884,"nsfw_num_words":1,"has_unicode_error":false,"math_prob_llama3":0.9552969,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2021-01-22T19:16:38Z\",\"WARC-Record-ID\":\"<urn:uuid:4c45df70-8ea2-493e-9e00-7b644abde416>\",\"Content-Length\":\"75660\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:e7410fd7-390e-4b7c-bd5e-c1d0ab0acb87>\",\"WARC-Concurrent-To\":\"<urn:uuid:845ee4da-f86c-4061-b9ff-e3e7f86fcf38>\",\"WARC-IP-Address\":\"34.226.165.133\",\"WARC-Target-URI\":\"https://patents.justia.com/patent/6411886\",\"WARC-Payload-Digest\":\"sha1:WH7T7Q26PY42T4KAACOKFV4BCURSVJGC\",\"WARC-Block-Digest\":\"sha1:EKPREHGJAXPX7FMJNUNTF66IVYFWSV3G\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2021/CC-MAIN-2021-04/CC-MAIN-2021-04_segments_1610703531335.42_warc_CC-MAIN-20210122175527-20210122205527-00246.warc.gz\"}"}
|
https://numbermatics.com/n/6061366/
|
[
"# 6061366\n\n## 6,061,366 is an even composite number composed of three prime numbers multiplied together.\n\nWhat does the number 6061366 look like?\n\nThis visualization shows the relationship between its 3 prime factors (large circles) and 8 divisors.\n\n6061366 is an even composite number. It is composed of three distinct prime numbers multiplied together. It has a total of eight divisors.\n\n## Prime factorization of 6061366:\n\n### 2 × 43 × 70481\n\nSee below for interesting mathematical facts about the number 6061366 from the Numbermatics database.\n\n### Names of 6061366\n\n• Cardinal: 6061366 can be written as Six million, sixty-one thousand, three hundred sixty-six.\n\n### Scientific notation\n\n• Scientific notation: 6.061366 × 106\n\n### Factors of 6061366\n\n• Number of distinct prime factors ω(n): 3\n• Total number of prime factors Ω(n): 3\n• Sum of prime factors: 70526\n\n### Divisors of 6061366\n\n• Number of divisors d(n): 8\n• Complete list of divisors:\n• Sum of all divisors σ(n): 9303624\n• Sum of proper divisors (its aliquot sum) s(n): 3242258\n• 6061366 is a deficient number, because the sum of its proper divisors (3242258) is less than itself. Its deficiency is 2819108\n\n### Bases of 6061366\n\n• Binary: 101110001111101001101102\n• Base-36: 3LWZA\n\n### Squares and roots of 6061366\n\n• 6061366 squared (60613662) is 36740157785956\n• 6061366 cubed (60613663) is 222695543238428975896\n• The square root of 6061366 is 2461.9841591691\n• The cube root of 6061366 is 182.3294559909\n\n### Scales and comparisons\n\nHow big is 6061366?\n• 6,061,366 seconds is equal to 10 weeks, 3 hours, 42 minutes, 46 seconds.\n• To count from 1 to 6,061,366 would take you about fifteen weeks!\n\nThis is a very rough estimate, based on a speaking rate of half a second every third order of magnitude. If you speak quickly, you could probably say any randomly-chosen number between one and a thousand in around half a second. Very big numbers obviously take longer to say, so we add half a second for every extra x1000. (We do not count involuntary pauses, bathroom breaks or the necessity of sleep in our calculation!)\n\n• A cube with a volume of 6061366 cubic inches would be around 15.2 feet tall.\n\n### Recreational maths with 6061366\n\n• 6061366 backwards is 6631606\n• The number of decimal digits it has is: 7\n• The sum of 6061366's digits is 28\n• More coming soon!\n\n#### Copy this link to share with anyone:\n\nMLA style:\n\"Number 6061366 - Facts about the integer\". Numbermatics.com. 2023. Web. 21 September 2023.\n\nAPA style:\nNumbermatics. (2023). Number 6061366 - Facts about the integer. Retrieved 21 September 2023, from https://numbermatics.com/n/6061366/\n\nChicago style:\nNumbermatics. 2023. \"Number 6061366 - Facts about the integer\". https://numbermatics.com/n/6061366/\n\nThe information we have on file for 6061366 includes mathematical data and numerical statistics calculated using standard algorithms and methods. We are adding more all the time. If there are any features you would like to see, please contact us. Information provided for educational use, intellectual curiosity and fun!\n\nKeywords: Divisors of 6061366, math, Factors of 6061366, curriculum, school, college, exams, university, Prime factorization of 6061366, STEM, science, technology, engineering, physics, economics, calculator, six million, sixty-one thousand, three hundred sixty-six.\n\nOh no. Javascript is switched off in your browser.\nSome bits of this website may not work unless you switch it on."
] |
[
null
] |
{"ft_lang_label":"__label__en","ft_lang_prob":0.8463021,"math_prob":0.95274556,"size":2810,"snap":"2023-40-2023-50","text_gpt3_token_len":759,"char_repetition_ratio":0.1336422,"word_repetition_ratio":0.034883723,"special_character_ratio":0.33487543,"punctuation_ratio":0.17260788,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9801068,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2023-09-21T22:22:51Z\",\"WARC-Record-ID\":\"<urn:uuid:46293c90-53e2-4e5f-b0e7-7c848d31d1c7>\",\"Content-Length\":\"19536\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:3f84f7e2-8198-4c2a-80d2-e26d0c2fa32c>\",\"WARC-Concurrent-To\":\"<urn:uuid:ab8f5d39-1bb3-49bd-8a42-865a85fea83c>\",\"WARC-IP-Address\":\"72.44.94.106\",\"WARC-Target-URI\":\"https://numbermatics.com/n/6061366/\",\"WARC-Payload-Digest\":\"sha1:ZEILIVFYVTX4ZHDWXKHZ3X6KWWTOCPGT\",\"WARC-Block-Digest\":\"sha1:IWYCXVSSMW6BXBIVH5YT5W5SQQ23DPOG\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2023/CC-MAIN-2023-40/CC-MAIN-2023-40_segments_1695233506045.12_warc_CC-MAIN-20230921210007-20230922000007-00860.warc.gz\"}"}
|
https://findthefactors.com/2015/10/29/662-more-candy-corn/
|
[
"# 662 More Candy Corn\n\n662 is the sum of the twelve prime numbers from 31 to 79.",
null,
"Print the puzzles or type the solution on this excel file: 10 Factors 2015-10-26\n\nHere’s the same candy corn puzzle but less colorful.",
null,
"—————————————————————————————————\n\n• 662 is a composite number.\n• Prime factorization: 662 = 2 x 331\n• The exponents in the prime factorization are 1 and 1. Adding one to each and multiplying we get (1 + 1)(1 + 1) = 2 x 2 = 4. Therefore 662 has exactly 4 factors.\n• Factors of 662: 1, 2, 331, 662\n• Factor pairs: 662 = 1 x 662 or 2 x 331\n• 662 has no square factors that allow its square root to be simplified. √662 ≈ 25.72936.",
null,
"—————————————————————————————————",
null,
"Ricardo tweeted the solution to the puzzle so I’m including it here as well."
] |
[
null,
"https://i0.wp.com/findthefactors.com/wp-content/uploads/2015/10/662-puzzle-candy-corn.jpg",
null,
"https://i0.wp.com/findthefactors.com/wp-content/uploads/2015/10/662-puzzle.jpg",
null,
"https://i0.wp.com/findthefactors.com/wp-content/uploads/2015/10/662-factor-pairs.jpg",
null,
"https://i0.wp.com/findthefactors.com/wp-content/uploads/2015/10/662-logic.jpg",
null
] |
{"ft_lang_label":"__label__en","ft_lang_prob":0.76295626,"math_prob":0.9678888,"size":847,"snap":"2023-14-2023-23","text_gpt3_token_len":256,"char_repetition_ratio":0.17912218,"word_repetition_ratio":0.0,"special_character_ratio":0.41676506,"punctuation_ratio":0.12048193,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.97129434,"pos_list":[0,1,2,3,4,5,6,7,8],"im_url_duplicate_count":[null,4,null,9,null,9,null,4,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2023-06-10T10:56:46Z\",\"WARC-Record-ID\":\"<urn:uuid:b8813a34-0afd-42c9-88e3-d1da66ca188e>\",\"Content-Length\":\"91014\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:1523b2da-c31d-4906-a933-6d1243644ab1>\",\"WARC-Concurrent-To\":\"<urn:uuid:e8073039-191d-44b1-9c5e-474fa85539b1>\",\"WARC-IP-Address\":\"192.0.78.153\",\"WARC-Target-URI\":\"https://findthefactors.com/2015/10/29/662-more-candy-corn/\",\"WARC-Payload-Digest\":\"sha1:5IMOQECHRA35LIV6LR4QAA73ELEWJVBB\",\"WARC-Block-Digest\":\"sha1:6X2O443VOYXD6YB24G2ZA5UWIRWB7T7I\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2023/CC-MAIN-2023-23/CC-MAIN-2023-23_segments_1685224657169.98_warc_CC-MAIN-20230610095459-20230610125459-00711.warc.gz\"}"}
|
http://fahry.info/free-division-worksheets-grade-4/division-worksheets-grade-3-free-multiplication-and-for-4th-4-sheet-math-digits-by-1/
|
[
"",
null,
"# Division Worksheets Grade 3 Free Multiplication And For 4th 4 Sheet Math Digits By 1",
null,
"division worksheets grade 3 free multiplication and for 4th 4 sheet math digits by 1.\n\nfree multiplication and division worksheets grade 4 word problems for 4th long,free division word problems worksheets for 4th grade multiplication and 4,free multiplication and division worksheets grade 4 word problems for 4th printable main,free multiplication and division worksheets grade 4 for 4th kids long problems worksheet word,free division word problems worksheets for 4th grade multiplication and number coloring page math pages plus color on fourth 4,math worksheets grade 4 free division word problems for 4th multiplication and,free division word problems worksheets for 4th grade multiplication and long 4,worksheets multiplication and division grade printable free word 4 problems for 4th,free multiplication and division worksheets grade 4 word problems for 4th kids the inverse relationships range,worksheet simple worksheets coordinate grid picture math free division word problems for 4th grade multiplication and 4."
] |
[
null,
"http://fahry.info/free-division-worksheets-grade-4/division-worksheets-grade-3-free-multiplication-and-for-4th-4-sheet-math-digits-by-1/",
null,
"http://fahry.info/wp-content/uploads/2017/10/division-worksheets-grade-3-free-multiplication-and-for-4th-4-sheet-math-digits-by-1.jpg",
null
] |
{"ft_lang_label":"__label__en","ft_lang_prob":0.8252855,"math_prob":0.9256072,"size":1022,"snap":"2019-26-2019-30","text_gpt3_token_len":201,"char_repetition_ratio":0.20628683,"word_repetition_ratio":0.28368795,"special_character_ratio":0.17514677,"punctuation_ratio":0.06666667,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.99325,"pos_list":[0,1,2,3,4],"im_url_duplicate_count":[null,1,null,1,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2019-07-21T23:23:13Z\",\"WARC-Record-ID\":\"<urn:uuid:9e6987cb-b949-4c4b-a3d9-410dcaef18cd>\",\"Content-Length\":\"43338\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:77fca6fa-fcd5-479d-90a9-ae714d349778>\",\"WARC-Concurrent-To\":\"<urn:uuid:7ea45054-c845-429b-9e81-3485a51a372a>\",\"WARC-IP-Address\":\"104.18.33.243\",\"WARC-Target-URI\":\"http://fahry.info/free-division-worksheets-grade-4/division-worksheets-grade-3-free-multiplication-and-for-4th-4-sheet-math-digits-by-1/\",\"WARC-Payload-Digest\":\"sha1:YTKA5LONIKKKV6K4LHU724YFLAMKWUXV\",\"WARC-Block-Digest\":\"sha1:CQXT3J73OGJG2JUGL76QHZUOZUWQ3VHK\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2019/CC-MAIN-2019-30/CC-MAIN-2019-30_segments_1563195527396.78_warc_CC-MAIN-20190721225759-20190722011759-00218.warc.gz\"}"}
|
https://stats.stackexchange.com/questions/108911/why-does-frequentist-hypothesis-testing-become-biased-towards-rejecting-the-null?noredirect=1
|
[
"# Why does frequentist hypothesis testing become biased towards rejecting the null hypothesis with sufficiently large samples?\n\nI was just reading this article on the Bayes factor for a completely unrelated problem when I stumbled upon this passage\n\nHypothesis testing with Bayes factors is more robust than frequentist hypothesis testing, since the Bayesian form avoids model selection bias, evaluates evidence in favor the null hypothesis, includes model uncertainty, and allows non-nested models to be compared (though of course the model must have the same dependent variable). Also, frequentist significance tests become biased in favor of rejecting the null hypothesis with sufficiently large sample size. [emphasis added]\n\nI've seen this claim before in Karl Friston's 2012 paper in NeuroImage, where he calls it the fallacy of classical inference.\n\nI've had a bit of trouble finding a truly pedagogical account of why this should be true. Specifically, I'm wondering:\n\n1. why this occurs\n2. how to guard against it\n3. failing that, how to detect it\n• It's somewhat debatable because it's untrue when the null is literally, exactly true, but since that is so rarely the case (due to all sorts of complexities like spurious correlations), it's probably true of most practical applications. Hypothetically speaking, one could detect the weakest of spurious correlations (e.g., r = .001) due to a chain of mediators hundreds of variables long despite a similar number of uncontrolled moderators if the sample was colossal enough. Arguably, that relationship actually exists though, so whether that's really \"bias\" is still somewhat debatable IMO... Jul 22, 2014 at 20:34\n• @NickStauner, Ah that actually makes a lot of sense! Thanks for the intuitive explanation! Jul 22, 2014 at 20:36\n• Tal Yarkoni wrote a very enlightening critique of Friston's article: talyarkoni.org/blog/2012/04/25/…\n– jona\nJul 22, 2014 at 22:33\n• @jona, Seems like I'm running into the whole cogsci crowd over here =) Thanks for the reference, this does indeed look like good reading! Jul 22, 2014 at 22:49\n• Given the assumptions hold, that statement seems to be strictly false as it stands, but it is getting at a real issue (that with sufficiently large samples, a NHST will become almost certain to reject a false null, no matter how tiny the effect). When people find that a problem, it usually indicates that hypothesis testing isn't what they need. The same basic issue (though framed in terms of CIs rather than hypothesis tests) is discussed in this answer Jul 22, 2014 at 22:58\n\nAnswer to question 1: This occurs because the $$p$$-value becomes arbitrarily small as the sample size increases in frequentist tests for difference (i.e. tests with a null hypothesis of no difference/some form of equality) when a true difference exactly equal to zero, as opposed to arbitraily close to zero, is not realistic (see Nick Stauner's comment to the OP). The $$p$$-value becomes arbitrarily small because the error of frequentist test statistics generally decreases with sample size, with the upshot that all differences are significant to an arbitrary level with a large enough sample size. Cosma Shalizi has written eruditely about this.\n\nAnswer to question 2: Within a frequentist hypothesis testing framework, one can guard against this by not making inference solely about detecting difference. For example, one can combine inferences about difference and equivalence so that one is not favoring (or conflating!) the burden of proof on evidence of effect versus evidence of absence of effect. Evidence of absence of an effect comes from, for example:\n\n1. two one-sided tests for equivalence (TOST),\n2. uniformly most powerful tests for equivalence, and\n3. the confidence interval approach to equivalence (i.e. if the $$1-2\\alpha$$%CI of the test statistic is within the a priori-defined range of equivalence/relevance, then one concludes equivalence at the $$\\alpha$$ level of significance).\n\nWhat these approaches all share is an a priori decision about what effect size constitutes a relevant difference and a null hypothesis framed in terms of a difference at least as large as what is considered relevant.\n\nCombined inference from tests for difference and tests for equivalence thus protects against the bias you describe when sample sizes are large in this way (two-by-two table showing the four possibilities resulting from combined tests for difference—positivist null hypothesis, $$\\text{H}_{0}^{+}$$—and equivalence—negativist null hypothesis, $$\\text{H}_{0}^{-}$$):",
null,
"Notice the upper left quadrant: an overpowered test is one where yes you reject the null hypothesis of no difference, but you also reject the null hypothesis of relevant difference, so yes there's a difference, but you have a priori decided you do not care about it because it is too small.\n\n• Answers like this one are why I keep coming here. Thank you! Jul 22, 2014 at 21:14\n• These combined tests are called \"relevance tests\" and yet only little studied. However, a (conservative) relevance decision can be found if one rejects the Null hypothesis iff the usual $1-\\alpha$-confidence interval is disjount from the relevance region. So, @Alexis, in case of relevance tests, you take $\\alpha$, in case of equivalence testing, you take $2\\alpha$. Jul 27, 2014 at 14:22\n• To supplement the answer to Question 1, a relevant blog post from Cosma Shalizi\n– user5594\nJan 21, 2016 at 18:33\n• I'm a bit surprised that everyone finds this question so helpful although the \"Answer to question 1\" is actually much more appropriately answered by Michael Lew - Alexis, as it seems nearly clear that this will stay up, maybe you could correct your answer to say that, mathematically speaking, hypothesis tests are in fact NOT BIASED by large sample size, according to the normal definition of bias (the other way around actually, small sample size can be a problem)! Jan 21, 2016 at 18:43\n• I understand the problem, and I agree with the assessment - it's uninformative or misleading to do a hypothesis test when !H0 is infinitely likely in the first place, and you have power close to 1. But that doesn't make the test biased, unless your definition of bias is that a method gives the right result to a question that you think should not be asked. Jan 23, 2016 at 10:00\n\nFrequentist tests with large samples DO NOT exhibit bias towards rejecting the null hypothesis if the null hypothesis is true. If the assumptions of the test are valid and the null hypothesis is true then there is no more risk of a large sample leading to rejection of the null hypothesis than a small sample. If the null is not true then we surely would be pleased to reject it, so the fact that a large sample will more frequently reject a false null than a small sample is not 'bias' but appropriate behaviour.\n\nThe fear of 'overpowered experiments' is based on assuming that it is not a good thing to reject the null hypothesis when it is nearly true. But if it is only nearly true then it is actually false! Reject away, but do not fail to notice (and clearly report) the effect size observed. It may be trivially small and therefore not worthy of serious consideration, but a decision on that issue has to be made after consideration of information from outside the hypothesis test.\n\n• Belief that frequentist test are not biased towards rejecting the null hypothesis as sample size grows is based on assuming that $0$ is meaningfully and substantively different than $0 + \\text{really frickin' tiny}$. May 8, 2015 at 17:18\n• @Alexis Read the second paragraph again. I absolutely agree that really frickin' tiny is not substantively important, but it is also not logically zero. May 8, 2015 at 21:00\n• Sorry for a comment that is worthless to the public, but @MichaelLew, I really liked your answer. The first sentence is quite important and I do not think it was elucidated efficiently in Alexis' answer (which is also nice, of course). Jan 21, 2016 at 19:01"
] |
[
null,
"https://i.stack.imgur.com/BLeWm.png",
null
] |
{"ft_lang_label":"__label__en","ft_lang_prob":0.9313365,"math_prob":0.8336082,"size":2303,"snap":"2022-05-2022-21","text_gpt3_token_len":474,"char_repetition_ratio":0.14789039,"word_repetition_ratio":0.0056980057,"special_character_ratio":0.19973947,"punctuation_ratio":0.083333336,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.97561616,"pos_list":[0,1,2],"im_url_duplicate_count":[null,null,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2022-05-21T23:32:35Z\",\"WARC-Record-ID\":\"<urn:uuid:1e4219f6-ca45-40d2-85ce-045223e4f4d8>\",\"Content-Length\":\"260510\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:7c01b3a9-20bf-42c3-b23f-bbfc4d956b1f>\",\"WARC-Concurrent-To\":\"<urn:uuid:fbcd1760-5e23-4ec7-a56b-13d942065d1d>\",\"WARC-IP-Address\":\"151.101.65.69\",\"WARC-Target-URI\":\"https://stats.stackexchange.com/questions/108911/why-does-frequentist-hypothesis-testing-become-biased-towards-rejecting-the-null?noredirect=1\",\"WARC-Payload-Digest\":\"sha1:H7NFZWIGXFLG2VYEVEXTWRWZ535MBGO6\",\"WARC-Block-Digest\":\"sha1:MJUAV5FNQ3XITIAZXWGO4DW7E25YCRJ2\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2022/CC-MAIN-2022-21/CC-MAIN-2022-21_segments_1652662541747.38_warc_CC-MAIN-20220521205757-20220521235757-00664.warc.gz\"}"}
|
https://guiadelaelectricidad.com/energy/
|
[
"# Energy",
null,
"Before we look into\nthe physical principles of photovoltaics, let’s define some basic connections between\nthe three very important physical quantities: energy, force and power. These connections are taken from classical\nmechanics, but are generally valid. The learning objectives for this video are to understand\nhow force, energy and power are related. We will learn to define and relate\ndifferent types of energy. Finally, we will look at the first\nand second law of thermodynamics and discuss what their implications are for solar cells. We will start with the force. The force can be defined as any influence\non an object that changes its motion. A force is exerted as a result of an interaction\nbetween two or more objects. The objects can be in physical contact, or at a distance, like gravitational forces or magnetic forces. In this figure a very strong man\nexerts a force on a granite block. The force causes the block to accelerate. According to Newton’s second law,\nthe acceleration ‘a’ depends on the magnitude of the exerted force ‘F’ and the mass ‘m’\nof the object that undergoes the acceleration. As shown in this equation. We can gather from the figure that the force\nand acceleration are vectors, or directional quantities. The units of force are kilogram times meter\nper second squared, which is known as a newton, denoted by ‘N’. The amount of energy used in this interaction\nis given by the product of the force and the distance ‘s’. Energy is a very useful concept to evaluate\nan amount of effort to accomplish a system change, or to put it simply, the ability of a system to do work. Let’s put this definition of energy in practice. Here we have a tomato. We lift the tomato up to a height of 1 meter, for which we have to overcome\nthe gravitational force ’G’. Since the required amount of energy is equal\nto the force times the distance, it is equal to ‘G’ times the height ‘h’. The gravitational force near the surface of\nthe earth, is equal to the mass of the tomato times the gravitational acceleration,\nwhich is denoted by the lowercase ‘g’. The amount of energy required to lift the\ntomato is therefore equal to 1 kilogram times meter squared per second squared. This is known as a joule, after the\nEnglish physicist James Prescott Joule. Since energy is equal to\na force applied over a certain distance, 1 joule can also be defined as the amount\nof energy required to apply a force of 1 Newton over a distance of 1 meter. We just defined energy as the ability to exert\na force over a certain distance. But that is not the only definition of energy. Energy can be converted from one form to another\nand all these manifestations of energy that we can observe are related through the great\nphysical constants that define our universe. We have related energy to the mass of an object\nand the height of that object, with respect to the surface of the earth,\nthrough the gravitational acceleration, which is derived from the gravitational constant. According to Einstein’s famous equation,\nenergy and mass are also interchangeable, through the speed of light in vacuo,\ndenoted by c-naught. The energy contained in a voltage,\nwhich is a difference in electric potential charge, is related through the elementary charge, denoted by ‘q’. The elementary charge is the charge of a single\nproton or electron, which have similar charge but of opposite sign. The elementary charge is expressed in Coulomb,\nafter the French physicist Charles-Augustin de Coulomb, which is equal to an ampere times a second. The amount of thermal energy present in a\ntemperature is defined using Boltzmann’s constant, denoted by ‘k-B’. Finally, the discrete particles of energy\ncontained in an electromagnetic radiation, like light, is a function of only its frequency, denoted by ‘nu’. Energy and frequency are related though\nPlanck’s constant, denoted by ‘h’. All these constants, and implicitly\nall these definitions of energy, play an important role in the field of photovoltaics. Now, on to power. The power ‘P’ is defined as the amount\nof energy used per unit time, denoted by ‘t’. Power is therefore expressed in joules per second. 1 Joule per second is also known as a Watt,\nafter Scottish engineer James Watt. As an example, with 70 joules of energy we could power\nthis 70 Watt incandescent light for exactly one second. We could also power this 7 Watt LED light\nfor 10 seconds, or 10 of these LED lights for 1 second. Joules are not the only unit used to express\na certain amount of energy. 1 joule is a very small amount compared\nto the human energy consumption. Therefore a different unit of energy is used\nfor the production and consumption of electrical energy, namely the kiloWatt-hour. 1 kiloWatt-hour, as the name implies,\nis the amount of energy consumed if a power of 1 kiloWatt is applied for one hour. Since 1 kiloWatt is equal to 1000 joules per\nsecond, and there are 3600 seconds in an hour, 1 kiloWatt-hour is equal to 3.6 megajoules. The amounts of energy used in the\natomic physics relevant for solar cells, on the other hand, are very small. We therefore use the unit electronvolts. An electronvolt is the amount of energy a\nbody with a charge of one elementary charge gains or loses when it is moved across the\nelectric potential difference of 1 volt. 1 electronvolt is therefore equal to the\nelementary charge times 1 volt, which equals 1.6 times 10 to the power minus 19 joules. For the large scale production and consumption of\nenergy, a unit is used that is much larger than the joule, namely the ton of oil equivalent, or toe. A toe is defined as the amount of energy released\nby the burning of 1 ton of crude oil. 1 toe is equal to 4.2 times 10 to the power 10 joules. Finally, in the food industry the unit of calorie is used. 1 calorie is defined as the amount of energy\nrequired to raise the temperature of 1 gram of water by 1 degree Celsius, at a pressure of 1 atmosphere. One calorie equals to 4.2 joules. We discussed how energy can be converted\nfrom one form into another form. Practical examples are wind turbines\nthat convert the kinetic energy, contained in the particle flow that we know\nas the wind, into mechanical energy, which is then converted into electrical energy. Chemical energy stored in fossil fuels are\nconverted into thermal energy, which is in turn converted into mechanical energy\nand finally electrical energy. Solar cells convert the energy contained in\nelectromagnetic radiation directly in electrical energy. The first law of thermodynamics tells us that\nthroughout all of these conversions, in a closed system, the total amount\nof energy is conserved. This means that, in a closed system like the\nuniverse, the total amount of energy does not change. The second law of thermodynamics, however,\nstates that the entropy of a system can only ever increase or stay the same. So, what exactly is the entropy of a system? The entropy is a measure of amount of dispersion\nof matter and energy in a closed system. The fact that entropy only increases, implies\nthat the amount of dispersion will only ever increase. This is illustrated by the figure on the right. We can see a closed system, with a large blue\narea containing a liquid at a low temperature, and a small red area containing a liquid\nat a high temperature. The two areas are thermally separated by a membrane. We know from experience that when we remove\nthe membrane, the hot liquid will diffuse into the cold liquid, producing a mix\nwith a temperature somewhere in between. Where first the hot molecules were contained\nin a small area, they now have dispersed throughout the system and the entropy has increased. Since the hot liquid could more easily\nbe converted into other forms of energy, the quality of the energy contained\nin the closed system has decreased. The entropy can therefore also be interpreted\nas a measure of the usefulness of a type of energy. The lower the entropy of a type of energy,\nthe easier it is to convert that energy into another type, so the higher its usefulness. Mechanical and electrical energy are very useful,\nsince they can be converted into one-another with an efficiency of over 90%. Both can be converted into thermal without any loss. Thermal energy however can not be converted\ninto electrical energy directly, and its conversion into mechanical energy\noccurs at an efficiency of under 60%. Thermal energy is the most distributed,\nand least useful form of energy. Furthermore, the usefulness of thermal energy,\nand its conversion efficiency into other forms of energy, decreases strongly with its temperature. For any natural energy conversion\nor even every natural process, the quantity of energy will remain the same. The quality of the energy will decrease. This has some implications for photovoltaics as well. When an electric current, which is flow\nof charge carriers, moves through an object its usefulness will decrease. During this flow some power\nis dissipated as thermal energy. The amount of dissipated heat is equal to the current\nsquared times the resistance of the material. 1 Joule of thermal energy is therefore dissipated\nwhen an electric current of 1 ampere passes through a resistance of 1 ohm for 1 second. In the last week of this course we will see\nhow the thermodynamic laws fundamentally limit the performance of a solar cell. In summary, we defined the force as any influence\non an object that changes its motion and the energy as ability to apply a force\nover a certain distance. The power we defined as the energy\nexerted per unit time. We introduced a number of alternative definitions\nof which the kiloWatt hour and electronvolt are of special interest to us as solar cell engineers. We discussed how one form of energy\ncan be converted into another, without changing the total amount\nof energy in a closed system. Then we found that even though the quantity\nof the energy in a system does not change, the quality of the energy will only ever\ndecrease or stay the same. Thermal energy is the most dispersed,\nand least useful form of energy and we discussed the thermal energy dissipation in a material. In the next video we will discuss the output\nof our greatest source of energy, the sun.\n\nTags: , , , , , , , , , , , , , , , , , , , , , , , , , , , , ,\n\n## 1 thought on “Energy”\n\n1.",
null,
"Edwin Rojas says:\n\nExcellent"
] |
[
null,
"https://guiadelaelectricidad.com/wp-content/uploads/2019/10/5936/energy.jpg",
null,
"https://secure.gravatar.com/avatar/d8015938c1e29736617b13ef37dc3f14",
null
] |
{"ft_lang_label":"__label__en","ft_lang_prob":0.9322515,"math_prob":0.9782199,"size":10245,"snap":"2019-43-2019-47","text_gpt3_token_len":2230,"char_repetition_ratio":0.1427595,"word_repetition_ratio":0.03448276,"special_character_ratio":0.20253782,"punctuation_ratio":0.09692074,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.99518234,"pos_list":[0,1,2,3,4],"im_url_duplicate_count":[null,2,null,null,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2019-11-17T23:03:54Z\",\"WARC-Record-ID\":\"<urn:uuid:3f5b3da6-f7b6-4414-85fe-14ecbcd6b8e6>\",\"Content-Length\":\"52482\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:34002759-272e-4c2f-af37-1d2431e1575e>\",\"WARC-Concurrent-To\":\"<urn:uuid:30b8fd71-e010-405a-88d9-7779a7fb573e>\",\"WARC-IP-Address\":\"104.24.115.214\",\"WARC-Target-URI\":\"https://guiadelaelectricidad.com/energy/\",\"WARC-Payload-Digest\":\"sha1:OJ76HGFWPSVDU7VQDDUUJQWQRKJ5WSNO\",\"WARC-Block-Digest\":\"sha1:CKSVFZO5NRTTGRSOMR7P6S2H5NR6KCBQ\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2019/CC-MAIN-2019-47/CC-MAIN-2019-47_segments_1573496669352.5_warc_CC-MAIN-20191117215823-20191118003823-00034.warc.gz\"}"}
|
https://kirubarajan.com/blog/ml_notes/
|
[
"Last Edit: 2019-11-21\n\n# Machine Learning Concepts\n\nMy Notes on Various Machine Learning Topics\n\nGetting started in machine learning sometimes feels like drinking water from a firehose (pardon my cliché). The topic has so many academic roots in a lot of different disciplines (bayesian statistics, optimization, and information theory - oh my!) so I decided to keep a personal glossary of various machine learning concepts (namely relating to neural networks and natural language processing) for my own benefit. These notes might not be complete or accurate - if you would like to see an idea to be written about here feel free to shoot me an email!\n\n## Variational Inference\n\nVariational Inference consists of framing inference as an optimization process. For example when we are working with an intractable probability distribution $p$, variational inference has significant gains over Markov-Chain Monte-Carlo estimation.\n\nFor data $x$ and latent variable $z$, we have:\n\n1. Prior: $p(z)$\n2. Likelihood: $p(x | z)$\n3. Posterior: $p(z | x)$\n\nAs a result, we approximate the conditional density of latent variables given observed variables by using optimization methods. For a distribution $p$, we can approximate it with our own distribution $q$ such that we minimize the KL-Divergence between the two distributions:\n\n$KL(q || p) = \\sum_x {~ q(x) \\cdot \\operatorname{log} ~ \\frac{q(x)}{p(x)}}$\n\n### Evidence Lower Bound\n\nWe can re-write the KL-Divergence between $q$ and $p(z | x)$ as:\n\n$KL[q(z) ~||~ p(z | x)] = \\mathop{\\mathbb{E}}~[\\operatorname{log} q(z)] - \\mathop{\\mathbb{E}}~[\\operatorname{log} p(z | x)]$\n\nThen, we can expand the conditional term (and apply the logarithm identities) to get:\n\n$KL[q(z) ~||~ p(z | x)] = \\mathop{\\mathbb{E}}~[\\operatorname{log} q(z)] - \\mathop{\\mathbb{E}}~[\\operatorname{log} p(z, x)] + \\operatorname{log} p(x)$\n\nThe $\\operatorname{log} p(x)$ term makes computing the KL-Divergence intractable, since we assumed $p(x)$ to be intractable. However, we can give a lower bound on this quantity since the KL-Divergence is always at least 0:\n\n$\\operatorname{log} p(x) \\geq \\mathop{\\mathbb{E}}~[\\operatorname{log} p(z, x)] - \\mathop{\\mathbb{E}}~[\\operatorname{log} q(z)]$\n\nWe define the L.H.S to be ELBO: evidence lower bound. This is equivalent to the negative KL-Divergence plus $\\operatorname{log} p(x)$. The nice thing about this is that $\\operatorname{log} p(x)$ is a constant with respect to distribution $q$, so we can minimize the KL-Divergence by maximizing ELBO, without calculating $p(x)$.\n\n### Variational Autoencoder\n\nAutoencoders are models that consist of an encoder-model architecture where the encoder takes data and encodes it into a latent representation and the decoder takes a latent representation and approximates/re-generates the original data. The goal is to learn latent representations (posterior inference over $z$), as well as learn generation from latent spaces (marginal inference over $x$).\n\nAutoencoders can be modelled using neural networks for both the encoder and decoder mechanisms. However, this can give us a lack of regularity in the latent space (i.e. non-continuous latent space) that makes generation hard for the decoder. We solve this using a variational autoencoder, which is an autoencoder that we regularize training for, not only so that we don't overfit but mainly so that the latent space is suitable for generation. We do this by encoding the autoencoder's input as a probability distribution.\n\nIn order to train our VAE, we must use backpropogation to compute the gradient of ELBO. However, since the network's nodes represent a stochastic process, we instead model stochastic neurons as having parameters $\\sigma$ and $\\mu$ that allows us propogate errors meaningfully throughout the network. This is know as the re-parameterization trick.\n\n## Natural Language Processing\n\n### N-Gram Language Models\n\nThe Maximum Likelihood Estimation for an n-gram can be given by the formula:\n\n$P(w_t | w_{t - 1}) = \\frac{c(w_{t - 1}, w_t)}{c(w_{t - 1})}$\n\nwhere $c(w)$ is the frequency of $w$ in the corpus. Sequence generation can be performed by sampling from this distribution.\n\nPerplexity is an intrinsic evaluation method for language models that captures information about the entropy within the test set. Perplexity for a given test can can be computed as:\n\n$PP(W) = P(w_1, w_2, ... w_n)^{-\\frac{1}{n}} = \\sqrt[n]{\\frac{1}{\\Pi_{i = 1}^n P(w_i|w_1, w_2 ... w_{i - 1})}}$\n\nThis estimate can be approximated using the Markov Assumption (for a bi-gram model):\n\n$PP(W) = \\sqrt[n]{\\frac{1}{\\Pi_{i = 1}^n P(w_i|w_{i - 1})}}$\n\nPerplexity can be thought of as the weighted average branching factor of a language, and generally lower perplexity is better.\n\n### Word Embeddings\n\nWord Embeddings are vectors in some space $\\mathbb{R}^{d}$ such that they encode lexical semantics. For example, the vectors of cat and kitten will have a small vector distance whereas the vectors of cat and chair will be far apart.\n\n### Cosine Similarity\n\nFor vectors $u$ and $v$:\n\n$\\operatorname{cos}(u, v) = \\frac{u \\cdot v}{|u| \\cdot |v|} = \\frac{\\sum_{i = 1}^{n} u_i v_i}{\\sqrt{\\sum_{i = 1}^{n} u^2_i} \\cdot \\sqrt{\\sum_{i = 1}^{n} v^2_i}}$\n\nWhere the range is $[0, 1]$ and we can define distance as the complement $1 - \\operatorname{cos}(u, v)$.\n\n## Deep Learning\n\n### Recurrent Neural Networks\n\nRecurrent Neural Networks are like vanilla feed-forward networks, except they contain cycles, which allow the network to process sequential data. RNNs do this by mantaining a hidden state $h \\in \\mathbb{R}^{d}$ that is updated at time-step $t$, and is later fed back into the network along with the network's previous output at time-step $t + 1$. The hidden state $h$ lets the network maintain context while processing the sequence.\n\nSometimes too much context can be a burden for the network, and results in the vanishing gradient problem where errors are propogated too far and tend to zero. This problem is resolved with models that manage context better, namely selectively remembering and forgetting parts of the context. Examples of these models are LSTMs (Long Short Term Memory) and GRUs (Gated Recurrent Units).\n\n### Attention\n\nGiven some peice of text, certain words are more important than others and we want our neural network to understand their relative importances accordingly.\n\n## Markov Processes\n\nMarkov Processes are systems that are rooted in the Markov Assumption which states that given sequential events $X_{n - 1}$, $X_{n - 2}$, ... $X_0$, we have that:\n\n$P(X_n | X_{n - 1}, X_{n - 2} ... X_0) = P(X_n | X_{n - 1})$\n\nIn other words, our process only depends on the previous state and is memory-less.\n\n### Markov Matrices\n\nA Markov Matrix $A$ is a stochastic matrix, which means that the columns of $A$ are probability vectors that model some distribution. In other words, the columns of $A$ sum to 1 and obey the axiom of probability that each entry is non-negative. The reason that these stochastic matrices are called Markov Matrices is because $A$ doesn't change with respect to time. In other words, we have that at time $t$, the probability distribution (across the states represented by the vector) is $A^tu_0$ where $u_0$ is the distribution at time $0$. This is nice because we can easily compute the exponentiation of matrices using diagonalization.\n\nThe steady state distribution $u_\\infty$ of $A$ is the distribution of $A^tu_0$ as $t$ tends to $\\infty$. This means that $Au_\\infty = u_\\infty$, which implies that $u_\\infty$ is an eigenvector of $A$ that corresponds to an eigenvalue of 1. In fact, the largest eigenvalue $\\lambda$ that $A$ can have is 1.\n\n### Perron-Frobenius Theorem\n\nLet $A$ be a square matrix with all non-negative values, with an eigenvalue $\\lambda$ such that $|\\lambda|$ is maximized. Then, 1) we have that $|\\lambda|$ is an eigenvalue of $A$ with a positive eigenvector and 2) the algebric and geometric multiplicity of $|\\lambda|$ is 1.\n\n### Spectral Theorem\n\nLet $A$ be a real, symmetric matrix such that $A^T = A$. Then, we have that 1) all the eigenvalues of $A$ are real and 2) there exists an orthonormal basis of eigenvectors for $A$."
] |
[
null
] |
{"ft_lang_label":"__label__en","ft_lang_prob":0.9205207,"math_prob":0.99842846,"size":6343,"snap":"2020-10-2020-16","text_gpt3_token_len":1301,"char_repetition_ratio":0.11405584,"word_repetition_ratio":0.003902439,"special_character_ratio":0.19076148,"punctuation_ratio":0.094736844,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9998642,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2020-02-25T15:31:59Z\",\"WARC-Record-ID\":\"<urn:uuid:9f7aab24-dcac-44f2-b985-de629e11c6c0>\",\"Content-Length\":\"402322\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:42888dde-759a-4b92-aa45-c908a89cbdb6>\",\"WARC-Concurrent-To\":\"<urn:uuid:d3115614-706f-4cf6-859f-29b1febe2bcd>\",\"WARC-IP-Address\":\"185.199.109.153\",\"WARC-Target-URI\":\"https://kirubarajan.com/blog/ml_notes/\",\"WARC-Payload-Digest\":\"sha1:UPPRCLWBTTAVZVKDT2OQQ7A2AT4OG6MR\",\"WARC-Block-Digest\":\"sha1:ATNDRE6UNJHP25M6UBCKFCS3JTPWHJJC\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2020/CC-MAIN-2020-10/CC-MAIN-2020-10_segments_1581875146123.78_warc_CC-MAIN-20200225141345-20200225171345-00549.warc.gz\"}"}
|
https://fractioncalculator.pro/__10%7C4_-__6%7C9_
|
[
"# 10/4 - 6/9 - Subtracting Fractions\n\nUse this calculator to add, subtract, multiply and divide fractions. How to figure out subtract 6/9 from 10/4?\n\n### Fraction Calculator\n\nPlease, enter two fractions then select the operation:\n\n=\n\n="
] |
[
null
] |
{"ft_lang_label":"__label__en","ft_lang_prob":0.7842177,"math_prob":0.85236835,"size":256,"snap":"2022-05-2022-21","text_gpt3_token_len":70,"char_repetition_ratio":0.16269842,"word_repetition_ratio":0.7368421,"special_character_ratio":0.28125,"punctuation_ratio":0.14814815,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9959405,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2022-05-25T17:13:13Z\",\"WARC-Record-ID\":\"<urn:uuid:7d988a5b-d395-49f4-89ca-8e7107ba34a2>\",\"Content-Length\":\"33263\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:2c71eb91-9ae0-41df-88b8-27593be921bf>\",\"WARC-Concurrent-To\":\"<urn:uuid:3f9ee16f-c427-4f2b-bd32-d3f67e286d09>\",\"WARC-IP-Address\":\"104.21.46.178\",\"WARC-Target-URI\":\"https://fractioncalculator.pro/__10%7C4_-__6%7C9_\",\"WARC-Payload-Digest\":\"sha1:BL6HUEQVI4A26NF63N3RG6GGWYLUHHF5\",\"WARC-Block-Digest\":\"sha1:MEGEPPOT2CJWHJCBFNZ36AYUPMLCZSSP\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2022/CC-MAIN-2022-21/CC-MAIN-2022-21_segments_1652662588661.65_warc_CC-MAIN-20220525151311-20220525181311-00205.warc.gz\"}"}
|
https://metanumbers.com/42517
|
[
"## 42517\n\n42,517 (forty-two thousand five hundred seventeen) is an odd five-digits composite number following 42516 and preceding 42518. In scientific notation, it is written as 4.2517 × 104. The sum of its digits is 19. It has a total of 3 prime factors and 8 positive divisors. There are 38,400 positive integers (up to 42517) that are relatively prime to 42517.\n\n## Basic properties\n\n• Is Prime? No\n• Number parity Odd\n• Number length 5\n• Sum of Digits 19\n• Digital Root 1\n\n## Name\n\nShort name 42 thousand 517 forty-two thousand five hundred seventeen\n\n## Notation\n\nScientific notation 4.2517 × 104 42.517 × 103\n\n## Prime Factorization of 42517\n\nPrime Factorization 17 × 41 × 61\n\nComposite number\nDistinct Factors Total Factors Radical ω(n) 3 Total number of distinct prime factors Ω(n) 3 Total number of prime factors rad(n) 42517 Product of the distinct prime numbers λ(n) -1 Returns the parity of Ω(n), such that λ(n) = (-1)Ω(n) μ(n) -1 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 42,517 is 17 × 41 × 61. Since it has a total of 3 prime factors, 42,517 is a composite number.\n\n## Divisors of 42517\n\n1, 17, 41, 61, 697, 1037, 2501, 42517\n\n8 divisors\n\n Even divisors 0 8 8 0\nTotal Divisors Sum of Divisors Aliquot Sum τ(n) 8 Total number of the positive divisors of n σ(n) 46872 Sum of all the positive divisors of n s(n) 4355 Sum of the proper positive divisors of n A(n) 5859 Returns the sum of divisors (σ(n)) divided by the total number of divisors (τ(n)) G(n) 206.197 Returns the nth root of the product of n divisors H(n) 7.2567 Returns the total number of divisors (τ(n)) divided by the sum of the reciprocal of each divisors\n\nThe number 42,517 can be divided by 8 positive divisors (out of which 0 are even, and 8 are odd). The sum of these divisors (counting 42,517) is 46,872, the average is 5,859.\n\n## Other Arithmetic Functions (n = 42517)\n\n1 φ(n) n\nEuler Totient Carmichael Lambda Prime Pi φ(n) 38400 Total number of positive integers not greater than n that are coprime to n λ(n) 240 Smallest positive number such that aλ(n) ≡ 1 (mod n) for all a coprime to n π(n) ≈ 4436 Total number of primes less than or equal to n r2(n) 32 The number of ways n can be represented as the sum of 2 squares\n\nThere are 38,400 positive integers (less than 42,517) that are coprime with 42,517. And there are approximately 4,436 prime numbers less than or equal to 42,517.\n\n## Divisibility of 42517\n\n m n mod m 2 3 4 5 6 7 8 9 1 1 1 2 1 6 5 1\n\n42,517 is not divisible by any number less than or equal to 9.\n\n## Classification of 42517\n\n• Arithmetic\n• Deficient\n\n• Polite\n\n• Square Free\n\n### Other numbers\n\n• LucasCarmichael\n• Sphenic\n\n## Base conversion (42517)\n\nBase System Value\n2 Binary 1010011000010101\n3 Ternary 2011022201\n4 Quaternary 22120111\n5 Quinary 2330032\n6 Senary 524501\n8 Octal 123025\n10 Decimal 42517\n12 Duodecimal 20731\n20 Vigesimal 565h\n36 Base36 wt1\n\n## Basic calculations (n = 42517)\n\n### Multiplication\n\nn×i\n n×2 85034 127551 170068 212585\n\n### Division\n\nni\n n⁄2 21258.5 14172.3 10629.2 8503.4\n\n### Exponentiation\n\nni\n n2 1807695289 76857780602413 3267762257872793521 138935447917977562132357\n\n### Nth Root\n\ni√n\n 2√n 206.197 34.9023 14.3595 8.42777\n\n## 42517 as geometric shapes\n\n### Circle\n\n Diameter 85034 267142 5.67904e+09\n\n### Sphere\n\n Volume 3.21941e+14 2.27162e+10 267142\n\n### Square\n\nLength = n\n Perimeter 170068 1.8077e+09 60128.1\n\n### Cube\n\nLength = n\n Surface area 1.08462e+10 7.68578e+13 73641.6\n\n### Equilateral Triangle\n\nLength = n\n Perimeter 127551 7.82755e+08 36820.8\n\n### Triangular Pyramid\n\nLength = n\n Surface area 3.13102e+09 9.05778e+12 34715\n\n## Cryptographic Hash Functions\n\nmd5 ed8856951cf76b4e53c7850dcd16c2f0 a3eaa362355cf72a48246861a554e21d2c1525d8 3e3b273310d3dc06c4016832d628bdc0a14b1c6e2bd6b446c7f0b546a70d67be 168a18d209aa6a42b0ffeb11b9f00df1eb8fe8c4af41bff9a484f63ecef8ea9dcc2e4d38e7c8efdb3511406e580e3ba7b47ff4e8373a39af3bfb83397a120d80 2b054b9f8a845b5725c68589c985c15478270e67"
] |
[
null
] |
{"ft_lang_label":"__label__en","ft_lang_prob":0.6275405,"math_prob":0.9761732,"size":4562,"snap":"2020-24-2020-29","text_gpt3_token_len":1621,"char_repetition_ratio":0.11781483,"word_repetition_ratio":0.029325513,"special_character_ratio":0.45024112,"punctuation_ratio":0.07564103,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9954932,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2020-07-02T06:20:00Z\",\"WARC-Record-ID\":\"<urn:uuid:b93e8353-1006-419d-8e95-4e5837cfc456>\",\"Content-Length\":\"48287\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:84fa57ae-20f8-408a-9e1b-683a27daa437>\",\"WARC-Concurrent-To\":\"<urn:uuid:9ffe4f3e-fbac-4903-891c-bf93f66a766b>\",\"WARC-IP-Address\":\"46.105.53.190\",\"WARC-Target-URI\":\"https://metanumbers.com/42517\",\"WARC-Payload-Digest\":\"sha1:JAV3CYZQHF44ZTIVEVV4SLHYY2LDDLYS\",\"WARC-Block-Digest\":\"sha1:MZXT2L6TU7QZBHOPZKTGCSO4S4MNKSVJ\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2020/CC-MAIN-2020-29/CC-MAIN-2020-29_segments_1593655878519.27_warc_CC-MAIN-20200702045758-20200702075758-00046.warc.gz\"}"}
|
https://www.mathworks.com/help/matlab/low-level-functions-for-fits-files.html
|
[
"Documentation\n\n# Low-Level Functions\n\nInteract directly with CFITSIO library functions\n\nTo use these functions, you should be familiar with the CFITSIO C API. In most cases, the syntax of the MATLAB® function is similar to the syntax of the corresponding CFITSIO library functions. The functions are implemented as the package `matlab.io.fits`. To use this package, prefix the function name with a package path, or use the import function to add the package to the current import list, prior to calling the function, for example,\n\n```import matlab.io.*; fptr = fits.openFile('tst0012.fits'); ```"
] |
[
null
] |
{"ft_lang_label":"__label__en","ft_lang_prob":0.67946064,"math_prob":0.6756258,"size":498,"snap":"2019-35-2019-39","text_gpt3_token_len":113,"char_repetition_ratio":0.17611337,"word_repetition_ratio":0.0,"special_character_ratio":0.21686748,"punctuation_ratio":0.1764706,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9781119,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2019-09-22T14:17:14Z\",\"WARC-Record-ID\":\"<urn:uuid:a50d024d-445c-45b9-b17e-f72e103f2f55>\",\"Content-Length\":\"61879\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:cc5fc3ea-bc9b-4b65-83a1-95874a0330bb>\",\"WARC-Concurrent-To\":\"<urn:uuid:c1830852-ef48-407e-81cc-2f29ae8dd2b7>\",\"WARC-IP-Address\":\"23.2.40.141\",\"WARC-Target-URI\":\"https://www.mathworks.com/help/matlab/low-level-functions-for-fits-files.html\",\"WARC-Payload-Digest\":\"sha1:B3WLQRYNA25KLOJBMMBXOTBPN3DZTXQV\",\"WARC-Block-Digest\":\"sha1:SKM26HPFSOEVWR7T2WWCEXGBD3W5YRQP\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2019/CC-MAIN-2019-39/CC-MAIN-2019-39_segments_1568514575515.93_warc_CC-MAIN-20190922135356-20190922161356-00536.warc.gz\"}"}
|
http://computerchess.org.uk/ccrl/404/cgi/engine_details.cgi?print=Details&each_game=1&eng=FoxSEE%205.0.1%2064-bit
|
[
"Contents: CCRL Blitz Downloads and Statistics September 19, 2020 Testing summary: Total: 2'370'030 games played by 2'800 programs White wins: 913'140 (38.5%) Black wins: 734'658 (31.0%) Draws: 722'232 (30.5%) White score: 53.8%\n\n## Engine Details\n\n Options Show each game results\nFoxSEE 5.0.1 64-bit#295‑296 (2322+22\n−22\n)Quote\n Author: Zixiao Han (China) Link: Homepage\nThis is one of the 9 FoxSEE versions we tested: Compare them!\n Opponent Elo Diff Results Score LOS Perf – Tytan 9.32 32-bit 2353 +46−46 (+31) 10.5 − 21.5(+6−17=9) 32.8%10.5 / 32 11.2% −90 1 0 = 0 = = = 0 0 1 = 0 1 0 = 0 0 = 0 = 0 0 0 0 0 0 = 1 0 1 0 1 – Alex 2.14a 64-bit 2347 +10−10 (+25) 13.5 − 18.5(+10−15=7) 42.2%13.5 / 32 1.9% −30 0 1 0 0 0 = = 0 0 1 1 1 = 0 1 1 0 = 0 0 1 0 1 0 = 0 1 = 1 0 0 = – Popochin 4.1 64-bit 2346 +17−17 (+24) 16 − 16(+11−11=10) 50.0%16.0 / 32 4.2% +24 = 1 1 = 1 0 1 = 0 = = 0 = 0 1 0 = = = 0 0 = 1 0 1 1 1 0 1 0 0 1 – Absolute Zero 3.3.2.0 64-bit 2346 +19−19 (+24) 14.5 − 17.5(+10−13=9) 45.3%14.5 / 32 5.0% −8 1 1 = 0 1 = = 0 1 0 1 0 = 0 1 0 0 1 1 0 0 0 0 0 = = 1 = 0 1 = = – Tigran 2.4n 64-bit 2344 +10−11 (+22) 16 − 16(+12−12=8) 50.0%16.0 / 32 3.4% +18 = 0 1 1 = = 0 0 0 0 0 0 1 0 0 1 = 1 1 0 1 1 1 1 = 0 = = 1 0 = 1 – Plisk 0.2.7d 64-bit 2343 +10−10 (+21) 10.5 − 21.5(+4−15=13) 32.8%10.5 / 32 4.1% −86 1 0 0 = 0 0 1 0 0 = = = = = = 0 0 = 1 0 = 0 = 0 1 0 = = 0 0 0 = – Horizon 4.4 2342 +8−8 (+20) 16.5 − 15.5(+13−12=7) 51.6%16.5 / 32 4.0% +27 1 0 = 0 1 0 1 0 = 1 1 1 1 1 = 0 = 0 1 = 0 1 0 1 = 0 0 0 0 1 = 1 – Halogen 5 64-bit 2342 +20−20 (+20) 15.5 − 16.5(+11−12=9) 48.4%15.5 / 32 9.0% +7 1 1 = = 1 1 0 0 = 1 1 1 0 0 0 0 = = 1 0 = 0 0 0 = 0 1 = 1 0 = 1 – Queen 4.03 2336 +8−8 (+14) 12.5 − 19.5(+8−15=9) 39.1%12.5 / 32 12.0% −61 1 = = 0 = 0 1 0 0 = 0 0 1 1 0 0 = 0 0 = 0 1 = = 0 0 0 0 1 1 1 = – Arion 1.7 2333 +7−7 (+11) 16.5 − 15.5(+12−11=9) 51.6%16.5 / 32 17.2% +27 1 0 1 1 1 = 1 = 0 = 1 = 0 = 0 = = 1 0 = 1 1 1 1 0 0 0 = 0 0 0 1 – Ceibo 0.5 64-bit 2330 +17−17 (+8) 15.5 − 16.5(+13−14=5) 48.4%15.5 / 32 28.4% −4 = 0 1 1 = 1 0 1 0 1 1 1 1 = 1 1 0 = 0 0 1 1 0 0 1 0 0 0 = 0 0 0 – Sage 3.53 2325 +8−8 (+3) 15.5 − 16.5(+13−14=5) 48.4%15.5 / 32 40.1% −11 1 0 0 0 1 1 1 1 0 1 1 0 = 1 0 0 0 0 = 1 0 1 0 = 0 0 = 1 1 0 = 1 – Gibbon 2.69a 64-bit 2322 +13−13 (0) 16.5 − 15.5(+14−13=5) 51.6%16.5 / 32 50.9% +14 1 = 0 = 1 1 0 1 0 0 1 1 1 0 1 0 = 1 1 = 1 1 0 0 1 0 0 0 0 0 1 = – Chezzz 1.0.3 2322 +8−8 (0) 16 − 16(+14−14=4) 50.0%16.0 / 32 50.2% 0 0 0 1 = 1 = 1 0 0 1 1 1 0 1 0 0 = 1 1 0 1 0 0 1 = 0 1 1 0 0 1 0 – Mediocre 0.5 64-bit 2320 +11−11 (−2) 16 − 16(+12−12=8) 50.0%16.0 / 32 56.9% −5 1 0 1 0 0 0 1 = = 0 = 0 1 1 1 1 = 0 1 0 = 1 0 1 0 1 = 0 = 1 0 = – Asterisk 0.6b 2317 +38−38 (−5) 19.5 − 12.5(+17−10=5) 60.9%19.5 / 32 58.9% +82 0 = 0 1 0 = 1 1 0 1 1 1 0 1 = 1 1 1 1 1 0 1 0 1 1 = 0 = 0 1 1 0 – Aice 0.99.2 2316 +8−8 (−6) 16 − 16(+13−13=6) 50.0%16.0 / 32 68.9% −4 1 = = 1 1 1 1 = 0 0 0 0 1 0 1 0 0 = 1 0 1 = = 0 0 1 0 1 1 1 0 0 – Gromit 2.13 2314 +61−62 (−8) 14.5 − 16.5(+10−12=9) 46.8%14.5 / 31 59.4% −29 1 1 = 0 = 0 = 0 0 1 0 0 0 = = 1 1 1 = 1 0 0 0 1 0 1 = = 1 = 0 – Sungorus 1.4 64-bit 2311 +9−9 (−11) 18.5 − 13.5(+16−11=5) 57.8%18.5 / 32 81.7% +48 0 1 1 1 0 = 0 = 0 0 0 1 0 0 = 1 1 0 1 1 1 1 1 1 1 0 = 1 = 1 1 0 – Joker 1.1.14 2302 +12−12 (−20) 17.5 − 14.5(+15−12=5) 54.7%17.5 / 32 94.4% +16 1 0 1 1 1 0 1 = 0 1 0 0 1 1 1 0 0 0 0 1 1 1 0 = 1 0 1 = = 0 = 1 – Kingfisher 1.1.1 64-bit 2301 +18−18 (−21) 17 − 15(+9−7=16) 53.1%17.0 / 32 93.5% −2 0 = 1 1 0 = = = = 0 = = = 0 1 = 0 1 1 1 1 = = 0 = 1 1 = = = = 0 – Ayito 0.2.994 2287 +10−10 (−35) 13 − 16(+11−14=4) 44.8%13.0 / 29 99.8% −76 0 = 1 1 = 0 1 1 0 1 1 0 0 1 = 1 = 1 0 1 0 1 0 0 0 0 0 0 0 – Matilde 2008 64-bit 2282 +13−13 (−40) 23 − 9(+20−6=6) 71.9%23.0 / 32 99.9% +128 0 1 0 = 1 1 1 = 1 1 0 1 = 1 1 1 = 1 1 1 1 = 1 0 1 0 1 1 0 1 1 = – Fischerle 0.9.80 SE 64-bit 2281 +15−15 (−41) 19.5 − 12.5(+16−9=7) 60.9%19.5 / 32 99.9% +39 1 1 1 0 1 0 0 = 1 1 1 = 1 = 1 = 0 = = 0 1 0 1 1 1 1 1 0 1 0 = 0\n\n### Rating changes by day",
null,
"### Rating changes with played games",
null,
"Created in 2005-2013 by CCRL team Last games added on September 19, 2020"
] |
[
null,
"http://computerchess.org.uk/ccrl/404/rating-history-by-day-graphs/FoxSEE_5_0_1_64-bit.png",
null,
"http://computerchess.org.uk/ccrl/404/rating-history-by-day-graphs-2/FoxSEE_5_0_1_64-bit.png",
null
] |
{"ft_lang_label":"__label__en","ft_lang_prob":0.5862373,"math_prob":1.0000056,"size":3736,"snap":"2020-34-2020-40","text_gpt3_token_len":2752,"char_repetition_ratio":0.39523044,"word_repetition_ratio":0.5163728,"special_character_ratio":0.9362955,"punctuation_ratio":0.105882354,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9974423,"pos_list":[0,1,2,3,4],"im_url_duplicate_count":[null,1,null,1,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2020-09-23T06:57:12Z\",\"WARC-Record-ID\":\"<urn:uuid:feb68b13-94ce-4f76-be91-f4652c7a05ca>\",\"Content-Length\":\"30367\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:53b1b155-8a0d-4fdc-b515-7ca2591a3a36>\",\"WARC-Concurrent-To\":\"<urn:uuid:5ba03d49-6882-4d58-bbb8-d2f1537bb615>\",\"WARC-IP-Address\":\"185.45.66.155\",\"WARC-Target-URI\":\"http://computerchess.org.uk/ccrl/404/cgi/engine_details.cgi?print=Details&each_game=1&eng=FoxSEE%205.0.1%2064-bit\",\"WARC-Payload-Digest\":\"sha1:GC66PBQWBAOU63YZ6ZATH5ENVSMNJKAH\",\"WARC-Block-Digest\":\"sha1:4PUDVSD4OKXGL6GO7CPCTPGMTYNHKWYB\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2020/CC-MAIN-2020-40/CC-MAIN-2020-40_segments_1600400209999.57_warc_CC-MAIN-20200923050545-20200923080545-00175.warc.gz\"}"}
|
https://www.tutorialspoint.com/creating-a-simple-calculator-using-html-css-and-javascript
|
[
"# Creating a Simple Calculator using HTML, CSS, and JavaScript\n\nA Student grade calculator is used for taking the grades input for all subjects and then calculating the percentage based upon the marks of the students. This calculator returns a fairly reliable indicator of student results.\n\nThe simple formula for calculating grades is:\n\n$\\text{Percentage}=\\frac{\\text{Marks Scored}}{\\text{Total Marks}}\\times 100$\n\nWe are going to take the inputs using HTML, once the inputs are entered we will call the JS function to calculate the average percentage of these numbers and will return the same to the user.\n\nSteps for creating a calculator −\n\n• We will be taking inputs from the user using the input tag.\n\n• Once the inputs are taken, we will pass these inputs to the calculate function in JS.\n\n• The calculate function will basically aggregate the result for this and return the result\n\n• On getting the result, the HTML will display the result to the user.\n\n## Example\n\nIn the below example, we are creating a simple grade calculator that will take grades inputs and find the aggregated grade percentage for each student.\n\nindex.html\n\n<!DOCTYPE html>\n<html>\n<body>\n<!-- main html -->\n<h1 style=\"color: green\">\nWelcome To Tutorials Point\n</h1>\n<div class=\"container\">\n<div class=\"screen-body-item\">\n<div class=\"app\">\n<div class=\"form-group\">\n<!-- option for taking the input -->\nEnter Student's marks in Chemistry:\n<input\ntype=\"text\"\nclass=\"form-control\"\nplaceholder=\"CHEMISTRY\"\nid=\"chemistry\" />\n</div>\n<div class=\"form-group\">\nEnter Student's marks in Maths:\n<input\ntype=\"text\"\nclass=\"form-control\"\nplaceholder=\"MATHS\"\nid=\"maths\" />\n</div>\n<div class=\"form-group\">\nEnter Student's marks in Physics:\n<input\ntype=\"text\"\nclass=\"form-control\"\nplaceholder=\"PHYSICS\"\nid=\"phy\" />\n</div>\n<div>\n<input\ntype=\"button\"\nvalue=\"show Percentage\"\nclass=\"form-button\"\nonclick=\"calculate()\" />\n</div>\n</div>\n</div>\n<!-- for showing the result-->\n<div class=\"form-group showdata\">\n<p id=\"showdata\"></p>\n</div>\n</div>\n<script src=\"script.js\"></script>\n</body>\n</html>\n\nstyles.css\n\n.container {\nflex: 0 1 700px;\nmargin: auto;\n}\n.screen-body-item {\nflex: 1;\n}\ninput {\nm argin: 10px 10px 10px;\n}\n.showdata {\ncolor: black;\nfont-size: 1.2rem;\n}\n#form-group {\n}\n\nscript.js\n\n// Function for calculating grades\nconst calculate = () => {\n// Getting input from user into height variable.\nlet chemistry = document.querySelector(\"#chemistry\").value;\nlet maths = document.querySelector(\"#maths\").value;\nlet phy = document.querySelector(\"#phy\").value;\n\n// Input is string so typecasting is necessary. */\nparseFloat(chemistry) +\nparseFloat(maths) +\nparseFloat(phy);\n\n// Checking the condition for the providing the\n// grade to student based on percentage\nlet percentage = (totalgrades / 300) * 100;\nif (percentage <= 100 && percentage >= 80) {\n} else if (percentage <= 79 && percentage >= 60) {\n} else if (percentage <= 59 && percentage >= 40) {\n} else {\n}\n// Checking the values are empty if empty than\nif (chemistry == \"\"|| maths == \"\" || phy == \"\") { document.querySelector(\"#showdata\").innerHTML = \"Please enter all the fields\";\n} else {\n// Checking the condition for the fail and pass\nif (percentage >= 39.5) {\ndocument.querySelector(\n\"#showdata\"\n).innerHTML =\nOut of 300 your total is ${totalgrades} and percentage is${percentage}%. <br>\nYour grade is ${grades}. You are Pass. ; } else { document.querySelector( \"#showdata\" ).innerHTML = Out of 300 your total is${totalgrades}\nand percentage is ${percentage}%. <br> Your grade is${grades}. You are Fail. ;\n}\n}\n};\n\n## Output",
null,
"On entering the marks and clicking on “show percentage” −",
null,
"We have merged the HTML, CSS, and JS to help you check the output of this program here itself.\n\nClick the following link to see a Live Demo of this program:"
] |
[
null,
"https://www.tutorialspoint.com/assets/questions/media/64423/wtp.jpg",
null,
"https://www.tutorialspoint.com/assets/questions/media/64423/grade_c.jpg",
null
] |
{"ft_lang_label":"__label__en","ft_lang_prob":0.56667864,"math_prob":0.90515924,"size":5638,"snap":"2022-40-2023-06","text_gpt3_token_len":1377,"char_repetition_ratio":0.13968761,"word_repetition_ratio":0.07364787,"special_character_ratio":0.27829018,"punctuation_ratio":0.1221865,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9974682,"pos_list":[0,1,2,3,4],"im_url_duplicate_count":[null,1,null,1,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2023-02-05T23:56:44Z\",\"WARC-Record-ID\":\"<urn:uuid:d4d3ccdf-5de2-4670-9e36-85941d65305e>\",\"Content-Length\":\"48803\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:8348d695-631e-4405-810b-4057174d181b>\",\"WARC-Concurrent-To\":\"<urn:uuid:5dad1b77-cda6-4b70-b966-6da184ca17fe>\",\"WARC-IP-Address\":\"192.229.210.176\",\"WARC-Target-URI\":\"https://www.tutorialspoint.com/creating-a-simple-calculator-using-html-css-and-javascript\",\"WARC-Payload-Digest\":\"sha1:5E54WTUAYQTGWIQIPPPSUPBKPRQPAKGQ\",\"WARC-Block-Digest\":\"sha1:XXYN3DS32ZZE6IQ7YJ3UPGB54NYG4DUU\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2023/CC-MAIN-2023-06/CC-MAIN-2023-06_segments_1674764500294.64_warc_CC-MAIN-20230205224620-20230206014620-00816.warc.gz\"}"}
|
https://www.tutorialspoint.com/gwt_highcharts/gwt_highcharts_column_stacked_grouped.htm
|
[
"# Stacked and Grouped Column Chart\n\nFollowing is an example of a stacked and grouped Column Chart.\n\nWe have already seen the configuration used to draw a chart in Highcharts Configuration Syntax chapter. Let us now see additional configurations and also how we have added stacking attribute in plotoptions.\n\nAn example of a stacked and grouped Column Chart is given below.\n\n## plotOptions\n\nThe plotOptions is a wrapper object for configurations objects for each series type. The configuration objects for each series can also be overridden for each series item as given in the series array. This is to stack the values of each series on top of each other. This is to stack the values of each series on top of each other.\n\nConfigure the stacking of the chart using plotOptions.column.stacking as \"normal\". Possible values are null which disables stacking, \"normal\" stacks by value and \"percent\" stacks the chart by percentages.\n\n```chart.setColumnPlotOptions(new ColumnPlotOptions()\n.setStacking(Stacking.NORMAL)\n);\n```\n\n## series\n\nConfigure the stack of each series to identity the group of the series.\n\n```chart.addSeries(chart.createSeries()\n.setName(\"John\")\n.setPoints(new Number[] {5, 3, 4, 7, 2})\n.setStack(\"male\")\n);\n```\n\n## Example\n\nHelloWorld.java\n\n```package com.tutorialspoint.client;\n\nimport org.moxieapps.gwt.highcharts.client.Chart;\nimport org.moxieapps.gwt.highcharts.client.Series.Type;\nimport org.moxieapps.gwt.highcharts.client.plotOptions.ColumnPlotOptions;\nimport org.moxieapps.gwt.highcharts.client.plotOptions.PlotOptions.Stacking;\n\npublic class HelloWorld implements EntryPoint {\npublic void onModuleLoad() {\nfinal Chart chart = new Chart()\n.setType(Type.COLUMN)\n.setChartTitleText(\"Total fruit consumption, grouped by gender\")\n.setColumnPlotOptions(new ColumnPlotOptions()\n.setStacking(Stacking.NORMAL)\n);\n\nchart.getXAxis()\n.setCategories(\"Apples\", \"Oranges\", \"Pears\", \"Grapes\", \"Bananas\");\n\nchart.getYAxis()\n.setAllowDecimals(false)\n.setMin(0)\n.setAxisTitleText(\"Number of fruits\");\n\n.setName(\"John\")\n.setPoints(new Number[] {5, 3, 4, 7, 2})\n.setStack(\"male\")\n);\n.setName(\"Joe\")\n.setPoints(new Number[] {3, 4, 4, 2, 5})\n.setStack(\"male\")\n);\n.setName(\"Jane\")\n.setPoints(new Number[] {2, 2, 3, 2, 1})\n.setStack(\"female\")\n);\n.setName(\"Janet\")\n.setPoints(new Number[] {3, 0, 4, 4, 3})\n.setStack(\"female\")\n);",
null,
""
] |
[
null,
"https://www.tutorialspoint.com/gwt_highcharts/images/gwt_highcharts_column_stacked_grouped.jpg",
null
] |
{"ft_lang_label":"__label__en","ft_lang_prob":0.5645816,"math_prob":0.699241,"size":2514,"snap":"2019-35-2019-39","text_gpt3_token_len":617,"char_repetition_ratio":0.15338646,"word_repetition_ratio":0.14705883,"special_character_ratio":0.23428799,"punctuation_ratio":0.27959183,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9789589,"pos_list":[0,1,2],"im_url_duplicate_count":[null,2,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2019-09-17T16:25:06Z\",\"WARC-Record-ID\":\"<urn:uuid:a76ce710-4142-46f6-a252-88b3e487b418>\",\"Content-Length\":\"21632\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:6b5b8667-0c6f-4840-9720-54b11697e014>\",\"WARC-Concurrent-To\":\"<urn:uuid:b205a79c-32d2-4b06-8c8b-a7c5a69e212f>\",\"WARC-IP-Address\":\"72.21.91.42\",\"WARC-Target-URI\":\"https://www.tutorialspoint.com/gwt_highcharts/gwt_highcharts_column_stacked_grouped.htm\",\"WARC-Payload-Digest\":\"sha1:ZCPXULKQCBH2X2LSOUM7JIJQNZM3URB7\",\"WARC-Block-Digest\":\"sha1:JP7Y4MURA4UJO7E5GJ6IA4Z64CA6WJAF\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2019/CC-MAIN-2019-39/CC-MAIN-2019-39_segments_1568514573098.0_warc_CC-MAIN-20190917161045-20190917183045-00266.warc.gz\"}"}
|
https://www.studytonight.com/java-examples/how-to-convert-array-to-set-in-java
|
[
"Dark Mode On/Off\n\n# How to Convert Array to Set in Java\n\nIn this post, we are going to convert an array to set by using Java co de. An Array is an index based data structure that is used to store similar types of data while the set is a collection of unique elements.\n\nHere, we have several examples to convert an array to set, always remember that set contains unique elements only so duplicate elements of the array will not add to the set during conversion.\n\nHere, we used `addAll()`, `asList()` and `toSet()` methods to get set from array elements. The `addAll()` method is a `Collections` class method that adds array elements to the specified collection(list, set, etc)\n\n## Time for an Example\n\nLet's take an example to convert an array to Set. Here, we used addAll() method to add elements into the set. This is pretty easy to get set from an array.\n\n``````import java.util.Collections;\nimport java.util.HashSet;\nimport java.util.Set;\npublic class Main {\npublic static void main(String[] args){\nString[] fruits = {\"Apple\", \"Orange\", \"Banana\",\"Orange\"};\nfor (int i = 0; i < fruits.length; i++) {\nSystem.out.println(fruits[i]);\n}\nSet<String> fruitsSet = new HashSet<>();\nSystem.out.println(fruitsSet);\n}\n}``````\n\nApple\nOrange\nBanana\nOrange\n[Apple, Orange, Banana]\n\n## Example:\n\nWe can use `asList()` method to get convert array to set. The asList() method returns a list of the array that further is converted by the constructor to a set. See the below example.\n\n``````import java.util.Arrays;\nimport java.util.HashSet;\nimport java.util.Set;\npublic class Main {\npublic static void main(String[] args){\nString[] fruits = {\"Apple\", \"Orange\", \"Banana\",\"Orange\"};\nfor (int i = 0; i < fruits.length; i++) {\nSystem.out.println(fruits[i]);\n}\nSet<String> fruitsSet = new HashSet<>(Arrays.asList(fruits));\nSystem.out.println(fruitsSet);\n}\n}``````\n\nApple\nOrange\nBanana\nOrange\n[Apple, Orange, Banana]\n\n## Example: Java 8\n\nLet's create another example to get set from array elements. Here, we are using the `toSet()` method of Collectors class that returns set from the stream elements. This example is useful if you want to use the stream to get set elements.\n\n``````import java.util.Arrays;\nimport java.util.HashSet;\nimport java.util.Set;\nimport java.util.stream.Collectors;\npublic class Main {\npublic static void main(String[] args){\nString[] fruits = {\"Apple\", \"Orange\", \"Banana\",\"Orange\"};\nfor (int i = 0; i < fruits.length; i++) {\nSystem.out.println(fruits[i]);\n}\nSet<String> fruitsSet = new HashSet<>();\nfruitsSet = Arrays.stream(fruits).collect(Collectors.toSet());\nSystem.out.println(fruitsSet);\n}\n}``````\n\nApple\nOrange\nBanana\nOrange\n[Apple, Orange, Banana]"
] |
[
null
] |
{"ft_lang_label":"__label__en","ft_lang_prob":0.57849896,"math_prob":0.7645462,"size":2604,"snap":"2022-40-2023-06","text_gpt3_token_len":619,"char_repetition_ratio":0.13846155,"word_repetition_ratio":0.3227513,"special_character_ratio":0.2530722,"punctuation_ratio":0.20943396,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.958657,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2023-02-01T00:15:55Z\",\"WARC-Record-ID\":\"<urn:uuid:3fc61d17-4a1d-40e9-8cc4-375fc5384bf2>\",\"Content-Length\":\"257679\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:45e66651-871f-494a-8b72-923026851dfc>\",\"WARC-Concurrent-To\":\"<urn:uuid:228d4c3e-be7d-449b-ac69-8b3c72fdd3f9>\",\"WARC-IP-Address\":\"65.2.112.116\",\"WARC-Target-URI\":\"https://www.studytonight.com/java-examples/how-to-convert-array-to-set-in-java\",\"WARC-Payload-Digest\":\"sha1:SOYTOUWATUX7FWEARPQ422OY7PL5BGQP\",\"WARC-Block-Digest\":\"sha1:OHV44JT42CNNN46IX5LITNGSKZWMQIKF\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2023/CC-MAIN-2023-06/CC-MAIN-2023-06_segments_1674764499891.42_warc_CC-MAIN-20230131222253-20230201012253-00180.warc.gz\"}"}
|
https://physics.stackexchange.com/questions/410611/why-lagrangian-is-unchanged-under-rotation-and-translation
|
[
"# Why Lagrangian is unchanged under rotation and translation?\n\nIn Landau Mechanics, he derived the conservation of momentum assuming that $\\delta L = 0$ under infinitesimal translation $\\epsilon$. However, one just need the change of Lagrangian to be a total derivative of time to preserve the EoM. Is there any other assumption leading to $\\delta L = 0$ ?\n\nA parallel displacement is a transformation in which every particle in the system is moved by the same amount, the radius vector $\\:\\mathbf{r}\\:$ becoming $\\:\\mathbf{r}\\!+\\!\\boldsymbol{\\epsilon}$. The change in $\\:L\\:$ resulting from an infinitesimal change in the co-ordinates, the velocities of the particles remaining fixed, is \\begin{equation} \\delta L=\\sum\\limits_{a}\\dfrac{\\partial L \\hphantom{_{a}}}{\\partial\\mathbf{r}_{a}}\\boldsymbol{\\cdot}\\delta\\mathbf{r}_{a}=\\boldsymbol{\\epsilon}\\boldsymbol{\\cdot}\\sum\\limits_{a}\\dfrac{\\partial L \\hphantom{_{a}}}{\\partial\\mathbf{r}_{a}}, \\nonumber \\end{equation} where the summation is over the particles in the system. Since $\\:\\boldsymbol{\\epsilon}\\:$ is arbitrary, the condition $\\:\\delta L=0\\:$ is equivalent to \\begin{equation} \\sum\\limits_{a}\\partial L/ \\partial\\mathbf{r}_{a}=0. \\tag{7.1} \\end{equation} From Lagrange's equations (5.2) we therefore have \\begin{equation} \\sum\\limits_{a}\\dfrac{\\mathrm d \\hphantom{t}}{\\mathrm d t}\\dfrac{\\partial L \\hphantom{_{a}}}{\\partial\\mathbf{v}_{a}}=\\dfrac{\\mathrm d \\hphantom{t}}{\\mathrm d t}\\sum\\limits_{a}\\dfrac{\\partial L \\hphantom{_{a}}}{\\partial\\mathbf{v}_{a}}=0. \\nonumber \\end{equation} Thus we conclude that, in a closed mechanical system, the vector \\begin{equation} \\mathbf{P}=\\sum\\limits_{a}\\partial L/ \\partial\\mathbf{v}_{a} \\tag{7.2} \\end{equation} remains constant during the motion; it is called the momentum of the system.\nDifferentiating the Lagrangian (5.1), we find that the momentum is given in terms of the velocities of the particles by \\begin{equation} \\mathbf{P}=\\sum\\limits_{a} m_{a}\\mathbf{v}_{a}. \\tag{7.3} \\end{equation}\n\n• The condition $\\delta L=0$ under translation is the assumption. Using this assumption, Landau derives that momentum is conserved, so if the Lagrangian is translation-invariant, that implies conservation of momentum. – probably_someone Jun 7 '18 at 18:47\n• Ideally, each conservation law should be independent of the others. Can you think of a counter example of an L that cannot be expressed as a total derivative yet exhibits some conserved quantities? The procedure of looking for invariance upon introducing an infinitesimal change in something is the procedure for finding conserved quantities. – ggcg Jun 7 '18 at 19:51\n\nThere are different types of symmetries we might search for in a Lagrangian theory. When setting out to prove identities, we assume that the theory is invariant under the change we are making. With this assumption, we then look at what the implications are for conservation laws. In this case, Landau assumes $L$ is invariant under translations. When this is true, linear momentum is conserved.\nNoether's theorem searches for those symmetries that arise from a continuous global transformation of a coordinate. These symmetries have a general proof that relies on the fact that a perturbation in coordinate $q^k$ leaves the conjugate momentum unchanged: $$\\frac{d}{dt}\\bigg(\\frac{\\partial L}{\\partial \\dot q^k}\\bigg) = 0$$ Symmetries of this kind lead to the conservation of {angular} momentum under a translation {rotation} or perhaps conservation of $h(q,\\dot q)$ under time translations, where: $$h(q,\\dot q) = \\frac{\\partial L}{\\partial \\dot q^k} \\dot q^k - L$$\nAmongst other things, this leads us to gauge symmetries. Two Lagrangians that differ by a total time derivative: $$L' = L + \\frac{d}{dt}f$$ lead to the same equations of motion due to only surface terms in the action (boundary point terms)."
] |
[
null
] |
{"ft_lang_label":"__label__en","ft_lang_prob":0.68458503,"math_prob":0.9994062,"size":1934,"snap":"2021-04-2021-17","text_gpt3_token_len":597,"char_repetition_ratio":0.16373058,"word_repetition_ratio":0.009708738,"special_character_ratio":0.28283352,"punctuation_ratio":0.1,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9999865,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2021-01-21T21:32:49Z\",\"WARC-Record-ID\":\"<urn:uuid:58960fa4-2934-4537-8fb0-6d0340e889ed>\",\"Content-Length\":\"149440\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:9eb9db2b-d1c3-4709-9ed4-97bc1ddf6772>\",\"WARC-Concurrent-To\":\"<urn:uuid:9b328d92-39fb-43c7-b9e9-f18458076591>\",\"WARC-IP-Address\":\"151.101.1.69\",\"WARC-Target-URI\":\"https://physics.stackexchange.com/questions/410611/why-lagrangian-is-unchanged-under-rotation-and-translation\",\"WARC-Payload-Digest\":\"sha1:MBYLMZ7OS44FOQW2YD3M4NFLQNDTMSH4\",\"WARC-Block-Digest\":\"sha1:MKPI4Q6QBLH6PNDKUNITB7C3K4SXC2BX\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2021/CC-MAIN-2021-04/CC-MAIN-2021-04_segments_1610703527850.55_warc_CC-MAIN-20210121194330-20210121224330-00044.warc.gz\"}"}
|
https://mathematica.stackexchange.com/questions/116238/ito-process-with-random-initial-position
|
[
"# ITO Process with random initial position\n\nI am trying to define an ITO process with random initial state but its only drawing once an uses it for all paths. Here is the code:\n\nproc[\\[Mu]_, \\[Sigma]_] :=\nItoProcess[\\[DifferentialD]x[\nt] == \\[Mu] \\[DifferentialD]t + \\[Sigma] \\[DifferentialD]w[t],\nx[t], {x, RandomVariate[NormalDistribution[0, 2]]}, t,\nw \\[Distributed] WienerProcess[]]\n\n\nAny suggestions how to make this work? Thank you in advance.\n\ne\n\n• I'll ponder this, my initial impression is no, since the process is evaluated before the ensemble is generated. Would simply generating a table of the random functions and then getting paths/etc. from those be a problem? – ciao May 30 '16 at 5:10\n• Yes but I was hoping there would be a trick ... – Edv Beq May 30 '16 at 5:18\n• See my (writing now) answer... – ciao May 30 '16 at 5:24\n\nI don't believe this is directly possible - the process is evaluated before the random paths are generated. I'll ponder further, but if you want the same effect, try something like this:\n\nensemble1 = TemporalData[Table[RandomFunction[proc[1, 1], {0, 1}], 10]];\n\n\nThis will give you the same structure as\n\nensemble2 = RandomFunction[proc[1, 1], {0, 1},10]\n\n\nthat is, both examples give an ensemble of 10, but the former will give you the random starting positions:\n\nRow[ListLinePlot[#, ImageSize -> 300] & /@ {ensemble1, ensemble2}]",
null,
"• Great. If you think of better solution I would be very interested to see it. Thank you. – Edv Beq May 30 '16 at 5:34"
] |
[
null,
"https://i.stack.imgur.com/LCRJU.png",
null
] |
{"ft_lang_label":"__label__en","ft_lang_prob":0.7113187,"math_prob":0.9375575,"size":404,"snap":"2019-51-2020-05","text_gpt3_token_len":127,"char_repetition_ratio":0.1275,"word_repetition_ratio":0.0,"special_character_ratio":0.29455444,"punctuation_ratio":0.15384616,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9619801,"pos_list":[0,1,2],"im_url_duplicate_count":[null,2,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2020-01-26T03:25:13Z\",\"WARC-Record-ID\":\"<urn:uuid:3942bf40-78bc-4614-9714-2712013a7ac5>\",\"Content-Length\":\"136645\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:4437b544-93d8-4521-b67c-14550966875a>\",\"WARC-Concurrent-To\":\"<urn:uuid:90eb71e6-d0fd-40a7-bf78-05bdf435dbc1>\",\"WARC-IP-Address\":\"151.101.129.69\",\"WARC-Target-URI\":\"https://mathematica.stackexchange.com/questions/116238/ito-process-with-random-initial-position\",\"WARC-Payload-Digest\":\"sha1:2J3E73HK6J7UK43TUHQLMFUIZYJJO5KQ\",\"WARC-Block-Digest\":\"sha1:DPZV2TJL64SMOKMXHUBIT2UAVYACGZB2\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2020/CC-MAIN-2020-05/CC-MAIN-2020-05_segments_1579251684146.65_warc_CC-MAIN-20200126013015-20200126043015-00413.warc.gz\"}"}
|
https://docs.teradata.com/reader/756LNiPSFdY~4JcCCcR5Cw/l~UwRfOH3B2wgGbSwCV7uQ
|
[
"# 16.20 - Result - Teradata Vantage NewSQL Engine\n\n## Teradata Vantage™ SQL Functions, Expressions, and Predicates\n\nprodname\nvrm_release\n16.20\ncategory\nProgramming Reference\nfeatnum\nB035-1145-162K\nIf IN is used with a list of literals, the result is true if the value of expression_1 is:\n• equal to any literal in the list,\n• between signed_literal_1 and signed_literal_2, inclusively, when signed_literal_1 is less than or equal to signed_literal_2, or\n• between signed_literal_2 and signed_literal_1, inclusively, when signed_literal_2 is less than signed_literal_1\n\nIf the value of expression_1 is null, then the result is considered to be unknown.\n\nIf the value of expression_1 is not null, and none of the conditions are satisfied for the result to be true, then the result is false.\n\nUsing this form, the IN search condition is satisfied if the expression is equal to any of the values in the list of literals; the NOT IN condition is satisfied if none of the values in the list of literals are equal to the expression.\n\nTHE condition is true for this form … WHEN …\nexpression_1 IN expression_2 expression_1 = expression_2\nexpression_1 NOT IN expression_2 expression_1 <> expression_2\nexpression_1 IN (const_1, const_2) (expression_1 = const_1) OR (expression_1 = const_2)\nexpression_1 NOT IN (const_1, const_2) (expression_1 <> const_1) AND (expression_1 <> const_2)\nexpression_1 IN (signed_const_1 TO signed_const_2)\n\nwhere signed_const_1 <= signed_const_2\n\n(signed_const_1 <= expression_1) AND (expression_1 <= signed_const_2)\nexpression_1 IN (signed_const_1 TO signed_const_2)\n\nwhere signed_const_2 < signed_const_1\n\n(signed_const_2 <= expression_1) AND (expression_1 <= signed_const_1)\nexpression_1 NOT IN (signed_const_1 TO signed_const_2)\n\nwhere signed_const_1 <= signed_const_2\n\n(expression_1 < signed_const_1) OR (expression_1 > signed_const_2)\nexpression_1 NOT IN (signed_const_1 TO signed_const_2)\n\nwhere signed_const_2 < signed_const_1\n\n(expression_1 < signed_const_2) OR (expression_1 > signed_const_1)\n\nHere are some examples.\n\nThis statement … Is equivalent to this statement …\n```SELECT DeptNo\nFROM Department\nWHERE DeptNo IN (500, 600);```\n```SELECT DeptNo\nFROM Department\nWHERE DeptNo IN (500)\nOR (DeptNo = 600);```\n```UPDATE Employee\nSET Salary=Salary + 200\nWHERE DeptNo NOT IN (100, 700);```\n```UPDATE Employee\nSET Salary=Salary + 200\nWHERE (DeptNo ^= 100)\nAND (DeptNo ^= 700);```"
] |
[
null
] |
{"ft_lang_label":"__label__en","ft_lang_prob":0.62066066,"math_prob":0.98926276,"size":2199,"snap":"2019-51-2020-05","text_gpt3_token_len":600,"char_repetition_ratio":0.29703873,"word_repetition_ratio":0.15335463,"special_character_ratio":0.2983174,"punctuation_ratio":0.08064516,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.98222214,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2019-12-07T04:23:20Z\",\"WARC-Record-ID\":\"<urn:uuid:f0defeac-65b2-47f1-9e96-32ce9d399b69>\",\"Content-Length\":\"13020\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:0089b9c8-1b35-4d92-b08e-f0e9717c09d1>\",\"WARC-Concurrent-To\":\"<urn:uuid:82b821d2-1497-4331-b379-5cc595a94eb4>\",\"WARC-IP-Address\":\"62.210.155.88\",\"WARC-Target-URI\":\"https://docs.teradata.com/reader/756LNiPSFdY~4JcCCcR5Cw/l~UwRfOH3B2wgGbSwCV7uQ\",\"WARC-Payload-Digest\":\"sha1:NMQNO5KY5JYLLMHB7BOC23SIMGVFLI2E\",\"WARC-Block-Digest\":\"sha1:GFZUJNIGXZ5BJL5KCEWYTJV554XLIEK7\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2019/CC-MAIN-2019-51/CC-MAIN-2019-51_segments_1575540495263.57_warc_CC-MAIN-20191207032404-20191207060404-00223.warc.gz\"}"}
|
https://quizizz.com/admin/quiz/5882340a67fde820577caf84
|
[
"",
null,
"7th Grade Graphing and Data Analysis Review\n3 years ago\nclarkster4\nSave\nEdit\nHost a game\nLive GameLive\nHomework\nSolo Practice\nPractice",
null,
"32 QuestionsShow answers\n• Question 1\n60 seconds",
null,
"Q. What type of graph is this?\nBar Graph\nLine Plot\nPictograph\nTally Chart\n• Question 2\n60 seconds",
null,
"Q. What type of graph is this?\nBar Graph\nPictograph\nLine Plot\nTally Chart\n• Question 3\n180 seconds",
null,
"Q. How many more people have purple for a favorite color than red?\n3\n5\n7\n9\n• Question 4\n180 seconds",
null,
"Q. How many people have four books in their desks?\n2\n3\n4\n5\n• Question 5\n180 seconds",
null,
"Q. How many people have two or less books in their desk?\n4\n5\n6\n7\n• Question 6\n180 seconds",
null,
"Q. On which day was the number of sugar cookies made at the bakery greater than the number of chocolate cookies?\nMonday\nTuesday\nThursday\nSaturday\n• Question 7\n180 seconds",
null,
"Q. What is the median for the Online Purchases?\n\\$58\n\\$60\n\\$61\n\\$64\n• Question 8\n900 seconds",
null,
"Q. What is the mode of the data in the stem-and-leaf plot?\n53\n66\n75\n86\n• Question 9\n180 seconds",
null,
"Q. How many people spent 45 minutes playing outside?\n0\n2\n3\n8\n• Question 10\n180 seconds",
null,
"Q. Find the range\n5\n55\n50\n20\n• Question 11\n180 seconds",
null,
"Q. How many families are represented in the line plot?\n5\n6\n17\n18\n• Question 12\n300 seconds\nQ. Find the median\n112, 140, 77,126, 91, 77, 133\n114\n87\n112\n96\n• Question 13\n120 seconds\nQ. Range means?\nMiddle number\nDifference between high and low numbers\nNumber that shows the most\n• Question 14\n180 seconds\nQ. Find the mode of\n34, 48, 87, 56,\n87, 51, 29\n86\n88\n90\n87\n• Question 15\n180 seconds\nQ. mode means?\nAverage\nMiddle\nMost Frequent\nStandard deviation\n• Question 16\n180 seconds\nQ. A data set can have more than one mode\nTrue\nFalse\n• Question 17\n120 seconds\nQ. A data set can have more than one median?\nTrue\nFalse\n• Question 18\n900 seconds\nQ. The number of pages that Carolyn wrote in her journal each day from Monday to Friday is shown below:\n9, 8, 12, 6, 10\nWhat is the mean number of pages she wrote per day?\n5\n6\n9\n11\n• Question 19\n180 seconds\nQ. What kind of graphs use percents?\nLine Graph\nPie Chart\nBar Graph\nHistogram\n• Question 20\n180 seconds\nQ. What graph measures data over time?\nLine Graph\nBar Graph\nHistogram\nPie Chart\n• Question 21\n300 seconds",
null,
"Q. How would you describe the change in temperature from Thursday to Friday?\nIncreasing\nDecreasing\nNo change\n• Question 22\n300 seconds",
null,
"Q. Which day of the week recorded the highest temperature?\nMonday\nTuesday\nWednesday\nThursday\n• Question 23\n300 seconds",
null,
"Q. Of the grades listed below, which grade did Jim have the fewest number of absences?\nKindergarten\n• Question 24\n180 seconds",
null,
"Q. How many students have more than 1,000 songs on their MP3 player?\n5\n16\n10\n4\n• Question 25\n300 seconds",
null,
"Q. How many students take the train and walk to school combined?\n40\n20\n25\n60\n• Question 26\n120 seconds\nQ. Identify the outlier for the given data?\n23, 34, 27, 7, 30, 26, 28, 31, 34\n7\n23\n31\n34\n• Question 27\n180 seconds",
null,
"Q. The dot plot shows how many home runs the Eagles hit in each game. In how many games did the Eagles hit fewer than 3 home runs?\n2\n4\n9\n13\n• Question 28\n180 seconds",
null,
"Q. The graph shows the number of members in four student clubs. How many more students are in the ski club than the chess club?\n3\n4\n5\n6\n• Question 29\n180 seconds",
null,
"Q. If you made a stem-and-leaf plot of the data in the table, how many stems and how many leaves would you use?\n4 stems, 9 leaves\n4 stems, 11 leaves\n9 stems, 4 leaves\n11 stems, 4 leaves\n• Question 30\n300 seconds",
null,
"Q. What is the median?\n62\n58\n66\n60\n• Question 31\n180 seconds",
null,
"Q. What is the maximum value?\n58\n66\n64\n60\n• Question 32\n300 seconds",
null,
"Q. What is the interquartile range (IQR)?"
] |
[
null,
"https://cf.quizizz.com/img/logos/new/logo_placeholder_sm.png",
null,
"https://cf.quizizz.com/img/icons/question_color.png",
null,
"https://quizizz.com/media/resource/gs/quizizz-media/questions/L2FwcGhvc3RpbmdfcHJvZC9ibG9icy9BRW5CMlVwTFFGTk81b2VQcXVfT3MyX3FoaW5wRy04a1hBX285Z2RKYkJsRkNIWHMyOXdkRE1EeFgtNlc3RkNuZ1FPUm1pNjdoNTF4Q0RRc1RlbWJWcGtIWEhtRy1lZXVfUS5MY1VmbDg1c2Nzd0hCRjlV",
null,
"https://quizizz.com/media/resource/gs/quizizz-media/questions/L2FwcGhvc3RpbmdfcHJvZC9ibG9icy9BRW5CMlVvQ1A4eElQM1UxcnlycktIaDR5aWtTRXRwOXBTcVpaTDZtZWc0bk40NDNZbGFQaXY0YlBNbFdDa05hdExydG9WSmx3c1VUeXhHRDFISHEwTmZJRDVHc0JrbFktdy50ZUJNR1JScy13ZVR0SXZn",
null,
"https://quizizz.com/media/resource/gs/quizizz-media/questions/L2FwcGhvc3RpbmdfcHJvZC9ibG9icy9BRW5CMlVxclZSVFQwMjlwcTd5MzdiNkh6eFNBVzQyN214c2Q1bC02RV9JR2poVnBNdHNPNUFNTGw0TkNVVThrcGhybUY1SkZ1aWtVQWVwbWV1SEdLTFYyQ1dMdlFBWmhFdy5wUWE3bG9rUzBVY0ZsYkJT",
null,
"https://quizizz.com/media/resource/gs/quizizz-media/questions/L2FwcGhvc3RpbmdfcHJvZC9ibG9icy9BRW5CMlVvMjN5Y3pyczh5ekw3QUNuU2hwcEJYTmlKRjh3U0oxR0NqcGlMVWtleEx6QUNXc0lNY19nTGprRTdXRGxDc1ZadUx4T3RudWNIdEVpb0Nuc1FXYXc4d2pVS1lNQS4td3N4QWNQdEJLUllFaWFx",
null,
"https://quizizz.com/media/resource/gs/quizizz-media/questions/L2FwcGhvc3RpbmdfcHJvZC9ibG9icy9BRW5CMlVxTWs2akQ2MFFRRGhxTnBCcHFfaEd0bXJ1aldMa2hESHdjWFdTYjg5SDRDRGJYNkxjeXVXUDBLQmlVcjNGQkhxY05oRjEyWUR6UDlGa09yRHFHX0J5UXRybmJfdy5naVV6a2NoZ3BKVkJqZUxZ",
null,
"https://quizizz.com/media/resource/gs/quizizz-media/questions/L2FwcGhvc3RpbmdfcHJvZC9ibG9icy9BRW5CMlVweUlXUDNWNTVYTEJJNmowcjlvN2lTd1dnWndMcDNmd25udWZ6TUdfSW1ueGd3VjQzQ2lGZmVTS2ZlbUt6QUQ0Sm1yLWI1M0x4aGk0OFlVV3dRc1NnZXR6MDZwZy41Q1NTX2dHU25LM1hhaWxh",
null,
"https://quizizz.com/media/resource/gs/quizizz-media/questions/L2FwcGhvc3RpbmdfcHJvZC9ibG9icy9BRW5CMlVxOVowSURlNFlhQXJDb0preklvQmg5NEU3Ym9ndzh3QW12R2JjWFk4X0JWaWowS1V0UHI1YVNsU2FCcERSSUppLU1hZDhwaWVzdXhVYUZBYzNLV0VZVVR5azI0dy5lODBDSGptS3pKMms3Szlx",
null,
"https://quizizz.com/media/resource/gs/quizizz-media/questions/L2FwcGhvc3RpbmdfcHJvZC9ibG9icy9BRW5CMlVvWXdYeEVNSlFPeW1PZk5FVWgtSy1falR0MzZ4c0FxeVAtQUxtTkpfbWJjMmtRaEdaQkVBS0t4NmRpY3hGMmJNVXNMaFk4dk1fREIxUEZodEFZRVdRXzc1TFpoUS5mYzVPaXpKVmlVWFBBaDNh",
null,
"https://quizizz.com/media/resource/gs/quizizz-media/questions/L2FwcGhvc3RpbmdfcHJvZC9ibG9icy9BRW5CMlVvRlVQSFV5UGVYS3JSc3draURvSk9VYVpQdkxDeEVtZWpHWGtMY2tHeGY4ZWtrMk0wRHZtd0YwdlNpTk5tN3lJU2JjVUJOdVI5bXRzLWlDT0ZsOUhJSWZDYVdxUS5nNTFuUjBrRzJZTWY4ZWdr",
null,
"https://quizizz.com/media/resource/gs/quizizz-media/questions/L2FwcGhvc3RpbmdfcHJvZC9ibG9icy9BRW5CMlVyTUdEaU1xOFA2MlhuTG1SQXRtdzF5WFhJQUx3eFh2clp3ZTZ1WE9OSV8xVDRzLVZQZ3hQdUdhOC1Na3JBd0I4UFpKRzRyend5NzZkSnJ3UHNLa1VXZGpJelpRUS4zZVNzRDRia3g5SHNUem9K",
null,
"https://quizizz.com/media/resource/gs/quizizz-media/questions/L2FwcGhvc3RpbmdfcHJvZC9ibG9icy9BRW5CMlVyZXgwN0lRbWwwWkN3Slk1MWZ0ODQ4OVdPWVY1SEg2enp6aUpta1pmM2RpRkRlamZTeU5aclBub0FIY2RySU1vZ3BfdGxWT3YzT1BtaU52MXc4MlMzLXZ5Tm1RQS4tWDhDS3pKd1NRQ3NYY2Vr",
null,
"https://quizizz.com/media/resource/gs/quizizz-media/questions/L2FwcGhvc3RpbmdfcHJvZC9ibG9icy9BRW5CMlVvU1hLX2F4Qlc2dWttakxFUnVpT0FFMERJVm5BRkVkVUVMdVU5S3d3UWhUUFBxS1dfY1MzU09aNVZGMG5tc3ExcnRRVzhhNldlZThtVnJ4UDlSck9CY2xsRlVSdy52SUs2azBhRnkyYndkeHRp",
null,
"https://quizizz.com/media/resource/gs/quizizz-media/questions/L2FwcGhvc3RpbmdfcHJvZC9ibG9icy9BRW5CMlVvaHJCMFFORS03YjhGNlhzWlo0UGFyOVdSXzJHMXVqcjB6WVJBSmNsc2huYXNwazlNMWExb2FyUHpub3FSeGpCWUprMUJEbFBjNm4yRGUtVFJMVHB6d3hVSXIyQS5henVIbEtFQXpfdUR3aTNE",
null,
"https://quizizz.com/media/resource/gs/quizizz-media/questions/L2FwcGhvc3RpbmdfcHJvZC9ibG9icy9BRW5CMlVvUFpmRU9CVWVna29wZXM1TG93WFptY3lXdWNfZXI5RFpwbFhkVW5sQXJIRWk0WlBRMFZ2SC1RNEpTbVlic1lwX2cxNkRVQXhKMWM4LUVnNDNIYmFCX2Z5WGJmdy5Ha3phUGFCOVhGUFJoVGV0",
null,
"https://quizizz.com/media/resource/gs/quizizz-media/questions/L2FwcGhvc3RpbmdfcHJvZC9ibG9icy9BRW5CMlVxc2FNRnhoTEtQSGlodmEtUC1MT3VoWUp5OVRfdUpfT28zWE1SakVfWnpxaHRWei1SYl9CU0NtdjAxa2d5cEZqc2ZiQUVSdy1pYXZRaWlmcjVXNkJsQ0xQdllQdy40cy05TElab1ByLVVTREhm",
null,
"https://quizizz.com/media/resource/gs/quizizz-media/questions/L2FwcGhvc3RpbmdfcHJvZC9ibG9icy9BRW5CMlVwOThIS1NTb0ttdWZuSW1YZVlaNURCalpWbG9LVV9zbVhDbk53U25BY1R5WWJZamdyM3NBMFYydFZkbXp0MmhyVjN2OXdlN0JvcVFwSC16WUxCRV9mT29vUFlhUS5CQ2k4NFVnclJiejZNQ25L",
null,
"https://quizizz.com/media/resource/gs/quizizz-media/questions/L2FwcGhvc3RpbmdfcHJvZC9ibG9icy9BRW5CMlVxRmtocDFWZVNHNS1FS0NWcVNselVDdzRwamxJMzRIbDZMcWZvZUcyNTA1ZW94WFQ0NV9PRFdyWUN6aWk4VnpYSktmZ3o5ckpkckJIRm5lRXd5UTJlUHd4MnB1Zy5NVnVmbHZ5MF8wTHFDaWRl",
null,
"https://quizizz.com/media/resource/gs/quizizz-media/questions/L2FwcGhvc3RpbmdfcHJvZC9ibG9icy9BRW5CMlVyYmp2aFJ4VmVna29JUzFGWHJ6b29qazNfQW5pQmxIbHctQ2p5OXdVY2ozMHpCZVRrMHJaUG5Cb0tVeTJqVE4tTGtZUzZHUUhOMUZCdWZYMEYtQm5OSS16YXp4QS40UkhoWWtZUm93VklPbVBh",
null,
"https://quizizz.com/media/resource/gs/quizizz-media/questions/L2FwcGhvc3RpbmdfcHJvZC9ibG9icy9BRW5CMlVyeHlVNE9aMlVXaVRZN05sTE53QVM0TDQ0RjcyYW50N3JNRXZnMFdIWEJRSzJOSkgtanJlbjUxckdsak0ybTV5aDIwczYwcjVfZU1BazlSS21Jb2I5Vk4yN3NKdy5TaVhaUDVXR3ROcUVFV0J6",
null,
"https://quizizz.com/media/resource/gs/quizizz-media/questions/L2FwcGhvc3RpbmdfcHJvZC9ibG9icy9BRW5CMlVvUVlGQXlfTmFfelFuMjRnUVFpS3RsS3FJOG9EekQ3b0ZnU2RCOFpNemd3b3RFV1dGWV8zMTRwOEVCdXBwbThBMEdpbF9yaVdvcFBzQ1pjQlNBZWtlZmVNOTZBQS5xbnM4WFF6dHJNRDRtNF81",
null,
"https://quizizz.com/media/resource/gs/quizizz-media/questions/L2FwcGhvc3RpbmdfcHJvZC9ibG9icy9BRW5CMlVwbUM1YXFfcU8td1RzN0E2RDF2TW1yQmFnSmRhdjU3WDFJazM4d2dkZkVLMjBNQ0J1ODVBVHBVNU1lOHZBR0dGWENaS2ZaZm1XdDFLaGdIeFEtWHkzT0xwSTRNdy5IYWdueHhvTjBURkNXMXRU",
null,
"https://quizizz.com/media/resource/gs/quizizz-media/questions/L2FwcGhvc3RpbmdfcHJvZC9ibG9icy9BRW5CMlVyUTV0dnZiNnVkZExOcER2NWduSmJTd1diQU40OVFJTWxWX1cxbEZ3YlZ3QWdEVnVLeGpFY2x3cTFZX2JZMThkRHUyb0RMd0Z2NldOV0dUbk0xcEJCTnhpdlNkUS5BOF9uaklFNEd2R2lmdG54",
null
] |
{"ft_lang_label":"__label__en","ft_lang_prob":0.8265115,"math_prob":0.80363196,"size":6046,"snap":"2022-05-2022-21","text_gpt3_token_len":1919,"char_repetition_ratio":0.24263489,"word_repetition_ratio":0.20320855,"special_character_ratio":0.2858088,"punctuation_ratio":0.115593486,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9512789,"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],"im_url_duplicate_count":[null,null,null,null,null,2,null,2,null,2,null,2,null,2,null,2,null,2,null,2,null,2,null,2,null,2,null,2,null,2,null,2,null,2,null,2,null,2,null,2,null,2,null,2,null,3,null,2,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2022-05-22T07:09:37Z\",\"WARC-Record-ID\":\"<urn:uuid:ac80f176-6d61-4bab-abd5-3de4731f2370>\",\"Content-Length\":\"79948\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:a81a2e25-ea4a-4718-b641-b6843636b38f>\",\"WARC-Concurrent-To\":\"<urn:uuid:a95b8504-b29e-4cbc-b23d-bed87c4c027e>\",\"WARC-IP-Address\":\"18.67.65.33\",\"WARC-Target-URI\":\"https://quizizz.com/admin/quiz/5882340a67fde820577caf84\",\"WARC-Payload-Digest\":\"sha1:JGT35WMAJ6NL7ISLFU5ZE7N6QPUNTOIH\",\"WARC-Block-Digest\":\"sha1:MNKZ4IWU6KTZYIDHZB7SZNW5ZMBW65DG\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2022/CC-MAIN-2022-21/CC-MAIN-2022-21_segments_1652662545090.44_warc_CC-MAIN-20220522063657-20220522093657-00592.warc.gz\"}"}
|
https://vivo.library.tamu.edu/vivo/display/n190388SE
|
[
"# Transient analysis of Cosserat rod with inextensibility and unshearability constraints using the least-squares finite element model Academic Article",
null,
"•\n• Overview\n•\n• Research\n•\n• Identity\n•\n•\n• Other\n•\n• View All\n•\n\n### abstract\n\n• 2015 Elsevier Ltd. All rights reserved. In this study, time-dependent fully discretized least-squares finite element model is developed for the transient response of Cosserat rod having inextensibility and unshearability constraints to simulate a surgical thread in space. Starting from the kinematics of the rod for large deformation, the linear and angular momentum equations along with constraint conditions for the sake of completeness are derived. Then, the -family of time derivarive approximation is used to reduce the governing equations of motion to obtain a semi-discretized system of equations, which are then fully discretized using the least-squares approach to obtain the non-linear finite element equations. Newton's method is utilized to solve the non-linear finite element equations. Dynamic response due to impulse force and time-dependent follower force at the free end of the rod is presented as numerical examples.\n\n### published proceedings\n\n• INTERNATIONAL JOURNAL OF NON-LINEAR MECHANICS\n\n### author list (cited authors)\n\n• Arbind, A., & Reddy, J. N.\n\n• 9\n\n### complete list of authors\n\n• Arbind, Archana||Reddy, JN\n\n• March 2016"
] |
[
null,
"https://vivo.library.tamu.edu/vivo/images/individual/uriIcon.gif",
null
] |
{"ft_lang_label":"__label__en","ft_lang_prob":0.9156249,"math_prob":0.785674,"size":946,"snap":"2023-40-2023-50","text_gpt3_token_len":178,"char_repetition_ratio":0.112526536,"word_repetition_ratio":0.014925373,"special_character_ratio":0.17124736,"punctuation_ratio":0.07096774,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9846452,"pos_list":[0,1,2],"im_url_duplicate_count":[null,null,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2023-09-27T09:19:17Z\",\"WARC-Record-ID\":\"<urn:uuid:e4d2b997-19a3-407d-8861-22e85c05c250>\",\"Content-Length\":\"22785\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:82f7b01b-036b-4f21-b5e1-067c5a4d4f47>\",\"WARC-Concurrent-To\":\"<urn:uuid:f975785c-2b9a-4f3a-95d1-a5432db674d6>\",\"WARC-IP-Address\":\"128.194.18.20\",\"WARC-Target-URI\":\"https://vivo.library.tamu.edu/vivo/display/n190388SE\",\"WARC-Payload-Digest\":\"sha1:I6GJLVUEKGOG45DBVBMH5QGRCUCSVQZK\",\"WARC-Block-Digest\":\"sha1:5BS6APHGFTBRNJVDVUG7T24R53P7P5LO\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2023/CC-MAIN-2023-40/CC-MAIN-2023-40_segments_1695233510284.49_warc_CC-MAIN-20230927071345-20230927101345-00784.warc.gz\"}"}
|
https://predictivehacks.com/count-the-consecutive-events-in-python/
|
[
"Predictive Hacks\n\n# Count the Consecutive Events in Python\n\nThis short post is about finding an efficient way to count consecutive events. We are going to represent a straightforward practical example:\n\n```import pandas as pd\ndf = pd.DataFrame({'Score':['win', 'loss', 'loss', 'loss', 'win', 'win', 'win', 'win', 'win', 'loss', 'win', 'loss', 'loss']})\ndf\n```\n`````` Score\n0 win\n1 loss\n2 loss\n3 loss\n4 win\n5 win\n6 win\n7 win\n8 win\n9 loss\n10 win\n11 loss\n12 loss``````\n\nAnd with the following “hack” we are going to get the column of the “Streak”\n\n```df['Streak'] = df['Score'].groupby((df['Score'] != df['Score'].shift()).cumsum()).cumcount() + 1\ndf\n```\n`````` Score Streak\n0 win 1\n1 loss 1\n2 loss 2\n3 loss 3\n4 win 1\n5 win 2\n6 win 3\n7 win 4\n8 win 5\n9 loss 1\n10 win 1\n11 loss 1\n12 loss 2``````\n\n## Count the Consecutive Events within Group\n\nLet’s say that we have the same example as above, but we want to do the same exercise within group.\n\n```df = pd.DataFrame({'Group':['A','A', 'A','A','A','A','B','B','B','B','B','B','B'],\n'Score':['win', 'loss', 'loss', 'loss', 'win', 'win', 'win', 'win', 'win', 'loss', 'win', 'loss', 'loss']})\ndf\n```\n`````` Group Score\n0 A win\n1 A loss\n2 A loss\n3 A loss\n4 A win\n5 A win\n6 B win\n7 B win\n8 B win\n9 B loss\n10 B win\n11 B loss\n12 B loss``````\n```df['Streak'] = df['Score'].groupby((df['Score'] != df.groupby(['Group'])['Score'].shift()).cumsum()).cumcount() + 1\ndf\n```\n`````` Group Score Streak\n0 A win 1\n1 A loss 1\n2 A loss 2\n3 A loss 3\n4 A win 1\n5 A win 2\n6 B win 1\n7 B win 2\n8 B win 3\n9 B loss 1\n10 B win 1\n11 B loss 1\n12 B loss 2``````"
] |
[
null
] |
{"ft_lang_label":"__label__en","ft_lang_prob":0.68775517,"math_prob":0.7187593,"size":1425,"snap":"2020-45-2020-50","text_gpt3_token_len":526,"char_repetition_ratio":0.2174525,"word_repetition_ratio":0.06498195,"special_character_ratio":0.41964912,"punctuation_ratio":0.15447155,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9899331,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2020-12-04T02:29:21Z\",\"WARC-Record-ID\":\"<urn:uuid:733ce563-2602-4159-9318-1d038bc27f22>\",\"Content-Length\":\"194440\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:6715fdc7-8532-4be8-8706-5dda0018b0e0>\",\"WARC-Concurrent-To\":\"<urn:uuid:1e18b163-0aac-4433-b46b-204e3484043f>\",\"WARC-IP-Address\":\"172.67.177.213\",\"WARC-Target-URI\":\"https://predictivehacks.com/count-the-consecutive-events-in-python/\",\"WARC-Payload-Digest\":\"sha1:RO3YFBBG42536PDHTBUTR2VWL3JL2F7W\",\"WARC-Block-Digest\":\"sha1:UTLTYUETHEXGAURHQ7J77H6RHCJTSUF2\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2020/CC-MAIN-2020-50/CC-MAIN-2020-50_segments_1606141733120.84_warc_CC-MAIN-20201204010410-20201204040410-00537.warc.gz\"}"}
|
https://answers.everydaycalculation.com/add-fractions/56-84-plus-80-70
|
[
"Solutions by everydaycalculation.com\n\n1st number: 56/84, 2nd number: 1 10/70\n\n56/84 + 80/70 is 38/21.\n\n1. Find the least common denominator or LCM of the two denominators:\nLCM of 84 and 70 is 420\n2. For the 1st fraction, since 84 × 5 = 420,\n56/84 = 56 × 5/84 × 5 = 280/420\n3. Likewise, for the 2nd fraction, since 70 × 6 = 420,\n80/70 = 80 × 6/70 × 6 = 480/420\n280/420 + 480/420 = 280 + 480/420 = 760/420\n5. 760/420 simplified gives 38/21\n6. So, 56/84 + 80/70 = 38/21\nIn mixed form: 117/21\n\nMathStep (Works offline)",
null,
"Download our mobile app and learn to work with fractions in your own time:"
] |
[
null,
"https://answers.everydaycalculation.com/mathstep-app-icon.png",
null
] |
{"ft_lang_label":"__label__en","ft_lang_prob":0.8371636,"math_prob":0.9960935,"size":675,"snap":"2020-24-2020-29","text_gpt3_token_len":257,"char_repetition_ratio":0.13710879,"word_repetition_ratio":0.0,"special_character_ratio":0.50222224,"punctuation_ratio":0.10810811,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.99686176,"pos_list":[0,1,2],"im_url_duplicate_count":[null,null,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2020-05-31T17:40:40Z\",\"WARC-Record-ID\":\"<urn:uuid:d30db51a-6169-4d37-86a7-ccb73dde987f>\",\"Content-Length\":\"7005\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:0e229ad0-5f79-484e-85ba-823d58636fd7>\",\"WARC-Concurrent-To\":\"<urn:uuid:a544ff75-eb32-463a-bb98-3bb2ed972f29>\",\"WARC-IP-Address\":\"96.126.107.130\",\"WARC-Target-URI\":\"https://answers.everydaycalculation.com/add-fractions/56-84-plus-80-70\",\"WARC-Payload-Digest\":\"sha1:OQGBUDZKRGXKJL2PF3IGAY2XAAZOGKO6\",\"WARC-Block-Digest\":\"sha1:DQZVJ33JSA44UHZ5VEEODDXP5V5FCRUT\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2020/CC-MAIN-2020-24/CC-MAIN-2020-24_segments_1590347413551.52_warc_CC-MAIN-20200531151414-20200531181414-00527.warc.gz\"}"}
|
https://www.tutorjoes.in/java_programming_tutorial/Bitwise_in_java
|
[
"### Bitwise & Shift Operators in Java\n\nA shift operator performs bit manipulation on data by shifting the bits of its first operand right or left. The bitwise operators are the operators used to perform the operations on the data at the bit-level. When we perform the bitwise operations, then it is also known as bit-level programming. It consists of two digits, either 0 or 1.\n\nOperatorDescription\n| Bitwise OR\n& Bitwise AND\n^ Bitwise XOR\n~ Bitwise complement\n<< Left shift\n>> Signed right shift\n>>> Unsigned right shift\n\nThis Java program demonstrates the usage of bitwise operators (&, |, ^, ~) in Java. In this program, we first declare two integer variables a and b and assign them the values of 25 and 45 respectively. We then use the bitwise AND operator (&) to perform bitwise AND operation on a and b, and print the result using System.out.println() method.\n\nWe then use the bitwise OR operator (|) to perform bitwise OR operation on a and b, and print the result. Next, we use the bitwise XOR operator (^) to perform bitwise XOR operation on a and b, and print the result.\n\nFinally, we use the bitwise NOT operator (~) to perform bitwise complement operation on a and print the result. The bitwise NOT operator returns the complement of the operand, which means all the bits in the operand are inverted. In this case, since a is 25 (binary 00011001), its complement is -26 (binary 11100110 in two's complement representation).\n\n#### Source Code\n\n```public class Bitwise {\npublic static void main(String args[])\n{\n//Bitwise & Shift Operators in Java\nint a=25,b=45;\nSystem.out.println(\"Bitwise And : \"+(a&b));\nSystem.out.println(\"Bitwise Or : \"+(a|b));\nSystem.out.println(\"Bitwise Xor : \"+(a^b));\nSystem.out.println(\"Bitwise Not : \"+(~a));\n\n}\n}\n```\n\n### Output\n\n```Bitwise And : 9\nBitwise Or : 61\nBitwise Xor : 52\nBitwise Not : -26\n```"
] |
[
null
] |
{"ft_lang_label":"__label__en","ft_lang_prob":0.76038575,"math_prob":0.962525,"size":1895,"snap":"2023-40-2023-50","text_gpt3_token_len":464,"char_repetition_ratio":0.188789,"word_repetition_ratio":0.050632913,"special_character_ratio":0.2701847,"punctuation_ratio":0.1388889,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.99446386,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2023-10-04T16:21:26Z\",\"WARC-Record-ID\":\"<urn:uuid:e50214c5-4d47-4ffd-8c26-50690d570392>\",\"Content-Length\":\"40202\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:a479ffb3-fac8-4d18-add7-97fae1e313a2>\",\"WARC-Concurrent-To\":\"<urn:uuid:7275f433-be6d-4359-9fa1-0cabc69e6d87>\",\"WARC-IP-Address\":\"5.75.228.43\",\"WARC-Target-URI\":\"https://www.tutorjoes.in/java_programming_tutorial/Bitwise_in_java\",\"WARC-Payload-Digest\":\"sha1:XHPCLBT2FQI3B3T4NSEBAGJ75Q7FWMVI\",\"WARC-Block-Digest\":\"sha1:H4NI3K3OC37AK44NY6VBP7LB5QG7BTY2\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2023/CC-MAIN-2023-40/CC-MAIN-2023-40_segments_1695233511386.54_warc_CC-MAIN-20231004152134-20231004182134-00894.warc.gz\"}"}
|
https://physics.stackexchange.com/questions/386202/why-is-the-typical-lifetime-so-different-depending-on-the-type-of-interaction
|
[
"# Why is the typical lifetime so different depending on the type of interaction?\n\nWhy is $\\tau$ so different when it comes to Quantum Electrodynamics ($10^{-16}$s), Quantum Flavordynamics ($>10^{-13}$s) and Quantum Chromodynamics ($10^{-23}$s)?\n\nDoes this have something to do with the coupling constants as suggested in the comments below? They are $\\alpha=1/137\\approx 0.0073$ (for QED), $\\alpha_W\\approx 1/29\\approx 0.034$ (QFD) and $\\alpha_S\\approx 0.12$ (QCD). QFD has the longest typical lifetime although it has the middle coupling constant so I am not sure to see a direct link.\n\n• Hint: have you also written down the relative couplings of each interaction? – Cosmas Zachos Feb 13 '18 at 20:40\n• @CosmasZachos By the relative couplings you mean to calculate for example $\\alpha_W / \\alpha_S$? – Jxx Feb 13 '18 at 21:47\n• @CosmasZachos I guess it's better for me if I try to compare QED and QFD... So in my course notes the propagator for weak interactions is $\\propto\\frac{g_W^2}{q^2-M_W^2}$ right? And that the QED propagator is $\\propto\\frac{1}{q^2-M_X^2}$ where $M_X$ can be either $0$ if the virtual particle is a photon or $m_e$ for an electron. For simplicity I would compare $\\frac{g_W^2}{q^2-M_W^2}$ and $\\frac{1}{q^2}$, but the result is then $\\frac{g_W^2}{1-M_W^2/q^2}$ and I don't manage to eliminate $q^2$ in my calculations. Did I understand you correctly, and if yes am I mistaken with the propagators? – Jxx Feb 13 '18 at 22:12\n• Yes, broadly... if you want a reductionist summary, which is hard... Ideally, you'd take decays that are comparable in the effective q involved, and square the amplitude.... most of the strong decays aren't thusly suppressed, so they might serve as the yardstick--the 1 to compare to... – Cosmas Zachos Feb 13 '18 at 22:27\n• What is QFD? Hint: In know what the \"Q\" and \"D\" are already. – JEB Feb 13 '18 at 22:42\n\nThe short answer is the above relative strength of the couplings; except, ordinarily, a weak decay will involve a W propagator in the amplitude, and so the square of that in the rate. So, for momentum transfers q smaller than the mere hundreds of MeVs of available energy transferred, involved in light hadron decays, this could easily give you 8 orders of magnitude of suppression in decay rates of weak versus EM. So the W propagator, the fermi constant, is what really makes weak decays weak (long lived). Recall we compare through dimensionless quantities.\n\nFor light meson decays, we are so far from perturbative QCD, so we might as well take the low energy effective strong coupling to be 1. The QCD running coupling is yet to become relevant here. Often, the momentum available, also displayed in the PDG listings, controls the phase space and the rates.\n\nBut strong lifetimes are all over the map, if you inspect the PDG tables. I prefer widths, as $MeV \\approx 1/(6 \\cdot 10^{-22} s)$. The strong ππ decay of the ρ is 150 MeV wide. By contrast, the EM sibling of this is ππγ, suppressed by 2 orders of magnitude in rate, so just an α, alright.\n\nNow, look at the strong decay of the φ, 40 times slower than that of the ρ. There is a lot of slop in a type of decay--see below.\n\nLook at the weak decay of the charged K, to ππ, suppressed by 14 orders of magnitude w.r.t. the strong ρ decay rate. So, can you get 7 orders of magnitude suppression in the amplitude, playing wildly with numbers? Well, yeah: 2 orders from $\\alpha_W$, and 5 from the $(q/M_W)^2$ in the propagator... The W is 160 times more massive than the maximum available momentum of 200 MeV in the decay.\n\nNothing beats the exact formulas, of course, but you should be able to infer the PDG numbers within a couple of orders of magnitude, especially by comparison of dimensionless ratios, \"all other factors being equal\".\n\nOf course, unexpectedly suppressed or enhanced rates may be a key to something. (The relative narrowness of the φ seen above gave Zweig the heroic happy idea of quarks over half a century ago.) The extremely slow weak decay of the neutron, 15 minutes, is a feature of the phase-space suppression by the absurdly small available momentum transfer q ≪1MeV."
] |
[
null
] |
{"ft_lang_label":"__label__en","ft_lang_prob":0.8910456,"math_prob":0.97949165,"size":2244,"snap":"2019-43-2019-47","text_gpt3_token_len":536,"char_repetition_ratio":0.12589286,"word_repetition_ratio":0.0,"special_character_ratio":0.23440285,"punctuation_ratio":0.13219616,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.99357176,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2019-11-20T22:48:02Z\",\"WARC-Record-ID\":\"<urn:uuid:6420775d-0a1a-42c4-8ef7-ebd83507dafa>\",\"Content-Length\":\"144067\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:7247f518-76ae-4865-b605-5c501b8f3877>\",\"WARC-Concurrent-To\":\"<urn:uuid:9d3999b2-adc9-44e2-9536-89dd9b04ef6b>\",\"WARC-IP-Address\":\"151.101.129.69\",\"WARC-Target-URI\":\"https://physics.stackexchange.com/questions/386202/why-is-the-typical-lifetime-so-different-depending-on-the-type-of-interaction\",\"WARC-Payload-Digest\":\"sha1:KRPPBB3GAL3EDDKDJMUTGEVKNPLJ3MXK\",\"WARC-Block-Digest\":\"sha1:BKAPTHPD7K7OM4PHL2YY2PAVACKOGCR5\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2019/CC-MAIN-2019-47/CC-MAIN-2019-47_segments_1573496670635.48_warc_CC-MAIN-20191120213017-20191121001017-00274.warc.gz\"}"}
|
https://www.colorhexa.com/22e7bd
|
[
"# #22e7bd Color Information\n\nIn a RGB color space, hex #22e7bd is composed of 13.3% red, 90.6% green and 74.1% blue. Whereas in a CMYK color space, it is composed of 85.3% cyan, 0% magenta, 18.2% yellow and 9.4% black. It has a hue angle of 167.2 degrees, a saturation of 80.4% and a lightness of 52%. #22e7bd color hex could be obtained by blending #44ffff with #00cf7b. Closest websafe color is: #33ffcc.\n\n• R 13\n• G 91\n• B 74\nRGB color chart\n• C 85\n• M 0\n• Y 18\n• K 9\nCMYK color chart\n\n#22e7bd color description : Vivid cyan.\n\n# #22e7bd Color Conversion\n\nThe hexadecimal color #22e7bd has RGB values of R:34, G:231, B:189 and CMYK values of C:0.85, M:0, Y:0.18, K:0.09. Its decimal value is 2287549.\n\nHex triplet RGB Decimal 22e7bd `#22e7bd` 34, 231, 189 `rgb(34,231,189)` 13.3, 90.6, 74.1 `rgb(13.3%,90.6%,74.1%)` 85, 0, 18, 9 167.2°, 80.4, 52 `hsl(167.2,80.4%,52%)` 167.2°, 85.3, 90.6 33ffcc `#33ffcc`\nCIE-LAB 82.466, -54.735, 7.715 38.417, 61.162, 57.922 0.244, 0.388, 61.162 82.466, 55.276, 171.977 82.466, -66.256, 20.328 78.206, -49.176, 10.832 00100010, 11100111, 10111101\n\n# Color Schemes with #22e7bd\n\n• #22e7bd\n``#22e7bd` `rgb(34,231,189)``\n• #e7224c\n``#e7224c` `rgb(231,34,76)``\nComplementary Color\n• #22e75b\n``#22e75b` `rgb(34,231,91)``\n• #22e7bd\n``#22e7bd` `rgb(34,231,189)``\n• #22afe7\n``#22afe7` `rgb(34,175,231)``\nAnalogous Color\n• #e75b22\n``#e75b22` `rgb(231,91,34)``\n• #22e7bd\n``#22e7bd` `rgb(34,231,189)``\n• #e722af\n``#e722af` `rgb(231,34,175)``\nSplit Complementary Color\n• #e7bd22\n``#e7bd22` `rgb(231,189,34)``\n• #22e7bd\n``#22e7bd` `rgb(34,231,189)``\n• #bd22e7\n``#bd22e7` `rgb(189,34,231)``\n• #4ce722\n``#4ce722` `rgb(76,231,34)``\n• #22e7bd\n``#22e7bd` `rgb(34,231,189)``\n• #bd22e7\n``#bd22e7` `rgb(189,34,231)``\n• #e7224c\n``#e7224c` `rgb(231,34,76)``\n• #12aa8a\n``#12aa8a` `rgb(18,170,138)``\n• #15c19c\n``#15c19c` `rgb(21,193,156)``\n• #17d8af\n``#17d8af` `rgb(23,216,175)``\n• #22e7bd\n``#22e7bd` `rgb(34,231,189)``\n• #39e9c4\n``#39e9c4` `rgb(57,233,196)``\n• #50eccb\n``#50eccb` `rgb(80,236,203)``\n• #67eed2\n``#67eed2` `rgb(103,238,210)``\nMonochromatic Color\n\n# Alternatives to #22e7bd\n\nBelow, you can see some colors close to #22e7bd. Having a set of related colors can be useful if you need an inspirational alternative to your original color choice.\n\n• #22e78c\n``#22e78c` `rgb(34,231,140)``\n• #22e79c\n``#22e79c` `rgb(34,231,156)``\n``#22e7ad` `rgb(34,231,173)``\n• #22e7bd\n``#22e7bd` `rgb(34,231,189)``\n• #22e7cd\n``#22e7cd` `rgb(34,231,205)``\n• #22e7de\n``#22e7de` `rgb(34,231,222)``\n• #22e0e7\n``#22e0e7` `rgb(34,224,231)``\nSimilar Colors\n\n# #22e7bd Preview\n\nThis text has a font color of #22e7bd.\n\n``<span style=\"color:#22e7bd;\">Text here</span>``\n#22e7bd background color\n\nThis paragraph has a background color of #22e7bd.\n\n``<p style=\"background-color:#22e7bd;\">Content here</p>``\n#22e7bd border color\n\nThis element has a border color of #22e7bd.\n\n``<div style=\"border:1px solid #22e7bd;\">Content here</div>``\nCSS codes\n``.text {color:#22e7bd;}``\n``.background {background-color:#22e7bd;}``\n``.border {border:1px solid #22e7bd;}``\n\n# Shades and Tints of #22e7bd\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, #010907 is the darkest color, while #f6fefc is the lightest one.\n\n• #010907\n``#010907` `rgb(1,9,7)``\n• #031b16\n``#031b16` `rgb(3,27,22)``\n• #052c24\n``#052c24` `rgb(5,44,36)``\n• #073e32\n``#073e32` `rgb(7,62,50)``\n• #095041\n``#095041` `rgb(9,80,65)``\n• #0b614f\n``#0b614f` `rgb(11,97,79)``\n• #0d735d\n``#0d735d` `rgb(13,115,93)``\n• #0e856c\n``#0e856c` `rgb(14,133,108)``\n• #10977a\n``#10977a` `rgb(16,151,122)``\n• #12a888\n``#12a888` `rgb(18,168,136)``\n• #14ba97\n``#14ba97` `rgb(20,186,151)``\n• #16cca5\n``#16cca5` `rgb(22,204,165)``\n• #18ddb3\n``#18ddb3` `rgb(24,221,179)``\n• #22e7bd\n``#22e7bd` `rgb(34,231,189)``\n• #34e9c2\n``#34e9c2` `rgb(52,233,194)``\n• #45ebc8\n``#45ebc8` `rgb(69,235,200)``\n• #57edcd\n``#57edcd` `rgb(87,237,205)``\n• #69efd2\n``#69efd2` `rgb(105,239,210)``\n• #7af1d7\n``#7af1d7` `rgb(122,241,215)``\n• #8cf3dd\n``#8cf3dd` `rgb(140,243,221)``\n• #9ef4e2\n``#9ef4e2` `rgb(158,244,226)``\n• #b0f6e7\n``#b0f6e7` `rgb(176,246,231)``\n• #c1f8ed\n``#c1f8ed` `rgb(193,248,237)``\n• #d3faf2\n``#d3faf2` `rgb(211,250,242)``\n• #e5fcf7\n``#e5fcf7` `rgb(229,252,247)``\n• #f6fefc\n``#f6fefc` `rgb(246,254,252)``\nTint Color Variation\n\n# Tones of #22e7bd\n\nA tone is produced by adding gray to any pure hue. In this case, #808987 is the less saturated color, while #0ffac8 is the most saturated one.\n\n• #808987\n``#808987` `rgb(128,137,135)``\n• #77928c\n``#77928c` `rgb(119,146,140)``\n• #6d9c92\n``#6d9c92` `rgb(109,156,146)``\n• #64a597\n``#64a597` `rgb(100,165,151)``\n• #5bae9d\n``#5bae9d` `rgb(91,174,157)``\n• #51b8a2\n``#51b8a2` `rgb(81,184,162)``\n• #48c1a7\n``#48c1a7` `rgb(72,193,167)``\n``#3ecbad` `rgb(62,203,173)``\n• #35d4b2\n``#35d4b2` `rgb(53,212,178)``\n• #2bdeb8\n``#2bdeb8` `rgb(43,222,184)``\n• #22e7bd\n``#22e7bd` `rgb(34,231,189)``\n• #19f0c2\n``#19f0c2` `rgb(25,240,194)``\n• #0ffac8\n``#0ffac8` `rgb(15,250,200)``\nTone Color Variation\n\n# Color Blindness Simulator\n\nBelow, you can see how #22e7bd 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.51893085,"math_prob":0.65021855,"size":3705,"snap":"2020-34-2020-40","text_gpt3_token_len":1679,"char_repetition_ratio":0.12564172,"word_repetition_ratio":0.011111111,"special_character_ratio":0.5435898,"punctuation_ratio":0.23634337,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9832387,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2020-08-14T10:32:46Z\",\"WARC-Record-ID\":\"<urn:uuid:2dc7487c-c8fb-44dd-9211-2a3de4b2de1d>\",\"Content-Length\":\"36306\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:1aea35f1-6862-4208-abc7-bb15858a88f9>\",\"WARC-Concurrent-To\":\"<urn:uuid:45b492cc-74b0-4a47-8dba-843077734e0e>\",\"WARC-IP-Address\":\"178.32.117.56\",\"WARC-Target-URI\":\"https://www.colorhexa.com/22e7bd\",\"WARC-Payload-Digest\":\"sha1:VCTZROLBY7NW2FRMXZVYRHZYU2OOADKX\",\"WARC-Block-Digest\":\"sha1:SPFRJRJFTQDW4UZET4QFTERRF4GSOI3P\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2020/CC-MAIN-2020-34/CC-MAIN-2020-34_segments_1596439739211.34_warc_CC-MAIN-20200814100602-20200814130602-00118.warc.gz\"}"}
|
https://pastecode.io/s/1c4gk0pm
|
[
"",
null,
"",
null,
"# Untitled",
null,
"unknown\nplain_text\na month ago\n6.5 kB\n2\nIndexable\nNever\n```public class ShapeTest\n{\npublic static void main(String args[])\n{\nShape[] shapes = new Shape;\n\nshapes = new Point (7, 11);\nshapes = new Circle (22, 8, 3.5);\nshapes = new Square (5, 8, 7.0);\nshapes = new Cylinder (10, 10, 3.3, 10);\nshapes = new Point (10, 4);\nshapes = new Cylinder (5, 7, 8.3, 5);\n\nfor (int i = 0; i < 6; i++)\n{\nSystem.out.print ((shapes[i]).name());\nSystem.out.print (\": \");\nshapes[i].print();\nSystem.out.println (\"\\nArea = \" + (Math.round(shapes[i].area())));\nSystem.out.println (\"Volume = \" + (Math.round(shapes[i].volume())) + \"\\n\");\n}\n} // end of main\n} // end of ShapeTest\n\n//===================================================================\n// CLASS Shape is the root of our general hierarchy of shapes.\n// All shapes have these four methods (area,volume,name and print).\n//===================================================================\n\nabstract class Shape\n{\n// area is zero by default if not overridden by a subclass\npublic double area()\n{\nreturn 0.0;\n}\n\n// volume is zero by default if not overridden by a subclass\npublic double volume()\n{\nreturn 0.0;\n}\n\n// non-abstract subclasses must define a name method, which\n// returns the name of the class\npublic abstract String name();\n\n// non-abstract subclasses must define a print method, which\n// prints out the class' attributes.\npublic abstract void print();\n\n} // end of Shape\n\n//===================================================================\n// CLASS Point is a degenerate \"shape\", consisting of only a\n// pair of coordinates.\n//===================================================================\n\nclass Point extends Shape\n{\nprotected double x, y;\n\npublic Point(double new_x, double new_y)\n{\nsetPoint(new_x,new_y);\n}\n\npublic void setPoint(double new_x, double new_y)\n{\nx = new_x;\ny = new_y;\n}\n\npublic double getX()\n{\nreturn x;\n}\n\npublic double getY()\n{\nreturn y;\n}\n\npublic String name()\n{\nreturn \"Point\";\n}\n\n// print out the coordinates in \"[x, y]\" format\npublic void print()\n{\nSystem.out.print(\"[\"+getX()+\", \"+getY()+\"]\");\n}\n\n} // end of Point\n\n//===================================================================\n// CLASS Circle uses Point to define the center of the circle, and\n// also has a separate variable for the radius.\n//===================================================================\n\nclass Circle extends Point\n{\n\npublic Circle(double new_x, double new_y, double new_radius)\n{\nsuper(new_x,new_y); // the Point is the center of the Circle\n}\n\n{\n}\n\n{\n}\n\n// use grade-school pi*r^2 formula for the area\npublic double area()\n{\n// I assigned the value of getRadius() to a temporary variable\n// the same method twice. We're not particularly concerned\n// about performance in this class, so don't worry too much\n\n// 3.14 instead of Math.PI is fine for this assignment\n}\n\npublic String name()\n{\nreturn \"Circle\";\n}\n\n// print out circle info in \"Center=[x, y]; Radius=r\" format, using\n// superclass' print() to print out the center coords.\npublic void print()\n{\nSystem.out.print(\"Center=\");\nsuper.print();\n}\n\n} // end of Circle\n\n//===================================================================\n// CLASS Square uses Point to define the start of the square (I\n// assume would be one of the corners, but which corner is not\n// important for this assignment). A separate variable for the\n// side length of the square is also maintained.\n//===================================================================\n\nclass Square extends Point\n{\nprotected double length;\n\npublic Square(double new_x, double new_y, double new_length)\n{\nsuper(new_x,new_y); // the Point is the start of the square\nsetLength(new_length);\n}\n\npublic void setLength(double new_length)\n{\nlength = new_length;\n}\n\npublic double getLength()\n{\nreturn length;\n}\n\n// square's area is its side squared\npublic double area()\n{\ndouble currentLength = getLength();\nreturn currentLength * currentLength;\n}\n\npublic String name()\n{\nreturn \"Square\";\n}\n\n// print out square info in \"Start=[x, y]; Length=l\" format, using\n// superclass' print() to print out the start coords.\npublic void print()\n{\nSystem.out.print(\"Start=\");\nsuper.print();\nSystem.out.print(\"; Length=\"+getLength());\n}\n\n} // end of Square\n\n//===================================================================\n// CLASS Cylinder uses Circle to define the top/bottom of the\n// cylinder, plus another variable height to store the height of\n// the shape.\n//===================================================================\n\nclass Cylinder extends Circle\n{\nprotected double height;\n\npublic Cylinder(double new_x, double new_y, double new_radius, double new_height)\n{\nsuper(new_x,new_y,new_radius); // the Circle defines the top/bottom of the Cylinder\nsetHeight(new_height);\n}\n\npublic void setHeight(double new_height)\n{\nheight = new_height;\n}\n\npublic double getHeight()\n{\nreturn height;\n}\n\n// surface area = 2*endArea + sidewall\n// end area = circle's area (uses super.area())\n// sidewall = circumference * height = (2*pi*r)*h\npublic double area()\n{\n// endArea is the area of the two ends of the cylinder\ndouble endArea = 2*super.area();\n\n// total area is equal to the sum of the ends + the sidewall (circumference * height)\n}\n\n// cylinder's volume is its end area (top or bottom) times its height.\npublic double volume()\n{\nreturn super.area() * getHeight();\n}\n\npublic String name()\n{\nreturn \"Cylinder\";\n}\n\n// print out circle info in \"Center=[x, y]; Radius=r; Height = h\" format, using\n// superclass' print() to print out the center and radius info\npublic void print()\n{\nsuper.print();\nSystem.out.print(\"; Height=\"+getHeight());\n}\n\n} // end of Cylinder\n\n```",
null,
"",
null,
""
] |
[
null,
"https://pastecode.io/ads/nord/nord_300-250_2.gif",
null,
"https://go.nordvpn.net/aff_i",
null,
"https://www.gravatar.com/avatar/9b5c56e0227d015b77ba7196ff4c34ad",
null,
"https://pastecode.io/ads/nord/nord_300-250_2.gif",
null,
"https://go.nordvpn.net/aff_i",
null
] |
{"ft_lang_label":"__label__en","ft_lang_prob":0.5331082,"math_prob":0.8533181,"size":6011,"snap":"2023-40-2023-50","text_gpt3_token_len":1322,"char_repetition_ratio":0.25287166,"word_repetition_ratio":0.09456265,"special_character_ratio":0.38363,"punctuation_ratio":0.1750524,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.96884173,"pos_list":[0,1,2,3,4,5,6,7,8,9,10],"im_url_duplicate_count":[null,null,null,null,null,null,null,null,null,null,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2023-12-07T23:05:42Z\",\"WARC-Record-ID\":\"<urn:uuid:1d089924-7caf-4074-af72-f119d3d11aed>\",\"Content-Length\":\"250095\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:63e511c8-8c5d-4098-b52a-97de105d4318>\",\"WARC-Concurrent-To\":\"<urn:uuid:12a36eb5-b95e-492c-a41d-1b4af60c4c3b>\",\"WARC-IP-Address\":\"104.21.67.220\",\"WARC-Target-URI\":\"https://pastecode.io/s/1c4gk0pm\",\"WARC-Payload-Digest\":\"sha1:3PO7CSHMDD35GQDNJXY5FOGKG32WMNUA\",\"WARC-Block-Digest\":\"sha1:PPK2KTN2QN5PTVO5YMGB4ZRRNVOFNHJ2\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2023/CC-MAIN-2023-50/CC-MAIN-2023-50_segments_1700679100705.19_warc_CC-MAIN-20231207221604-20231208011604-00678.warc.gz\"}"}
|
https://www.geeksforgeeks.org/swap-all-occurrences-of-two-characters-to-get-lexicographically-smallest-string/?ref=lbp
|
[
"Related Articles\nSwap all occurrences of two characters to get lexicographically smallest string\n• Last Updated : 08 Jan, 2020\n\nGiven a string str of lower case English alphabets. One can choose any two characters in the string and replace all the occurrences of the first character with the second character and replace all the occurrences of the second character with the first character. Find the lexicographically smallest string that can be obtained by doing this operation at most once.\n\nExamples:\n\nOutput: aacd\nSwap all the occurrences of ‘c’ with ‘a’ and all the\noccurrences of ‘a’ with ‘c’ to get “aacd” which is the\nlexicographically smallest string that we can get.\n\nInput: str = “abba”\nOutput: abba\nThe only possible operation will convert the given string\nto “baab” which is not lexicographically smallest.\n\n## Recommended: Please try your approach on {IDE} first, before moving on to the solution.\n\nApproach:\n\n• First we store the first appearance of every character in a string in a hash array chk[].\n• The in order to find the lexicographically smaller string, the leftmost character must be replaced with some character which is smaller than it. This will only happen if the smaller character appears after it in the array.\n• So, starting traversing the string from the left and for every character, find the smallest character (even smaller than the current character) that appears after swap all of their occurrences to get the required string.\n• If no such character pair is found in the previous string then print the given string as it is the smallest string possible.\n• Below is the implementation of the above approach:\n\n## C++\n\n `// C++ implementation of the approach ` `#include ` `using` `namespace` `std; ` ` ` `#define MAX 26 ` ` ` `// Function to return the lexicographically ` `// smallest string after swapping all the ` `// occurrences of any two characters ` `string smallestStr(string str, ``int` `n) ` `{ ` ` ``int` `i, j; ` ` ``// To store the first index of ` ` ``// every character of str ` ` ``int` `chk[MAX]; ` ` ``for` `(i = 0; i < MAX; i++) ` ` ``chk[i] = -1; ` ` ` ` ``// Store the first occurring ` ` ``// index every character ` ` ``for` `(i = 0; i < n; i++) { ` ` ` ` ``// If current character is appearing ` ` ``// for the first time in str ` ` ``if` `(chk[str[i] - ``'a'``] == -1) ` ` ``chk[str[i] - ``'a'``] = i; ` ` ``} ` ` ` ` ``// Starting from the leftmost character ` ` ``for` `(i = 0; i < n; i++) { ` ` ` ` ``bool` `flag = ``false``; ` ` ` ` ``// For every character smaller than str[i] ` ` ``for` `(j = 0; j < str[i] - ``'a'``; j++) { ` ` ` ` ``// If there is a character in str which is ` ` ``// smaller than str[i] and appears after it ` ` ``if` `(chk[j] > chk[str[i] - ``'a'``]) { ` ` ``flag = ``true``; ` ` ``break``; ` ` ``} ` ` ``} ` ` ` ` ``// If the required character pair is found ` ` ``if` `(flag) ` ` ``break``; ` ` ``} ` ` ` ` ``// If swapping is possible ` ` ``if` `(i < n) { ` ` ` ` ``// Characters to be swapped ` ` ``char` `ch1 = str[i]; ` ` ``char` `ch2 = ``char``(j + ``'a'``); ` ` ` ` ``// For every character ` ` ``for` `(i = 0; i < n; i++) { ` ` ` ` ``// Replace every ch1 with ch2 ` ` ``// and every ch2 with ch1 ` ` ``if` `(str[i] == ch1) ` ` ``str[i] = ch2; ` ` ` ` ``else` `if` `(str[i] == ch2) ` ` ``str[i] = ch1; ` ` ``} ` ` ``} ` ` ` ` ``return` `str; ` `} ` ` ` `// Driver code ` `int` `main() ` `{ ` ` ``string str = ``\"ccad\"``; ` ` ``int` `n = str.length(); ` ` ` ` ``cout << smallestStr(str, n); ` ` ` ` ``return` `0; ` `} `\n\n## Java\n\n `// Java implementation of the approach ` `import` `java.util.*; ` ` ` `class` `GFG ` `{ ` `static` `int` `MAX = ``26``; ` ` ` `// Function to return the lexicographically ` `// smallest string after swapping all the ` `// occurrences of any two characters ` `static` `String smallestStr(``char` `[]str, ``int` `n) ` `{ ` ` ``int` `i, j = ``0``; ` ` ` ` ``// To store the first index of ` ` ``// every character of str ` ` ``int` `[]chk = ``new` `int``[MAX]; ` ` ``for` `(i = ``0``; i < MAX; i++) ` ` ``chk[i] = -``1``; ` ` ` ` ``// Store the first occurring ` ` ``// index every character ` ` ``for` `(i = ``0``; i < n; i++) ` ` ``{ ` ` ` ` ``// If current character is appearing ` ` ``// for the first time in str ` ` ``if` `(chk[str[i] - ``'a'``] == -``1``) ` ` ``chk[str[i] - ``'a'``] = i; ` ` ``} ` ` ` ` ``// Starting from the leftmost character ` ` ``for` `(i = ``0``; i < n; i++) ` ` ``{ ` ` ``boolean` `flag = ``false``; ` ` ` ` ``// For every character smaller than str[i] ` ` ``for` `(j = ``0``; j < str[i] - ``'a'``; j++) ` ` ``{ ` ` ` ` ``// If there is a character in str which is ` ` ``// smaller than str[i] and appears after it ` ` ``if` `(chk[j] > chk[str[i] - ``'a'``]) ` ` ``{ ` ` ``flag = ``true``; ` ` ``break``; ` ` ``} ` ` ``} ` ` ` ` ``// If the required character pair is found ` ` ``if` `(flag) ` ` ``break``; ` ` ``} ` ` ` ` ``// If swapping is possible ` ` ``if` `(i < n) ` ` ``{ ` ` ` ` ``// Characters to be swapped ` ` ``char` `ch1 = str[i]; ` ` ``char` `ch2 = (``char``) (j + ``'a'``); ` ` ` ` ``// For every character ` ` ``for` `(i = ``0``; i < n; i++) ` ` ``{ ` ` ` ` ``// Replace every ch1 with ch2 ` ` ``// and every ch2 with ch1 ` ` ``if` `(str[i] == ch1) ` ` ``str[i] = ch2; ` ` ` ` ``else` `if` `(str[i] == ch2) ` ` ``str[i] = ch1; ` ` ``} ` ` ``} ` ` ` ` ``return` `String.valueOf(str); ` `} ` ` ` `// Driver code ` `public` `static` `void` `main(String[] args) ` `{ ` ` ``String str = ``\"ccad\"``; ` ` ``int` `n = str.length(); ` ` ` ` ``System.out.println(smallestStr( ` ` ``str.toCharArray(), n)); ` `} ` `} ` ` ` `// This code is contributed by Princi Singh `\n\n## Python3\n\n `# python3 implementation of the approach ` `MAX``=``256` ` ` `# Function to return the lexicographically ` `# smallest after swapping all the ` `# occurrences of any two characters ` `def` `smallestStr(``str``, n): ` ` ``i, j``=``0``,``0` ` ``# To store the first index of ` ` ``# every character of str ` ` ``chk``=``[``0` `for` `i ``in` `range``(``MAX``)] ` ` ``for` `i ``in` `range``(``MAX``): ` ` ``chk[i] ``=` `-``1` ` ` ` ``# Store the first occurring ` ` ``# index every character ` ` ``for` `i ``in` `range``(n): ` ` ` ` ``# If current character is appearing ` ` ``# for the first time in str ` ` ``if` `(chk[``ord``(``str``[i])] ``=``=` `-``1``): ` ` ``chk[``ord``(``str``[i])] ``=` `i ` ` ` ` ``# Starting from the leftmost character ` ` ``for` `i ``in` `range``(n): ` ` ``flag ``=` `False` ` ` ` ``# For every character smaller than ord(str[i]) ` ` ``for` `j ``in` `range``(``ord``(``str``[i])): ` ` ` ` ``# If there is a character in str which is ` ` ``# smaller than ord(str[i]) and appears after it ` ` ``if` `(chk[j] > chk[``ord``(``str``[i])]): ` ` ``flag ``=` `True` ` ``break` ` ` ` ` ` ``# If the required character pair is found ` ` ``if` `(flag): ` ` ``break` ` ` ` ``# If swapping is possible ` ` ``if` `(i < n): ` ` ` ` ``# Characters to be swapped ` ` ``ch1 ``=` `(``str``[i]) ` ` ``ch2 ``=` `chr``(j) ` ` ` ` ``# For every character ` ` ``for` `i ``in` `range``(n): ` ` ` ` ``# Replace every ch1 with ch2 ` ` ``# and every ch2 with ch1 ` ` ``if` `(``str``[i] ``=``=` `ch1): ` ` ``str``[i] ``=` `ch2 ` ` ` ` ``elif` `(``str``[i] ``=``=` `ch2): ` ` ``str``[i] ``=` `ch1 ` ` ` ` ``return` `\"\".join(``str``) ` ` ` ` ` `# Driver code ` ` ` `st ``=` `\"ccad\"` `str``=``[i ``for` `i ``in` `st] ` `n ``=` `len``(``str``) ` ` ` `print``(smallestStr(``str``, n)) `\n\n## C#\n\n `// C# implementation of the approach ` `using` `System; ` ` ` `class` `GFG ` `{ ` `static` `int` `MAX = 26; ` ` ` `// Function to return the lexicographically ` `// smallest string after swapping all the ` `// occurrences of any two characters ` `static` `String smallestStr(``char` `[]str, ``int` `n) ` `{ ` ` ``int` `i, j = 0; ` ` ` ` ``// To store the first index of ` ` ``// every character of str ` ` ``int` `[]chk = ``new` `int``[MAX]; ` ` ``for` `(i = 0; i < MAX; i++) ` ` ``chk[i] = -1; ` ` ` ` ``// Store the first occurring ` ` ``// index every character ` ` ``for` `(i = 0; i < n; i++) ` ` ``{ ` ` ` ` ``// If current character is appearing ` ` ``// for the first time in str ` ` ``if` `(chk[str[i] - ``'a'``] == -1) ` ` ``chk[str[i] - ``'a'``] = i; ` ` ``} ` ` ` ` ``// Starting from the leftmost character ` ` ``for` `(i = 0; i < n; i++) ` ` ``{ ` ` ``Boolean flag = ``false``; ` ` ` ` ``// For every character smaller than str[i] ` ` ``for` `(j = 0; j < str[i] - ``'a'``; j++) ` ` ``{ ` ` ` ` ``// If there is a character in str which is ` ` ``// smaller than str[i] and appears after it ` ` ``if` `(chk[j] > chk[str[i] - ``'a'``]) ` ` ``{ ` ` ``flag = ``true``; ` ` ``break``; ` ` ``} ` ` ``} ` ` ` ` ``// If the required character pair is found ` ` ``if` `(flag) ` ` ``break``; ` ` ``} ` ` ` ` ``// If swapping is possible ` ` ``if` `(i < n) ` ` ``{ ` ` ` ` ``// Characters to be swapped ` ` ``char` `ch1 = str[i]; ` ` ``char` `ch2 = (``char``) (j + ``'a'``); ` ` ` ` ``// For every character ` ` ``for` `(i = 0; i < n; i++) ` ` ``{ ` ` ` ` ``// Replace every ch1 with ch2 ` ` ``// and every ch2 with ch1 ` ` ``if` `(str[i] == ch1) ` ` ``str[i] = ch2; ` ` ` ` ``else` `if` `(str[i] == ch2) ` ` ``str[i] = ch1; ` ` ``} ` ` ``} ` ` ` ` ``return` `String.Join(``\"\"``, str); ` `} ` ` ` `// Driver code ` `public` `static` `void` `Main(String[] args) ` `{ ` ` ``String str = ``\"ccad\"``; ` ` ``int` `n = str.Length; ` ` ` ` ``Console.WriteLine(smallestStr( ` ` ``str.ToCharArray(), n)); ` `} ` `} ` ` ` `// This code is contributed by Princi Singh `\n\nOutput:\n\n```aacd\n```\n\nAttention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.\n\nMy Personal Notes arrow_drop_up\nRecommended Articles\nPage :"
] |
[
null
] |
{"ft_lang_label":"__label__en","ft_lang_prob":0.6954044,"math_prob":0.9524256,"size":7321,"snap":"2021-04-2021-17","text_gpt3_token_len":2227,"char_repetition_ratio":0.16277163,"word_repetition_ratio":0.54264605,"special_character_ratio":0.3391613,"punctuation_ratio":0.10587382,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.99893445,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2021-01-16T21:10:08Z\",\"WARC-Record-ID\":\"<urn:uuid:a3994126-231f-4823-8287-590ae5875fc1>\",\"Content-Length\":\"183059\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:c512549f-8240-415f-bd5c-24ba8f83427e>\",\"WARC-Concurrent-To\":\"<urn:uuid:7651768a-7fd4-448d-866e-9806f5891303>\",\"WARC-IP-Address\":\"23.199.63.170\",\"WARC-Target-URI\":\"https://www.geeksforgeeks.org/swap-all-occurrences-of-two-characters-to-get-lexicographically-smallest-string/?ref=lbp\",\"WARC-Payload-Digest\":\"sha1:I342EMPVEYZ75YKSZOUUT2KVXJZGIWFV\",\"WARC-Block-Digest\":\"sha1:YBAAK77BU5D7UE7P7PVSHS56Q75WOSHW\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2021/CC-MAIN-2021-04/CC-MAIN-2021-04_segments_1610703507045.10_warc_CC-MAIN-20210116195918-20210116225918-00123.warc.gz\"}"}
|
https://es.mathworks.com/matlabcentral/answers/850700-construct-a-bubble-plot-from-a-matrix
|
[
"# Construct a 'Bubble Plot' from a matrix\n\n36 views (last 30 days)\nHimanshu Saxena on 8 Jun 2021\nCommented: Himanshu Saxena on 16 Jul 2021\nHi,\nI want to generate a bubble plot of a matrix. Such plots are possibe to make in 'R Studio'. I have attached an example image of the desired plot.\nIs there a way to do so in MATLAB?\n\nAdam Danz on 12 Jun 2021\nEdited: Adam Danz on 14 Jun 2021\n> I want to have a sequence of colors corresponding to the the size of circles.\nAssuming an n-by-m matrix r should be plotted such that point r(i,j) should appear at x=i, y=j, use meshgrid to create x and y coordinates and then set x, y, and r to bubbleplot as vectors.\nThe size of the bubbles is defined by |r|and the colors are based r. That way the size of the bubble shows the strength of the correlation and the color shows the direction. That could be switched around, of course.\n% Create correlation matrix r\nrng default % for reproducibility\nr = rand(5)*2-1;\nr(logical(eye(5))) = 1\nr = 5×5\n1.0000 -0.8049 -0.6848 -0.7162 0.3115 0.8116 1.0000 0.9412 -0.1565 -0.9286 -0.7460 0.0938 1.0000 0.8315 0.6983 0.8268 0.9150 -0.0292 1.0000 0.8680 0.2647 0.9298 0.6006 0.9190 1.0000\n% Create x and y coordinates and bubblechart\n[x,y] = meshgrid(1:size(r,1), 1:size(r,2));\nbubblechart(x(:),y(:),abs(r(:)),r(:))\n% Cosmetics\ncolormap('jet')\ngrid on\nset(gca,'xtick', 1:size(r,2), ...\n'ytick', 1:size(r,1), ...\n'YDir', 'Reverse'); % typically corr matrices use flipped y axes\nxlabel('x index')\nylabel('y index')\ncb = colorbar;\nylabel(cb, 'Correlation')\ncaxis([-1,1])",
null,
"See comment below to add text labels to each bubble showing the correlation values.\nHimanshu Saxena on 16 Jul 2021\nHi, I found my error. The error was due to my own understanding of using meshgrid and size(r,1) command.\nIn meshgrid(x,y), length(rows) is y and length(columns) is x.\nIn size(r,1), 1 is for rows and in size(r,2), 2 is for columns.\nthanks\n\nAndres on 8 Jun 2021\nHi,\nbubblechart\nAndres on 12 Jun 2021\nThanks for your reply. Maybe you can give a small example of such a matrix and describe how the bubble plot should look like."
] |
[
null,
"https://www.mathworks.com/matlabcentral/answers/uploaded_files/650830/image.png",
null
] |
{"ft_lang_label":"__label__en","ft_lang_prob":0.78060186,"math_prob":0.9573774,"size":1845,"snap":"2022-05-2022-21","text_gpt3_token_len":510,"char_repetition_ratio":0.10863661,"word_repetition_ratio":0.006430868,"special_character_ratio":0.2823848,"punctuation_ratio":0.14640199,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9901886,"pos_list":[0,1,2],"im_url_duplicate_count":[null,5,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2022-05-23T13:49:06Z\",\"WARC-Record-ID\":\"<urn:uuid:dc5d4df3-e3ef-46c4-840b-41b450796d3f>\",\"Content-Length\":\"193003\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:bdb9c0f6-b2d2-4f28-98d1-633d3c0629c5>\",\"WARC-Concurrent-To\":\"<urn:uuid:ea79c7b4-e13f-4b62-8dbe-0e5d2e080161>\",\"WARC-IP-Address\":\"23.1.9.244\",\"WARC-Target-URI\":\"https://es.mathworks.com/matlabcentral/answers/850700-construct-a-bubble-plot-from-a-matrix\",\"WARC-Payload-Digest\":\"sha1:QPQX5SYNBX5NMMCFWMSHVOWBX4HQXWWQ\",\"WARC-Block-Digest\":\"sha1:I7KD3PZA3MROIJNCWH3LFENYU3SYSV3L\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2022/CC-MAIN-2022-21/CC-MAIN-2022-21_segments_1652662558030.43_warc_CC-MAIN-20220523132100-20220523162100-00269.warc.gz\"}"}
|
https://planetmath.org/subset
|
[
"# subset\n\nGiven two sets $A$ and $B$, we say that $A$ is a subset of $B$ (which we denote as $A\\subseteq B$ or simply $A\\subset B$) if every element of $A$ is also in $B$. That is, the following implication",
null,
"",
null,
"holds:\n\n $x\\in A\\Rightarrow x\\in B.$\n\nThe relation",
null,
"",
null,
"between $A$ and $B$ is then called set inclusion.\n\nSome examples:\n\nThe set $A=\\{d,r,i,t,o\\}$ is a subset of the set $B=\\{p,e,d,r,i,t,o\\}$ because every element of $A$ is also in $B$. That is, $A\\subseteq B$.\n\nOn the other hand, if $C=\\{p,e,d,r,o\\}$, then neither $A\\subseteq C$ (because $t\\in A$ but $t\\not\\in C$) nor $C\\subseteq A$ (because $p\\in C$ but $p\\not\\in A$). The fact that $A$ is not a subset of $C$ is written as $A\\not\\subseteq C$. Similarly, we have $C\\not\\subseteq A$.\n\nIf $X\\subseteq Y$ and $Y\\subseteq X$, it must be the case that $X=Y$.\n\nEvery set is a subset of itself, and the empty set",
null,
"",
null,
"is a subset of every other set. The set $A$ is called a proper subset",
null,
"",
null,
"",
null,
"of $B$, if $A\\subset B$ and $A\\neq B$. In this case, we do not use $A\\subseteq B$.\n\n Title subset Canonical name Subset Date of creation 2013-03-22 11:52:38 Last modified on 2013-03-22 11:52:38 Owner Wkbj79 (1863) Last modified by Wkbj79 (1863) Numerical id 13 Author Wkbj79 (1863) Entry type Definition Classification msc 03-00 Classification msc 00-02 Related topic EmptySet Related topic Superset",
null,
"",
null,
"Related topic TotallyBounded Related topic ProofThatAllSubgroupsOfACyclicGroupAreCyclic Related topic Property2 Related topic CardinalityOfAFiniteSetIsUnique Related topic CriterionOfSurjectivity Defines set inclusion"
] |
[
null,
"http://mathworld.wolfram.com/favicon_mathworld.png",
null,
"http://planetmath.org/sites/default/files/fab-favicon.ico",
null,
"http://mathworld.wolfram.com/favicon_mathworld.png",
null,
"http://planetmath.org/sites/default/files/fab-favicon.ico",
null,
"http://mathworld.wolfram.com/favicon_mathworld.png",
null,
"http://planetmath.org/sites/default/files/fab-favicon.ico",
null,
"http://mathworld.wolfram.com/favicon_mathworld.png",
null,
"http://planetmath.org/sites/default/files/fab-favicon.ico",
null,
"http://planetmath.org/sites/default/files/fab-favicon.ico",
null,
"http://mathworld.wolfram.com/favicon_mathworld.png",
null,
"http://planetmath.org/sites/default/files/fab-favicon.ico",
null
] |
{"ft_lang_label":"__label__en","ft_lang_prob":0.8435832,"math_prob":0.99853426,"size":1221,"snap":"2021-21-2021-25","text_gpt3_token_len":332,"char_repetition_ratio":0.15119146,"word_repetition_ratio":0.06467662,"special_character_ratio":0.28173628,"punctuation_ratio":0.11894273,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.999946,"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\":\"2021-05-14T10:26:27Z\",\"WARC-Record-ID\":\"<urn:uuid:ca8a82b5-2164-40d1-bddf-65a047486bd9>\",\"Content-Length\":\"14169\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:e61defff-a999-4f47-9fd1-ece2217388dc>\",\"WARC-Concurrent-To\":\"<urn:uuid:130f0f6e-ef3f-485f-b1a9-5963271a21af>\",\"WARC-IP-Address\":\"129.97.206.129\",\"WARC-Target-URI\":\"https://planetmath.org/subset\",\"WARC-Payload-Digest\":\"sha1:7DJZOJQSFCVXTNFOAYL2HQFPRK6BU2L5\",\"WARC-Block-Digest\":\"sha1:NL4ZG54S62UMKPCOF42NYOK7M2RMZBSY\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2021/CC-MAIN-2021-21/CC-MAIN-2021-21_segments_1620243990449.41_warc_CC-MAIN-20210514091252-20210514121252-00491.warc.gz\"}"}
|
https://www.1728.org/einstein.htm
|
[
"Mass To Energy Calculator\nFor an energy to mass calculator in which m = E ÷ c², click here",
null,
"Unless you have lived in a cave your entire life, the above formula must be very familiar to you. It was formulated in the Special Theory of Relativity by the German-born American physicist Albert Einstein (1879-1955).\n\n E=mc² has to be the most famous equation of all time. Authors David Bodanis, Pete Moore (and no doubt many more) have each written entire books concerning just this one equation. It is the name of an Internet website. It was shown at the beginning of Twilight Zone television episodes (\"A dimension of mind\" - remember ?) and at the beginning of \"Twilight Zone: The Movie\" (1983). E=mc² was the name of a 1996 film. E=mc² is the title of a Mariah Carey album. Many corporations (computers, graphics, management, etc) use this equation as part of their name.\n\nYou may have wondered what this mysterious equation is all about. It seems that knowing how to use this equation conveys intelligence.\n\nBasically, the equation states that matter and energy are identical. If you could convert a small amount of matter completely, it would yield a tremendous amount of energy. Let's use gasoline as an example. If we burned 3 kilograms of gasoline (about 1.05 US Gallons or 3.97 liters), it would yield 140,000,000 Joules, which is a tremendous amount of energy. However, the burning of gasoline only produces a chemical change.\nNow let's calculate converting those 3 kilograms of gasoline completely into energy. Finally, we will use the legendary\n\nE=mc²\n And the meaning of this equation? The energy (e) of a mass to energy conversion equals the mass (m) that was converted multiplied by the speed of light (c) squared. If we choose mass in kilograms and the speed of light in meters per second, then the answer will be in Joules.\n\nThe mass (from the above example) would be 3 kilograms and the speed of light (c) is 299,792,458 meter per second.\nSo c² = 89,875,517,800,000,000 mtr²/sec² which rounds (for purposes of this discussion) to\n9 x 1016 mtr²/sec².\nSo, the energy equals\n3 kg (mass) x 9 x 1016 mtr²/sec² (c²),\nwhich equals 27 x 1016kg • mtr²/sec²\nwhich equals 2.7 x 1017Joules.\nThis is almost 2 billion times the energy we obtained from the \"ordinary\" burning of 1 gallon of gasoline. (And we all know that is a huge amount of energy).\n\nIt is fascinating and quite intimidating to learn that a matter to energy conversion of just one gram yields the equivalent of 21.5 kilotons of tnt - the energy of the Hiroshima atomic bomb. Yes, all that power is generated from one gram of matter transmuted into energy - the mass of one paper clip!\n\nEvery second, the Sun converts 4.29 x 106 metric tonnes (9.47 x 109 pounds) of matter into 3.86 x 1026 joules of energy. That is a phenomenal amount of energy! Trying to harness all that energy would be a task far beyond our current level of technoogy. Basically, in order to harness all that energy we would have to build a sphere of \"solar collectors\" completely surrounding the Sun at a radius of the Earth's orbit. (called a Dyson Sphere).\nIn order to make those numbers a little easier to visualize, we'll introduce another power unit - the quad. Basically, if we were to express the Sun's total energy output in this unit, it would be about 636,000 quads! In 2015, the total energy used by everyone on Earth, was 575 quads, so it might be a while before we need to harness all of the Sun's energy.\n\nThe calculator below is very easy to use. Input a number, click on the units this represents and you will be shown the amount of energy when that quantity of matter is completely converted to energy.\n\nMass=\n\nSignificant Figures >>>\nNumbers are displayed in scientific notation in the amount of significant figures you specify. For easier readability, numbers between 1,000 and -1,000 will not be in scientific notation but will still have the same precision.\nYou may change the number of significant figures displayed by changing the number in the box above.\nMost browsers, will display the answers properly but if you are seeing no answers at all, enter a zero in the box above, which will eliminate all formatting but at least you will see the answers."
] |
[
null,
"https://www.1728.org/emc2.png",
null
] |
{"ft_lang_label":"__label__en","ft_lang_prob":0.90173703,"math_prob":0.9765727,"size":4240,"snap":"2023-40-2023-50","text_gpt3_token_len":1045,"char_repetition_ratio":0.108120866,"word_repetition_ratio":0.013386881,"special_character_ratio":0.2514151,"punctuation_ratio":0.10630841,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9919225,"pos_list":[0,1,2],"im_url_duplicate_count":[null,1,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2023-12-08T16:57:30Z\",\"WARC-Record-ID\":\"<urn:uuid:d3f1d9f2-2567-429c-a817-8294509847d8>\",\"Content-Length\":\"12098\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:bacbf40a-ac5b-415b-a5e4-ba72653355ac>\",\"WARC-Concurrent-To\":\"<urn:uuid:63860622-adf8-453c-b1c8-d6e9515fec80>\",\"WARC-IP-Address\":\"104.21.13.154\",\"WARC-Target-URI\":\"https://www.1728.org/einstein.htm\",\"WARC-Payload-Digest\":\"sha1:SKHSD6CGMSRA4OWCDCNQQ7PPIB6LGHWD\",\"WARC-Block-Digest\":\"sha1:BKADFGP4RAVQEWG47TCQYRW3QJONWXUM\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2023/CC-MAIN-2023-50/CC-MAIN-2023-50_segments_1700679100762.64_warc_CC-MAIN-20231208144732-20231208174732-00372.warc.gz\"}"}
|
https://calculator.academy/golden-ratio-calculator/
|
[
"Enter any value into the calculator to determine the second value needed to equal the golden ratio. The golden ratio is equal to 1.61803398875.\n\n## Golden Ratio Formula\n\nThe following formula is used to calculate the golden ratio.\n\nG = (A+B)/A = A/B\n\n• Where G is the golden ratio = 1.61803398875\n• A is the larger of two values in a ratio\n• B is the smaller of two value in a ratio\n\n## Golden Ratio Definition\n\nThe golden ratio is a ratio that is equal to 1.61803398875. “In other words, the ratio is the same as the ratio of their sum to the larger of the two quantities.” So A/B = (A+B)/A\n\n## Golden Ratio Example\n\nHow to calculate golden ratio?\n\n1. First, determine the missing variable.\n\nDetermine whether you are solving for A or B in the equation above.\n\n2. Next, determine the known variable.\n\nDetermine the value of the known variable.\n\n3. Finally, calculate the missing variable.\n\nUsing the golden ratio, calculate the missing variable.\n\n## FAQ\n\nWhat is a golden ratio?\n\nA golden ratio is a ratio between two numbers where that ratio is the same as the ratio of their sum to the larger of the two numbers."
] |
[
null
] |
{"ft_lang_label":"__label__en","ft_lang_prob":0.90794873,"math_prob":0.9998462,"size":1059,"snap":"2023-14-2023-23","text_gpt3_token_len":253,"char_repetition_ratio":0.18957347,"word_repetition_ratio":0.13612565,"special_character_ratio":0.25779036,"punctuation_ratio":0.09767442,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":1.0000024,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2023-03-30T21:51:20Z\",\"WARC-Record-ID\":\"<urn:uuid:aea8afa5-8835-4b7a-88d3-a68310412e19>\",\"Content-Length\":\"178233\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:700bdd7e-e007-4dd5-8181-8bfcd7bdb00b>\",\"WARC-Concurrent-To\":\"<urn:uuid:c5a9b92b-eab6-4227-98ab-d8e42cb77fed>\",\"WARC-IP-Address\":\"172.66.42.219\",\"WARC-Target-URI\":\"https://calculator.academy/golden-ratio-calculator/\",\"WARC-Payload-Digest\":\"sha1:TAXLZOX76GOKEAEPAVV2PAGFUZUOLXDG\",\"WARC-Block-Digest\":\"sha1:7APN5JNIW6APJI2QAHYXWZQWH5EBSTVS\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2023/CC-MAIN-2023-14/CC-MAIN-2023-14_segments_1679296949387.98_warc_CC-MAIN-20230330194843-20230330224843-00390.warc.gz\"}"}
|
https://gmatclub.com/forum/if-a-b-and-c-are-consecutive-integers-such-that-a-b-c-is-their-312006.html
|
[
"GMAT Question of the Day: Daily via email | Daily via Instagram New to GMAT Club? Watch this Video\n\n It is currently 29 Jan 2020, 03:30",
null,
"### GMAT Club Daily Prep\n\n#### Thank you for using the timer - this advanced tool can estimate your performance and suggest more practice questions. We have subscribed you to Daily Prep Questions via email.\n\nCustomized\nfor You\n\nwe will pick new questions that match your level based on your Timer History\n\nTrack\n\nevery week, we’ll send you an estimated GMAT score based on your performance\n\nPractice\nPays\n\nwe will pick new questions that match your level based on your Timer History\n\n#### Not interested in getting valuable practice questions and articles delivered to your email? No problem, unsubscribe here.",
null,
"",
null,
"# If a, b, and c are consecutive integers, such that a < b < c, is their\n\nAuthor Message\nTAGS:\n\n### Hide Tags\n\nMath Expert",
null,
"V\nJoined: 02 Sep 2009\nPosts: 60772\nIf a, b, and c are consecutive integers, such that a < b < c, is their [#permalink]\n\n### Show Tags",
null,
"00:00\n\nDifficulty:",
null,
"",
null,
"",
null,
"45% (medium)\n\nQuestion Stats:",
null,
"60% (01:28) correct",
null,
"40% (01:38) wrong",
null,
"based on 42 sessions\n\n### HideShow timer Statistics\n\nIf a, b, and c are consecutive integers, such that a < b < c, is their sum even?\n\n(1) abc = 0\n(2) a + c = 0\n\nAre You Up For the Challenge: 700 Level Questions\n\n_________________\nGMAT Club Legend",
null,
"",
null,
"V\nJoined: 12 Sep 2015\nPosts: 4235\nIf a, b, and c are consecutive integers, such that a < b < c, is their [#permalink]\n\n### Show Tags\n\n1\nTop Contributor\nBunuel wrote:\nIf a, b, and c are consecutive integers, such that a < b < c, is their sum even?\n\n(1) abc = 0\n(2) a + c = 0\n\nAre You Up For the Challenge: 700 Level Questions\n\nGiven: a, b, and c are consecutive integer, such that a < b < c\n\nTarget question: Is a + b + c EVEN?\n\nStatement 1: abc = 0\nThis tells us that a = 0, b = 0 or c = 0\nHere are two possible cases:\nCase a: a = 0, b = 1 and c = 2. In this case, a + b + c = 0 + 1 + 2 = 3 (odd). So, the answer to the target question is NO, a + b + c is NOT even\nCase b: a = -1, b = 0 and c = 1. In this case, a + b + c = -1 + 0 +1 = 0 (even). So, the answer to the target question is YES, a + b + c IS even\nSince we cannot answer the target question with certainty, statement 1 is NOT SUFFICIENT\n\nStatement 2: a + c = 0\nWe already know that a, b, and c are consecutive integers, AND a < b < c\nSo, if a + c = 0, we can be certain that a = -1, b = 0 and c = 1\nIn this case, a + b + c = -1 + 0 + 1 = 0 (even). So, the answer to the target question is YES, a + b + c IS even\nSince we can answer the target question with certainty, statement 2 is SUFFICIENT\n\nCheers,\nBrent\n_________________\n\nOriginally posted by GMATPrepNow on 06 Dec 2019, 07:32.\nLast edited by GMATPrepNow on 09 Dec 2019, 09:19, edited 1 time in total.\nSenior Manager",
null,
"",
null,
"G\nJoined: 16 Feb 2015\nPosts: 282\nLocation: United States\nConcentration: Finance, Operations\nRe: If a, b, and c are consecutive integers, such that a < b < c, is their [#permalink]\n\n### Show Tags\n\n2\nGMATPrepNow wrote:\nBunuel wrote:\nIf a, b, and c are consecutive integers, such that a < b < c, is their sum even?\n\n(1) abc = 0\n(2) a + c = 0\n\nAre You Up For the Challenge: 700 Level Questions\n\nGiven: a, b, and c are consecutive integer, such that a < b < c\n\nTarget question: Is a + b + c EVEN?\n\nStatement 1: abc = 0\nThis tells us that a = 0, b = 0 or c = 0\nHere are two possible cases:\nCase a: a = 0, b = 1 and c = 2. In this case, a + b + c = 0 + 1 + 2 = 3 (odd). So, the answer to the target question is NO, a + b + c is NOT even\nCase b: a = 1, b = 2 and c = 3. In this case, a + b + c = 1 + 2 +3 = 5 (even). So, the answer to the target question is YES, a + b + c IS even\nSince we cannot answer the target question with certainty, statement 1 is NOT SUFFICIENT\n\nStatement 2: a + c = 0\nWe already know that a, b, and c are consecutive integers, AND a < b < c\nSo, if a + c = 0, we can be certain that a = -1, b = 0 and c = 1\nIn this case, a + b + c = -1 + 0 + 1 = 0 (even). So, the answer to the target question is YES, a + b + c IS even\nSince we can answer the target question with certainty, statement 2 is SUFFICIENT\n\nCheers,\nBrent\n\nDear GMATPrepNow ,\nIn Statement 1, It is given : abc=0\nIn your case b, You have taken values,a = 1, b = 2 and c = 3 Which cannot be Zero, if we multiply them.\nHope you Got my point, Pls explain if i'm wrong.\n\nRegards,\nRajat Chopra\nGMAT Club Legend",
null,
"",
null,
"V\nJoined: 12 Sep 2015\nPosts: 4235\nRe: If a, b, and c are consecutive integers, such that a < b < c, is their [#permalink]\n\n### Show Tags\n\nTop Contributor\nrajatchopra1994 wrote:\nDear GMATPrepNow ,\nIn Statement 1, It is given : abc=0\nIn your case b, You have taken values,a = 1, b = 2 and c = 3 Which cannot be Zero, if we multiply them.\nHope you Got my point, Pls explain if i'm wrong.\n\nRegards,\nRajat Chopra\n\nOops, the catch!\nI've edited my response accordingly.\nKudos for you!!!!\n\nCheers,\nBrent\n_________________",
null,
"Re: If a, b, and c are consecutive integers, such that a < b < c, is their [#permalink] 09 Dec 2019, 09:20\nDisplay posts from previous: Sort by\n\n# If a, b, and c are consecutive integers, such that a < b < c, is their",
null,
"",
null,
"",
null,
""
] |
[
null,
"https://cdn.gmatclub.com/cdn/files/forum/styles/gmatclub_light/theme/images/profile/close.png",
null,
"https://cdn.gmatclub.com/cdn/files/forum/styles/gmatclub_light/theme/images/profile/close.png",
null,
"https://gmatclub.com/forum/styles/gmatclub_light/theme/images/search/close.png",
null,
"https://cdn.gmatclub.com/cdn/files/forum/images/avatars/upload/avatar_73391.jpg",
null,
"https://cdn.gmatclub.com/cdn/files/forum/styles/gmatclub_light/theme/images/viewtopic/timer_play.png",
null,
"https://cdn.gmatclub.com/cdn/files/forum/styles/gmatclub_light/theme/images/viewtopic/timer_difficult_blue.png",
null,
"https://cdn.gmatclub.com/cdn/files/forum/styles/gmatclub_light/theme/images/viewtopic/timer_difficult_blue.png",
null,
"https://cdn.gmatclub.com/cdn/files/forum/styles/gmatclub_light/theme/images/viewtopic/timer_difficult_grey.png",
null,
"https://cdn.gmatclub.com/cdn/files/forum/styles/gmatclub_light/theme/images/viewtopic/timer_separator.png",
null,
"https://cdn.gmatclub.com/cdn/files/forum/styles/gmatclub_light/theme/images/viewtopic/timer_separator.png",
null,
"https://cdn.gmatclub.com/cdn/files/forum/styles/gmatclub_light/theme/images/viewtopic/timer_separator.png",
null,
"https://cdn.gmatclub.com/cdn/files/forum/images/ranks/rank_phpbb_7.svg",
null,
"https://cdn.gmatclub.com/cdn/files/forum/images/avatars/upload/avatar_539154.png",
null,
"https://cdn.gmatclub.com/cdn/files/forum/images/ranks/rank_phpbb_4.svg",
null,
"https://cdn.gmatclub.com/cdn/files/forum/images/no_avatar.svg",
null,
"https://cdn.gmatclub.com/cdn/files/forum/images/ranks/rank_phpbb_7.svg",
null,
"https://cdn.gmatclub.com/cdn/files/forum/images/avatars/upload/avatar_539154.png",
null,
"https://cdn.gmatclub.com/cdn/files/forum/styles/gmatclub_light/theme/images/viewtopic/posts_bot.png",
null,
"https://gmatclub.com/forum/cron.php",
null,
"https://www.facebook.com/tr",
null,
"https://www.googleadservices.com/pagead/conversion/1071875456/",
null
] |
{"ft_lang_label":"__label__en","ft_lang_prob":0.8972373,"math_prob":0.9882564,"size":3238,"snap":"2019-51-2020-05","text_gpt3_token_len":995,"char_repetition_ratio":0.14904143,"word_repetition_ratio":0.7286296,"special_character_ratio":0.3350834,"punctuation_ratio":0.16015625,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.994052,"pos_list":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42],"im_url_duplicate_count":[null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2020-01-29T10:30:06Z\",\"WARC-Record-ID\":\"<urn:uuid:45791ac5-5625-4a7f-b0ea-717ced125188>\",\"Content-Length\":\"873113\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:e1ee39f3-c133-41d4-93e7-9e43ed6fc0b9>\",\"WARC-Concurrent-To\":\"<urn:uuid:c986c426-ba12-4001-92da-f3591b7bcca1>\",\"WARC-IP-Address\":\"198.11.238.99\",\"WARC-Target-URI\":\"https://gmatclub.com/forum/if-a-b-and-c-are-consecutive-integers-such-that-a-b-c-is-their-312006.html\",\"WARC-Payload-Digest\":\"sha1:YRAO2MTC5BBMXYMSOIIQAWKJC7UMJRUA\",\"WARC-Block-Digest\":\"sha1:TQBDPJ4VIVBL7734JOANTQMANS3E4AJG\",\"WARC-Identified-Payload-Type\":\"application/xhtml+xml\",\"warc_filename\":\"/cc_download/warc_2020/CC-MAIN-2020-05/CC-MAIN-2020-05_segments_1579251796127.92_warc_CC-MAIN-20200129102701-20200129132701-00178.warc.gz\"}"}
|
http://www.examphysics.com/2014/09/alternating-current.html
|
[
"## Wednesday, 17 September 2014\n\n### ALTERNATING CURRENT\n\n1. Obtain an expression for resonant frequency fo of a L.C.R series resonance circuit.\n2. Obtain the relation i=io sin(wt - B/2) for a pure inductor connected across A.C voltage\nE= Eo Sinwt.\n3. Obtain the relation i=io sin(wt + B/2) for a pure capacitor connected across A.C voltage\nE= Eo Sinwt.\n4. Show that average power consumed in A. C ciruit is\nP= E rms x I rms x cos M\n5. A Sinusoidal voltage V = 200 sin 314t is applied to a 10ohm resistor.\nFind a) frequency of the supply (50Hz)\nb) Pear voltage (200 V)\nc) rms voltage ( 141.4 V)\nd) rms current ( 14.14 A)\ne) power dissipated ( 2000 W)"
] |
[
null
] |
{"ft_lang_label":"__label__en","ft_lang_prob":0.6725093,"math_prob":0.94225687,"size":592,"snap":"2020-45-2020-50","text_gpt3_token_len":197,"char_repetition_ratio":0.10714286,"word_repetition_ratio":0.07079646,"special_character_ratio":0.3260135,"punctuation_ratio":0.11510792,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9871843,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2020-12-04T13:36:19Z\",\"WARC-Record-ID\":\"<urn:uuid:c1301091-4dfa-41c7-a4e0-00688ddc90c7>\",\"Content-Length\":\"52620\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:ff8e9112-4d08-4893-8c8c-b23f93367726>\",\"WARC-Concurrent-To\":\"<urn:uuid:716e84cb-1b8c-4791-a1fd-07ce1d4a0379>\",\"WARC-IP-Address\":\"142.250.73.243\",\"WARC-Target-URI\":\"http://www.examphysics.com/2014/09/alternating-current.html\",\"WARC-Payload-Digest\":\"sha1:IIUEGM46N3KS75QYELUT3TD7U4ZQLSBG\",\"WARC-Block-Digest\":\"sha1:OFA7GQM7P3FTV7Z3MKWX65OKCLN46MHH\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2020/CC-MAIN-2020-50/CC-MAIN-2020-50_segments_1606141737946.86_warc_CC-MAIN-20201204131750-20201204161750-00202.warc.gz\"}"}
|
https://attacomsian.com/blog/nodejs-encrypt-decrypt-data
|
[
"Node.js provides a built-in module called `crypto` that you can use to encrypt and decrypt strings, numbers, buffers, streams, and more. This module offers cryptographic functionality that includes a set of wrappers for OpenSSL's hash, HMAC, cipher, decipher, sign, and verify functions.\n\nIn this article, you'll learn how to use Node.js `crypto` module to perform cryptographic operations on data. I'll show you how to encrypt data with a secret key and then decrypt it using the same secret key when required.\n\nFor the sake of simplicity, I am going to use AES (Advanced Encryption System) algorithm CTR encryption mode. Here is a good discussion on StackOverflow for choosing the right AES encryption mode.\n\n## Create a new project\n\nCreate a new directory in your local file system and switch to it by typing the following:\n\n``````\\$ mkdir crypto && cd crypto\n``````\n\nNow execute the following command to initialize a new Node.js project:\n\n``````\\$ npm init -y\n``````\n\nThe above command will create a new `package.json` file in the root directory. Make sure that you have already installed Node.js on your machine before issuing the above command.\n\nBy default, the `crypto` module is already included in pre-built Node.js binaries. But if you have manually installed Node.js, `crypto` may not be shipped with it. However, you can install it by executing the following command:\n\n``````\\$ npm install crypto --save\n``````\n\n## Encrypt and decrypt text\n\nLet us create the `crypto.js` file in project's root directory and define our encryption and decryption functions as shown below:\n\ncrpyto.js\n\n``````const crypto = require('crypto');\n\nconst algorithm = 'aes-256-ctr';\nconst secretKey = 'vOVH6sdmpNWjRRIqCc7rdxs01lwHzfr3';\nconst iv = crypto.randomBytes(16);\n\nconst encrypt = (text) => {\n\nconst cipher = crypto.createCipheriv(algorithm, secretKey, iv);\n\nconst encrypted = Buffer.concat([cipher.update(text), cipher.final()]);\n\nreturn {\niv: iv.toString('hex'),\ncontent: encrypted.toString('hex')\n};\n};\n\nconst decrypt = (hash) => {\n\nconst decipher = crypto.createDecipheriv(algorithm, secretKey, Buffer.from(hash.iv, 'hex'));\n\nconst decrpyted = Buffer.concat([decipher.update(Buffer.from(hash.content, 'hex')), decipher.final()]);\n\nreturn decrpyted.toString();\n};\n\nmodule.exports = {\nencrypt,\ndecrypt\n};\n``````\n\nThe following example demonstrates that how you can encrypt and decrypt text data (strings, numbers, etc.) by using the above functions:\n\ncrpyto-text.js\n\n``````const { encrypt, decrypt } = require('./crypto');\n\nconst hash = encrypt('Hello World!');\n\nconsole.log(hash);\n\n// {\n// iv: '237f306841bd23a418878792252ff6c8',\n// content: 'e2da5c6073dd978991d8c7cd'\n// }\n\nconst text = decrypt(hash);\n\nconsole.log(text); // Hello World!\n``````\n\n## Encrypt and decrypt buffers\n\nYou can also encrypt and decrypt buffers by using the functions defined above. Just pass the buffer in place of the string and it should work:\n\ncrpyto-buffer.js\n\n``````const { encrypt, decrypt } = require('./crypto');\n\nconst hash = encrypt(Buffer.from('Hello World!', 'utf8'));\n\nconsole.log(hash);\n\n// {\n// iv: '692e44dbbea073fc1a8d1c37ea68dffa',\n// content: 'bbffd902d55d7a00f3a0504e'\n// }\n\nconst text = decrypt(hash);\n\nconsole.log(text); // Hello World!\n``````\n\n## Encrypt and decrypt streams\n\nYou can also encrypt and decrypt streams by using the `crypto` module as shown in the following example:\n\ncrpyto-stream.js\n\n``````const crypto = require('crypto');\nconst fs = require('fs');\n\nconst algorithm = 'aes-256-ctr';\nconst secretKey = 'vOVH6sdmpNWjRRIqCc7rdxs01lwHzfr3';\nconst iv = crypto.randomBytes(16);\n\n// input file\n\n// encrypt content\nconst encrypt = crypto.createCipheriv(algorithm, secretKey, iv);\n\n// decrypt content\nconst decrypt = crypto.createDecipheriv(algorithm, secretKey, iv);\n\n// write file\nconst w = fs.createWriteStream('file.out.txt');\n\n// start pipe\nr.pipe(encrypt)\n.pipe(decrypt)\n.pipe(w);\n``````"
] |
[
null
] |
{"ft_lang_label":"__label__en","ft_lang_prob":0.6931831,"math_prob":0.76578116,"size":4247,"snap":"2020-45-2020-50","text_gpt3_token_len":1001,"char_repetition_ratio":0.15225077,"word_repetition_ratio":0.094915256,"special_character_ratio":0.25076523,"punctuation_ratio":0.2007722,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.95899534,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2020-10-27T06:09:35Z\",\"WARC-Record-ID\":\"<urn:uuid:21684ce9-9fd5-45bf-b2f2-38770d5ce10c>\",\"Content-Length\":\"129540\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:53db4bcb-9c16-4502-b791-4c2fd9e54bf6>\",\"WARC-Concurrent-To\":\"<urn:uuid:1b79b38e-6a75-4362-bb22-194922ba5a1f>\",\"WARC-IP-Address\":\"104.27.151.116\",\"WARC-Target-URI\":\"https://attacomsian.com/blog/nodejs-encrypt-decrypt-data\",\"WARC-Payload-Digest\":\"sha1:JNOH4OCYPHXNGTES2JVZOBGSITRZTMYH\",\"WARC-Block-Digest\":\"sha1:NIDDR4OZMZVNDIYK6IDLJSF2BR6MZYIM\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2020/CC-MAIN-2020-45/CC-MAIN-2020-45_segments_1603107893402.83_warc_CC-MAIN-20201027052750-20201027082750-00367.warc.gz\"}"}
|
http://everyscience.com/Chemistry/Physical/Phases/e.1126.php
|
[
"# Phase Boundaries\n\nThe phase boundaries are defined by the fact that they represent the precise conditions of temperature and pressure under which the chemical potentials of the two phases on either side of the boundary are equal. Therefore it is possible to construct equations for the phase boundaries by setting the chemical potentials of the two phases (which are themselves functions of temperature and pressure) equal to each other, and manipulating the resulting expression to give p in terms of T. (In fact, it turns out to be simpler to discuss phase boundaries in terms of their slopes dp/dT.)\n\nWe consider a situation where two phases, α and β, are in equilibrium. We can immediately say that they have the same chemical potential. When conditions of pressure and temperature are changed to those of another point on the phase boundary, the chemical potentials of both phases change. However, since the final conditions lie on the phase boundary, the chemical potentials of the two phases must again be equal to each other, and thus the change in chemical potential must be the same for both phases. i.e. dμα = dμβ . From the definition of chemical potential for a pure species (μ = Gm) we know that for each phase dμ = -Sm dT + Vm dp. Equating the changes in chemical potential for the two phases, we obtain:\n\n– Sα,m dT + Vα,m dp = – Sβ,m dT + Vβ,m dp\n\nwhich rearranges to\n\n(Vβ,m – Vα,m) dp = (Sβ,m – Sα,m) dT\n\nfrom which we may simply obtain the Clapeyron equation:\n\n(In this expression ΔStrs and ΔVtrs are the changes in molar entropy and molar volume respectively that accompany a change of phase.)"
] |
[
null
] |
{"ft_lang_label":"__label__en","ft_lang_prob":0.92748386,"math_prob":0.99579805,"size":1588,"snap":"2022-05-2022-21","text_gpt3_token_len":356,"char_repetition_ratio":0.16287878,"word_repetition_ratio":0.06834532,"special_character_ratio":0.21284635,"punctuation_ratio":0.1,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.99333704,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2022-05-21T18:05:48Z\",\"WARC-Record-ID\":\"<urn:uuid:b2f421a0-81a5-477d-b5e2-9cc1a62ce4f6>\",\"Content-Length\":\"57958\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:c2ec8b0d-e162-49e4-9f78-dd50549ad260>\",\"WARC-Concurrent-To\":\"<urn:uuid:8a06b7d7-1992-46f6-b0de-655c52241e27>\",\"WARC-IP-Address\":\"172.67.186.24\",\"WARC-Target-URI\":\"http://everyscience.com/Chemistry/Physical/Phases/e.1126.php\",\"WARC-Payload-Digest\":\"sha1:UWMZBI5IXIVS6QPFHUDDU2TJF36PTYHX\",\"WARC-Block-Digest\":\"sha1:7QGSYYCSDHIIA3O4Q57HFBH7LHCT7GUU\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2022/CC-MAIN-2022-21/CC-MAIN-2022-21_segments_1652662540268.46_warc_CC-MAIN-20220521174536-20220521204536-00547.warc.gz\"}"}
|
https://www.numberempire.com/24028
|
[
"Home | Menu | Get Involved | Contact webmaster",
null,
"",
null,
"",
null,
"",
null,
"",
null,
"# Number 24028\n\ntwenty four thousand twenty eight\n\n### Properties of the number 24028\n\n Factorization 2 * 2 * 6007 Divisors 1, 2, 4, 6007, 12014, 24028 Count of divisors 6 Sum of divisors 42056 Previous integer 24027 Next integer 24029 Is prime? NO Previous prime 24023 Next prime 24029 24028th prime 274867 Is a Fibonacci number? NO Is a Bell number? NO Is a Catalan number? NO Is a factorial? NO Is a regular number? NO Is a perfect number? NO Polygonal number (s < 11)? NO Binary 101110111011100 Octal 56734 Duodecimal 11aa4 Hexadecimal 5ddc Square 577344784 Square root 155.00967711727 Natural logarithm 10.08697509597 Decimal logarithm 4.3807176232753 Sine 0.89092838672424 Cosine 0.45414382053369 Tangent 1.9617758657979\nNumber 24028 is pronounced twenty four thousand twenty eight. Number 24028 is a composite number. Factors of 24028 are 2 * 2 * 6007. Number 24028 has 6 divisors: 1, 2, 4, 6007, 12014, 24028. Sum of the divisors is 42056. Number 24028 is not a Fibonacci number. It is not a Bell number. Number 24028 is not a Catalan number. Number 24028 is not a regular number (Hamming number). It is a not factorial of any number. Number 24028 is a deficient number and therefore is not a perfect number. Binary numeral for number 24028 is 101110111011100. Octal numeral is 56734. Duodecimal value is 11aa4. Hexadecimal representation is 5ddc. Square of the number 24028 is 577344784. Square root of the number 24028 is 155.00967711727. Natural logarithm of 24028 is 10.08697509597 Decimal logarithm of the number 24028 is 4.3807176232753 Sine of 24028 is 0.89092838672424. Cosine of the number 24028 is 0.45414382053369. Tangent of the number 24028 is 1.9617758657979\n\n### Number properties\n\nExamples: 3628800, 9876543211, 12586269025"
] |
[
null,
"https://www.numberempire.com/images/graystar.png",
null,
"https://www.numberempire.com/images/graystar.png",
null,
"https://www.numberempire.com/images/graystar.png",
null,
"https://www.numberempire.com/images/graystar.png",
null,
"https://www.numberempire.com/images/graystar.png",
null
] |
{"ft_lang_label":"__label__en","ft_lang_prob":0.5876848,"math_prob":0.9741656,"size":2114,"snap":"2020-34-2020-40","text_gpt3_token_len":699,"char_repetition_ratio":0.18436019,"word_repetition_ratio":0.046242774,"special_character_ratio":0.4295175,"punctuation_ratio":0.14248021,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.99492115,"pos_list":[0,1,2,3,4,5,6,7,8,9,10],"im_url_duplicate_count":[null,null,null,null,null,null,null,null,null,null,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2020-10-01T13:16:43Z\",\"WARC-Record-ID\":\"<urn:uuid:a3dfa490-8cd6-4315-82b0-843b4372ce87>\",\"Content-Length\":\"21322\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:7fbed556-7ce3-44c5-961e-b3a18621fff7>\",\"WARC-Concurrent-To\":\"<urn:uuid:23a3213e-e59a-4887-9569-3d7e52572734>\",\"WARC-IP-Address\":\"104.24.112.69\",\"WARC-Target-URI\":\"https://www.numberempire.com/24028\",\"WARC-Payload-Digest\":\"sha1:GHX5XYVPV2QAS2IV36PUVUM242VAM7YQ\",\"WARC-Block-Digest\":\"sha1:PWNSKQBSUJAPSTT4LW46J6KS55ZVGZCA\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2020/CC-MAIN-2020-40/CC-MAIN-2020-40_segments_1600402131412.93_warc_CC-MAIN-20201001112433-20201001142433-00220.warc.gz\"}"}
|
https://programming.vip/docs/data-structure-experiment-9-sorting-algorithm.html
|
[
"Data structure experiment 9 (sorting algorithm)\n\nOf course, this is also the last experiment of data structure. It has brought us deep thinking through the previous 9 experiments. Now it should be greatly improved for programming algorithms and very good for problem solving. I think now for me, the programming ability has made a qualitative leap. Thank you for this data structure course, which makes me understand a lot! Of course, the later course \"algorithm design and analysis\" is also very important (although many majors do not open it, it seems that it is only opened in software engineering, so it needs self-study). It is another breakthrough in programming ability. I also hope that students who have completed this course can also learn the course of algorithm. Recommended textbook: Li Chunbao, \"algorithm design and analysis (Second Edition)\" , Tsinghua University Press.\nFinally, summarize the previous data structure experiments!\nExperiment 1 Application of linked list (city information)\nApplication of Experiment 2 stack (purchase information)\nExperimental algorithm of triple binary tree (recursive and non recursive)\nExperiment 4 Huffman coding\nExperiment 6 AOE critical path\nExperiment 7 search application (name search)\nExperiment 8 search algorithm (balanced binary tree + Hash)\n\nThis data structure experiment is about 7 sorting algorithms. I recommend quick sorting and heap sorting. These two sorting methods are also the sorting methods of C++ STL sort function. Here are the performance comparison of various sorting methods. At present, six sorting algorithms have been sorted out, among which the cardinality sorting will be updated later. Let me slow down! I have to do level 6 tomorrow\nBaidu network disk extraction algorithm test code Extraction code: ss6l\n\nSorting methodAverage time complexitySecondary storage space\nSimple sort O ( n 2 ) O(n^{2}) O(n2)O(1)\nQuick sort O ( n log n ) O(n\\log_{}{n} ) O(nlogn)O(log(n)\nHeap sort O ( n log n ) O(n\\log_{}{n} ) O(nlogn)O(1)\nMerge sort O ( n log n ) O(n\\log_{}{n} ) O(nlogn)O(n)\nCardinality sortO(d(n+rd))O(rd)\n\nFirst, the structure code is given\n\ntypedef struct{\nint key;\n}RecordList;\n\nDetailed comments are attached to the following codes, so no explanation is given, only the most refined language is given!\nYour third company is the biggest driving force for my creation!\n\nDirect insert sort\n\nDirect insertion, how do you think, is to sort with the previous number from the second number, and then change the position.\n\nvoid InsertSort(RecordList r[],int n){\nfor(int i=2;i<=n;i++){\n//Why do i start with 2 because i=1 doesn't have to be sorted\ncount++;//Count each trip\nr=r[i];//Set sentinel and put the to be sorted in r\nint j=i-1;//j represents the position that has been sorted previously\nwhile(r.key<r[j].key){\n//Sort from small to large here\n//Move j backward, because it has been sorted in front, so it stops when it is greater than\nr[j+1]=r[j];\nj--;\n}\nr[j+1]=r;//Now insert the sentry into the j+1 position\n//Now perform the output of each trip\ncout<<\"The first\"<<count<<\"Trip sort:\";\nfor(int k=1;k<=n;k++){\ncout<<r[k].key<<\" \";\n}\ncout<<endl;\n}\n}\n\nBubble sorting\n\nHow small the bubble is, it is very simple, that is, select the smallest one in the ith position (i=1,2... n) in each trip\n\nvoid BubbleSort(RecordList r[],int n){\nbool change=true;//Set flag so you don't have to do useless loops\nfor(int i=1;i<=n-1&&change;i++){\ncount++;\nchange=false;//If you have finished sorting, it will become false and jump out in the next cycle\n//But I don't think it's enough to let j start from i+1?\nfor(int j=1;j<=n-1;j++){\nif(r[j].key>r[j+1].key){\nswap(r[j],r[j+1]);\nchange=true;\n}\n}\n//Now perform the output of each trip\ncout<<\"The first\"<<count<<\"Trip sort:\";\nfor(int k=1;k<=n;k++){\ncout<<r[k].key<<\" \";\n}\ncout<<endl;\n}\n}\n\nQuick sort\n\nHow do you think about quick sorting? First select a benchmark, which is generally the first number, and then sort from right and left. Pay attention to starting from right, then encounter something smaller than the benchmark, then start from left, encounter something larger than the benchmark, and then exchange the newly selected ones until the middle. At this time, a benchmark has been completed, and then divide and conquer recursion can be used.\n\n//One quick sort process\nint QKPass(RecordList r[],int low,int high){\ncount++;\n//Divide r[low] and r[high] to obtain the reference position\nRecordList x=r[low];//Now start with low and save it in X, that is, x will be used as the benchmark to divide the array. The smaller one is on the left and the larger one is on the left\n//The key step is to start with pointer j and then i\nwhile(low<high){\nwhile(low<high&&r[high].key>=x.key){\nhigh--;\n}\n//Why does low < high appear here every time, because each adjustment needs to see whether the benchmark is in place. If not, adjust it\nif(low<high){\nr[low]=r[high];\nlow++;\n}\nwhile(low<high&&r[low].key<x.key){\nlow++;\n}\nif(low<high){\nr[high]=r[low];\nhigh--;\n}\n}\nr[low]=x;\n//Now perform the output of each trip\ncout<<\"The first\"<<count<<\"Trip sort:\";\nfor(int k=1;k<=N;k++){\ncout<<r[k].key<<\" \";\n}\ncout<<endl;\nreturn low;\n}\n\nvoid QuickSort(RecordList r[],int low,int high){\nif(low<high){\nint pos=QKPass(r,low,high);\n//Sorting by divide and conquer actually has a taste similar to Hill sorting\nQuickSort(r,low,pos-1);\nQuickSort(r,pos+1,high);\n}\n}\n\nSelect sort\n\nWhat do you think of sorting? In short, it is to select the smallest one on the left. The idea is similar to bubble sorting, but bubble is a number to the end, and selection sorting is the exchange of adjacent numbers.\n\nvoid SelectSort(RecordList r[],int n){\nfor(int i=1;i<=n-1;i++){\n//Why start with 1? Unlike insertion sorting, start with 2, because i=1 also needs to choose the smallest one in the first place\ncount++;\nint k=i;//Save the location at this time i\nfor(int j=i+1;j<=n;j++){\n//Different from bubble sorting, j starts from i+1, because the previous ones have been sorted, so only the latter ones need to be sorted\nif(r[j].key<r[k].key){\nk=j;//If the following is smaller than the i-th bit at this time, the position of j at this time is saved\n}\n}\nif(k!=i){\nswap(r[i],r[k]);\n}\n//Now perform the output of each trip\ncout<<\"The first\"<<count<<\"Trip sort:\";\nfor(int k=1;k<=N;k++){\ncout<<r[k].key<<\" \";\n}\ncout<<endl;\n}\n}\n\nHeap sort\n\nWhat do you think of heap sorting? First of all, you should have the basic knowledge of binary tree, especially hierarchical traversal. Only when you know the child parent array of binary tree can you understand the creation of algorithm. Note that the essence is to select the parent node from left to right, and then treat the root node as the bottom of the heap.\n\n//Screening method: change one heap\nvoid sift(RecordList r[],int k,int m){\n//This is a binary tree array traversed hierarchically. r[k] is the root, r[2k] left and r[2k+1] right. Why? Reference binary tree child parent storage\nRecordList t=r[k];//Where to save the root\nint x=r[k].key;\nint i=k;//Save the position i of pointer k\nint j=2*i;//Note that it only refers to the left subtree of i, traversing from left to right first\nbool finished=false;//Why set flag, similar to bubbling, to avoid invalid and redundant loops\nwhile(j<m&&!finished){\n//What is m? M is the bottom of the pile\n//First, compare the left and right subtrees. If the size of the left and right subtrees is different, the pointer changes to a right subtree\nif(j<m&&r[j].key<r[j+1].key) j++;\n//true if the parent node is larger than the child node, otherwise the location will be exchanged. Note that this is a change\nif(x>=r[j].key) finished=true;\nelse{\nr[i]=r[j];\ni=j;\nj=2*i;\n}\n}\n//Insert t into the i position at this time. If it is not changed, it will still be the original position. If it is changed, it will be converted\nr[i]=t;\n}\n\n//Build heap algorithm\nvoid crt_heap(RecordList r[],int n){\nfor(int i=n/2;i>=1;--i){\n//Why start with n/2? Binary tree. The textbook takes the middle order traversal as the root. It needs to be changed every time\nsift(r,i,n);\n}\n}\n\n//For heap sorting, the first two steps are preliminary work, which is equivalent to changing all root nodes every time\nvoid HeapSort(RecordList r[],int n){\ncrt_heap(r,n);\nfor(int i=n;i>2;i--){\ncount++;\nRecordList b=r;//First position\nr=r[i];\nr[i]=b;\nsift(r,1,i-1);\n//Now perform the output of each trip\ncout<<\"The first\"<<count<<\"Trip sort:\";\nfor(int k=1;k<=N;k++){\ncout<<r[k].key<<\" \";\n}\ncout<<endl;\n}\n}\n\nMerge sort\n\nWhat do you think of merging and sorting? Do you feel Hill sort? It feels incremental. This is the essence of splitting from the middle, sorting, and merging one by one.\n\nvoid Merge(RecordList r1[],int low,int mid,int high,RecordList r[]){\ncount++;\n//Merge from the middle, and save r1[low..mid] and r1[mid+1...high] permutations in r []\nint i=low,j=mid+1,k=low;//k as the low bit of r\nwhile((i<=mid)&&(j<=high)){\n//Divide into two paths from the middle, and then sort the two paths\nif(r1[i].key<=r1[j].key){\n//If it is smaller than the middle, it is placed in r[low]\nr[k]=r1[i];\ni++;\n}\nelse{\nr[k]=r1[j];\nj++;\n}\nk++;//r [] traversal creation\n}\nwhile(i<=mid){\nr[k]=r1[i];\nk++;\ni++;\n}\nwhile(j<=high){\nr[k]=r1[j];\nk++;\nj++;\n}\n}\n\nvoid MergeSort(RecordList r1[],int low,int high,RecordList r[]){\n//After sorting, it is placed in r [] and r2 is used as the auxiliary space\ncount++;\nRecordList *r2;\nr2=new RecordList[high-low+1];\nif(low==high) r[low]=r1[low];\nelse{\nint mid=(low+high)/2;\nMergeSort(r1,low,mid,r2);\nMergeSort(r1,mid+1,high,r2);\nMerge(r2,low,mid,high,r);\n}\ndelete r2;\n}\n\nsummary\n\nThe above sorting algorithms are the most basic algorithms. Of course, the sorting algorithm can be further optimized. There is time to come up with an optimization algorithm. These algorithms are the basic skills of data structure. Although it is easy to understand, the code implementation is still difficult, especially in fast, merging and heap sorting. For the understanding of sorting, I feel that we should pay attention to the characteristics of grasping the pointer (position), and when to change the position and when to exchange.\n\nKeywords: Algorithm data structure\n\nAdded by Peredy on Fri, 17 Dec 2021 20:41:49 +0200"
] |
[
null
] |
{"ft_lang_label":"__label__en","ft_lang_prob":0.8227308,"math_prob":0.9591726,"size":10149,"snap":"2022-05-2022-21","text_gpt3_token_len":2650,"char_repetition_ratio":0.114637755,"word_repetition_ratio":0.06286081,"special_character_ratio":0.27815548,"punctuation_ratio":0.14382632,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9968878,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2022-01-21T02:05:33Z\",\"WARC-Record-ID\":\"<urn:uuid:0dd58aff-4e09-4a98-b966-7f9542d485c5>\",\"Content-Length\":\"20742\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:e16e8d2e-3d3d-4a91-9ab9-370684fdf2b7>\",\"WARC-Concurrent-To\":\"<urn:uuid:d0471c5b-77d6-4f79-9a16-bc10735e2ea6>\",\"WARC-IP-Address\":\"185.218.125.0\",\"WARC-Target-URI\":\"https://programming.vip/docs/data-structure-experiment-9-sorting-algorithm.html\",\"WARC-Payload-Digest\":\"sha1:MTVVBP7GGTOP2BSBAZ23OQI3IUKVQMX4\",\"WARC-Block-Digest\":\"sha1:2BO54LOQPD4FN6FQFG2BNLRB4DDWICPL\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2022/CC-MAIN-2022-05/CC-MAIN-2022-05_segments_1642320302715.38_warc_CC-MAIN-20220121010736-20220121040736-00343.warc.gz\"}"}
|
http://tuabiht.chez-alice.fr/PovEdge_Site/howitworks.html
|
[
"PovEdge\n\nA simple tool to draw the edges of your mesh objects in PovRay\n\nContact :\ntuabihtucl at yahoo dot fr\n\nPovEdge computes two different types of edges: Silhouette edges and Crease edges.\n\n1) Silhouette edges give the outline of the object. This of course depends on the point of view on the object, as the outline is the border between the part of the object which is visible, and the part which is hidden. As visible faces have a normal which points towards the viewer, while the hidden faces have a normal which points away from the viewer, PovEdge determines if an edge is part of the silhouette by comparing the relative orientations of the two faces sharing this edge with respect to the vector joining the point of view to the edge. Mathematically, PovEdge computes the scalar product of each normal vector with this vector, and if the signs of these two scalar products are different, then the edge is part of the silhouette.\n\n2) Crease edges show the abrupt changes of orientations in the object (think of the edge of a cube for example). These edges are an intrinsic property of the object, and do not depend on the point of view. To determine if a given edge is part of a crease, PovEdge simply compares the orientation of the two faces sharing this edge. If the orientations of the normals differ by more than a given threshold, then this edge is part of a crease. Mathematically, PovEdge simply compute the scalar product between the two normal vectors, and checks whether it is larger than a given threshold.\n\nNote that, in order to perform these calculations, one needs to know what the two faces which share a given edge are, and this of course for all the edges of the mesh object. This information, which we call the \"edge structure\", is not included in the description of the mesh, so it needs to be calculated first. This is what is done by the stand-alone application PovEdge: it parses a given file for all the 'mesh2' declarations, and for each 'mesh2', it computes the edge structure and writes it to a file. Then, to check whether they are part of the silhouette or of a crease, the calculations on the edges are done at parsing time, by a Pov macro (called EdgeMesh).\nSee the \"How to use\" section for practical use.",
null,
"",
null,
"Object with silhouette edges only Same object with crease edges"
] |
[
null,
"http://tuabiht.chez-alice.fr/PovEdge_Site/cubsub1_sil.jpg",
null,
"http://tuabiht.chez-alice.fr/PovEdge_Site/cubsub1_crease.jpg",
null
] |
{"ft_lang_label":"__label__en","ft_lang_prob":0.8615566,"math_prob":0.9687246,"size":2204,"snap":"2020-10-2020-16","text_gpt3_token_len":525,"char_repetition_ratio":0.13681819,"word_repetition_ratio":0.030612245,"special_character_ratio":0.207804,"punctuation_ratio":0.09237875,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9821098,"pos_list":[0,1,2,3,4],"im_url_duplicate_count":[null,2,null,2,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2020-04-01T17:58:00Z\",\"WARC-Record-ID\":\"<urn:uuid:7fee9d4e-879c-4fa0-b240-734ad3a8d1e4>\",\"Content-Length\":\"5599\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:27323ed5-1988-4e7f-b837-11a78505a687>\",\"WARC-Concurrent-To\":\"<urn:uuid:a5f03854-5032-4268-a038-cf917ba60213>\",\"WARC-IP-Address\":\"212.27.63.127\",\"WARC-Target-URI\":\"http://tuabiht.chez-alice.fr/PovEdge_Site/howitworks.html\",\"WARC-Payload-Digest\":\"sha1:63IINVE6MBP46VAVAMLJF2FYBLK4P76J\",\"WARC-Block-Digest\":\"sha1:Z2QDMBBVM4WQJADNDSMLB7SXTXSN7ZS7\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2020/CC-MAIN-2020-16/CC-MAIN-2020-16_segments_1585370505826.39_warc_CC-MAIN-20200401161832-20200401191832-00323.warc.gz\"}"}
|
http://ses-engineering.biz/FirstLaw/first-law-of-thermodynamics-open-system
|
[
"First law of Thermodynamics open system [Mechanical engineering]\n\n# First law of Thermodynamics open system\n\nFirst Law of Thermodynamics for an Open System\n\nFirst Law for an Open System\n\nNow we are going to open the system, or open the cylinder as shown below.\n\nFig.3 A piston-cylinder open system made by making the cylinder open\n\nThe system is no more closed now, it’s an open system. The mass is continuously varying. It can have an inlet mass flow rate at particular pressure and particular velocity. Similarly there will be exit flow rate of particular pressure and velocity. Here also our objective is the same. We want to find out energy change of the gas or the system. But here it is not possible to pin point a particular quantity of gas. The gas is continuously flowing. So before proceeding to the energy change calculation, we have to define a system first, a control volume where you will do energy balance.\n\nFig.4 Defining a control volume for energy balance\n\nHere the dotted line represents the control volume, or the space at which we will do energy balance. Here you can see there are 4 energy interactions to the system. 2 energy interactions which are coming to the system and another 2 energy interactions which leave the system. So if you want to find out energy change in system you should add energy transfer due to heat flow and inlet mass flow and subtract energy transfer due to work done and exit mass flow. So for an open system change in energy will be as follows. Note that the flow stream has got 3 components of energy. Internal energy, kinetic energy and potential energy. Z represents the altitude of flow stream. This equation is the first law of thermodynamics for an open system.\n\n### Concept of Flow work & Enthalpy – More Useful Form of First Law\n\nBut for an open system the term W, work done by the gas should be carefully examined. Here the gas is doing work to push the cylinder up, plus it is doing work to suck the fluid in or eject the fluid out. Or to maintain the flow gas has to do some work. This kind of work, the work which is required to maintain the flow is known as flow work. So the total work done by the system will be summation of visible work and flow work.\n\nWcv represents the visible work, in this case the work done by the gas on the piston. And we know flow work is the work required to eject the fluid out or suck the fluid out. The work required to eject the fluid out will be force at exit portion multiplied by velocity of this stream. Force is same as pressure at that portion times area. So we can represent flow work like this. If you do some rearrangement to the equation by substituting volumetric flow rate as mass flow rate into specific volume, by representing u+Pv as a new property enthalpy, the above equation will be simplified like this. This is the final and most useful form of first law of thermodynamics for an open system.\n\n### One Application of First Law\n\nWe will work out one interesting example using firs law equation in this section. A pump problem, where fluid is getting pumped from point 1 to point 2.\n\nYou might also like",
null,
"Mod-01 Lec-09 First law of thermodynamics for open systems ...",
null,
"First Law of Thermodynamics for Open Systems ...",
null,
"Lec-3 First Law of Thermodynamics(Open System)",
null,
"FIRST LAW OF THERMODYNAMICS\n\n### FAQ",
null,
"##### What is the first law of thermodynamics?\n\nIsolated: when it cannot exchange energy or matter with the surroundings.\nClosed: when it can exchange energy but NOT matter with the surroundings.\nOpen: when it can exchange both matter AND energy with the surroundings."
] |
[
null,
"http://ses-engineering.biz/img/video/mod_01_lec_09_first_law_of_thermodynamics.jpg",
null,
"http://ses-engineering.biz/img/video/first_law_of_thermodynamics_for_open.jpg",
null,
"http://ses-engineering.biz/img/video/lec_3_first_law_of_thermodynamicsopen_system.jpg",
null,
"http://ses-engineering.biz/img/video/first_law_of_thermodynamics_27.jpg",
null,
"http://ses-engineering.biz/img/avatar/profile_431216455088759.jpg",
null
] |
{"ft_lang_label":"__label__en","ft_lang_prob":0.9420579,"math_prob":0.9337364,"size":2889,"snap":"2020-34-2020-40","text_gpt3_token_len":612,"char_repetition_ratio":0.14107452,"word_repetition_ratio":0.034155596,"special_character_ratio":0.20456906,"punctuation_ratio":0.082051285,"nsfw_num_words":2,"has_unicode_error":false,"math_prob_llama3":0.9877436,"pos_list":[0,1,2,3,4,5,6,7,8,9,10],"im_url_duplicate_count":[null,2,null,2,null,2,null,4,null,null,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2020-09-28T16:09:16Z\",\"WARC-Record-ID\":\"<urn:uuid:cda306a5-37dc-4887-9605-98f05689fde6>\",\"Content-Length\":\"22668\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:d674b6e3-b38c-42e9-a9d3-6367d0520ca6>\",\"WARC-Concurrent-To\":\"<urn:uuid:f9d5596b-aff5-492d-a112-db3d78c8500c>\",\"WARC-IP-Address\":\"23.81.209.204\",\"WARC-Target-URI\":\"http://ses-engineering.biz/FirstLaw/first-law-of-thermodynamics-open-system\",\"WARC-Payload-Digest\":\"sha1:433J3CQQKLR4U35QOBA3CKZVEIGA4A6B\",\"WARC-Block-Digest\":\"sha1:ZD3XI2Z4GF422HAYDXHKPW7GZSWUSOBA\",\"WARC-Identified-Payload-Type\":\"application/xhtml+xml\",\"warc_filename\":\"/cc_download/warc_2020/CC-MAIN-2020-40/CC-MAIN-2020-40_segments_1600401601278.97_warc_CC-MAIN-20200928135709-20200928165709-00609.warc.gz\"}"}
|
https://forum.allaboutcircuits.com/threads/help-needed-for-programming-of-pic16f877a-using-c-in-mplab.37095/
|
[
"Help needed for programming of pic16f877a using C in MPLAB\n\nDiscussion in 'Embedded Systems and Microcontrollers' started by bhargav_17789, Apr 15, 2010.\n\n1. bhargav_17789 Thread Starter New Member\n\nApr 15, 2010\n3\n0\nHi,\n\nI have written a program for 16f877a in MPLAB. And when i build it, it shows that \"Build Failed\", but does not show any errors. So i tried to compile my program using HTPIC and in that i am getting following errors\n\n::Can't find 0x75 words for psect rbss_0 in segment BANK0 (error)\n::Can't find 0x10 words for psect rdata_0 in segment BANK0 (error)\n::Can't find 0x7 words for psect temp in segment COMBANK (error)\n::Can't find 0x2 words (0x2 withtotal) for psect code_ptr in segment BANK0 (error)\n\nI think these are the error notifying me that my bank0 is full. Can anyone tell me how can i change my bank so that i can get rid of these errors ....\n\nAnd also help me with MPLAB - It does not show me any errors due it just says build failed ....\n\nThank You ...\n\n2. BMorse AAC Fanatic!\n\nSep 26, 2009\n2,675\n241\nPost your code, you probably have the errors suppressed that is why they are not showing.... post your code and this will help determining the problem.\n\nB. Morse\n\n3. AlexR Well-Known Member\n\nJan 16, 2008\n735\n55\nYou can set the levels of warnings and errors displayed in MPLAB under the menu \"Project/Build Options ../project\".\n\nAlso make sure that you have the correct device type (chip) selected in the menu \"Configure/Select Device...\".\n\nIf that doesn't fix it do as BMorse suggests and post your code. Make sure you go into advanced editing mode and use the code tags (#) to make your code more readable.\n\n4. bhargav_17789 Thread Starter New Member\n\nApr 15, 2010\n3\n0\n#include<stdio.h>\n#include<pic.h>\n\n#define col1 RD0\n#define col2 RD1\n#define col3 RD2\n#define col4 RD3\n#define row1 RD4\n#define row2 RD5\n#define row3 RD6\n#define row4 RD7\n\n#define count_limit 10\n\n{'5','6','7','8'},\n{'9','0','B','E'},\n{'X','R','S','F'} };\n\nvoid lcd_command(int w);\nvoid lcd_display(char w);\nvoid lcd_init(void);\nvoid delay1(void);\nchar int_asci(int w);\nint asci_int(char w);\nvoid display_status(int count);\nchar key_scan(void);\nvoid pass(int w,int pass_c);\nvoid pass_back(int w,int pass_c);\nvoid pass_check(void);\nvoid motor_delay(void);\nvoid display_full(void);\nvoid display_open(void);\nvoid car_pass_delay(void);\n\nvoid main()\n{\nint n,count,i,led;\nchar c,key,f=\"Created by Bhargav\";\n\n/*initialization */\nTRISB=0; // LCD - data\nTRISC4=0; // LCD - EN\nTRISC5=0; // LCD - RS\nTRISD=0x0F; // KEYPAD - high 4 bit(row) output & low 4 bit(col) input\nTRISA0=0; // MOTOR DRIVER -2\nTRISA1=0; // MOTOR DRIVER -2\nTRISA2=0; // LED-RED\nTRISA3=0; // LED-GREEN\nTRISA4=1; // IR-1\nTRISA5=1; // IR-2\n\nRA0=0; //Motor off\nRA1=0;\n\nlcd_init();\nlcd_display('W');\ndelay1();\nlcd_display('E');\ndelay1();\nlcd_display('L');\ndelay1();\nlcd_display('C');\ndelay1();\nlcd_display('O');\ndelay1();\nlcd_display('M');\ndelay1();\nlcd_display('E');\ndelay1();\n\ncount =0;\n\nled=0;\nRA3=0; // Green LED - ON\n\nhere:\n\nlcd_init();\ndisplay_status(count);\n\nif(RA4=1) // IR-1\n{\nif(RA5=1)\n{\ncount++;\n\nif (count==count_limit)\n{\nled=1;\nRA3=0;\nRA2=1;\n}\n\n}\n\nlcd_init();\ndisplay_status(count);\n\ngoto here;\n}\n\nif(RA5=1) // IR-2\n{\nif(RA4=1)\n{\ncount--;\nif (led==1)\n{\nRA2=0;\nRA3=1;\nled=0;\n}\n}\n\nlcd_init();\ndisplay_status(count);\n\ngoto here;\n}\n\nhere2:\nkey=key_scan(); //call key scan function\n\nif(key=='f')\n{\ngoto here2;\n}\n\nif(key=='B')\n{\nlcd_command(0x04);\ndelay1();\npass_back(n,pass_c);\npass_c--;\ngoto here2;\n}\n\nif(key=='E')\n{\npass_c=0;\npass_check();\ngoto here;\n}\n\nif(key=='X')\n{\ngoto here;\n}\n\nif(key=='S')\n{\ngoto here;\n}\n\nif(key=='R')\n{\npass_c=0;\ngoto here2;\n\n}\n\nif(key=='F')\n{\nlcd_init();\nfor (i=0;i<19;i++)\n{\nc=f;\nlcd_display(c);\ndelay1();\n}\n}\n\nelse\n{\nif(pass_c==0)\n{\nlcd_init();\n}\nlcd_display('*');\ndelay1();\nn=asci_int(key);\npass(n,pass_c);\npass_c++;\ngoto here2;\n}\n}\n\nvoid lcd_init(void)\n{\nlcd_command (0x38);\ndelay1();\nlcd_command (0x0E);\ndelay1();\nlcd_command (0x01);\ndelay1();\nlcd_command (0x06);\ndelay1();\nlcd_command (0x84);\ndelay1();\nreturn;\n}\n\nvoid lcd_command(int w)\n{\nPORTB=w;\nRC5=0;\nRC4=1;\ndelay1();\nRC4=0;\nreturn;\n}\n\nvoid lcd_display(char w)\n{\nPORTB=w;\nRC5=1;\nRC4=1;\ndelay1();\nRC4=0;\nreturn;\n}\n\nvoid delay1(void)\n{\nint i,j;\n\nfor (i=0x00;i<=0x32;i++)\n{\nfor (j=0x00;j<=0xff;j++)\n{\n}\n}\n\nreturn;\n}\n\nchar int_asci(int w)\n{\nchar cc;\nswitch(w)\n{\ncase 0:cc=48;\nbreak;\ncase 1:cc=49;\nbreak;\ncase 2:cc=50;\nbreak;\ncase 3:cc=51;\nbreak;\ncase 4:cc=52;\nbreak;\ncase 5:cc=53;\nbreak;\ncase 6:cc=54;\nbreak;\ncase 7:cc=55;\nbreak;\ncase 8:cc=56;\nbreak;\ncase 9:cc=57;\nbreak;\n}\nreturn (cc);\n}\n\nvoid display_status(int count)\n{\nint c,c1,c2,c3;\nchar cc;\n\nif (count==count_limit)\n{\nlcd_init();\ndisplay_full();\n}\nelse\n{\nlcd_init();\ndisplay_open();\n}\n\nc= count/10;\nc1=c/10;\nc2=c-(c1*10);\nc3=count-(c*10);\n\n//display\nlcd_init();\nlcd_display('V');\ndelay1();\nlcd_display('E');\ndelay1();\nlcd_display('H');\ndelay1();\nlcd_display('I');\ndelay1();\nlcd_display('C');\ndelay1();\nlcd_display('L');\ndelay1();\nlcd_display('E');\ndelay1();\nlcd_display('S');\ndelay1();\nlcd_display('-');\ndelay1();\ncc=int_asci(c1);\nlcd_display(cc);\ndelay1();\ncc=int_asci(c2);\nlcd_display(cc);\ndelay1();\ncc=int_asci(c3);\nlcd_display(cc);\ndelay1();\n\nreturn;\n}\n\nchar key_scan(void)\n{\nchar key_press;\n\nrow1=1;\nrow2=0;\nrow3=0;\nrow4=0;\nif(col1==1)\n{\nreturn(key_press);\n}\nif(col2==1)\n{\nreturn(key_press);\n}\nif(col3==1)\n{\nreturn(key_press);\n}\nif(col4==1)\n{\nreturn(key_press);\n}\n\nrow1=0;\nrow2=1;\nrow3=0;\nrow4=0;\nif(col1==1)\n{\nreturn(key_press);\n}\nif(col2==1)\n{\nreturn(key_press);\n}\nif(col3==1)\n{\nreturn(key_press);\n}\nif(col4==1)\n{\nreturn(key_press);\n}\n\nrow1=0;\nrow2=0;\nrow3=1;\nrow4=0;\nif(col1==1)\n{\nreturn(key_press);\n}\nif(col2==1)\n{\nreturn(key_press);\n}\nif(col3==1)\n{\nreturn(key_press);\n}\nif(col4==1)\n{\nreturn(key_press);\n}\n\nrow1=0;\nrow2=0;\nrow3=0;\nrow4=1;\nif(col1==1)\n{\nreturn(key_press);\n}\nif(col2==1)\n{\nreturn(key_press);\n}\nif(col3==1)\n{\nreturn(key_press);\n}\nif(col4==1)\n{\nreturn(key_press);\n}\n\nkey_press='f';\nreturn(key_press);\n}\n\nint asci_int(char w)\n{\nint cc;\ncc=w;\nswitch(cc)\n{\ncase 48:cc=0;\nbreak;\ncase 49:cc=1;\nbreak;\ncase 50:cc=2;\nbreak;\ncase 51:cc=3;\nbreak;\ncase 52:cc=4;\nbreak;\ncase 53:cc=5;\nbreak;\ncase 54:cc=6;\nbreak;\ncase 55:cc=7;\nbreak;\ncase 56:cc=8;\nbreak;\ncase 57:cc=9;\nbreak;\n}\nreturn (cc);\n}\n\nvoid pass(int w,int pass_c)\n{\nint temp;\nswitch (pass_c)\n{\nbreak;\ncase 1: temp=w*10;\nbreak;\ncase 2: temp=w*100;\nbreak;\ncase 3: temp=w*1000;\nbreak;\n}\nreturn;\n}\n\nvoid pass_back(int w,int pass_c)\n{\nint temp;\nswitch (pass_c)\n{\nbreak;\ncase 1: temp=w*10;\nbreak;\ncase 2: temp=w*100;\nbreak;\ncase 3: temp=w*1000;\nbreak;\n}\nreturn;\n}\n\nvoid pass_check(void)\n{\nint i;\nchar c,pass_incorrect=\"Password is Incorrect. Press R to Retry, X to Exit.\",pass_correct=\"Welcome, You may Enter\";\n\n{\nlcd_init();\nfor (i=0;i<23;i++)\n{\nc=pass_correct;\nlcd_display(c);\ndelay1();\n}\nRA0=1;\nRA1=0;\nmotor_delay();\nRA0=0;\nRA1=0;\ncar_pass_delay();\nRA0=0;\nRA1=1;\nmotor_delay();\nRA0=0;\nRA1=0;\n}\nelse\n{\nlcd_init();\nfor (i=0;i<52;i++)\n{\nc=pass_incorrect;\nlcd_display(c);\ndelay1();\n}\n}\nreturn;\n}\n\nvoid motor_delay(void)\n{\nint i,j;\n\nfor (i=0x00;i<=0xff;i++)\n{\nfor (j=0x00;j<=0xff;j++)\n{\n}\n}\n\nreturn;\n}\n\nvoid display_full(void)\n{\nint i;\nchar c,full=\"Sorry, Parking is Full\";\n\nlcd_init();\nfor (i=0;i<23;i++)\n{\nc=full;\nlcd_display(c);\ndelay1();\n}\nreturn;\n}\n\nvoid display_open(void)\n{\nint i;\nchar c,full=\"Parking is Available\";\n\nlcd_init();\nfor (i=0;i<20;i++)\n{\nc=full;\nlcd_display(c);\ndelay1();\n}\nreturn;\n}\n\nvoid car_pass_delay (void)\n{\nint i,j;\nfor (i=0x00;i<=0x50;i++)\n{\nfor (j=0x00;j<=0xff;j++)\n{\n}\n}\nreturn;\n}\n\n************************************************\n\nIts a very basic programing so i guess u'll have no problem in figuring out the working .... I have thoroughly checked for errors, but i may have missed some ... And i still think the register bank is the problem, so please let me know how i can shift my code to the nxt bank .... and if u come across any other errors, plz let me know ... thank you\n\n5. BMorse AAC Fanatic!\n\nSep 26, 2009\n2,675\n241\nCode ( (Unknown Language)):\n1. #include<stdio.h>\n2. #include<pic.h>\n3.\n4. #define col1 RD0\n5. #define col2 RD1\n6. #define col3 RD2\n7. #define col4 RD3\n8. #define row1 RD4\n9. #define row2 RD5\n10. #define row3 RD6\n11. #define row4 RD7\n12.\n13. #define password1 1234\n14. #define count_limit 10\n15.\n17.\n18. char keypad={ {'1','2','3','4'},\n19. {'5','6','7','8'},\n20. {'9','0','B','E'},\n21. {'X','R','S','F'} };\n22.\n23. void lcd_command(int w);\n24. void lcd_display(char w);\n25. void lcd_init(void);\n26. void delay1(void);\n27. char int_asci(int w);\n28. int asci_int(char w);\n29. void display_status(int count);\n30. char key_scan(void);\n31. void pass(int w,int pass_c);\n32. void pass_back(int w,int pass_c);\n33. void pass_check(void);\n34. void motor_delay(void);\n35. void display_full(void);\n36. void display_open(void);\n37. void car_pass_delay(void);\n38.\n39.\n40. void main()\n41. {\n42. int n,count,i,led;\n43. char c,key,f=\"Created by Bhargav\";\n44.\n45. /*initialization */\n46. TRISB=0; // LCD - data\n47. TRISC4=0; // LCD - EN\n48. TRISC5=0; // LCD - RS\n49. TRISD=0x0F; // KEYPAD - high 4 bit(row) output & low 4 bit(col) input\n50. TRISA0=0; // MOTOR DRIVER -2\n51. TRISA1=0; // MOTOR DRIVER -2\n52. TRISA2=0; // LED-RED\n53. TRISA3=0; // LED-GREEN\n54. TRISA4=1; // IR-1\n55. TRISA5=1; // IR-2\n56.\n57. RA0=0; //Motor off\n58. RA1=0;\n59.\n60. lcd_init();\n61. lcd_display('W');\n62. delay1();\n63. lcd_display('E');\n64. delay1();\n65. lcd_display('L');\n66. delay1();\n67. lcd_display('C');\n68. delay1();\n69. lcd_display('O');\n70. delay1();\n71. lcd_display('M');\n72. delay1();\n73. lcd_display('E');\n74. delay1();\n75.\n76.\n77. count =0;\n78.\n79. led=0;\n80. RA3=0; // Green LED - ON\n81.\n82. here:\n83.\n84. lcd_init();\n85. display_status(count);\n86.\n87. if(RA4=1) // IR-1\n88. {\n89. if(RA5=1)\n90. {\n91. count++;\n92.\n93. if (count==count_limit)\n94. {\n95. led=1;\n96. RA3=0;\n97. RA2=1;\n98. }\n99.\n100. }\n101.\n102. lcd_init();\n103. display_status(count);\n104.\n105. goto here;\n106. }\n107.\n108.\n109. if(RA5=1) // IR-2\n110. {\n111. if(RA4=1)\n112. {\n113. count--;\n114. if (led==1)\n115. {\n116. RA2=0;\n117. RA3=1;\n118. led=0;\n119. }\n120. }\n121.\n122. lcd_init();\n123. display_status(count);\n124.\n125. goto here;\n126. }\n127.\n129.\n130. here2:\n131. key=key_scan(); //call key scan function\n132.\n133. if(key=='f')\n134. {\n135. goto here2;\n136. }\n137.\n138. if(key=='B')\n139. {\n140. lcd_command(0x04);\n141. delay1();\n142. pass_back(n,pass_c);\n143. pass_c--;\n144. goto here2;\n145. }\n146.\n147. if(key=='E')\n148. {\n149. pass_c=0;\n150. pass_check();\n151. goto here;\n152. }\n153.\n154. if(key=='X')\n155. {\n156. goto here;\n157. }\n158.\n159. if(key=='S')\n160. {\n161. goto here;\n162. }\n163.\n164. if(key=='R')\n165. {\n166. pass_c=0;\n167. goto here2;\n168.\n169. }\n170.\n171. if(key=='F')\n172. {\n173. lcd_init();\n174. for (i=0;i<19;i++)\n175. {\n176. c=f[i];\n177. lcd_display(c);\n178. delay1();\n179. }\n180. }\n181.\n182. else\n183. {\n184. if(pass_c==0)\n185. {\n186. lcd_init();\n187. }\n188. lcd_display('*');\n189. delay1();\n190. n=asci_int(key);\n191. pass(n,pass_c);\n192. pass_c++;\n193. goto here2;\n194. }\n195. }\n196.\n197. void lcd_init(void)\n198. {\n199. lcd_command (0x38);\n200. delay1();\n201. lcd_command (0x0E);\n202. delay1();\n203. lcd_command (0x01);\n204. delay1();\n205. lcd_command (0x06);\n206. delay1();\n207. lcd_command (0x84);\n208. delay1();\n209. return;\n210. }\n211.\n212. void lcd_command(int w)\n213. {\n214. PORTB=w;\n215. RC5=0;\n216. RC4=1;\n217. delay1();\n218. RC4=0;\n219. return;\n220. }\n221.\n222. void lcd_display(char w)\n223. {\n224. PORTB=w;\n225. RC5=1;\n226. RC4=1;\n227. delay1();\n228. RC4=0;\n229. return;\n230. }\n231.\n232. void delay1(void)\n233. {\n234. int i,j;\n235.\n236. for (i=0x00;i<=0x32;i++)\n237. {\n238. for (j=0x00;j<=0xff;j++)\n239. {\n240. }\n241. }\n242.\n243. return;\n244. }\n245.\n246. char int_asci(int w)\n247. {\n248. char cc;\n249. switch(w)\n250. {\n251. case 0:cc=48;\n252. break;\n253. case 1:cc=49;\n254. break;\n255. case 2:cc=50;\n256. break;\n257. case 3:cc=51;\n258. break;\n259. case 4:cc=52;\n260. break;\n261. case 5:cc=53;\n262. break;\n263. case 6:cc=54;\n264. break;\n265. case 7:cc=55;\n266. break;\n267. case 8:cc=56;\n268. break;\n269. case 9:cc=57;\n270. break;\n271. }\n272. return (cc);\n273. }\n274.\n275. void display_status(int count)\n276. {\n277. int c,c1,c2,c3;\n278. char cc;\n279.\n280. if (count==count_limit)\n281. {\n282. lcd_init();\n283. display_full();\n284. }\n285. else\n286. {\n287. lcd_init();\n288. display_open();\n289. }\n290.\n291. c= count/10;\n292. c1=c/10;\n293. c2=c-(c1*10);\n294. c3=count-(c*10);\n295.\n296.\n297. //display\n298. lcd_init();\n299. lcd_display('V');\n300. delay1();\n301. lcd_display('E');\n302. delay1();\n303. lcd_display('H');\n304. delay1();\n305. lcd_display('I');\n306. delay1();\n307. lcd_display('C');\n308. delay1();\n309. lcd_display('L');\n310. delay1();\n311. lcd_display('E');\n312. delay1();\n313. lcd_display('S');\n314. delay1();\n315. lcd_display('-');\n316. delay1();\n317. cc=int_asci(c1);\n318. lcd_display(cc);\n319. delay1();\n320. cc=int_asci(c2);\n321. lcd_display(cc);\n322. delay1();\n323. cc=int_asci(c3);\n324. lcd_display(cc);\n325. delay1();\n326.\n327. return;\n328. }\n329.\n330.\n331. char key_scan(void)\n332. {\n333. char key_press;\n334.\n335. row1=1;\n336. row2=0;\n337. row3=0;\n338. row4=0;\n339. if(col1==1)\n340. {\n342. return(key_press);\n343. }\n344. if(col2==1)\n345. {\n347. return(key_press);\n348. }\n349. if(col3==1)\n350. {\n352. return(key_press);\n353. }\n354. if(col4==1)\n355. {\n357. return(key_press);\n358. }\n359.\n360.\n361. row1=0;\n362. row2=1;\n363. row3=0;\n364. row4=0;\n365. if(col1==1)\n366. {\n368. return(key_press);\n369. }\n370. if(col2==1)\n371. {\n373. return(key_press);\n374. }\n375. if(col3==1)\n376. {\n378. return(key_press);\n379. }\n380. if(col4==1)\n381. {\n383. return(key_press);\n384. }\n385.\n386.\n387. row1=0;\n388. row2=0;\n389. row3=1;\n390. row4=0;\n391. if(col1==1)\n392. {\n394. return(key_press);\n395. }\n396. if(col2==1)\n397. {\n399. return(key_press);\n400. }\n401. if(col3==1)\n402. {\n404. return(key_press);\n405. }\n406. if(col4==1)\n407. {\n409. return(key_press);\n410. }\n411.\n412.\n413. row1=0;\n414. row2=0;\n415. row3=0;\n416. row4=1;\n417. if(col1==1)\n418. {\n420. return(key_press);\n421. }\n422. if(col2==1)\n423. {\n425. return(key_press);\n426. }\n427. if(col3==1)\n428. {\n430. return(key_press);\n431. }\n432. if(col4==1)\n433. {\n435. return(key_press);\n436. }\n437.\n438. key_press='f';\n439. return(key_press);\n440. }\n441.\n442. int asci_int(char w)\n443. {\n444. int cc;\n445. cc=w;\n446. switch(cc)\n447. {\n448. case 48:cc=0;\n449. break;\n450. case 49:cc=1;\n451. break;\n452. case 50:cc=2;\n453. break;\n454. case 51:cc=3;\n455. break;\n456. case 52:cc=4;\n457. break;\n458. case 53:cc=5;\n459. break;\n460. case 54:cc=6;\n461. break;\n462. case 55:cc=7;\n463. break;\n464. case 56:cc=8;\n465. break;\n466. case 57:cc=9;\n467. break;\n468. }\n469. return (cc);\n470. }\n471.\n472. void pass(int w,int pass_c)\n473. {\n474. int temp;\n475. switch (pass_c)\n476. {\n477. case 0: password=w;\n478. break;\n479. case 1: temp=w*10;\n481. break;\n482. case 2: temp=w*100;\n484. break;\n485. case 3: temp=w*1000;\n487. break;\n488. }\n489. return;\n490. }\n491.\n492. void pass_back(int w,int pass_c)\n493. {\n494. int temp;\n495. switch (pass_c)\n496. {\n498. break;\n499. case 1: temp=w*10;\n501. break;\n502. case 2: temp=w*100;\n504. break;\n505. case 3: temp=w*1000;\n507. break;\n508. }\n509. return;\n510. }\n511.\n512. void pass_check(void)\n513. {\n514. int i;\n515. char c,pass_incorrect=\"Password is Incorrect. Press R to Retry, X to Exit.\",pass_correct=\"Welcome, You may Enter\";\n516.\n518. {\n519. lcd_init();\n520. for (i=0;i<23;i++)\n521. {\n522. c=pass_correct[i];\n523. lcd_display(c);\n524. delay1();\n525. }\n526. RA0=1;\n527. RA1=0;\n528. motor_delay();\n529. RA0=0;\n530. RA1=0;\n531. car_pass_delay();\n532. RA0=0;\n533. RA1=1;\n534. motor_delay();\n535. RA0=0;\n536. RA1=0;\n537. }\n538. else\n539. {\n540. lcd_init();\n541. for (i=0;i<52;i++)\n542. {\n543. c=pass_incorrect[i];\n544. lcd_display(c);\n545. delay1();\n546. }\n547. }\n548. return;\n549. }\n550.\n551. void motor_delay(void)\n552. {\n553. int i,j;\n554.\n555. for (i=0x00;i<=0xff;i++)\n556. {\n557. for (j=0x00;j<=0xff;j++)\n558. {\n559. }\n560. }\n561.\n562. return;\n563. }\n564.\n565. void display_full(void)\n566. {\n567. int i;\n568. char c,full=\"Sorry, Parking is Full\";\n569.\n570. lcd_init();\n571. for (i=0;i<23;i++)\n572. {\n573. c=full[i];\n574. lcd_display(c);\n575. delay1();\n576. }\n577. return;\n578. }\n579.\n580. void display_open(void)\n581. {\n582. int i;\n583. char c,full=\"Parking is Available\";\n584.\n585. lcd_init();\n586. for (i=0;i<20;i++)\n587. {\n588. c=full[i];\n589. lcd_display(c);\n590. delay1();\n591. }\n592. return;\n593. }\n594.\n595. void car_pass_delay (void)\n596. {\n597. int i,j;\n598. for (i=0x00;i<=0x50;i++)\n599. {\n600. for (j=0x00;j<=0xff;j++)\n601. {\n602. }\n603. }\n604. return;\n605. }[/i][/i][/i][/i][/i]\nShould have used the code tags to make it more readable.... What C compiler where you using with MPLAB??\n\nLast edited: Apr 15, 2010\n6. bhargav_17789 Thread Starter New Member\n\nApr 15, 2010\n3\n0\nsorry, i am new to this ... so didn know much about code tags\n\nI am using Hi-Tech PICC Lite v8.05\n\n7. AlexR Well-Known Member\n\nJan 16, 2008\n735\n55\nYour program is not at all easy to read. In fact to be brutally honest your program is a mess. No comments,too much code cramped into the \"main\" function and any structure the program might have had has been destroyed by \"goto\" statements.\n\nRule 1 of C programming. Never Ever Ever use a \"goto\" statement! Ok, there may be the very rare occasion where a goto statement is legitimate but in more than 10 years of programming PICs in C I have not struck one.\nIf you are forced to use a goto its a sure indication that you need to add an extra function.\n\nRule 2 of C programming. Don't be afraid to add extra functions. Functions are what give the C language structure so within the bounds of common-sense the more functions the better. For example your main() function is cluttered up with various initialisation statements (port configs, lcd configs etc), all of these could be put into a separate function init() that would be called from main()\n\nThis is not a full list of what is wrong as I have just skimmed through your code;\n\nNo config statement for setting the PIC config bits; clock mode, watchdog timer etc.\nNo _XTAL_FREQ statement to tell the assembler your clock frequency.\nSeveral instances of \"if(this = that){... whereas what you meant was if(this == that){...\nlcd_init() called several times and in more than one location. lcd_init() only needs to be called once at the start of the program\n\nWhy do you think its a bank problem?\nI think its a linker problem!\nDid you specify a valid linker script when you did the manual assembly?\nWithout a linker script telling it the memory layout of your chip the linker will not know where to locate various parts of your code. This ties in with the errors you are seeing.\nSave yourself a lot of hassle and get the assembler working through MPLAB. That way as long as you tell MPLAB your chip type it will automatically tell the assembler/linker which headers and scripts it needs to use.\n\nI would start by putting your current project on hold for a short time and write a simple program to light a led. Get it to assemble and run. This will prove your MPLAB/HiTechC setup. Once it works you can come back to your project."
] |
[
null
] |
{"ft_lang_label":"__label__en","ft_lang_prob":0.7492834,"math_prob":0.97102433,"size":480,"snap":"2019-43-2019-47","text_gpt3_token_len":157,"char_repetition_ratio":0.19327731,"word_repetition_ratio":0.09411765,"special_character_ratio":0.38333333,"punctuation_ratio":0.25274727,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.98526365,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2019-10-15T04:02:58Z\",\"WARC-Record-ID\":\"<urn:uuid:95d109ed-23f4-4b7b-a749-ae924d51ec05>\",\"Content-Length\":\"219620\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:22f811bb-695b-49ad-869f-1e81fae8c4c9>\",\"WARC-Concurrent-To\":\"<urn:uuid:71e5b197-25fd-4b12-a128-dfd129747df4>\",\"WARC-IP-Address\":\"104.20.235.39\",\"WARC-Target-URI\":\"https://forum.allaboutcircuits.com/threads/help-needed-for-programming-of-pic16f877a-using-c-in-mplab.37095/\",\"WARC-Payload-Digest\":\"sha1:7KVBQ5K5RYPYWY63TCCCH6OVHGYKWNGC\",\"WARC-Block-Digest\":\"sha1:T4HJ45ORB5OF7C3FD2TO4DJEWW2UFPAR\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2019/CC-MAIN-2019-43/CC-MAIN-2019-43_segments_1570986655864.19_warc_CC-MAIN-20191015032537-20191015060037-00518.warc.gz\"}"}
|
https://www.stubbornhuang.com/1899/
|
[
"# 1 将std::vector中的数值拷贝到数组中\n\n#include <iostream>\n#include <vector>\n#include <algorithm>\n\ntemplate<typename T>\nsize_t copy(std::vector<T> const& src, T* dest, size_t N)\n{\nsize_t count = std::min(N, src.size());\nstd::copy(src.begin(), src.begin() + count, dest);\nreturn count;\n}\n\nint main()\n{\nstd::vector<int> testVec = {1,2,3,4,5 };\n\nint* indexArray = new int[testVec.size()];\n\ncopy(testVec, indexArray, testVec.size());\n\nfor (int i = 0; i < 5; ++i)\n{\nstd::cout << indexArray[i] << std::endl;\n}\n\ndelete[] indexArray;\n\nreturn 0;\n}",
null,
""
] |
[
null,
"https://www.stubbornhuang.com/wp-content/uploads/2022/01/wp_editor_md_53f8a56d7908a552f398ef667ae5da84.jpg",
null
] |
{"ft_lang_label":"__label__zh","ft_lang_prob":0.57587534,"math_prob":0.9729701,"size":2248,"snap":"2023-14-2023-23","text_gpt3_token_len":1287,"char_repetition_ratio":0.12477718,"word_repetition_ratio":0.0,"special_character_ratio":0.30782917,"punctuation_ratio":0.21542554,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9901034,"pos_list":[0,1,2],"im_url_duplicate_count":[null,2,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2023-03-23T17:44:55Z\",\"WARC-Record-ID\":\"<urn:uuid:44cec9ff-9489-4ba4-9355-248862d67743>\",\"Content-Length\":\"110712\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:f5589c62-7f24-4896-a88c-706179921276>\",\"WARC-Concurrent-To\":\"<urn:uuid:32d34f7c-8a57-4dc1-9eed-6e4c6a8e0ad1>\",\"WARC-IP-Address\":\"172.96.247.223\",\"WARC-Target-URI\":\"https://www.stubbornhuang.com/1899/\",\"WARC-Payload-Digest\":\"sha1:2PT2VYRVEZ23YV6WUY4KNLKU2FVC6O4U\",\"WARC-Block-Digest\":\"sha1:ZTNT2E4URLNT3VDIDLEUGJF6KIVUNFKN\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2023/CC-MAIN-2023-14/CC-MAIN-2023-14_segments_1679296945182.12_warc_CC-MAIN-20230323163125-20230323193125-00763.warc.gz\"}"}
|
https://electrical-blog.com/three-phase-transformer-basics/
|
[
"# Three Phase Transformers Basics\n\nA three-phase transformer is used to generate and transmit a large amount of power. Three-phase step up and step down transformers are basically used in various fields in the power system network. A transformer can be formed by joining three separate single-phase winding in a suitable way. Such an arrangement is called 3-phase bank of the transformer. Otherwise, a single 3 phase transformer is one where the cores and winding of all three phases are combined in a single structure.\n\n#### Advantage of a three-phase unit transformer\n\n• A three-phase unit transformer has the following advantages over the 3 single-phase transformer of same KVA rating such as,\n• It takes less space\n• It is lighter, smaller and cheaper compared to the other one.\n• Only three terminals are needed rather than six terminals in a single 3 phase transformer.\n• The installation cost for the three-phase transformer is much lower than the other one.\n\n#### Advantage of a transformer bank or three single-phase transformer\n\n• A transformer bank or three single-phase transformer has the following advantages over a 3 phase transformer of same KVA rating such as,\n• A transformer bank may be provided with higher KVA rating to supply an imbalanced load.\n• When a transformer is damaged in a transformer bank then remaining two transformers may be used as open Δ (delta) connection.\n• Transformer tank is less costly compared to a single-phase transformer.\n• The transportation of a single-phase transformer is more convenient\n\nBut generally, we use a three-phase transformer rather than a transformer tank.\n\n#### Construction of three-phase transformer\n\nConstruction of the magnetic core of a three-phase transformer may be understood by considering three single-phase transformer positioned at 1200 to each other. If three-phase sinusoidal voltage is applied to the winding then the flux produced φR, φS, φT will also be sinusoidal and balanced. If the three legs of the transformer carrying these fluxes are merged, the total flux in the merged leg will be zero.so these legs can be removed as it carries no flux. Usually, the structure is not convenient to build so the structure with the tree limbs in the same plane is used. Here the constructions of core transformer are shown in the figure.\n\nHere the constructions of core transformer are shown in the figure.\n\n#### Conditions of Three-Phase transformer in Parallel\n\n• There are some conditions which must be fulfilled before connecting two 3-phase transformers in parallel. These are\n• The polarities of the transformers must be the same.\n• The primary and secondary voltage rating should be identical.\n• Impedance is inversely proportional to the KVA ratings.\n• Identical X/R ratio in the transformer impedance.\n• The phase sequence of transformers must be the same.\n• The phase shift between primary and secondary voltage must be the same for all the transformers."
] |
[
null
] |
{"ft_lang_label":"__label__en","ft_lang_prob":0.9029437,"math_prob":0.9498131,"size":2952,"snap":"2020-45-2020-50","text_gpt3_token_len":574,"char_repetition_ratio":0.234057,"word_repetition_ratio":0.075630255,"special_character_ratio":0.19139567,"punctuation_ratio":0.06743738,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.96452427,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2020-10-24T03:35:30Z\",\"WARC-Record-ID\":\"<urn:uuid:6ee89a6c-2cf2-432f-bf94-433b11cc9737>\",\"Content-Length\":\"40856\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:b363bbc1-223f-49c6-ac1e-30161d33b6ee>\",\"WARC-Concurrent-To\":\"<urn:uuid:c24b1dfe-7154-48ea-bea2-e09c84d14525>\",\"WARC-IP-Address\":\"107.155.116.36\",\"WARC-Target-URI\":\"https://electrical-blog.com/three-phase-transformer-basics/\",\"WARC-Payload-Digest\":\"sha1:4TPMVRWZ66LDN2NKTK4EOVCKZKGZFJ27\",\"WARC-Block-Digest\":\"sha1:CFKV6TKFVB7DNMUX7MSQDX32ZNEBF7C5\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2020/CC-MAIN-2020-45/CC-MAIN-2020-45_segments_1603107881640.29_warc_CC-MAIN-20201024022853-20201024052853-00656.warc.gz\"}"}
|
https://stats.stackexchange.com/questions/406294/time-variable-as-a-fraction-when-using-cox-proportional-hazard-model
|
[
"# Time variable as a fraction when using Cox proportional hazard model\n\nWe are trying to estimate the lifetime cumulative default rates for consumer loans, using the Cox proportional hazard model. Since we have a number of different maturities (and the majority have not reached maturity yet) we are wondering whether it is acceptable to use the dependent time variable expressed as a fraction of time? I.e. if a loan has a running time of 24 months and is currently in month 12, the fraction is 12/24 = 0.5. In our dataset we have maturity times ranging from 12-180 months, and the time variable would then range from 0-1 instead of the actual lenghts.\n\nThe reason I am asking is that I want to know if this causes any problems, besides the implicit assumption that the baseline hazard follows the same pattern regardless of the length of the loan? We were also thinking of potentially correcting for this assumption by using the length of the loan as one of the covariates, would this be appropriate?\n\nAny thoughts or comments would be appreciated, as well as references to previous literature where they have used a similar procedure. Thanks!"
] |
[
null
] |
{"ft_lang_label":"__label__en","ft_lang_prob":0.9547876,"math_prob":0.9524656,"size":1071,"snap":"2019-51-2020-05","text_gpt3_token_len":222,"char_repetition_ratio":0.11059044,"word_repetition_ratio":0.0,"special_character_ratio":0.20915033,"punctuation_ratio":0.08252427,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9798336,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2020-01-26T17:56:26Z\",\"WARC-Record-ID\":\"<urn:uuid:dcffb241-15e3-4dc1-b799-399c5a5bf20a>\",\"Content-Length\":\"125644\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:c0c6ac68-9bb2-421e-96bb-28d6ef2e0eef>\",\"WARC-Concurrent-To\":\"<urn:uuid:af673e0e-0cde-4c05-a01e-dbdfbb930e49>\",\"WARC-IP-Address\":\"151.101.65.69\",\"WARC-Target-URI\":\"https://stats.stackexchange.com/questions/406294/time-variable-as-a-fraction-when-using-cox-proportional-hazard-model\",\"WARC-Payload-Digest\":\"sha1:IC3NVF7BH5UQASVMNZGYXNFFV2GWUQ76\",\"WARC-Block-Digest\":\"sha1:PXEE6TBY5TKT67XLYBMJXHACSTDQFLHE\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2020/CC-MAIN-2020-05/CC-MAIN-2020-05_segments_1579251690095.81_warc_CC-MAIN-20200126165718-20200126195718-00216.warc.gz\"}"}
|
https://www.wallstreetmojo.com/vba-left-function/
|
[
"# VBA Left Function",
null,
"Article byJeevan A Y",
null,
"## Excel VBA Left\n\nVBA Left is also one of the worksheet functions categorized under the text functions which is used in VBA with the application. worksheet method, it returns the specified number of characters from the left part of the string.\n\nSome of are integrated with VBA as well. Of all the many text functions, VBA LEFT is one of those functions we use quite often than other formulas.\n\nIf you know , then VBA LEFT function is exactly the same. It can extract the characters from the left side of the string or value given by the user.\n\nFor eg:\nSource: VBA Left Function (wallstreetmojo.com)\n\nThe syntax of the LEFT function is exactly the same as in the worksheet function.\n\nIt has two arguments.\n\n• String: This nothing but the value or . From this value, we are looking to chop the characters.\n• Length: How many characters you want to extract from the string you have supplied. This should be a numerical value.\n\n### How to use Excel VBA Left Function?\n\nYou can download this VBA Left Function Template here – VBA Left Function Template\n\n#### Example #1\n\nAssume you have the word “Sachin Tendulkar” and you want only the first 6 characters from this word. We will show how to extract from left using the LEFT function in VBA.\n\nStep 1: Create a macro name and Define variable as String.\n\nCode:\n\n```Sub Left_Example1()\n\nDim MyValue As String\n\nEnd Sub```\n\nStep 2: Now assign a value to this variable\n\nCode:\n\n```Sub Left_Example1()\n\nDim MyValue As String\n\nMyValue =\n\nEnd Sub```\n\nStep 3: Open the LEFT function.\n\nCode:\n\n```Sub Left_Example1()\n\nDim MyValue As String\n\nMyValue = Left(\n\nEnd Sub```\n\nStep 4: The first argument is to tell what is the string or value. Our value here is “Sachin Tendulkar.”\n\nCode:\n\n```Sub Left_Example1()\n\nDim MyValue As String\n\nMyValue = Left(\"Sachin Tendulkar\",\n\nEnd Sub```\n\nStep 5: Length is nothing but how many characters we need from the left. We need 6 characters.\n\nCode:\n\n```Sub Left_Example1()\n\nDim MyValue As String\n\nMyValue = Left(\"Sachin Tendulkar\", 6)\n\nEnd Sub```\n\nCode:\n\n```Sub Left_Example1()\n\nDim MyValue As String\n\nMyValue = Left(\"Sachin Tendulkar\", 6)\n\nMsgBox MyValue\n\nEnd Sub```\n\nStep 7: Run the macro using the F5 key or manually through a run option to get the result in a message box.\n\nOutput:\n\nInstead of showing the result in a message box, we can store this result in one of the cells in our excel worksheet. We just need to add the cell reference and variable value.\n\nCode:\n\n```Sub Left_Example1()\n\nDim MyValue As String\n\nMyValue = Left(\"Sachin Tendulkar\", 6)\n\nRange(\"A1\").Value = MyValue\n\nEnd Sub```\n\nNow, if you run this code, we will get the value in cell A1.\n\n#### Example #2 – LEFT with Other Functions\n\nIn the above case, we have directly supplied the length of the characters we need from the left direction, but this is more suitable for one or two values. Assume below is the list of values you have in your excel sheet.\n\nIn each case, first name characters are different from one to another; we cannot directly specify the number of characters we needed from each name.\n\nThis is where the beauty of other functions will come into the picture. In order to supply the number of characters dynamically, we can use the “VBA Instr” function.\n\nIn the above set of names, we need all the characters from the left until we reach space character. So Instr function can return those many characters.\n\nStep 1: Similarly, start an excel macro name and define a variable as a string.\n\nCode:\n\n```Sub Left_Example2()\n\nDim FirstName As String\n\nEnd Sub```\n\nStep 2: Assign the value to the variable through the LEFT function.\n\nCode:\n\n```Sub Left_Example2()\n\nDim FirstName As String\n\nFirstName = Left(\n\nEnd Sub```\n\nStep 3: Here, we need to refer the cell to get the value from the cells. So write the code as CELLE (2,1).Value.\n\nCode:\n\n```Sub Left_Example2()\n\nDim FirstName As String\n\nFirstName = Left(Cells(2,1).Value,\n\nEnd Sub```\n\nStep 4: The next thing is how many characters we need. After applying the LEFT function, don’t enter the length of the characters manually. Apply the Instr function.\n\nCode:\n\n```Sub Left_Example2()\n\nDim FirstName As String\n\nFirstName = Left(Cells(2, 1).Value, InStr(1, Cells(2, 1).Value, \" \"))\n\nEnd Sub```\n\nStep 5: Store this result in the B2 cell. So the code is CELLS (2,2).value = FirstName\n\nCode:\n\n```Sub Left_Example2()\n\nDim FirstName As String\n\nFirstName = Left(Cells(2, 1).Value, InStr(1, Cells(2, 1).Value, \" \"))\n\nCells(2, 2).Value = FirstName\n\nEnd Sub```\n\nStep 6: Run this code manually, or through F5, we will get the first name.\n\nWe got the first name for the one name, but we have several other names as well. We cannot write 100 lines of code to extract, then how do we extract?\n\nThis is where the beauty of loops comes into the picture. Below is the loop code, which can eliminate all the unwanted steps and can do the job in 3 lines.\n\nCode:\n\n```Sub Left_Example2()\n\nDim FirstName As String\nDim i As Integer\n\nFor i = 2 To 9\nFirstName = Left(Cells(i, 1).Value, InStr(1, Cells(i, 1).Value, \" \") - 1)\nCells(i, 2).Value = FirstName\nNext i\n\nEnd Sub```\nNote: Instr function returns space character as well, so we need to minus 1 from the Instr result.\n\nIf you run this code, we will get the first name values.\n\nOutput:\n\n### Things to Remember\n\n• Left can extract only from left.\n• VBA Instr function finds the position of the supplied in character in the string.\n\n### Recommended Articles\n\nThis has been a guide to VBA Left Function. Here we learn how to use Left Function to extract the characters from the left side of the string along with some examples and a downloadable excel templateBelow are some useful excel articles related to VBA –\n\n• 3 Courses\n• 12 Hands-on Projects\n• 43+ Hours"
] |
[
null,
"data:image/svg+xml,%3Csvg%20xmlns='http://www.w3.org/2000/svg'%20viewBox='0%200%2060%2060'%3E%3C/svg%3E",
null,
"data:image/svg+xml,%3Csvg%20xmlns='http://www.w3.org/2000/svg'%20viewBox='0%200%2060%2060'%3E%3C/svg%3E",
null
] |
{"ft_lang_label":"__label__en","ft_lang_prob":0.80280405,"math_prob":0.94193864,"size":6600,"snap":"2021-31-2021-39","text_gpt3_token_len":1605,"char_repetition_ratio":0.15676168,"word_repetition_ratio":0.11585366,"special_character_ratio":0.23469697,"punctuation_ratio":0.12509419,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.99784356,"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-19T02:22:52Z\",\"WARC-Record-ID\":\"<urn:uuid:de15f7f7-ce2d-48c6-b341-73087bd75d10>\",\"Content-Length\":\"216156\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:b2a8941d-2d35-4749-bcd0-693b10b9ef63>\",\"WARC-Concurrent-To\":\"<urn:uuid:21941b8e-a626-4744-b853-f9eb06344d07>\",\"WARC-IP-Address\":\"34.211.154.233\",\"WARC-Target-URI\":\"https://www.wallstreetmojo.com/vba-left-function/\",\"WARC-Payload-Digest\":\"sha1:G2HYSNQGHOVTMHCNK2CPB2R2AN3KRH7Z\",\"WARC-Block-Digest\":\"sha1:MGQCBH2S4X5ZZLY3IHCOIVSLQCOEGOBN\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2021/CC-MAIN-2021-39/CC-MAIN-2021-39_segments_1631780056656.6_warc_CC-MAIN-20210919005057-20210919035057-00506.warc.gz\"}"}
|
https://web2.0calc.com/questions/solve-for-x_60
|
[
"+0\n\nSolve for x\n\n+1\n219\n1\n\nSolve for x :\n\n$$\\log_{5} x + \\log_{5} (x - 5) = 5$$\n\nA=\n\nB=\n\nThere are two potential roots, A and B, where .$$A \\leq B.$$\n\nJun 6, 2018\n\n#1\n+1\n\nlog 5 x + log 5 (x -5) = 5\n\nlog 5 [ x * (x - 5) ] = 5 we have that\n\n5^5 = x ( x - 5)\n\n5^5 = x^2 - 5x rearrange as\n\nx^2 - 5x - 5^5 = 0 solving this we have that\n\nx = [5 + 5√501] / 2 or x = [ 5 - 5√501] / 2\n\nThe second answer results in the log of a negative\n\nSo....the only answer is x = [ 5 + 5√501] / 2",
null,
"",
null,
"",
null,
"Jun 6, 2018"
] |
[
null,
"https://web2.0calc.com/img/emoticons/smiley-cool.gif",
null,
"https://web2.0calc.com/img/emoticons/smiley-cool.gif",
null,
"https://web2.0calc.com/img/emoticons/smiley-cool.gif",
null
] |
{"ft_lang_label":"__label__en","ft_lang_prob":0.8411723,"math_prob":1.0000025,"size":415,"snap":"2019-26-2019-30","text_gpt3_token_len":200,"char_repetition_ratio":0.12652068,"word_repetition_ratio":0.0,"special_character_ratio":0.55903614,"punctuation_ratio":0.08571429,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9998211,"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\":\"2019-06-25T07:02:02Z\",\"WARC-Record-ID\":\"<urn:uuid:f785de74-d78f-48f9-9576-4fa08b920f21>\",\"Content-Length\":\"22118\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:43fe0e7e-1648-47cb-9883-b60f30f208d2>\",\"WARC-Concurrent-To\":\"<urn:uuid:464c502a-ab86-48ab-8f2b-2bcf031fb315>\",\"WARC-IP-Address\":\"209.126.117.101\",\"WARC-Target-URI\":\"https://web2.0calc.com/questions/solve-for-x_60\",\"WARC-Payload-Digest\":\"sha1:KBF5BIDKIDYJKZ6XWWLGPOTK6ALLV3SE\",\"WARC-Block-Digest\":\"sha1:IIQQYGUD3O33PSIBCZ7R4J6JXWD34NHE\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2019/CC-MAIN-2019-26/CC-MAIN-2019-26_segments_1560627999800.5_warc_CC-MAIN-20190625051950-20190625073950-00556.warc.gz\"}"}
|
http://forums.wolfram.com/mathgroup/archive/2007/Oct/msg00407.html
|
[
"",
null,
"",
null,
"",
null,
"",
null,
"",
null,
"",
null,
"",
null,
"Re: Change colors in contour plot and including a legend?\n\n• To: mathgroup at smc.vnet.net\n• Subject: [mg82045] Re: Change colors in contour plot and including a legend?\n• From: Will Robertson <wspr81 at gmail.com>\n• Date: Wed, 10 Oct 2007 04:29:07 -0400 (EDT)\n• References: <fefina\\$jol\\[email protected]>\n\n```On Oct 9, 6:47 pm, sean_incali <sean_inc... at yahoo.com> wrote:\n> Can you change the output of the ContourPlot from gray levels to\n> colors? And then have a legend that breaks down the levels into say\n> 10 or whatever number of bins and denote what the values are?\n\nI've attached a package that might help.\nI wrote it the other day following help from this very list, and I'm\nsure it can be improved. Feedback welcome.\n\nUse it like this:\n\nColorbarPlot[#1^2 + #2^2 &, {-10, 10}, {-5, 5}]\n\nBy default it creates a density plot, but that can be changed:\n\nColorbarPlot[#1^2 + #2^2 &, {-10, 10}, {-5, 5},\nPlotType -> ContourPlot,\nColors -> \"DarkBands\",\nXLabel -> \"x\",\nYLabel -> \"y\",\nTitle -> \"Title\",\nCLabel -> \"Range\",\nHeight -> 300]\n\nHope this helps,\nWill\n\n*************\n\nColorbarPlot v0.1\n2007 Oct 08\n\nColorbarPlot is a function to plot either a ContourPlot or a\nDensityPlot with an attached colorbar to indicate the ranges of the\nfunction that is being plotted. The syntax is not exactly the same as\nfor ContourPlot or DensityPlot.\n\nPlease see the code below (or ?ColorbarPlot) for further details. An\nexample file should be distributed with this package to demonstrate\nits use.\n\nThis package has been written with and for Mathematica 6.0.0.\nI doubt that it will work in previous versions of Mathematica.\nWho knows if it will work in the future.\n\nPlease send comments and suggestions to wspr 81 at gmail dot com.\n\nWill Robertson\n\nThis package consists of the files ColorbarPlot.m and ColorbarPlot-\nexamples.nb. It may be freely distributed and modified under the terms\n& conditions of the Apache License, v2.0: <http://www.apache.org/\n\nBeginPackage[\"ColorbarPlot`\"];\n\nColorbarPlot::usage =\n\"ColorbarPlot[F[x,y],{Xmin,Xmax},{Ymin,Ymax},<options>]:\nCreates a DensityPlot or a ContourPlot with an attached\ncolorbar to denote the range of the function F[x,y].\n\nOptions (defaults shown) are:\nPlotType -> DensityPlot (or ContourPlot, or ...?)\nColors -> \\\"LakeColors\\\" (or \\\"PidgeonTones\\\" or ...)\nXLabel -> \\\"\\\" (label below the plot frame)\nYLabel -> \\\"\\\" (label left of the plot frame)\nTitle -> None (label above the plot from)\nCLabel -> None (label above the colorbar)\nHeight -> 8*72/2.54 (height of the plot; 8cm default)\n\nRegular options to the plot function will also be\npassed through. (Therefore, XLabel and YLabel, etc.\ncan be overriden with a regular FrameLabel option.)\";\n\nBegin[\"`Private`\"]\n\nOptions[ColorbarPlot]={\nColors -> \"LakeColors\",\nPlotType -> DensityPlot,\nXLabel -> \"\",\nYLabel -> \"\",\nCLabel -> None,\nTitle -> None,\nHeight -> 8*72/2.54\n};\n\nColorbarPlot[\nfunction_,{___,x1_,x2_},{___,y1_,y2_},\nopts:OptionsPattern[]] :=\nModule[\n(* local variables *)\n{contours,\nmonitor,\nmax = -Infinity,\nmin = Infinity,\nOpt,x,y},\n\n(* Option processing\n(filter out options for the plot itself) *)\nOpt[x_] :=\nOptionValue[ColorbarPlot,\nFilterRules[{opts},Options[ColorbarPlot]],\nx];\n\n(* Define a function from the input that records the\nmaxima and minima of the function as it is evaluated.\nThis information is then used in the colorbar. *)\nmonitor[x_?NumericQ,y_?NumericQ] :=\nModule[{val=function[x,y]},\nmin=Min[min,val];\nmax=Max[max,val];\nval];\n\n(* Draw the plot and colorbar next to each other *)\nRow[{\n(* Here's the plot: *)\nOpt[PlotType][\nmonitor[x,y],{x,x1,x2},{y,y1,y2},\nEvaluate[FilterRules[{opts},\nOptions[Opt[PlotType]]]],\nImageSize -> {Automatic,Opt[Height]},\nColorFunction -> Opt[Colors],\nFrameLabel -> {{Opt[YLabel],None},\n{Opt[XLabel],Opt[Title]}}],\n(* And the colourbar: *)\nOpt[PlotType][\ny,{x,0,(max-min)/10},{y,min,max},\nImageSize -> {Automatic,Opt[Height]},\nColorFunction -> Opt[Colors],\nPlotRange -> Full,\nAspectRatio -> Automatic,\nFrameLabel -> {{\"\",\"\"},{\"\",Opt[CLabel]}},\n(* the empty frame tick here is\nto align the colorbar with the plot: *)\nFrameTicks -> {{All,None},{{{0,\"\"}},None}}]\n}]]\n\nEnd[];\nEndPackage[];\n\n```\n\n• Prev by Date: Re: Matrices\n• Next by Date: Re: tetrahedron problem\n• Previous by thread: Re: Change colors in contour plot and including a legend?\n• Next by thread: Re: Re: Change colors in contour plot and including a legend?"
] |
[
null,
"http://forums.wolfram.com/mathgroup/images/head_mathgroup.gif",
null,
"http://forums.wolfram.com/mathgroup/images/head_archive.gif",
null,
"http://forums.wolfram.com/mathgroup/images/numbers/2.gif",
null,
"http://forums.wolfram.com/mathgroup/images/numbers/0.gif",
null,
"http://forums.wolfram.com/mathgroup/images/numbers/0.gif",
null,
"http://forums.wolfram.com/mathgroup/images/numbers/7.gif",
null,
"http://forums.wolfram.com/mathgroup/images/search_archive.gif",
null
] |
{"ft_lang_label":"__label__en","ft_lang_prob":0.7027634,"math_prob":0.8501125,"size":4348,"snap":"2023-40-2023-50","text_gpt3_token_len":1211,"char_repetition_ratio":0.13651013,"word_repetition_ratio":0.07496013,"special_character_ratio":0.3072677,"punctuation_ratio":0.2249135,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9628611,"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-09-30T23:37:21Z\",\"WARC-Record-ID\":\"<urn:uuid:adf41501-abbb-463f-b43d-89629d0cc0d1>\",\"Content-Length\":\"48567\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:142f3499-31d2-49db-b65c-6dbf1d8f823b>\",\"WARC-Concurrent-To\":\"<urn:uuid:a1b5e375-7981-406a-bb01-193eaac6eb12>\",\"WARC-IP-Address\":\"140.177.205.73\",\"WARC-Target-URI\":\"http://forums.wolfram.com/mathgroup/archive/2007/Oct/msg00407.html\",\"WARC-Payload-Digest\":\"sha1:ONWSSMX5CWJUM644PH3DKZMDEMVMT27Z\",\"WARC-Block-Digest\":\"sha1:MB5WEZDFLKDGCZGR2GZDDLRAGMEQ2CWS\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2023/CC-MAIN-2023-40/CC-MAIN-2023-40_segments_1695233510730.6_warc_CC-MAIN-20230930213821-20231001003821-00878.warc.gz\"}"}
|
https://file.scirp.org/Html/25564.html
|
[
"",
null,
"World Journal of Mechanics, 2012, 2, 281-287 doi:10.4236/wjm.2012.26034 Published Online December 2012 (http://www.SciRP.org/journal/wjm) Copyright © 2012 SciRes. WJM New Consistent Numerical Modelling of a Travelling Accelerating Concentrated Mass Bartlomiej Dyniewicz1, Czeslaw I. Bajer1,2 1Institute of Fundamental Technological Research, Polish Academy of Sciences, Warsaw, Poland 2The Faculty of Automotive and Construction Machinery Engineering, Warsaw University of Technology, Warsaw, Poland Email: [email protected] Received September 4, 2012; revised October 6, 2012; accepted October 18, 2012 ABSTRACT This paper deals with vibrations of structures subjected to moving inertial loads. In literature structures are usually sub-jected to massless forces. In numerical applications, however, the direct influence of the inertia of a moving object is usually neglected since the characteristic matrices, although simple, can not be easily derived. The paper presents a di-rect, non-iterative treatment of the motion of a mass along the finite element edge. The general characteristic matrices of finite elements that carry an inertial particle are given and can be applied directly to almost all types of structures. Numerical tests and a comparison with examples from the literature and especially with analytical results, prove the efficiency and accuracy of our analysis. Keywords: Vibrations; Moving Mass; Moving Inertial Load; Time Integration 1. Introduction Increasing the speed and weight of vehicle gives rise to new problems, poorly studied as of yet. These are mainly the adverse exploitation effects caused by wave phe-nomena. Problems show up when we perform computer simulations. In the case of wave problems, the numerical description of moving inertial loads requires great mathe-matical care. Otherwise we get a wrong solution. There is no commercial computing package that would enable the direct simulation of moving loads, both gravity and iner-tia. Perhaps this is due to the lack of universal matrices describing such moving inertial loads. Analytical and semi-analytical results for simply sup-ported or cantilever beams under a moving mass are known [1-4]. This solution is based on the classical separation of variables. It results in the finite trigonomet-ric series which fulfils boundary conditions. The inter-esting solution to the problem of interaction between moving bodies and structures is essentially simplified owing to separation of the two objects . However, with more realistic structures usually the finite element approach is applied. Accurate results are fundamental for decisions at a design stage. An accurate estimation of the dynamic influence is essential for proper modelling. Ac-curate results are important not only for increasing the durability and reliability of systems: predicting the level of the dynamic response of structures under a moving load allows of protecting the environment, especially populated urban centres or historical places. The development of computer methods has led to a se-ries of works on numerical calculations, especially using the finite element method. This method is much more versatile than analytical or semi-analytical methods. Pa-pers discussing moving loads with constant or periodic amplitude [6,7] rely on the step by step modification of the right hand side vector of the resulting system of alge-braic equations. The results have been presented in pa-pers devoted to modelling the motion of a vehicle as a group of oscillators [8-10]. These problems require the coincidence of displacements and forces of two subsys-tems: the main structure and the moving oscillator. For the balance of the respective quantities in both systems, a simple iterative procedure is applied. The convergence of such an iterative scheme is limited to a certain range of parameters, such as the travelling velocity, stiffness of the structure, inertia, and especially the time step. Other-wise the iterative procedure must be more complex and time consuming. In addition, the oscillator can not re-place the point mass. In the limiting case of infinite spring stiffness, it has been shown that the moving oscil-lator problem for a simply supported beam is not equiva-lent, in a strict sense, to the moving mass problem . The insertion of the inertia of the moving load effect requires not only modification of the right hand side vector, but also selected parts of the global inertia, damping, and stiffness matrices of the system, at every",
null,
"B. DYNIEWICZ, C. I. BAJER Copyright © 2012 SciRes. WJM 282 time step. The first study to discuss the influence of the inertia of a moving mass was reported in . An inertial load moving at a constant speed on the Euler beam was considered. Further works [13-15] are also related to beams or plates in which the nodal parameters are inter-polated by cubic polynomials. Let us apply them to the pure hyperbolic equation of the string vibrations. Unfor-tunately, the results there are wrong. Simulations fail because of the divergence of the solution. In literature, we can also find examples of the space- time finite element method applied to moving loads. The idea is based on the equilibrium of the energy of a struc-ture in time interval (Figure 1). It is based on the weak formulation and allows us to solve much more complex problems, including moving concentrated physical parameters. This approach was successfully applied to simple moving mass problem, solved by discrete methods [16,17]. Although the space-time approach in the case of a dif-ferential equation with constant coefficients and station-ary discretization results in practically the same algo-rithms as classical time integration methods, most engi-neers chose methods of the Newmark group for compu-tations. A simple modification of the inertia matrix by adding the AD hoc moving mass lumping in nodes in the Newmark algorithm or direct differentiation of the accel-eration of the mass particle according to the moving ar-gument and then incorporation of the resulting matrices to the solution scheme fail. The practice of numerical simulations, however, re-quires simplicity and efficiency of procedures. Charac-teristic matrices for an inertial particle should be capable of being easily incorporated into computer procedures. Thus all existing commercial codes would gain new pos-sibilities of calculations. We will focus our attention on this aim. We will derive correct matrices which can be applied to discrete solutions by methods of the Newmark group of all types of differential equations, especially a string, the Bernoulli-Euler beam or the Timoshenko beam. They differ from matrices used in literature. Numerical tests Figure 1. The mass trajectory in space and time. and a comparison with test examples published so far are given. 2. Mathematical Model Let us consider differential equations of structures con-taining a concentrated mass. We will focus our attention on the term which describes forces induced by a moving inertial particle. In the case of a string we can write the equation in the form: 222222,,d,dwxtwxtNAxtwft txftP xftmt (1) Here, ,wxt is the vertical deflection of the mid- line, m is the moving mass, N is the tension of the string, A is the mass density per unit length, P is the external point force, and there is usually a gravitation force mg. The position of the moving point can be described with a quadratic function with respect to time 201=2ftx vtvt (2) where 0x is an initial position of the mass. v and v denote the mass velocity and acceleration respectively. We impose initial conditions ,0 0wx , 0,0twxtt and boundary conditions 0, 0wt, ,0wlt. The Bernoulli-Euler beam is described by the equation 424222,,d,dwxtwxtEI Axtwft txftP xftmt (3) with initial conditions ,0 0wx , 0,0twxtt and boundary conditions 0, 0wt, ,0wlt, 22220, 0,, 0,wt xwlt x and the Timoshen- ko beam 222222,,,d,dw xtw xtxtGAAkxtxwft txftP xftmt (4) 2222,, ,,0xtxtw xtGAIEIx tkxtx with the same boundary and initial conditions as for the Bernoulli-Euler beam. Here, EI is the bending stiffness, GAk is the shear stiffness, I is the rotatory inertia of the cross section of the beam, and is the angle of",
null,
"B. DYNIEWICZ, C. I. BAJER Copyright © 2012 SciRes. WJM 283rotation of the cross section. In each type of problem we have identical inertial terms 22d,dxftmwft tt. Below we will consider only this term, since the remaining parts of the equations are treated in the classical way by the finite element method. Let us follow the direct derivation commonly carried out in the literature. The acceleration of a mass particle moving at a varying speed v in the space-time domain is described by the Renaudot formula 22222222d, ,,2d,,xft xftxftxftwft twxtwxtvxtttwxt wxtvvxx(5) where ft describes the position of the load. The above formula represents simply the chain rule of derivation. The corresponding parts of the equation describe the lat- eral acceleration, Coriolis acceleration, centrifugal accel- eration and acceleration associated with the change of particle velocity. These names are generally not adequate in the case of all structures. Let us compare two different problems: the vibrations of a string and longitudinal vi- brations of a bar. In both cases we have the identical governing equation. However, in the case of longitudinal displacements we can not call the forces described by terms of the equation as centrifugal or Coriolis. 3. The Finite Element Carrying the Moving Mass Particle We must underline here that the derived matrices con-tribute only the point mass effects. They must be simply added to classical matrices elaborated for a structure, i.e. for a string or a beam. The full discrete motion equation is 11 11ii imm miimMMw CCwKKwFe (6) Here, M is the inertia matrix of a structure, Mm is a moving mass matrix, added only to the inertia matrix of the element on which it travels. The same occurs in the case of a damping matrix of the structure C and the point mass Cm, and in the case of a stiffness matrix of the structure K and the point mass Km. The vector 1iF is the vector of external forces established in time 1it and ime is the right hand side vector resulting from the the mass inertia term, established at the beginning of the time interval 1,iitt. We will concentrate our attention on the mass influence only, thus we will derive matrices Mm, Cm, Km, and ime in the equation 11 1ii iimm mmMwCwKwe (7) The matrices of the finite element that carry the iner- tial particle are composed from two sets: matrices de-scribing the element of a structure and matrices that in-corporate the mass influence. Since the elemental matri-ces are commonly known, below we will consider only the influence of the moving mass. The solution of this problem concerns a mass particle moving on a general finite element. This can be applied to all types of structures: strings, beams, plates, shells, etc. Below we will derive the resulting matrices which will then be applied and tested with an Euler and a Ti-moshenko beam. Let us consider a finite element of length b of the edge of the mass trajectory. The mass particle m passes through the finite element with a varying velocity v in the time interval h, starting at the point 0xx (Figure 2). The equation of virtual energy which describes the motion of the inertial particle can be written in the fol-lowing form 220d,ddbmwft twxxftmxt (8) where a virtual displacements wx can be described with a function 121xxwxw wbb (9) Quantities marked by *. refer to a virtual state. w1 and w2 are nodal transverse virtual displacements at the ends of a finite element. We take first-order polynomials as the shape functions describing the interpolation of the displacements: 12,1xxwxtw twtbb (10) Here, 1wt and 2wt are the nodal displacements in time. This is a natural assumption since the finite ele-ment edge is straight in the case of simple shape func-tions describing linear displacement distributions in the element. In such a case the third term of (5) reduces to zero. That is why we must write the Renaudot formula (5) in a different form: x0 Figure 2. The mass trajectory in the space-time finite element.",
null,
"B. DYNIEWICZ, C. I. BAJER Copyright © 2012 SciRes. WJM 284 22222d,d,,,,ddxft xftxft xftwft ttwxt wxtvxttwxt wxtvvxtx (11) The fourth term of (11) is developed in a Taylor series in terms of the time increment th ,,,d1d,ddthxftttxft xftthxftwxtxwxtwxthxtxwxthtx (12) Upper indices indicate the time in which the respective terms are defined. We assume the backward difference formula (=1). In this case we have ,dd,,11thxftth txft xftwxttxwxt wxthx hx (13) According to Equations (2), (10) and (13), Equation (11) is given by the difference formula 22111111212111121 212dd1iiiiiiiiiiwtfhfh vvvwwwwwbbbbbvv v vvwwwwwbbhbhbhbh (14) The upper index denotes time layer. The energy (8), with respect to (9) and (14) can be written in quadratic form, which, after a classical minimization, results in the matrix Equation (7), where 22111mMm (15) 11mmvCb (16) 11mmvKvbh (17) and 21211mwwmvewwbh (18) with coefficient 201,0 12xvhvh b . Here, is a parameter which defines the position of the mass in the element at the beginning of the time in-crement. This determines the position of the mass at time th, related to the finite element length b. The different terms describe the transverse inertia force related to the vertical acceleration, the Coriolis force, and the centrifugal force. The matrix factors Mm, Cm, and Km can be called the mass, damping, and stiffness matrices. The last term me describes the nodal forces at the beginning of the time interval ,iitt t. We must emphasize here that the matrices (15)-(17) and the vector (18) contribute only the moving inertial particle effect. The matrices of the mass influence in a finite element of a structure must be added to the global system of equations. We notice that the ma-trices (15)-(17) differ from the matrices that cause the divergence of the solution in the case of direct differen-tiation of (5)1. 4. Numerical Results The scheme of computations is given in Figure 3: The finite element is subjected at a mid-point to the force and the inertia parameter, i.e. the concentrated mass. The force vector, usually placed at the right hand side of the resulting system of algebraic equations, is simply distributed over neighbouring nodes (bending moments in the case of a beam must be considered in nodes as Figure 3. Theoretical scheme of the problem and the sche me assumed for computations. 1The matrices that result in the divergence: 22(1 )(1 )(1 )12==(1 )mmmvMmC b 201(1) 12==,0<1.mxvh vhmvKbb ",
null,
"B. DYNIEWICZ, C. I. BAJER Copyright © 2012 SciRes. WJM 285well). The concentrated mass is incorporated directly into the left-hand-side matrices. Their coefficients vary in each time step and this requires the solution a system of equations once per time step. No iterations are required, unless unilateral contact is assumed. There are two gains in such a solution: more accurate and faster computa-tions. There are a few publications in which the inertial load moving on structures are considered directly numerically. The Timoshenko beam was described by Lee . We will compare our curves with those results. Therefore, the data in the example is as follows: the length L =1 m, Young modulus E = 207 GPa, shear modulus G = 77.6 GPa, mass density ρ = 7700 kg/m3. The velocity πvaLEIA was determined by the parameter α. Another parameter β determines the cross section area 22πAL and cross section inertia moment 44 34πIL. The moving mass m had values of 0.441 kg and 11.03 kg. Trajectories of the moving mass point normalized to the static displacement of the simply supported Euler beam loaded in the middle by force mg 348stwmgL EI was presented in Figures 4-6. Fig- ure 4 exhibits the dimensionless deflection of the simply supported Timoshenko beam under a moving mass for β = 0.15 and α = 0.11, 0.5, and 1.1. This corresponds to the mass moving at v = 42.78, 194.4, and 427.7 m/s on a relatively elastic beam. Lee solved the problem semi-analytically. A fourth order differential equation was solved by the Fourier transform and finally inte- grated by the Runge-Kutta method. In our test, we com- pare the results of Lee with our semi-analytically obtained curves together with our Newmark time inte-gration procedure applied to the finite element model of the Timoshenko beam. We notice a perfect coincidence of both solutions and quite good coincidence with Lee results. Figure 5 shows the accuracy, which increases with the number of elements in the structure. Ten to twenty ele-ments is sufficient in our example. Another comparison was carried out between the Newmark and Houbolt methods. Both methods are suffi-ciently accurate. However, the curve for the Newmark method perfectly coincides with our semi-analytical re-sults (Figure 6). Now we will compare the displacements under a moving mass obtained with our approach with reference results by Stanisic and Sadiku [1,2]. The simply sup-ported Bernoulli-Euler beam of length L = 6 m, bending stiffness 42275.4408 msEI A, moving mass m = 0.2 ρAL, velocity of v = 6 m/s was assumed (Figure 7). The simply supported Timoshenko beam was also considered in . We compare our results with those published in the reference paper. Data were assumed as in , listed at the beginning of this section. The pa- (a) (b) (c) Figure 4. Normalized deflections of the simply supported Timoshenko beam under a moving mass particle for β = 0.15: (a) α = 0.11 (v = 42.78 m/s); (b) α = 0.5 (v = 192.4 m/s); and (c) α = 1.1 (v = 427.8 m/s). Figure 5. Accuracy of the Newmark method depending on the number of finite elements—displacements under a moving load (β = 0.03, α = 1.1).",
null,
"B. DYNIEWICZ, C. I. BAJER Copyright © 2012 SciRes. WJM 286 Figure 6. Comparison of displacements under a moving load computed with the Newmark and Houbolt method in the case of large time step (β = 0.15, α = 0.11). Figure 7. Comparison of displacements of the Bernoulli- Euler beam under the moving contact point with published by Stanisic and Sadiku . rameter cravv, where the critical velocity πcrvLEIA. The acceleration v is is defined by the non-dimensional parameter 3vAL EI. Two cases were considered. First the case of 0.03, 0.11a was computed and depicted in Figure 8 for the acceleration 1, for a constant speed 0, and for a small retardation 0.05 . Figure 9 presents the case for a higher initial speed 0.5a and 0.03, for a constant speed 0, and with acceleration 1. 5. Conclusion In this paper we proposed a new approach to the vibra-tion analysis of structures subjected to a moving inertial particle by using the finite element method in space and a time integration method, for example the Newmark method, in time, here represented by the Newmark and Houbolt methods. Elements describing a moving mass particle (15)-(18) can be commonly used both in the analysis of the Euler beam and the Timoshenko beam. In engineering practice, most dynamic simulations are per-formed by the Newmark method. Each approach extends a group of problems that can be directly solved by this commonly used time integration method, and is valuable. We showed in the paper that these matrices result in ac- Figure 8. Comparison of displacements of the Timoshenko beam under a moving contact point with those published by Lee —parameters β = 0.03, α = 0.11. Figure 9. Comparison of displacements of the Timoshenko beam under a moving contact point with those published by Lee —parameters β = 0.03, α = 0.5. curate and stable solutions of problems with a mass moving on a structure. Timoshenko beams or other shear resistant structures exhibit discontinuities in the solutions of the differential equations [19-21]. Although in practice nonlinear effects smooth the trajectories, high jumps of some physical quantities are observed. We assumed that identical computational results should be obtained both by analytical and numerical tools. There is no reason to say that numerical solutions converge to inaccurate re-sults. Our finite element approach proves that simple elemental matrices derived from a mathematically cor-rect analysis gives a perfect convergence to the analytical forms. REFERENCES M. M. Stanisic, J. A. Euler and S. T. Montgomery, “On a Theory Concerning the Dynamical Behavior of Structures Carrying Moving Masses,” Archive of Applied Mechanics, Vol. 43, No. 5, 1974, pp. 295-305. doi:10.1007/BF00537218 S. Sadiku and H. H. E. Leipholz, “On the Dynamics of Elastic Systems with Moving Concentrated Masses,” Ar-",
null,
"B. DYNIEWICZ, C. I. BAJER Copyright © 2012 SciRes. WJM 287chive of Applied Mechanics, Vol. 57, No. 3, 1987, pp. 223-242. H. P. Lee, “On the Dynamic Behaviour of a Beam with an Accelerating Mass,” Archive of Applied Mechanics, Vol. 65, No. 8, 1995, pp. 564-571. doi:10.1007/BF00789097 H. P. Lee, “Transverse Vibration of a Timoshenko Beam Acted on by an Accelerating Mass,” Applied Acoustics, Vol. 47, No. 4, 1996, pp. 319-330. doi:10.1016/0003-682X(95)00067-J V. A. Krysko, J. Awrejcewicz, A. N. Kutsemako and K. Broughan, “Interaction between Flexible Shells (Plates) and a Moving Lumped Body,” Communications in Non- linear Science and Numerical Simulation, Vol. 11, No. 1, 2006, pp. 13-43. doi:10.1016/j.cnsns.2004.06.006 J. J. Wu, A. R. Whittaker and M. P. Cartmell, “The Use of Finite Element Techniques for Calculating the Dy- namic Response of Structures to Moving Loads,” Com- puters and Structures, Vol. 78, No. 6, 2000, pp. 789-799. doi:10.1016/S0045-7949(00)00055-9 P. Lou, G. Dai and Q. Zeng, “Dynamic Analysis of a Timoshenko Beam Subjected to Moving Concentrated Forces Using the Finite Element Method,” Shock and Vi- bration, Vol. 14, No. 6, 2007, pp. 459-468. J. Hino, T. Yoshimura, K. Konishi and N. Ananthanara- yana, “A Finite Element Prediction of the Vibration of a Bridge Subjected to a Moving Vehicle Load,” Journal of Sound and Vibration, Vol. 96, No. 1, 1984, pp. 45-53. doi:10.1016/0022-460X(84)90593-5 Y. H. Lin and M. W. Tretheway, “Finite Element Analy- sis of Elastic Beams Subjected to Moving Dynamic Loads,” Journal of Sound and Vibration, Vol. 136, No. 2, 1990, pp. 323-342. doi:10.1016/0022-460X(90)90860-3 Y. S. Cheng, F. T. K. Au and Y. K. Cheung, “Vibration of Railway Bridges under a Moving Train by Using Bridge-Track-Vehicle Element,” Engineering Structures, Vol. 23, No. 12, 2001, pp. 1597-1606. doi:10.1016/S0141-0296(01)00058-X A. V. Pesterev, L. A. Bergman, C. A. Tan, T.-C. Tsao and B. Yang, “On Asymptotics of the Solution of the Moving Oscillator Problem,” Journal of Sound and Vibration, Vol. 260, No. 3, 2003, pp. 519-536. doi:10.1016/S0022-460X(02)00953-7 D. M. Yoshida and W. Weaver, “Finite-Element Analysis of Beams and Plates with Moving Loads,” Journal of the International Association Bridge and Structural Engi- neering, Vol. 31, No. 1, 1971, pp. 179-195. F. V. Filho, “Finite Element Analysis of Structures under Moving Loads,” The Shock and Vibration Digest, Vol. 10, No. 8, 1978, pp. 27-35. doi:10.1177/058310247801000803 A. O. Cifuentes, “Dynamic Response of a Beam Excited by a Moving Mass,” Finite Elements in Analysis and De- sign, Vol. 5, No. 3, 1989, pp. 237-246. doi:10.1016/0168-874X(89)90046-2 J. R. Rieker, Y. H. Lin and M. W. Trethewey, “Discreti-zation Considerations in Moving Load Finite Element Beam Models,” Finite Elements in Analysis and Design, Vol. 21, No. 3, 1996, pp. 129-144. doi:10.1016/0168-874X(95)00029-S C. I. Bajer and B. Dyniewicz, “Space-Time Approach to Numerical Analysis of a String with a Moving Mass,” In- ternational Journal for Numerical Methods in Engineer- ing, Vol. 76, No. 10, 2008, pp. 1528-1543. C. I. Bajer and B. Dyniewicz, “Virtual Functions of the Space-Time Finite Element Method in Moving Mass Problems,” Computers and Structures, Vol. 87, No. 7-8, 2009, pp. 444-455. doi:10.1016/j.compstruc.2009.01.007 H. P. Lee, “The Dynamic Response of a Timoshenko Beam Subjected to a Moving Mass,” Journal of Sound Vibration, Vol. 198, No. 2, 1996, pp. 249-256. doi:10.1006/jsvi.1996.0567 B. Dyniewicz and C. I. Bajer, “New Feature of the Solu- tion of a Timoshenko Beam Carrying the Moving Mass Particle,” Archive of Mechanics, Vol. 62, No. 5, 2010, pp. 327-341. B. Dyniewicz and C. I. Bajer, “Paradox of the Particle’s Trajectory Moving on a String,” Archive Applied Me- chanics, Vol. 79, No. 3, 2009, pp. 213-223. doi:10.1007/s00419-008-0222-9 B. Dyniewicz and C. I. Bajer, “Discontinuous Trajectory of the Mass Particle Moving on a String or a Beam,” Machine Dynamics Problems, Vol. 31, No. 2, 2007, pp. 66-79."
] |
[
null,
"https://file.scirp.org/Html/paperimages\\25564_1.jpg",
null,
"https://file.scirp.org/Html/paperimages\\25564_2.jpg",
null,
"https://file.scirp.org/Html/paperimages\\25564_3.jpg",
null,
"https://file.scirp.org/Html/paperimages\\25564_4.jpg",
null,
"https://file.scirp.org/Html/paperimages\\25564_5.jpg",
null,
"https://file.scirp.org/Html/paperimages\\25564_6.jpg",
null,
"https://file.scirp.org/Html/paperimages\\25564_7.jpg",
null
] |
{"ft_lang_label":"__label__en","ft_lang_prob":0.8226424,"math_prob":0.9462779,"size":25337,"snap":"2019-43-2019-47","text_gpt3_token_len":7127,"char_repetition_ratio":0.1328307,"word_repetition_ratio":0.050139274,"special_character_ratio":0.26522478,"punctuation_ratio":0.15361159,"nsfw_num_words":1,"has_unicode_error":false,"math_prob_llama3":0.9867666,"pos_list":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"im_url_duplicate_count":[null,3,null,3,null,3,null,3,null,3,null,3,null,3,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2019-10-16T02:24:13Z\",\"WARC-Record-ID\":\"<urn:uuid:a23bc68e-c77d-45a2-9047-6fa56ca3df7e>\",\"Content-Length\":\"137384\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:52f06684-d8b5-413d-90d4-51f962d65a08>\",\"WARC-Concurrent-To\":\"<urn:uuid:f596f690-4b3e-4ebf-aeaf-f2bc32a2bf97>\",\"WARC-IP-Address\":\"45.146.121.13\",\"WARC-Target-URI\":\"https://file.scirp.org/Html/25564.html\",\"WARC-Payload-Digest\":\"sha1:LPO22SVWX7JX476J2UMTN3GF77DU4OVI\",\"WARC-Block-Digest\":\"sha1:F4JWREB25O2HUY3H4KYRCXAGBFMED5TJ\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2019/CC-MAIN-2019-43/CC-MAIN-2019-43_segments_1570986661296.12_warc_CC-MAIN-20191016014439-20191016041939-00441.warc.gz\"}"}
|
https://gateoverflow.in/59525/ugcnet-sep2013-iii-21?show=59689
|
[
"+1 vote\n724 views\n\nAssume statements $S_1$ and $S_2$ defined as:\n\n$S_1$: $L_2 – L_1$ is recursive enumerable where $L_1$ and $L_2$ are recursive and recursive enumerable respectively.\n\n$S_2$: The set of all Turing machines is countable.\n\nWhich of the following is true?\n\n1. $S_1$ is correct and $S_2$ is not correct\n2. Both $S_1$ and $S_2$ are correct\n3. Both $S_1$ and $S_2$ are not correct\n4. $S_1$ is not correct and $S_2$ is correct\n\nrecategorized | 724 views\n\n+1 vote\n• S2 is correct: The set of all Turing machines is countable.\n• S1 s also TRUE. $L_2 - L_1 = L_2 \\cap L_1'$. Since $L_1$ is recursive $L_1'$ is also recursive and hence r.e. also. And finally r.e. languages are closed under intersection.\n\nSo answer is B Both are correct\n\nby Boss (33k points)\nselected by\nS1 is : L2-L1 is recursive enumerable where L1 and L2 are recursive and recursive enumerable respectively.\n\nand ans is B both are correct\n\nset of turing machines is countable but the set of all languages are uncountable\nby Boss (49.3k points)\n+1 vote\n\nAnswer : Both S1 and S2 are correct\n\nRecursive enumerable Languages are not closed under set difference operation .But good thing about Statement S1 is as they mentioned that \"L2–L1 is recursive enumerable where L1 and L2 are recursive enumerable respectively.\"\n\nif L1 and L2 are Recursive enumerable then it is not sufficient to say that L2 - L1 will be Recursive enumerable because it violates the closure property.but they have already mentioned that L2 - L1 is Recursive enumerable and along with that L1 and L2 are also recursive enumerable this statements would eliminate the possibilities to make this statement S1 wrong.\n\nReference : Recursively enumerable language\n\nStatement S2 is also true which is \"The set of all Turing machines is countable.\".\n\nReference : Countable TM\n\nby Boss (45.4k points)\n0\n\[email protected] is meaning of - \" L2-L1 is RE, where L2 and L1 are RE.\n\nAcc. to me - It is given that ..L1 and L2 are RE, and now it is saying that L2-L1 will be RE.\n\n0\n@vijay i have written everything what is you doubt i did not understand .\n\na/c to my knowledge L2-L1 is set difference operation of language L2 and L1 which is RE (given in problem statement.). after they said L1 and L2 individually also RE."
] |
[
null
] |
{"ft_lang_label":"__label__en","ft_lang_prob":0.93425447,"math_prob":0.99044466,"size":778,"snap":"2019-51-2020-05","text_gpt3_token_len":159,"char_repetition_ratio":0.2015504,"word_repetition_ratio":0.0,"special_character_ratio":0.20437019,"punctuation_ratio":0.067669176,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9942503,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2020-01-26T17:58:51Z\",\"WARC-Record-ID\":\"<urn:uuid:0c5392b1-110e-41d1-811a-4564cb6b3ecd>\",\"Content-Length\":\"83413\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:bd7d5f06-9826-479c-8a07-18e8aee496c9>\",\"WARC-Concurrent-To\":\"<urn:uuid:c3c91635-486d-44b7-bc5f-da1dcc9bef55>\",\"WARC-IP-Address\":\"104.27.189.78\",\"WARC-Target-URI\":\"https://gateoverflow.in/59525/ugcnet-sep2013-iii-21?show=59689\",\"WARC-Payload-Digest\":\"sha1:3VO5OJWLPQY75AFMR3OIPNA7WJDP7VLB\",\"WARC-Block-Digest\":\"sha1:FJDISQLODVVBGJ7FVESYC2523NOPT4FW\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2020/CC-MAIN-2020-05/CC-MAIN-2020-05_segments_1579251690095.81_warc_CC-MAIN-20200126165718-20200126195718-00547.warc.gz\"}"}
|
https://api-project-1022638073839.appspot.com/questions/what-is-the-integral-of-ln-x-x-1-2
|
[
"# What is the integral of ln x / x^(1/2)?\n\nJan 9, 2017\n\n$\\int \\frac{\\ln x}{x} ^ \\left(\\frac{1}{2}\\right) \\mathrm{dx} = 2 {x}^{\\frac{1}{2}} \\left(\\ln x - 2\\right) + C$\n\n#### Explanation:\n\nWe can calculate the integral by parts:\n\n$\\int \\frac{\\ln x}{x} ^ \\left(\\frac{1}{2}\\right) \\mathrm{dx} = 2 \\int \\ln x d \\left({x}^{\\frac{1}{2}}\\right) = 2 {x}^{\\frac{1}{2}} \\ln x - 2 \\int {x}^{\\frac{1}{2}} d \\left(\\ln x\\right)$\n\nSolving this last integral:\n\n$\\int {x}^{\\frac{1}{2}} d \\left(\\ln x\\right) = \\int {x}^{\\frac{1}{2}} \\frac{\\mathrm{dx}}{x} = \\int {x}^{- \\frac{1}{2}} \\mathrm{dx} = 2 {x}^{\\frac{1}{2}} + C$\n\nPutting it together:\n\n$\\int \\frac{\\ln x}{x} ^ \\left(\\frac{1}{2}\\right) \\mathrm{dx} = 2 {x}^{\\frac{1}{2}} \\ln x - 4 {x}^{\\frac{1}{2}} + C = 2 {x}^{\\frac{1}{2}} \\left(\\ln x - 2\\right) + C$"
] |
[
null
] |
{"ft_lang_label":"__label__en","ft_lang_prob":0.6361835,"math_prob":1.00001,"size":293,"snap":"2021-43-2021-49","text_gpt3_token_len":73,"char_repetition_ratio":0.13148789,"word_repetition_ratio":0.0,"special_character_ratio":0.25255972,"punctuation_ratio":0.10714286,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":1.0000079,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2021-10-19T19:13:44Z\",\"WARC-Record-ID\":\"<urn:uuid:4f45d644-9b67-45c9-9d7d-8b1b7ae33eec>\",\"Content-Length\":\"33205\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:362c1d24-027e-4adb-b507-ff5588d526a6>\",\"WARC-Concurrent-To\":\"<urn:uuid:a1a36b7c-5251-4d6b-8dc2-c9fd9132dfc5>\",\"WARC-IP-Address\":\"172.253.115.153\",\"WARC-Target-URI\":\"https://api-project-1022638073839.appspot.com/questions/what-is-the-integral-of-ln-x-x-1-2\",\"WARC-Payload-Digest\":\"sha1:HQC7PMB3FGJUHWLTPYCLVVQ4F3USLZ7E\",\"WARC-Block-Digest\":\"sha1:EHTJUGQ336KE6ELVEEU245QOBXKWNRO6\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2021/CC-MAIN-2021-43/CC-MAIN-2021-43_segments_1634323585280.84_warc_CC-MAIN-20211019171139-20211019201139-00158.warc.gz\"}"}
|
http://num.bubble.ro/m/6000/12/
|
[
"# Multiplication table for N = 6000 * 11÷12\n\n6000 * 11 = 66000 [+]\n6000 * 11.01 = 66060 [+]\n6000 * 11.02 = 66120 [+]\n6000 * 11.03 = 66180 [+]\n6000 * 11.04 = 66240 [+]\n6000 * 11.05 = 66300 [+]\n6000 * 11.06 = 66360 [+]\n6000 * 11.07 = 66420 [+]\n6000 * 11.08 = 66480 [+]\n6000 * 11.09 = 66540 [+]\n6000 * 11.1 = 66600 [+]\n6000 * 11.11 = 66660 [+]\n6000 * 11.12 = 66720 [+]\n6000 * 11.13 = 66780 [+]\n6000 * 11.14 = 66840 [+]\n6000 * 11.15 = 66900 [+]\n6000 * 11.16 = 66960 [+]\n6000 * 11.17 = 67020 [+]\n6000 * 11.18 = 67080 [+]\n6000 * 11.19 = 67140 [+]\n6000 * 11.2 = 67200 [+]\n6000 * 11.21 = 67260 [+]\n6000 * 11.22 = 67320 [+]\n6000 * 11.23 = 67380 [+]\n6000 * 11.24 = 67440 [+]\n6000 * 11.25 = 67500 [+]\n6000 * 11.26 = 67560 [+]\n6000 * 11.27 = 67620 [+]\n6000 * 11.28 = 67680 [+]\n6000 * 11.29 = 67740 [+]\n6000 * 11.3 = 67800 [+]\n6000 * 11.31 = 67860 [+]\n6000 * 11.32 = 67920 [+]\n6000 * 11.33 = 67980 [+]\n6000 * 11.34 = 68040 [+]\n6000 * 11.35 = 68100 [+]\n6000 * 11.36 = 68160 [+]\n6000 * 11.37 = 68220 [+]\n6000 * 11.38 = 68280 [+]\n6000 * 11.39 = 68340 [+]\n6000 * 11.4 = 68400 [+]\n6000 * 11.41 = 68460 [+]\n6000 * 11.42 = 68520 [+]\n6000 * 11.43 = 68580 [+]\n6000 * 11.44 = 68640 [+]\n6000 * 11.45 = 68700 [+]\n6000 * 11.46 = 68760 [+]\n6000 * 11.47 = 68820 [+]\n6000 * 11.48 = 68880 [+]\n6000 * 11.49 = 68940 [+]\n6000 * 11.5 = 69000 [+]\n6000 * 11.51 = 69060 [+]\n6000 * 11.52 = 69120 [+]\n6000 * 11.53 = 69180 [+]\n6000 * 11.54 = 69240 [+]\n6000 * 11.55 = 69300 [+]\n6000 * 11.56 = 69360 [+]\n6000 * 11.57 = 69420 [+]\n6000 * 11.58 = 69480 [+]\n6000 * 11.59 = 69540 [+]\n6000 * 11.6 = 69600 [+]\n6000 * 11.61 = 69660 [+]\n6000 * 11.62 = 69720 [+]\n6000 * 11.63 = 69780 [+]\n6000 * 11.64 = 69840 [+]\n6000 * 11.65 = 69900 [+]\n6000 * 11.66 = 69960 [+]\n6000 * 11.67 = 70020 [+]\n6000 * 11.68 = 70080 [+]\n6000 * 11.69 = 70140 [+]\n6000 * 11.7 = 70200 [+]\n6000 * 11.71 = 70260 [+]\n6000 * 11.72 = 70320 [+]\n6000 * 11.73 = 70380 [+]\n6000 * 11.74 = 70440 [+]\n6000 * 11.75 = 70500 [+]\n6000 * 11.76 = 70560 [+]\n6000 * 11.77 = 70620 [+]\n6000 * 11.78 = 70680 [+]\n6000 * 11.79 = 70740 [+]\n6000 * 11.8 = 70800 [+]\n6000 * 11.81 = 70860 [+]\n6000 * 11.82 = 70920 [+]\n6000 * 11.83 = 70980 [+]\n6000 * 11.84 = 71040 [+]\n6000 * 11.85 = 71100 [+]\n6000 * 11.86 = 71160 [+]\n6000 * 11.87 = 71220 [+]\n6000 * 11.88 = 71280 [+]\n6000 * 11.89 = 71340 [+]\n6000 * 11.9 = 71400 [+]\n6000 * 11.91 = 71460 [+]\n6000 * 11.92 = 71520 [+]\n6000 * 11.93 = 71580 [+]\n6000 * 11.94 = 71640 [+]\n6000 * 11.95 = 71700 [+]\n6000 * 11.96 = 71760 [+]\n6000 * 11.97 = 71820 [+]\n6000 * 11.98 = 71880 [+]\n6000 * 11.99 = 71940 [+]\nNavigation: Home | Addition | Substraction | Multiplication | Division Tables for 6000: Addition | Substraction | Multiplication | Division\n\nOperand: 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 30 40 50 60 70 80 90 100 200 300 400 500 600 700 800 900 1000 2000 3000 4000 5000 6000 7000 8000 9000\n\nMultiplication for: 1 2 3 4 5 6 7 8 9 10 20 30 40 50 60 70 80 90 100 200 300 400 500 600 700 800 900 1000 2000 3000 4000 5000 5991 5992 5993 5994 5995 5996 5997 5998 5999 6000 6001 6002 6003 6004 6005 6006 6007 6008 6009 7000 8000 9000"
] |
[
null
] |
{"ft_lang_label":"__label__en","ft_lang_prob":0.7967572,"math_prob":0.9999653,"size":9264,"snap":"2020-24-2020-29","text_gpt3_token_len":1521,"char_repetition_ratio":0.28066954,"word_repetition_ratio":0.56029963,"special_character_ratio":0.15338947,"punctuation_ratio":0.0,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.99997246,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2020-07-04T15:39:00Z\",\"WARC-Record-ID\":\"<urn:uuid:4421aa69-c988-42ea-acca-da399fb177da>\",\"Content-Length\":\"43285\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:2e2eb9d1-0131-4a97-9f30-cc3dc29997fa>\",\"WARC-Concurrent-To\":\"<urn:uuid:04d71580-fe71-47fa-a6ac-cb4287e6a659>\",\"WARC-IP-Address\":\"104.24.96.16\",\"WARC-Target-URI\":\"http://num.bubble.ro/m/6000/12/\",\"WARC-Payload-Digest\":\"sha1:RHRZW6NHJWVMLC2JCNOMDJSEMG6JYKZ6\",\"WARC-Block-Digest\":\"sha1:Y2IVJGY3THEKZU6RHZ7A6ZBQI362GVQ5\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2020/CC-MAIN-2020-29/CC-MAIN-2020-29_segments_1593655886178.40_warc_CC-MAIN-20200704135515-20200704165515-00596.warc.gz\"}"}
|
https://reference.wolfram.com/language/ref/PolygonAngle.html
|
[
"# PolygonAngle\n\nPolygonAngle[poly]\n\ngives a list of angles at the vertex points of poly.\n\nPolygonAngle[poly,p]\n\ngives the angle at the vertex point p of a polygon poly.\n\nPolygonAngle[poly,i]\n\ngives the angle at the point pi of poly in canonical form Polygon[{p1,,pn},data].\n\nPolygonAngle[,\"spec\"]\n\ngives the angle specified by \"spec\".\n\n# Details",
null,
"• PolygonAngle is also known as interior angle.\n•",
null,
"• PolygonAngle[poly, p] gives the angle delimited by the two adjacent sides intersecting at p.\n• The following specifications \"spec\" can be given:\n• \"Interior\" interior (inside) angle at p \"Exterior\" exterior angle at p \"FullExterior\" full exterior angle at p\n•",
null,
"• PolygonAngle[poly,p,\"Interior\"] is equivalent to PolygonAngle[poly,p].\n• PolygonAngle[poly,p,\"Exterior\"] is equivalent to π-PolygonAngle[poly,p].\n• PolygonAngle[poly,p,\"FullExterior\"] is equivalent to 2π-PolygonAngle[poly,p].\n• PolygonAngle can be used with symbolic polygons in GeometricScene.\n\n# Examples\n\nopen all close all\n\n## Basic Examples(2)\n\nThe list of angles at the vertex points:\n\n In:=",
null,
"In:=",
null,
"Out=",
null,
"The angle at the vertex point {-2,0}:\n\n In:=",
null,
"In:=",
null,
"Out=",
null,
"The angle at the point 1 of in canonical form:\n\n In:=",
null,
"Out=",
null,
"## Properties & Relations(2)\n\nIntroduced in 2019\n(12.0)"
] |
[
null,
"https://reference.wolfram.com/language/ref/Files/PolygonAngle.en/details_1.png",
null,
"https://reference.wolfram.com/language/ref/Files/PolygonAngle.en/Image_1.gif",
null,
"https://reference.wolfram.com/language/ref/Files/PolygonAngle.en/Image_2.gif",
null,
"https://reference.wolfram.com/language/ref/Files/PolygonAngle.en/I_2.png",
null,
"https://reference.wolfram.com/language/ref/Files/PolygonAngle.en/I_4.png",
null,
"https://reference.wolfram.com/language/ref/Files/PolygonAngle.en/O_1.png",
null,
"https://reference.wolfram.com/language/ref/Files/PolygonAngle.en/I_6.png",
null,
"https://reference.wolfram.com/language/ref/Files/PolygonAngle.en/I_8.png",
null,
"https://reference.wolfram.com/language/ref/Files/PolygonAngle.en/O_2.png",
null,
"https://reference.wolfram.com/language/ref/Files/PolygonAngle.en/I_10.png",
null,
"https://reference.wolfram.com/language/ref/Files/PolygonAngle.en/O_3.png",
null
] |
{"ft_lang_label":"__label__en","ft_lang_prob":0.7442006,"math_prob":0.97627854,"size":965,"snap":"2019-43-2019-47","text_gpt3_token_len":248,"char_repetition_ratio":0.26118627,"word_repetition_ratio":0.016,"special_character_ratio":0.23523316,"punctuation_ratio":0.15819208,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9993827,"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,4,null,4,null,4,null,1,null,1,null,1,null,1,null,1,null,1,null,1,null,1,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2019-11-14T20:12:44Z\",\"WARC-Record-ID\":\"<urn:uuid:51a13a59-4d45-48b9-9681-353484b47212>\",\"Content-Length\":\"76901\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:fb9d0732-17ff-4918-8a9e-c9f806d8b71b>\",\"WARC-Concurrent-To\":\"<urn:uuid:b9b3d38f-f474-4f53-9b11-ca86aa5f4243>\",\"WARC-IP-Address\":\"140.177.205.163\",\"WARC-Target-URI\":\"https://reference.wolfram.com/language/ref/PolygonAngle.html\",\"WARC-Payload-Digest\":\"sha1:WBTQN47226ESFTPVSLRCQG6TVS6M7I2B\",\"WARC-Block-Digest\":\"sha1:QUJ5TKWCO5DT7CYNHMLGHAWTJL4L6W2B\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2019/CC-MAIN-2019-47/CC-MAIN-2019-47_segments_1573496668534.60_warc_CC-MAIN-20191114182304-20191114210304-00544.warc.gz\"}"}
|
http://blockchainjoblist.mkendo.com/2020/02/19/what-are-substantial-digits-in-math/
|
[
"",
null,
"19 2月 2020\n\n# In considering what are substantial digits in math, one particular might count on to hear the word “integrated.”\n\nHowever the answers for the question never actually relate to integral calculus and not even to composite algebra and trigonometry.\n\nWhat are substantial digits in math essay helper are these that refer to complete numbers, fractions, and even whole powers in the integers. They’re a kind of decimal notation that only specific functions can handle. The point of making use of them is the fact that they simplify complex numbers.\n\nDecimal notation is applied to indicate the position of a quantity, or the width of your decimal too as its place on the number line. Its advantage is that it can be stored very easily and understood quickly. It truly is easy to print out and tends to make understanding basic arithmetic considerably much easier.\n\nBut decimal notation is just not an integral form of math. All of its functions and operations usually do not make use of the decimal scale. These operations, on the other hand, let for easy computation of algebraic equations. https://www.purdue.edu/drc/ There are various techniques to illustrate the integral on the function a quadratic equation.\n\nThe 1st way is always to use the polynomial in which a polynomial from the true and imaginary parts is substituted for each portion with the original function. This shows that the second element from the polynomial will not depend on the first aspect.\n\nThe subsequent approach is usually to add the two terms with each other, add the solution in the item, and after that evaluate the sum to that on the quadratic. The third way will be to take the square root in the solution in the original and quadratic functions. And also the fourth way will be to multiply the quadratic by the third derivative. The fifth way would be to add the derivatives collectively.\n\nWhat are substantial digits in math are what essentially the most fundamental functions call coefficients. The coefficients are ratios in the original function towards the quadratic.\n\nIn addition to obtaining these specific functions, it really is also a crucial issue to possess integral functions that could be utilised for complex numbers. Integral functions offer you what is named the Geometric Mean and, as such, the quadratic has the identical value within the complicated plane as in the imaginary plane. Additionally they give you geometric transformations.\n\nIntegral functions also integrate. Actually, integrals might be applied to all of calculus. It will be nice if we could possess a quantity of integral functions at our disposal, but no function is often integrated with infinite precision.\n\nDecimal notation has yet another function. It allows for taking partial sums of various functions. This could be useful for solving complications involving partial sums, even when the functions getting integrated are integral functions.\n\nDecimal notation allows us to accomplish points like use fractions to evaluate a function and to compute the fraction, integral of that function. Decimal notation allows us to complete this because it only has to cope with numbers which can be handled by the usual functions."
] |
[
null,
"http://blockchainjoblist.mkendo.com/2020/02/19/what-are-substantial-digits-in-math/",
null
] |
{"ft_lang_label":"__label__en","ft_lang_prob":0.9279762,"math_prob":0.98865485,"size":3250,"snap":"2022-40-2023-06","text_gpt3_token_len":602,"char_repetition_ratio":0.15157117,"word_repetition_ratio":0.011516315,"special_character_ratio":0.18092307,"punctuation_ratio":0.088737205,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9928086,"pos_list":[0,1,2],"im_url_duplicate_count":[null,1,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2022-10-03T05:00:56Z\",\"WARC-Record-ID\":\"<urn:uuid:3020e504-3ddb-4983-a548-e732dd0fb255>\",\"Content-Length\":\"36214\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:2ff37148-d1c2-48f2-84b3-c84e00eceea7>\",\"WARC-Concurrent-To\":\"<urn:uuid:c6c8b8ae-2a39-481f-9419-91a42594eb8d>\",\"WARC-IP-Address\":\"54.248.255.249\",\"WARC-Target-URI\":\"http://blockchainjoblist.mkendo.com/2020/02/19/what-are-substantial-digits-in-math/\",\"WARC-Payload-Digest\":\"sha1:MCOCQLZAGTQALVXBXVZ3W7Y27TNCWFBD\",\"WARC-Block-Digest\":\"sha1:PYZWOKRGIWZVYEJHLMSRDXRH2IHTI4WL\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2022/CC-MAIN-2022-40/CC-MAIN-2022-40_segments_1664030337398.52_warc_CC-MAIN-20221003035124-20221003065124-00160.warc.gz\"}"}
|
https://nl.webqc.org/molecularweightcalculated-190324-66.html
|
[
"",
null,
"#### Chemical Equations Balanced on 03/24/19\n\n Molecular weights calculated on 03/23/19 Molecular weights calculated on 03/25/19\nCalculate molecular weight\n 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\nMolar mass of (C2H5)2NH2Br is 154.04878\nMolar mass of H2SO4 is 98,07848\nMolar mass of C6H7N is 93.12648\nMolar mass of BaCl2 is 208,233\nMolar mass of CHN is 27.02534\nMolar mass of C2H2N2 is 54.05068\nMolar mass of O2(g) is 31,9988\nMolar mass of ((NH2)2CO) is 60.05526\nMolar mass of C3H3N3 is 81.07602\nMolar mass of C2H5OH is 46,06844\nMolar mass of Ca(OH)2 is 74,09268\nMolar mass of C3H6N3 is 84.09984\nMolar mass of CaCo3 is 216,877585\nMolar mass of TiO2 is 79.8658\nMolar mass of C3H10N3 is 88.1316\nMolar mass of HOOCC6H4OOCCH3 is 180.15742\nMolar mass of C4H10N3 is 100.1423\nMolar mass of C6H12O6 is 180,15588\nMolar mass of C4H11N3 is 101.15024\nMolar mass of h3po4 is 838.9535416\nMolar mass of C4H12N3 is 102.15818\nMolar mass of Ca is 40,078\nMolar mass of C4H11N is 73.13684\nMolar mass of KSCN is 97.1807\nMolar mass of C2H8N2 is 60.09832\nMolar mass of CO3 is 60,0089\nMolar mass of H3PO4 is 97.995182\nMolar mass of Zn4Al is 288,5015386\nMolar mass of NaCH3COO is 82.03378928\nMolar mass of NaCN is 49,00716928\nMolar mass of Ca is 40.078\nMolar mass of HNO3 is 63.01284\nMolar mass of HCN is 27,02534\nMolar mass of P3O10 is 252,915286\nMolar mass of C2H2Cl2 is 96.94328\nMolar mass of h2o is 18.01528\nMolar mass of CH3NH3Cl is 67.51804\nMolar mass of Zn(NO3)2 is 189.3898\nMolar mass of Fe(NH4) (SO4) 2*6H2O is 374,10034\nMolar mass of C3H12N2 is 76.14078\nMolar mass of K4[Pb(OH)6] is 465.63724\nMolar mass of Fe2O3 is 159.6882\nMolar mass of NaOH is 39.99710928\nMolar mass of Cd(NO3)2 is 236.4208\nMolar mass of C4H12N2 is 88.15148\nMolar mass of Hg(NO3)2 is 324.5998\nMolar mass of C6H12O6 is 180.15588\nMolar mass of Fe3O4 is 231.5326\nMolar mass of C2H2Cl3 is 132.39628\nMolar mass of C5H12N is 86.15548\n 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\nCalculate molecular weight\n Molecular weights calculated on 03/23/19 Molecular weights calculated on 03/25/19\nMolecular masses on 03/17/19\nMolecular masses on 02/22/19\nMolecular masses on 03/24/18\nBij het gebruiken van deze website, accepteer je de Terms and Conditions en Privacy Policy.\n© 2019 webqc.org Alle rechten voorbehouden\n Periodiek systeem Eenheden omrekenen Chemie gereedschappen Chemisch Forum Chemie FAQ Constanten Symmetrie Chemie links Link naar ons Neem contact met ons op Stel een betere vertaling voor Kies een taalDeutschEnglishEspañolFrançaisItalianoNederlandsPolskiPortuguêsРусский中文日本語한국어 Hoe moet je citeren? WebQC.Org online onderwijs gratis huiswerkhulp chemische opgaven vragen en antwoorden"
] |
[
null,
"https://nl.webqc.org/images/logo.png",
null
] |
{"ft_lang_label":"__label__en","ft_lang_prob":0.7874992,"math_prob":0.9469048,"size":1882,"snap":"2019-51-2020-05","text_gpt3_token_len":852,"char_repetition_ratio":0.38338658,"word_repetition_ratio":0.0121951215,"special_character_ratio":0.47874603,"punctuation_ratio":0.11504425,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9594178,"pos_list":[0,1,2],"im_url_duplicate_count":[null,null,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2019-12-09T18:49:59Z\",\"WARC-Record-ID\":\"<urn:uuid:c017cd85-3bce-41c0-97cb-df92ae28d651>\",\"Content-Length\":\"48814\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:491a77c0-5660-4720-b376-4884ca8c504d>\",\"WARC-Concurrent-To\":\"<urn:uuid:6be49efa-89b0-4458-92e2-ce44bc94922e>\",\"WARC-IP-Address\":\"104.27.140.247\",\"WARC-Target-URI\":\"https://nl.webqc.org/molecularweightcalculated-190324-66.html\",\"WARC-Payload-Digest\":\"sha1:VV3FFEZE7TJVFR7DELKHHGP5QBFN2ADZ\",\"WARC-Block-Digest\":\"sha1:PPSIWW6TTELZ45NQOOATU7JISPXJKXHZ\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2019/CC-MAIN-2019-51/CC-MAIN-2019-51_segments_1575540521378.25_warc_CC-MAIN-20191209173528-20191209201528-00515.warc.gz\"}"}
|
https://www.shaalaa.com/concept-notes/applications-of-compound-interest-formula_7837
|
[
"Advertisement Remove all ads\n\n# Applications of Compound Interest Formula\n\nAdvertisement Remove all ads\n\n# Applications of Compound Interest Formula:\n\nThere are some situations where we could use the formula for calculation of amount in CI. Here are a few.\n1. Increase (or decrease) in population.\n2. The growth of bacteria if the rate of growth is known.\n3. The value of an item, if its price increases or decreases in the intermediate years.\n\n#### Example\n\nThe population of a city was 20,000 in the year 1997. It increased at the rate of 5% p.a. Find the population at the end of the year 2000.\n\nThere is 5% increase in population every year, so every new year has new population.\n\nPopulation in the beginning of 1998 = 20000\nIncrease at 5% = 5/100 × 20000 = 1000\nPopulation in 1999 = 20000 + 1000 = 21000\n\nIncrease at 5% = 5/100 × 21000 = 1050\nPopulation in 2000 = 21000 + 1050 = 22050\n\nIncrease at 5% = 5/100 × 22050 = 1102.5\nAt the end of 2000 the population = 22050 + 1102.5 = 23152.5\n\nPopulation at the end of 2000 = 20000 (1+5/100)^3\n= 20000 xx 21/20 xx 21/20 xx 21/20\n= 23152.5\nSo, the estimated population = 23153.\n\n#### Example\n\nA TV was bought at a price of ₹ 21,000. After one year the value of the TV was depreciated by 5% (Depreciation means reduction of value due to use and age of\nthe item). Find the value of the TV after one year.\nPrincipal = ₹ 21,000\nReduction = 5% of ₹ 21000 per year\n= ₹ (21000 xx 5 xx 1)/100\n= ₹ 1050\nValue at the end of 1 year = ₹ 21000 - ₹ 1050 = ₹ 19,950.\n\nValue at the end of 1 year = ₹ 21000(1 - 5/100)\n\n= ₹ 21000 xx 19/20\n\n= ₹ 19,950.\n\nIf you would like to contribute notes or other learning material, please submit them using the button below.\n\n### Shaalaa.com\n\nApplications of Compound Interest [00:14:44]\nS\n##### Series: Applications of Compound Interest\n0%\n\nAdvertisement Remove all ads\nShare\nNotifications\n\nView all notifications\n\nForgot password?"
] |
[
null
] |
{"ft_lang_label":"__label__en","ft_lang_prob":0.8174147,"math_prob":0.9899523,"size":7723,"snap":"2021-04-2021-17","text_gpt3_token_len":1976,"char_repetition_ratio":0.14185776,"word_repetition_ratio":0.125,"special_character_ratio":0.24614787,"punctuation_ratio":0.06964006,"nsfw_num_words":4,"has_unicode_error":false,"math_prob_llama3":0.9975741,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2021-04-20T15:51:36Z\",\"WARC-Record-ID\":\"<urn:uuid:5acf654e-a828-422b-a204-44917295aa22>\",\"Content-Length\":\"167459\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:d171e50a-7159-405d-b139-6b5e533b4c8a>\",\"WARC-Concurrent-To\":\"<urn:uuid:18a5be91-7d36-4781-a412-3fe0d6df4bac>\",\"WARC-IP-Address\":\"172.105.37.75\",\"WARC-Target-URI\":\"https://www.shaalaa.com/concept-notes/applications-of-compound-interest-formula_7837\",\"WARC-Payload-Digest\":\"sha1:ZDRODHXKTPE66SZNJJN7PZONLXLKSCUB\",\"WARC-Block-Digest\":\"sha1:AN6GQYEBBRMQ3WQW7I5VNQRUMBUUDQQH\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2021/CC-MAIN-2021-17/CC-MAIN-2021-17_segments_1618039476006.77_warc_CC-MAIN-20210420152755-20210420182755-00426.warc.gz\"}"}
|
https://www.percent-off.com/_80_percent-off_3092_
|
[
"# 80 percent off 3092\n\n### Inputs\n\nOriginal price: \\$\n\nDiscount percentage: %\n\nDiscount:\nFinal Price:\n\n### Details\n\nHow to calculate 80 percent-off \\$3092. How to figure out percentages off a price. Using this calculator you will find that the amount after the discount is \\$618.4. To find any discount, just use our Discount Calculator above.\n\nUsing this calculator you can find the discount value and the discounted price of an item. It is helpfull to answer questions like:\n\n• What is 80 percent (%) off \\$3092?\n• What is \\$3092 minus 80 percent (%) off?\n• How to calculate 80 percent off \\$3092?\n• How much will you pay for an item where the original price before discount is \\$3092 when discounted 80 percent (%)? What is the final or sale price?\n• \\$2473.6 is what percent off \\$3092?\n\n## Percent-off Formulas\n\nTo calculate discount it is ease by using the following formulas:\n\n(a) Amount Saved = Orig. Price x Discount % / 100\n(b) Sale Price = Orig. Price - Amount Saved\n\n## How to calculate 80 Percent-off\n\nNow, let's solve the questions stated above:\n\n## FAQs on Percent-off\n\n### What's 80 percent-off \\$3092?\n\nReplacing the given values in formula (a) we have:\n\nAmount Saved = Original Price x Discount in Percent / 100. So,\n\nAmount Saved = 3092 x 80 / 100\n\nAmount Saved = 247360 / 100\n\nIn other words, a 80% discount for a item with original price of \\$3092 is equal to \\$2473.6 (Amount Saved).\n\nNote that to find the amount saved, just multiply it by the percentage and divide by 100.\n\n### What's the final price of an item of \\$3092 when discounted \\$2473.6?\n\nUsing the formula (b) and replacing the given values:\n\nSale Price = Original Price - Amount Saved. So,\n\nSale Price = 3092 - 2473.6\n\nThis means the cost of the item to you is \\$618.4.\n\nYou will pay \\$618.4 for a item with original price of \\$3092 when discounted 80%.\n\nIn this example, if you buy an item at \\$3092 with 80% discount, you will pay 3092 - 2474 = 618.4 dollars.\n\n### 2473.6 is what percent off 3092 dollars?\n\nUsing the formula (b) and replacing given values:\n\nAmount Saved = Original Price x Discount in Percent /100. So,\n\n2473.6 = 3092 x Discount in Percent / 100\n\n2473.6 / 3092 = Discount in Percent /100\n\n100 x 2473.6 / 3092 = Discount in Percent\n\n247360 / 3092 = Discount in Percent, or\n\nDiscount in Percent = 80 (answer).\n\nTo find more examples, just choose one at the bottom of this page."
] |
[
null
] |
{"ft_lang_label":"__label__en","ft_lang_prob":0.86597806,"math_prob":0.95751125,"size":2394,"snap":"2023-40-2023-50","text_gpt3_token_len":635,"char_repetition_ratio":0.17573221,"word_repetition_ratio":0.076744184,"special_character_ratio":0.33166248,"punctuation_ratio":0.1301653,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9973203,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2023-11-29T01:58:47Z\",\"WARC-Record-ID\":\"<urn:uuid:a6366589-2571-4980-b6c7-570be8138761>\",\"Content-Length\":\"51892\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:842db838-3449-4fb9-8c7a-fd056336eee6>\",\"WARC-Concurrent-To\":\"<urn:uuid:91f467bb-668c-4cc5-8d70-1071f5f195f8>\",\"WARC-IP-Address\":\"104.21.23.169\",\"WARC-Target-URI\":\"https://www.percent-off.com/_80_percent-off_3092_\",\"WARC-Payload-Digest\":\"sha1:XKOFM3VMG5YHR7VONZ6IU2ALRZBMLPF7\",\"WARC-Block-Digest\":\"sha1:35CVYBBPJFX3DTBCYO65BJYPG5MZTQQO\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2023/CC-MAIN-2023-50/CC-MAIN-2023-50_segments_1700679100047.66_warc_CC-MAIN-20231129010302-20231129040302-00257.warc.gz\"}"}
|
https://tex.stackexchange.com/questions/482081/tex4ebook-or-tex4ht-doesnt-treat-newcommand-and-sub-supscript-well-in-math-mo
|
[
"# tex4ebook (or tex4ht) doesn't treat newcommand and sub/supscript well in math mode\n\nI found that tex4ebook (or tex4ht) doesn't treat well with subscripts or superscripts in \\newcommand. For example,\n\n\\documentclass{amsart}\n\n\\newcommand\\dotimes{{\\otimes}^{\\mathbb L}}\n\\newcommand\\powerab{a^b}\n\n\\begin{document}\nLet's see $M\\dotimes N$.\n\nLet's see $M{\\otimes}^{\\mathbb L}_RN$.\n\nLet's see $\\powerab c$.\n\\end{document}\n\n\nThe \\dotimes and \\powerab are rendered wrongly (for example, here \\powerab is rendered as ab (b seems rendered somewhat smaller, but not as a superscript), rather than a^b) without pic-m option. Is it good to replace newcommand by something else?\n\nSub and super scripts are bit complicated. tex4ht is being activated only after \\begin{document}, so the commands defined in the preamble cannot use the configurations for sub and superscripts that are used later in the document. It is possible to use the early^ and early_ options to fix that:\n\ntex4ebook filename.tex \"early_,early^\"\n\n\nBetter solution is to use the \\sp and \\sb commands, which works always:\n\n\\documentclass{amsart}\n\n\\newcommand\\dotimes{{\\otimes}\\sp{\\mathbb L}}\n\\newcommand\\powerab{a\\sp{b}}\n\n\\begin{document}\nLet's see $M\\dotimes N$.\n\nLet's see $M{\\otimes}^{\\mathbb L}_RN$.\n\nLet's see $\\powerab c$.\n\\end{document}",
null,
"• Can we put early^ and early_ in some way into config.cfg? Mar 29, 2019 at 11:23\n• @FrankScience it seems that it is not possible, because the .cfg file is read at the end of preamble as well Mar 29, 2019 at 12:21"
] |
[
null,
"https://i.stack.imgur.com/UC4SG.png",
null
] |
{"ft_lang_label":"__label__en","ft_lang_prob":0.79810566,"math_prob":0.7572909,"size":572,"snap":"2022-27-2022-33","text_gpt3_token_len":173,"char_repetition_ratio":0.13028169,"word_repetition_ratio":0.0,"special_character_ratio":0.25,"punctuation_ratio":0.1,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9808137,"pos_list":[0,1,2],"im_url_duplicate_count":[null,1,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2022-06-28T21:27:12Z\",\"WARC-Record-ID\":\"<urn:uuid:70779c96-c95e-4f03-a75a-a114a58e6d92>\",\"Content-Length\":\"227958\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:8f12ba9b-0a63-41d9-b9d2-c531b66e7c2f>\",\"WARC-Concurrent-To\":\"<urn:uuid:94bc62b8-ddec-45d9-ba2e-ee6b1d2a0c6e>\",\"WARC-IP-Address\":\"151.101.65.69\",\"WARC-Target-URI\":\"https://tex.stackexchange.com/questions/482081/tex4ebook-or-tex4ht-doesnt-treat-newcommand-and-sub-supscript-well-in-math-mo\",\"WARC-Payload-Digest\":\"sha1:NUY4NNKQ6ZLNLOK6CEANQKTX7ZTKRLVI\",\"WARC-Block-Digest\":\"sha1:ICJHS2JH5MHCJ3GOMVL472ZBGF7SSNYQ\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2022/CC-MAIN-2022-27/CC-MAIN-2022-27_segments_1656103617931.31_warc_CC-MAIN-20220628203615-20220628233615-00710.warc.gz\"}"}
|
https://www.studiestoday.com/ncert-solution/ncert-solution-class-11-statistics-measures-central-tendency-234873.html
|
[
"# NCERT Solution Class 11 Statistics Measures of Central Tendency\n\nNCERT Solution Class 11 Statistics Measures of Central Tendency with answers available in Pdf for free download. The NCERT Solutions for Class 11 Economics with answers have been prepared as per the latest syllabus, NCERT books and examination pattern suggested in Standard 11 by CBSE, NCERT and KVS. Solutions to questions given in NCERT book for Class 11 Economics are an important part of exams for Grade 11 Economics and if practiced properly can help you to get higher marks. Refer to more Chapter-wise Solutions for NCERT Class 11 Economics and also download more latest study material for all subjects\n\n## Measures of Central Tendency Class 11 NCERT Solutions\n\nClass 11 Economics students should refer to the following NCERT questions with answers for Measures of Central Tendency in standard 11. These NCERT Solutions with answers for Grade 11 Economics will come in exams and help you to score good marks\n\n### Measures of Central Tendency NCERT Solutions Class 11\n\nNCERT Solution for Class 11 Statistics for chapter 5 Measures of Central Tendency\n\nExercises\n\nQ1. Which average would be suitable in following cases?\n\n(ii) Average intelligence of students in a class.\n\n(iii) Average production in a factory per shift.\n\n(iv) Average wage in an industrial concern.\n\n(v) When the sum of absolute deviations from average is least.\n\n(vi) When quantities of the variable are in ratios.\n\n(vii) In case of open-ended frequency distribution.\n\nExplanation: Mode is suitable average for average size of readymade garments because it gives the most frequent occurring value.\n\n(ii) Average intelligence of students in a class. Median\n\nExplanation: Median is a suitable average in case of a qualitative nature of the data.\n\n(iii) Average production in a factory per shift. Mean\n\nExplanation: Production can be measured on a quantitative scale so Arithmetic mean is suitable in this case.\n\n(iv) Average wage in an industrial concern. Mean\n\nExplanation: Wage can be measured on a quantitative scale so arithmetic mean is suitable in this case.\n\n(v) When the sum of absolute deviations from average is least. Mean\n\nExplanation: Mean shall be used because sum of deviations from mean is always zero or least than the other averages.\n\n(vi) When quantities of the variable are in ratios. Mean\n\nExplanation: Ratios are quantitative, so it is suitable to use arithmetic mean.\n\n(vii) In case of open-ended frequency distribution. Median\n\nExplanation: Median is used because there is no need to adjust class size or magnitude for using median.\n\nQ2. Indicate the most appropriate alternative from the multiple choices provided against each question.\n\n(i) The most suitable average for qualitative measurement is\n\n(a) Arithmetic mean\n\n(b) Median\n\n(c) Mode\n\n(d) Geometric mean\n\n(e) None of the above\n\n(ii) Which average is affected most by the presence of extreme items?\n\n(a) Median\n\n(b) Mode\n\n(c) Arithmetic mean\n\n(d) None of the above\n\n(iii) The algebraic sum of deviation of a set of n values from A.M is\n\n(a) N\n\n(b) 0\n\n(c) 1\n\n(d) none of the above\n\n(i) The most suitable average for qualitative measurement is Median.\n\n(ii) Arithmetic mean is the average affected by the presence of the extreme values.\n\n(iii) 0 is the sum of deviations of a set of n values from AM.\n\nQ3. Comment whether the following statements are true or false.\n\n(i) The sum of deviation of items from median is zero.\n\n(ii) An average alone is not enough to compare series. (iii) Arithmetic mean is a positional value.\n\n(iv) Upper quartile is the lowest value of top 25% of items.\n\n(v) Median is unduly affected by extreme observations.\n\n(i) The sum of deviation of items from median is zero. False\n\nExplanation: Generally, sum of deviations from mean is zero; but only in the case of symmetric distribution (mean=median=mode) above statement is true.\n\n(ii) An average alone is not enough to compare series. True\n\nExplanation: Averages are very rigid values, they don’t say anything about the variability of the series, and thus they are not enough to compare series.\n\n(iii) Arithmetic mean is a positional value. False\n\nExplanation: Arithmetic mean is not a positional value because it is calculated on the basis of all the observations.\n\n(iv) Upper quartile is the lowest value of top 25% of items. True\n\nExplanation: Quartile refers to a quarter, so when the frequency is arranged in a ascending order the upper quartile refers to the first 25% of the items.\n\n(v) Median is unduly affected by extreme observations. False\n\nExplanation: Median doesn’t get affected by extreme observations because it only takes the median class to calculate it. It is mean which gets affected by extreme observations.\n\nQ4. If the arithmetic mean of the data given below is 28, find\n(a) the missing frequency, and\n(b) the median of the series:\n\n Profit per retail shop (in Rs ) 0-10 10 -20 20-30 30-40 40-50 50-60 Number of retail shops 12 18 27 - 17 6\n\n(a) Let us take the missing frequency as x\n\n Profit per retail shop (in Rs .) (X) Number of retail shops (f) Mid values (m) fm 0-1010-2020-3030-4040-5050-60 121827 x176 51525354555 6027067535x765330 ∑f = 80 + x ∑Fm = 2100 + 35x\n\nMean = ∑fm/∑f Mean = 28\n\nSubstituting the values in the formula we get,\n\n28 = 2100 + 35x\n80 + x\n\n28 x (80 + x) = 2100 + 35x\n\n2240 + 28x = 2100 + 35x\n\n7x = 140 x = 20\n\nThus, the missing value frequency is 20.\n\n(b)\n\n Profit per retail shop(in Rs ) (X) Number of retail shops (f) Cumulative frequency (cf) 0-1010-2020-3030-4040-5050-60 12182720176 1230577794100 ∑f = 100\n\nFormula of median is as follow: Median\n= L + (N/2 – c.f) x h\nf\n\nBy substituting the value in the formula we get,\n\nMedian = 20 + (50 – 30) x (30-20)\n27\n\nMedian = 20 + (20) x (10) = 20 + 200 = 20 + 7.41 = 27.41\n27 27\n\nThus the median value of the series is 27.41.\n\nQ5. The following table gives the daily income of ten workers in a factory. Find the arithmetic mean.\n\n Workers A B C D E F G H I J Daily Income (in Rs .) 120 150 180 200 250 300 220 350 370 260\n\nFormula of mean is as follow:\n\nMean = Sum of all the observations\nNo. of observations\n\n= 120+150+180+200+25+300+220+35+370+26\n10\n\n= 2400 = 240\n\n10\n\nThus, average income of the workers is Rs 240.\n\nQ6. Following information pertains to the daily income of 150 families\n\nCalculate the arithmetic mean.\n\n Income (in Rs) Number of families More than 75 150 More than 85 140 More than 95 115 More than 105 95 More than 115 70 More than 125 60 More than 135 40 More than 145 25\n\n Income (in Rs.) Number of families f) Mid values (x) fx 75-8585-9595-105105-115115-125125-135135-145145-155 1025202510201525 8090100110120130140150 8002250200027501200260021003750 ∑f = 150 ∑fx = 17450\n Formula of mean is as follow: Mean = Sum of all the observations No. of observations = ∑fx ∑f\n\n= 17450/150 = 116.33\n\nThus, the average mean income for 150 families is Rs . 116.33.\n\n Size of Land Holdings (in acres) Less than100 100-200 200-300 300-400 400 and above Number of families 40 89 148 64 39\n\nQ7. The size of land holdings of 380 families in a village is given below. Find the median size of land holdings.\n\nTo calculate the mean size of holding, first calculate the cumulative frequency.\n\n Size of land holdings (in acres) (X) Number of families (f) Cumulative frequency (cf) 0-100100-200200-300300-400400-500 40891486439 40129277341380 ∑f =380\n\nThen, find the median frequency\n\nMedian frequency = N/2 = 380/2 = 190\n\nFormula of median is as follow: Median = L + (N/2 – c.f) x h\nf\n\nBy substituting the value in the formula we get,\n\n= 200 + (190 – 129) x 100 = 241.21\n148\n\nThus, the median size of land holding is 241.21 acres.\n\nQ8. The following series relates to the daily income of workers employed in affirm. Compute (a) highest income of lowest 50% workers (b) minimum income earned by the top 25% workers and (c) maximum income earned by 25% workers.\n\n Daily Income (in Rs ) 10-14 15-19 20-24 25-29 30-34 35-39 Numbers of workers 5 10 15 20 10 5\n\n Daily income(in Rs ) Class interval (X) Number of workers (f) Cumulative frequency (cf) 10-1415-1920-2425-2930-3435-39 9.5-14.514.5-19.519.5-24.524.5-29.529.5-34.534.5-39.5 5101520105 51530506065 ∑f = 65\n\na) To compute highest income of lowest 50% we need to calculate median\n\nMedian frequency = N/2 = 65/2 = 32.5\n\nFormula for median is s follows\n\nMedian = L + (N/2 – c.f) x h\nf\n\nBy substituting the values in the formula, we get\n\nMedian = 24.5 + (32.5 –30) x 5\n20\n\n= 24.5 + 0.625 = 25.125\n\nHighest income of lowest 50% workers is Rs 25.125.\n\nb) For minimum income of 25% of workers we need to calculate Q1.\n\nFirst Quartile frequency = D/4 = 65/4 = 16.25\n\nQ1 = L + (N/4 – c.f) x h\nf\n\nBy substituting the values in the formula, we get\n\nQ1 = 19.5 + (16.25 15) x 5 = 19.9166\n15\n\nMinimum income earned by the top 25% workers is Rs 19.92.\n\nc) For maximum income of 25% of workers we need to calculate Q3.\n\nThird quartile frequency = 3(D/4) = 3 (65/4)= 48.75\n\nQ3 = L + (3(N/4) – c.f) x h\nf\n\nBy substituting the values in the formula, we get\n\nQ3 = 24.5 + (48.75 30) x 5\n20\n\n= 24.5 + 4.6875 = 29.1875\n\nMaximum income earned by 25% workers is Rs 29.19.\n\nQ9. The following table gives production yield in kg. per hectare of wheat of 150 farms in a village. Calculate the mean, median and mode values.\n\n Production yield (kg. per hectare) 50-53 53-56 56-59 59-62 62-65 65-68 68-71 71-74 74-77 Number of farms 3 8 14 30 36 28 16 10 5\n\nTo calculate mean, median and mode values\n\n Production yield (kg per hectare) (X) Number of farms (f) Mid values(m) Cumulative Frequency (cf) fm 50-5353-5656-5959-6262-6565-6868-7171-7474-77 381430362816105 51.554.557.560.563.566.569.572.575.5 311255591119135145150 154.54368051815228618621112725377.5 ∑f =150 ∑fm= 9573\n\nFormula of mean is as follows:\n\nMean = ∑fm = 9573/150 = 63.82 kg/hectare\n∑f\n\nFormula of median is as follows: Median = L + (N/2 – cf) x h\nf\n\nBy substituting the value in the formula we get,\n\n= 62 + (75 – 55) x 3\n36\n\n= 62 + 1.67 = 63.67 kg/hectare\n\nFormula of mode is as follows: Mode = L + d1 x h\nd1 + d2\n\nBy substituting the value in the formula we get,\n\n= 62 + 6/6+8 x 3 = 62 + 18/14 = 62 + 1.28\n\n= 63.28 kg/hectare\n\nMean, median and mode values are 63.82 kg/hectare, 63.67 kg/hectare and 63.28 kg/hectare.\n\n## Tags:\n\nClick for more Economics Study Material\n NCERT Solutions Class 11 Economics Indian Economy on the Eve of Independence\n NCERT Solutions Class 11 Economics Indian Economy 1950 1990\n NCERT Solutions Class 11 Economics Liberalisation Privatisation And Globalisation An Appraisal\n NCERT Solutions Class 11 Economics Poverty\n NCERT Solutions Class 11 Economics Human Capital Formation in India\n NCERT Solutions Class 11 Economics Rural Development\n NCERT Solutions Class 11 Economics Employment Growth Informalisation and other Issues\n NCERT Solutions Class 11 Economics Infrastructure\n NCERT Solutions Class 11 Economics Environment and Sustainable Development\n NCERT Solutions Class 11 Economics Comparative Development Experiences of India and Its Neighbors\n NCERT Solution Class 11 Statistics Introduction\n NCERT Solution Class 11 Statistics Collection of Data\n NCERT Solution Class 11 Statistics Organisation of Data\n NCERT Solution Class 11 Statistics Presentation of Data\n NCERT Solution Class 11 Statistics Measures of Central Tendency\n NCERT Solution Class 11 Statistics Measures of Dispersion\n NCERT Solution Class 11 Statistics Correlation\n NCERT Solution Class 11 Statistics Index Numbers\n\n## Latest NCERT & CBSE News\n\nRead the latest news and announcements from NCERT and CBSE below. Important updates relating to your studies which will help you to keep yourself updated with latest happenings in school level education. Keep yourself updated with all latest news and also read articles from teachers which will help you to improve your studies, increase motivation level and promote faster learning\n\n### MCQ Question based CBSE examination\n\nFor 2021-22 CBSE has launched MCQ question-based examination for Term 1 & Term 2 board examinations. The entire syllabus has been divided into two parts each including 50% of the entire syllabus. To score well, students must practice as per the new CBSE term-wise...\n\n### How To Solve Unseen Passages In English\n\nUnseen passages may contain one or many paragraphs. This is one of the important yet easy parts for a student to get marks. Students should thoroughly study and understand the passage to answer the related questions. The unseen passages are there just to test the...\n\n### CBSE Class 10 Revised Syllabus\n\nLast year CBSE had to reduce the syllabus because of the pandemic situation but it was not very effective because there were no examinations. This year to avoid any confusion and conflict, CBSE has decided to reduce the syllabus into term 1 and term 2. 50 percent of...\n\n### Score well in Class 12 English Boards Exam\n\n12th Board exams are an important part of students' lives. The marks obtained in the board exam decide the college in which one can study. In class 12 the syllabus of each and every subject increases vastly and it is difficult to cover up every point. In English also...\n\n×"
] |
[
null
] |
{"ft_lang_label":"__label__en","ft_lang_prob":0.8222259,"math_prob":0.9664179,"size":11107,"snap":"2021-43-2021-49","text_gpt3_token_len":3321,"char_repetition_ratio":0.13680987,"word_repetition_ratio":0.18096182,"special_character_ratio":0.34113622,"punctuation_ratio":0.08916084,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.99221134,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2021-10-23T23:33:03Z\",\"WARC-Record-ID\":\"<urn:uuid:42b0fde1-a8bd-4379-9466-eaf059ff13a7>\",\"Content-Length\":\"114916\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:3a6170b9-28a8-4b57-86c6-dd20c04ef991>\",\"WARC-Concurrent-To\":\"<urn:uuid:929dd418-e01a-4eb8-a7c0-e68b14074abe>\",\"WARC-IP-Address\":\"192.124.249.102\",\"WARC-Target-URI\":\"https://www.studiestoday.com/ncert-solution/ncert-solution-class-11-statistics-measures-central-tendency-234873.html\",\"WARC-Payload-Digest\":\"sha1:AXUWH5EJMZSFSOID65GWPLO5SNAWMUD4\",\"WARC-Block-Digest\":\"sha1:AKZP7EZWYHZNDTTUA6GXOGKLRPQPBX7A\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2021/CC-MAIN-2021-43/CC-MAIN-2021-43_segments_1634323585828.15_warc_CC-MAIN-20211023224247-20211024014247-00150.warc.gz\"}"}
|
https://supertips.tk/829775.html
|
[
"Basic differential calculus pdf\n\n2019-10-20 06:40\n\nfor students who are taking a di erential calculus course at Simon Fraser University. The Collection contains problems given at Math 151 Calculus I and Math 150 Calculus I With Review nal exams in the period. The problems are sorted by topicIntroduction to Dierential Calculus Christopher Thomas c 1997 University of Sydney. Acknowledgements Some parts of this booklet appeared in a similar form in the booklet Review of Dierentiation Techniques published by the Mathematics Learning Centre. basic differential calculus pdf\n\nMassachusetts Institute of Technology Department of Physics Physics 8. 962 Spring 1999 Introduction to Tensor Calculus for General Relativity c 1999 Edmund Bertschinger.\n\nSection 33: Differentiation Formulas. In the first section of this chapter we saw the definition of the derivative and we computed a couple of derivatives using the definition. As we saw in those examples there was a fair amount of work involved in computing the limits and the functions that we worked with were not terribly complicated. Algebra, Topology, Differential Calculus, and Optimization basic differential calculus pdf Lecture Notes on Integral Calculus UBC Math 103 Lecture Notes by YueXian Li (Spring, 2004) 1 Introduction and highlights Di erential calculus you learned in the past term was about di erentiation.\n\n1 BASIC CALCULUS REFRESHER Ismor Fischer, Ph. D. , Dept. of Statistics, UWMadison 1. Introduction. This is a very condensed and simplified version of basic calculus, which is a basic differential calculus pdf Appendix G. 1 Differentiation and Integration Formulas G1 Basic Equations Typical Graphs of Supply and Demand Curves Supply curves increase as price increases and demand curves decrease as price increases. The equilibrium point occurs when the supply and demand curves intersect. Calculus; The Basic Differentiation Rules; The Basic Differentiation Rules. Some differentiation rules are a snap to remember and use. These include the constant rule, power rule, constant multiple rule, sum rule, and difference rule. The constant rule: This is simple. 8 Basic Dierentiation A Refresher 4. Dierentiation of a simple power multiplied by a constant To dierentiate s atn where a is a constant. Example Bring the existing power down and use it to multiply. s 3t4 Reduce the old power by one and use this as the new power. Basic Functions and their Graphs. Integral Calculus and the Action of Forces. The links Flowchart, Computations, and Use this Text, are pdf files that can be accessed with Acrobat Reader. Calculus Basic Calculus: Differential and Integral Calculus and Science, 2002. For\n\nRating: 4.65 / Views: 908\n2019 © supertips.tk | Sitemap"
] |
[
null
] |
{"ft_lang_label":"__label__en","ft_lang_prob":0.886269,"math_prob":0.9457128,"size":2690,"snap":"2019-43-2019-47","text_gpt3_token_len":576,"char_repetition_ratio":0.16008936,"word_repetition_ratio":0.0,"special_character_ratio":0.20037174,"punctuation_ratio":0.11578947,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9974677,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2019-10-20T05:40:38Z\",\"WARC-Record-ID\":\"<urn:uuid:b25c3136-6ca8-47e1-a096-c460a869ef78>\",\"Content-Length\":\"7924\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:15e8598b-a80a-41b0-ac67-57927c82acc8>\",\"WARC-Concurrent-To\":\"<urn:uuid:8245624c-d711-4b73-bb85-3287bfb7be58>\",\"WARC-IP-Address\":\"104.27.164.129\",\"WARC-Target-URI\":\"https://supertips.tk/829775.html\",\"WARC-Payload-Digest\":\"sha1:HVXP5HPYVATUKZ745GJY2VYUG4SBJUAB\",\"WARC-Block-Digest\":\"sha1:2QGNOAC3CYEQRWINDH34T3V47OATIVU4\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2019/CC-MAIN-2019-43/CC-MAIN-2019-43_segments_1570986703625.46_warc_CC-MAIN-20191020053545-20191020081045-00022.warc.gz\"}"}
|
https://www.italblends.com/cyy/1234.html
|
[
"# C语言C语言之“指针”,论如何通俗易懂的学C语言",
null,
"int a =\n5;这是C语言中创造变量的言语,它内存中随机的一个地方及放了一个反复5,我们怎么下它为,就是之所以字符a代表其。\n\nint* b = &a;这是C语言中赋值地址之口舌,其中int*\n\n&a,这是抱地址的语句,从点可以知晓,a代表的是5,可是a不是地点,那么a的地方该怎么表示也,在a的眼前加上字符&,也就是&a代表的是a的地址。\n\n”就表示a了。大家自然要是打懂“ * ”的用法,前面不要打瞎了\n\nint* 表示取指针,在地方前面加上“ *\n”,表示的凡是地点上所存放的数据,这个吧即是指针和地方的关系,所以说他们是密不可分相连的。",
null,
"",
null,
"int max(int a ,intb)\n\n{\n\nif(a > b)\n\n{\n\nreturn a;\n\n}\n\nelse\n\n{\n\nreturn b;\n\n}\n\n}\n\nswap(int x,int y)\n\n{\n\nint temp;\n\ntemp=x;\n\nx=y;\n\ny=temp;\n\n}\n\nint main\n\n{\n\nint a = 5;\n\nint b = 4;\n\nswap(a,b) ;\n\nprintf(“%d,%d “,a,b);\n\n}\n\nswap(int *x,int *y)\n\n{\n\nint temp;\n\ntemp=*x;\n\n* x=*y;\n\n* y=temp;\n\n}\n\nint main\n\n{\n\nint a = 5;\n\nint b = 4;\n\nswap(&a,&b) ;\n\nprintf(“%d,%d “,a,b);\n\n}",
null,
"C",
null,
"",
null,
""
] |
[
null,
"https://upload-images.jianshu.io/upload_images/9850446-0653206ecf5bde03",
null,
"https://upload-images.jianshu.io/upload_images/9850446-dc035b11b65172c5",
null,
"https://upload-images.jianshu.io/upload_images/9850446-cadaf5bc7d2de189",
null,
"https://upload-images.jianshu.io/upload_images/9850446-cdfd7149aacd5d74",
null,
"https://upload-images.jianshu.io/upload_images/9850446-a8ae0fb0c45b01d5.jpg",
null,
"https://upload-images.jianshu.io/upload_images/9850446-f16051b69b8e74e7.png",
null
] |
{"ft_lang_label":"__label__zh","ft_lang_prob":0.94420946,"math_prob":0.9993574,"size":1997,"snap":"2019-13-2019-22","text_gpt3_token_len":1914,"char_repetition_ratio":0.059708983,"word_repetition_ratio":0.13333334,"special_character_ratio":0.19178768,"punctuation_ratio":0.13765182,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9582132,"pos_list":[0,1,2,3,4,5,6,7,8,9,10,11,12],"im_url_duplicate_count":[null,2,null,2,null,2,null,2,null,2,null,2,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2019-03-20T09:46:34Z\",\"WARC-Record-ID\":\"<urn:uuid:f7d95ab5-2936-4d34-a1e8-34a0880ffa63>\",\"Content-Length\":\"18161\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:03e8bd27-21f8-41d5-b432-9a31e05082b3>\",\"WARC-Concurrent-To\":\"<urn:uuid:ebec0bcc-c7e2-453a-a36b-5a33c3f455c6>\",\"WARC-IP-Address\":\"45.192.72.114\",\"WARC-Target-URI\":\"https://www.italblends.com/cyy/1234.html\",\"WARC-Payload-Digest\":\"sha1:4JB5QJ23RZ3QN4CJ2IKB3TKSP7V3BJC2\",\"WARC-Block-Digest\":\"sha1:RGEWJIR7F47QXJKXA6US66HLFRBTYJMG\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2019/CC-MAIN-2019-13/CC-MAIN-2019-13_segments_1552912202324.5_warc_CC-MAIN-20190320085116-20190320111116-00158.warc.gz\"}"}
|
https://www.causal.app/formulae/couppcd-excel
|
[
"Excel\n\n## How do you use COUPPCD in Excel?\n\nThe COUPPCD function in Excel is used to calculate the percentage of a discount off of a given price. The function takes two arguments: the price and the discount. The function then calculates the percentage of the discount off of the price.\n\n## What is the syntax of COUPPCD in Excel?\n\nThe syntax of COUPPCD in Excel is as follows:\n\nCOUPPCD(price, quantity, discount)\n\nprice is the price of the product quantity is the quantity of the product to be purchased discount is the discount to be applied to the purchase\n\n## What is an example of how to use COUPPCD in Excel?\n\nCOUPPCD is a function in Excel that calculates the couponing percentage for a given purchase price. The function takes two arguments: the purchase price and the number of items in the purchase. The function then calculates the percentage of the purchase price that was saved through couponing. This function can be used in Excel to help budget for groceries and to see how much money was saved through couponing.\n\n## When should you not use COUPPCD in Excel?\n\nThere are a few occasions when you should not use COUPPCD in Excel. One instance is when you are trying to calculate the average price of a product over time. In this case, you would use the AVERAGE function. Another time you should not use COUPPCD is when you are working with percentages. In this case, you would use the PERCENTILE function.\n\n## What are some similar formulae to COUPPCD in Excel?\n\nThe formulae to calculate the count of unique products in a given range (COUPPCD) is: =COUNTIF(A:A,A1)\n\nThis formula will count the number of unique products in the given range.\n\nThe formulae to calculate the percentage of unique products in a given range (COUPPCD) is: =COUNTIF(A:A,A1)/COUNT(A:A)\n\nThis formula will calculate the percentage of unique products in the given range.\n\n### Excel\n\nGet started with Causal today.\nBuild models effortlessly, connect them directly to your data, and share them with interactive dashboards and beautiful visuals."
] |
[
null
] |
{"ft_lang_label":"__label__en","ft_lang_prob":0.91082025,"math_prob":0.93486434,"size":1602,"snap":"2022-27-2022-33","text_gpt3_token_len":350,"char_repetition_ratio":0.15018773,"word_repetition_ratio":0.18045112,"special_character_ratio":0.19600499,"punctuation_ratio":0.09090909,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9940952,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2022-06-29T19:44:34Z\",\"WARC-Record-ID\":\"<urn:uuid:e49a0f0d-819e-4ae9-9233-6038d771951d>\",\"Content-Length\":\"13830\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:5279806c-d543-489f-bb6d-bd7d57fa79ca>\",\"WARC-Concurrent-To\":\"<urn:uuid:acb41b6b-3826-4c7f-ae1a-038aee241a88>\",\"WARC-IP-Address\":\"52.55.54.43\",\"WARC-Target-URI\":\"https://www.causal.app/formulae/couppcd-excel\",\"WARC-Payload-Digest\":\"sha1:4B6SFMCQOAQT5QAS5S33ON2CFL4ZQXVO\",\"WARC-Block-Digest\":\"sha1:YOHPGZNGXY5HG3DIRM3YYK4YHDVITER5\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2022/CC-MAIN-2022-27/CC-MAIN-2022-27_segments_1656103642979.38_warc_CC-MAIN-20220629180939-20220629210939-00594.warc.gz\"}"}
|
https://m.scirp.org/papers/110131
|
[
"Two Simple Formulas Relating the Growth and Profit Rates\nAbstract: This article compares the magnitudes of the growth and profit rates within an economic model that represents two successive periods of production. Its main result is a pair of simple formulas determining respectively the (growth rate)/(profit rate) ratio and the (profit rate) – (growth rate) difference. The first formula permits to show that the ratio is a decreasing function of the capital/income ratio. The second formula allows us to point out that the difference, as a general rule, is an increasing function of the capital/income ratio although, under certain conditions, it may be otherwise. Both formulas consider the simplest case, when savings equals capital increase and, in addition, the capital/income ratio is constant. The general case in which these conditions are not necessarily satisfied is also considered. In the simplest case, the ratio between the two rates is equal to that between the savings rate and the capital share while the difference is equal to that between these same variables divided by the capital/income ratio. In the general case, the results just indicated are modified by a quotient having in both formulas the same numerator: the capital increase not due to savings (as a fraction of income) minus the increase in the capital/income ratio. In the first formula, the quotient is preceded by a positive sign and its denominator is the capital share while in the second one it is preceded by a negative sign and its denominator is the capital/income ratio. As illustrated by means of an empirical application, these results help to explain the inequality between the growth and profit rates whose importance for income distribution is underlined by Piketty.\n\n1. Introduction\n\nOne of the salient features of a modern economy, as demonstrated by Piketty (2014, pp. 350-358), is that, as a general rule, the profit rate is higher than the growth rate. This may not be the case for a given country during long periods of time but it is still possible that some capital investments get a profit rate greater than the growth rate of the country in one such period. As the gap between the two rates becomes greater for a particular investment, the opportunity increases for the investor to enlarge his personal fraction of the country’s capital stock. Furthermore, Piketty (2014: pp. 271-303) showed that, in higher income strata, income consists mostly of profits and also that greater capital investments tend to obtain higher profit rates (Piketty, 2014: pp. 430-467). These combined facts produce a tendency for income to concentrate at the higher strata. To emphasize its importance, Piketty (2014: pp. 25-27) presents the inequality as the main cause of greater income inequality. The relevance of Piketty’s work has been widely recognized by the specialized literature (e.g., Boushey et al., 2017; Galbraith, 2014; Grantham, 2015; Lindert, 2014; Solow, 2014) and there have been also critical comments (e.g., Delsol et al., 2017; Giraud, 2014; Mankiew, 2015; Rognlie, 2015).\n\nConcerning the origin of the inequality between the two rates Piketty (2014: p. 358) says, on the one hand, that it is a historical fact that derives from multiple causes and, in a later work Piketty (2015: p. 49) notes that this inequality holds true in the steady-state equilibrium of the most common economic models. On the other hand, Piketty (2011: p. 39) pointed out that in real-world economies, the profit share is usually much larger than the savings rate and this leads, in the Cobb-Douglas production function specification, to a steady-state situation where the profit rate is larger than the growth rate. On this regard, it is worth mentioning the “Second Fundamental Law of Capitalism” postulated in Piketty (2014: p. 358), that is, the long-term equality between the capital/income ratio and the (profit share)/(growth rate) ratio. It is probably due to the importance that he concedes to this principle that his discussions of the inequality between the profit and growth rates are mostly referred to the long-term setting without presenting a formula relating the profit and growth rates in the general case.\n\nThis article compares the magnitudes of the growth and profit rates within an economic model that represents two successive periods of production. It incorporates such factors as changes in relative prices and capital gains that normally play a role in the determination of growth rate. The main result is a couple of formulas determining respectively the growth rate)/(profit rate) ratio and the (profit rate) − (growth rate) difference. The first formula permits to show that the ratio is a decreasing function of the capital/income ratio. The second formula allows us to point out that the difference, as a general rule, is an increasing function of the capital/income ratio although, under certain conditions, it may be otherwise.\n\nAccording to the first formula, the (growth rate)/(profit rate) ratio is equal to the sum of two fractions having both as denominator the capital share. The numerator of the first fraction is the savings rate and that of the second one, called here for short the capital term, is the capital increase not due to savings (measured with the national income) minus the increase in the capital/income ratio. In turn, according to the second formula, the (profit rate) − (growth rate) difference is determined by the difference between two fractions having both as denominator the capital/income ratio. The numerator of the first fraction is equal to the capital share minus the savings rate and that of the second one is the capital term. Both formulas allow for estimation, on the one hand, of the part due to each fraction in the determination of the corresponding function and, on the other hand, of the effect that a change taking place in each fraction has on the evolution of the corresponding function.\n\nThese results help to investigate the origin of the inequality between the growth and profit rates underlined by Piketty. As an example of this, we study the French economy during periods 1949-1979 and 1979-2009. We found, on the one hand, that the net effects of the capital/income ratio considered in the first formula were relatively small and, for this reason, the (growth rate)/(profit rate) ratio was predominantly determined in both periods by the (savings rate)/(capital share) ratio. On the other hand, the (profit rate) − (growth rate) difference was determined mainly by the capital/income ratio and by the difference between the capital share and the savings rate. Similar results were found concerning the evolution from one period to the other of both the (growth rate)/(profit rate) ratio and the (profit rate) − (growth rate) difference. On the basis of these results, two interesting tasks for future researches can be pointed out: on the one hand, to establish the extent to which conclusions similar to those presented here can be found in other cases. On the other hand, it is to study the determination of the saving rate and of the capital share in relation with the theme of this paper.\n\nIncluding this introduction, the paper has 7 sections. Section 2 presents the model studied here while Sections 3 and 4 define certain relations between some of its main variables. Section 5 establishes the two formulas mentioned above and Section 6 applies them to empirical data in order to illustrate their utility. Some final comments are presented in the last section.\n\n2. The Model\n\nWe consider an economy undergoing a succession of annual production cycles ending at dates $t=1,2,\\cdots$ and, to identify each one of them, we refer to the date corresponding to the end of the production year. As usual, a variable indexed with a t represents its value in cycle t which may correspond to any date unless otherwise indicated. The notations ${Y}_{t}$ and ${K}_{t}$ represent respectively the national income obtained and the national capital used while ${\\beta }_{t}$ is the corresponding capital/income ratio. Thus,\n\n${\\beta }_{t}=\\frac{{K}_{t}}{{Y}_{t}}$ (1)\n\nFurthermore, $\\Delta {K}_{t}$ (for $t>1$ ), ${S}_{t}$, ${\\Pi }_{t}$, ${s}_{t}$, ${\\alpha }_{t}$ and ${r}_{t}$ denote respectively the capital increase, the amount of savings, the amount of profit, the savings rate, the capital share and the profit rate. Then:\n\n$\\Delta {K}_{t}={K}_{t}-{K}_{t-1}$ (2)\n\n${s}_{t}=\\frac{{S}_{t}}{{Y}_{t}}$ (3)\n\n${\\alpha }_{t}=\\frac{{\\Pi }_{t}}{{Y}_{t}}$ (4)\n\n${r}_{t}=\\frac{{\\Pi }_{t}}{{K}_{t}}$ (5)\n\nFinally, for $t>1$, ${D}_{t}$ is the difference between the capital increase in period t and the amount of savings in period $t-1$, ${d}_{t}$ represents the ratio between this difference and the national income in period $t-1$ and ${g}_{t}$ is the growth rate of national income from cycle $t-1$ to cycle t. Therefore,\n\n${D}_{t}=\\Delta {K}_{t}-{S}_{t-1}$ (6)\n\n${d}_{t}=\\frac{{D}_{t}}{{Y}_{t-1}}$ (7)\n\n$1+{g}_{t}=\\frac{{Y}_{t}}{{Y}_{t-1}}$ (8)\n\n3. Further Relations between the Main Variables\n\nEquations (1), (2), (4), (6) and (8) imply respectively the following relations:\n\n$\\frac{1}{{\\beta }_{t}}=\\frac{{Y}_{t}}{{K}_{t}}$ (9)\n\n${K}_{t}={K}_{t-1}+\\Delta {K}_{t}$ (10)\n\n${\\Pi }_{t}={\\alpha }_{t}{Y}_{t}$ (11)\n\n$\\Delta {K}_{t}={S}_{t-1}+{D}_{t}$ (12)\n\n${Y}_{t}=\\left(1+{g}_{t}\\right){Y}_{t-1}$ (13)\n\nIn turn, Equations (5) and (11), taken together, imply that:\n\n${r}_{t}={\\alpha }_{t}\\left(\\frac{{Y}_{t}}{{K}_{t}}\\right)$ (14)\n\nwhile Equations (9) and (14), taken together, imply that:\n\n${r}_{t}=\\frac{{\\alpha }_{t}}{{\\beta }_{t}}$ (15)\n\nNow, dividing both sides of Equation (12) by ${Y}_{t-1}$ we get:\n\n$\\frac{\\Delta {K}_{t}}{{Y}_{t-1}}=\\frac{{S}_{t-1}}{{Y}_{t-1}}+\\frac{{D}_{t}}{{Y}_{t-1}}$ (16)\n\nSubstituting the first and second term on the right-hand side of this equation respectively by the left-hand sides of Equations (3) (corresponding to period $t-1$ ) and (7) results in:\n\n$\\frac{\\Delta {K}_{t}}{{Y}_{t-1}}={s}_{t-1}+{d}_{t}$ (17)\n\nÞ\n\n$\\Delta {K}_{t}=\\left({s}_{t-1}+{d}_{t}\\right){Y}_{t-1}$ (18)\n\n4. The Growth Rate\n\nIn this Section, a formula is developed relating the growth rate to some of the main variables of the model.\n\n4.1. The Growth Rate and Harrod’s Fundamental Equation\n\nSubstituting the second term on the right-hand side of Equation (10) by the right-hand side of Equation (18) we get:\n\n${K}_{t}={K}_{t-1}+\\left({s}_{t-1}+{d}_{t}\\right){Y}_{t-1}$ (19)\n\nand substituting the numerator on the right-hand side of Equation (1) by the right-hand side of Equation (19) yields:\n\n${\\beta }_{t}=\\frac{{K}_{t-1}+\\left({s}_{t-1}+{d}_{t}\\right){Y}_{t-1}}{{Y}_{t}}$ (20)\n\nMoreover, substituting the denominator on the right-hand side of this equation by the right-hand side of Equation (13) we obtain:\n\n${\\beta }_{t}=\\frac{{K}_{t-1}+\\left({s}_{t-1}+{d}_{t}\\right){Y}_{t-1}}{\\left(1+{g}_{t}\\right){Y}_{t-1}}$ (21)\n\nDividing both numerator and denominator on the right-hand side of this equation by ${Y}_{t-1}$ results in:\n\n${\\beta }_{t}=\\frac{\\frac{{K}_{t-1}}{{Y}_{t-1}}+\\left({s}_{t-1}+{d}_{t}\\right)}{1+{g}_{t}}$ (22)\n\nFinally, substituting the first term of the numerator on the right-hand side of this equation by the left-hand side of Equation (1) corresponding to period $t-1$ yields:\n\n${\\beta }_{t}=\\frac{{\\beta }_{t-1}+\\left({s}_{t-1}+{d}_{t}\\right)}{1+{g}_{t}}$ (23)\n\nÞ\n\n$1+{g}_{t}=\\frac{{\\beta }_{t-1}+\\left({s}_{t-1}+{d}_{t}\\right)}{{\\beta }_{t}}$ (24)\n\nÞ\n\n${g}_{t}=\\frac{{\\beta }_{t-1}+\\left({s}_{t-1}+{d}_{t}\\right)}{{\\beta }_{t}}-1$ (25)\n\n$=\\frac{{\\beta }_{t-1}+\\left({s}_{t-1}+{d}_{t}\\right)-{\\beta }_{t}}{{\\beta }_{t}}$ (26)\n\n$=\\frac{{s}_{t-1}+{d}_{t}-\\left({\\beta }_{t}-{\\beta }_{t-1}\\right)}{{\\beta }_{t}}$ (27)\n\nLet:\n\n${\\vartheta }_{t}={d}_{t}-\\left({\\beta }_{t}-{\\beta }_{t-1}\\right)$ (28)\n\nThis term represents the net effect of three ratios relating capital and income in the numerator of Equation (27): on the one hand the ratio between the capital increase (excepting savings) and income, on the other hand, the capital/income ratios of the two periods of production. To simplify, I will refer to it as the capital term, it permits to write that equation as follows:\n\n${g}_{t}=\\frac{{s}_{t-1}+{\\vartheta }_{t}}{{\\beta }_{t}}$ (29)\n\n${\\vartheta }_{t}={g}_{t}{\\beta }_{t}-{s}_{t-1}$ (30)\n\nAs will be seen in Section 6, the last formula facilitates to calculate the capital term on the basis of data that is easily accessible. In an economy where capital increase is equal to savings and also the capital/income ratio is constant we have:\n\n${\\vartheta }_{t}=0$ (31)\n\nIn this case, Equation (29) becomes:\n\n${g}_{t}=\\frac{{s}_{t-1}}{{\\beta }_{t}}$ (32)\n\nWhich is the Fundamental Equation obtained by Harrod (1939: p. 17), also called the Second Fundamental Law of Capitalism by Piketty (2014: p. 166) For this reason, Equation (29) can be useful to study the difference between the capital/income ratio and the (savings rate)/(growth rate) ratio within this model.\n\n4.2. Proof of Equation (27)\n\nTo prove Equation (27) each term on the right-hand side will be substituted by its equivalence according with the corresponding definition:\n\n$\\frac{{s}_{t-1}+{d}_{t}-\\left({\\beta }_{t}-{\\beta }_{t-1}\\right)}{{\\beta }_{t}}=\\frac{\\frac{{S}_{t-1}}{{Y}_{t-1}}+\\frac{{D}_{t}}{{Y}_{t-1}}-\\left(\\frac{{K}_{t}}{{Y}_{t}}-\\frac{{K}_{t-1}}{{Y}_{t-1}}\\right)}{\\frac{{K}_{t}}{{Y}_{t}}}$ (33)\n\n$=\\frac{\\frac{{S}_{t-1}+{D}_{t}}{{Y}_{t-1}}-\\frac{{K}_{t}}{{Y}_{t}}+\\frac{{K}_{t-1}}{{Y}_{t-1}}}{\\frac{{K}_{t}}{{Y}_{t}}}$ (34)\n\n$=\\frac{\\frac{\\Delta {K}_{t}}{{Y}_{t-1}}-\\frac{{K}_{t}}{{Y}_{t}}+\\frac{{K}_{t-1}}{{Y}_{t-1}}}{\\frac{{K}_{t}}{{Y}_{t}}}$ (35)\n\n$=\\frac{\\frac{{K}_{t}-{K}_{t-1}}{{Y}_{t-1}}-\\frac{{K}_{t}}{{Y}_{t}}+\\frac{{K}_{t-1}}{{Y}_{t-1}}}{\\frac{{K}_{t}}{{Y}_{t}}}$ (36)\n\n$=\\frac{\\frac{{K}_{t}}{{Y}_{t-1}}-\\frac{{K}_{t}}{{Y}_{t}}}{\\frac{{K}_{t}}{{Y}_{t}}}$ (37)\n\n$=\\left[\\frac{\\frac{{K}_{t}}{{Y}_{t-1}}-\\frac{{K}_{t}}{{Y}_{t}}}{\\frac{{K}_{t}}{{Y}_{t}}}\\right]\\left[\\frac{\\left(\\frac{{Y}_{t}}{{K}_{t}}\\right)}{\\left(\\frac{{Y}_{t}}{{K}_{t}}\\right)}\\right]$ (38)\n\n$=\\frac{{Y}_{t}}{{Y}_{t-1}}-1$ (39)\n\n$={g}_{t}$ (40)\n\n5. The (Growth Rate)/(Profit Rate) Ratio and the (Profit Rate) − (Growth Rate) Difference\n\nDividing Equation (29) by Equation (15) results in:\n\n$\\frac{{g}_{t}}{{r}_{t}}=\\frac{\\left[\\frac{{s}_{t-1}+{\\vartheta }_{t}}{{\\beta }_{t}}\\right]}{\\left[\\frac{{\\alpha }_{t}}{{\\beta }_{t}}\\right]}$ (41)\n\n$=\\frac{{s}_{t-1}}{{\\alpha }_{t}}+\\frac{{\\vartheta }_{t}}{{\\alpha }_{t}}$ (42)\n\nEquation (42) permits to observe that the ratio between the growth and profit rates is smaller, equal or greater than the ratio between the savings rate and the capital share if ${\\vartheta }_{t}$ is respectively smaller, equal or greater than zero. Furthermore, substituting in the last equation ${\\vartheta }_{t}$ by the right-hand side of Equation (28) we get:\n\n$\\frac{{g}_{t}}{{r}_{t}}=\\frac{{s}_{t-1}}{{\\alpha }_{t}}+\\frac{{d}_{t}-\\left({\\beta }_{t}-{\\beta }_{t-1}\\right)}{{\\alpha }_{t}}$ (43)\n\n$=\\left(\\frac{1}{{\\alpha }_{t}}\\right)\\left[{s}_{t-1}+{d}_{t}-\\left({\\beta }_{t}-{\\beta }_{t-1}\\right)\\right]$ (44)\n\nConcerning the effect of an increase in the capital/income ratio from one period to the next one on the (growth rate)/(profit rate) ratio, this equation shows that the ratio is a monotonous decreasing function of the capital/income ratio.\n\nNow, subtracting Equation (29) from Equation (15) results in:\n\n${r}_{t}-{g}_{t}=\\frac{{\\alpha }_{t}}{{\\beta }_{t}}-\\frac{{s}_{t-1}+{\\vartheta }_{t}}{{\\beta }_{t}}$ (45)\n\n$=\\frac{{\\alpha }_{t}-{s}_{t-1}}{{\\beta }_{t}}-\\frac{{\\vartheta }_{t}}{{\\beta }_{t}}$ (46)\n\nSubstituting in this equation ${\\vartheta }_{t}$ by the right-hand side of Equation (28) we obtain:\n\n${r}_{t}-{g}_{t}=\\frac{{\\alpha }_{t}-{s}_{t-1}}{{\\beta }_{t}}-\\frac{{d}_{t}-\\left({\\beta }_{t}-{\\beta }_{t-1}\\right)}{{\\beta }_{t}}$ (47)\n\n$=\\frac{{\\alpha }_{t}-\\left({s}_{t-1}+{\\beta }_{t-1}+{d}_{t}\\right)}{{\\beta }_{t}}+1$ (48)\n\nConcerning the effect of an increase in the capital/ income ratio from one period to the next one on the difference between the profit and growth rates, this equation allows us to distinguish three possible cases because the numerator of the first term in the right-hand side of the equation can be greater, equal or less than zero. In first case, the difference between the two rates is a monotonous decreasing function of the capital/ income ratio, in the second case it is constant and in the third one it is a monotonous increasing function of the capital/ income ratio. Due to the fact that in modern economies normally $\\left({s}_{t-1},{\\beta }_{t-1},{d}_{t}\\right)>\\left(0,1,0\\right)$ while ${\\alpha }_{t}<1$ (see the data presented in the next section and in its sources), the third case must be prevalent. However, it may be otherwise if, for instance, ${\\beta }_{t-1}$ becomes small enough.\n\nIn an economy where capital increase is equal to savings and also the capital/ income ratio is constant Equation (32) is true. For this reason, Equations (42) and (46) can be written, respectively, as follows:\n\n$\\frac{{g}_{t}}{{r}_{t}}=\\frac{{s}_{t-1}}{{\\alpha }_{t}}$ (49)\n\n${r}_{t}-{g}_{t}=\\frac{{\\alpha }_{t}-{s}_{t-1}}{{\\beta }_{t}}$ (50)\n\n6. A Numerical Example\n\nSome of the formulas developed in the previous sections are used in this one to study the ratio and the difference between the growth and profit rates in the French economy during periods 1949-1979 and 1979-2009. Our purpose is to calculate the value of these functions and to identify the main causes of its changes. The country and the period have been chosen for no particular reason but to illustrate the previous developments. However, the results presented here constitute only a first approach on a subject that deserves more detailed analysis.\n\n6.1. The Data and the Capital Term\n\nColumns , , , and of TableFR.3c by Piketty and Zucman (2014) present the average values for the French economy corresponding to the periods 1949-1979 and 1979-2009 shown in Table1.\n\nTable 1. Average values for the French economy corresponding to the periods 1949-1979 and 1979-2009.\n\nHowever,\n\n$\\frac{{\\alpha }_{1949\\text{-}1979}^{\\ast }}{{\\beta }_{1949\\text{-}1979}}=\\frac{0.21}{2.68}$ (51)\n\n$=0.07835$ (52)\n\na result contradicting the value reported in TableFR.3c for ${r}_{1949\\text{-}1979}$. For this reason, in order to preserve the consistency of the data, we adopt ${r}_{1949\\text{-}1979}=7.83%$ instead of 8.3%. Substituting successively each variable on the right-hand side of Equation (39) by its average value of periods 1949-1979 and 1979-2009 we get:\n\n${\\vartheta }_{1949\\text{-}1979}=0.048×2.68-0.14$ (53)\n\n$=-0.01136$ (54)\n\n${\\vartheta }_{1979\\text{-}2009}=0.018×3.79-0.1$ (55)\n\n$=-0.03178$ (56)\n\n6.2. The Capital/ Income and the ( Savings Rate)/( Growth Rate) Ratios\n\nSubstituting successively in the right-hand side of Equation (31) each variable by its average value corresponding to periods 1949-1979 and 1979-2009 yields:\n\n$\\frac{{s}_{1940\\text{-}1979}+{\\vartheta }_{1940\\text{-}1979}}{{g}_{1940\\text{-}1979}}=\\frac{0.14}{0.48}+\\frac{-0.01136}{0.48}$ (57)\n\n$=2.9116-0.2366$ (58)\n\n$=2.675$ (59)\n\n$\\frac{{s}_{1979\\text{-}2009}+{\\vartheta }_{1979\\text{-}2009}}{{g}_{1979\\text{-}2009}}=\\frac{0.10}{0.018}+\\frac{-0.03178}{0.018}$ (60)\n\n$=5.5555-1.7655$ (61)\n\n$=3.7899$ (62)\n\nAccording to these results, the ( savings rate)/( growth rate) ratio was greater than the capital/ income ratio in both periods. Dividing the difference between\n\nthe two ratios by the first one yields $\\frac{0.2366}{2.9116}=0.0812$ in period 1949-1979 and\n\n$\\frac{1.7655}{5.5555}=0.3177$ in period 1949-2009. Therefore, the difference between the two ratios increased from being equivalent to 8.12% of the (savings rate)/(growth rate) ratio in the first period to 31.77% in the second period.\n\n6.3. The (Growth Rate)/(Profit Rate) Ratio\n\nThe (growth rate)/(profit rate) ratios determined by the average values of these rates during periods 1949-1979 and 1979-2009 were, respectively:\n\n$\\frac{{g}_{1949\\text{-}1979}}{{r}_{1949\\text{-}1979}}=\\frac{0.048}{0.07835}$ (63)\n\n$=0.6126$ (64)\n\n$\\frac{{g}_{1979\\text{-}2009}}{{r}_{1979\\text{-}2009}}=\\frac{0.018}{0.066}$ (65)\n\n$=0.2727$ (66)\n\nAccording to Equation (41) , the first ratio results of the sum of the following fractions:\n\n$\\frac{{s}_{1949\\text{-}1979}}{{\\alpha }_{1949\\text{-}1979}^{\\ast }}=\\frac{0.14}{0.21}$ (67)\n\n$=0.6666$ (68)\n\n$\\frac{{\\vartheta }_{1949\\text{-}1979}}{{\\alpha }_{1949\\text{-}1979}^{\\ast }}=\\frac{-0.01136}{0.21}$ (69)\n\n$=-0.054$ (70)\n\nwhile the second ratio results of the sum of the following fractions:\n\n$\\frac{{s}_{1979\\text{-}2009}}{{\\alpha }_{1979\\text{-}2009}^{\\ast }}=\\frac{0.1}{0.25}$ (71)\n\n$=0.4$ (72)\n\n$\\frac{{\\vartheta }_{1979\\text{-}2009}}{{\\alpha }_{1979\\text{-}2009}^{\\ast }}=\\frac{-0.0318}{0.25}$ (73)\n\n$=-0.1272$ (74)\n\nThese calculations allow us to make two remarks on the (growth rate)/(profit rate) ratio concerning respectively the determination of the value and the evolution of this function.\n\nFirst, in both periods the ratio was determined mainly by the (savings rate)/(capital share) ratio. In period 1949-1979 the absolute value of each one of the two fractions in the right-hand side of Equation (41), compared to their sum, were respectively $\\frac{0.6666}{0.6666+0.054}=0.925$ and $\\frac{0.054}{0.6666+0.054}=0.0749$. In period 1979-2009 the corresponding proportions were respectively $\\frac{0.4}{0.4+0.1272}=0.7587$ and $\\frac{0.1272}{0.4+0.1272}=0.2412$. Therefore, in the first period, 92.5% of the value of the (growth rate)/(profit rate) ratio can be attributed to the (savings rate)/(capital share) ratio and 7.58% can be attributed to the (capital term)/(capital share) ratio. In turn, in the second period the corresponding percentages are 75.87% and 24.12%, respectively.\n\nSecond, the decrease of the ratio between the two periods was mainly due to the decrease of the (savings rate)/(capital share) ratio. Between the two periods considered the first fraction in the right-hand side of Equation (41) decreased from 0.6666 to 0.4, that is 0.2666, and the second fraction decreased from −0.054 to −0.1272, that is 0.0732. Therefore, in the decrease of $0.6126-0.2727=0.3399$ in the value of the (growth rate)/(profit rate) ratio that took place between the two periods considered, the part due to the decrease in the (savings rate)/(capital share) ratio is $\\frac{0.2666}{0.3399}=0.7843$, that is 78.43%, and the part due to the decrease of the (capital term)/(capital share) ratio is $\\frac{0.0732}{0.3399}=0.2153$, that is 21.53%.\n\nIt is worth adding that in both periods, the capital term was negative and the absolute value of the (capital term)/(capital share) ratio compared to the (savings rate)/(capital share) ratio, increased from $\\frac{0.054}{0.6666}=0.081$ to $\\frac{0.1272}{0.4}=0.318$, that is from 8.1% to 31.83% from one period to the other. Despite this fact, both the value of the (growth rate)/(profit rate) ratio as well as its evolution between the two periods considered was mainly due to the (savings rate)/(capital share) ratio.",
null,
"6.4. The (Profit Rate) − (Growth Rate) Difference\n\nThe (profit rate) − (growth rate) difference determined by the average values of these rates during periods 1949-1979 and 1979-2009 were, respectively:\n\n${r}_{1949\\text{-}1979}-{g}_{1949\\text{-}1979}=0.07835-0.048$ (75)\n\n$=0.03035$ (76)\n\n${r}_{1979\\text{-}2009}-{g}_{1979\\text{-}2009}=0.066-0.018$ (77)\n\n$=0.048$ (78)\n\nAccording to Equation (46), the first difference results of the sum of the following fractions:\n\n$\\frac{{\\alpha }_{1949\\text{-}1979}^{\\ast }-{s}_{1949\\text{-}1979}}{{\\beta }_{1949\\text{-}1979}}=\\frac{0.21-0.14}{2.68}$ (79)\n\n$=0.02611$ (80)\n\n$-\\frac{{\\vartheta }_{1949\\text{-}1979}}{{\\beta }_{1949\\text{-}1979}}=-\\left(\\frac{-0.01136}{2.68}\\right)$ (81)\n\n$=0.004238$ (82)\n\nwhile the second difference results of the sum of the following fractions:\n\n$\\frac{{\\alpha }_{1979\\text{-}2009}^{\\ast }-{s}_{1979\\text{-}2009}}{{\\beta }_{1979\\text{-}2009}}=\\frac{0.25-0.1}{3.79}$ (83)\n\n$=0.03956$ (84)\n\n$-\\frac{{\\vartheta }_{1979\\text{-}2009}}{{\\beta }_{1979\\text{-}2009}}=-\\left(\\frac{-0.03178}{3.79}\\right)$ (85)\n\n$=0.00839$ (86)\n\nThese calculations allow us to make two remarks on the difference between the profit and growth rates, concerning respectively the determination of the value and the evolution of this function.\n\nFirst, in both periods the difference was determined mainly by the [(capital share) − (savings rate)]/[capital/income] ratio. In period 1949-1979 the absolute values of each one of the two fractions in the right-hand side of Equation (46),\n\ncompared to their sum, were respectively $\\frac{0.02611}{0.02611+0.004238}=0.8603$ and $\\frac{0.004238}{0.02611+0.004238}=0.1396$. In period 1979-2009 the corresponding proportions were respectively $\\frac{0.03956}{0.03956+0.00839}=0.8250$ and\n\n$\\frac{0.00835}{0.03956+0.00839}=0.1741$. Therefore, in the first period, 86.03% of the value of the difference between the two rates can be attributed to the [(capital share) − (savings rate)]/[capital/income] ratio and 13.96% can be attributed to the (capital term)/(capital share) ratio. In turn, in the second period the corresponding percentages are 82.5% and 17.41%, respectively.\n\nSecond, the increase of the difference between the two rates taking place from one period to the other was mainly due to the increase of the [(capital share) − (savings rate)]/[capital/income] ratio. Between the two periods considered the first fraction in the right-hand side of Equation (46) increased from 0.02611 to 0.03956, that is 0.01345, and the second fraction increased from 0.004238 to 0.00839, that is 0.004152. Therefore, in the increase of $0.048-0.03035=0.01765$ in the difference between the profit and growth rates that took place between the two periods considered, the part due to the increase in the [(capital share) − (savings rate)]/[capital/income] ratio is $\\frac{0.01345}{0.01765}=0.7620$, that is 76.2%, and the part due to the increase of the (capital term)/(capital share) ratio is $\\frac{0.004152}{0.01765}=0.2352$, that is 23.52%.\n\nIt is worth adding that in both periods, the capital term was negative and the absolute value of second fraction in the right-hand side of Equation (46), compared to the first one (which was positive in both periods), increased from $\\frac{0.004238}{0.02611}=0.1623$ to $\\frac{0.00839}{0.03956}=0.2120$, that is from 16.23% to 21.2% from one period to the other. Despite this fact, both the value of the difference between the profit and growth rates as well as the evolution of this value from the first to the second period considered was mainly due to the [(capital share) − (savings rate)]/[capital/income].\n\nWe found that the net effects of the capital/income ratio considered in Equation (41) were relatively small and, for this reason, the (growth rate)/(profit rate) ratio was predominantly determined by the (savings rate)/(capital share) ratio. In turn, the second term in the right-hand side of Equation (46) was relatively small too and, due to this fact, the difference between the profit and growth rates was determined mainly by this ratio and by the difference between the capital share and the savings rate.\n\nGiven the importance of both savings rate and capital share for the ratio as well as for the difference between the growth and profit rates, a better understanding of these relations may be reached in the future by studying the determination of the two indicated variables. Here, we will only add two brief comments on this matter.\n\nFirst, to understand the behavior of the capital share, it is useful to consider it as the complement to unity of the labor share. Indeed, the labor share is equal to the (real labor income)/(productivity of labor) ratio (see Giovannoni 2014: p. 8 ). For this reason, the change of the capital share in the French Economy between the periods 1949-1979 and 1979-2009 can be viewed as resulting from the decrease of the real labor income relative to the productivity of labor.\n\nSecond, it is worth remembering that the amount of savings is equal to that of profits minus the part of profits consumed plus the part of wages saved. The capital share is greater, equal to or less than the savings rate if the sum of profits consumed is respectively greater, equal to or less than the sum of wages saved. Therefore, letting aside changes in income and capital, increasing the sum of profits consumed over the sum of wages saved also increases the profit rate relative to the growth rate. In turn, this increase favors, as noted in the introduction, the growth of the fraction of total income corresponding to the highest income levels.\n\n7. Conclusion\n\nThis article presents two formulas expressing the (profit rate)/(growth rate) ratio and the (profit rate) − (growth rate) difference, respectively, as the sum and the difference of two particular pairs of fractions. In the first formula, the numerator of the first fraction is the savings rate and, in the second formula, the corresponding numerator is the (capital share) − (savings rate) difference. The denominator in the two fractions of the first formula is the capital share and in those of the second formula is the capital/income ratio while the numerator of the second fraction of the two formulas is the capital increase not due to savings (measured with the national income) minus the increase in the capital/income ratio. Because each one of the formula allows for an estimation of the relative importance of the corresponding two fractions, they help to explain the inequality between the two rates whose importance is underlined by Piketty. As an illustration of this fact, we studied the case of the French economy during periods 1949-1979 and 1979-2009. In this respect, we found on the one hand, that the net effects of the capital/income ratio considered in the first formula were relatively small and, for this reason, the (growth rate)/(profit rate) ratio was predominantly determined in both periods by the (savings rate)/(capital share) ratio. However, the relative importance of this ratio in the determination of the (growth rate)/(profit rate) ratio diminished from one period to the other. On the other hand, the (profit rate) − (growth rate) difference was determined mainly by the (capital share) − (savings rate) difference divided by the capital/income ratio. Nevertheless, the relative importance of this quotient in the determination of the (profit rate) − (growth rate) difference diminished from one period to the other. Similar results were found concerning the evolution from one period to the other of both the (growth rate)/(profit rate) ratio and the (profit rate) − (growth rate) difference.\n\nFinally, it is worth mentioning what we consider to be the main limitations of the paper, one is the lack of a discussion of the literature on the determination of the profit and growth rates. Notwithstanding the modest scope of our work, that discussion may have been useful to evaluate the relative importance of its contributions. On the other hand, the limited number of cases taken into account in the empirical part of the paper reduced to an illustrative example. These limitations point out two interesting tasks for future researches.\n\nCite this paper: Benítez Sánchez, A. (2021) Two Simple Formulas Relating the Growth and Profit Rates. Theoretical Economics Letters, 11, 572-586. doi: 10.4236/tel.2021.113038.\nReferences\n\n Boushey, H., DeLong, J. B., & Steinbaum, M. (2017). After Piketty: The Agenda for Economics and Inequality. Cambridge, MA: Harvard University Press.\nhttps://doi.org/10.4159/9780674978195\n\n Delsol, J. P., Lecaussin, N., & Martin, E. (2017). Anti-Piketty: Capital for the 21st Century. Washington DC: Cato Institute.\n\n Galbraith, J. K. (2014). Unpacking the First Fundamental Law. Real-World Economics Review, 69, 145-149.\nhttp://www.paecon.net/PAEReview/issue69/Galbraith69.pdf\n\n Giovannoni, O. (2014). What Do We Know about the Labor Share and the Profit Share? Part III: Measures and Structural Factors. Working Paper No. 805, Annandale-on-Hudson, NY: Levy Economics Institute.\nthe-labor-share-and-the-profit-share-part-3-measures-and-structural-factors\nhttps://doi.org/10.2139/ssrn.2439887\n\n Giraud, G. (2014). Quelle intelligence du capital pour demain? Une lecture du Capital au XXIe siècle de Th. Piketty Revue Francaise de Socio-économie, 1, 283-294.\nhttps://www.cairn.info/revue-francaise-de-socio-economie-2014-1-page-283.htm\nhttps://doi.org/10.3917/rfse.013.0283\n\n Grantham, G. (2015). Capitalism in the Twenty-First Century: An Overview. Basic Income Studies, 10, 7-28.\nhttps://doi.org/10.1515/bis-2015-0019\n\n Harrod, R. F. (1939). An Essay in Dynamic Theory. The Economic Journal, 49, 14-33.\nhttps://www.jstor.org/stable/2225181\nhttps://doi.org/10.2307/2225181\n\n Lindert, P. H. (2014). Making the Most of Capital in the 21st Century. National Bureau of Economic Research, Working Paper Number 20232.\nhttps://www.nber.org/papers/w20232\nhttps://doi.org/10.3386/w20232\n\n Mankiew, G. (2015). Yes, r > g. So What? American Economic Review, 105, 43-47.\nhttps://doi.org/10.1257/aer.p20151059\n\n Piketty, T. (2011). On the Long Run Evolution of Inheritance: France 1820-2050. The Quarterly Journal of Economics, 126, 1071-1131.\nhttps://doi.org/10.1093/qje/qjr020\n\n Piketty, T. (2014). Capital in the Twenty-First Century. Cambridge, MA: Harvard University Press.\nhttps://doi.org/10.4159/9780674369542\n\n Piketty, T. (2015). About Capital in the Twenty-First Century. American Economic Review, 105, 48-53.\nhttps://doi.org/10.1257/aer.p20151060\n\n Piketty, T., & Zucman, G. (2014). Capital Is Back: Wealth-Income Ratios in Rich Countries 1700-2010. The Quarterly Journal of Economics, 129, 1155-1210.\nhttp://piketty.pse.ens.fr/en/capitalisback\nhttps://doi.org/10.1093/qje/qju018\n\n Rognlie, M. (2015). Deciphering the Fall and Rise in the Net Capital Share. Brooking Economic Papers on Economic Activity, Conference Draft, March, 19-20.\nhttps://go.gale.com/ps/anonymous?id=GALE%7CA443652349&sid="
] |
[
null,
"https://html.scirp.org/file/13-1502338x117.png",
null
] |
{"ft_lang_label":"__label__en","ft_lang_prob":0.9146583,"math_prob":0.99735916,"size":25731,"snap":"2021-31-2021-39","text_gpt3_token_len":6179,"char_repetition_ratio":0.19559218,"word_repetition_ratio":0.22024691,"special_character_ratio":0.2616688,"punctuation_ratio":0.12648062,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.99985147,"pos_list":[0,1,2],"im_url_duplicate_count":[null,1,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2021-09-17T08:12:25Z\",\"WARC-Record-ID\":\"<urn:uuid:82eb6442-80ef-4ff1-8212-238d907cdc7d>\",\"Content-Length\":\"156615\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:66adae11-51b0-4ebb-bac7-8da6ff857b70>\",\"WARC-Concurrent-To\":\"<urn:uuid:1c6c5c3a-6115-4acd-b741-6db5d1739863>\",\"WARC-IP-Address\":\"144.126.144.39\",\"WARC-Target-URI\":\"https://m.scirp.org/papers/110131\",\"WARC-Payload-Digest\":\"sha1:MO6T6MQAI3TLHXD4IYQY66MKG7OBJKOQ\",\"WARC-Block-Digest\":\"sha1:TZ4QIZR4GVBASEJHJIRGDG2SM5B3L67L\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2021/CC-MAIN-2021-39/CC-MAIN-2021-39_segments_1631780055601.25_warc_CC-MAIN-20210917055515-20210917085515-00420.warc.gz\"}"}
|
https://dev.mysql.com/doc/refman/5.6/en/enterprise-encryption-usage.html
|
[
"MySQL 5.6 Reference Manual / ... / MySQL Enterprise Encryption Usage and Examples\n\n### 12.18.2 MySQL Enterprise Encryption Usage and Examples\n\nTo use MySQL Enterprise Encryption in applications, invoke the functions that are appropriate for the operations you wish to perform. This section demonstrates how to carry out some representative tasks:\n\n#### Create a private/public key pair using RSA encryption\n\n``````-- Encryption algorithm; can be 'DSA' or 'DH' instead\nSET @algo = 'RSA';\n-- Key length in bits; make larger for stronger keys\nSET @key_len = 1024;\n\n-- Create private key\nSET @priv = CREATE_ASYMMETRIC_PRIV_KEY(@algo, @key_len);\n-- Derive corresponding public key from private key, using same algorithm\nSET @pub = CREATE_ASYMMETRIC_PUB_KEY(@algo, @priv);``````\n\nNow you can use the key pair to encrypt and decrypt data, sign and verify data, or generate symmetric keys.\n\n#### Use the private key to encrypt data and the public key to decrypt it\n\nThis requires that the members of the key pair be RSA keys.\n\n``````SET @ciphertext = ASYMMETRIC_ENCRYPT(@algo, 'My secret text', @priv);\nSET @plaintext = ASYMMETRIC_DECRYPT(@algo, @ciphertext, @pub);``````\n\nConversely, you can encrypt using the public key and decrypt using the private key.\n\n``````SET @ciphertext = ASYMMETRIC_ENCRYPT(@algo, 'My secret text', @pub);\nSET @plaintext = ASYMMETRIC_DECRYPT(@algo, @ciphertext, @priv);``````\n\nIn either case, the algorithm specified for the encryption and decryption functions must match that used to generate the keys.\n\n#### Generate a digest from a string\n\n``````-- Digest type; can be 'SHA256', 'SHA384', or 'SHA512' instead\nSET @dig_type = 'SHA224';\n\n-- Generate digest string\nSET @dig = CREATE_DIGEST(@dig_type, 'My text to digest');``````\n\n#### Use the digest with a key pair\n\nThe key pair can be used to sign data, then verify that the signature matches the digest.\n\n``````-- Encryption algorithm; could be 'DSA' instead; keys must\n-- have been created using same algorithm\nSET @algo = 'RSA';\n\n-- Generate signature for digest and verify signature against digest\nSET @sig = ASYMMETRIC_SIGN(@algo, @dig, @priv, @dig_type);\n-- Verify signature against digest\nSET @verf = ASYMMETRIC_VERIFY(@algo, @dig, @sig, @pub, @dig_type);``````\n\n#### Create a symmetric key\n\nThis requires DH private/public keys as inputs, created using a shared symmetric secret. Create the secret by passing the key length to `CREATE_DH_PARAMETERS()`, then pass the secret as the key length to `CREATE_ASYMMETRIC_PRIV_KEY()`.\n\n``````-- Generate DH shared symmetric secret\nSET @dhp = CREATE_DH_PARAMETERS(1024);\n-- Generate DH key pairs\nSET @algo = 'DH';\nSET @priv1 = CREATE_ASYMMETRIC_PRIV_KEY(@algo, @dhp);\nSET @pub1 = CREATE_ASYMMETRIC_PUB_KEY(@algo, @priv1);\nSET @priv2 = CREATE_ASYMMETRIC_PRIV_KEY(@algo, @dhp);\nSET @pub2 = CREATE_ASYMMETRIC_PUB_KEY(@algo, @priv2);\n\n-- Generate symmetric key using public key of first party,\n-- private key of second party\nSET @sym1 = ASYMMETRIC_DERIVE(@pub1, @priv2);\n\n-- Or use public key of second party, private key of first party\nSET @sym2 = ASYMMETRIC_DERIVE(@pub2, @priv1);``````\n\nKey string values can be created at runtime and stored into a variable or table using `SET`, `SELECT`, or `INSERT`:\n\n``````SET @priv1 = CREATE_ASYMMETRIC_PRIV_KEY('RSA', 1024);\nSELECT CREATE_ASYMMETRIC_PRIV_KEY('RSA', 1024) INTO @priv2;\nINSERT INTO t (key_col) VALUES(CREATE_ASYMMETRIC_PRIV_KEY('RSA', 1024));``````\n\nKey string values stored in files can be read using the `LOAD_FILE()` function by users who have the `FILE` privilege.\n\nDigest and signature strings can be handled similarly.\n\n#### Limit CPU usage by key-generation operations\n\nThe `CREATE_ASYMMETRIC_PRIV_KEY()` and `CREATE_DH_PARAMETERS()` encryption functions take a key-length parameter, and the amount of CPU resources required by these functions increases as the key length increases. For some installations, this might result in unacceptable CPU usage if applications frequently generate excessively long keys.\n\nOpenSSL imposes a minimum key length of 1,024 bits for all keys. OpenSSL also imposes a maximum key length of 10,000 bits and 16,384 bits for DSA and RSA keys, respectively, for `CREATE_ASYMMETRIC_PRIV_KEY()`, and a maximum key length of 10,000 bits for `CREATE_DH_PARAMETERS()`. If those maximum values are too high, three environment variables are available as of MySQL 5.6.35 to enable MySQL server administrators to set lower maximum lengths for key generation, and thereby to limit CPU usage:\n\nTo use any of these environment variables, set them in the environment of the process that starts the server. If set, their values take precedence over the maximum key lengths imposed by OpenSSL. For example, to set a maximum key length of 4,096 bits for DSA and RSA keys for `CREATE_ASYMMETRIC_PRIV_KEY()`, set these variables:\n\n``````export MYSQL_OPENSSL_UDF_DSA_BITS_THRESHOLD=4096\nexport MYSQL_OPENSSL_UDF_RSA_BITS_THRESHOLD=4096``````\n\nThe example uses Bourne shell syntax. The syntax for other shells may differ."
] |
[
null
] |
{"ft_lang_label":"__label__en","ft_lang_prob":0.5676928,"math_prob":0.89645034,"size":4951,"snap":"2019-26-2019-30","text_gpt3_token_len":1281,"char_repetition_ratio":0.15302204,"word_repetition_ratio":0.07539118,"special_character_ratio":0.25247425,"punctuation_ratio":0.15347138,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9770504,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2019-07-20T14:23:06Z\",\"WARC-Record-ID\":\"<urn:uuid:b2e25eb0-c8e5-4156-a294-9ba5b16e143f>\",\"Content-Length\":\"73464\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:f92e5a77-3633-434d-a423-4ff166728ff3>\",\"WARC-Concurrent-To\":\"<urn:uuid:5b399f64-e920-42b8-b702-ddd826963d06>\",\"WARC-IP-Address\":\"137.254.60.11\",\"WARC-Target-URI\":\"https://dev.mysql.com/doc/refman/5.6/en/enterprise-encryption-usage.html\",\"WARC-Payload-Digest\":\"sha1:TP4FGHYZIG3DLBKXMDL2JCTNFJFVF567\",\"WARC-Block-Digest\":\"sha1:77XHUQLN5Y72WIGXHXO2APAGXC2PKOHD\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2019/CC-MAIN-2019-30/CC-MAIN-2019-30_segments_1563195526517.67_warc_CC-MAIN-20190720132039-20190720154039-00076.warc.gz\"}"}
|
https://tex.stackexchange.com/questions/84722/slight-change-in-algorithm
|
[
"# Slight change in algorithm\n\nThis is my MWE for an algorithm however its throwing an error and I don't know how to get inputs and initialize. I want it to look like the attached image.\n\n\\documentclass[a4paper,10pt,twocolumn]{article}\n\\usepackage[utf8]{inputenc}\n\\usepackage{booktabs,lipsum}\n\\usepackage{algorithm}\n\\usepackage{algpseudocode}\n\n\\begin{document}\n\\begin{algorithm}\n\\caption{Algorithm 2: Boosted $K$ Nearest Neighbor}\n\\begin{algorithmic}\n% \\qinput{Input:} \\\\\n% \\State $S={s_i}={\\left(x_i,y_i\\right)$\n\\For{t = 1 to T} \\do\n\\State $S_t \\gets S_{t-1}$\n\\For{$s_q \\in S_t$} \\do\n\\State $N_q \\gets$ k nearest neighbors\n\\State of $s_q$ using $D(s_q,s_i)$\n\\State label($s_q$)$=argmax\\sum_{s_i \\in N_q}D(s_q,s_i)$;\n\\If{label($s_q$)$\\ne y_q$}\n\\For{$s_i \\in N_i$} \\do\n\\If{$y_i \\ne y_q$}\n\\State $w_{i}^{t} \\gets w_{i}^{t} - \\lambda/d(x_q,x_i)$;\n\\Else\n\\State $w_{i}^{t} \\gets w_{i}^{t} + \\lambda/d(x_q,x_i)$;\n\\EndIf\n\\EndFor\n\\EndIf\n\\EndFor\n\\If{label($s_q$)$=y_q \\forall_{s_q}$}\n\\State break\n\\EndIf\n\\EndFor\n\\end{algorithmic}\n\\end{algorithm}\n\\end{document}",
null,
"Here's an option that provides feasible output. I've removed the physical numbering in the caption:",
null,
"\\documentclass[10pt,twocolumn]{article}\n\\usepackage{algorithm,algpseudocode}% http://ctan.org/pkg/{algorithms,algorithmx}\n\\algnewcommand{\\Inputs}{%\n\\State \\textbf{Inputs:}\n\\Statex \\hspace*{\\algorithmicindent}\\parbox[t]{.8\\linewidth}{\\raggedright #1}\n}\n\\algnewcommand{\\Initialize}{%\n\\State \\textbf{Initialize:}\n\\Statex \\hspace*{\\algorithmicindent}\\parbox[t]{.8\\linewidth}{\\raggedright #1}\n}\n\n\\begin{document}\n\\begin{algorithm}\n\\caption{Boosted $K$ Nearest Neighbour}\n\\begin{algorithmic}\n\\Inputs{$S={s_i}=\\left(x_i,y_i\\right)$}\n\\Initialize{\\strut$w_i^0 \\gets 0$, $i=1,\\ldots,n$ \\\\ $S_0 \\gets S$}\n\\For{t = 1 to T}\n\\State $S_t \\gets S_{t-1}$\n\\For{$s_q \\in S_t$}\n\\State $N_q \\gets$ k nearest neighbors\n\\State of $s_q$ using $D(s_q,s_i)$\n\\State label($s_q$)$=argmax\\sum_{s_i \\in N_q}D(s_q,s_i)$;\n\\If{label($s_q$)$\\ne y_q$}\n\\For{$s_i \\in N_i$}\n\\If{$y_i \\ne y_q$}\n\\State $w_{i}^{t} \\gets w_{i}^{t} - \\lambda/d(x_q,x_i)$;\n\\Else\n\\State $w_{i}^{t} \\gets w_{i}^{t} + \\lambda/d(x_q,x_i)$;\n\\EndIf\n\\EndFor\n\\EndIf\n\\EndFor\n\\If{label($s_q$)$=y_q \\forall_{s_q}$}\n\\State break\n\\EndIf\n\\EndFor\n\\end{algorithmic}\n\\end{algorithm}\n\\end{document}\n\n\nA newly-defined \\Inputs and (equivalent) \\Initialize takes one argument that sets its contents in a \\Statex with an indent of \\algorithmicindent - the default - to align with the other algorithm elements. The contents is stored in a top-aligned \\parbox that fits across 80% of the line. I'm sure you won't need more, but in case you do, that can also be fixed to not cause overfull boxes."
] |
[
null,
"https://i.stack.imgur.com/nLu2y.png",
null,
"https://i.stack.imgur.com/J2p3Z.png",
null
] |
{"ft_lang_label":"__label__en","ft_lang_prob":0.57482964,"math_prob":0.9996037,"size":1021,"snap":"2021-04-2021-17","text_gpt3_token_len":410,"char_repetition_ratio":0.13470992,"word_repetition_ratio":0.0,"special_character_ratio":0.35455436,"punctuation_ratio":0.08152174,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.99999535,"pos_list":[0,1,2,3,4],"im_url_duplicate_count":[null,4,null,3,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2021-01-26T06:40:15Z\",\"WARC-Record-ID\":\"<urn:uuid:56351a4a-74e1-4740-a40e-be50160de92b>\",\"Content-Length\":\"148971\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:42b8e0a8-229c-4780-b50f-e4b603d24c10>\",\"WARC-Concurrent-To\":\"<urn:uuid:ebb50c6e-08ad-401a-89e1-600a8ea853da>\",\"WARC-IP-Address\":\"151.101.193.69\",\"WARC-Target-URI\":\"https://tex.stackexchange.com/questions/84722/slight-change-in-algorithm\",\"WARC-Payload-Digest\":\"sha1:WLVNI6NPQCLNO4AHPVNV3YA6TPZJHUQP\",\"WARC-Block-Digest\":\"sha1:DUC5NGFGZYKJ44CDRA66AUCIJ3MDYACF\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2021/CC-MAIN-2021-04/CC-MAIN-2021-04_segments_1610704798089.76_warc_CC-MAIN-20210126042704-20210126072704-00216.warc.gz\"}"}
|
https://mathlair.allfunandgames.ca/pillow-28.php
|
[
"#",
null,
"Pillow-Problems: Problem #28\n\nMath Lair Home > Source Material > Pillow-Problems > Problem #28\n\n## Problem:\n\n28.\n\nIf the sides of a given Triangle, taken cyclically, be divided in extreme and mean ratio; and if the points be joined: find the ratio which the area of the Triangle, so formed, has to the area of a given Triangle.\n\n[12/78\n\n28.\n\n7 − 3√5.\n\n## Solution:\n\n28.\n\nLet ABC be the given Triangle; and let its sides be divided internally at A′, B′, C′, in extreme and mean ratio.",
null,
"And let M be the area of ABC.\n\nLet BA′ = x; then x² = a · (ax);\n\ni.e. x² + axa² = 0;\n\nx =\n (−a ± a√5)/ (2)\n=\n (a)/ (2)\n· (√5 − 1), the other sign being excluded by the terms of the question.\n\nThen area of Triangle ABC\n\n= ½ ·\n (c)/ (2)\n· (√5 − 1) · {b\n (b)/ (2)\n· (√5 − 1)} · &sinz; A,\n (1)/ (8)\n· (√5 − 1)(3 − √5)bc · &sinz; A,\n= ¼ · (4√5 − 8) · M = (√5 − 2) · M.\n\nSimilarly for BCA′ and CAB′.\n\nHence the sume of these 3 Triangles = 3 · (√5 − 2) · M, and area of Triangle ABC′ = (7 − 3√5) · M.\n\nQ.E.F."
] |
[
null,
"https://mathlair.allfunandgames.ca/images/mathlairlogo.png",
null,
"https://mathlair.allfunandgames.ca/images/pillow-50.png",
null
] |
{"ft_lang_label":"__label__en","ft_lang_prob":0.7816797,"math_prob":0.9845487,"size":658,"snap":"2022-40-2023-06","text_gpt3_token_len":243,"char_repetition_ratio":0.16972478,"word_repetition_ratio":0.0,"special_character_ratio":0.40425533,"punctuation_ratio":0.15337424,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.99981457,"pos_list":[0,1,2,3,4],"im_url_duplicate_count":[null,null,null,2,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2022-10-01T08:44:12Z\",\"WARC-Record-ID\":\"<urn:uuid:cc27ea85-1587-4f12-9154-f5e26a2e1b30>\",\"Content-Length\":\"5965\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:1f163eeb-c712-407d-b89a-30c907002537>\",\"WARC-Concurrent-To\":\"<urn:uuid:b090ed17-8253-437c-8ef6-325cb2769bf5>\",\"WARC-IP-Address\":\"67.215.3.243\",\"WARC-Target-URI\":\"https://mathlair.allfunandgames.ca/pillow-28.php\",\"WARC-Payload-Digest\":\"sha1:EOIGGBBWZGJXJPEYD4ONCEAT26DVHORB\",\"WARC-Block-Digest\":\"sha1:YYHQCX2FWN6KLEAYKIVBD5RC4JVKSPOE\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2022/CC-MAIN-2022-40/CC-MAIN-2022-40_segments_1664030335573.50_warc_CC-MAIN-20221001070422-20221001100422-00121.warc.gz\"}"}
|
http://mgattozzi.com/avoiding-logic-errors/
|
[
"# Avoiding Logic Bugs in Rust with Traits and Types\n\nThe other day I saw someone comment how a bug could have been avoided if Rust\nwas used. This was incorrect as it was a logic bug not a memory bug. Rust\nguarantees memory safety, but whether your logic is correct is a whole different\nstory. That being said we can use Rust's type system to make our code work and\navoid logic bugs.\n\nRust has some nice abstractions to avoid these kinds of errors if used properly.\nIs it perfect? No, if they're implemented incorrectly then you're still going to\nhave logic bugs. If your implementation is correct though it'll make it harder\nto shoot oneself in the foot later on.\n\nTo show you what I mean we'll start making a library for dealing with units, in\nthis case we'll just do temperature, how to handle conversions, implementing\ntraits to make using the library easier, and we'll write some tests to make sure\nit works as expected. Before that though let's take a look at a fragile\nimplementation of this library that could easily be used improperly:\n\n``````type Kelvin = f64;\ntype Celsius = f64;\ntype Fahrenheit = f64;\n\npub fn fahrenheit_to_celsius(f: Fahrenheit) -> Celsius {\n((f-32.0) * (5.0/9.0) )\n}\n\npub fn fahrenheit_to_kelvin(f: Fahrenheit) -> Kelvin {\n(f + 459.67) * (5.0/9.0)\n}\n\npub fn kelvin_to_celsius(k: Kelvin) -> Celsius {\n(k - 273.15)\n}\n\npub fn kelvin_to_fahrenheit(k: Kelvin) -> Fahrenheit {\n((k * (9.0/5.0)) - 459.67 )\n}\n\npub fn celsius_to_fahrenheit(c: Celsius) -> Fahrenheit {\n((c * (9.0/5.0)) + 32.0 )\n}\n\npub fn celsius_to_kelvin(c: Celsius) -> Kelvin {\n(c + 273.15)\n}\n``````\n\nPretty simple right? We have three different types and it has all the\nconversions. All you need to do is put the right type in and you're good to go.\nHere's the problem though:\n\n``````let x: Fahrenheit = 32.0;\nprintln!(\"{}\", celsius_to_fahrenheit(x)); // This works D:\n``````\n\n`type` defines a type alias. This means `Celsius` and `Fahrenheit` are both\nactually `f64`. `rustc` will gladly build this code and run it, despite us\nhaving said that this is a `Fahrenheit` type. Our code has a logic bug! Our\ncurrent implementation is very weak against logic issues and we can't add things\ntogether without a lot of work. We'd have to keep track of the types, how they\nwere converted from what unit to what, and then use the right method for the\nconversion. That's a lot of work, a lot of methods, and they're too error prone.\nLet's make our implementation more robust and easier to use:\n\n``````use std::ops::Add;\nuse std::fmt;\nuse Temperature::*;\n\n#[derive(Debug, PartialEq, Copy, Clone)]\n/// An enum representing the different units of Temperature\npub enum Temperature {\nKelvin(f64),\nCelsius(f64),\nFahrenheit(f64),\n}\n``````\n\nFirst we've imported the `Add` trait which we'll get to later, but it will let\nus add units together using `+` when we implement it! We've also imported `fmt`\nsince we'll be handrolling an implementation of `Display` for the `Temperature`\nenum we've created. We'll be able to allow people to print out units with the\ncorrect number and unit tacked on at the end! The meat of this bit is this\n`Temperature` type. We imported all of it's variants into the file (the\n`use Temperature::*;`)so we don't have to keep saying `Temperature::Kelvin` or\n`Temperature::Celsius`.As you can see we have three different unit types, all\nwith an `f64` value as an internal field. We've also derived `Debug` for debug\nprinting, `PartialEq` to compare values, `Clone` and `Copy`. Because `f64` is a\n`Copy` the compiler will let the enum act as a `Copy` type which is nice for\nmath and dealing with ownership in Rust. You might be wondering why we couldn't\nget `Eq` to auto derive here. `f64` does not have it implemented for it at all\nsince it is a floating point type. Floating points are tricky to test for\nequality so you can only really get a \"close enough\" kind of answer.\n\nAlright we have our type and imports lets start implementing some traits. Let's\nstart off with the `Display` trait so that we can print out the type with the\nright unit attached to it:\n\n``````impl fmt::Display for Temperature {\nfn fmt(&self, fmtr: &mut fmt::Formatter) -> fmt::Result {\nmatch *self {\nKelvin(k) => write!(fmtr, \"{}K\", k),\nCelsius(c) => write!(fmtr, \"{}°C\", c),\nFahrenheit(f) => write!(fmtr, \"{}°F\", f),\n}\n}\n}\n``````\n\nOur `Display` implementation is fairly simple. First we match on `*self` (it\njust means we don't have to put an `&` in front of each field as we're\ndereferencing it), and write out the inner value with the correct unit tacked on\nat the end! We couldn't do this in our old implementation because you can't\nimplement it for types outside your own library. Neat we got some small benefits\njust by switching to an `enum` like this.\n\nAlright let's actually implement a few functions for the `Temperature` enum\nitself:\n\n``````impl Temperature {\n/// Convert whatever `Temperature` unit there is into `Celsius`\npub fn to_celsius(self) -> Temperature {\nmatch self {\nKelvin(k) => Celsius(k - 273.15),\nc @ Celsius(_) => c,\nFahrenheit(f) => Celsius( (f-32.0) * (5.0/9.0) ),\n}\n}\n\n/// Convert whatever `Temperature` unit there is into `Fahrenheit`\npub fn to_fahrenheit(self) -> Temperature {\nmatch self {\nKelvin(k) => Fahrenheit( (k * (9.0/5.0)) - 459.67 ),\nCelsius(c) => Fahrenheit( (c * (9.0/5.0)) + 32.0 ),\nf @ Fahrenheit(_) => f,\n}\n}\n\n/// Convert whatever `Temperature` unit there is into `Kelvin`\npub fn to_kelvin(self) -> Temperature {\nmatch self {\nk @ Kelvin(_) => k,\nCelsius(c) => Kelvin(c + 273.15),\nFahrenheit(f) => Kelvin( (f + 459.67) * (5.0/9.0) ),\n}\n}\n}\n``````\n\nRemember how we had six different methods for temperature conversion and it was\nprone to converting units from the wrong type into the wrong number for the\nreturn type? No more! We can now convert all of the temperatures into the right\ntype and if we try to convert `Kelvin` to `Kelvin` then there's no problem!\nIt'll just return the type as is. If you've never seen the `@` symbol used\nbefore it just means that the value of the whole pattern to the right of it is\nassigned to the identifier to the left. For instance if I called the code:\n\n``````let x = Kelvin(100.0).to_kelvin();\n``````\n\nThen in the method `to_kelvin` `k` becomes the value `Kelvin(100.0)`.\nIt is not always needed but in this case it helped make our code a bit cleaner.\nAwesome! We now have no fear temperature conversion. What if we wanted to add\n32°F to 100K though? As it stands we could do the conversion, then take the\nvalues out then add them together but that's a bit of a pain for an end user.\nWhy not make it easy for them and make sure that when adding units together it\nturns out correctly?\n\n``````impl Add for Temperature {\n\ntype Output = Temperature;\n\n/// Add the Temperature units together with automatic conversion.\n/// The RHS will be converted into the unit on the left.\nfn add(self, rhs: Temperature) -> Self::Output {\nmatch (self, rhs) {\n(Celsius(a), b @ _) => {\nmatch b.to_celsius() {\nCelsius(b) => Celsius(a + b),\n_ => unreachable!(),\n}\n},\n(Fahrenheit(a), b @ _) => {\nmatch b.to_fahrenheit() {\nFahrenheit(b) => Fahrenheit(a + b),\n_ => unreachable!(),\n}\n},\n(Kelvin(a), b @ _) => {\nmatch b.to_kelvin() {\nKelvin(b) => Kelvin(a + b),\n_ => unreachable!(),\n}\n},\n}\n}\n}\n``````\n\nThere's a lot to digest here so let's start with that `type` that shows up at\nthe beginning. The `type Output = Temperature` is known as an Associated Type in\nRust. You can read more about it in the book\nhere. In\nthis case we refer to it as the return type for `add` using `Self::Output`.\n\nAfter that is our function `add` which the compiler uses. When we do something\nlike `1 + 2` in Rust this is syntactic sugar for `add(1,2)`. That's why we need\nto define the `add` function for the `Temperature` `enum`. It is what allows us\nto use that syntactic sugar! `self` refers to our left hand side value and `rhs`\nis the right hand side value of the operation. We've wrapped it in a tuple\n`(self, rhs)` and we're pattern matching against it. This makes makes sure that\nwe have have to match against every possible permutation of units on the left\nand right side! Weird but there's only 3 statements in the match statement\nright?\n\nHere's the cool thing, because of how we implemented our conversion function we\ncan just call the function that converts the unit on the right to the unit on\nthe left and assume the value we get back is the right unit type. We then take\nthe converted (or not!) values inner number and add it to the value from the\nunit on the left and return the proper unit. Since we know what value `b` will\nbe for the inner `match` statements we can just say any other value of\n`Temperature` is unreachable. If it does get reached for whatever reason we\neither have an implementation bug (more likely) or a compiler bug (less likely).\n\nNow we can do things like:\n\n``````let x = Kelvin(100.0) + Fahrenheit(32.0);\n``````\n\nand Rust will handle not only the conversions but make sure the proper functions\nare used to do it. No more problems for the end user! Let's write some tests\nthough. We need to make sure it works:\n\n``````#[test]\nlet k1 = Kelvin(0.0);\nlet k2 = Kelvin(100.0);\n\nlet c1 = Celsius(0.0);\nlet c2 = Celsius(100.0);\n\nlet f1 = Fahrenheit(0.0);\nlet f2 = Fahrenheit(100.0);\n\n// Added to itself it should be the same unit\nassert_eq!(Kelvin(100.0), k1 + k2);\nassert_eq!(Celsius(100.0), c1 + c2);\nassert_eq!(Fahrenheit(100.0), f1 + f2);\n\n// Added to another unit it should be the conversion of the right\n// into the unit on the left added together. Remember we are using\n// floating point so there will be some margin of error for fractions\n// that occur\nassert_eq!(Kelvin(273.15), k1 + c1);\nassert_eq!(Kelvin(255.3722222222222223), k1 + f1);\nassert_eq!(Celsius(-273.15), c1 + k1);\nassert_eq!(Celsius(-17.77777777777778), c1 + f1);\nassert_eq!(Fahrenheit(32.0), f1 + c1);\nassert_eq!(Fahrenheit(-459.67), f1 + k1);\n\n// Testing multiple unit types added together\nassert_eq!(Fahrenheit(-427.67), f1 + k1 + c1);\nassert_eq!(Celsius(-290.92777777777775), c1 + k1 + f1);\nassert_eq!(Kelvin(528.5222222222222), k1 + f1 + c1);\n}\n\n#[test]\nfn format_test() {\nassert_eq!(format!(\"{}\", Kelvin(528.0)), \"528K\".to_owned());\nassert_eq!(format!(\"{}\", Celsius(100.0)), \"100°C\".to_owned());\nassert_eq!(format!(\"{}\", Fahrenheit(32.0)), \"32°F\".to_owned());\n}\n\n``````\n\nNow we can run the tests and you'll see that it all works! Remember when we\nderived `Copy` earlier? We needed it for something like this. Now we only need\nto define the unit once and every time we use it the value is copied over.\nWithout the copy we would have had to define each variable above multiple times.\nNot really ergonomic or fun in this case.\n\nIt works and that's pretty cool right? We could easily extend this code to work\nwith things like multiplying, the `+=` operator, or other things that we might\nwant to do. Here's all of the code put together and not split up:\n\n``````use std::ops::Add;\nuse std::fmt;\nuse Temperature::*;\n\n#[derive(Debug, PartialEq, Copy, Clone)]\n/// An enum representing the different units of Temperature\npub enum Temperature {\nKelvin(f64),\nCelsius(f64),\nFahrenheit(f64),\n}\n\nimpl fmt::Display for Temperature {\nfn fmt(&self, fmtr: &mut fmt::Formatter) -> fmt::Result {\nmatch *self {\nKelvin(k) => write!(fmtr, \"{}K\", k),\nCelsius(c) => write!(fmtr, \"{}°C\", c),\nFahrenheit(f) => write!(fmtr, \"{}°F\", f),\n}\n}\n}\n\nimpl Temperature {\n/// Convert whatever Temperature unit there is into Celsius\npub fn to_celsius(self) -> Temperature {\nmatch self {\nKelvin(k) => Celsius(k - 273.15),\nc @ Celsius(_) => c,\nFahrenheit(f) => Celsius( (f-32.0) * (5.0/9.0) ),\n}\n}\n\n/// Convert whatever Temperature unit there is into Fahrenheit\npub fn to_fahrenheit(self) -> Temperature {\nmatch self {\nKelvin(k) => Fahrenheit( (k * (9.0/5.0)) - 459.67 ),\nCelsius(c) => Fahrenheit( (c * (9.0/5.0)) + 32.0 ),\nf @ Fahrenheit(_) => f,\n}\n}\n\n/// Convert whatever Temperature unit there is into Kelvin\npub fn to_kelvin(self) -> Temperature {\nmatch self {\nk @ Kelvin(_) => k,\nCelsius(c) => Kelvin(c + 273.15),\nFahrenheit(f) => Kelvin( (f + 459.67) * (5.0/9.0) ),\n}\n}\n}\n\nimpl Add for Temperature {\n\ntype Output = Temperature;\n\n/// Add the Temperature units together with automatic conversion.\n/// The RHS will be converted into the unit on the left.\nfn add(self, rhs: Temperature) -> Self::Output {\nmatch (self, rhs) {\n(Celsius(a), b @ _) => {\nmatch b.to_celsius() {\nCelsius(b) => Celsius(a + b),\n_ => unreachable!(),\n}\n},\n(Fahrenheit(a), b @ _) => {\nmatch b.to_fahrenheit() {\nFahrenheit(b) => Fahrenheit(a + b),\n_ => unreachable!(),\n}\n},\n(Kelvin(a), b @ _) => {\nmatch b.to_kelvin() {\nKelvin(b) => Kelvin(a + b),\n_ => unreachable!(),\n}\n},\n}\n}\n}\n\n#[test]\nlet k1 = Kelvin(0.0);\nlet k2 = Kelvin(100.0);\n\nlet c1 = Celsius(0.0);\nlet c2 = Celsius(100.0);\n\nlet f1 = Fahrenheit(0.0);\nlet f2 = Fahrenheit(100.0);\n\n// Added to itself it should be the same unit\nassert_eq!(Kelvin(100.0), k1 + k2);\nassert_eq!(Celsius(100.0), c1 + c2);\nassert_eq!(Fahrenheit(100.0), f1 + f2);\n\n// Added to another unit it should be the conversion of the right\n// into the unit on the left added together. Remember we are using\n// floating point so there will be some margin of error for fractions\n// that occur\nassert_eq!(Kelvin(273.15), k1 + c1);\nassert_eq!(Kelvin(255.3722222222222223), k1 + f1);\nassert_eq!(Celsius(-273.15), c1 + k1);\nassert_eq!(Celsius(-17.77777777777778), c1 + f1);\nassert_eq!(Fahrenheit(32.0), f1 + c1);\nassert_eq!(Fahrenheit(-459.67), f1 + k1);\n\n// Testing multiple unit types added together\nassert_eq!(Fahrenheit(-427.67), f1 + k1 + c1);\nassert_eq!(Celsius(-290.92777777777775), c1 + k1 + f1);\nassert_eq!(Kelvin(528.5222222222222), k1 + f1 + c1);\n}\n\n#[test]\nfn format_test() {\nassert_eq!(format!(\"{}\", Kelvin(528.0)), \"528K\".to_owned());\nassert_eq!(format!(\"{}\", Celsius(100.0)), \"100°C\".to_owned());\nassert_eq!(format!(\"{}\", Fahrenheit(32.0)), \"32°F\".to_owned());\n}\n``````\n\n## Can we make this stricter?\n\nYou could make this more strict by making each field in the enum an individual\ntype using something like this:\n\n``````pub struct Celsius(f64);\npub struct Fahrenheit(f64);\npub struct Kelvin(f64);\n``````\n\nand then implementing how each one works with each other. This method allows\nyou to be a bit more strict about what can be taken as inputs for functions. For\ninstance you could make a function that calculates the volume of gas using the\nIdeal Gas Law and having `Celsius` be the only input. If we used `Temperature`\nlike we had previously defined then we'd have to cast it to `Celsius` first\ninside our function then get the value out of it to calculate the volume.\nForgetting to do the cast would mean our function only works for 1/3 of the\ninput. It is an example of the type system failing to enforce the logic. Like it\nwas stated earlier, types can be used to help enforce logic but it is not\nflawless. If it was just the `Celsius` `struct` from above though then\ncompilation would fail if we tried to put in a `Kelvin` or `Fahrenheit` value.\n\nWhether using `enums`, `structs`, or both they have their own overheads. Enums\nare a bit more flexible, but might need a few checks every now and then to make\nsure things work. Structs are a bit more rigid, but you'll probably have to\nwrite more implementations to have different unit types work together. Really it\ncomes down to your needs and how you structure your API. Regardless of which\nyou choose you should be using types to enforce logic where you can.\n\n## Conclusion\n\nI hope you got a good idea of how you can use types to not only make your code\neasier to use but also prevent logic bugs from creeping in. I can tell you from\npersonal experience this works. I've used these techniques in a much larger\nHaskell code base to do conversions of different currency types for historical\nfinancial data. Dealing with units like `USD/Share` and `Yen` and then working\nout how to multiply and divide them properly all leveraged the techniques\nI showed above. If we hadn't done any of that I'm almost positive logic\nbugs would have crept into the program with some values being incorrect as\na result.\n\nIf you find yourself using things like `&str` or `i32` to represent values\nconsider wrapping them in an `enum` or `struct` to better represent what you're\ntrying do and make it easier to work with. I guarantee you that it will make\nyour library or program more robust. That being said no implementation is\nperfect and no program will be free of logic bugs, but you can make it much\nharder for them to appear.\n\nIf you want an example of a more fully featured unit based library I'd recommend\ntaking a look at paholg's dimensioned\nlibrary\n. It is a really impressive\ncode base and does all the unit type checking at compile time! I've also pushed\nall the code from this blog post to GitHub and you can find that\nhere if you want to fork it or work\nwith it at all."
] |
[
null
] |
{"ft_lang_label":"__label__en","ft_lang_prob":0.77321523,"math_prob":0.96512514,"size":16482,"snap":"2019-13-2019-22","text_gpt3_token_len":4406,"char_repetition_ratio":0.15086782,"word_repetition_ratio":0.28992194,"special_character_ratio":0.30463535,"punctuation_ratio":0.15653996,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9878063,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2019-03-25T14:09:12Z\",\"WARC-Record-ID\":\"<urn:uuid:ad29ac42-f507-4546-939c-6629e0b7da2d>\",\"Content-Length\":\"36502\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:4da85d9f-ede5-4843-99dc-7830a19c8483>\",\"WARC-Concurrent-To\":\"<urn:uuid:b408049f-dc75-4115-9166-c683d4fcee88>\",\"WARC-IP-Address\":\"198.199.76.6\",\"WARC-Target-URI\":\"http://mgattozzi.com/avoiding-logic-errors/\",\"WARC-Payload-Digest\":\"sha1:RPHFJKJCHHPTLY4CQDDWL4AQAOELLM2T\",\"WARC-Block-Digest\":\"sha1:6OYSBFWY3S2X2QQPLORX6L3X7BP46PIQ\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2019/CC-MAIN-2019-13/CC-MAIN-2019-13_segments_1552912203991.44_warc_CC-MAIN-20190325133117-20190325155117-00321.warc.gz\"}"}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.